BitSet

scala.collection.mutable.BitSet
See theBitSet companion object

A class for mutable bitsets.

Bitsets are sets of non-negative integers which are represented as variable-size arrays of bits packed into 64-bit words. The lower bound of memory footprint of a bitset is determined by the largest number stored in it.

Attributes

See also

"Scala's Collection Library overview" section on Mutable Bitsets for more information.

Companion
object
Source
BitSet.scala
Graph
Supertypes

Members list

Value members

Constructors

def this(initSize: Int)

Attributes

Source
BitSet.scala
def this()

Attributes

Source
BitSet.scala

Concrete methods

def &=(other: BitSet): this.type

Updates this bitset to the intersection with another bitset by performing a bitwise "and".

Updates this bitset to the intersection with another bitset by performing a bitwise "and".

Value parameters

other

the bitset to form the intersection with.

Attributes

Returns

the bitset itself.

Source
BitSet.scala
def &~=(other: BitSet): this.type

Updates this bitset to the difference with another bitset by performing a bitwise "and-not".

Updates this bitset to the difference with another bitset by performing a bitwise "and-not".

Value parameters

other

the bitset to form the difference with.

Attributes

Returns

the bitset itself.

Source
BitSet.scala
def ^=(other: BitSet): this.type

Updates this bitset to the symmetric difference with another bitset by performing a bitwise "xor".

Updates this bitset to the symmetric difference with another bitset by performing a bitwise "xor".

Value parameters

other

the bitset to form the symmetric difference with.

Attributes

Returns

the bitset itself.

Source
BitSet.scala
override def addAll(xs: IterableOnce[Int]): this.type

Adds all elements produced by an IterableOnce to this bitset.

Adds all elements produced by an IterableOnce to this bitset.

Value parameters

elems

the IterableOnce producing the elements to add.

Attributes

Returns

the bitset itself.

Definition Classes
Source
BitSet.scala
def addOne(elem: Int): this.type

Adds a single element to this bitset.

Adds a single element to this bitset.

Value parameters

elem

the element to add.

Attributes

Returns

the bitset itself

Source
BitSet.scala
def bitSetFactory: BitSet.type

Attributes

Source
BitSet.scala
def clear(): Unit

Clears the contents of this builder.

Clears the contents of this builder. After execution of this method the builder will contain no elements.

Attributes

Source
BitSet.scala
override def clone(): BitSet

Create a copy of the receiver object.

Create a copy of the receiver object.

The default implementation of the clone method is platform dependent.

Attributes

Returns

a copy of the receiver object.

Note

not specified by SLS as a member of AnyRef

Definition Classes
Source
BitSet.scala
override def collect(pf: PartialFunction[Int, Int]): BitSet

Attributes

Definition Classes
Source
BitSet.scala
override def collect[B](pf: PartialFunction[Int, B])(implicit ev: Ordering[B]): SortedSet[B]

Builds a new sorted collection by applying a partial function to all elements of this bitset on which the function is defined.

Builds a new sorted collection by applying a partial function to all elements of this bitset on which the function is defined.

Type parameters

B

the element type of the returned collection.

Value parameters

pf

the partial function which filters and maps the bitset.

Attributes

Returns

a new bitset 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
Source
BitSet.scala
override def diff(that: Set[Int]): BitSet

Computes the difference of this set and another set.

Computes the difference of this set and another set.

Value parameters

that

the set of elements to exclude.

Attributes

Returns

a set containing those elements of this set that are not also contained in the given set that.

Definition Classes
Source
BitSet.scala
override def empty: BitSet

The empty iterable of the same type as this iterable

The empty iterable of the same type as this iterable

Attributes

Returns

an empty iterable of type C.

Definition Classes
Source
BitSet.scala
override def filterImpl(pred: Int => Boolean, isFlipped: Boolean): BitSet

Attributes

Definition Classes
Source
BitSet.scala
override def filterInPlace(p: Int => Boolean): this.type

Removes all elements from the set for which do not satisfy a predicate.

Removes all elements from the set for which do not satisfy a predicate.

Value parameters

p

the predicate used to test elements. Only elements for which p returns true are retained in the set; all others are removed.

Attributes

Definition Classes
Source
BitSet.scala
override def flatMap(f: Int => IterableOnce[Int]): BitSet

Attributes

Definition Classes
Source
BitSet.scala
override def flatMap[B](f: Int => IterableOnce[B])(implicit ev: Ordering[B]): SortedSet[B]

Builds a new sorted collection by applying a function to all elements of this bitset and using the elements of the resulting collections.

Builds a new sorted collection by applying a function to all elements of this bitset and using the elements of the resulting collections.

Type parameters

B

the element type of the returned collection.

Value parameters

f

the function to apply to each element.

Attributes

Returns

a new bitset resulting from applying the given collection-valued function f to each element of this bitset and concatenating the results.

Definition Classes
Source
BitSet.scala
override def map(f: Int => Int): BitSet

Builds a new bitset by applying a function to all elements of this bitset

Builds a new bitset by applying a function to all elements of this bitset

Value parameters

f

the function to apply to each element.

Attributes

Returns

a new bitset resulting from applying the given function f to each element of this bitset and collecting the results

Definition Classes
Source
BitSet.scala
override def map[B](f: Int => B)(implicit ev: Ordering[B]): SortedSet[B]

Builds a new sorted collection by applying a function to all elements of this bitset.

Builds a new sorted collection by applying a function to all elements of this bitset.

Type parameters

B

the element type of the returned collection.

Value parameters

f

the function to apply to each element.

Attributes

Returns

a new bitset resulting from applying the given function f to each element of this bitset and collecting the results.

Definition Classes
Source
BitSet.scala
override def subsetOf(that: Set[Int]): Boolean

Tests whether this set is a subset of another set.

Tests whether this set is a subset of another set.

Value parameters

that

the set to test.

Attributes

Returns

true if this set is a subset of that, i.e. if every element of this set is also an element of that.

Definition Classes
Source
BitSet.scala
override def subtractAll(xs: IterableOnce[Int]): this.type

Removes all elements produced by an iterator from this bitset.

Removes all elements produced by an iterator from this bitset.

Value parameters

xs

the iterator producing the elements to remove.

Attributes

Returns

the bitset itself

Definition Classes
Source
BitSet.scala
def subtractOne(elem: Int): this.type

Removes a single element from this bitset.

Removes a single element from this bitset.

Value parameters

elem

the element to remove.

Attributes

Returns

the bitset itself

Source
BitSet.scala
override def toBitMask: Array[Long]

Creates a bit mask for this set as a new array of longs

Creates a bit mask for this set as a new array of longs

Attributes

Definition Classes
Source
BitSet.scala

Attributes

Source
BitSet.scala

Attributes

Source
BitSet.scala
override def unsorted: Set[Int]

Attributes

Definition Classes
Source
BitSet.scala
override def zip[B](that: IterableOnce[B])(implicit ev: Ordering[(Int, B)]): SortedSet[(Int, B)]

Returns a bitset formed from this bitset and another iterable collection by combining corresponding elements in pairs.

Returns a bitset formed from this bitset 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.

Type parameters

B

the type of the second half of the returned pairs

Value parameters

that

The iterable providing the second half of each result pair

Attributes

Returns

a new bitset containing pairs consisting of corresponding elements of this bitset and that. The length of the returned collection is the minimum of the lengths of this bitset and that.

Definition Classes
Source
BitSet.scala
def |=(other: BitSet): this.type

Updates this bitset to the union with another bitset by performing a bitwise "or".

