This repository has been archived by the owner on Dec 20, 2020. It is now read-only.
/
PrioritizedList.cs
375 lines (324 loc) · 11.9 KB
/
PrioritizedList.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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
using System;
using System.Collections;
using System.Collections.Generic;
namespace Archon.SwissArmyLib.Collections
{
/// <summary>
/// Represents an item and its priority.
/// </summary>
/// <typeparam name="T">The type of the item.</typeparam>
public struct PrioritizedItem<T> : IEquatable<PrioritizedItem<T>>
{
/// <summary>
/// The item that is prioritized.
/// </summary>
public readonly T Item;
/// <summary>
/// The priority of the item.
/// </summary>
public readonly int Priority;
/// <summary>
/// Creates a new prioritized item.
/// </summary>
public PrioritizedItem(T item, int priority)
{
Item = item;
Priority = priority;
}
/// <inheritdoc />
public bool Equals(PrioritizedItem<T> other)
{
if (default(T) == null)
return ReferenceEquals(Item, other.Item);
return EqualityComparer<T>.Default.Equals(Item, other.Item);
}
/// <inheritdoc />
public override bool Equals(object obj)
{
if (ReferenceEquals(null, obj)) return false;
return obj is PrioritizedItem<T> && Equals((PrioritizedItem<T>) obj);
}
/// <inheritdoc />
public override int GetHashCode()
{
return EqualityComparer<T>.Default.GetHashCode(Item);
}
public static bool operator ==(PrioritizedItem<T> left, PrioritizedItem<T> right)
{
return left.Equals(right);
}
public static bool operator !=(PrioritizedItem<T> left, PrioritizedItem<T> right)
{
return !left.Equals(right);
}
}
/// <summary>
/// Specifies the direction of a sort operation.
/// </summary>
public enum ListSortDirection
{
/// <summary>
/// Sorts in ascending order.
/// </summary>
Ascending,
/// <summary>
/// Sorts in descending order.
/// </summary>
Descending,
}
/// <summary>
/// A list of items sorted by their priority.
/// </summary>
/// <typeparam name="T">The type of the prioritized items.</typeparam>
public class PrioritizedList<T> : IList<PrioritizedItem<T>>
{
/// <summary>
/// Gets the sorting direction used for prioritized items in this list.
///
/// <b>Ascending</b>: Lower priorities are placed first.
/// <b>Descending</b>: Lower priorities are placed last.
/// </summary>
public readonly ListSortDirection SortDirection;
private readonly List<PrioritizedItem<T>> _items;
/// <summary>
/// Gets the amount of items in the list.
/// </summary>
public int Count { get { return _items.Count; }}
bool ICollection<PrioritizedItem<T>>.IsReadOnly { get { return false; } }
/// <summary>
/// Gets the item at the specified index.
/// </summary>
/// <param name="index">The index for the item to retrieve.</param>
/// <returns>The item at the specified index.</returns>
public PrioritizedItem<T> this[int index]
{
get { return _items[index]; }
}
PrioritizedItem<T> IList<PrioritizedItem<T>>.this[int index]
{
get { return _items[index]; }
set
{
throw new NotImplementedException("Setting a specific index is not supported.");
}
}
/// <summary>
/// Creates a new PrioritizedList with the specified sort direction.
/// </summary>
/// <param name="sortDirection">Whether items with lower priorities are placed first in the list (ascending) or last (descending).</param>
public PrioritizedList(ListSortDirection sortDirection = ListSortDirection.Ascending)
{
SortDirection = sortDirection;
_items = new List<PrioritizedItem<T>>();
}
/// <summary>
/// Creates a new PrioritizedList with the specified sort direction and initial capacity.
/// </summary>
/// <param name="capacity">The number of elements that the new list can initially store.</param>
/// <param name="sortDirection">Whether items with lower priorities are placed first in the list (ascending) or last (descending).</param>
public PrioritizedList(int capacity, ListSortDirection sortDirection = ListSortDirection.Ascending)
{
SortDirection = sortDirection;
_items = new List<PrioritizedItem<T>>(capacity);
}
/// <summary>
/// Adds a prioritized item to the list.
/// </summary>
/// <param name="item">The prioritized item to add.</param>
public void Add(PrioritizedItem<T> item)
{
var itemCount = _items.Count;
if (itemCount == 0)
{
_items.Add(item);
return;
}
var lastItemPriority = _items[itemCount - 1].Priority;
if (SortDirection == ListSortDirection.Ascending && item.Priority >= lastItemPriority
|| SortDirection == ListSortDirection.Descending && item.Priority <= lastItemPriority)
{
_items.Add(item);
return;
}
for (var i = 0; i < itemCount; i++)
{
if (SortDirection == ListSortDirection.Ascending && item.Priority < _items[i].Priority
|| SortDirection == ListSortDirection.Descending && item.Priority > _items[i].Priority)
{
_items.Insert(i, item);
return;
}
}
}
/// <summary>
/// Adds an item to the list with priority 0.
/// </summary>
/// <param name="item">The item to add.</param>
public void Add(T item)
{
Add(item, 0);
}
/// <summary>
/// Adds an item to the list with the specified priority.
/// </summary>
/// <param name="item">The item to add.</param>
/// <param name="priority">The priority to give the item.</param>
public void Add(T item, int priority)
{
var prioritizedItem = new PrioritizedItem<T>(item, priority);
Add(prioritizedItem);
}
/// <summary>
/// Removes a prioritized item from the list.
/// </summary>
/// <param name="item">The item to remove.</param>
/// <returns>True if found and removed, false otherwise.</returns>
public bool Remove(PrioritizedItem<T> item)
{
var comparer = EqualityComparer<PrioritizedItem<T>>.Default;
var itemCount = _items.Count;
for (var i = 0; i < itemCount; i++)
{
if (comparer.Equals(item, _items[i]))
{
_items.RemoveAt(i);
return true;
}
}
return false;
}
/// <summary>
/// Removes an item from the list.
/// </summary>
/// <param name="item">The item to remove.</param>
/// <returns>True if found and removed, false otherwise.</returns>
public bool Remove(T item)
{
var comparer = EqualityComparer<T>.Default;
var itemCount = _items.Count;
for (var i = 0; i < itemCount; i++)
{
if (comparer.Equals(item, _items[i].Item))
{
_items.RemoveAt(i);
return true;
}
}
return false;
}
/// <summary>
/// Removes the item found at the specified index.
/// </summary>
/// <param name="index">The index of the item to remove.</param>
public void RemoveAt(int index)
{
_items.RemoveAt(index);
}
/// <summary>
/// Clears all items from the list.
/// </summary>
public void Clear()
{
_items.Clear();
}
/// <summary>
/// Checks whether the list contains the specified prioritized item.
/// </summary>
/// <param name="item">The item to check if the list contains.</param>
/// <returns>True if found, false otherwise.</returns>
public bool Contains(PrioritizedItem<T> item)
{
var comparer = EqualityComparer<PrioritizedItem<T>>.Default;
var itemCount = _items.Count;
for (var i = 0; i < itemCount; i++)
{
if (comparer.Equals(item, _items[i]))
return true;
}
return false;
}
/// <summary>
/// Checks whether the list contains the specified item.
/// </summary>
/// <param name="item">The item to check if the list contains.</param>
/// <returns>True if found, false otherwise.</returns>
public bool Contains(T item)
{
var comparer = EqualityComparer<T>.Default;
var itemCount = _items.Count;
for (var i = 0; i < itemCount; i++)
{
if (comparer.Equals(item, _items[i].Item))
return true;
}
return false;
}
/// <summary>
/// Copies the list prioritized items to an array starting at the specified index.
/// </summary>
/// <param name="array">The array to copy to.</param>
/// <param name="arrayIndex">The index to start at.</param>
public void CopyTo(PrioritizedItem<T>[] array, int arrayIndex)
{
_items.CopyTo(array, arrayIndex);
}
/// <summary>
/// Copies the list items to an array starting at the specified index.
/// </summary>
/// <param name="array">The array to copy to.</param>
/// <param name="arrayIndex">The index to start at.</param>
public void CopyTo(T[] array, int arrayIndex)
{
var arrayLength = array.Length;
var itemCount = _items.Count;
for (var i = arrayIndex; i < arrayLength && i < itemCount; i++)
array[i] = _items[i].Item;
}
/// <summary>
/// Gets the index of a prioritized item in the list.
/// </summary>
/// <param name="item">The item to get the index for.</param>
/// <returns>The index of the item in the list or -1 if not found.</returns>
public int IndexOf(PrioritizedItem<T> item)
{
var comparer = EqualityComparer<PrioritizedItem<T>>.Default;
for (var i = 0; i < _items.Count; i++)
{
if (comparer.Equals(item, _items[i]))
return i;
}
return -1;
}
/// <summary>
/// Gets the index of a item in the list.
/// </summary>
/// <param name="item">The item to get the index for.</param>
/// <returns>The index of the item in the list or -1 if not found.</returns>
public int IndexOf(T item)
{
var comparer = EqualityComparer<T>.Default;
for (var i = 0; i < _items.Count; i++)
{
if (comparer.Equals(item, _items[i].Item))
return i;
}
return -1;
}
void IList<PrioritizedItem<T>>.Insert(int index, PrioritizedItem<T> item)
{
throw new NotImplementedException("Inserting at a specific index is not supported.");
}
/// <summary>
/// Gets an enumerator for the list items.
/// </summary>
/// <returns>The enumerator.</returns>
public IEnumerator<PrioritizedItem<T>> GetEnumerator()
{
return _items.GetEnumerator();
}
IEnumerator IEnumerable.GetEnumerator()
{
return GetEnumerator();
}
}
}