// Copyright 2018 Developers of the Rand project.

// Copyright 2013-2017 The Rust Project Developers.

//

// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or

// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license

// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your

// option. This file may not be copied, modified, or distributed

// except according to those terms.

//! Utilities for random number generation

//!

//! Rand provides utilities to generate random numbers, to convert them to

//! useful types and distributions, and some randomness-related algorithms.

//!

//! # Quick Start

//!

//! ```

//! // The prelude import enables methods we use below, specifically

//! // Rng::random, Rng::sample, SliceRandom::shuffle and IndexedRandom::choose.

//! use rand::prelude::*;

//!

//! // Get an RNG:

//! let mut rng = rand::rng();

//!

//! // Try printing a random unicode code point (probably a bad idea)!

//! println!("char: '{}'", rng.random::<char>());

//! // Try printing a random alphanumeric value instead!

//! println!("alpha: '{}'", rng.sample(rand::distr::Alphanumeric) as char);

//!

//! // Generate and shuffle a sequence:

//! let mut nums: Vec<i32> = (1..100).collect();

//! nums.shuffle(&mut rng);

//! // And take a random pick (yes, we didn't need to shuffle first!):

//! let _ = nums.choose(&mut rng);

//! ```

//!

//! # The Book

//!

//! For the user guide and further documentation, please read

//! [The Rust Rand Book](https://rust-random.github.io/book).

#![doc(

    html_logo_url = "https://www.rust-lang.org/logos/rust-logo-128x128-blk.png",

    html_favicon_url = "https://www.rust-lang.org/favicon.ico",

    html_root_url = "https://rust-random.github.io/rand/"

)]

#![deny(missing_docs)]

#![deny(missing_debug_implementations)]

#![doc(test(attr(allow(unused_variables), deny(warnings))))]

#![no_std]

#![cfg_attr(feature = "simd_support", feature(portable_simd))]

#![cfg_attr(

    all(feature = "simd_support", target_feature = "avx512bw"),

    feature(stdarch_x86_avx512)

)]

#![cfg_attr(docsrs, feature(doc_auto_cfg))]

#![allow(

    clippy::float_cmp,

    clippy::neg_cmp_op_on_partial_ord,

    clippy::nonminimal_bool

)]

#![deny(clippy::undocumented_unsafe_blocks)]

#[cfg(feature = "alloc")]

extern crate alloc;

#[cfg(feature = "std")]

extern crate std;

#[allow(unused)]

macro_rules! trace { ($($x:tt)*) => (

    #[cfg(feature = "log")] {

        log::trace!($($x)*)

    }

) }

#[allow(unused)]

macro_rules! debug { ($($x:tt)*) => (

    #[cfg(feature = "log")] {

        log::debug!($($x)*)

    }

) }

#[allow(unused)]

macro_rules! info { ($($x:tt)*) => (

    #[cfg(feature = "log")] {

        log::info!($($x)*)

    }

) }

#[allow(unused)]

macro_rules! warn { ($($x:tt)*) => (

    #[cfg(feature = "log")] {

        log::warn!($($x)*)

    }

) }

#[allow(unused)]

macro_rules! error { ($($x:tt)*) => (

    #[cfg(feature = "log")] {

        log::error!($($x)*)

    }

) }

// Re-export rand_core itself

pub use rand_core;

// Re-exports from rand_core

pub use rand_core::{CryptoRng, RngCore, SeedableRng, TryCryptoRng, TryRngCore};

// Public modules

pub mod distr;

pub mod prelude;

mod rng;

pub mod rngs;

pub mod seq;

// Public exports

#[cfg(feature = "thread_rng")]

pub use crate::rngs::thread::rng;

/// Access the thread-local generator

///

/// Use [`rand::rng()`](rng()) instead.

#[cfg(feature = "thread_rng")]

#[deprecated(since = "0.9.0", note = "Renamed to `rng`")]

#[inline]

pub fn thread_rng() -> crate::rngs::ThreadRng {

    rng()

}

pub use rng::{Fill, Rng};

#[cfg(feature = "thread_rng")]

use crate::distr::{Distribution, StandardUniform};

/// Generate a random value using the thread-local random number generator.

///

/// This function is shorthand for <code>[rng()].[random()](Rng::random)</code>:

///

/// -   See [`ThreadRng`] for documentation of the generator and security

/// -   See [`StandardUniform`] for documentation of supported types and distributions

///

/// # Examples

///

/// ```

/// let x = rand::random::<u8>();

/// println!("{}", x);

///

/// let y = rand::random::<f64>();

/// println!("{}", y);

///

/// if rand::random() { // generates a boolean

///     println!("Better lucky than good!");

/// }

/// ```

///

/// If you're calling `random()` repeatedly, consider using a local `rng`

/// handle to save an initialization-check on each usage:

///

/// ```

/// use rand::Rng; // provides the `random` method

///

/// let mut rng = rand::rng(); // a local handle to the generator

///

/// let mut v = vec![1, 2, 3];

///

/// for x in v.iter_mut() {

///     *x = rng.random();

/// }

/// ```

///

