Struct KeyedReversePriorityQueue 

pub struct KeyedReversePriorityQueue<K: Hash + Eq + Ord, P: Ord> {
    items: KeyedPriorityQueue<K, ReverseOrdered<P>>,
}

Fields

items: KeyedPriorityQueue<K, ReverseOrdered<P>>

Implementations

impl<K, P> KeyedReversePriorityQueue<K, P>

where K: Hash + Eq + Ord, P: Ord,

pub fn new() -> KeyedReversePriorityQueue<K, P>

pub fn peek(&self) -> Option<(&K, &P)>

pub fn pop(&mut self) -> Option<(K, P)>

pub fn push(&mut self, key: K, priority: P) -> Option<P>

pub fn set_priority( &mut self, key: &K, priority: P, ) -> Result<P, KeyedReversePriorityQueueUnknownKeyError>

Update the priority of a item (identified by key) in the priority queue.

Errors

Err(KeyedReversePriorityQueue) is returned when the indicated key is not present.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<K, P> Debug for KeyedReversePriorityQueue<K, P>

where K: Hash + Eq + Ord + Debug, P: Ord + Debug,

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

Formats the value using the given formatter.

impl<K, P> Default for KeyedReversePriorityQueue<K, P>

where K: Hash + Eq + Ord, P: Ord,

fn default() -> Self

Returns the “default value” for a type.