RIO

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def absolve[R, A](v: ⇒ RIO[R, Either[Throwable, A]]): RIO[R, A]

def access[R]: AccessPartiallyApplied[R]

def accessZIO[R]: AccessZIOPartiallyApplied[R]

def acquireReleaseExitWith[R, A, B](acquire: ⇒ RIO[R, A], release: (A, Exit[Throwable, B]) ⇒ URIO[R, Any], use: (A) ⇒ RIO[R, B]): RIO[R, B]

def acquireReleaseExitWith[R, A](acquire: ⇒ RIO[R, A]): BracketExitAcquire[R, Throwable, A]

def acquireReleaseWith[R, A, B](acquire: ⇒ RIO[R, A], release: (A) ⇒ URIO[R, Any], use: (A) ⇒ RIO[R, B]): RIO[R, B]

def acquireReleaseWith[R, A](acquire: ⇒ RIO[R, A]): BracketAcquire[R, Throwable, A]

def allowInterrupt: UIO[Unit]

def apply[A](a: ⇒ A): Task[A]

final def asInstanceOf[T0]: T0

def async[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Any, blockingOn: ⇒ FiberId = FiberId.None): RIO[R, A]

def asyncInterrupt[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Either[Canceler[R], RIO[R, A]], blockingOn: ⇒ FiberId = FiberId.None): RIO[R, A]

def asyncMaybe[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Option[RIO[R, A]], blockingOn: ⇒ FiberId = FiberId.None): RIO[R, A]

def asyncZIO[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ RIO[R, Any]): RIO[R, A]

def attempt[A](effect: ⇒ A): Task[A]

def attemptBlocking[A](effect: ⇒ A): Task[A]

def attemptBlockingCancelable[A](effect: ⇒ A)(cancel: ⇒ UIO[Any]): Task[A]

def attemptBlockingInterrupt[A](effect: ⇒ A): Task[A]

def blocking[R, A](zio: ⇒ RIO[R, A]): RIO[R, A]

def blockingExecutor: UIO[Executor]

def checkInterruptible[R, A](f: (InterruptStatus) ⇒ RIO[R, A]): RIO[R, A]

def checkTraced[R, A](f: (TracingStatus) ⇒ RIO[R, A]): RIO[R, A]

def clone(): AnyRef

def collect[R, Key, Key2, Value, Value2](map: Map[Key, Value])(f: (Key, Value) ⇒ ZIO[R, Option[Throwable], (Key2, Value2)]): RIO[R, Map[Key2, Value2]]

def collect[R, A, B, Collection[+Element] <: Iterable[Element]](in: Collection[A])(f: (A) ⇒ ZIO[R, Option[Throwable], B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def collectAll[R, A](in: NonEmptyChunk[RIO[R, A]]): RIO[R, NonEmptyChunk[A]]

def collectAll[R, A](in: Option[RIO[R, A]]): RIO[R, Option[A]]

def collectAll[R, A](in: Array[RIO[R, A]])(implicit arg0: ClassTag[A]): RIO[R, Array[A]]

def collectAll[R, A](in: Set[RIO[R, A]]): RIO[R, Set[A]]

def collectAll[R, A, Collection[+Element] <: Iterable[Element]](in: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): RIO[R, Collection[A]]

def collectAllDiscard[R, A](in: ⇒ Iterable[RIO[R, A]]): RIO[R, Unit]

def collectAllPar[R, A](as: NonEmptyChunk[RIO[R, A]]): RIO[R, NonEmptyChunk[A]]

def collectAllPar[R, A](as: Array[RIO[R, A]])(implicit arg0: ClassTag[A]): RIO[R, Array[A]]

def collectAllPar[R, A](as: Set[RIO[R, A]]): RIO[R, Set[A]]

def collectAllPar[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): RIO[R, Collection[A]]

def collectAllParDiscard[R, A](in: ⇒ Iterable[RIO[R, A]]): RIO[R, Unit]

def collectAllParN[R, A, Collection[+Element] <: Iterable[Element]](n: ⇒ Int)(as: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): RIO[R, Collection[A]]

def collectAllParNDiscard[R, A](n: ⇒ Int)(as: ⇒ Iterable[RIO[R, A]]): RIO[R, Unit]

def collectAllSuccesses[R, A, Collection[+Element] <: Iterable[Element]](in: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): RIO[R, Collection[A]]

def collectAllSuccessesPar[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): URIO[R, Collection[A]]

def collectAllSuccessesParN[R, A, Collection[+Element] <: Iterable[Element]](n: ⇒ Int)(as: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): URIO[R, Collection[A]]

def collectAllWith[R, A, B, Collection[+Element] <: Iterable[Element]](in: Collection[RIO[R, A]])(f: PartialFunction[A, B])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], B, Collection[B]]): RIO[R, Collection[B]]

