Struct snarkvm_wasm::integers::Int128 [−][src]
Fields
bits: Vec<Boolean, Global>value: Option<i128>Implementations
impl Int128[src]
impl Int128[src]pub fn alloc_input_fe<F, CS>(
cs: CS,
value: <Int128 as Integer>::IntegerType
) -> Result<Int128, SynthesisError> where
CS: ConstraintSystem<F>,
F: PrimeField, [src]
pub fn alloc_input_fe<F, CS>(
cs: CS,
value: <Int128 as Integer>::IntegerType
) -> Result<Int128, SynthesisError> where
CS: ConstraintSystem<F>,
F: PrimeField, [src]Allocates the unsigned integer gadget by first converting
the little-endian byte representation of the unsigned integer to
F elements, (thus reducing the number of input allocations),
and then converts this list of F gadgets into the unsigned integer gadget
Trait Implementations
impl<F> Add<F, Int128> for Int128 where
F: PrimeField, [src]
impl<F> Add<F, Int128> for Int128 where
F: PrimeField, [src]impl<F> AllocGadget<<Int128 as Integer>::IntegerType, F> for Int128 where
F: Field, [src]
impl<F> AllocGadget<<Int128 as Integer>::IntegerType, F> for Int128 where
F: Field, [src]pub fn alloc<Fn, T, CS>(cs: CS, value_gen: Fn) -> Result<Int128, SynthesisError> where
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<<Int128 as Integer>::IntegerType>, [src]
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<<Int128 as Integer>::IntegerType>,
pub fn alloc_input<Fn, T, CS>(
cs: CS,
value_gen: Fn
) -> Result<Int128, SynthesisError> where
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<<Int128 as Integer>::IntegerType>, [src]
cs: CS,
value_gen: Fn
) -> Result<Int128, SynthesisError> where
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<<Int128 as Integer>::IntegerType>,
fn alloc_constant<Fn, T, CS>(_cs: CS, _f: Fn) -> Result<Self, SynthesisError> where
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<V>, [src]
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<V>,
fn alloc_checked<Fn, T, CS>(cs: CS, f: Fn) -> Result<Self, SynthesisError> where
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<V>, [src]
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<V>,
fn alloc_input_checked<Fn, T, CS>(cs: CS, f: Fn) -> Result<Self, SynthesisError> where
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<V>, [src]
Fn: FnOnce() -> Result<T, SynthesisError>,
CS: ConstraintSystem<F>,
T: Borrow<V>,
impl<F> ComparatorGadget<F> for Int128 where
F: PrimeField, [src]
impl<F> ComparatorGadget<F> for Int128 where
F: PrimeField, [src]fn greater_than<CS>(
&self,
cs: CS,
other: &Self
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Self
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>,
fn less_than_or_equal<CS>(
&self,
cs: CS,
other: &Self
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Self
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>,
fn greater_than_or_equal<CS>(
&self,
cs: CS,
other: &Self
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Self
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>,
impl<F> CondSelectGadget<F> for Int128 where
F: PrimeField, [src]
impl<F> CondSelectGadget<F> for Int128 where
F: PrimeField, [src]pub fn conditionally_select<CS>(
cs: CS,
cond: &Boolean,
first: &Int128,
second: &Int128
) -> Result<Int128, SynthesisError> where
CS: ConstraintSystem<F>, [src]
cs: CS,
cond: &Boolean,
first: &Int128,
second: &Int128
) -> Result<Int128, SynthesisError> where
CS: ConstraintSystem<F>,
pub fn cost() -> usize[src]
impl<F> ConditionalEqGadget<F> for Int128 where
F: Field, [src]
impl<F> ConditionalEqGadget<F> for Int128 where
F: Field, [src]pub fn conditional_enforce_equal<CS>(
&self,
cs: CS,
other: &Int128,
condition: &Boolean
) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Int128,
condition: &Boolean
) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>,
pub fn cost() -> usize[src]
impl<F> Div<F, Int128> for Int128 where
F: PrimeField, [src]
impl<F> Div<F, Int128> for Int128 where
F: PrimeField, [src]impl<F> EqGadget<F> for Int128 where
F: Field, [src]
impl<F> EqGadget<F> for Int128 where
F: Field, [src]fn is_eq<CS>(&self, _cs: CS, _other: &Self) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]
fn is_eq<CS>(&self, _cs: CS, _other: &Self) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]Output a Boolean value representing whether self.value() == other.value(). Read more
fn enforce_equal<CS>(&self, cs: CS, other: &Self) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>, [src]
CS: ConstraintSystem<F>,
fn cost() -> usize[src]
impl<F> EvaluateEqGadget<F> for Int128 where
F: PrimeField, [src]
impl<F> EvaluateEqGadget<F> for Int128 where
F: PrimeField, [src]pub fn evaluate_equal<CS>(
&self,
cs: CS,
other: &Int128
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Int128
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>,
impl<F> EvaluateLtGadget<F> for Int128 where
F: PrimeField, [src]
impl<F> EvaluateLtGadget<F> for Int128 where
F: PrimeField, [src]pub fn less_than<CS>(
&self,
cs: CS,
other: &Int128
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Int128
) -> Result<Boolean, SynthesisError> where
CS: ConstraintSystem<F>,
impl Integer for Int128[src]
impl Integer for Int128[src]type IntegerType = i128
pub const SIZE: usize[src]
pub fn constant(value: i128) -> Int128[src]
pub fn one() -> Int128[src]
pub fn zero() -> Int128[src]
pub fn new(
bits: Vec<Boolean, Global>,
value: Option<<Int128 as Integer>::IntegerType>
) -> Int128[src]
bits: Vec<Boolean, Global>,
value: Option<<Int128 as Integer>::IntegerType>
) -> Int128
pub fn is_constant(&self) -> bool[src]
pub fn is_constant(&self) -> bool[src]Returns true if all bits in this Int are constant
pub fn to_bits_le(&self) -> Vec<Boolean, Global>[src]
pub fn from_bits_le(bits: &[Boolean]) -> Int128[src]
pub fn get_value(&self) -> Option<String>[src]
fn result_is_constant(first: &Self, second: &Self) -> bool[src]
fn result_is_constant(first: &Self, second: &Self) -> bool[src]Returns true if both Int objects have constant bits
impl<F> Mul<F, Int128> for Int128 where
F: PrimeField, [src]
impl<F> Mul<F, Int128> for Int128 where
F: PrimeField, [src]Bitwise multiplication of two signed integer objects.
type ErrorType = SignedIntegerError
pub fn mul<CS>(
&self,
cs: CS,
other: &Int128
) -> Result<Int128, <Int128 as Mul<F, Int128>>::ErrorType> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Int128
) -> Result<Int128, <Int128 as Mul<F, Int128>>::ErrorType> where
CS: ConstraintSystem<F>,
pub fn mul_unsafe<CS>(
&self,
cs: CS,
other: &Int128
) -> Result<Int128, <Int128 as Mul<F, Int128>>::ErrorType> where
CS: ConstraintSystem<F>, [src]
pub fn mul_unsafe<CS>(
&self,
cs: CS,
other: &Int128
) -> Result<Int128, <Int128 as Mul<F, Int128>>::ErrorType> where
CS: ConstraintSystem<F>, [src]Overflowing mul gadget. Used to calculate exponents in pow gadget.
impl<F> Neg<F> for Int128 where
F: PrimeField, [src]
impl<F> Neg<F> for Int128 where
F: PrimeField, [src]type ErrorType = SignedIntegerError
pub fn neg<CS>(&self, cs: CS) -> Result<Int128, <Int128 as Neg<F>>::ErrorType> where
CS: ConstraintSystem<F>, [src]
CS: ConstraintSystem<F>,
impl PartialOrd<Int128> for Int128[src]
impl PartialOrd<Int128> for Int128[src]pub fn partial_cmp(&self, other: &Int128) -> Option<Ordering>[src]
pub fn partial_cmp(&self, other: &Int128) -> Option<Ordering>[src]This method returns an ordering between self and other values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool1.0.0[src]This method tests less than (for self and other) and is used by the < operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool1.0.0[src]This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
impl<F> Pow<F, Int128> for Int128 where
F: PrimeField, [src]
impl<F> Pow<F, Int128> for Int128 where
F: PrimeField, [src]impl<F> RippleCarryAdder<F, Int128> for Int128 where
F: Field + PrimeField, [src]
impl<F> RippleCarryAdder<F, Int128> for Int128 where
F: Field + PrimeField, [src]pub fn add_bits<CS>(
&self,
cs: CS,
other: &Int128
) -> Result<Vec<Boolean, Global>, SynthesisError> where
CS: ConstraintSystem<F>, [src]
&self,
cs: CS,
other: &Int128
) -> Result<Vec<Boolean, Global>, SynthesisError> where
CS: ConstraintSystem<F>,
impl<F> Sub<F, Int128> for Int128 where
F: PrimeField, [src]
impl<F> Sub<F, Int128> for Int128 where
F: PrimeField, [src]impl Eq for Int128[src]
Auto Trait Implementations
impl RefUnwindSafe for Int128
impl Send for Int128
impl Sync for Int128
impl Unpin for Int128
impl UnwindSafe for Int128
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<F, T> ConditionalOrEqualsGadget<F> for T where
T: ConditionalEqGadget<F> + CondSelectGadget<F>,
F: Field, [src]
impl<F, T> ConditionalOrEqualsGadget<F> for T where
T: ConditionalEqGadget<F> + CondSelectGadget<F>,
F: Field, [src]pub fn conditional_enforce_equal_or<CS>(
cs: CS,
cond: &Boolean,
var: &T,
first: &T,
second: &T,
should_enforce: &Boolean
) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>, [src]
cs: CS,
cond: &Boolean,
var: &T,
first: &T,
second: &T,
should_enforce: &Boolean
) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>,
pub fn cost() -> usize[src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized, [src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized, [src]pub fn equivalent(&self, key: &K) -> bool[src]
pub fn equivalent(&self, key: &K) -> bool[src]Compare self to key and return true if they are equal.
impl<T> FmtForward for T
impl<T> FmtForward for Tfn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary, Causes self to use its Binary implementation when Debug-formatted.
fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display, Causes self to use its Display implementation when
Debug-formatted. Read more
fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp, Causes self to use its LowerExp implementation when
Debug-formatted. Read more
fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex, Causes self to use its LowerHex implementation when
Debug-formatted. Read more
fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal, Causes self to use its Octal implementation when Debug-formatted.
fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer, Causes self to use its Pointer implementation when
Debug-formatted. Read more
fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp, Causes self to use its UpperExp implementation when
Debug-formatted. Read more
fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex, Causes self to use its UpperHex implementation when
Debug-formatted. Read more
impl<F, T> OrEqualsGadget<F> for T where
T: ConditionalOrEqualsGadget<F>,
F: Field, [src]
impl<F, T> OrEqualsGadget<F> for T where
T: ConditionalOrEqualsGadget<F>,
F: Field, [src]pub fn enforce_equal_or<CS>(
cs: CS,
cond: &Boolean,
var: &T,
first: &T,
second: &T
) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>, [src]
cs: CS,
cond: &Boolean,
var: &T,
first: &T,
second: &T
) -> Result<(), SynthesisError> where
CS: ConstraintSystem<F>,
pub fn cost() -> usize[src]
impl<T> Pipe for T where
T: ?Sized,
impl<T> Pipe for T where
T: ?Sized, fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> RPipes by value. This is generally the method you want to use. Read more
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a, Borrows self and passes that borrow into the pipe function. Read more
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a, Mutably borrows self and passes that borrow into the pipe function. Read more
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a, Borrows self, then passes self.borrow() into the pipe function. Read more
fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a, Mutably borrows self, then passes self.borrow_mut() into the pipe
function. Read more
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
R: 'a,
U: 'a + ?Sized,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
R: 'a,
U: 'a + ?Sized, Borrows self, then passes self.as_ref() into the pipe function.
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
R: 'a,
U: 'a + ?Sized,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
R: 'a,
U: 'a + ?Sized, Mutably borrows self, then passes self.as_mut() into the pipe
function. Read more
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a,
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a, Borrows self, then passes self.deref() into the pipe function.
impl<T> Pointable for T
impl<T> Pointable for Timpl<T> Same<T> for T
impl<T> Same<T> for Ttype Output = T
type Output = TShould always be Self
impl<T> Tap for T
impl<T> Tap for Tfn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized, Immutable access to the Borrow<B> of a value. Read more
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized, Mutable access to the BorrowMut<B> of a value. Read more
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized, Immutable access to the AsRef<R> view of a value. Read more
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized, Mutable access to the AsMut<R> view of a value. Read more
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized,
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized, Immutable access to the Deref::Target of a value. Read more
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized,
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized, Mutable access to the Deref::Target of a value. Read more
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> SelfCalls .tap() only in debug builds, and is erased in release builds.
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> SelfCalls .tap_mut() only in debug builds, and is erased in release
builds. Read more
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized, Calls .tap_borrow() only in debug builds, and is erased in release
builds. Read more
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized, Calls .tap_borrow_mut() only in debug builds, and is erased in release
builds. Read more
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized, Calls .tap_ref() only in debug builds, and is erased in release
builds. Read more
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized, Calls .tap_ref_mut() only in debug builds, and is erased in release
builds. Read more
impl<T> ToOwned for T where
T: Clone, [src]
impl<T> ToOwned for T where
T: Clone, [src]type Owned = T
type Owned = TThe resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn to_owned(&self) -> T[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)[src]
pub fn clone_into(&self, target: &mut T)[src]🔬 This is a nightly-only experimental API. (toowned_clone_into)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,