trie

package

v1.0.0 Latest Latest Go to latest Published: Feb 27, 2025 License: MIT Imports: 3 Imported by: 0

Details

Package trie provides structure with Unicode keys could hold this one (🦃) --> (🍖) --> (🌯)

This section is empty.

This section is empty.

This section is empty.

type Trie[V any] struct {
	// contains filtered or unexported fields
}

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

func NewFromMap[V any](values map[string]V) *Trie[V]

func (t *Trie[V]) Clear()

Clear removes all elements.

func (t *Trie[V]) Has(key string) bool

Has returns 'true' if the three has a node with not nil value.

func (t *Trie[V]) Insert(key string, value V)

Insert adds element to the three.

func (t *Trie[V]) Len() int

Len returns number of values.

func (t *Trie[V]) NodeLen() int

NodeLen returns number of nodes (with value and without).

func (t *Trie[V]) Remove(key string) (res V, exists bool)

Remove removes node with value if exists. Also remove all empty upper nodes.

func (t *Trie[V]) Search(key string) (res V, exists bool)

Search finds a node with value. If there is no node returns default value and 'false'.