def collectAllWithPar[R, A, B, Collection[+Element] <: Iterable[Element]](as: Collection[RIO[R, A]])(f: PartialFunction[A, B])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], B, Collection[B]]): RIO[R, Collection[B]]

def collectAllWithParN[R, A, B, Collection[+Element] <: Iterable[Element]](n: ⇒ Int)(as: Collection[RIO[R, A]])(f: PartialFunction[A, B])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], B, Collection[B]]): RIO[R, Collection[B]]

def collectFirst[R, A, B](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Option[B]]): RIO[R, Option[B]]

def collectPar[R, Key, Key2, Value, Value2](map: Map[Key, Value])(f: (Key, Value) ⇒ ZIO[R, Option[Throwable], (Key2, Value2)]): RIO[R, Map[Key2, Value2]]

def collectPar[R, A, B, Collection[+Element] <: Iterable[Element]](in: Collection[A])(f: (A) ⇒ ZIO[R, Option[Throwable], B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def collectParN[R, A, B, Collection[+Element] <: Iterable[Element]](n: ⇒ Int)(in: Collection[A])(f: (A) ⇒ ZIO[R, Option[Throwable], B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def cond[A](predicate: ⇒ Boolean, result: ⇒ A, error: ⇒ Throwable): Task[A]

def debug(value: ⇒ Any): UIO[Unit]

def descriptor: UIO[Descriptor]

def descriptorWith[R, A](f: (Descriptor) ⇒ RIO[R, A]): RIO[R, A]

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

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

def done[A](r: ⇒ Exit[Throwable, A]): Task[A]

def environment[R]: URIO[R, R]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def executor: UIO[Executor]

def exists[R, A](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Boolean]): RIO[R, Boolean]

def fail(error: ⇒ Throwable): Task[Nothing]

def failCause(cause: ⇒ Cause[Throwable]): Task[Nothing]

def failCauseWith[R](function: (() ⇒ ZTrace) ⇒ Cause[Throwable]): RIO[R, Nothing]

val fiberId: UIO[FiberId]

def filter[R, A](as: Set[A])(f: (A) ⇒ RIO[R, Boolean]): RIO[R, Set[A]]

def filter[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[A])(f: (A) ⇒ RIO[R, Boolean])(implicit bf: zio.BuildFrom[Collection[A], A, Collection[A]]): RIO[R, Collection[A]]

def filterNot[R, A](as: Set[A])(f: (A) ⇒ RIO[R, Boolean]): RIO[R, Set[A]]

def filterNot[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[A])(f: (A) ⇒ RIO[R, Boolean])(implicit bf: zio.BuildFrom[Collection[A], A, Collection[A]]): RIO[R, Collection[A]]

def filterNotPar[R, A](as: Set[A])(f: (A) ⇒ RIO[R, Boolean]): RIO[R, Set[A]]

def filterNotPar[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[A])(f: (A) ⇒ RIO[R, Boolean])(implicit bf: zio.BuildFrom[Collection[A], A, Collection[A]]): RIO[R, Collection[A]]

def filterPar[R, A](as: Set[A])(f: (A) ⇒ RIO[R, Boolean]): RIO[R, Set[A]]

def filterPar[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[A])(f: (A) ⇒ RIO[R, Boolean])(implicit bf: zio.BuildFrom[Collection[A], A, Collection[A]]): RIO[R, Collection[A]]

def finalize(): Unit

def firstSuccessOf[R, A](rio: ⇒ RIO[R, A], rest: ⇒ Iterable[RIO[R, A]]): RIO[R, A]

def flatten[R, A](taskr: ⇒ RIO[R, RIO[R, A]]): RIO[R, A]

def foldLeft[R, S, A](in: ⇒ Iterable[A])(zero: ⇒ S)(f: (S, A) ⇒ RIO[R, S]): RIO[R, S]

def foldRight[R, S, A](in: ⇒ Iterable[A])(zero: ⇒ S)(f: (A, S) ⇒ RIO[R, S]): RIO[R, S]

def forall[R, A](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Boolean]): RIO[R, Boolean]

def foreach[R, A, B](in: NonEmptyChunk[A])(f: (A) ⇒ RIO[R, B]): RIO[R, NonEmptyChunk[B]]

def foreach[R, A, B](in: Option[A])(f: (A) ⇒ RIO[R, B]): RIO[R, Option[B]]

def foreach[R, Key, Key2, Value, Value2](map: Map[Key, Value])(f: (Key, Value) ⇒ RIO[R, (Key2, Value2)]): RIO[R, Map[Key2, Value2]]

def foreach[R, A, B](in: Array[A])(f: (A) ⇒ RIO[R, B])(implicit arg0: ClassTag[B]): RIO[R, Array[B]]

def foreach[R, A, B](in: Set[A])(f: (A) ⇒ RIO[R, B]): RIO[R, Set[B]]

def foreach[R, A, B, Collection[+Element] <: Iterable[Element]](in: Collection[A])(f: (A) ⇒ RIO[R, B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def foreachDiscard[R, A](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

final def foreachExec[R, A, B, Collection[+Element] <: Iterable[Element]](as: Collection[A])(exec: ⇒ ExecutionStrategy)(f: (A) ⇒ RIO[R, B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def foreachPar[R, A, B](as: NonEmptyChunk[A])(fn: (A) ⇒ RIO[R, B]): RIO[R, NonEmptyChunk[B]]

def foreachPar[R, Key, Key2, Value, Value2](map: Map[Key, Value])(f: (Key, Value) ⇒ RIO[R, (Key2, Value2)]): RIO[R, Map[Key2, Value2]]

def foreachPar[R, A, B](as: Array[A])(fn: (A) ⇒ RIO[R, B])(implicit arg0: ClassTag[B]): RIO[R, Array[B]]

def foreachPar[R, A, B](as: Set[A])(fn: (A) ⇒ RIO[R, B]): RIO[R, Set[B]]

def foreachPar[R, A, B, Collection[+Element] <: Iterable[Element]](as: Collection[A])(fn: (A) ⇒ RIO[R, B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def foreachParDiscard[R, A, B](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

def foreachParN[R, A, B, Collection[+Element] <: Iterable[Element]](n: ⇒ Int)(as: Collection[A])(fn: (A) ⇒ RIO[R, B])(implicit bf: zio.BuildFrom[Collection[A], B, Collection[B]]): RIO[R, Collection[B]]

def foreachParNDiscard[R, A, B](n: ⇒ Int)(as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

def forkAll[R, A, Collection[+Element] <: Iterable[Element]](as: Collection[RIO[R, A]])(implicit bf: zio.BuildFrom[Collection[RIO[R, A]], A, Collection[A]]): URIO[R, Fiber[Throwable, Collection[A]]]

def forkAllDiscard[R, A](as: ⇒ Iterable[RIO[R, A]]): URIO[R, Unit]

def from[Input](input: ⇒ Input)(implicit constructor: ZIOConstructor[Nothing, Throwable, Input]): ZIO[OutEnvironment, OutError, OutSuccess]

Constructs a RIO value of the appropriate type for the specified input.

def fromEither[A](v: ⇒ Either[Throwable, A]): Task[A]

def fromFiber[A](fiber: ⇒ Fiber[Throwable, A]): Task[A]

def fromFiberZIO[A](fiber: ⇒ Task[Fiber[Throwable, A]]): Task[A]

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

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

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

final def getClass(): Class[_]

def getOrFail[A](v: ⇒ Option[A]): Task[A]

def getState[S](implicit arg0: zio.Tag[S]): ZIO[Has[ZState[S]], Nothing, S]

def getStateWith[S]: GetStateWithPartiallyApplied[S]

def hashCode(): Int

def ifZIO[R](b: ⇒ RIO[R, Boolean]): IfZIO[R, Throwable]

val infinity: URIO[Has[Clock], Nothing]

val interrupt: UIO[Nothing]

def interruptAs(fiberId: ⇒ FiberId): UIO[Nothing]

def interruptible[R, A](taskr: ⇒ RIO[R, A]): RIO[R, A]

def interruptibleMask[R, A](k: (InterruptStatusRestore) ⇒ RIO[R, A]): RIO[R, A]

final def isInstanceOf[T0]: Boolean

def iterate[R, S](initial: ⇒ S)(cont: (S) ⇒ Boolean)(body: (S) ⇒ RIO[R, S]): RIO[R, S]

def left[R, A](a: ⇒ A): RIO[R, Either[A, Nothing]]

def loop[R, A, S](initial: ⇒ S)(cont: (S) ⇒ Boolean, inc: (S) ⇒ S)(body: (S) ⇒ RIO[R, A]): RIO[R, List[A]]

def loopDiscard[R, S](initial: ⇒ S)(cont: (S) ⇒ Boolean, inc: (S) ⇒ S)(body: (S) ⇒ RIO[R, Any]): RIO[R, Unit]

def memoize[R, A, B](f: (A) ⇒ RIO[R, B]): UIO[(A) ⇒ RIO[R, B]]

def mergeAll[R, A, B](in: ⇒ Iterable[RIO[R, A]])(zero: ⇒ B)(f: (B, A) ⇒ B): RIO[R, B]

def mergeAllPar[R, A, B](in: ⇒ Iterable[RIO[R, A]])(zero: ⇒ B)(f: (B, A) ⇒ B): RIO[R, B]

final def ne(arg0: AnyRef): Boolean

val never: UIO[Nothing]

val none: UIO[Option[Nothing]]

def noneOrFail(o: ⇒ Option[Throwable]): RIO[Nothing, Unit]

def noneOrFailWith[O](o: ⇒ Option[O])(f: (O) ⇒ Throwable): RIO[Nothing, Unit]

def not[R](effect: ⇒ RIO[R, Boolean]): RIO[R, Boolean]

final def notify(): Unit

final def notifyAll(): Unit

def onExecutor[R, A](executor: ⇒ Executor)(taskr: RIO[R, A]): RIO[R, A]

def partition[R, A, B](in: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, B]): RIO[R, (Iterable[Throwable], Iterable[B])]

def partitionPar[R, A, B](in: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, B]): RIO[R, (Iterable[Throwable], Iterable[B])]

def partitionParN[R, A, B](n: ⇒ Int)(in: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, B]): RIO[R, (Iterable[Throwable], Iterable[B])]

def provide[R, A](r: ⇒ R): (RIO[R, A]) ⇒ Task[A]

def raceAll[R, R1 <: R, A](taskr: ⇒ RIO[R, A], taskrs: ⇒ Iterable[RIO[R1, A]]): RIO[R1, A]

def reduceAll[R, R1 <: R, A](a: ⇒ RIO[R, A], as: ⇒ Iterable[RIO[R1, A]])(f: (A, A) ⇒ A): RIO[R1, A]

def reduceAllPar[R, R1 <: R, A](a: ⇒ RIO[R, A], as: ⇒ Iterable[RIO[R1, A]])(f: (A, A) ⇒ A): RIO[R1, A]

def replicate[R, A](n: ⇒ Int)(effect: ⇒ RIO[R, A]): Iterable[RIO[R, A]]

def replicateZIO[R, A](n: ⇒ Int)(effect: ⇒ RIO[R, A]): RIO[R, Iterable[A]]

def replicateZIODiscard[R, A](n: ⇒ Int)(effect: ⇒ RIO[R, A]): RIO[R, Unit]

def reserve[R, A, B](reservation: ⇒ RIO[R, Reservation[R, Throwable, A]])(use: (A) ⇒ RIO[R, B]): RIO[R, B]

def right[R, B](b: ⇒ B): RIO[R, Either[Nothing, B]]

def runtime[R]: ZIO[R, Nothing, Runtime[R]]

val runtimeConfig: UIO[RuntimeConfig]

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

def serviceAt[Service]: ServiceAtPartiallyApplied[Service]

def serviceWith[Service]: ServiceWithPartiallyApplied[Service]

def setState[S](s: ⇒ S)(implicit arg0: zio.Tag[S]): ZIO[Has[ZState[S]], Nothing, Unit]

def sleep(duration: ⇒ zio.Duration): RIO[Has[Clock], Unit]

def some[R, A](a: ⇒ A): RIO[R, Option[A]]

def succeed[A](a: ⇒ A): UIO[A]

def succeedBlocking[A](a: ⇒ A): UIO[A]

def suspend[R, A](rio: ⇒ RIO[R, A]): RIO[R, A]

def suspendSucceed[R, A](rio: ⇒ RIO[R, A]): RIO[R, A]

def suspendSucceedWith[R, A](p: (RuntimeConfig, FiberId) ⇒ RIO[R, A]): RIO[R, A]

def suspendWith[R, A](p: (RuntimeConfig, FiberId) ⇒ RIO[R, A]): RIO[R, A]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def trace: UIO[ZTrace]

def traced[R, A](zio: ⇒ RIO[R, A]): RIO[R, A]

def uninterruptible[R, A](taskr: ⇒ RIO[R, A]): RIO[R, A]

def uninterruptibleMask[R, A](k: (InterruptStatusRestore) ⇒ RIO[R, A]): RIO[R, A]

val unit: UIO[Unit]

def unless[R, A](b: ⇒ Boolean)(zio: ⇒ RIO[R, A]): RIO[R, Option[A]]

def unlessZIO[R](b: ⇒ RIO[R, Boolean]): UnlessZIO[R, Throwable]

def unsandbox[R, A](v: ⇒ IO[Cause[Throwable], A]): RIO[R, A]

def untraced[R, A](zio: ⇒ RIO[R, A]): RIO[R, A]

def updateState[S](f: (S) ⇒ S)(implicit arg0: zio.Tag[S]): ZIO[Has[ZState[S]], Nothing, Unit]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def when[R, A](b: ⇒ Boolean)(rio: ⇒ RIO[R, A]): RIO[R, Option[A]]

def whenCase[R, A, B](a: ⇒ A)(pf: PartialFunction[A, RIO[R, B]]): RIO[R, Option[B]]

def whenCaseZIO[R, A, B](a: ⇒ RIO[R, A])(pf: PartialFunction[A, RIO[R, B]]): RIO[R, Option[B]]

def whenZIO[R](b: ⇒ RIO[R, Boolean]): WhenZIO[R, Throwable]

def withRuntimeConfig[R, A](runtimeConfig: ⇒ RuntimeConfig)(rio: ⇒ RIO[R, A]): RIO[R, A]

val yieldNow: UIO[Unit]

def bracket[R, A, B](acquire: ⇒ RIO[R, A], release: (A) ⇒ URIO[R, Any], use: (A) ⇒ RIO[R, B]): RIO[R, B]

def bracket[R, A](acquire: ⇒ RIO[R, A]): BracketAcquire[R, Throwable, A]

def bracketExit[R, A, B](acquire: ⇒ RIO[R, A], release: (A, Exit[Throwable, B]) ⇒ URIO[R, Any], use: (A) ⇒ RIO[R, B]): RIO[R, B]

def bracketExit[R, A](acquire: ⇒ RIO[R, A]): BracketExitAcquire[R, Throwable, A]

def collectAllParN_[R, A](n: ⇒ Int)(as: ⇒ Iterable[RIO[R, A]]): RIO[R, Unit]

def collectAllPar_[R, A](in: ⇒ Iterable[RIO[R, A]]): RIO[R, Unit]

def collectAll_[R, A](in: ⇒ Iterable[RIO[R, A]]): RIO[R, Unit]

def effect[A](effect: ⇒ A): Task[A]

def effectAsync[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Any, blockingOn: ⇒ FiberId = FiberId.None): RIO[R, A]

def effectAsyncInterrupt[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Either[Canceler[R], RIO[R, A]], blockingOn: ⇒ FiberId = FiberId.None): RIO[R, A]

def effectAsyncM[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ RIO[R, Any]): RIO[R, A]

def effectAsyncMaybe[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Option[RIO[R, A]], blockingOn: ⇒ FiberId = FiberId.None): RIO[R, A]

def effectBlocking[A](effect: ⇒ A): Task[A]

def effectBlockingCancelable[A](effect: ⇒ A)(cancel: ⇒ UIO[Any]): Task[A]

def effectBlockingInterrupt[A](effect: ⇒ A): Task[A]

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

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

def effectSuspendTotal[R, A](rio: ⇒ RIO[R, A]): RIO[R, A]

def effectSuspendTotalWith[R, A](f: (Platform, Id) ⇒ RIO[R, A]): RIO[R, A]

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

def effectTotal[A](effect: ⇒ A): UIO[A]

def foreachParN_[R, A, B](n: ⇒ Int)(as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

def foreachPar_[R, A, B](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

def foreach_[R, A](as: ⇒ Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

def forkAll_[R, A](as: ⇒ Iterable[RIO[R, A]]): URIO[R, Unit]

def fromFiberM[A](fiber: ⇒ Task[Fiber[Throwable, A]]): Task[A]

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

def fromFunctionM[R, A](f: (R) ⇒ Task[A]): RIO[R, A]

def halt(cause: ⇒ Cause[Throwable]): Task[Nothing]

def haltWith[R](function: (() ⇒ ZTrace) ⇒ Cause[Throwable]): RIO[R, Nothing]

def ifM[R](b: ⇒ RIO[R, Boolean]): IfZIO[R, Throwable]

def lock[R, A](executor: ⇒ Executor)(taskr: ⇒ RIO[R, A]): RIO[R, A]

def loop_[R, S](initial: ⇒ S)(cont: (S) ⇒ Boolean, inc: (S) ⇒ S)(body: (S) ⇒ RIO[R, Any]): RIO[R, Unit]

def mapN[R, A, B, C, D, F](rio1: ⇒ RIO[R, A], rio2: ⇒ RIO[R, B], rio3: ⇒ RIO[R, C], rio4: ⇒ RIO[R, D])(f: (A, B, C, D) ⇒ F): RIO[R, F]

def mapN[R, A, B, C, D](rio1: ⇒ RIO[R, A], rio2: ⇒ RIO[R, B], rio3: ⇒ RIO[R, C])(f: (A, B, C) ⇒ D): RIO[R, D]