Struct Ff 

pub struct Ff;

Trait Implementations

impl ByteOrd for Ff

fn bytes_cmp(&self, Self: &Self) -> Ordering

impl Clone for Ff

fn clone(&self) -> Ff

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Ff

impl Debug for Ff

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

Formats the value using the given formatter.

impl Default for Ff

fn default() -> Ff

Returns the “default value” for a type.

impl Eq for Ff

impl InlineOutput for Ff

fn slice_to_output(slice: &[Self], output: &mut impl Output)

where Self: Sized,

impl ListHashes for Ff

fn list_hashes(&self, visitor: &mut impl FnMut(Hash))

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl MaybeHasNiche for Ff

type MnArray = SomeNiche<DecrByteNiche<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B1>, B1>, B1>, B0>>>

Should implement [MnArray]. Not constraint explicitly, because that breaks things.

impl Monostate for Ff

impl Ord for Ff

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

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

where Self: Sized,

Restrict a value to a certain interval.

impl<__I: ParseInput> Parse<__I> for Ff

where Self: ParseInline<__I>,

fn parse(input: __I) -> Result<Self>

Parse consuming the whole stream.

impl<I: ParseInput> ParseInline<I> for Ff

fn parse_inline(input: &mut I) -> Result<Self>

Parse without consuming the whole stream. Errors on unexpected EOF.

fn parse_as_inline(input: I) -> Result<Self>

For implementing Parse::parse.

fn parse_vec(input: I) -> Result<Vec<Self>>

Parse a Vec of Self. Customisable for optimisations.

fn parse_vec_n(input: &mut I, n: usize) -> Result<Vec<Self>>

Parse a Vec of Self of length n. Customisable for optimisations.

fn parse_array<const N: usize>(input: &mut I) -> Result<[Self; N]>

Parse an array of Self. Customisable for optimisations.

fn parse_generic_array<N: ArrayLength>( input: &mut I, ) -> Result<GenericArray<Self, N>>

Parse a GenericArray of Self. Customisable for optimisations.

impl PartialEq for Ff

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialOrd for Ff

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

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl Size for Ff

type Size = UInt<UTerm, B1>

const SIZE: usize = <Self::Size as Unsigned>::USIZE

impl StructuralPartialEq for Ff

impl ToOutput for Ff

fn to_output(&self, output: &mut impl Output)

fn data_hash(&self) -> Hash

fn mangle_hash(&self) -> Hash

fn output<T: Output + Default>(&self) -> T

fn vec(&self) -> Vec<u8>

impl Topological for Ff

fn traverse(&self, visitor: &mut impl PointVisitor)

fn topology(&self) -> TopoVec