A purely functional, concurrent data structure which allows insertion and retrieval of
elements of type A in a first-in-first-out (FIFO) manner.
Depending on the type of queue constructed, the Queue#offer operation can block semantically until sufficient capacity in the queue becomes available.
The Queue#take operation semantically blocks when the queue is empty.
The Queue#tryOffer and Queue#tryTake allow for usecases which want to avoid fiber blocking a fiber.
- Companion:
- object
Value members
Concrete methods
Inherited methods
Enqueues the given element at the back of the queue, possibly fiber blocking until sufficient capacity becomes available.
Enqueues the given element at the back of the queue, possibly fiber blocking until sufficient capacity becomes available.
- Value parameters:
- a
the element to be put at the back of the queue
- Inherited from:
- QueueSink
Dequeues an element from the front of the queue, possibly fiber blocking until an element becomes available.
Dequeues an element from the front of the queue, possibly fiber blocking until an element becomes available.
- Inherited from:
- QueueSource
Attempts to enqueue the given element at the back of the queue without semantically blocking.
Attempts to enqueue the given element at the back of the queue without semantically blocking.
- Value parameters:
- a
the element to be put at the back of the queue
- Returns:
an effect that describes whether the enqueuing of the given element succeeded without blocking
- Inherited from:
- QueueSink
Attempts to dequeue an element from the front of the queue, if one is available without fiber blocking.
Attempts to dequeue an element from the front of the queue, if one is available without fiber blocking.
- Returns:
an effect that describes whether the dequeueing of an element from the queue succeeded without blocking, with
Nonedenoting that no element was available- Inherited from:
- QueueSource