Struct DynamicTable 

pub struct DynamicTable { /* private fields */ }

The decoder’s view of the table the peer is building.

Implementations

impl DynamicTable

pub fn new(capacity: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn size(&self) -> usize

pub fn capacity(&self) -> usize

pub fn set_capacity(&mut self, capacity: usize)

Apply a dynamic table size update from the peer.

Shrinking evicts immediately; the peer has already done the same, so the two tables stay in step.

pub fn get(&self, index: usize) -> Option<(&str, &str)>

Look up a 1-based HPACK index, which for the dynamic table starts at 62.

pub fn insert(&mut self, name: &str, value: &str)

Insert an indexed header, evicting only as required by the peer’s byte capacity. A capacity above our fixed storage is supported only while its entries fit. Exceeding storage invalidates dynamic lookups until an explicit table clear; silently evicting would shift the peer’s indices.