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[F[_], A](maxSize: Int)(implicit F: Concurrent[F]): F[Queue[F, A]]

   Creates a queue with the specified size bound.

6.  def boundedNoneTerminated[F[_], A](maxSize: Int)(implicit F: Concurrent[F]): F[NoneTerminatedQueue[F, A]]

   Creates a bounded queue terminated by enqueueing None.

   Creates a bounded queue terminated by enqueueing None. All elements before None are preserved.

7.  def circularBuffer[F[_], A](maxSize: Int)(implicit F: Concurrent[F]): F[Queue[F, A]]

   Creates a queue which stores the last maxSize enqueued elements and which never blocks on enqueue.

8.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

9.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11.  def fairBounded[F[_], A](maxSize: Int, fairSize: Int)(implicit F: Concurrent[F]): F[Queue[F, A]]

    Created a bounded queue that distributed always at max fairSize elements to any subscriber.

12.  def fairUnbounded[F[_], A](fairSize: Int)(implicit F: Concurrent[F]): F[Queue[F, A]]

    Creates an unbounded queue that distributed always at max fairSize elements to any subscriber.

13.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

14.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

15.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

16.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

17.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18.  def noneTerminated[F[_], A](implicit F: Concurrent[F]): F[NoneTerminatedQueue[F, A]]

    Created an unbounded queue terminated by enqueueing None.

    Created an unbounded queue terminated by enqueueing None. All elements before None.

19.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

20.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

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

    Definition Classes

    AnyRef

22.  def synchronous[F[_], A](implicit F: Concurrent[F]): F[Queue[F, A]]

    Creates a queue which allows at most a single element to be enqueued at any time.

23.  def synchronousNoneTerminated[F[_], A](implicit F: Concurrent[F]): F[NoneTerminatedQueue[F, A]]

    Like synchronous, except that any enqueue of None will never block and cancels any dequeue operation.

24.  def toString(): String

    Definition Classes

    AnyRef → Any

25.  def unbounded[F[_], A](implicit F: Concurrent[F]): F[Queue[F, A]]

    Creates a queue with no size bound.

26.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

28.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )