Struct tls_parser::ExplicitPrimeContent

pub struct ExplicitPrimeContent<'a> {
    pub prime_p: &'a [u8],
    pub curve: ECCurve<'a>,
    pub base: ECPoint<'a>,
    pub order: &'a [u8],
    pub cofactor: &'a [u8],
}

Elliptic curve parameters, conveyed verbosely as a prime field, as defined in RFC4492 section 5.4

Fields

prime_p: &'a [u8]

curve: ECCurve<'a>

base: ECPoint<'a>

order: &'a [u8]

cofactor: &'a [u8]

Trait Implementations

impl<'a> Debug for ExplicitPrimeContent<'a>

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

Formats the value using the given formatter.

impl<'a, 'nom> Parse<&'nom [u8]> for ExplicitPrimeContent<'a>

where 'nom: 'a,

fn parse_be(orig_i: &'nom [u8]) -> IResult<&'nom [u8], Self>

Parse input as Big-Endian

fn parse_le(orig_i: &'nom [u8]) -> IResult<&'nom [u8], Self>

Parse input as Little-Endian

fn parse(orig_i: &'nom [u8]) -> IResult<&'nom [u8], Self>

Parse input, not knowing the endianness

impl<'a> PartialEq for ExplicitPrimeContent<'a>

fn eq(&self, other: &ExplicitPrimeContent<'a>) -> 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<'a> StructuralPartialEq for ExplicitPrimeContent<'a>