rbtree

Documentation

Index

• type RBTree
  • func NewRBTree[K, V any](less cmp.SortFunc[K]) *RBTree[K, V]
  • func (t *RBTree[K, V]) Del(key K)
  • func (t *RBTree[K, V]) Get(key K) (V, bool)
  • func (t *RBTree[K, V]) Len() int
  • func (t *RBTree[K, V]) Put(key K, value V)
  • func (t *RBTree[K, V]) String() string

Types

type RBTree

type RBTree[K, V any] struct {
	// contains filtered or unexported fields
}

RBTree is a red-black tree

func NewRBTree

func NewRBTree[K, V any](less cmp.SortFunc[K]) *RBTree[K, V]

NewRBTree creates a red-black tree

func (*RBTree[K, V]) Del

func (t *RBTree[K, V]) Del(key K)

Del deletes the stored value by given key

func (*RBTree[K, V]) Get

func (t *RBTree[K, V]) Get(key K) (V, bool)

Get returns the stored value by given key

func (*RBTree[K, V]) Len

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

Len returns the size of the tree

func (*RBTree[K, V]) Put

func (t *RBTree[K, V]) Put(key K, value V)

Put stores the value by given key

func (*RBTree[K, V]) String

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