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.  def absolve[R, E, A](v: ZIO[R, E, Either[E, A]]): ZIO[R, E, A]

   Submerges the error case of an Either into the ZIO.

   Submerges the error case of an Either into the ZIO. The inverse operation of IO.either.

5.  def access[R]: AccessPartiallyApplied[R]

   Accesses the environment of the effect.

   Accesses the environment of the effect.

   val portNumber = effect.access(_.config.portNumber)

6.  def accessM[R]: AccessMPartiallyApplied[R]

   Effectfully accesses the environment of the effect.

7.  def allowInterrupt: UIO[Unit]

   Makes an explicit check to see if the fiber has been interrupted, and if so, performs self-interruption

8.  def apply[A](a: ⇒ A): Task[A]
9.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10.  def bracket[R, E, A, B](acquire: ZIO[R, E, A], release: (A) ⇒ URIO[R, Any], use: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, B]

    Uncurried version.

    Uncurried version. Doesn't offer curried syntax and have worse type-inference characteristics, but guarantees no extra allocations of intermediate zio.ZIO.BracketAcquire and zio.ZIO.BracketRelease objects.

11.  def bracket[R, E, A](acquire: ZIO[R, E, A]): BracketAcquire[R, E, A]

    When this effect represents acquisition of a resource (for example, opening a file, launching a thread, etc.), bracket can be used to ensure the acquisition is not interrupted and the resource is always released.

    When this effect represents acquisition of a resource (for example, opening a file, launching a thread, etc.), bracket can be used to ensure the acquisition is not interrupted and the resource is always released.

    The function does two things:

    1. Ensures this effect, which acquires the resource, will not be interrupted. Of course, acquisition may fail for internal reasons (an uncaught exception). 2. Ensures the release effect will not be interrupted, and will be executed so long as this effect successfully acquires the resource.

    In between acquisition and release of the resource, the use effect is executed.

    If the release effect fails, then the entire effect will fail even if the use effect succeeds. If this fail-fast behavior is not desired, errors produced by the release effect can be caught and ignored.

    openFile("data.json").bracket(closeFile) { file =>
      for {
        header <- readHeader(file)
        ...
      } yield result
    }

12.  def bracketExit[R, E, A, B](acquire: ZIO[R, E, A], release: (A, Exit[E, B]) ⇒ URIO[R, Any], use: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, B]

    Uncurried version.

    Uncurried version. Doesn't offer curried syntax and has worse type-inference characteristics, but guarantees no extra allocations of intermediate zio.ZIO.BracketExitAcquire and zio.ZIO.BracketExitRelease objects.

13.  def bracketExit[R, E, A](acquire: ZIO[R, E, A]): BracketExitAcquire[R, E, A]

    Acquires a resource, uses the resource, and then releases the resource.

    Acquires a resource, uses the resource, and then releases the resource. Neither the acquisition nor the release will be interrupted, and the resource is guaranteed to be released, so long as the acquire effect succeeds. If use fails, then after release, the returned effect will fail with the same error.

