pub struct MultiEmulationParams {}Expand description
MultiEmulationParams.
Trait Implementations§
Source§impl Clone for MultiEmulationParams
impl Clone for MultiEmulationParams
Source§fn clone(&self) -> MultiEmulationParams
fn clone(&self) -> MultiEmulationParams
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for MultiEmulationParams
impl Debug for MultiEmulationParams
Source§impl Default for MultiEmulationParams
impl Default for MultiEmulationParams
Source§fn default() -> MultiEmulationParams
fn default() -> MultiEmulationParams
Returns the “default value” for a type. Read more
impl Eq for MultiEmulationParams
Source§impl FieldEmulationParams<Fq, FieldElement> for MultiEmulationParams
Secp256r1’s Base field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, FieldElement> for MultiEmulationParams
Secp256r1’s Base field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 64
const LOG2_BASE: u32 = 64
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 4
const NB_LIMBS: u32 = 4
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 17
const RC_LIMB_SIZE: u32 = 17
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Fp> for MultiEmulationParams
Secp256k1’s Base field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Fp> for MultiEmulationParams
Secp256k1’s Base field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 64
const LOG2_BASE: u32 = 64
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 4
const NB_LIMBS: u32 = 4
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 16
const RC_LIMB_SIZE: u32 = 16
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Fp> for MultiEmulationParams
BLS12-381’s Base field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Fp> for MultiEmulationParams
BLS12-381’s Base field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 56
const LOG2_BASE: u32 = 56
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 7
const NB_LIMBS: u32 = 7
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 15
const RC_LIMB_SIZE: u32 = 15
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Fp> for MultiEmulationParams
Curve25519’s Base field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Fp> for MultiEmulationParams
Curve25519’s Base field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 64
const LOG2_BASE: u32 = 64
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 4
const NB_LIMBS: u32 = 4
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 16
const RC_LIMB_SIZE: u32 = 16
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Fq> for MultiEmulationParams
BLS12-381’s Scalar field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Fq> for MultiEmulationParams
BLS12-381’s Scalar field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 52
const LOG2_BASE: u32 = 52
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 5
const NB_LIMBS: u32 = 5
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 14
const RC_LIMB_SIZE: u32 = 14
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Scalar> for MultiEmulationParams
Secp256k1’s Scalar field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Scalar> for MultiEmulationParams
Secp256k1’s Scalar field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 64
const LOG2_BASE: u32 = 64
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 4
const NB_LIMBS: u32 = 4
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 17
const RC_LIMB_SIZE: u32 = 17
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Scalar> for MultiEmulationParams
Secp256r1’s Scalar field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Scalar> for MultiEmulationParams
Secp256r1’s Scalar field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 64
const LOG2_BASE: u32 = 64
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 4
const NB_LIMBS: u32 = 4
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 17
const RC_LIMB_SIZE: u32 = 17
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl FieldEmulationParams<Fq, Scalar> for MultiEmulationParams
Curve25519’s Scalar field over BLS12-381’s Scalar field.
impl FieldEmulationParams<Fq, Scalar> for MultiEmulationParams
Curve25519’s Scalar field over BLS12-381’s Scalar field.
Source§const LOG2_BASE: u32 = 51
const LOG2_BASE: u32 = 51
The logarithm in base 2 (bit length) of the base in which we represent
integers modulo the emulated modulus.
The actual base is 2 powered to this constant.
Source§const NB_LIMBS: u32 = 5
const NB_LIMBS: u32 = 5
The number of limbs used to represent a emulated field element.
It must hold base^NB_LIMBS >= emulated_modulus.
Source§const RC_LIMB_SIZE: u32 = 17
const RC_LIMB_SIZE: u32 = 17
Log2 of the limb size of range-checks. This value is different and
independent of base, the size of ModArith limbs.
Source§fn moduli() -> Vec<BigInt>
fn moduli() -> Vec<BigInt>
Auxiliary moduli used in the identities. They should be as large as
possible, to maximize their contribution to the lcm bound.
On the other hand, they cannot be excessively large, in order to
guarantee no wrap-around (modulo the native modulus) in the equations.
Source§fn base_powers() -> Vec<BI>
fn base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The i-th element must be congruent to base^i modulo the emulated
modulus.
Source§fn double_base_powers() -> Vec<BI>
fn double_base_powers() -> Vec<BI>
Vector of powers of the base, used for the foreign-field identities.
The (i * nb_limbs + j)-th element must be congruent to base^(i+j) modulo
the emulated modulus.
Source§fn max_limb_bound() -> BI
fn max_limb_bound() -> BI
A bound on the maximum size of the absolute value of limb bounds for
non-well-formed emulated field elements. If such bound is exceeded, the
normalization function can no longer be applied.
We set this value to be base^2 by default. This value is guaranteed to
be supported with the same moduli as those used for the multiplication
gate. Another good choice for this value would be the largest possible
value that allows us to implement the normalization gate with only
one extra auxiliary modulus.
Source§impl PartialEq for MultiEmulationParams
impl PartialEq for MultiEmulationParams
Source§fn eq(&self, other: &MultiEmulationParams) -> bool
fn eq(&self, other: &MultiEmulationParams) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for MultiEmulationParams
Auto Trait Implementations§
impl Freeze for MultiEmulationParams
impl RefUnwindSafe for MultiEmulationParams
impl Send for MultiEmulationParams
impl Sync for MultiEmulationParams
impl Unpin for MultiEmulationParams
impl UnsafeUnpin for MultiEmulationParams
impl UnwindSafe for MultiEmulationParams
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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn 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.Source§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.Source§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.Source§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.Source§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.Source§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.Source§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.Source§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.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 moreSource§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self, then passes self.as_ref() into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self, then passes self.as_mut() into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self, then passes self.deref() into the pipe function.Source§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> SyncDeps for T
Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B> of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B> of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R> view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R> view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap() only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut() only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref() only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut() only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref() only in debug builds, and is erased in release
builds.