Struct Order

pub struct Order(/* private fields */);

The order used for the ACORN algorithm.

Implementations

impl Order

pub fn new(input: usize) -> Self

Create a new Order for constructing an Acorn generator.

Examples

use acorn_prng::Order;

let order = Order::new(45);

Note that the input is clamped between 45 and u16::MAX rather than rejected.

Trait Implementations

impl Debug for Order

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

Formats the value using the given formatter.

impl PartialEq for Order

fn eq(&self, other: &Order) -> 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 Eq for Order

impl StructuralPartialEq for Order