UnorderedList
A special case list where remove calls do not preserve item order, but is therefore an O(1) notation
Fields
|
internalArray
|
Exposed for unsafe operations
|
Properties
|
Count
|
|
|
IsReadOnly
|
|
|
Item[int]
|
|
Functions
|
Sort(IComparer comparer) |
|
|
Sort() |
|
|
Clear() |
|
|
ResetCount() |
|
|
Add(T item) |
|
|
Contains(T item) |
|
|
ToArray() |
|
|
CopyTo(T[] array, int arrayIndex) |
|
|
CopyTo(UnorderedList list, int arrayIndex) |
|
|
IndexOf(T item) |
|
|
RemoveAt(int index) |
|
|
RemovePullback(int index) |
|
|
Remove(T item) |
|
|
PopLast() |
|
|
GetEnumerator() |
|
|
Insert(int index, T item) |
|
|
AsReadonlySpan() |
|
|
AsSpan() |
|
|
CopyTo(Array array, int startIndex) |
|