pub struct Gf2Ext<P: Gf2ExtParams, const LIMBS: usize> { /* private fields */ }Implementations§
Source§impl Gf2Ext<IdGf2_128, 2>
impl Gf2Ext<IdGf2_128, 2>
Sourcepub fn into_ne_bytes_array(self) -> [u8; 16]
pub fn into_ne_bytes_array(self) -> [u8; 16]
Casts the field element to a core byte array
pub fn from_ne_bytes_array(arr: [u8; 16]) -> Self
Source§impl Gf2Ext<IdGf2_128, 2>
impl Gf2Ext<IdGf2_128, 2>
pub fn to_le_block(&self) -> Block
pub fn into_le_block(self) -> Block
pub fn as_ne_block_mut(&mut self) -> &mut Block
pub fn from_le_block(block: Block) -> Self
Source§impl<P: Gf2ExtParams, const LIMBS: usize> Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> Gf2Ext<P, LIMBS>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> Gf2Ext<P, LIMBS>
Trait Implementations§
Source§impl<P: Gf2ExtParams, const LIMBS: usize> AddAssign<&Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> AddAssign<&Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
Source§fn add_assign(&mut self, rhs: &Self)
fn add_assign(&mut self, rhs: &Self)
+= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> AddAssign for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> AddAssign for Gf2Ext<P, LIMBS>
Source§fn add_assign(&mut self, rhs: Gf2Ext<P, LIMBS>)
fn add_assign(&mut self, rhs: Gf2Ext<P, LIMBS>)
+= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> AsMut<PhantomData<P>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> AsMut<PhantomData<P>> for Gf2Ext<P, LIMBS>
Source§fn as_mut(&mut self) -> &mut PhantomData<P>
fn as_mut(&mut self) -> &mut PhantomData<P>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> AsRef<PhantomData<P>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> AsRef<PhantomData<P>> for Gf2Ext<P, LIMBS>
Source§fn as_ref(&self) -> &PhantomData<P>
fn as_ref(&self) -> &PhantomData<P>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> ConditionallySelectable for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> ConditionallySelectable for Gf2Ext<P, LIMBS>
Source§fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self
fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self
Source§fn conditional_assign(&mut self, other: &Self, choice: Choice)
fn conditional_assign(&mut self, other: &Self, choice: Choice)
Source§fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)
fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)
self and other if choice == 1; otherwise,
reassign both unto themselves. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> ConstantTimeEq for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> ConstantTimeEq for Gf2Ext<P, LIMBS>
Source§impl<'de, P: Gf2ExtParams, const LIMBS: usize> Deserialize<'de> for Gf2Ext<P, LIMBS>
impl<'de, P: Gf2ExtParams, const LIMBS: usize> Deserialize<'de> for Gf2Ext<P, LIMBS>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl<'a, 'b, P: Gf2ExtParams, const LIMBS: usize> DotProduct<&'a Gf2Ext<P, LIMBS>, &'b Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>where
Self: DefaultDotProduct,
impl<'a, 'b, P: Gf2ExtParams, const LIMBS: usize> DotProduct<&'a Gf2Ext<P, LIMBS>, &'b Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>where
Self: DefaultDotProduct,
fn dot<I1, I2>(a: I1, b: I2) -> Selfwhere
I1: IntoExactSizeIterator<Item = &'a Self>,
I2: IntoExactSizeIterator<Item = &'b Self>,
Source§impl<'a, P: Gf2ExtParams, const LIMBS: usize> DotProduct<Gf2Ext<P, LIMBS>, &'a Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>where
Self: DefaultDotProduct,
impl<'a, P: Gf2ExtParams, const LIMBS: usize> DotProduct<Gf2Ext<P, LIMBS>, &'a Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>where
Self: DefaultDotProduct,
fn dot<I1, I2>(a: I1, b: I2) -> Selfwhere
I1: IntoExactSizeIterator<Item = Self>,
I2: IntoExactSizeIterator<Item = &'a Self>,
Source§impl<P: Gf2ExtParams, const LIMBS: usize> Field for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> Field for Gf2Ext<P, LIMBS>
Source§fn random(rng: impl RngCore) -> Self
fn random(rng: impl RngCore) -> Self
Source§fn invert(&self) -> CtOption<Self>
fn invert(&self) -> CtOption<Self>
Source§fn sqrt_ratio(_num: &Self, _div: &Self) -> (Choice, Self)
fn sqrt_ratio(_num: &Self, _div: &Self) -> (Choice, Self)
Source§fn is_zero_vartime(&self) -> bool
fn is_zero_vartime(&self) -> bool
Source§fn sqrt(&self) -> CtOption<Self>
fn sqrt(&self) -> CtOption<Self>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> FieldExtension for Gf2Ext<P, LIMBS>where
Gf2Ext<P, LIMBS>: MulWide<Output = Gf2LimbsWide<LIMBS>>,
[u8; LIMBS]: AssocArraySize,
<[u8; LIMBS] as AssocArraySize>::Size: ArraySize + Positive + Mul<U8> + Mul<U64>,
Prod<<[u8; LIMBS] as AssocArraySize>::Size, U8>: ArraySize + Positive,
Prod<<[u8; LIMBS] as AssocArraySize>::Size, U64>: ArraySize + Positive,
impl<P: Gf2ExtParams, const LIMBS: usize> FieldExtension for Gf2Ext<P, LIMBS>where
Gf2Ext<P, LIMBS>: MulWide<Output = Gf2LimbsWide<LIMBS>>,
[u8; LIMBS]: AssocArraySize,
<[u8; LIMBS] as AssocArraySize>::Size: ArraySize + Positive + Mul<U8> + Mul<U64>,
Prod<<[u8; LIMBS] as AssocArraySize>::Size, U8>: ArraySize + Positive,
Prod<<[u8; LIMBS] as AssocArraySize>::Size, U64>: ArraySize + Positive,
type Subfield = Gf2
type Degree = <P as Gf2ExtParams>::Degree
type FieldBitSize = <<[u8; LIMBS] as AssocArraySize>::Size as Mul<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>>::Output
type FieldBytesSize = <<[u8; LIMBS] as AssocArraySize>::Size as Mul<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>>>::Output
fn to_subfield_elements(&self) -> impl ExactSizeIterator<Item = Self::Subfield>
fn from_subfield_elements(elems: &[Self::Subfield]) -> Option<Self>
fn to_le_bytes(&self) -> impl IntoIterator<Item = u8>
fn from_le_bytes(bytes: &[u8]) -> Option<Self>
fn mul_by_subfield(&self, other: &Self::Subfield) -> Self
fn generator() -> Self
fn random_elements<M: Positive>(rng: impl RngCore) -> HeapArray<Self, M>
Source§fn linear_orthomorphism(&self) -> Self
fn linear_orthomorphism(&self) -> Self
Source§impl<P: Gf2ExtParams, const LIMBS: usize> FromUniformBytes for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> FromUniformBytes for Gf2Ext<P, LIMBS>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> IntoWide<Gf2LimbsWide<LIMBS>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> IntoWide<Gf2LimbsWide<LIMBS>> for Gf2Ext<P, LIMBS>
fn to_wide(&self) -> Gf2LimbsWide<LIMBS>
fn zero_wide() -> Gf2LimbsWide<LIMBS>
Source§impl<'a, 'b, P: Gf2ExtParams, const LIMBS: usize> MulAccReduce<&'a Gf2Ext<P, LIMBS>, &'b Gf2> for Gf2Ext<P, LIMBS>
impl<'a, 'b, P: Gf2ExtParams, const LIMBS: usize> MulAccReduce<&'a Gf2Ext<P, LIMBS>, &'b Gf2> for Gf2Ext<P, LIMBS>
Source§impl<'a, P: Gf2ExtParams, const LIMBS: usize> MulAccReduce<&'a Gf2Ext<P, LIMBS>, Gf2> for Gf2Ext<P, LIMBS>
impl<'a, P: Gf2ExtParams, const LIMBS: usize> MulAccReduce<&'a Gf2Ext<P, LIMBS>, Gf2> for Gf2Ext<P, LIMBS>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> MulAccReduce<Gf2Ext<P, LIMBS>, Gf2> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> MulAccReduce<Gf2Ext<P, LIMBS>, Gf2> for Gf2Ext<P, LIMBS>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> MulAccReduce for Gf2Ext<P, LIMBS>where
Self: MulWide<Output = Gf2LimbsWide<LIMBS>>,
impl<P: Gf2ExtParams, const LIMBS: usize> MulAccReduce for Gf2Ext<P, LIMBS>where
Self: MulWide<Output = Gf2LimbsWide<LIMBS>>,
Source§impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign<&Gf2> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign<&Gf2> for Gf2Ext<P, LIMBS>
Source§fn mul_assign(&mut self, rhs: &Gf2)
fn mul_assign(&mut self, rhs: &Gf2)
*= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign<&Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign<&Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
Source§fn mul_assign(&mut self, rhs: &Gf2Ext<P, LIMBS>)
fn mul_assign(&mut self, rhs: &Gf2Ext<P, LIMBS>)
*= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign<Gf2> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign<Gf2> for Gf2Ext<P, LIMBS>
Source§fn mul_assign(&mut self, rhs: Gf2)
fn mul_assign(&mut self, rhs: Gf2)
*= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> MulAssign for Gf2Ext<P, LIMBS>
Source§fn mul_assign(&mut self, rhs: Self)
fn mul_assign(&mut self, rhs: Self)
*= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> Ord for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> Ord for Gf2Ext<P, LIMBS>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> PartialOrd for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> PartialOrd for Gf2Ext<P, LIMBS>
Source§impl<'a, P: Gf2ExtParams, const LIMBS: usize> Product<&'a Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
impl<'a, P: Gf2ExtParams, const LIMBS: usize> Product<&'a Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
Source§impl<P: Gf2ExtParams, const LIMBS: usize> ReduceWide<Gf2LimbsWide<LIMBS>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> ReduceWide<Gf2LimbsWide<LIMBS>> for Gf2Ext<P, LIMBS>
Source§fn reduce_mod_order(a: Gf2LimbsWide<LIMBS>) -> Self
fn reduce_mod_order(a: Gf2LimbsWide<LIMBS>) -> Self
Reduce a GF2 polynomial of 2*LIMBS down to LIMBS.
poly- polynomial to reduce
Source§impl<P: Gf2ExtParams, const LIMBS: usize> ReduceWide for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> ReduceWide for Gf2Ext<P, LIMBS>
fn reduce_mod_order(a: Self) -> Self
Source§impl<P: Gf2ExtParams, const LIMBS: usize> SubAssign<&Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> SubAssign<&Gf2Ext<P, LIMBS>> for Gf2Ext<P, LIMBS>
Source§fn sub_assign(&mut self, rhs: &Self)
fn sub_assign(&mut self, rhs: &Self)
-= operation. Read moreSource§impl<P: Gf2ExtParams, const LIMBS: usize> SubAssign for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> SubAssign for Gf2Ext<P, LIMBS>
Source§fn sub_assign(&mut self, rhs: Gf2Ext<P, LIMBS>)
fn sub_assign(&mut self, rhs: Gf2Ext<P, LIMBS>)
-= operation. Read moreimpl<P: Copy + Gf2ExtParams, const LIMBS: usize> Copy for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> DefaultDotProduct<&Gf2Ext<P, LIMBS>, &Gf2> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> DefaultDotProduct<&Gf2Ext<P, LIMBS>, Gf2> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> DefaultDotProduct<Gf2Ext<P, LIMBS>, Gf2> for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> DefaultDotProduct for Gf2Ext<P, LIMBS>where
Self: MulAccReduce,
impl<P: Eq + Gf2ExtParams, const LIMBS: usize> Eq for Gf2Ext<P, LIMBS>
impl<P: Gf2ExtParams, const LIMBS: usize> Pod for Gf2Ext<P, LIMBS>
Auto Trait Implementations§
impl<P, const LIMBS: usize> Freeze for Gf2Ext<P, LIMBS>
impl<P, const LIMBS: usize> RefUnwindSafe for Gf2Ext<P, LIMBS>where
P: RefUnwindSafe,
impl<P, const LIMBS: usize> Send for Gf2Ext<P, LIMBS>
impl<P, const LIMBS: usize> Sync for Gf2Ext<P, LIMBS>
impl<P, const LIMBS: usize> Unpin for Gf2Ext<P, LIMBS>
impl<P, const LIMBS: usize> UnwindSafe for Gf2Ext<P, LIMBS>where
P: UnwindSafe,
Blanket Implementations§
Source§impl<A, T> AsBits<T> for A
impl<A, T> AsBits<T> for A
Source§impl<A, T> AsMutBits<T> for A
impl<A, T> AsMutBits<T> for A
Source§fn as_mut_bits<O>(&mut self) -> &mut BitSlice<T, O>where
O: BitOrder,
fn as_mut_bits<O>(&mut self) -> &mut BitSlice<T, O>where
O: BitOrder,
self as a mutable bit-slice region with the O ordering.Source§fn try_as_mut_bits<O>(&mut self) -> Result<&mut BitSlice<T, O>, BitSpanError<T>>where
O: BitOrder,
fn try_as_mut_bits<O>(&mut self) -> Result<&mut BitSlice<T, O>, BitSpanError<T>>where
O: BitOrder,
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
Source§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
Source§type Bits = T
type Bits = T
Self must have the same layout as the specified Bits except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern.Source§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
bits
as &Self.Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> ConditionallyNegatable for T
impl<T> ConditionallyNegatable for T
Source§fn conditional_negate(&mut self, choice: Choice)
fn conditional_negate(&mut self, choice: Choice)
Source§impl<T> ConditionallySelectable for Twhere
T: ConditionallySelectable,
impl<T> ConditionallySelectable for Twhere
T: ConditionallySelectable,
Source§impl<T> ConstantTimeSelect for Twhere
T: ConditionallySelectable,
impl<T> ConstantTimeSelect for Twhere
T: ConditionallySelectable,
Source§impl<T, T1, T2> DotProduct<T1, T2> for Twhere
T: DefaultDotProduct<T1, T2>,
impl<T, T1, T2> DotProduct<T1, T2> for Twhere
T: DefaultDotProduct<T1, T2>,
fn dot<I1, I2>(a: I1, b: I2) -> Twhere
I1: IntoExactSizeIterator<Item = T1>,
I2: IntoExactSizeIterator<Item = T2>,
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,
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,
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,
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,
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,
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,
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,
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,
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>
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>
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,
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,
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,
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
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
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
self, then passes self.deref() into the pipe function.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> RandomNonZero for Twhere
T: FieldExtension,
impl<T> RandomNonZero for Twhere
T: FieldExtension,
Source§fn random_non_zero(rng: impl CryptoRngCore) -> Result<T, PrimitiveError>
fn random_non_zero(rng: impl CryptoRngCore) -> Result<T, PrimitiveError>
Generates a random non-zero value.
May error out if it cannot find a non-zero value after a certain number of tries, defined so that:
Prob(out == 0) <= 2^-(λ)as long asProb(random()==0) <= 2^-(size_of::<Self>)
The default implementation repetitively calls random() (rejection sampling).
As such, it is not constant-time, but the side channel leakage should not impact security
as long as the rng is evaluated in constant time and produces uniformly random values.
If needed, override with a constant-time implementation using ConditionallySelectable and
always running for a fixed number of iterations, potentially returning a zero value
(with overwhelmingly low probability).
fn random_n_non_zero<Container>(
rng: impl CryptoRngCore,
size: usize,
) -> Result<Container, PrimitiveError>where
Container: FromIterator<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
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
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
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
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
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
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
.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
.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
.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
.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
.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
.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
.tap_deref() only in debug builds, and is erased in release
builds.Source§impl<T> ToHex for T
impl<T> ToHex for T
Source§fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
self into the result. Lower case
letters are used (e.g. f9b4ca)Source§fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
self into the result. Upper case
letters are used (e.g. F9B4CA)