Struct keyed_priority_queue::OccupiedEntry [−][src]
pub struct OccupiedEntry<'a, TKey, TPriority, S = RandomState> where
TKey: 'a + Eq + Hash,
TPriority: 'a + Ord,
S: BuildHasher, { /* fields omitted */ }Expand description
A view into an occupied entry in a KeyedPriorityQueue.
It is part of the Entry enum.
Implementations
impl<'a, TKey, TPriority, S> OccupiedEntry<'a, TKey, TPriority, S> where
TKey: 'a + Eq + Hash,
TPriority: 'a + Ord,
S: BuildHasher,
impl<'a, TKey, TPriority, S> OccupiedEntry<'a, TKey, TPriority, S> where
TKey: 'a + Eq + Hash,
TPriority: 'a + Ord,
S: BuildHasher,
Changes priority of key and returns old priority
Time complexity
Up to O(log n) operations in worst case O(1) in best case