Back to all docs
API Reference / Telerik.Collections.Generic / AvlTree<ValueT>
New to Telerik UI for WinForms? Start a free 30-day trial

AvlTree<ValueT>

Class

Definition

Namespace:Telerik.Collections.Generic

Assembly:Telerik.WinControls.dll

Type Parameters:

ValueT

Syntax:
C#
public sealed class AvlTree<ValueT> : IList, ICollection, IEnumerable, IDisposable

Inheritance: objectAvlTree<ValueT>

Implements: ICollectionIDisposableIEnumerableIList

Constructors

AvlTree()

C#
public AvlTree()

AvlTree(IComparer<ValueT>)

C#
public AvlTree(IComparer<ValueT> comparer)
Parameters:comparerIComparer<ValueT>

Properties

Count

C#
public int Count { get; }

Implements: ICollection.Count

First

ValueT

C#
public ValueT First { get; }

IsEmpty

C#
public bool IsEmpty { get; }

IsReadOnly

C#
public bool IsReadOnly { get; }

Implements: IList.IsReadOnly

IsSynchronized

C#
public bool IsSynchronized { get; }

Implements: ICollection.IsSynchronized

Last

ValueT

C#
public ValueT Last { get; }

Root

AvlTreeNode<ValueT>

C#
public AvlTreeNode<ValueT> Root { get; }

Size

C#
public int Size { get; }

SyncRoot

C#
public object SyncRoot { get; }

Implements: ICollection.SyncRoot

this[int, int]

AvlTree<ValueT>

C#
public AvlTree<ValueT> this[int lo, int hi] { get; }
Parameters:lointhiint

this[int]

ValueT

C#
public ValueT this[int index] { get; set; }
Parameters:indexint

Methods

Add(ValueT)

C#
public void Add(ValueT item)
Parameters:itemValueT

Append(AvlTree<ValueT>)

C#
public AvlTree<ValueT> Append(AvlTree<ValueT> that)
Parameters:thatAvlTree<ValueT>Returns:

AvlTree<ValueT>

Clear()

C#
public void Clear()

Implements: IList.Clear()

Contains(ValueT)

C#
public bool Contains(ValueT value)
Parameters:valueValueTReturns:

bool

Copy()

C#
public AvlTree<ValueT> Copy()
Returns:

AvlTree<ValueT>

CopyTo(Array, int)

C#
public void CopyTo(Array array, int index)
Parameters:arrayArrayindexint

Implements: ICollection.CopyTo(Array, int)

CopyTo(ValueT[], int)

C#
public void CopyTo(ValueT[] array, int arrayIndex)
Parameters:arrayValueT[]arrayIndexint

Delete(ValueT, out ValueT)

C#
public bool Delete(ValueT value, out ValueT delValue)
Parameters:valueValueTdelValueValueTReturns:

bool

DeleteAt(int, out ValueT)

C#
public void DeleteAt(int index, out ValueT delValue)
Parameters:indexintdelValueValueT

DeleteFirst(out ValueT)

C#
public void DeleteFirst(out ValueT delValue)
Parameters:delValueValueT

DeleteLast()

C#
public void DeleteLast()

DeleteLast(out ValueT)

C#
public void DeleteLast(out ValueT delValue)
Parameters:delValueValueT

DeleteRange(int, int)

C#
public void DeleteRange(int lo, int hi)
Parameters:lointhiint

Dispose()

C#
public void Dispose()

Implements: IDisposable.Dispose()

Dump(TextWriter)

C#
public void Dump(TextWriter os)
Parameters:osTextWriter

Find(ValueT)

C#
public ValueT Find(ValueT target)
Parameters:targetValueTReturns:

ValueT

FindAtLeast(ValueT, out ValueT)

C#
public bool FindAtLeast(ValueT target, out ValueT value)
Parameters:targetValueTvalueValueTReturns:

bool

FindAtMost(ValueT, out ValueT)

C#
public bool FindAtMost(ValueT target, out ValueT value)
Parameters:targetValueTvalueValueTReturns:

bool

FindByIndex(int)

C#
public ValueT FindByIndex(int index)
Parameters:indexintReturns:

ValueT

FindNode(ValueT)

C#
public AvlTreeNode<ValueT> FindNode(ValueT target)
Parameters:targetValueTReturns:

AvlTreeNode<ValueT>

ForEach(Action<ValueT>, Predicate<ValueT>)

C#
public void ForEach(Action<ValueT> act, Predicate<ValueT> stopcondition)
Parameters:actAction<ValueT>stopconditionPredicate<ValueT>

ForEach(Action<ValueT>)

C#
public void ForEach(Action<ValueT> act)
Parameters:actAction<ValueT>

