Struct priority_queue::double_priority_queue::DoublePriorityQueue

pub struct DoublePriorityQueue<I, P, H = RandomState> { /* private fields */ }

A double priority queue with efficient change function to change the priority of an element.

The priority is of type P, that must implement std::cmp::Ord.

The item is of type I, that must implement Hash and Eq.

Implemented as a heap of indexes, stores the items inside an IndexMap to be able to retrieve them quickly.

With this data structure it is possible to efficiently extract both the maximum and minimum elements arbitrarily.

If your need is to always extract the minimum, use a PriorityQueue<I, Reverse<P>> wrapping your priorities in the standard wrapper Reverse<T>.

Example

use priority_queue::DoublePriorityQueue;

let mut pq = DoublePriorityQueue::new();

assert!(pq.is_empty());
pq.push("Apples", 5);
pq.push("Bananas", 8);
pq.push("Strawberries", 23);

assert_eq!(pq.peek_max(), Some((&"Strawberries", &23)));
assert_eq!(pq.peek_min(), Some((&"Apples", &5)));

pq.change_priority("Bananas", 25);
assert_eq!(pq.peek_max(), Some((&"Bananas", &25)));

for (item, _) in pq.into_sorted_iter() {
    println!("{}", item);
}

Implementations

impl<I, P> DoublePriorityQueue<I, P>

where P: Ord, I: Hash + Eq,

pub fn new() -> Self

Creates an empty DoublePriorityQueue

pub fn with_capacity(capacity: usize) -> Self

Creates an empty DoublePriorityQueue with the specified capacity.

impl<I, P, H> DoublePriorityQueue<I, P, H>

where P: Ord, I: Hash + Eq, H: BuildHasher + Default,

pub fn with_default_hasher() -> Self

Creates an empty DoublePriorityQueue with the default hasher

pub fn with_capacity_and_default_hasher(capacity: usize) -> Self

Creates an empty DoublePriorityQueue with the specified capacity and default hasher

impl<I, P, H> DoublePriorityQueue<I, P, H>

where P: Ord, I: Hash + Eq, H: BuildHasher,

pub fn with_hasher(hash_builder: H) -> Self

Creates an empty DoublePriorityQueue with the specified hasher

pub fn with_capacity_and_hasher(capacity: usize, hash_builder: H) -> Self

Creates an empty DoublePriorityQueue with the specified capacity and hasher

The internal collections will be able to hold at least capacity elements without reallocating. If capacity is 0, there will be no allocation.

impl<I, P, H> DoublePriorityQueue<I, P, H>

pub fn capacity(&self) -> usize

Returns the number of elements the internal map can hold without reallocating.

This number is a lower bound; the map might be able to hold more, but is guaranteed to be able to hold at least this many.

pub fn iter(&self) -> Iter<'_, I, P>

Returns an iterator in arbitrary order over the (item, priority) elements in the queue

pub fn drain(&mut self) -> Drain<'_, I, P>

Clears the PriorityQueue, returning an iterator over the removed elements in arbitrary order. If the iterator is dropped before being fully consumed, it drops the remaining elements in arbitrary order.

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the internal data structures that support this operation as much as possible.

pub fn len(&self) -> usize

Returns the number of elements in the priority queue.

pub fn is_empty(&self) -> bool

Returns true if the priority queue contains no elements.

pub fn peek_min(&self) -> Option<(&I, &P)>

Returns the couple (item, priority) with the lowest priority in the queue, or None if it is empty.

Computes in O(1) time

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted in the given DoublePriorityQueue. The collection may reserve more space to avoid frequent reallocations. After calling reserve, capacity will be greater than or equal to self.len() + additional. Does nothing if capacity is already sufficient.

Panics

Panics if the new capacity overflows usize.

pub fn reserve_exact(&mut self, additional: usize)

Reserve capacity for additional more elements, without over-allocating.

Unlike reserve, this does not deliberately over-allocate the entry capacity to avoid frequent re-allocations. However, the underlying data structures may still have internal capacity requirements, and the allocator itself may give more space than requested, so this cannot be relied upon to be precisely minimal.

Computes in O(n) time.

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Try to reserve capacity for at least additional more elements.

Computes in O(n) time.

pub fn try_reserve_exact( &mut self, additional: usize, ) -> Result<(), TryReserveError>

Try to reserve capacity for additional more elements, without over-allocating.

Unlike reserve, this does not deliberately over-allocate the entry capacity to avoid frequent re-allocations. However, the underlying data structures may still have internal capacity requirements, and the allocator itself may give more space than requested, so this cannot be relied upon to be precisely minimal.

Computes in O(n) time.

impl<I, P, H> DoublePriorityQueue<I, P, H>

where P: Ord,

