Namespace Telerik.Collections.Generic

Classes

AvlIndex<T>

AvlTree<ValueT>

AvlTreeNode<ValueT>

HybridIndex<T>

Index<T>

ItemNotifyCollection<T>

ListIndex<T>

NotifyCollection<T>

ObservableHashSet<T> Observable HashSet, that allows only unique items in its collection.

RBMultiTree<T> Non-unique RBMultiTree

RBOrderedMultiTree<T> Non-unique RBMultiTree

RBOrderedTree<T> Unique ordered RBTree

RBOrderedTreeBase<T> Basic RBTree with ordering Operation like Add and Remove are an O(2logN) operations. Operation Find is O(logN) operation.

RBOrderedTreeNode<T> Ordered node

RBTree<T> Unique RBTree

RBTreeBase<T, N, P> Base class for the tree. Based on the Damian Ivereigh implementation Support for the multi-trees has been added. Do not use this class directly. Use RBTree, RBMultiTree, RBOrderedTree and RBOrderedMultiTree classes

RBTreeIndex<T>

RBTreeNode<T> Tree node

RBTreeNodeBase<T, P> Node of the red-black tree

Structs

RBOrderedNodeParam Parameters of ordered node

Interfaces

IAvlEnumerator<ValueT>

IOrderedTree<T> Interface to the tree which supports direct access to the items

ISortedTree<T> Interface to the tree

ITree<T> Interface to the tree

ITreeNode<T> Interface to the node

Enums

RBTreeColor Colour of the node