[−][src]Struct algorithms_edu::data_structures::priority_queue::binary_heap::BinaryHeap
Implementations
impl<T: PartialOrd> BinaryHeap<T>[src]
Trait Implementations
impl<T: PartialOrd> PriorityQueue<T> for BinaryHeap<T>[src]
pub fn with_capacity(sz: usize) -> Self[src]
pub fn insert(&mut self, el: T)[src]
Adds an element to the priority queue, O(log(n))
pub fn contains(&self, el: &T) -> bool[src]
Test if an element is in heap, O(n)
pub fn remove(&mut self, el: &T)[src]
Removes a particular element in the heap, O(n)
pub fn poll(&mut self) -> Option<T>[src]
Removes the root of the heap, O(log(n))
Auto Trait Implementations
impl<T> RefUnwindSafe for BinaryHeap<T> where
T: RefUnwindSafe, [src]
T: RefUnwindSafe,
impl<T> Send for BinaryHeap<T> where
T: Send, [src]
T: Send,
impl<T> Sync for BinaryHeap<T> where
T: Sync, [src]
T: Sync,
impl<T> Unpin for BinaryHeap<T> where
T: Unpin, [src]
T: Unpin,
impl<T> UnwindSafe for BinaryHeap<T> where
T: UnwindSafe, [src]
T: 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,
pub 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.
pub 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>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,