Attributes
- Companion:
- object
- Source:
- Dequeue.scala
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
Members list
Value members
Abstract methods
Reverse the dequeue in constant time
Concrete methods
Modifies the context in which this dequeue is executed using the natural transformation
f.
Modifies the context in which this dequeue is executed using the natural transformation
f.
Attributes
- Returns:
a queue in the new context obtained by mapping the current one using
f- Definition Classes
- Source:
- Dequeue.scala
Inherited methods
Alias for offerBack in order to implement Queue
Alias for offerBack in order to implement Queue
Attributes
- Definition Classes
- Inherited from:
- DequeueSink
- Source:
- Dequeue.scala
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
- Inherited from:
- DequeueSink
- 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
- Inherited from:
- DequeueSink
- Source:
- Dequeue.scala
Attributes
- Inherited from:
- QueueSource
- Source:
- Queue.scala
Alias for takeFront in order to implement Queue
Alias for takeFront in order to implement Queue
Attributes
- Definition Classes
- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Dequeues an element from the back of the dequeue, possibly fiber blocking until an element becomes available.
Dequeues an element from the back of the dequeue, possibly fiber blocking until an element becomes available.
Attributes
- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Dequeues an element from the front of the dequeue, possibly semantically blocking until an element becomes available.
Dequeues an element from the front of the dequeue, possibly semantically blocking until an element becomes available.
Attributes
- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Alias for tryOfferBack in order to implement Queue
Alias for tryOfferBack in order to implement Queue
Attributes
- Definition Classes
- Inherited from:
- DequeueSink
- 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
- Inherited from:
- DequeueSink
- Source:
- Dequeue.scala
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:
- DequeueSink
- 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
- Inherited from:
- DequeueSink
- 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.
- Inherited from:
- DequeueSink
- Source:
- Dequeue.scala
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
Alias for tryTakeFront in order to implement Queue
Alias for tryTakeFront in order to implement Queue
Attributes
- Definition Classes
- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Attempts to dequeue an element from the back of the dequeue, if one is available without fiber blocking.
Attempts to dequeue an element from the back of the dequeue, if one is available without fiber blocking.
Attributes
- Returns:
an effect that describes whether the dequeueing of an element from the dequeue succeeded without blocking, with
Nonedenoting that no element was available- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Attempts to dequeue elements from the back of the dequeue, if they available without
semantically blocking. This is a convenience method that recursively runs tryTakeBack. It
does not provide any additional performance benefits.
Attempts to dequeue elements from the back of the dequeue, if they available without
semantically blocking. This is a convenience method that recursively runs tryTakeBack. It
does not provide any additional performance benefits.
Attributes
- maxN
The max elements to dequeue. Passing
Nonewill try to dequeue the whole queue.- Returns:
an effect that contains the dequeued elements
- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Attempts to dequeue an element from the front of the dequeue, if one is available without fiber blocking.
Attempts to dequeue an element from the front of the dequeue, if one is available without fiber blocking.
Attributes
- Returns:
an effect that describes whether the dequeueing of an element from the dequeue succeeded without blocking, with
Nonedenoting that no element was available- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Attempts to dequeue elements from the front of the dequeue, if they available without
semantically blocking. This is a convenience method that recursively runs tryTakeFront.
It does not provide any additional performance benefits.
Attempts to dequeue elements from the front of the dequeue, if they available without
semantically blocking. This is a convenience method that recursively runs tryTakeFront.
It does not provide any additional performance benefits.
Attributes
- maxN
The max elements to dequeue. Passing
Nonewill try to dequeue the whole queue.- Returns:
an effect that contains the dequeued elements
- Inherited from:
- DequeueSource
- Source:
- Dequeue.scala
Attempts to dequeue elements from the front of the queue, if they are available without semantically blocking. This method does not guarantee any additional performance benefits beyond simply recursively calling tryTake, though some implementations will provide a more efficient implementation.
Attempts to dequeue elements from the front of the queue, if they are available without semantically blocking. This method does not guarantee any additional performance benefits beyond simply recursively calling tryTake, though some implementations will provide a more efficient implementation.
Attributes
- maxN
The max elements to dequeue. Passing
Nonewill try to dequeue the whole queue.- Returns:
an effect that contains the dequeued elements
- Inherited from:
- QueueSource
- Source:
- Queue.scala