Struct snarkvm_algorithms::fft::polynomial::SparsePolynomial

source · [−]

pub struct SparsePolynomial<F: Field> {
    pub coeffs: Vec<(usize, F)>,
}

Expand description

Stores a sparse polynomial in coefficient form.

Fields

coeffs: Vec<(usize, F)>

The coefficient a_i of x^i is stored as (i, a_i) in self.coeffs. the entries in self.coeffs are sorted in increasing order of i.

Implementations

source

impl<F: Field> SparsePolynomial<F>

source

pub fn zero() -> Self

Returns the zero polynomial.

source

pub fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

source

pub fn from_coefficients_slice(coeffs: &[(usize, F)]) -> Self

Constructs a new polynomial from a list of coefficients.

source

pub fn from_coefficients_vec(coeffs: Vec<(usize, F)>) -> Self

Constructs a new polynomial from a list of coefficients.

source

pub fn degree(&self) -> usize

Returns the degree of the polynomial.

source

pub fn evaluate(&self, point: F) -> F

Evaluates self at the given point in the field.

source

pub fn mul(&self, other: &Self) -> Self

Perform a naive n^2 multiplicatoin of self by other.

source

impl<F: PrimeField> SparsePolynomial<F>

source

pub fn evaluate_over_domain_by_ref(
&self,
domain: EvaluationDomain<F>
) -> Evaluations<F>

Evaluate self over domain.

source

pub fn evaluate_over_domain(self, domain: EvaluationDomain<F>) -> Evaluations<F>

Evaluate self over domain.

Trait Implementations

source

impl<'a, F: Field> AddAssign<&'a SparsePolynomial<F>> for DensePolynomial<F>

source

