binius_field::binary_field

Struct BinaryField128b

source
pub struct BinaryField128b(/* private fields */);

Implementations§

source§

impl BinaryField128b

source

pub const fn new(value: u128) -> Self

source

pub fn val(self) -> u128

Trait Implementations§

source§

impl Add<&BinaryField128b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: &Self) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField16b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField1b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField2b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField32b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField4b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField64b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField128b> for BinaryField8b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField128b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField16b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField16b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField1b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField1b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField2b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField2b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField32b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField32b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField4b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField4b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField64b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField64b) -> Self::Output

Performs the + operation. Read more
source§

impl Add<BinaryField8b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: BinaryField8b) -> Self::Output

Performs the + operation. Read more
source§

impl Add for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the + operator.
source§

fn add(self, rhs: Self) -> Self::Output

Performs the + operation. Read more
source§

impl AddAssign<&BinaryField128b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: &Self)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField16b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField16b)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField1b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField1b)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField2b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField2b)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField32b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField32b)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField4b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField4b)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField64b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField64b)

Performs the += operation. Read more
source§

impl AddAssign<BinaryField8b> for BinaryField128b

source§

fn add_assign(&mut self, rhs: BinaryField8b)

Performs the += operation. Read more
source§

impl AddAssign for BinaryField128b

source§

fn add_assign(&mut self, rhs: Self)

Performs the += operation. Read more
source§

impl AsSinglePacked for BinaryField128b

source§

type Packed = PackedPrimitiveType<M128, BinaryField128b>

source§

fn to_single_packed(self) -> Self::Packed

source§

fn from_single_packed(value: Self::Packed) -> Self

source§

impl BinaryField for BinaryField128b

source§

impl Clone for BinaryField128b

source§

fn clone(&self) -> BinaryField128b

Returns a copy of the value. Read more
1.6.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl ConditionallySelectable for BinaryField128b

source§

fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self

Select a or b according to choice. Read more
source§

fn conditional_assign(&mut self, other: &Self, choice: Choice)

Conditionally assign other to self, according to choice. Read more
source§

fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)

Conditionally swap self and other if choice == 1; otherwise, reassign both unto themselves. Read more
source§

impl ConstantTimeEq for BinaryField128b

source§

fn ct_eq(&self, other: &Self) -> Choice

Determine if two items are equal. Read more
source§

fn ct_ne(&self, other: &Self) -> Choice

Determine if two items are NOT equal. Read more
source§

impl Debug for BinaryField128b

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Default for BinaryField128b

source§

fn default() -> BinaryField128b

Returns the “default value” for a type. Read more
source§

impl DeserializeBytes for BinaryField128b

source§

fn deserialize(read_buf: impl Buf) -> Result<Self, SerializationError>

source§

impl Display for BinaryField128b

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl ExtensionField<BinaryField16b> for BinaryField128b

source§

const LOG_DEGREE: usize = 3usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField16b; 8] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField16b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl ExtensionField<BinaryField1b> for BinaryField128b

source§

const LOG_DEGREE: usize = 7usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField1b; 128] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField1b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl ExtensionField<BinaryField2b> for BinaryField128b

source§

const LOG_DEGREE: usize = 6usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField2b; 64] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField2b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl ExtensionField<BinaryField32b> for BinaryField128b

source§

const LOG_DEGREE: usize = 2usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField32b; 4] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField32b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl ExtensionField<BinaryField4b> for BinaryField128b

source§

const LOG_DEGREE: usize = 5usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField4b; 32] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField4b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl ExtensionField<BinaryField64b> for BinaryField128b

source§

const LOG_DEGREE: usize = 1usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField64b; 2] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField64b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl ExtensionField<BinaryField8b> for BinaryField128b

source§

const LOG_DEGREE: usize = 4usize

Base-2 logarithm of the extension degree.
source§

