final class NonEmptyVector[+T] extends AnyVal
A non-empty list: an ordered, immutable, non-empty collection of elements with LinearSeq performance characteristics.
The purpose of NonEmptyVector is to allow you to express in a type that a Vector is non-empty, thereby eliminating the
need for (and potential exception from) a run-time check for non-emptiness. For a non-empty sequence with IndexedSeq
performance, see Every.
 Constructing NonEmptyVectors 
You can construct a NonEmptyVector by passing one or more elements to the NonEmptyVector.apply factory method:
scala> NonEmptyVector(1, 2, 3) res0: org.scalactic.anyvals.NonEmptyVector[Int] = NonEmptyVector(1, 2, 3)
Alternatively you can cons elements onto the End singleton object, similar to making a Vector starting with Nil:
scala> 1 :: 2 :: 3 :: Nil res0: Vector[Int] = Vector(1, 2, 3)
scala> 1 :: 2 :: 3 :: End res1: org.scalactic.NonEmptyVector[Int] = NonEmptyVector(1, 2, 3)
Note that although Nil is a Vector[Nothing], End is
not a NonEmptyVector[Nothing], because no empty NonEmptyVector exists. (A non-empty list is a series
of connected links; if you have no links, you have no non-empty list.)
scala> val nil: Vector[Nothing] = Nil nil: Vector[Nothing] = Vector()
scala> val nada: NonEmptyVector[Nothing] = End <console>:16: error: type mismatch; found : org.scalactic.anyvals.End.type required: org.scalactic.anyvals.NonEmptyVector[Nothing] val nada: NonEmptyVector[Nothing] = End ^
 Working with NonEmptyVectors 
NonEmptyVector does not extend Scala's Seq or Traversable traits because these require that
implementations may be empty. For example, if you invoke tail on a Seq that contains just one element,
you'll get an empty Seq:
scala> Vector(1).tail res6: Vector[Int] = Vector()
On the other hand, many useful methods exist on Seq that when invoked on a non-empty Seq are guaranteed
to not result in an empty Seq. For convenience, NonEmptyVector defines a method corresponding to every such Seq
method. Here are some examples:
NonEmptyVector(1, 2, 3).map(_ + 1) // Result: NonEmptyVector(2, 3, 4) NonEmptyVector(1).map(_ + 1) // Result: NonEmptyVector(2) NonEmptyVector(1, 2, 3).containsSlice(NonEmptyVector(2, 3)) // Result: true NonEmptyVector(1, 2, 3).containsSlice(NonEmptyVector(3, 4)) // Result: false NonEmptyVector(-1, -2, 3, 4, 5).minBy(_.abs) // Result: -1
NonEmptyVector does not currently define any methods corresponding to Seq methods that could result in
an empty Seq. However, an implicit converison from NonEmptyVector to Vector
is defined in the NonEmptyVector companion object that will be applied if you attempt to call one of the missing methods. As a
result, you can invoke filter on an NonEmptyVector, even though filter could result
in an empty sequence—but the result type will be Vector instead of NonEmptyVector:
NonEmptyVector(1, 2, 3).filter(_ < 10) // Result: Vector(1, 2, 3) NonEmptyVector(1, 2, 3).filter(_ > 10) // Result: Vector()
You can use NonEmptyVectors in for expressions. The result will be an NonEmptyVector unless
you use a filter (an if clause). Because filters are desugared to invocations of filter, the
result type will switch to a Vector at that point. Here are some examples:
scala> import org.scalactic.anyvals._
import org.scalactic.anyvals._
scala> for (i <- NonEmptyVector(1, 2, 3)) yield i + 1
res0: org.scalactic.anyvals.NonEmptyVector[Int] = NonEmptyVector(2, 3, 4)
scala> for (i <- NonEmptyVector(1, 2, 3) if i < 10) yield i + 1
res1: Vector[Int] = Vector(2, 3, 4)
scala> for {
     |   i <- NonEmptyVector(1, 2, 3)
     |   j <- NonEmptyVector('a', 'b', 'c')
     | } yield (i, j)
res3: org.scalactic.anyvals.NonEmptyVector[(Int, Char)] =
        NonEmptyVector((1,a), (1,b), (1,c), (2,a), (2,b), (2,c), (3,a), (3,b), (3,c))
scala> for {
     |   i <- NonEmptyVector(1, 2, 3) if i < 10
     |   j <- NonEmptyVector('a', 'b', 'c')
     | } yield (i, j)
res6: Vector[(Int, Char)] =
        Vector((1,a), (1,b), (1,c), (2,a), (2,b), (2,c), (3,a), (3,b), (3,c))
- T
 the type of elements contained in this
NonEmptyVector
- Source
 - NonEmptyVector.scala
 
- Alphabetic
 - By Inheritance
 
- NonEmptyVector
 - AnyVal
 - Any
 
- Hide All
 - Show All
 
- Public
 - Protected
 
Value Members
-   final  def !=(arg0: Any): Boolean
- Definition Classes
 - Any
 
 -   final  def ##: Int
- Definition Classes
 - Any
 
 -    def ++[U >: T](other: GenTraversableOnce[U]): NonEmptyVector[U]
Returns a new
NonEmptyVectorcontaining the elements of thisNonEmptyVectorfollowed by the elements of the passedGenTraversableOnce.Returns a new
NonEmptyVectorcontaining the elements of thisNonEmptyVectorfollowed by the elements of the passedGenTraversableOnce. The element type of the resultingNonEmptyVectoris the most specific superclass encompassing the element types of thisNonEmptyVectorand the passedGenTraversableOnce.- U
 the element type of the returned
NonEmptyVector- other
 the
GenTraversableOnceto append- returns
 a new
NonEmptyVectorthat contains all the elements of thisNonEmptyVectorfollowed by all elements ofother.
 -    def ++[U >: T](other: Every[U]): NonEmptyVector[U]
Returns a new
NonEmptyVectorcontaining the elements of thisNonEmptyVectorfollowed by the elements of the passedEvery.Returns a new
NonEmptyVectorcontaining the elements of thisNonEmptyVectorfollowed by the elements of the passedEvery. The element type of the resultingNonEmptyVectoris the most specific superclass encompassing the element types of thisNonEmptyVectorand the passedEvery.- U
 the element type of the returned
NonEmptyVector- other
 the
Everyto append- returns
 a new
NonEmptyVectorthat contains all the elements of thisNonEmptyVectorfollowed by all elements ofother.
 -    def ++[U >: T](other: NonEmptyVector[U]): NonEmptyVector[U]
Returns a new
NonEmptyVectorcontaining the elements of thisNonEmptyVectorfollowed by the elements of the passedNonEmptyVector.Returns a new
NonEmptyVectorcontaining the elements of thisNonEmptyVectorfollowed by the elements of the passedNonEmptyVector. The element type of the resultingNonEmptyVectoris the most specific superclass encompassing the element types of this and the passedNonEmptyVector.- U
 the element type of the returned
NonEmptyVector- other
 the
NonEmptyVectorto append- returns
 a new
NonEmptyVectorthat contains all the elements of thisNonEmptyVectorfollowed by all elements ofother.
 -   final  def +:[U >: T](element: U): NonEmptyVector[U]
Returns a new
NonEmptyVectorwith the given element prepended.Returns a new
NonEmptyVectorwith the given element prepended.Note that :-ending operators are right associative. A mnemonic for
+:vs.:+is: the COLon goes on the COLlection side.- element
 the element to prepend to this
NonEmptyVector- returns
 a new