ForEachBackwards(Action<ValueT>, Predicate<ValueT>)

C#
public void ForEachBackwards(Action<ValueT> act, Predicate<ValueT> stopcondition)
Parameters:actAction<ValueT>stopconditionPredicate<ValueT>

ForEachBackwards(Action<ValueT>)

C#
public void ForEachBackwards(Action<ValueT> act)
Parameters:actAction<ValueT>

FromList(IList<ValueT>, int, int, IComparer<ValueT>)

C#
public static AvlTree<ValueT> FromList(IList<ValueT> sortedList, int lo, int hi, IComparer<ValueT> comparer)
Parameters:sortedListIList<ValueT>lointhiintcomparerIComparer<ValueT>Returns:

AvlTree<ValueT>

FromList(IList<ValueT>, int, int)

C#
public static AvlTree<ValueT> FromList(IList<ValueT> sortedList, int lo, int hi)
Parameters:sortedListIList<ValueT>lointhiintReturns:

AvlTree<ValueT>

FromList(IList<ValueT>)

C#
public static AvlTree<ValueT> FromList(IList<ValueT> sortedList)
Parameters:sortedListIList<ValueT>Returns:

AvlTree<ValueT>

FromSequence(AvlTree<ValueT>, int, int)

C#
public static AvlTree<ValueT> FromSequence(AvlTree<ValueT> avl, int lo, int hi)
Parameters:avlAvlTree<ValueT>lointhiintReturns:

AvlTree<ValueT>

FromSequence(AvlTree<ValueT>)

C#
public static AvlTree<ValueT> FromSequence(AvlTree<ValueT> avl)
Parameters:avlAvlTree<ValueT>Returns:

AvlTree<ValueT>

FromSequence(IEnumerable<ValueT>, long)

C#
public static AvlTree<ValueT> FromSequence(IEnumerable<ValueT> seq, long len)
Parameters:seqIEnumerable<ValueT>lenlongReturns:

AvlTree<ValueT>

GetAvlEnumerator()

C#
public IAvlEnumerator<ValueT> GetAvlEnumerator()
Returns:

IAvlEnumerator<ValueT>

GetBackwardEnumerator()

C#
public IEnumerator<ValueT> GetBackwardEnumerator()
Returns:

IEnumerator<ValueT>

GetDelta(AvlTreeNode<ValueT>)

C#
public static int GetDelta(AvlTreeNode<ValueT> a)
Parameters:aAvlTreeNode<ValueT>Returns:

int

GetEnumerator()

C#
public IEnumerator<ValueT> GetEnumerator()
Returns:

IEnumerator<ValueT>

GetForwardEnumerator()

C#
public IEnumerator<ValueT> GetForwardEnumerator()
Returns:

IEnumerator<ValueT>

GetForwardEnumerator(int, int)

C#
public IEnumerator<ValueT> GetForwardEnumerator(int lo, int hi)
Parameters:lointhiintReturns:

IEnumerator<ValueT>

Index(ValueT, int, int)

C#
public int Index(ValueT value, int lo, int hi)
Parameters:valueValueTlointhiintReturns:

int

Index(ValueT, int)

C#
public int Index(ValueT value, int lo)
Parameters:valueValueTlointReturns:

int

Index(ValueT)

C#
public int Index(ValueT value)
Parameters:valueValueTReturns:

int

IndexOf(ValueT)

Determines the index of a specific item in the IList<T>.

C#
public int IndexOf(ValueT item)
Parameters:itemValueT

The object to locate in the IList<T>.

Returns:

int

The index of item if found in the list; otherwise, -1.

Insert(int, ValueT)

C#
public void Insert(int index, ValueT value)
Parameters:indexintvalueValueT

Insert(ValueT, bool, bool)

C#
public void Insert(ValueT value, bool duplicateallowed, bool overwrite)
Parameters:valueValueTduplicateallowedbooloverwritebool

InsertFirst(ValueT)

C#
public void InsertFirst(ValueT value)
Parameters:valueValueT

InsertLast(ValueT)

C#
public void InsertLast(ValueT value)
Parameters:valueValueT

InsertUnique(ValueT, bool)

C#
public void InsertUnique(ValueT value, bool overwrite)
Parameters:valueValueToverwritebool

InsertUnique(ValueT)

C#
public void InsertUnique(ValueT value)
Parameters:valueValueT

InsertWithDuplicates(ValueT)

Inserts the with duplicates.

C#
public void InsertWithDuplicates(ValueT value)
Parameters:valueValueT

The value.

LastIndex(ValueT)

C#
public int LastIndex(ValueT value)
Parameters:valueValueTReturns:

int

LTrim(int)

