Struct List

pub struct List<T> { /* private fields */ }

A collection designed for the specific requirements of storing Calls with an associated index.

The requirements found in HFP v1.8, Section 4.34.2, “+CLCC”:

• Each call is assigned a number starting at 1.
• Calls hold their number until they are released.
• New calls take the lowest available number.

Note: “Insert” is a O(n) operation in order to simplify the implementation. This data structure is best suited towards small n for this reason.

Implementations

impl<T> List<T>

pub fn insert(&mut self, value: T) -> Idx

Insert a new value into the list, returning an index that is guaranteed to be unique until the value is removed from the list.

pub fn get(&self, index: Idx) -> Option<&T>

Retrieve a value by index. Returns None if the index does not point to a value.

pub fn get_mut(&mut self, index: Idx) -> Option<&mut T>

Retrieve a mutable reference to a value by index. Returns None if the index does not point to a value.

pub fn remove(&mut self, index: Idx) -> Option<T>

Remove a value by index. Returns None if the value did not point to a value.

pub fn calls(&self) -> impl Iterator<Item = (Idx, &T)> + Clone

Return an iterator of the calls and associated call indices.

Trait Implementations

impl<T> Default for List<T>

fn default() -> Self

Returns the “default value” for a type.