Package Exports
- dtrie
This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (dtrie) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.
Readme
Node.js trie implementation based on a Minimal Acyclic Finite-State Automata
Node.js trie implementation based on a Minimal Acyclic Finite-State Automata.
Implementation based on "Incremental Construction of Minimal Acyclic Finite-State Automata" by Jan Daciuk, Stoyan Mihov, Bruce W. Watson and Richard E. Watson.
Installation
npm install dtrieAPI
Class Node
new Node([id])
- id: overwrite the generated id
Construct a new node.
node.id
Node's id, unique to each node.
node.letters
Node's transitions.
node.hasChild(letter)
- letter: transition label
Return true if this node has a child for the given transition.
node.child(letter)
- letter: transition label
Return the node child.
node.pathExists(path)
- path: a word to follow
Check if a path exists from this node to a terminal node.
node.isTerminal()
Return true if the current node is a terminal node.
Class Automata
This class is a subclass of Node.
new Automata()
Construct a new automata.
automata.addAll(words)
- words: an alphabetically sorted list of lowercase words
Populate the automata from an alphabetically sorted list of lowercase words. This method should only be called once per automata.
automata.contains(word)
- word: the word to lookup
Return true if the automata recognize the given word.
automata.getNumNodes()
Return the number of nodes in the automata.
License
This code is free to use under the terms of the MIT license.