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
  
    
      v0.17.0.tar.gz
    
    
        
    
  
  
  
    
  
        sha256=d423636742996696dc8e840710537cd85807d8d04ecbc2a266a63bcc75d58deb
    
    
  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: 26 May 2024
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