struct Table {
entries: VecDeque<Header>,
size: usize,
max_size: usize,
}
Fields§
§entries: VecDeque<Header>
§size: usize
§max_size: usize
Implementations§
source§impl Table
impl Table
fn new(max_size: usize) -> Table
fn size(&self) -> usize
sourcepub fn get(&self, index: usize) -> Result<Header, DecoderError>
pub fn get(&self, index: usize) -> Result<Header, DecoderError>
Returns the entry located at the given index.
The table is 1-indexed and constructed in such a way that the first entries belong to the static table, followed by entries in the dynamic table. They are merged into a single index address space, though.
This is according to the [HPACK spec, section 2.3.3.] (http://http2.github.io/http2-spec/compression.html#index.address.space)
fn insert(&mut self, entry: Header)
fn set_max_size(&mut self, size: usize)
fn reserve(&mut self, size: usize)
fn consolidate(&mut self)
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for Table
impl Send for Table
impl Sync for Table
impl Unpin for Table
impl UnwindSafe for Table
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more