typescript implementation of the prefix trie data structure
JS Trie / DAWG classes
Модуль поддержки CORS для @e22m4u/js-trie-router
trie implementation in javascript
Модуль OpenAPI документации для @e22m4u/js-trie-router
Unicode Trie data structure for fast character metadata lookup, ported from ICU
https://en.wikipedia.org/wiki/Trie
A memoization algorithm in which each function argument represents a new key, creating a trie of caches as defined by the array in your first argument.
Trie Data Structure to support cspell.
HTTP маршрутизатор для Node.js на основе префиксного дерева
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Curated collection of data structures for the JavaScript/TypeScript.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Fast and tiny fuzzy-search utility
Crazy fast http radix based router
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Strongly typed trie data structure for path and URL-like strings.
Provides fast access to unicode character properties
Check permissions using Shiro-like strings, put in a trie.
Radix Trie in Javascript
Minimalistic trie implementation for autosuggest and autocomplete components.
neato compression of key-value data
No description provided.
No description provided.
No description provided.