final case class KCons[H, +T <: KList[M], +M[_]](head: M[H], tail: T) extends KList[M] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- KCons
- Serializable
- Serializable
- Product
- Equals
- KList
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new KCons(head: M[H], tail: T)
Type Members
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def :^:[A, N[x] >: M[x]](h: N[A]): KCons[A, KCons[H, T, M], N]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply[N[x] >: M[x], Z](f: (Transform[Types.Id]) ⇒ Z)(implicit ap: Applicative[N]): N[Z]
Applies
f
to the elements of this list in the applicative functor defined byap
. -
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
foldr[B](f: (M[_], B) ⇒ B, init: B): B
Folds this list using a function that operates on the homogeneous type of the elements of this list.
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- val head: M[H]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- val tail: T
-
def
toList: List[M[_]]
Discards the heterogeneous type information and constructs a plain List from this KList's elements.
-
def
transform[N[_]](f: ~>[M, N]): KCons[H, T.Transform[N], N]
Apply the natural transformation
f
to each element. -
def
traverse[N[_], P[_]](f: ~>[M, [T]N[P[T]]])(implicit np: Applicative[N]): N[Transform[P]]
Equivalent to
transform(f) . apply(x => x)
, this is the essence of the iterator at the level of natural transformations. -
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()