Class/Object

cats.data

NonEmptyList

Related Docs: object NonEmptyList | package data

Permalink

final case class NonEmptyList[+A](head: A, tail: List[A]) extends Product with Serializable

A data type which represents a non empty list of A, with single element (head) and optional structure (tail).

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonEmptyList
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NonEmptyList(head: A, tail: List[A])

    Permalink

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++[AA >: A](l: List[AA]): NonEmptyList[AA]

    Permalink
  4. def ::[AA >: A](a: AA): NonEmptyList[AA]

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

    Permalink
    Definition Classes
    AnyRef → Any
  6. def ===[AA >: A](o: NonEmptyList[AA])(implicit AA: Eq[AA]): Boolean

    Permalink
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def coflatMap[B](f: (NonEmptyList[A]) ⇒ B): NonEmptyList[B]

    Permalink
  10. def concat[AA >: A](other: NonEmptyList[AA]): NonEmptyList[AA]

    Permalink

    Append another NonEmptyList

  11. def distinct[AA >: A](implicit O: Order[AA]): NonEmptyList[AA]

    Permalink

    Remove duplicates.

    Remove duplicates. Duplicates are checked using Order[_] instance.

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

    Permalink
    Definition Classes
    AnyRef
  13. def exists(p: (A) ⇒ Boolean): Boolean

    Permalink

    Check whether at least one element satisfies the predicate

  14. def filter(p: (A) ⇒ Boolean): List[A]

    Permalink

    Remove elements not matching the predicate

    Remove elements not matching the predicate

    scala> import cats.data.NonEmptyList
    scala> val nel = NonEmptyList.of(1, 2, 3, 4, 5)
    scala> nel.filter(_ < 3)
    res0: scala.collection.immutable.List[Int] = List(1, 2)
  15. def filterNot(p: (A) ⇒ Boolean): List[A]

    Permalink

    Remove elements matching the predicate

    Remove elements matching the predicate

    scala> import cats.data.NonEmptyList
    scala> val nel = NonEmptyList.of(1, 2, 3, 4, 5)
    scala> nel.filterNot(_ < 3)
    res0: scala.collection.immutable.List[Int] = List(3, 4, 5)
  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def find(p: (A) ⇒ Boolean): Option[A]

    Permalink

    Find the first element matching the predicate, if one exists

  18. def flatMap[B](f: (A) ⇒ NonEmptyList[B]): NonEmptyList[B]

    Permalink
  19. def foldLeft[B](b: B)(f: (B, A) ⇒ B): B

    Permalink

    Left-associative fold on the structure using f.

  20. def foldRight[B](lb: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]

    Permalink

    Right-associative fold on the structure using f.

  21. def forall(p: (A) ⇒ Boolean): Boolean

    Permalink

    Check whether all elements satisfy the predicate

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

    Permalink
    Definition Classes
    AnyRef → Any
  23. val head: A

    Permalink
  24. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  25. def map[B](f: (A) ⇒ B): NonEmptyList[B]

    Permalink

    Applies f to all the elements of the structure

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

    Permalink
    Definition Classes
    AnyRef
  27. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. def reduce[AA >: A](implicit S: Semigroup[AA]): AA

    Permalink

    Reduce using the Semigroup of AA.

  30. def reduceLeft[AA >: A](f: (AA, AA) ⇒ AA): AA

    Permalink

    Left-associative reduce using f.

  31. def reverse: NonEmptyList[A]

    Permalink

    Reverse this NonEmptyList.

    Reverse this NonEmptyList.

    scala> import cats.data.NonEmptyList
    scala> val nel = NonEmptyList.of(1, 2, 3)
    scala> nel.reverse
    res0: cats.data.NonEmptyList[Int] = NonEmptyList(3, 2, 1)
  32. def show[AA >: A](implicit AA: Show[AA]): String

    Permalink
  33. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  34. val tail: List[A]

    Permalink
  35. def toList: List[A]

    Permalink

    Return the head and tail into a single list

  36. def toString(): String

    Permalink
    Definition Classes
    NonEmptyList → AnyRef → Any
  37. def traverse[G[_], B](f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[NonEmptyList[B]]

    Permalink
  38. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. def zipWithIndex: NonEmptyList[(A, Int)]

    Permalink

    Zips each element of this NonEmptyList with its index.

    Zips each element of this NonEmptyList with its index.

    scala> import cats.data.NonEmptyList
    scala> val nel = NonEmptyList.of("a", "b", "c")
    scala> nel.zipWithIndex
    res0: cats.data.NonEmptyList[(String, Int)] = NonEmptyList((a,0), (b,1), (c,2))

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped