Class SortedDictionaryBase<K, V>
A base class for implementing a sorted dictionary based on a sorted set collection implementation. See the source code for C5.TreeDictionary`2 for an example
Inheritance
Inherited Members
Assembly: DistributedLucene.Net.dll
Syntax
public abstract class SortedDictionaryBase<K, V> : DictionaryBase<K, V>, ISortedDictionary<K, V>, IDictionary<K, V>, ICollectionValue<KeyValuePair<K, V>>, Collections.Generic.IEnumerable<KeyValuePair<K, V>>, IShowable, IFormattableType Parameters
| Name | Description |
|---|---|
| K | |
| V |
Constructors
| Name | Description |
|---|---|
| SortedDictionaryBase(Collections.Generic.IComparer<K>, Collections.Generic.IEqualityComparer<K>, MemoryType) |
Fields
| Name | Description |
|---|---|
| sortedpairs |
Properties
| Name | Description |
|---|---|
| Comparer | The key comparer used by this dictionary. |
| Keys |
Methods
| Name | Description |
|---|---|
| AddSorted(Collections.Generic.IEnumerable<KeyValuePair<K, V>>) | |
| Cut(IComparable<K>, out KeyValuePair<K, V>, out Boolean, out KeyValuePair<K, V>, out Boolean) | |
| DeleteMax() | |
| DeleteMin() | |
| FindMax() | |
| FindMin() | |
| Predecessor(K) | Get the entry in the dictionary whose key is the predecessor of the specified key. |
| RangeAll() | |
| RangeFrom(K) | |
| RangeFromTo(K, K) | |
| RangeTo(K) | |
| RemoveRangeFrom(K) | |
| RemoveRangeFromTo(K, K) | |
| RemoveRangeTo(K) | |
| Show(Text.StringBuilder, ref Int32, IFormatProvider) | |
| Successor(K) | Get the entry in the dictionary whose key is the successor of the specified key. |
| TryPredecessor(K, out KeyValuePair<K, V>) | Find the entry in the dictionary whose key is the predecessor of the specified key. |
| TrySuccessor(K, out KeyValuePair<K, V>) | Find the entry in the dictionary whose key is the successor of the specified key. |
| TryWeakPredecessor(K, out KeyValuePair<K, V>) | Find the entry in the dictionary whose key is the weak predecessor of the specified key. |
| TryWeakSuccessor(K, out KeyValuePair<K, V>) | Find the entry in the dictionary whose key is the weak successor of the specified key. |
| WeakPredecessor(K) | Get the entry in the dictionary whose key is the weak predecessor of the specified key. |
| WeakSuccessor(K) | Get the entry in the dictionary whose key is the weak successor of the specified key. |