type Iterator = <[BinaryField8b; 16] as IntoIterator>::IntoIter

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<Self, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse( base_elems: &[BinaryField8b], log_stride: usize, ) -> Result<Self, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> Self::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl Field for BinaryField128b

source§

const ZERO: Self = _

The zero element of the field, the additive identity.
source§

const ONE: Self = _

The one element of the field, the multiplicative identity.
source§

fn random(rng: impl RngCore) -> Self

Returns an element chosen uniformly at random using a user-provided RNG.
source§

fn double(&self) -> Self

Doubles this element.
source§

fn is_zero(&self) -> bool

Returns true iff this element is zero.
source§

fn invert(&self) -> Option<Self>

Computes the multiplicative inverse of this element, failing if the element is zero.
source§

fn pow<S: AsRef<[u64]>>(&self, exp: S) -> Self

Exponentiates self by exp, where exp is a little-endian order integer exponent. Read more
source§

fn pow_vartime<S: AsRef<[u64]>>(&self, exp: S) -> Self

Exponentiates self by exp, where exp is a little-endian order integer exponent. Read more
source§

impl From<(BinaryField64b, BinaryField64b)> for BinaryField128b

source§

fn from((a, b): (BinaryField64b, BinaryField64b)) -> Self

Converts to this type from the input type.
source§

impl From<AESTowerField128b> for BinaryField128b

source§

fn from(value: AESTowerField128b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField128b> for (BinaryField64b, BinaryField64b)

source§

fn from(src: BinaryField128b) -> (BinaryField64b, BinaryField64b)

Converts to this type from the input type.
source§

impl From<BinaryField128b> for AESTowerField128b

source§

fn from(value: BinaryField128b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField128b> for BinaryField128bPolyval

source§

fn from(value: BinaryField128b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField128b> for u128

source§

fn from(val: BinaryField128b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField128bPolyval> for BinaryField128b

source§

fn from(value: BinaryField128bPolyval) -> BinaryField128b

Converts to this type from the input type.
source§

impl From<BinaryField16b> for BinaryField128b

source§

fn from(elem: BinaryField16b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField1b> for BinaryField128b

source§

fn from(elem: BinaryField1b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField2b> for BinaryField128b

source§

fn from(elem: BinaryField2b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField32b> for BinaryField128b

source§

fn from(elem: BinaryField32b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField4b> for BinaryField128b

source§

fn from(elem: BinaryField4b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField64b> for BinaryField128b

source§

fn from(elem: BinaryField64b) -> Self

Converts to this type from the input type.
source§

impl From<BinaryField8b> for BinaryField128b

source§

fn from(elem: BinaryField8b) -> Self

Converts to this type from the input type.
source§

impl From<u128> for BinaryField128b

source§

fn from(val: u128) -> Self

Converts to this type from the input type.
source§

impl Hash for BinaryField128b

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.6.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl InvertOrZero for BinaryField128b

source§

fn invert_or_zero(self) -> Self

Returns the inverted value or zero in case when self is zero
source§

impl Mul<&BinaryField128b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: &Self) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField16b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField1b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField2b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField32b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField4b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField64b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField128b> for BinaryField8b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField128b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField16b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField16b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField1b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField1b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField2b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField2b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField32b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField32b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField4b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField4b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField64b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField64b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul<BinaryField8b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: BinaryField8b) -> Self::Output

Performs the * operation. Read more
source§

impl Mul for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the * operator.
source§

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation. Read more
source§

impl MulAssign<&BinaryField128b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: &Self)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField16b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField16b)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField1b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField1b)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField2b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField2b)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField32b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField32b)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField4b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField4b)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField64b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField64b)

Performs the *= operation. Read more
source§

impl MulAssign<BinaryField8b> for BinaryField128b

source§

fn mul_assign(&mut self, rhs: BinaryField8b)

Performs the *= operation. Read more
source§

impl MulAssign for BinaryField128b

