Search results

294 packages found

trie data structure

published 2.0.4 2 years ago
M
Q
P

Implementation of verkle trees as used in Ethereum.

published 0.0.2 2 months ago
M
Q
P

Simple, modifiable item-title search index based on radix tries.

published 1.0.5 7 years ago
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 3 years ago
M
Q
P

Compute the Longest Common Prefix from some strings

published 1.1.0 8 years ago
M
Q
P

A lightweight trie implementation.

published 1.2.0 8 years ago
M
Q
P

Minimalistic trie implementation for prefix searches

published 1.0.2 6 years ago
M
Q
P

trie in javascript

published 0.0.1 6 years ago
M
Q
P
M
Q
P

Yet another quad tree

published 1.2.1 7 years ago
M
Q
P

Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS

published 0.2.2 7 years ago
M
Q
P

Search Really Really Fast

published 0.0.6 6 years ago
M
Q
P

JavaScript implementation of Double-Array trie

published 0.0.2 10 years ago
M
Q
P

This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.

published 1.0.2 4 months ago
M
Q
P

Directed Acyclic Word Graph

published 2.2.1 7 years ago
M
Q
P

Quick fork of unicode-trie for modernity

published 2.0.0 22 days ago
M
Q
P

simple trie implementation based on JS proxies

published 1.0.1 6 years ago
M
Q
P

>> Easiest package to build and manipulate prefix trie structures

published 1.1.8 6 years ago
M
Q
P

Trie Data Structure reader for cspell

published 8.6.1 4 days ago
M
Q
P

word-break util using trie-search dictionary

published 1.0.1 4 years ago
M
Q
P