Struct pairing::bls12_381::G1Affine
[−]
[src]
pub struct G1Affine { /* fields omitted */ }
Trait Implementations
impl Copy for G1Affine
[src]
impl Clone for G1Affine
[src]
fn clone(&self) -> G1Affine
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl PartialEq for G1Affine
[src]
fn eq(&self, __arg_0: &G1Affine) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &G1Affine) -> bool
[src]
This method tests for !=
.
impl Eq for G1Affine
[src]
impl Debug for G1Affine
[src]
impl Display for G1Affine
[src]
fn fmt(&self, f: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl CurveAffine for G1Affine
[src]
type Engine = Bls12
type Scalar = Fr
type Base = Fq
type Prepared = G1Prepared
type Projective = G1
type Uncompressed = G1Uncompressed
type Compressed = G1Compressed
type Pair = G2Affine
type PairingResult = Fq12
fn zero() -> Self
[src]
Returns the additive identity.
fn one() -> Self
[src]
Returns a fixed generator of unknown exponent.
fn is_zero(&self) -> bool
[src]
Determines if this point represents the point at infinity; the additive identity. Read more
fn mul<S: Into<<Self::Scalar as PrimeField>::Repr>>(&self, by: S) -> G1
[src]
Performs scalar multiplication of this element with mixed addition.
fn negate(&mut self)
[src]
Negates this element.
fn prepare(&self) -> Self::Prepared
[src]
Prepares this element for pairing purposes.
fn pairing_with(&self, other: &Self::Pair) -> Self::PairingResult
[src]
Perform a pairing
fn into_projective(&self) -> G1
[src]
Converts this element into its affine representation.
fn into_compressed(&self) -> Self::Compressed
[src]
Converts this element into its compressed encoding, so long as it's not the point at infinity. Read more
fn into_uncompressed(&self) -> Self::Uncompressed
[src]
Converts this element into its uncompressed encoding, so long as it's not the point at infinity. Read more