InspectableQueue

Gets the current size of the queue.

Returns the element which would be dequeued next, but without removing it. Completes when such an element is available.

The time-varying size of this Queue. Emits elements describing the current size of the queue. Offsetting enqueues and de-queues may not result in refreshes.

Finally, note that operations like dequeue are optimized to work on chunks when possible, which will result in faster decreases in size that one might expect. More granular updates can be achieved by calling dequeue1 repeatedly, but this is less efficient than dequeueing in batches.

Dequeues elements from the queue.

Dequeues one A from this queue. Completes once one is ready.

Provides a pipe that converts a stream of batch sizes in to a stream of elements by dequeuing batches of the specified size.

Dequeues elements from the queue, ensuring elements are dequeued in chunks not exceeding maxSize.

Dequeues one Chunk[A] with no more than maxSize elements. Completes once one is ready.

Enqueues each element of the input stream to this queue by calling enqueue1 on each element.

Enqueues one element to this Queue. If the queue is full this waits until queue has space.

This completes after a has been successfully enqueued to this Queue

Returns an alternate view of this Queue where its elements are of type B, given two functions, A => B and B => A.

Offers one element to this Queue.

Evaluates to false if the queue is full, indicating the a was not queued up. Evaluates to true if the a was queued up successfully.

Tries to dequeue a single element. Unlike dequeue1, this method does not semantically block until a chunk is available - instead, None is returned immediately.

Tries to dequeue a single chunk of no more than max size elements. Unlike dequeueChunk1, this method does not semantically block until a chunk is available - instead, None is returned immediately.