Trait ff::PrimeFieldRepr

pub trait PrimeFieldRepr: Sized + Copy + Clone + Eq + Ord + Send + Sync + Debug + 'static + Rand + AsRef<[u64]> + From<u64> {
    fn sub_noborrow(&mut self, other: &Self) -> bool;
    fn add_nocarry(&mut self, other: &Self) -> bool;
    fn num_bits(&self) -> u32;
    fn is_zero(&self) -> bool;
    fn is_odd(&self) -> bool;
    fn is_even(&self) -> bool;
    fn div2(&mut self);
    fn mul2(&mut self);
}

This trait represents a wrapper around a biginteger which can encode any element of a particular prime field. It is a smart wrapper around a sequence of u64 limbs, least-significant digit first.

Required Methods

fn sub_noborrow(&mut self, other: &Self) -> bool

Subtract another reprensetation from this one, returning the borrow bit.

fn add_nocarry(&mut self, other: &Self) -> bool

Add another representation to this one, returning the carry bit.

fn num_bits(&self) -> u32

Compute the number of bits needed to encode this number.

fn is_zero(&self) -> bool

Returns true iff this number is zero.

fn is_odd(&self) -> bool

Returns true iff this number is odd.

fn is_even(&self) -> bool

Returns true iff this number is even.

fn div2(&mut self)

Performs a rightwise bitshift of this number, effectively dividing it by 2.

fn mul2(&mut self)

Performs a leftwise bitshift of this number, effectively multiplying it by 2. Overflow is ignored.

Implementors