ListT

final def !=(arg0: Any): Boolean

final def ##(): Int

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

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

def filter(p: (A) ⇒ Boolean)(implicit M: Functor[M]): ListT[M, A]

def finalize(): Unit

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[_]

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

def length(implicit M: Functor[M]): M[Int]

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val run: M[List[A]]

final def synchronized[T0](arg0: ⇒ T0): T0

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

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def head(implicit M: Functor[M]): M[A]

def underlying: M[List[A]]