RIO

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def _1[R, A, B](implicit ev: <:<[R, (A, B)]): RIO[R, A]

final def _2[R, A, B](implicit ev: <:<[R, (A, B)]): RIO[R, B]

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

final def access[R]: AccessPartiallyApplied[R]

final def accessM[R]: AccessMPartiallyApplied[R]

final def allowInterrupt: UIO[Unit]

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

final def asInstanceOf[T0]: T0

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

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

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

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

final def checkDaemon[R, A](f: (DaemonStatus) ⇒ RIO[R, A]): RIO[R, A]

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

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

final def children: UIO[Iterable[Fiber[Any, Any]]]

def clone(): AnyRef

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

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

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

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

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

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

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

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

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

final def descriptor: UIO[Descriptor]

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

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

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

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

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

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

final def effectAsyncInterrupt[R, A](register: ((RIO[R, A]) ⇒ Unit) ⇒ Either[Canceler[R], RIO[R, A]], blockingOn: List[Id] = Nil): RIO[R, A]

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

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

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

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

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

final def effectSuspendTotalWith[R, A](p: (Platform) ⇒ RIO[R, A]): RIO[R, A]

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

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

final val fiberId: UIO[Id]

def finalize(): Unit

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

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

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

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

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

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

final 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: Iterable[A])(f: (A) ⇒ RIO[R, Any]): RIO[R, Unit]

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

final def forkAll[R, A](as: Iterable[RIO[R, A]]): ZIO[R, Nothing, Fiber[Throwable, List[A]]]

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

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

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

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

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

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

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

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

final def fromOption[A](v: ⇒ Option[A]): IO[Unit, A]

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

final def getClass(): Class[_]

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

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

def hashCode(): Int

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

final val interrupt: UIO[Nothing]

final def interruptAs(fiberId: Id): UIO[Nothing]

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

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

final def isInstanceOf[T0]: Boolean

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

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

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

final 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

final val never: UIO[Nothing]

final val none: UIO[Option[Nothing]]

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

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

final def require[A](error: Throwable): (IO[Throwable, Option[A]]) ⇒ IO[Throwable, A]

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

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

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

See zio.ZIO.sequence

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

See zio.ZIO.sequencePar

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

See zio.ZIO.sequenceParN

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

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

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

final def swap[R, A, B](implicit ev: <:<[R, (A, B)]): RIO[R, (B, A)]

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

def toString(): String

final def trace: UIO[ZTrace]

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

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

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

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

Alias for ZIO.foreachParN

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

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

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

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

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

final val unit: UIO[Unit]

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

final 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

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

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

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

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

final val yieldNow: UIO[Unit]

final def succeedLazy[A](a: ⇒ A): UIO[A]

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

final def suspendWith[R, A](p: (Platform) ⇒ RIO[R, A]): RIO[R, A]