Attributes
- Companion:
- object
- Source:
- Dequeue.scala
- Graph
- Supertypes
- Known subtypes
Members list
Value members
Abstract methods
Enqueues the given element at the back of the dequeue, possibly fiber blocking until sufficient capacity becomes available.
Enqueues the given element at the back of the dequeue, possibly fiber blocking until sufficient capacity becomes available.
Attributes
- a
the element to be put at the back of the dequeue
- Source:
- Dequeue.scala
Enqueues the given element at the front of the dequeue, possibly semantically blocking until sufficient capacity becomes available.
Enqueues the given element at the front of the dequeue, possibly semantically blocking until sufficient capacity becomes available.
Attributes
- a
the element to be put at the back of the dequeue
- Source:
- Dequeue.scala
Attempts to enqueue the given element at the back of the dequeue without semantically blocking.
Attempts to enqueue the given element at the back of the dequeue without semantically blocking.
Attributes
- a
the element to be put at the back of the dequeue
- Returns:
an effect that describes whether the enqueuing of the given element succeeded without blocking
- Source:
- Dequeue.scala
Attempts to enqueue the given element at the front of the dequeue without semantically blocking.
Attempts to enqueue the given element at the front of the dequeue without semantically blocking.
Attributes
- a
the element to be put at the back of the dequeue
- Returns:
an effect that describes whether the enqueuing of the given element succeeded without blocking
- Source:
- Dequeue.scala
Concrete methods
Alias for offerBack in order to implement Queue
Alias for tryOfferBack in order to implement Queue
Attempts to enqueue the given elements at the back of the queue without semantically
blocking. If an item in the list cannot be enqueued, the remaining elements will be
returned. This is a convenience method that recursively runs tryOffer and does not offer
any additional performance benefits.
Attempts to enqueue the given elements at the back of the queue without semantically
blocking. If an item in the list cannot be enqueued, the remaining elements will be
returned. This is a convenience method that recursively runs tryOffer and does not offer
any additional performance benefits.
Attributes
- list
the elements to be put at the back of the queue
- Returns:
an effect that contains the remaining valus that could not be offered.
- Source:
- Dequeue.scala
Attempts to enqueue the given elements at the front of the queue without semantically
blocking. If an item in the list cannot be enqueued, the remaining elements will be
returned. This is a convenience method that recursively runs tryOffer and does not offer
any additional performance benefits.
Attempts to enqueue the given elements at the front of the queue without semantically
blocking. If an item in the list cannot be enqueued, the remaining elements will be
returned. This is a convenience method that recursively runs tryOffer and does not offer
any additional performance benefits.
Attributes
- list
the elements to be put at the front of the queue
- Returns:
an effect that contains the remaining valus that could not be offered.
- Source:
- Dequeue.scala
Inherited methods
Attempts to enqueue the given elements at the back of the queue without semantically
blocking. If an item in the list cannot be enqueued, the remaining elements will be
returned. This is a convenience method that recursively runs tryOffer and does not offer
any additional performance benefits.
Attempts to enqueue the given elements at the back of the queue without semantically
blocking. If an item in the list cannot be enqueued, the remaining elements will be
returned. This is a convenience method that recursively runs tryOffer and does not offer
any additional performance benefits.
Attributes
- list
the elements to be put at the back of the queue
- Returns:
an effect that contains the remaining valus that could not be offered.
- Inherited from:
- QueueSink
- Source:
- Queue.scala