Fast simple seedable pseudo-random number generator
Fast random sampling using reservoir sampling
Simple fast random helper functions
A serialization format optimized for fast random access of unstructured data
Property based testing for Vitest based on fast-check
A fast implementation of a fisher-yates shuffle that does not mutate the source array.
Useful TypeScript utilities.
[](https://discord.gg/poimandres)
Super fast random color generator from the open-color palette
Generate random numbers from various distributions.
TypeScript definitions for d3-random
Fastest random ID and random string generation for Node.js
A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic
URL and cookie safe UIDs
Fastest UUIDv4 with good RNG
Use the random function in CSS
Generate a cryptographically strong random string
An alias package for `crypto.randomBytes` in Node.js and/or browsers
Generate a cryptographically-random BigInt with the given number of bits of entropy.
React is a JavaScript library for building user interfaces.
Validate XML, Parse XML, Build XML without C/C++ based libraries
A fast Mersenne Twister
Random utility functions for ethers.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
ultra fast order by rand() solution, see http://jan.kneschke.de/projects/mysql/order-by-rand/
This gem provides a Ruby API for Conditional Random Fields (CRF).
Returns random records for Ruby Models fast and quick
Simple Midway game-server client library
ISAAC is a fast, cryptographically secure pseudo random number generator with strong statistical properties. This gem provides both a pure Ruby and a C extension based implementation which conforms to the Ruby 2 api for Random, with some enhancements. So, you should be able to use it as a drop in replacement for Ruby's (Mersenne Twister based) PRNG.
A library for working with LC/MS runs. Part of mspire. Has parsers for mzXML v1, 2, and 3, mzData (currently broken) and mzML (planned). Can convert to commonly desired search output (such as mgf). Fast random access of scans, and fast reading of the entire file.
PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict. This library aims to act as the ruby interface to this set of functions
A Mersenne-Twister random number generator (RNG) packed up as a class. This allows multiple RNG streams to be active at the same time (which Ruby's normal rand/srand does not allow). The Mersenne-Twister is implemented with fast C code for speed.
|> Distributed locks with "prioritized lock acquisition queue" capabilities based on the Redis Database. |> Each lock request is put into the request queue (each lock is hosted by its own queue separately from other queues) and processed in order of their priority (FIFO). |> Each lock request lives some period of time (RTTL) (with requeue capabilities) which guarantees the request queue will never be stacked. |> In addition to the classic `queued` (FIFO) strategy RQL supports `random` (RANDOM) lock obtaining strategy when any acquirer from the lock queue can obtain the lock regardless the position in the queue. |> Provides flexible invocation flow, parametrized limits (lock request ttl, lock ttl, queue ttl, lock attempts limit, fast failing, etc), logging and instrumentation.
Dicey provides a CLI executable and a Ruby API for fast calculation of distribution of weights or probabilities of dice rolls, with support for all kinds of numeric dice, and non-numeric ones too! Results can be exported as JSON, YAML or a gnuplot data file. It can also be used to roll dice. While not the primary focus, rolling is well supported, including ability to seed random source for reproducible results.
Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order. Torid exists to solve the problem of generating UUIDs that when ordered lexically, they are also ordered temporally. I needed a way to generate ids for events that are entering a system with the following criteria: 1. Fast ID generation 2. No central coordinating server/system 3. No local storage 4. Library code, that is multiple apps on the same machine can use the same code and they will not generate duplicate ids 5. Eventually stored in a UUID field in a database. So 128bit ids are totally fine. The IDs that Torid generates are 128bit IDs made up of 2, 64bit parts. * 64bit microsecond level UNIX timestamp * 64bit hash of the system hostname, process id and a random value.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.