final
class
RichTaskable7[A, B, C, D, E, F, G] extends RichTaskables[:+:[A, :+:[B, :+:[C, :+:[D, :+:[E, :+:[F, :+:[G, HNil]]]]]]]]
Type Members
-
-
type
Fun[M[_], Ret] = (M[A], M[B], M[C], M[D], M[E], M[F], M[G]) ⇒ Ret
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
convertH[R](z: (Id[A], Id[B], Id[C], Id[D], Id[E], Id[F], Id[G]) ⇒ R): (:+:[Id[A], :+:[Id[B], :+:[Id[C], :+:[Id[D], :+:[Id[E], :+:[Id[F], :+:[Id[G], HNil]]]]]]]) ⇒ R
-
def
convertK[M[_], R](z: (M[A], M[B], M[C], M[D], M[E], M[F], M[G]) ⇒ R): (KList[M, :+:[A, :+:[B, :+:[C, :+:[D, :+:[E, :+:[F, :+:[G, HNil]]]]]]]]) ⇒ R
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
flatFailure[T](f: (Seq[Incomplete]) ⇒ Task[T]): App[T]
-
def
flatMap[T](f: (Id[A], Id[B], Id[C], Id[D], Id[E], Id[F], Id[G]) ⇒ Task[T]): App[T]
-
-
final
def
getClass(): java.lang.Class[_]
-
def
hashCode(): Int
-
def
identityMap: App[(Id[A], Id[B], Id[C], Id[D], Id[E], Id[F], Id[G])]
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[T](f: (Id[A], Id[B], Id[C], Id[D], Id[E], Id[F], Id[G]) ⇒ T): App[T]
-
def
mapFailure[T](f: (Seq[Incomplete]) ⇒ T): App[T]
-
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from RichTaskables[:+:[A, :+:[B, :+:[C, :+:[D, :+:[E, :+:[F, :+:[G, HNil]]]]]]]]
Inherited from AnyRef
Inherited from Any