Struct de_net::connection::databuf::DataBuf

pub(super) struct DataBuf {
    data: VecDeque<u8>,
    slots: VecDeque<Slot>,
    ordinals: AHashMap<PackageId, usize>,
}

Data buffer based on a ring-buffer.

The underling data structures are optimized with the assumption that data are inserted and removed in roughly FIFO manner.

Fields

data: VecDeque<u8>

slots: VecDeque<Slot>

ordinals: AHashMap<PackageId, usize>

Mapping from datagram ID to datagram ordinal. See Slot::ordinal.

Implementations

impl DataBuf

pub(super) fn new() -> Self

pub(super) fn push(&mut self, id: PackageId, data: &[u8])

Stores new data to the buffer.

Panics

Panics if data with the same id is already stored.

pub(super) fn get_and_remove( &mut self, id: PackageId, buf: &mut [u8] ) -> Option<usize>

See Self::get and Self::remove.

Panics

Panics if buf len is smaller than length of found data.

pub(super) fn get(&self, id: PackageId, buf: &mut [u8]) -> Option<usize>

Searches for data stored under ID id, and if found, writes the data to buf and returns length of the data.

Panics

Panics if buf len is smaller than length of found data.

pub(super) fn remove(&mut self, id: PackageId)

Removes data stored with ID id or does nothing if such data do not exist.

fn slot_index(&self, id: PackageId) -> Option<usize>

Get index (withing slots deque) of the slot with ID id.