Struct SocketSet 

pub struct SocketSet<const TIMER_HZ: u32, const N: usize, const L: usize> {
    pub sockets: Vec<Option<Socket<TIMER_HZ, L>>, N>,
}

An extensible set of sockets.

Fields

sockets: Vec<Option<Socket<TIMER_HZ, L>>, N>

Implementations

impl<const TIMER_HZ: u32, const N: usize, const L: usize> Set<TIMER_HZ, N, L>

pub fn new() -> Set<TIMER_HZ, N, L>

Create a socket set using the provided storage.

pub fn capacity(&self) -> usize

Get the maximum number of sockets the set can hold

pub fn len(&self) -> usize

Get the current number of initialized sockets, the set is holding

pub fn is_empty(&self) -> bool

Check if the set is currently holding no active sockets

pub fn socket_type(&self, handle: Handle) -> Option<SocketType>

Get the type of a specific socket in the set.

Returned as a SocketType

pub fn add<T>(&mut self, socket: T) -> Result<Handle, Error>

where T: Into<Socket<TIMER_HZ, L>>,

Add a socket to the set with the reference count 1, and return its handle.

pub fn get<T: AnySocket<TIMER_HZ, L>>( &mut self, handle: Handle, ) -> Result<SocketRef<'_, T>, Error>

Get a socket from the set by its handle, as mutable.

pub fn remove(&mut self, handle: Handle) -> Result<(), Error>

Remove a socket from the set

pub fn prune(&mut self)

Prune the sockets in this set.

All sockets are removed and dropped.

pub fn recycle(&mut self, ts: Instant<TIMER_HZ>) -> bool

pub fn iter(&self) -> impl Iterator<Item = (Handle, &Socket<TIMER_HZ, L>)>

Iterate every socket in this set.

pub fn iter_mut( &mut self, ) -> impl Iterator<Item = (Handle, SocketRef<'_, Socket<TIMER_HZ, L>>)>

Iterate every socket in this set, as SocketRef.

Trait Implementations

impl<const TIMER_HZ: u32, const N: usize, const L: usize> Debug for Set<TIMER_HZ, N, L>

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

Formats the value using the given formatter.

impl<const TIMER_HZ: u32, const N: usize, const L: usize> Default for Set<TIMER_HZ, N, L>

fn default() -> Set<TIMER_HZ, N, L>

Returns the “default value” for a type.