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.
Visualize relationships or network flow with an aesthetically-pleasing circular layout.
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
Validates if a value is a positive integer array.
An arbitrary length integer library for Javascript
Return the maximum length of array in JavaScript.
Validates if a value is typed-array-like.
64bit Long Integer on Buffer/Array/ArrayBuffer in Pure JavaScript
Traverse JSON Schema passing each schema object to callback
Validates if a value is a Buffer object.
Validates if a value is a number primitive, excluding NaN.
Parses and compiles CSS nth-checks to highly optimized functions.
Validates if a value is ndarray-like.
Full BCP 47 language subtag data from the official IANA repository, in JSON format with multiple indices.
Parses and manipulates multiple comma-separated integer ranges (eg 1-3,8-10)
Basic layout model and some utilities for Cytoscape.js layout extensions
Parameterised tests for Jest
Default array settings.
Test if a value is an array-like object containing only integers.
Add support for more integer widths to Buffer
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.
Validates if a value is matrix-like.
Determine the minimum array data type for storing a provided signed integer value.
Pure-JS printf