Search results
300 packages found
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Radix Trie-Based Configuration Platform
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
Generate regular expressions that match a set of strings
Trie datastructure with customer delimiters
A list of common data structures implemented in Javascript
- data structures
- linked list
- binary search tree
- queue
- stack
- trie
- min heap
- doubly linked list
- circular linked list
Data structure and graph processing library written in modern JavaScript
- data structures
- javascript
- graph
- undirected graph
- directed graph
- weighted graph
- breadth first search
- BFS
- depth first search
- DFS
- dijkstra
- shortest path
- prim
- minimum spanning tree
- View more
The TRIE data structure and search algorithm, on top of leveldb.
A key-value store utilising the filesystem.
This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure
Check permissions using Shiro-like strings, put in a trie.
Observable Path Trie Store
- observable
- reactive
- rxjs
- trie
- tree
- store
- state
- observable tree
- observable state
- observable store
- reactive tree
- reactive state
- reactive store
Implementation of verkle trees as used in Ethereum.
A wrapper of MARISA library.
```shell script npm install @teamawesome/multi-dict ``` # Usage The aim of multi-dict is to behave just like a set of nested maps, but with an easy to use api. It supports all the regular methods of `Map`, including the iterators. ```js import Dict
Simple, modifiable item-title search index based on radix tries.