pub enum Variable<F: PrimeField> {
Constant(Rc<F>),
Public(Index, Rc<F>),
Private(Index, Rc<F>),
}
Variants§
Implementations§
source§impl<F: PrimeField> Variable<F>
impl<F: PrimeField> Variable<F>
sourcepub fn is_constant(&self) -> bool
pub fn is_constant(&self) -> bool
Returns true
if the variable is a constant.
sourcepub fn is_private(&self) -> bool
pub fn is_private(&self) -> bool
Returns true
if the variable is private.
Trait Implementations§
source§impl<F: PrimeField> Add<&LinearCombination<F>> for &Variable<F>
impl<F: PrimeField> Add<&LinearCombination<F>> for &Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
+
operator.source§impl<F: PrimeField> Add<&LinearCombination<F>> for Variable<F>
impl<F: PrimeField> Add<&LinearCombination<F>> for Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
+
operator.source§impl<F: PrimeField> Add<&Variable<F>> for LinearCombination<F>
impl<F: PrimeField> Add<&Variable<F>> for LinearCombination<F>
source§impl<F: PrimeField> Add<LinearCombination<F>> for &Variable<F>
impl<F: PrimeField> Add<LinearCombination<F>> for &Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
+
operator.source§impl<F: PrimeField> Add<LinearCombination<F>> for Variable<F>
impl<F: PrimeField> Add<LinearCombination<F>> for Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
+
operator.source§impl<F: PrimeField> Add<Variable<F>> for &LinearCombination<F>
impl<F: PrimeField> Add<Variable<F>> for &LinearCombination<F>
source§impl<F: PrimeField> Add<Variable<F>> for LinearCombination<F>
impl<F: PrimeField> Add<Variable<F>> for LinearCombination<F>
source§impl<F: PrimeField> Debug for Variable<F>
impl<F: PrimeField> Debug for Variable<F>
source§impl<F: PrimeField> Display for Variable<F>
impl<F: PrimeField> Display for Variable<F>
source§impl<F: PrimeField> From<&Variable<F>> for AssignmentVariable<F>
impl<F: PrimeField> From<&Variable<F>> for AssignmentVariable<F>
source§impl<F: PrimeField> From<&Variable<F>> for LinearCombination<F>
impl<F: PrimeField> From<&Variable<F>> for LinearCombination<F>
source§impl<F: PrimeField> From<Variable<F>> for LinearCombination<F>
impl<F: PrimeField> From<Variable<F>> for LinearCombination<F>
source§impl<F: PrimeField> Ord for Variable<F>
impl<F: PrimeField> Ord for Variable<F>
source§impl<F: PartialEq + PrimeField> PartialEq<Variable<F>> for Variable<F>
impl<F: PartialEq + PrimeField> PartialEq<Variable<F>> for Variable<F>
source§impl<F: PrimeField> PartialOrd<Variable<F>> for Variable<F>
impl<F: PrimeField> PartialOrd<Variable<F>> for Variable<F>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<F: PrimeField> Sub<&LinearCombination<F>> for &Variable<F>
impl<F: PrimeField> Sub<&LinearCombination<F>> for &Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
-
operator.source§impl<F: PrimeField> Sub<&LinearCombination<F>> for Variable<F>
impl<F: PrimeField> Sub<&LinearCombination<F>> for Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
-
operator.source§impl<F: PrimeField> Sub<&Variable<F>> for LinearCombination<F>
impl<F: PrimeField> Sub<&Variable<F>> for LinearCombination<F>
source§impl<F: PrimeField> Sub<LinearCombination<F>> for &Variable<F>
impl<F: PrimeField> Sub<LinearCombination<F>> for &Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
-
operator.source§impl<F: PrimeField> Sub<LinearCombination<F>> for Variable<F>
impl<F: PrimeField> Sub<LinearCombination<F>> for Variable<F>
§type Output = LinearCombination<F>
type Output = LinearCombination<F>
The resulting type after applying the
-
operator.source§impl<F: PrimeField> Sub<Variable<F>> for &LinearCombination<F>
impl<F: PrimeField> Sub<Variable<F>> for &LinearCombination<F>
source§impl<F: PrimeField> Sub<Variable<F>> for LinearCombination<F>
impl<F: PrimeField> Sub<Variable<F>> for LinearCombination<F>
impl<F: Eq + PrimeField> Eq for Variable<F>
impl<F: PrimeField> StructuralEq for Variable<F>
impl<F: PrimeField> StructuralPartialEq for Variable<F>
Auto Trait Implementations§
impl<F> RefUnwindSafe for Variable<F>where F: RefUnwindSafe,
impl<F> !Send for Variable<F>
impl<F> !Sync for Variable<F>
impl<F> Unpin for Variable<F>
impl<F> UnwindSafe for Variable<F>where F: RefUnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.