Value Members

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

   Definition Classes

   Any

2.  final def ##: Int

   Definition Classes

   Any

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

   Definition Classes

   Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def bounded[G[_], A](maxSize: Int)(implicit mk: MkIn[F, G]): F[Queue[G, A]]

   Creates a queue with the specified size bound.

6.  def boundedNoneTerminated[G[_], A](maxSize: Int)(implicit mk: MkIn[F, G]): F[NoneTerminatedQueue[G, 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[G[_], A](maxSize: Int)(implicit mk: MkIn[F, G]): F[Queue[G, A]]

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

8.  def circularBufferNoneTerminated[G[_], A](maxSize: Int)(implicit mk: MkIn[F, G]): F[NoneTerminatedQueue[G, A]]

   Creates a queue terminated by enqueueing None.

   Creates a queue terminated by enqueueing None. All elements before None are preserved and never blocks on enqueue.

9.  def fairBounded[G[_], A](maxSize: Int, fairSize: Int)(implicit mk: MkIn[F, G]): F[Queue[G, A]]

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

10.  def fairUnbounded[G[_], A](fairSize: Int)(implicit mk: MkIn[F, G]): F[Queue[G, A]]

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

11.  def getClass(): Class[_ <: AnyVal]

    Definition Classes

    AnyVal → Any

12.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

13.  def noneTerminated[G[_], A](implicit mk: MkIn[F, G]): F[NoneTerminatedQueue[G, A]]

    Created an unbounded queue terminated by enqueueing None.

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

14.  def synchronous[G[_], A](implicit mk: MkIn[F, G]): F[Queue[G, A]]

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

15.  def synchronousNoneTerminated[G[_], A](implicit mk: MkIn[F, G]): F[NoneTerminatedQueue[G, A]]

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

16.  def toString(): String

    Definition Classes

    Any

17.  def unbounded[G[_], A](implicit mk: MkIn[F, G]): F[Queue[G, A]]

    Creates a queue with no size bound.