Struct QMap

pub struct QMap<K: Eq + Hash + Clone, O: Ord + Copy> { /* private fields */ }

Implementations

impl<K: Eq + Hash + Clone, O: Ord + Copy> QMap<K, O>

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn upsert(&mut self, key: K, order_by: O)

Inserts key at order_by position in the queue. key gets overwritten and given new queue position if exists.

pub fn delete(&mut self, key: &K)

Deletes key and its position in the queue.

pub fn position(&self, key: &K) -> Option<&O>

Tells the position of key in the queue. Returns None if key is not in store.

pub fn front(&self) -> Option<(&O, &K)>

pub fn back(&self) -> Option<(&O, &K)>

pub fn pop_front(&mut self) -> Option<(O, K)>

pub fn pop_back(&mut self) -> Option<(O, K)>

pub fn pop_front_until(&mut self, until: &O) -> Vec<(O, K)>

Pops elements from the front of the queue whose position is less than (inclusive) until. Less than means further front.

pub fn pop_back_until(&mut self, until: &O) -> Vec<(O, K)>

Pops elements from the back of the queue whose position is greater than (inclusive) until. Greater than means further back.

pub fn push_front( &mut self, key: K, order_by: O, ) -> Result<(), InvalidOrder<(O, K)>>

pub fn push_back( &mut self, key: K, order_by: O, ) -> Result<(), InvalidOrder<(O, K)>>