Struct orx_priority_queue::DaryHeapWithMap

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

Implementations

impl<N, K, const D: usize> DaryHeapWithMap<N, K, D>where N: Eq + Hash + Clone, K: PartialOrd + Clone,

pub fn with_capacity(capacity: usize) -> Self

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.

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

fn len(&self) -> usize

Number of elements in the queue.

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.

fn clear(&mut self)

Clears the queue.

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.

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.

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.

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

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

fn is_empty(&self) -> bool

Returns whether he queue is empty or not.

impl<N, K, const D: usize> PriorityQueueDecKey<N, K> for DaryHeapWithMap<N, K, D>where N: Eq + Hash + Clone, K: PartialOrd + Clone,

fn contains(&self, node: &N) -> bool

Returns whether the given [node] is in the queue or not.

fn key_of(&self, node: &N) -> Option<K>

Returns the key of the given [node] if it is in the queue; returns None otherwise.

fn decrease_key(&mut self, node: &N, decreased_key: &K)

Decreases key of the [node] which is already in the queue to the given [decreased_key]. This method is commonly use to increase priority of a node; rather than to re-insert it to keep the size of the queue smaller.

fn update_key(&mut self, node: &N, new_key: &K) -> bool

Updates key of the [node] which is already in the queue as the given [new_key]; and returns whether the node’s key is strictly decreased or not.

fn remove(&mut self, node: &N) -> K

Removes the [node] from the queue; and returns its current key.

fn try_decrease_key(&mut self, node: &N, new_key: &K) -> bool

This method:

fn decrease_key_or_push(&mut self, node: &N, key: &K) -> bool

This method

fn update_key_or_push(&mut self, node: &N, key: &K) -> bool

This method

fn try_decrease_key_or_push(&mut self, node: &N, key: &K) -> bool

This method