Search results
298 packages found
https://en.wikipedia.org/wiki/Trie
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
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Composable trie based router
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Curated collection of data structures for the JavaScript/TypeScript.
- bag
- bimap
- bit array
- bit set
- bit vector
- bitset
- bk tree
- burkhard-keller tree
- cache
- circular buffer
- counter
- data structures
- default map
- deque
- View more
An implementation of the Aho-Corasick algorithm in TypeScript.
Trie Data Structure to support cspell.
Apache Shiro permission style using Trie data structure
Binary Merkle Tree operations on data
Generate regular expressions that match a set of strings
Radix Trie in Javascript
An efficient immutable ordered sequence of elements akin to a Vector
A radix tree map-like structure for /route/:like/keys and values
Javascript versions of classic software development algorithms
- algorithms
- dataStructures
- binaryHeap
- binarySearchTree
- bst
- linkedList
- maxHeap
- minHeap
- queue
- stack
- stackQueue
- trie
- permutation
- shuffle
- View more
Fast prefix operations for strings of digits
A map implementation that supports multiple keys
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
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.
A fast router middleware for ingress
Minimal trie datastructure representation
- trie
- trie-d
- auto complete
- near match
- search
- hashmatch
- node-trie
- trie-search
- keywords-search
- dynamic trie
- word search
- word
- autocomplete
- autosearch
- View more