Struct dashu_int::fast_div::ConstDivisor

pub struct ConstDivisor(/* private fields */);

An UBig with some pre-computed fields to support faster division.

Implementations

impl ConstDivisor

pub fn new(n: UBig) -> ConstDivisor

pub const fn from_word(word: u64) -> Self

pub const fn from_dword(dword: u128) -> Self

pub fn value(&self) -> UBig

impl ConstDivisor

pub fn reduce<'a, T: IntoRing<'a, ConstDivisor, RingElement = Reduced<'a>>>( &'a self, x: T ) -> Reduced<'_>

Create an element of the modulo ring from another type.

Examples

let ring = ConstDivisor::new(UBig::from(100u8));
let x = ring.reduce(-1234);
let y = ring.reduce(IBig::from(3366));
assert!(x == y);

Trait Implementations

impl Debug for ConstDivisor

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

Formats the value using the given formatter.

impl Display for ConstDivisor

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

Formats the value using the given formatter.

impl<'l, 'r> Div<&'r ConstDivisor> for &'l IBig

type Output = IBig

The resulting type after applying the / operator.

fn div(self, rhs: &ConstDivisor) -> IBig

Performs the / operation.

impl<'l, 'r> Div<&'r ConstDivisor> for &'l UBig

type Output = UBig

The resulting type after applying the / operator.

fn div(self, rhs: &ConstDivisor) -> UBig

Performs the / operation.

impl<'r> Div<&'r ConstDivisor> for IBig

type Output = IBig

The resulting type after applying the / operator.

fn div(self, rhs: &ConstDivisor) -> IBig

Performs the / operation.

impl<'r> Div<&'r ConstDivisor> for UBig

type Output = UBig

The resulting type after applying the / operator.

fn div(self, rhs: &ConstDivisor) -> UBig

Performs the / operation.

impl<'r> DivAssign<&'r ConstDivisor> for IBig

fn div_assign(&mut self, rhs: &'r ConstDivisor)

Performs the /= operation.

impl<'r> DivAssign<&'r ConstDivisor> for UBig

fn div_assign(&mut self, rhs: &'r ConstDivisor)

Performs the /= operation.

impl<'l, 'r> DivRem<&'r ConstDivisor> for &'l IBig

type OutputDiv = IBig

type OutputRem = IBig

fn div_rem(self, rhs: &ConstDivisor) -> (IBig, IBig)

impl<'l, 'r> DivRem<&'r ConstDivisor> for &'l UBig

type OutputDiv = UBig

type OutputRem = UBig

fn div_rem(self, rhs: &ConstDivisor) -> (UBig, UBig)

impl<'r> DivRem<&'r ConstDivisor> for IBig

type OutputDiv = IBig

type OutputRem = IBig

fn div_rem(self, rhs: &ConstDivisor) -> (IBig, IBig)

impl<'r> DivRem<&'r ConstDivisor> for UBig

type OutputDiv = UBig

type OutputRem = UBig

fn div_rem(self, rhs: &ConstDivisor) -> (UBig, UBig)

impl<'r> DivRemAssign<&'r ConstDivisor> for IBig

type OutputRem = IBig

fn div_rem_assign(&mut self, rhs: &ConstDivisor) -> IBig

impl<'r> DivRemAssign<&'r ConstDivisor> for UBig

type OutputRem = UBig

fn div_rem_assign(&mut self, rhs: &ConstDivisor) -> UBig

impl<'a> IntoRing<'a, ConstDivisor> for IBig

type RingElement = Reduced<'a>

fn into_ring(self, ring: &ConstDivisor) -> Reduced<'_>

impl<'a> IntoRing<'a, ConstDivisor> for UBig

type RingElement = Reduced<'a>

fn into_ring(self, ring: &ConstDivisor) -> Reduced<'_>

impl<'a> IntoRing<'a, ConstDivisor> for bool

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for i128

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for i16

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for i32

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for i64

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for i8

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for isize

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for u128

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for u16

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for u32

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for u64

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for u8

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl<'a> IntoRing<'a, ConstDivisor> for usize

type RingElement = Reduced<'a>

fn into_ring(self, ring: &'a ConstDivisor) -> Reduced<'a>

impl PartialEq<ConstDivisor> for ConstDivisor

fn eq(&self, other: &ConstDivisor) -> 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 Reducer<UBig> for ConstDivisor

fn new(m: &UBig) -> Self

Create a reducer for a modulus m

fn transform(&self, target: UBig) -> UBig

Transform a normal integer into reduced form

fn check(&self, target: &UBig) -> bool

Check whether target is a valid reduced form

fn modulus(&self) -> UBig

Get the modulus in original integer type

fn residue(&self, target: UBig) -> UBig

Transform a reduced form back to normal integer

fn is_zero(&self, target: &UBig) -> bool

Test if the residue() == 0

fn add(&self, lhs: &UBig, rhs: &UBig) -> UBig

Calculate (lhs + rhs) mod m in reduced form

fn dbl(&self, target: UBig) -> UBig

Calculate 2*target mod m

fn sub(&self, lhs: &UBig, rhs: &UBig) -> UBig

Calculate (lhs - rhs) mod m in reduced form

fn neg(&self, target: UBig) -> UBig

Calculate -monty mod m in reduced form

fn mul(&self, lhs: &UBig, rhs: &UBig) -> UBig

Calculate (lhs * rhs) mod m in reduced form

fn sqr(&self, target: UBig) -> UBig

Calculate target^2 mod m in reduced form

fn inv(&self, target: UBig) -> Option<UBig>

Calculate target^-1 mod m in reduced form, it may return None when there is no modular inverse.

fn pow(&self, base: UBig, exp: &UBig) -> UBig

Calculate base ^ exp mod m in reduced form

fn add_in_place(&self, lhs: &mut T, rhs: &T)

fn sub_in_place(&self, lhs: &mut T, rhs: &T)

fn mul_in_place(&self, lhs: &mut T, rhs: &T)

impl<'l, 'r> Rem<&'r ConstDivisor> for &'l IBig

type Output = IBig

The resulting type after applying the % operator.

fn rem(self, rhs: &ConstDivisor) -> IBig

Performs the % operation.

impl<'l, 'r> Rem<&'r ConstDivisor> for &'l UBig

type Output = UBig

The resulting type after applying the % operator.

fn rem(self, rhs: &ConstDivisor) -> UBig

Performs the % operation.

impl<'r> Rem<&'r ConstDivisor> for IBig

type Output = IBig

The resulting type after applying the % operator.

fn rem(self, rhs: &ConstDivisor) -> IBig

Performs the % operation.

impl<'r> Rem<&'r ConstDivisor> for UBig

type Output = UBig

The resulting type after applying the % operator.

fn rem(self, rhs: &ConstDivisor) -> UBig

Performs the % operation.

impl<'r> RemAssign<&'r ConstDivisor> for IBig

fn rem_assign(&mut self, rhs: &'r ConstDivisor)

Performs the %= operation.

impl<'r> RemAssign<&'r ConstDivisor> for UBig

fn rem_assign(&mut self, rhs: &'r ConstDivisor)

Performs the %= operation.

impl Eq for ConstDivisor

impl StructuralEq for ConstDivisor

impl StructuralPartialEq for ConstDivisor