pub struct DaryHeap<N, K, const D: usize>where
    N: Clone,
    K: PartialOrd + Clone,{ /* private fields */ }

Implementations§

source§

impl<N, K, const D: usize> DaryHeap<N, K, D>where N: Clone, K: PartialOrd + Clone,

source

pub fn with_capacity(capacity: usize) -> Self

Trait Implementations§

source§

impl<N, K, const D: usize> Default for DaryHeap<N, K, D>where N: Clone, K: PartialOrd + Clone,

source§

fn default() -> Self

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

impl<N, K, const D: usize> PriorityQueue<N, K> for DaryHeap<N, K, D>where N: Clone, K: PartialOrd + Clone,

source§

fn len(&self) -> usize

Number of elements in the queue.
source§

fn peek(&self) -> Option<&(N, K)>

Returns, without popping, a reference to the foremost element of the queue; returns None if the queue is empty.
source§

fn clear(&mut self)

Clears the queue.
source§

fn pop(&mut self) -> Option<(N, K)>

Removes and returns the (node, key) pair with the lowest key in the queue; returns None if the queue is empty.
source§

fn pop_node(&mut self) -> Option<N>

Removes and returns the node with the lowest key in the queue; returns None if the queue is empty.
source§

fn pop_key(&mut self) -> Option<K>

Removes and returns the key of the node with the lowest key in the queue; returns None if the queue is empty.
source§

fn push(&mut self, node: N, key: K)

Pushes the given ([node], [key]) pair to the queue.
source§

fn is_empty(&self) -> bool

Returns whether he queue is empty or not.

Auto Trait Implementations§

§

impl<N, K, const D: usize> RefUnwindSafe for DaryHeap<N, K, D>where K: RefUnwindSafe, N: RefUnwindSafe,

§

impl<N, K, const D: usize> Send for DaryHeap<N, K, D>where K: Send, N: Send,

§

impl<N, K, const D: usize> Sync for DaryHeap<N, K, D>where K: Sync, N: Sync,

§

impl<N, K, const D: usize> Unpin for DaryHeap<N, K, D>where K: Unpin, N: Unpin,

§

impl<N, K, const D: usize> UnwindSafe for DaryHeap<N, K, D>where K: UnwindSafe, N: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere 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 Twhere 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, U> TryFrom<U> for Twhere U: Into<T>,

§

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 Twhere U: TryFrom<T>,

§

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.