Struct cp_library_rs::number_theory::modint::modint_::Modint

pub struct Modint<const MOD: u32>(pub u32);

Tuple Fields

0: u32

Implementations

impl<const MOD: u32> Modint<MOD>

pub fn new(n: u32) -> Self

pub fn rational_reconstruction(&self) -> Option<(usize, usize)>

Trait Implementations

impl<const MOD: u32> Add<Modint<MOD>> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self

Performs the + operation.

impl<const MOD: u32> Add<usize> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the + operator.

fn add(self, rhs: usize) -> Self

Performs the + operation.

impl<const MOD: u32> AddAssign<Modint<MOD>> for Modint<MOD>

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<const MOD: u32> AddAssign<usize> for Modint<MOD>

fn add_assign(&mut self, rhs: usize)

Performs the += operation.

impl<const MOD: u32> Clone for Modint<MOD>

fn clone(&self) -> Modint<MOD>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<const MOD: u32> Debug for Modint<MOD>

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

Formats the value using the given formatter.

impl<const MOD: u32> Default for Modint<MOD>

fn default() -> Modint<MOD>

Returns the “default value” for a type.

impl<const MOD: u32> Display for Modint<MOD>

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

Formats the value using the given formatter.

impl<const MOD: u32> Div<Modint<MOD>> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<const MOD: u32> Div<usize> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the / operator.

fn div(self, rhs: usize) -> Self

Performs the / operation.

impl<const MOD: u32> DivAssign<Modint<MOD>> for Modint<MOD>

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

impl<const MOD: u32> DivAssign<usize> for Modint<MOD>

fn div_assign(&mut self, rhs: usize)

Performs the /= operation.

impl<const MOD: u32> Fp for Modint<MOD>

fn pow(&self, rhs: u32) -> Self

fn inv(&self) -> Self

impl<const MOD: u32> From<i32> for Modint<MOD>

fn from(value: i32) -> Self

Converts to this type from the input type.

impl<const MOD: u32> From<i64> for Modint<MOD>

fn from(value: i64) -> Self

Converts to this type from the input type.

impl<const MOD: u32> From<isize> for Modint<MOD>

fn from(value: isize) -> Self

Converts to this type from the input type.

impl<const MOD: u32> From<u32> for Modint<MOD>

fn from(value: u32) -> Self

Converts to this type from the input type.

impl<const MOD: u32> From<u64> for Modint<MOD>

fn from(value: u64) -> Self

Converts to this type from the input type.

impl<const MOD: u32> From<usize> for Modint<MOD>

fn from(value: usize) -> Self

Converts to this type from the input type.

impl<const MOD: u32> FromStr for Modint<MOD>

type Err = ParseIntError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl<const MOD: u32> Hash for Modint<MOD>

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<const MOD: u32> Mul<Modint<MOD>> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<const MOD: u32> Mul<usize> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<const MOD: u32> MulAssign<Modint<MOD>> for Modint<MOD>

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<const MOD: u32> MulAssign<usize> for Modint<MOD>

fn mul_assign(&mut self, rhs: usize)

Performs the *= operation.

impl NTTFriendly<Modint<MOD998>, Modint<MOD998>> for M998

fn order() -> u32

M = 2^k * m + 1 を満たすような k

fn rem() -> u32

M = 2^k * m + 1 を満たすような m

fn root() -> Self

原始根

fn root_pow2m(a: u32) -> Self

2^m 乗根

impl<const MOD: u32> Neg for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl NumProbability<Modint<MOD107>, Modint<MOD107>> for M107

const MOD: usize = 1_000_000_007usize

impl NumProbability<Modint<MOD998>, Modint<MOD998>> for M998

const MOD: usize = 998_244_353usize

impl<const MOD: u32> One for Modint<MOD>

fn one() -> Self

fn is_one(&self) -> boolwhere Self: PartialEq,

impl<const MOD: u32> PartialEq<Modint<MOD>> for Modint<MOD>

fn eq(&self, other: &Modint<MOD>) -> 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<const MOD: u32> PartialEq<usize> for Modint<MOD>

fn eq(&self, other: &usize) -> 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<const MOD: u32> Product<Modint<MOD>> for Modint<MOD>

fn product<I: Iterator<Item = Modint<MOD>>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by multiplying the items.

impl<const MOD: u32> Sub<Modint<MOD>> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self

Performs the - operation.

impl<const MOD: u32> Sub<usize> for Modint<MOD>

type Output = Modint<MOD>

The resulting type after applying the - operator.

fn sub(self, rhs: usize) -> Self

Performs the - operation.

impl<const MOD: u32> SubAssign<Modint<MOD>> for Modint<MOD>

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<const MOD: u32> SubAssign<usize> for Modint<MOD>

fn sub_assign(&mut self, rhs: usize)

Performs the -= operation.

impl<const MOD: u32> Sum<Modint<MOD>> for Modint<MOD>

fn sum<I: Iterator<Item = Modint<MOD>>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by “summing up” the items.

impl<const MOD: u32> Zero for Modint<MOD>

fn zero() -> Self

fn is_zero(&self) -> boolwhere Self: PartialEq,

impl<const MOD: u32> Copy for Modint<MOD>

impl<const MOD: u32> Eq for Modint<MOD>

impl<const MOD: u32> StructuralEq for Modint<MOD>

impl<const MOD: u32> StructuralPartialEq for Modint<MOD>