Struct Ack 

pub struct Ack {
    pub largest: u64,
    pub delay: u64,
    pub ecn: Option<EcnCounts>,
    /* private fields */
}

Available on crate feature quic only.

Fields

largest: u64

delay: u64

ecn: Option<EcnCounts>

Implementations

impl Ack

pub fn from_ranges( delay: u64, ranges: &ArrayRangeSet, ecn: Option<EcnCounts>, ) -> Option<Ack>

Build an ACK from a range set, laid out as it will be iterated and encoded, or None when the set is empty (there is nothing to acknowledge). This is the only way to construct an Ack outside decoding, so a hand-built one can never carry inconsistent range bytes.

pub fn encode<W>( delay: u64, ranges: &ArrayRangeSet, ecn: Option<&EcnCounts>, buf: &mut W, )

where W: BufMut,

pub fn iter(&self) -> AckIter<'_>

Trait Implementations

impl Clone for Ack

fn clone(&self) -> Ack

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ack

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

Formats the value using the given formatter.

impl Eq for Ack

impl<'a> IntoIterator for &'a Ack

type Item = RangeInclusive<u64>

The type of the elements being iterated over.

type IntoIter = AckIter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> AckIter<'a>

Creates an iterator from a value.

impl PartialEq for Ack

fn eq(&self, other: &Ack) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Ack