pub struct TableInputs<'a, F: TowerField, A> {Show 20 fields
pub air: &'a A,
pub ast: &'a ConstraintAst<F>,
pub instance: &'a ProgramInstance<F>,
pub num_vars: usize,
pub trace_width: usize,
pub blinding_columns: usize,
pub alpha: Flat<F>,
pub gamma: Flat<F>,
pub beta: Flat<F>,
pub r_zerocheck: &'a [Flat<F>],
pub r_final: &'a [Flat<F>],
pub lookup_bus_points: &'a BTreeMap<String, Vec<Flat<F>>>,
pub claimed_sums_masked: &'a [(String, F)],
pub h_evals_masked: &'a [(String, F)],
pub val_final_masked: Flat<F>,
pub claims_masked: Vec<Flat<F>>,
pub pads: TablePads,
pub trace_eval: EvalRecord<F>,
pub h_eval: Option<EvalRecord<F>>,
pub gadget: Option<RingGadget<F>>,
}Expand description
Everything a table’s record is built from; both sides hold all of it after the table’s eval phase.
Fields§
§air: &'a A§ast: &'a ConstraintAst<F>§instance: &'a ProgramInstance<F>§num_vars: usize§trace_width: usize§blinding_columns: usize§alpha: Flat<F>§gamma: Flat<F>§beta: Flat<F>§r_zerocheck: &'a [Flat<F>]§r_final: &'a [Flat<F>]§lookup_bus_points: &'a BTreeMap<String, Vec<Flat<F>>>§claimed_sums_masked: &'a [(String, F)]§h_evals_masked: &'a [(String, F)]§val_final_masked: Flat<F>§claims_masked: Vec<Flat<F>>§pads: TablePads§trace_eval: EvalRecord<F>§h_eval: Option<EvalRecord<F>>§gadget: Option<RingGadget<F>>Auto Trait Implementations§
impl<'a, F, A> Freeze for TableInputs<'a, F, A>where
&'a A: Freeze,
&'a ConstraintAst<F>: Freeze,
&'a ProgramInstance<F>: Freeze,
Flat<F>: Freeze,
&'a [Flat<F>]: Freeze,
&'a BTreeMap<String, Vec<Flat<F>>>: Freeze,
&'a [(String, F)]: Freeze,
Vec<Flat<F>>: Freeze,
EvalRecord<F>: Freeze,
Option<EvalRecord<F>>: Freeze,
Option<RingGadget<F>>: Freeze,
impl<'a, F, A> RefUnwindSafe for TableInputs<'a, F, A>where
&'a A: RefUnwindSafe,
&'a ConstraintAst<F>: RefUnwindSafe,
&'a ProgramInstance<F>: RefUnwindSafe,
Flat<F>: RefUnwindSafe,
&'a [Flat<F>]: RefUnwindSafe,
&'a BTreeMap<String, Vec<Flat<F>>>: RefUnwindSafe,
&'a [(String, F)]: RefUnwindSafe,
Vec<Flat<F>>: RefUnwindSafe,
EvalRecord<F>: RefUnwindSafe,
Option<EvalRecord<F>>: RefUnwindSafe,
Option<RingGadget<F>>: RefUnwindSafe,
impl<'a, F, A> Send for TableInputs<'a, F, A>
impl<'a, F, A> Sync for TableInputs<'a, F, A>
impl<'a, F, A> Unpin for TableInputs<'a, F, A>
impl<'a, F, A> UnsafeUnpin for TableInputs<'a, F, A>where
&'a A: UnsafeUnpin,
&'a ConstraintAst<F>: UnsafeUnpin,
&'a ProgramInstance<F>: UnsafeUnpin,
Flat<F>: UnsafeUnpin,
&'a [Flat<F>]: UnsafeUnpin,
&'a BTreeMap<String, Vec<Flat<F>>>: UnsafeUnpin,
&'a [(String, F)]: UnsafeUnpin,
Vec<Flat<F>>: UnsafeUnpin,
EvalRecord<F>: UnsafeUnpin,
Option<EvalRecord<F>>: UnsafeUnpin,
Option<RingGadget<F>>: UnsafeUnpin,
impl<'a, F, A> UnwindSafe for TableInputs<'a, F, A>where
&'a A: UnwindSafe,
&'a ConstraintAst<F>: UnwindSafe,
&'a ProgramInstance<F>: UnwindSafe,
Flat<F>: UnwindSafe,
&'a [Flat<F>]: UnwindSafe,
&'a BTreeMap<String, Vec<Flat<F>>>: UnwindSafe,
&'a [(String, F)]: UnwindSafe,
Vec<Flat<F>>: UnwindSafe,
EvalRecord<F>: UnwindSafe,
Option<EvalRecord<F>>: UnwindSafe,
Option<RingGadget<F>>: UnwindSafe,
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more