class Exclusive[T] extends NumericRange[T]
- Alphabetic
- By Inheritance
- Exclusive
- NumericRange
- StrictOptimizedSeqOps
- StrictOptimizedSeqOps
- StrictOptimizedIterableOps
- IndexedSeq
- IndexedSeqOps
- IndexedSeq
- IndexedSeqOps
- AbstractSeq
- Seq
- SeqOps
- Iterable
- AbstractSeq
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- Serializable
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- by SeqCharSequence
- by iterableOnceExtensionMethods
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Type Members
- type IterableCC[X] = IndexedSeq[X]
Type alias to
CC
.Type alias to
CC
. It is used to provide a default implementation of thefromSpecific
andnewSpecificBuilder
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 andnull
.Equivalent to
x.hashCode
except for boxed numeric types andnull
. 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. Fornull
returns a hashcode wherenull.hashCode
throws aNullPointerException
.- returns
a hash value consistent with ==
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toany2stringadd[Exclusive[T]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- final def ++[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Alias for
concat
Alias for
concat
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++:[B >: T](prefix: IterableOnce[B]): IndexedSeq[B]
Alias for
prependedAll
Alias for
prependedAll
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- final def +:[B >: T](elem: B): IndexedSeq[B]
Alias for
prepended
. - def ->[B](y: B): (Exclusive[T], B)
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toArrowAssoc[Exclusive[T]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def :+[B >: T](elem: B): IndexedSeq[B]
Alias for
appended
- final def :++[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Alias for
appendedAll
- final def ==(arg0: Any): Boolean
The expression
x == that
is equivalent toif (x eq null) that eq null else x.equals(that)
.The expression
x == that
is equivalent toif (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 stringsep
.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 stringend
. Inside, the string representations (w.r.t. the methodtoString
) of all elements of this $coll are separated by the stringsep
.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: (T) ⇒ 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
tok(this(x))
.
- Definition Classes
- PartialFunction → Function1
- def appended[B >: T](elem: B): IndexedSeq[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
- StrictOptimizedSeqOps → SeqOps
- def appendedAll[B >: T](suffix: IterableOnce[B]): IndexedSeq[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 ofsuffix
.
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def apply(idx: Int): T
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 anIndexedSeq
.- Definition Classes
- NumericRange → SeqOps → Function1
- Annotations
- @throws(scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
- def applyOrElse[A1 <: Int, B1 >: T](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 toif(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 anapplyOrElse
implementation which avoids double evaluation of pattern matchers and guards. This makesapplyOrElse
the basis for the efficient implementation for many operations and scenarios, such as:- combining partial functions into
orElse
/andThen
chains does not lead to excessiveapply
/isDefinedAt
evaluation lift
andunlift
do not evaluate source functions twice on each invocationrunWith
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 overrideapplyOrElse
with custom implementation that avoids doubleisDefinedAt
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
- combining partial functions into
- final def applyPreferredMaxLength: Int
a hint to the runtime when scanning values apply is perferred for scan with a max index less than this value iterator is preferred for scans above this range
a hint to the runtime when scanning values apply is perferred for scan with a max index less than this value iterator is preferred for scans above this range
- Attributes
- protected
- Definition Classes
- NumericRange → IndexedSeq
- 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 aClassCastException
at runtime, while the expressionList(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 typeT0
.
- def by(newStep: T): NumericRange[T]
Create a new range with the start and end values of this range and a new
step
.Create a new range with the start and end values of this range and a new
step
.- Definition Classes
- NumericRange
- 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 immutable sequence should be compared
- returns
true
, if this immutable sequence can possibly equalthat
,false
otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.
- Definition Classes
- IndexedSeq → Seq → Equals
- def charAt(index: Int): Char
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toSeqCharSequence performed by method SeqCharSequence in scala.Predef.This conversion will take place only if T is a subclass of Char (T <: Char).
- Definition Classes
- SeqCharSequence → CharSequence
- def chars(): IntStream
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toSeqCharSequence performed by method SeqCharSequence in scala.Predef.This conversion will take place only if T is a subclass of Char (T <: Char).
- Definition Classes
- CharSequence
- 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 numeric range. By default the string prefix is the simple name of the collection class numeric range.
- Attributes
- protected[this]
- Definition Classes
- NumericRange → 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.
- def codePoints(): IntStream
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toSeqCharSequence performed by method SeqCharSequence in scala.Predef.This conversion will take place only if T is a subclass of Char (T <: Char).
- Definition Classes
- CharSequence
- def coll: Exclusive.this.type
- returns
This collection as a
C
.
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[T, B]): IndexedSeq[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
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def collectFirst[B](pf: PartialFunction[T, 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
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
Example: - def combinations(n: Int): Iterator[IndexedSeq[T]]
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
"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)
Example: - def compose[A](g: (A) ⇒ Int): (A) ⇒ T
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 thatf(x) == apply(g(x))
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the iterable collection 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 iterable collection which contains all elements of this iterable collection followed by all elements of
suffix
.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def contains[A1 >: T](x: A1): Boolean
Tests whether this numeric range contains a given value as an element.
Tests whether this numeric range contains a given value as an element.
- returns
true
if this numeric range has an element that is equal (as determined by==
) toelem
,false
otherwise.
- Definition Classes
- NumericRange → SeqOps
- def containsSlice[B](that: collection.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 asthat
, otherwisefalse
.
- Definition Classes
- SeqOps
- def containsTyped(x: T): Boolean
- Definition Classes
- NumericRange
- def copy(start: T, end: T, step: T): Exclusive[T]
Create a copy of this range.
Create a copy of this range.
- Definition Classes
- Exclusive → NumericRange
- def copyToArray(xs: Array[T], start: Int, len: Int): Int
[use case]
[use case]- 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
- def copyToArray(xs: Array[T], start: Int): Int
[use case]
[use case]- xs
the array to fill.
- start
the starting index of xs.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- def copyToArray(xs: Array[T]): Int
[use case]
[use case]- xs
the array to fill.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: collection.Seq[B])(p: (T, 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 andp(x, y)
istrue
for all corresponding elementsx
of this sequence andy
ofthat
, otherwisefalse
.
- Definition Classes
- SeqOps
- def corresponds[B](that: IterableOnce[B])(p: (T, 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 andp(x, y)
istrue
for all corresponding elementsx
of this iterator andy
ofthat
, otherwisefalse
- Definition Classes
- IterableOnceOps
- def count(p: (T) ⇒ 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: collection.Seq[_ >: T]): IndexedSeq[T]
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 valuex
appears n times inthat
, then the first n occurrences ofx
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: IndexedSeq[T]
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: (T) ⇒ B): IndexedSeq[T]
Selects all the elements of this immutable sequence ignoring the duplicates as determined by
==
after applying the transforming functionf
.Selects all the elements of this immutable sequence ignoring the duplicates as determined by
==
after applying the transforming functionf
.- 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 immutable sequence consisting of all the elements of this immutable sequence without duplicates.
- Definition Classes
- StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
- def drop(n: Int): NumericRange[T]
Selects all elements except first n ones.
Selects all elements except first n ones.
- n
the number of elements to drop from this numeric range.
- returns
a numeric range consisting of all elements of this numeric range except the first
n
ones, or else the empty numeric range, if this numeric range has less thann
elements. Ifn
is negative, don't drop any elements.
- Definition Classes
- NumericRange → IndexedSeqOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def dropRight(n: Int): IndexedSeq[T]
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
- IndexedSeqOps → IterableOps
- def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]
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
- val end: T
- Definition Classes
- NumericRange
- def endsWith[B >: T](that: collection.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 hasthat
as a suffix,false
otherwise.
- Definition Classes
- SeqOps
- def ensuring(cond: (Exclusive[T]) ⇒ Boolean, msg: ⇒ Any): Exclusive[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toEnsuring[Exclusive[T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (Exclusive[T]) ⇒ Boolean): Exclusive[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toEnsuring[Exclusive[T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: ⇒ Any): Exclusive[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toEnsuring[Exclusive[T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): Exclusive[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toEnsuring[Exclusive[T]] 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 ofAnyRef
, and has three additional properties:- It is consistent: for any non-null instances
x
andy
of typeAnyRef
, multiple invocations ofx.eq(y)
consistently returnstrue
or consistently returnsfalse
. - For any non-null instance
x
of typeAnyRef
,x.eq(null)
andnull.eq(x)
returnsfalse
. null.eq(null)
returnstrue
.
When overriding the
equals
orhashCode
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
- It is consistent: for any non-null instances
- def equals(other: Any): Boolean
The universal equality method defined in
AnyRef
.The universal equality method defined in
AnyRef
.- Definition Classes
- NumericRange → Seq → Equals → AnyRef → Any
- def exists(p: (T) ⇒ Boolean): Boolean
Tests whether a predicate holds for at least one element of this $coll.
Tests whether a predicate holds for at least one element of this $coll.
$mayNotTerminateInf
- p
the predicate used to test elements.
- returns
true
if the given predicatep
is satisfied by at least one element of this $coll, otherwisefalse
- Definition Classes
- IterableOnceOps
- def filter(pred: (T) ⇒ Boolean): IndexedSeq[T]
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
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def filterImpl(pred: (T) ⇒ Boolean, isFlipped: Boolean): IndexedSeq[T]
- Attributes
- protected[scala.collection]
- Definition Classes
- StrictOptimizedIterableOps
- def filterNot(pred: (T) ⇒ Boolean): IndexedSeq[T]
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
- StrictOptimizedIterableOps → 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 betweenfinalize
and non-local returns and exceptions, are all platform dependent. - def find(p: (T) ⇒ Boolean): Option[T]
Finds the first element of the $coll satisfying a predicate, if any.
Finds the first element of the $coll satisfying a predicate, if any.
$mayNotTerminateInf $orderDependent
- p
the predicate used to test elements.
- returns
an option value containing the first element in the $coll that satisfies
p
, orNone
if none exists.
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: (T) ⇒ IterableOnce[B]): IndexedSeq[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
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def flatten[B](implicit toIterableOnce: (T) ⇒ IterableOnce[B]): IndexedSeq[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.
- returns
a new iterable collection resulting from concatenating all element iterable collections.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
Applies a binary operator to a start value and all elements of this $coll, going left to right.
Applies a binary operator to a start value and all elements of this $coll, going left to right.
$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 left to right with the start valuez
on the left:op(...op(z, x_1), x_2, ..., x_n)
where
x1, ..., xn
are the elements of this $coll. Returnsz
if this $coll is empty.
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (T, 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 valuez
on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where
x1, ..., xn
are the elements of this $coll. Returnsz
if this $coll is empty.
- Definition Classes
- IterableOnceOps
- def forall(p: (T) ⇒ Boolean): Boolean
Tests whether a predicate holds for all elements of this $coll.
Tests whether a predicate holds for all elements of this $coll.
$mayNotTerminateInf
- p
the predicate used to test elements.
- returns
true
if this $coll is empty or the given predicatep
holds for all elements of this $coll, otherwisefalse
.
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (T) ⇒ 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
- NumericRange → 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 forString.format
(@see java.lang.String.format).- Implicit
- This member is added by an implicit conversion from Exclusive[T] toStringFormat[Exclusive[T]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- def fromSpecific(coll: IterableOnce[T]): IterableCC[T]
Defines how to turn a given
Iterable[A]
into a collection of typeC
.Defines how to turn a given
Iterable[A]
into a collection of typeC
.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 anIterable[A]
obtained fromthis
collection (as it is the case in the implementations of operations where we use aView[A]
), it is safe.
- final def getClass(): Class[_]
Returns the runtime class representation of the object.
- def groupBy[K](f: (T) ⇒ K): Map[K, IndexedSeq[T]]
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 elementsx
for whichf(x)
equalsk
.
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (T) ⇒ K)(f: (T) ⇒ B): Map[K, IndexedSeq[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 typeB
using thevalue
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: (T) ⇒ K)(f: (T) ⇒ B)(reduce: (B, B) ⇒ B): 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 thevalue
function and then reduced into a single value with thereduce
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[IndexedSeq[T]]
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 sizesize
if the elements don't divide evenly.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
grouped
- lazy val 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
- NumericRange → Seq → AnyRef → Any
- def head: T
Selects the first element of this numeric range.
Selects the first element of this numeric range.
- returns
the first element of this numeric range.
- Definition Classes
- NumericRange → IterableOps
- Exceptions thrown
NoSuchElementException
if the numeric range is empty.
- def headOption: Option[T]
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 inclusive: Inclusive[T]
- def indexOf[B >: T](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==
) toelem
, 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 >: T](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==
) toelem
, or-1
, if none exists.
- Definition Classes
- SeqOps
- def indexOfSlice[B >: T](that: collection.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 sequencethat
, 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 >: T](that: collection.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 sequencethat
, or-1
of no such subsequence exists.
- Definition Classes
- SeqOps
- def indexWhere(p: (T) ⇒ 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 predicatep
, 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 indexWhere(p: (T) ⇒ Boolean, from: Int): Int
Finds index of the first element satisfying some predicate after or at some start index.
Finds index of the first element satisfying some predicate after or at some start index.
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 predicatep
, or-1
, if none exists.
- Definition Classes
- SeqOps
- def indices: Range
Produces the range of all indices of this sequence.
Produces the range of all indices of this sequence.
- returns
a
Range
value from0
to one less than the length of this sequence.
- Definition Classes
- SeqOps
- def init: NumericRange[T]
The initial part of the collection without its last element.
The initial part of the collection without its last element.
- Definition Classes
- NumericRange → IterableOps
- def inits: Iterator[IndexedSeq[T]]
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
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
Example: - def intersect(that: collection.Seq[_ >: T]): IndexedSeq[T]
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 valuex
appears n times inthat
, then the first n occurrences ofx
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(idx: Int): Boolean
Tests whether this sequence contains given index.
Tests whether this sequence contains given index.
The implementations of methods
apply
andisDefinedAt
turn aSeq[A]
into aPartialFunction[Int, A]
.- idx
the index to test
- returns
true
if this sequence contains an element at positionidx
,false
otherwise.
- Definition Classes
- SeqOps
- def isEmpty: Boolean
Tests whether the numeric range is empty.
Tests whether the numeric range 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 numeric range contains no elements,false
otherwise.
- Definition Classes
- NumericRange → SeqOps → IterableOnceOps
- val isInclusive: Boolean
- Definition Classes
- NumericRange
- 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 returnfalse
, while the expressionList(1).isInstanceOf[List[String]]
will returntrue
. 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 typeT0
;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
- IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
- Note
This operation has to be overridden by concrete collection classes to effectively return an
IterableFactory[IterableCC]
. The implementation inIterable
only returns anIterableFactory[Iterable]
, but the compiler will not throw an error if the effectiveIterableCC
type constructor is more specific thanIterable
.
- def iterator: Iterator[T]
Iterator can be used only once
Iterator can be used only once
- Definition Classes
- NumericRange → IndexedSeqOps → IterableOnce
- final def knownSize: Int
- returns
The number of elements in this sequence, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.
- Definition Classes
- IndexedSeqOps → IterableOnceOps → IterableOnce
- def last: T
Selects the last element.
Selects the last element.
- returns
The last element of this numeric range.
- Definition Classes
- NumericRange → IndexedSeqOps → IterableOps
- Exceptions thrown
NoSuchElementException
If the numeric range is empty.
- def lastIndexOf[B >: T](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==
) toelem
, or-1
, if none exists.
- Definition Classes
- SeqOps
- def lastIndexOfSlice[B >: T](that: collection.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 >: T](that: collection.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 sequencethat
, or-1
of no such subsequence exists.
- Definition Classes
- SeqOps
- def lastIndexWhere(p: (T) ⇒ Boolean): Int
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
- p
the predicate used to test elements.
- returns
the index of the last element of this 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 lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
Finds index of last element satisfying some predicate before or at given end index.
Finds index of last element satisfying some predicate before or at given end index.
- p
the predicate used to test elements.
- returns
the index
<= end
of the last element of this sequence that satisfies the predicatep
, or-1
, if none exists.
- Definition Classes
- SeqOps
- def lastOption: Option[T]
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: collection.Iterable[B]): LazyZip2[T, B, Exclusive.this.type]
Analogous to
zip
except that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2
decorator.Analogous to
zip
except that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2
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 tolazyZip
. Implicit conversion toIterable[(A, B)]
is also supported.
- Definition Classes
- Iterable
- lazy val length: Int
The length (number of elements) of the numeric range.
The length (number of elements) of the numeric range.
size
is an alias forlength
inSeq
collections.- Definition Classes
- NumericRange → SeqOps
- final 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
wherex < 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 isO(length min len)
instead ofO(length)
. The method should be overwritten if computinglength
is cheap.
- Definition Classes
- IndexedSeqOps → 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
- def lift: (Int) ⇒ Option[T]
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
toSome(this(x))
ifthis
is defined forx
, and toNone
otherwise.
- Definition Classes
- PartialFunction
- See also
Function.unlift
- def map[B](f: (T) ⇒ B): IndexedSeq[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
- StrictOptimizedIterableOps → 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 numeric range.
- Definition Classes
- NumericRange → IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this numeric range is empty.
Full Signaturedef max[T1 >: T](implicit ord: Ordering[T1]): T
- def maxBy[B](f: (T) ⇒ B): T
[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 numeric range with the largest value measured by function f.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this numeric range is empty.
Full Signaturedef maxBy[B](f: (T) ⇒ B)(implicit cmp: math.Ordering[B]): T
- def maxByOption[B](f: (T) ⇒ B): Option[T]
[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 numeric range with the largest value measured by function f.
- Definition Classes
- IterableOnceOps
Full Signaturedef maxByOption[B](f: (T) ⇒ B)(implicit cmp: math.Ordering[B]): Option[T]
- def maxOption: Option[T]
[use case] Finds the largest element.
[use case]Finds the largest element.
- returns
an option value containing the largest element of this numeric range.
- Definition Classes
- IterableOnceOps
Full Signaturedef maxOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
- def min: A
[use case] Finds the smallest element.
[use case]Finds the smallest element.
- returns
the smallest element of this numeric range
- Definition Classes
- NumericRange → IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this numeric range is empty.
Full Signaturedef min[T1 >: T](implicit ord: Ordering[T1]): T
- def minBy[B](f: (T) ⇒ B): T
[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 numeric range with the smallest value measured by function f.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this numeric range is empty.
Full Signaturedef minBy[B](f: (T) ⇒ B)(implicit cmp: math.Ordering[B]): T
- def minByOption[B](f: (T) ⇒ B): Option[T]
[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 numeric range with the smallest value measured by function f.
- Definition Classes
- IterableOnceOps
Full Signaturedef minByOption[B](f: (T) ⇒ B)(implicit cmp: math.Ordering[B]): Option[T]
- def minOption: Option[T]
[use case] Finds the smallest element.
[use case]Finds the smallest element.
- returns
an option value containing the smallest element of this numeric range.
- Definition Classes
- IterableOnceOps
Full Signaturedef minOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
- 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 stringsep
.
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
List(1, 2, 3).mkString("|") = "1|2|3"
Example: - 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 stringend
. Inside, the string representations (w.r.t. the methodtoString
) of all elements of this $coll are separated by the stringsep
.
- Definition Classes
- IterableOnceOps
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
Example: - 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[T, IterableCC[T]]
- 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 withfromSpecific
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 withA
values taken fromthis
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 >: T](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 takesx
tothis(x)
wherethis
is defined, and tothat(x)
where it is not.
- Definition Classes
- PartialFunction
- def padTo[B >: T](len: Int, elem: B): IndexedSeq[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 leastlen
.
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])
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
inStrictOptimizedIterableOps
, which requires only a single traversal.- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def partitionWith[A1, A2](f: (T) ⇒ Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[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
- StrictOptimizedIterableOps → IterableOps
- def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
Produces a new immutable sequence where a slice of elements in this immutable sequence is replaced by another sequence.
Produces a new immutable sequence where a slice of elements in this immutable 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 immutable 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 immutable sequence.
- from
the index of the first replaced element
- other
the replacement sequence
- replaced
the number of elements to drop in the original immutable sequence
- returns
a new immutable sequence consisting of all elements of this immutable sequence except that
replaced
elements starting fromfrom
are replaced by all the elements ofother
.
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def permutations: Iterator[IndexedSeq[T]]
Iterates over distinct permutations.
Iterates over distinct permutations.
- returns
An Iterator which traverses the distinct permutations of this sequence.
- Definition Classes
- SeqOps
"abb".permutations = Iterator(abb, bab, bba)
Example: - def prepended[B >: T](elem: B): IndexedSeq[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
- StrictOptimizedSeqOps → SeqOps
- def prependedAll[B >: T](prefix: IterableOnce[B]): IndexedSeq[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
- StrictOptimizedSeqOps → SeqOps
- def product: T
[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 numeric range of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the numeric range and as result type ofproduct
. Examples of such types are:Long
,Float
,Double
,BigInt
.
- Definition Classes
- IterableOnceOps
Full Signaturedef product[B >: T](implicit num: math.Numeric[B]): B
- def reduce[B >: T](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 >: T](op: (B, T) ⇒ 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
x1, ..., xn
are the elements of this $coll.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
- def reduceLeftOption[B >: T](op: (B, T) ⇒ 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 >: T](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, andNone
otherwise.
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: T](op: (T, 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
x1, ..., xn
are the elements of this $coll.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
- def reduceRightOption[B >: T](op: (T, 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: NumericRange[T]
Returns new numeric range with elements in reversed order.
Returns new numeric range with elements in reversed order.
- returns
A new numeric range with all elements of this numeric range in reversed order.
- Definition Classes
- NumericRange → IndexedSeqOps → SeqOps
- def reverseIterator: Iterator[T]
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 asxs.reverse.iterator
but might be more efficient.- returns
an iterator yielding the elements of this sequence in reversed order
- Definition Classes
- IndexedSeqOps → SeqOps
- def reversed: collection.Iterable[T]
- Attributes
- protected
- Definition Classes
- IndexedSeqOps → IterableOnceOps
- def runWith[U](action: (T) ⇒ 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 toif(pf isDefinedAt x) { action(pf(x)); true } else false
except that
runWith
is implemented viaapplyOrElse
and thus potentially more efficient. UsingrunWith
avoids double evaluation of pattern matchers and guards for partial function literals.- action
the action function
- returns
a function which maps arguments
x
toisDefinedAt(x)
. The resulting function runsaction(this(x))
wherethis
is defined.
- Definition Classes
- PartialFunction
- Since
2.10
- See also
applyOrElse
.
- def sameElements[B >: T](o: 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
- IndexedSeq → SeqOps
- def scanLeft[B](z: B)(op: (B, T) ⇒ B): IndexedSeq[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
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def scanRight[B](z: B)(op: (T, B) ⇒ B): IndexedSeq[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 >: T](elem: B, from: Int, to: Int)(implicit ord: math.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 theInsertionPoint
where the element would be inserted if the element is not in the sequence.
- Definition Classes
- IndexedSeqOps → SeqOps
- Note
if
to <= from
, the search space is empty, and anInsertionPoint
atfrom
is returned- See also
scala.collection.SeqOps, method
sorted
- def search[B >: T](elem: B)(implicit ord: math.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 theInsertionPoint
where the element would be inserted if the element is not in the sequence.
- Definition Classes
- IndexedSeqOps → SeqOps
- See also
scala.collection.SeqOps, method
sorted
- def segmentLength(p: (T) ⇒ 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 predicatep
.
- 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(that: collection.Iterable[_]): Int
Compares the size of this sequence to the size of another
Iterable
.Compares the size of this sequence to the size of another
Iterable
.- that
the
Iterable
whose size is compared with this sequence'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 isO(this.size min that.size)
instead ofO(this.size + that.size)
. The method should be overwritten if computingsize
is cheap.
- Definition Classes
- IndexedSeqOps → IterableOps
- 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
wherex < 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 isO(size min _size)
instead ofO(size)
. The method should be overwritten if computingsize
is cheap.
- Definition Classes
- SeqOps → 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): IndexedSeq[T]
Selects an interval of elements.
Selects an interval of elements. The returned immutable sequence is made up of all elements
x
which satisfy the invariant:from <= indexOf(x) < until
- from
the lowest index to include from this immutable sequence.
- until
the lowest index to EXCLUDE from this immutable sequence.
- returns
a immutable sequence containing the elements greater than or equal to index
from
extending up to (but not including) indexuntil
of this immutable sequence.
- Definition Classes
- IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
- size
the number of elements per group
- 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 thansize
elements remaining to be grouped.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
sliding
- def sliding(size: Int): Iterator[IndexedSeq[T]]
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 thansize
elements remaining to be grouped.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
sliding
- def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]
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 orderingord
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
iford.lt(f(x), f(y))
.
- Definition Classes
- SeqOps
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
Example: - def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]
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
List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) = List("Bob", "John", "Steve", "Tom")
Example: - def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]
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: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])
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 predicatep
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
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesOneAndProducesTwoIterators
- def splitAt(n: Int): (NumericRange[T], NumericRange[T])
Splits this numeric range into two at a given position.
Splits this numeric range into two at a given position. Note:
c splitAt n
is equivalent to (but possibly more efficient than)(c take n, c drop n)
.- n
the position at which to split.
- returns
a pair of numeric ranges consisting of the first
n
elements of this numeric range, and the other elements.
- Definition Classes
- NumericRange → IterableOps
- val start: T
- Definition Classes
- NumericRange
- def startsWith[B >: T](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 argumentthat
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 sequencethat
is contained in this sequence at indexoffset
, otherwisefalse
.
- Definition Classes
- SeqOps
- val step: T
- Definition Classes
- NumericRange
- final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[T, B]): C2
- B
Type of elements of the resulting collection (e.g.
String
)- C2
Type of the resulting collection (e.g.
List[String]
)- b
Builder to use to build the resulting collection
- pf
Element transformation partial function
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedConcat[B >: T, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
- B
Type of elements of the resulting collections (e.g.
Int
)- C2
Type of the resulting collection (e.g.
List[Int]
)- that
Elements to concatenate to this collection
- b
Builder to use to build the resulting collection
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (T) ⇒ IterableOnce[B]): C2
- B
Type of elements of the resulting collection (e.g.
String
)- C2
Type of the resulting collection (e.g.
List[String]
)- b
Builder to use to build the resulting collection
- f
Element transformation function
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (T) ⇒ IterableOnce[B]): C2
- B
Type of elements of the resulting collection (e.g.
Int
)- C2
Type of the resulting collection (e.g.
List[Int]
)- b
Builder to use to build the resulting collection
- toIterableOnce
Evidence that
A
can be seen as anIterableOnce[B]
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (T) ⇒ B): C2
- B
Type of elements of the resulting collection (e.g.
String
)- C2
Type of the resulting collection (e.g.
List[String]
)- b
Builder to use to build the resulting collection
- f
Element transformation function
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(T, B), C2]): C2
- B
Type of elements of the second collection (e.g.
String
)- C2
Type of the resulting collection (e.g.
List[(Int, String)]
)- that
Collection to zip with this collection
- b
Builder to use to build the resulting collection
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- IndexedSeq → Seq → Iterable
- def subSequence(start: Int, end: Int): CharSequence
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toSeqCharSequence performed by method SeqCharSequence in scala.Predef.This conversion will take place only if T is a subclass of Char (T <: Char).
- Definition Classes
- SeqCharSequence → CharSequence
- 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 numeric range of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the numeric range and as result type ofsum
. Examples of such types are:Long
,Float
,Double
,BigInt
.
- Definition Classes
- NumericRange → IterableOnceOps
Full Signaturedef sum[B >: T](implicit num: Numeric[B]): B
- final def synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def tail: NumericRange[T]
The rest of the collection without its first element.
The rest of the collection without its first element.
- Definition Classes
- NumericRange → IterableOps
- def tails: Iterator[IndexedSeq[T]]
Iterates over the tails of this iterable collection.
Iterates over the tails 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
tail
.- returns
an iterator over all the tails of this iterable collection
- Definition Classes
- IterableOps
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Example: - def take(n: Int): NumericRange[T]
Selects first n elements.
Selects first n elements.
- n
the number of elements to take from this numeric range.
- returns
a numeric range consisting only of the first
n
elements of this numeric range, or else the whole numeric range, if it has less thann
elements. Ifn
is negative, returns an empty numeric range.
- Definition Classes
- NumericRange → IndexedSeqOps → IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def takeRight(n: Int): IndexedSeq[T]
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
- IndexedSeqOps → IterableOps
- def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]
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[T, C1]): C1
Given a collection factory
factory
, convert this collection to the appropriate representation for the current element typeA
.Given a collection factory
factory
, convert this collection to the appropriate representation for the current element typeA
. Example uses:xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]
- Definition Classes
- IterableOnceOps
- def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
Convert collection to array.
Convert collection to array.
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: T]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def toIndexedSeq: IndexedSeq[T]
- Definition Classes
- IndexedSeq → IterableOnceOps
- final def toIterable: Exclusive.this.type
- returns
This collection as an
Iterable[A]
. No new collection will be built ifthis
is already anIterable[A]
.
- Definition Classes
- Iterable → IterableOps
- def toList: List[T]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- final def toSeq: Exclusive.this.type
- returns
This collection as a
Seq[A]
. This is equivalent toto(Seq)
but might be faster.
- Definition Classes
- Seq → IterableOnceOps
- def toSet[B >: T]: 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
- NumericRange → Seq → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[T]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (T) ⇒ collection.Iterable[B]): IndexedSeq[IndexedSeq[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: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[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
- StrictOptimizedIterableOps → IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[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
- StrictOptimizedIterableOps → IterableOps
- def updated[B >: T](index: Int, elem: B): IndexedSeq[B]
A copy of this immutable sequence with one single replaced element.
A copy of this immutable sequence with one single replaced element.
- B
the element type of the returned immutable sequence.
- index
the position of the replacement
- elem
the replacing element
- returns
a new immutable sequence which is a copy of this immutable sequence with the element at position
index
replaced byelem
.
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- Exceptions thrown
IndexOutOfBoundsException
ifindex
does not satisfy0 <= index < length
.
- def view: IndexedSeqView[T]
A view over the elements of this collection.
A view over the elements of this collection.
- Definition Classes
- IndexedSeqOps → 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
- def withFilter(p: (T) ⇒ Boolean): WithFilter[T, [_]IndexedSeq[_]]
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
andc withFilter p
is that the former creates a new collection, whereas the latter only restricts the domain of subsequentmap
,flatMap
,foreach
, andwithFilter
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 supportsmap
,flatMap
,foreach
, andwithFilter
operations. All these operations apply to those elements of this iterable collection which satisfy the predicatep
.
- 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
viaiterableFactory
. Override in subclasses if more data needs to be preserved or a more efficient implementation is available. Override to returnthis
in order to use self-serialization instead of a proxy.- Attributes
- protected[this]
- Definition Classes
- NumericRange → Iterable
- def zip[B](that: IterableOnce[B]): IndexedSeq[(T, 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 andthat
.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def zipAll[A1 >: T, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(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 andthat
. The length of the returned collection is the maximum of the lengths of this iterable collection andthat
. If this iterable collection is shorter thanthat
,thisElem
values are used to pad the result. Ifthat
is shorter than this iterable collection,thatElem
values are used to pad the result.
- Definition Classes
- IterableOps
- def zipWithIndex: IndexedSeq[(T, 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
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
- Note
Reuse: $consumesAndProducesIterator
Example: - def →[B](y: B): (Exclusive[T], B)
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toArrowAssoc[Exclusive[T]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
- def length(): Int
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toSeqCharSequence performed by method SeqCharSequence in scala.Predef.This conversion will take place only if T is a subclass of Char (T <: Char).
- 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:(exclusive: SeqCharSequence).length()
- Definition Classes
- SeqCharSequence → CharSequence
- 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.
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toSeqCharSequence performed by method SeqCharSequence in scala.Predef.This conversion will take place only if T is a subclass of Char (T <: Char).
- 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:(exclusive: SeqCharSequence).toString()
- Definition Classes
- SeqCharSequence → CharSequence → AnyRef → Any
Deprecated Value Members
- def /:[B](z: B)(op: (B, T) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T])./:(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, T) ⇒ B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (T, B) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (T, 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, T) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def collectFirst[B](f: PartialFunction[T, B]): Option[B]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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[T]): Unit
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def count(f: (T) ⇒ Boolean): Int
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (T) ⇒ Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (T) ⇒ Boolean): Iterator[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def find(p: (T) ⇒ Boolean): Option[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (T) ⇒ IterableOnce[B]): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def fold[A1 >: T](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 tofoldLeft
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 andz
, orz
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, T) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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: (T, B) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (T) ⇒ Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (T) ⇒ U): Unit
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 returnstrue
if all elements have been computed. It returnsfalse
if the stream is not yet evaluated to the end. Non-empty Iterators usually returnfalse
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
returnstrue
. However, checkinghasDefiniteSize
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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def map[B](f: (T) ⇒ B): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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[T]): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (T) ⇒ B)(implicit cmp: math.Ordering[B]): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: math.Ordering[T]): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (T) ⇒ B)(implicit cmp: math.Ordering[B]): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- final def prefixLength(p: (T) ⇒ Boolean): Int
Returns the length of the longest prefix whose elements all satisfy some predicate.
Returns the length of the longest prefix whose elements all satisfy some predicate.
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[T]): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (T, T) ⇒ T): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (T, T) ⇒ T): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (T, T) ⇒ T): Option[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (T, T) ⇒ T): Option[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (T, T) ⇒ T): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (T, T) ⇒ T): Option[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: IndexedSeq[T]
- 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: (T) ⇒ B): IndexedSeq[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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).sameElements(that)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def scan[B >: T](z: B)(op: (B, B) ⇒ B): IndexedSeq[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: Exclusive.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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: math.Numeric[T]): T
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[T, C1]): C1
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).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 Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: collection.IndexedSeq[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: collection.Iterable[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- def toIterator: Iterator[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
- def toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: collection.Traversable[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def toTraversable: collection.Traversable[T]
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: Vector[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- final def union[B >: T, That](that: collection.Seq[B]): IndexedSeq[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 toxs ++ 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[T]
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: (T) ⇒ Boolean): Iterator[T]
- Implicit
- This member is added by an implicit conversion from Exclusive[T] toIterableOnceExtensionMethods[T] 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:(exclusive: IterableOnceExtensionMethods[T]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
This is the documentation for the Scala standard library.
Package structure
The scala package contains core types like
Int
,Float
,Array
orOption
which are accessible in all Scala compilation units without explicit qualification or imports.Notable packages include:
scala.collection
and its sub-packages contain Scala's collections frameworkscala.collection.immutable
- Immutable, sequential data-structures such asVector
,List
,Range
,HashMap
orHashSet
scala.collection.mutable
- Mutable, sequential data-structures such asArrayBuffer
,StringBuilder
,HashMap
orHashSet
scala.collection.concurrent
- Mutable, concurrent data-structures such asTrieMap
scala.concurrent
- Primitives for concurrent programming such asFutures
andPromises
scala.io
- Input and output operationsscala.math
- Basic math functions and additional numeric types likeBigInt
andBigDecimal
scala.sys
- Interaction with other processes and the operating systemscala.util.matching
- Regular expressionsOther packages exist. See the complete list on the right.
Additional parts of the standard library are shipped as separate libraries. These include:
scala.reflect
- Scala's reflection API (scala-reflect.jar)scala.xml
- XML parsing, manipulation, and serialization (scala-xml.jar)scala.collection.parallel
- Parallel collections (scala-parallel-collections.jar)scala.util.parsing
- Parser combinators (scala-parser-combinators.jar)scala.swing
- A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)Automatic imports
Identifiers in the scala package and the
scala.Predef
object are always in scope by default.Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example,
List
is an alias forscala.collection.immutable.List
.Other aliases refer to classes provided by the underlying platform. For example, on the JVM,
String
is an alias forjava.lang.String
.