trait SortedSetOps[A, +CC[X] <: SortedSet[X], +C <: SortedSetOps[A, CC, C]] extends SetOps[A, Set, C] with collection.SortedSetOps[A, CC, C]
- Alphabetic
- By Inheritance
- SortedSetOps
- SortedSetOps
- SortedOps
- SetOps
- SetOps
- Function1
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- by iterableOnceExtensionMethods
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Type Members
- type IterableCC[X] = Set[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
- type SortedIterableCC[X] = CC[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
- SortedSetOps
Abstract Value Members
- abstract def coll: C
- returns
This collection as a
C
.
- Attributes
- protected
- Definition Classes
- IterableOps
- abstract def contains(elem: A): Boolean
- Definition Classes
- SetOps
- abstract def empty: C
The empty set of the same type as this set
- abstract def excl(elem: A): C
Creates a new set with a given element removed from this set.
Creates a new set with a given element removed from this set.
- elem
the element to be removed
- returns
a new set that contains all elements of this set but that does not contain
elem
.
- Definition Classes
- SetOps
- abstract def fromSpecific(coll: IterableOnce[A]): C
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
- 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.
- abstract def incl(elem: A): C
Creates a new set with an additional element, unless the element is already present.
Creates a new set with an additional element, unless the element is already present.
- elem
the element to be added
- returns
a new set that contains all elements of this set and that also contains
elem
.
- Definition Classes
- SetOps
- abstract def iterableFactory: IterableFactory[IterableCC]
- returns
The companion object of this iterable collection, providing various factory methods.
- Definition Classes
- IterableOps
- abstract def iterator: Iterator[A]
Iterator can be used only once
Iterator can be used only once
- Definition Classes
- IterableOnce
- abstract def iteratorFrom(start: A): Iterator[A]
Creates an iterator that contains all values from this collection greater than or equal to
start
according to the ordering of this collection.Creates an iterator that contains all values from this collection greater than or equal to
start
according to the ordering of this collection. x.iteratorFrom(y) is equivalent to but will usually be more efficient than x.from(y).iterator- start
The lower-bound (inclusive) of the iterator
- Definition Classes
- SortedSetOps
- abstract def newSpecificBuilder: Builder[A, C]
- 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
- 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.
- implicit abstract def ordering: Ordering[A]
- Definition Classes
- SortedOps
- abstract def rangeImpl(from: Option[A], until: Option[A]): C
Creates a ranged projection of this collection.
Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa.
Note: keys are not guaranteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.
- from
The lower-bound (inclusive) of the ranged projection.
None
if there is no lower bound.- until
The upper-bound (exclusive) of the ranged projection.
None
if there is no upper bound.
- Definition Classes
- SortedOps
- abstract def sortedIterableFactory: SortedIterableFactory[SortedIterableCC]
- Definition Classes
- SortedSetOps
- abstract def toIterable: collection.Iterable[A]
- returns
This collection as an
Iterable[A]
. No new collection will be built ifthis
is already anIterable[A]
.
- Definition Classes
- IterableOps
- abstract def unsorted: Set[A]
- Definition Classes
- SortedSetOps → SortedSetOps
Concrete 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
- final def &(that: collection.Set[A]): C
Alias for
intersect
- final def &~(that: collection.Set[A]): C
Alias for
diff
- def +(elem: A): C
Alias for
incl
Alias for
incl
- Definition Classes
- SetOps → SetOps
- Annotations
- @deprecatedOverriding("This method should be final, but is not due to scala/bug#10853", "2.13.0")
- final def ++(that: collection.Iterable[A]): C
Alias for
concat
- final def ++[B >: A](suffix: IterableOnce[B]): Set[B]
Alias for
concat
Alias for
concat
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def -(elem: A): C
Alias for
excl
Alias for
excl
- Definition Classes
- SetOps → SetOps
- Annotations
- @deprecatedOverriding("This method should be final, but is not due to scala/bug#10853", "2.13.0")
- def --(that: IterableOnce[A]): C
Alias for removeAll
Alias for removeAll
- Definition Classes
- SetOps → SetOps
- Annotations
- @deprecatedOverriding("This method should be final, but is not due to scala/bug#10853", "2.13.0")
- def ->[B](y: B): (SortedSetOps[A, CC, C], B)
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toArrowAssoc[SortedSetOps[A, CC, C]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- 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[A](g: (Boolean) ⇒ A): (A) ⇒ A
Composes two instances of Function1 in a new Function1, with this function applied first.
Composes two instances of Function1 in a new Function1, with this function applied first.
- A
the result type of function
g
- g
a function R => A
- returns
a new function
f
such thatf(x) == g(apply(x))
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def apply(elem: A): Boolean
Tests if some element is contained in this set.
Tests if some element is contained in this set.
This method is equivalent to
contains
. It allows sets to be interpreted as predicates.- elem
the element to test for membership.
- returns
true
ifelem
is contained in this set,false
otherwise.
- Definition Classes
- SetOps → Function1
- Annotations
- @deprecatedOverriding("This method should be final, but is not due to scala/bug#10853", "2.13.0")
- 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 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 collect[B](pf: PartialFunction[A, B])(implicit ev: Ordering[B]): CC[B]
Builds a new sorted collection by applying a partial function to all elements of this set on which the function is defined.
Builds a new sorted collection by applying a partial function to all elements of this set on which the function is defined.
- B
the element type of the returned collection.
- pf
the partial function which filters and maps the set.
- returns
a new set 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
- SortedSetOps
- def collect[B](pf: PartialFunction[A, B]): Set[B]
Builds a new iterable collection by applying a partial function to all elements of this iterable collection on which the function is defined.
Builds a new iterable collection by applying a partial function to all elements of this iterable collection on which the function is defined.
- B
the element type of the returned iterable collection.
- pf
the partial function which filters and maps the iterable collection.
- returns
a new iterable collection resulting from applying the given partial function
pf
to each element on which it is defined and collecting the results. The order of the elements is preserved.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.
$mayNotTerminateInf $orderDependent
- pf
the partial function
- returns
an option value containing pf applied to the first value for which it is defined, or
None
if none exists.
- Definition Classes
- IterableOnceOps
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
Example: - def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
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(that: IterableOnce[A]): C
Creates a new immutable set by adding all elements contained in another collection to this immutable set, omitting duplicates.
Creates a new immutable set by adding all elements contained in another collection to this immutable set, omitting duplicates.
This method takes a collection of elements and adds all elements, omitting duplicates, into immutable set.
Example:
scala> val a = Set(1, 2) concat Set(2, 3) a: scala.collection.immutable.Set[Int] = Set(1, 2, 3)
- that
the collection containing the elements to add.
- returns
a new immutable set with the given elements added, omitting duplicates.
- def concat[B >: A](suffix: IterableOnce[B]): Set[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
- IterableOps
- def copyToArray(xs: Array[A], start: Int, len: Int): Int
[use case] Note: will not terminate for infinite-sized collections.
[use case]Note: will not terminate for infinite-sized collections.
- xs
the array to fill.
- start
the starting index of xs.
- len
the maximal number of elements to copy.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- def copyToArray(xs: Array[A], start: Int): Int
[use case] Note: will not terminate for infinite-sized collections.
[use case]Note: will not terminate for infinite-sized collections.
- xs
the array to fill.
- start
the starting index of xs.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- def copyToArray(xs: Array[A]): Int
[use case] Note: will not terminate for infinite-sized collections.
[use case]Note: will not terminate for infinite-sized collections.
- xs
the array to fill.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: IterableOnce[B])(p: (A, B) ⇒ Boolean): Boolean
Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.
Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.
- B
the type of the elements of
that
- that
the other collection
- p
the test predicate, which relates elements from both collections
- returns
true
if both collections have the same length andp(x, y)
istrue
for all corresponding elementsx
of this iterator andy
ofthat
, otherwisefalse
- Definition Classes
- IterableOnceOps
- def count(p: (A) ⇒ Boolean): Int
Counts the number of elements in the $coll which satisfy a predicate.
Counts the number of elements in the $coll which satisfy a predicate.
- p
the predicate used to test elements.
- returns
the number of elements satisfying the predicate
p
.
- Definition Classes
- IterableOnceOps
- def diff(that: collection.Set[A]): C
Computes the difference of this set and another set.
- def drop(n: Int): C
Selects all elements except first n ones.
Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- n
the number of elements to drop from this iterable collection.
- returns
a iterable collection consisting of all elements of this iterable collection except the first
n
ones, or else the empty iterable collection, if this iterable collection has less thann
elements. Ifn
is negative, don't drop any elements.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def dropRight(n: Int): C
The rest of the collection without its
n
last elements.The rest of the collection without its
n
last elements. For linear, immutable collections this should avoid making a copy.Note: Even when applied to a view or a lazy collection it will always force the elements.
- Definition Classes
- IterableOps
- def dropWhile(p: (A) ⇒ Boolean): C
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
The predicate used to test elements.
- returns
the longest suffix of this iterable collection whose first element does not satisfy the predicate
p
.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def ensuring(cond: (SortedSetOps[A, CC, C]) ⇒ Boolean, msg: ⇒ Any): SortedSetOps[A, CC, C]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toEnsuring[SortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (SortedSetOps[A, CC, C]) ⇒ Boolean): SortedSetOps[A, CC, C]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toEnsuring[SortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: ⇒ Any): SortedSetOps[A, CC, C]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toEnsuring[SortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): SortedSetOps[A, CC, C]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toEnsuring[SortedSetOps[A, CC, C]] 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(arg0: Any): Boolean
The equality method for reference types.
- def exists(p: (A) ⇒ 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: (A) ⇒ Boolean): C
Selects all elements of this iterable collection which satisfy a predicate.
Selects all elements of this iterable collection which satisfy a predicate.
- returns
a new iterator consisting of all elements of this iterable collection that satisfy the given predicate
p
. The order of the elements is preserved.
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (A) ⇒ Boolean): C
Selects all elements of this iterable collection which do not satisfy a predicate.
Selects all elements of this iterable collection which do not satisfy a predicate.
- pred
the predicate used to test elements.
- returns
a new iterable collection consisting of all elements of this iterable collection that do not satisfy the given predicate
pred
. Their order may not be preserved.
- Definition Classes
- IterableOps → IterableOnceOps
- def finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the
finalize
method is invoked, as well as the interaction betweenfinalize
and non-local returns and exceptions, are all platform dependent. - def find(p: (A) ⇒ Boolean): Option[A]
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 firstKey: A
Returns the first key of the collection.
Returns the first key of the collection.
- Definition Classes
- SortedSetOps → SortedOps
- def flatMap[B](f: (A) ⇒ IterableOnce[B])(implicit ev: Ordering[B]): CC[B]
Builds a new sorted collection by applying a function to all elements of this set and using the elements of the resulting collections.
Builds a new sorted collection by applying a function to all elements of this set and using the elements of the resulting collections.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new set resulting from applying the given collection-valued function
f
to each element of this set and concatenating the results.
- Definition Classes
- SortedSetOps
- def flatMap[B](f: (A) ⇒ IterableOnce[B]): Set[B]
Builds a new iterable collection by applying a function to all elements of this iterable collection and using the elements of the resulting collections.
Builds a new iterable collection by applying a function to all elements of this iterable collection and using the elements of the resulting collections.
For example:
def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")
The type of the resulting collection is guided by the static type of iterable collection. This might cause unexpected results sometimes. For example:
// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet) // lettersOf will return a Set[Char], not a Seq def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq) // xs will be an Iterable[Int] val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2) // ys will be a Map[Int, Int] val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new iterable collection resulting from applying the given collection-valued function
f
to each element of this iterable collection and concatenating the results.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def flatten[B](implicit asIterable: (A) ⇒ IterableOnce[B]): Set[B]
Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.
Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.
The resulting collection's type will be guided by the type of iterable collection. For example:
val xs = List( Set(1, 2, 3), Set(1, 2, 3) ).flatten // xs == List(1, 2, 3, 1, 2, 3) val ys = Set( List(1, 2, 3), List(3, 2, 1) ).flatten // ys == Set(1, 2, 3)
- B
the type of the elements of each traversable collection.
- asIterable
an implicit conversion which asserts that the element type of this iterable collection is a
GenTraversable
.- returns
a new iterable collection resulting from concatenating all element iterable collections.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
Applies a binary operator to a start value and all elements of this $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: (A, B) ⇒ B): B
Applies a binary operator to all elements of this $coll and a start value, going right to left.
Applies a binary operator to all elements of this $coll and a start value, going right to left.
$willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- z
the start value.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this $coll, going right to left with the start 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: (A) ⇒ 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: (A) ⇒ U): Unit
Apply
f
to each element for its side effects Note: [U] parameter needed to help scalac's type inference.Apply
f
to each element for its side effects Note: [U] parameter needed to help scalac's type inference.- Definition Classes
- 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 SortedSetOps[A, CC, C] toStringFormat[SortedSetOps[A, CC, C]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- final def getClass(): Class[_]
Returns the runtime class representation of the object.
- def groupBy[K](f: (A) ⇒ K): Map[K, C]
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: (A) ⇒ K)(f: (A) ⇒ B): Map[K, Set[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: (A) ⇒ K)(f: (A) ⇒ 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[C]
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
- def hashCode(): Int
The hashCode method for reference types.
- def head: A
Selects the first element of this iterable collection.
Selects the first element of this iterable collection.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the first element of this iterable collection.
- Definition Classes
- IterableOps
- Exceptions thrown
NoSuchElementException
if the iterable collection is empty.
- def headOption: Option[A]
Optionally selects the first element.
Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the first element of this iterable collection if it is nonempty,
None
if it is empty.
- Definition Classes
- IterableOps
- def init: C
The initial part of the collection without its last element.
The initial part of the collection without its last element.
- Definition Classes
- IterableOps
- def inits: Iterator[C]
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.Set[A]): C
Computes the intersection between this set and another set.
Computes the intersection between this set and another set.
- that
the set to intersect with.
- returns
a new set consisting of all elements that are both in this set and in the given set
that
.
- Definition Classes
- SetOps
- def isEmpty: Boolean
Tests whether the $coll is empty.
Tests whether the $coll 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 $coll contains no elements,false
otherwise.
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object is
T0
.Test whether the dynamic type of the receiver object is
T0
.Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression
1.isInstanceOf[String]
will 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 knownSize: Int
- Definition Classes
- IterableOnceOps
- def last: A
Selects the last element.
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.
- Definition Classes
- IterableOps
- Exceptions thrown
NoSuchElementException
If the iterable collection is empty.
- def lastKey: A
Returns the last key of the collection.
Returns the last key of the collection.
- Definition Classes
- SortedSetOps → SortedOps
- def lastOption: Option[A]
Optionally selects the last element.
Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the last element of this iterable collection$ if it is nonempty,
None
if it is empty.
- Definition Classes
- IterableOps
- def map[B](f: (A) ⇒ B)(implicit ev: Ordering[B]): CC[B]
Builds a new sorted collection by applying a function to all elements of this set.
Builds a new sorted collection by applying a function to all elements of this set.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new set resulting from applying the given function
f
to each element of this set and collecting the results.
- Definition Classes
- SortedSetOps
- def map[B](f: (A) ⇒ B): Set[B]
Builds a new iterable collection by applying a function to all elements of this iterable collection.
Builds a new iterable collection by applying a function to all elements of this iterable collection.
- B
the element type of the returned iterable collection.
- f
the function to apply to each element.
- returns
a new iterable collection resulting from applying the given function
f
to each element of this iterable collection and collecting the results.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def max: A
[use case] Finds the largest element.
[use case]Finds the largest element.
- returns
the largest element of this immutable sorted set.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this immutable sorted set is empty.
Full Signaturedef max[B >: A](implicit ord: math.Ordering[B]): A
- def maxBefore(key: A): Option[A]
Find the largest element less than a given key.
Find the largest element less than a given key.
- key
The given key.
- returns
None
if there is no such node.
- Definition Classes
- SortedSetOps
- def maxBy[B](f: (A) ⇒ B): A
[use case] Finds the first element which yields the largest value measured by function f.
[use case]Finds the first element which yields the largest value measured by function f.
- B
The result type of the function f.
- f
The measuring function.
- returns
the first element of this immutable sorted set with the largest value measured by function f.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this immutable sorted set is empty.
Full Signaturedef maxBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
- def maxByOption[B](f: (A) ⇒ B): Option[A]
[use case] Finds the first element which yields the largest value measured by function f.
[use case]Finds the first element which yields the largest value measured by function f.
- B
The result type of the function f.
- f
The measuring function.
- returns
an option value containing the first element of this immutable sorted set with the largest value measured by function f.
- Definition Classes
- IterableOnceOps
Full Signaturedef maxByOption[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): Option[A]
- def maxOption: Option[A]
[use case] Finds the largest element.
[use case]Finds the largest element.
- returns
an option value containing the largest element of this immutable sorted set.
- Definition Classes
- IterableOnceOps
Full Signaturedef maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
- def min: A
[use case] Finds the smallest element.
[use case]Finds the smallest element.
- returns
the smallest element of this immutable sorted set
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this immutable sorted set is empty.
Full Signaturedef min[B >: A](implicit ord: math.Ordering[B]): A
- def minAfter(key: A): Option[A]
Find the smallest element larger than or equal to a given key.
Find the smallest element larger than or equal to a given key.
- key
The given key.
- returns
None
if there is no such node.
- Definition Classes
- SortedSetOps
- def minBy[B](f: (A) ⇒ B): A
[use case] Finds the first element which yields the smallest value measured by function f.
[use case]Finds the first element which yields the smallest value measured by function f.
- B
The result type of the function f.
- f
The measuring function.
- returns
the first element of this immutable sorted set with the smallest value measured by function f.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this immutable sorted set is empty.
Full Signaturedef minBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
- def minByOption[B](f: (A) ⇒ B): Option[A]
[use case] Finds the first element which yields the smallest value measured by function f.
[use case]Finds the first element which yields the smallest value measured by function f.
- B
The result type of the function f.
- f
The measuring function.
- returns
an option value containing the first element of this immutable sorted set with the smallest value measured by function f.
- Definition Classes
- IterableOnceOps
Full Signaturedef minByOption[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): Option[A]
- def minOption: Option[A]
[use case] Finds the smallest element.
[use case]Finds the smallest element.
- returns
an option value containing the smallest element of this immutable sorted set.
- Definition Classes
- IterableOnceOps
Full Signaturedef minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
- final def mkString: String
Displays all elements of this $coll in a string.
Displays all elements of this $coll in a string.
Delegates to addString, which can be overridden.
- returns
a string representation of this $coll. In the resulting string the string representations (w.r.t. the method
toString
) of all elements of this $coll follow each other without any separator string.
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
Displays all elements of this $coll in a string using a separator string.
Displays all elements of this $coll in a string using a separator string.
Delegates to addString, which can be overridden.
- sep
the separator string.
- returns
a string representation of this $coll. In the resulting string the string representations (w.r.t. the method
toString
) of all elements of this $coll are separated by the 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 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 partition(p: (A) ⇒ Boolean): (C, C)
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
- IterableOps
- def partitionWith[A1, A2](f: (A) ⇒ Either[A1, A2]): (Set[A1], Set[A2])
A pair of iterable collections, first, consisting of the values that are produced by
f
applied to this iterable collection elements contained in scala.util.Left and, second, all the values contained in scala.util.Right.A pair of iterable collections, first, consisting of the values that are produced by
f
applied to this iterable collection elements contained in scala.util.Left and, second, all the values contained in scala.util.Right.Example:
val xs = Iterable(1, "one", 2, "two", 3, "three") partitionWith { case i: Int => Left(i) case s: String => Right(s) } // xs == (Iterable(1, 2, 3), // Iterable(one, two, three))
- A1
element type of the first resulting collection
- A2
element type of the second resulting collection
- f
split function that map the element of the iterable collection into an scala.util.Either[A1, A2]
- returns
a pair of iterable collections, first, consisting of the values that are produced by
f
applied to this iterable collection elements contained in scala.util.Left and, second, all the values contained in scala.util.Right.
- Definition Classes
- IterableOps
- def product: A
[use case] Multiplies up the elements of this collection.
[use case]Multiplies up the elements of this collection.
- returns
the product of all elements in this immutable sorted set of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the immutable sorted set and as result type ofproduct
. Examples of such types are:Long
,Float
,Double
,BigInt
.
- Definition Classes
- IterableOnceOps
Full Signaturedef product[B >: A](implicit num: math.Numeric[B]): B
- def range(from: A, until: A): C
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
- from
The lower-bound (inclusive) of the ranged projection.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
- def rangeFrom(from: A): C
Creates a ranged projection of this collection with no upper-bound.
Creates a ranged projection of this collection with no upper-bound.
- from
The lower-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedOps
- def rangeTo(to: A): C
Create a range projection of this collection with no lower-bound.
Create a range projection of this collection with no lower-bound.
- to
The upper-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedSetOps → SortedOps
- def rangeUntil(until: A): C
Creates a ranged projection of this collection with no lower-bound.
Creates a ranged projection of this collection with no lower-bound.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
- def reduce[B >: A](op: (B, B) ⇒ B): B
Reduces the elements of this $coll using the specified associative binary operator.
Reduces the elements of this $coll using the specified associative binary operator.
$undefinedorder
- B
A type parameter for the binary operator, a supertype of
A
.- op
A binary operator that must be associative.
- returns
The result of applying reduce operator
op
between all the elements if the $coll is nonempty.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
- def reduceLeft[B >: A](op: (B, A) ⇒ B): B
Applies a binary operator to all elements of this $coll, going left to right.
Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this $coll, going left to right:op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
where
x1, ..., xn
are the elements of this $coll.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
- def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going left to right.
Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceLeft(op)
if this $coll is nonempty,None
otherwise.
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]
Reduces the elements of this $coll, if any, using the specified associative binary operator.
Reduces the elements of this $coll, if any, using the specified associative binary operator.
$undefinedorder
- B
A type parameter for the binary operator, a supertype of
A
.- op
A binary operator that must be associative.
- returns
An option value containing result of applying reduce operator
op
between all the elements if the collection is nonempty, andNone
otherwise.
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: A](op: (A, B) ⇒ B): B
Applies a binary operator to all elements of this $coll, going right to left.
Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this $coll, going right to left:op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
where
x1, ..., xn
are the elements of this $coll.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
- def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going right to left.
Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceRight(op)
if this $coll is nonempty,None
otherwise.
- Definition Classes
- IterableOnceOps
- def removeAll(that: IterableOnce[A]): C
Creates a new immutable set from this immutable set by removing all elements of another collection.
Creates a new immutable set from this immutable set by removing all elements of another collection.
- that
the collection containing the elements to remove.
- returns
a new immutable set with the given elements removed, omitting duplicates.
- Definition Classes
- SetOps
- def reversed: collection.Iterable[A]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scanLeft[B](z: B)(op: (B, A) ⇒ B): Set[B]
Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.
Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- B
the type of the elements in the resulting collection
- z
the initial value
- op
the binary operator applied to the intermediate result and the element
- returns
collection with intermediate results
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def scanRight[B](z: B)(op: (A, B) ⇒ B): Set[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 size: Int
The size of this $coll.
The size of this $coll.
$willNotTerminateInf
- returns
the number of elements in this $coll.
- Definition Classes
- IterableOnceOps
- def sizeCompare(that: collection.Iterable[_]): Int
Compares the size of this iterable collection to the size of another
Iterable
.Compares the size of this iterable collection to the size of another
Iterable
.- that
the
Iterable
whose size is compared with this iterable collection's size.x < 0 if this.size < that.size x == 0 if this.size == that.size x > 0 if this.size > that.size
The method as implemented here does not call
size
directly; its running time isO(this.size min that.size)
instead ofO(this.size + that.size)
. The method should be overwritten if computingsize
is cheap.
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
Compares the size of this iterable collection to a test value.
Compares the size of this iterable collection to a test value.
- otherSize
the test value that gets compared with the size.
- 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
- 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): C
Selects an interval of elements.
Selects an interval of elements. The returned iterable collection is made up of all elements
x
which satisfy the invariant:from <= indexOf(x) < until
Note: might return different results for different runs, unless the underlying collection type is ordered.
- from
the lowest index to include from this iterable collection.
- until
the lowest index to EXCLUDE from this iterable collection.
- returns
a iterable collection containing the elements greater than or equal to index
from
extending up to (but not including) indexuntil
of this iterable collection.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def sliding(size: Int, step: Int): Iterator[C]
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[C]
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 span(p: (A) ⇒ Boolean): (C, C)
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
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesOneAndProducesTwoIterators
- def splitAt(n: Int): (C, C)
Splits this iterable collection into two at a given position.
Splits this iterable collection into two at a given position. Note:
c splitAt n
is equivalent to (but possibly more efficient than)(c take n, c drop n)
.Note: might return different results for different runs, unless the underlying collection type is ordered.
- n
the position at which to split.
- returns
a pair of iterable collections consisting of the first
n
elements of this iterable collection, and the other elements.
- Definition Classes
- IterableOps
- def subsetOf(that: collection.Set[A]): Boolean
Tests whether this set is a subset of another set.
Tests whether this set is a subset of another set.
- that
the set to test.
- returns
true
if this set is a subset ofthat
, i.e. if every element of this set is also an element ofthat
.
- Definition Classes
- SetOps
- def subsets(): Iterator[C]
An iterator over all subsets of this set.
- def subsets(len: Int): Iterator[C]
An iterator over all subsets of this set of the given size.
An iterator over all subsets of this set of the given size. If the requested size is impossible, an empty iterator is returned.
- len
the size of the subsets.
- returns
the iterator.
- Definition Classes
- SetOps
- 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 immutable sorted set of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the immutable sorted set and as result type ofsum
. Examples of such types are:Long
,Float
,Double
,BigInt
.
- Definition Classes
- IterableOnceOps
Full Signaturedef sum[B >: A](implicit num: math.Numeric[B]): B
- final def synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def tail: C
The rest of the collection without its first element.
The rest of the collection without its first element.
- Definition Classes
- IterableOps
- def tails: Iterator[C]
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): C
Selects first n elements.
Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- n
the number of elements to take from this iterable collection.
- returns
a iterable collection consisting only of the first
n
elements of this iterable collection, or else the whole iterable collection, if it has less thann
elements. Ifn
is negative, returns an empty iterable collection.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def takeRight(n: Int): C
A collection containing the last
n
elements of this collection.A collection containing the last
n
elements of this collection.Note: Even when applied to a view or a lazy collection it will always force the elements.
- Definition Classes
- IterableOps
- def takeWhile(p: (A) ⇒ Boolean): C
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
The predicate used to test elements.
- returns
the longest prefix of this iterable collection whose elements all satisfy the predicate
p
.
- Definition Classes
- IterableOps → IterableOnceOps
- Note
Reuse: $consumesAndProducesIterator
- def to[C1](factory: Factory[A, C1]): C1
Given a collection factory
factory
, convert this collection to the appropriate representation for the current element 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 >: A](implicit arg0: ClassTag[B]): Array[B]
Convert collection to array.
Convert collection to array.
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: A]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[A]
- Definition Classes
- IterableOnceOps
- def toList: List[A]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[A]
- returns
This collection as a
Seq[A]
. This is equivalent toto(Seq)
but might be faster.
- Definition Classes
- IterableOnceOps
- def toSet[B >: A]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
Creates a String representation of this object.
- def toVector: Vector[A]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (A) ⇒ collection.Iterable[B]): Set[Set[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.
- final def union(that: collection.Set[A]): C
Computes the union between of set and another set.
- def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])
Converts this iterable collection of pairs into two collections of the first and second half of each pair.
Converts this iterable collection of pairs into two collections of the first and second half of each pair.
val xs = Iterable( (1, "one"), (2, "two"), (3, "three")).unzip // xs == (Iterable(1, 2, 3), // Iterable(one, two, three))
- A1
the type of the first half of the element pairs
- A2
the type of the second half of the element pairs
- asPair
an implicit conversion which asserts that the element type of this iterable collection is a pair.
- returns
a pair of iterable collections, containing the first, respectively second half of each element pair of this iterable collection.
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.
Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.
val xs = Iterable( (1, "one", '1'), (2, "two", '2'), (3, "three", '3')).unzip3 // xs == (Iterable(1, 2, 3), // Iterable(one, two, three), // Iterable(1, 2, 3))
- A1
the type of the first member of the element triples
- A2
the type of the second member of the element triples
- A3
the type of the third member of the element triples
- asTriple
an implicit conversion which asserts that the element type of this iterable collection is a triple.
- returns
a triple of iterable collections, containing the first, second, respectively third member of each element triple of this iterable collection.
- Definition Classes
- IterableOps
- def view: View[A]
A view over the elements of this collection.
A view over the elements of this collection.
- Definition Classes
- 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: (A) ⇒ Boolean): SortedSetOps.WithFilter[A, IterableCC, CC]
Creates a non-strict filter of this set.
Creates a non-strict filter of this set.
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 set which satisfy the predicatep
.
- Definition Classes
- SortedSetOps → IterableOps
- def zip[B](that: IterableOnce[B])(implicit ev: Ordering[(A, B)]): CC[(A, B)]
Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs.
Returns a set formed from this set 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 set containing pairs consisting of corresponding elements of this set and
that
. The length of the returned collection is the minimum of the lengths of this set andthat
.
- Definition Classes
- SortedSetOps
- def zip[B](that: IterableOnce[B]): Set[(A, B)]
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
- B
the type of the second half of the returned pairs
- that
The iterable providing the second half of each result pair
- returns
a new iterable collection containing pairs consisting of corresponding elements of this iterable collection and
that
. The length of the returned collection is the minimum of the lengths of this iterable collection andthat
.
- Definition Classes
- IterableOps
- def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(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: Set[(A, Int)]
Zips this iterable collection with its indices.
Zips this iterable collection with its indices.
- returns
A new iterable collection containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at
0
.
- Definition Classes
- IterableOps → IterableOnceOps
List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
- Note
Reuse: $consumesAndProducesIterator
Example: - final def |(that: collection.Set[A]): C
Alias for
union
- def →[B](y: B): (SortedSetOps[A, CC, C], B)
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toArrowAssoc[SortedSetOps[A, CC, C]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toany2stringadd[SortedSetOps[A, CC, C]] performed by method any2stringadd in scala.Predef.
- 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:(sortedSetOps: any2stringadd[SortedSetOps[A, CC, C]]).+(other)
- Definition Classes
- any2stringadd
Deprecated Value Members
- def +(elem1: A, elem2: A, elems: A*): C
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def ++:[B >: A](that: IterableOnce[B]): IterableCC[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use xs ++ ys instead of ys ++: xs for xs of type Iterable
- def -(elem1: A, elem2: A, elems: A*): C
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def /:[B](z: B)(op: (B, A) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- final def /:[B](z: B)(op: (B, A) ⇒ B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (A, B) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (A, B) ⇒ B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def collectFirst[B](f: PartialFunction[A, B]): Option[B]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).collectFirst(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
- def companion: IterableFactory[IterableCC]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def compare(k0: A, k1: A): Int
Comparison function that orders keys.
Comparison function that orders keys.
- Definition Classes
- SortedOps
- Annotations
- @deprecated @deprecatedOverriding("Use ordering.compare instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use ordering.compare instead
- def copyToBuffer(dest: Buffer[A]): Unit
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def count(f: (A) ⇒ Boolean): Int
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (A) ⇒ Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (A) ⇒ Boolean): Iterator[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def find(p: (A) ⇒ Boolean): Option[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (A) ⇒ IterableOnce[B]): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
- def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
Folds the elements of this $coll using the specified associative binary operator.
Folds the elements of this $coll using the specified associative binary operator. The default implementation in
IterableOnce
is equivalent 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, A) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- def foldRight[B](z: B)(op: (A, B) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (A) ⇒ Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (A) ⇒ U): Unit
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- final def from(from: A): C
Creates a ranged projection of this collection with no upper-bound.
Creates a ranged projection of this collection with no upper-bound.
- from
The lower-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeFrom
- 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 SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def keysIteratorFrom(start: A): Iterator[A]
- Definition Classes
- SortedSetOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
iteratorFrom
instead.
- def map[B](f: (A) ⇒ B): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
- def max(implicit ord: math.Ordering[A]): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: math.Ordering[A]): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).minBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
- def mkString: String
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def nonEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: math.Numeric[A]): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (A, A) ⇒ A): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (A, A) ⇒ A): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (A, A) ⇒ A): Option[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (A, A) ⇒ A): Option[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (A, A) ⇒ A): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (A, A) ⇒ A): Option[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: C
- 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 sameElements[B >: A](that: IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def scan[B >: A](z: B)(op: (B, B) ⇒ B): Set[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 size: Int
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: math.Numeric[A]): A
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[A, C1]): C1
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).to(factory)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
- final def to(to: A): C
Create a range projection of this collection with no lower-bound.
Create a range projection of this collection with no lower-bound.
- to
The upper-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeTo
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toArray
- def toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: collection.IndexedSeq[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: collection.Iterable[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- def toIterator: Iterator[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[A]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).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 SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[A]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: collection.Traversable[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def toTraversable: collection.Traversable[A]
Converts this iterable collection to an unspecified Iterable.
Converts this iterable collection to an unspecified Iterable. Will return the same collection if this instance is already Iterable.
- returns
An Iterable containing all elements of this iterable collection.
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def toVector: Vector[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- final def until(until: A): C
Creates a ranged projection of this collection with no lower-bound.
Creates a ranged projection of this collection with no lower-bound.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeUntil
- final def view(from: Int, until: Int): View[A]
A view over a slice of the elements of this collection.
A view over a slice of the elements of this collection.
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: (A) ⇒ Boolean): Iterator[A]
- Implicit
- This member is added by an implicit conversion from SortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(sortedSetOps: IterableOnceExtensionMethods[A]).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
.