package base_trie
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Trie data structure library
Install
dune-project
Dependency
Authors
Maintainers
Sources
base_trie-v0.16.0.tar.gz
sha256=e7544117bfa8ab1708fd5d78151bbc73b55f10dba52360bcbc2ac2bf5f9a16eb
Description
This library provides an implementation of a trie data structure.
Lookup is based on "chains" of keys; each node of the trie has children representing each potential next key in the chain.
Published: 14 Jun 2023
README
Trie data structure library
This library provides an implementation of a trie data structure.
Lookup is based on "chains" of keys; each node of the trie has children representing each potential next key in the chain. See Keychainable.
This interface is modeled after Base.Map for element lookup by keychains. It also provides trie-node lookup by keychains.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page