Struct PriorityQueue 

pub struct PriorityQueue<T> { /* private fields */ }

Priority Queue

Description

A priority queue is a data structure that stores elements in a specific order.

A Rust port of the tinyqueue code.

Usage

use gistools::data_structures::PriorityQueue;

let mut queue = PriorityQueue::new(|a: &i32, b: &i32| a.cmp(b));

queue.push(3);
queue.push(1);
queue.push(2);

assert_eq!(queue.peek(), Some(&1));
assert_eq!(queue.pop(), Some(1));
assert_eq!(queue.len(), 2);

Links

• https://github.com/mourner/tinyqueue

Implementations

impl<T> PriorityQueue<T>

where T: Clone,

pub fn new(compare: PriorityCompare<T>) -> Self

Creates a new priority queue with an optional comparison function.

pub fn len(&self) -> usize

Returns the number of elements in the queue.

pub fn is_empty(&self) -> bool

Returns true if the queue is empty.

pub fn push(&mut self, item: T)

Pushes an item into the queue.

pub fn pop(&mut self) -> Option<T>

Removes and returns the highest-priority item.

pub fn peek(&self) -> Option<&T>

Peeks at the highest-priority item without removing it.

Trait Implementations

impl<T: Debug> Debug for PriorityQueue<T>

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

Formats the value using the given formatter.