scalaz-core/scalaz.syntax.std/ListOps

ListOps

final
class ListOps[A](self: List[A]) extends AnyVal
class AnyVal
trait Matchable
class Any

Value members

Concrete methods

final
def <^>[B : Monoid](f: NonEmptyList[A] => B): B
final
def adjacentPairs: List[(A, A)]
final
def allPairs: List[(A, A)]
final
def breakM[M[_] : Monad](p: A => M[Boolean]): M[(List[A], List[A])]
final
def filterM[M[_] : Applicative](p: A => M[Boolean]): M[List[A]]
final
def findM[M[_] : Monad](p: A => M[Boolean]): M[Maybe[A]]
final
def groupBy1[B](f: A => B): Map[B, NonEmptyList[A]]
final
def groupWhen(p: (A, A) => Boolean): List[NonEmptyList[A]]
final
def groupWhenM[M[_] : Monad](p: (A, A) => M[Boolean]): M[List[NonEmptyList[A]]]
final
def initz: List[List[A]]
final
def intersperse(a: A): List[A]
final
def lookup[B, C](key: B)(implicit eq: Equal[B], ev: A === (B, C)): Option[C]
final
def mapAccumLeft[B, C](c: C, f: (C, A) => (C, B)): (C, List[B])
final
def mapAccumRight[B, C](c: C, f: (C, A) => (C, B)): (C, List[B])
final
def partitionM[M[_] : Applicative](p: A => M[Boolean]): M[(List[A], List[A])]
final
def powerset: List[List[A]]
final
def spanM[M[_] : Monad](p: A => M[Boolean]): M[(List[A], List[A])]
final
def tailOption: Option[List[A]]
final
def tailz: List[List[A]]
final
def takeUntilM[M[_] : Monad](p: A => M[Boolean]): M[List[A]]
final
def takeWhileM[M[_] : Monad](p: A => M[Boolean]): M[List[A]]
final
def toNel: Maybe[NonEmptyList[A]]
final
def toZipper: Maybe[Zipper[A]]
final
def zipperEnd: Maybe[Zipper[A]]