Implementation of paper 'An O(ND) Difference Algorithm and Its Variations' on array
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
Guarantees an array back
High-performance 2D spatial index for rectangles (based on R*-tree with bulk loading and bulk insertion algorithms)
Work with IANA language tags.
Oboe.js reads json, giving you the objects as they are found without waiting for the stream to finish
mdast utility to make a tree compact
The smallest and simplest JavaScript priority queue
Matches strings against configurable strings, globs, regular expressions, and/or functions
Manipulate strings according to the word parsing rules of the UNIX Bourne shell.
Workaround a Safari bug where rest destructuring with an array literal on the rhs can yield incorrect results
Flowtype linting rules for ESLint by flow-typed
Create an array of unique values, in order, from the input arrays
Promisify a callback-based function
SaxonJS XSLT 3.0 processor: command line interface to SaxonJS
Utility for converting between WGS84 lat/lng and MGRS coordinates
Draw perfect pressure-sensitive freehand strokes.
Fast Splay tree for Node and browser
JavaScript utilities for Vega.
Different binary search tree implementations, including a self-balancing one (AVL)
A small implementation of `crypto.getRandomValues` for React Native. This is useful to polyfill for libraries like [uuid](https://www.npmjs.com/package/uuid) that depend on it.
The Merkle Trees package contains typescript implementations of the various Merkle Trees required by the system.
*Note*: This package is not meant to be used directly by the end user. It is a dependency for the Studio Experiences packages. Changes to this package are not guaranteed to follow semantic versioning and may break without notice if used directly.
Lazy-evaluating list of files, based on globs or regex patterns