Struct PQueue 

pub struct PQueue<T>
where
    T: Eq + Hash + Clone,
{ /* private fields */ }

Priority queue wrapper with internal synchronization using Arc and Mutex for thread safety.

You can clone this and pass it to multiple threads to share the same internal queue. Cloning will not copy the data, but instead, each cloned instance will point to the same internal queue.

Implementations

impl<T> PQueue<T>

where T: Eq + Hash + Clone,

pub fn new() -> Self

Creates a new empty priority queue with thread-safe Arc<Mutex<T>> wrapper.

pub fn update(&self, item: T, new_score: i64) -> (Option<i64>, i64)

Update the score of an item in the queue or adds it if it doesn’t yet exist.

Returns a tuple of the old score (None if the item didn’t yet exist) and the new score.

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

Peek at the highest scoring item in the queue.

Returns the item with the highest score, or None if the queue is empty.

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

Remove and return the highest scoring item from the queue.

Returns the item with the highest score, or None if the queue is empty.

pub fn score(&self, item: &T) -> Option<i64>

Get the current score of an item in the queue.

Returns the score of the item, or None if the item doesn’t exist in the queue.

pub fn stats(&self) -> PQueueStats

Get the statistics of the priority queue.

Returns the statistics of the priority queue.

Trait Implementations

impl<T> Clone for PQueue<T>

where T: Eq + Hash + Clone,

fn clone(&self) -> Self

Creates a shallow clone that shares the same internal queue. Multiple cloned instances will operate on the same underlying data.

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

Performs copy-assignment from source.

impl<T> Default for PQueue<T>

where T: Eq + Hash + Clone,

fn default() -> Self

Creates a new empty priority queue using default initialization.