blob: 1497fdf70f8ee62fb911fcadc75128e205fbd009 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
using System;
using System.Collections;
/*
namespace Qpid.Collections
{
public class LinkedHashtable : DictionaryBase
{
/// <summary>
/// Maps from key to LinkedDictionaryEntry
/// </summary>
private Hashtable _indexedValues = new Hashtable();
private LinkedDictionaryEntry _head;
private LinkedDictionaryEntry _tail;
public class LinkedDictionaryEntry
{
public LinkedDictionaryEntry previous;
public LinkedDictionaryEntry next;
public object key;
public object value;
public LinkedDictionaryEntry(object key, object value)
{
this.key = key;
this.value = value;
}
}
public object this[object index]
{
get
{
return ((LinkedDictionaryEntry)_indexedValues[index]).value;
}
set
{
Dictionary[index] = value;
}
}
protected override void OnInsertComplete(object key, object value)
{
LinkedDictionaryEntry de = new LinkedDictionaryEntry(key, value);
if (_head == null)
{
_head = de;
_tail = de;
}
else
{
_tail.next = de;
de.previous = _tail;
_tail = de;
}
_indexedValues[key] = de;
}
protected override void OnSetComplete(object key, object oldValue, object newValue)
{
if (oldValue == null)
{
OnInsertComplete(key, newValue);
}
}
protected override void OnRemoveComplete(object key, object value)
{
LinkedDictionaryEntry de = (LinkedDictionaryEntry)_indexedValues[key];
LinkedDictionaryEntry prev = de.previous;
if (prev == null)
{
_head = de.next;
}
else
{
prev.next = de.next;
}
LinkedDictionaryEntry next = de.next;
if (next == null)
{
_tail = de;
}
else
{
next.previous = de.previous;
}
}
public ICollection Values
{
get
{
return InnerHashtable.Values;
}
}
public bool Contains(object key)
{
return InnerHashtable.Contains(key);
}
public void Remove(object key)
{
Dictionary.Remove(key);
}
public LinkedDictionaryEntry Head
{
get
{
return _head;
}
}
public LinkedDictionaryEntry Tail
{
get
{
return _tail;
}
}
private class LHTEnumerator : IEnumerator
{
private LinkedHashtable _container;
private LinkedDictionaryEntry _current;
/// <summary>
/// Set once we have navigated off the end of the collection
/// </summary>
private bool _needsReset = false;
public LHTEnumerator(LinkedHashtable container)
{
_container = container;
}
public object Current
{
get
{
if (_current == null)
{
throw new Exception("Iterator before first element");
}
else
{
return _current;
}
}
}
public bool MoveNext()
{
if (_needsReset)
{
return false;
}
else if (_current == null)
{
_current = _container.Head;
}
else
{
_current = _current.next;
}
_needsReset = (_current == null);
return !_needsReset;
}
public void Reset()
{
_current = null;
_needsReset = false;
}
}
public new IEnumerator GetEnumerator()
{
return new LHTEnumerator(this);
}
public void MoveToHead(object key)
{
LinkedDictionaryEntry de = (LinkedDictionaryEntry)_indexedValues[key];
if (de == null)
{
throw new ArgumentException("Key " + key + " not found");
}
// if the head is the element then there is nothing to do
if (_head == de)
{
return;
}
de.previous.next = de.next;
if (de.next != null)
{
de.next.previous = de.previous;
}
else
{
_tail = de.previous;
}
de.next = _head;
_head = de;
de.previous = null;
}
}
}
*/
|
