btree

Documentation

Index

• type BTree
  • func New[K ordered, V any]() (tree *BTree[K, V])
  • func (tr *BTree[K, V]) Get(key K) (V, bool)
  • func (tr *BTree[K, V]) Height() int
  • func (tr *BTree[K, V]) Len() int
  • func (tr *BTree[K, V]) Load(key K, value V)
  • func (tr *BTree[K, V]) Max() (K, V, bool)
  • func (tr *BTree[K, V]) Min() (K, V, bool)
  • func (tr *BTree[K, V]) Remove(key K) bool
  • func (tr *BTree[K, V]) Set(key K, value V)

Types

type BTree

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

func New

func New[K ordered, V any]() (tree *BTree[K, V])

func (*BTree[K, V]) Get

func (tr *BTree[K, V]) Get(key K) (V, bool)

func (*BTree[K, V]) Height

func (tr *BTree[K, V]) Height() int

func (*BTree[K, V]) Len

func (tr *BTree[K, V]) Len() int

func (*BTree[K, V]) Load

func (tr *BTree[K, V]) Load(key K, value V)

func (*BTree[K, V]) Max

func (tr *BTree[K, V]) Max() (K, V, bool)

func (*BTree[K, V]) Min

func (tr *BTree[K, V]) Min() (K, V, bool)

func (*BTree[K, V]) Remove

func (tr *BTree[K, V]) Remove(key K) bool

func (*BTree[K, V]) Set

func (tr *BTree[K, V]) Set(key K, value V)