pub trait NTTFriendly<Rhs = Self, Output = Self>: Clone + Copy + Add<Rhs, Output = Output> + Sub<Rhs, Output = Output> + Mul<Rhs, Output = Output> + Div<Rhs, Output = Output> + MulAssign<Rhs> + Zero + From<u32> + Fp {
    // Required methods
    fn order() -> u32;
    fn rem() -> u32;
    fn root() -> Self;

    // Provided method
    fn root_pow2m(a: u32) -> Self { ... }
}
Expand description

FFTに必要な関数

Required Methods§

source

fn order() -> u32

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

source

fn rem() -> u32

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

source

fn root() -> Self

原始根

Provided Methods§

source

fn root_pow2m(a: u32) -> Self

2^m 乗根

Implementors§

source§

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