Search results
95 packages found
A Javascript library for using classic Data Structures
An easy to easy TypeScript implementation of the Trie data structure for
Dynamic word set with accelerated exact and fuzzy search based on trie data structure.
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
A serializable compact prefix trie
- compact-prefix-tree
- compact-radix-tree
- compact-trie
- data-structure
- patricia-tree
- prefix-tree
- prefix
- radix-tree
- trie
A fast in-memory dictionary for autocomplete as you type features based on a trie data structure.
JS implementation of persistent bit-partitioned vector trie a.k.a vector data structure in Clojure
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Simple scrabble solver using a trie data structure in Node.
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
- string
- levenshtein
- hamming distance
- rope
- longest common substring
- substring
- longest common subsequence
- trie
- boyer moore
- palindrom
A utility for autocompleting words using in memory trie data structure
A utility for autocompleting words using in memory trie data structure
A simple implementation of Trie data structure in JS.
A simple trie implementation, well tested tho.
ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)
- priority queue
- heap
- queue
- stack
- trie
- graph
- bst
- binary search tree
- bianry tree
- js
- bloom filters
- bloom-filter
- bloom_filters
- filter
- View more
Simple Trie data structure implementation in Javascript
Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS
Basis for efficient persistent data structures
Javascript directed acyclic word graph (DAWG)
concrete data type implementations