Struct red_primality::PrimeFactorization

pub struct PrimeFactorization { /* fields omitted */ }

Represents a collection of powers of prime factors.

Methods

impl PrimeFactorization

pub fn new() -> Self

Creates a new PrimeFactoriazation

pub fn add(&mut self, prime: Prime, power: u64)

Add a power of a prime to this factorization.

pub fn add_pf(&mut self, pf: &Self, fac: u64)

Add all the factors in the other PrimeFactorization into this one.

pub fn iter<'a>(&'a self) -> impl 'a + Iterator<Item = (Prime, u64)>

Create an iterator over the contained factors and powers.

pub fn product(&self) -> u64

Multiply out the contained factors and powers, yielding the product they represent.

pub fn euler_totient(&self) -> u64

Calculates Euler's totient function.

pub fn mobius(&self) -> i64

Calculates the Möbius function for this prime factorization.

pub fn for_all_divisors<F: FnMut(u64)>(&self, f: F)

Runs a closure on all divisors of n, including 1 and n.

No particular order of divisors is guaranteed.

Trait Implementations

impl Clone for PrimeFactorization

fn clone(&self) -> PrimeFactorization

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PrimeFactorization

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

Formats the value using the given formatter.

impl Eq for PrimeFactorization

impl Ord for PrimeFactorization

fn cmp(&self, other: &PrimeFactorization) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl PartialEq<PrimeFactorization> for PrimeFactorization

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

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

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

This method tests for !=.

impl PartialOrd<PrimeFactorization> for PrimeFactorization

fn partial_cmp(&self, other: &PrimeFactorization) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &PrimeFactorization) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &PrimeFactorization) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &PrimeFactorization) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &PrimeFactorization) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralEq for PrimeFactorization

impl StructuralPartialEq for PrimeFactorization