A fast implementation of a fisher-yates shuffle that does not mutate the source array.
The Fisher-Yates (aka Knuth) shuffle for Node.js, with seeding support
The Fisher-Yates (aka Knuth) shuffle for Browser and Node.js
Randomize the order of the elements in a given array.
Randomize the order of items in an array
Shuffle Array based on a Seed
A linear congruential pseudorandom number generator (LCG) whose output is shuffled.
## Install
TypeScript definitions for knuth-shuffle-seeded
The lodash method `_.shuffle` exported as a module.
Categorize, sort, and filter a responsive grid of items
TypeScript definitions for shuffle-seed
TypeScript definitions for shuffle-array
Fast deep equal
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
fast-csv parsing package
return the elements of an array in random order
Effortless animation between DOM changes (eg. list reordering) using the FLIP technique.
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
Validate XML, Parse XML, Build XML without C/C++ based libraries
React is a JavaScript library for building user interfaces.
Property based testing framework for JavaScript (like QuickCheck)
Force V8 to use fast properties for an object
Random numbers.