source§

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation. Read more
source§

impl Neg for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn neg(self) -> Self::Output

Performs the unary - operation. Read more
source§

impl Ord for BinaryField128b

source§

fn cmp(&self, other: &BinaryField128b) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for BinaryField128b

source§

fn eq(&self, other: &BinaryField128b) -> bool

Tests for self and other values to be equal, and is used by ==.
1.6.0 · source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl PartialOrd for BinaryField128b

source§

fn partial_cmp(&self, other: &BinaryField128b) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.6.0 · source§

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator. Read more
1.6.0 · source§

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.6.0 · source§

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator. Read more
1.6.0 · source§

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl<'a> Product<&'a BinaryField128b> for BinaryField128b

source§

fn product<I: Iterator<Item = &'a Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by multiplying the items.
source§

impl Product for BinaryField128b

source§

fn product<I: Iterator<Item = Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by multiplying the items.
source§

impl SerializeBytes for BinaryField128b

source§

fn serialize(&self, write_buf: impl BufMut) -> Result<(), SerializationError>

source§

impl Square for BinaryField128b

source§

fn square(self) -> Self

Returns the value multiplied by itself
source§

impl Step for BinaryField128b

source§

fn steps_between(start: &Self, end: &Self) -> Option<usize>

🔬This is a nightly-only experimental API. (step_trait)
Returns the number of successor steps required to get from start to end. Read more
source§

fn forward_checked(start: Self, count: usize) -> Option<Self>

🔬This is a nightly-only experimental API. (step_trait)
Returns the value that would be obtained by taking the successor of self count times. Read more
source§

fn backward_checked(start: Self, count: usize) -> Option<Self>

🔬This is a nightly-only experimental API. (step_trait)
Returns the value that would be obtained by taking the predecessor of self count times. Read more
source§

fn forward(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)
Returns the value that would be obtained by taking the successor of self count times. Read more
source§

unsafe fn forward_unchecked(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)
Returns the value that would be obtained by taking the successor of self count times. Read more
source§

fn backward(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)
Returns the value that would be obtained by taking the predecessor of self count times. Read more
source§

unsafe fn backward_unchecked(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)
Returns the value that would be obtained by taking the predecessor of self count times. Read more
source§

impl Sub<&BinaryField128b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: &Self) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField16b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField1b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField2b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField32b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField4b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField64b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField128b> for BinaryField8b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField128b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField16b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField16b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField1b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField1b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField2b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField2b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField32b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField32b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField4b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField4b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField64b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField64b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub<BinaryField8b> for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: BinaryField8b) -> Self::Output

Performs the - operation. Read more
source§

impl Sub for BinaryField128b

source§

type Output = BinaryField128b

The resulting type after applying the - operator.
source§

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation. Read more
source§

impl SubAssign<&BinaryField128b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: &Self)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField16b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField16b)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField1b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField1b)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField2b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField2b)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField32b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField32b)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField4b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField4b)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField64b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField64b)

Performs the -= operation. Read more
source§

impl SubAssign<BinaryField8b> for BinaryField128b

source§

fn sub_assign(&mut self, rhs: BinaryField8b)

Performs the -= operation. Read more
source§

impl SubAssign for BinaryField128b

source§

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation. Read more
source§

impl<'a> Sum<&'a BinaryField128b> for BinaryField128b

source§

fn sum<I: Iterator<Item = &'a Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by “summing up” the items.
source§

impl Sum for BinaryField128b

source§

fn sum<I: Iterator<Item = Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by “summing up” the items.
source§

impl TowerField for BinaryField128b

source§

const TOWER_LEVEL: usize = 7usize

The level $\iota$ in the tower, where this field is isomorphic to $T_{\iota}$.
source§

type Canonical = BinaryField128b

The canonical field isomorphic to this tower field. Currently for every tower field, the canonical field is Fan-Paar’s binary field of the same degree.
source§