pub fn iter_mut(&mut self) -> IterMut<'_, I, P, H>

Return an iterator in arbitrary order over the (item, priority) elements in the queue.

The item and the priority are mutable references, but it’s a logic error to modify the item in a way that change the result of Hash or Eq.

It’s not an error, instead, to modify the priorities, because the heap will be rebuilt once the IterMut goes out of scope. It would be rebuilt even if no priority value would have been modified, but the procedure will not move anything, but just compare the priorities.

pub fn peek_max(&self) -> Option<(&I, &P)>

Returns the couple (item, priority) with the greatest priority in the queue, or None if it is empty.

Computes in O(1) time

pub fn pop_min(&mut self) -> Option<(I, P)>

Removes the item with the lowest priority from the priority queue and returns the pair (item, priority), or None if the queue is empty.

pub fn pop_max(&mut self) -> Option<(I, P)>

Removes the item with the greatest priority from the priority queue and returns the pair (item, priority), or None if the queue is empty.

pub fn into_ascending_sorted_vec(self) -> Vec<I>

Implements a HeapSort.

Consumes the PriorityQueue and returns a vector with all the items sorted from the one associated to the lowest priority to the highest.

pub fn into_descending_sorted_vec(self) -> Vec<I>

Implements a HeapSort

Consumes the PriorityQueue and returns a vector with all the items sorted from the one associated to the highest priority to the lowest.

pub fn into_sorted_iter(self) -> IntoSortedIter<I, P, H>

Generates a new double ended iterator from self that will extract the elements from the one with the lowest priority to the highest one.

impl<I, P, H> DoublePriorityQueue<I, P, H>

where H: BuildHasher,

pub fn peek_min_mut(&mut self) -> Option<(&mut I, &P)>

Returns the couple (item, priority) with the lowest priority in the queue, or None if it is empty.

The item is a mutable reference, but it’s a logic error to modify it in a way that change the result of Hash or Eq.

The priority cannot be modified with a call to this function. To modify the priority use push, change_priority or change_priority_by.

Computes in O(1) time

impl<I, P, H> DoublePriorityQueue<I, P, H>

where P: Ord, H: BuildHasher,

pub fn peek_max_mut(&mut self) -> Option<(&mut I, &P)>

Returns the couple (item, priority) with the greatest priority in the queue, or None if it is empty.

The item is a mutable reference, but it’s a logic error to modify it in a way that change the result of Hash or Eq.

The priority cannot be modified with a call to this function. To modify the priority use push, change_priority or change_priority_by.

Computes in O(1) time

impl<I, P, H> DoublePriorityQueue<I, P, H>

where P: Ord, I: Hash + Eq, H: BuildHasher,

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

Insert the item-priority pair into the queue.

If an element equal to item was already into the queue, it is updated and the old value of its priority is returned in Some; otherwise, returns None.

Computes in O(log(N)) time.

pub fn push_increase(&mut self, item: I, priority: P) -> Option<P>

Increase the priority of an existing item in the queue, or insert it if not present.

If an element equal to item is already in the queue with a lower priority, its priority is increased to the new one without replacing the element and the old priority is returned. Otherwise, the new element is inserted into the queue.

Returns Some if an element equal to item is already in the queue. If its priority is higher then priority, the latter is returned back, otherwise, the old priority is contained in the Option. If the item is not in the queue, None is returned.

Computes in O(log(N)) time.

pub fn push_decrease(&mut self, item: I, priority: P) -> Option<P>

Decrease the priority of an existing item in the queue, or insert it if not present.

If an element equal to item is already in the queue with a higher priority, its priority is decreased to the new one without replacing the element and the old priority is returned. Otherwise, the new element is inserted into the queue.

Returns Some if an element equal to item is already in the queue. If its priority is lower then priority, the latter is returned back, otherwise, the old priority is contained in the Option. If the item is not in the queue, None is returned.

Computes in O(log(N)) time.

pub fn change_priority<Q>(&mut self, item: &Q, new_priority: P) -> Option<P>

where I: Borrow<Q>, Q: Eq + Hash + ?Sized,

Change the priority of an Item returning the old value of priority, or None if the item wasn’t in the queue.

The argument item is only used for lookup, and is not used to overwrite the item’s data in the priority queue.

The item is found in O(1) thanks to the hash table. The operation is performed in O(log(N)) time.

pub fn change_priority_by<Q, F>(&mut self, item: &Q, priority_setter: F) -> bool

where I: Borrow<Q>, Q: Eq + Hash + ?Sized, F: FnOnce(&mut P),

Change the priority of an Item using the provided function. Return a boolean value where true means the item was in the queue and update was successful

The argument item is only used for lookup, and is not used to overwrite the item’s data in the priority queue.