fn add_assign(&mut self, other: &'a SparsePolynomial<F>)

Performs the += operation. Read more

source

impl<F: Field> CanonicalDeserialize for SparsePolynomial<F>

source

fn deserialize<R: Read>(reader: &mut R) -> Result<Self, SerializationError>

Reads Self from reader.

source

fn deserialize_uncompressed<R: Read>(
reader: &mut R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

source

impl<F: Field> CanonicalSerialize for SparsePolynomial<F>

source

fn serialize<W: Write>(&self, writer: &mut W) -> Result<(), SerializationError>

Serializes self into writer.

source

fn serialized_size(&self) -> usize

source

fn serialize_uncompressed<W: Write>(
&self,
writer: &mut W
) -> Result<(), SerializationError>

Serializes self into writer without compression.

source

fn uncompressed_size(&self) -> usize

source

impl<F: Clone + Field> Clone for SparsePolynomial<F>

source

fn clone(&self) -> SparsePolynomial<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<F: Field> Debug for SparsePolynomial<F>

source

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

Formats the value using the given formatter. Read more

source

impl<F: Default + Field> Default for SparsePolynomial<F>

source

fn default() -> SparsePolynomial<F>

Returns the “default value” for a type. Read more

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<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

source

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

Performs the conversion.

source

impl<F: Hash + Field> Hash for SparsePolynomial<F>

source

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

Feeds a slice of this type into the given Hasher. Read more

source

impl<F: Field> Into<DensePolynomial<F>> for SparsePolynomial<F>

source

fn into(self) -> DensePolynomial<F>

Performs the conversion.

source

impl<'a, F: PrimeField> Mul<F> for &'a SparsePolynomial<F>

type Output = SparsePolynomial<F>

The resulting type after applying the * operator.

source

fn mul(self, other: F) -> Self::Output

Performs the * operation. Read more

source

impl<F: PrimeField> MulAssign<F> for SparsePolynomial<F>

source

fn mul_assign(&mut self, other: F)

Performs the *= operation. Read more

source

impl<F: PartialEq + Field> PartialEq<SparsePolynomial<F>> for SparsePolynomial<F>

source

fn eq(&self, other: &SparsePolynomial<F>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

source

fn ne(&self, other: &SparsePolynomial<F>) -> bool

This method tests for !=.

source

impl<'a, F: Field> Sub<&'a SparsePolynomial<F>> for DensePolynomial<F>

type Output = Self

The resulting type after applying the - operator.

source

fn sub(self, other: &'a SparsePolynomial<F>) -> Self::Output

Performs the - operation. Read more

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.

source

impl<F: Eq + Field> Eq for SparsePolynomial<F>

source

impl<F: Field> StructuralEq for SparsePolynomial<F>

source

impl<F: Field> StructuralPartialEq for SparsePolynomial<F>

Auto Trait Implementations

impl<F> RefUnwindSafe for SparsePolynomial<F> where
F: RefUnwindSafe,

impl<F> Send for SparsePolynomial<F>

impl<F> Sync for SparsePolynomial<F>

impl<F> Unpin for SparsePolynomial<F> where
F: Unpin,

impl<F> UnwindSafe for SparsePolynomial<F> where
F: UnwindSafe,

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<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

pub fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

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.

Struct snarkvm_algorithms::fft::polynomial::SparsePolynomial

Fields

Implementations

impl<F: Field> SparsePolynomial<F>

pub fn zero() -> Self

pub fn is_zero(&self) -> bool

pub fn from_coefficients_slice(coeffs: &[(usize, F)]) -> Self

pub fn from_coefficients_vec(coeffs: Vec<(usize, F)>) -> Self

pub fn degree(&self) -> usize

pub fn evaluate(&self, point: F) -> F

pub fn mul(&self, other: &Self) -> Self

impl<F: PrimeField> SparsePolynomial<F>

pub fn evaluate_over_domain_by_ref( &self, domain: EvaluationDomain<F>) -> Evaluations<F>

pub fn evaluate_over_domain(self, domain: EvaluationDomain<F>) -> Evaluations<F>

Trait Implementations

impl<'a, F: Field> AddAssign<&'a SparsePolynomial<F>> for DensePolynomial<F>

fn add_assign(&mut self, other: &'a SparsePolynomial<F>)

impl<F: Field> CanonicalDeserialize for SparsePolynomial<F>

fn deserialize<R: Read>(reader: &mut R) -> Result<Self, SerializationError>

fn deserialize_uncompressed<R: Read>( reader: &mut R) -> Result<Self, SerializationError>

impl<F: Field> CanonicalSerialize for SparsePolynomial<F>

fn serialize<W: Write>(&self, writer: &mut W) -> Result<(), SerializationError>

fn serialized_size(&self) -> usize

fn serialize_uncompressed<W: Write>( &self, writer: &mut W) -> Result<(), SerializationError>

fn uncompressed_size(&self) -> usize

impl<F: Clone + Field> Clone for SparsePolynomial<F>

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

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

impl<F: Field> Debug for SparsePolynomial<F>

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

impl<F: Default + Field> Default for SparsePolynomial<F>

fn default() -> SparsePolynomial<F>

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

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

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

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

impl<F: Hash + Field> Hash for SparsePolynomial<F>

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,

impl<F: Field> Into<DensePolynomial<F>> for SparsePolynomial<F>

fn into(self) -> DensePolynomial<F>

impl<'a, F: PrimeField> Mul<F> for &'a SparsePolynomial<F>

type Output = SparsePolynomial<F>

fn mul(self, other: F) -> Self::Output

impl<F: PrimeField> MulAssign<F> for SparsePolynomial<F>

fn mul_assign(&mut self, other: F)

impl<F: PartialEq + Field> PartialEq<SparsePolynomial<F>> for SparsePolynomial<F>

fn eq(&self, other: &SparsePolynomial<F>) -> bool

fn ne(&self, other: &SparsePolynomial<F>) -> bool

impl<'a, F: Field> Sub<&'a SparsePolynomial<F>> for DensePolynomial<F>

type Output = Self

fn sub(self, other: &'a SparsePolynomial<F>) -> Self::Output

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

type Error = ()

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

impl<F: Eq + Field> Eq for SparsePolynomial<F>

impl<F: Field> StructuralEq for SparsePolynomial<F>

impl<F: Field> StructuralPartialEq for SparsePolynomial<F>

Auto Trait Implementations

impl<F> RefUnwindSafe for SparsePolynomial<F> where F: RefUnwindSafe,

impl<F> Send for SparsePolynomial<F>

impl<F> Sync for SparsePolynomial<F>

impl<F> Unpin for SparsePolynomial<F> where F: Unpin,

impl<F> UnwindSafe for SparsePolynomial<F> where F: UnwindSafe,

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<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

pub fn equivalent(&self, key: &K) -> bool

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 fn evaluate_over_domain_by_ref(
&self,
domain: EvaluationDomain<F>
) -> Evaluations<F>

fn deserialize_uncompressed<R: Read>(
reader: &mut R
) -> Result<Self, SerializationError>

fn serialize_uncompressed<W: Write>(
&self,
writer: &mut W
) -> Result<(), SerializationError>

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

impl<F> RefUnwindSafe for SparsePolynomial<F> where
F: RefUnwindSafe,

impl<F> Unpin for SparsePolynomial<F> where
F: Unpin,

impl<F> UnwindSafe for SparsePolynomial<F> where
F: UnwindSafe,

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<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?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>,