Struct relp_num::NonZeroFactorization

pub struct NonZeroFactorization<Factor, Power> {
    pub sign: NonZeroSign,
    pub factors: Vec<(Factor, Power)>,
}

Prime factorization representation of a nonzero rational number.

Includes a sign.

Fields

sign: NonZeroSign

Whether the number is negative.

factors: Vec<(Factor, Power)>

(prime factor, power) tuples.

The factors should all be smaller than 64 bits and can have negative powers; that is, appear in the denominator. The powers can’t be zero, as this is a sparse representation.

When this field is empty, the value 1 or -1 is represented, depending on sign.

Trait Implementations

impl<Factor: Clone, Power: Clone> Clone for NonZeroFactorization<Factor, Power>

fn clone(&self) -> NonZeroFactorization<Factor, Power>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Factor: Debug, Power: Debug> Debug for NonZeroFactorization<Factor, Power>

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

Formats the value using the given formatter.

impl<Factor: PartialEq, Power: PartialEq> PartialEq for NonZeroFactorization<Factor, Power>

fn eq(&self, other: &NonZeroFactorization<Factor, Power>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<Factor: Eq, Power: Eq> Eq for NonZeroFactorization<Factor, Power>

impl<Factor, Power> StructuralPartialEq for NonZeroFactorization<Factor, Power>