Struct poly_commit::Fft

pub struct Fft<F: FftField> {
    pub elements: Vec<F>,
    /* private fields */
}

Fields

elements: Vec<F>

Implementations

impl<F: FftField> Fft<F>

pub fn new(k: usize) -> Self

pub fn size(&self) -> usize

polynomial degree

pub fn generator(&self) -> F

nth unity of root

pub fn dft(&self, coeffs: &mut Polynomial<F>)

perform discrete fourier transform

pub fn idft(&self, coeffs: &mut Polynomial<F>)

perform classic inverse discrete fourier transform

pub fn coset_dft(&self, coeffs: &mut Polynomial<F>)

perform discrete fourier transform on coset

pub fn coset_idft(&self, coeffs: &mut Polynomial<F>)

perform discrete fourier transform on coset

pub fn poly_mul(&self, rhs: Polynomial<F>, lhs: Polynomial<F>) -> Polynomial<F>

polynomial multiplication

Trait Implementations

impl<F: Clone + FftField> Clone for Fft<F>

fn clone(&self) -> Fft<F>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Debug + FftField> Debug for Fft<F>

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

Formats the value using the given formatter.

impl<F: PartialEq + FftField> PartialEq<Fft<F>> for Fft<F>

fn eq(&self, other: &Fft<F>) -> 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<F: Eq + FftField> Eq for Fft<F>

impl<F: FftField> StructuralEq for Fft<F>

impl<F: FftField> StructuralPartialEq for Fft<F>