pub struct PriorityQueue<K: Ord, T>(/* private fields */);
Expand description
A utility type implementing a queue which can be used to automatically sort data by its time in ascending order.
Note that the performance of this queue is very relevant to overall algorithm performance of many graph-walking algorithms, and as it stands our implementation is about 6% slower in practice, probably also depending on the size of the stored data.
Implementations§
source§impl<K: Ord, T> PriorityQueue<K, T>
impl<K: Ord, T> PriorityQueue<K, T>
sourcepub fn insert(&mut self, key: K, value: T)
pub fn insert(&mut self, key: K, value: T)
Insert value
so that it is ordered according to key
.
sourcepub fn pop(&mut self) -> Option<(K, T)>
pub fn pop(&mut self) -> Option<(K, T)>
Pop the highest-priority item key and value off the queue.
sourcepub fn iter_unordered(&self) -> impl Iterator<Item = &T>
pub fn iter_unordered(&self) -> impl Iterator<Item = &T>
Iterate all items ordered from highest to lowest priority.
sourcepub fn into_iter_unordered(self) -> impl Iterator<Item = (K, T)>
pub fn into_iter_unordered(self) -> impl Iterator<Item = (K, T)>
Turn this instance into an iterator over its keys and values in arbitrary order.
Trait Implementations§
source§impl<K, T> Clone for PriorityQueue<K, T>
impl<K, T> Clone for PriorityQueue<K, T>
source§impl<K: Default + Ord, T: Default> Default for PriorityQueue<K, T>
impl<K: Default + Ord, T: Default> Default for PriorityQueue<K, T>
source§fn default() -> PriorityQueue<K, T>
fn default() -> PriorityQueue<K, T>
Returns the “default value” for a type. Read more
source§impl<K: Ord, T> FromIterator<(K, T)> for PriorityQueue<K, T>
impl<K: Ord, T> FromIterator<(K, T)> for PriorityQueue<K, T>
Auto Trait Implementations§
impl<K, T> Freeze for PriorityQueue<K, T>
impl<K, T> RefUnwindSafe for PriorityQueue<K, T>where
K: RefUnwindSafe,
T: RefUnwindSafe,
impl<K, T> Send for PriorityQueue<K, T>
impl<K, T> Sync for PriorityQueue<K, T>
impl<K, T> Unpin for PriorityQueue<K, T>
impl<K, T> UnwindSafe for PriorityQueue<K, T>where
K: UnwindSafe,
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)