sealed
trait
KList[+M[_], HL <: HList] extends AnyRef
Type Members
-
type
Raw = HL
Abstract Value Members
-
abstract
def
combine[N[X] >: M[X]]: Wrap[N]
-
abstract
def
down(implicit ev: ~>[M, Id]): HL
-
abstract
def
foldr[P[_ <: HList], N[X] >: M[X]](f: KFold[N, P]): P[HL]
-
abstract
def
toList: List[M[_]]
-
abstract
def
transform[N[_]](f: ~>[M, N]): KList[N, HL]
Concrete 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
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): java.lang.Class[_]
-
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
Inherited from AnyRef
Inherited from Any
A higher-order heterogeneous list. It has a type constructor M[_] and type parameters HL. The underlying data is M applied to each type parameter. Explicitly tracking M[_] allows performing natural transformations or ensuring all data conforms to some common type.
For background, see http://apocalisp.wordpress.com/2010/11/01/type-level-programming-in-scala-part-8a-klist%C2%A0motivation/