NEList

Companion object NEList

final class NEList[+T] extends AnyVal

Linear Supertypes

AnyVal, Any

Ordering

Alphabetic
By Inheritance

Inherited

NEList
AnyVal
Any

Hide All
Show All

Visibility

Public
Protected

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
Any
final def ##: Int
Definition Classes
Any
def ++[U >: T](other: IterableOnce[U]): NEList[U]
Returns a new NEList containing the elements of this NEList followed by the elements of the passed GenTraversableOnce.
Returns a new NEList containing the elements of this NEList followed by the elements of the passed GenTraversableOnce. The element type of the resulting NEList is the most specific superclass encompassing the element types of this NEList and the passed GenTraversableOnce.
U
the element type of the returned NEList
other
the GenTraversableOnce to append
returns
a new NEList that contains all the elements of this NEList followed by all elements of other.
def ++[U >: T](other: Vector[U]): NEList[U]
Returns a new NEList containing the elements of this NEList followed by the elements of the passed Vector.
Returns a new NEList containing the elements of this NEList followed by the elements of the passed Vector. The element type of the resulting NEList is the most specific superclass encompassing the element types of this NEList and the passed Vector.
U
the element type of the returned NEList
other
the Vector to append
returns
a new NEList that contains all the elements of this NEList followed by all elements of other.
def ++[U >: T](other: NEList[U]): NEList[U]
Returns a new NEList containing the elements of this NEList followed by the elements of the passed NEList.
Returns a new NEList containing the elements of this NEList followed by the elements of the passed NEList. The element type of the resulting NEList is the most specific superclass encompassing the element types of this and the passed NEList.
U
the element type of the returned NEList
other
the NEList to append
returns
a new NEList that contains all the elements of this NEList followed by all elements of other.
def ++:[U >: T](other: IterableOnce[U]): NEList[U]
Annotations
@inline()
def ++:[U >: T](other: Vector[U]): NEList[U]
Annotations
@inline()
def ++:[U >: T](other: NEList[U]): NEList[U]
Annotations
@inline()
def +:[U >: T](element: U): NEList[U]
Returns a new NEList with the given element prepended.
Returns a new NEList with 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 NEList
returns
a new NEList consisting of element followed by all elements of this NEList.
def :+[U >: T](element: U): NEList[U]
Returns a new NEList with the given element appended.
Returns a new NEList with the given element appended.
Note a mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
element
the element to append to this NEList
returns
a new NEList consisting of all elements of this NEList followed by element.
def ::[U >: T](element: U): NEList[U]
Adds an element to the beginning of this NEList.
Adds an element to the beginning of this NEList.
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 NEList
returns
a NEList that contains element as first element and that continues with this NEList.
def :::[U >: T](other: IterableOnce[U]): NEList[U]
Returns a new NEList containing the elements of this NEList followed by the elements of the passed GenTraversableOnce.
Returns a new NEList containing the elements of this NEList followed by the elements of the passed GenTraversableOnce. The element type of the resulting NEList is the most specific superclass encompassing the element types of this NEList and the passed GenTraversableOnce.
U
the element type of the returned NEList
other
the GenTraversableOnce to append
returns
a new NEList that contains all the elements of this NEList followed by all elements of other.
def :::[U >: T](other: Vector[U]): NEList[U]
Returns a new NEList containing the elements of this NEList followed by the elements of the passed Vector.
Returns a new NEList containing the elements of this NEList followed by the elements of the passed Vector. The element type of the resulting NEList is the most specific superclass encompassing the element types of this and the passed Vector.
U
the element type of the returned NEList
other
the Vector to append
returns
a new NEList that contains all the elements of this NEList followed by all elements of other.
def :::[U >: T](other: NEList[U]): NEList[U]
Returns a new NEList containing the elements of this NEList followed by the elements of the passed NEList.
Returns a new NEList containing the elements of this NEList followed by the elements of the passed NEList. The element type of the resulting NEList is the most specific superclass encompassing the element types of this and the passed NEList.
U
the element type of the returned NEList
other
the NEList to append
returns
a new NEList that contains all the elements of this NEList followed by all elements of other.
final def ==(arg0: Any): Boolean
Definition Classes
Any
def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder
Appends all elements of this NEList to a string builder using start, end, and separator strings.
Appends all elements of this NEList to a string builder using start, end, and separator strings. The written text will consist of a concatenation of the string start; the result of invoking toString on all elements of this NEList, separated by the string sep; and the string end
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.
def addString(sb: StringBuilder, sep: String): StringBuilder
Appends all elements of this NEList to a string builder using a separator string.
Appends all elements of this NEList to a string builder using a separator string. The written text will consist of a concatenation of the result of invoking toString on of every element of this NEList, separated by the string sep.
sb
the string builder to which elements will be appended
sep
the separator string
returns
the string builder, sb, to which elements were appended.
def addString(sb: StringBuilder): StringBuilder
Appends all elements of this NEList to a string builder.
Appends all elements of this NEList to a string builder. The written text will consist of a concatenation of the result of invoking toString on of every element of this NEList, without any separator string.
sb
the string builder to which elements will be appended
returns
the string builder, sb, to which elements were appended.
def apply(idx: Int): T
Selects an element by its index in the NEList.
Selects an element by its index in the NEList.
returns
the element of this NEList at index idx, where 0 indicates the first element.
final def asInstanceOf[T0]: T0
Definition Classes
Any
def collectFirst[U](pf: PartialFunction[T, U]): Option[U]
Finds the first element of this NEList for which the given partial function is defined, if any, and applies the partial function to it.
Finds the first element of this NEList for which the given partial function is defined, if any, and applies the partial function to it.
pf
the partial function
returns
an Option containing pf applied to the first element for which it is defined, or None if the partial function was not defined for any element.
def contains(elem: Any): Boolean
Indicates whether this NEList contains a given value as an element.
Indicates whether this NEList contains a given value as an element.
elem
the element to look for
returns
true if this NEList has an element that is equal (as determined by ==) to elem, false otherwise.
def containsSlice[U >: T](that: NEList[U]): Boolean
Indicates whether this NEList contains a given NEList as a slice.
Indicates whether this NEList contains a given NEList as a slice.
that
the NEList slice to look for
returns
true if this NEList contains a slice with the same elements as that, otherwise false.
def containsSlice[U >: T](that: Vector[U]): Boolean
Indicates whether this NEList contains a given Vector as a slice.
Indicates whether this NEList contains a given Vector as a slice.
that
the Vector slice to look for
returns
true if this NEList contains a slice with the same elements as that, otherwise false.
def containsSlice[U >: T](that: Seq[U]): Boolean
Indicates whether this NEList contains a given Seq as a slice.
Indicates whether this NEList contains a given Seq as a slice.
that
the Seq slice to look for
returns
true if this NEList contains a slice with the same elements as that, otherwise false.
def copyToArray[U >: T](arr: Array[U], start: Int, len: Int): Unit
Copies values of this NEList to an array.
Copies values of this NEList to an array. Fills the given array arr with at most len elements of this NEList, beginning at index start. Copying will stop once either the end of the current NEList is reached, the end of the array is reached, or len elements have been copied.
arr
the array to fill
start
the starting index
len
the maximum number of elements to copy
def copyToArray[U >: T](arr: Array[U], start: Int): Unit
Copies values of this NEList to an array.
Copies values of this NEList to an array. Fills the given array arr with values of this NEList, beginning at index start. Copying will stop once either the end of the current NEList is reached, or the end of the array is reached.
arr
the array to fill
start
the starting index
def copyToArray[U >: T](arr: Array[U]): Unit
Copies values of this NEList to an array.
Copies values of this NEList to an array. Fills the given array arr with values of this NEList. Copying will stop once either the end of the current NEList is reached, or the end of the array is reached.
arr
the array to fill
def copyToBuffer[U >: T](buf: Buffer[U]): Unit
Copies all elements of this NEList to a buffer.
Copies all elements of this NEList to a buffer.
buf
the buffer to which elements are copied
def corresponds[B](that: NEList[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this NEList relates to the corresponding element of a given NEList by satisfying a given predicate.
Indicates whether every element of this NEList relates to the corresponding element of a given NEList by satisfying a given predicate.
B
the type of the elements of that
that
the NEList to compare for correspondence
p
the predicate, which relates elements from this and the passed NEList
returns
true if this and the passed NEList have the same length and p(x, y) is true for all corresponding elements x of this NEList and y of that, otherwise false.
def corresponds[B](that: Vector[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this NEList relates to the corresponding element of a given Vector by satisfying a given predicate.
Indicates whether every element of this NEList relates to the corresponding element of a given Vector by satisfying a given predicate.
B
the type of the elements of that
that
the Vector to compare for correspondence
p
the predicate, which relates elements from this NEList and the passed Vector
returns
true if this NEList and the passed Vector have the same length and p(x, y) is true for all corresponding elements x of this NEList and y of that, otherwise false.
def corresponds[B](that: Seq[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this NEList relates to the corresponding element of a given Seq by satisfying a given predicate.
Indicates whether every element of this NEList relates to the corresponding element of a given Seq by satisfying a given predicate.
B
the type of the elements of that
that
the Seq to compare for correspondence
p
the predicate, which relates elements from this NEList and the passed Seq
returns
true if this NEList and the passed Seq have the same length and p(x, y) is true for all corresponding elements x of this NEList and y of that, otherwise false.
def count(p: (T) => Boolean): Int
Counts the number of elements in this NEList that satisfy a predicate.
Counts the number of elements in this NEList that satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.
def distinct: NEList[T]
Builds a new NEList from this NEList without any duplicate elements.
Builds a new NEList from this NEList without any duplicate elements.
returns
A new NEList that contains the first occurrence of every element of this NEList.
def endsWith[B](that: NEList[B]): Boolean
Indicates whether this NEList ends with the given NEList.
Indicates whether this NEList ends with the given NEList.
that
the NEList to test
returns
true if this NEList has that as a suffix, false otherwise.
def endsWith[B](that: Vector[B]): Boolean
Indicates whether this NEList ends with the given Vector.
Indicates whether this NEList ends with the given Vector.
that
the Vector to test
returns
true if this NEList has that as a suffix, false otherwise.
def endsWith[B](that: Seq[B]): Boolean
Indicates whether this NEList ends with the given Seq.
Indicates whether this NEList ends with the given Seq.
that
the sequence to test
returns
true if this NEList has that as a suffix, false otherwise.
def exists(p: (T) => Boolean): Boolean
Indicates whether a predicate holds for at least one of the elements of this NEList.
Indicates whether a predicate holds for at least one of the elements of this NEList.
returns
true if the given predicate p holds for some of the elements of this NEList, otherwise false.
def find(p: (T) => Boolean): Option[T]
Finds the first element of this NEList that satisfies the given predicate, if any.
Finds the first element of this NEList that satisfies the given predicate, if any.
p
the predicate used to test elements
returns
an Some containing the first element in this NEList that satisfies p, or None if none exists.
def flatMap[U](f: (T) => NEList[U]): NEList[U]
Builds a new NEList by applying a function to all elements of this NEList and using the elements of the resulting NELists.
Builds a new NEList by applying a function to all elements of this NEList and using the elements of the resulting NELists.
U
the element type of the returned NEList
f
the function to apply to each element.
returns
a new NEList containing elements obtained by applying the given function f to each element of this NEList and concatenating the elements of resulting NELists.
def flatten[B](implicit ev: <:<[T, NEList[B]]): NEList[B]
Converts this NEList of NELists into a NEList formed by the elements of the nested NELists.
Converts this NEList of NELists into a NEList formed by the elements of the nested NELists.
returns
a new NEList resulting from concatenating all nested NELists.
Note
You cannot use this flatten method on a NEList that contains a GenTraversableOnces, because if all the nested GenTraversableOnces were empty, you'd end up with an empty NEList.
def fold[U >: T](z: U)(op: (U, U) => U): U
Folds the elements of this NEList using the specified associative binary operator.
Folds the elements of this NEList using 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., Nil for list concatenation, 0 for addition, or 1 for multiplication.)
op
a binary operator that must be associative
returns
the result of applying fold operator op between all the elements and z
def foldLeft[B](z: B)(op: (B, T) => B): B
Applies a binary operator to a start value and all elements of this NEList, going left to right.
Applies a binary operator to a start value and all elements of this NEList, 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 op between consecutive elements of this NEList, going left to right, with the start value, z, on the left:
```
op(...op(op(z, x_1), x_2), ..., x_n)
```
where x₁, ..., x_n are the elements of this NEList.
def foldRight[B](z: B)(op: (T, B) => B): B
Applies a binary operator to all elements of this NEList and a start value, going right to left.
Applies a binary operator to all elements of this NEList and 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 op between consecutive elements of this NEList, going right to left, with the start value, z, on the right:
```
op(x_1, op(x_2, ... op(x_n, z)...))
```
where x₁, ..., x_n are the elements of this NEList.
def forall(p: (T) => Boolean): Boolean
Indicates whether a predicate holds for all elements of this NEList.
Indicates whether a predicate holds for all elements of this NEList.
p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this NEList, otherwise false.
def foreach(f: (T) => Unit): Unit
Applies a function f to all elements of this NEList.
Applies a function f to all elements of this NEList.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.
def getClass(): Class[_ <: AnyVal]
Definition Classes
AnyVal → Any
def groupBy[K](f: (T) => K): Map[K, NEList[T]]
Partitions this NEList into a map of NELists according to some discriminator function.
Partitions this NEList into a map of NELists 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 NELists such that the following invariant holds:
```
(NEList.toList partition f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a NEList of those elements x for which f(x) equals k.
def grouped(size: Int): Iterator[NEList[T]]
Partitions elements into fixed size NELists.
Partitions elements into fixed size NELists.
size
the number of elements per group
returns
An iterator producing NELists of size size, except the last will be truncated if the elements don't divide evenly.
def hasDefiniteSize: Boolean
Returns true to indicate this NEList has a definite size, since all NELists are strict collections.
def head: T
Selects the first element of this NEList.
Selects the first element of this NEList.
returns
the first element of this NEList.
def indexOf[U >: T](elem: U, from: Int): Int
Finds index of first occurrence of some value in this NEList after or at some start index.
Finds index of first occurrence of some value in this NEList after or at some start index.
elem
the element value to search for.
from
the start index
returns
the index >= from of the first element of this NEList that is equal (as determined by ==) to elem, or -1, if none exists.
def indexOf[U >: T](elem: U): Int
Finds index of first occurrence of some value in this NEList.
Finds index of first occurrence of some value in this NEList.
elem
the element value to search for.
returns
the index of the first element of this NEList that is equal (as determined by ==) to elem, or -1, if none exists.
def indexOfSlice[U >: T](that: NEList[U], from: Int): Int
Finds first index after or at a start index where this NEList contains a given NEList as a slice.
Finds first index after or at a start index where this NEList contains a given NEList as a slice.
that
the NEList defining the slice to look for
from
the start index
returns
the first index >= from such that the elements of this NEList starting at this index match the elements of NEList that, or -1 of no such subsequence exists.
def indexOfSlice[U >: T](that: Vector[U], from: Int): Int
Finds first index after or at a start index where this NEList contains a given Vector as a slice.
Finds first index after or at a start index where this NEList contains a given Vector as a slice.
that
the Vector defining the slice to look for
from
the start index
returns
the first index >= from such that the elements of this NEList starting at this index match the elements of Vector that, or -1 of no such subsequence exists.
def indexOfSlice[U >: T](that: NEList[U]): Int
Finds first index where this NEList contains a given NEList as a slice.
Finds first index where this NEList contains a given NEList as a slice.
that
the NEList defining the slice to look for
returns
the first index such that the elements of this NEList starting at this index match the elements of NEList that, or -1 of no such subsequence exists.
def indexOfSlice[U >: T](that: Vector[U]): Int
Finds first index where this NEList contains a given Vector as a slice.
Finds first index where this NEList contains a given Vector as a slice.
that
the Vector defining the slice to look for
returns
the first index such that the elements of this NEList starting at this index match the elements of Vector that, or -1 of no such subsequence exists.
def indexOfSlice[U >: T](that: Seq[U], from: Int): Int
Finds first index after or at a start index where this NEList contains a given Seq as a slice.
Finds first index after or at a start index where this NEList contains a given Seq as a slice.
that
the Seq defining the slice to look for
from
the start index
returns
the first index >= from at which the elements of this NEList starting at that index match the elements of Seq that, or -1 of no such subsequence exists.
def indexOfSlice[U >: T](that: Seq[U]): Int
Finds first index where this NEList contains a given Seq as a slice.
Finds first index where this NEList contains a given Seq as a slice.
that
the Seq defining the slice to look for
returns
the first index at which the elements of this NEList starting at that index match the elements of Seq that, or -1 of no such subsequence exists.
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 >= from of the first element of this NEList that satisfies the predicate p, or -1, if none exists.
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 NEList that satisfies the predicate p, or -1, if none exists.
def indices: Range
Produces the range of all indices of this NEList.
Produces the range of all indices of this NEList.
returns
a Range value from 0 to one less than the length of this NEList.
def isDefinedAt(idx: Int): Boolean
Tests whether this NEList contains given index.
Tests whether this NEList contains given index.
idx
the index to test
returns
true if this NEList contains an element at position idx, false otherwise.
def isEmpty: Boolean
Returns false to indicate this NEList, like all NELists, is non-empty.
Returns false to indicate this NEList, like all NELists, is non-empty.
returns
false
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isTraversableAgain: Boolean
Returns true to indicate this NEList, like all NELists, can be traversed repeatedly.
Returns true to indicate this NEList, like all NELists, can be traversed repeatedly.
returns
true
def iterator: Iterator[T]
Creates and returns a new iterator over all elements contained in this NEList.
Creates and returns a new iterator over all elements contained in this NEList.
returns
the new iterator
def last: T
Selects the last element of this NEList.
Selects the last element of this NEList.
returns
the last element of this NEList.
def lastIndexOf[U >: T](elem: U, end: Int): Int
Finds the index of the last occurrence of some value in this NEList before or at a given end index.
Finds the index of the last occurrence of some value in this NEList before or at a given end index.
elem
the element value to search for.
end
the end index.
returns
the index >= end of the last element of this NEList that is equal (as determined by ==) to elem, or -1, if none exists.
def lastIndexOf[U >: T](elem: U): Int
Finds the index of the last occurrence of some value in this NEList.
Finds the index of the last occurrence of some value in this NEList.
elem
the element value to search for.
returns
the index of the last element of this NEList that is equal (as determined by ==) to elem, or -1, if none exists.
def lastIndexOfSlice[U >: T](that: NEList[U], end: Int): Int
Finds the last index before or at a given end index where this NEList contains a given NEList as a slice.
Finds the last index before or at a given end index where this NEList contains a given NEList as a slice.
that
the NEList defining the slice to look for
end
the end index
returns
the last index >= end at which the elements of this NEList starting at that index match the elements of NEList that, or -1 of no such subsequence exists.
def lastIndexOfSlice[U >: T](that: Vector[U], end: Int): Int
Finds the last index before or at a given end index where this NEList contains a given Vector as a slice.
Finds the last index before or at a given end index where this NEList contains a given Vector as a slice.
that
the Vector defining the slice to look for
end
the end index
returns
the last index >= end at which the elements of this NEList starting at that index match the elements of Vector that, or -1 of no such subsequence exists.
def lastIndexOfSlice[U >: T](that: NEList[U]): Int
Finds the last index where this NEList contains a given NEList as a slice.
Finds the last index where this NEList contains a given NEList as a slice.
that
the NEList defining the slice to look for
returns
the last index at which the elements of this NEList starting at that index match the elements of NEList that, or -1 of no such subsequence exists.
def lastIndexOfSlice[U >: T](that: Vector[U]): Int
Finds the last index where this NEList contains a given Vector as a slice.
Finds the last index where this NEList contains a given Vector as a slice.
that
the Vector defining the slice to look for
returns
the last index at which the elements of this NEList starting at that index match the elements of Vector that, or -1 of no such subsequence exists.
def lastIndexOfSlice[U >: T](that: Seq[U], end: Int): Int
Finds the last index before or at a given end index where this NEList contains a given Seq as a slice.
Finds the last index before or at a given end index where this NEList contains a given Seq as a slice.
that
the Seq defining the slice to look for
end
the end index
returns
the last index >= end at which the elements of this NEList starting at that index match the elements of Seq that, or -1 of no such subsequence exists.
def lastIndexOfSlice[U >: T](that: Seq[U]): Int
Finds the last index where this NEList contains a given Seq as a slice.
Finds the last index where this NEList contains a given Seq as a slice.
that
the Seq defining the slice to look for
returns
the last index at which the elements of this NEList starting at that index match the elements of Seq that, or -1 of no such subsequence exists.
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 >= end of the last element of this NEList that satisfies the predicate p, or -1, if none exists.
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 NEList that satisfies the predicate p, or -1, if none exists.
def length: Int
The length of this NEList.
The length of this NEList.
returns
the number of elements in this NEList.
Note
length and size yield the same result, which will be >= 1.
def lengthCompare(len: Int): Int
Compares the length of this NEList to a test value.
Compares the length of this NEList to a test value.
len
the test value that gets compared with the length.
returns
a value x where
```
x < 0 if this.length < len
x == 0 if this.length == len
x > 0 if this.length > len
```
def map[U](f: (T) => U): NEList[U]
Builds a new NEList by applying a function to all elements of this NEList.
Builds a new NEList by applying a function to all elements of this NEList.
U
the element type of the returned NEList.
f
the function to apply to each element.
returns
a new NEList resulting from applying the given function f to each element of this NEList and collecting the results.
def max[U >: T](implicit cmp: Ordering[U]): T
Finds the largest element.
Finds the largest element.
returns
the largest element of this NEList.
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 NEList.
def min[U >: T](implicit cmp: Ordering[U]): T
Finds the smallest element.
Finds the smallest element.
returns
the smallest element of this NEList.
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 NEList.
def mkString(start: String, sep: String, end: String): String
Displays all elements of this NEList in a string using start, end, and separator strings.
Displays all elements of this NEList in 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 NEList. The resulting string begins with the string start and ends with the string end. Inside, In the resulting string, the result of invoking toString on all elements of this NEList are separated by the string sep.
def mkString(sep: String): String
Displays all elements of this NEList in a string using a separator string.
Displays all elements of this NEList in a string using a separator string.
sep
the separator string
returns
a string representation of this NEList. In the resulting string, the result of invoking toString on all elements of this NEList are separated by the string sep.
def mkString: String
Displays all elements of this NEList in a string.
Displays all elements of this NEList in a string.
returns
a string representation of this NEList. In the resulting string, the result of invoking toString on all elements of this NEList follow each other without any separator string.
def nonEmpty: Boolean
Returns true to indicate this NEList, like all NELists, is non-empty.
Returns true to indicate this NEList, like all NELists, is non-empty.
returns
true
def padTo[U >: T](len: Int, elem: U): NEList[U]
A copy of this NEList with an element value appended until a given target length is reached.
A copy of this NEList with an element value appended until a given target length is reached.
len
the target length
elem
he padding value
returns
a new NEList consisting of all elements of this NEList followed by the minimal number of occurrences of elem so that the resulting NEList has a length of at least len.
def patch[U >: T](from: Int, that: NEList[U], replaced: Int): NEList[U]
Produces a new NEList where a slice of elements in this NEList is replaced by another NEList
Produces a new NEList where a slice of elements in this NEList is replaced by another NEList
from
the index of the first replaced element
that
the NEList whose elements should replace a slice in this NEList
replaced
the number of elements to drop in the original NEList
def permutations: Iterator[NEList[T]]
Iterates over distinct permutations.
Iterates over distinct permutations.
Here's an example:
```
NEList('a', 'b', 'b').permutations.toList = List(NEList(a, b, b), NEList(b, a, b), NEList(b, b, a))
```
returns
an iterator that traverses the distinct permutations of this NEList.
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 NEList such that every element of the segment satisfies the predicate p.
def product[U >: T](implicit num: Numeric[U]): U
The result of multiplying all the elements of this NEList.
The result of multiplying all the elements of this NEList.
This method can be invoked for any NEList[T] for which an implicit Numeric[T] exists.
returns
the product of all elements
def reduce[U >: T](op: (U, U) => U): U
Reduces the elements of this NEList using the specified associative binary operator.
Reduces the elements of this NEList using 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 op between all the elements of this NEList.
def reduceLeft[U >: T](op: (U, T) => U): U
Applies a binary operator to all elements of this NEList, going left to right.
Applies a binary operator to all elements of this NEList, going left to right.
U
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this NEList, going left to right:
```
op(...op(op(x_1, x_2), x_3), ..., x_n)
```
where x₁, ..., x_n are the elements of this NEList.
def reduceLeftOption[U >: T](op: (U, T) => U): Option[U]
Applies a binary operator to all elements of this NEList, going left to right, returning the result in a Some.
Applies a binary operator to all elements of this NEList, going left to right, returning the result in a Some.
U
the result type of the binary operator.
op
the binary operator.
returns
a Some containing the result of reduceLeft(op)
def reduceOption[U >: T](op: (U, U) => U): Option[U]
def reduceRight[U >: T](op: (T, U) => U): U
Applies a binary operator to all elements of this NEList, going right to left.
Applies a binary operator to all elements of this NEList, going right to left.
U
the result of the binary operator
op
the binary operator
returns
the result of inserting op between consecutive elements of this NEList, going right to left:
```
op(x_1, op(x_2, ... op(x_{n-1}, x_n)...))
```
where x₁, ..., x_n are the elements of this NEList.
def reduceRightOption[U >: T](op: (T, U) => U): Option[U]
Applies a binary operator to all elements of this NEList, going right to left, returning the result in a Some.
Applies a binary operator to all elements of this NEList, going right to left, returning the result in a Some.
U
the result of the binary operator
op
the binary operator
returns
a Some containing the result of reduceRight(op)
def reverse: NEList[T]
Returns new NEList with elements in reverse order.
Returns new NEList with elements in reverse order.
returns
a new NEList with all elements of this NEList in reversed order.
def reverseIterator: Iterator[T]
An iterator yielding elements in reverse order.
An iterator yielding elements in reverse order.
returns
an iterator yielding the elements of this NEList in reversed order
Note
NEList.reverseIterator is the same as NEList.reverse.iterator, but might be more efficient.
def reverseMap[U](f: (T) => U): NEList[U]
Builds a new NEList by applying a function to all elements of this NEList and collecting the results in reverse order.
Builds a new NEList by applying a function to all elements of this NEList and collecting the results in reverse order.
U
the element type of the returned NEList.
f
the function to apply to each element.
returns
a new NEList resulting from applying the given function f to each element of this NEList and collecting the results in reverse order.
Note
NEList.reverseMap(f) is the same as NEList.reverse.map(f), but might be more efficient.
def sameElements[U >: T](that: NEList[U]): Boolean
Checks if the given NEList contains the same elements in the same order as this NEList.
Checks if the given NEList contains the same elements in the same order as this NEList.
that
the NEList with which to compare
returns
true, if both this and the given NEList contain the same elements in the same order, false otherwise.
def sameElements[U >: T](that: Vector[U]): Boolean
Checks if the given Vector contains the same elements in the same order as this NEList.
Checks if the given Vector contains the same elements in the same order as this NEList.
that
the Vector with which to compare
returns
true, if both this and the given Vector contain the same elements in the same order, false otherwise.
def sameElements[U >: T](that: Iterable[U]): Boolean
Checks if the given Iterable contains the same elements in the same order as this NEList.
Checks if the given Iterable contains the same elements in the same order as this NEList.
that
the Iterable with which to compare
returns
true, if both this NEList and the given Iterable contain the same elements in the same order, false otherwise.
def scan[U >: T](z: U)(op: (U, U) => U): NEList[U]
Computes a prefix scan of the elements of this NEList.
Computes a prefix scan of the elements of this NEList.
U
a type parameter for the binary operator, a supertype of T, and the type of the resulting NEList.
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., Nil for list concatenation, 0 for addition, or 1 for multiplication.)
op
a binary operator that must be associative
returns
a new NEList containing the prefix scan of the elements in this NEList
Note
The neutral element z may be applied more than once. Here are some examples:
NEList(1, 2, 3).scan(0)(_ + _) == NEList(0, 1, 3, 6) NEList(1, 2, 3).scan("z")(_ + _.toString) == NEList("z", "z1", "z12", "z123")
def scanLeft[B](z: B)(op: (B, T) => B): NEList[B]
Produces a NEList containing cumulative results of applying the operator going left to right.
Produces a NEList containing cumulative results of applying the operator going left to right.
Here are some examples:
```
NEList(1, 2, 3).scanLeft(0)(_ + _) == NEList(0, 1, 3, 6)
NEList(1, 2, 3).scanLeft("z")(_ + _) == NEList("z", "z1", "z12", "z123")
```
B
the result type of the binary operator and type of the resulting NEList
z
the start value.
op
the binary operator.
returns
a new NEList containing the intermediate results of inserting op between consecutive elements of this NEList, going left to right, with the start value, z, on the left.
def scanRight[B](z: B)(op: (T, B) => B): NEList[B]
Produces a NEList containing cumulative results of applying the operator going right to left.
Produces a NEList containing cumulative results of applying the operator going right to left.
Here are some examples:
```
NEList(1, 2, 3).scanRight(0)(_ + _) == NEList(6, 5, 3, 0)
NEList(1, 2, 3).scanRight("z")(_ + _) == NEList("123z", "23z", "3z", "z")
```
B
the result of the binary operator and type of the resulting NEList
z
the start value
op
the binary operator
returns
a new NEList containing the intermediate results of inserting op between consecutive elements of this NEList, going right to left, with the start value, z, on the right.
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.
def size: Int
The size of this NEList.
The size of this NEList.
returns
the number of elements in this NEList.
Note
length and size yield the same result, which will be >= 1.
def sliding(size: Int, step: Int): Iterator[NEList[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 step each 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 step each time.
size
the number of elements per group
step
the distance between the first elements of successive groups
returns
an iterator producing NELists of size size, except the last and the only element will be truncated if there are fewer elements than size.
def sliding(size: Int): Iterator[NEList[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 NELists of size size, except the last and the only element will be truncated if there are fewer elements than size.
def sortBy[U](f: (T) => U)(implicit ord: Ordering[U]): NEList[T]
Sorts this NEList according to the Ordering of the result of applying the given function to every element.
Sorts this NEList according to the Ordering of the result of applying the given function to every element.
U
the target type of the transformation f, and the type where the Ordering ord is defined.
f
the transformation function mapping elements to some other domain U.
ord
the ordering assumed on domain U.
returns
a NEList consisting of the elements of this NEList sorted according to the Ordering where x < y if ord.lt(f(x), f(y)).
def sortWith(lt: (T, T) => Boolean): NEList[T]
Sorts this NEList according to a comparison function.
Sorts this NEList according 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 sorted NEList as in the original.
returns
a NEList consisting of the elements of this NEList sorted according to the comparison function lt.
def sorted[U >: T](implicit ord: Ordering[U]): NEList[U]
Sorts this NEList according to an Ordering.
Sorts this NEList according to an Ordering.
The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the sorted NEList as in the original.
ord
the Ordering to be used to compare elements.
returns
a NEList consisting of the elements of this NEList sorted according to the comparison function lt.
def startsWith[B](that: NEList[B], offset: Int): Boolean
Indicates whether this NEList starts with the given NEList at the given index.
Indicates whether this NEList starts with the given NEList at the given index.
that
the NEList slice to look for in this NEList
offset
the index at which this NEList is searched.
returns
true if this NEList has that as a slice at the index offset, false otherwise.
def startsWith[B](that: Vector[B], offset: Int): Boolean
Indicates whether this NEList starts with the given Vector at the given index.
Indicates whether this NEList starts with the given Vector at the given index.
that
the Vector slice to look for in this NEList
offset
the index at which this NEList is searched.
returns
true if this NEList has that as a slice at the index offset, false otherwise.
def startsWith[B](that: NEList[B]): Boolean
Indicates whether this NEList starts with the given NEList.
Indicates whether this NEList starts with the given NEList.
that
the NEList to test
returns
true if this collection has that as a prefix, false otherwise.
def startsWith[B](that: Vector[B]): Boolean
Indicates whether this NEList starts with the given Vector.
Indicates whether this NEList starts with the given Vector.
that
the Vector to test
returns
true if this collection has that as a prefix, false otherwise.
def startsWith[B](that: Seq[B], offset: Int): Boolean
Indicates whether this NEList starts with the given Seq at the given index.
Indicates whether this NEList starts with the given Seq at the given index.
that
the Seq slice to look for in this NEList
offset
the index at which this NEList is searched.
returns
true if this NEList has that as a slice at the index offset, false otherwise.
def startsWith[B](that: Seq[B]): Boolean
Indicates whether this NEList starts with the given Seq.
Indicates whether this NEList starts with the given Seq.
that
the Seq slice to look for in this NEList
returns
true if this NEList has that as a prefix, false otherwise.
def stringPrefix: String
Returns "NEList", the prefix of this object's toString representation.
Returns "NEList", the prefix of this object's toString representation.
returns
the string "NEList"
def sum[U >: T](implicit num: Numeric[U]): U
The result of summing all the elements of this NEList.
The result of summing all the elements of this NEList.
This method can be invoked for any NEList[T] for which an implicit Numeric[T] exists.
returns
the sum of all elements
def tail: List[T]
def to[C1](factory: Factory[T, C1]): C1
Converts this NEList into a collection of type Col by copying all elements.
Converts this NEList into a collection of type Col by copying all elements.
C1
the collection type to build.
returns
a new collection containing all elements of this NEList.
def toArray[U >: T](implicit classTag: ClassTag[U]): Array[U]
Converts this NEList to an array.
Converts this NEList to an array.
returns
an array containing all elements of this NEList. A ClassTag must be available for the element type of this NEList.
def toBuffer[U >: T]: Buffer[U]
Converts this NEList to a mutable buffer.
Converts this NEList to a mutable buffer.
returns
a buffer containing all elements of this NEList.
def toIndexedSeq: IndexedSeq[T]
Converts this NEList to an immutable IndexedSeq.
Converts this NEList to an immutable IndexedSeq.
returns
an immutable IndexedSeq containing all elements of this NEList.
def toIterable: Iterable[T]
Converts this NEList to an iterable collection.
Converts this NEList to an iterable collection.
returns
an Iterable containing all elements of this NEList.
def toIterator: Iterator[T]
Returns an Iterator over the elements in this NEList.
Returns an Iterator over the elements in this NEList.
returns
an Iterator containing all elements of this NEList.
val toList: List[T]
def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
Converts this NEList to a map.
Converts this NEList to 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 this NEList.
def toSeq: Seq[T]
Converts this NEList to an immutable IndexedSeq.
Converts this NEList to an immutable IndexedSeq.
returns
an immutable IndexedSeq containing all elements of this NEList.
def toSet[U >: T]: Set[U]
Converts this NEList to a set.
Converts this NEList to a set.
returns
a set containing all elements of this NEList.
def toString(): String
Returns a string representation of this NEList.
Returns a string representation of this NEList.
returns
the string "NEList" followed by the result of invoking toString on this NEList's elements, surrounded by parentheses.
Definition Classes
NEList → Any
def toVector: Vector[T]
Converts this NEList to a Vector.
Converts this NEList to a Vector.
returns
a Vector containing all elements of this NEList.
def transpose[U](implicit ev: <:<[T, NEList[U]]): NEList[NEList[U]]
def union[U >: T](that: Seq[U]): NEList[U]
Produces a new NEList that contains all elements of this NEList and also all elements of a given Seq.
Produces a new NEList that contains all elements of this NEList and also all elements of a given Seq.
NEListX union ys is equivalent to NEListX ++ ys.
Another way to express this is that NEListX union ys computes the order-presevring multi-set union of NEListX and ys. This union method is hence a counter-part of diff and intersect that also work on multi-sets.
that
the Seq to add.
returns
a new NEList that contains all elements of this NEList followed by all elements of that Seq.
def union[U >: T](that: NEList[U]): NEList[U]
Produces a new NEList that contains all elements of this NEList and also all elements of a given NEList.
Produces a new NEList that contains all elements of this NEList and also all elements of a given NEList.
NEListX union NEListY is equivalent to NEListX ++ NEListY.
Another way to express this is that NEListX union NEListY computes the order-presevring multi-set union of NEListX and NEListY. This union method is hence a counter-part of diff and intersect that also work on multi-sets.
that
the NEList to add.
returns
a new NEList that contains all elements of this NEList followed by all elements of that.
def union[U >: T](that: Vector[U]): NEList[U]
Produces a new NEList that contains all elements of this NEList and also all elements of a given Vector.
Produces a new NEList that contains all elements of this NEList and also all elements of a given Vector.
NEListX union everyY is equivalent to NEListX ++ everyY.
Another way to express this is that NEListX union everyY computes the order-presevring multi-set union of NEListX and everyY. This union method is hence a counter-part of diff and intersect that also work on multi-sets.
that
the Vector to add.
returns
a new NEList that contains all elements of this NEList followed by all elements of that Vector.
def unzip[L, R](implicit asPair: (T) => (L, R)): (NEList[L], NEList[R])
Converts this NEList of pairs into two NELists of the first and second half of each pair.
Converts this NEList of pairs into two NELists 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 NEList is a pair.
returns
a pair of NELists, containing the first and second half, respectively, of each element pair of this NEList.
def unzip3[L, M, R](implicit asTriple: (T) => (L, M, R)): (NEList[L], NEList[M], NEList[R])
Converts this NEList of triples into three NELists of the first, second, and and third element of each triple.
Converts this NEList of triples into three NELists 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 NEList is a triple.
returns
a triple of NELists, containing the first, second, and third member, respectively, of each element triple of this NEList.
def updated[U >: T](idx: Int, elem: U): NEList[U]
A copy of this NEList with one single replaced element.
A copy of this NEList with one single replaced element.
idx
the position of the replacement
elem
the replacing element
returns
a copy of this NEList with the element at position idx replaced by elem.
Exceptions thrown
IndexOutOfBoundsException if the passed index is greater than or equal to the length of this NEList
def zipAll[O, U >: T](other: Iterable[O], thisElem: U, otherElem: O): NEList[(U, O)]
Returns a NEList formed from this NEList and an iterable collection by combining corresponding elements in pairs.
Returns a NEList formed from this NEList and 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 Iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this NEList is shorter than that Iterable.
returns
a new NEList containing pairs consisting of corresponding elements of this NEList and that. The length of the returned collection is the maximum of the lengths of this NEList and that. If this NEList is shorter than that, thisElem values are used to pad the result. If that is shorter than this NEList, thatElem values are used to pad the result.
def zipWithIndex: NEList[(T, Int)]
Zips this NEList with its indices.
Zips this NEList with its indices.
returns
A new NEList containing pairs consisting of all elements of this NEList paired with their index. Indices start at 0.

Packages

NEList

Companion object NEList

final class NEList[+T] extends AnyVal

Value Members

Inherited from AnyVal

Inherited from Any

Ungrouped

Packages

NEList

Companion object NEList

final class NEList[+T] extends AnyVal

Value Members

Inherited from AnyVal

Inherited from Any

Ungrouped

NEList