Class RedBlackTree<TKey, TValue>

Red-black tree specialized for key-based value retrieval.

Inheritance

System.Object

BinaryTree<RedBlackTreeNode<KeyValuePair<TKey, TValue>>>

RedBlackTree<KeyValuePair<TKey, TValue>>

RedBlackTree<TKey, TValue>

Implements

ICollection<RedBlackTreeNode<KeyValuePair<TKey, TValue>>>

ICollection<KeyValuePair<TKey, TValue>>

Inherited Members

RedBlackTree<KeyValuePair<TKey, TValue>>.Count

RedBlackTree<KeyValuePair<TKey, TValue>>.Comparer

RedBlackTree<KeyValuePair<TKey, TValue>>.Clear()

RedBlackTree<KeyValuePair<TKey, TValue>>.Add(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Add(RedBlackTreeNode<KeyValuePair<TKey, TValue>>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Remove(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Remove(RedBlackTreeNode<KeyValuePair<TKey, TValue>>)

RedBlackTree<KeyValuePair<TKey, TValue>>.CopyTo(RedBlackTreeNode<KeyValuePair<TKey, TValue>>[], Int32)

RedBlackTree<KeyValuePair<TKey, TValue>>.CopyTo(KeyValuePair<TKey, TValue>[], Int32)

RedBlackTree<KeyValuePair<TKey, TValue>>.IsReadOnly

RedBlackTree<KeyValuePair<TKey, TValue>>.GetEnumerator()

RedBlackTree<KeyValuePair<TKey, TValue>>.Contains(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Contains(RedBlackTreeNode<KeyValuePair<TKey, TValue>>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Find(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.FindLessThanOrEqualTo(RedBlackTreeNode<KeyValuePair<TKey, TValue>>, KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.FindLessThanOrEqualTo(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.FindLessThan(RedBlackTreeNode<KeyValuePair<TKey, TValue>>, KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.FindLessThan(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.FindGreaterThan(RedBlackTreeNode<KeyValuePair<TKey, TValue>>, KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.FindGreaterThan(KeyValuePair<TKey, TValue>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Min()

RedBlackTree<KeyValuePair<TKey, TValue>>.Max()

RedBlackTree<KeyValuePair<TKey, TValue>>.GetNextNode(RedBlackTreeNode<KeyValuePair<TKey, TValue>>)

RedBlackTree<KeyValuePair<TKey, TValue>>.GetPreviousNode(RedBlackTreeNode<KeyValuePair<TKey, TValue>>)

RedBlackTree<KeyValuePair<TKey, TValue>>.Resort(RedBlackTreeNode<KeyValuePair<TKey, TValue>>)

BinaryTree<RedBlackTreeNode<KeyValuePair<TKey, TValue>>>.Root

BinaryTree<RedBlackTreeNode<KeyValuePair<TKey, TValue>>>.GetEnumerator()

BinaryTree<RedBlackTreeNode<KeyValuePair<TKey, TValue>>>.Traverse(BinaryTraversalMethod<RedBlackTreeNode<KeyValuePair<TKey, TValue>>>)

Namespace: ISynergy.Framework.Core.Collections

Assembly: ISynergy.Framework.Core.dll

Syntax

public class RedBlackTree<TKey, TValue> : RedBlackTree<KeyValuePair<TKey, TValue>>

Type Parameters

Name	Description
TKey	The type of the key.
TValue	The type of the value.

Remarks

See RedBlackTree<T>.

Constructors

RedBlackTree()

Constructs a new RedBlackTree<T> using the default for the key type TKey.

Declaration

public RedBlackTree()

RedBlackTree(IComparer<KeyValuePair<TKey, TValue>>)

Constructs a new RedBlackTree<T> using the provided implementation.

Declaration

public RedBlackTree(IComparer<KeyValuePair<TKey, TValue>> comparer)

Parameters

Type	Name	Description
IComparer<KeyValuePair<TKey, TValue>>	comparer	The element comparer to be used to order elements in the tree.

RedBlackTree(IComparer<KeyValuePair<TKey, TValue>>, Boolean)

Constructs a new RedBlackTree<T> using the provided implementation.

Declaration

public RedBlackTree(IComparer<KeyValuePair<TKey, TValue>> comparer, bool allowDuplicates)

Parameters

Type	Name	Description
IComparer<KeyValuePair<TKey, TValue>>	comparer	The element comparer to be used to order elements in the tree.
System.Boolean	allowDuplicates	Pass true to allow duplicate elements in the tree; false otherwise.

RedBlackTree(Boolean)

Constructs a new RedBlackTree<T> using the default for the key type TKey.

Declaration

public RedBlackTree(bool allowDuplicates)

Parameters

Type	Name	Description
System.Boolean	allowDuplicates	Pass true to allow duplicate elements in the tree; false otherwise.

Implements

ICollection<>

ICollection<>

Extension Methods

Matrix.Replace<T>(T, Object, Object)

Matrix.IsEqual(Object, Object, Decimal, Decimal)

EntityBaseExtensions.HasProperty(Object, String)

ArrayExtensions.Concatenate<T>(T, T[])

CollectionExtensions.FromHierarchy<TSource>(TSource, Func<TSource, TSource>, Func<TSource, Boolean>)

CollectionExtensions.FromHierarchy<TSource>(TSource, Func<TSource, TSource>)

ObjectExtensions.Clone<T>(T)

ObjectExtensions.To<T>(Object)

ObjectExtensions.To(Object, Type)

ObjectExtensions.HasMethod(Object, String)

ObjectExtensions.AddressOf<T>(T)

ReflectionExtensions.GetIdentityValue<T>(T)

ReflectionExtensions.GetIdentityValue<T, TResult>(T)

ReflectionExtensions.GetIdentityProperty<T>(T)

ReflectionExtensions.HasIdentityProperty<T>(T)

ReflectionExtensions.GetPropertyValue<T, TResult>(T, String, TResult)

ReflectionExtensions.GetPropertyInfo<T, TValue>(T, Expression<Func<T, TValue>>)

ReflectionExtensions.GetTitleValue<T>(T)

ReflectionExtensions.HasParentIdentityProperty<T>(T)

ReflectionExtensions.GetParentIdentityProperty<T>(T)

ReflectionExtensions.IsFreeApplication<T>(T)