trait DequeueSink[F[_], A] extends QueueSink[F, A]
- Alphabetic
- By Inheritance
- DequeueSink
- QueueSink
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def offerBack(a: A): F[Unit]
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.
- a
the element to be put at the back of the dequeue
- abstract def offerFront(a: A): F[Unit]
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.
- a
the element to be put at the back of the dequeue
- abstract def tryOfferBack(a: A): F[Boolean]
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.
- 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
- abstract def tryOfferFront(a: A): F[Boolean]
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.
- 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
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def offer(a: A): F[Unit]
Alias for offerBack in order to implement Queue
Alias for offerBack in order to implement Queue
- a
the element to be put at the back of the queue
- Definition Classes
- DequeueSink → QueueSink
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def tryOffer(a: A): F[Boolean]
Alias for tryOfferBack in order to implement Queue
Alias for tryOfferBack in order to implement Queue
- 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
- Definition Classes
- DequeueSink → QueueSink
- def tryOfferBackN(list: List[A])(implicit F: Monad[F]): F[List[A]]
Attempts to enqueue the given elements at the back of the queue without semantically blocking.
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
tryOfferand does not offer any additional performance benefits.- 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.
- def tryOfferFrontN(list: List[A])(implicit F: Monad[F]): F[List[A]]
Attempts to enqueue the given elements at the front of the queue without semantically blocking.
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
tryOfferand does not offer any additional performance benefits.- 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.
- def tryOfferN(list: List[A])(implicit F: Monad[F]): F[List[A]]
Attempts to enqueue the given elements at the back of the queue without semantically blocking.
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
tryOfferand does not offer any additional performance benefits.- 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.
- Definition Classes
- QueueSink
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()