Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Node ¶
type Node[T any] struct { // contains filtered or unexported fields }
func (*Node[T]) GetAllLeafs ¶
func (n *Node[T]) GetAllLeafs() []T
type Trie ¶
type Trie[T any] struct { // contains filtered or unexported fields }
Trie is a simplified version of a Radix tree (https://en.wikipedia.org/wiki/Radix_tree#:~:text=In%20computer%20science%2C%20a%20radix,is%20merged%20with%20its%20parent.) Trie can be used to search for objects based on a key prefix To improve performance, the key is split by a separator instead of a common characters.
func (*Trie[T]) SearchPrefix ¶
SearchPrefix search for all values that within the data structure with a given prefix Note that the prefix key will be split by the separator
Source Files
Click to show internal directories.
Click to hide internal directories.