C#
public ValueT LTrim(int index)
Parameters:indexintReturns:

ValueT

MkEmpty()

C#
public void MkEmpty()

Remove(ValueT)

C#
public bool Remove(ValueT item)
Parameters:itemValueTReturns:

bool

RemoveAt(int)

C#
public void RemoveAt(int index)
Parameters:indexint

Implements: IList.RemoveAt(int)

Replace(int, ValueT)

C#
public ValueT Replace(int index, ValueT newValue)
Parameters:indexintnewValueValueTReturns:

ValueT

ReplaceFirst(ValueT)

C#
public ValueT ReplaceFirst(ValueT newValue)
Parameters:newValueValueTReturns:

ValueT

ReplaceLast(ValueT)

C#
public ValueT ReplaceLast(ValueT newValue)
Parameters:newValueValueTReturns:

ValueT

Repr()

C#
public string Repr()
Returns:

string

RTrim(int)

C#
public ValueT RTrim(int index)
Parameters:indexintReturns:

ValueT

Slice(int, int)

C#
public AvlTree<ValueT> Slice(int lo, int hi)
Parameters:lointhiintReturns:

AvlTree<ValueT>

Span(ValueT, out int, out int)

C#
public void Span(ValueT value, out int loIndex, out int hiIndex)
Parameters:valueValueTloIndexinthiIndexint

Span(ValueT, ValueT, out int, out int)

C#
public void Span(ValueT loValue, ValueT hiValue, out int loIndex, out int hiIndex)
Parameters:loValueValueThiValueValueTloIndexinthiIndexint

Split(ValueT, out AvlTree<ValueT>, out AvlTree<ValueT>)

C#
public ValueT Split(ValueT value, out AvlTree<ValueT> avl0, out AvlTree<ValueT> avl1)
Parameters:valueValueTavl0AvlTree<ValueT>avl1AvlTree<ValueT>Returns:

ValueT

SplitAt(int, out AvlTree<ValueT>, out AvlTree<ValueT>)

C#
public ValueT SplitAt(int index, out AvlTree<ValueT> avl0, out AvlTree<ValueT> avl1)
Parameters:indexintavl0AvlTree<ValueT>avl1AvlTree<ValueT>Returns:

ValueT

ToString()

C#
public override string ToString()
Returns:

string

Overrides: object.ToString()

In this article
DefinitionConstructorsAvlTree()AvlTree(IComparer<ValueT>)PropertiesCountFirstIsEmptyIsReadOnlyIsSynchronizedLastRootSizeSyncRootthis[int, int]this[int]MethodsAdd(ValueT)Append(AvlTree<ValueT>)Clear()Contains(ValueT)Copy()CopyTo(Array, int)CopyTo(ValueT[], int)Delete(ValueT, out ValueT)DeleteAt(int, out ValueT)DeleteFirst(out ValueT)DeleteLast()DeleteLast(out ValueT)DeleteRange(int, int)Dispose()Dump(TextWriter)Find(ValueT)FindAtLeast(ValueT, out ValueT)FindAtMost(ValueT, out ValueT)FindByIndex(int)FindNode(ValueT)ForEach(Action<ValueT>, Predicate<ValueT>)ForEach(Action<ValueT>)ForEachBackwards(Action<ValueT>, Predicate<ValueT>)ForEachBackwards(Action<ValueT>)FromList(IList<ValueT>, int, int, IComparer<ValueT>)FromList(IList<ValueT>, int, int)FromList(IList<ValueT>)FromSequence(AvlTree<ValueT>, int, int)FromSequence(AvlTree<ValueT>)FromSequence(IEnumerable<ValueT>, long)GetAvlEnumerator()GetBackwardEnumerator()GetDelta(AvlTreeNode<ValueT>)GetEnumerator()GetForwardEnumerator()GetForwardEnumerator(int, int)Index(ValueT, int, int)Index(ValueT, int)Index(ValueT)IndexOf(ValueT)Insert(int, ValueT)Insert(ValueT, bool, bool)InsertFirst(ValueT)InsertLast(ValueT)InsertUnique(ValueT, bool)InsertUnique(ValueT)InsertWithDuplicates(ValueT)LastIndex(ValueT)LTrim(int)MkEmpty()Remove(ValueT)RemoveAt(int)Replace(int, ValueT)ReplaceFirst(ValueT)ReplaceLast(ValueT)Repr()RTrim(int)Slice(int, int)Span(ValueT, out int, out int)Span(ValueT, ValueT, out int, out int)Split(ValueT, out AvlTree<ValueT>, out AvlTree<ValueT>)SplitAt(int, out AvlTree<ValueT>, out AvlTree<ValueT>)ToString()
Not finding the help you need?
Contact Support