Enum snarkvm_algorithms::fft::polynomial::DenseOrSparsePolynomial [−][src]
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
impl<F: Field> DenseOrSparsePolynomial<'_, F>
[src]
pub fn is_zero(&self) -> bool
[src]
Checks if the given polynomial is zero.
pub fn degree(&self) -> usize
[src]
Return the degree of `self.
pub fn divide_with_q_and_r(
&self,
divisor: &Self
) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>
[src]
&self,
divisor: &Self
) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>
Divide self by another (sparse or dense) polynomial, and returns the quotient and remainder.
impl<F: PrimeField> DenseOrSparsePolynomial<'_, F>
[src]
pub fn evaluate_over_domain(
poly: impl Into<Self>,
domain: EvaluationDomain<F>
) -> Evaluations<F>
[src]
poly: impl Into<Self>,
domain: EvaluationDomain<F>
) -> Evaluations<F>
Construct Evaluations
by evaluating a polynomial over the domain domain
.
Trait Implementations
impl<'a, F: Clone + 'a + Field> Clone for DenseOrSparsePolynomial<'a, F>
[src]
fn clone(&self) -> DenseOrSparsePolynomial<'a, F>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<'a, F: 'a + Field> From<&'a DensePolynomial<F>> for DenseOrSparsePolynomial<'a, F>
[src]
fn from(other: &'a DensePolynomial<F>) -> Self
[src]
impl<'a, F: Field> From<&'a SparsePolynomial<F>> for DenseOrSparsePolynomial<'a, F>
[src]
fn from(other: &'a SparsePolynomial<F>) -> Self
[src]
impl<F: Field> From<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>
[src]
fn from(other: DensePolynomial<F>) -> Self
[src]
impl<F: Field> From<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>
[src]
fn from(other: SparsePolynomial<F>) -> Self
[src]
impl<F: Field> Into<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>
[src]
fn into(self) -> DensePolynomial<F>
[src]
impl<F: Field> TryInto<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>
[src]
Auto Trait Implementations
impl<'a, F> RefUnwindSafe for DenseOrSparsePolynomial<'a, F> where
F: RefUnwindSafe,
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,
F: Unpin,
impl<'a, F> UnwindSafe for DenseOrSparsePolynomial<'a, F> where
F: RefUnwindSafe + UnwindSafe,
F: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Pointable for T
pub const ALIGN: usize
type Init = T
The type for initializers.
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
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,