part

Oct 10, 2024

Changes in this version

type Map

+ func (m *Map[K, V]) UnmarshalYAML(value *yaml.Node) error

+ func (m Map[K, V]) MarshalYAML() (any, error)

type Set

+ func (s *Set[T]) UnmarshalYAML(value *yaml.Node) error

+ func (s Set[T]) MarshalYAML() (any, error)

Sep 6, 2024

Changes in this version

type Iterator

+ func (it *Iterator[T]) Clone() *Iterator[T]

Aug 16, 2024

Changes in this version

type Tree

+ func (t *Tree[T]) Modify(key []byte, mod func(T) T) (old T, hadOld bool, tree *Tree[T])

type Txn

+ func (txn *Txn[T]) Modify(key []byte, mod func(T) T) (old T, hadOld bool)

Jun 4, 2024

Changes in this version

+ func RegisterKeyType[K any](bytesFromKey func(K) []byte)

+ func RootOnlyWatch(o *options)

+ type Iterator struct

+ func (it *Iterator[T]) Next() (key []byte, value T, ok bool)

+ type Map struct

+ func FromMap[K comparable, V any](m Map[K, V], hm map[K]V) Map[K, V]

+ func (m *Map[K, V]) UnmarshalJSON(data []byte) error

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

+ func (m Map[K, V]) Delete(key K) Map[K, V]

+ func (m Map[K, V]) EqualKeys(other Map[K, V]) bool

+ func (m Map[K, V]) Get(key K) (value V, found bool)

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

+ func (m Map[K, V]) LowerBound(from K) MapIterator[K, V]

+ func (m Map[K, V]) MarshalJSON() ([]byte, error)

+ func (m Map[K, V]) Prefix(prefix K) MapIterator[K, V]

+ func (m Map[K, V]) Set(key K, value V) Map[K, V]

+ func (m Map[K, V]) SlowEqual(other Map[K, V]) bool

+ type MapIterator struct

+ func (it MapIterator[K, V]) Next() (k K, v V, ok bool)

+ type Ops interface

+ Get func(key []byte) (T, <-chan struct{}, bool)

+ Iterator func() *Iterator[T]

+ Len func() int

+ LowerBound func(key []byte) *Iterator[T]

+ Prefix func(key []byte) (*Iterator[T], <-chan struct{})

+ PrintTree func()

+ RootWatch func() <-chan struct{}

+ type Option func(*options)

+ type Set struct

+ func NewSet[T any](values ...T) Set[T]

+ func (s *Set[T]) UnmarshalJSON(data []byte) error

+ func (s Set[T]) All() SetIterator[T]

+ func (s Set[T]) Delete(v T) Set[T]

+ func (s Set[T]) Difference(s2 Set[T]) Set[T]

+ func (s Set[T]) Equal(other Set[T]) bool

+ func (s Set[T]) Has(v T) bool

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

+ func (s Set[T]) MarshalJSON() ([]byte, error)

+ func (s Set[T]) Set(v T) Set[T]

+ func (s Set[T]) Slice() []T

+ func (s Set[T]) ToBytesFunc() func(T) []byte

+ func (s Set[T]) Union(s2 Set[T]) Set[T]

+ type SetIterator struct

+ func (it SetIterator[T]) Next() (v T, ok bool)

+ type Tree struct

+ func New[T any](opts ...Option) *Tree[T]

+ func (t *Tree[T]) Delete(key []byte) (old T, hadOld bool, tree *Tree[T])

+ func (t *Tree[T]) Get(key []byte) (T, <-chan struct{}, bool)

+ func (t *Tree[T]) Insert(key []byte, value T) (old T, hadOld bool, tree *Tree[T])

+ func (t *Tree[T]) Iterator() *Iterator[T]

+ func (t *Tree[T]) Len() int

+ func (t *Tree[T]) LowerBound(key []byte) *Iterator[T]

+ func (t *Tree[T]) Prefix(prefix []byte) (*Iterator[T], <-chan struct{})

+ func (t *Tree[T]) PrintTree()

+ func (t *Tree[T]) RootWatch() <-chan struct{}

+ func (t *Tree[T]) Txn() *Txn[T]

+ type Txn struct

+ func (txn *Txn[T]) Clone() *Txn[T]

+ func (txn *Txn[T]) Commit() *Tree[T]

+ func (txn *Txn[T]) CommitOnly() *Tree[T]

+ func (txn *Txn[T]) Delete(key []byte) (old T, hadOld bool)

+ func (txn *Txn[T]) Get(key []byte) (T, <-chan struct{}, bool)

+ func (txn *Txn[T]) Insert(key []byte, value T) (old T, hadOld bool)

+ func (txn *Txn[T]) Iterator() *Iterator[T]

+ func (txn *Txn[T]) Len() int

+ func (txn *Txn[T]) LowerBound(key []byte) *Iterator[T]

+ func (txn *Txn[T]) Notify()

+ func (txn *Txn[T]) Prefix(key []byte) (*Iterator[T], <-chan struct{})

+ func (txn *Txn[T]) PrintTree()

+ func (txn *Txn[T]) RootWatch() <-chan struct{}