trait
TaskInstance extends MonadError[Task, Throwable] with ContinuationInstance[Unit] with Zip[Task]
Type Members
-
trait
ApplicativeLaw extends scalaz.Applicative.ApplyLaw
-
trait
ApplyLaw extends scalaz.Apply.FunctorLaw
-
trait
BindLaw extends scalaz.Bind.ApplyLaw
-
trait
FunctorLaw extends scalaz.Functor.InvariantFunctorLaw
-
trait
InvariantFunctorLaw extends AnyRef
-
trait
MonadErrorLaw extends AnyRef
-
trait
MonadLaw extends scalaz.Monad.ApplicativeLaw with scalaz.Monad.BindLaw
-
trait
ZipLaw extends AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
ap[A, B](fa: ⇒ Task[A])(f: ⇒ Task[(A) ⇒ B]): Map[(A, (A) ⇒ B), Unit, B]
-
def
ap(implicit F: Functor[Task]): Apply[Task]
-
def
ap2[A, B, C](fa: ⇒ Task[A], fb: ⇒ Task[B])(f: Task[(A, B) ⇒ C]): Task[C]
-
def
ap3[A, B, C, D](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C])(f: Task[(A, B, C) ⇒ D]): Task[D]
-
def
ap4[A, B, C, D, E](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D])(f: Task[(A, B, C, D) ⇒ E]): Task[E]
-
def
ap5[A, B, C, D, E, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E])(f: Task[(A, B, C, D, E) ⇒ R]): Task[R]
-
def
ap6[A, B, C, D, E, FF, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF])(f: Task[(A, B, C, D, E, FF) ⇒ R]): Task[R]
-
def
ap7[A, B, C, D, E, FF, G, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G])(f: Task[(A, B, C, D, E, FF, G) ⇒ R]): Task[R]
-
def
ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G], fh: ⇒ Task[H])(f: Task[(A, B, C, D, E, FF, G, H) ⇒ R]): Task[R]
-
def
apF[A, B](f: ⇒ Task[(A) ⇒ B]): (Task[A]) ⇒ Task[B]
-
-
val
applicativeSyntax: ApplicativeSyntax[Task]
-
def
apply[A, B](fa: Task[A])(f: (A) ⇒ B): Task[B]
-
def
apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G], fh: ⇒ Task[H], fi: ⇒ Task[I], fj: ⇒ Task[J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): Task[R]
-
def
apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G], fh: ⇒ Task[H], fi: ⇒ Task[I], fj: ⇒ Task[J], fk: ⇒ Task[K])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): Task[R]
-
def
apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G], fh: ⇒ Task[H], fi: ⇒ Task[I], fj: ⇒ Task[J], fk: ⇒ Task[K], fl: ⇒ Task[L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): Task[R]
-
final
def
apply2[A, B, C](fa: ⇒ Task[A], fb: ⇒ Task[B])(f: (A, B) ⇒ C): Map[(A, B), Unit, C]
-
def
apply3[A, B, C, D](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C])(f: (A, B, C) ⇒ D): Task[D]
-
def
apply4[A, B, C, D, E](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D])(f: (A, B, C, D) ⇒ E): Task[E]
-
def
apply5[A, B, C, D, E, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E])(f: (A, B, C, D, E) ⇒ R): Task[R]
-
def
apply6[A, B, C, D, E, FF, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF])(f: (A, B, C, D, E, FF) ⇒ R): Task[R]
-
def
apply7[A, B, C, D, E, FF, G, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G])(f: (A, B, C, D, E, FF, G) ⇒ R): Task[R]
-
def
apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G], fh: ⇒ Task[H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): Task[R]
-
def
apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E], ff: ⇒ Task[FF], fg: ⇒ Task[G], fh: ⇒ Task[H], fi: ⇒ Task[I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): Task[R]
-
def
applyApplicative: Applicative[[α]\/[Task[α], α]]
-
-
val
applySyntax: ApplySyntax[Task]
-
def
apzip[A, B](f: ⇒ (Task[A]) ⇒ Task[B], a: ⇒ Task[A]): Task[(A, B)]
-
def
apzipPL[A, B](f: ⇒ @?>[Task[A], Task[B]], a: ⇒ Task[A])(implicit M: Monoid[Task[B]]): Task[(A, B)]
-
final
def
asInstanceOf[T0]: T0
-
def
bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]Task[G[α, β]]]
-
final
def
bind[A, B](fa: Continuation[A, Unit])(f: (A) ⇒ Continuation[B, Unit]): FlatMap[A, Unit, B]
-
-
val
bindSyntax: BindSyntax[Task]
-
def
clone(): AnyRef
-
def
compose[G[_]](implicit T0: Functor[Task], G0: Zip[G]): Zip[[α]Task[G[α]]]
-
def
compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]Task[G[α]]]
-
def
compose[G[_]](implicit G0: Apply[G]): Apply[[α]Task[G[α]]]
-
def
compose[G[_]](implicit G0: Functor[G]): Functor[[α]Task[G[α]]]
-
def
counzip[A, B](a: \/[Task[A], Task[B]]): Task[\/[A, B]]
-
-
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
filterM[A](l: List[A])(f: (A) ⇒ Task[Boolean]): Task[List[A]]
-
def
finalize(): Unit
-
-
def
forever[A, B](fa: Task[A]): Task[B]
-
def
formatted(fmtstr: String): String
-
def
fpair[A](fa: Task[A]): Task[(A, A)]
-
def
fproduct[A, B](fa: Task[A])(f: (A) ⇒ B): Task[(A, B)]
-
-
val
functorSyntax: FunctorSyntax[Task]
-
final
def
getClass(): Class[_]
-
final
def
handleError[A](fa: Continuation[A, Unit])(f: (Throwable) ⇒ Continuation[A, Unit]): HandleError[A, Unit]
-
def
hashCode(): Int
-
def
icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]Task[G[α]]]
-
def
ifM[B](value: Task[Boolean], ifTrue: ⇒ Task[B], ifFalse: ⇒ Task[B]): Task[B]
-
-
val
invariantFunctorSyntax: InvariantFunctorSyntax[Task]
-
final
def
isInstanceOf[T0]: Boolean
-
def
iterateUntil[A](f: Task[A])(p: (A) ⇒ Boolean): Task[A]
-
def
iterateWhile[A](f: Task[A])(p: (A) ⇒ Boolean): Task[A]
-
def
join[A](ffa: Task[Task[A]]): Task[A]
-
def
lift[A, B](f: (A) ⇒ B): (Task[A]) ⇒ Task[B]
-
def
lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF], Task[G], Task[H], Task[I], Task[J]) ⇒ Task[R]
-
def
lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF], Task[G], Task[H], Task[I], Task[J], Task[K]) ⇒ Task[R]
-
def
lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF], Task[G], Task[H], Task[I], Task[J], Task[K], Task[L]) ⇒ Task[R]
-
def
lift2[A, B, C](f: (A, B) ⇒ C): (Task[A], Task[B]) ⇒ Task[C]
-
def
lift3[A, B, C, D](f: (A, B, C) ⇒ D): (Task[A], Task[B], Task[C]) ⇒ Task[D]
-
def
lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (Task[A], Task[B], Task[C], Task[D]) ⇒ Task[E]
-
def
lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E]) ⇒ Task[R]
-
def
lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF]) ⇒ Task[R]
-
def
lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF], Task[G]) ⇒ Task[R]
-
def
lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF], Task[G], Task[H]) ⇒ Task[R]
-
def
lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (Task[A], Task[B], Task[C], Task[D], Task[E], Task[FF], Task[G], Task[H], Task[I]) ⇒ Task[R]
-
final
def
map[A, B](fa: Continuation[A, Unit])(f: (A) ⇒ B): Map[A, Unit, B]
-
def
mapply[A, B](a: A)(f: Task[(A) ⇒ B]): Task[B]
-
-
val
monadErrorSyntax: MonadErrorSyntax[Task, Throwable]
-
-
val
monadSyntax: MonadSyntax[Task]
-
def
mproduct[A, B](fa: Task[A])(f: (A) ⇒ Task[B]): Task[(A, B)]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
point[A](a: ⇒ A): Return[A, Unit]
-
def
product[G[_]](implicit G0: Zip[G]): Zip[[α](Task[α], G[α])]
-
def
product[G[_]](implicit G0: Monad[G]): Monad[[α](Task[α], G[α])]
-
def
product[G[_]](implicit G0: Bind[G]): Bind[[α](Task[α], G[α])]
-
def
product[G[_]](implicit G0: Applicative[G]): Applicative[[α](Task[α], G[α])]
-
def
product[G[_]](implicit G0: Apply[G]): Apply[[α](Task[α], G[α])]
-
def
product[G[_]](implicit G0: Functor[G]): Functor[[α](Task[α], G[α])]
-
final
def
pure[A](a: ⇒ A): Task[A]
-
final
def
raiseError[A](e: Throwable): Return[Nothing, Unit]
-
def
replicateM[A](n: Int, fa: Task[A]): Task[List[A]]
-
def
replicateM_[A](n: Int, fa: Task[A]): Task[Unit]
-
def
sequence[A, G[_]](as: G[Task[A]])(implicit arg0: Traverse[G]): Task[G[A]]
-
def
sequence1[A, G[_]](as: G[Task[A]])(implicit arg0: Traverse1[G]): Task[G[A]]
-
def
strengthL[A, B](a: A, f: Task[B]): Task[(A, B)]
-
def
strengthR[A, B](f: Task[A], b: B): Task[(A, B)]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traverse[A, G[_], B](value: G[A])(f: (A) ⇒ Task[B])(implicit G: Traverse[G]): Task[G[B]]
-
def
traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ Task[B])(implicit G: Traverse1[G]): Task[G[B]]
-
def
tuple2[A, B](fa: ⇒ Task[A], fb: ⇒ Task[B]): Task[(A, B)]
-
def
tuple3[A, B, C](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C]): Task[(A, B, C)]
-
def
tuple4[A, B, C, D](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D]): Task[(A, B, C, D)]
-
def
tuple5[A, B, C, D, E](fa: ⇒ Task[A], fb: ⇒ Task[B], fc: ⇒ Task[C], fd: ⇒ Task[D], fe: ⇒ Task[E]): Task[(A, B, C, D, E)]
-
def
unlessM[A](cond: Boolean)(f: ⇒ Task[A]): Task[Unit]
-
def
untilM[G[_], A](f: Task[A], cond: ⇒ Task[Boolean])(implicit G: MonadPlus[G]): Task[G[A]]
-
def
untilM_[A](f: Task[A], cond: ⇒ Task[Boolean]): Task[Unit]
-
def
void[A](fa: Task[A]): Task[Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
whenM[A](cond: Boolean)(f: ⇒ Task[A]): Task[Unit]
-
def
whileM[G[_], A](p: Task[Boolean], body: ⇒ Task[A])(implicit G: MonadPlus[G]): Task[G[A]]
-
def
whileM_[A](p: Task[Boolean], body: ⇒ Task[A]): Task[Unit]
-
def
widen[A, B](fa: Task[A])(implicit ev: <~<[A, B]): Task[B]
-
def
xmap[A, B](fa: Task[A], f: (A) ⇒ B, g: (B) ⇒ A): Task[B]
-
def
xmapb[A, B](ma: Task[A])(b: Bijection[A, B]): Task[B]
-
def
xmapi[A, B](ma: Task[A])(iso: scalaz.Isomorphism.<=>[A, B]): Task[B]
-
final
def
zip[A, B](a: ⇒ Task[A], b: ⇒ Task[B]): Task[(A, B)]
-
-
val
zipSyntax: ZipSyntax[Task]
-
def
zipWith[A, B, C](fa: ⇒ Task[A], fb: ⇒ Task[B])(f: (A, B) ⇒ C)(implicit F: Functor[Task]): Task[C]
-
Shadowed Implicit Value Members
-
val
self: Any
-
val
self: Any
Inherited from ContinuationInstance[Unit]
Inherited from Monad[Task]
Inherited from Bind[Task]
Inherited from Apply[Task]
Inherited from AnyRef
Inherited from Any