Search results
308 packages found
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
Construct Merkle Trees and verify proofs
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.
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
An efficient immutable ordered sequence of elements akin to a Vector
Trie Data Structure to support cspell.
https://en.wikipedia.org/wiki/Trie
Quick fork of unicode-trie for modernity
Unicode line-breaking algorithm from UAX #14
Performs fast search and replace on a text based on a set of rules.
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
ES Map/Set-compatible implementations with customizable equality semantics & supporting operations
Implementation of verkle trees as used in Ethereum.
Efficient data structures for every day programming
- graph
- heap
- linked list
- max heap
- max stack
- min heap
- min stack
- quick stack
- priority queue
- queue
- stack
- trie
- binary-search
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Trie-based map data structure with prefix search/query support
Immutable, structure sharing collections, including B-trees and S-trees (sequence trees)
Strongly typed trie data structure for path and URL-like strings.