[−][src]Struct rs_graph::shortestpath::binheap::BinHeap
Simply binary heap data structure.
Trait Implementations
impl<K, ID> Heap for BinHeap<K, ID> where
K: Copy + PartialOrd,
ID: PrimInt, [src]
K: Copy + PartialOrd,
ID: PrimInt,
type Item = ID
Type of items on the heap.
type Key = K
Type of keys.
fn new() -> Self[src]
fn clear(&mut self)[src]
fn is_empty(&self) -> bool[src]
fn insert(&mut self, key: K) -> ID[src]
fn decrease(&mut self, item: ID)[src]
fn pop_min(&mut self) -> Option<Self::Key>[src]
fn key(&mut self, item: ID) -> &mut K[src]
Auto Trait Implementations
impl<K, ID> RefUnwindSafe for BinHeap<K, ID> where
ID: RefUnwindSafe,
K: RefUnwindSafe,
ID: RefUnwindSafe,
K: RefUnwindSafe,
impl<K, ID> Send for BinHeap<K, ID> where
ID: Send,
K: Send,
ID: Send,
K: Send,
impl<K, ID> Sync for BinHeap<K, ID> where
ID: Sync,
K: Sync,
ID: Sync,
K: Sync,
impl<K, ID> Unpin for BinHeap<K, ID> where
ID: Unpin,
K: Unpin,
ID: Unpin,
K: Unpin,
impl<K, ID> UnwindSafe for BinHeap<K, ID> where
ID: UnwindSafe,
K: UnwindSafe,
ID: UnwindSafe,
K: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,