Struct PriorityQ 

pub struct PriorityQ { /* private fields */ }

The combined priority queue (sort-array + heap).

Implementations

impl PriorityQ

pub fn new(size: usize, leq: fn(u32, u32) -> bool) -> Self

pub fn init(&mut self) -> bool

Initialize the sort-array phase. Must be called before extract_min/minimum/delete (but after all pre-init inserts).

pub fn insert(&mut self, key: u32) -> i32

Insert a key. Returns a handle. Negative handles are for the sort-array; non-negative for the heap.

pub fn extract_min(&mut self) -> u32

Extract the minimum key.

pub fn minimum(&self) -> u32

Peek at the minimum key without extracting.

pub fn is_empty(&self) -> bool

Returns true if the queue is empty.

pub fn delete(&mut self, handle: i32)

Delete the key with the given handle.