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.
Validates if a value is an array.
Meteor's Random Package for Straight Node
Run an array of functions in parallel
TypeScript definitions for shuffle-array
random fill from browserify stand alone
Maintain and search through a sorted array using some low level functions
A random weighted item chooser with custom seed option for JavaScript and TypeScript.
Fast and powerful array sorting. Sort an array of objects by one or more properties. Any number of nested properties or custom comparison functions may be used.
Lazy-evaluating list of files, based on globs or regex patterns
Array#filter for older browsers.
delay the evaluation of a paramless async function and cache the result
finds an item in an array matching a predicate function, and returns its index
Extremely fast double-ended queue implementation
Choose randomly from a selection of elements
Validates if a value is an integer array.
Array manipulation, ordering, searching, summarizing, etc.
Simple Module for generating Random Strings
Get the last or last n elements in an array.
TypeScript definitions for react-native-get-random-values
Require Node module and immediately remove it from module cache to force loading again next time
A collection of random utilities
A ponyfill for the ES 2015 (ES6) `Array.from()`.
Guarantees an array back