trie

package

v0.2.15 Latest Latest Go to latest Published: Dec 6, 2025 License: Apache-2.0 Imports: 2 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type ByKeys []string

func (a ByKeys) Len() int

func (a ByKeys) Less(i, j int) bool

func (a ByKeys) Swap(i, j int)

type Node[T any] interface {
	Value() T
}

type Trie[T any] struct {
	sync.RWMutex
	// contains filtered or unexported fields
}

Trie is a data structure that stores a set of strings.

func New[T any]() *Trie[T]

New creates a new Trie with an initialized root Node.

func (t *Trie[T]) Add(key string, value T) Node[T]

Add adds the key to the Trie, including value data

func (t *Trie[T]) Find(key string) (Node[T], bool)

Find finds and returns value data associated with `key`.

func (t *Trie[T]) FuzzySearch(pre string) []string

FuzzySearch performs a fuzzy search against the keys in the trie.

func (t *Trie[T]) HasKeysWithPrefix(key string) bool

func (t *Trie[T]) Keys() []string

Keys returns all the keys currently stored in the trie.

func (t *Trie[T]) PrefixSearch(pre string) []string

PrefixSearch performs a prefix search against the keys in the trie.

func (t *Trie[T]) Remove(key string)

Remove removes a key from the trie, ensuring that all bitmasks up to root are appropriately recalculated.