Show / Hide Table of Contents

Interface ISortedBinaryTree<T, TCompare>

A self-sorting binary tree based on the heights of each node.

Inherited Members
ISortedBinaryTree<T>.CurrentLeast
ISortedBinaryTree<T>.CurrentGreatest
ISortedBinaryTree<T>.ContainsSift<TSift>(TSift)
ISortedBinaryTree<T>.TryGet<TSift>(TSift)
ISortedBinaryTree<T>.TryRemoveSift<TSift>(TSift)
ISortedBinaryTree<T>.StepperBreak<TStep>(T, T, TStep)
ISortedBinaryTree<T>.StepperReverseBreak<TStep>(TStep)
ISortedBinaryTree<T>.StepperReverseBreak<TStep>(T, T, TStep)
IDataStructure<T>.ToArray()
ISteppable<T>.StepperBreak<TStep>(TStep)
DataStructure.IAddable<T>.TryAdd(T)
DataStructure.IRemovable<T>.TryRemove(T)
DataStructure.ICountable.Count
DataStructure.IClearable.Clear()
DataStructure.IAuditable<T>.Contains(T)
DataStructure.IComparing<T, TCompare>.Compare
Namespace: Towel.DataStructures
Assembly: Towel.dll
Syntax
public interface ISortedBinaryTree<T, TCompare> : ISortedBinaryTree<T>, IDataStructure<T>, ISteppable<T>, System.Collections.Generic.IEnumerable<T>, DataStructure.IAddable<T>, DataStructure.IRemovable<T>, DataStructure.ICountable, DataStructure.IClearable, DataStructure.IAuditable<T>, DataStructure.IComparing<T, TCompare> where TCompare : struct, IFunc<T, T, CompareResult>
Type Parameters
Name Description
T

The type of values stored in this data structure.

TCompare

The type that is comparing T values.

Extension Methods

Steppable.Stepper<T>(ISteppable<T>, Action<T>)
Steppable.Stepper<T, TStep>(ISteppable<T>, TStep)
Steppable.StepperBreak<T>(ISteppable<T>, Func<T, StepStatus>)
DataStructure.Add<T>(DataStructure.IAddable<T>, T)
DataStructure.Remove<T>(DataStructure.IRemovable<T>, T)
SortedBinaryTree.ContainsSift<T>(ISortedBinaryTree<T>, Func<T, CompareResult>)
SortedBinaryTree.TryGet<T>(ISortedBinaryTree<T>, Func<T, CompareResult>)
SortedBinaryTree.TryRemoveSift<T>(ISortedBinaryTree<T>, Func<T, CompareResult>)
SortedBinaryTree.Stepper<T>(ISortedBinaryTree<T>, T, T, Action<T>)
SortedBinaryTree.Stepper<T, TStep>(ISortedBinaryTree<T>, T, T, TStep)
SortedBinaryTree.StepperBreak<T>(ISortedBinaryTree<T>, T, T, Func<T, StepStatus>)
SortedBinaryTree.StepperReverse<T>(ISortedBinaryTree<T>, T, T, Action<T>)
SortedBinaryTree.StepperReverse<T, TStep>(ISortedBinaryTree<T>, T, T, TStep)
SortedBinaryTree.StepperReverseBreak<T>(ISortedBinaryTree<T>, T, T, Func<T, StepStatus>)
  • Improve this Doc
  • View Source
In This Article
Back to top Generated by DocFX