Struct StaticModInt 

pub struct StaticModInt<M> { /* private fields */ }

Trait Implementations

impl<'a, M: NttFriendly> Add<&'a StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the + operator.

fn add(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the + operation.

impl<M: Modulus> Add<&StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the + operator.

fn add(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the + operation.

impl<'a, M: NttFriendly> Add<&'a StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the + operator.

fn add(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the + operation.

impl<M: Modulus> Add<&StaticModInt<M>> for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the + operator.

fn add(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the + operation.

impl<'a, M: NttFriendly> Add<StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the + operator.

fn add(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the + operation.

impl<M: Modulus> Add<StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the + operator.

fn add(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the + operation.

impl<M: NttFriendly> Add<StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the + operator.

fn add(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the + operation.

impl<M: Modulus> Add for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the + operator.

fn add(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the + operation.

impl<'a, M: NttFriendly> AddAssign<&'a StaticModInt<M>> for Polynomial<M>

fn add_assign(&mut self, other: &'a StaticModInt<M>)

Performs the += operation.

impl<M: Modulus> AddAssign<&StaticModInt<M>> for StaticModInt<M>

fn add_assign(&mut self, rhs: &StaticModInt<M>)

Performs the += operation.

impl<M: NttFriendly> AddAssign<StaticModInt<M>> for Polynomial<M>

fn add_assign(&mut self, other: StaticModInt<M>)

Performs the += operation.

impl<M: Modulus> AddAssign for StaticModInt<M>

fn add_assign(&mut self, rhs: StaticModInt<M>)

Performs the += operation.

impl<'a, M: NttFriendly> BitAnd<&'a StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the & operator.

fn bitand(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the & operation.

impl<'a, M: NttFriendly> BitAnd<&'a StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the & operator.

fn bitand(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the & operation.

impl<'a, M: NttFriendly> BitAnd<StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the & operator.

fn bitand(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the & operation.

impl<M: NttFriendly> BitAnd<StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the & operator.

fn bitand(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the & operation.

impl<'a, M: NttFriendly> BitAndAssign<&'a StaticModInt<M>> for Polynomial<M>

fn bitand_assign(&mut self, other: &'a StaticModInt<M>)

Performs the &= operation.

impl<M: NttFriendly> BitAndAssign<StaticModInt<M>> for Polynomial<M>

fn bitand_assign(&mut self, other: StaticModInt<M>)

Performs the &= operation.

impl<M: Clone> Clone for StaticModInt<M>

fn clone(&self) -> StaticModInt<M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<M: Modulus> Debug for StaticModInt<M>

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

Formats the value using the given formatter.

impl<M: Modulus> Default for StaticModInt<M>

fn default() -> Self

Returns the “default value” for a type.

impl<M: Modulus> Display for StaticModInt<M>

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

Formats the value using the given formatter.

impl<'a, M: NttFriendly> Div<&'a StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the / operator.

fn div(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the / operation.

impl<M: Modulus> Div<&StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the / operator.

fn div(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the / operation.

impl<'a, M: NttFriendly> Div<&'a StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the / operator.

fn div(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the / operation.

impl<M: Modulus> Div<&StaticModInt<M>> for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the / operator.

fn div(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the / operation.

impl<'a, M: NttFriendly> Div<StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the / operator.

fn div(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the / operation.

impl<M: Modulus> Div<StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the / operator.

fn div(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the / operation.

impl<M: NttFriendly> Div<StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the / operator.

fn div(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the / operation.

impl<M: Modulus> Div for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the / operator.

fn div(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the / operation.

impl<'a, M: NttFriendly> DivAssign<&'a StaticModInt<M>> for Polynomial<M>

fn div_assign(&mut self, other: &'a StaticModInt<M>)

Performs the /= operation.

impl<M: Modulus> DivAssign<&StaticModInt<M>> for StaticModInt<M>

fn div_assign(&mut self, rhs: &StaticModInt<M>)

Performs the /= operation.

impl<M: NttFriendly> DivAssign<StaticModInt<M>> for Polynomial<M>

fn div_assign(&mut self, other: StaticModInt<M>)

Performs the /= operation.

impl<M: Modulus> DivAssign for StaticModInt<M>

fn div_assign(&mut self, rhs: StaticModInt<M>)

Performs the /= operation.

impl<I: RemEuclidU32, M: Modulus> From<I> for StaticModInt<M>

fn from(x: I) -> Self

Converts to this type from the input type.

impl<M: Modulus> Hash for StaticModInt<M>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<M: Modulus> ModIntBase for StaticModInt<M>

fn modulus() -> u32

fn get(self) -> u32

unsafe fn new_unchecked(val: u32) -> Self

fn new(n: impl RemEuclidU32) -> Self

fn recip(self) -> Self

fn checked_recip(self) -> Option<Self>

fn pow(self, iexp: u64) -> Self

impl<'a, M: NttFriendly> Mul<&'a StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the * operator.

fn mul(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the * operation.

impl<M: Modulus> Mul<&StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the * operator.

fn mul(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the * operation.

impl<'a, M: NttFriendly> Mul<&'a StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the * operator.

fn mul(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the * operation.

impl<M: Modulus> Mul<&StaticModInt<M>> for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the * operator.

fn mul(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the * operation.

impl<'a, M: NttFriendly> Mul<StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the * operator.

fn mul(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the * operation.

impl<M: Modulus> Mul<StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the * operator.

fn mul(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the * operation.

impl<M: NttFriendly> Mul<StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the * operator.

fn mul(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the * operation.

impl<M: Modulus> Mul for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the * operator.

fn mul(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the * operation.

impl<'a, M: NttFriendly> MulAssign<&'a StaticModInt<M>> for Polynomial<M>

fn mul_assign(&mut self, other: &'a StaticModInt<M>)

Performs the *= operation.

impl<M: Modulus> MulAssign<&StaticModInt<M>> for StaticModInt<M>

fn mul_assign(&mut self, rhs: &StaticModInt<M>)

Performs the *= operation.

impl<M: NttFriendly> MulAssign<StaticModInt<M>> for Polynomial<M>

fn mul_assign(&mut self, other: StaticModInt<M>)

Performs the *= operation.

impl<M: Modulus> MulAssign for StaticModInt<M>

fn mul_assign(&mut self, rhs: StaticModInt<M>)

Performs the *= operation.

impl<M: Modulus> Neg for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl<M: PartialEq> PartialEq for StaticModInt<M>

fn eq(&self, other: &StaticModInt<M>) -> 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<'a, M: Modulus> Product<&'a StaticModInt<M>> for StaticModInt<M>

fn product<S>(iter: S) -> Self

where S: Iterator<Item = &'a Self>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<M: Modulus> Product for StaticModInt<M>

fn product<S>(iter: S) -> Self

where S: Iterator<Item = Self>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<'a, M: NttFriendly> Rem<&'a StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the % operator.

fn rem(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the % operation.

impl<'a, M: NttFriendly> Rem<&'a StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the % operator.

fn rem(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the % operation.

impl<'a, M: NttFriendly> Rem<StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the % operator.

fn rem(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the % operation.

impl<M: NttFriendly> Rem<StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the % operator.

fn rem(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the % operation.

impl<'a, M: NttFriendly> RemAssign<&'a StaticModInt<M>> for Polynomial<M>

fn rem_assign(&mut self, other: &'a StaticModInt<M>)

Performs the %= operation.

impl<M: NttFriendly> RemAssign<StaticModInt<M>> for Polynomial<M>

fn rem_assign(&mut self, other: StaticModInt<M>)

Performs the %= operation.

impl<'a, M: NttFriendly> Sub<&'a StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the - operator.

fn sub(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the - operation.

impl<M: Modulus> Sub<&StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the - operator.

fn sub(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the - operation.

impl<'a, M: NttFriendly> Sub<&'a StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the - operator.

fn sub(self, other: &'a StaticModInt<M>) -> Polynomial<M>

Performs the - operation.

impl<M: Modulus> Sub<&StaticModInt<M>> for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the - operator.

fn sub(self, rhs: &StaticModInt<M>) -> StaticModInt<M>

Performs the - operation.

impl<'a, M: NttFriendly> Sub<StaticModInt<M>> for &'a Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the - operator.

fn sub(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the - operation.

impl<M: Modulus> Sub<StaticModInt<M>> for &StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the - operator.

fn sub(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the - operation.

impl<M: NttFriendly> Sub<StaticModInt<M>> for Polynomial<M>

type Output = Polynomial<M>

The resulting type after applying the - operator.

fn sub(self, other: StaticModInt<M>) -> Polynomial<M>

Performs the - operation.

impl<M: Modulus> Sub for StaticModInt<M>

type Output = StaticModInt<M>

The resulting type after applying the - operator.

fn sub(self, rhs: StaticModInt<M>) -> StaticModInt<M>

Performs the - operation.

impl<'a, M: NttFriendly> SubAssign<&'a StaticModInt<M>> for Polynomial<M>

fn sub_assign(&mut self, other: &'a StaticModInt<M>)

Performs the -= operation.

impl<M: Modulus> SubAssign<&StaticModInt<M>> for StaticModInt<M>

fn sub_assign(&mut self, rhs: &StaticModInt<M>)

Performs the -= operation.

impl<M: NttFriendly> SubAssign<StaticModInt<M>> for Polynomial<M>

fn sub_assign(&mut self, other: StaticModInt<M>)

Performs the -= operation.

impl<M: Modulus> SubAssign for StaticModInt<M>

fn sub_assign(&mut self, rhs: StaticModInt<M>)

Performs the -= operation.

impl<'a, M: Modulus> Sum<&'a StaticModInt<M>> for StaticModInt<M>

fn sum<S>(iter: S) -> Self

where S: Iterator<Item = &'a Self>,

Takes an iterator and generates Self from the elements by “summing up” the items.

impl<M: Modulus> Sum for StaticModInt<M>

fn sum<S>(iter: S) -> Self

where S: Iterator<Item = Self>,

Takes an iterator and generates Self from the elements by “summing up” the items.

impl<M: Copy> Copy for StaticModInt<M>

impl<M: Eq> Eq for StaticModInt<M>

impl<M> StructuralPartialEq for StaticModInt<M>