Versions in this module Expand all Collapse all v1 v1.0.0 Mar 27, 2026 Changes in this version + const MinOrder + var ErrInvalidOrder = errors.New("invalid order, should be at least 3") + type Entry struct + Key K + Value V + func (entry *Entry[K, V]) String() string + type Iterator struct + func (iterator *Iterator[K, V]) Begin() + func (iterator *Iterator[K, V]) End() + func (iterator *Iterator[K, V]) First() bool + func (iterator *Iterator[K, V]) Key() K + func (iterator *Iterator[K, V]) Last() bool + func (iterator *Iterator[K, V]) Next() bool + func (iterator *Iterator[K, V]) Prev() bool + func (iterator *Iterator[K, V]) Value() any + type Node struct + Children []*Node[K, V] + Entries []*Entry[K, V] + Parent *Node[K, V] + type Tree struct + Comparator comparator.Comparator + Root *Node[K, V] + func NewWithIntComparator(order int) (*Tree[int, any], error) + func NewWithStringComparator(order int) (*Tree[string, any], error) + func NewWith[K comparable, V any](order int, comparator comparator.Comparator) (*Tree[K, V], error) + func (tree *Tree[K, V]) Clear() + func (tree *Tree[K, V]) Copy() *Tree[K, V] + func (tree *Tree[K, V]) Empty() bool + func (tree *Tree[K, V]) Get(key K) (value V, found bool, err error) + func (tree *Tree[K, V]) Height() int + func (tree *Tree[K, V]) Iterator() Iterator[K, V] + func (tree *Tree[K, V]) Keys() []K + func (tree *Tree[K, V]) Left() *Node[K, V] + func (tree *Tree[K, V]) LeftKey() any + func (tree *Tree[K, V]) LeftValue() any + func (tree *Tree[K, V]) Len() int + func (tree *Tree[K, V]) Put(key K, value V) (err error) + func (tree *Tree[K, V]) Remove(key K) (err error) + func (tree *Tree[K, V]) Right() *Node[K, V] + func (tree *Tree[K, V]) RightKey() any + func (tree *Tree[K, V]) RightValue() any + func (tree *Tree[K, V]) String() string + func (tree *Tree[K, V]) Values() []any
Go to main page