scalaz

ListT

sealed case class ListT[M[+_], +A](underlying: M[List[A]]) extends Product with Serializable

ListT monad transformer.

Source
ListT.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ListT
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ListT(underlying: M[List[A]])

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def ++[B >: A](bs: ⇒ ListT[M, B])(implicit M: Bind[M]): ListT[M, B]

  5. def ::[AA >: A](a: AA)(implicit M: Functor[M]): ListT[M, AA]

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def drop(n: Int)(implicit M: Functor[M]): ListT[M, A]

  11. def dropWhile(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]

  12. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  13. def filter(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]

  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. def flatMap[B](f: (A) ⇒ ListT[M, B])(implicit M: Monad[M]): ListT[M, B]

  16. def foldLeft[B](z: ⇒ B)(f: (⇒ B, ⇒ A) ⇒ B)(implicit M: Functor[M]): M[B]

  17. def foldRight[B](z: ⇒ B)(f: (⇒ A, ⇒ B) ⇒ B)(implicit M: Functor[M]): M[B]

  18. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  19. def head(implicit M: Functor[M]): M[A]

  20. def headOption(implicit M: Functor[M]): M[Option[A]]

  21. def isEmpty(implicit M: Functor[M]): M[Boolean]

  22. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  23. def length(implicit M: Functor[M]): M[Int]

  24. def map[B](f: (A) ⇒ B)(implicit M: Functor[M]): ListT[M, B]

  25. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  29. def tail(implicit M: Functor[M]): ListT[M, A]

    Don't use iteratively!

  30. def tailM(implicit M: Applicative[M]): M[ListT[M, A]]

  31. def take(n: Int)(implicit M: Functor[M]): ListT[M, A]

  32. def takeWhile(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]

  33. def toList(): M[List[A]]

  34. def uncons(implicit M: Applicative[M]): M[Option[(A, ListT[M, A])]]

  35. val underlying: M[List[A]]

  36. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped