Struct snarkvm_circuit::LinearCombination

source ·

pub struct LinearCombination<F>where
    F: PrimeField,{ /* private fields */ }

Implementations

source

impl<F> LinearCombination<F>where
F: PrimeField,

source

pub fn is_constant(&self) -> bool

Returns true if there are no terms in the linear combination.

source

pub fn is_public(&self) -> bool

Returns true if there is exactly one term with a coefficient of one, and the term contains a public variable.

source

pub fn is_private(&self) -> bool

Returns true if the linear combination is not constant or public.

source

pub fn mode(&self) -> Mode

Returns the mode of this linear combination.

source

pub fn value(&self) -> F

Returns the computed value of the linear combination.

source

pub fn is_boolean_type(&self) -> bool

Returns true if the linear combination represents a Boolean type, and is well-formed.

Properties:

Either constant or terms is utilized, however never both.
Every individual variable in the linear combination must always be either 0 or 1.
The value of the linear combination must always be either 0 or 1.

Trait Implementations

source

impl<F> Add<&LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &LinearCombination<F>
) -> <&LinearCombination<F> as Add<&LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Add<&LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &LinearCombination<F>
) -> <LinearCombination<F> as Add<&LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Add<&LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Add<&Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: LinearCombination<F>
) -> <&LinearCombination<F> as Add<LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Add<LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: LinearCombination<F>
) -> <LinearCombination<F> as Add<LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: LinearCombination<F>
) -> <Variable<F> as Add<LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Add<Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: Variable<F>
) -> <LinearCombination<F> as Add<Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> AddAssign<&LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

source

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

Performs the += operation. Read more

source

impl<F> AddAssign<LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

source

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

Performs the += operation. Read more

source

impl<F> Clone for LinearCombination<F>where
F: Clone + PrimeField,

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 for LinearCombination<F>where
F: PrimeField,

source

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

Formats the value using the given formatter. Read more

source

impl<F> Display for LinearCombination<F>where
F: PrimeField,

source

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

Formats the value using the given formatter. Read more

source

impl<F, const N: usize> From<&[Variable<F>; N]> for LinearCombination<F>where
F: PrimeField,

source

fn from(variables: &[Variable<F>; N]) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F> From<&[Variable<F>]> for LinearCombination<F>where
F: PrimeField,

source

fn from(variables: &[Variable<F>]) -> LinearCombination<F>

Converts to this type from the input type.

