NonEmptyVector

Value Members

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

   

   Definition Classes

   Any

2. final def ##(): Int

   

   Definition Classes

   Any

3. def ++[AA >: A](other: Vector[AA]): NonEmptyVector[AA]

   

   Alias for concat

4. def ++:[AA >: A](other: NonEmptyVector[AA]): NonEmptyVector[AA]

   

   Append this NEV to another NEV, producing a new NonEmptyVector.

   Append this NEV to another NEV, producing a new NonEmptyVector.

   scala> import cats.data.NonEmptyVector
   scala> val nev = NonEmptyVector.of(1, 2, 3)
   scala> nev ++: NonEmptyVector.of(4, 5)
   res0: cats.data.NonEmptyVector[Int] = NonEmptyVector(1, 2, 3, 4, 5)

5. def +:[AA >: A](a: AA): NonEmptyVector[AA]

   

   Alias for prepend

6. def :+[AA >: A](a: AA): NonEmptyVector[AA]

   

   Alias for append

7. final def ==(arg0: Any): Boolean

   

   Definition Classes

   Any

8. def ===[AA >: A](that: NonEmptyVector[AA])(implicit A: Eq[AA]): Boolean

   

   Typesafe equality operator.

   Typesafe equality operator.

   This method is similar to == except that it only allows two NonEmptyVector[A] values to be compared to each other, and uses equality provided by Eq[_] instances, rather than using the universal equality provided by .equals.

9. def append[AA >: A](a: AA): NonEmptyVector[AA]

   

   Append an item to this, producing a new NonEmptyVector.

10. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

11. def collect[B](pf: PartialFunction[A, B]): Vector[B]

    

12. def concat[AA >: A](other: Vector[AA]): NonEmptyVector[AA]

    

    Append another Vector to this, producing a new NonEmptyVector.

13. def concatNev[AA >: A](other: NonEmptyVector[AA]): NonEmptyVector[AA]

    

    Append another NonEmptyVector to this, producing a new NonEmptyVector.

14. def distinct[AA >: A](implicit O: Order[AA]): NonEmptyVector[AA]

    

    Remove duplicates.

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

15. def exists(f: (A) ⇒ Boolean): Boolean

    

    Check whether at least one element satisfies the predicate.

16. def filter(f: (A) ⇒ Boolean): Vector[A]

    

    Remove elements not matching the predicate

    Remove elements not matching the predicate

    scala> import cats.data.NonEmptyVector
    scala> val nev = NonEmptyVector.of(1, 2, 3, 4, 5)
    scala> nev.filter(_ < 3)
    res0: scala.collection.immutable.Vector[Int] = Vector(1, 2)

17. def filterNot(f: (A) ⇒ Boolean): Vector[A]

    

    Remove elements matching the predicate

    Remove elements matching the predicate

    scala> import cats.data.NonEmptyVector
    scala> val nev = NonEmptyVector.of(1, 2, 3, 4, 5)
    scala> nev.filterNot(_ < 3)
    res0: scala.collection.immutable.Vector[Int] = Vector(3, 4, 5)

18. def find(f: (A) ⇒ Boolean): Option[A]

    

    Find the first element matching the predicate, if one exists

19. def flatMap[B](f: (A) ⇒ NonEmptyVector[B]): NonEmptyVector[B]

    

    Applies f to all elements and combines the result

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

    

    Left-associative fold using f.

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

    

    Right-associative fold using f.

22. def forall(f: (A) ⇒ Boolean): Boolean

    

    Check whether all elements satisfy the predicate.

23. def get(i: Int): Option[A]

    

    Gets the element at the index, if it exists

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

    

    Definition Classes

    AnyVal → Any

25. def getUnsafe(i: Int): A

    

    Gets the element at the index, or throws an exception if none exists

26. def head: A

    

27. def init: Vector[A]

    

28. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

29. def last: A

    

30. def length: Int

    

31. def map[B](f: (A) ⇒ B): NonEmptyVector[B]

    

    Applies f to all the elements

32. def prepend[AA >: A](a: AA): NonEmptyVector[AA]

    

    Prepend an item to this, producing a new NonEmptyVector.

33. def reduce[AA >: A](implicit S: Semigroup[AA]): AA

    

    Reduce using the Semigroup of A

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

    

    Left-associative reduce using f.

35. def reverse: NonEmptyVector[A]

    

36. def show[AA >: A](implicit AA: Show[AA]): String

    

    Typesafe stringification method.

    Typesafe stringification method.

    This method is similar to .toString except that it stringifies values according to Show[_] instances, rather than using the universal .toString method.

37. def sortBy[B](f: (A) ⇒ B)(implicit B: Order[B]): NonEmptyVector[A]

    

38. def sorted[AA >: A](implicit AA: Order[AA]): NonEmptyVector[AA]

    

39. def tail: Vector[A]

    

40. def toString(): String

    

    Definition Classes

    NonEmptyVector → Any

41. val toVector: Vector[A]

    

42. def updated[AA >: A](i: Int, a: AA): Option[NonEmptyVector[AA]]

    

    Updates the element at the index, if it exists

43. def updatedUnsafe[AA >: A](i: Int, a: AA): NonEmptyVector[AA]

    

    Updates the element at the index, or throws an IndexOutOfBoundsException if none exists (if i does not satisfy 0 <= i < length).

44. def zipWith[B, C](b: NonEmptyVector[B])(f: (A, B) ⇒ C): NonEmptyVector[C]

    

    Zips this NonEmptyVector with another NonEmptyVector and applies a function for each pair of elements.

    Zips this NonEmptyVector with another NonEmptyVector and applies a function for each pair of elements.

    scala> import cats.data.NonEmptyVector
    scala> val as = NonEmptyVector.of(1, 2, 3)
    scala> val bs = NonEmptyVector.of("A", "B", "C")
    scala> as.zipWith(bs)(_ + _)
    res0: cats.data.NonEmptyVector[String] = NonEmptyVector(1A, 2B, 3C)

45. def zipWithIndex: NonEmptyVector[(A, Int)]