Enum Primality 

pub enum Primality {
    Prime,
    Probable,
    Composite,
}

For primality test we use the classic Rabin-Miller test.

Variants

Prime

The number has been confirmed, deterministically, to be prime.

Probable

The number is only probably prime. Using Rabin-Miller we can get the probability as low as we want, but we can’t get it to 0 (Prime). For deterministic primality testing, see TODO: wiki link.

Composite

The number has been confirmed to be a composite number (i.e. not Prime).

Trait Implementations

impl Debug for Primality

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

Formats the value using the given formatter.

impl PartialEq for Primality

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