Struct num_modular::PreMulInv2by1

pub struct PreMulInv2by1<T> { /* private fields */ }

A wrapper of Normalized2by1Divisor that can be used as a Reducer

Implementations

impl PreMulInv2by1<u8>

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

pub const fn divisor(&self) -> u8

Get the normalized divisor.

impl PreMulInv2by1<u16>

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

pub const fn divisor(&self) -> u16

Get the normalized divisor.

impl PreMulInv2by1<u32>

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

pub const fn divisor(&self) -> u32

Get the normalized divisor.

impl PreMulInv2by1<u64>

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

pub const fn divisor(&self) -> u64

Get the normalized divisor.

impl PreMulInv2by1<usize>

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

pub const fn divisor(&self) -> usize

Get the normalized divisor.

impl<T> PreMulInv2by1<T>

pub const fn divider(&self) -> &Normalized2by1Divisor<T>

pub const fn shift(&self) -> u32

Trait Implementations

impl<T: Clone> Clone for PreMulInv2by1<T>

fn clone(&self) -> PreMulInv2by1<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for PreMulInv2by1<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq<PreMulInv2by1<T>> for PreMulInv2by1<T>

fn eq(&self, other: &PreMulInv2by1<T>) -> 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<u16> for PreMulInv2by1<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 PreMulInv2by1<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 PreMulInv2by1<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 Reducer<u8> for PreMulInv2by1<u8>

fn new(m: &u8) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> u8

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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<usize> for PreMulInv2by1<usize>

fn new(m: &usize) -> Self

Create a reducer for a modulus m

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

Transform a normal integer into reduced form

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

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

fn modulus(&self) -> usize

Get the modulus in original integer type

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

Test if the residue() == 0

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

Calculate (lhs + rhs) mod m in reduced form

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

Calculate 2*target mod m

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

Calculate (lhs - rhs) mod m in reduced form

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

Calculate -monty mod m in reduced form

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

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

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

Calculate (lhs * rhs) mod m in reduced form

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

Calculate target^2 mod m in reduced form

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

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> Copy for PreMulInv2by1<T>

impl<T: Eq> Eq for PreMulInv2by1<T>

impl<T> StructuralEq for PreMulInv2by1<T>

impl<T> StructuralPartialEq for PreMulInv2by1<T>