Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def <^>[A, B](as: List[A])(f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B

   Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.

   Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.

   Definition Classes

   ListFunctions

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

   Definition Classes

   AnyRef → Any

5.  final def adjacentPairs[A](as: List[A]): List[(A, A)]

   [(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]

   [(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]

   Definition Classes

   ListFunctions

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

   Combinations of as and as, excluding same-element pairs.

   Combinations of as and as, excluding same-element pairs.

   Definition Classes

   ListFunctions

7.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8.  final def breakM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

   spanM with p's complement.

   spanM with p's complement.

   Definition Classes

   ListFunctions

9.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

11.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12.  final def filterM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]

    Definition Classes

    ListFunctions

13.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

14.  final def findM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]

    Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.

    Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.

    Definition Classes

    ListFunctions

15.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

16.  final def groupBy1[A, B](as: List[A])(f: (A) ⇒ B): Map[B, NonEmptyList[A]]

    As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty

    As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty

    Definition Classes

    ListFunctions

17.  final def groupWhen[A](as: List[A])(p: (A, A) ⇒ Boolean): List[NonEmptyList[A]]

    groupWhenM specialized to scalaz.Id.Id.

    groupWhenM specialized to scalaz.Id.Id.

    Definition Classes

    ListFunctions

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

    Split at each point where p(as(n), as(n+1)) yields false.

    Split at each point where p(as(n), as(n+1)) yields false.

    Definition Classes

    ListFunctions

19.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

20.  final def initz[A](as: List[A]): List[List[A]]

    [Nil, as take 1, as take 2, ..., as]

    [Nil, as take 1, as take 2, ..., as]

    Definition Classes

    ListFunctions

21.  final def intersperse[A](as: List[A], a: A): List[A]

    Intersperse the element a between each adjacent pair of elements in as

    Intersperse the element a between each adjacent pair of elements in as

    Definition Classes

    ListFunctions

22.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

23.  implicit def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]

    Definition Classes

    ListInstances0

24.  implicit val listInstance: Traverse[List] with MonadPlus[List] with BindRec[List] with Zip[List] with Unzip[List] with Align[List] with IsEmpty[List] with Cobind[List]

    Definition Classes

    ListInstances

25.  implicit def listMonoid[A]: Monoid[List[A]]

    Definition Classes

    ListInstances

26.  implicit def listOrder[A](implicit A0: Order[A]): Order[List[A]]

    Definition Classes

    ListInstances

27.  implicit def listShow[A](implicit arg0: Show[A]): Show[List[A]]

    Definition Classes

    ListInstances

28.  final def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) ⇒ (C, B)): (C, List[B])

    All of the Bs, in order, and the final C acquired by a stateful left fold over as.

    All of the Bs, in order, and the final C acquired by a stateful left fold over as.

    Definition Classes

    ListFunctions

29.  final def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) ⇒ (C, B)): (C, List[B])

    All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

    All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

    Definition Classes

    ListFunctions

30.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

31.  final def nil[A]: List[A]

    scala.Nil with a sometimes more convenient type

    scala.Nil with a sometimes more convenient type

    Definition Classes

    ListFunctions

32.  final def notify(): Unit

    Definition Classes

    AnyRef

33.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

34.  final def partitionM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[(List[A], List[A])]

    A pair of passing and failing values of as against p.

    A pair of passing and failing values of as against p.

    Definition Classes

    ListFunctions

35.  final def powerset[A](as: List[A]): List[List[A]]

    Definition Classes

    ListFunctions

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

    A pair of the longest prefix of passing as against p, and the remainder.

    A pair of the longest prefix of passing as against p, and the remainder.

    Definition Classes

    ListFunctions

37.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

38.  final def tailOption[A](as: List[A]): Option[List[A]]

    Definition Classes

    ListFunctions

39.  final def tailz[A](as: List[A]): List[List[A]]

    [as, as.tail, as.tail.tail, ..., Nil]

    [as, as.tail, as.tail.tail, ..., Nil]

    Definition Classes

    ListFunctions

40.  final def takeUntilM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Run p(a)s and collect as while p yields false.

    Run p(a)s and collect as while p yields false. Don't run any ps after the first true.

    Definition Classes

    ListFunctions

41.  final def takeWhileM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Run p(a)s and collect as while p yields true.

    Run p(a)s and collect as while p yields true. Don't run any ps after the first false.

    Definition Classes

    ListFunctions

42.  final def toNel[A](as: List[A]): Option[NonEmptyList[A]]

    Definition Classes

    ListFunctions

43.  def toString(): String

    Definition Classes

    AnyRef → Any

44.  final def toZipper[A](as: List[A]): Option[Zipper[A]]

    Definition Classes

    ListFunctions

45.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

47.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

48.  final def zipperEnd[A](as: List[A]): Option[Zipper[A]]

    Definition Classes

    ListFunctions

49.  object listSyntax extends ToListOps