Queue
Related Docs:
object Queue
| package zio
Waits until the queue is shutdown.
Waits until the queue is shutdown. The IO returned by this method will
not resume until the queue has been shutdown. If the queue is already
shutdown, the IO will resume right away.
How many elements can hold in the queue
How many elements can hold in the queue
true if shutdown has been called.
true if shutdown has been called.
Places one value in the queue.
Places one value in the queue.
For Bounded Queue: uses the BackPressure Strategy, places the values in
the queue and always returns no leftovers.
For Bounded Queue: uses the BackPressure Strategy, places the values in
the queue and always returns no leftovers. If the queue has reached
capacity, then the fiber performing the offerAll will be suspended until
there is room in the queue.
For Unbounded Queue: Places all values in the queue and returns no leftovers.
For Sliding Queue: uses Sliding Strategy If there is room in the queue,
it places the values otherwise it removes the old elements and enqueues the
new ones. Always returns no leftovers.
For Dropping Queue: uses Dropping Strategy, It places the values in the
queue but if there is no room it will not enqueue them and return the
leftovers.
Interrupts any fibers that are suspended on offer or take.
Interrupts any fibers that are suspended on offer or take. Future calls
to offer* and take* will be interrupted immediately.
Retrieves the size of the queue, which is equal to the number of elements in the queue.
Retrieves the size of the queue, which is equal to the number of elements in the queue. This may be negative if fibers are suspended waiting for elements to be added to the queue.
Removes the oldest value in the queue.
Removes the oldest value in the queue. If the queue is empty, this will return a computation that resumes when an item has been added to the queue.
Removes all the values in the queue and returns the values.
Removes all the values in the queue and returns the values. If the queue is empty returns an empty collection.
Takes up to max number of values in the queue.
Takes up to max number of values in the queue.
Checks whether the queue is currently empty.
Checks whether the queue is currently full.
Take the head option of values in the queue.
Take the head option of values in the queue.
Takes a number of elements from the queue between the specified minimum and maximum.
Takes a number of elements from the queue between the specified minimum and maximum. If there are fewer than the minimum number of elements available, suspends until at least the minimum number of elements have been collected.
Takes the specified number of elements from the queue.
Takes the specified number of elements from the queue. If there are fewer than the specified number of elements available, it suspends until they become available.
A
Queueis a lightweight, asynchronous queue into which values can be enqueued and of which elements can be dequeued.