Class TreeDictionary<K, V>

A sorted generic dictionary based on a red-black tree set.

Inheritance

System.Object

EnumerableBase<KeyValuePair<K, V>>

CollectionValueBase<KeyValuePair<K, V>>

DictionaryBase<K, V>

SortedDictionaryBase<K, V>

TreeDictionary<K, V>

Implements

ISortedDictionary<K, V>

IDictionary<K, V>

ICollectionValue<KeyValuePair<K, V>>

System.Collections.Generic.IEnumerable<KeyValuePair<K, V>>

IShowable

IFormattable

Inherited Members

SortedDictionaryBase<K, V>.sortedpairs

SortedDictionaryBase<K, V>.Comparer

SortedDictionaryBase<K, V>.Keys

SortedDictionaryBase<K, V>.TryPredecessor(K, KeyValuePair<K, V>)

SortedDictionaryBase<K, V>.TrySuccessor(K, KeyValuePair<K, V>)

SortedDictionaryBase<K, V>.TryWeakPredecessor(K, KeyValuePair<K, V>)

SortedDictionaryBase<K, V>.TryWeakSuccessor(K, KeyValuePair<K, V>)

SortedDictionaryBase<K, V>.Predecessor(K)

SortedDictionaryBase<K, V>.Successor(K)

SortedDictionaryBase<K, V>.WeakPredecessor(K)

SortedDictionaryBase<K, V>.WeakSuccessor(K)

SortedDictionaryBase<K, V>.FindMin()

SortedDictionaryBase<K, V>.DeleteMin()

SortedDictionaryBase<K, V>.FindMax()

SortedDictionaryBase<K, V>.DeleteMax()

SortedDictionaryBase<K, V>.Cut(IComparable<K>, KeyValuePair<K, V>, Boolean, KeyValuePair<K, V>, Boolean)

SortedDictionaryBase<K, V>.RangeFrom(K)

SortedDictionaryBase<K, V>.RangeFromTo(K, K)

SortedDictionaryBase<K, V>.RangeTo(K)

SortedDictionaryBase<K, V>.RangeAll()

SortedDictionaryBase<K, V>.AddSorted(System.Collections.Generic.IEnumerable<KeyValuePair<K, V>>)

SortedDictionaryBase<K, V>.RemoveRangeFrom(K)

SortedDictionaryBase<K, V>.RemoveRangeFromTo(K, K)

SortedDictionaryBase<K, V>.RemoveRangeTo(K)

SortedDictionaryBase<K, V>.Show(System.Text.StringBuilder, Int32, IFormatProvider)

DictionaryBase<K, V>.pairs

DictionaryBase<K, V>.CollectionChanged

DictionaryBase<K, V>.CollectionCleared

DictionaryBase<K, V>.ItemsAdded

DictionaryBase<K, V>.ItemsRemoved

DictionaryBase<K, V>.ListenableEvents

DictionaryBase<K, V>.ActiveEvents

DictionaryBase<K, V>.EqualityComparer

DictionaryBase<K, V>.Add(K, V)

DictionaryBase<K, V>.AddAll<L, W>(System.Collections.Generic.IEnumerable<KeyValuePair<L, W>>)

DictionaryBase<K, V>.Remove(K)

DictionaryBase<K, V>.Remove(K, V)

DictionaryBase<K, V>.Clear()

DictionaryBase<K, V>.ContainsSpeed

DictionaryBase<K, V>.Contains(K)

DictionaryBase<K, V>.ContainsAll<H>(System.Collections.Generic.IEnumerable<H>)

DictionaryBase<K, V>.Find(K, V)

DictionaryBase<K, V>.Update(K, V)

DictionaryBase<K, V>.Update(K, V, V)

DictionaryBase<K, V>.FindOrAdd(K, V)

DictionaryBase<K, V>.UpdateOrAdd(K, V)

DictionaryBase<K, V>.UpdateOrAdd(K, V, V)

DictionaryBase<K, V>.Keys

DictionaryBase<K, V>.Values

DictionaryBase<K, V>.Func

DictionaryBase<K, V>.Item[K]

DictionaryBase<K, V>.IsReadOnly

DictionaryBase<K, V>.Check()

DictionaryBase<K, V>.IsEmpty

DictionaryBase<K, V>.Count

DictionaryBase<K, V>.CountSpeed

DictionaryBase<K, V>.Choose()

DictionaryBase<K, V>.GetEnumerator()

DictionaryBase<K, V>.Show(System.Text.StringBuilder, Int32, IFormatProvider)

CollectionValueBase<KeyValuePair<K, V>>.ListenableEvents

CollectionValueBase<KeyValuePair<K, V>>.ActiveEvents

CollectionValueBase<KeyValuePair<K, V>>.CollectionChanged

CollectionValueBase<KeyValuePair<K, V>>.raiseCollectionChanged()

CollectionValueBase<KeyValuePair<K, V>>.CollectionCleared

CollectionValueBase<KeyValuePair<K, V>>.raiseCollectionCleared(Boolean, Int32)

