Struct PrimeFactors 

pub struct PrimeFactors { /* private fields */ }

The prime factorization of an integer, represented as a list of prime factors with their exponents.

Implementations

impl PrimeFactors

pub fn value(&self) -> u128

Reconstruct the original integer from its prime factorization. An empty factorization yields 1 (the empty product).

pub fn len(&self) -> usize

Return the number of distinct prime factors.

pub fn count_factors(&self) -> u32

Return the total number of prime factors (counting multiplicities).

pub fn is_empty(&self) -> bool

pub fn is_prime(&self) -> bool

pub fn factors(&self) -> &[IntFactor]

Return a slice of the prime factors with exponents.

pub fn to_vec(&self) -> Vec<u128>

Expand the factorization into a flat vector of prime factors.

pub fn gcd(&self, other: &PrimeFactors) -> PrimeFactors

Compute the GCD of two prime factorizations by intersecting common factors. Returns an empty result if either factorization is empty.

pub fn has_any_factor(n: u128) -> bool

Check if n has any non-trivial factor using wheel factorization. Returns true as soon as any factor is found, without full decomposition.

pub fn factorize(n: u128) -> Self

Compute the prime factorization of n using wheel factorization.

Trait Implementations

impl Clone for PrimeFactors

fn clone(&self) -> PrimeFactors

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PrimeFactors

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

Formats the value using the given formatter.

impl Display for PrimeFactors

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

Formats the value using the given formatter.

impl<'a> IntoIterator for &'a PrimeFactors

Iterate over the prime factors with their exponents.

type Item = &'a IntFactor

The type of the elements being iterated over.

type IntoIter = Iter<'a, IntFactor>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for PrimeFactors

Consume and iterate over the prime factors with their exponents.

type Item = IntFactor

The type of the elements being iterated over.

type IntoIter = IntoIter<IntFactor>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Ord for PrimeFactors

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

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

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for PrimeFactors

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

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl Eq for PrimeFactors

impl StructuralPartialEq for PrimeFactors