fn mul_primitive(self, iota: usize) -> Result<Self, Error>

Multiplies a field element by the canonical primitive element of the extension $T_{\iota + 1} / T_{iota}$. Read more
source§

fn basis(iota: usize, i: usize) -> Result<Self, Error>

source§

impl TransparentWrapper<u128> for BinaryField128b

§

fn wrap(s: Inner) -> Self
where Self: Sized,

Convert the inner type into the wrapper type.
§

fn wrap_ref(s: &Inner) -> &Self

Convert a reference to the inner type into a reference to the wrapper type.
§

fn wrap_mut(s: &mut Inner) -> &mut Self

Convert a mutable reference to the inner type into a mutable reference to the wrapper type.
§

fn wrap_slice(s: &[Inner]) -> &[Self]
where Self: Sized,

Convert a slice to the inner type into a slice to the wrapper type.
§

fn wrap_slice_mut(s: &mut [Inner]) -> &mut [Self]
where Self: Sized,

Convert a mutable slice to the inner type into a mutable slice to the wrapper type.
§

fn peel(s: Self) -> Inner
where Self: Sized,

Convert the wrapper type into the inner type.
§

fn peel_ref(s: &Self) -> &Inner

Convert a reference to the wrapper type into a reference to the inner type.
§

fn peel_mut(s: &mut Self) -> &mut Inner

Convert a mutable reference to the wrapper type into a mutable reference to the inner type.
§

fn peel_slice(s: &[Self]) -> &[Inner]
where Self: Sized,

Convert a slice to the wrapped type into a slice to the inner type.
§

fn peel_slice_mut(s: &mut [Self]) -> &mut [Inner]
where Self: Sized,

Convert a mutable slice to the wrapped type into a mutable slice to the inner type.
source§

impl TryFrom<BinaryField128b> for BinaryField16b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl TryFrom<BinaryField128b> for BinaryField1b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl TryFrom<BinaryField128b> for BinaryField2b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl TryFrom<BinaryField128b> for BinaryField32b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl TryFrom<BinaryField128b> for BinaryField4b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl TryFrom<BinaryField128b> for BinaryField64b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl TryFrom<BinaryField128b> for BinaryField8b

source§

type Error = ()

The type returned in the event of a conversion error.
source§

fn try_from(elem: BinaryField128b) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl WithUnderlier for BinaryField128b

source§

type Underlier = u128

Underlier primitive type
source§

fn to_underlier(self) -> Self::Underlier

Convert value to underlier.
source§

fn to_underlier_ref(&self) -> &Self::Underlier

source§

fn to_underlier_ref_mut(&mut self) -> &mut Self::Underlier

source§

fn to_underliers_ref(val: &[Self]) -> &[Self::Underlier]

source§

fn to_underliers_ref_mut(val: &mut [Self]) -> &mut [Self::Underlier]

source§

fn from_underlier(val: Self::Underlier) -> Self

source§

fn from_underlier_ref(val: &Self::Underlier) -> &Self

source§

fn from_underlier_ref_mut(val: &mut Self::Underlier) -> &mut Self

source§

fn from_underliers_ref(val: &[Self::Underlier]) -> &[Self]

source§

fn from_underliers_ref_mut(val: &mut [Self::Underlier]) -> &mut [Self]

source§

fn mutate_underlier( self, f: impl FnOnce(Self::Underlier) -> Self::Underlier, ) -> Self

source§

impl Zeroable for BinaryField128b

§

fn zeroed() -> Self

source§

impl Copy for BinaryField128b

source§

impl Eq for BinaryField128b

source§

impl Pod for BinaryField128b

source§

impl StructuralPartialEq for BinaryField128b

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<F> ArchOptimal for F
where F: Field, M128: PackScalar<F>,

source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<F> Broadcast<F> for F
where F: Field,

source§

fn broadcast(scalar: F) -> F

