Sparse Merkle tree implementation in TypeScript.
Lazy-evaluating list of files, based on globs or regex patterns
The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.
Create an array with values that are present in the first input array but not additional ones
Create an array without duplicates
Minimal async jobs utility library, with streams support
No description provided.
Remove duplicate values from an array. Fastest ES5 implementation.
Fast JavaScript array sorting by implementing Python's Timsort algorithm
Turn anything into an array
Download templates and git repositories with pleasure!
Loop over each item in an array and call the given function on every element.
Array-slice method. Slices `array` from the `start` index up to, but not including, the `end` index.
Stringify your JSON at max speed
`Array#forEach()` but it’s possible to define where to move to next
The Merkle Trees package contains typescript implementations of the various Merkle Trees required by the system.
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
utilities for primitive JavaScript types
Array utils
Sparse vector & matrix implementations
Utility package to determine if an `Array.prototype` method properly boxes the callback's receiver and third argument.
Concatenate a readable stream's data into a single array
Parses set-cookie headers into objects
Rope-based persistent sequence type