impl<E> From<&Address<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(
address: &Address<E>
) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<&Boolean<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(
boolean: &Boolean<E>
) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<&Field<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(field: &Field<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<&Group<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(group: &Group<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

source

impl<A> From<&Identifier<A>> for LinearCombination<<A as Environment>::BaseField>where
A: Aleo,

source

fn from(
identifier: &Identifier<A>
) -> LinearCombination<<A as Environment>::BaseField>

Note: Identifier is always Mode::Constant.

impl<E, I> From<&Integer<E, I>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,
I: IntegerType,

fn from(
integer: &Integer<E, I>
) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<&LinearCombination<<E as Environment>::BaseField>> for Field<E>where
E: Environment,

fn from(
linear_combination: &LinearCombination<<E as Environment>::BaseField>
) -> Field<E>

Converts to this type from the input type.

impl<E> From<&Scalar<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(scalar: &Scalar<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

source

impl<F> From<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

source

fn from(variable: &Variable<F>) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F> From<&Vec<Variable<F>, Global>> for LinearCombination<F>where
F: PrimeField,

source

fn from(variables: &Vec<Variable<F>, Global>) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F, const N: usize> From<[Variable<F>; N]> for LinearCombination<F>where
F: PrimeField,

source

fn from(variables: [Variable<F>; N]) -> LinearCombination<F>

Converts to this type from the input type.

impl<E> From<Address<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(address: Address<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<Boolean<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(boolean: Boolean<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<Field<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(field: Field<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<Group<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(group: Group<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

source

impl<A> From<Identifier<A>> for LinearCombination<<A as Environment>::BaseField>where
A: Aleo,

source

fn from(
identifier: Identifier<A>
) -> LinearCombination<<A as Environment>::BaseField>

Note: Identifier is always Mode::Constant.

impl<E, I> From<Integer<E, I>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,
I: IntegerType,

fn from(
integer: Integer<E, I>
) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

impl<E> From<LinearCombination<<E as Environment>::BaseField>> for Field<E>where
E: Environment,

fn from(
linear_combination: LinearCombination<<E as Environment>::BaseField>
) -> Field<E>

Converts to this type from the input type.

impl<E> From<Scalar<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(scalar: Scalar<E>) -> LinearCombination<<E as Environment>::BaseField>

Converts to this type from the input type.

source

impl<F> From<Variable<F>> for LinearCombination<F>where
F: PrimeField,

source

fn from(variable: Variable<F>) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F> From<Vec<Variable<F>, Global>> for LinearCombination<F>where
F: PrimeField,

source

fn from(variables: Vec<Variable<F>, Global>) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F> Mul<&F> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the * operator.

source

fn mul(self, coefficient: &F) -> <&LinearCombination<F> as Mul<&F>>::Output

Performs the * operation. Read more

source

impl<F> Mul<&F> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the * operator.

source

fn mul(self, coefficient: &F) -> <LinearCombination<F> as Mul<&F>>::Output

Performs the * operation. Read more

source

impl<F> Mul<F> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the * operator.

source

fn mul(self, coefficient: F) -> <&LinearCombination<F> as Mul<F>>::Output

Performs the * operation. Read more

source

impl<F> Mul<F> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the * operator.

source

fn mul(self, coefficient: F) -> <LinearCombination<F> as Mul<F>>::Output

Performs the * operation. Read more

source

impl<F> Neg for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn neg(self) -> <&LinearCombination<F> as Neg>::Output

Performs the unary - operation. Read more

source

impl<F> Neg for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn neg(self) -> <LinearCombination<F> as Neg>::Output

Performs the unary - operation. Read more

source

impl<F> Sub<&LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &LinearCombination<F>
) -> <&LinearCombination<F> as Sub<&LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Sub<&LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &LinearCombination<F>
) -> <LinearCombination<F> as Sub<&LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Sub<&LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Sub<&Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: LinearCombination<F>
) -> <&LinearCombination<F> as Sub<LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Sub<LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: LinearCombination<F>
) -> <LinearCombination<F> as Sub<LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: LinearCombination<F>
) -> <Variable<F> as Sub<LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Sub<Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: Variable<F>
) -> <LinearCombination<F> as Sub<Variable<F>>>::Output

Performs the - operation. Read more

Auto Trait Implementations

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

impl<F> !Send for LinearCombination<F>

impl<F> !Sync for LinearCombination<F>

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

impl<F> UnwindSafe for LinearCombination<F>where
F: UnwindSafe + 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> ToString for Twhere
T: Display + ?Sized,

source

default fn to_string(&self) -> String

Converts the given value to a String. 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_circuit::LinearCombination

Implementations

impl<F> LinearCombination<F>where F: PrimeField,

pub fn is_constant(&self) -> bool

pub fn is_public(&self) -> bool

pub fn is_private(&self) -> bool

pub fn mode(&self) -> Mode

pub fn value(&self) -> F

pub fn is_boolean_type(&self) -> bool

Trait Implementations

impl<F> Add<&LinearCombination<F>> for &LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &LinearCombination<F>) -> <&LinearCombination<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &LinearCombination<F>) -> <&Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &LinearCombination<F>) -> <LinearCombination<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &LinearCombination<F>) -> <Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&Variable<F>> for LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &Variable<F>) -> <LinearCombination<F> as Add<&Variable<F>>>::Output

impl<F> Add<LinearCombination<F>> for &LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: LinearCombination<F>) -> <&LinearCombination<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: LinearCombination<F>) -> <&Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: LinearCombination<F>) -> <LinearCombination<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: LinearCombination<F>) -> <Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<Variable<F>> for &LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: Variable<F>) -> <&LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: Variable<F>) -> <LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> AddAssign<&LinearCombination<F>> for LinearCombination<F>where F: PrimeField,

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

impl<F> AddAssign<LinearCombination<F>> for LinearCombination<F>where F: PrimeField,

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

impl<F> Clone for LinearCombination<F>where F: Clone + PrimeField,

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

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

impl<F> Debug for LinearCombination<F>where F: PrimeField,

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

impl<F> Display for LinearCombination<F>where F: PrimeField,

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

impl<F, const N: usize> From<&[Variable<F>; N]> for LinearCombination<F>where F: PrimeField,

fn from(variables: &[Variable<F>; N]) -> LinearCombination<F>

impl<F> From<&[Variable<F>]> for LinearCombination<F>where F: PrimeField,

fn from(variables: &[Variable<F>]) -> LinearCombination<F>

impl<E> From<&Address<E>> for LinearCombination<<E as Environment>::BaseField>where E: Environment,

fn from( address: &Address<E>) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&Boolean<E>> for LinearCombination<<E as Environment>::BaseField>where E: Environment,

fn from( boolean: &Boolean<E>) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&Field<E>> for LinearCombination<<E as Environment>::BaseField>where E: Environment,

fn from(field: &Field<E>) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&Group<E>> for LinearCombination<<E as Environment>::BaseField>where E: Environment,

fn from(group: &Group<E>) -> LinearCombination<<E as Environment>::BaseField>

impl<A> From<&Identifier<A>> for LinearCombination<<A as Environment>::BaseField>where A: Aleo,

fn from( identifier: &Identifier<A>) -> LinearCombination<<A as Environment>::BaseField>

impl<E, I> From<&Integer<E, I>> for LinearCombination<<E as Environment>::BaseField>where E: Environment, I: IntegerType,

fn from( integer: &Integer<E, I>) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&LinearCombination<<E as Environment>::BaseField>> for Field<E>where E: Environment,

