search-trie
Advanced tools
Readme
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 healthy version release cadence and project activity because the last version was released less than 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
CISA launched a new project called Vulnrichment to enrich CVEs with details that help prioritize patching and mitigation efforts, as the NVD backlog of unenriched CVEs awaiting analysis surpasses 10,000.
Security News
Socket is joining forces with CISA and other industry leaders at the RSA Conference to sign the Secure by Design pledge, committing to uphold the highest security standards in our products.
Research
The Socket research team breaks down a sampling of malicious packages that download and execute files, among other suspicious behaviors, targeting the popular Discord platform.