pub trait PrimeFieldRepr: 'static + Sized + Copy + Clone + Eq + Ord + Send + Sync + Default + Debug + Display + Rand + AsRef<[u64]> + AsMut<[u64]> + From<u64> + Hash + Serialize + DeserializeOwned {
Show 14 methods fn sub_noborrow(&mut self, other: &Self); fn add_nocarry(&mut self, other: &Self); 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 shr(&mut self, amt: u32); fn mul2(&mut self); fn shl(&mut self, amt: u32); fn write_be<W>(&self, writer: W) -> Result<(), Error>
    where
        W: Write
, { ... } fn read_be<R>(&mut self, reader: R) -> Result<(), Error>
    where
        R: Read
, { ... } fn write_le<W>(&self, writer: W) -> Result<(), Error>
    where
        W: Write
, { ... } fn read_le<R>(&mut self, reader: R) -> Result<(), Error>
    where
        R: Read
, { ... }
}
Expand description

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

Subtract another represetation from this one.

Add another representation to this one.

Compute the number of bits needed to encode this number. Always a multiple of 64.

Returns true iff this number is zero.

Returns true iff this number is odd.

Returns true iff this number is even.

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

Performs a rightwise bitshift of this number by some amount.

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

Performs a leftwise bitshift of this number by some amount.

Provided Methods

Writes this PrimeFieldRepr as a big endian integer.

Reads a big endian integer into this representation.

Writes this PrimeFieldRepr as a little endian integer.

Reads a little endian integer into this representation.

Implementors