Class

scalaz.syntax.std

ListOps

Related Doc: package std

Permalink

final class ListOps[A] extends AnyVal

Source
ListOps.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ListOps
  2. AnyVal
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ListOps(self: List[A])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    Any
  3. final def <^>[B](f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B

    Permalink
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    Any
  5. final def adjacentPairs: List[(A, A)]

    Permalink
  6. final def allPairs: List[(A, A)]

    Permalink
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. final def breakM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

    Permalink
  9. final def filterM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]

    Permalink
  10. final def findM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]

    Permalink
  11. def getClass(): Class[_ <: AnyVal]

    Permalink
    Definition Classes
    AnyVal → Any
  12. final def groupBy1[B](f: (A) ⇒ B): Map[B, NonEmptyList[A]]

    Permalink
  13. final def groupWhen(p: (A, A) ⇒ Boolean): List[NonEmptyList[A]]

    Permalink
  14. final def groupWhenM[M[_]](p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[NonEmptyList[A]]]

    Permalink
  15. final def initz: List[List[A]]

    Permalink
  16. final def intersperse(a: A): List[A]

    Permalink
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. final def lookup[B, C](key: B)(implicit eq: Equal[B], ev: =:=[A, (B, C)]): Option[C]

    Permalink
  19. final def mapAccumLeft[B, C](c: C, f: (C, A) ⇒ (C, B)): (C, List[B])

    Permalink
  20. final def mapAccumRight[B, C](c: C, f: (C, A) ⇒ (C, B)): (C, List[B])

    Permalink
  21. final def partitionM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[(List[A], List[A])]

    Permalink
  22. final def powerset: List[List[A]]

    Permalink
  23. val self: List[A]

    Permalink
  24. final def spanM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

    Permalink
  25. final def tailOption: Option[List[A]]

    Permalink
  26. final def tailz: List[List[A]]

    Permalink
  27. final def takeUntilM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Permalink
  28. final def takeWhileM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Permalink
  29. final def toNel: Option[NonEmptyList[A]]

    Permalink
  30. def toString(): String

    Permalink
    Definition Classes
    Any
  31. final def toZipper: Option[Zipper[A]]

    Permalink
  32. final def zipperEnd: Option[Zipper[A]]

    Permalink

Inherited from AnyVal

Inherited from Any

Ungrouped