Search results

91 packages found

M
Q
P

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

published 0.1.0 4 years ago
M
Q
P

A collection of data structures to use

published 1.0.1 7 years ago
M
Q
P

Cedar trie

published 1.0.0 3 years ago
M
Q
P
M
Q
P

Trie based search for autocompletes with Redis.

published 1.4.0 9 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 18 days ago
M
Q
P

Minimalistic trie implementation for prefix searches

published 1.0.2 7 years ago
M
Q
P

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

Word search algorithms

published 1.0.0 6 years ago
M
Q
P

ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)

published 0.6.0 3 years ago
M
Q
P

Trie based search for autocompletes with Redis. (support vietnamese)

published 1.0.2 5 years ago
M
Q
P

A library for quick insert and retrieval of JavaScript objects, keyed by prefix strings.

published 1.0.5 7 years ago
M
Q
P

TypeScript implementation of the Aho-Corasick algorithm for efficient string matching

published 0.0.1 4 years ago
M
Q
P

A trie implementation in typescript with configurable string delimiters

published 0.0.5 4 years ago
M
Q
P

A librery containing Trie, DAWG with a strong search functionality.

published 0.2.1 8 years ago
M
Q
P

My take on an efficient implementation of a Trie in Javascript

published 0.0.1 7 years ago
M
Q
P

A 'micro' Trie implementation in Js for learning data structure design.

published 1.0.3 7 years ago
M
Q
P

A trie structure for efficient word and phrase search

published 0.0.2 7 years ago
M
Q
P
M
Q
P