Struct Factors 

pub struct Factors<T: PrimitiveUnsigned, const N: usize> { /* private fields */ }

A struct that contains the prime factorization of an integer. See implementations of the Factor trait for more information.

Trait Implementations

impl<T: Clone + PrimitiveUnsigned, const N: usize> Clone for Factors<T, N>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PrimitiveUnsigned, const N: usize> Debug for Factors<T, N>

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

Formats the value using the given formatter.

impl<T: Eq + PrimitiveUnsigned, const N: usize> Eq for Factors<T, N>

impl<T: PrimitiveUnsigned, const N: usize> IntoIterator for Factors<T, N>

type IntoIter = FactorsIterator<T, N>

Which kind of iterator are we turning this into?

type Item = (T, u8)

The type of the elements being iterated over.

fn into_iter(self) -> FactorsIterator<T, N>

Creates an iterator from a value.

impl<T: PartialEq + PrimitiveUnsigned, const N: usize> PartialEq for Factors<T, N>

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

Equality operator ==.

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

Inequality operator !=.

impl<T: PartialEq + PrimitiveUnsigned, const N: usize> StructuralPartialEq for Factors<T, N>

impl<T: PrimitiveUnsigned, const N: usize> ToLatex for Factors<T, N>

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

Writes a Factors as a LaTeX math-mode fragment.

The fragment is the factorization written out as a product of prime powers, so the factorization of 90 becomes 2 \times 3^2 \times 5. An exponent of 1 is left off, as it is when a factorization is written by hand.

The factorization of 1 has no factors at all, and becomes 1: the empty product, which is what it multiplies out to.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is the number of distinct prime factors.

Examples

use malachite_base::num::factorization::traits::Factor;
use malachite_base::strings::latex::ToLatex;

assert_eq!(1u32.factor().to_latex_string(), "1");
assert_eq!(2u32.factor().to_latex_string(), "2");
assert_eq!(4u32.factor().to_latex_string(), r"2^2");
assert_eq!(90u32.factor().to_latex_string(), r"2 \times 3^2 \times 5");
assert_eq!(1024u32.factor().to_latex_string(), r"2^{10}");

value	fragment	renders as
1u32.factor()	1	$1$
2u32.factor()	2	$2$
4u32.factor()	2^2	$2^2$
90u32.factor()	2 \times 3^2 \times 5	$2 \times 3^2 \times 5$
1024u32.factor()	2^{10}	$2^{10}$

fn to_latex(&self) -> LatexWrapper<'_, Self>

where Self: Sized,

Converts a value to a LaTeX math-mode fragment.

fn to_latex_string(&self) -> String

where Self: Sized,

Converts a value to a LaTeX math-mode fragment, as a String.

impl<T: PrimitiveUnsigned, const N: usize> ToTypst for Factors<T, N>

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

Writes a Factors as a Typst math-mode fragment.

The fragment is the factorization written out as a product of prime powers, so the factorization of 90 becomes 2 times 3^2 times 5. An exponent of 1 is left off, as it is when a factorization is written by hand.

The factorization of 1 has no factors at all, and becomes 1: the empty product, which is what it multiplies out to.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is the number of distinct prime factors.

Examples

use malachite_base::num::factorization::traits::Factor;
use malachite_base::strings::typst::ToTypst;

assert_eq!(1u32.factor().to_typst_string(), "1");
assert_eq!(2u32.factor().to_typst_string(), "2");
assert_eq!(4u32.factor().to_typst_string(), "2^2");
assert_eq!(90u32.factor().to_typst_string(), "2 times 3^2 times 5");
assert_eq!(1024u32.factor().to_typst_string(), "2^(10)");

value	fragment
1u32.factor()	1
2u32.factor()	2
4u32.factor()	2^2
90u32.factor()	2 times 3^2 times 5
1024u32.factor()	2^(10)

fn to_typst(&self) -> TypstWrapper<'_, Self>

where Self: Sized,

Converts a value to a Typst math-mode fragment.

fn to_typst_string(&self) -> String

where Self: Sized,

Converts a value to a Typst math-mode fragment, as a String.