Search results
109 packages found
A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
A ternary search tree for Node.js
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
- add
- data
- javascript
- remove
- structure
- tree
- tree-structure
- trie
- trie-structure
- words
- create-by-yarn-tool
- create-by-tsdx
A key-value store utilising the filesystem.
A list of common data structures implemented in Javascript
- data structures
- linked list
- binary search tree
- queue
- stack
- trie
- min heap
- doubly linked list
- circular linked list
Data structure and graph processing library written in modern JavaScript
- data structures
- javascript
- graph
- undirected graph
- directed graph
- weighted graph
- breadth first search
- BFS
- depth first search
- DFS
- dijkstra
- shortest path
- prim
- minimum spanning tree
- View more
Trie datastructure with customer delimiters
a ~7kb, typed, zero-dependency trie library
This is an implementation of the modified merkle patricia tree as speficed in the Vapory's yellow paper.
Create a regular expression from trie like object
PAT tree construction for Chinese documents, keyword extraction and text segmentation
- node
- pat-tree
- trie
- patricia tree
- pat tree
- PAT
- tree
- information retrieval
- Chinese
- ckip
- keyword extraction
- text segmentation
Aho–Corasick string matching algorithm
- Aho-Corasick automation
- ac
- ac automation
- aca
- add
- aho
- aho-corasick
- algorithm
- array
- automata
- corasick
- data
- javascript
- match
- View more
- ternary search tree
- lexicographic tree
- trie
- set
- string set
- sorted set
- dictionary
- hash table
- word game
- word puzzle
- autocomplete
- prediction
- crossword solver
- anagram
A simplified Wasm binding to ternary-tree crate
Curated collection of data structures for the JavaScript language.
- bag
- bimap
- bit array
- bit set
- bit vector
- bitset
- bk tree
- burkhard-keller tree
- cache
- circular buffer
- counter
- data structures
- default map
- deque
- View more
Trie generator.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams