Enum snarkvm_algorithms::fft::polynomial::DenseOrSparsePolynomial

source · [−]

pub enum DenseOrSparsePolynomial<'a, F: 'a + Field> {
    SPolynomial(Cow<'a, SparsePolynomial<F>>),
    DPolynomial(Cow<'a, DensePolynomial<F>>),
}

Expand description

Represents either a sparse polynomial or a dense one.

Variants

`SPolynomial(Cow<'a, SparsePolynomial<F>>)`

Represents the case where self is a sparse polynomial

`DPolynomial(Cow<'a, DensePolynomial<F>>)`

Represents the case where self is a dense polynomial

Implementations

source

impl<F: Field> DenseOrSparsePolynomial<'_, F>

source

pub fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

source

pub fn degree(&self) -> usize

Return the degree of `self.

source

pub fn divide_with_q_and_r(
&self,
divisor: &Self
) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>

Divide self by another (sparse or dense) polynomial, and returns the quotient and remainder.

source

impl<F: PrimeField> DenseOrSparsePolynomial<'_, F>

source

pub fn evaluate_over_domain(
poly: impl Into<Self>,
domain: EvaluationDomain<F>
) -> Evaluations<F>

Construct Evaluations by evaluating a polynomial over the domain domain.

Trait Implementations

source

impl<'a, F: Clone + 'a + Field> Clone for DenseOrSparsePolynomial<'a, F>

source

fn clone(&self) -> DenseOrSparsePolynomial<'a, F>

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<'a, F: 'a + Field> From<&'a DensePolynomial<F>> for DenseOrSparsePolynomial<'a, F>

source

fn from(other: &'a DensePolynomial<F>) -> Self

Performs the conversion.

source

impl<'a, F: Field> From<&'a SparsePolynomial<F>> for DenseOrSparsePolynomial<'a, F>

source

fn from(other: &'a SparsePolynomial<F>) -> Self

Performs the conversion.

source

impl<F: Field> From<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

source

fn from(other: DensePolynomial<F>) -> Self

Performs the conversion.

source

impl<F: Field> From<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

source

fn from(other: SparsePolynomial<F>) -> Self

Performs the conversion.

source

impl<F: Field> Into<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

source

fn into(self) -> DensePolynomial<F>

Performs the conversion.

source

impl<F: Field> TryInto<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

type Error = ()

The type returned in the event of a conversion error.

source

fn try_into(self) -> Result<SparsePolynomial<F>, ()>

Performs the conversion.

Auto Trait Implementations

impl<'a, F> RefUnwindSafe for DenseOrSparsePolynomial<'a, F> where
F: RefUnwindSafe,

impl<'a, F> Send for DenseOrSparsePolynomial<'a, F>

impl<'a, F> Sync for DenseOrSparsePolynomial<'a, F>

impl<'a, F> Unpin for DenseOrSparsePolynomial<'a, F> where
F: Unpin,

impl<'a, F> UnwindSafe for DenseOrSparsePolynomial<'a, F> where
F: UnwindSafe + RefUnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Performs the conversion.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

pub fn into(self) -> U

Performs the conversion.

impl<T> Pointable for T

pub const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

pub unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Enum snarkvm_algorithms::fft::polynomial::DenseOrSparsePolynomial

Variants

SPolynomial(Cow<'a, SparsePolynomial<F>>)

DPolynomial(Cow<'a, DensePolynomial<F>>)

Implementations

impl<F: Field> DenseOrSparsePolynomial<'_, F>

pub fn is_zero(&self) -> bool

pub fn degree(&self) -> usize

pub fn divide_with_q_and_r( &self, divisor: &Self) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>

impl<F: PrimeField> DenseOrSparsePolynomial<'_, F>

pub fn evaluate_over_domain( poly: impl Into<Self>, domain: EvaluationDomain<F>) -> Evaluations<F>

Trait Implementations

impl<'a, F: Clone + 'a + Field> Clone for DenseOrSparsePolynomial<'a, F>

fn clone(&self) -> DenseOrSparsePolynomial<'a, F>

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

impl<'a, F: 'a + Field> From<&'a DensePolynomial<F>> for DenseOrSparsePolynomial<'a, F>

fn from(other: &'a DensePolynomial<F>) -> Self

impl<'a, F: Field> From<&'a SparsePolynomial<F>> for DenseOrSparsePolynomial<'a, F>

fn from(other: &'a SparsePolynomial<F>) -> Self

impl<F: Field> From<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

fn from(other: DensePolynomial<F>) -> Self

impl<F: Field> From<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

fn from(other: SparsePolynomial<F>) -> Self

impl<F: Field> Into<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

fn into(self) -> DensePolynomial<F>

impl<F: Field> TryInto<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

type Error = ()

fn try_into(self) -> Result<SparsePolynomial<F>, ()>

Auto Trait Implementations

impl<'a, F> RefUnwindSafe for DenseOrSparsePolynomial<'a, F> where F: RefUnwindSafe,

impl<'a, F> Send for DenseOrSparsePolynomial<'a, F>

impl<'a, F> Sync for DenseOrSparsePolynomial<'a, F>

impl<'a, F> Unpin for DenseOrSparsePolynomial<'a, F> where F: Unpin,

impl<'a, F> UnwindSafe for DenseOrSparsePolynomial<'a, F> where F: UnwindSafe + RefUnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T> Pointable for T

pub const ALIGN: usize

type Init = T

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

pub unsafe fn drop(ptr: usize)

impl<T> Same<T> for T

type Output = T

impl<T> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

pub fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where V: MultiLane<T>,

pub fn vzip(self) -> V

`SPolynomial(Cow<'a, SparsePolynomial<F>>)`

`DPolynomial(Cow<'a, DensePolynomial<F>>)`

pub fn divide_with_q_and_r(
&self,
divisor: &Self
) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>

pub fn evaluate_over_domain(
poly: impl Into<Self>,
domain: EvaluationDomain<F>
) -> Evaluations<F>

impl<'a, F> RefUnwindSafe for DenseOrSparsePolynomial<'a, F> where
F: RefUnwindSafe,

impl<'a, F> Unpin for DenseOrSparsePolynomial<'a, F> where
F: Unpin,

impl<'a, F> UnwindSafe for DenseOrSparsePolynomial<'a, F> where
F: UnwindSafe + RefUnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,