LinearSeq

Companion object LinearSeq

trait LinearSeq[+A] extends Seq[A] with LinearSeqOps[A, LinearSeq, LinearSeq[A]]

Base trait for linearly accessed sequences that have efficient head and tail operations. Known subclasses: List, LazyList

Source: LinearSeq.scala

Linear Supertypes

LinearSeqOps[A, LinearSeq, LinearSeq[A]], Seq[A], Equals, SeqOps[A, [_]LinearSeq[_], LinearSeq[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], java.io.Serializable, IterableOps[A, [_]LinearSeq[_], LinearSeq[A]], IterableOnceOps[A, [_]LinearSeq[_], LinearSeq[A]], IterableOnce[A], AnyRef, Any

Known Subclasses

::, LazyList, LinearSeq, List, Nil, Queue, Cons, Empty, Stream

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

LinearSeq
LinearSeqOps
Seq
Equals
SeqOps
PartialFunction
Function1
Iterable
Serializable
IterableOps
IterableOnceOps
IterableOnce
AnyRef
Any

Implicitly

by iterableOnceExtensionMethods
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc

Hide All
Show All

Visibility

Public
All

Type Members

type IterableCC[X] = LinearSeq[X]
Type alias to CC.
Type alias to CC. It is used to provide a default implementation of the fromSpecific and newSpecificBuilder operations.
Due to the @uncheckedVariance annotation, usage of this type member can be unsound and is therefore not recommended.
Attributes
protected
Definition Classes
IterableOps

Value Members

final def !=(arg0: Any): Boolean
Test two objects for inequality.
Test two objects for inequality.
returns
true if !(this == that), false otherwise.
Definition Classes
AnyRef → Any
final def ##(): Int
Equivalent to x.hashCode except for boxed numeric types and null.
Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.
returns
a hash value consistent with ==
Definition Classes
AnyRef → Any
def +(other: String): String
Implicit
This member is added by an implicit conversion from LinearSeq[A] toany2stringadd[LinearSeq[A]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
final def ++[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
Alias for concat
Alias for concat
Definition Classes
IterableOps
Annotations
@inline()
final def ++:[B >: A](prefix: IterableOnce[B]): LinearSeq[B]
Alias for prependedAll
Alias for prependedAll
Definition Classes
SeqOps → IterableOps
Annotations
@inline()
final def +:[B >: A](elem: B): LinearSeq[B]
Alias for prepended.
Alias for prepended.
Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
Definition Classes
SeqOps
Annotations
@inline()
def ->[B](y: B): (LinearSeq[A], B)
Implicit
This member is added by an implicit conversion from LinearSeq[A] toArrowAssoc[LinearSeq[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def :+[B >: A](elem: B): LinearSeq[B]
Alias for appended
Alias for appended
Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
Definition Classes
SeqOps
Annotations
@inline()
final def :++[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
Alias for appendedAll
Alias for appendedAll
Definition Classes
SeqOps
Annotations
@inline()
final def ==(arg0: Any): Boolean
The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
returns
true if the receiver object is equivalent to the argument; false otherwise.
Definition Classes
AnyRef → Any
final def addString(b: mutable.StringBuilder): mutable.StringBuilder
Appends all elements of this $coll to a string builder.
Appends all elements of this $coll to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this $coll without any separator string.
Example:
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> val h = a.addString(b)
h: StringBuilder = 1234
```
b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
Appends all elements of this $coll to a string builder using a separator string.
Appends all elements of this $coll to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this $coll, separated by the string sep.
Example:
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> a.addString(b, ", ")
res0: StringBuilder = 1, 2, 3, 4
```
b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
Appends all elements of this $coll to a string builder using start, end, and separator strings.
Appends all elements of this $coll to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this $coll are separated by the string sep.
Example:
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> a.addString(b , "List(" , ", " , ")")
res5: StringBuilder = List(1, 2, 3, 4)
```
b
the string builder to which elements are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.
Definition Classes
IterableOnceOps
def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]
Composes this partial function with a transformation function that gets applied to results of this partial function.
Composes this partial function with a transformation function that gets applied to results of this partial function.
C
the result type of the transformation function.
k
the transformation function
returns
a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).
Definition Classes
PartialFunction → Function1
def appended[B >: A](elem: B): LinearSeq[B]
A copy of this sequence with an element appended.
A copy of this sequence with an element appended.
Note: will not terminate for infinite-sized collections.
Example:
```
scala> val a = List(1)
a: List[Int] = List(1)

scala> val b = a :+ 2
b: List[Int] = List(1, 2)

scala> println(a)
List(1)
```
B
the element type of the returned sequence.
elem
the appended element
returns
a new sequence consisting of all elements of this sequence followed by value.
Definition Classes
SeqOps
def appendedAll[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
Returns a new sequence containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new sequence containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the sequence is the most specific superclass encompassing the element types of the two operands.
B
the element type of the returned collection.
suffix
the iterable to append.
returns
a new collection of type CC[B] which contains all elements of this sequence followed by all elements of suffix.
Definition Classes
SeqOps
def apply(n: Int): A
Get the element at the specified index.
Get the element at the specified index. This operation is provided for convenience in Seq. It should not be assumed to be efficient unless you have an IndexedSeq.
Definition Classes
LinearSeqOps → SeqOps
Annotations
@throws(scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1
Applies this partial function to the given argument when it is contained in the function domain.
Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.
Note that expression pf.applyOrElse(x, default) is equivalent to
```
if(pf isDefinedAt x) pf(x) else default(x)
```
except that applyOrElse method can be implemented more efficiently. For all partial function literals the compiler generates an applyOrElse implementation which avoids double evaluation of pattern matchers and guards. This makes applyOrElse the basis for the efficient implementation for many operations and scenarios, such as:
- combining partial functions into orElse/andThen chains does not lead to excessive apply/isDefinedAt evaluation
- lift and unlift do not evaluate source functions twice on each invocation
- runWith allows efficient imperative-style combining of partial functions with conditionally applied actions
For non-literal partial function classes with nontrivial isDefinedAt method it is recommended to override applyOrElse with custom implementation that avoids double isDefinedAt evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.
x
the function argument
default
the fallback function
returns
the result of this function or fallback function application.
Definition Classes
PartialFunction
Since
2.10
final def asInstanceOf[T0]: T0
Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.
returns
the receiver object.
Definition Classes
Any
Exceptions thrown
ClassCastException if the receiver object is not an instance of the erasure of type T0.
def canEqual(that: Any): Boolean
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
that
The object with which this sequence should be compared
returns
true, if this sequence can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.
Definition Classes
Seq → Equals
def className: String
Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for ListMap this method should return "ListMap", not "Map" (the supertype) or "Node" (an implementation subclass).
The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".
returns
a string representation which starts the result of toString applied to this iterable collection. By default the string prefix is the simple name of the collection class iterable collection.
Attributes
protected[this]
Definition Classes
Iterable
def clone(): AnyRef
Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the clone method is platform dependent.
returns
a copy of the receiver object.
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws(classOf[java.lang.CloneNotSupportedException])
Note
not specified by SLS as a member of AnyRef
def coll: LinearSeq.this.type
returns
This collection as a C.
Attributes
protected
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[A, B]): LinearSeq[B]
Builds a new iterable collection by applying a partial function to all elements of this iterable collection on which the function is defined.
Builds a new iterable collection by applying a partial function to all elements of this iterable collection on which the function is defined.
B
the element type of the returned iterable collection.
pf
the partial function which filters and maps the iterable collection.
returns
a new iterable collection resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.
$mayNotTerminateInf $orderDependent
pf
the partial function
returns
an option value containing pf applied to the first value for which it is defined, or None if none exists.
Definition Classes
IterableOnceOps
Example:
1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
def combinations(n: Int): Iterator[LinearSeq[A]]
Iterates over combinations.
Iterates over combinations. A _combination_ of length n is a subsequence of the original sequence, with the elements taken in order. Thus, "xy" and "yy" are both length-2 combinations of "xyy", but "yx" is not. If there is more than one way to generate the same subsequence, only one will be returned.
For example, "xyyy" has three different ways to generate "xy" depending on whether the first, second, or third "y" is selected. However, since all are identical, only one will be chosen. Which of the three will be taken is an implementation detail that is not defined.
Note: Even when applied to a view or a lazy collection it will always force the elements.
returns
An Iterator which traverses the possible n-element combinations of this sequence.
Definition Classes
SeqOps
Example:
1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)
def compose[A](g: (A) ⇒ Int): (A) ⇒ A
Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
A
the type to which function g can be applied
g
a function A => T1
returns
a new function f such that f(x) == apply(g(x))
Definition Classes
Function1
Annotations
@unspecialized()
def concat[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
Returns a new sequence containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new sequence containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the sequence is the most specific superclass encompassing the element types of the two operands.
B
the element type of the returned collection.
suffix
the traversable to append.
returns
a new sequence which contains all elements of this sequence followed by all elements of suffix.
Definition Classes
SeqOps → IterableOps
Annotations
@deprecatedOverriding("This method should be final, but is not due to scala/bug#10853", "2.13.0") @inline()
def contains[A1 >: A](elem: A1): Boolean
Tests whether this sequence contains a given value as an element.
Tests whether this sequence contains a given value as an element.
Note: may not terminate for infinite-sized collections.
elem
the element to test.
returns
true if this sequence has an element that is equal (as determined by ==) to elem, false otherwise.
Definition Classes
LinearSeqOps → SeqOps
def containsSlice[B](that: Seq[B]): Boolean
Tests whether this sequence contains a given sequence as a slice.
Tests whether this sequence contains a given sequence as a slice.
Note: may not terminate for infinite-sized collections.
that
the sequence to test
returns
true if this sequence contains a slice with the same elements as that, otherwise false.
Definition Classes
SeqOps
def copyToArray(xs: Array[A], start: Int, len: Int): Int
[use case] Note: will not terminate for infinite-sized collections.
[use case]
Note: will not terminate for infinite-sized collections.
xs
the array to fill.
start
the starting index of xs.
len
the maximal number of elements to copy.
returns
the number of elements written to the array
Definition Classes
IterableOnceOps
Full Signature
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
def copyToArray(xs: Array[A], start: Int): Int
[use case] Note: will not terminate for infinite-sized collections.
[use case]
Note: will not terminate for infinite-sized collections.
xs
the array to fill.
start
the starting index of xs.
returns
the number of elements written to the array
Definition Classes
IterableOnceOps
Full Signature
def copyToArray[B >: A](xs: Array[B], start: Int): Int
def copyToArray(xs: Array[A]): Int
[use case] Note: will not terminate for infinite-sized collections.
[use case]
Note: will not terminate for infinite-sized collections.
xs
the array to fill.
returns
the number of elements written to the array
Definition Classes
IterableOnceOps
Full Signature
def copyToArray[B >: A](xs: Array[B]): Int
def corresponds[B](that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean
Tests whether every element of this sequence relates to the corresponding element of another sequence by satisfying a test predicate.
Tests whether every element of this sequence relates to the corresponding element of another sequence by satisfying a test predicate.
B
the type of the elements of that
that
the other sequence
p
the test predicate, which relates elements from both sequences
returns
true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this sequence and y of that, otherwise false.
Definition Classes
SeqOps
def corresponds[B](that: IterableOnce[B])(p: (A, B) ⇒ Boolean): Boolean
Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.
Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.
B
the type of the elements of that
that
the other collection
p
the test predicate, which relates elements from both collections
returns
true if both collections have the same length and p(x, y) is true for all corresponding elements x of this iterator and y of that, otherwise false
Definition Classes
IterableOnceOps
def count(p: (A) ⇒ Boolean): Int
Counts the number of elements in the $coll which satisfy a predicate.
Counts the number of elements in the $coll which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.
Definition Classes
IterableOnceOps
def diff(that: Seq[_ >: A]): LinearSeq[A]
Computes the multiset difference between this sequence and another sequence.
Computes the multiset difference between this sequence and another sequence.
that
the sequence of elements to remove
returns
a new sequence which contains all elements of this sequence except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will. Note: will not terminate for infinite-sized collections. Note: Even when applied to a view or a lazy collection it will always force the elements.
Definition Classes
SeqOps
def distinct: LinearSeq[A]
Selects all the elements of this sequence ignoring the duplicates.
Selects all the elements of this sequence ignoring the duplicates.
returns
a new sequence consisting of all the elements of this sequence without duplicates.
Definition Classes
SeqOps
def distinctBy[B](f: (A) ⇒ B): LinearSeq[A]
Selects all the elements of this sequence ignoring the duplicates as determined by == after applying the transforming function f.
Selects all the elements of this sequence ignoring the duplicates as determined by == after applying the transforming function f.
B
the type of the elements after being transformed by f
f
The transforming function whose result is used to determine the uniqueness of each element
returns
a new sequence consisting of all the elements of this sequence without duplicates.
Definition Classes
SeqOps
def drop(n: Int): LinearSeq[A]
Selects all elements except first n ones.
Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the number of elements to drop from this iterable collection.
returns
a iterable collection consisting of all elements of this iterable collection except the first n ones, or else the empty iterable collection, if this iterable collection has less than n elements. If n is negative, don't drop any elements.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def dropRight(n: Int): LinearSeq[A]
The rest of the collection without its n last elements.
The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.
Note: Even when applied to a view or a lazy collection it will always force the elements.
Definition Classes
IterableOps
def dropWhile(p: (A) ⇒ Boolean): LinearSeq[A]
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
The predicate used to test elements.
returns
the longest suffix of this iterable collection whose first element does not satisfy the predicate p.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def endsWith[B >: A](that: Iterable[B]): Boolean
Tests whether this sequence ends with the given sequence.
Tests whether this sequence ends with the given sequence.
Note: will not terminate for infinite-sized collections.
that
the sequence to test
returns
true if this sequence has that as a suffix, false otherwise.
Definition Classes
SeqOps
def ensuring(cond: (LinearSeq[A]) ⇒ Boolean, msg: ⇒ Any): LinearSeq[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toEnsuring[LinearSeq[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (LinearSeq[A]) ⇒ Boolean): LinearSeq[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toEnsuring[LinearSeq[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): LinearSeq[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toEnsuring[LinearSeq[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): LinearSeq[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toEnsuring[LinearSeq[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Tests whether the argument (that) is a reference to the receiver object (this).
Tests whether the argument (that) is a reference to the receiver object (this).
The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:
- It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
- For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
- null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
returns
true if the argument is a reference to the receiver object; false otherwise.
Definition Classes
AnyRef
def equals(o: Any): Boolean
The universal equality method defined in AnyRef.
The universal equality method defined in AnyRef.
Definition Classes
Seq → Equals → AnyRef → Any
def exists(p: (A) ⇒ Boolean): Boolean
Tests whether a predicate holds for at least one element of this sequence.
Tests whether a predicate holds for at least one element of this sequence.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
true if the given predicate p is satisfied by at least one element of this sequence, otherwise false
Definition Classes
LinearSeqOps → IterableOnceOps
def filter(pred: (A) ⇒ Boolean): LinearSeq[A]
Selects all elements of this iterable collection which satisfy a predicate.
Selects all elements of this iterable collection which satisfy a predicate.
returns
a new iterator consisting of all elements of this iterable collection that satisfy the given predicate p. The order of the elements is preserved.
Definition Classes
IterableOps → IterableOnceOps
def filterNot(pred: (A) ⇒ Boolean): LinearSeq[A]
Selects all elements of this iterable collection which do not satisfy a predicate.
Selects all elements of this iterable collection which do not satisfy a predicate.
pred
the predicate used to test elements.
returns
a new iterable collection consisting of all elements of this iterable collection that do not satisfy the given predicate pred. Their order may not be preserved.
Definition Classes
IterableOps → IterableOnceOps
def finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
Note
not specified by SLS as a member of AnyRef
def find(p: (A) ⇒ Boolean): Option[A]
Finds the first element of the sequence satisfying a predicate, if any.
Finds the first element of the sequence satisfying a predicate, if any.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
an option value containing the first element in the sequence that satisfies p, or None if none exists.
Definition Classes
LinearSeqOps → IterableOnceOps
def flatMap[B](f: (A) ⇒ IterableOnce[B]): LinearSeq[B]
Builds a new iterable collection by applying a function to all elements of this iterable collection and using the elements of the resulting collections.
Builds a new iterable collection by applying a function to all elements of this iterable collection and using the elements of the resulting collections.
For example:
```
def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")
```
The type of the resulting collection is guided by the static type of iterable collection. This might cause unexpected results sometimes. For example:
```
// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

// lettersOf will return a Set[Char], not a Seq
def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq)

// xs will be an Iterable[Int]
val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

// ys will be a Map[Int, Int]
val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
```
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new iterable collection resulting from applying the given collection-valued function f to each element of this iterable collection and concatenating the results.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def flatten[B](implicit asIterable: (A) ⇒ IterableOnce[B]): LinearSeq[B]
Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.
Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.
The resulting collection's type will be guided by the type of iterable collection. For example:
```
val xs = List(
           Set(1, 2, 3),
           Set(1, 2, 3)
         ).flatten
// xs == List(1, 2, 3, 1, 2, 3)

val ys = Set(
           List(1, 2, 3),
           List(3, 2, 1)
         ).flatten
// ys == Set(1, 2, 3)
```
B
the type of the elements of each traversable collection.
asIterable
an implicit conversion which asserts that the element type of this iterable collection is a GenTraversable.
returns
a new iterable collection resulting from concatenating all element iterable collections.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
Applies a binary operator to a start value and all elements of this sequence, going left to right.
Applies a binary operator to a start value and all elements of this sequence, going left to right.
Note: will not terminate for infinite-sized collections.
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 sequence, going left to right with the start value z on the left:
```
op(...op(z, x_1), x_2, ..., x_n)
```
where x₁, ..., x_n are the elements of this sequence. Returns z if this sequence is empty.
Definition Classes
LinearSeqOps → IterableOnceOps
def foldRight[B](z: B)(op: (A, B) ⇒ B): B
Applies a binary operator to all elements of this $coll and a start value, going right to left.
Applies a binary operator to all elements of this $coll and a start value, going right to left.
$willNotTerminateInf $orderDependentFold
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 $coll, 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 $coll. Returns z if this $coll is empty.
Definition Classes
IterableOnceOps
def forall(p: (A) ⇒ Boolean): Boolean
Tests whether a predicate holds for all elements of this sequence.
Tests whether a predicate holds for all elements of this sequence.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
true if this sequence is empty or the given predicate p holds for all elements of this sequence, otherwise false.
Definition Classes
LinearSeqOps → IterableOnceOps
def foreach[U](f: (A) ⇒ U): Unit
Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.
Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.
Definition Classes
LinearSeqOps → IterableOnceOps
def formatted(fmtstr: String): String
Returns string formatted according to given format string.
Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).
Implicit
This member is added by an implicit conversion from LinearSeq[A] toStringFormat[LinearSeq[A]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
def fromSpecific(coll: IterableOnce[A]): IterableCC[A]
Defines how to turn a given Iterable[A] into a collection of type C.
Defines how to turn a given Iterable[A] into a collection of type C.
This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.
Attributes
protected
Definition Classes
Iterable → IterableOps
Note
As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as it is called with an Iterable[A] obtained from this collection (as it is the case in the implementations of operations where we use a View[A]), it is safe.
final def getClass(): Class[_]
Returns the runtime class representation of the object.
Returns the runtime class representation of the object.
returns
a class object corresponding to the runtime type of the receiver.
Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (A) ⇒ K): immutable.Map[K, LinearSeq[A]]
Partitions this iterable collection into a map of iterable collections according to some discriminator function.
Partitions this iterable collection into a map of iterable collections according to some discriminator function.
Note: Even when applied to a view or a lazy collection it will always force the elements.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to iterable collections such that the following invariant holds:
```
(xs groupBy f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a iterable collection of those elements x for which f(x) equals k.
Definition Classes
IterableOps
def groupMap[K, B](key: (A) ⇒ K)(f: (A) ⇒ B): immutable.Map[K, LinearSeq[B]]
Partitions this iterable collection into a map of iterable collections according to a discriminator function key.
Partitions this iterable collection into a map of iterable collections according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.
It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.
```
case class User(name: String, age: Int)

def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
  users.groupMap(_.age)(_.name)
```
Note: Even when applied to a view or a lazy collection it will always force the elements.
K
the type of keys returned by the discriminator function
B
the type of values returned by the transformation function
key
the discriminator function
f
the element transformation function
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (A) ⇒ K)(f: (A) ⇒ B)(reduce: (B, B) ⇒ B): immutable.Map[K, B]
Partitions this iterable collection into a map according to a discriminator function key.
Partitions this iterable collection into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the value function and then reduced into a single value with the reduce function.
It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.
```
def occurrences[A](as: Seq[A]): Map[A, Int] =
  as.groupMapReduce(identity)(_ => 1)(_ + _)
```
Definition Classes
IterableOps
def grouped(size: Int): Iterator[LinearSeq[A]]
Partitions elements in fixed size iterable collections.
Partitions elements in fixed size iterable collections.
size
the number of elements per group
returns
An iterator producing iterable collections of size size, except the last will be less than size size if the elements don't divide evenly.
Definition Classes
IterableOps
See also
scala.collection.Iterator, method grouped
def hashCode(): Int
The hashCode method for reference types.
The hashCode method for reference types. See hashCode in scala.Any.
returns
the hash code value for this object.
Definition Classes
Seq → AnyRef → Any
def head: A
Selects the first element of this iterable collection.
Selects the first element of this iterable collection.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this iterable collection.
Definition Classes
IterableOps
Exceptions thrown
NoSuchElementException if the iterable collection is empty.
def headOption: Option[A]
Optionally selects the first element.
Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this iterable collection if it is nonempty, None if it is empty.
Definition Classes
IterableOps
def indexOf[B >: A](elem: B): Int
Finds index of first occurrence of some value in this sequence.
Finds index of first occurrence of some value in this sequence.
B
the type of the element elem.
elem
the element value to search for.
returns
the index >= 0 of the first element of this sequence that is equal (as determined by ==) to elem, or -1, if none exists.
Definition Classes
SeqOps
Annotations
@deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
def indexOf[B >: A](elem: B, from: Int): Int
Finds index of first occurrence of some value in this sequence after or at some start index.
Finds index of first occurrence of some value in this sequence after or at some start index.
B
the type of the element elem.
elem
the element value to search for.
from
the start index
returns
the index >= from of the first element of this sequence that is equal (as determined by ==) to elem, or -1, if none exists.
Definition Classes
SeqOps
def indexOfSlice[B >: A](that: Seq[B]): Int
Finds first index where this sequence contains a given sequence as a slice.
Finds first index where this sequence contains a given sequence as a slice.
Note: may not terminate for infinite-sized collections.
that
the sequence to test
returns
the first index >= 0 such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.
Definition Classes
SeqOps
Annotations
@deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
Finds first index after or at a start index where this sequence contains a given sequence as a slice.
Finds first index after or at a start index where this sequence contains a given sequence as a slice.
Note: may not terminate for infinite-sized collections.
that
the sequence to test
from
the start index
returns
the first index >= from such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.
Definition Classes
SeqOps
def indexWhere(p: (A) ⇒ 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.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
from
the start index
returns
the index >= from of the first element of this sequence that satisfies the predicate p, or -1, if none exists.
Definition Classes
LinearSeqOps → SeqOps
def indexWhere(p: (A) ⇒ Boolean): Int
Finds index of the first element satisfying some predicate.
Finds index of the first element satisfying some predicate.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
the index >= 0 of the first element of this sequence that satisfies the predicate p, or -1, if none exists.
Definition Classes
SeqOps
Annotations
@deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
def indices: immutable.Range
Produces the range of all indices of this sequence.
Produces the range of all indices of this sequence.
returns
a Range value from 0 to one less than the length of this sequence.
Definition Classes
SeqOps
def init: LinearSeq[A]
The initial part of the collection without its last element.
The initial part of the collection without its last element.
Definition Classes
IterableOps
def inits: Iterator[LinearSeq[A]]
Iterates over the inits of this iterable collection.
Iterates over the inits of this iterable collection. The first value will be this iterable collection and the final one will be an empty iterable collection, with the intervening values the results of successive applications of init.
returns
an iterator over all the inits of this iterable collection
Definition Classes
IterableOps
Example:
1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
def intersect(that: Seq[_ >: A]): LinearSeq[A]
Computes the multiset intersection between this sequence and another sequence.
Computes the multiset intersection between this sequence and another sequence.
that
the sequence of elements to intersect with.
returns
a new sequence which contains all elements of this sequence which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted. Note: may not terminate for infinite-sized collections. Note: Even when applied to a view or a lazy collection it will always force the elements.
Definition Classes
SeqOps
def isDefinedAt(x: Int): Boolean
Tests whether this sequence contains given index.
Tests whether this sequence contains given index.
The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].
returns
true if this sequence contains an element at position idx, false otherwise.
Definition Classes
LinearSeqOps → SeqOps
def isEmpty: Boolean
Tests whether the sequence is empty.
Tests whether the sequence is empty.
Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.
returns
true if the sequence contains no elements, false otherwise.
Definition Classes
SeqOps → IterableOnceOps
final def isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.
Definition Classes
Any
def isTraversableAgain: Boolean
Tests whether this iterable collection can be repeatedly traversed.
Tests whether this iterable collection can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.
returns
true if it is repeatedly traversable, false otherwise.
Definition Classes
IterableOps → IterableOnceOps
def iterableFactory: SeqFactory[IterableCC]
returns
The factory of this collection.
Definition Classes
Seq → Iterable → IterableOps
Note
This operation has to be overridden by concrete collection classes to effectively return an IterableFactory[IterableCC]. The implementation in Iterable only returns an IterableFactory[Iterable], but the compiler will not throw an error if the effective IterableCC type constructor is more specific than Iterable.
def iterator: Iterator[A]
Iterator can be used only once
Iterator can be used only once
Definition Classes
LinearSeqOps → IterableOnce
def knownSize: Int
Definition Classes
IterableOnceOps
def last: A
Selects the last element.
Selects the last element.
returns
The last element of this sequence.
Definition Classes
LinearSeqOps → IterableOps
Exceptions thrown
NoSuchElementException If the sequence is empty.
def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
Finds index of last occurrence of some value in this sequence before or at a given end index.
Finds index of last occurrence of some value in this sequence before or at a given end index.
B
the type of the element elem.
elem
the element value to search for.
end
the end index.
returns
the index <= end of the last element of this sequence that is equal (as determined by ==) to elem, or -1, if none exists.
Definition Classes
SeqOps
def lastIndexOfSlice[B >: A](that: Seq[B]): Int
Finds last index where this sequence contains a given sequence as a slice.
Finds last index where this sequence contains a given sequence as a slice.
that
the sequence to test
returns
the last index such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.
Definition Classes
SeqOps
Annotations
@deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
Finds last index before or at a given end index where this sequence contains a given sequence as a slice.
Finds last index before or at a given end index where this sequence contains a given sequence as a slice.
that
the sequence to test
end
the end index
returns
the last index <= end such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.
Definition Classes
SeqOps
def lastIndexWhere(p: (A) ⇒ 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.
returns
the index <= end of the last element of this sequence that satisfies the predicate p, or -1, if none exists.
Definition Classes
LinearSeqOps → SeqOps
def lastIndexWhere(p: (A) ⇒ 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 sequence that satisfies the predicate p, or -1, if none exists.
Definition Classes
SeqOps
Annotations
@deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
def lastOption: Option[A]
Optionally selects the last element.
Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the last element of this iterable collection$ if it is nonempty, None if it is empty.
Definition Classes
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, LinearSeq.this.type]
Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.
Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.
Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.
```
val xs = List(1, 2, 3)
val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
// res == List(4, 8, 12)
```
B
the type of the second element in each eventual pair
that
the iterable providing the second element of each eventual pair
returns
a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.
Definition Classes
Iterable
def length: Int
The length (number of elements) of the sequence.
The length (number of elements) of the sequence. size is an alias for length in Seq collections.
Definition Classes
LinearSeqOps → SeqOps
def lengthCompare(len: Int): Int
Compares the length of this sequence to a test value.
Compares the length of this sequence 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
```
The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.
Definition Classes
LinearSeqOps → SeqOps
final def lengthIs: SizeCompareOps
Returns a value class containing operations for comparing the length of this sequence to a test value.
Returns a value class containing operations for comparing the length of this sequence to a test value.
These operations are implemented in terms of lengthCompare(Int), and allow the following more readable usages:
```
this.lengthIs < len     // this.lengthCompare(len) < 0
this.lengthIs <= len    // this.lengthCompare(len) <= 0
this.lengthIs == len    // this.lengthCompare(len) == 0
this.lengthIs != len    // this.lengthCompare(len) != 0
this.lengthIs >= len    // this.lengthCompare(len) >= 0
this.lengthIs > len     // this.lengthCompare(len) > 0
```
Definition Classes
SeqOps
Annotations
@inline()
def lift: (Int) ⇒ Option[A]
Turns this partial function into a plain function returning an Option result.
Turns this partial function into a plain function returning an Option result.
returns
a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.
Definition Classes
PartialFunction
See also
Function.unlift
def map[B](f: (A) ⇒ B): LinearSeq[B]
Builds a new iterable collection by applying a function to all elements of this iterable collection.
Builds a new iterable collection by applying a function to all elements of this iterable collection.
B
the element type of the returned iterable collection.
f
the function to apply to each element.
returns
a new iterable collection resulting from applying the given function f to each element of this iterable collection and collecting the results.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def max: A
[use case] Finds the largest element.
[use case]
Finds the largest element.
returns
the largest element of this sequence.
Definition Classes
IterableOnceOps
Full Signature
def max[B >: A](implicit ord: math.Ordering[B]): A
Exceptions thrown
UnsupportedOperationException if this sequence is empty.
def maxBy[B](f: (A) ⇒ B): A
[use case] Finds the first element which yields the largest value measured by function f.
[use case]
Finds the first element which yields the largest value measured by function f.
B
The result type of the function f.
f
The measuring function.
returns
the first element of this sequence with the largest value measured by function f.
Definition Classes
IterableOnceOps
Full Signature
def maxBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
Exceptions thrown
UnsupportedOperationException if this sequence is empty.
def maxByOption[B](f: (A) ⇒ B): Option[A]
[use case] Finds the first element which yields the largest value measured by function f.
[use case]
Finds the first element which yields the largest value measured by function f.
B
The result type of the function f.
f
The measuring function.
returns
an option value containing the first element of this sequence with the largest value measured by function f.
Definition Classes
IterableOnceOps
Full Signature
def maxByOption[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): Option[A]
def maxOption: Option[A]
[use case] Finds the largest element.
[use case]
Finds the largest element.
returns
an option value containing the largest element of this sequence.
Definition Classes
IterableOnceOps
Full Signature
def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
def min: A
[use case] Finds the smallest element.
[use case]
Finds the smallest element.
returns
the smallest element of this sequence
Definition Classes
IterableOnceOps
Full Signature
def min[B >: A](implicit ord: math.Ordering[B]): A
Exceptions thrown
UnsupportedOperationException if this sequence is empty.
def minBy[B](f: (A) ⇒ B): A
[use case] Finds the first element which yields the smallest value measured by function f.
[use case]
Finds the first element which yields the smallest value measured by function f.
B
The result type of the function f.
f
The measuring function.
returns
the first element of this sequence with the smallest value measured by function f.
Definition Classes
IterableOnceOps
Full Signature
def minBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
Exceptions thrown
UnsupportedOperationException if this sequence is empty.
def minByOption[B](f: (A) ⇒ B): Option[A]
[use case] Finds the first element which yields the smallest value measured by function f.
[use case]
Finds the first element which yields the smallest value measured by function f.
B
The result type of the function f.
f
The measuring function.
returns
an option value containing the first element of this sequence with the smallest value measured by function f.
Definition Classes
IterableOnceOps
Full Signature
def minByOption[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): Option[A]
def minOption: Option[A]
[use case] Finds the smallest element.
[use case]
Finds the smallest element.
returns
an option value containing the smallest element of this sequence.
Definition Classes
IterableOnceOps
Full Signature
def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
final def mkString: String
Displays all elements of this $coll in a string.
Displays all elements of this $coll in a string.
Delegates to addString, which can be overridden.
returns
a string representation of this $coll. In the resulting string the string representations (w.r.t. the method toString) of all elements of this $coll follow each other without any separator string.
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Displays all elements of this $coll in a string using a separator string.
Displays all elements of this $coll in a string using a separator string.
Delegates to addString, which can be overridden.
sep
the separator string.
returns
a string representation of this $coll. In the resulting string the string representations (w.r.t. the method toString) of all elements of this $coll are separated by the string sep.
Definition Classes
IterableOnceOps
Annotations
@inline()
Example:
1. List(1, 2, 3).mkString("|") = "1|2|3"
final def mkString(start: String, sep: String, end: String): String
Displays all elements of this $coll in a string using start, end, and separator strings.
Displays all elements of this $coll in a string using start, end, and separator strings.
Delegates to addString, which can be overridden.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this $coll. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this $coll are separated by the string sep.
Definition Classes
IterableOnceOps
Example:
1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
final def ne(arg0: AnyRef): Boolean
Equivalent to !(this eq that).
Equivalent to !(this eq that).
returns
true if the argument is not a reference to the receiver object; false otherwise.
Definition Classes
AnyRef
def newSpecificBuilder: Builder[A, IterableCC[A]]
returns
a strict builder for the same collection type. Note that in the case of lazy collections (e.g. View or immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented with fromSpecific instead of this method.
Attributes
protected
Definition Classes
Iterable → IterableOps
Note
As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as the returned builder is only fed with A values taken from this instance, it is safe.
def nonEmpty: Boolean
Tests whether the $coll is not empty.
Tests whether the $coll is not empty.
returns
true if the $coll contains at least one element, false otherwise.
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
final def notify(): Unit
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
Definition Classes
AnyRef
Annotations
@native()
Note
not specified by SLS as a member of AnyRef
final def notifyAll(): Unit
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Definition Classes
AnyRef
Annotations
@native()
Note
not specified by SLS as a member of AnyRef
def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.
A1
the argument type of the fallback function
B1
the result type of the fallback function
that
the fallback function
returns
a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.
Definition Classes
PartialFunction
def padTo[B >: A](len: Int, elem: B): LinearSeq[B]
A copy of this sequence with an element value appended until a given target length is reached.
A copy of this sequence with an element value appended until a given target length is reached.
B
the element type of the returned sequence.
len
the target length
elem
the padding value
returns
a new sequence consisting of all elements of this sequence followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.
Definition Classes
SeqOps
def partition(p: (A) ⇒ Boolean): (LinearSeq[A], LinearSeq[A])
A pair of, first, all elements that satisfy predicate p and, second, all elements that do not.
A pair of, first, all elements that satisfy predicate p and, second, all elements that do not. Interesting because it splits a collection in two.
The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in StrictOptimizedIterableOps, which requires only a single traversal.
Definition Classes
IterableOps
def partitionWith[A1, A2](f: (A) ⇒ Either[A1, A2]): (LinearSeq[A1], LinearSeq[A2])
A pair of iterable collections, first, consisting of the values that are produced by f applied to this iterable collection elements contained in scala.util.Left and, second, all the values contained in scala.util.Right.
A pair of iterable collections, first, consisting of the values that are produced by f applied to this iterable collection elements contained in scala.util.Left and, second, all the values contained in scala.util.Right.
Example:
```
val xs = Iterable(1, "one", 2, "two", 3, "three") partitionWith {
 case i: Int => Left(i)
 case s: String => Right(s)
}
// xs == (Iterable(1, 2, 3),
//        Iterable(one, two, three))
```
A1
element type of the first resulting collection
A2
element type of the second resulting collection
f
split function that map the element of the iterable collection into an scala.util.Either[A1, A2]
returns
a pair of iterable collections, first, consisting of the values that are produced by f applied to this iterable collection elements contained in scala.util.Left and, second, all the values contained in scala.util.Right.
Definition Classes
IterableOps
def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): LinearSeq[B]
Produces a new sequence where a slice of elements in this sequence is replaced by another sequence.
Produces a new sequence where a slice of elements in this sequence is replaced by another sequence.
Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original sequence appends the patch to the end. If more values are replaced than actually exist, the excess is ignored.
B
the element type of the returned sequence.
from
the index of the first replaced element
other
the replacement sequence
replaced
the number of elements to drop in the original sequence
returns
a new sequence consisting of all elements of this sequence except that replaced elements starting from from are replaced by all the elements of other.
Definition Classes
SeqOps
def permutations: Iterator[LinearSeq[A]]
Iterates over distinct permutations.
Iterates over distinct permutations.
returns
An Iterator which traverses the distinct permutations of this sequence.
Definition Classes
SeqOps
Example:
1. "abb".permutations = Iterator(abb, bab, bba)
def prepended[B >: A](elem: B): LinearSeq[B]
A copy of the sequence with an element prepended.
A copy of the sequence with an element prepended.
Also, the original sequence is not modified, so you will want to capture the result.
Example:
```
scala> val x = List(1)
x: List[Int] = List(1)

scala> val y = 2 +: x
y: List[Int] = List(2, 1)

scala> println(x)
List(1)
```
B
the element type of the returned sequence.
elem
the prepended element
returns
a new sequence consisting of value followed by all elements of this sequence.
Definition Classes
SeqOps
def prependedAll[B >: A](prefix: IterableOnce[B]): LinearSeq[B]
As with :++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
As with :++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
It differs from :++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.
B
the element type of the returned collection.
prefix
the iterable to prepend.
returns
a new sequence which contains all elements of prefix followed by all the elements of this sequence.
Definition Classes
SeqOps
def product: A
[use case] Multiplies up the elements of this collection.
[use case]
Multiplies up the elements of this collection.
returns
the product of all elements in this sequence of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the sequence and as result type of product. Examples of such types are: Long, Float, Double, BigInt.
Definition Classes
IterableOnceOps
Full Signature
def product[B >: A](implicit num: math.Numeric[B]): B
def reduce[B >: A](op: (B, B) ⇒ B): B
Reduces the elements of this $coll using the specified associative binary operator.
Reduces the elements of this $coll using the specified associative binary operator.
$undefinedorder
B
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
The result of applying reduce operator op between all the elements if the $coll is nonempty.
Definition Classes
IterableOnceOps
Exceptions thrown
UnsupportedOperationException if this $coll is empty.
def reduceLeft[B >: A](op: (B, A) ⇒ B): B
Applies a binary operator to all elements of this $coll, going left to right.
Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this $coll, going left to right:
```
op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
```
where x₁, ..., x_n are the elements of this $coll.
Definition Classes
IterableOnceOps
Exceptions thrown
UnsupportedOperationException if this $coll is empty.
def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going left to right.
Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) if this $coll is nonempty, None otherwise.
Definition Classes
IterableOnceOps
def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]
Reduces the elements of this $coll, if any, using the specified associative binary operator.
Reduces the elements of this $coll, if any, using the specified associative binary operator.
$undefinedorder
B
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.
Definition Classes
IterableOnceOps
def reduceRight[B >: A](op: (A, B) ⇒ B): B
Applies a binary operator to all elements of this $coll, going right to left.
Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this $coll, 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 $coll.
Definition Classes
IterableOnceOps
Exceptions thrown
UnsupportedOperationException if this $coll is empty.
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going right to left.
Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) if this $coll is nonempty, None otherwise.
Definition Classes
IterableOnceOps
def reverse: LinearSeq[A]
Returns new sequence with elements in reversed order.
Returns new sequence with elements in reversed order.
Note: will not terminate for infinite-sized collections.
returns
A new sequence with all elements of this sequence in reversed order.
Definition Classes
SeqOps
def reverseIterator: Iterator[A]
An iterator yielding elements in reversed order.
An iterator yielding elements in reversed order.
Note: will not terminate for infinite-sized collections.
Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.
returns
an iterator yielding the elements of this sequence in reversed order
Definition Classes
SeqOps
def reversed: Iterable[A]
Attributes
protected
Definition Classes
IterableOnceOps
def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean
Composes this partial function with an action function which gets applied to results of this partial function.
Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.
Note that expression pf.runWith(action)(x) is equivalent to
```
if(pf isDefinedAt x) { action(pf(x)); true } else false
```
except that runWith is implemented via applyOrElse and thus potentially more efficient. Using runWith avoids double evaluation of pattern matchers and guards for partial function literals.
action
the action function
returns
a function which maps arguments x to isDefinedAt(x). The resulting function runs action(this(x)) where this is defined.
Definition Classes
PartialFunction
Since
2.10
See also
applyOrElse.
def sameElements[B >: A](that: IterableOnce[B]): Boolean
Are the elements of this collection the same (and in the same order) as those of that?
Are the elements of this collection the same (and in the same order) as those of that?
Definition Classes
LinearSeqOps → SeqOps
def scanLeft[B](z: B)(op: (B, A) ⇒ B): LinearSeq[B]
Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.
Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
B
the type of the elements in the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
collection with intermediate results
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def scanRight[B](z: B)(op: (A, B) ⇒ B): LinearSeq[B]
Produces a collection containing cumulative results of applying the operator going right to left.
Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Example:
```
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
```
B
the type of the elements in the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
collection with intermediate results
Definition Classes
IterableOps
def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Search within an interval in this sorted sequence for a specific element.
Search within an interval in this sorted sequence for a specific element. If this sequence is an IndexedSeq, a binary search is used. Otherwise, a linear search is used.
The sequence should be sorted with the same Ordering before calling; otherwise, the results are undefined.
elem
the element to find.
from
the index where the search starts.
to
the index following where the search ends.
ord
the ordering to be used to compare elements.
returns
a Found value containing the index corresponding to the element in the sequence, or the InsertionPoint where the element would be inserted if the element is not in the sequence.
Definition Classes
SeqOps
Note
if to <= from, the search space is empty, and an InsertionPoint at from is returned
See also
scala.collection.IndexedSeq
scala.math.Ordering
scala.collection.SeqOps, method sorted
def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
Search this sorted sequence for a specific element.
Search this sorted sequence for a specific element. If the sequence is an IndexedSeq, a binary search is used. Otherwise, a linear search is used.
The sequence should be sorted with the same Ordering before calling; otherwise, the results are undefined.
elem
the element to find.
ord
the ordering to be used to compare elements.
returns
a Found value containing the index corresponding to the element in the sequence, or the InsertionPoint where the element would be inserted if the element is not in the sequence.
Definition Classes
SeqOps
See also
scala.collection.IndexedSeq
scala.math.Ordering
scala.collection.SeqOps, method sorted
def segmentLength(p: (A) ⇒ Boolean, from: Int = 0): Int
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
from
the index where the search starts.
returns
the length of the longest segment of this sequence starting from index from such that every element of the segment satisfies the predicate p.
Definition Classes
SeqOps
final def size: Int
The size of this sequence.
The size of this sequence.
Note: will not terminate for infinite-sized collections.
returns
the number of elements in this sequence.
Definition Classes
SeqOps → IterableOnceOps
final def sizeCompare(_size: Int): Int
Compares the size of this sequence to a test value.
Compares the size of this sequence to a test value.
returns
A value x where
```
x <  0       if this.size <  otherSize
x == 0       if this.size == otherSize
x >  0       if this.size >  otherSize
```
The method as implemented here does not call size directly; its running time is O(size min _size) instead of O(size). The method should be overwritten if computing size is cheap.
Definition Classes
SeqOps → IterableOps
def sizeCompare(that: Iterable[_]): Int
Compares the size of this iterable collection to the size of another Iterable.
Compares the size of this iterable collection to the size of another Iterable.
that
the Iterable whose size is compared with this iterable collection's size.
```
x <  0       if this.size <  that.size
x == 0       if this.size == that.size
x >  0       if this.size >  that.size
```
The method as implemented here does not call size directly; its running time is O(this.size min that.size) instead of O(this.size + that.size). The method should be overwritten if computing size is cheap.
Definition Classes
IterableOps
final def sizeIs: SizeCompareOps
Returns a value class containing operations for comparing the size of this iterable collection to a test value.
Returns a value class containing operations for comparing the size of this iterable collection to a test value.
These operations are implemented in terms of sizeCompare(Int), and allow the following more readable usages:
```
this.sizeIs < size     // this.sizeCompare(size) < 0
this.sizeIs <= size    // this.sizeCompare(size) <= 0
this.sizeIs == size    // this.sizeCompare(size) == 0
this.sizeIs != size    // this.sizeCompare(size) != 0
this.sizeIs >= size    // this.sizeCompare(size) >= 0
this.sizeIs > size     // this.sizeCompare(size) > 0
```
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): LinearSeq[A]
Selects an interval of elements.
Selects an interval of elements. The returned iterable collection is made up of all elements x which satisfy the invariant:
```
from <= indexOf(x) < until
```
Note: might return different results for different runs, unless the underlying collection type is ordered.
from
the lowest index to include from this iterable collection.
until
the lowest index to EXCLUDE from this iterable collection.
returns
a iterable collection containing the elements greater than or equal to index from extending up to (but not including) index until of this iterable collection.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def sliding(size: Int, step: Int): Iterator[LinearSeq[A]]
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
step
the distance between the first elements of successive groups
returns
An iterator producing iterable collections of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.
Definition Classes
IterableOps
See also
scala.collection.Iterator, method sliding
def sliding(size: Int): Iterator[LinearSeq[A]]
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) The "sliding window" step is set to one.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) The "sliding window" step is set to one.
size
the number of elements per group
returns
An iterator producing iterable collections of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.
Definition Classes
IterableOps
See also
scala.collection.Iterator, method sliding
def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): LinearSeq[A]
Sorts this sequence according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.
Sorts this sequence according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.
Note: will not terminate for infinite-sized collections.
The sort is stable. That is, elements that are equal (as determined by ord.compare) appear in the same order in the sorted sequence as in the original.
B
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 B.
ord
the ordering assumed on domain B.
returns
a sequence consisting of the elements of this sequence sorted according to the ordering where x < y if ord.lt(f(x), f(y)).
Definition Classes
SeqOps
Example:
1. val words = "The quick brown fox jumped over the lazy dog".split(' ') // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]] words.sortBy(x => (x.length, x.head)) res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
See also
scala.math.Ordering
def sortWith(lt: (A, A) ⇒ Boolean): LinearSeq[A]
Sorts this sequence according to a comparison function.
Sorts this sequence according to a comparison function.
Note: will not terminate for infinite-sized collections.
The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the sorted sequence as in the original.
lt
the comparison function which tests whether its first argument precedes its second argument in the desired ordering.
returns
a sequence consisting of the elements of this sequence sorted according to the comparison function lt.
Definition Classes
SeqOps
Example:
1. List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) = List("Bob", "John", "Steve", "Tom")
def sorted[B >: A](implicit ord: Ordering[B]): LinearSeq[A]
Sorts this sequence according to an Ordering.
Sorts this sequence according to an Ordering.
The sort is stable. That is, elements that are equal (as determined by ord.compare) appear in the same order in the sorted sequence as in the original.
ord
the ordering to be used to compare elements.
returns
a sequence consisting of the elements of this sequence sorted according to the ordering ord.
Definition Classes
SeqOps
See also
scala.math.Ordering Note: Even when applied to a view or a lazy collection it will always force the elements.
def span(p: (A) ⇒ Boolean): (LinearSeq[A], LinearSeq[A])
Splits this iterable collection into a prefix/suffix pair according to a predicate.
Splits this iterable collection into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the test predicate
returns
a pair consisting of the longest prefix of this iterable collection whose elements all satisfy p, and the rest of this iterable collection.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesOneAndProducesTwoIterators
def splitAt(n: Int): (LinearSeq[A], LinearSeq[A])
Splits this iterable collection into two at a given position.
Splits this iterable collection into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the position at which to split.
returns
a pair of iterable collections consisting of the first n elements of this iterable collection, and the other elements.
Definition Classes
IterableOps
def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
Tests whether this sequence contains the given sequence at a given index.
Tests whether this sequence contains the given sequence at a given index.
Note: If the both the receiver object this and the argument that are infinite sequences this method may not terminate.
that
the sequence to test
offset
the index where the sequence is searched.
returns
true if the sequence that is contained in this sequence at index offset, otherwise false.
Definition Classes
SeqOps
def stringPrefix: String
Attributes
protected[this]
Definition Classes
LinearSeq → Seq → Iterable
def sum: A
[use case] Sums up the elements of this collection.
[use case]
Sums up the elements of this collection.
returns
the sum of all elements in this sequence of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the sequence and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.
Definition Classes
IterableOnceOps
Full Signature
def sum[B >: A](implicit num: math.Numeric[B]): B
final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
def tail: LinearSeq[A]
The rest of the collection without its first element.
The rest of the collection without its first element.
Definition Classes
IterableOps
def tails: Iterator[LinearSeq[A]]
Note: Even when applied to a view or a lazy collection it will always force the elements.
Note: Even when applied to a view or a lazy collection it will always force the elements.
returns
an iterator over all the tails of this sequence
Definition Classes
LinearSeqOps → IterableOps
def take(n: Int): LinearSeq[A]
Selects first n elements.
Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the number of elements to take from this iterable collection.
returns
a iterable collection consisting only of the first n elements of this iterable collection, or else the whole iterable collection, if it has less than n elements. If n is negative, returns an empty iterable collection.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def takeRight(n: Int): LinearSeq[A]
A collection containing the last n elements of this collection.
A collection containing the last n elements of this collection.
Note: Even when applied to a view or a lazy collection it will always force the elements.
Definition Classes
IterableOps
def takeWhile(p: (A) ⇒ Boolean): LinearSeq[A]
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
The predicate used to test elements.
returns
the longest prefix of this iterable collection whose elements all satisfy the predicate p.
Definition Classes
IterableOps → IterableOnceOps
Note
Reuse: $consumesAndProducesIterator
def to[C1](factory: Factory[A, C1]): C1
Given a collection factory factory, convert this collection to the appropriate representation for the current element type A.
Given a collection factory factory, convert this collection to the appropriate representation for the current element type A. Example uses:
xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]
Definition Classes
IterableOnceOps
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Convert collection to array.
Convert collection to array.
Definition Classes
IterableOnceOps
final def toBuffer[B >: A]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
def toIndexedSeq: immutable.IndexedSeq[A]
Definition Classes
IterableOnceOps
final def toIterable: LinearSeq.this.type
returns
This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].
Definition Classes
Iterable → IterableOps
def toList: immutable.List[A]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
Definition Classes
IterableOnceOps
def toSeq: immutable.Seq[A]
returns
This collection as a Seq[A]. This is equivalent to to(Seq) but might be faster.
Definition Classes
IterableOnceOps
def toSet[B >: A]: immutable.Set[B]
Definition Classes
IterableOnceOps
def toString(): String
Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
returns
a String representation of the object.
Definition Classes
Seq → Function1 → Iterable → AnyRef → Any
def toVector: immutable.Vector[A]
Definition Classes
IterableOnceOps
def transpose[B](implicit asIterable: (A) ⇒ Iterable[B]): LinearSeq[LinearSeq[B]]
Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.
Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.
The resulting collection's type will be guided by the static type of iterable collection. For example:
```
val xs = List(
           Set(1, 2, 3),
           Set(4, 5, 6)).transpose
// xs == List(
//         List(1, 4),
//         List(2, 5),
//         List(3, 6))

val ys = Vector(
           List(1, 2, 3),
           List(4, 5, 6)).transpose
// ys == Vector(
//         Vector(1, 4),
//         Vector(2, 5),
//         Vector(3, 6))
```
Note: Even when applied to a view or a lazy collection it will always force the elements.
B
the type of the elements of each iterable collection.
asIterable
an implicit conversion which asserts that the element type of this iterable collection is an Iterable.
returns
a two-dimensional iterable collection of iterable collections which has as nth row the nth column of this iterable collection.
Definition Classes
IterableOps
Exceptions thrown
IllegalArgumentException if all collections in this iterable collection are not of the same size.
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (LinearSeq[A1], LinearSeq[A2])
Converts this iterable collection of pairs into two collections of the first and second half of each pair.
Converts this iterable collection of pairs into two collections of the first and second half of each pair.
```
val xs = Iterable(
           (1, "one"),
           (2, "two"),
           (3, "three")).unzip
// xs == (Iterable(1, 2, 3),
//        Iterable(one, two, three))
```
A1
the type of the first half of the element pairs
A2
the type of the second half of the element pairs
asPair
an implicit conversion which asserts that the element type of this iterable collection is a pair.
returns
a pair of iterable collections, containing the first, respectively second half of each element pair of this iterable collection.
Definition Classes
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (LinearSeq[A1], LinearSeq[A2], LinearSeq[A3])
Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.
Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.
```
val xs = Iterable(
           (1, "one", '1'),
           (2, "two", '2'),
           (3, "three", '3')).unzip3
// xs == (Iterable(1, 2, 3),
//        Iterable(one, two, three),
//        Iterable(1, 2, 3))
```
A1
the type of the first member of the element triples
A2
the type of the second member of the element triples
A3
the type of the third member of the element triples
asTriple
an implicit conversion which asserts that the element type of this iterable collection is a triple.
returns
a triple of iterable collections, containing the first, second, respectively third member of each element triple of this iterable collection.
Definition Classes
IterableOps
def updated[B >: A](index: Int, elem: B): LinearSeq[B]
A copy of this sequence with one single replaced element.
A copy of this sequence with one single replaced element.
B
the element type of the returned sequence.
index
the position of the replacement
elem
the replacing element
returns
a new sequence which is a copy of this sequence with the element at position index replaced by elem.
Definition Classes
SeqOps
Exceptions thrown
IndexOutOfBoundsException if index does not satisfy 0 <= index < length.
def view: SeqView[A]
A view over the elements of this collection.
A view over the elements of this collection.
Definition Classes
SeqOps → IterableOps
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@native() @throws(classOf[java.lang.InterruptedException])
def withFilter(p: (A) ⇒ Boolean): WithFilter[A, [_]LinearSeq[_]]
Creates a non-strict filter of this iterable collection.
Creates a non-strict filter of this iterable collection.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this iterable collection which satisfy the predicate p.
Definition Classes
IterableOps
def writeReplace(): AnyRef
Create a proxy for Java serialization.
Create a proxy for Java serialization. The default implementation will serialize all elements and deserialize by using a builder for CC via iterableFactory. Override in subclasses if more data needs to be preserved or a more efficient implementation is available. Override to return this in order to use self-serialization instead of a proxy.
Attributes
protected[this]
Definition Classes
Iterable
def zip[B](that: IterableOnce[B]): LinearSeq[(A, B)]
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
returns
a new iterable collection containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection and that.
Definition Classes
IterableOps
def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): LinearSeq[(A1, B)]
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this iterable collection is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this iterable collection.
returns
a new collection of type That containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the maximum of the lengths of this iterable collection and that. If this iterable collection is shorter than that, thisElem values are used to pad the result. If that is shorter than this iterable collection, thatElem values are used to pad the result.
Definition Classes
IterableOps
def zipWithIndex: LinearSeq[(A, Int)]
Zips this iterable collection with its indices.
Zips this iterable collection with its indices.
returns
A new iterable collection containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at 0.
Definition Classes
IterableOps → IterableOnceOps
Example:
1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
Note
Reuse: $consumesAndProducesIterator
def →[B](y: B): (LinearSeq[A], B)
Implicit
This member is added by an implicit conversion from LinearSeq[A] toArrowAssoc[LinearSeq[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Deprecated Value Members

def /:[B](z: B)(op: (B, A) ⇒ B): B
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A])./:(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
final def /:[B](z: B)(op: (B, A) ⇒ B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
def :\[B](z: B)(op: (A, B) ⇒ B): B
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).:\(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
final def :\[B](z: B)(op: (A, B) ⇒ B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.
def collectFirst[B](f: PartialFunction[A, B]): Option[B]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).collectFirst(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
def companion: IterableFactory[IterableCC]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
def copyToBuffer(dest: Buffer[A]): Unit
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).copyToBuffer(dest)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def count(f: (A) ⇒ Boolean): Int
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).count(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
def exists(f: (A) ⇒ Boolean): Boolean
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).exists(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
def filter(f: (A) ⇒ Boolean): Iterator[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).filter(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
def find(p: (A) ⇒ Boolean): Option[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).find(p)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.find instead
def flatMap[B](f: (A) ⇒ IterableOnce[B]): IterableOnce[B]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).flatMap(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).fold(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.fold instead
def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
Folds the elements of this $coll using the specified associative binary operator.
Folds the elements of this $coll using the specified associative binary operator. The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.
$undefinedorder $willNotTerminateInf
A1
a type parameter for the binary operator, a supertype of A.
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 the fold operator op between all the elements and z, or z if this $coll is empty.
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use foldLeft instead
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).foldLeft(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
def foldRight[B](z: B)(op: (A, B) ⇒ B): B
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).foldRight(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
def forall(f: (A) ⇒ Boolean): Boolean
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).forall(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
def foreach[U](f: (A) ⇒ U): Unit
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).foreach(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
def hasDefiniteSize: Boolean
Tests whether this $coll is known to have a finite size.
Tests whether this $coll is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.
Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.
returns
true if this collection is known to have finite size, false otherwise.
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
See also
method knownSize for a more useful alternative
def isEmpty: Boolean
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).isEmpty
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
def map[B](f: (A) ⇒ B): IterableOnce[B]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).map(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
def max(implicit ord: math.Ordering[A]): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).max(ord)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.max instead
def maxBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).maxBy(f)(cmp)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
def min(implicit ord: math.Ordering[A]): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).min(ord)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.min instead
def minBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).minBy(f)(cmp)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
def mkString: String
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).mkString
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
def mkString(sep: String): String
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).mkString(sep)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
def mkString(start: String, sep: String, end: String): String
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).mkString(start, sep, end)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
def nonEmpty: Boolean
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).nonEmpty
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
final def prefixLength(p: (A) ⇒ 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.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
the length of the longest prefix of this sequence such that every element of the segment satisfies the predicate p.
Definition Classes
SeqOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
def product(implicit num: math.Numeric[A]): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).product(num)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.product instead
def reduce(f: (A, A) ⇒ A): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).reduce(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
def reduceLeft(f: (A, A) ⇒ A): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).reduceLeft(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
def reduceLeftOption(f: (A, A) ⇒ A): Option[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).reduceLeftOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
def reduceOption(f: (A, A) ⇒ A): Option[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).reduceOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
def reduceRight(f: (A, A) ⇒ A): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).reduceRight(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
def reduceRightOption(f: (A, A) ⇒ A): Option[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).reduceRightOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
final def repr: LinearSeq[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
def reverseMap[B](f: (A) ⇒ B): LinearSeq[B]
Definition Classes
SeqOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
def sameElements[B >: A](that: IterableOnce[B]): Boolean
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).sameElements(that)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
def scan[B >: A](z: B)(op: (B, B) ⇒ B): LinearSeq[B]
Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z may be applied more than once.
B
element type of the resulting collection
z
neutral element for the operator op
op
the associative operator for the scan
returns
a new iterable collection containing the prefix scan of the elements in this iterable collection
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use scanLeft instead
def seq: LinearSeq.this.type
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
def size: Int
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).size
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.size instead
def sum(implicit num: math.Numeric[A]): A
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).sum(num)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.sum instead
def to[C1](factory: Factory[A, C1]): C1
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).to(factory)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toArray(arg0)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.toArray
def toBuffer[B >: A]: Buffer[B]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toBuffer
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
def toIndexedSeq: IndexedSeq[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toIndexedSeq
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
final def toIterable: Iterable[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toIterable
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
def toIterator: Iterator[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toIterator
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead
final def toIterator: Iterator[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
def toList: immutable.List[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toList
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toMap(ev)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
def toSeq: immutable.Seq[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toSeq
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
def toSet[B >: A]: immutable.Set[B]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toSet
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
def toStream: immutable.Stream[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toStream
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
final def toStream: immutable.Stream[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: Traversable[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toTraversable
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use toIterable instead
final def toTraversable: Traversable[A]
Converts this iterable collection to an unspecified Iterable.
Converts this iterable collection to an unspecified Iterable. Will return the same collection if this instance is already Iterable.
returns
An Iterable containing all elements of this iterable collection.
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use toIterable instead
def toVector: immutable.Vector[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).toVector
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
final def union[B >: A, That](that: Seq[B]): LinearSeq[B]
Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence.
Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.
B
the element type of the returned sequence.
that
the sequence to add.
returns
a new collection which contains all elements of this sequence followed by all elements of that.
Definition Classes
SeqOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use concat instead
final def view(from: Int, until: Int): View[A]
A view over a slice of the elements of this collection.
A view over a slice of the elements of this collection.
Definition Classes
IterableOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
def withFilter(f: (A) ⇒ Boolean): Iterator[A]
Implicit
This member is added by an implicit conversion from LinearSeq[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(linearSeq: IterableOnceExtensionMethods[A]).withFilter(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead

Packages

Package structure

Automatic imports

LinearSeq

Companion object LinearSeq

trait LinearSeq[+A] extends Seq[A] with LinearSeqOps[A, LinearSeq, LinearSeq[A]]

Type Members

Value Members

def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int

def copyToArray[B >: A](xs: Array[B], start: Int): Int

def copyToArray[B >: A](xs: Array[B]): Int

def max[B >: A](implicit ord: math.Ordering[B]): A

def maxBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A

def maxByOption[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): Option[A]

def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]

def min[B >: A](implicit ord: math.Ordering[B]): A

def minBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A

def minByOption[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): Option[A]

def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]

def product[B >: A](implicit num: math.Numeric[B]): B

def sum[B >: A](implicit num: math.Numeric[B]): B

Deprecated Value Members

Inherited from LinearSeqOps[A, LinearSeq, LinearSeq[A]]

Inherited from Seq[A]

Inherited from Equals

Inherited from SeqOps[A, [_]LinearSeq[_], LinearSeq[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from java.io.Serializable

Inherited from IterableOps[A, [_]LinearSeq[_], LinearSeq[A]]

Inherited from IterableOnceOps[A, [_]LinearSeq[_], LinearSeq[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromLinearSeq[A] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromLinearSeq[A] to any2stringadd[LinearSeq[A]]

Inherited by implicit conversion StringFormat fromLinearSeq[A] to StringFormat[LinearSeq[A]]

Inherited by implicit conversion Ensuring fromLinearSeq[A] to Ensuring[LinearSeq[A]]

Inherited by implicit conversion ArrowAssoc fromLinearSeq[A] to ArrowAssoc[LinearSeq[A]]

Ungrouped

LinearSeq