Struct abstutil::priority_queue::PriorityQueueItem
source · pub struct PriorityQueueItem<K, V> {
pub cost: K,
pub value: V,
}
Expand description
Use with BinaryHeap
. Since it’s a max-heap, reverse the comparison to get the smallest cost
first.
Fields§
§cost: K
§value: V
Trait Implementations§
source§impl<K: Clone, V: Clone> Clone for PriorityQueueItem<K, V>
impl<K: Clone, V: Clone> Clone for PriorityQueueItem<K, V>
source§fn clone(&self) -> PriorityQueueItem<K, V>
fn clone(&self) -> PriorityQueueItem<K, V>
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<'de, K, V> Deserialize<'de> for PriorityQueueItem<K, V>where
K: Deserialize<'de>,
V: Deserialize<'de>,
impl<'de, K, V> Deserialize<'de> for PriorityQueueItem<K, V>where
K: Deserialize<'de>,
V: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<K: Ord, V: Ord> Ord for PriorityQueueItem<K, V>
impl<K: Ord, V: Ord> Ord for PriorityQueueItem<K, V>
source§impl<K: PartialEq, V: PartialEq> PartialEq for PriorityQueueItem<K, V>
impl<K: PartialEq, V: PartialEq> PartialEq for PriorityQueueItem<K, V>
source§fn eq(&self, other: &PriorityQueueItem<K, V>) -> bool
fn eq(&self, other: &PriorityQueueItem<K, V>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<K: Ord, V: Ord> PartialOrd for PriorityQueueItem<K, V>
impl<K: Ord, V: Ord> PartialOrd for PriorityQueueItem<K, V>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<K, V> Serialize for PriorityQueueItem<K, V>
impl<K, V> Serialize for PriorityQueueItem<K, V>
impl<K: Eq, V: Eq> Eq for PriorityQueueItem<K, V>
impl<K, V> StructuralPartialEq for PriorityQueueItem<K, V>
Auto Trait Implementations§
impl<K, V> Freeze for PriorityQueueItem<K, V>
impl<K, V> RefUnwindSafe for PriorityQueueItem<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for PriorityQueueItem<K, V>
impl<K, V> Sync for PriorityQueueItem<K, V>
impl<K, V> Unpin for PriorityQueueItem<K, V>
impl<K, V> UnwindSafe for PriorityQueueItem<K, V>where
K: UnwindSafe,
V: 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