Struct TimerList 

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

A queue for managing multiple TimerEntry.

Implementations

impl<T> TimerList<T>

pub fn len(&self) -> usize

Returns the number of elements in the deque.

pub fn entry_len(&self) -> usize

Returns the number of entries in the deque.

pub fn insert(&mut self, timestamp: u64, t: T)

Inserts an element at timestamp within the deque, shifting all elements with indices greater than or equal to timestamp towards the back.

pub fn front(&self) -> Option<(&u64, &TimerEntry<T>)>

Provides a reference to the front element, or None if the deque is empty.

pub fn pop_front(&mut self) -> Option<(u64, TimerEntry<T>)>

Removes the first element and returns it, or None if the deque is empty.

pub fn is_empty(&self) -> bool

Returns true if the deque is empty.

pub fn remove_entry(&mut self, timestamp: &u64) -> Option<TimerEntry<T>>

Removes and returns the element at timestamp from the deque. Whichever end is closer to the removal point will be moved to make room, and all the affected elements will be moved to new positions. Returns None if timestamp is out of bounds.

pub fn remove(&mut self, timestamp: &u64, t: &T) -> Option<T>

where T: Ord,

Removes and returns the t from the deque. Whichever end is closer to the removal point will be moved to make room, and all the affected elements will be moved to new positions. Returns None if t not found.

pub fn iter(&self) -> Iter<'_, u64, TimerEntry<T>>

Returns a front-to-back iterator.

Trait Implementations

impl<T: Debug> Debug for TimerList<T>

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

Formats the value using the given formatter.

impl<T> Default for TimerList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'t, T> IntoIterator for &'t TimerList<T>

type Item = (&'t u64, &'t TimerEntry<T>)

The type of the elements being iterated over.

type IntoIter = Iter<'t, u64, TimerEntry<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for TimerList<T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for TimerList<T>