Struct bellperson::util_cs::bench_cs::BenchCS [−][src]
pub struct BenchCS<E: Engine> { /* fields omitted */ }
Implementations
impl<E: Engine> BenchCS<E>
[src]
impl<E: Engine> BenchCS<E>
[src]pub fn new() -> Self
[src]
pub fn num_constraints(&self) -> usize
[src]
pub fn num_inputs(&self) -> usize
[src]
Trait Implementations
impl<E: Engine> ConstraintSystem<E> for BenchCS<E>
[src]
impl<E: Engine> ConstraintSystem<E> for BenchCS<E>
[src]type Root = Self
type Root = Self
Represents the type of the “root” of this constraint system so that nested namespaces can minimize indirection. Read more
fn new() -> Self
[src]
fn alloc<F, A, AR>(&mut self, _: A, _f: F) -> Result<Variable, SynthesisError> where
F: FnOnce() -> Result<E::Fr, SynthesisError>,
A: FnOnce() -> AR,
AR: Into<String>,
[src]
fn alloc<F, A, AR>(&mut self, _: A, _f: F) -> Result<Variable, SynthesisError> where
F: FnOnce() -> Result<E::Fr, SynthesisError>,
A: FnOnce() -> AR,
AR: Into<String>,
[src]Allocate a private variable in the constraint system. The provided function is used to
determine the assignment of the variable. The given annotation
function is invoked
in testing contexts in order to derive a unique name for this variable in the current
namespace. Read more
fn alloc_input<F, A, AR>(
&mut self,
_: A,
_f: F
) -> Result<Variable, SynthesisError> where
F: FnOnce() -> Result<E::Fr, SynthesisError>,
A: FnOnce() -> AR,
AR: Into<String>,
[src]
fn alloc_input<F, A, AR>(
&mut self,
_: A,
_f: F
) -> Result<Variable, SynthesisError> where
F: FnOnce() -> Result<E::Fr, SynthesisError>,
A: FnOnce() -> AR,
AR: Into<String>,
[src]Allocate a public variable in the constraint system. The provided function is used to determine the assignment of the variable. Read more
fn enforce<A, AR, LA, LB, LC>(&mut self, _: A, _a: LA, _b: LB, _c: LC) where
A: FnOnce() -> AR,
AR: Into<String>,
LA: FnOnce(LinearCombination<E>) -> LinearCombination<E>,
LB: FnOnce(LinearCombination<E>) -> LinearCombination<E>,
LC: FnOnce(LinearCombination<E>) -> LinearCombination<E>,
[src]
fn enforce<A, AR, LA, LB, LC>(&mut self, _: A, _a: LA, _b: LB, _c: LC) where
A: FnOnce() -> AR,
AR: Into<String>,
LA: FnOnce(LinearCombination<E>) -> LinearCombination<E>,
LB: FnOnce(LinearCombination<E>) -> LinearCombination<E>,
LC: FnOnce(LinearCombination<E>) -> LinearCombination<E>,
[src]Enforce that A
* B
= C
. The annotation
function is invoked in testing contexts
in order to derive a unique name for the constraint in the current namespace. Read more
fn push_namespace<NR, N>(&mut self, _: N) where
NR: Into<String>,
N: FnOnce() -> NR,
[src]
fn push_namespace<NR, N>(&mut self, _: N) where
NR: Into<String>,
N: FnOnce() -> NR,
[src]Create a new (sub)namespace and enter into it. Not intended
for downstream use; use namespace
instead. Read more
fn pop_namespace(&mut self)
[src]
fn pop_namespace(&mut self)
[src]Exit out of the existing namespace. Not intended for
downstream use; use namespace
instead. Read more
fn get_root(&mut self) -> &mut Self::Root
[src]
fn get_root(&mut self) -> &mut Self::Root
[src]Gets the “root” constraint system, bypassing the namespacing.
Not intended for downstream use; use namespace
instead. Read more
fn namespace<NR, N>(&mut self, name_fn: N) -> Namespace<'_, E, Self::Root> where
NR: Into<String>,
N: FnOnce() -> NR,
[src]
fn namespace<NR, N>(&mut self, name_fn: N) -> Namespace<'_, E, Self::Root> where
NR: Into<String>,
N: FnOnce() -> NR,
[src]Begin a namespace for this constraint system.
fn is_extensible() -> bool
[src]
fn is_extensible() -> bool
[src]Most implementations of ConstraintSystem are not ‘extensible’: they won’t implement a specialized
version of extend
and should therefore also keep the default implementation of is_extensible
so callers which optionally make use of extend
can know to avoid relying on it when unimplemented. Read more
fn extend(&mut self, _other: Self)
[src]
fn extend(&mut self, _other: Self)
[src]Extend concatenates thew other
constraint systems to the receiver, modifying the receiver, whose
inputs, allocated variables, and constraints will precede those of the other
constraint system.
The primary use case for this is parallel synthesis of circuits which can be decomposed into
entirely independent sub-circuits. Each can be synthesized in its own thread, then the
original ConstraintSystem
can be extended with each, in the same order they would have
been synthesized sequentially. Read more
impl<E: Engine> Send for BenchCS<E>
[src]
Auto Trait Implementations
impl<E> RefUnwindSafe for BenchCS<E> where
E: RefUnwindSafe,
E: RefUnwindSafe,
impl<E> Sync for BenchCS<E> where
E: Sync,
E: Sync,
impl<E> Unpin for BenchCS<E> where
E: Unpin,
E: Unpin,
impl<E> UnwindSafe for BenchCS<E> where
E: UnwindSafe,
E: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,