HListFunc

implicit abstract def TC: KTypeClass[TC]

abstract def runA(a: A): T.Product[B]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &&&@[G[_]](g: Func[G, TC, A, B]): HListFunc[TCCons[G, TCCons[T.Product, TCNil]], TC, A, B]

def ::[G[_]](g: Func[G, TC, A, B]): HListFunc[TCCons[G, T], TC, A, B]

def <<<@[G[_], C](g: Func[G, TC, C, A]): Func[[α]G[T.Product[α]], TC, C, B]

alias for composeA

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def @&&&[G[_]](g: Func[G, TC, A, B]): HListFunc[TCCons[T.Product, TCCons[G, TCNil]], TC, A, B]

alias for productA

def @>>>[G[_], C](g: Func[G, TC, B, C]): Func[[α]T.Product[G[α]], TC, A, C]

alias for andThenA

final def F: TC[T.Product]

def andThenA[G[_], C](g: Func[G, TC, B, C]): Func[[α]T.Product[G[α]], TC, A, C]

compose A => F[B] and B => G[C] into A => F[G[C]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def composeA[G[_], C](g: Func[G, TC, C, A]): Func[[α]G[T.Product[α]], TC, C, B]

compose A => F[B] and C => G[A] into C => G[F[B]]

def consA[T <: TCList](tail: HListFunc[T, TC, A, B]): HListFunc[TCCons[T.Product, T], TC, A, B]

prepend this to HListFunc tail *

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def mapA[C](f: (B) ⇒ C): Func[T.Product, TC, A, C]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def productA[G[_]](g: Func[G, TC, A, B]): HListFunc[TCCons[T.Product, TCCons[G, TCNil]], TC, A, B]

compose A => F[B] and A => G[B] into A => F[B] :: G[B] :: HNil

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

def toString(): String

def traverse[G[_]](value: G[A])(implicit G: Traverse[G], ev: =:=[TC[T.Product], Applicative[T.Product]]): T.Product[G[B]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit