A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp
Minimalistic trie implementation for autosuggest and autocomplete components.
TypeScript definitions for autosuggest-trie
An ACP-compatible coding agent powered by Codex - darwin arm64 binary
trie implementation in javascript
A modern TypeScript library for retrieving country data with a simple and intuitive API.
Phone masks, ISO codes and flags for all countries
A fast and lightweight autocomplete library using a trie data structure.
An ACP-compatible coding agent powered by Codex - win32 x64 binary
TypeScript definitions for i18n-iso-countries-regions
A custom implementation of ethereumjs trie
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of binary trees as used in Ethereum.
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
TypeScript definitions for trie-prefix-tree
Abstract IPLD format - Ethereum Trie
Binary Merkle Tree operations on data
get trie position list { position: keyword[] }
Minimal trie datastructure representation
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
A materialized trie over an ancestry graph — one prefix walk yields lexical continuations, ranks, and containment lineage from a single static artifact.
JavaScript Implementation of the IPLD format - Ethereum State Trie
JavaScript Implementation of the IPLD format - Ethereum State Trie
JavaScript Implementation of the IPLD format - Ethereum Transaction Trie
Performs fast search and replace on a text based on a set of rules.
Customizable trie data structure built in JavaScript.
The extremely fast compressed trie implementation.
compressed-trie data-structure
This is a simple implementation of router by using Trie data structure at core. It has a basic param feature for example the following code are valid.
Trie generator.
Compressed trie dictionary format (.trp) — compact binary key-value storage with fast lookups and prefix search. Native JavaScript implementation, no dependencies.
An implementation of an immutable map structure, based on a hash array mapped trie
An implementation of an immutable set structure, based on a hash array mapped trie
An implementation of an immutable list structure, based on a bit-partitioned vector trie
A simple Trie data structure for optimized for lowercased latin alphanumeric strings. Optimization was done based on the following assumption:
Implementation of verkle trees as used in Ethereum.