Updates this bitset to the union with another bitset by performing a bitwise "or".

Value parameters

other

the bitset to form the union with.

Attributes

Returns

the bitset itself.

Source
BitSet.scala

Inherited methods

final def &(that: Set[Int]): BitSet

Alias for intersect

Alias for intersect

Attributes

Inherited from:
SetOps
Source
Set.scala
final def &~(that: Set[Int]): BitSet

Alias for diff

Alias for diff

Attributes

Inherited from:
SetOps
Source
Set.scala
final def ++(that: IterableOnce[Int]): BitSet

Alias for concat

Alias for concat

Attributes

Inherited from:
SetOps
Source
Set.scala
final def ++[B >: Int](suffix: IterableOnce[B]): Set[B]

Alias for concat

Alias for concat

Attributes

Inherited from:
IterableOps
Source
Iterable.scala
final def ++=(elems: IterableOnce[Int]): Growable.this.type

Alias for addAll

Alias for addAll

Attributes

Inherited from:
Growable
Source
Growable.scala
final def +=(elem: Int): Growable.this.type

Alias for addOne

Alias for addOne

Attributes

Inherited from:
Growable
Source
Growable.scala
final def --=(xs: IterableOnce[Int]): Shrinkable.this.type

Alias for subtractAll

Alias for subtractAll

Attributes

Inherited from:
Shrinkable
Source
Shrinkable.scala
final def -=(elem: Int): Shrinkable.this.type

Alias for subtractOne

Alias for subtractOne

Attributes

Inherited from:
Shrinkable
Source
Shrinkable.scala
final def ^(other: BitSet): BitSet

Attributes

Inherited from:
BitSetOps
Source
BitSet.scala
def add(elem: Int): Boolean

Check whether the set contains the given element, and add it if not.

Check whether the set contains the given element, and add it if not.

Value parameters

elem

the element to be added

Attributes

Returns

true if the element was added

Inherited from:
SetOps
Source
Set.scala
final def addString(b: StringBuilder): b.type

Appends all elements of this collection to a string builder.

Appends all elements of this collection to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this collection 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

Value parameters

b

the string builder to which elements are appended.

Attributes

Returns

the string builder b to which elements were appended.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def addString(b: StringBuilder, sep: String): b.type

Appends all elements of this collection to a string builder using a separator string.

Appends all elements of this collection 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 collection, separated by the string sep.

Example:

scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

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

scala> a.addString(b, ", ")
res0: StringBuilder = 1, 2, 3, 4

Value parameters

b

the string builder to which elements are appended.

sep

the separator string.

Attributes

Returns

the string builder b to which elements were appended.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def addString(b: StringBuilder, start: String, sep: String, end: String): b.type

Appends all elements of this collection to a string builder using start, end, and separator strings.

Appends all elements of this collection to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this collection are separated by the string sep.

Example:

scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

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

scala> a.addString(b , "List(" , ", " , ")")
res5: StringBuilder = List(1, 2, 3, 4)

Value parameters

b

the string builder to which elements are appended.

end

the ending string.

sep

the separator string.

start

the starting string.

Attributes

Returns

the string builder b to which elements were appended.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def andThen[A](g: Boolean => A): Int => 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.

Type parameters

A

the result type of function g

Value parameters

g

a function R => A

Attributes

Returns

a new function f such that f(x) == g(apply(x))

Inherited from:
Function1
Source
Function1.scala
final def apply(elem: Int): 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.

Value parameters

elem

the element to test for membership.

Attributes

Returns

true if elem is contained in this set, false otherwise.

Inherited from:
SetOps
Source
Set.scala
def canEqual(that: Any): Boolean

Checks whether this instance can possibly equal that.

Checks whether this instance can possibly equal that.

A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

Value parameters

that

the value being probed for possible equality

Attributes

Returns

true if this instance can possibly equal that, otherwise false

