object Queue extends QueuePlatformSpecific with Serializable
- Alphabetic
- By Inheritance
- Queue
- Serializable
- QueuePlatformSpecific
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- type ConcurrentDeque[A] = ConcurrentLinkedDeque[A]
- Definition Classes
- QueuePlatformSpecific
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 bounded[A](requestedCapacity: => Int)(implicit trace: Trace): UIO[Queue[A]]
Makes a new bounded queue.
Makes a new bounded queue. When the capacity of the queue is reached, any additional calls to
offerwill be suspended until there is more room in the queue.- A
type of the
Queue- requestedCapacity
capacity of the
Queue- returns
UIO[Queue[A]]
- Note
when possible use only power of 2 capacities; this will provide better performance by utilising an optimised version of the underlying zio.internal.RingBuffer.
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def dropping[A](requestedCapacity: => Int)(implicit trace: Trace): UIO[Queue[A]]
Makes a new bounded queue with the dropping strategy.
Makes a new bounded queue with the dropping strategy. When the capacity of the queue is reached, new elements will be dropped.
- A
type of the
Queue- requestedCapacity
capacity of the
Queue- returns
UIO[Queue[A]]
- Note
when possible use only power of 2 capacities; this will provide better performance by utilising an optimised version of the underlying zio.internal.RingBuffer.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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 sliding[A](requestedCapacity: => Int)(implicit trace: Trace): UIO[Queue[A]]
Makes a new bounded queue with sliding strategy.
Makes a new bounded queue with sliding strategy. When the capacity of the queue is reached, new elements will be added and the old elements will be dropped.
- A
type of the
Queue- requestedCapacity
capacity of the
Queue- returns
UIO[Queue[A]]
- Note
when possible use only power of 2 capacities; this will provide better performance by utilising an optimised version of the underlying zio.internal.RingBuffer.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def unbounded[A](implicit trace: Trace): UIO[Queue[A]]
Makes a new unbounded queue.
Makes a new unbounded queue.
- A
type of the
Queue- returns
UIO[Queue[A]]
- 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()
- object unsafe