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.  val G: Sync[G]
5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def bounded[F[_], A](maxSize: Int)(implicit F: Concurrent[F]): G[Queue[F, A]]

   Creates a queue with the specified size bound.

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

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

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

9.  def circularBufferNoneTerminated[F[_], A](maxSize: Int)(implicit F: Concurrent[F]): G[NoneTerminatedQueue[F, 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.

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

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

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

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

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

    Definition Classes

    AnyVal → Any

13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Created an unbounded queue terminated by enqueueing None.

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

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

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

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

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

17.  def toString(): String

    Definition Classes

    Any

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

    Creates a queue with no size bound.