Struct keyed_priority_queue::OccupiedEntry
source · pub struct OccupiedEntry<'a, TKey, TPriority, S = RandomState>where
TKey: 'a + Eq + Hash,
TPriority: 'a + Ord,
S: BuildHasher,{ /* private fields */ }
Expand description
A view into an occupied entry in a KeyedPriorityQueue
.
It is part of the Entry
enum.
Implementations§
source§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,
sourcepub fn get_priority(&self) -> &TPriority
pub fn get_priority(&self) -> &TPriority
sourcepub fn set_priority(self, priority: TPriority) -> TPriority
pub fn set_priority(self, priority: TPriority) -> TPriority
Changes priority of key and returns old priority
Time complexity
Up to O(log n) operations in worst case O(1) in best case
sourcepub fn remove(self) -> (TKey, TPriority)
pub fn remove(self) -> (TKey, TPriority)
Auto Trait Implementations§
impl<'a, TKey, TPriority, S> RefUnwindSafe for OccupiedEntry<'a, TKey, TPriority, S>where S: RefUnwindSafe, TKey: RefUnwindSafe, TPriority: RefUnwindSafe,
impl<'a, TKey, TPriority, S = RandomState> !Send for OccupiedEntry<'a, TKey, TPriority, S>
impl<'a, TKey, TPriority, S = RandomState> !Sync for OccupiedEntry<'a, TKey, TPriority, S>
impl<'a, TKey, TPriority, S> Unpin for OccupiedEntry<'a, TKey, TPriority, S>where TKey: Unpin,
impl<'a, TKey, TPriority, S = RandomState> !UnwindSafe for OccupiedEntry<'a, TKey, TPriority, S>
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