Class

AvlTree<ValueT>

public AvlTree()

public AvlTree(IComparer<ValueT> comparer)

public int Count { get; }

public ValueT First { get; }

public bool IsEmpty { get; }

public bool IsReadOnly { get; }

public bool IsSynchronized { get; }

public ValueT Last { get; }

public AvlTreeNode<ValueT> Root { get; }

public int Size { get; }

public object SyncRoot { get; }

public AvlTree<ValueT> this[int lo, int hi] { get; }

public ValueT this[int index] { get; set; }

public void Add(ValueT item)

public AvlTree<ValueT> Append(AvlTree<ValueT> that)

public void Clear()

public bool Contains(ValueT value)

public AvlTree<ValueT> Copy()

public void CopyTo(Array array, int index)

public void CopyTo(ValueT[] array, int arrayIndex)

public bool Delete(ValueT value, out ValueT delValue)

public void DeleteAt(int index, out ValueT delValue)

public void DeleteFirst(out ValueT delValue)

public void DeleteLast()

public void DeleteLast(out ValueT delValue)

public void DeleteRange(int lo, int hi)

public void Dispose()

public void Dump(TextWriter os)

public ValueT Find(ValueT target)

public bool FindAtLeast(ValueT target, out ValueT value)

public bool FindAtMost(ValueT target, out ValueT value)

public ValueT FindByIndex(int index)

public AvlTreeNode<ValueT> FindNode(ValueT target)

public void ForEach(Action<ValueT> act)

public void ForEach(Action<ValueT> act, Predicate<ValueT> stopcondition)

public void ForEachBackwards(Action<ValueT> act)

public void ForEachBackwards(Action<ValueT> act, Predicate<ValueT> stopcondition)

public static AvlTree<ValueT> FromList(IList<ValueT> sortedList)

public static AvlTree<ValueT> FromList(IList<ValueT> sortedList, int lo, int hi)

public static AvlTree<ValueT> FromList(IList<ValueT> sortedList, int lo, int hi, IComparer<ValueT> comparer)

public static AvlTree<ValueT> FromSequence(AvlTree<ValueT> avl)

public static AvlTree<ValueT> FromSequence(AvlTree<ValueT> avl, int lo, int hi)

public static AvlTree<ValueT> FromSequence(IEnumerable<ValueT> seq, long len)

public IAvlEnumerator<ValueT> GetAvlEnumerator()

public IEnumerator<ValueT> GetBackwardEnumerator()

public static int GetDelta(AvlTreeNode<ValueT> a)

public IEnumerator<ValueT> GetEnumerator()

public IEnumerator<ValueT> GetForwardEnumerator()

public IEnumerator<ValueT> GetForwardEnumerator(int lo, int hi)

public int Index(ValueT value)

public int Index(ValueT value, int lo)

public int Index(ValueT value, int lo, int hi)

public int IndexOf(ValueT item)

public void Insert(ValueT value, bool duplicateallowed, bool overwrite)

public void Insert(int index, ValueT value)

public void InsertFirst(ValueT value)

public void InsertLast(ValueT value)

public void InsertUnique(ValueT value)

public void InsertUnique(ValueT value, bool overwrite)

public void InsertWithDuplicates(ValueT value)

public ValueT LTrim(int index)

public int LastIndex(ValueT value)

public void MkEmpty()

public ValueT RTrim(int index)

public bool Remove(ValueT item)

public void RemoveAt(int index)

public ValueT Replace(int index, ValueT newValue)

public ValueT ReplaceFirst(ValueT newValue)

public ValueT ReplaceLast(ValueT newValue)

public string Repr()

public AvlTree<ValueT> Slice(int lo, int hi)

public void Span(ValueT loValue, ValueT hiValue, out int loIndex, out int hiIndex)

public void Span(ValueT value, out int loIndex, out int hiIndex)

public ValueT Split(ValueT value, out AvlTree<ValueT> avl0, out AvlTree<ValueT> avl1)

public ValueT SplitAt(int index, out AvlTree<ValueT> avl0, out AvlTree<ValueT> avl1)

public override string ToString()