pub enum Alphas<F: Field> {
Powers(F, Rc<AtomicUsize>),
Combinations(Vec<F>),
}
Expand description
Combinators that will be used to fold the constraints, called the “alphas”. The alphas are exceptional, their number cannot be known ahead of time as it will be defined by folding. The values will be computed as powers in new instances, but after folding each alpha will be a linear combination of other alphas, instand of a power of other element. This type represents that, allowing to also recognize which case is present.
Variants§
Powers(F, Rc<AtomicUsize>)
Combinations(Vec<F>)
Implementations§
Trait Implementations§
impl<F: Field> Eq for Alphas<F>
Auto Trait Implementations§
impl<F> Freeze for Alphas<F>where
F: Freeze,
impl<F> RefUnwindSafe for Alphas<F>where
F: RefUnwindSafe,
impl<F> !Send for Alphas<F>
impl<F> !Sync for Alphas<F>
impl<F> Unpin for Alphas<F>where
F: Unpin,
impl<F> UnwindSafe for Alphas<F>where
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more