pub struct QueueReceiver<T: Hash + Eq> { /* private fields */ }
Implementations§
Source§impl<T: Hash + Eq + Clone> QueueReceiver<T>
impl<T: Hash + Eq + Clone> QueueReceiver<T>
pub fn new( queue: Queue<T>, config: QueueReceiveConfig, sleeper: Arc<dyn Sleeper>, ) -> Self
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub async fn recv(&mut self) -> (Vec<T>, usize)
pub fn try_recv(&mut self) -> (Vec<T>, usize)
Sourcepub async fn recv_with(&mut self, overrides: &[Override]) -> (Vec<T>, usize)
pub async fn recv_with(&mut self, overrides: &[Override]) -> (Vec<T>, usize)
Waits until some are available, then returns as many as possible, up to max_chunk_size. usize is the number remaining in the queue.
Sourcepub fn try_recv_with(&mut self, overrides: &[Override]) -> (Vec<T>, usize)
pub fn try_recv_with(&mut self, overrides: &[Override]) -> (Vec<T>, usize)
If any are available, returns them immediately. Otherwise returns an empty vec. usize is the number remaining in the queue.
Auto Trait Implementations§
impl<T> Freeze for QueueReceiver<T>
impl<T> !RefUnwindSafe for QueueReceiver<T>
impl<T> Send for QueueReceiver<T>
impl<T> Sync for QueueReceiver<T>
impl<T> Unpin for QueueReceiver<T>where
T: Unpin,
impl<T> !UnwindSafe for QueueReceiver<T>
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