Skip to main content

StreamAckRanges

Struct StreamAckRanges 

Source
pub struct StreamAckRanges {
    pub stream_id: u64,
    pub ack_seq: u64,
    pub ranges: Vec<(u64, u64)>,
}
Expand description

Receiver → sender positive SACK-range ACK (STREAM_ACK_BATCHING R-1).

Semantics, precisely: ack_seq cumulatively acknowledges every sequence < ack_seq (identical to StreamWindow::ack_seq — the receiver’s next_expected). ranges selectively acknowledge received runs strictly above ack_seq as half-open [start, end) intervals. ack_seq itself is by definition the missing head — it is never inside a range, and the cumulative run is never duplicated as a range. Example: ack_seq = 101, ranges = [(102, 10001)] ⇒ everything below 101 received, 101 missing, 102..=10000 received.

Wire order is DESCENDING by end (newest first): when the receiver truncates to MAX_ACK_RANGES it drops the oldest ranges — the ones the next cumulative advance covers first. Ranges are fully merged: non-overlapping and non-adjacent.

The sender feeds this to ReliableStream::on_ack_ranges, which removes SACKed packets from the retransmit window so one lost head packet no longer RTO-floods everything behind it.

Fields§

§stream_id: u64

Stream the ack applies to.

§ack_seq: u64

Cumulative ack — every sequence < ack_seq is received.

§ranges: Vec<(u64, u64)>

Received runs strictly above ack_seq: half-open [start, end), descending by end, merged, 1..=MAX_ACK_RANGES entries.

Implementations§

Source§

impl StreamAckRanges

Source

pub const MIN_SIZE: usize

Minimum wire size: header + one range. A rangeless message is meaningless (the grant’s ack_seq already covers the contiguous case) and is rejected by Self::decode.

Source

pub const MAX_SIZE: usize

Maximum wire size (header + MAX_ACK_RANGES ranges).

Source

pub fn encode(&self) -> Vec<u8>

Encode to 16 + 16·n bytes.

Source

pub fn decode(data: &[u8]) -> Result<Self, StreamWindowCodecError>

Decode with strict validation. Rejects: truncated / non-16·n bodies, zero or more than MAX_ACK_RANGES ranges, empty or inverted ranges, ranges not strictly above ack_seq, and any ordering that is not strictly-descending / merged (overlap or adjacency means the producer failed to merge — treat as malformed rather than guessing).

Trait Implementations§

Source§

impl Clone for StreamAckRanges

Source§

fn clone(&self) -> StreamAckRanges

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for StreamAckRanges

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Eq for StreamAckRanges

Source§

impl PartialEq for StreamAckRanges

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for StreamAckRanges

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more