14.  def checkInterruptible[R, E, A](f: (zio.InterruptStatus) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Checks the interrupt status, and produces the effect returned by the specified callback.

15.  def checkTraced[R, E, A](f: (zio.TracingStatus) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Checks the ZIO Tracing status, and produces the effect returned by the specified callback.

16.  def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

17.  def collect[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, Option[E], B]): ZIO[R, E, List[B]]

    Evaluate each effect in the structure from left to right, collecting the the successful values and discarding the empty cases.

    Evaluate each effect in the structure from left to right, collecting the the successful values and discarding the empty cases. For a parallel version, see collectPar.

18.  def collectAll[R, E, A](in: NonEmptyChunk[ZIO[R, E, A]]): ZIO[R, E, NonEmptyChunk[A]]

    Evaluate each effect in the structure from left to right, and collect the results.

    Evaluate each effect in the structure from left to right, and collect the results. For a parallel version, see collectAllPar.

19.  def collectAll[R, E, A](in: Chunk[ZIO[R, E, A]]): ZIO[R, E, Chunk[A]]

    Evaluate each effect in the structure from left to right, and collect the results.

    Evaluate each effect in the structure from left to right, and collect the results. For a parallel version, see collectAllPar.

20.  def collectAll[R, E, A](in: Iterable[ZIO[R, E, A]]): ZIO[R, E, List[A]]

    Evaluate each effect in the structure from left to right, and collect the results.

    Evaluate each effect in the structure from left to right, and collect the results. For a parallel version, see collectAllPar.

21.  def collectAllPar[R, E, A](as: NonEmptyChunk[ZIO[R, E, A]]): ZIO[R, E, NonEmptyChunk[A]]

    Evaluate each effect in the structure in parallel, and collect the results.

    Evaluate each effect in the structure in parallel, and collect the results. For a sequential version, see collectAll.

22.  def collectAllPar[R, E, A](as: Chunk[ZIO[R, E, A]]): ZIO[R, E, Chunk[A]]

    Evaluate each effect in the structure in parallel, and collect the results.

    Evaluate each effect in the structure in parallel, and collect the results. For a sequential version, see collectAll.

23.  def collectAllPar[R, E, A](as: Iterable[ZIO[R, E, A]]): ZIO[R, E, List[A]]

    Evaluate each effect in the structure in parallel, and collect the results.

    Evaluate each effect in the structure in parallel, and collect the results. For a sequential version, see collectAll.

24.  def collectAllParN[R, E, A](n: Int)(as: Iterable[ZIO[R, E, A]]): ZIO[R, E, List[A]]

    Evaluate each effect in the structure in parallel, and collect the results.

    Evaluate each effect in the structure in parallel, and collect the results. For a sequential version, see collectAll.

    Unlike collectAllPar, this method will use at most n fibers.

25.  def collectAllParN_[R, E, A](n: Int)(as: Iterable[ZIO[R, E, A]]): ZIO[R, E, Unit]

    Evaluate each effect in the structure in parallel, and discard the results.

    Evaluate each effect in the structure in parallel, and discard the results. For a sequential version, see collectAll_.

    Unlike collectAllPar_, this method will use at most n fibers.

26.  def collectAllPar_[R, E, A](as: Chunk[ZIO[R, E, A]]): ZIO[R, E, Unit]

    Evaluate each effect in the structure in parallel, and discard the results.

    Evaluate each effect in the structure in parallel, and discard the results. For a sequential version, see collectAll_.

27.  def collectAllPar_[R, E, A](as: Iterable[ZIO[R, E, A]]): ZIO[R, E, Unit]

    Evaluate each effect in the structure in parallel, and discard the results.

    Evaluate each effect in the structure in parallel, and discard the results. For a sequential version, see collectAll_.

28.  def collectAllSuccesses[R, E, A](in: Iterable[ZIO[R, E, A]]): URIO[R, List[A]]

    Evaluate and run each effect in the structure and collect discarding failed ones.

29.  def collectAllSuccessesPar[R, E, A](in: Iterable[ZIO[R, E, A]]): URIO[R, List[A]]

    Evaluate and run each effect in the structure in parallel, and collect discarding failed ones.

30.  def collectAllSuccessesParN[R, E, A](n: Int)(in: Iterable[ZIO[R, E, A]]): URIO[R, List[A]]

    Evaluate and run each effect in the structure in parallel, and collect discarding failed ones.

    Evaluate and run each effect in the structure in parallel, and collect discarding failed ones.

    Unlike collectAllSuccessesPar, this method will use at most up to n fibers.

31.  def collectAllWith[R, E, A, U](in: Iterable[ZIO[R, E, A]])(f: PartialFunction[A, U]): ZIO[R, E, List[U]]

    Evaluate each effect in the structure with collectAll, and collect the results with given partial function.

32.  def collectAllWithPar[R, E, A, U](in: Iterable[ZIO[R, E, A]])(f: PartialFunction[A, U]): ZIO[R, E, List[U]]

    Evaluate each effect in the structure with collectAllPar, and collect the results with given partial function.

33.  def collectAllWithParN[R, E, A, U](n: Int)(in: Iterable[ZIO[R, E, A]])(f: PartialFunction[A, U]): ZIO[R, E, List[U]]

    Evaluate each effect in the structure with collectAllPar, and collect the results with given partial function.

    Evaluate each effect in the structure with collectAllPar, and collect the results with given partial function.

    Unlike collectAllWithPar, this method will use at most up to n fibers.

34.  def collectAll_[R, E, A](in: Chunk[ZIO[R, E, A]]): ZIO[R, E, Unit]

    Evaluate each effect in the structure from left to right, and discard the results.

    Evaluate each effect in the structure from left to right, and discard the results. For a parallel version, see collectAllPar_.

35.  def collectAll_[R, E, A](in: Iterable[ZIO[R, E, A]]): ZIO[R, E, Unit]

    Evaluate each effect in the structure from left to right, and discard the results.

    Evaluate each effect in the structure from left to right, and discard the results. For a parallel version, see collectAllPar_.

36.  def collectPar[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, Option[E], B]): ZIO[R, E, List[B]]

    Evaluate each effect in the structure in parallel, collecting the the successful values and discarding the empty cases.

37.  def collectParN[R, E, A, B](n: Int)(in: Iterable[A])(f: (A) ⇒ ZIO[R, Option[E], B]): ZIO[R, E, List[B]]

    Evaluate each effect in the structure in parallel, collecting the the successful values and discarding the empty cases.

    Evaluate each effect in the structure in parallel, collecting the the successful values and discarding the empty cases.

    Unlike collectPar, this method will use at most up to n fibers.

38.  def descriptor: UIO[Fiber.Descriptor]

    Returns information about the current fiber, such as its identity.

