Create an array of unique values, in order, from the input arrays
Chroma Cloud Splade sparse embedding function
Workaround a Safari bug where rest destructuring with an array literal on the rhs can yield incorrect results
Like a Set, but provides the index of the `key` in the backing array
Create an array with values that are present in the first input array but not additional ones
Lazy-evaluating list of files, based on globs or regex patterns
Create an array without duplicates
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.
Sparse Merkle tree implementation in TypeScript.
Remove duplicate values from an array. Fastest ES5 implementation.
No description provided.
Minimal async jobs utility library, with streams support
Fast JavaScript array sorting by implementing Python's Timsort algorithm
Download templates and git repositories with pleasure!
Turn anything into an array
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
Array utils
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
Sparse vector & matrix implementations