lpm

func (*Iterator[T]) All ¶

func (it *Iterator[T]) All(yield func([]byte, T) bool)

func (*Iterator[T]) Next ¶

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

func (*Trie[T]) All ¶

func (l *Trie[T]) All() *Iterator[T]

func (*Trie[T]) Len ¶

func (l *Trie[T]) Len() int

func (*Trie[T]) Lookup ¶

func (l *Trie[T]) Lookup(key index.Key) (value T, found bool)

func (*Trie[T]) LookupExact ¶

func (l *Trie[T]) LookupExact(key index.Key) (value T, found bool)

func (*Trie[T]) LowerBound ¶

func (l *Trie[T]) LowerBound(key index.Key) *Iterator[T]

func (*Trie[T]) Prefix ¶

func (l *Trie[T]) Prefix(key index.Key) *Iterator[T]

func (*Trie[T]) Print ¶

func (l *Trie[T]) Print()

func (*Trie[T]) Txn ¶

func (l *Trie[T]) Txn() *Txn[T]

func (*Txn[T]) All ¶

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

func (*Txn[T]) Clear ¶

func (txn *Txn[T]) Clear()

Clear the transaction for reuse.

func (*Txn[T]) Commit ¶

func (txn *Txn[T]) Commit() Trie[T]

func (*Txn[T]) Delete ¶

func (txn *Txn[T]) Delete(key index.Key) (value T, found bool)

func (*Txn[T]) Insert ¶

func (txn *Txn[T]) Insert(key index.Key, value T) error

func (*Txn[T]) Len ¶

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

func (*Txn[T]) Lookup ¶

func (txn *Txn[T]) Lookup(key index.Key) (value T, found bool)

func (*Txn[T]) LookupExact ¶

func (txn *Txn[T]) LookupExact(key index.Key) (value T, found bool)

func (*Txn[T]) LowerBound ¶

func (txn *Txn[T]) LowerBound(key index.Key) *Iterator[T]

func (*Txn[T]) Prefix ¶

func (txn *Txn[T]) Prefix(key index.Key) *Iterator[T]

func (*Txn[T]) Reuse ¶

func (txn *Txn[T]) Reuse(trie Trie[T]) *Txn[T]