Struct PriorityQueue 

pub struct PriorityQueue<T, C>
where
    C: Fn(&T, &T) -> Ordering,
{ /* private fields */ }

Implementations

impl<T, C> PriorityQueue<T, C>

where C: Fn(&T, &T) -> Ordering,

pub fn new(compare: C) -> Self

Trait Implementations

impl<T, C> Collection for PriorityQueue<T, C>

where C: Fn(&T, &T) -> Ordering,

type Item = T

type Iter<'a> = Iter<'a, T> where Self: 'a

fn iter(&self) -> Self::Iter<'_>

fn size(&self) -> usize

fn clear(&mut self)

fn retain<F>(&mut self, f: F) -> usize

where F: FnMut(&Self::Item) -> bool,

fn count<F>(&self, filter: F) -> usize

where F: FnMut(&Self::Item) -> bool,

fn collect_into<C>(&self, out: &mut C)

where C: Extend<Self::Item>, Self::Item: Clone,

fn collect(&self) -> Vec<Self::Item>

where Self::Item: Clone,

fn is_empty(&self) -> bool

impl<T, C> Disposable for PriorityQueue<T, C>

where C: Fn(&T, &T) -> Ordering,

fn dispose(&mut self)

fn is_disposed(&self) -> bool

impl<'a, T, C> IntoIterator for &'a PriorityQueue<T, C>

where C: Fn(&T, &T) -> Ordering,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, C> PriorityQueueLike<T> for PriorityQueue<T, C>

where C: Fn(&T, &T) -> Ordering,

fn compare(&self, a: &T, b: &T) -> Ordering

impl<T, C> QueueLike<T> for PriorityQueue<T, C>

where C: Fn(&T, &T) -> Ordering,

fn front(&self) -> Option<&T>

fn enqueue(&mut self, element: T)

fn dequeue(&mut self) -> Option<T>

fn enqueues<I>(&mut self, elements: I)

where I: IntoIterator<Item = T>,

fn replace_front(&mut self, new_back: T) -> Option<T>