/// [`StandardUniform`]: distr::StandardUniform

/// [`ThreadRng`]: rngs::ThreadRng

#[cfg(feature = "thread_rng")]

#[inline]

pub fn random<T>() -> T

where

    StandardUniform: Distribution<T>,

{

    rng().random()

}

Unexecuted instantiation: rand::random::<[u8; 5]>

Unexecuted instantiation: rand::random::<_>

/// Return an iterator over [`random()`] variates

///

/// This function is shorthand for

/// <code>[rng()].[random_iter](Rng::random_iter)()</code>.

///

/// # Example

///

/// ```

/// let v: Vec<i32> = rand::random_iter().take(5).collect();

/// println!("{v:?}");

/// ```

#[cfg(feature = "thread_rng")]

#[inline]

pub fn random_iter<T>() -> distr::Iter<StandardUniform, rngs::ThreadRng, T>

where

    StandardUniform: Distribution<T>,

{

    rng().random_iter()

}

/// Generate a random value in the given range using the thread-local random number generator.

///

/// This function is shorthand for

/// <code>[rng()].[random_range](Rng::random_range)(<var>range</var>)</code>.

///

/// # Example

///

/// ```

/// let y: f32 = rand::random_range(0.0..=1e9);

/// println!("{}", y);

///

/// let words: Vec<&str> = "Mary had a little lamb".split(' ').collect();

/// println!("{}", words[rand::random_range(..words.len())]);

/// ```

/// Note that the first example can also be achieved (without `collect`'ing

/// to a `Vec`) using [`seq::IteratorRandom::choose`].

#[cfg(feature = "thread_rng")]

#[inline]

pub fn random_range<T, R>(range: R) -> T

where

    T: distr::uniform::SampleUniform,

    R: distr::uniform::SampleRange<T>,

{

    rng().random_range(range)

}

/// Return a bool with a probability `p` of being true.

///

/// This function is shorthand for

/// <code>[rng()].[random_bool](Rng::random_bool)(<var>p</var>)</code>.

///

/// # Example

///

/// ```

/// println!("{}", rand::random_bool(1.0 / 3.0));

/// ```

///

/// # Panics

///

/// If `p < 0` or `p > 1`.

#[cfg(feature = "thread_rng")]

#[inline]

#[track_caller]

pub fn random_bool(p: f64) -> bool {

    rng().random_bool(p)

}

/// Return a bool with a probability of `numerator/denominator` of being

/// true.

///

/// That is, `random_ratio(2, 3)` has chance of 2 in 3, or about 67%, of

/// returning true. If `numerator == denominator`, then the returned value

/// is guaranteed to be `true`. If `numerator == 0`, then the returned

/// value is guaranteed to be `false`.

///

/// See also the [`Bernoulli`] distribution, which may be faster if

/// sampling from the same `numerator` and `denominator` repeatedly.

///

/// This function is shorthand for

/// <code>[rng()].[random_ratio](Rng::random_ratio)(<var>numerator</var>, <var>denominator</var>)</code>.

///

/// # Panics

///

/// If `denominator == 0` or `numerator > denominator`.

///

/// # Example

///

/// ```

/// println!("{}", rand::random_ratio(2, 3));

/// ```

///

/// [`Bernoulli`]: distr::Bernoulli

#[cfg(feature = "thread_rng")]

#[inline]

#[track_caller]

pub fn random_ratio(numerator: u32, denominator: u32) -> bool {

    rng().random_ratio(numerator, denominator)

}

/// Fill any type implementing [`Fill`] with random data

///

/// This function is shorthand for

/// <code>[rng()].[fill](Rng::fill)(<var>dest</var>)</code>.

///

/// # Example

///

/// ```

/// let mut arr = [0i8; 20];

/// rand::fill(&mut arr[..]);

/// ```

///

/// Note that you can instead use [`random()`] to generate an array of random

/// data, though this is slower for small elements (smaller than the RNG word

/// size).

#[cfg(feature = "thread_rng")]

#[inline]

#[track_caller]

pub fn fill<T: Fill + ?Sized>(dest: &mut T) {

    dest.fill(&mut rng())

}

#[cfg(test)]

mod test {

    use super::*;

    /// Construct a deterministic RNG with the given seed

    pub fn rng(seed: u64) -> impl RngCore {

        // For tests, we want a statistically good, fast, reproducible RNG.

        // PCG32 will do fine, and will be easy to embed if we ever need to.

        const INC: u64 = 11634580027462260723;

        rand_pcg::Pcg32::new(seed, INC)

    }

    #[test]

    #[cfg(feature = "thread_rng")]

    fn test_random() {

        let _n: u64 = random();

        let _f: f32 = random();

        #[allow(clippy::type_complexity)]

        let _many: (

            (),

            [(u32, bool); 3],

            (u8, i8, u16, i16, u32, i32, u64, i64),

            (f32, (f64, (f64,))),

        ) = random();

    }

    #[test]

    #[cfg(feature = "thread_rng")]

    fn test_range() {

        let _n: usize = random_range(42..=43);

        let _f: f32 = random_range(42.0..43.0);

    }

}