NonEmptyVectorconsisting ofelementfollowed by all elements of thisNonEmptyVector.
 -    def :+[U >: T](element: U): NonEmptyVector[U]
Returns a new
NonEmptyVectorwith the given element appended.Returns a new
NonEmptyVectorwith the given element appended.Note a mnemonic for
+:vs.:+is: the COLon goes on the COLlection side.- element
 the element to append to this
NonEmptyVector- returns
 a new
NonEmptyVectorconsisting of all elements of thisNonEmptyVectorfollowed byelement.
 -   final  def ::[U >: T](element: U): NonEmptyVector[U]
Adds an element to the beginning of this
NonEmptyVector.Adds an element to the beginning of this
NonEmptyVector.Note that :-ending operators are right associative. A mnemonic for
+:vs.:+is: the COLon goes on the COLlection side.- element
 the element to prepend to this
NonEmptyVector- returns
 a
NonEmptyVectorthat containselementas first element and that continues with thisNonEmptyVector.
 -   final  def ==(arg0: Any): Boolean
- Definition Classes
 - Any
 
 -   final  def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder
Appends all elements of this
NonEmptyVectorto a string builder using start, end, and separator strings.Appends all elements of this
NonEmptyVectorto a string builder using start, end, and separator strings. The written text will consist of a concatenation of the stringstart; the result of invokingtoStringon all elements of thisNonEmptyVector, separated by the stringsep; and the stringend- sb
 the string builder to which elements will be appended
- start
 the ending string
- sep
 the separator string
- returns
 the string builder,
sb, to which elements were appended.
 -   final  def addString(sb: StringBuilder, sep: String): StringBuilder
Appends all elements of this
NonEmptyVectorto a string builder using a separator string.Appends all elements of this
NonEmptyVectorto a string builder using a separator string. The written text will consist of a concatenation of the result of invokingtoStringon of every element of thisNonEmptyVector, separated by the stringsep.- sb
 the string builder to which elements will be appended
- sep
 the separator string
- returns
 the string builder,
sb, to which elements were appended.
 -   final  def addString(sb: StringBuilder): StringBuilder
Appends all elements of this
NonEmptyVectorto a string builder.Appends all elements of this
NonEmptyVectorto a string builder. The written text will consist of a concatenation of the result of invokingtoStringon of every element of thisNonEmptyVector, without any separator string.- sb
 the string builder to which elements will be appended
- returns
 the string builder,
sb, to which elements were appended.
 -   final  def apply(idx: Int): T
Selects an element by its index in the
NonEmptyVector.Selects an element by its index in the
NonEmptyVector.- returns
 the element of this
NonEmptyVectorat indexidx, where 0 indicates the first element.
 -   final  def asInstanceOf[T0]: T0
- Definition Classes
 - Any
 
 -   final  def collectFirst[U](pf: PartialFunction[T, U]): Option[U]
Finds the first element of this
NonEmptyVectorfor which the given partial function is defined, if any, and applies the partial function to it.Finds the first element of this
NonEmptyVectorfor which the given partial function is defined, if any, and applies the partial function to it.- pf
 the partial function
- returns
 an
Optioncontainingpfapplied to the first element for which it is defined, orNoneif the partial function was not defined for any element.
 -   final  def contains(elem: Any): Boolean
Indicates whether this
NonEmptyVectorcontains a given value as an element.Indicates whether this
NonEmptyVectorcontains a given value as an element.- elem
 the element to look for
- returns
 true if this
NonEmptyVectorhas an element that is equal (as determined by==)toelem, false otherwise.
 -   final  def containsSlice[B](that: NonEmptyVector[B]): Boolean
Indicates whether this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.Indicates whether this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.- that
 the
NonEmptyVectorslice to look for- returns
 true if this
NonEmptyVectorcontains a slice with the same elements asthat, otherwisefalse.
 -   final  def containsSlice[B](that: Every[B]): Boolean
Indicates whether this
NonEmptyVectorcontains a givenEveryas a slice.Indicates whether this
NonEmptyVectorcontains a givenEveryas a slice.- that
 the
Everyslice to look for- returns
 true if this
NonEmptyVectorcontains a slice with the same elements asthat, otherwisefalse.
 -   final  def containsSlice[B](that: GenSeq[B]): Boolean
Indicates whether this
NonEmptyVectorcontains a givenGenSeqas a slice.Indicates whether this
NonEmptyVectorcontains a givenGenSeqas a slice.- that
 the
GenSeqslice to look for- returns
 true if this
NonEmptyVectorcontains a slice with the same elements asthat, otherwisefalse.
 -   final  def copyToArray[U >: T](arr: Array[U], start: Int, len: Int): Unit
Copies values of this
NonEmptyVectorto an array.Copies values of this
NonEmptyVectorto an array. Fills the given arrayarrwith at mostlenelements of thisNonEmptyVector, beginning at indexstart. Copying will stop once either the end of the currentNonEmptyVectoris reached, the end of the array is reached, orlenelements have been copied.- arr
 the array to fill
- start
 the starting index
- len
 the maximum number of elements to copy
 -   final  def copyToArray[U >: T](arr: Array[U], start: Int): Unit
Copies values of this
NonEmptyVectorto an array.Copies values of this
NonEmptyVectorto an array. Fills the given arrayarrwith values of thisNonEmptyVector, beginning at indexstart. Copying will stop once either the end of the currentNonEmptyVectoris reached, or the end of the array is reached.- arr
 the array to fill
- start
 the starting index
 -   final  def copyToArray[U >: T](arr: Array[U]): Unit
Copies values of this
NonEmptyVectorto an array.Copies values of this
NonEmptyVectorto an array. Fills the given arrayarrwith values of thisNonEmptyVector. Copying will stop once either the end of the currentNonEmptyVectoris reached, or the end of the array is reached.- arr
 the array to fill
 -   final  def copyToBuffer[U >: T](buf: Buffer[U]): Unit
