ZQueue

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def bounded[A](requestedCapacity: Int)(implicit trace: ZTraceElement): 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 offer will 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.

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def dropping[A](requestedCapacity: Int)(implicit trace: ZTraceElement): 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.

8. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

14. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

15. final def notify(): Unit

    

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

17. def sliding[A](requestedCapacity: Int)(implicit trace: ZTraceElement): 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.

18. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

19. def toString(): String

    

    Definition Classes

    AnyRef → Any

20. def unbounded[A](implicit trace: ZTraceElement): UIO[Queue[A]]

    

    Makes a new unbounded queue.

    Makes a new unbounded queue.

    A

    type of the Queue

    returns

    UIO[Queue[A]]

21. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

22. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )