pub struct FieldArray<F, const N: usize>(pub [F; N])
where
F: Field;Tuple Fields§
§0: [F; N]Trait Implementations§
Source§impl<F, const N: usize> AbstractField for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> AbstractField for FieldArray<F, N>where
F: Field,
type F = F
fn zero() -> FieldArray<F, N>
fn one() -> FieldArray<F, N>
fn two() -> FieldArray<F, N>
fn neg_one() -> FieldArray<F, N>
fn from_f(f: <FieldArray<F, N> as AbstractField>::F) -> FieldArray<F, N>
fn from_bool(b: bool) -> FieldArray<F, N>
fn from_canonical_u8(n: u8) -> FieldArray<F, N>
fn from_canonical_u16(n: u16) -> FieldArray<F, N>
fn from_canonical_u32(n: u32) -> FieldArray<F, N>
fn from_canonical_u64(n: u64) -> FieldArray<F, N>
fn from_canonical_usize(n: usize) -> FieldArray<F, N>
fn from_wrapped_u32(n: u32) -> FieldArray<F, N>
fn from_wrapped_u64(n: u64) -> FieldArray<F, N>
Source§fn generator() -> FieldArray<F, N>
fn generator() -> FieldArray<F, N>
A generator of this field’s entire multiplicative group.
fn double(&self) -> Self
fn square(&self) -> Self
fn cube(&self) -> Self
fn exp_const_u64<const POWER: u64>(&self) -> Self
fn exp_power_of_2(&self, power_log: usize) -> Self
fn powers(&self) -> Powers<Self> ⓘ
fn shifted_powers(&self, start: Self) -> Powers<Self> ⓘ
fn powers_packed<P>(&self) -> PackedPowers<Self, P> ⓘwhere
P: PackedField<Scalar = Self>,
fn shifted_powers_packed<P>(&self, start: Self) -> PackedPowers<Self, P> ⓘwhere
P: PackedField<Scalar = Self>,
fn dot_product<const N: usize>(u: &[Self; N], v: &[Self; N]) -> Self
fn try_div<Rhs>(self, rhs: Rhs) -> Option<Self::Output>
Source§impl<F, const N: usize> Add for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> Add for FieldArray<F, N>where
F: Field,
Source§type Output = FieldArray<F, N>
type Output = FieldArray<F, N>
The resulting type after applying the
+ operator.Source§fn add(self, rhs: FieldArray<F, N>) -> <FieldArray<F, N> as Add>::Output
fn add(self, rhs: FieldArray<F, N>) -> <FieldArray<F, N> as Add>::Output
Performs the
+ operation. Read moreSource§impl<F, const N: usize> AddAssign<F> for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> AddAssign<F> for FieldArray<F, N>where
F: Field,
Source§fn add_assign(&mut self, rhs: F)
fn add_assign(&mut self, rhs: F)
Performs the
+= operation. Read moreSource§impl<F, const N: usize> AddAssign for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> AddAssign for FieldArray<F, N>where
F: Field,
Source§fn add_assign(&mut self, rhs: FieldArray<F, N>)
fn add_assign(&mut self, rhs: FieldArray<F, N>)
Performs the
+= operation. Read moreSource§impl<F, const N: usize> Clone for FieldArray<F, N>
impl<F, const N: usize> Clone for FieldArray<F, N>
Source§fn clone(&self) -> FieldArray<F, N>
fn clone(&self) -> FieldArray<F, N>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<F, const N: usize> Debug for FieldArray<F, N>
impl<F, const N: usize> Debug for FieldArray<F, N>
Source§impl<F, const N: usize> Default for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> Default for FieldArray<F, N>where
F: Field,
Source§fn default() -> FieldArray<F, N>
fn default() -> FieldArray<F, N>
Returns the “default value” for a type. Read more
Source§impl<F, const N: usize> From<[F; N]> for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> From<[F; N]> for FieldArray<F, N>where
F: Field,
Source§fn from(arr: [F; N]) -> FieldArray<F, N>
fn from(arr: [F; N]) -> FieldArray<F, N>
Converts to this type from the input type.
Source§impl<F, const N: usize> From<F> for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> From<F> for FieldArray<F, N>where
F: Field,
Source§fn from(val: F) -> FieldArray<F, N>
fn from(val: F) -> FieldArray<F, N>
Converts to this type from the input type.
Source§impl<F, const N: usize> Mul for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> Mul for FieldArray<F, N>where
F: Field,
Source§type Output = FieldArray<F, N>
type Output = FieldArray<F, N>
The resulting type after applying the
* operator.Source§fn mul(self, rhs: FieldArray<F, N>) -> <FieldArray<F, N> as Mul>::Output
fn mul(self, rhs: FieldArray<F, N>) -> <FieldArray<F, N> as Mul>::Output
Performs the
* operation. Read moreSource§impl<F, const N: usize> MulAssign<F> for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> MulAssign<F> for FieldArray<F, N>where
F: Field,
Source§fn mul_assign(&mut self, rhs: F)
fn mul_assign(&mut self, rhs: F)
Performs the
*= operation. Read moreSource§impl<F, const N: usize> MulAssign for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> MulAssign for FieldArray<F, N>where
F: Field,
Source§fn mul_assign(&mut self, rhs: FieldArray<F, N>)
fn mul_assign(&mut self, rhs: FieldArray<F, N>)
Performs the
*= operation. Read moreSource§impl<F, const N: usize> PartialEq for FieldArray<F, N>
impl<F, const N: usize> PartialEq for FieldArray<F, N>
Source§impl<F, const N: usize> Product for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> Product for FieldArray<F, N>where
F: Field,
Source§fn product<I>(iter: I) -> FieldArray<F, N>where
I: Iterator<Item = FieldArray<F, N>>,
fn product<I>(iter: I) -> FieldArray<F, N>where
I: Iterator<Item = FieldArray<F, N>>,
Takes an iterator and generates
Self from the elements by multiplying
the items.Source§impl<F, const N: usize> Sub for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> Sub for FieldArray<F, N>where
F: Field,
Source§type Output = FieldArray<F, N>
type Output = FieldArray<F, N>
The resulting type after applying the
- operator.Source§fn sub(self, rhs: FieldArray<F, N>) -> <FieldArray<F, N> as Sub>::Output
fn sub(self, rhs: FieldArray<F, N>) -> <FieldArray<F, N> as Sub>::Output
Performs the
- operation. Read moreSource§impl<F, const N: usize> SubAssign<F> for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> SubAssign<F> for FieldArray<F, N>where
F: Field,
Source§fn sub_assign(&mut self, rhs: F)
fn sub_assign(&mut self, rhs: F)
Performs the
-= operation. Read moreSource§impl<F, const N: usize> SubAssign for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> SubAssign for FieldArray<F, N>where
F: Field,
Source§fn sub_assign(&mut self, rhs: FieldArray<F, N>)
fn sub_assign(&mut self, rhs: FieldArray<F, N>)
Performs the
-= operation. Read moreSource§impl<F, const N: usize> Sum for FieldArray<F, N>where
F: Field,
impl<F, const N: usize> Sum for FieldArray<F, N>where
F: Field,
Source§fn sum<I>(iter: I) -> FieldArray<F, N>where
I: Iterator<Item = FieldArray<F, N>>,
fn sum<I>(iter: I) -> FieldArray<F, N>where
I: Iterator<Item = FieldArray<F, N>>,
Takes an iterator and generates
Self from the elements by “summing up”
the items.impl<F, const N: usize> Copy for FieldArray<F, N>
impl<F, const N: usize> Eq for FieldArray<F, N>
impl<F, const N: usize> StructuralPartialEq for FieldArray<F, N>where
F: Field,
Auto Trait Implementations§
impl<F, const N: usize> Freeze for FieldArray<F, N>where
F: Freeze,
impl<F, const N: usize> RefUnwindSafe for FieldArray<F, N>where
F: RefUnwindSafe,
impl<F, const N: usize> Send for FieldArray<F, N>
impl<F, const N: usize> Sync for FieldArray<F, N>
impl<F, const N: usize> Unpin for FieldArray<F, N>where
F: Unpin,
impl<F, const N: usize> UnsafeUnpin for FieldArray<F, N>where
F: UnsafeUnpin,
impl<F, const N: usize> UnwindSafe for FieldArray<F, N>where
F: UnwindSafe,
Blanket Implementations§
Source§impl<AF> AbstractExtensionField<AF> for AFwhere
AF: AbstractField,
impl<AF> AbstractExtensionField<AF> for AFwhere
AF: AbstractField,
const D: usize = 1
fn from_base(b: AF) -> AF
Source§fn from_base_slice(bs: &[AF]) -> AF
fn from_base_slice(bs: &[AF]) -> AF
Suppose this field extension is represented by the quotient
ring B[X]/(f(X)) where B is
Base and f is an irreducible
polynomial of degree D. This function takes a slice bs of
length at most D, and constructs the field element
\sum_i bs[i] * X^i. Read moreSource§fn from_base_fn<F>(f: F) -> AF
fn from_base_fn<F>(f: F) -> AF
Similar to
core:array::from_fn, with the same caveats as
from_base_slice.Source§fn as_base_slice(&self) -> &[AF]
fn as_base_slice(&self) -> &[AF]
Suppose this field extension is represented by the quotient
ring B[X]/(f(X)) where B is
Base and f is an irreducible
polynomial of degree D. This function takes a field element
\sum_i bs[i] * X^i and returns the coefficients as a slice
bs of length at most D containing, from lowest degree to
highest. Read moreSource§fn monomial(exponent: usize) -> Self
fn monomial(exponent: usize) -> Self
Suppose this field extension is represented by the quotient
ring B[X]/(f(X)) where B is
Base and f is an irreducible
polynomial of degree D. This function returns the field
element X^exponent if exponent < D and panics otherwise.
(The fact that f is not known at the point that this function
is defined prevents implementing exponentiation of higher
powers since the reduction cannot be performed.) Read moreSource§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 more