CollectionValueBase<KeyValuePair<K, V>>.raiseCollectionCleared(Boolean, Int32, Nullable<Int32>)

CollectionValueBase<KeyValuePair<K, V>>.ItemsAdded

CollectionValueBase<KeyValuePair<K, V>>.raiseItemsAdded(KeyValuePair<K, V>, Int32)

CollectionValueBase<KeyValuePair<K, V>>.ItemsRemoved

CollectionValueBase<KeyValuePair<K, V>>.raiseItemsRemoved(KeyValuePair<K, V>, Int32)

CollectionValueBase<KeyValuePair<K, V>>.ItemInserted

CollectionValueBase<KeyValuePair<K, V>>.raiseItemInserted(KeyValuePair<K, V>, Int32)

CollectionValueBase<KeyValuePair<K, V>>.ItemRemovedAt

CollectionValueBase<KeyValuePair<K, V>>.raiseItemRemovedAt(KeyValuePair<K, V>, Int32)

CollectionValueBase<KeyValuePair<K, V>>.raiseForSetThis(Int32, KeyValuePair<K, V>, KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.raiseForInsert(Int32, KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.raiseForRemove(KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.raiseForRemove(KeyValuePair<K, V>, Int32)

CollectionValueBase<KeyValuePair<K, V>>.raiseForRemoveAt(Int32, KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.raiseForUpdate(KeyValuePair<K, V>, KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.raiseForUpdate(KeyValuePair<K, V>, KeyValuePair<K, V>, Int32)

CollectionValueBase<KeyValuePair<K, V>>.raiseForAdd(KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.raiseForRemoveAll(ICollectionValue<KeyValuePair<K, V>>)

CollectionValueBase<KeyValuePair<K, V>>.IsEmpty

CollectionValueBase<KeyValuePair<K, V>>.Count

CollectionValueBase<KeyValuePair<K, V>>.CountSpeed

CollectionValueBase<KeyValuePair<K, V>>.CopyTo(KeyValuePair<K, V>[], Int32)

CollectionValueBase<KeyValuePair<K, V>>.ToArray()

CollectionValueBase<KeyValuePair<K, V>>.Apply(Action<KeyValuePair<K, V>>)

CollectionValueBase<KeyValuePair<K, V>>.Exists(Func<KeyValuePair<K, V>, Boolean>)

CollectionValueBase<KeyValuePair<K, V>>.Find(Func<KeyValuePair<K, V>, Boolean>, KeyValuePair<K, V>)

CollectionValueBase<KeyValuePair<K, V>>.All(Func<KeyValuePair<K, V>, Boolean>)

CollectionValueBase<KeyValuePair<K, V>>.Filter(Func<KeyValuePair<K, V>, Boolean>)

CollectionValueBase<KeyValuePair<K, V>>.Choose()

CollectionValueBase<KeyValuePair<K, V>>.Show(System.Text.StringBuilder, Int32, IFormatProvider)

CollectionValueBase<KeyValuePair<K, V>>.ToString(String, IFormatProvider)

CollectionValueBase<KeyValuePair<K, V>>.ToString()

EnumerableBase<KeyValuePair<K, V>>.GetEnumerator()

EnumerableBase<KeyValuePair<K, V>>.countItems(System.Collections.Generic.IEnumerable<KeyValuePair<K, V>>)

Namespace: Lucene.Net.Support.C5

Assembly: Lucene.Net.dll

Syntax

public class TreeDictionary<K, V> : SortedDictionaryBase<K, V>, ISortedDictionary<K, V>, IDictionary<K, V>, ICollectionValue<KeyValuePair<K, V>>, System.Collections.Generic.IEnumerable<KeyValuePair<K, V>>, IShowable, IFormattable

Type Parameters

Name	Description
K
V

Constructors

TreeDictionary(MemoryType)

Create a red-black tree dictionary using the natural comparer for keys. if the key type K is not comparable.

Declaration

public TreeDictionary(MemoryType memoryType = MemoryType.Normal)

Parameters

Type	Name	Description
MemoryType	memoryType

TreeDictionary(System.Collections.Generic.IComparer<K>, MemoryType)

Create a red-black tree dictionary using an external comparer for keys.

Declaration

public TreeDictionary(System.Collections.Generic.IComparer<K> comparer, MemoryType memoryType = MemoryType.Normal)

Parameters

Type	Name	Description
System.Collections.Generic.IComparer<K>	comparer	The external comparer
MemoryType	memoryType

Methods

Snapshot()

Make a snapshot of the current state of this dictionary

Declaration

public System.Collections.Generic.IEnumerable<KeyValuePair<K, V>> Snapshot()

Returns

Type	Description
System.Collections.Generic.IEnumerable<KeyValuePair<K, V>>	The snapshot

Implements

ISortedDictionary<K, V>

IDictionary<K, V>

ICollectionValue<T>

System.Collections.Generic.IEnumerable<>

IShowable

IFormattable