-
Notifications
You must be signed in to change notification settings - Fork 15
/
OrderedSet.cs
193 lines (169 loc) · 4.73 KB
/
OrderedSet.cs
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
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
namespace NMF.Collections.Generic
{
/// <summary>
/// Denotes an implementation of an ordered set
/// </summary>
/// <typeparam name="T"></typeparam>
[DebuggerDisplay("Count = {Count}"), DebuggerTypeProxy(typeof(EnumerableDebuggerProxy<>))]
public class OrderedSet<T> : DecoratedSet<T>, ISet<T>, IList<T>, ICollection<T>, IEnumerable<T>, IEnumerable, IList, ICollection, IOrderedSet<T>
{
private readonly List<T> itemOrder = new List<T>();
/// <inheritdoc />
public override bool Add(T item)
{
if (Items.Add(item))
{
itemOrder.Add(item);
return true;
}
else
{
return false;
}
}
/// <inheritdoc />
public sealed override bool Remove(T item)
{
return Remove(item, IndexOf(item));
}
/// <summary>
/// Removes the given item at the given index
/// </summary>
/// <param name="item">The item to remove</param>
/// <param name="index">The index of the item</param>
/// <returns>True, if the removal was successful, otherwise false</returns>
protected virtual bool Remove(T item, int index)
{
if (Items.Remove(item))
{
itemOrder.RemoveAt(index);
return true;
}
else
{
return false;
}
}
/// <inheritdoc />
public override void Clear()
{
base.Clear();
itemOrder.Clear();
}
/// <inheritdoc />
public override IEnumerator<T> GetEnumerator()
{
return itemOrder.GetEnumerator();
}
/// <inheritdoc />
public int IndexOf(T item)
{
return itemOrder.IndexOf(item);
}
/// <inheritdoc />
public virtual void Insert(int index, T item)
{
if (Items.Add(item))
{
itemOrder.Insert(index, item);
}
}
/// <inheritdoc />
public void RemoveAt(int index)
{
Remove(itemOrder[index], index);
}
/// <inheritdoc />
public T this[int index]
{
get
{
return itemOrder[index];
}
set
{
var item = itemOrder[index];
if (!EqualityComparer<T>.Default.Equals(item, value))
{
Replace(index, item, value);
}
}
}
/// <summary>
/// Replaces the item at the given index
/// </summary>
/// <param name="index">The index on which the item is replaced</param>
/// <param name="oldValue">The old value</param>
/// <param name="newValue">The new value</param>
protected virtual void Replace(int index, T oldValue, T newValue)
{
itemOrder[index] = newValue;
Items.Remove(oldValue);
Items.Add(newValue);
}
int IList.Add(object value)
{
Add((T)value);
return itemOrder.Count - 1;
}
bool IList.Contains(object value)
{
return Contains((T)value);
}
int IList.IndexOf(object value)
{
return IndexOf((T)value);
}
void IList.Insert(int index, object value)
{
Insert(index, (T)value);
}
bool IList.IsFixedSize
{
get { return false; }
}
void IList.Remove(object value)
{
Remove((T)value);
}
object IList.this[int index]
{
get
{
return this[index];
}
set
{
this[index] = (T)value;
}
}
void ICollection.CopyTo(Array array, int index)
{
((ICollection)itemOrder).CopyTo(array, index);
}
bool ICollection.IsSynchronized
{
get { return ((ICollection)itemOrder).IsSynchronized; }
}
object ICollection.SyncRoot
{
get { return ((ICollection)itemOrder).SyncRoot; }
}
bool IList.IsReadOnly
{
get { return false; }
}
/// <summary>
/// Returns a readonly view of the oredered set
/// </summary>
/// <returns></returns>
public ReadOnlyOrderedSet<T> AsReadOnly()
{
return new ReadOnlyOrderedSet<T>(this);
}
}
}