Struct Fp 

pub struct Fp { /* private fields */ }

An element of GF(p) for a prime p < 2^64 chosen at runtime.

Fp::zero() and Fp::one() carry no modulus (p = 0) and adopt the modulus of whatever they meet, so generic code that starts from F::zero() or F::one() works unchanged.

Implementations

impl Fp

pub const fn new(v: u64, p: u64) -> Self

v modulo p, or an unbound constant when p = 0.

pub fn from_i64(x: i64, p: u64) -> Self

pub fn from_rational(q: &BigRational, p: u64) -> Option<Self>

q modulo p, or None when p divides its denominator.

pub const fn value(self) -> u64

pub const fn modulus(self) -> u64

The prime, or 0 for a constant not yet bound to one.

pub const fn try_inverse(self) -> Option<Self>

The inverse, or None for a non-unit: zero, a residue sharing a factor with a composite modulus, or an unbound constant other than 1 and -1.

pub fn bind(self, p: u64) -> Self

Trait Implementations

impl Add for Fp

type Output = Fp

The resulting type after applying the + operator.

fn add(self, o: Self) -> Self

Performs the + operation.

impl Clone for Fp

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Fp

impl Debug for Fp

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

Formats the value using the given formatter.

impl Display for Fp

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

Formats the value using the given formatter.

impl Div for Fp

type Output = Fp

The resulting type after applying the / operator.

fn div(self, o: Self) -> Self

Performs the / operation.

impl Eq for Fp

impl From<i32> for Fp

fn from(x: i32) -> Self

An unbound constant.

impl Hash for Fp

Hashes the symmetric residue, so equal elements of one field hash alike and an unbound constant hashes like its binding whenever it is below p / 2 in magnitude.

fn hash<H: Hasher>(&self, h: &mut H)

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Modular for Fp

fn modulus(&self) -> u64

The prime, or 0 for a constant not yet bound to one.

fn residue(&self) -> u64

The stored residue; a signed integer in two’s complement while unbound.

fn from_residue(v: u64, p: u64) -> Self

fn residue_mod(&self, p: u64) -> u64

The residue in [0, p), binding an unbound constant to p.

impl Mul for Fp

type Output = Fp

The resulting type after applying the * operator.

fn mul(self, o: Self) -> Self

Performs the * operation.

impl Neg for Fp

type Output = Fp

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl One for Fp

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl PartialEq for Fp

fn eq(&self, o: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Sub for Fp

type Output = Fp

The resulting type after applying the - operator.

fn sub(self, o: Self) -> Self

Performs the - operation.

impl Zero for Fp

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.