btree

package module

Go to main page

Versions in this module

v0

v0.3.0

Sep 29, 2026

Changes in this version

type Map

+ func (m *Map[K, V]) Lookup(k K) (key K, v V, ok bool)

type Set

+ func (s *Set[T]) Get(probe T) (item T, found bool)

type SetCursor

+ func (c *SetCursor[T]) Compare(a, b T) int

+ func (c *SetCursor[T]) Delete() T

+ func (c *SetCursor[T]) First() bool

+ func (c *SetCursor[T]) Item() T

+ func (c *SetCursor[T]) Last() bool

+ func (c *SetCursor[T]) Next() bool

+ func (c *SetCursor[T]) Prev() bool

+ func (c *SetCursor[T]) Rekey(item T) (displaced T, ok bool)

+ func (c *SetCursor[T]) Reset()

+ func (c *SetCursor[T]) SeekExact(item T) bool

+ func (c *SetCursor[T]) SeekGE(item T) bool

+ func (c *SetCursor[T]) SeekGT(item T) bool

+ func (c *SetCursor[T]) SeekLE(item T) bool

+ func (c *SetCursor[T]) SeekLT(item T) bool

+ func (c *SetCursor[T]) Upsert(item T) (replaced T, ok bool)

+ func (c *SetCursor[T]) Valid() bool

type SetIterator

+ func (i *SetIterator[T]) Compare(a, b T) int

+ func (i *SetIterator[T]) First() bool

+ func (i *SetIterator[T]) Item() T

+ func (i *SetIterator[T]) Last() bool

+ func (i *SetIterator[T]) Next() bool

+ func (i *SetIterator[T]) Prev() bool

+ func (i *SetIterator[T]) Reset()

+ func (i *SetIterator[T]) SeekExact(item T) bool

+ func (i *SetIterator[T]) SeekGE(item T) bool

+ func (i *SetIterator[T]) SeekGT(item T) bool

+ func (i *SetIterator[T]) SeekLE(item T) bool

+ func (i *SetIterator[T]) SeekLT(item T) bool

+ func (i *SetIterator[T]) Valid() bool

v0.2.0

Sep 29, 2026

Changes in this version

+ type FreeList = aug.FreeList[K, V, struct{}]

+ func NewFreeList[K, V any](size int) FreeList[K, V]

type Map

+ func NewOrdered[K cmp.Ordered, V any](opts ...Option) *Map[K, V]

+ func New[K, V any](cmp func(K, K) int, opts ...Option) *Map[K, V]

+ func (m *Map[K, V]) All() iter.Seq2[K, V]

+ func (m *Map[K, V]) Backward() iter.Seq2[K, V]

+ func (m *Map[K, V]) Clear()

+ func (m *Map[K, V]) Compare(a, b K) int

+ func (m *Map[K, V]) Cursor() MapCursor[K, V]

+ func (m *Map[K, V]) Degree() int

+ func (m *Map[K, V]) Delete(k K) (removedK K, v V, found bool)

+ func (m *Map[K, V]) From(lo K) iter.Seq2[K, V]

+ func (m *Map[K, V]) Get(k K) (v V, ok bool)

+ func (m *Map[K, V]) Height() int

+ func (m *Map[K, V]) Iterator() MapIterator[K, V]

+ func (m *Map[K, V]) Len() int

+ func (m *Map[K, V]) Max() (k K, v V, ok bool)

+ func (m *Map[K, V]) Min() (k K, v V, ok bool)

+ func (m *Map[K, V]) Range(lo, hi K) iter.Seq2[K, V]

+ func (m *Map[K, V]) String() string

+ func (m *Map[K, V]) Upsert(k K, v V) (replacedK K, replacedV V, replaced bool)

+ func (m *Map[K, V]) Verify() error

+ type MapCursor = aug.Cursor[K, V, struct{}]

+ type Option = aug.Option

+ func WithDegree(degree int) Option

+ func WithFreeList[K, V any](fl FreeList[K, V]) Option

type Set

+ func NewOrderedSet[T cmp.Ordered](opts ...Option) *Set[T]

+ func NewSet[T any](cmp func(T, T) int, opts ...Option) *Set[T]

+ func (s *Set[T]) All() iter.Seq[T]

+ func (s *Set[T]) Backward() iter.Seq[T]

+ func (s *Set[T]) Clear()

+ func (s *Set[T]) Compare(a, b T) int

+ func (s *Set[T]) Contains(item T) bool

+ func (s *Set[T]) Cursor() SetCursor[T]

+ func (s *Set[T]) Degree() int

+ func (s *Set[T]) From(lo T) iter.Seq[T]

+ func (s *Set[T]) Height() int

+ func (s *Set[T]) Iterator() SetIterator[T]

+ func (s *Set[T]) Len() int

+ func (s *Set[T]) Max() (item T, ok bool)

+ func (s *Set[T]) Min() (item T, ok bool)

+ func (s *Set[T]) Range(lo, hi T) iter.Seq[T]

+ func (s *Set[T]) String() string

+ func (s *Set[T]) Verify() error

+ type SetCursor = MapCursor[T, struct{}]

v0.1.1

Dec 29, 2025

Changes in this version

+ type Map struct

+ func MakeMap[K, V any](cmp func(K, K) int) Map[K, V]

+ func (m *Map[K, V]) Clone() Map[K, V]

+ type MapIterator = abstract.Iterator[K, V, struct{}]

+ type Set Map[T, struct{}]

+ func MakeSet[T any](cmp func(T, T) int) Set[T]

+ func (t *Set[K]) Delete(item K) (removed bool)

+ func (t *Set[T]) Clone() Set[T]

+ func (t *Set[T]) Upsert(item T) (replaced T, overwrote bool)

+ type SetIterator = MapIterator[T, struct{}]

v0.1.0-beta

Dec 29, 2025

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL