llrb

func (*Tree[K, V]) Delete ¶

func (t *Tree[K, V]) Delete(k K) (v V, ok bool)

Delete removes the key-value pair associated with the given key.

func (*Tree[K, V]) DeleteMax ¶

func (t *Tree[K, V]) DeleteMax() (k K, v V, ok bool)

DeleteMax removes the maximum key-value pair from the tree.

func (*Tree[K, V]) DeleteMin ¶

func (t *Tree[K, V]) DeleteMin() (k K, v V, ok bool)

DeleteMin removes the minimum key-value pair from the tree.

func (*Tree[K, V]) Get ¶

func (t *Tree[K, V]) Get(k K) (v V, ok bool)

Get returns the value associated with the given key.

func (*Tree[K, V]) Keys ¶

func (t *Tree[K, V]) Keys() []K

Keys returns a slice of all keys in the tree in ascending order.

func (*Tree[K, V]) Len ¶

func (t *Tree[K, V]) Len() int

Len returns the number of key-value pairs in the tree.

func (*Tree[K, V]) Max ¶

func (t *Tree[K, V]) Max() (k K, v V, ok bool)

Max returns the maximum key-value pair in the tree.

func (*Tree[K, V]) Min ¶

func (t *Tree[K, V]) Min() (k K, v V, ok bool)

Min returns the minimum key-value pair in the tree.

func (*Tree[K, V]) Put ¶

func (t *Tree[K, V]) Put(k K, v V) (ok bool)

Put inserts a key-value pair into the tree.

func (*Tree[K, V]) Range ¶

func (t *Tree[K, V]) Range(fn func(K, V) bool)

Range calls fn for each key-value pair in the tree in ascending order.

func (*Tree[K, V]) String ¶

func (t *Tree[K, V]) String() string

func (*Tree[K, V]) Values ¶

func (t *Tree[K, V]) Values() []V

Values returns a slice of all values in the tree in ascending order.