Struct num_modular::PreMulInv3by2

pub struct PreMulInv3by2<T, D> { /* private fields */ }

A wrapper of Normalized3by2Divisor that can be used as a Reducer

Implementations

impl PreMulInv3by2<u8, u16>

pub const fn new(divisor: u16) -> Self

pub const fn divisor(&self) -> u16

Get the normalized divisor.

impl PreMulInv3by2<u16, u32>

pub const fn new(divisor: u32) -> Self

pub const fn divisor(&self) -> u32

Get the normalized divisor.

impl PreMulInv3by2<u32, u64>

pub const fn new(divisor: u64) -> Self

pub const fn divisor(&self) -> u64

Get the normalized divisor.

impl PreMulInv3by2<u64, u128>

pub const fn new(divisor: u128) -> Self

pub const fn divisor(&self) -> u128

Get the normalized divisor.

impl PreMulInv3by2<usize, u128>

pub const fn new(divisor: u128) -> Self

pub const fn divisor(&self) -> u128

Get the normalized divisor.

impl<T, D> PreMulInv3by2<T, D>

pub const fn divider(&self) -> &Normalized3by2Divisor<T, D>

pub const fn shift(&self) -> u32

Trait Implementations

impl<T: Clone, D: Clone> Clone for PreMulInv3by2<T, D>

fn clone(&self) -> PreMulInv3by2<T, D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, D: Debug> Debug for PreMulInv3by2<T, D>

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

Formats the value using the given formatter.

impl<T: PartialEq, D: PartialEq> PartialEq<PreMulInv3by2<T, D>> for PreMulInv3by2<T, D>

fn eq(&self, other: &PreMulInv3by2<T, D>) -> 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<u128> for PreMulInv3by2<u64, u128>

fn new(m: &u128) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> u128

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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 Reducer<u128> for PreMulInv3by2<usize, u128>

fn new(m: &u128) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> u128

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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 Reducer<u16> for PreMulInv3by2<u8, u16>

fn new(m: &u16) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> u16

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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 Reducer<u32> for PreMulInv3by2<u16, u32>

fn new(m: &u32) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> u32

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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 Reducer<u64> for PreMulInv3by2<u32, u64>

fn new(m: &u64) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> u64

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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<T: Copy, D: Copy> Copy for PreMulInv3by2<T, D>

impl<T: Eq, D: Eq> Eq for PreMulInv3by2<T, D>

impl<T, D> StructuralEq for PreMulInv3by2<T, D>

impl<T, D> StructuralPartialEq for PreMulInv3by2<T, D>