fn from( linear_combination: &LinearCombination<<E as Environment>::BaseField>) -> Field<E>

impl<E> From<&Scalar<E>> for LinearCombination<<E as Environment>::BaseField>where E: Environment,

fn from(scalar: &Scalar<E>) -> LinearCombination<<E as Environment>::BaseField>

impl<F> From<&Variable<F>> for LinearCombination<F>where F: PrimeField,

fn from(variable: &Variable<F>) -> LinearCombination<F>

impl<F> From<&Vec<Variable<F>, Global>> for LinearCombination<F>where F: PrimeField,

fn from(variables: &Vec<Variable<F>, Global>) -> LinearCombination<F>

impl<F, const N: usize> From<[Variable<F>; N]> for LinearCombination<F>where F: PrimeField,

fn from(variables: [Variable<F>; N]) -> LinearCombination<F>

impl<F> LinearCombination<F>where
F: PrimeField,

impl<F> Add<&LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: &LinearCombination<F>
) -> <&LinearCombination<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn add(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: &LinearCombination<F>
) -> <LinearCombination<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn add(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Add<&Variable<F>>>::Output

impl<F> Add<LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: LinearCombination<F>
) -> <&LinearCombination<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn add(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: LinearCombination<F>
) -> <LinearCombination<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn add(
self,
other: LinearCombination<F>
) -> <Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: Variable<F>
) -> <LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> AddAssign<&LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

impl<F> AddAssign<LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

impl<F> Clone for LinearCombination<F>where
F: Clone + PrimeField,

impl<F> Debug for LinearCombination<F>where
F: PrimeField,

impl<F> Display for LinearCombination<F>where
F: PrimeField,

impl<F, const N: usize> From<&[Variable<F>; N]> for LinearCombination<F>where
F: PrimeField,

impl<F> From<&[Variable<F>]> for LinearCombination<F>where
F: PrimeField,

impl<E> From<&Address<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(
address: &Address<E>
) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&Boolean<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

fn from(
boolean: &Boolean<E>
) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&Field<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<E> From<&Group<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<A> From<&Identifier<A>> for LinearCombination<<A as Environment>::BaseField>where
A: Aleo,

fn from(
identifier: &Identifier<A>
) -> LinearCombination<<A as Environment>::BaseField>

impl<E, I> From<&Integer<E, I>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,
I: IntegerType,

fn from(
integer: &Integer<E, I>
) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<&LinearCombination<<E as Environment>::BaseField>> for Field<E>where
E: Environment,

fn from(
linear_combination: &LinearCombination<<E as Environment>::BaseField>
) -> Field<E>

impl<E> From<&Scalar<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<F> From<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

impl<F> From<&Vec<Variable<F>, Global>> for LinearCombination<F>where
F: PrimeField,

impl<F, const N: usize> From<[Variable<F>; N]> for LinearCombination<F>where
F: PrimeField,

impl<E> From<Address<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<E> From<Boolean<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<E> From<Field<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<E> From<Group<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<A> From<Identifier<A>> for LinearCombination<<A as Environment>::BaseField>where
A: Aleo,

fn from(
identifier: Identifier<A>
) -> LinearCombination<<A as Environment>::BaseField>

impl<E, I> From<Integer<E, I>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,
I: IntegerType,

fn from(
integer: Integer<E, I>
) -> LinearCombination<<E as Environment>::BaseField>

impl<E> From<LinearCombination<<E as Environment>::BaseField>> for Field<E>where
E: Environment,

fn from(
linear_combination: LinearCombination<<E as Environment>::BaseField>
) -> Field<E>

impl<E> From<Scalar<E>> for LinearCombination<<E as Environment>::BaseField>where
E: Environment,

impl<F> From<Variable<F>> for LinearCombination<F>where
F: PrimeField,

impl<F> From<Vec<Variable<F>, Global>> for LinearCombination<F>where
F: PrimeField,

impl<F> Mul<&F> for &LinearCombination<F>where
F: PrimeField,

impl<F> Mul<&F> for LinearCombination<F>where
F: PrimeField,

impl<F> Mul<F> for &LinearCombination<F>where
F: PrimeField,

impl<F> Mul<F> for LinearCombination<F>where
F: PrimeField,

impl<F> Neg for &LinearCombination<F>where
F: PrimeField,

impl<F> Neg for LinearCombination<F>where
F: PrimeField,

impl<F> Sub<&LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: &LinearCombination<F>
) -> <&LinearCombination<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn sub(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: &LinearCombination<F>
) -> <LinearCombination<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn sub(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Sub<&Variable<F>>>::Output

impl<F> Sub<LinearCombination<F>> for &LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: LinearCombination<F>
) -> <&LinearCombination<F> as Sub<LinearCombination<F>>>::Output

impl<F> Sub<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn sub(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Sub<LinearCombination<F>>>::Output

impl<F> Sub<LinearCombination<F>> for LinearCombination<F>where
F: PrimeField,