Struct snarkvm_algorithms::polycommit::sonic_pc::LinearCombination

source ·

pub struct LinearCombination<F> {
    pub label: String,
    pub terms: BTreeMap<LCTerm, F>,
}

Expand description

A labeled linear combinations of polynomials.

Fields

label: String

The label.

terms: BTreeMap<LCTerm, F>

The linear combination of (coeff, poly_label) pairs.

Implementations

source

impl<F: Field> LinearCombination<F>

source

pub fn empty(label: impl Into<String>) -> Self

Construct an empty labeled linear combination.

source

pub fn new(
label: impl Into<String>,
_terms: impl IntoIterator<Item = (F, impl Into<LCTerm>)>
) -> Self

Construct a new labeled linear combination. with the terms specified in term.

source

pub fn label(&self) -> &str

Returns the label of the linear combination.

source

pub fn is_empty(&self) -> bool

Returns true if the linear combination has no terms.

source

pub fn add(&mut self, c: F, t: impl Into<LCTerm>) -> &mut Self

Add a term to the linear combination.

source

pub fn len(&self) -> usize

source

pub fn iter(&self) -> impl Iterator<Item = (&F, &LCTerm)>

Trait Implementations

source

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

source

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

Performs the += operation. Read more

source

impl<'a, F: Field> AddAssign<(F, &'a LinearCombination<F>)> for LinearCombination<F>

source

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

Performs the += operation. Read more

source

impl<F: Field> AddAssign<F> for LinearCombination<F>

source

fn add_assign(&mut self, coeff: F)

Performs the += operation. Read more

source

impl<F: Clone> Clone for LinearCombination<F>

source

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

source

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

Formats the value using the given formatter. Read more

source

impl<F: Field> MulAssign<F> for LinearCombination<F>

source

fn mul_assign(&mut self, coeff: F)

Performs the *= operation. Read more

source

impl<'a, F: Field> SubAssign<&'a LinearCombination<F>> for LinearCombination<F>

source

fn sub_assign(&mut self, other: &'a LinearCombination<F>)

Performs the -= operation. Read more

source

impl<'a, F: Field> SubAssign<(F, &'a LinearCombination<F>)> for LinearCombination<F>

source

fn sub_assign(&mut self, (coeff, other): (F, &'a LinearCombination<F>))

Performs the -= operation. Read more

source

impl<F: Field> SubAssign<F> for LinearCombination<F>

source

fn sub_assign(&mut self, coeff: F)

Performs the -= operation. Read more

Auto Trait Implementations

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

impl<F> Send for LinearCombination<F>where
F: Send,

impl<F> Sync for LinearCombination<F>where
F: Sync,

impl<F> Unpin for LinearCombination<F>

impl<F> UnwindSafe for LinearCombination<F>where
F: RefUnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

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 Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

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

source

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

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

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct snarkvm_algorithms::polycommit::sonic_pc::LinearCombination

Fields

Implementations

impl<F: Field> LinearCombination<F>

pub fn empty(label: impl Into<String>) -> Self

pub fn new( label: impl Into<String>, _terms: impl IntoIterator<Item = (F, impl Into<LCTerm>)>) -> Self

pub fn label(&self) -> &str

pub fn is_empty(&self) -> bool

pub fn add(&mut self, c: F, t: impl Into<LCTerm>) -> &mut Self

pub fn len(&self) -> usize

pub fn iter(&self) -> impl Iterator<Item = (&F, &LCTerm)>

Trait Implementations

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

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

impl<'a, F: Field> AddAssign<(F, &'a LinearCombination<F>)> for LinearCombination<F>

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

impl<F: Field> AddAssign<F> for LinearCombination<F>

fn add_assign(&mut self, coeff: F)

impl<F: Clone> Clone for LinearCombination<F>

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

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

impl<F: Debug> Debug for LinearCombination<F>

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

impl<F: Field> MulAssign<F> for LinearCombination<F>

fn mul_assign(&mut self, coeff: F)

impl<'a, F: Field> SubAssign<&'a LinearCombination<F>> for LinearCombination<F>

fn sub_assign(&mut self, other: &'a LinearCombination<F>)

impl<'a, F: Field> SubAssign<(F, &'a LinearCombination<F>)> for LinearCombination<F>

fn sub_assign(&mut self, (coeff, other): (F, &'a LinearCombination<F>))

impl<F: Field> SubAssign<F> for LinearCombination<F>

fn sub_assign(&mut self, coeff: F)

Auto Trait Implementations

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

impl<F> Send for LinearCombination<F>where F: Send,

impl<F> Sync for LinearCombination<F>where F: Sync,

impl<F> Unpin for LinearCombination<F>

impl<F> UnwindSafe for LinearCombination<F>where F: RefUnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

type Init = T

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

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

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

unsafe fn drop(ptr: usize)

impl<T> Same<T> for T

type Output = T

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

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

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

type Error = Infallible

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

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

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

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

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

fn vzip(self) -> V

pub fn new(
label: impl Into<String>,
_terms: impl IntoIterator<Item = (F, impl Into<LCTerm>)>
) -> Self

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

impl<F> Send for LinearCombination<F>where
F: Send,

impl<F> Sync for LinearCombination<F>where
F: Sync,

impl<F> UnwindSafe for LinearCombination<F>where
F: RefUnwindSafe,

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

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

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

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

impl<T> ToOwned for Twhere
T: Clone,

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

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

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