Struct flex_algo::priority_queue::PriorityQueue

pub struct PriorityQueue<F, T>where
    F: Fn(&T, &T) -> bool,
    T: PartialOrd + Debug,{ /* private fields */ }

PriorityQueue

This data structure implements a Priority Queue with a comparator function to specify the Min/Max heap. The queue is implemented as a heap of indexes.

Implementations

impl<F, T> PriorityQueue<F, T>where
    F: Fn(&T, &T) -> bool,
    T: PartialOrd + Debug,

pub fn new(comparator: F) -> Self

Create a new PriorityQueue with a comparator function

Example

use flex_algo::priority_queue::PriorityQueue;
 
let mut pq = PriorityQueue::new(|a: &usize,b: &usize| a < b);
 

pub fn size(&self) -> usize

Return the size of the PriorityQueue

Example

use flex_algo::priority_queue::PriorityQueue;
 
let mut pq = PriorityQueue::new(|a: &usize,b: &usize| a < b);
assert_eq!(pq.size(), 0);

pub fn is_empty(&self) -> bool

Return true if the PriorityQueue is empty

Example

use flex_algo::priority_queue::PriorityQueue;
 
let mut pq = PriorityQueue::new(|a: &usize,b: &usize| a < b);
assert_eq!(pq.is_empty(), true);

pub fn push(&mut self, value: T) -> usize

Push element into Priority Queue and return the size of the PriorityQueue

Example

use flex_algo::priority_queue::PriorityQueue;
 
let mut pq = PriorityQueue::new(|a: &usize,b: &usize| a < b);
pq.push(14);
pq.push(10);
let len = pq.push(12);
 
assert_eq!(len, 3);

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

Return the first element of the heap, or None if it is empty.

Example

use flex_algo::priority_queue::PriorityQueue;
 
let mut pq = PriorityQueue::new(|a: &usize,b: &usize| a < b);
pq.push(14);
pq.push(10);
pq.push(12);
 
assert_eq!(pq.pop().unwrap(), 10);

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

Return the first element of the heap, or None if it is empty without change the heap.

Example

use flex_algo::priority_queue::PriorityQueue;
 
let mut pq = PriorityQueue::new(|a: &usize,b: &usize| a < b);
pq.push(14);
pq.push(10);
pq.push(12);
 
assert_eq!(pq.peek().unwrap(), &10);

Trait Implementations

impl<F, T> Debug for PriorityQueue<F, T>where
    F: Fn(&T, &T) -> bool + Debug,
    T: PartialOrd + Debug + Debug,

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

Formats the value using the given formatter.