@ergeon/trie
trie implementation in javascript
trie implementation in javascript
A trie structure for efficient word and phrase search
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
Trie data structure implementation in javascript
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of verkle trees as used in Ethereum.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
An efficient immutable ordered sequence of elements akin to a Vector
High-performance JIT router for Node.js
Blazing fast, <1kb search library
Binary Merkle Tree operations on data
A Trie data structure for strings
Simple pathname router that makes zero assumptions about the server
A serializable compact prefix trie
Library of building blocks for TypeScript
Cedar trie
Quick fork of unicode-trie for modernity
Unicode line-breaking algorithm from UAX #14
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
A module for performing a dictionary search