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.

Create a filled generic array.

Returns an array with only the unique values from the first array, by excluding all values from additional arrays using strict equality for comparisons.

Big List of Naughty Strings.

  [![npm version](https://badge.fury.io/js/react-native-big-calendar.sv

Create a zero-filled generic array.

Translation between JavaScript values and Buffers

Array utils

flattens nested vertex data into a typed array

Linear memory in TypeScript

Rotate an array by a given number of steps

Find the first element in an array that passes a callback test. Equivalent to underscore.find()

Typescript tools that help with migration to the strict mode

Industrial strength point in polygon test

Self-host the Big Shoulders font in a neatly bundled NPM package.

Create an error from an array of error messages

Recursively merge two dictionaries together

High-performance, virtualized list for React Native. Efficiently renders large datasets with recycler API for smooth scrolling and low memory usage. Ideal for fast, scalable, customizable lists on Android, iOS, and web.

Auto scroll dom elements

Rope-based persistent sequence type