pub struct DistributedQueue { /* private fields */ }
Expand description
An implementation of the Distributed Queue ZK recipe. Items put into the queue are guaranteed to be ordered (by means of ZK’s PERSISTENTSEQUENTIAL node). If a single consumer takes items out of the queue, they will be ordered FIFO. If ordering is important, use a LeaderSelector to nominate a single consumer.
Implementations§
Auto Trait Implementations§
impl !RefUnwindSafe for DistributedQueue
impl Send for DistributedQueue
impl Sync for DistributedQueue
impl Unpin for DistributedQueue
impl !UnwindSafe for DistributedQueue
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