Enum RngAlgorithm

pub enum RngAlgorithm {
    XorShift,
    ChaCha,
    PassThrough,
    Recorder,
    // some variants omitted
}

Identifies a particular RNG algorithm supported by proptest.

Proptest supports dynamic configuration of algorithms to allow it to continue operating with persisted regression files and to allow the configuration to be expressed in the Config struct.

Variants

XorShift

The XorShift algorithm. This was the default up through and including Proptest 0.9.0.

It is faster than ChaCha but produces lower quality randomness and has some pathological cases where it may fail to produce outputs that are random even to casual observation.

The seed must be exactly 16 bytes.

ChaCha

The ChaCha algorithm. This became the default with Proptest 0.9.1.

The seed must be exactly 32 bytes.

PassThrough

This is not an actual RNG algorithm, but instead returns data directly from its “seed”.

This is useful when Proptest is being driven from some other entropy source, such as a fuzzer.

If the seed is depleted, the RNG will return 0s forever.

Note that in cases where a new RNG is to be derived from an existing one, the data is split evenly between them, regardless of how much entropy is actually needed. This means that combinators like prop_perturb and prop_flat_map can require extremely large inputs.

Recorder

This is equivalent to the ChaCha RNG, with the addition that it records the bytes used to create a value.

This is useful when Proptest is used for fuzzing, and a corpus of initial inputs need to be created. Note that in these cases, you need to use the TestRunner API directly yourself instead of using the proptest! macro, as otherwise there is no way to obtain the bytes this captures.

Trait Implementations

impl Clone for RngAlgorithm

fn clone(&self) -> RngAlgorithm

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RngAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RngAlgorithm

fn default() -> Self

Returns the “default value” for a type.

impl Display for RngAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl FromStr for RngAlgorithm

type Err = ()

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, ()>

Parses a string s to return a value of this type.

impl PartialEq for RngAlgorithm

fn eq(&self, other: &RngAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RngAlgorithm

impl Eq for RngAlgorithm

impl StructuralPartialEq for RngAlgorithm

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 1 byte

Size for each variant:

• XorShift: 0 bytes
• ChaCha: 0 bytes
• PassThrough: 0 bytes
• Recorder: 0 bytes
• _NonExhaustive: 0 bytes