The item is found in O(1) thanks to the hash table. The operation is performed in O(log(N)) time (worst case).

pub fn get_priority<Q>(&self, item: &Q) -> Option<&P>

where I: Borrow<Q>, Q: Eq + Hash + ?Sized,

Get the priority of an item, or None, if the item is not in the queue

pub fn get<Q>(&self, item: &Q) -> Option<(&I, &P)>

where I: Borrow<Q>, Q: Eq + Hash + ?Sized,

Get the couple (item, priority) of an arbitrary element, as reference or None if the item is not in the queue.

pub fn get_mut<Q>(&mut self, item: &Q) -> Option<(&mut I, &P)>

where I: Borrow<Q>, Q: Eq + Hash + ?Sized,

Get the couple (item, priority) of an arbitrary element, or None if the item was not in the queue.

The item is a mutable reference, but it’s a logic error to modify it in a way that change the result of Hash or Eq.

The priority cannot be modified with a call to this function. To modify the priority use push, change_priority or change_priority_by.

pub fn remove<Q>(&mut self, item: &Q) -> Option<(I, P)>

where I: Borrow<Q>, Q: Eq + Hash + ?Sized,

Remove an arbitrary element from the priority queue. Returns the (item, priority) couple or None if the item is not found in the queue.

The operation is performed in O(log(N)) time (worst case).

pub fn into_vec(self) -> Vec<I>

Returns the items not ordered

pub fn clear(&mut self)

Drops all items from the priority queue

pub fn append(&mut self, other: &mut Self)

Move all items of the other queue to self ignoring the items Eq to elements already in self At the end, other will be empty.

Note that at the end, the priority of the duplicated elements inside self may be the one of the elements in other, if other is longer than self

Trait Implementations

impl<I: Clone, P: Clone, H: Clone> Clone for DoublePriorityQueue<I, P, H>

fn clone(&self) -> DoublePriorityQueue<I, P, H>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I, P, H> Debug for DoublePriorityQueue<I, P, H>

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

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

Formats the value using the given formatter.

impl<I, P, H> Default for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher + Default,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, I, P, H> Deserialize<'de> for DoublePriorityQueue<I, P, H>

where I: Hash + Eq + Deserialize<'de>, P: Ord + Deserialize<'de>, H: BuildHasher + Default,

Available on crate feature serde only.

fn deserialize<D>( deserializer: D, ) -> Result<DoublePriorityQueue<I, P, H>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<I, P, H> Extend<(I, P)> for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,

fn extend<T: IntoIterator<Item = (I, P)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<I, P, H> From<DoublePriorityQueue<I, P, H>> for PriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,

fn from(pq: DoublePriorityQueue<I, P, H>) -> Self

Converts to this type from the input type.

impl<I, P, H> From<PriorityQueue<I, P, H>> for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,

fn from(pq: PriorityQueue<I, P, H>) -> Self

Converts to this type from the input type.

impl<I, P, H> From<Vec<(I, P)>> for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher + Default,

fn from(vec: Vec<(I, P)>) -> Self

Converts to this type from the input type.

impl<I, P, H> FromIterator<(I, P)> for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher + Default,

fn from_iter<IT>(iter: IT) -> Self

where IT: IntoIterator<Item = (I, P)>,

Creates a value from an iterator.

impl<'a, I, P, H> IntoIterator for &'a DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,

type Item = (&'a I, &'a P)

The type of the elements being iterated over.

type IntoIter = Iter<'a, I, P>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, I, P>

Creates an iterator from a value.

impl<'a, I, P, H> IntoIterator for &'a mut DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,

type Item = (&'a mut I, &'a mut P)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, I, P, H>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IterMut<'a, I, P, H>

Creates an iterator from a value.

impl<I, P, H> IntoIterator for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,

type Item = (I, P)

The type of the elements being iterated over.

type IntoIter = IntoIter<I, P>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<I, P>

Creates an iterator from a value.

impl<I, P1, H1, P2, H2> PartialEq<DoublePriorityQueue<I, P2, H2>> for DoublePriorityQueue<I, P1, H1>

where I: Hash + Eq, P1: Ord + PartialEq<P2>, Option<P1>: PartialEq<Option<P2>>, P2: Ord, H1: BuildHasher, H2: BuildHasher,

fn eq(&self, other: &DoublePriorityQueue<I, P2, H2>) -> 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<I, P, H> Serialize for DoublePriorityQueue<I, P, H>

where I: Hash + Eq + Serialize, P: Ord + Serialize, H: BuildHasher,

Available on crate feature serde only.

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<I, P, H> Eq for DoublePriorityQueue<I, P, H>

where I: Hash + Eq, P: Ord, H: BuildHasher,