BinHeap

rs_graph::collections

Struct BinHeap 

Source 
pub struct BinHeap<K, V, ID = u32> { /* private fields */ }
Expand description

Simply binary heap data structure.

Implementations§

Source§

impl<K, V, ID> BinHeap<K, V, ID>

Source

pub fn new() -> Self

Trait Implementations§

Source§

impl<K, V, ID> Default for BinHeap<K, V, ID>

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<K, V, ID> ItemPriQueue<K, V> for BinHeap<K, V, ID>
where K: Clone, V: PartialOrd + Clone, ID: FromPrimitive + ToPrimitive + Copy + Eq,

Source§

type Item = ID

Handle for an item in the queue.
Source§

fn clear(&mut self)

Remove all elements from the queue.
Source§

fn is_empty(&self) -> bool

Return true iff the queue contains no element.
Source§

fn value(&self, item: &ID) -> &V

Return the current value associated with some item in the queue.
Source§

fn push(&mut self, key: K, value: V) -> ID

Push the element with given key and value onto the queue. Read more
Source§

fn decrease_key(&mut self, item: &mut ID, value: V) -> bool

Decrease the value of some item in the queue. Read more
Source§

fn pop_min(&mut self) -> Option<(K, V)>

Remove and return the element with the smallest value from the queue or None if the queue is empty.

Auto Trait Implementations§

§

impl<K, V, ID> Freeze for BinHeap<K, V, ID>
where ID: Freeze,

§

impl<K, V, ID> RefUnwindSafe for BinHeap<K, V, ID>
where ID: RefUnwindSafe, K: RefUnwindSafe, V: RefUnwindSafe,

§

impl<K, V, ID> Send for BinHeap<K, V, ID>
where ID: Send, K: Send, V: Send,

§

impl<K, V, ID> Sync for BinHeap<K, V, ID>
where ID: Sync, K: Sync, V: Sync,

§

impl<K, V, ID> Unpin for BinHeap<K, V, ID>
where ID: Unpin, K: Unpin, V: Unpin,

§

impl<K, V, ID> UnwindSafe for BinHeap<K, V, ID>
where ID: UnwindSafe, K: UnwindSafe, V: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.