tree234

func (*Node234[T]) ChildIndex ¶

func (n *Node234[T]) ChildIndex() int

func (*Node234[T]) Count ¶

func (n *Node234[T]) Count() (c int)

func (*Node234[T]) KidsCount ¶

func (n *Node234[T]) KidsCount() (c int)

func (*Node234[T]) Size ¶

func (n *Node234[T]) Size() (s int)

func (*Node234[T]) String ¶

func (n *Node234[T]) String() string

func (*Tree234[T]) Add ¶

func (t *Tree234[T]) Add(e *T) *T

func (Tree234[T]) Count ¶

func (t Tree234[T]) Count() int

func (*Tree234[T]) Delete ¶

func (t *Tree234[T]) Delete(e *T) *T

func (*Tree234[T]) DeletePos ¶

func (t *Tree234[T]) DeletePos(index int) *T

func (*Tree234[T]) FindRelPos ¶

func (t *Tree234[T]) FindRelPos(e *T, relation Relation) (el *T, index int)

Find an element e in a sorted 2-3-4 tree t. Returns NULL if not found. e is always passed as the first argument to cmp[, so cmp can be an asymmetric function if desired. cmp can also be passed as NULL, in which case the compare function from the tree proper will be used].

func (*Tree234[T]) Index ¶

func (t *Tree234[T]) Index(index int) *T

Look up the element at a given numeric index in a 2-3-4 tree. Returns NULL if the index is out of range.

func (Tree234[T]) String ¶

func (t Tree234[T]) String() string