Inherited from:
Set
Source
Set.scala
override def collect[B](pf: PartialFunction[Int, 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.

Type parameters

B

the element type of the returned iterable collection.

Value parameters

pf

the partial function which filters and maps the iterable collection.

Attributes

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
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

Finds the first element of the collection for which the given partial function is defined, and applies the partial function to it.

Finds the first element of the collection for which the given partial function is defined, and applies the partial function to it.

Note: may not terminate for infinite-sized collections.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

pf

the partial function

Attributes

Returns

an option value containing pf applied to the first value for which it is defined, or None if none exists.

Example

Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def compose[A](g: A => Int): 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.

Type parameters

A

the type to which function g can be applied

Value parameters

g

a function A => T1

Attributes

Returns

a new function f such that f(x) == apply(g(x))

Inherited from:
Function1
Source
Function1.scala
override def concat(other: IterableOnce[Int]): BitSet

Creates a new set by adding all elements contained in another collection to this set, omitting duplicates.

Creates a new set by adding all elements contained in another collection to this set, omitting duplicates.

This method takes a collection of elements and adds all elements, omitting duplicates, into set.

Example:

scala> val a = Set(1, 2) concat Set(2, 3)
a: scala.collection.immutable.Set[Int] = Set(1, 2, 3)

Value parameters

that

the collection containing the elements to add.

Attributes

Returns

a new set with the given elements added, omitting duplicates.

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
def concat[B >: Int](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.

Type parameters

B

the element type of the returned collection.

Value parameters

suffix

the iterable to append.

Attributes

Returns

a new iterable collection which contains all elements of this iterable collection followed by all elements of suffix.

Inherited from:
IterableOps
Source
Iterable.scala
def contains(elem: Int): Boolean

Attributes

Inherited from:
BitSetOps
Source
BitSet.scala
def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int

Copy elements to an array, returning the number of elements written.

Copy elements to an array, returning the number of elements written.

Fills the given array xs starting at index start with at most len elements of this collection.

Copying will stop once either all the elements of this collection have been copied, or the end of the array is reached, or len elements have been copied.

Type parameters

B

the type of the elements of the array.

Value parameters

len

the maximal number of elements to copy.

start

the starting index of xs.

xs

the array to fill.

Attributes

Returns

the number of elements written to the array

Note

Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def copyToArray[B >: Int](xs: Array[B], start: Int): Int

Copies elements to an array, returning the number of elements written.

Copies elements to an array, returning the number of elements written.

Fills the given array xs starting at index start with values of this collection.

Copying will stop once either all the elements of this collection have been copied, or the end of the array is reached.

Type parameters

B

the type of the elements of the array.

Value parameters

start

the starting index of xs.

xs

the array to fill.

Attributes

Returns

the number of elements written to the array

Note

Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def copyToArray[B >: Int](xs: Array[B]): Int

Copies elements to an array, returning the number of elements written.

Copies elements to an array, returning the number of elements written.

Fills the given array xs starting at index start with values of this collection.

Copying will stop once either all the elements of this collection have been copied, or the end of the array is reached.

Type parameters

B

the type of the elements of the array.

Value parameters

xs

the array to fill.

Attributes

Returns

the number of elements written to the array

Note

Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def corresponds[B](that: IterableOnce[B])(p: (Int, 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.

Note: will not terminate for infinite-sized collections.

Type parameters

B

the type of the elements of that

Value parameters

p

the test predicate, which relates elements from both collections

that

the other collection

Attributes

Returns

true if both collections have the same length and p(x, y) is true for all corresponding elements x of this iterator and y of that, otherwise false

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def count(p: Int => Boolean): Int

Counts the number of elements in the collection which satisfy a predicate.

Counts the number of elements in the collection which satisfy a predicate.

Note: will not terminate for infinite-sized collections.

Value parameters

p

the predicate used to test elements.

Attributes

Returns

the number of elements satisfying the predicate p.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def drop(n: Int): BitSet

Selects all elements except the first n ones.

Selects all elements except the first n ones.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

n

the number of elements to drop from this iterable collection.

Attributes

Returns

a iterable collection consisting of all elements of this iterable collection except the first n ones, or else the empty iterable collection, if this iterable collection has less than n elements. If n is negative, don't drop any elements.

Inherited from:
IterableOps
Source
Iterable.scala
override def dropRight(n: Int): BitSet

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.

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def dropWhile(p: Int => Boolean): BitSet

Selects all elements except the longest prefix that satisfies a predicate.

Selects all elements except the longest prefix that satisfies a predicate.

The matching prefix starts with the first element of this iterable collection, and the element following the prefix is the first element that does not satisfy the predicate. The matching prefix may be empty, so that this method returns the entire iterable collection.

Example:

scala> List(1, 2, 3, 100, 4).dropWhile(n => n < 10)
val res0: List[Int] = List(100, 4)

scala> List(1, 2, 3, 100, 4).dropWhile(n => n == 0)
val res1: List[Int] = List(1, 2, 3, 100, 4)

Use span to obtain both the prefix and suffix. Use filterNot to drop all elements that satisfy the predicate.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

p

The predicate used to test elements.

Attributes

Returns

the longest suffix of this iterable collection whose first element does not satisfy the predicate p.

Inherited from:
IterableOps
Source
Iterable.scala
override def equals(that: Any): Boolean

Equality of sets is implemented using the lookup method contains.

Equality of sets is implemented using the lookup method contains. This method returns true if

  • the argument that is a Set,

  • the two sets have the same size, and

  • for every element this set, other.contains(element) == true.

The implementation of equals checks the canEqual method, so subclasses of Set can narrow down the equality to specific set types. The Set implementations in the standard library can all be compared, their canEqual methods return true.

Note: The equals method only respects the equality laws (symmetry, transitivity) if the two sets use the same element equivalence function in their lookup operation. For example, the element equivalence operation in a scala.collection.immutable.TreeSet is defined by its ordering. Comparing a TreeSet with a HashSet leads to unexpected results if ordering.equiv(e1, e2) (used for lookup in TreeSet) is different from e1 == e2 (used for lookup in HashSet).

scala> import scala.collection.immutable._
scala> val ord: Ordering[String] = _ compareToIgnoreCase _

scala> TreeSet("A")(ord) == HashSet("a")
val res0: Boolean = false

scala> HashSet("a") == TreeSet("A")(ord)
val res1: Boolean = true

Value parameters

that

The set to which this set is compared

Attributes

Returns

true if the two sets are equal according to the description

Definition Classes
SortedSet -> Set -> Equals -> Any
Inherited from:
SortedSet
Source
SortedSet.scala
def exists(p: Int => Boolean): Boolean

Tests whether a predicate holds for at least one element of this collection.

Tests whether a predicate holds for at least one element of this collection.

Note: may not terminate for infinite-sized collections.

Value parameters

p

the predicate used to test elements.

Attributes

Returns

true if the given predicate p is satisfied by at least one element of this collection, otherwise false

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
override def filter(pred: Int => Boolean): BitSet

Selects all elements of this iterable collection which satisfy a predicate.

Selects all elements of this iterable collection which satisfy a predicate.

Value parameters

p

the predicate used to test elements.

Attributes

Returns

a new iterable collection consisting of all elements of this iterable collection that satisfy the given predicate p. The order of the elements is preserved.

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
override def filterNot(pred: Int => Boolean): BitSet

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.

Value parameters

pred

the predicate used to test elements.

Attributes

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
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def find(p: Int => Boolean): Option[Int]

Finds the first element of the collection satisfying a predicate, if any.

Finds the first element of the collection satisfying a predicate, if any.

Note: may not terminate for infinite-sized collections.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

p

the predicate used to test elements.

Attributes

Returns

an option value containing the first element in the collection that satisfies p, or None if none exists.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def firstKey: Int

Returns the first key of the collection.

Returns the first key of the collection.

Attributes

Inherited from:
SortedSetOps
Source
SortedSet.scala
override def flatMap[B](f: Int => 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)

Type parameters

B

the element type of the returned collection.

Value parameters

f

the function to apply to each element.

Attributes

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
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
override def flatten[B](implicit toIterableOnce: Int => IterableOnce[B]): Set[B]

Converts this iterable collection of iterable collections into a iterable collection formed by the elements of these iterable collections.

Converts this iterable collection of iterable collections into a iterable collection formed by the elements of these iterable 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)

Type parameters

B

the type of the elements of each iterable collection.

Value parameters

asIterable

an implicit conversion which asserts that the element type of this iterable collection is an Iterable.

Attributes

Returns

a new iterable collection resulting from concatenating all element iterable collections.

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1

Applies the given binary operator op to the given initial value z and all elements of this collection.

Applies the given binary operator op to the given initial value z and all elements of this collection.

For each application of the operator, each operand is either an element of this collection, the initial value, or another such application of the operator.

The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation. The initial value may be used an arbitrary number of times, but at least once.

If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative. In either case, it is also necessary that the initial value be a neutral value for the operator, e.g. Nil for List concatenation or 1 for multiplication.

The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

Note: will not terminate for infinite-sized collections.

Type parameters

A1

The type parameter for the binary operator, a supertype of A.

Value parameters

op

A binary operator; must be associative for the result to always be the same across runs.

z

An initial value; may be used an arbitrary number of times in the computation of the result; must be a neutral value for op for the result to always be the same across runs.

Attributes

Returns

The result of applying op between all the elements and z, or z if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def foldLeft[B](z: B)(op: (B, Int) => B): B

Applies the given binary operator op to the given initial value z and all elements of this collection, going left to right.

Applies the given binary operator op to the given initial value z and all elements of this collection, going left to right. Returns the initial value if this collection is empty.

"Going left to right" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this collection, the result is op( op( ... op( op(z, x1), x2) ... ), xn).

If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the initial value, and each other left operand is itself an application of the operator. The elements of this collection and the initial value all appear exactly once in the computation.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the binary operator.

Value parameters

op

A binary operator.

z

An initial value.

Attributes

Returns

The result of applying op to z and all elements of this collection, going left to right. Returns z if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def foldRight[B](z: B)(op: (Int, B) => B): B

Applies the given binary operator op to all elements of this collection and the given initial value z, going right to left.

Applies the given binary operator op to all elements of this collection and the given initial value z, going right to left. Returns the initial value if this collection is empty.

"Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this collection, the result is op(x1, op(x2, op( ... op(xn, z) ... ))).

If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the initial value, and each other right operand is itself an application of the operator. The elements of this collection and the initial value all appear exactly once in the computation.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the binary operator.

Value parameters

op

A binary operator.

z

An initial value.

Attributes

Returns

The result of applying op to all elements of this collection and z, going right to left. Returns z if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def forall(p: Int => Boolean): Boolean

Tests whether a predicate holds for all elements of this collection.

Tests whether a predicate holds for all elements of this collection.

Note: may not terminate for infinite-sized collections.

Value parameters

p

the predicate used to test elements.

Attributes

Returns

true if this collection is empty or the given predicate p holds for all elements of this collection, otherwise false.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
override def foreach[U](f: Int => U): Unit

Applies f to each element for its side effects.

Applies f to each element for its side effects. Note: U parameter needed to help scalac's type inference.

Attributes

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
def groupBy[K](f: Int => K): Map[K, BitSet]

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.

Type parameters

K

the type of keys returned by the discriminator function.

Value parameters

f

the discriminator function.

Attributes

Returns

A map from keys to iterable collections such that the following invariant holds:

(xs groupBy f)(k) = xs filter (x => f(x) == k)

That is, every key k is bound to a iterable collection of those elements x for which f(x) equals k.

Inherited from:
IterableOps
Source
Iterable.scala
def groupMap[K, B](key: Int => K)(f: Int => 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 type B using the value function.

It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

case class User(name: String, age: Int)

def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
  users.groupMap(_.age)(_.name)

Note: Even when applied to a view or a lazy collection it will always force the elements.

Type parameters

B

the type of values returned by the transformation function

K

the type of keys returned by the discriminator function

Value parameters

f

the element transformation function

key

the discriminator function

Attributes

Inherited from:
IterableOps
Source
Iterable.scala
def groupMapReduce[K, B](key: Int => K)(f: Int => 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 the f function and then reduced into a single value with the reduce function.

It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

def occurrences[A](as: Seq[A]): Map[A, Int] =
  as.groupMapReduce(identity)(_ => 1)(_ + _)

Note: Even when applied to a view or a lazy collection it will always force the elements.

Attributes

Inherited from:
IterableOps
Source
Iterable.scala
def grouped(size: Int): Iterator[BitSet]

Partitions elements in fixed size iterable collections.

Partitions elements in fixed size iterable collections.

Value parameters

size

the number of elements per group

Attributes

Returns

An iterator producing iterable collections of size size, except the last will be less than size size if the elements don't divide evenly.

See also

scala.collection.Iterator, method grouped

Inherited from:
IterableOps
Source
Iterable.scala
override def hashCode(): Int

Calculates a hash code value for the object.

Calculates a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Attributes

Returns

the hash code value for this object.

Definition Classes
Set -> Any
Inherited from:
Set
Source
Set.scala
def head: Int

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.

Attributes

Returns

the first element of this iterable collection.

Throws

NoSuchElementException if the iterable collection is empty.

Inherited from:
IterableOps
Source
Iterable.scala

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.

Attributes

Returns

the first element of this iterable collection if it is nonempty, None if it is empty.

Inherited from:
IterableOps
Source
Iterable.scala
def init: BitSet

The initial part of the collection without its last element.

The initial part of the collection without its last element.

Note: Even when applied to a view or a lazy collection it will always force the elements.

Attributes

Inherited from:
IterableOps
Source
Iterable.scala

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.

Note: Even when applied to a view or a lazy collection it will always force the elements.

Attributes

Returns

an iterator over all the inits of this iterable collection

Example

List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

Inherited from:
IterableOps
Source
Iterable.scala
override def intersect(other: Set[Int]): BitSet

Computes the intersection between this set and another set.

Computes the intersection between this set and another set.

Value parameters

that

the set to intersect with.

Attributes

Returns

a new set consisting of all elements that are both in this set and in the given set that.

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
override def isEmpty: Boolean

Tests whether the set is empty.

Tests whether the set is empty.

Note: The default implementation creates and discards an iterator.

Note: Implementations in subclasses that are not repeatedly iterable must take care not to consume any elements when isEmpty is called.

Attributes

Returns

true if the set contains no elements, false otherwise.

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
override 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.

Attributes

Returns

true if it is repeatedly traversable, false otherwise.

Definition Classes
Inherited from:
IterableOps
Source
Iterable.scala

The companion object of this mutable set, providing various factory methods.

The companion object of this mutable set, providing various factory methods.

Attributes

Note

When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

Definition Classes
Inherited from:
Set
Source
Set.scala

An scala.collection.Iterator over the elements of this set.

An scala.collection.Iterator over the elements of this set.

If an IterableOnce object is in fact an scala.collection.Iterator, this method always returns itself, in its current state, but if it is an scala.collection.Iterable, this method always returns a new scala.collection.Iterator.

Attributes

Inherited from:
BitSetOps
Source
BitSet.scala
def iteratorFrom(start: Int): Iterator[Int]

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

Value parameters

start

The lower-bound (inclusive) of the iterator

Attributes

Inherited from:
BitSetOps
Source
BitSet.scala
override def knownSize: Int

The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise.

The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise.

Attributes

Returns

The number of elements. The default implementation always returns -1.

Definition Classes
Inherited from:
SetOps
Source
Set.scala
def last: Int

Selects the last element.

Selects the last element.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Attributes

Returns

The last element of this iterable collection.

Throws

NoSuchElementException If the iterable collection is empty.

Inherited from:
IterableOps
Source
Iterable.scala
def lastKey: Int

Returns the last key of the collection.

Returns the last key of the collection.

Attributes

Inherited from:
SortedSetOps
Source
SortedSet.scala

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.

Attributes

Returns

the last element of this iterable collection$ if it is nonempty, None if it is empty.

Inherited from:
IterableOps
Source
Iterable.scala
def lazyZip[B](that: Iterable[B]): LazyZip2[Int, B, Iterable.this.type]

Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

val xs = List(1, 2, 3)
val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
// res == List(4, 8, 12)

Type parameters

B

the type of the second element in each eventual pair

Value parameters

that

the iterable providing the second element of each eventual pair

Attributes

Returns

a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.

Inherited from:
Iterable
Source
Iterable.scala
override def map[B](f: Int => 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.

Type parameters

B

the element type of the returned iterable collection.

Value parameters

f

the function to apply to each element.

Attributes

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
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def mapResult[NewTo](f: BitSet => NewTo): Builder[Int, NewTo]

A builder resulting from this builder my mapping the result using f.

A builder resulting from this builder my mapping the result using f.

Attributes

Inherited from:
Builder
Source
Builder.scala
override def max[B >: Int](implicit ord: Ordering[B]): Int

Finds the largest element.

Finds the largest element.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The type over which the ordering is defined.

Value parameters

ord

An ordering to be used for comparing elements.

Attributes

Returns

the largest element of this set with respect to the ordering ord.

Throws

UnsupportedOperationException if this set is empty.

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
def maxBefore(key: Int): Option[Int]

Find the largest element less than a given key.

Find the largest element less than a given key.

Value parameters

key

The given key.

Attributes

Returns

None if there is no such node.

Inherited from:
SortedSetOps
Source
SortedSet.scala
def maxBy[B](f: Int => B)(implicit ord: Ordering[B]): Int

Finds the first element which yields the largest value measured by function f.

Finds the first element which yields the largest value measured by function f.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the function f.

Value parameters

cmp

An ordering to be used for comparing elements.

f

The measuring function.

Attributes

Returns

the first element of this collection with the largest value measured by function f with respect to the ordering cmp.

Throws

UnsupportedOperationException if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def maxByOption[B](f: Int => B)(implicit ord: Ordering[B]): Option[Int]

Finds the first element which yields the largest value measured by function f.

Finds the first element which yields the largest value measured by function f.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the function f.

Value parameters

cmp

An ordering to be used for comparing elements.

f

The measuring function.

Attributes

Returns

an option value containing the first element of this collection with the largest value measured by function f with respect to the ordering cmp.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def maxOption[B >: Int](implicit ord: Ordering[B]): Option[Int]

Finds the largest element.

Finds the largest element.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The type over which the ordering is defined.

Value parameters

ord

An ordering to be used for comparing elements.

Attributes

Returns

an option value containing the largest element of this collection with respect to the ordering ord.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
override def min[B >: Int](implicit ord: Ordering[B]): Int

Finds the smallest element.

Finds the smallest element.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The type over which the ordering is defined.

Value parameters

ord

An ordering to be used for comparing elements.

Attributes

Returns

the smallest element of this set with respect to the ordering ord.

Throws

UnsupportedOperationException if this set is empty.

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
def minAfter(key: Int): Option[Int]

Find the smallest element larger than or equal to a given key.

Find the smallest element larger than or equal to a given key.

Value parameters

key

The given key.

Attributes

Returns

None if there is no such node.

Inherited from:
SortedSetOps
Source
SortedSet.scala
def minBy[B](f: Int => B)(implicit ord: Ordering[B]): Int

Finds the first element which yields the smallest value measured by function f.

Finds the first element which yields the smallest value measured by function f.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the function f.

Value parameters

cmp

An ordering to be used for comparing elements.

f

The measuring function.

Attributes

Returns

the first element of this collection with the smallest value measured by function f with respect to the ordering cmp.

Throws

UnsupportedOperationException if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def minByOption[B](f: Int => B)(implicit ord: Ordering[B]): Option[Int]

Finds the first element which yields the smallest value measured by function f.

Finds the first element which yields the smallest value measured by function f.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the function f.

Value parameters

cmp

An ordering to be used for comparing elements.

f

The measuring function.

Attributes

Returns

an option value containing the first element of this collection with the smallest value measured by function f with respect to the ordering cmp.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def minOption[B >: Int](implicit ord: Ordering[B]): Option[Int]

Finds the smallest element.

Finds the smallest element.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The type over which the ordering is defined.

Value parameters

ord

An ordering to be used for comparing elements.

Attributes

Returns

an option value containing the smallest element of this collection with respect to the ordering ord.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def mkString: String

Displays all elements of this collection in a string.

Displays all elements of this collection in a string.

Delegates to addString, which can be overridden.

Attributes

Returns

a string representation of this collection. In the resulting string the string representations (w.r.t. the method toString) of all elements of this collection follow each other without any separator string.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def mkString(sep: String): String

Displays all elements of this collection in a string using a separator string.

Displays all elements of this collection in a string using a separator string.

Delegates to addString, which can be overridden.

Value parameters

sep

the separator string.

Attributes

Returns

a string representation of this collection. In the resulting string the string representations (w.r.t. the method toString) of all elements of this collection are separated by the string sep.

Example

List(1, 2, 3).mkString("|") = "1|2|3"

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def mkString(start: String, sep: String, end: String): String

Displays all elements of this collection in a string using start, end, and separator strings.

Displays all elements of this collection in a string using start, end, and separator strings.

Delegates to addString, which can be overridden.

Value parameters

end

the ending string.

sep

the separator string.

start

the starting string.

Attributes

Returns

a string representation of this collection. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this collection are separated by the string sep.

Example

List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

Inherited from:
IterableOnceOps
Source
IterableOnce.scala

Tests whether the collection is not empty.

Tests whether the collection is not empty.

Attributes

Returns

true if the collection contains at least one element, false otherwise.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def ordering: Ordering[Int]

Attributes

Inherited from:
BitSetOps
Source
BitSet.scala
override def partition(p: Int => Boolean): (BitSet, BitSet)

A pair of, first, all elements that satisfy predicate p and, second, all elements that do not.

A pair of, first, all elements that satisfy predicate p and, second, all elements that do not. Interesting because it splits a collection in two.

The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in StrictOptimizedIterableOps, which requires only a single traversal.

Attributes

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
override def partitionMap[A1, A2](f: Int => Either[A1, A2]): (Set[A1], Set[A2])

Applies a function f to each element of the iterable collection and returns a pair of iterable collections: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

Applies a function f to each element of the iterable collection and returns a pair of iterable collections: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

Example:

val xs = Iterable(1, "one", 2, "two", 3, "three") partitionMap {
 case i: Int => Left(i)
 case s: String => Right(s)
}
// xs == (Iterable(1, 2, 3),
//        Iterable(one, two, three))

Type parameters

A1

the element type of the first resulting collection

A2

the element type of the second resulting collection

Value parameters

f

the 'split function' mapping the elements of this iterable collection to an scala.util.Either

Attributes

Returns

a pair of iterable collections: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def product[B >: Int](implicit num: Numeric[B]): B

Multiplies together the elements of this collection.

Multiplies together the elements of this collection.

The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

Note: will not terminate for infinite-sized collections.

Type parameters

B

the result type of the * operator.

Value parameters

num

an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

Attributes

Returns

the product of all elements of this collection with respect to the * operator in num.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def range(from: Int, until: Int): BitSet

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.

Value parameters

from

The lower-bound (inclusive) of the ranged projection.

until

The upper-bound (exclusive) of the ranged projection.

Attributes

Inherited from:
SortedOps
Source
SortedOps.scala
def rangeFrom(from: Int): BitSet

Creates a ranged projection of this collection with no upper-bound.

Creates a ranged projection of this collection with no upper-bound.

Value parameters

from

The lower-bound (inclusive) of the ranged projection.

Attributes

Inherited from:
SortedOps
Source
SortedOps.scala
def rangeImpl(from: Option[Int], until: Option[Int]): BitSet

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.

Value parameters

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.

Attributes

Inherited from:
BitSetOps
Source
BitSet.scala
def rangeTo(to: Int): BitSet

Create a range projection of this collection with no lower-bound.

Create a range projection of this collection with no lower-bound.

Value parameters

to

The upper-bound (inclusive) of the ranged projection.

Attributes

Inherited from:
SortedSetOps
Source
SortedSet.scala
def rangeUntil(until: Int): BitSet

Creates a ranged projection of this collection with no lower-bound.

Creates a ranged projection of this collection with no lower-bound.

Value parameters

until

The upper-bound (exclusive) of the ranged projection.

Attributes

Inherited from:
SortedOps
Source
SortedOps.scala
def reduce[B >: Int](op: (B, B) => B): B

Applies the given binary operator op to all elements of this collection.

Applies the given binary operator op to all elements of this collection.

For each application of the operator, each operand is either an element of this collection or another such application of the operator. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The type parameter for the binary operator, a supertype of A.

Value parameters

op

A binary operator; must be associative for the result to always be the same across runs.

Attributes

Returns

The result of applying op between all the elements if the collection is nonempty.

Throws

UnsupportedOperationException if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def reduceLeft[B >: Int](op: (B, Int) => B): B

Applies the given binary operator op to all elements of this collection, going left to right.

Applies the given binary operator op to all elements of this collection, going left to right.

"Going left to right" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this collection, the result is op( op( op( ... op(x1, x2) ... ), xn-1), xn).

If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the first element of this collection and each other left operand is itself an application of the operator. Each element appears exactly once in the computation.

Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the binary operator, a supertype of A.

Value parameters

op

A binary operator.

Attributes

Returns

The result of applying op to all elements of this collection, going left to right.

Throws

UnsupportedOperationException if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]

If this collection is nonempty, reduces it with the given binary operator op, going left to right.

If this collection is nonempty, reduces it with the given binary operator op, going left to right.

The behavior is the same as reduceLeft except that the value is None if the collection is empty. Each element appears exactly once in the computation.

Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the binary operator, a supertype of A.

Value parameters

op

A binary operator.

Attributes

Returns

The result of reducing this collection with op going left to right if the collection is nonempty, inside a Some, and None otherwise.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def reduceOption[B >: Int](op: (B, B) => B): Option[B]

If this collection is nonempty, reduces it with the given binary operator op.

If this collection is nonempty, reduces it with the given binary operator op.

The behavior is the same as reduce except that the value is None if the collection is empty. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

Note: will not terminate for infinite-sized collections.

Type parameters

B

A type parameter for the binary operator, a supertype of A.

Value parameters

op

A binary operator; must be associative for the result to always be the same across runs.

Attributes

Returns

The result of reducing this collection with op if the collection is nonempty, inside a Some, and None otherwise.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def reduceRight[B >: Int](op: (Int, B) => B): B

Applies the given binary operator op to all elements of this collection, going right to left.

Applies the given binary operator op to all elements of this collection, going right to left.

"Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this collection, the result is op(x1, op(x2, op( ... op(xn-1, xn) ... ))).

If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the last element of this collection and each other right operand is itself an application of the operator. Each element appears exactly once in the computation.

Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the binary operator, a supertype of A.

Value parameters

op

A binary operator.

Attributes

Returns

The result of applying op to all elements of this collection, going right to left.

Throws

UnsupportedOperationException if this collection is empty.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]

If this collection is nonempty, reduces it with the given binary operator op, going right to left.

If this collection is nonempty, reduces it with the given binary operator op, going right to left.

The behavior is the same as reduceRight except that the value is None if the collection is empty. Each element appears exactly once in the computation.

Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

Note: will not terminate for infinite-sized collections.

Type parameters

B

The result type of the binary operator, a supertype of A.

Value parameters

op

A binary operator.

Attributes

Returns

The result of reducing this collection with op going right to left if the collection is nonempty, inside a Some, and None otherwise.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def remove(elem: Int): Boolean

Removes an element from this set.

Removes an element from this set.

Value parameters

elem

the element to be removed

Attributes

Returns

true if this set contained the element before it was removed

Inherited from:
SetOps
Source
Set.scala
def result(): BitSet

Result collection consisting of all elements appended so far.

Result collection consisting of all elements appended so far.

Attributes

Inherited from:
SetOps
Source
Set.scala
protected def reversed: Iterable[Int]

Attributes

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def scan[B >: Int](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.

Type parameters

B

element type of the resulting collection

Value parameters

op

the associative operator for the scan

z

neutral element for the operator op

Attributes

Returns

a new iterable collection containing the prefix scan of the elements in this iterable collection

Inherited from:
IterableOps
Source
Iterable.scala
override def scanLeft[B](z: B)(op: (B, Int) => 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.

Type parameters

B

the type of the elements in the resulting collection

Value parameters

op

the binary operator applied to the intermediate result and the element

z

the initial value

Attributes

Returns

collection with intermediate results

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def scanRight[B](z: B)(op: (Int, 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.

Note: Even when applied to a view or a lazy collection it will always force the elements.

Example:

List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

Type parameters

B

the type of the elements in the resulting collection

Value parameters

op

the binary operator applied to the intermediate result and the element

z

the initial value

Attributes

Returns

collection with intermediate results

Inherited from:
IterableOps
Source
Iterable.scala
override def size: Int

The size of this set.

The size of this set.

Note: will not terminate for infinite-sized collections.

Attributes

Returns

the number of elements in this set.

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala
def sizeCompare(that: Iterable[_]): Int

Compares the size of this iterable collection to the size of another Iterable.

Compares the size of this iterable collection to the size of another Iterable.

Value parameters

that

the Iterable whose size is compared with this iterable collection's size.

Attributes

Returns

A value x where

x <  0       if this.size <  that.size
x == 0       if this.size == that.size
x >  0       if this.size >  that.size

The method as implemented here does not call size directly; its running time is O(this.size min that.size) instead of O(this.size + that.size). The method should be overridden if computing size is cheap and knownSize returns -1.

Inherited from:
IterableOps
Source
Iterable.scala
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.

Value parameters

otherSize

the test value that gets compared with the size.

Attributes

Returns

A value x where

x <  0       if this.size <  otherSize
x == 0       if this.size == otherSize
x >  0       if this.size >  otherSize

The method as implemented here does not call size directly; its running time is O(size min otherSize) instead of O(size). The method should be overridden if computing size is cheap and knownSize returns -1.

See also
Inherited from:
IterableOps
Source
Iterable.scala
final def sizeHint(coll: IterableOnce[_], delta: Int): Unit

Gives a hint that the result of this builder is expected to have the same size as the given collection, plus some delta.

Gives a hint that the result of this builder is expected to have the same size as the given collection, plus some delta.

This method provides a hint only if the collection has a known size, as specified by the following pseudocode:

if (coll.knownSize != -1)
  if (coll.knownSize + delta <= 0) sizeHint(0)
  else sizeHint(coll.knownSize + delta)

If the delta is negative and the result size is known to be negative, then the size hint is issued at zero.

Some builder classes will optimize their representation based on the hint. However, builder implementations are required to work correctly even if the hint is wrong, i.e., if a different number of elements is added.

Value parameters

coll

the collection which serves as a hint for the result's size.

delta

a correction to add to the coll.size to produce the size hint (zero if omitted).

Attributes

Inherited from:
Builder
Source
Builder.scala
def sizeHint(size: Int): Unit

Gives a hint how many elements are expected to be added in total by the time result is called.

Gives a hint how many elements are expected to be added in total by the time result is called.

Some builder classes will optimize their representation based on the hint. However, builder implementations are required to work correctly even if the hint is wrong, e.g., a different number of elements is added, or the hint is out of range.

The default implementation simply ignores the hint.

Value parameters

size

the hint how many elements will be added.

Attributes

Inherited from:
Builder
Source
Builder.scala
final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Value parameters

boundingColl

the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

size

the hint how many elements will be added.

Attributes

Inherited from:
Builder
Source
Builder.scala
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

Attributes

Inherited from:
IterableOps
Source
Iterable.scala
def slice(from: Int, until: Int): BitSet

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.

Value parameters

from

the lowest index to include from this iterable collection.

until

the lowest index to EXCLUDE from this iterable collection.

Attributes

Returns

a iterable collection containing the elements greater than or equal to index from extending up to (but not including) index until of this iterable collection.

Inherited from:
IterableOps
Source
Iterable.scala
def sliding(size: Int, step: Int): Iterator[BitSet]

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.)

The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

Value parameters

size

the number of elements per group

step

the distance between the first elements of successive groups

Attributes

Returns

An iterator producing iterable collections of size size, except the last element (which may be the only element) will be smaller if there are fewer than size elements remaining to be grouped.

See also

scala.collection.Iterator, method sliding

Example

List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))

List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))

Inherited from:
IterableOps
Source
Iterable.scala
def sliding(size: Int): Iterator[BitSet]

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.)

An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

Value parameters

size

the number of elements per group

Attributes

Returns

An iterator producing iterable collections of size size, except for a non-empty collection with less than size elements, which returns an iterator that produces the source collection itself as its only element.

See also

scala.collection.Iterator, method sliding

Example

List().sliding(2) = empty iterator

List(1).sliding(2) = Iterator(List(1))

List(1, 2).sliding(2) = Iterator(List(1, 2))

List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))

Inherited from:
IterableOps
Source
Iterable.scala

The companion object of this sorted set, providing various factory methods.

The companion object of this sorted set, providing various factory methods.

Attributes

Note

When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

Definition Classes
Inherited from:
SortedSet
Source
SortedSet.scala
override def span(p: Int => Boolean): (BitSet, BitSet)

Splits this iterable collection into a prefix/suffix pair according to a predicate.

Splits this iterable collection into a prefix/suffix pair according to a predicate.

Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

p

the test predicate

Attributes

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
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
override def splitAt(n: Int): (BitSet, BitSet)

Splits this iterable collection into a prefix/suffix pair at a given position.

Splits this iterable collection into a prefix/suffix pair 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.

Value parameters

n

the position at which to split.

Attributes

Returns

a pair of iterable collections consisting of the first n elements of this iterable collection, and the other elements.

Definition Classes
Inherited from:
IterableOps
Source
Iterable.scala
override def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S & EfficientSplit

Returns a scala.collection.Stepper for the elements of this collection.

Returns a scala.collection.Stepper for the elements of this collection.

The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

Note that this method is overridden in subclasses and the return type is refined to S with EfficientSplit, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

Attributes

Definition Classes
Inherited from:
BitSetOps
Source
BitSet.scala

An iterator over all subsets of this set.

An iterator over all subsets of this set.

Attributes

Returns

the iterator.

Inherited from:
SetOps
Source
Set.scala
def subsets(len: Int): Iterator[BitSet]

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.

Value parameters

len

the size of the subsets.

Attributes

Returns

the iterator.

Inherited from:
SetOps
Source
Set.scala
def sum[B >: Int](implicit num: Numeric[B]): B

Sums the elements of this collection.

Sums the elements of this collection.

The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

Note: will not terminate for infinite-sized collections.

Type parameters

B

the result type of the + operator.

Value parameters

num

an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

Attributes

Returns

the sum of all elements of this collection with respect to the + operator in num.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def tail: BitSet

The rest of the collection without its first element.

The rest of the collection without its first element.

Attributes

Inherited from:
IterableOps
Source
Iterable.scala

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.

Attributes

Returns

an iterator over all the tails of this iterable collection

Example

List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

Inherited from:
IterableOps
Source
Iterable.scala
def take(n: Int): BitSet

Selects the first n elements.

Selects the first n elements.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

n

the number of elements to take from this iterable collection.

Attributes

Returns

a iterable collection consisting only of the first n elements of this iterable collection, or else the whole iterable collection, if it has less than n elements. If n is negative, returns an empty iterable collection.

Inherited from:
IterableOps
Source
Iterable.scala
override def takeRight(n: Int): BitSet

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.

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def takeWhile(p: Int => Boolean): BitSet

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.

Value parameters

p

The predicate used to test elements.

Attributes

Returns

the longest prefix of this iterable collection whose elements all satisfy the predicate p.

Inherited from:
IterableOps
Source
Iterable.scala
override def tapEach[U](f: Int => U): BitSet

Applies a side-effecting function to each element in this collection.

Applies a side-effecting function to each element in this collection. Strict collections will apply f to their elements immediately, while lazy collections like Views and LazyLists will only apply f on each element if and when that element is evaluated, and each time that element is evaluated.

Type parameters

U

the return type of f

Value parameters

f

a function to apply to each element in this iterable collection

Attributes

Returns

The same logical collection as this

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def to[C1](factory: Factory[Int, C1]): C1

Given a collection factory factory, converts this collection to the appropriate representation for the current element type A.

Given a collection factory factory, converts this collection to the appropriate representation for the current element type A. Example uses:

xs.to(List)
xs.to(ArrayBuffer)
xs.to(BitSet) // for xs: Iterable[Int]

Attributes

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def toArray[B >: Int : ClassTag]: Array[B]

Converts this collection to an Array.

Converts this collection to an Array.

Implementation note: DO NOT call Array.from from this method.

Type parameters

B

The type of elements of the result, a supertype of A.

Attributes

Returns

This collection as an Array[B].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def toBuffer[B >: Int]: Buffer[B]

Converts this collection to a Buffer.

Converts this collection to a Buffer.

Type parameters

B

The type of elements of the result, a supertype of A.

Attributes

Returns

This collection as a Buffer[B].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala

Converts this collection to an IndexedSeq.

Converts this collection to an IndexedSeq.

Attributes

Returns

This collection as an IndexedSeq[A].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def toList: List[Int]

Converts this collection to a List.

Converts this collection to a List.

Attributes

Returns

This collection as a List[A].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def toMap[K, V](implicit ev: Int <:< (K, V)): Map[K, V]

Converts this collection to a Map, given an implicit coercion from the collection's type to a key-value tuple.

Converts this collection to a Map, given an implicit coercion from the collection's type to a key-value tuple.

Type parameters

K

The key type for the resulting map.

V

The value type for the resulting map.

Value parameters

ev

An implicit coercion from A to [K, V].

Attributes

Returns

This collection as a Map[K, V].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def toSeq: Seq[Int]

Attributes

Returns

This collection as a Seq[A]. This is equivalent to to(Seq) but might be faster.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def toSet[B >: Int]: Set[B]

Converts this collection to a Set.

Converts this collection to a Set.

Type parameters

B

The type of elements of the result, a supertype of A.

Attributes

Returns

This collection as a Set[B].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Inherited from:
Set
Source
Set.scala

Converts this collection to a Vector.

Converts this collection to a Vector.

Attributes

Returns

This collection as a Vector[A].

Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def transpose[B](implicit asIterable: Int => 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.

Type parameters

B

the type of the elements of each iterable collection.

Value parameters

asIterable

an implicit conversion which asserts that the element type of this iterable collection is an Iterable.

Attributes

Returns

a two-dimensional iterable collection of iterable collections which has as nth row the nth column of this iterable collection.

Throws

IllegalArgumentException if all collections in this iterable collection are not of the same size.

Inherited from:
IterableOps
Source
Iterable.scala
final def union(that: Set[Int]): BitSet

Computes the union between of set and another set.

Computes the union between of set and another set.

Value parameters

that

the set to form the union with.

Attributes

Returns

a new set consisting of all elements that are in this set or in the given set that.

Inherited from:
SetOps
Source
Set.scala
override def unzip[A1, A2](implicit asPair: Int => (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))

Type parameters

A1

the type of the first half of the element pairs

A2

the type of the second half of the element pairs

Value parameters

asPair

an implicit conversion which asserts that the element type of this iterable collection is a pair.

Attributes

Returns

a pair of iterable collections, containing the first, respectively second half of each element pair of this iterable collection.

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
override def unzip3[A1, A2, A3](implicit asTriple: Int => (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))

Type parameters

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

Value parameters

asTriple

an implicit conversion which asserts that the element type of this iterable collection is a triple.

Attributes

Returns

a triple of iterable collections, containing the first, second, respectively third member of each element triple of this iterable collection.

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def update(elem: Int, included: Boolean): Unit

Updates the presence of a single element in this set.

Updates the presence of a single element in this set.

This method allows one to add or remove an element elem from this set depending on the value of parameter included. Typically, one would use the following syntax:

set(elem) = true  // adds element
set(elem) = false // removes element

Value parameters

elem

the element to be added or removed

included

a flag indicating whether element should be included or excluded.

Attributes

Inherited from:
SetOps
Source
Set.scala
def view: View[Int]

A view over the elements of this collection.

A view over the elements of this collection.

Attributes

Inherited from:
IterableOps
Source
Iterable.scala
override def withFilter(p: Int => Boolean): WithFilter[Int, Set, SortedSet]

Creates a non-strict filter of this set.

Creates a non-strict filter of this set.

Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

Note: might return different results for different runs, unless the underlying collection type is ordered.

Value parameters

p

the predicate used to test elements.

Attributes

Returns

an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this set which satisfy the predicate p.

Definition Classes
Inherited from:
SortedSetFactoryDefaults
Source
Iterable.scala
def xor(other: BitSet): BitSet

Computes the symmetric difference of this bitset and another bitset by performing a bitwise "exclusive-or".

Computes the symmetric difference of this bitset and another bitset by performing a bitwise "exclusive-or".

Value parameters

other

the other bitset to take part in the symmetric difference.

Attributes

Returns

a bitset containing those bits of this bitset or the other bitset that are not contained in both bitsets.

Inherited from:
BitSetOps
Source
BitSet.scala
override def zip[B](that: IterableOnce[B]): Set[(Int, 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.

Type parameters

B

the type of the second half of the returned pairs

Value parameters

that

The iterable providing the second half of each result pair

Attributes

Returns

a new iterable collection containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection and that.

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
def zipAll[A1 >: Int, B](that: 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.

Value parameters

that

the iterable providing the second half of each result pair

thatElem

the element to be used to fill up the result if that is shorter than this iterable collection.

thisElem

the element to be used to fill up the result if this iterable collection is shorter than that.

Attributes

Returns

a new collection of the type of this iterable collection containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the maximum of the lengths of this iterable collection and that. If this iterable collection is shorter than that, thisElem values are used to pad the result. If that is shorter than this iterable collection, thatElem values are used to pad the result.

Inherited from:
IterableOps
Source
Iterable.scala
override def zipWithIndex: Set[(Int, Int)]

Zips this iterable collection with its indices.

Zips this iterable collection with its indices.

Attributes

Returns

A new iterable collection containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at 0.

Example

List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

Definition Classes
Inherited from:
StrictOptimizedIterableOps
Source
StrictOptimizedIterableOps.scala
final def |(that: Set[Int]): BitSet

Alias for union

Alias for union

Attributes

Inherited from:
SetOps
Source
Set.scala

Deprecated and Inherited methods

def +(elem1: Int, elem2: Int, elems: Int*): BitSet

Attributes

Deprecated
true
Inherited from:
SetOps
Source
Set.scala
def +(elem: Int): BitSet

Attributes

Deprecated
true
Inherited from:
SetOps
Source
Set.scala
def ++:[B >: Int](that: IterableOnce[B]): Set[B]

Attributes

Deprecated
true
Inherited from:
IterableOps
Source
Iterable.scala
final def +=(elem1: Int, elem2: Int, elems: Int*): Growable.this.type

Adds two or more elements to this growable collection.

Adds two or more elements to this growable collection.

Value parameters

elem1

the first element to add.

elem2

the second element to add.

elems

the remaining elements to add.

Attributes

Returns

the growable collection itself

Deprecated
true
Inherited from:
Growable
Source
Growable.scala
def -(elem1: Int, elem2: Int, elems: Int*): BitSet

Attributes

Deprecated
true
Inherited from:
SetOps
Source
Set.scala
def -(elem: Int): BitSet

Attributes

Deprecated
true
Inherited from:
SetOps
Source
Set.scala
def --(that: IterableOnce[Int]): BitSet

Attributes

Deprecated
true
Inherited from:
SetOps
Source
Set.scala
def -=(elem1: Int, elem2: Int, elems: Int*): Shrinkable.this.type

Removes two or more elements from this shrinkable collection.

Removes two or more elements from this shrinkable collection.

Value parameters

elem1

the first element to remove.

elem2

the second element to remove.

elems

the remaining elements to remove.

Attributes

Returns

the shrinkable collection itself

Deprecated
true
Inherited from:
Shrinkable
Source
Shrinkable.scala
final def /:[B](z: B)(op: (B, Int) => B): B

Attributes

Deprecated
true
Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def :\[B](z: B)(op: (Int, B) => B): B

Attributes

Deprecated
true
Inherited from:
IterableOnceOps
Source
IterableOnce.scala
def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B

Aggregates the results of applying an operator to subsequent elements.

Aggregates the results of applying an operator to subsequent elements.

Since this method degenerates to foldLeft for sequential (non-parallel) collections, where the combining operation is ignored, it is advisable to prefer foldLeft for that case.

For parallel collections, use the aggregate method specified by scala.collection.parallel.ParIterableLike.

Type parameters

B

the result type, produced by seqop, combop, and by this function as a final result.

Value parameters

combop

an associative operator for combining sequential results, unused for sequential collections.

seqop

the binary operator used to accumulate the result.

z

the start value, a neutral element for seqop.

Attributes

Deprecated
true
Inherited from:
IterableOnceOps
Source
IterableOnce.scala

Attributes

Deprecated
true
Inherited from:
IterableOps
Source
Iterable.scala
def compare(k0: Int, k1: Int): Int

Comparison function that orders keys.

Comparison function that orders keys.

Attributes

Deprecated
true
Inherited from:
SortedOps
Source
SortedOps.scala
final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

Attributes

Deprecated
true
Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def from(from: Int): BitSet

Creates a ranged projection of this collection with no upper-bound.

Creates a ranged projection of this collection with no upper-bound.

Value parameters

from

The lower-bound (inclusive) of the ranged projection.

Attributes

Deprecated
true
Inherited from:
SortedOps
Source
SortedOps.scala

Tests whether this collection is known to have a finite size.

Tests whether this collection is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

Attributes

Returns

true if this collection is known to have finite size, false otherwise.

See also

method knownSize for a more useful alternative

Deprecated

This method is deprecated in 2.13 because it does not provide any actionable information. As noted above, even the collection library itself does not use it. When there is no guarantee that a collection is finite, it is generally best to attempt a computation anyway and document that it will not terminate for infinite collections rather than backing out because this would prevent performing the computation on collections that are in fact finite even though hasDefiniteSize returns false.

Inherited from:
IterableOnceOps
Source
IterableOnce.scala

Attributes

Deprecated
true
Inherited from:
SortedSetOps
Source
SortedSet.scala
final def repr: BitSet

Attributes

Deprecated
true
Inherited from:
IterableOps
Source
Iterable.scala
final def retain(p: Int => Boolean): Unit

Attributes

Deprecated
true
Inherited from:
SetOps
Source
Set.scala
def seq: Iterable.this.type

Attributes

Deprecated
true
Inherited from:
Iterable
Source
Iterable.scala
final def to(to: Int): BitSet

Create a range projection of this collection with no lower-bound.

Create a range projection of this collection with no lower-bound.

Value parameters

to

The upper-bound (inclusive) of the ranged projection.

Attributes

Deprecated
true
Inherited from:
SortedOps
Source
SortedOps.scala
final def toIterable: Iterable.this.type

Attributes

Returns

This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

Deprecated
true
Inherited from:
Iterable
Source
Iterable.scala
final def toIterator: Iterator[Int]

Attributes

Deprecated
true
Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def toStream: Stream[Int]

Attributes

Deprecated
true
Inherited from:
IterableOnceOps
Source
IterableOnce.scala
final def toTraversable: Iterable[Int]

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.

Attributes

Returns

An Iterable containing all elements of this iterable collection.

Deprecated
true
Inherited from:
IterableOps
Source
Iterable.scala
final def until(until: Int): BitSet

Creates a ranged projection of this collection with no lower-bound.

Creates a ranged projection of this collection with no lower-bound.

Value parameters

until

The upper-bound (exclusive) of the ranged projection.

Attributes

Deprecated
true
Inherited from:
SortedOps
Source
SortedOps.scala
def view(from: Int, until: Int): View[Int]

A view over a slice of the elements of this collection.

A view over a slice of the elements of this collection.

Attributes

Deprecated
true
Inherited from:
IterableOps
Source
Iterable.scala