Struct Composite

pub struct Composite { /* private fields */ }

Composite natural number: c = prod p_k^n_k.

Implementations

impl Composite

pub fn new<I, P>(value: I) -> Self

where I: IntoIterator<Item = P>, P: Into<PrimePower>,

Construct from prime power iterator (its factors)

pub fn primes(&self) -> impl Iterator<Item = Prime> + use<'_>

The distinct prime factors of this Composite

pub fn prime_powers(&self) -> impl Iterator<Item = PrimePower> + use<'_>

The prime power factors of this Composite

pub fn prime_power<P>(&self, p: P) -> PrimePower

where P: Into<Prime>,

The prime power factor for prime p

pub fn factors(&self) -> impl Iterator<Item = Prime> + use<'_>

All prime factors of this Composite

pub fn has_prime<P>(&self, p: P) -> bool

where P: Into<Prime>,

If the composite contains the Prime

pub fn remove_prime<P>(&mut self, p: P) -> Option<PrimePower>

where P: Into<Prime>,

Removes all powers of a Prime from the Composite, returning the PrimePower

pub fn without_p<P>(&self, p: P) -> Composite

where P: Into<Prime>,

Remove prime p from the Composite factors

pub fn mod_neg(&self, d: u32) -> u32

Modular negation n - d

let c = Composite::new([(2, 1), (3, 2), (5, 1)]);
assert_eq!(88, c.mod_neg(2));

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

Greatest common divisor

use adic::Composite;
let n1 = Composite::try_from(6)?;
let n2 = Composite::try_from(15)?;
assert_eq!(Composite::try_from(3)?, n1.gcd(&n2));

pub fn lcm(&self, other: &Self) -> Self

Least common multiple

use adic::Composite;
let n1 = Composite::try_from(6)?;
let n2 = Composite::try_from(15)?;
assert_eq!(Composite::try_from(30)?, n1.lcm(&n2));

Trait Implementations

impl Clone for Composite

fn clone(&self) -> Composite

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Composite

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

Formats the value using the given formatter.

impl Display for Composite

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

Formats the value using the given formatter.

impl Div<&Composite> for u32

type Output = u32

The resulting type after applying the / operator.

fn div(self, rhs: &Composite) -> Self::Output

Performs the / operation.

impl Div<Composite> for u32

type Output = u32

The resulting type after applying the / operator.

fn div(self, rhs: Composite) -> Self::Output

Performs the / operation.

impl Divisible for Composite

fn value32(&self) -> u32

Integer value of the Divisible

fn value_big(&self) -> BigUint

Integer value of the Divisible

fn z0(&self) -> u32

Returns zero

fn m1(&self) -> u32

Integer value minus 1

fn digit_range(&self) -> Range<u32>

Digit range [0, val) = 0..val

fn display_digit(&self, d: u32) -> String

Display digit, mod this divisible. If divisible less than 37, use alphanumeric digits 0-9a-z. If greater, use integers surrounded by square brackets.

fn display_zero(&self) -> String

Display digit zero, mod this divisible. If divisible less than 37, just 0, otherwise surround by square brackets.

fn multi_digit_range(&self, num_digits: usize) -> MultiProduct<Range<u32>>

Multiple digit range [000, 1000) = [0..val, 0..val, 0..val]

fn carmichael(&self) -> Composite

Carmichael function of this Divisible

fn carmichael_pow(&self, cpower: u32) -> Composite

Carmichael function of a power of this Divisible

impl From<&Composite> for BigUint

fn from(c: &Composite) -> Self

Converts to this type from the input type.

impl From<&Composite> for u32

fn from(c: &Composite) -> Self

Converts to this type from the input type.

impl From<Composite> for BigUint

fn from(c: Composite) -> Self

Converts to this type from the input type.

impl From<Composite> for Natural

fn from(value: Composite) -> Self

Converts to this type from the input type.

impl From<Composite> for u32

fn from(c: Composite) -> Self

Converts to this type from the input type.

impl From<NonZero<u32>> for Composite

fn from(value: NonZero<u32>) -> Self

Converts to this type from the input type.

impl From<Prime> for Composite

fn from(value: Prime) -> Self

Converts to this type from the input type.

impl From<PrimePower> for Composite

fn from(value: PrimePower) -> Self

Converts to this type from the input type.

impl Mul for Composite

type Output = Composite

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl One for Composite

fn one() -> Self

Composite(1), no prime factors, multiplicative identity

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

impl PartialEq for Composite

fn eq(&self, other: &Composite) -> 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 Pow<u32> for Composite

type Output = Composite

The result after applying the operator.

fn pow(self, power: u32) -> Self::Output

Returns self to the power rhs.

impl Rem<&Composite> for u32

type Output = u32

The resulting type after applying the % operator.

fn rem(self, rhs: &Composite) -> Self::Output

Performs the % operation.

impl Rem<Composite> for Natural

type Output = BigUint

The resulting type after applying the % operator.

fn rem(self, rhs: Composite) -> Self::Output

Performs the % operation.

impl Rem<Composite> for u32

type Output = u32

The resulting type after applying the % operator.

fn rem(self, rhs: Composite) -> Self::Output

Performs the % operation.

impl TryFrom<BigUint> for Composite

type Error = AdicError

The type returned in the event of a conversion error.

fn try_from(value: BigUint) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Composite> for isize

type Error = TryFromIntError

The type returned in the event of a conversion error.

fn try_from(c: Composite) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Composite> for usize

type Error = TryFromIntError

The type returned in the event of a conversion error.

fn try_from(c: Composite) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<u32> for Composite

type Error = AdicError

The type returned in the event of a conversion error.

fn try_from(value: u32) -> Result<Self, Self::Error>

Performs the conversion.

impl Eq for Composite

impl StructuralPartialEq for Composite