Struct ring::aead::quic::Algorithm

pub struct Algorithm {
    init: fn(key: &[u8], cpu_features: Features) -> Result<KeyInner, Unspecified>,
    new_mask: fn(key: &KeyInner, sample: Sample) -> [u8; 5],
    key_len: usize,
    id: AlgorithmID,
}

A QUIC Header Protection Algorithm.

Fields

init: fn(key: &[u8], cpu_features: Features) -> Result<KeyInner, Unspecified>

new_mask: fn(key: &KeyInner, sample: Sample) -> [u8; 5]

key_len: usize

id: AlgorithmID

Implementations

impl Algorithm

pub fn key_len(&self) -> usize

The length of the key.

pub fn sample_len(&self) -> usize

The required sample length.

Trait Implementations

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl KeyType for &'static Algorithm

fn len(&self) -> usize

The length that Prk::expand() should expand its input to.

impl PartialEq for Algorithm

fn eq(&self, other: &Self) -> 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 Eq for Algorithm