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 accessM[R]: AccessMPartiallyApplied[R]

def allowInterrupt: UIO[Unit]

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

final def asInstanceOf[T0]: T0

val awaitAllChildren: UIO[Unit]

def bracket[R, A, B](acquire: RIO[R, A], release: (A) ⇒ ZIO[R, Nothing, 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]) ⇒ ZIO[R, Nothing, Any], use: (A) ⇒ RIO[R, B]): RIO[R, B]

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

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 children: UIO[Iterable[Fiber[Any, Any]]]

def clone(): AnyRef

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

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

def collectAllParN[R, A](n: Int)(as: Iterable[RIO[R, A]]): RIO[R, List[A]]

def collectAllSuccesses[R, A](in: Iterable[RIO[R, A]]): RIO[R, List[A]]

def collectAllSuccessesPar[R, A](as: Iterable[RIO[R, A]]): RIO[R, List[A]]

def collectAllSuccessesParN[E, A](n: Int)(as: Iterable[RIO[E, A]]): RIO[E, List[A]]

def collectAllWith[R, A, B](in: Iterable[RIO[R, A]])(f: PartialFunction[A, B]): RIO[R, List[B]]

def collectAllWithPar[R, A, B](as: Iterable[RIO[R, A]])(f: PartialFunction[A, B]): RIO[R, List[B]]

def collectAllWithParN[R, A, B](n: Int)(as: Iterable[RIO[R, A]])(f: PartialFunction[A, B]): RIO[R, List[B]]

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 disown(fiber: Fiber[Any, Any]): UIO[Boolean]

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

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

def effectAsync[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Unit, blockingOn: List[Id] = Nil): RIO[R, A]

def effectAsyncInterrupt[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Either[Canceler[R], RIO[R, A]], blockingOn: List[Id] = Nil): 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: List[Id] = Nil): RIO[R, 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](p: (Platform, Id) ⇒ RIO[R, A]): RIO[R, A]

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

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

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

def environment[R]: ZIO[R, Nothing, R]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

val fiberId: UIO[Id]

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

def finalize(): Unit

def first[A, B]: RIO[(A, B), A]

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]

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

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

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

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

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

def foreachParN[R, A, B](n: Int)(as: Iterable[A])(fn: (A) ⇒ RIO[R, B]): RIO[R, List[B]]

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

final def foreachPar_[R, A, B](as: Chunk[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]

final def foreach_[R, A](as: Chunk[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]]): ZIO[R, Nothing, Fiber[Throwable, List[A]]]

def forkAll_[R, A](as: Iterable[RIO[R, A]]): ZIO[R, Nothing, Unit]

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

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

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

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

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

def fromFunctionM[R, A](f: (R) ⇒ Task[A]): RIO[R, 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[_]

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

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

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

def hashCode(): Int

def identity[R]: RIO[R, R]

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

val infinity: URIO[Clock, Nothing]

val interrupt: UIO[Nothing]

def interruptAllChildren: UIO[Unit]

def interruptAs(fiberId: ⇒ Id): 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 lock[R, A](executor: ⇒ Executor)(taskr: RIO[R, A]): RIO[R, A]

def loop[R, A, S](initial: S)(cont: (S) ⇒ Boolean, inc: (S) ⇒ S)(body: (S) ⇒ RIO[R, A]): RIO[R, List[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]

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

def mapParN[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 mapParN[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]

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

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]]

final def notify(): Unit

final def notifyAll(): Unit

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

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

def partitionParN[R, A, B](n: Int)(in: Iterable[A])(f: (A) ⇒ RIO[R, B]): RIO[Nothing, (List[Throwable], List[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 require[A](error: ⇒ Throwable): (IO[Throwable, Option[A]]) ⇒ IO[Throwable, A]

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]]

def second[A, B]: RIO[(A, B), B]

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

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

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

def swap[A, B]: RIO[(A, B), (B, 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 unsandbox[R, A](v: IO[Cause[Throwable], A]): RIO[R, A]

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def when[R](b: ⇒ Boolean)(rio: RIO[R, Any]): RIO[R, Unit]

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

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

def whenM[R](b: RIO[R, Boolean])(rio: RIO[R, Any]): RIO[R, Unit]

val yieldNow: UIO[Unit]

def sequence[R, A](in: Iterable[RIO[R, A]]): RIO[R, List[A]]

See zio.ZIO.sequence

def sequencePar[R, A](as: Iterable[RIO[R, A]]): RIO[R, List[A]]

See zio.ZIO.sequencePar

def sequenceParN[R, A](n: Int)(as: Iterable[RIO[R, A]]): RIO[R, List[A]]

See zio.ZIO.sequenceParN

def traverse[R, A, B](in: Iterable[A])(f: (A) ⇒ RIO[R, B]): RIO[R, List[B]]

def traversePar[R, A, B](as: Iterable[A])(fn: (A) ⇒ RIO[R, B]): RIO[R, List[B]]

def traverseParN[R, A, B](n: Int)(as: Iterable[A])(fn: (A) ⇒ RIO[R, B]): RIO[R, List[B]]

Alias for ZIO.foreachParN

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

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

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