SkipList<TKey,TValue> class
Implementation for a Skip List.
public class SkipList<TKey, TValue> : ICloneable, IDictionary<TKey, TValue>
where TKey : IComparable<TKey>
Public Members
name | description |
---|---|
SkipList() | Default Constructor. |
SkipList(…) | SkipList Constructor. |
Count { get; } | Number of items in the SkipList. |
Empty { get; } | Returns true if the list is empty. |
IsReadOnly { get; } | Gets a value indicating whether the Skip List is read-only. |
Item { get; set; } | Indexer for the Skip List. |
Keys { get; } | Gets an ICollection containing the keys of the Skip List. |
Values { get; } | Gets an ICollection containing the values of the Skip List. |
Add(…) | Adds an item to the List. |
virtual Add(…) | Adds an item to the List |
Clear() | Removes all items from the list. |
Clone() | Makes a deep copy of this SkipList. |
Contains(…) | Determines if the value is contained somewhere in the list. |
virtual ContainsKey(…) | Determines whether the list contains the specified key. |
CopyTo(…) | Copies the Skip List elements to a one-dimensional Array instance at the specified index. |
GetEnumerator() | Creates a Enumerator object which can be used to iterate through the SkipList. |
Remove(…) | Removes the node containing this data from the list. |
virtual Remove(…) | Removes an value from the List. |
TryGetValue(…) | Attempts to retrieve the value for the given key. |
Remarks
A SkipList is a sorted linked list where each element contains a list of references to a random number of other elements in the list skipping items throughout to provided faster traversal of the list.
See Also
- namespace TheCodingMonkey.Collections.SkipList