Search results

95 packages found

A node module with a simple trie data structure, support for insert and search functions

published 1.0.4 10 years ago
M
Q
P

Hash Trie

published 1.0.0 9 years ago
M
Q
P

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

published 3.0.1 2 years ago
M
Q
P

Trie generator.

published 0.2.0 5 years ago
M
Q
P

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

published 1.1.0 2 years ago
M
Q
P
M
Q
P

get trie position list { position: keyword[] }

published 2.0.1 2 years ago
M
Q
P

A trie data structure for arrays

published 1.0.0 10 years ago
M
Q
P

Javascript versions of classic software development algorithms

published 1.9.2 a year ago
M
Q
P

Curated collection of data structures for the JavaScript language.

published 0.27.0 6 years ago
M
Q
P

A collection of data structures to use

published 1.0.1 7 years ago
M
Q
P

trie data structure

published 2.0.4 2 years ago
M
Q
P
M
Q
P

typescript implementation of the prefix trie data structure

published 0.3.0 4 years ago
M
Q
P

Algorithms and data structures for your JavaScript and TypeScript projects 🧑‍💻

published 1.0.1 2 years ago
M
Q
P
M
Q
P

A dead-simple trie data structure

published 1.0.6 6 years ago
M
Q
P

A tiny TypeScript trie implementation

published 0.2.0 4 years ago
M
Q
P

A JavaScript package for implementing the Trie data structure, including essential methods for efficient data retrieval.

published 1.0.0 16 days ago
M
Q
P

Makes an auxilary tree structure to get O(m) efficient autocomplete results, (where m is the length of a search string), without use of external dependencies.<br /> The repo is holds a list of 300k english letter already formatted as tree and available fo

published 2.0.2 6 years ago
M
Q
P