object Task extends Companion
- Source
- Task.scala
- Alphabetic
- By Inheritance
- Task
- Companion
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[A](a: => A): Task[A]
- See also
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def async[A](register: (BiCallback[Throwable, A]) => Unit): Task[A]
- See also
- def async0[A](register: (Scheduler, BiCallback[Throwable, A]) => Unit): Task[A]
- See also
- def asyncF[A](register: (BiCallback[Throwable, A]) => Task[Unit]): Task[A]
- See also
- val cancelBoundary: Task[Unit]
- See also
- def cancelable[A](register: (BiCallback[Throwable, A]) => CancelToken[Task]): Task[A]
- See also
- def cancelable0[A](register: (Scheduler, BiCallback[Throwable, A]) => CancelToken[Task]): Task[A]
- See also
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def create[A]: CreatePartiallyApplied[Throwable, A]
- See also
- def defer[A](fa: => Task[A]): Task[A]
- See also
- def deferAction[A](f: (Scheduler) => Task[A]): Task[A]
- See also
- def deferFuture[A](fa: => Future[A]): Task[A]
- See also
- def deferFutureAction[A](f: (Scheduler) => Future[A]): Task[A]
- See also
- def delay[A](a: => A): Task[A]
- See also
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def eval[A](a: => A): Task[A]
- See also
- def evalAsync[A](a: => A): Task[A]
- See also
- def evalOnce[A](a: => A): Task[A]
- See also
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def from[F[_], A](fa: F[A])(implicit F: IOLike[F]): Task[A]
- See also
- def fromCancelablePromise[A](p: CancelablePromise[A]): Task[A]
- See also
- def fromConcurrentEffect[F[_], A](fa: F[A])(implicit F: ConcurrentEffect[F]): Task[A]
- See also
- def fromEffect[F[_], A](fa: F[A])(implicit F: Effect[F]): Task[A]
- See also
- def fromEither[A](a: Either[Throwable, A]): Task[A]
- See also
- def fromFuture[A](f: Future[A]): Task[A]
- See also
- def fromFutureLike[F[_], A](tfa: Task[F[A]])(implicit F: FutureLift[Task, F]): Task[A]
- See also
- def fromReactivePublisher[A](source: Publisher[A]): Task[Option[A]]
- See also
- def fromTry[A](a: Try[A]): Task[A]
- See also
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def left[A, B](a: A): Task[Either[A, B]]
- See also
- def liftFrom[F[_]](implicit F: IOLike[F]): ~>[F, Task]
- See also
- def liftFromConcurrentEffect[F[_]](implicit F: ConcurrentEffect[F]): ~>[F, Task]
- See also
- def liftFromEffect[F[_]](implicit F: Effect[F]): ~>[F, Task]
- See also
- def liftTo[F[_]](implicit F: IOLift[F]): ~>[Task, F]
- See also
- def liftToAsync[F[_]](implicit F: Async[F], eff: Effect[Task]): ~>[Task, F]
- See also
- def liftToConcurrent[F[_]](implicit F: Concurrent[F], eff: ConcurrentEffect[Task]): ~>[Task, F]
- See also
- def map2[A1, A2, R](fa1: Task[A1], fa2: Task[A2])(f: (A1, A2) => R): Task[R]
- See also
- def map3[A1, A2, A3, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3])(f: (A1, A2, A3) => R): Task[R]
- See also
- def map4[A1, A2, A3, A4, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4])(f: (A1, A2, A3, A4) => R): Task[R]
- See also
- def map5[A1, A2, A3, A4, A5, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4], fa5: Task[A5])(f: (A1, A2, A3, A4, A5) => R): Task[R]
- See also
- def map6[A1, A2, A3, A4, A5, A6, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4], fa5: Task[A5], fa6: Task[A6])(f: (A1, A2, A3, A4, A5, A6) => R): Task[R]
- See also
- def mapBoth[A1, A2, R](fa1: Task[A1], fa2: Task[A2])(f: (A1, A2) => R): Task[R]
- See also
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def never[A]: Task[A]
- See also
- def none[A]: Task[Option[A]]
- See also
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def now[A](a: A): Task[A]
- See also
See monix.bio.IO.now
- def parMap2[A1, A2, R](fa1: Task[A1], fa2: Task[A2])(f: (A1, A2) => R): Task[R]
- See also
- def parMap3[A1, A2, A3, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3])(f: (A1, A2, A3) => R): Task[R]
- See also
- def parMap4[A1, A2, A3, A4, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4])(f: (A1, A2, A3, A4) => R): Task[R]
- See also
- def parMap5[A1, A2, A3, A4, A5, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4], fa5: Task[A5])(f: (A1, A2, A3, A4, A5) => R): Task[R]
- See also
- def parMap6[A1, A2, A3, A4, A5, A6, R](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4], fa5: Task[A5], fa6: Task[A6])(f: (A1, A2, A3, A4, A5, A6) => R): Task[R]
- See also
See IO.parMap6
- def parSequence[A](in: Iterable[Task[A]]): Task[List[A]]
- See also
- def parSequenceN[A](parallelism: Int)(in: Iterable[Task[A]]): Task[List[A]]
- See also
- def parSequenceUnordered[A](in: Iterable[Task[A]]): Task[List[A]]
- See also
- def parTraverse[A, B](in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
- See also
- def parTraverseN[A, B](parallelism: Int)(in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
- See also
- def parTraverseUnordered[A, B](in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
- def parZip2[A1, A2, R](fa1: Task[A1], fa2: Task[A2]): Task[(A1, A2)]
- See also
See IO.parZip2
- def parZip3[A1, A2, A3](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3]): Task[(A1, A2, A3)]
- See also
See IO.parZip3
- def parZip4[A1, A2, A3, A4](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4]): Task[(A1, A2, A3, A4)]
- See also
See IO.parZip4
- def parZip5[A1, A2, A3, A4, A5](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4], fa5: Task[A5]): Task[(A1, A2, A3, A4, A5)]
- See also
See IO.parZip5
- def parZip6[A1, A2, A3, A4, A5, A6](fa1: Task[A1], fa2: Task[A2], fa3: Task[A3], fa4: Task[A4], fa5: Task[A5], fa6: Task[A6]): Task[(A1, A2, A3, A4, A5, A6)]
- See also
See IO.parZip6
- def pure[A](a: A): Task[A]
- See also
- def race[A, B](fa: Task[A], fb: Task[B]): Task[Either[A, B]]
- See also
- def raceMany[A](tasks: Iterable[Task[A]]): Task[A]
- See also
- def racePair[A, B](fa: Task[A], fb: Task[B]): Task[Either[(A, Fiber[Throwable, B]), (Fiber[Throwable, A], B)]]
- See also
- def raiseError[A](ex: Throwable): Task[A]
- See also
- def raiseUnless(cond: Boolean)(e: => Throwable): Task[Unit]
- See also
- def raiseWhen(cond: Boolean)(e: => Throwable): Task[Unit]
- See also
- def rethrow[A](fa: Task[Either[Throwable, A]]): Task[A]
- See also
- def right[A, B](b: B): Task[Either[A, B]]
- See also
- def sequence[A](in: Iterable[Task[A]]): Task[List[A]]
- See also
- def shift(ec: ExecutionContext): Task[Unit]
- See also
- val shift: Task[Unit]
- See also
- def sleep(timespan: FiniteDuration): Task[Unit]
- See also
- def some[A](a: A): Task[Option[A]]
- See also
- def suspend[A](fa: => Task[A]): Task[A]
- See also
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tailRecM[A, B](a: A)(f: (A) => Task[Either[A, B]]): Task[B]
- See also
- def terminate[A](ex: Throwable): Task[A]
- See also
- def toString(): String
- Definition Classes
- AnyRef → Any
- val trace: Task[IOTrace]
- See also
- def traverse[A, B](in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
- See also
- val unit: Task[Unit]
- See also
- def unless(cond: Boolean)(action: => Task[Unit]): Task[Unit]
- See also
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def when(cond: Boolean)(action: => Task[Unit]): Task[Unit]
- See also
Deprecated Value Members
- def gather[A](in: Iterable[Task[A]]): Task[List[A]]
DEPRECATED — renamed to Task.parSequence.
DEPRECATED — renamed to Task.parSequence.
- Definition Classes
- Companion
- Annotations
- @deprecated
- Deprecated
(Since version 0.1.0) Use parSequence
- def gatherN[A](parallelism: Int)(in: Iterable[Task[A]]): Task[List[A]]
DEPRECATED — renamed to Task.parSequenceN
DEPRECATED — renamed to Task.parSequenceN
- Definition Classes
- Companion
- Annotations
- @deprecated
- Deprecated
(Since version 0.1.0) Use parSequenceN
- def gatherUnordered[A](in: Iterable[Task[A]]): Task[List[A]]
DEPRECATED — renamed to Task.parSequenceUnordered
DEPRECATED — renamed to Task.parSequenceUnordered
- Definition Classes
- Companion
- Annotations
- @deprecated
- Deprecated
(Since version 0.1.0) Use parSequenceUnordered
- def wander[A, B](in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
DEPRECATED — renamed to Task.parTraverse
DEPRECATED — renamed to Task.parTraverse
- Definition Classes
- Companion
- Annotations
- @deprecated
- Deprecated
(Since version 0.1.0) Use parTraverse
- def wanderN[A, B](parallelism: Int)(in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
DEPRECATED — renamed to Task.parTraverseN
DEPRECATED — renamed to Task.parTraverseN
- Definition Classes
- Companion
- Annotations
- @deprecated
- Deprecated
(Since version 0.1.0) Use parTraverseN
- def wanderUnordered[A, B](in: Iterable[A])(f: (A) => Task[B]): Task[List[B]]
DEPRECATED — renamed to IO.parTraverseUnordered
DEPRECATED — renamed to IO.parTraverseUnordered
- Definition Classes
- Companion
- Annotations
- @deprecated
- Deprecated
(Since version 3.2.0) Use parTraverseUnordered