A simple seeded pseudo-random number generator
Pure random number generator written in TypeScript
The Fisher-Yates (aka Knuth) shuffle for Node.js, with seeding support
A small library for generating random numbers
Generate random tokens
TypeScript definitions for brorand
Common random functions that are seedable with TypeScript support
A term-rand function-factory actor
A math util library
TypeScript definitions for knuth-shuffle-seeded
Wraps a function so that it's only ever executed once.
A JavaScript implementation of UUID version 7
Operation with random numbers for ngraph.*
URL and cookie safe UIDs
Improved randomness without any external dependencies.
This package is for getting latest agents and randomize it
A dead-simple module for picking a random item with weights.
Secure random numbers of any size in any base
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.
Yet another random library
A versatile random item picker library for JavaScript. Supports weighted and non-weighted items, multiple chained filters for both added items and pick operations, single or multiple item selection, sequential and unique picking options, weight modifiers,
Library for sampling of random values from a discrete probability distribution, using the Walker-Vose alias method.
Generate random (or seeded) names, based on 1990 Census data
A library used for generating random strings, written in TypeScript and based on Node.
Xelor was built for systems that require random bytes for processes faster than one second. Because normal random generation is based off of time as a seed, if there exists multiple calls towards SecureRandom or Rand within one second, the same number will be produced. This can be resolved on unix or linux based systems by making a system call to read /dev/urandom.
**CheapRandom** is a set of tools for pseudo random number generation from arbitrary data. The properties of the **CheapRandom seed** make convenient random number generation possible -- useful for easily repeatable software testing. The **CheapRandom algorithm** is information conserving and generally appears to produce lower chi-squared statistics than **Kernel::rand** i.e. it appears to be more random. The **CheapRandom algorithm**, an original work by Bardi Einarsson, has been in use for 6 years.
No description provided.
No description provided.
No description provided.
No description provided.