Struct canadensis_core::session::SessionLinearMap

pub struct SessionLinearMap<I, N, T, D, const C: usize>where
    I: Instant,{ /* private fields */ }

A fixed-capacity session map that uses linear search to find sessions

This implementation offers configurable memory use. Its time complexity is O(C).

Type parameters:

• I: A time instant
• N: A node ID
• T: A transfer ID
• D: Additional transport-specific session data
• C (usize): Maximum number of sessions to store simultaneously

Trait Implementations

impl<I, N, T, D, const C: usize> SessionTracker<I, N, T, D> for SessionLinearMap<I, N, T, D, C>where I: Instant, N: Eq + Clone,

fn get(&self, node: N) -> Option<&Session<I, T, D>>

Returns a reference to the session for the provided node, if one exists

fn get_mut(&mut self, node: N) -> Option<&mut Session<I, T, D>>

Returns a mutable reference to the session for the provided node, if one exists

fn get_mut_or_insert_with<F>( &mut self, node: N, generator: F ) -> Result<&mut Session<I, T, D>, OutOfMemoryError>where N: Clone, F: FnOnce() -> Session<I, T, D>,

Returns a mutable reference to the session for the provided node

fn insert( &mut self, node: N, session: Session<I, T, D> ) -> Result<(), OutOfMemoryError>

Inserts a session

fn remove(&mut self, node: N)

Removes a session for the provided node if one exists

fn remove_expired(&mut self, now: I)

Removes all sessions that have expired