search-trie
Advanced tools
A simple trie structure to perform search on texts in O(n) time, where n - number of characters in searched word.
A simple trie structure to perform search on texts in O(n) time, where n - number of characters in searched word.
Super simple, Super fast, and just 45 lines long.
Trie is a basic Tree structure, also known as suffix tree.
Has even more simpler structure, optimized for a single build and a few searches afterwards. Search-tree does not compact Tree into the "suffix" Tree, speeding up the build process.
buildCharacterTrie - creates per "character" search.buildWordTrie - creates per "word" searchMIT
FAQs
A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp
We found that search-trie demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Research
An advanced npm supply chain attack is leveraging Ethereum smart contracts for decentralized, persistent malware control, evading traditional defenses.
Security News
Research
Attackers are impersonating Sindre Sorhus on npm with a fake 'chalk-node' package containing a malicious backdoor to compromise developers' projects.
Security News
The npm package for the LottieFiles Player web component was hit with a supply chain attack after a software engineer's npmjs credentials were compromised.