Struct HeapTransportedLinkTable 

pub struct HeapTransportedLinkTable { /* private fields */ }

Grows with demand; how many links a relay carries is the network’s business, not a storage constant. The side index is an open-addressing table keyed by the link id’s leading bytes (already uniform, so a Lemire multiply-shift), probed linearly, deleted by backward-shift so a churning table never silts up.

Trait Implementations

impl Debug for HeapTransportedLinkTable

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

Formats the value using the given formatter.

impl Default for HeapTransportedLinkTable

fn default() -> HeapTransportedLinkTable

Returns the “default value” for a type.

impl TransportedLinkTable for HeapTransportedLinkTable

fn capacity(&self) -> usize

fn len(&self) -> usize

fn entries(&self) -> &[TransportedLink]

fn entries_mut(&mut self) -> &mut [TransportedLink]

fn index_of(&self, link_id: &LinkId) -> Option<usize>

fn deadline_updated(&mut self, _index: usize)

fn earliest_indexed_deadline(&mut self) -> Option<InstantMillis>

fn first_overdue(&mut self, now: InstantMillis) -> Option<usize>

fn push(&mut self, entry: TransportedLink) -> Result<(), TablePushError>

fn swap_remove(&mut self, index: usize)

fn is_empty(&self) -> bool