Struct LinearCombination

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

A labeled linear combinations of polynomials.

Fields

label: String

The label.

terms: BTreeMap<LCTerm, F>

The linear combination of (poly_label, coeff) pairs.

Implementations

impl<F: Field> LinearCombination<F>

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

Construct an empty labeled linear combination.

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.

pub fn label(&self) -> &str

Returns the label of the linear combination.

pub fn is_empty(&self) -> bool

Returns true if the linear combination has no terms.

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

Add a term to the linear combination.

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>)

Performs the += operation.

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

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

Performs the += operation.

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

fn add_assign(&mut self, coeff: F)

Performs the += operation.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

fn mul_assign(&mut self, coeff: F)

Performs the *= operation.

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

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

Performs the -= operation.

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

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

Performs the -= operation.

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

fn sub_assign(&mut self, coeff: F)

Performs the -= operation.