Struct orx_priority_queue::DaryHeapWithMap
source · pub struct DaryHeapWithMap<N, K, const D: usize>where
N: Eq + Hash + Clone,
K: PartialOrd + Clone,{ /* private fields */ }
Implementations§
source§impl<N, K, const D: usize> DaryHeapWithMap<N, K, D>where
N: Eq + Hash + Clone,
K: PartialOrd + Clone,
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§
source§impl<N, K, const D: usize> Clone for DaryHeapWithMap<N, K, D>where
N: Eq + Hash + Clone + Clone,
K: PartialOrd + Clone + Clone,
impl<N, K, const D: usize> Clone for DaryHeapWithMap<N, K, D>where N: Eq + Hash + Clone + Clone, K: PartialOrd + Clone + Clone,
source§fn clone(&self) -> DaryHeapWithMap<N, K, D>
fn clone(&self) -> DaryHeapWithMap<N, K, D>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<N, K, const D: usize> Default for DaryHeapWithMap<N, K, D>where
N: Eq + Hash + Clone,
K: PartialOrd + Clone,
impl<N, K, const D: usize> Default for DaryHeapWithMap<N, K, D>where N: Eq + Hash + Clone, K: PartialOrd + Clone,
source§impl<N, K, const D: usize> PriorityQueue<N, K> for DaryHeapWithMap<N, K, D>where
N: Eq + Hash + Clone,
K: PartialOrd + Clone,
impl<N, K, const D: usize> PriorityQueue<N, K> for DaryHeapWithMap<N, K, D>where N: Eq + Hash + Clone, K: PartialOrd + Clone,
source§fn as_slice(&self) -> &[(N, K)]
fn as_slice(&self) -> &[(N, K)]
Returns the nodes and keys currently in the queue as a slice;
not necessarily sorted.
source§fn peek(&self) -> Option<&(N, K)>
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 pop(&mut self) -> Option<(N, K)>
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>
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>
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_then_pop(&mut self, node: N, key: K) -> (N, K)
fn push_then_pop(&mut self, node: N, key: K) -> (N, K)
source§impl<N, K, const D: usize> PriorityQueueDecKey<N, K> for DaryHeapWithMap<N, K, D>where
N: Eq + Hash + Clone,
K: PartialOrd + Clone,
impl<N, K, const D: usize> PriorityQueueDecKey<N, K> for DaryHeapWithMap<N, K, D>where N: Eq + Hash + Clone, K: PartialOrd + Clone,
source§fn key_of(&self, node: &N) -> Option<K>
fn key_of(&self, node: &N) -> Option<K>
Returns the key of the given
node
if it is in the queue;
returns None otherwise.source§fn decrease_key(&mut self, node: &N, decreased_key: &K)
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. Read moresource§fn update_key(&mut self, node: &N, new_key: &K) -> bool
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. Read moreAuto Trait Implementations§
impl<N, K, const D: usize> RefUnwindSafe for DaryHeapWithMap<N, K, D>where K: RefUnwindSafe, N: RefUnwindSafe,
impl<N, K, const D: usize> Send for DaryHeapWithMap<N, K, D>where K: Send, N: Send,
impl<N, K, const D: usize> Sync for DaryHeapWithMap<N, K, D>where K: Sync, N: Sync,
impl<N, K, const D: usize> Unpin for DaryHeapWithMap<N, K, D>where K: Unpin, N: Unpin,
impl<N, K, const D: usize> UnwindSafe for DaryHeapWithMap<N, K, D>where K: UnwindSafe, N: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more