Copies all elements of this
NonEmptyVectorto a buffer.Copies all elements of this
NonEmptyVectorto a buffer.- buf
 the buffer to which elements are copied
 -   final  def corresponds[B](that: NonEmptyVector[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this
NonEmptyVectorrelates to the corresponding element of a givenNonEmptyVectorby satisfying a given predicate.Indicates whether every element of this
NonEmptyVectorrelates to the corresponding element of a givenNonEmptyVectorby satisfying a given predicate.- B
 the type of the elements of
that- that
 the
NonEmptyVectorto compare for correspondence- p
 the predicate, which relates elements from this and the passed
NonEmptyVector- returns
 true if this and the passed
NonEmptyVectorhave the same length andp(x, y)istruefor all corresponding elementsxof thisNonEmptyVectorandyof that, otherwisefalse.
 -   final  def corresponds[B](that: Every[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this
NonEmptyVectorrelates to the corresponding element of a givenEveryby satisfying a given predicate.Indicates whether every element of this
NonEmptyVectorrelates to the corresponding element of a givenEveryby satisfying a given predicate.- B
 the type of the elements of
that- that
 the
Everyto compare for correspondence- p
 the predicate, which relates elements from this
NonEmptyVectorand the passedEvery- returns
 true if this
NonEmptyVectorand the passedEveryhave the same length andp(x, y)istruefor all corresponding elementsxof thisNonEmptyVectorandyof that, otherwisefalse.
 -   final  def corresponds[B](that: GenSeq[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this
NonEmptyVectorrelates to the corresponding element of a givenGenSeqby satisfying a given predicate.Indicates whether every element of this
NonEmptyVectorrelates to the corresponding element of a givenGenSeqby satisfying a given predicate.- B
 the type of the elements of
that- that
 the
GenSeqto compare for correspondence- p
 the predicate, which relates elements from this
NonEmptyVectorand the passedGenSeq- returns
 true if this
NonEmptyVectorand the passedGenSeqhave the same length andp(x, y)istruefor all corresponding elementsxof thisNonEmptyVectorandyof that, otherwisefalse.
 -   final  def count(p: (T) => Boolean): Int
Counts the number of elements in this
NonEmptyVectorthat satisfy a predicate.Counts the number of elements in this
NonEmptyVectorthat satisfy a predicate.- p
 the predicate used to test elements.
- returns
 the number of elements satisfying the predicate
p.
 -   final  def distinct: NonEmptyVector[T]
Builds a new
NonEmptyVectorfrom thisNonEmptyVectorwithout any duplicate elements.Builds a new
NonEmptyVectorfrom thisNonEmptyVectorwithout any duplicate elements.- returns
 A new
NonEmptyVectorthat contains the first occurrence of every element of thisNonEmptyVector.
 -   final  def endsWith[B](that: NonEmptyVector[B]): Boolean
Indicates whether this
NonEmptyVectorends with the givenNonEmptyVector.Indicates whether this
NonEmptyVectorends with the givenNonEmptyVector.- that
 the
NonEmptyVectorto test- returns
 trueif thisNonEmptyVectorhasthatas a suffix,falseotherwise.
 -   final  def endsWith[B](that: Every[B]): Boolean
Indicates whether this
NonEmptyVectorends with the givenEvery.Indicates whether this
NonEmptyVectorends with the givenEvery.- that
 the
Everyto test- returns
 trueif thisNonEmptyVectorhasthatas a suffix,falseotherwise.
 -   final  def endsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
NonEmptyVectorends with the givenGenSeq.Indicates whether this
NonEmptyVectorends with the givenGenSeq.- that
 the sequence to test
- returns
 trueif thisNonEmptyVectorhasthatas a suffix,falseotherwise.
 -   final  def exists(p: (T) => Boolean): Boolean
Indicates whether a predicate holds for at least one of the elements of this
NonEmptyVector.Indicates whether a predicate holds for at least one of the elements of this
NonEmptyVector.- returns
 trueif the given predicatepholds for some of the elements of thisNonEmptyVector, otherwisefalse.
 -   final  def find(p: (T) => Boolean): Option[T]
Finds the first element of this
NonEmptyVectorthat satisfies the given predicate, if any.Finds the first element of this
NonEmptyVectorthat satisfies the given predicate, if any.- p
 the predicate used to test elements
- returns
 an
Somecontaining the first element in thisNonEmptyVectorthat satisfiesp, orNoneif none exists.
 -   final  def flatMap[U](f: (T) => NonEmptyVector[U]): NonEmptyVector[U]
Builds a new
NonEmptyVectorby applying a function to all elements of thisNonEmptyVectorand using the elements of the resultingNonEmptyVectors.Builds a new
NonEmptyVectorby applying a function to all elements of thisNonEmptyVectorand using the elements of the resultingNonEmptyVectors.- U
 the element type of the returned
NonEmptyVector- f
 the function to apply to each element.
- returns
 a new
NonEmptyVectorcontaining elements obtained by applying the given functionfto each element of thisNonEmptyVectorand concatenating the elements of resultingNonEmptyVectors.
 -   final  def flatten[B](implicit ev: <:<[T, NonEmptyVector[B]]): NonEmptyVector[B]
Converts this
NonEmptyVectorofNonEmptyVectors into aNonEmptyVectorformed by the elements of the nestedNonEmptyVectors.Converts this
NonEmptyVectorofNonEmptyVectors into aNonEmptyVectorformed by the elements of the nestedNonEmptyVectors.Note: You cannot use this
flattenmethod on aNonEmptyVectorthat contains aGenTraversableOnces, because if all the nestedGenTraversableOnces were empty, you'd end up with an emptyNonEmptyVector.- returns
 a new
NonEmptyVectorresulting from concatenating all nestedNonEmptyVectors.
 -   final  def fold[U >: T](z: U)(op: (U, U) => U): U
Folds the elements of this
NonEmptyVectorusing the specified associative binary operator.Folds the elements of this
NonEmptyVectorusing the specified associative binary operator.The order in which operations are performed on elements is unspecified and may be nondeterministic.
- U
 a type parameter for the binary operator, a supertype of T.
- z
 a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g.,
Nilfor list concatenation, 0 for addition, or 1 for multiplication.)- op
 a binary operator that must be associative
- returns
 the result of applying fold operator
opbetween all the elements andz
 -   final  def foldLeft[B](z: B)(op: (B, T) => B): B
Applies a binary operator to a start value and all elements of this
NonEmptyVector, going left to right.Applies a binary operator to a start value and all elements of this
NonEmptyVector, going left to right.- B
 the result type of the binary operator.
- z
 the start value.
- op
 the binary operator.
- returns
 the result of inserting
opbetween consecutive elements of thisNonEmptyVector, going left to right, with the start value,z, on the left:op(...op(op(z, x_1), x_2), ..., x_n)
where x1, ..., xn are the elements of thisNonEmptyVector.
 -   final  def foldRight[B](z: B)(op: (T, B) => B): B
Applies a binary operator to all elements of this
NonEmptyVectorand a start value, going right to left.Applies a binary operator to all elements of this
NonEmptyVectorand a start value, going right to left.- B
 the result of the binary operator
- z
 the start value
- op
 the binary operator
- returns
 the result of inserting
opbetween consecutive elements of thisNonEmptyVector, going right to left, with the start value,z, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x1, ..., xn are the elements of thisNonEmptyVector.
 -   final  def forall(p: (T) => Boolean): Boolean
Indicates whether a predicate holds for all elements of this
NonEmptyVector.Indicates whether a predicate holds for all elements of this
NonEmptyVector.- p
 the predicate used to test elements.
- returns
 trueif the given predicatepholds for all elements of thisNonEmptyVector, otherwisefalse.
 -   final  def foreach(f: (T) => Unit): Unit
Applies a function
fto all elements of thisNonEmptyVector.Applies a function
fto all elements of thisNonEmptyVector.- f
 the function that is applied for its side-effect to every element. The result of function
fis discarded.
 -    def getClass(): Class[_ <: AnyVal]
- Definition Classes
 - AnyVal → Any
 
 -   final  def groupBy[K](f: (T) => K): Map[K, NonEmptyVector[T]]
Partitions this
NonEmptyVectorinto a map ofNonEmptyVectors according to some discriminator function.Partitions this
NonEmptyVectorinto a map ofNonEmptyVectors according to some discriminator function.- K
 the type of keys returned by the discriminator function.
- f
 the discriminator function.
- returns
 A map from keys to
NonEmptyVectors such that the following invariant holds:(nonEmptyVector.toVector partition f)(k) = xs filter (x => f(x) == k)
That is, every keykis bound to aNonEmptyVectorof those elementsxfor whichf(x)equalsk.
 -   final  def grouped(size: Int): Iterator[NonEmptyVector[T]]
Partitions elements into fixed size
NonEmptyVectors.Partitions elements into fixed size
NonEmptyVectors.- size
 the number of elements per group
- returns
 An iterator producing
NonEmptyVectors of sizesize, except the last will be truncated if the elements don't divide evenly.
 -   final  def hasDefiniteSize: Boolean
Returns
trueto indicate thisNonEmptyVectorhas a definite size, since allNonEmptyVectors are strict collections. -   final  def head: T
Selects the first element of this
NonEmptyVector.Selects the first element of this
NonEmptyVector.- returns
 the first element of this
NonEmptyVector.
 -   final  def headOption: Option[T]
Selects the first element of this
NonEmptyVectorand returns it wrapped in aSome.Selects the first element of this
NonEmptyVectorand returns it wrapped in aSome.- returns
 the first element of this
NonEmptyVector, wrapped in aSome.
 -   final  def indexOf[U >: T](elem: U, from: Int): Int
Finds index of first occurrence of some value in this
NonEmptyVectorafter or at some start index.Finds index of first occurrence of some value in this
NonEmptyVectorafter or at some start index.- elem
 the element value to search for.
- from
 the start index
- returns
 the index
>=fromof the first element of thisNonEmptyVectorthat is equal (as determined by==) toelem, or-1, if none exists.
 -   final  def indexOf[U >: T](elem: U): Int
Finds index of first occurrence of some value in this
NonEmptyVector.Finds index of first occurrence of some value in this
NonEmptyVector.- elem
 the element value to search for.
- returns
 the index of the first element of this
NonEmptyVectorthat is equal (as determined by==) toelem, or-1, if none exists.
 -   final  def indexOfSlice[U >: T](that: NonEmptyVector[U], from: Int): Int
Finds first index after or at a start index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.Finds first index after or at a start index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.- that
 the
NonEmptyVectordefining the slice to look for- from
 the start index
- returns
 the first index
>=fromsuch that the elements of thisNonEmptyVectorstarting at this index match the elements ofNonEmptyVectorthat, or-1of no such subsequence exists.
 -   final  def indexOfSlice[U >: T](that: Every[U], from: Int): Int
Finds first index after or at a start index where this
NonEmptyVectorcontains a givenEveryas a slice.Finds first index after or at a start index where this
NonEmptyVectorcontains a givenEveryas a slice.- that
 the
Everydefining the slice to look for- from
 the start index
- returns
 the first index
>=fromsuch that the elements of thisNonEmptyVectorstarting at this index match the elements ofEverythat, or-1of no such subsequence exists.
 -   final  def indexOfSlice[U >: T](that: NonEmptyVector[U]): Int
Finds first index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.Finds first index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.- that
 the
NonEmptyVectordefining the slice to look for- returns
 the first index such that the elements of this
NonEmptyVectorstarting at this index match the elements ofNonEmptyVectorthat, or-1of no such subsequence exists.
 -   final  def indexOfSlice[U >: T](that: Every[U]): Int
Finds first index where this
NonEmptyVectorcontains a givenEveryas a slice.Finds first index where this
NonEmptyVectorcontains a givenEveryas a slice.- that
 the
Everydefining the slice to look for- returns
 the first index such that the elements of this
NonEmptyVectorstarting at this index match the elements ofEverythat, or-1of no such subsequence exists.
 -   final  def indexOfSlice[U >: T](that: GenSeq[U], from: Int): Int
Finds first index after or at a start index where this
NonEmptyVectorcontains a givenGenSeqas a slice.Finds first index after or at a start index where this
NonEmptyVectorcontains a givenGenSeqas a slice.- that
 the
GenSeqdefining the slice to look for- from
 the start index
- returns
 the first index
>=fromat which the elements of thisNonEmptyVectorstarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
 -   final  def indexOfSlice[U >: T](that: GenSeq[U]): Int
Finds first index where this
NonEmptyVectorcontains a givenGenSeqas a slice.Finds first index where this
NonEmptyVectorcontains a givenGenSeqas a slice.- that
 the
GenSeqdefining the slice to look for- returns
 the first index at which the elements of this
NonEmptyVectorstarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
 -   final  def indexWhere(p: (T) => Boolean, from: Int): Int
Finds index of the first element satisfying some predicate after or at some start index.
Finds index of the first element satisfying some predicate after or at some start index.
- p
 the predicate used to test elements.
- from
 the start index
- returns
 the index
>=fromof the first element of thisNonEmptyVectorthat satisfies the predicatep, or-1, if none exists.
 -   final  def indexWhere(p: (T) => Boolean): Int
Finds index of the first element satisfying some predicate.
Finds index of the first element satisfying some predicate.
- p
 the predicate used to test elements.
- returns
 the index of the first element of this
NonEmptyVectorthat satisfies the predicatep, or-1, if none exists.
 -   final  def indices: Range
Produces the range of all indices of this
NonEmptyVector.Produces the range of all indices of this
NonEmptyVector.- returns
 a
Rangevalue from0to one less than the length of thisNonEmptyVector.
 -   final  def isDefinedAt(idx: Int): Boolean
Tests whether this
NonEmptyVectorcontains given index.Tests whether this
NonEmptyVectorcontains given index.- idx
 the index to test
- returns
 true if this
NonEmptyVectorcontains an element at positionidx,falseotherwise.
 -   final  def isEmpty: Boolean
Returns
falseto indicate thisNonEmptyVector, like allNonEmptyVectors, is non-empty.Returns
falseto indicate thisNonEmptyVector, like allNonEmptyVectors, is non-empty.- returns
 false
 -   final  def isInstanceOf[T0]: Boolean
- Definition Classes
 - Any
 
 -   final  def isTraversableAgain: Boolean
Returns
trueto indicate thisNonEmptyVector, like allNonEmptyVectors, can be traversed repeatedly.Returns
trueto indicate thisNonEmptyVector, like allNonEmptyVectors, can be traversed repeatedly.- returns
 true
 -   final  def iterator: Iterator[T]
Creates and returns a new iterator over all elements contained in this
NonEmptyVector.Creates and returns a new iterator over all elements contained in this
NonEmptyVector.- returns
 the new iterator
 -   final  def last: T
Selects the last element of this
NonEmptyVector.Selects the last element of this
NonEmptyVector.- returns
 the last element of this
NonEmptyVector.
 -   final  def lastIndexOf[U >: T](elem: U, end: Int): Int
Finds the index of the last occurrence of some value in this
NonEmptyVectorbefore or at a givenendindex.Finds the index of the last occurrence of some value in this
NonEmptyVectorbefore or at a givenendindex.- elem
 the element value to search for.
- end
 the end index.
- returns
 the index
>=endof the last element of thisNonEmptyVectorthat is equal (as determined by==) toelem, or-1, if none exists.
 -   final  def lastIndexOf[U >: T](elem: U): Int
Finds the index of the last occurrence of some value in this
NonEmptyVector.Finds the index of the last occurrence of some value in this
NonEmptyVector.- elem
 the element value to search for.
- returns
 the index of the last element of this
NonEmptyVectorthat is equal (as determined by==) toelem, or-1, if none exists.
 -   final  def lastIndexOfSlice[U >: T](that: NonEmptyVector[U], end: Int): Int
Finds the last index before or at a given end index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.Finds the last index before or at a given end index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.- that
 the
NonEmptyVectordefining the slice to look for- end
 the end index
- returns
 the last index
>=endat which the elements of thisNonEmptyVectorstarting at that index match the elements ofNonEmptyVectorthat, or-1of no such subsequence exists.
 -   final  def lastIndexOfSlice[U >: T](that: Every[U], end: Int): Int
Finds the last index before or at a given end index where this
NonEmptyVectorcontains a givenEveryas a slice.Finds the last index before or at a given end index where this
NonEmptyVectorcontains a givenEveryas a slice.- that
 the
Everydefining the slice to look for- end
 the end index
- returns
 the last index
>=endat which the elements of thisNonEmptyVectorstarting at that index match the elements ofEverythat, or-1of no such subsequence exists.
 -   final  def lastIndexOfSlice[U >: T](that: NonEmptyVector[U]): Int
Finds the last index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.Finds the last index where this
NonEmptyVectorcontains a givenNonEmptyVectoras a slice.- that
 the
NonEmptyVectordefining the slice to look for- returns
 the last index at which the elements of this
NonEmptyVectorstarting at that index match the elements ofNonEmptyVectorthat, or-1of no such subsequence exists.
 -   final  def lastIndexOfSlice[U >: T](that: Every[U]): Int
Finds the last index where this
NonEmptyVectorcontains a givenEveryas a slice.Finds the last index where this
NonEmptyVectorcontains a givenEveryas a slice.- that
 the
Everydefining the slice to look for- returns
 the last index at which the elements of this
NonEmptyVectorstarting at that index match the elements ofEverythat, or-1of no such subsequence exists.
 -   final  def lastIndexOfSlice[U >: T](that: GenSeq[U], end: Int): Int
Finds the last index before or at a given end index where this
NonEmptyVectorcontains a givenGenSeqas a slice.Finds the last index before or at a given end index where this
NonEmptyVectorcontains a givenGenSeqas a slice.- that
 the
GenSeqdefining the slice to look for- end
 the end index
- returns
 the last index
>=endat which the elements of thisNonEmptyVectorstarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
 -   final  def lastIndexOfSlice[U >: T](that: GenSeq[U]): Int
Finds the last index where this
NonEmptyVectorcontains a givenGenSeqas a slice.Finds the last index where this
NonEmptyVectorcontains a givenGenSeqas a slice.- that
 the
GenSeqdefining the slice to look for- returns
 the last index at which the elements of this
NonEmptyVectorstarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
 -   final  def lastIndexWhere(p: (T) => Boolean, end: Int): Int
Finds index of last element satisfying some predicate before or at given end index.
Finds index of last element satisfying some predicate before or at given end index.
- p
 the predicate used to test elements.
- end
 the end index
- returns
 the index
>=endof the last element of thisNonEmptyVectorthat satisfies the predicatep, or-1, if none exists.
 -   final  def lastIndexWhere(p: (T) => Boolean): Int
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
- p
 the predicate used to test elements.
- returns
 the index of the last element of this
NonEmptyVectorthat satisfies the predicatep, or-1, if none exists.
 -   final  def lastOption: Option[T]
Returns the last element of this
NonEmptyVector, wrapped in aSome.Returns the last element of this
NonEmptyVector, wrapped in aSome.- returns
 the last element, wrapped in a
Some.
 -   final  def length: Int
The length of this
NonEmptyVector.The length of this
NonEmptyVector.Note:
lengthandsizeyield the same result, which will be>= 1.- returns
 the number of elements in this
NonEmptyVector.
 -   final  def lengthCompare(len: Int): Int
Compares the length of this
NonEmptyVectorto a test value.Compares the length of this
NonEmptyVectorto a test value.- len
 the test value that gets compared with the length.
- returns
 a value
xwherex < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len
 -   final  def map[U](f: (T) => U): NonEmptyVector[U]
Builds a new
NonEmptyVectorby applying a function to all elements of thisNonEmptyVector.Builds a new
NonEmptyVectorby applying a function to all elements of thisNonEmptyVector.- U
 the element type of the returned
NonEmptyVector.- f
 the function to apply to each element.
- returns
 a new
NonEmptyVectorresulting from applying the given functionfto each element of thisNonEmptyVectorand collecting the results.
 -   final  def max[U >: T](implicit cmp: Ordering[U]): T
Finds the largest element.
Finds the largest element.
- returns
 the largest element of this
NonEmptyVector.
 -   final  def maxBy[U](f: (T) => U)(implicit cmp: Ordering[U]): T
Finds the largest result after applying the given function to every element.
Finds the largest result after applying the given function to every element.
- returns
 the largest result of applying the given function to every element of this
NonEmptyVector.
 -   final  def min[U >: T](implicit cmp: Ordering[U]): T
Finds the smallest element.
Finds the smallest element.
- returns
 the smallest element of this
NonEmptyVector.
 -   final  def minBy[U](f: (T) => U)(implicit cmp: Ordering[U]): T
Finds the smallest result after applying the given function to every element.
Finds the smallest result after applying the given function to every element.
- returns
 the smallest result of applying the given function to every element of this
NonEmptyVector.
 -   final  def mkString(start: String, sep: String, end: String): String
Displays all elements of this
NonEmptyVectorin a string using start, end, and separator strings.Displays all elements of this
NonEmptyVectorin a string using start, end, and separator strings.- start
 the starting string.
- sep
 the separator string.
- end
 the ending string.
- returns
 a string representation of this
NonEmptyVector. The resulting string begins with the stringstartand ends with the stringend. Inside, In the resulting string, the result of invokingtoStringon all elements of thisNonEmptyVectorare separated by the stringsep.
 -   final  def mkString(sep: String): String
Displays all elements of this
NonEmptyVectorin a string using a separator string.Displays all elements of this
NonEmptyVectorin a string using a separator string.- sep
 the separator string
- returns
 a string representation of this
NonEmptyVector. In the resulting string, the result of invokingtoStringon all elements of thisNonEmptyVectorare separated by the stringsep.
 -   final  def mkString: String
Displays all elements of this
NonEmptyVectorin a string.Displays all elements of this
NonEmptyVectorin a string.- returns
 a string representation of this
NonEmptyVector. In the resulting string, the result of invokingtoStringon all elements of thisNonEmptyVectorfollow each other without any separator string.
 -   final  def nonEmpty: Boolean
Returns
trueto indicate thisNonEmptyVector, like allNonEmptyVectors, is non-empty.Returns
trueto indicate thisNonEmptyVector, like allNonEmptyVectors, is non-empty.- returns
 true
 -   final  def padTo[U >: T](len: Int, elem: U): NonEmptyVector[U]
A copy of this
NonEmptyVectorwith an element value appended until a given target length is reached.A copy of this
NonEmptyVectorwith an element value appended until a given target length is reached.- len
 the target length
- elem
 he padding value
- returns
 a new
NonEmptyVectorconsisting of all elements of thisNonEmptyVectorfollowed by the minimal number of occurrences ofelemso that the resultingNonEmptyVectorhas a length of at leastlen.
 -   final  def patch[U >: T](from: Int, that: NonEmptyVector[U], replaced: Int): NonEmptyVector[U]
Produces a new
NonEmptyVectorwhere a slice of elements in thisNonEmptyVectoris replaced by anotherNonEmptyVectorProduces a new
NonEmptyVectorwhere a slice of elements in thisNonEmptyVectoris replaced by anotherNonEmptyVector- from
 the index of the first replaced element
- that
 the
NonEmptyVectorwhose elements should replace a slice in thisNonEmptyVector- replaced
 the number of elements to drop in the original
NonEmptyVector
 -   final  def permutations: Iterator[NonEmptyVector[T]]
Iterates over distinct permutations.
Iterates over distinct permutations.
Here's an example:
NonEmptyVector('a', 'b', 'b').permutations.toVector = Vector(NonEmptyVector(a, b, b), NonEmptyVector(b, a, b), NonEmptyVector(b, b, a))
- returns
 an iterator that traverses the distinct permutations of this
NonEmptyVector.
 -   final  def prefixLength(p: (T) => Boolean): Int
Returns the length of the longest prefix whose elements all satisfy some predicate.
Returns the length of the longest prefix whose elements all satisfy some predicate.
- p
 the predicate used to test elements.
- returns
 the length of the longest prefix of this
NonEmptyVectorsuch that every element of the segment satisfies the predicatep.
 -   final  def product[U >: T](implicit num: Numeric[U]): U
The result of multiplying all the elements of this
NonEmptyVector.The result of multiplying all the elements of this
NonEmptyVector.This method can be invoked for any
NonEmptyVector[T]for which an implicitNumeric[T]exists.- returns
 the product of all elements
 -   final  def reduce[U >: T](op: (U, U) => U): U
Reduces the elements of this
NonEmptyVectorusing the specified associative binary operator.Reduces the elements of this
NonEmptyVectorusing the specified associative binary operator.The order in which operations are performed on elements is unspecified and may be nondeterministic.
- U
 a type parameter for the binary operator, a supertype of T.
- op
 a binary operator that must be associative.
- returns
 the result of applying reduce operator
opbetween all the elements of thisNonEmptyVector.
 -   final  def reduceLeft[U >: T](op: (U, T) => U): U
Applies a binary operator to all elements of this
NonEmptyVector, going left to right.Applies a binary operator to all elements of this
NonEmptyVector, going left to right.- U
 the result type of the binary operator.
- op
 the binary operator.
- returns
 the result of inserting
opbetween consecutive elements of thisNonEmptyVector, going left to right:op(...op(op(x_1, x_2), x_3), ..., x_n)
where x1, ..., xn are the elements of thisNonEmptyVector.
 -   final  def reduceLeftOption[U >: T](op: (U, T) => U): Option[U]
Applies a binary operator to all elements of this
NonEmptyVector, going left to right, returning the result in aSome.Applies a binary operator to all elements of this
NonEmptyVector, going left to right, returning the result in aSome.- U
 the result type of the binary operator.
- op
 the binary operator.
- returns
 a
Somecontaining the result ofreduceLeft(op)
 -  final def reduceOption[U >: T](op: (U, U) => U): Option[U]
 -   final  def reduceRight[U >: T](op: (T, U) => U): U
Applies a binary operator to all elements of this
NonEmptyVector, going right to left.Applies a binary operator to all elements of this
NonEmptyVector, going right to left.- U
 the result of the binary operator
- op
 the binary operator
- returns
 the result of inserting
opbetween consecutive elements of thisNonEmptyVector, going right to left:op(x_1, op(x_2, ... op(x_{n-1}, x_n)...))where x1, ..., xn are the elements of thisNonEmptyVector.
 -   final  def reduceRightOption[U >: T](op: (T, U) => U): Option[U]
Applies a binary operator to all elements of this
NonEmptyVector, going right to left, returning the result in aSome.Applies a binary operator to all elements of this
NonEmptyVector, going right to left, returning the result in aSome.- U
 the result of the binary operator
- op
 the binary operator
- returns
 a
Somecontaining the result ofreduceRight(op)
 -   final  def reverse: NonEmptyVector[T]
Returns new
NonEmptyVectorwith elements in reverse order.Returns new
NonEmptyVectorwith elements in reverse order.- returns
 a new
NonEmptyVectorwith all elements of thisNonEmptyVectorin reversed order.
 -   final  def reverseIterator: Iterator[T]
An iterator yielding elements in reverse order.
An iterator yielding elements in reverse order.
Note:
nonEmptyVector.reverseIteratoris the same asnonEmptyVector.reverse.iterator, but might be more efficient.- returns
 an iterator yielding the elements of this
NonEmptyVectorin reversed order
 -   final  def reverseMap[U](f: (T) => U): NonEmptyVector[U]
Builds a new
NonEmptyVectorby applying a function to all elements of thisNonEmptyVectorand collecting the results in reverse order.Builds a new
NonEmptyVectorby applying a function to all elements of thisNonEmptyVectorand collecting the results in reverse order.Note:
nonEmptyVector.reverseMap(f)is the same asnonEmptyVector.reverse.map(f), but might be more efficient.- U
 the element type of the returned
NonEmptyVector.- f
 the function to apply to each element.
- returns
 a new
NonEmptyVectorresulting from applying the given functionfto each element of thisNonEmptyVectorand collecting the results in reverse order.
 -   final  def sameElements[U >: T](that: NonEmptyVector[U]): Boolean
Checks if the given
NonEmptyVectorcontains the same elements in the same order as thisNonEmptyVector.Checks if the given
NonEmptyVectorcontains the same elements in the same order as thisNonEmptyVector.- that
 the
NonEmptyVectorwith which to compare- returns
 true, if both this and the givenNonEmptyVectorcontain the same elements in the same order,falseotherwise.
 -   final  def sameElements[U >: T](that: Every[U]): Boolean
Checks if the given
Everycontains the same elements in the same order as thisNonEmptyVector.Checks if the given
Everycontains the same elements in the same order as thisNonEmptyVector.- that
 the
Everywith which to compare- returns
 true, if both this and the givenEverycontain the same elements in the same order,falseotherwise.
 -   final  def sameElements[U >: T](that: GenIterable[U]): Boolean
Checks if the given
GenIterablecontains the same elements in the same order as thisNonEmptyVector.Checks if the given
GenIterablecontains the same elements in the same order as thisNonEmptyVector.- that
 the
GenIterablewith which to compare- returns
 true, if both thisNonEmptyVectorand the givenGenIterablecontain the same elements in the same order,falseotherwise.
 -   final  def scan[U >: T](z: U)(op: (U, U) => U): NonEmptyVector[U]
Computes a prefix scan of the elements of this
NonEmptyVector.Computes a prefix scan of the elements of this
NonEmptyVector.Note: The neutral element z may be applied more than once.
Here are some examples:
NonEmptyVector(1, 2, 3).scan(0)(_ + _) == NonEmptyVector(0, 1, 3, 6) NonEmptyVector(1, 2, 3).scan("z")(_ + _.toString) == NonEmptyVector("z", "z1", "z12", "z123")
- U
 a type parameter for the binary operator, a supertype of T, and the type of the resulting
NonEmptyVector.- z
 a neutral element for the scan operation; may be added to the result an arbitrary number of times, and must not change the result (e.g.,
Nilfor list concatenation, 0 for addition, or 1 for multiplication.)- op
 a binary operator that must be associative
- returns
 a new
NonEmptyVectorcontaining the prefix scan of the elements in thisNonEmptyVector
 -   final  def scanLeft[B](z: B)(op: (B, T) => B): NonEmptyVector[B]
Produces a
NonEmptyVectorcontaining cumulative results of applying the operator going left to right.Produces a
NonEmptyVectorcontaining cumulative results of applying the operator going left to right.Here are some examples:
NonEmptyVector(1, 2, 3).scanLeft(0)(_ + _) == NonEmptyVector(0, 1, 3, 6) NonEmptyVector(1, 2, 3).scanLeft("z")(_ + _) == NonEmptyVector("z", "z1", "z12", "z123")
- B
 the result type of the binary operator and type of the resulting
NonEmptyVector- z
 the start value.
- op
 the binary operator.
- returns
 a new
NonEmptyVectorcontaining the intermediate results of insertingopbetween consecutive elements of thisNonEmptyVector, going left to right, with the start value,z, on the left.
 -   final  def scanRight[B](z: B)(op: (T, B) => B): NonEmptyVector[B]
Produces a
NonEmptyVectorcontaining cumulative results of applying the operator going right to left.Produces a
NonEmptyVectorcontaining cumulative results of applying the operator going right to left.Here are some examples:
NonEmptyVector(1, 2, 3).scanRight(0)(_ + _) == NonEmptyVector(6, 5, 3, 0) NonEmptyVector(1, 2, 3).scanRight("z")(_ + _) == NonEmptyVector("123z", "23z", "3z", "z")
- B
 the result of the binary operator and type of the resulting
NonEmptyVector- z
 the start value
- op
 the binary operator
- returns
 a new
NonEmptyVectorcontaining the intermediate results of insertingopbetween consecutive elements of thisNonEmptyVector, going right to left, with the start value,z, on the right.
 -   final  def segmentLength(p: (T) => Boolean, from: Int): Int
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
- p
 the predicate used to test elements.
- from
 the index where the search starts.
 -   final  def size: Int
The size of this
NonEmptyVector.The size of this
NonEmptyVector.Note:
lengthandsizeyield the same result, which will be>= 1.- returns
 the number of elements in this
NonEmptyVector.
 -   final  def sliding(size: Int, step: Int): Iterator[NonEmptyVector[T]]
Groups elements in fixed size blocks by passing a “sliding window” over them (as opposed to partitioning them, as is done in grouped.), moving the sliding window by a given
stepeach time.Groups elements in fixed size blocks by passing a “sliding window” over them (as opposed to partitioning them, as is done in grouped.), moving the sliding window by a given
stepeach time.- size
 the number of elements per group
- step
 the distance between the first elements of successive groups
- returns
 an iterator producing
NonEmptyVectors of sizesize, except the last and the only element will be truncated if there are fewer elements thansize.
 -   final  def sliding(size: Int): Iterator[NonEmptyVector[T]]
Groups elements in fixed size blocks by passing a “sliding window” over them (as opposed to partitioning them, as is done in grouped.)
Groups elements in fixed size blocks by passing a “sliding window” over them (as opposed to partitioning them, as is done in grouped.)
- size
 the number of elements per group
- returns
 an iterator producing
NonEmptyVectors of sizesize, except the last and the only element will be truncated if there are fewer elements thansize.
 -   final  def sortBy[U](f: (T) => U)(implicit ord: Ordering[U]): NonEmptyVector[T]
Sorts this
NonEmptyVectoraccording to theOrderingof the result of applying the given function to every element.Sorts this
NonEmptyVectoraccording to theOrderingof the result of applying the given function to every element.- U
 the target type of the transformation
f, and the type where theOrderingordis defined.- f
 the transformation function mapping elements to some other domain
U.- ord
 the ordering assumed on domain
U.- returns
 a
NonEmptyVectorconsisting of the elements of thisNonEmptyVectorsorted according to theOrderingwherex < y if ord.lt(f(x), f(y)).
 -   final  def sortWith(lt: (T, T) => Boolean): NonEmptyVector[T]
Sorts this
NonEmptyVectoraccording to a comparison function.Sorts this
NonEmptyVectoraccording to a comparison function.The sort is stable. That is, elements that are equal (as determined by
lt) appear in the same order in the sortedNonEmptyVectoras in the original.- returns
 a
NonEmptyVectorconsisting of the elements of thisNonEmptyVectorsorted according to the comparison functionlt.
 -   final  def sorted[U >: T](implicit ord: Ordering[U]): NonEmptyVector[U]
Sorts this
NonEmptyVectoraccording to anOrdering.Sorts this
NonEmptyVectoraccording to anOrdering.The sort is stable. That is, elements that are equal (as determined by
lt) appear in the same order in the sortedNonEmptyVectoras in the original.- ord
 the
Orderingto be used to compare elements.- returns
 a
NonEmptyVectorconsisting of the elements of thisNonEmptyVectorsorted according to the comparison functionlt.
 -   final  def startsWith[B](that: NonEmptyVector[B], offset: Int): Boolean
Indicates whether this
NonEmptyVectorstarts with the givenNonEmptyVectorat the given index.Indicates whether this
NonEmptyVectorstarts with the givenNonEmptyVectorat the given index.- that
 the
NonEmptyVectorslice to look for in thisNonEmptyVector- offset
 the index at which this
NonEmptyVectoris searched.- returns
 trueif thisNonEmptyVectorhasthatas a slice at the indexoffset,falseotherwise.
 -   final  def startsWith[B](that: Every[B], offset: Int): Boolean
Indicates whether this
NonEmptyVectorstarts with the givenEveryat the given index.Indicates whether this
NonEmptyVectorstarts with the givenEveryat the given index.- that
 the
Everyslice to look for in thisNonEmptyVector- offset
 the index at which this
NonEmptyVectoris searched.- returns
 trueif thisNonEmptyVectorhasthatas a slice at the indexoffset,falseotherwise.
 -   final  def startsWith[B](that: NonEmptyVector[B]): Boolean
Indicates whether this
NonEmptyVectorstarts with the givenNonEmptyVector.Indicates whether this
NonEmptyVectorstarts with the givenNonEmptyVector.- that
 the
NonEmptyVectorto test- returns
 trueif this collection hasthatas a prefix,falseotherwise.
 -   final  def startsWith[B](that: Every[B]): Boolean
Indicates whether this
NonEmptyVectorstarts with the givenEvery.Indicates whether this
NonEmptyVectorstarts with the givenEvery.- that
 the
Everyto test- returns
 trueif this collection hasthatas a prefix,falseotherwise.
 -   final  def startsWith[B](that: GenSeq[B], offset: Int): Boolean
Indicates whether this
NonEmptyVectorstarts with the givenGenSeqat the given index.Indicates whether this
NonEmptyVectorstarts with the givenGenSeqat the given index.- that
 the
GenSeqslice to look for in thisNonEmptyVector- offset
 the index at which this
NonEmptyVectoris searched.- returns
 trueif thisNonEmptyVectorhasthatas a slice at the indexoffset,falseotherwise.
 -   final  def startsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
NonEmptyVectorstarts with the givenGenSeq.Indicates whether this
NonEmptyVectorstarts with the givenGenSeq.- that
 the
GenSeqslice to look for in thisNonEmptyVector- returns
 trueif thisNonEmptyVectorhasthatas a prefix,falseotherwise.
 -    def stringPrefix: String
Returns
"NonEmptyVector", the prefix of this object'stoStringrepresentation.Returns
"NonEmptyVector", the prefix of this object'stoStringrepresentation.- returns
 the string
"NonEmptyVector"
 -   final  def sum[U >: T](implicit num: Numeric[U]): U
The result of summing all the elements of this
NonEmptyVector.The result of summing all the elements of this
NonEmptyVector.This method can be invoked for any
NonEmptyVector[T]for which an implicitNumeric[T]exists.- returns
 the sum of all elements
 -   final  def to[Col[_]](factory: Factory[T, Col[T]]): Col[T]
Converts this
NonEmptyVectorinto a collection of typeColby copying all elements.Converts this
NonEmptyVectorinto a collection of typeColby copying all elements.- Col
 the collection type to build.
- returns
 a new collection containing all elements of this
NonEmptyVector.
 -   final  def toArray[U >: T](implicit classTag: ClassTag[U]): Array[U]
Converts this
NonEmptyVectorto an array.Converts this
NonEmptyVectorto an array.- returns
 an array containing all elements of this
NonEmptyVector. AClassTagmust be available for the element type of thisNonEmptyVector.
 -   final  def toBuffer[U >: T]: Buffer[U]
Converts this
NonEmptyVectorto a mutable buffer.Converts this
NonEmptyVectorto a mutable buffer.- returns
 a buffer containing all elements of this
NonEmptyVector.
 -   final  def toIndexedSeq: IndexedSeq[T]
Converts this
NonEmptyVectorto an immutableIndexedSeq.Converts this
NonEmptyVectorto an immutableIndexedSeq.- returns
 an immutable
IndexedSeqcontaining all elements of thisNonEmptyVector.
 -   final  def toIterable: Iterable[T]
Converts this
NonEmptyVectorto an iterable collection.Converts this
NonEmptyVectorto an iterable collection.- returns
 an
Iterablecontaining all elements of thisNonEmptyVector.
 -   final  def toIterator: Iterator[T]
Returns an
Iteratorover the elements in thisNonEmptyVector.Returns an
Iteratorover the elements in thisNonEmptyVector.- returns
 an
Iteratorcontaining all elements of thisNonEmptyVector.
 -   final  def toList: List[T]
Converts this
NonEmptyVectorto aVector.Converts this
NonEmptyVectorto aVector.- returns
 a
Vectorcontaining all elements of thisNonEmptyVector.
 -   final  def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
Converts this
NonEmptyVectorto a map.Converts this
NonEmptyVectorto a map.This method is unavailable unless the elements are members of
Tuple2, each((K, V))becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys.- returns
 a map of type
immutable.Map[K, V]containing all key/value pairs of type(K, V)of thisNonEmptyVector.
 -   final  def toSeq: Seq[T]
Converts this
NonEmptyVectorto an immutableIndexedSeq.Converts this
NonEmptyVectorto an immutableIndexedSeq.- returns
 an immutable
IndexedSeqcontaining all elements of thisNonEmptyVector.
 -   final  def toSet[U >: T]: Set[U]
Converts this
NonEmptyVectorto a set.Converts this
NonEmptyVectorto a set.- returns
 a set containing all elements of this
NonEmptyVector.
 -   final  def toStream: Stream[T]
Converts this
NonEmptyVectorto a stream.Converts this
NonEmptyVectorto a stream.- returns
 a stream containing all elements of this
NonEmptyVector.
 -    def toString(): String
Returns a string representation of this
NonEmptyVector.Returns a string representation of this
NonEmptyVector.- returns
 the string
"NonEmptyVector"followed by the result of invokingtoStringon thisNonEmptyVector's elements, surrounded by parentheses.
- Definition Classes
 - NonEmptyVector → Any
 
 -  val toVector: Vector[T]
 -  final def transpose[U](implicit ev: <:<[T, NonEmptyVector[U]]): NonEmptyVector[NonEmptyVector[U]]
 -   final  def union[U >: T](that: GenSeq[U])(implicit cbf: CanBuildFrom[Vector[T], U, Vector[U]]): NonEmptyVector[U]
Produces a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorand also all elements of a givenGenSeq.Produces a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorand also all elements of a givenGenSeq.nonEmptyVectorXunionysis equivalent tononEmptyVectorX++ys.Another way to express this is that
nonEmptyVectorXunionyscomputes the order-presevring multi-set union ofnonEmptyVectorXandys. Thisunionmethod is hence a counter-part ofdiffandintersectthat also work on multi-sets.- that
 the
GenSeqto add.- returns
 a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorfollowed by all elements ofthatGenSeq.
 -   final  def union[U >: T](that: NonEmptyVector[U]): NonEmptyVector[U]
Produces a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorand also all elements of a givenNonEmptyVector.Produces a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorand also all elements of a givenNonEmptyVector.nonEmptyVectorXunionnonEmptyVectorYis equivalent tononEmptyVectorX++nonEmptyVectorY.Another way to express this is that
nonEmptyVectorXunionnonEmptyVectorYcomputes the order-presevring multi-set union ofnonEmptyVectorXandnonEmptyVectorY. Thisunionmethod is hence a counter-part ofdiffandintersectthat also work on multi-sets.- that
 the
NonEmptyVectorto add.- returns
 a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorfollowed by all elements ofthat.
 -   final  def union[U >: T](that: Every[U]): NonEmptyVector[U]
Produces a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorand also all elements of a givenEvery.Produces a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorand also all elements of a givenEvery.nonEmptyVectorXunioneveryYis equivalent tononEmptyVectorX++everyY.Another way to express this is that
nonEmptyVectorXunioneveryYcomputes the order-presevring multi-set union ofnonEmptyVectorXandeveryY. Thisunionmethod is hence a counter-part ofdiffandintersectthat also work on multi-sets.- that
 the
Everyto add.- returns
 a new
NonEmptyVectorthat contains all elements of thisNonEmptyVectorfollowed by all elements ofthatEvery.
 -   final  def unzip[L, R](implicit asPair: (T) => (L, R)): (NonEmptyVector[L], NonEmptyVector[R])
Converts this
NonEmptyVectorof pairs into twoNonEmptyVectors of the first and second half of each pair.Converts this
NonEmptyVectorof pairs into twoNonEmptyVectors of the first and second half of each pair.- L
 the type of the first half of the element pairs
- R
 the type of the second half of the element pairs
- asPair
 an implicit conversion that asserts that the element type of this
NonEmptyVectoris a pair.- returns
 a pair of
NonEmptyVectors, containing the first and second half, respectively, of each element pair of thisNonEmptyVector.
 -   final  def unzip3[L, M, R](implicit asTriple: (T) => (L, M, R)): (NonEmptyVector[L], NonEmptyVector[M], NonEmptyVector[R])
Converts this
NonEmptyVectorof triples into threeNonEmptyVectors of the first, second, and and third element of each triple.Converts this
NonEmptyVectorof triples into threeNonEmptyVectors of the first, second, and and third element of each triple.- L
 the type of the first member of the element triples
- R
 the type of the third member of the element triples
- asTriple
 an implicit conversion that asserts that the element type of this
NonEmptyVectoris a triple.- returns
 a triple of
NonEmptyVectors, containing the first, second, and third member, respectively, of each element triple of thisNonEmptyVector.
 -   final  def updated[U >: T](idx: Int, elem: U): NonEmptyVector[U]
A copy of this
NonEmptyVectorwith one single replaced element.A copy of this
NonEmptyVectorwith one single replaced element.- idx
 the position of the replacement
- elem
 the replacing element
- returns
 a copy of this
NonEmptyVectorwith the element at positionidxreplaced byelem.
- Exceptions thrown
 IndexOutOfBoundsExceptionif the passed index is greater than or equal to the length of thisNonEmptyVector
 -   final  def zipAll[O, U >: T](other: Iterable[O], thisElem: U, otherElem: O): NonEmptyVector[(U, O)]
Returns a
NonEmptyVectorformed from thisNonEmptyVectorand an iterable collection by combining corresponding elements in pairs.Returns a
NonEmptyVectorformed from thisNonEmptyVectorand an iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements will be used to extend the shorter collection to the length of the longer.- other
 the
Iterableproviding the second half of each result pair- thisElem
 the element to be used to fill up the result if this
NonEmptyVectoris shorter thanthatIterable.- returns
 a new
NonEmptyVectorcontaining pairs consisting of corresponding elements of thisNonEmptyVectorandthat. The length of the returned collection is the maximum of the lengths of thisNonEmptyVectorandthat. If thisNonEmptyVectoris shorter thanthat,thisElemvalues are used to pad the result. Ifthatis shorter than thisNonEmptyVector,thatElemvalues are used to pad the result.
 -   final  def zipWithIndex: NonEmptyVector[(T, Int)]
Zips this
NonEmptyVectorwith its indices.Zips this
NonEmptyVectorwith its indices.- returns
 A new
NonEmptyVectorcontaining pairs consisting of all elements of thisNonEmptyVectorpaired with their index. Indices start at 0.