DataT

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[P, T](implicit dtt: Lazy[DataT[P, T]]): DataT[P, T]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit def deriveCCons[P, H, T <: Coproduct, OutH, OutT <: Coproduct](implicit ch: Lazy[Cases.Case1.Aux[P, H, OutH]], dtt: Lazy[Aux[P, T, OutT]]): Aux[P, :+:[H, T], :+:[OutH, OutT]]

implicit def deriveCNil[P]: Aux[P, CNil, CNil]

implicit def deriveHCons[P, H, T <: HList, OutH, OutT <: HList](implicit ch: Lazy[Cases.Case1.Aux[P, H, OutH]], dtt: Lazy[Aux[P, T, OutT]]): Aux[P, ::[H, T], ::[OutH, OutT]]

implicit def deriveHNil[P]: Aux[P, HNil, HNil]

implicit def deriveInstance[P, F, G](implicit gen: Generic.Aux[F, G], dtg: Lazy[Aux[P, G, G]]): Aux[P, F, F]

implicit def dfltDataT[F, T]: Aux[F, T, T]

Default DataT type class instance.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

implicit def genMapDataT[F <: Poly, M[X, Y], K, V, U](implicit ev: <:<[M[K, V], GenMap[K, V]], fv: Lazy[Cases.Case1.Aux[F, V, U]], cbf: CanBuildFrom[Nothing, (K, U), M[K, U]]): Aux[F, M[K, V], M[K, U]]

implicit def genTraversableDataT[F <: Poly, CC[X] <: GenTraversable[X], T, U](implicit ft: Lazy[Cases.Case1.Aux[F, T, U]], cbf: CanBuildFrom[Nothing, U, CC[U]]): Aux[F, CC[T], CC[U]]

final def getClass(): Class[_]

def gmapT[F, T](f: F)(t: T)(implicit data: Lazy[DataT[F, T]]): Out

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

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

def listDataT[F <: Poly, T, U](implicit ft: Lazy[Cases.Case1.Aux[F, T, U]]): Aux[F, List[T], List[U]]

DataT type class instance for Lists.