Set `scalar`` value to all the positions
§

impl<T> CheckedBitPattern for T
where T: AnyBitPattern,

§

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.
§

fn is_valid_bit_pattern(_bits: &T) -> bool

If this function returns true, then it must be valid to reinterpret bits as &Self.
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<F> ExtensionField<F> for F
where F: Field,

source§

const LOG_DEGREE: usize = 0usize

Base-2 logarithm of the extension degree.
source§

type Iterator = Once<F>

Iterator returned by iter_bases.
source§

fn basis(i: usize) -> Result<F, Error>

For 0 <= i < DEGREE, returns i-th basis field element.
source§

fn from_bases_sparse(base_elems: &[F], log_stride: usize) -> Result<F, Error>

A specialized version of from_bases which assumes that only base field elements with indices dividing 2^log_stride can be nonzero. Read more
source§

fn iter_bases(&self) -> <F as ExtensionField<F>>::Iterator

Iterator over base field elements.
source§

const DEGREE: usize = _

Extension degree. Read more
source§

fn from_bases(base_elems: &[F]) -> Result<Self, Error>

Create an extension field element from a slice of base field elements in order consistent with basis(i) return values. Potentially faster than taking an inner product with a vector of basis elements.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

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 more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
source§

impl<T> MulAlpha for T
where T: TowerFieldArithmetic,

source§

fn mul_alpha(self) -> T

Multiply self by alpha
source§

impl<F, PT> PackedExtensionIndexable<F> for PT

source§

fn unpack_base_scalars(packed: &[Self]) -> &[F]

source§

fn unpack_base_scalars_mut(packed: &mut [Self]) -> &mut [F]

source§

impl<F> PackedField for F
where F: Field,

source§

const LOG_WIDTH: usize = 0usize

Base-2 logarithm of the number of field elements packed into one packed element.
source§

type Scalar = F

source§

unsafe fn get_unchecked(&self, _i: usize) -> <F as PackedField>::Scalar

Get the scalar at a given index without bounds checking. Read more
source§

unsafe fn set_unchecked( &mut self, _i: usize, scalar: <F as PackedField>::Scalar, )

Set the scalar at a given index without bounds checking. Read more
source§

fn iter(&self) -> impl Iterator<Item = <F as PackedField>::Scalar>

source§

fn random(rng: impl RngCore) -> F

source§

fn interleave(self, _other: F, _log_block_len: usize) -> (F, F)

Interleaves blocks of this packed vector with another packed vector. Read more
source§

fn broadcast(scalar: <F as PackedField>::Scalar) -> F

source§

fn square(self) -> F

Returns the value multiplied by itself
source§

fn invert_or_zero(self) -> F

Returns the packed inverse values or zeroes at indices where self is zero.
source§

fn from_fn(f: impl FnMut(usize) -> <F as PackedField>::Scalar) -> F

Construct a packed field element from a function that returns scalar values by index.
source§

unsafe fn spread_unchecked(self, _log_block_len: usize, _block_idx: usize) -> F

Unsafe version of Self::spread. Read more
source§

const WIDTH: usize = _

The number of field elements packed into one packed element. Read more
source§

fn get_checked(&self, i: usize) -> Result<Self::Scalar, Error>

Get the scalar at a given index.
source§

fn set_checked(&mut self, i: usize, scalar: Self::Scalar) -> Result<(), Error>

Set the scalar at a given index.
source§

fn get(&self, i: usize) -> Self::Scalar

Get the scalar at a given index.
source§

fn set(&mut self, i: usize, scalar: Self::Scalar)

Set the scalar at a given index.
source§

fn into_iter(self) -> impl Iterator<Item = Self::Scalar>

source§

fn zero() -> Self

source§

fn one() -> Self

source§

fn set_single(scalar: Self::Scalar) -> Self

Initialize zero position with scalar, set other elements to zero.
source§

fn from_scalars(values: impl IntoIterator<Item = Self::Scalar>) -> Self

Construct a packed field element from a sequence of scalars. Read more
source§

fn spread(self, log_block_len: usize, block_idx: usize) -> Self

Spread takes a block of elements within a packed field and repeats them to the full packing width. Read more
source§

impl<S, P> PackedFieldIndexable for P
where S: Field, P: PackedDivisible<S, Scalar = S>,

source§

fn unpack_scalars(packed: &[P]) -> &[<P as PackedField>::Scalar]

source§

fn unpack_scalars_mut(packed: &mut [P]) -> &mut [<P as PackedField>::Scalar]

§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<PT> TaggedInvertOrZero<PackedStrategy> for PT
where PT: PackedTowerField, <PT as PackedTowerField>::PackedDirectSubfield: MulAlpha, <PT as WithUnderlier>::Underlier: UnderlierWithBitConstants,

source§

fn invert_or_zero(self) -> PT

source§

impl<P> TaggedInvertOrZero<PairwiseRecursiveStrategy> for P
where P: PackedField, <P as PackedField>::Scalar: TowerExtensionField, <<P as PackedField>::Scalar as TowerExtensionField>::DirectSubfield: MulAlpha + InvertOrZero,

source§

impl<PT> TaggedInvertOrZero<PairwiseStrategy> for PT

source§

fn invert_or_zero(self) -> PT

source§

impl<P> TaggedMul<HybridRecursiveStrategy> for P
where P: PackedTowerField, <P as PackedField>::Scalar: TowerExtensionField<DirectSubfield = <P as PackedTowerField>::DirectSubfield>, <P as PackedTowerField>::PackedDirectSubfield: MulAlpha, <P as PackedTowerField>::DirectSubfield: MulAlpha,

source§

fn mul(self, rhs: P) -> P

source§

impl<PT> TaggedMul<PackedStrategy> for PT
where PT: PackedTowerField, <PT as WithUnderlier>::Underlier: UnderlierWithBitConstants, <PT as PackedTowerField>::DirectSubfield: TowerConstants<<PT as WithUnderlier>::Underlier>,

source§

fn mul(self, b: PT) -> PT

Optimized packed field multiplication algorithm

source§

impl<P> TaggedMul<PairwiseRecursiveStrategy> for P
where P: PackedField, <P as PackedField>::Scalar: TowerExtensionField, <<P as PackedField>::Scalar as TowerExtensionField>::DirectSubfield: MulAlpha,

source§

fn mul(self, rhs: P) -> P

source§

impl<PT> TaggedMul<PairwiseStrategy> for PT
where PT: PackedField,

source§

fn mul(self, b: PT) -> PT

source§

impl<P> TaggedMulAlpha<HybridRecursiveStrategy> for P
where P: PackedTowerField, <P as PackedField>::Scalar: TowerExtensionField<DirectSubfield = <P as PackedTowerField>::DirectSubfield>, <P as PackedTowerField>::PackedDirectSubfield: MulAlpha,

source§

fn mul_alpha(self) -> P

source§

impl<PT> TaggedMulAlpha<PackedStrategy> for PT
where PT: PackedTowerField, <PT as PackedTowerField>::PackedDirectSubfield: MulAlpha, <PT as WithUnderlier>::Underlier: UnderlierWithBitConstants,

source§

fn mul_alpha(self) -> PT

source§

impl<P> TaggedMulAlpha<PairwiseRecursiveStrategy> for P
where P: PackedField, <P as PackedField>::Scalar: TowerExtensionField, <<P as PackedField>::Scalar as TowerExtensionField>::DirectSubfield: MulAlpha,

source§

fn mul_alpha(self) -> P

source§

impl<PT> TaggedMulAlpha<PairwiseStrategy> for PT

source§

fn mul_alpha(self) -> PT

source§

impl<IP, OP> TaggedPackedTransformationFactory<PackedStrategy, OP> for IP

source§

type PackedTransformation<Data: Deref<Target = [<OP as PackedField>::Scalar]>> = PackedTransformation<OP>

source§

fn make_packed_transformation<Data>( transformation: FieldLinearTransformation<<OP as PackedField>::Scalar, Data>, ) -> <IP as TaggedPackedTransformationFactory<PackedStrategy, OP>>::PackedTransformation<Data>
where Data: Deref<Target = [<OP as PackedField>::Scalar]>,

source§

impl<IP, OP> TaggedPackedTransformationFactory<PairwiseStrategy, OP> for IP

source§

type PackedTransformation<Data: Deref<Target = [<OP as PackedField>::Scalar]>> = PairwiseTransformation<FieldLinearTransformation<<OP as PackedField>::Scalar, Data>>

source§

fn make_packed_transformation<Data>( transformation: FieldLinearTransformation<<OP as PackedField>::Scalar, Data>, ) -> <IP as TaggedPackedTransformationFactory<PairwiseStrategy, OP>>::PackedTransformation<Data>
where Data: Deref<Target = [<OP as PackedField>::Scalar]>,

source§

impl<P> TaggedSquare<HybridRecursiveStrategy> for P
where P: PackedTowerField, <P as PackedField>::Scalar: TowerExtensionField<DirectSubfield = <P as PackedTowerField>::DirectSubfield>, <P as PackedTowerField>::DirectSubfield: MulAlpha,

source§

fn square(self) -> P

source§

impl<PT> TaggedSquare<PackedStrategy> for PT
where PT: PackedTowerField, <PT as PackedTowerField>::PackedDirectSubfield: MulAlpha, <PT as WithUnderlier>::Underlier: UnderlierWithBitConstants,

source§

fn square(self) -> PT

source§

impl<P> TaggedSquare<PairwiseRecursiveStrategy> for P
where P: PackedField, <P as PackedField>::Scalar: TowerExtensionField, <<P as PackedField>::Scalar as TowerExtensionField>::DirectSubfield: MulAlpha,

source§

fn square(self) -> P

source§

impl<PT> TaggedSquare<PairwiseStrategy> for PT
where PT: PackedField, <PT as PackedField>::Scalar: Square,

source§

fn square(self) -> PT

source§

impl<T> TaggedSquare<ReuseMultiplyStrategy> for T
where T: Mul<Output = T> + Copy,

source§

fn square(self) -> T

source§

impl<T> ToOwned for T
where T: Clone,

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for T
where T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
§

impl<I, T> TransparentWrapperAlloc<I> for T
where T: TransparentWrapper<I> + ?Sized, I: ?Sized,

§

fn wrap_vec(s: Vec<Inner>) -> Vec<Self>
where Self: Sized,

Convert a vec of the inner type into a vec of the wrapper type.
§

fn wrap_box(s: Box<Inner>) -> Box<Self>

Convert a box to the inner type into a box to the wrapper type.
§

fn wrap_rc(s: Rc<Inner>) -> Rc<Self>

Convert an Rc to the inner type into an Rc to the wrapper type.
§

fn wrap_arc(s: Arc<Inner>) -> Arc<Self>

Convert an Arc to the inner type into an Arc to the wrapper type.
§

fn peel_vec(s: Vec<Self>) -> Vec<Inner>
where Self: Sized,

Convert a vec of the wrapper type into a vec of the inner type.
§

fn peel_box(s: Box<Self>) -> Box<Inner>

Convert a box to the wrapper type into a box to the inner type.
§

fn peel_rc(s: Rc<Self>) -> Rc<Inner>

Convert an Rc to the wrapper type into an Rc to the inner type.
§

fn peel_arc(s: Arc<Self>) -> Arc<Inner>

Convert an Arc to the wrapper type into an Arc to the inner type.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> AnyBitPattern for T
where T: Pod,

§

impl<T> NoUninit for T
where T: Pod,

source§

impl<PT> PackedBinaryField for PT

source§

impl<PT1, PT2> RepackedExtension<PT1> for PT2
where PT1: PackedField, PT2: PackedExtension<<PT1 as PackedField>::Scalar, PackedSubfield = PT1>, <PT2 as PackedField>::Scalar: ExtensionField<<PT1 as PackedField>::Scalar>,