Search
exact-trie
Trie and radix tree implementation tailored towards exact matches.
v1.0.13 URL:
https://unpkg.com/exact-trie@1.0.13/index.js
Open
Browse Files
trie
prefix-tree
radix-tree
comparison
string-search
trie-typed
Trie, prefix tree
v2.0.4 URL:
https://unpkg.com/trie-typed@2.0.4/dist/index.js
Open
Browse Files
Trie
prefix tree
prefixtree
Prefix tree
prefix-tree
prefix
digital tree
digitaltree
Digital Tree
digital-tree
digital
radix tree
radixtree
Radix Tree
radix-tree
string retrieval
string
character nodes
character
node
nodes
charater search
search
prefix matching
dictionary
auto-completion
autocompletion
auto complete
autocomplete
auto-complete
string indexing
indexing
efficient lookup
space optimization
word
words
word storage
wordstorage
wordstore
operations
dictionary implement
text processing
string comparison
comparison
lexicographic order
substring search
substringsearch
substring-search
javascript
java script
JavaScript
js
typescript
type script
TypeScript
ts
data
structure
structures
data structure
datastructure
data-structure
data structures
datastructures
data-structures
in data structures
in data structure
DataStructure
DataStructures
Node.js
CommonJS
ES6
UMD
esmodule
java.util
c++ stl
c++ std
Python collections
System.Collections.Generic
STL
stl
util
collection
Collection
collections
Collections
namespace-lookup
Find the longest namespace that a string starts with
v0.2.1 URL:
https://unpkg.com/namespace-lookup@0.2.1/index.js
Open
Browse Files
trie
radix-tree
reminist
<div align="center">
v1.0.5 URL:
https://unpkg.com/reminist@1.0.5/dist/cjs/index.cjs
Open
Browse Files
typescript
router
routing
radix-tree
trie
performance
high-performance
fast
lightweight
zero-dependency
nodejs
bun
deno
javascript
url-router
path-matching
type-safe
optimized
low-latency
compact-prefix-tree
A serializable compact prefix trie
v2.0.2 URL:
https://unpkg.com/compact-prefix-tree@2.0.2/index.js
Open
Browse Files
compact-prefix-tree
compact-radix-tree
compact-trie
data-structure
patricia-tree
prefix-tree
prefix
radix-tree
trie