Radix trie module.
TypeScript definitions for unicode-trie
Provides fast access to unicode character properties
Check permissions using Shiro-like strings, put in a trie.
The extremely fast compressed trie implementation.
trie implementation in javascript
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 prefix searches
Functions for modifying a unified-latex AST
An Ethereum statemanager implementation
Minimalistic trie implementation for autosuggest and autocomplete components.
Lightweight Path Trie for TypeScript and JavaScript
neato compression of key-value data
Array manipulation, ordering, searching, summarizing, etc.
Utilities for treating frozen JavaScript objects as persistent immutable collections.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
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.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Which kind of Typed Array is this JavaScript value? Works cross-realm, without `instanceof`, and despite Symbol.toStringTag.
An ES7/ES2016 spec-compliant `Array.prototype.includes` shim/polyfill/replacement that works as far down as ES3.
A simple list of possible Typed Array names.
Is this value a JS ArrayBuffer?
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.