Struct DistributedQueue

pub struct DistributedQueue { /* private fields */ }

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

impl DistributedQueue

pub fn new(path: String, zk: Arc<ZooKeeper>) -> Self

pub async fn put(&self, data: Vec<u8>) -> ZkResult<String>

Inserts data into the queue.

pub async fn try_take(&self) -> ZkResult<Option<Vec<u8>>>

Try to take the first item, if available.

pub async fn peek(&self) -> ZkResult<Option<Vec<u8>>>

Returns the data at the first element of the queue, or Ok(None) if the queue is empty. Note: peeking does not claim ownership of the element in the queue.