39.  def descriptorWith[R, E, A](f: (Fiber.Descriptor) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Constructs an effect based on information about the current fiber, such as its identity.

40.  def die(t: ⇒ Throwable): UIO[Nothing]

    Returns an effect that dies with the specified Throwable.

    Returns an effect that dies with the specified Throwable. This method can be used for terminating a fiber because a defect has been detected in the code.

41.  def dieMessage(message: ⇒ String): UIO[Nothing]

    Returns an effect that dies with a java.lang.RuntimeException having the specified text message.

    Returns an effect that dies with a java.lang.RuntimeException having the specified text message. This method can be used for terminating a fiber because a defect has been detected in the code.

42.  def done[E, A](r: ⇒ Exit[E, A]): IO[E, A]

    Returns an effect from a zio.Exit value.

43.  def effect[A](effect: ⇒ A): Task[A]

    Imports a synchronous side-effect into a pure ZIO value, translating any thrown exceptions into typed failed effects creating with ZIO.fail.

    Imports a synchronous side-effect into a pure ZIO value, translating any thrown exceptions into typed failed effects creating with ZIO.fail.

    def putStrLn(line: String): Task[Unit] = Task.effect(println(line))

44.  def effectAsync[R, E, A](register: ((ZIO[R, E, A]) ⇒ Unit) ⇒ Any, blockingOn: List[Id] = Nil): ZIO[R, E, A]

    Imports an asynchronous side-effect into a pure ZIO value.

    Imports an asynchronous side-effect into a pure ZIO value. See effectAsyncMaybe for the more expressive variant of this function that can return a value synchronously.

    The callback function ZIO[R, E, A] => Any must be called at most once.

    The list of fibers, that may complete the async callback, is used to provide better diagnostics.

45.  def effectAsyncInterrupt[R, E, A](register: ((ZIO[R, E, A]) ⇒ Unit) ⇒ Either[Canceler[R], ZIO[R, E, A]], blockingOn: List[Id] = Nil): ZIO[R, E, A]

    Imports an asynchronous side-effect into a ZIO effect.

    Imports an asynchronous side-effect into a ZIO effect. The side-effect has the option of returning the value synchronously, which is useful in cases where it cannot be determined if the effect is synchronous or asynchronous until the side-effect is actually executed. The effect also has the option of returning a canceler, which will be used by the runtime to cancel the asynchronous effect if the fiber executing the effect is interrupted.

    If the register function returns a value synchronously, then the callback function ZIO[R, E, A] => Any must not be called. Otherwise the callback function must be called at most once.

    The list of fibers, that may complete the async callback, is used to provide better diagnostics.

46.  def effectAsyncM[R, E, A](register: ((ZIO[R, E, A]) ⇒ Unit) ⇒ ZIO[R, E, Any]): ZIO[R, E, A]

    Imports an asynchronous effect into a pure ZIO value.

    Imports an asynchronous effect into a pure ZIO value. This formulation is necessary when the effect is itself expressed in terms of ZIO.

47.  def effectAsyncMaybe[R, E, A](register: ((ZIO[R, E, A]) ⇒ Unit) ⇒ Option[ZIO[R, E, A]], blockingOn: List[Id] = Nil): ZIO[R, E, A]

    Imports an asynchronous effect into a pure ZIO value, possibly returning the value synchronously.

    Imports an asynchronous effect into a pure ZIO value, possibly returning the value synchronously.

    If the register function returns a value synchronously, then the callback function ZIO[R, E, A] => Any must not be called. Otherwise the callback function must be called at most once.

    The list of fibers, that may complete the async callback, is used to provide better diagnostics.

48.  def effectAsyncWithCompletionHandler[T](op: (CompletionHandler[T, Any]) ⇒ Unit): Task[T]

    Definition Classes

    ZIOCompanionPlatformSpecific

49.  def effectSuspend[R, A](rio: ⇒ RIO[R, A]): RIO[R, A]

    Returns a lazily constructed effect, whose construction may itself require effects.

    Returns a lazily constructed effect, whose construction may itself require effects. When no environment is required (i.e., when R == Any) it is conceptually equivalent to flatten(effect(io)).

50.  def effectSuspendTotal[R, E, A](zio: ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Returns a lazily constructed effect, whose construction may itself require effects.

    Returns a lazily constructed effect, whose construction may itself require effects. The effect must not throw any exceptions. When no environment is required (i.e., when R == Any) it is conceptually equivalent to flatten(effectTotal(zio)). If you wonder if the effect throws exceptions, do not use this method, use Task.effectSuspend or ZIO.effectSuspend.

51.  def effectSuspendTotalWith[R, E, A](f: (Platform, Id) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Returns a lazily constructed effect, whose construction may itself require effects.

    Returns a lazily constructed effect, whose construction may itself require effects. The effect must not throw any exceptions. When no environment is required (i.e., when R == Any) it is conceptually equivalent to flatten(effectTotal(zio)). If you wonder if the effect throws exceptions, do not use this method, use Task.effectSuspend or ZIO.effectSuspend.

52.  def effectSuspendWith[R, A](f: (Platform, Id) ⇒ RIO[R, A]): RIO[R, A]

    Returns a lazily constructed effect, whose construction may itself require effects.

    Returns a lazily constructed effect, whose construction may itself require effects. When no environment is required (i.e., when R == Any) it is conceptually equivalent to flatten(effect(io)).

53.  def effectTotal[A](effect: ⇒ A): UIO[A]

    Imports a total synchronous effect into a pure ZIO value.

    Imports a total synchronous effect into a pure ZIO value. The effect must not throw any exceptions. If you wonder if the effect throws exceptions, then do not use this method, use Task.effect, IO.effect, or ZIO.effect.

    val nanoTime: UIO[Long] = IO.effectTotal(System.nanoTime())

54.  def environment[R]: URIO[R, R]

    Accesses the whole environment of the effect.

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

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef → Any

57.  def fail[E](error: ⇒ E): IO[E, Nothing]

    Returns an effect that models failure with the specified error.

    Returns an effect that models failure with the specified error. The moral equivalent of throw for pure code.

58.  val fiberId: UIO[Id]

    Returns the Fiber.Id of the fiber executing the effect that calls this method.

59.  def filter[R, E, A](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, List[A]]

    Filters the collection using the specified effectual predicate.

60.  def filterNot[R, E, A](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, List[A]]

    Filters the collection using the specified effectual predicate, removing all elements that satisfy the predicate.

61.  def filterNotPar[R, E, A](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, List[A]]

    Filters the collection in parallel using the specified effectual predicate, removing all elements that satisfy the predicate.

    Filters the collection in parallel using the specified effectual predicate, removing all elements that satisfy the predicate. See filterNot for a sequential version of it.

62.  def filterPar[R, E, A](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, List[A]]

    Filters the collection in parallel using the specified effectual predicate.

    Filters the collection in parallel using the specified effectual predicate. See filter for a sequential version of it.

63.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

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

64.  def first[A, B]: ZIO[(A, B), Nothing, A]

    Returns an effectful function that extracts out the first element of a tuple.

65.  def firstSuccessOf[R, R1 <: R, E, A](zio: ZIO[R, E, A], rest: Iterable[ZIO[R1, E, A]]): ZIO[R1, E, A]

    Returns an effect that races this effect with all the specified effects, yielding the value of the first effect to succeed with a value.

    Returns an effect that races this effect with all the specified effects, yielding the value of the first effect to succeed with a value. Losers of the race will be interrupted immediately

66.  def flatten[R, E, A](zio: ZIO[R, E, ZIO[R, E, A]]): ZIO[R, E, A]

    Returns an effect that first executes the outer effect, and then executes the inner effect, returning the value from the inner effect, and effectively flattening a nested effect.

67.  def foldLeft[R, E, S, A](in: Iterable[A])(zero: S)(f: (S, A) ⇒ ZIO[R, E, S]): ZIO[R, E, S]

    Folds an Iterable[A] using an effectual function f, working sequentially from left to right.

68.  def foldRight[R, E, S, A](in: Iterable[A])(zero: S)(f: (A, S) ⇒ ZIO[R, E, S]): ZIO[R, E, S]

    Folds an Iterable[A] using an effectual function f, working sequentially from right to left.

69.  final def foreach[R, E, A, B](in: NonEmptyChunk[A])(f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, NonEmptyChunk[B]]

    Applies the function f to each element of the NonEmptyChunk[A] and returns the results in a new NonEmptyChunk[B].

    Applies the function f to each element of the NonEmptyChunk[A] and returns the results in a new NonEmptyChunk[B].

    For a parallel version of this method, see foreachPar. If you do not need the results, see foreach_ for a more efficient implementation.

70.  final def foreach[R, E, A, B](in: Chunk[A])(f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

    Applies the function f to each element of the Chunk[A] and returns the results in a new Chunk[B].

    Applies the function f to each element of the Chunk[A] and returns the results in a new Chunk[B].

    For a parallel version of this method, see foreachPar. If you do not need the results, see foreach_ for a more efficient implementation.

71.  final def foreach[R, E, A, B](in: Option[A])(f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, Option[B]]

    Applies the function f if the argument is non-empty and returns the results in a new Option[B].

72.  def foreach[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, List[B]]

    Applies the function f to each element of the Iterable[A] and returns the results in a new List[B].

    Applies the function f to each element of the Iterable[A] and returns the results in a new List[B].

    For a parallel version of this method, see foreachPar. If you do not need the results, see foreach_ for a more efficient implementation.

73.  final def foreachExec[R, E, A, B](as: Iterable[A])(exec: ExecutionStrategy)(f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, List[B]]

    Applies the function f to each element of the Iterable[A] and returns the result in a new List[B] using the specified execution strategy.

74.  final def foreachPar[R, E, A, B](as: NonEmptyChunk[A])(fn: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, NonEmptyChunk[B]]

    Applies the function f to each element of the NonEmptyChunk[A] in parallel, and returns the results in a new NonEmptyChunk[B].

    Applies the function f to each element of the NonEmptyChunk[A] in parallel, and returns the results in a new NonEmptyChunk[B].

    For a sequential version of this method, see foreach.

75.  final def foreachPar[R, E, A, B](as: Chunk[A])(fn: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

    Applies the function f to each element of the Chunk[A] in parallel, and returns the results in a new Chunk[B].

    Applies the function f to each element of the Chunk[A] in parallel, and returns the results in a new Chunk[B].

    For a sequential version of this method, see foreach.

76.  def foreachPar[R, E, A, B](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, List[B]]

    Applies the function f to each element of the Iterable[A] in parallel, and returns the results in a new List[B].

    Applies the function f to each element of the Iterable[A] in parallel, and returns the results in a new List[B].

    For a sequential version of this method, see foreach.

77.  def foreachParN[R, E, A, B](n: Int)(as: Iterable[A])(fn: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, List[B]]

    Applies the functionw f to each element of the Iterable[A] in parallel, and returns the results in a new List[B].

    Applies the functionw f to each element of the Iterable[A] in parallel, and returns the results in a new List[B].

    Unlike foreachPar, this method will use at most up to n fibers.

78.  def foreachParN_[R, E, A](n: Int)(as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

    Applies the function f to each element of the Iterable[A] and runs produced effects in parallel, discarding the results.

    Applies the function f to each element of the Iterable[A] and runs produced effects in parallel, discarding the results.

    Unlike foreachPar_, this method will use at most up to n fibers.

79.  final def foreachPar_[R, E, A](as: Chunk[A])(f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

    Applies the function f to each element of the Chunk[A] and runs produced effects in parallel, discarding the results.

    Applies the function f to each element of the Chunk[A] and runs produced effects in parallel, discarding the results.

    For a sequential version of this method, see foreach_.

80.  def foreachPar_[R, E, A](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

    Applies the function f to each element of the Iterable[A] and runs produced effects in parallel, discarding the results.

    Applies the function f to each element of the Iterable[A] and runs produced effects in parallel, discarding the results.

    For a sequential version of this method, see foreach_.

    Optimized to avoid keeping full tree of effects, so that method could be able to handle large input sequences. Behaves almost like this code:

    as.foldLeft(ZIO.unit) { (acc, a) => acc.zipParLeft(f(a)) }

    Additionally, interrupts all effects on any failure.

81.  final def foreach_[R, E, A](as: Chunk[A])(f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

    Applies the function f to each element of the Chunk[A] and returns the results in a new Chunk[B].

    Applies the function f to each element of the Chunk[A] and returns the results in a new Chunk[B].

    For a parallel version of this method, see foreachPar.

82.  def foreach_[R, E, A](as: Iterable[A])(f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

    Applies the function f to each element of the Iterable[A] and runs produced effects sequentially.

    Applies the function f to each element of the Iterable[A] and runs produced effects sequentially.

    Equivalent to foreach(as)(f).unit, but without the cost of building the list of results.

83.  def forkAll[R, E, A](as: Iterable[ZIO[R, E, A]]): URIO[R, Fiber[E, List[A]]]

    Returns an effect that forks all of the specified values, and returns a composite fiber that produces a list of their results, in order.

84.  def forkAll_[R, E, A](as: Iterable[ZIO[R, E, A]]): URIO[R, Unit]

    Returns an effect that forks all of the specified values, and returns a composite fiber that produces unit.

    Returns an effect that forks all of the specified values, and returns a composite fiber that produces unit. This version is faster than forkAll in cases where the results of the forked fibers are not needed.

85.  def forkScope: UIO[ZScope[Exit[Any, Any]]]

    Retrieves the scope that will be used to supervise forked effects.

86.  def forkScopeMask[R, E, A](newScope: ZScope[Exit[Any, Any]])(f: (ForkScopeRestore) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Captures the fork scope, before overriding it with the specified new scope, passing a function that allows restoring the fork scope to what it was originally.

87.  def forkScopeWith[R, E, A](f: (ZScope[Exit[Any, Any]]) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

    Retrieves the scope that will be used to supervise forked effects.

88.  def fromCompletionStage[A](cs: ⇒ CompletionStage[A]): Task[A]

    Definition Classes

    ZIOCompanionPlatformSpecific

89.  def fromEither[E, A](v: ⇒ Either[E, A]): IO[E, A]

    Lifts an Either into a ZIO value.

90.  def fromFiber[E, A](fiber: ⇒ Fiber[E, A]): IO[E, A]

    Creates a ZIO value that represents the exit value of the specified fiber.

91.  def fromFiberM[E, A](fiber: IO[E, Fiber[E, A]]): IO[E, A]

    Creates a ZIO value that represents the exit value of the specified fiber.

92.  def fromFunction[R, A](f: (R) ⇒ A): URIO[R, A]

    Lifts a function R => A into a URIO[R, A].

93.  def fromFunctionFuture[R, A](f: (R) ⇒ Future[A]): RIO[R, A]

    Lifts a function returning Future into an effect that requires the input to the function.

94.  def fromFunctionM[R, E, A](f: (R) ⇒ IO[E, A]): ZIO[R, E, A]

    Lifts an effectful function whose effect requires no environment into an effect that requires the input to the function.

95.  def fromFuture[A](make: (ExecutionContext) ⇒ Future[A]): Task[A]

    Imports a function that creates a scala.concurrent.Future from an scala.concurrent.ExecutionContext into a ZIO.

96.  def fromFutureInterrupt[A](make: (ExecutionContext) ⇒ Future[A]): Task[A]

    Imports a function that creates a scala.concurrent.Future from an scala.concurrent.ExecutionContext into a ZIO.

    Imports a function that creates a scala.concurrent.Future from an scala.concurrent.ExecutionContext into a ZIO. The provided ExecutionContext will interrupt the Future between asynchronous operations such as map and flatMap if this effect is interrupted. Note that no attempt will be made to interrupt a Future blocking on a synchronous operation and that the Future must be created using the provided ExecutionContext.

97.  def fromFutureJava[A](future: ⇒ Future[A]): RIO[Blocking, A]

    WARNING: this uses the blocking Future#get, consider using fromCompletionStage

    WARNING: this uses the blocking Future#get, consider using fromCompletionStage

    Definition Classes

    ZIOCompanionPlatformSpecific

98.  def fromOption[A](v: ⇒ Option[A]): IO[Option[Nothing], A]

    Lifts an Option into a ZIO but preserves the error as an option in the error channel, making it easier to compose in some scenarios.

99.  def fromTry[A](value: ⇒ Try[A]): Task[A]

    Lifts a Try into a ZIO.

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

     Definition Classes

     AnyRef → Any

     Annotations

     @native()

101.  final def getOrFail[A](v: ⇒ Option[A]): Task[A]

     Lifts an Option into a ZIO, if the option is not defined it fails with NoSuchElementException.

102.  def halt[E](cause: ⇒ Cause[E]): IO[E, Nothing]

     Returns an effect that models failure with the specified Cause.

103.  def haltWith[E](function: (() ⇒ ZTrace) ⇒ Cause[E]): IO[E, Nothing]

     Returns an effect that models failure with the specified Cause.

     Returns an effect that models failure with the specified Cause.

     This version takes in a lazily-evaluated trace that can be attached to the Cause via Cause.Traced.

104.  def hashCode(): Int

     Definition Classes

     AnyRef → Any

     Annotations

     @native()

105.  def identity[R]: URIO[R, R]

     Returns the identity effectful function, which performs no effects

106.  def ifM[R, E](b: ZIO[R, E, Boolean]): IfM[R, E]

     Runs onTrue if the result of b is true and onFalse otherwise.

107.  val infinity: URIO[Clock, Nothing]

     Like never, but fibers that running this effect won't be garbage collected unless interrupted.

108.  val interrupt: UIO[Nothing]

     Returns an effect that is interrupted as if by the fiber calling this method.

109.  def interruptAs(fiberId: ⇒ Id): UIO[Nothing]

     Returns an effect that is interrupted as if by the specified fiber.

110.  def interruptible[R, E, A](zio: ZIO[R, E, A]): ZIO[R, E, A]

     Prefix form of ZIO#interruptible.

111.  def interruptibleMask[R, E, A](k: (InterruptStatusRestore) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

     Makes the effect interruptible, but passes it a restore function that can be used to restore the inherited interruptibility from whatever region the effect is composed into.

112.  final def isInstanceOf[T0]: Boolean

     Definition Classes

     Any

113.  def iterate[R, E, S](initial: S)(cont: (S) ⇒ Boolean)(body: (S) ⇒ ZIO[R, E, S]): ZIO[R, E, S]

     Iterates with the specified effectual function.

     Iterates with the specified effectual function. The moral equivalent of:

     var s = initial
     
     while (cont(s)) {
       s = body(s)
     }
     
     s

114.  def left[A](a: ⇒ A): UIO[Either[A, Nothing]]

     Returns an effect with the value on the left part.

115.  def lock[R, E, A](executor: ⇒ Executor)(zio: ZIO[R, E, A]): ZIO[R, E, A]

     Returns an effect that will execute the specified effect fully on the provided executor, before returning to the default executor.

     Returns an effect that will execute the specified effect fully on the provided executor, before returning to the default executor. See ZIO!.lock.

116.  def loop[R, E, A, S](initial: S)(cont: (S) ⇒ Boolean, inc: (S) ⇒ S)(body: (S) ⇒ ZIO[R, E, A]): ZIO[R, E, List[A]]

     Loops with the specified effectual function, collecting the results into a list.

     Loops with the specified effectual function, collecting the results into a list. The moral equivalent of:

     var s  = initial
     var as = List.empty[A]
     
     while (cont(s)) {
       as = body(s) :: as
       s  = inc(s)
     }
     
     as.reverse

117.  def loop_[R, E, S](initial: S)(cont: (S) ⇒ Boolean, inc: (S) ⇒ S)(body: (S) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

     Loops with the specified effectual function purely for its effects.

     Loops with the specified effectual function purely for its effects. The moral equivalent of:

     var s = initial
     
     while (cont(s)) {
       body(s)
       s = inc(s)
     }

118.  def mapN[R, E, A, B, C, D, F](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C], zio4: ZIO[R, E, D])(f: (A, B, C, D) ⇒ F): ZIO[R, E, F]

     Sequentially zips the specified effects using the specified combiner function.

119.  def mapN[R, E, A, B, C, D](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C])(f: (A, B, C) ⇒ D): ZIO[R, E, D]

     Sequentially zips the specified effects using the specified combiner function.

120.  def mapN[R, E, A, B, C](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B])(f: (A, B) ⇒ C): ZIO[R, E, C]

     Sequentially zips the specified effects using the specified combiner function.

121.  def mapParN[R, E, A, B, C, D, F](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C], zio4: ZIO[R, E, D])(f: (A, B, C, D) ⇒ F): ZIO[R, E, F]

     Returns an effect that executes the specified effects in parallel, combining their results with the specified f function.

     Returns an effect that executes the specified effects in parallel, combining their results with the specified f function. If any effect fails, then the other effects will be interrupted.

122.  def mapParN[R, E, A, B, C, D](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C])(f: (A, B, C) ⇒ D): ZIO[R, E, D]

     Returns an effect that executes the specified effects in parallel, combining their results with the specified f function.

     Returns an effect that executes the specified effects in parallel, combining their results with the specified f function. If any effect fails, then the other effects will be interrupted.

123.  def mapParN[R, E, A, B, C](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B])(f: (A, B) ⇒ C): ZIO[R, E, C]

     Returns an effect that executes the specified effects in parallel, combining their results with the specified f function.

     Returns an effect that executes the specified effects in parallel, combining their results with the specified f function. If any effect fails, then the other effects will be interrupted.

124.  def memoize[R, E, A, B](f: (A) ⇒ ZIO[R, E, B]): UIO[(A) ⇒ ZIO[R, E, B]]

     Returns a memoized version of the specified effectual function.

125.  def mergeAll[R, E, A, B](in: Iterable[ZIO[R, E, A]])(zero: B)(f: (B, A) ⇒ B): ZIO[R, E, B]

     Merges an Iterable[IO] to a single IO, working sequentially.

126.  def mergeAllPar[R, E, A, B](in: Iterable[ZIO[R, E, A]])(zero: B)(f: (B, A) ⇒ B): ZIO[R, E, B]

     Merges an Iterable[IO] to a single IO, working in parallel.

     Merges an Iterable[IO] to a single IO, working in parallel.

     Due to the parallel nature of this combinator, f must be both: - commutative: f(a, b) == f(b, a) - associative: f(a, f(b, c)) == f(f(a, b), c)

     It's unsafe to execute side effects inside f, as f may be executed more than once for some of in elements during effect execution.

127.  def mergeAllParN[R, E, A, B](n: Int)(in: Iterable[ZIO[R, E, A]])(zero: B)(f: (B, A) ⇒ B): ZIO[R, E, B]

     Merges an Iterable[IO] to a single IO, working in with up to n fibers in parallel.

     Merges an Iterable[IO] to a single IO, working in with up to n fibers in parallel.

     Due to the parallel nature of this combinator, f must be both: - commutative: f(a, b) == f(b, a) - associative: f(a, f(b, c)) == f(f(a, b), c)

     It's unsafe to execute side effects inside f, as f may be executed more than once for some of in elements during effect execution.

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

     Definition Classes

     AnyRef

129.  val never: UIO[Nothing]

     Returns a effect that will never produce anything.

     Returns a effect that will never produce anything. The moral equivalent of while(true) {}, only without the wasted CPU cycles. Fibers that suspended running this effect are automatically garbage collected on the JVM, because they cannot be reactivated.

130.  val none: UIO[Option[Nothing]]

     Returns an effect with the empty value.

131.  final def notify(): Unit

     Definition Classes

     AnyRef

     Annotations

     @native()

132.  final def notifyAll(): Unit

     Definition Classes

     AnyRef

     Annotations

     @native()

133.  def partition[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, Nothing, (List[E], List[B])]

     Feeds elements of type A to a function f that returns an effect.

     Feeds elements of type A to a function f that returns an effect. Collects all successes and failures in a tupled fashion.

134.  def partitionPar[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, Nothing, (List[E], List[B])]

     Feeds elements of type A to a function f that returns an effect.

     Feeds elements of type A to a function f that returns an effect. Collects all successes and failures in parallel and returns the result as a tuple.

135.  def partitionParN[R, E, A, B](n: Int)(in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, Nothing, (List[E], List[B])]

     Feeds elements of type A to a function f that returns an effect.

     Feeds elements of type A to a function f that returns an effect. Collects all successes and failures in parallel and returns the result as a tuple.

     Unlike partitionPar, this method will use at most up to n fibers.

136.  def provide[R, E, A](r: ⇒ R): (ZIO[R, E, A]) ⇒ IO[E, A]

     Given an environment R, returns a function that can supply the environment to programs that require it, removing their need for any specific environment.

     Given an environment R, returns a function that can supply the environment to programs that require it, removing their need for any specific environment.

     This is similar to dependency injection, and the provide function can be thought of as inject.

137.  def raceAll[R, R1 <: R, E, A](zio: ZIO[R, E, A], ios: Iterable[ZIO[R1, E, A]]): ZIO[R1, E, A]

     Races an IO[E, A] against zero or more other effects.

     Races an IO[E, A] against zero or more other effects. Yields either the first success or the last failure.

138.  def reduceAll[R, R1 <: R, E, A](a: ZIO[R, E, A], as: Iterable[ZIO[R1, E, A]])(f: (A, A) ⇒ A): ZIO[R1, E, A]

     Reduces an Iterable[IO] to a single IO, working sequentially.

139.  def reduceAllPar[R, R1 <: R, E, A](a: ZIO[R, E, A], as: Iterable[ZIO[R1, E, A]])(f: (A, A) ⇒ A): ZIO[R1, E, A]

     Reduces an Iterable[IO] to a single IO, working in parallel.

140.  def reduceAllParN[R, R1 <: R, E, A](n: Int)(a: ZIO[R, E, A], as: Iterable[ZIO[R1, E, A]])(f: (A, A) ⇒ A): ZIO[R1, E, A]

     Reduces an Iterable[IO] to a single IO, working in up to n fibers in parallel.

141.  def replicate[R, E, A](n: Int)(effect: ZIO[R, E, A]): Iterable[ZIO[R, E, A]]

     Replicates the given effect n times.

     Replicates the given effect n times. If 0 or negative numbers are given, an empty Iterable will be returned. This method is more efficient than using List.fill or similar methods, because the returned Iterable consumes only a small amount of heap regardless of n.

142.  def require[R, E, A](error: ⇒ E): (ZIO[R, E, Option[A]]) ⇒ ZIO[R, E, A]

     Requires that the given ZIO[R, E, Option[A]] contain a value.

     Requires that the given ZIO[R, E, Option[A]] contain a value. If there is no value, then the specified error will be raised.

143.  def reserve[R, E, A, B](reservation: ZIO[R, E, Reservation[R, E, A]])(use: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, B]

     Acquires a resource, uses the resource, and then releases the resource.

     Acquires a resource, uses the resource, and then releases the resource. However, unlike bracket, the separation of these phases allows the acquisition to be interruptible.

     Useful for concurrent data structures and other cases where the 'deallocator' can tell if the allocation succeeded or not just by inspecting internal / external state.

144.  def right[B](b: ⇒ B): UIO[Either[Nothing, B]]

     Returns an effect with the value on the right part.

145.  def runtime[R]: URIO[R, Runtime[R]]

     Returns an effect that accesses the runtime, which can be used to (unsafely) execute tasks.

     Returns an effect that accesses the runtime, which can be used to (unsafely) execute tasks. This is useful for integration with legacy code that must call back into ZIO code.

146.  def scopeWith[R, E, A](f: (ZScope[Exit[Any, Any]]) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

     Passes the fiber's scope to the specified function, which creates an effect that will be returned from this method.

147.  def second[A, B]: URIO[(A, B), B]

     Returns an effectful function that extracts out the second element of a tuple.

148.  def service[A](implicit arg0: zio.Tag[A]): URIO[Has[A], A]

     Accesses the specified service in the environment of the effect.

149.  def services[A, B, C, D](implicit arg0: zio.Tag[A], arg1: zio.Tag[B], arg2: zio.Tag[C], arg3: zio.Tag[D]): URIO[Has[A] with Has[B] with Has[C] with Has[D], (A, B, C, D)]

     Accesses the specified services in the environment of the effect.

150.  def services[A, B, C](implicit arg0: zio.Tag[A], arg1: zio.Tag[B], arg2: zio.Tag[C]): URIO[Has[A] with Has[B] with Has[C], (A, B, C)]

     Accesses the specified services in the environment of the effect.

151.  def services[A, B](implicit arg0: zio.Tag[A], arg1: zio.Tag[B]): URIO[Has[A] with Has[B], (A, B)]

     Accesses the specified services in the environment of the effect.

152.  def sleep(duration: ⇒ Duration): URIO[Clock, Unit]

     Returns an effect that suspends for the specified duration.

     Returns an effect that suspends for the specified duration. This method is asynchronous, and does not actually block the fiber executing the effect.

153.  def some[A](a: ⇒ A): UIO[Option[A]]

     Returns an effect with the optional value.

154.  def succeed[A](a: ⇒ A): UIO[A]

     Returns an effect that models success with the specified value.

155.  def swap[A, B]: URIO[(A, B), (B, A)]

     Returns an effectful function that merely swaps the elements in a Tuple2.

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

     Definition Classes

     AnyRef

157.  def toString(): String

     Definition Classes

     AnyRef → Any

158.  def trace: UIO[ZTrace]

     Capture ZIO trace at the current point

159.  def traced[R, E, A](zio: ZIO[R, E, A]): ZIO[R, E, A]

     Prefix form of ZIO#traced.

160.  def transplant[R, E, A](f: (Grafter) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

     Transplants specified effects so that when those effects fork other effects, the forked effects will be governed by the scope of the fiber that executes this effect.

     Transplants specified effects so that when those effects fork other effects, the forked effects will be governed by the scope of the fiber that executes this effect.

     This can be used to "graft" deep grandchildren onto a higher-level scope, effectively extending their lifespans into the parent scope.

161.  def tupled[R, E, A, B, C, D](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C], zio4: ZIO[R, E, D]): ZIO[R, E, (A, B, C, D)]

     Sequentially zips the specified effects.

     Sequentially zips the specified effects. Specialized version of mapN.

162.  def tupled[R, E, A, B, C](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C]): ZIO[R, E, (A, B, C)]

     Sequentially zips the specified effects.

     Sequentially zips the specified effects. Specialized version of mapN.

163.  def tupled[R, E, A, B](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B]): ZIO[R, E, (A, B)]

     Sequentially zips the specified effects.

     Sequentially zips the specified effects. Specialized version of mapN.

164.  def tupledPar[R, E, A, B, C, D](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C], zio4: ZIO[R, E, D]): ZIO[R, E, (A, B, C, D)]

     Zips the specified effects in parallel.

     Zips the specified effects in parallel. Specialized version of mapParN.

165.  def tupledPar[R, E, A, B, C](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B], zio3: ZIO[R, E, C]): ZIO[R, E, (A, B, C)]

     Zips the specified effects in parallel.

     Zips the specified effects in parallel. Specialized version of mapParN.

166.  def tupledPar[R, E, A, B](zio1: ZIO[R, E, A], zio2: ZIO[R, E, B]): ZIO[R, E, (A, B)]

     Zips the specified effects in parallel.

     Zips the specified effects in parallel. Specialized version of mapParN.

167.  def uninterruptible[R, E, A](zio: ZIO[R, E, A]): ZIO[R, E, A]

     Prefix form of ZIO#uninterruptible.

168.  def uninterruptibleMask[R, E, A](k: (InterruptStatusRestore) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

     Makes the effect uninterruptible, but passes it a restore function that can be used to restore the inherited interruptibility from whatever region the effect is composed into.

169.  val unit: UIO[Unit]

     An effect that succeeds with a unit value.

170.  def unless[R, E](b: ⇒ Boolean)(zio: ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

     The moral equivalent of if (!p) exp

171.  def unlessM[R, E](b: ZIO[R, E, Boolean]): UnlessM[R, E]

     The moral equivalent of if (!p) exp when p has side-effects

172.  def unsandbox[R, E, A](v: ZIO[R, Cause[E], A]): ZIO[R, E, A]

     The inverse operation IO.sandboxed

     The inverse operation IO.sandboxed

     Terminates with exceptions on the Left side of the Either error, if it exists. Otherwise extracts the contained IO[E, A]

173.  def untraced[R, E, A](zio: ZIO[R, E, A]): ZIO[R, E, A]

     Prefix form of ZIO#untraced.

174.  def validate[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, ::[E], List[B]]

     Feeds elements of type A to f and accumulates all errors in error channel or successes in success channel.

     Feeds elements of type A to f and accumulates all errors in error channel or successes in success channel.

     This combinator is lossy meaning that if there are errors all successes will be lost. To retain all information please use partition.

175.  def validateFirst[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, List[E], B]

     Feeds elements of type A to f until it succeeds.

     Feeds elements of type A to f until it succeeds. Returns first success or the accumulation of all errors.

176.  def validateFirstPar[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, List[E], B]

     Feeds elements of type A to f, in parallel, until it succeeds.

     Feeds elements of type A to f, in parallel, until it succeeds. Returns first success or the accumulation of all errors.

     In case of success all other running fibers are terminated.

177.  def validatePar[R, E, A, B](in: Iterable[A])(f: (A) ⇒ ZIO[R, E, B])(implicit ev: CanFail[E]): ZIO[R, ::[E], List[B]]

     Feeds elements of type A to f and accumulates, in parallel, all errors in error channel or successes in success channel.

     Feeds elements of type A to f and accumulates, in parallel, all errors in error channel or successes in success channel.

     This combinator is lossy meaning that if there are errors all successes will be lost. To retain all information please use partitionPar.

178.  final def wait(): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     Definition Classes

     AnyRef

     Annotations

     @throws( ... ) @native()

181.  def when[R, E](b: ⇒ Boolean)(zio: ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

     The moral equivalent of if (p) exp

182.  def whenCase[R, E, A](a: ⇒ A)(pf: PartialFunction[A, ZIO[R, E, Any]]): ZIO[R, E, Unit]

     Runs an effect when the supplied PartialFunction matches for the given value, otherwise does nothing.

183.  def whenCaseM[R, E, A](a: ZIO[R, E, A])(pf: PartialFunction[A, ZIO[R, E, Any]]): ZIO[R, E, Unit]

     Runs an effect when the supplied PartialFunction matches for the given effectful value, otherwise does nothing.

184.  def whenM[R, E](b: ZIO[R, E, Boolean]): WhenM[R, E]

     The moral equivalent of if (p) exp when p has side-effects

185.  def withChildren[R, E, A](get: (UIO[Chunk[Fiber.Runtime[Any, Any]]]) ⇒ ZIO[R, E, A]): ZIO[R, E, A]

     Locally installs a supervisor and an effect that succeeds with all the children that have been forked in the returned effect.

186.  val yieldNow: UIO[Unit]

     Returns an effect that yields to the runtime system, starting on a fresh stack.

     Returns an effect that yields to the runtime system, starting on a fresh stack. Manual use of this method can improve fairness, at the cost of overhead.

187.  object CanFilter