A Linked node version of the Splayed Dictionary that provides consisted enumeration of dictionary entries based on insertion order over natural or comparer based enumeration from the default splayed dictionary implementation.
More...
|
| LinkedSplayedDictionary (IComparer< K > comparer) |
|
| LinkedSplayedDictionary (IDictionary< K, V > source) |
|
override void | CopyTo (KeyValuePair< K, V >[] array, int arrayIndex) |
|
override void | CopyTo (Array array, int arrayIndex) |
|
override void | Clear () |
|
override IEnumerator< KeyValuePair< K, V > > | GetEnumerator () |
|
| SplayedDictionary () |
| Create a new Splayed Dictionary instance that uses a default key comparer instance to provide relative ordering of keys within the mapping. More...
|
|
| SplayedDictionary (IComparer< K > comparer) |
| Create a new Splayed Dictionary instance that uses the give key comparer instance to provide relative ordering of keys within the mapping. More...
|
|
| SplayedDictionary (IDictionary< K, V > source) |
| Create a new Splayed Dictionary instance that uses the give key comparer instance to provide relative ordering of keys within the mapping. More...
|
|
void | Add (K key, V value) |
|
void | Add (KeyValuePair< K, V > item) |
|
void | Add (object key, object value) |
|
bool | Contains (object key) |
|
bool | Contains (KeyValuePair< K, V > item) |
|
bool | ContainsValue (V value) |
|
bool | ContainsKey (K key) |
|
void | Remove (object key) |
|
bool | Remove (K key) |
|
bool | RemoveValue (V target) |
| Removes the first entry from the dictionary that contains the specified value and returns true, if there is no entry with the given value this method returns false. More...
|
|
bool | Remove (KeyValuePair< K, V > item) |
|
bool | TryGetValue (K key, [MaybeNullWhen(false)] out V value) |
|
|
override ICollection< K > | Keys [get] |
|
override ICollection< V > | Values [get] |
|
int | Count [get] |
|
bool | IsReadOnly [get] |
|
IComparer< K > | Comparer [get] |
|
bool | IsFixedSize [get] |
|
bool | IsSynchronized [get] |
|
object | SyncRoot [get] |
|
V | this[K key] [get, set] |
|
object | this[object key] [get, set] |
|
virtual ICollection< K > | Keys [get] |
|
virtual ICollection< V > | Values [get] |
|
|
readonly RingQueue< SplayedEntry > | entryPool = new(64) |
| Pooled entries used to prevent excessive allocations for rapid insert and removal operations. More...
|
|
SplayedEntry | root |
| Root of the tree which can change as entries are splayed up and down the tree More...
|
|
int | size |
| Tracked tree size to prevent traversals for size operations. More...
|
|
int | modCount |
| Provides a means of tracking modification during enumeration errors. More...
|
|
ICollection< K > | keySet |
| Cached collection object that provides access to the dictionary keys More...
|
|
ICollection< V > | values |
| Cached collection object that provides access to the dictionary values More...
|
|
A Linked node version of the Splayed Dictionary that provides consisted enumeration of dictionary entries based on insertion order over natural or comparer based enumeration from the default splayed dictionary implementation.
- Template Parameters
-
T | The type contained in the Queue |
The documentation for this class was generated from the following file:
- src/Proton/Utilities/LinkedSplayedDictionary.cs