Struct bucket_queue::bucket_queue::BucketQueue
source · pub struct BucketQueue<B: Bucket, I: Index = SimpleIndex> { /* private fields */ }
Implementations
Trait Implementations
sourceimpl<T, B: Bucket<Item = T>, I: Index> Bucket for BucketQueue<B, I>
impl<T, B: Bucket<Item = T>, I: Index> Bucket for BucketQueue<B, I>
type Item = T
fn new_bucket() -> Self
fn len_bucket(&self) -> usize
fn is_empty_bucket(&self) -> bool
fn clear(&mut self)
sourceimpl<B: Bucket> Deferred<B> for BucketQueue<B>
impl<B: Bucket> Deferred<B> for BucketQueue<B>
fn bucket(&mut self, priority: usize) -> DeferredBucket<'_, Self, B>
fn min_bucket(&mut self) -> DeferredBucket<'_, Self, B>
fn max_bucket(&mut self) -> DeferredBucket<'_, Self, B>
sourceimpl<B: DoubleEndedBucket> DoubleEndedQueue<B> for BucketQueue<B>
impl<B: DoubleEndedBucket> DoubleEndedQueue<B> for BucketQueue<B>
fn push_back(&mut self, item: B::Item, priority: usize)
fn push_front(&mut self, item: B::Item, priority: usize)
fn pop_back(&mut self, priority: usize) -> Option<B::Item>
fn pop_front(&mut self, priority: usize) -> Option<B::Item>
fn pop_back_min(&mut self) -> Option<B::Item>
fn pop_front_min(&mut self) -> Option<B::Item>
fn pop_back_max(&mut self) -> Option<B::Item>
fn pop_front_max(&mut self) -> Option<B::Item>
sourceimpl<B: FirstInFirstOutBucket> FirstInFirstOutQueue<B> for BucketQueue<B>
impl<B: FirstInFirstOutBucket> FirstInFirstOutQueue<B> for BucketQueue<B>
sourceimpl<B: LastInFirstOutBucket> LastInFirstOutQueue<B> for BucketQueue<B>
impl<B: LastInFirstOutBucket> LastInFirstOutQueue<B> for BucketQueue<B>
sourceimpl<B: Bucket> Queue<B> for BucketQueue<B>
impl<B: Bucket> Queue<B> for BucketQueue<B>
fn new_queue() -> Self
fn min_priority(&self) -> Option<usize>
fn max_priority(&self) -> Option<usize>
fn bucket_for_adding(&mut self, priority: usize) -> &mut B
fn bucket_for_removing(&mut self, priority: usize) -> Option<&mut B>
fn bucket_for_peeking(&self, priority: usize) -> Option<&B>
fn bucket_for_pruning(&mut self, priority: usize) -> Option<&mut B>
fn items_pruned(&mut self, number_of_items: usize, priority: usize)
fn len_queue(&self) -> usize
fn is_empty_queue(&self) -> bool
fn prune(&mut self, priority: usize)
Auto Trait Implementations
impl<B, I> RefUnwindSafe for BucketQueue<B, I>where
B: RefUnwindSafe,
I: RefUnwindSafe,
impl<B, I> Send for BucketQueue<B, I>where
B: Send,
I: Send,
impl<B, I> Sync for BucketQueue<B, I>where
B: Sync,
I: Sync,
impl<B, I> Unpin for BucketQueue<B, I>where
B: Unpin,
I: Unpin,
impl<B, I> UnwindSafe for BucketQueue<B, I>where
B: UnwindSafe,
I: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more