Documentation
¶
Index ¶
- func Keys[K trie.Elem, V any](m *RadixMap[K, V]) [][]K
- func Values[K trie.Elem, V any](m *RadixMap[K, V]) []V
- type ItemIterator
- type RadixMap
- func (t *RadixMap[K, V]) Ascend(iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) AscendGreaterOrEqual(greaterOrEqual []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) AscendLessThan(lessThan []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) AscendPrefix(prefix []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) AscendRange(greaterThan []K, lessOrEqual []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) Delete(key []K) (_ V, _ bool)
- func (t *RadixMap[K, V]) DeletePrefix(prefix []K) (_ *RadixMap[K, V])
- func (t *RadixMap[K, V]) Descend(iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) DescendGreaterThan(greaterThan []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) DescendLessOrEqual(lessOrEqual []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) DescendRange(greaterThan []K, lessOrEqual []K, iterator ItemIterator[K, V])
- func (t *RadixMap[K, V]) Get(key []K) (_ V, _ bool)
- func (t *RadixMap[K, V]) Len() int
- func (t *RadixMap[K, V]) LongestPrefix(prefix []K) (longest []K, value V, hasValue bool)
- func (t *RadixMap[K, V]) MarkDelete(key []K) (_ V, _ bool)
- func (t *RadixMap[K, V]) Max() (_ []K, _ V, _ bool)
- func (t *RadixMap[K, V]) Min() (_ []K, _ V, _ bool)
- func (t *RadixMap[K, V]) ReplaceOrInsert(key []K, value V) (_ V, _ bool)
- func (t *RadixMap[K, V]) ReplaceOrInsertExtend(key []K, value V, replaceFunc ReplaceFunc[K, V]) (_ V, _ bool)
- func (t *RadixMap[K, V]) Shrink()
- type ReplaceFunc
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
Types ¶
type RadixMap ¶
func (*RadixMap[K, V]) Ascend ¶
func (t *RadixMap[K, V]) Ascend(iterator ItemIterator[K, V])
func (*RadixMap[K, V]) AscendGreaterOrEqual ¶
func (t *RadixMap[K, V]) AscendGreaterOrEqual(greaterOrEqual []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) AscendLessThan ¶
func (t *RadixMap[K, V]) AscendLessThan(lessThan []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) AscendPrefix ¶
func (t *RadixMap[K, V]) AscendPrefix(prefix []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) AscendRange ¶
func (t *RadixMap[K, V]) AscendRange(greaterThan []K, lessOrEqual []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) DeletePrefix ¶
func (*RadixMap[K, V]) Descend ¶
func (t *RadixMap[K, V]) Descend(iterator ItemIterator[K, V])
func (*RadixMap[K, V]) DescendGreaterThan ¶
func (t *RadixMap[K, V]) DescendGreaterThan(greaterThan []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) DescendLessOrEqual ¶
func (t *RadixMap[K, V]) DescendLessOrEqual(lessOrEqual []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) DescendRange ¶
func (t *RadixMap[K, V]) DescendRange(greaterThan []K, lessOrEqual []K, iterator ItemIterator[K, V])
func (*RadixMap[K, V]) LongestPrefix ¶
func (*RadixMap[K, V]) MarkDelete ¶
func (*RadixMap[K, V]) ReplaceOrInsert ¶
func (*RadixMap[K, V]) ReplaceOrInsertExtend ¶
func (t *RadixMap[K, V]) ReplaceOrInsertExtend(key []K, value V, replaceFunc ReplaceFunc[K, V]) (_ V, _ bool)
type ReplaceFunc ¶
Source Files
Click to show internal directories.
Click to hide internal directories.