Generate a random second.
A function to parse floating point hexadecimal strings as defined by the WebAssembly specification
A reliable pseudo random number generator
Generate random numbers from various distributions.
TypeScript definitions for d3-random
Fastest random ID and random string generation for Node.js
Measure the difference between two strings using the Levenshtein distance algorithm
URL and cookie safe UIDs
A random word slug generator pre-loaded with many words
Use the random function in CSS
delay the evaluation of a paramless async function and cache the result
Generate a cryptographically strong random string
An alias package for `crypto.randomBytes` in Node.js and/or browsers
Operation with random numbers for ngraph.*
Random utility functions for ethers.
Secure, audited & minimal implementation of BIP39 mnemonic phrases
A Pulumi package to safely use randomness in Pulumi programs.
Provides functions for detecting if the host environment supports the WebCrypto API
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.
Generate a random integer
Statistical routines and probability distributions.
math-random is an isomorphic, drop-in replacement for `Math.random` that uses cryptographically secure random number generation, where available
Generate random numbers with a seed, useful for reproducible tests
Beta distributed pseudorandom numbers.
My second ruby gem. Plays a random selected song from the genre you choose.
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.
Catpop is a gem that provides a random cat emoji popup for Rails applications. The emoji appears at a random position on the screen and disappears after a few seconds.
Usually Resque workers work on queues in the given order (if there is something in the first, work it, otherwise if the there is something in the second, work on it, and so on). This plugin randomizes the order of the queues based on weights, so that a given queue will be the first queue to try based on a probability weight. Given queues A, B, C, D and weights 4, 3, 2, 1, repsectively, A will be first 40% of the time, B 30%, C 20%, and D 10%. In addition, when B is first, A will be second 4/7ths of the time (4 / [4+2+1]), and so on. The project is inspired by resque-fairly, which unfortunately mathematically does not give you this control over the weights.
No description provided.
No description provided.