A simple implementation of a Trie data structure

data structures

utils

trie

moon add Yoorkin/trie@0.2.10

Download zip

Author

Yoorkin

Version

0.2.10

License

Apache-2.0

Repository

github.com/Yoorkin/trie

Last updated

6 months ago

Downloads

102K

README

#Trie

A trie, also known as a prefix tree, is a tree-like data structure that stores a collection of strings. This implementation provides the basic functionality of a trie, including inserting strings and searching for strings.

#Usage

typealias @trie.Trie
test {
  let trie = Trie::of([("--search", "search"), ("--switch", "switch")])
  inspect(trie.lookup("--search"), content="Some(\"search\")")
  let trie = trie.add("-s", "s")
  inspect(trie.lookup("-s"), content="Some(\"s\")")
  inspect(trie.lookup("--switch"), content="Some(\"switch\")")
}

#
T

source

typealias Trie as T

#
Trie

source

type Trie[A]

#
Trie::add

source

fn[A] Trie::add(self : Trie[A], path : String, value : A) -> Trie[A]

#
Trie::empty

source

fn[A] Trie::empty() -> Trie[A]

#
Trie::from_array

source

fn[A] Trie::from_array(data : Array[(String, A)]) -> Trie[A]

Create a trie from array.

#
Trie::insert

source

#deprecated("use `add` instead")
fn[A] Trie::insert(self : Trie[A], path : String, value : A) -> Trie[A]

#
Trie::lookup

source

fn[A] Trie::lookup(self : Trie[A], path : String) -> A?

#
Trie::of

source

fn[A] Trie::of(data : FixedArray[(String, A)]) -> Trie[A]

Create a trie from FixedArray

#
empty

source

#deprecated("Use Trie::empty instead")
fn[A] empty() -> Trie[A]

Source Files

trie.mbt

Site source Report issue Packages Build queue Skills Statistics

trie

#Trie

#Usage

#T

#Trie

#Trie::add

#Trie::empty

#Trie::from_array

#Trie::insert

#Trie::lookup

#Trie::of

#empty

Source Files

#
T

#
Trie

#
Trie::add

#
Trie::empty

#
Trie::from_array

#
Trie::insert

#
Trie::lookup

#
Trie::of

#
empty