Value Members

1.  def boundedQueue[F[_], A](maxSize: Int)(implicit arg0: Effect[F], ec: ExecutionContext): F[Queue[F, A]]

   Creates a bounded asynchronous queue.

   Creates a bounded asynchronous queue. Calls to enqueue1 will wait until the queue's size is less than maxSize. See mutable.Queue for more documentation.

2.  def circularBuffer[F[_], A](maxSize: Int)(implicit F: Effect[F], ec: ExecutionContext): F[Queue[F, A]]

   Creates a queue that functions as a circular buffer.

   Creates a queue that functions as a circular buffer. Up to size elements of type A will accumulate on the queue and then it will begin overwriting the oldest elements. Thus an enqueue process will never wait.

   maxSize

   The size of the circular buffer (must be > 0)

3.  def fork[F[_], A](f: F[A])(implicit F: Effect[F], ec: ExecutionContext): F[Unit]

   Begins asynchronous evaluation of f when the returned F[Unit] is bound.

   Begins asynchronous evaluation of f when the returned F[Unit] is bound. Like start but is more efficient.

4.  def hold[F[_], A](initial: A, source: Stream[F, A])(implicit arg0: Effect[F], ec: ExecutionContext): Stream[F, Signal[F, A]]

   Converts a discrete stream to a signal.

   Converts a discrete stream to a signal. Returns a single-element stream.

   Resulting signal is initially initial, and is updated with latest value produced by source. If source is empty, the resulting signal will always be initial.

   source

   discrete stream publishing values to this signal

5.  def holdOption[F[_], A](source: Stream[F, A])(implicit arg0: Effect[F], ec: ExecutionContext): Stream[F, Signal[F, Option[A]]]

   Defined as hold(None, source.map(Some(_)))

6.  def parallelSequence[F[_], G[_], A](fga: F[G[A]])(implicit F: Traverse[F], G: Effect[G], ec: ExecutionContext): G[F[A]]

   Like sequence but each G[A] is evaluated in parallel.

7.  def parallelTraverse[F[_], G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit F: Traverse[F], G: Effect[G], ec: ExecutionContext): G[F[B]]

   Like traverse but each G[B] computed from an A is evaluated in parallel.

8.  def race[F[_], A, B](fa: F[A], fb: F[B])(implicit arg0: Effect[F], ec: ExecutionContext): F[Either[A, B]]

   Returns an effect that, when run, races evaluation of fa and fb, and returns the result of whichever completes first.

   Returns an effect that, when run, races evaluation of fa and fb, and returns the result of whichever completes first. The losing effect continues to execute in the background though its result will be sent nowhere.

9.  def ref[F[_], A](implicit F: Effect[F], ec: ExecutionContext): F[Ref[F, A]]

   Creates an asynchronous, concurrent mutable reference.

10.  def refOf[F[_], A](a: A)(implicit arg0: Effect[F], ec: ExecutionContext): F[Ref[F, A]]

    Creates an asynchronous, concurrent mutable reference, initialized to a.

11.  def semaphore[F[_]](initialCount: Long)(implicit arg0: Effect[F], ec: ExecutionContext): F[Semaphore[F]]

    Creates a mutable.Semaphore, initialized to the given count.

12.  def signalOf[F[_], A](initialValue: A)(implicit arg0: Effect[F], ec: ExecutionContext): F[Signal[F, A]]

    Creates a new continuous signal which may be controlled asynchronously, and immediately sets the value to initialValue.

13.  def start[F[_], A](f: F[A])(implicit F: Effect[F], ec: ExecutionContext): F[F[A]]

    Begins asynchronous evaluation of f when the returned F[F[A]] is bound.

    Begins asynchronous evaluation of f when the returned F[F[A]] is bound. The inner F[A] will block until the result is available.

14.  def synchronousQueue[F[_], A](implicit F: Effect[F], ec: ExecutionContext): F[Queue[F, A]]

    Creates a synchronous queue, which always has size 0.

    Creates a synchronous queue, which always has size 0. Any calls to enqueue1 block until there is an offsetting call to dequeue1. Any calls to dequeue1 block until there is an offsetting call to enqueue1.

15.  def topic[F[_], A](initial: A)(implicit arg0: Effect[F], ec: ExecutionContext): F[Topic[F, A]]

    Creates an asynchronous topic, which distributes each published A to an arbitrary number of subscribers.

    Creates an asynchronous topic, which distributes each published A to an arbitrary number of subscribers. Each subscriber is guaranteed to receive at least the initial A or last value published by any publisher.

16.  def unboundedQueue[F[_], A](implicit arg0: Effect[F], ec: ExecutionContext): F[Queue[F, A]]

    Creates an unbounded asynchronous queue.

    Creates an unbounded asynchronous queue. See mutable.Queue for more documentation.

17.  def unsafeRunAsync[F[_], A](fa: F[A])(f: (Either[Throwable, A]) ⇒ IO[Unit])(implicit F: Effect[F], ec: ExecutionContext): Unit

    Like unsafeRunSync but execution is shifted to the supplied execution context.

    Like unsafeRunSync but execution is shifted to the supplied execution context. This method returns immediately after submitting execution to the execution context.

18.  object Ref