Struct PrioritySet

pub struct PrioritySet<I: Ord + Hash + Clone, P: Ord + Copy> { /* private fields */ }

A set that offers efficient iteration over its elements in priority-ascending order.

Implementations

impl<I: Ord + Hash + Clone, P: Ord + Copy> PrioritySet<I, P>

pub fn new() -> Self

Create a new PrioritySet.

pub fn put(&mut self, item: I, priority: P)

Insert an item with a priority, overwriting the previous priority if it exists.

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

Get the current priority of an item.

pub fn remove(&mut self, item: &I) -> bool

Remove an item from the set.

Returns true if the item was present.

pub fn reconcile(&mut self, keep: &[I], default: P)

Remove all previously inserted items not included in keep and add any items not yet seen with a priority of initial.

pub fn contains(&self, item: &I) -> bool

Returns true if the set contains the item.

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

Returns the item with the highest priority.

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

Removes and returns the item with the highest priority.

pub fn iter(&self) -> impl Iterator<Item = (&I, &P)>

Returns an iterator over all items in the set in priority-ascending order.

pub fn len(&self) -> usize

Returns the number of items in the set.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.