Struct Polynomial

pub struct Polynomial<F: Field, N: ArrayLength<F> + Add<B1>>(/* private fields */)
where
    Add1<N>: ArrayLength<F>;

Implementations

impl<F: Field, N: ArrayLength<F> + Add<B1>> Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

pub fn deg(&self) -> usize

pub fn leading_coefficient(&self) -> F

Trait Implementations

impl<F: Field, N: ArrayLength<F> + Add<B1> + Max<M>, M: ArrayLength<F> + Add<B1>> Add<Polynomial<F, M>> for Polynomial<F, N>

where Add1<N>: ArrayLength<F>, Add1<M>: ArrayLength<F>, Maximum<N, M>: ArrayLength<F> + Add<B1>, Add1<Maximum<N, M>>: ArrayLength<F>,

type Output = Polynomial<F, <N as Max<M>>::Output>

The resulting type after applying the + operator.

fn add(self, rhs: Polynomial<F, M>) -> Self::Output

Performs the + operation.

impl<F: Clone + Field, N: Clone + ArrayLength<F> + Add<B1>> Clone for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

fn clone(&self) -> Polynomial<F, N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Field, N: Debug + ArrayLength<F> + Add<B1>> Debug for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

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

Formats the value using the given formatter.

impl<F: Default + Field, N: Default + ArrayLength<F> + Add<B1>> Default for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

fn default() -> Polynomial<F, N>

Returns the “default value” for a type.

impl<F: Field + PartialEq, N: ArrayLength<F> + Add<B1> + Sub<M> + Max<Sum<Diff<N, M>, M>, Output = N>, M: ArrayLength<F> + Add<B1>> Div<Polynomial<F, M>> for Polynomial<F, N>

where Add1<N>: ArrayLength<F>, Add1<M>: ArrayLength<F>, Diff<N, M>: ArrayLength<F> + Add<B1> + Add<M> + Max<Output = Diff<N, M>> + Add<Diff<N, M>>, Add1<Diff<N, M>>: ArrayLength<F>, Sum<Diff<N, M>, M>: ArrayLength<F> + Add<B1>, Add1<Sum<Diff<N, M>, M>>: ArrayLength<F>, Maximum<N, Sum<Diff<N, M>, M>>: ArrayLength<F> + Add<B1>, Add1<Maximum<N, Sum<Diff<N, M>, M>>>: ArrayLength<F>,

type Output = Result<Polynomial<F, <N as Sub<M>>::Output>, ()>

The resulting type after applying the / operator.

fn div(self, rhs: Polynomial<F, M>) -> Self::Output

Performs the / operation.

impl<F: Field, N: ArrayLength<F> + Add<B1>> From<GenericArray<F, <N as Add<B1>>::Output>> for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

fn from(original: GenericArray<F, Add1<N>>) -> Polynomial<F, N>

Converts to this type from the input type.

impl<F: Field, N: ArrayLength<F> + Add<M> + Add<B1>, M: ArrayLength<F> + Add<B1>> Mul<Polynomial<F, M>> for Polynomial<F, N>

where Add1<N>: ArrayLength<F>, Add1<M>: ArrayLength<F>, Sum<N, M>: ArrayLength<F> + Add<B1>, Add1<Sum<N, M>>: ArrayLength<F>,

type Output = Polynomial<F, <N as Add<M>>::Output>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<F, M>) -> Self::Output

Performs the * operation.

impl<F: Field, N: ArrayLength<F> + Add<B1>> Neg for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

type Output = Polynomial<F, N>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<F: PartialEq + Field, N: PartialEq + ArrayLength<F> + Add<B1>> PartialEq for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,

fn eq(&self, other: &Polynomial<F, N>) -> 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<F: Field, N: ArrayLength<F> + Add<B1> + Max<M>, M: ArrayLength<F> + Add<B1>> Sub<Polynomial<F, M>> for Polynomial<F, N>

where Add1<N>: ArrayLength<F>, Add1<M>: ArrayLength<F>, Maximum<N, M>: ArrayLength<F> + Add<B1>, Add1<Maximum<N, M>>: ArrayLength<F>,

type Output = Polynomial<F, <N as Max<M>>::Output>

The resulting type after applying the - operator.

fn sub(self, rhs: Polynomial<F, M>) -> Self::Output

Performs the - operation.

impl<F: Field, N: ArrayLength<F> + Add<B1>> StructuralPartialEq for Polynomial<F, N>

where Add1<N>: ArrayLength<F>,