final case class ListT[M[_], A](run: M[List[A]]) extends Product with Serializable
- Alphabetic
- By Inheritance
- ListT
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ListT(run: M[List[A]])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def ++(bs: ⇒ ListT[M, A])(implicit M: Bind[M]): ListT[M, A]
- def ::(a: A)(implicit M: Functor[M]): ListT[M, A]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def collect[B](pf: PartialFunction[A, B])(implicit M: Functor[M]): ListT[M, B]
- def drop(n: Int)(implicit M: Functor[M]): ListT[M, A]
- def dropWhile(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def filter(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def find(predicate: (A) ⇒ Boolean)(implicit M: Functor[M]): OptionT[M, A]
- def flatMap[B](f: (A) ⇒ ListT[M, B])(implicit M: Monad[M]): ListT[M, B]
- def flatMapF[B](f: (A) ⇒ M[List[B]])(implicit M: Monad[M]): ListT[M, B]
- def foldLeft[B](z: ⇒ B)(f: (⇒ B, ⇒ A) ⇒ B)(implicit M: Functor[M]): M[B]
- def foldRight[B](z: ⇒ B)(f: (⇒ A, ⇒ B) ⇒ B)(implicit M: Functor[M]): M[B]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def headMaybe(implicit M: Functor[M]): MaybeT[M, A]
- def headOption(implicit M: Functor[M]): OptionT[M, A]
- def isEmpty(implicit M: Functor[M]): M[Boolean]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def length(implicit M: Functor[M]): M[Int]
- def map[B](f: (A) ⇒ B)(implicit M: Functor[M]): ListT[M, B]
- def mapT[F[_], B](f: (M[List[A]]) ⇒ F[List[B]]): ListT[F, B]
-
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()
- val run: M[List[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail(implicit M: Functor[M]): ListT[M, A]
Don't use iteratively!
- def tailM(implicit M: Applicative[M]): M[ListT[M, A]]
- def take(n: Int)(implicit M: Functor[M]): ListT[M, A]
- def takeWhile(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]
- def toList: M[List[A]]
- def uncons(implicit M: Applicative[M]): M[Option[(A, ListT[M, A])]]
-
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()