Task

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

def allowInterrupt: UIO[Unit]

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

final def asInstanceOf[T0]: T0

val awaitAllChildren: UIO[Unit]

def bracket[A, B](acquire: Task[A], release: (A) ⇒ UIO[Any], use: (A) ⇒ Task[B]): Task[B]

def bracket[A](acquire: Task[A]): BracketAcquire[Any, Throwable, A]

def bracketExit[A, B](acquire: Task[A], release: (A, Exit[Throwable, B]) ⇒ UIO[Any], use: (A) ⇒ Task[B]): Task[B]

def bracketExit[A](acquire: Task[A]): BracketExitAcquire[Any, Throwable, A]

def checkInterruptible[A](f: (InterruptStatus) ⇒ Task[A]): Task[A]

def checkTraced[A](f: (TracingStatus) ⇒ Task[A]): Task[A]

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

def clone(): AnyRef

def collectAll[A](in: Iterable[Task[A]]): Task[List[A]]

def collectAllPar[A](as: Iterable[Task[A]]): Task[List[A]]

def collectAllParN[A](n: Int)(as: Iterable[Task[A]]): Task[List[A]]

def collectAllSuccesses[A](in: Iterable[Task[A]]): Task[List[A]]

def collectAllSuccessesPar[A](as: Iterable[Task[A]]): Task[List[A]]

def collectAllSuccessesParN[A](n: Int)(as: Iterable[Task[A]]): Task[List[A]]

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

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

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

def descriptor: UIO[Descriptor]

def descriptorWith[A](f: (Descriptor) ⇒ Task[A]): Task[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[A](register: ((Task[A]) ⇒ Unit) ⇒ Unit, blockingOn: List[Id] = Nil): Task[A]

def effectAsyncInterrupt[A](register: ((Task[A]) ⇒ Unit) ⇒ Either[Canceler[Any], Task[A]], blockingOn: List[Id] = Nil): Task[A]

def effectAsyncM[A](register: ((Task[A]) ⇒ Unit) ⇒ Task[Any]): Task[A]

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

def effectSuspend[A](task: ⇒ Task[A]): Task[A]

def effectSuspendTotal[A](task: ⇒ Task[A]): Task[A]

def effectSuspendTotalWith[A](p: (Platform, Id) ⇒ Task[A]): Task[A]

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

val fiberId: UIO[Id]

def filter[A](as: Iterable[A])(f: (A) ⇒ Task[Boolean]): Task[List[A]]

def finalize(): Unit

def firstSuccessOf[A](task: Task[A], rest: Iterable[Task[A]]): Task[A]

def flatten[A](task: Task[Task[A]]): Task[A]

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

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

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

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

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

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

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

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

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

final def foreachPar_[A, B](as: Chunk[A])(f: (A) ⇒ Task[Any]): Task[Unit]

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

final def foreach_[A](as: Chunk[A])(f: (A) ⇒ Task[Any]): Task[Unit]

def foreach_[A](as: Iterable[A])(f: (A) ⇒ Task[Any]): Task[Unit]

def forkAll[A](as: Iterable[Task[A]]): UIO[Fiber[Throwable, List[A]]]

def forkAll_[A](as: Iterable[Task[A]]): UIO[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[A](f: (Any) ⇒ A): Task[A]

def fromFunctionFuture[A](f: (Any) ⇒ Future[A]): Task[A]

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

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

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

def haltWith[E <: Throwable](function: (() ⇒ ZTrace) ⇒ Cause[E]): Task[Nothing]

def hashCode(): Int

def identity: Task[Any]

def ifM(b: Task[Boolean]): IfM[Any, Throwable]

val interrupt: UIO[Nothing]

def interruptAllChildren: UIO[Unit]

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

def interruptible[A](task: Task[A]): Task[A]

def interruptibleMask[A](k: (InterruptStatusRestore) ⇒ Task[A]): Task[A]

final def isInstanceOf[T0]: Boolean

def iterate[S](initial: S)(cont: (S) ⇒ Boolean)(body: (S) ⇒ Task[S]): Task[S]

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

def lock[A](executor: ⇒ Executor)(task: Task[A]): Task[A]

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

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

def mapN[A, B, C, D, F](task1: Task[A], task2: Task[B], task3: Task[C], task4: Task[D])(f: (A, B, C, D) ⇒ F): Task[F]

def mapN[A, B, C, D](task1: Task[A], task2: Task[B], task3: Task[C])(f: (A, B, C) ⇒ D): Task[D]

def mapN[A, B, C](task1: Task[A], task2: Task[B])(f: (A, B) ⇒ C): Task[C]

def mapParN[A, B, C, D, F](task1: Task[A], task2: Task[B], task3: Task[C], task4: Task[D])(f: (A, B, C, D) ⇒ F): Task[F]

def mapParN[A, B, C, D](task1: Task[A], task2: Task[B], task3: Task[C])(f: (A, B, C) ⇒ D): Task[D]

def mapParN[A, B, C](task1: Task[A], task2: Task[B])(f: (A, B) ⇒ C): Task[C]

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

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

final def ne(arg0: AnyRef): Boolean

val never: UIO[Nothing]

val none: Task[Option[Nothing]]

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

def raceAll[A](task: Task[A], ios: Iterable[Task[A]]): Task[A]

def reduceAll[A](a: Task[A], as: Iterable[Task[A]])(f: (A, A) ⇒ A): Task[A]

def reduceAllPar[A](a: Task[A], as: Iterable[Task[A]])(f: (A, A) ⇒ A): Task[A]

def replicate[A](n: Int)(effect: Task[A]): Iterable[Task[A]]

def require[A](error: ⇒ Throwable): (Task[Option[A]]) ⇒ Task[A]

def reserve[A, B](reservation: Task[Reservation[Any, Throwable, A]])(use: (A) ⇒ Task[B]): Task[B]

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

def runtime: UIO[Runtime[Any]]

def some[A](a: ⇒ A): Task[Option[A]]

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

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

def toString(): String

def trace: UIO[ZTrace]

def traced[A](task: Task[A]): Task[A]

def uninterruptible[A](task: Task[A]): Task[A]

def uninterruptibleMask[A](k: (InterruptStatusRestore) ⇒ Task[A]): Task[A]

val unit: UIO[Unit]

def unsandbox[A](v: IO[Cause[Throwable], A]): Task[A]

def untraced[A](task: Task[A]): Task[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def when(b: ⇒ Boolean)(task: Task[Any]): Task[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(b: Task[Boolean])(task: Task[Any]): Task[Unit]

val yieldNow: UIO[Unit]

def sequence[A](in: Iterable[Task[A]]): Task[List[A]]

See zio.ZIO.sequence

def sequencePar[A](as: Iterable[Task[A]]): Task[List[A]]

See zio.ZIO.sequencePar

def sequenceParN[A](n: Int)(as: Iterable[Task[A]]): Task[List[A]]

See zio.ZIO.sequenceParN

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

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

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

Alias for ZIO.foreachParN

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

def traversePar_[A](as: Iterable[A])(f: (A) ⇒ Task[Any]): Task[Unit]

def traverse_[A](as: Iterable[A])(f: (A) ⇒ Task[Any]): Task[Unit]