Data

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def apply[P, T, R](implicit dt: Lazy[Data[P, T, R]]): Data[P, T, R]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit def deriveCCons[P, H, T <: Coproduct, R](implicit ch: Lazy[Aux[P, H, R]], dt: Lazy[Data[P, T, R]]): Data[P, :+:[H, T], R]

implicit def deriveCNil[P, R]: Data[P, CNil, R]

implicit def deriveHCons[P, H, T <: HList, R](implicit ch: Lazy[Aux[P, H, R]], dt: Lazy[Data[P, T, R]]): Data[P, ::[H, T], R]

implicit def deriveHNil[P, R]: Data[P, HNil, R]

implicit def deriveInstance[P, F, R, G](implicit gen: Aux[F, G], dg: Lazy[Data[P, G, R]]): Data[P, F, R]

implicit def dfltData[F, T, R]: Data[F, T, R]

Default Data type class instance.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

implicit def genMapData[P, M[X, Y], K, V, R](implicit ev: <:<[M[K, V], GenMap[K, V]], qv: Lazy[Aux[P, (K, V), R]]): Data[P, M[K, V], R]

implicit def genTraversableData[P, C[X] <: GenTraversable[X], T, R](implicit qt: Lazy[Aux[P, T, R]]): Data[P, C[T], R]

final def getClass(): Class[_]

def gmapQ[F, T, R](f: F)(t: T)(implicit data: Lazy[Data[F, T, R]]): List[R]

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 listData[P, T, R](implicit qt: Lazy[Aux[P, T, R]]): Data[P, List[T], R]

Data type class instance for Lists.