23 stable releases

2.0.2 Mar 24, 2024
2.0.1 Sep 25, 2023
2.0.0 Jun 9, 2023
1.9.0 Feb 14, 2023
1.3.3 Jul 7, 2020

#2 in Algorithms

Download history 1922292/week @ 2024-01-03 2017389/week @ 2024-01-10 2171608/week @ 2024-01-17 2224041/week @ 2024-01-24 2392500/week @ 2024-01-31 2172650/week @ 2024-02-07 2164977/week @ 2024-02-14 2283345/week @ 2024-02-21 2293823/week @ 2024-02-28 2238088/week @ 2024-03-06 2258993/week @ 2024-03-13 2388938/week @ 2024-03-20 2335802/week @ 2024-03-27 2451209/week @ 2024-04-03 2440543/week @ 2024-04-10 1991669/week @ 2024-04-17

9,668,534 downloads per month
Used in 17,485 crates (556 directly)

Apache-2.0 OR MIT

32KB
594 lines

fastrand

Build License Cargo Documentation

A simple and fast random number generator.

The implementation uses Wyrand, a simple and fast generator but not cryptographically secure.

Examples

Flip a coin:

if fastrand::bool() {
    println!("heads");
} else {
    println!("tails");
}

Generate a random i32:

let num = fastrand::i32(..);

Choose a random element in an array:

let v = vec![1, 2, 3, 4, 5];
let i = fastrand::usize(..v.len());
let elem = v[i];

Sample values from an array with O(n) complexity (n is the length of array):

fastrand::choose_multiple(vec![1, 4, 5].iter(), 2);
fastrand::choose_multiple(0..20, 12);

Shuffle an array:

let mut v = vec![1, 2, 3, 4, 5];
fastrand::shuffle(&mut v);

Generate a random Vec or String:

use std::iter::repeat_with;

let v: Vec<i32> = repeat_with(|| fastrand::i32(..)).take(10).collect();
let s: String = repeat_with(fastrand::alphanumeric).take(10).collect();

To get reproducible results on every run, initialize the generator with a seed:

// Pick an arbitrary number as seed.
fastrand::seed(7);

// Now this prints the same number on every run:
println!("{}", fastrand::u32(..));

To be more efficient, create a new Rng instance instead of using the thread-local generator:

use std::iter::repeat_with;

let rng = fastrand::Rng::new();
let mut bytes: Vec<u8> = repeat_with(|| rng.u8(..)).take(10_000).collect();

This crate aims to expose a core set of useful randomness primitives. For more niche algorithms, consider using the fastrand-contrib crate alongside this one.

Features

  • std (enabled by default): Enables the std library. This is required for the global generator and global entropy. Without this feature, [Rng] can only be instantiated using the with_seed method.
  • js: Assumes that WebAssembly targets are being run in a JavaScript environment.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~0–370KB