Scala Standard Library 2.13.16 - scala.collection.immutable.BitSet.BitSetN
Keywords: Scala Standard Library 2.13.16 scala.collection.immutable.BitSet.BitSetN

Scala Standard Library2.13.16 < Back


# Packages

-  package root

  This is the documentation for the Scala standard library.

  This is the documentation for the Scala standard library.

  #### Package structure

  The scala package contains core types like `Int`, `Float`, `Array` or `Option` which are accessible in all Scala compilation units without explicit qualification or imports.

  Notable packages include:

  - `scala.collection` and its sub-packages contain Scala's collections framework
    - `scala.collection.immutable` - Immutable, sequential data-structures such as `Vector`, `List`, `Range`, `HashMap` or `HashSet`
    - `scala.collection.mutable` - Mutable, sequential data-structures such as `ArrayBuffer`, `StringBuilder`, `HashMap` or `HashSet`
    - `scala.collection.concurrent` - Mutable, concurrent data-structures such as `TrieMap`
  - `scala.concurrent` - Primitives for concurrent programming such as `Futures` and `Promises`
  - `scala.io` - Input and output operations
  - `scala.math` - Basic math functions and additional numeric types like `BigInt` and `BigDecimal`
  - `scala.sys` - Interaction with other processes and the operating system
  - `scala.util.matching` - Regular expressions

  Other packages exist. See the complete list on the right.

  Additional parts of the standard library are shipped as separate libraries. These include:

  - `scala.reflect` - Scala's reflection API (scala-reflect.jar)
  - `scala.xml` - XML parsing, manipulation, and serialization (scala-xml.jar)
  - `scala.collection.parallel` - Parallel collections (scala-parallel-collections.jar)
  - `scala.util.parsing` - Parser combinators (scala-parser-combinators.jar)
  - `scala.swing` - A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)

  #### Automatic imports

  Identifiers in the scala package and the `scala.Predef` object are always in scope by default.

  Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example, `List` is an alias for `scala.collection.immutable.List`.

  Other aliases refer to classes provided by the underlying platform. For example, on the JVM, `String` is an alias for `java.lang.String`.

  Definition Classes
    root
-  package scala

  Core Scala types.

  Core Scala types. They are always available without an explicit import.

  Definition Classes
    root
-  package collection
  Definition Classes
    scala
-  package immutable
  Definition Classes
    collection
-  object BitSet extends SpecificIterableFactory[Int, BitSet] with java.io.Serializable

  This object provides a set of operations to create `immutable.BitSet` values.

  This object provides a set of operations to create `immutable.BitSet` values.

  Definition Classes
    immutable
  Annotations
    @nowarn() @SerialVersionUID()
- BitSet1
- BitSet2
- BitSetN

c

scala.collection.immutable.BitSet

# BitSetN

###

#### class BitSetN extends BitSet

Annotations
  @deprecated
Deprecated

  (Since version 2.13.0) Implementation classes of BitSet should not be accessed directly

Source
  BitSet.scala

Linear Supertypes
BitSet, java.io.Serializable, collection.BitSet, BitSetOps[BitSet], StrictOptimizedSortedSetOps[Int, SortedSet, BitSet], StrictOptimizedSetOps[Int, Set, BitSet], collection.StrictOptimizedSortedSetOps[Int, SortedSet, BitSet], collection.StrictOptimizedSetOps[Int, [_]Set[_], BitSet], StrictOptimizedIterableOps[Int, [_]Set[_], BitSet], SortedSet[Int], SortedSetOps[Int, SortedSet, BitSet], collection.SortedSet[Int], SortedSetFactoryDefaults[Int, [X]SortedSet[X], [x]Set[x]], collection.SortedSetOps[Int, [X]SortedSet[X], BitSet], SortedOps[Int, BitSet], AbstractSet[Int], Set[Int], SetOps[Int, Set, BitSet], Iterable[Int], collection.AbstractSet[Int], collection.Set[Int], Equals, collection.SetOps[Int, [_]Set[_], BitSet], (Int) => Boolean, AbstractIterable[Int], collection.Iterable[Int], IterableFactoryDefaults[Int, [x]Set[x]], IterableOps[Int, [_]Set[_], BitSet], IterableOnceOps[Int, [_]Set[_], BitSet], IterableOnce[Int], AnyRef, Any
Type Hierarchy

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. BitSetN
2. BitSet
3. Serializable
4. BitSet
5. BitSetOps
6. StrictOptimizedSortedSetOps
7. StrictOptimizedSetOps
8. StrictOptimizedSortedSetOps
9. StrictOptimizedSetOps
10. StrictOptimizedIterableOps
11. SortedSet
12. SortedSetOps
13. SortedSet
14. SortedSetFactoryDefaults
15. SortedSetOps
16. SortedOps
17. AbstractSet
18. Set
19. SetOps
20. Iterable
21. AbstractSet
22. Set
23. Equals
24. SetOps
25. Function1
26. AbstractIterable
27. Iterable
28. IterableFactoryDefaults
29. IterableOps
30. IterableOnceOps
31. IterableOnce
32. AnyRef
33. Any

Implicitly

1. by iterableOnceExtensionMethods
2. by any2stringadd
3. by StringFormat
4. by Ensuring
5. by ArrowAssoc

1. Hide All
2. Show All

Visibility

1. Public
2. Protected

### Instance Constructors

1.  new BitSetN(elems: Array[Long])

### Value Members

1.  final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     AnyRef → Any
2.  final def ##: Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any
3.  final def &(that: collection.Set[Int]): BitSet

   Alias for `intersect`

   Alias for `intersect`

   Definition Classes
     SetOps
   Annotations
     @inline()
4.  final def &~(that: collection.Set[Int]): BitSet

   Alias for `diff`

   Alias for `diff`

   Definition Classes
     SetOps
   Annotations
     @inline()
5.  final def +(elem: Int): BitSet

   Alias for `incl`

   Alias for `incl`

   Definition Classes
     SetOps → SetOps
6.  final def ++(that: IterableOnce[Int]): BitSet

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     SetOps
   Annotations
     @inline()
7.  final def ++[B >: Int](suffix: IterableOnce[B]): Set[B]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     IterableOps
   Annotations
     @inline()
8.  final def -(elem: Int): BitSet

   Alias for `excl`

   Alias for `excl`

   Definition Classes
     SetOps → SetOps
   Annotations
     @inline()
9.  final def --(that: IterableOnce[Int]): BitSet

   Alias for removedAll

   Alias for removedAll

   Definition Classes
     SetOps → SetOps
10.  def ->[B](y: B): (BitSetN, B)
    Implicit
      This member is added by an implicit conversion from BitSetN toArrowAssoc[BitSetN] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
    Annotations
      @inline()
11.  final def ==(arg0: Any): Boolean

    The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      AnyRef → Any
12.  final def ^(other: collection.BitSet): BitSet
    Definition Classes
      BitSetOps
    Annotations
      @inline()
13.  final def addString(b: mutable.StringBuilder): b.type

    Appends all elements of this immutable bitset to a string builder.

    Appends all elements of this immutable bitset to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this immutable bitset without any separator string.

    Example:

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

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

        scala> val h = a.addString(b)
        h: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
14.  final def addString(b: mutable.StringBuilder, sep: String): b.type

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

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

    Example:

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

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

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

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
15.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type

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

    Appends all elements of this immutable bitset 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 immutable bitset are separated by the string `sep`.

    Example:

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

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

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

    b

      the string builder to which elements are appended.

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      IterableOnceOps
16.  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.

    A

      the result type of function `g`

    g

      a function R => A

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()
17.  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.

    elem

      the element to test for membership.

    returns

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

    Definition Classes
      SetOps → Function1
    Annotations
      @inline()
18.  final def asInstanceOf[T0]: T0

    Forces the compiler to treat the receiver object as having type `T0`, even though doing so may violate type safety.

    Forces the compiler to treat the receiver object as having type `T0`, even though doing so may violate type safety.

    This method is useful when you believe you have type information the compiler doesn't, and it also isn't possible to check the type at runtime. In such situations, skipping type safety is the only option.

    It is platform dependent whether `asInstanceOf` has any effect at runtime. It might do a runtime type test on the erasure of `T0`, insert a conversion (such as boxing/unboxing), fill in a default value, or do nothing at all.

    In particular, `asInstanceOf` is not a type test. It does **not** mean:

        this match {
         case x: T0 => x
         case _     => throw ClassCastException("...")

    Use pattern matching or isInstanceOf for type testing instead.

    Situations where `asInstanceOf` is useful:

    - when flow analysis fails to deduce `T0` automatically
    - when down-casting a type parameter or an abstract type member (which cannot be checked at runtime due to type erasure) If there is any doubt and you are able to type test instead, you should do so.

    Be careful of using `asInstanceOf` when `T0` is a primitive type. When `T0` is primitive, `asInstanceOf` may insert a conversion instead of a type test. If your intent is to convert, use a `toT` method (`x.toChar`, `x.toByte`, etc.).

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

      `ClassCastException` if the receiver is not an instance of the erasure of `T0`, if that can be checked on this platform

19.  def bitSetFactory: BitSet.type
    Definition Classes
      BitSet → BitSetOps
20.  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.

    that

      the value being probed for possible equality

    returns

      true if this instance can possibly equal `that`, otherwise false

    Definition Classes
      Set → Equals
21.  def className: String

    Defines the prefix of this object's `toString` representation.

    Defines the prefix of this object's `toString` representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for `ListMap` this method should return `"ListMap"`, not `"Map"` (the supertype) or `"Node"` (an implementation subclass).

    The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".

    returns

      a string representation which starts the result of `toString` applied to this immutable bitset. By default the string prefix is the simple name of the collection class immutable bitset.

    Attributes
      protected[this]
    Definition Classes
      Iterable
22.  def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws(classOf[java.lang.CloneNotSupportedException]) @native()
    Note

      not specified by SLS as a member of AnyRef

23.  final def coll: BitSetN.this.type

    returns

      This collection as a `C`.

    Attributes
      protected
    Definition Classes
      Iterable → IterableOps
24.  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 immutable bitset on which the function is defined.

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

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the immutable bitset.

    returns

      a new immutable 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
      BitSet → StrictOptimizedSortedSetOps → SortedSetOps
25.  def collect(pf: PartialFunction[Int, Int]): BitSet
    Definition Classes
      BitSet → BitSetOps
26.  def collect[B](pf: PartialFunction[Int, B]): Set[B]

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

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

    B

      the element type of the returned immutable bitset.

    pf

      the partial function which filters and maps the immutable bitset.

    returns

      a new immutable 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
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
27.  def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

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

    Finds the first element of the immutable bitset 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.

    pf

      the partial function

    returns

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

    Definition Classes
      IterableOnceOps
    Example:

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

28.  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.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()
29.  def concat(other: IterableOnce[Int]): BitSet

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

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

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

    Example:

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

    returns

      a new immutable bitset with the given elements added, omitting duplicates.

    Definition Classes
      BitSetOps → SetOps
30.  def concat[B >: Int](suffix: IterableOnce[B]): Set[B]

    Returns a new immutable bitset containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new immutable bitset containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the immutable bitset is the most specific superclass encompassing the element types of the two operands.

    B

      the element type of the returned collection.

    suffix

      the iterable to append.

    returns

      a new immutable bitset which contains all elements of this immutable bitset followed by all elements of `suffix`.

    Definition Classes
      IterableOps
31.  def contains(elem: Int): Boolean
    Definition Classes
      BitSetOps → SetOps
32.  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 immutable bitset.

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

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index of xs.

    len

      the maximal number of elements to copy.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Note

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

33.  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 immutable bitset.

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

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index of xs.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

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

34.  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 immutable bitset.

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

    B

      the type of the elements of the array.

    xs

      the array to fill.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

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

35.  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.

    B

      the type of the elements of `that`

    that

      the other collection

    p

      the test predicate, which relates elements from both collections

    returns

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

    Definition Classes
      IterableOnceOps
36.  def count(p: (Int) => Boolean): Int

    Counts the number of elements in the immutable bitset which satisfy a predicate.

    Counts the number of elements in the immutable bitset which satisfy a predicate.

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      IterableOnceOps
37.  def diff(that: collection.Set[Int]): BitSet

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

      the set of elements to exclude.

    returns

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

    Definition Classes
      BitSetN → BitSetOps → SetOps → SetOps
38.  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.

    n

      the number of elements to drop from this immutable bitset.

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
39.  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.

    n

      the number of elements to drop from this immutable bitset.

    returns

      a immutable bitset consisting of all elements of this immutable bitset except the last `n` ones, or else the empty immutable bitset, if this immutable bitset has less than `n` elements. If `n` is negative, don't drop any elements.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps
40.  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 immutable bitset, 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 immutable bitset.

    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.

    p

      The predicate used to test elements.

    returns

      the longest suffix of this immutable bitset whose first element does not satisfy the predicate `p`.

    Definition Classes
      IterableOps → IterableOnceOps
41.  val elems: Array[Long]
42.  def empty: BitSet

    The empty iterable of the same type as this iterable.

    The empty iterable of the same type as this iterable.

    returns

      an empty iterable of type `C`.

    Definition Classes
      BitSet → BitSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
43.  def ensuring(cond: (BitSetN) => Boolean, msg: => Any): BitSetN
    Implicit
      This member is added by an implicit conversion from BitSetN toEnsuring[BitSetN] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
44.  def ensuring(cond: (BitSetN) => Boolean): BitSetN
    Implicit
      This member is added by an implicit conversion from BitSetN toEnsuring[BitSetN] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
45.  def ensuring(cond: Boolean, msg: => Any): BitSetN
    Implicit
      This member is added by an implicit conversion from BitSetN toEnsuring[BitSetN] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
46.  def ensuring(cond: Boolean): BitSetN
    Implicit
      This member is added by an implicit conversion from BitSetN toEnsuring[BitSetN] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
47.  final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (`that`) is a reference to the receiver object (`this`).

    Tests whether the argument (`that`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

    - It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
    - For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
    - `null.eq(null)` returns `true`.

    When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

    returns

      `true` if the argument is a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef
48.  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

    that

      The set to which this set is compared

    returns

      `true` if the two sets are equal according to the description

    Definition Classes
      SortedSet → Set → Equals → AnyRef → Any
49.  def excl(elem: Int): BitSet

    Creates a new set with a given element removed from this set.

    Creates a new set with a given element removed from this set.

    elem

      the element to be removed

    returns

      a new set that contains all elements of this set but that does not contain `elem`.

    Definition Classes
      BitSet → SetOps
50.  def exists(p: (Int) => Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
51.  def filter(pred: (Int) => Boolean): BitSet

    Selects all elements of this immutable bitset which satisfy a predicate.

    Selects all elements of this immutable bitset which satisfy a predicate.

    returns

      a new immutable bitset consisting of all elements of this immutable bitset that satisfy the given predicate `p`. The order of the elements is preserved.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
52.  def filterImpl(pred: (Int) => Boolean, isFlipped: Boolean): BitSet
    Definition Classes
      BitSetN → StrictOptimizedIterableOps
53.  def filterNot(pred: (Int) => Boolean): BitSet

    Selects all elements of this immutable bitset which do not satisfy a predicate.

    Selects all elements of this immutable bitset which do not satisfy a predicate.

    pred

      the predicate used to test elements.

    returns

      a new immutable bitset consisting of all elements of this immutable bitset that do not satisfy the given predicate `pred`. Their order may not be preserved.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
54.  def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws(classOf[java.lang.Throwable])
    Note

      not specified by SLS as a member of AnyRef

55.  def find(p: (Int) => Boolean): Option[Int]

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

    Finds the first element of the immutable bitset 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.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
56.  def firstKey: Int

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
      SortedSetOps → SortedOps
57.  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 immutable bitset and using the elements of the resulting collections.

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      BitSet → StrictOptimizedSortedSetOps → SortedSetOps
58.  def flatMap(f: (Int) => IterableOnce[Int]): BitSet
    Definition Classes
      BitSet → BitSetOps
59.  def flatMap[B](f: (Int) => IterableOnce[B]): Set[B]

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

    Builds a new immutable bitset by applying a function to all elements of this immutable bitset 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 immutable bitset. This might cause unexpected results sometimes. For example:

        // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
        def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

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

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

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
60.  def flatten[B](implicit toIterableOnce: (Int) => IterableOnce[B]): Set[B]

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

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

    The resulting collection's type will be guided by the type of immutable bitset. For example:

        val xs = List(
                   Set(1, 2, 3),
                   Set(1, 2, 3)
                 ).flatten
        // xs == List(1, 2, 3, 1, 2, 3)

        val ys = Set(
                   List(1, 2, 3),
                   List(3, 2, 1)
                 ).flatten
        // ys == Set(1, 2, 3)

    B

      the type of the elements of each iterable collection.

    returns

      a new immutable bitset resulting from concatenating all element immutable bitsets.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
61.  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 immutable bitset.

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

    For each application of the operator, each operand is either an element of this immutable bitset, 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.

    A1

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

    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.

    op

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

    returns

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

    Definition Classes
      IterableOnceOps
62.  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 immutable bitset, going left to right.

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

    "Going left to right" only makes sense if this collection is ordered: then if `x1`, `x2`, ..., `xn` are the elements of this immutable bitset, 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 immutable bitset 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.

    B

      The result type of the binary operator.

    z

      An initial value.

    op

      A binary operator.

    returns

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

    Definition Classes
      IterableOnceOps
63.  def foldRight[B](z: B)(op: (Int, B) => B): B

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

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

    "Going right to left" only makes sense if this collection is ordered: then if `x1`, `x2`, ..., `xn` are the elements of this immutable bitset, 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 immutable bitset 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.

    B

      The result type of the binary operator.

    z

      An initial value.

    op

      A binary operator.

    returns

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

    Definition Classes
      IterableOnceOps
64.  def forall(p: (Int) => Boolean): Boolean

    Tests whether a predicate holds for all elements of this immutable bitset.

    Tests whether a predicate holds for all elements of this immutable bitset.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
65.  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.

    Definition Classes
      BitSetOps → IterableOnceOps
66.  def fromBitMaskNoCopy(elems: Array[Long]): BitSet

    Creates a new set of this kind from an array of longs

    Creates a new set of this kind from an array of longs

    Attributes
      protected[collection]
    Definition Classes
      BitSet → BitSetOps
67.  def fromSpecific(coll: IterableOnce[Int]): BitSet

    Defines how to turn a given `Iterable[A]` into a collection of type `C`.

    Defines how to turn a given `Iterable[A]` into a collection of type `C`.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
      protected
    Definition Classes
      BitSet → BitSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
    Note

      When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

      ,

      As witnessed by the `@uncheckedVariance` annotation, using this method might be unsound. However, as long as it is called with an `Iterable[A]` obtained from `this` collection (as it is the case in the implementations of operations where we use a `View[A]`), it is safe.

68.  final def getClass(): Class[_ <: AnyRef]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

      a class object corresponding to the runtime type of the receiver.

    Definition Classes
      AnyRef → Any
    Annotations
      @native()
69.  def groupBy[K](f: (Int) => K): Map[K, BitSet]

    Partitions this immutable bitset into a map of immutable bitsets according to some discriminator function.

    Partitions this immutable bitset into a map of immutable bitsets according to some discriminator function.

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

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to immutable bitsets 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 immutable bitset of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      IterableOps
70.  def groupMap[K, B](key: (Int) => K)(f: (Int) => B): Map[K, Set[B]]

    Partitions this immutable bitset into a map of immutable bitsets according to a discriminator function `key`.

    Partitions this immutable bitset into a map of immutable bitsets according to a discriminator function `key`. Each element in a group is transformed into a value of type `B` using the `value` function.

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

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

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

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

    K

      the type of keys returned by the discriminator function

    B

      the type of values returned by the transformation function

    key

      the discriminator function

    f

      the element transformation function

    Definition Classes
      IterableOps
71.  def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): Map[K, B]

    Partitions this immutable bitset into a map according to a discriminator function `key`.

    Partitions this immutable bitset 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.

    Definition Classes
      IterableOps
72.  def grouped(size: Int): Iterator[BitSet]

    Partitions elements in fixed size immutable bitsets.

    Partitions elements in fixed size immutable bitsets.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableOps
    See also

      scala.collection.Iterator, method `grouped`

73.  def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

      the hash code value for this object.

    Definition Classes
      Set → AnyRef → Any
74.  def head: Int

    Selects the first element of this immutable bitset.

    Selects the first element of this immutable bitset.

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

    returns

      the first element of this immutable bitset.

    Definition Classes
      IterableOps
    Exceptions thrown

      `NoSuchElementException` if the immutable bitset is empty.

75.  def headOption: Option[Int]

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

      the first element of this immutable bitset if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
76.  def incl(elem: Int): BitSet

    Creates a new set with an additional element, unless the element is already present.

    Creates a new set with an additional element, unless the element is already present.

    elem

      the element to be added

    returns

      a new set that contains all elements of this set and that also contains `elem`.

    Definition Classes
      BitSet → SetOps
77.  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.

    Definition Classes
      IterableOps
78.  def inits: Iterator[BitSet]

    Iterates over the inits of this immutable bitset.

    Iterates over the inits of this immutable bitset. The first value will be this immutable bitset and the final one will be an empty immutable bitset, 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.

    returns

      an iterator over all the inits of this immutable bitset

    Definition Classes
      IterableOps
    Example:

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

79.  def intersect(other: collection.Set[Int]): BitSet

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    returns

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

    Definition Classes
      BitSetOps → SetOps
80.  def isEmpty: Boolean

    Tests whether the immutable bitset is empty.

    Tests whether the immutable bitset 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.

    returns

      `true` if the immutable bitset contains no elements, `false` otherwise.

    Definition Classes
      BitSetOps → IterableOnceOps
81.  final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Depending on what `T0` is, the test is done in one of the below ways:

    - `T0` is a non-parameterized class type, e.g. `BigDecimal`: this method returns `true` if the value of the receiver object is a `BigDecimal` or a subtype of `BigDecimal`.
    - `T0` is a parameterized class type, e.g. `List[Int]`: this method returns `true` if the value of the receiver object is some `List[X]` for any `X`. For example, `List(1, 2, 3).isInstanceOf[List[String]]` will return true.
    - `T0` is some singleton type `x.type` or literal `x`: this method returns `this.eq(x)`. For example, `x.isInstanceOf[1]` is equivalent to `x.eq(1)`
    - `T0` is an intersection `X with Y` or `X & Y: this method is equivalent to` x.isInstanceOf[X] && x.isInstanceOf[Y]``
    - `T0` is a union `X | Y`: this method is equivalent to `x.isInstanceOf[X] || x.isInstanceOf[Y]`
    - `T0` is a type parameter or an abstract type member: this method is equivalent to `isInstanceOf[U]` where `U` is `T0`'s upper bound, `Any` if `T0` is unbounded. For example, `x.isInstanceOf[A]` where `A` is an unbounded type parameter will return true for any value of `x`.

    This is exactly equivalent to the type pattern `_: T0`

    returns

      `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

    Definition Classes
      Any
    Note

      due to the unexpectedness of `List(1, 2, 3).isInstanceOf[List[String]]` returning true and `x.isInstanceOf[A]` where `A` is a type parameter or abstract member returning true, these forms issue a warning.

82.  def isTraversableAgain: Boolean

    Tests whether this immutable bitset can be repeatedly traversed.

    Tests whether this immutable bitset can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

      `true` if it is repeatedly traversable, `false` otherwise.

    Definition Classes
      IterableOps → IterableOnceOps
83.  def iterableFactory: IterableFactory[Set]

    The companion object of this immutable bitset, providing various factory methods.

    The companion object of this immutable bitset, providing various factory methods.

    Definition Classes
      Set → Set → Iterable → Iterable → IterableOps
    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).

84.  def iterator: Iterator[Int]

    An scala.collection.Iterator over the elements of this immutable bitset.

    An scala.collection.Iterator over the elements of this immutable bitset.

    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.

    Definition Classes
      BitSetOps → IterableOnce
85.  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

    start

      The lower-bound (inclusive) of the iterator

    Definition Classes
      BitSetOps → SortedSetOps
86.  def knownSize: Int

    The number of elements in this immutable bitset, if it can be cheaply computed, -1 otherwise.

    The number of elements in this immutable bitset, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
      IterableOnce
87.  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.

    returns

      The last element of this immutable bitset.

    Definition Classes
      IterableOps
    Exceptions thrown

      `NoSuchElementException` If the immutable bitset is empty.

88.  def lastKey: Int

    Returns the last key of the collection.

    Returns the last key of the collection.

    Definition Classes
      SortedSetOps → SortedOps
89.  def lastOption: Option[Int]

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

      the last element of this immutable bitset$ if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
90.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Int, B, BitSetN.this.type]

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

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

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

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

    B

      the type of the second element in each eventual pair

    that

      the iterable providing the second element of each eventual pair

    returns

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

    Definition Classes
      Iterable
91.  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 immutable bitset.

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      BitSet → StrictOptimizedSortedSetOps → SortedSetOps
92.  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

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      BitSet → BitSetOps
93.  def map[B](f: (Int) => B): Set[B]

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

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

    B

      the element type of the returned immutable bitset.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
94.  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.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      the largest element of this immutable bitset with respect to the ordering `ord`.

    Definition Classes
      BitSetOps → SortedSetOps → IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this immutable bitset is empty.

95.  def maxBefore(key: Int): Option[Int]

    Find the largest element less than a given key.

    Find the largest element less than a given key.

    key

      The given key.

    returns

      `None` if there is no such node.

    Definition Classes
      SortedSetOps
96.  def maxBy[B](f: (Int) => B)(implicit ord: math.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.

    B

      The result type of the function `f`.

    f

      The measuring function.

    returns

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

    Definition Classes
      IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this immutable bitset is empty.

97.  def maxByOption[B](f: (Int) => B)(implicit ord: math.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.

    B

      The result type of the function `f`.

    f

      The measuring function.

    returns

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

    Definition Classes
      IterableOnceOps
98.  def maxOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]

    Finds the largest element.

    Finds the largest element.

    Note: will not terminate for infinite-sized collections.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      an option value containing the largest element of this immutable bitset with respect to the ordering `ord`.

    Definition Classes
      IterableOnceOps
99.  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.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      the smallest element of this immutable bitset with respect to the ordering `ord`.

    Definition Classes
      BitSetOps → SortedSetOps → IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this immutable bitset is empty.

100.  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.

     key

       The given key.

     returns

       `None` if there is no such node.

     Definition Classes
       SortedSetOps
101.  def minBy[B](f: (Int) => B)(implicit ord: math.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.

     B

       The result type of the function `f`.

     f

       The measuring function.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable bitset is empty.

102.  def minByOption[B](f: (Int) => B)(implicit ord: math.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.

     B

       The result type of the function `f`.

     f

       The measuring function.

     returns

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

     Definition Classes
       IterableOnceOps
103.  def minOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]

     Finds the smallest element.

     Finds the smallest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       an option value containing the smallest element of this immutable bitset with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
104.  final def mkString: String

     Displays all elements of this immutable bitset in a string.

     Displays all elements of this immutable bitset in a string.

     Delegates to addString, which can be overridden.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
105.  final def mkString(sep: String): String

     Displays all elements of this immutable bitset in a string using a separator string.

     Displays all elements of this immutable bitset in a string using a separator string.

     Delegates to addString, which can be overridden.

     sep

       the separator string.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
     Example:

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

106.  final def mkString(start: String, sep: String, end: String): String

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

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

     Delegates to addString, which can be overridden.

     start

       the starting string.

     sep

       the separator string.

     end

       the ending string.

     returns

       a string representation of this immutable bitset. 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 immutable bitset are separated by the string `sep`.

     Definition Classes
       IterableOnceOps
     Example:

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

107.  final def ne(arg0: AnyRef): Boolean

     Equivalent to `!(this eq that)`.

     Equivalent to `!(this eq that)`.

     returns

       `true` if the argument is not a reference to the receiver object; `false` otherwise.

     Definition Classes
       AnyRef
108.  def newSpecificBuilder: Builder[Int, BitSet]

     returns

       a strict builder for the same collection type. Note that in the case of lazy collections (e.g. scala.collection.View or scala.collection.immutable.LazyList), it is possible to implement this method but the resulting `Builder` will break laziness. As a consequence, operations should preferably be implemented with `fromSpecific` instead of this method.

     Attributes
       protected
     Definition Classes
       BitSet → BitSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
     Note

       When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

       ,

       As witnessed by the `@uncheckedVariance` annotation, using this method might be unsound. However, as long as the returned builder is only fed with `A` values taken from `this` instance, it is safe.

109.  def nonEmpty: Boolean

     Tests whether the immutable bitset is not empty.

     Tests whether the immutable bitset is not empty.

     returns

       `true` if the immutable bitset contains at least one element, `false` otherwise.

     Definition Classes
       IterableOnceOps
     Annotations
       @deprecatedOverriding()
110.  final def notify(): Unit

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Definition Classes
       AnyRef
     Annotations
       @native()
     Note

       not specified by SLS as a member of AnyRef

111.  final def notifyAll(): Unit

     Wakes up all threads that are waiting on the receiver object's monitor.

     Wakes up all threads that are waiting on the receiver object's monitor.

     Definition Classes
       AnyRef
     Annotations
       @native()
     Note

       not specified by SLS as a member of AnyRef

112.  def nwords: Int

     The number of words (each with 64 bits) making up the set

     The number of words (each with 64 bits) making up the set

     Attributes
       protected[collection]
     Definition Classes
       BitSetN → BitSetOps
113.  final def ordering: Ordering[Int]
     Definition Classes
       BitSetOps → SortedOps
114.  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.

     The two immutable bitset correspond to the result of filter and filterNot, respectively.

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

     Definition Classes
       BitSetOps → IterableOps
115.  def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (Set[A1], Set[A2])

     Applies a function `f` to each element of the immutable bitset and returns a pair of immutable bitsets: 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 immutable bitset and returns a pair of immutable bitsets: 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 = `immutable.BitSet`(1, "one", 2, "two", 3, "three") partitionMap {
          case i: Int => Left(i)
          case s: String => Right(s)
         }
         // xs == (`immutable.BitSet`(1, 2, 3),
         //        `immutable.BitSet`(one, two, three))

     A1

       the element type of the first resulting collection

     A2

       the element type of the second resulting collection

     f

       the 'split function' mapping the elements of this immutable bitset to an scala.util.Either

     returns

       a pair of immutable bitsets: 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
       StrictOptimizedIterableOps → IterableOps
116.  def product[B >: Int](implicit num: math.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.

     B

       the result type of the `*` operator.

     num

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

     returns

       the product of all elements of this immutable bitset with respect to the `*` operator in `num`.

     Definition Classes
       IterableOnceOps
117.  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.

     from

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

     until

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

     Definition Classes
       SortedOps
118.  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.

     from

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

     Definition Classes
       SortedOps
119.  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.

     from

       The lower-bound (inclusive) of the ranged projection. `None` if there is no lower bound.

     until

       The upper-bound (exclusive) of the ranged projection. `None` if there is no upper bound.

     Definition Classes
       BitSetOps → SortedOps
120.  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.

     to

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

     Definition Classes
       SortedSetOps → SortedOps
121.  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.

     until

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

     Definition Classes
       SortedOps
122.  def reduce[B >: Int](op: (B, B) => B): B

     Applies the given binary operator `op` to all elements of this immutable bitset.

     Applies the given binary operator `op` to all elements of this immutable bitset.

     For each application of the operator, each operand is either an element of this immutable bitset 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.

     B

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

     op

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

     returns

       The result of applying `op` between all the elements if the immutable bitset is nonempty.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable bitset is empty.

123.  def reduceLeft[B >: Int](op: (B, Int) => B): B

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

     Applies the given binary operator `op` to all elements of this immutable bitset, 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 immutable bitset, 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 immutable bitset 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.

     B

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

     op

       A binary operator.

     returns

       The result of applying `op` to all elements of this immutable bitset, going left to right.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable bitset is empty.

124.  def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]

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

     If this immutable bitset 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 immutable bitset 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.

     B

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

     op

       A binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
125.  def reduceOption[B >: Int](op: (B, B) => B): Option[B]

     If this immutable bitset is nonempty, reduces it with the given binary operator `op`.

     If this immutable bitset 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 immutable bitset 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.

     B

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

     op

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

     returns

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

     Definition Classes
       IterableOnceOps
126.  def reduceRight[B >: Int](op: (Int, B) => B): B

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

     Applies the given binary operator `op` to all elements of this immutable bitset, 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 immutable bitset, 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 immutable bitset 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.

     B

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

     op

       A binary operator.

     returns

       The result of applying `op` to all elements of this immutable bitset, going right to left.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable bitset is empty.

127.  def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]

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

     If this immutable bitset 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 immutable bitset 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.

     B

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

     op

       A binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
128.  def removedAll(that: IterableOnce[Int]): BitSet

     Creates a new immutable bitset from this immutable bitset by removing all elements of another collection.

     Creates a new immutable bitset from this immutable bitset by removing all elements of another collection.

     that

       the collection containing the elements to remove.

     returns

       a new immutable bitset with the given elements removed, omitting duplicates.

     Definition Classes
       SetOps
129.  def reversed: collection.Iterable[Int]
     Attributes
       protected
     Definition Classes
       IterableOnceOps
130.  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.

     B

       element type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     returns

       a new immutable bitset containing the prefix scan of the elements in this immutable bitset

     Definition Classes
       IterableOps
131.  def scanLeft[B](z: B)(op: (B, Int) => B): Set[B]

     Produces a immutable bitset containing cumulative results of applying the operator going left to right, including the initial value.

     Produces a immutable bitset containing cumulative results of applying the operator going left to right, including the initial value.

     Note: will not terminate for infinite-sized collections.

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

     B

       the type of the elements in the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     returns

       collection with intermediate results

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
132.  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)

     B

       the type of the elements in the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     returns

       collection with intermediate results

     Definition Classes
       IterableOps
133.  def size: Int

     The size of this immutable bitset.

     The size of this immutable bitset.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this immutable bitset.

     Definition Classes
       BitSetOps → IterableOnceOps
134.  def sizeCompare(that: collection.Iterable[_]): Int

     Compares the size of this immutable bitset to the size of another `Iterable`.

     Compares the size of this immutable bitset to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this immutable bitset's size.

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

     Definition Classes
       IterableOps
135.  def sizeCompare(otherSize: Int): Int

     Compares the size of this immutable bitset to a test value.

     Compares the size of this immutable bitset to a test value.

     otherSize

       the test value that gets compared with the size.

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

     Definition Classes
       IterableOps
     See also

       sizeIs

136.  final def sizeIs: SizeCompareOps

     Returns a value class containing operations for comparing the size of this immutable bitset to a test value.

     Returns a value class containing operations for comparing the size of this immutable bitset to a test value.

     These operations are implemented in terms of `sizeCompare(Int)`, and allow the following more readable usages:

         this.sizeIs < size     // this.sizeCompare(size) < 0
         this.sizeIs <= size    // this.sizeCompare(size) <= 0
         this.sizeIs == size    // this.sizeCompare(size) == 0
         this.sizeIs != size    // this.sizeCompare(size) != 0
         this.sizeIs >= size    // this.sizeCompare(size) >= 0
         this.sizeIs > size     // this.sizeCompare(size) > 0

     Definition Classes
       IterableOps
     Annotations
       @inline()
137.  def slice(from: Int, until: Int): BitSet

     Selects an interval of elements.

     Selects an interval of elements. The returned immutable bitset is made up of all elements `x` which satisfy the invariant:

         from <= indexOf(x) < until

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

     from

       the lowest index to include from this immutable bitset.

     until

       the lowest index to EXCLUDE from this immutable bitset.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
138.  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.

     size

       the number of elements per group

     step

       the distance between the first elements of successive groups

     returns

       An iterator producing immutable bitsets 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.

     Definition Classes
       IterableOps
     Examples:

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

     ,

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

     See also

       scala.collection.Iterator, method `sliding`

139.  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.

     size

       the number of elements per group

     returns

       An iterator producing immutable bitsets 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.

     Definition Classes
       IterableOps
     Examples:

     1. `List().sliding(2) = empty iterator`

     ,

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

     ,

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

     ,

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

     See also

       scala.collection.Iterator, method `sliding`

140.  def sortedIterableFactory: SortedIterableFactory[SortedSet]

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

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

     Definition Classes
       SortedSet → SortedSet → SortedSetOps
     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).

141.  def span(p: (Int) => Boolean): (BitSet, BitSet)

     Splits this immutable bitset into a prefix/suffix pair according to a predicate.

     Splits this immutable bitset into a prefix/suffix pair according to a predicate.

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

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

     p

       the test predicate

     returns

       a pair consisting of the longest prefix of this immutable bitset whose elements all satisfy `p`, and the rest of this immutable bitset.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
142.  def splitAt(n: Int): (BitSet, BitSet)

     Splits this immutable bitset into a prefix/suffix pair at a given position.

     Splits this immutable bitset 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.

     n

       the position at which to split.

     returns

       a pair of immutable bitsets consisting of the first `n` elements of this immutable bitset, and the other elements.

     Definition Classes
       IterableOps → IterableOnceOps
143.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S with 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.

     - For collections of `Int`, `Short`, `Byte` or `Char`, an scala.collection.IntStepper is returned
     - For collections of `Double` or `Float`, a scala.collection.DoubleStepper is returned
     - For collections of `Long` a scala.collection.LongStepper is returned
     - For any other element type, an scala.collection.AnyStepper is returned

     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.

     Definition Classes
       BitSetOps → IterableOnce
144.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Int, B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     pf

       Element transformation partial function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
145.  final def strictOptimizedConcat[B >: Int, C2](that: IterableOnce[B], b: Builder[B, C2]): C2

     B

       Type of elements of the resulting collections (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     that

       Elements to concatenate to this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
146.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Int) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
147.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Int) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     b

       Builder to use to build the resulting collection

     toIterableOnce

       Evidence that `A` can be seen as an `IterableOnce[B]`

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
148.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Int) => B): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
149.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(Int, B), C2]): C2

     B

       Type of elements of the second collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[(Int, String)]`)

     that

       Collection to zip with this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
150.  def stringPrefix: String
     Attributes
       protected[this]
     Definition Classes
       BitSet → SortedSet → Set → Iterable
     Annotations
       @nowarn()
151.  def subsetOf(that: collection.Set[Int]): Boolean

     Tests whether this set is a subset of another set.

     Tests whether this set is a subset of another set.

     that

       the set to test.

     returns

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

     Definition Classes
       SetOps
152.  def subsets(): Iterator[BitSet]

     An iterator over all subsets of this set.

     An iterator over all subsets of this set.

     returns

       the iterator.

     Definition Classes
       SetOps
153.  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.

     len

       the size of the subsets.

     returns

       the iterator.

     Definition Classes
       SetOps
154.  def sum[B >: Int](implicit num: math.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.

     B

       the result type of the `+` operator.

     num

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

     returns

       the sum of all elements of this immutable bitset with respect to the `+` operator in `num`.

     Definition Classes
       IterableOnceOps
155.  final def synchronized[T0](arg0: => T0): T0

     Executes the code in `body` with an exclusive lock on `this`.

     Executes the code in `body` with an exclusive lock on `this`.

     returns

       the result of `body`

     Definition Classes
       AnyRef
156.  def tail: BitSet

     The rest of the collection without its first element.

     The rest of the collection without its first element.

     Definition Classes
       IterableOps
157.  def tails: Iterator[BitSet]

     Iterates over the tails of this immutable bitset.

     Iterates over the tails of this immutable bitset. The first value will be this immutable bitset and the final one will be an empty immutable bitset, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this immutable bitset

     Definition Classes
       IterableOps
     Example:

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

158.  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.

     n

       the number of elements to take from this immutable bitset.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
159.  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.

     n

       the number of elements to take from this immutable bitset.

     returns

       a immutable bitset consisting only of the last `n` elements of this immutable bitset, or else the whole immutable bitset, if it has less than `n` elements. If `n` is negative, returns an empty immutable bitset.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
160.  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.

     p

       The predicate used to test elements.

     returns

       the longest prefix of this immutable bitset whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableOps → IterableOnceOps
161.  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.

     U

       the return type of f

     f

       a function to apply to each element in this immutable bitset

     returns

       The same logical collection as this

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
162.  def to[C1](factory: Factory[Int, C1]): C1

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

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

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

     Definition Classes
       IterableOnceOps
163.  def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]

     Converts this immutable bitset to an `Array`.

     Converts this immutable bitset to an `Array`.

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

     B

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

     returns

       This immutable bitset as an `Array[B]`.

     Definition Classes
       IterableOnceOps
164.  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

     Definition Classes
       BitSetN → BitSetOps
165.  final def toBuffer[B >: Int]: Buffer[B]

     Converts this immutable bitset to a `Buffer`.

     Converts this immutable bitset to a `Buffer`.

     B

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

     returns

       This immutable bitset as a `Buffer[B]`.

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
166.  def toIndexedSeq: IndexedSeq[Int]

     Converts this immutable bitset to an `IndexedSeq`.

     Converts this immutable bitset to an `IndexedSeq`.

     returns

       This immutable bitset as an `IndexedSeq[A]`.

     Definition Classes
       IterableOnceOps
167.  def toList: List[Int]

     Converts this immutable bitset to a `List`.

     Converts this immutable bitset to a `List`.

     returns

       This immutable bitset as a `List[A]`.

     Definition Classes
       IterableOnceOps
168.  def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]

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

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

     K

       The key type for the resulting map.

     V

       The value type for the resulting map.

     ev

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

     returns

       This immutable bitset as a `Map[K, V]`.

     Definition Classes
       IterableOnceOps
169.  def toSeq: Seq[Int]

     returns

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

     Definition Classes
       IterableOnceOps
170.  def toSet[B >: Int]: Set[B]

     Converts this immutable bitset to a `Set`.

     Converts this immutable bitset to a `Set`.

     B

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

     returns

       This immutable bitset as a `Set[B]`.

     Definition Classes
       IterableOnceOps
171.  def toString(): String

     Creates a String representation of this object.

     Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

     returns

       a String representation of the object.

     Definition Classes
       Set → Function1 → Iterable → AnyRef → Any
172.  def toVector: Vector[Int]

     Converts this immutable bitset to a `Vector`.

     Converts this immutable bitset to a `Vector`.

     returns

       This immutable bitset as a `Vector[A]`.

     Definition Classes
       IterableOnceOps
173.  def transpose[B](implicit asIterable: (Int) => collection.Iterable[B]): Set[Set[B]]

     Transposes this immutable bitset of iterable collections into a immutable bitset of immutable bitsets.

     Transposes this immutable bitset of iterable collections into a immutable bitset of immutable bitsets.

     The resulting collection's type will be guided by the static type of immutable bitset. For example:

         val xs = List(
                    Set(1, 2, 3),
                    Set(4, 5, 6)).transpose
         // xs == List(
         //         List(1, 4),
         //         List(2, 5),
         //         List(3, 6))

         val ys = Vector(
                    List(1, 2, 3),
                    List(4, 5, 6)).transpose
         // ys == Vector(
         //         Vector(1, 4),
         //         Vector(2, 5),
         //         Vector(3, 6))

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

     B

       the type of the elements of each iterable collection.

     asIterable

       an implicit conversion which asserts that the element type of this immutable bitset is an `Iterable`.

     returns

       a two-dimensional immutable bitset of immutable bitsets which has as nth row the nth column of this immutable bitset.

     Definition Classes
       IterableOps
     Exceptions thrown

       `IllegalArgumentException` if all collections in this immutable bitset are not of the same size.

174.  final def union(that: collection.Set[Int]): BitSet

     Computes the union between of set and another set.

     Computes the union between of set and another set.

     that

       the set to form the union with.

     returns

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

     Definition Classes
       SetOps
     Annotations
       @inline()
175.  def unsorted: Set[Int]
     Definition Classes
       BitSet → BitSet → BitSetOps → SortedSet → SortedSetOps → SortedSet → SortedSetOps
176.  def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (Set[A1], Set[A2])

     Converts this immutable bitset of pairs into two collections of the first and second half of each pair.

     Converts this immutable bitset of pairs into two collections of the first and second half of each pair.

         val xs = `immutable.BitSet`(
                    (1, "one"),
                    (2, "two"),
                    (3, "three")).unzip
         // xs == (`immutable.BitSet`(1, 2, 3),
         //        `immutable.BitSet`(one, two, three))

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

       an implicit conversion which asserts that the element type of this immutable bitset is a pair.

     returns

       a pair of immutable bitsets, containing the first, respectively second half of each element pair of this immutable bitset.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
177.  def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

     Converts this immutable bitset of triples into three collections of the first, second, and third element of each triple.

     Converts this immutable bitset of triples into three collections of the first, second, and third element of each triple.

         val xs = `immutable.BitSet`(
                    (1, "one", '1'),
                    (2, "two", '2'),
                    (3, "three", '3')).unzip3
         // xs == (`immutable.BitSet`(1, 2, 3),
         //        `immutable.BitSet`(one, two, three),
         //        `immutable.BitSet`(1, 2, 3))

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

       an implicit conversion which asserts that the element type of this immutable bitset is a triple.

     returns

       a triple of immutable bitsets, containing the first, second, respectively third member of each element triple of this immutable bitset.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
178.  def updateWord(idx: Int, w: Long): BitSet

     Update word at index `idx`; enlarge set if `idx` outside range of set.

     Update word at index `idx`; enlarge set if `idx` outside range of set.

     Attributes
       protected[collection]
     Definition Classes
       BitSetN → BitSet
179.  def view: View[Int]

     A view over the elements of this collection.

     A view over the elements of this collection.

     Definition Classes
       IterableOps
180.  final def wait(): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

181.  final def wait(arg0: Long, arg1: Int): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

182.  final def wait(arg0: Long): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException]) @native()
     Note

       not specified by SLS as a member of AnyRef

183.  def withFilter(p: (Int) => Boolean): SortedSetOps.WithFilter[Int, [x]Set[x], [X]SortedSet[X]]

     Creates a non-strict filter of this immutable bitset.

     Creates a non-strict filter of this immutable bitset.

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

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

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       SortedSetFactoryDefaults → IterableOps
184.  def word(idx: Int): Long

     The words at index `idx`, or 0L if outside the range of the set Note: requires `idx >= 0`

     The words at index `idx`, or 0L if outside the range of the set Note: requires `idx >= 0`

     Attributes
       protected[collection]
     Definition Classes
       BitSetN → BitSetOps
185.  def writeReplace(): AnyRef
     Attributes
       protected[this]
     Definition Classes
       BitSet
186.  def xor(other: collection.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".

     other

       the other bitset to take part in the symmetric difference.

     returns

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

     Definition Classes
       BitSetOps
187.  def zip[B](that: scala.IterableOnce[B])(implicit ev: Ordering[(Int, B)]): SortedSet[(Int, B)]

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

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

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

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

     Definition Classes
       BitSet → StrictOptimizedSortedSetOps → SortedSetOps
188.  def zip[B](that: IterableOnce[B]): Set[(Int, B)]

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

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

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
189.  def zipAll[A1 >: Int, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]

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

     Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

     that

       the iterable providing the second half of each result pair

     thisElem

       the element to be used to fill up the result if this immutable bitset is shorter than `that`.

     thatElem

       the element to be used to fill up the result if `that` is shorter than this immutable bitset.

     returns

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

     Definition Classes
       IterableOps
190.  def zipWithIndex: Set[(Int, Int)]

     Zips this immutable bitset with its indices.

     Zips this immutable bitset with its indices.

     returns

       A new immutable bitset containing pairs consisting of all elements of this immutable bitset paired with their index. Indices start at `0`.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
     Example:

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

191.  final def |(that: collection.Set[Int]): BitSet

     Alias for `union`

     Alias for `union`

     Definition Classes
       SetOps
     Annotations
       @inline()

### Shadowed Implicit Value Members

1.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from BitSetN toany2stringadd[BitSetN] performed by method any2stringadd in scala.Predef.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (bitSetN: any2stringadd[BitSetN]).+(other)

   Definition Classes
     any2stringadd

### Deprecated Value Members

1.  def +(elem1: Int, elem2: Int, elems: Int*): BitSet
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

2.  def ++:[B >: Int](that: IterableOnce[B]): Set[B]
   Definition Classes
     IterableOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

3.  def -(elem1: Int, elem2: Int, elems: Int*): BitSet
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

4.  def /:[B](z: B)(op: (B, Int) => B): B
   Implicit
     This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (bitSetN: IterableOnceExtensionMethods[Int])./:(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldLeft instead

5.  final def /:[B](z: B)(op: (B, Int) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldLeft instead of /:

6.  def :\[B](z: B)(op: (Int, B) => B): B
   Implicit
     This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (bitSetN: IterableOnceExtensionMethods[Int]).:\(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldRight instead

7.  final def :\[B](z: B)(op: (Int, B) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldRight instead of :\

8.  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`.

   B

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

   z

     the start value, a neutral element for `seqop`.

   seqop

     the binary operator used to accumulate the result.

   combop

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

   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) For sequential collections, prefer `foldLeft(z)(seqop)`. For parallel collections, use `ParIterableLike#aggregate`.

9.  def collectFirst[B](f: PartialFunction[Int, B]): Option[B]
   Implicit
     This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (bitSetN: IterableOnceExtensionMethods[Int]).collectFirst(f)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use .iterator.collectFirst(...) instead

10.  def companion: IterableFactory[[_]Set[_]]
    Definition Classes
      IterableOps
    Annotations
      @deprecated @deprecatedOverriding() @inline()
    Deprecated

      (Since version 2.13.0) Use iterableFactory instead

11.  def compare(k0: Int, k1: Int): Int

    Comparison function that orders keys.

    Comparison function that orders keys.

    Definition Classes
      SortedOps
    Annotations
      @deprecated @deprecatedOverriding() @inline()
    Deprecated

      (Since version 2.13.0) Use ordering.compare instead

12.  def copyToBuffer(dest: Buffer[Int]): Unit
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).copyToBuffer(dest)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

13.  final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `dest ++= coll` instead

14.  def count(f: (Int) => Boolean): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).count(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.count(...) instead

15.  def exists(f: (Int) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).exists(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.exists(...) instead

16.  def filter(f: (Int) => Boolean): Iterator[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).filter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.filter(...) instead

17.  def find(p: (Int) => Boolean): Option[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).find(p)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.find instead

18.  def flatMap[B](f: (Int) => IterableOnce[B]): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).flatMap(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

19.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).fold(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.fold instead

20.  def foldLeft[B](z: B)(op: (B, Int) => B): B
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).foldLeft(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldLeft instead

21.  def foldRight[B](z: B)(op: (Int, B) => B): B
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).foldRight(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldRight instead

22.  def forall(f: (Int) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).forall(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.forall(...) instead

23.  def foreach[U](f: (Int) => U): Unit
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).foreach(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foreach(...) instead

24.  def formatted(fmtstr: String): String

    Returns string formatted according to given `format` string.

    Returns string formatted according to given `format` string. Format strings are as for `String.format` (@see java.lang.String.format).

    Implicit
      This member is added by an implicit conversion from BitSetN toStringFormat[BitSetN] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.12.16) Use `formatString.format(value)` instead of `value.formatted(formatString)`, or use the `f""` string interpolator. In Java 15 and later, `formatted` resolves to the new method in String which has reversed parameters.

25.  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.

    from

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

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeFrom

26.  def hasDefiniteSize: Boolean

    Tests whether this immutable bitset is known to have a finite size.

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

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

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

      method `knownSize` for a more useful alternative

27.  def isEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).isEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.isEmpty instead

28.  def keysIteratorFrom(start: Int): Iterator[Int]
    Definition Classes
      SortedSetOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `iteratorFrom` instead.

29.  def map[B](f: (Int) => B): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).map(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

30.  def max(implicit ord: math.Ordering[Int]): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).max(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.max instead

31.  def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).maxBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.maxBy(...) instead

32.  def min(implicit ord: math.Ordering[Int]): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).min(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.min instead

33.  def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).minBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.minBy(...) instead

34.  def mkString: String
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).mkString

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

35.  def mkString(sep: String): String
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).mkString(sep)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

36.  def mkString(start: String, sep: String, end: String): String
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).mkString(start, sep, end)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

37.  def nonEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).nonEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.nonEmpty instead

38.  def product(implicit num: math.Numeric[Int]): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).product(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.product instead

39.  def reduce(f: (Int, Int) => Int): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).reduce(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduce(...) instead

40.  def reduceLeft(f: (Int, Int) => Int): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).reduceLeft(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

41.  def reduceLeftOption(f: (Int, Int) => Int): Option[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).reduceLeftOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

42.  def reduceOption(f: (Int, Int) => Int): Option[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).reduceOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceOption(...) instead

43.  def reduceRight(f: (Int, Int) => Int): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).reduceRight(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRight(...) instead

44.  def reduceRightOption(f: (Int, Int) => Int): Option[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).reduceRightOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

45.  final def repr: BitSet
    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

46.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sameElements instead

47.  def seq: BitSetN.this.type
    Definition Classes
      Iterable
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Iterable.seq always returns the iterable itself

48.  def size: Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).size

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.size instead

49.  def sum(implicit num: math.Numeric[Int]): Int
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).sum(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sum instead

50.  def to[C1](factory: Factory[Int, C1]): C1
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).to(factory)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(factory) instead

51.  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.

    to

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

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeTo

52.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toArray(arg0)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toArray

53.  def toBuffer[B >: A]: Buffer[B]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toBuffer

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

54.  def toIndexedSeq: collection.IndexedSeq[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toIndexedSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toIndexedSeq instead

55.  final def toIterable: collection.Iterable[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toIterable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

56.  final def toIterable: BitSetN.this.type

    returns

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

    Definition Classes
      Iterable → IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

57.  def toIterator: Iterator[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toIterator

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead

58.  final def toIterator: Iterator[Int]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead of .toIterator

59.  def toList: List[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toList

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(List) instead

60.  def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toMap(ev)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Map) instead

61.  def toSeq: Seq[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Seq) instead

62.  def toSet[B >: A]: Set[B]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toSet

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Set) instead

63.  def toStream: Stream[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toStream

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(LazyList) instead

64.  final def toStream: Stream[Int]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .to(LazyList) instead of .toStream

65.  final def toTraversable: collection.Traversable[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toTraversable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

66.  final def toTraversable: collection.Traversable[Int]

    Converts this immutable bitset to an unspecified Iterable.

    Converts this immutable bitset to an unspecified Iterable. Will return the same collection if this instance is already Iterable.

    returns

      An Iterable containing all elements of this immutable bitset.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

67.  def toVector: Vector[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).toVector

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Vector) instead

68.  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.

    until

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

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeUntil

69.  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.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

70.  def withFilter(f: (Int) => Boolean): Iterator[Int]
    Implicit
      This member is added by an implicit conversion from BitSetN toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (bitSetN: IterableOnceExtensionMethods[Int]).withFilter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.withFilter(...) instead

71.  def →[B](y: B): (BitSetN, B)
    Implicit
      This member is added by an implicit conversion from BitSetN toArrowAssoc[BitSetN] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use `->` instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

### Inherited from BitSet

### Inherited from java.io.Serializable

### Inherited from collection.BitSet

### Inherited from BitSetOps[BitSet]

### Inherited from StrictOptimizedSortedSetOps[Int, SortedSet, BitSet]

### Inherited from StrictOptimizedSetOps[Int, Set, BitSet]

### Inherited from collection.StrictOptimizedSortedSetOps[Int, SortedSet, BitSet]

### Inherited from collection.StrictOptimizedSetOps[Int, [_]Set[_], BitSet]

### Inherited from StrictOptimizedIterableOps[Int, [_]Set[_], BitSet]

### Inherited from SortedSet[Int]

### Inherited from SortedSetOps[Int, SortedSet, BitSet]

### Inherited from collection.SortedSet[Int]

### Inherited from SortedSetFactoryDefaults[Int, [X]SortedSet[X], [x]Set[x]]

### Inherited from collection.SortedSetOps[Int, [X]SortedSet[X], BitSet]

### Inherited from SortedOps[Int, BitSet]

### Inherited from AbstractSet[Int]

### Inherited from Set[Int]

### Inherited from SetOps[Int, Set, BitSet]

### Inherited from Iterable[Int]

### Inherited from collection.AbstractSet[Int]

### Inherited from collection.Set[Int]

### Inherited from Equals

### Inherited from collection.SetOps[Int, [_]Set[_], BitSet]

### Inherited from (Int) => Boolean

### Inherited from AbstractIterable[Int]

### Inherited from collection.Iterable[Int]

### Inherited from IterableFactoryDefaults[Int, [x]Set[x]]

### Inherited from IterableOps[Int, [_]Set[_], BitSet]

### Inherited from IterableOnceOps[Int, [_]Set[_], BitSet]

### Inherited from IterableOnce[Int]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion iterableOnceExtensionMethods fromBitSetN to IterableOnceExtensionMethods[Int]

### Inherited by implicit conversion any2stringadd fromBitSetN to any2stringadd[BitSetN]

### Inherited by implicit conversion StringFormat fromBitSetN to StringFormat[BitSetN]

### Inherited by implicit conversion Ensuring fromBitSetN to Ensuring[BitSetN]

### Inherited by implicit conversion ArrowAssoc fromBitSetN to ArrowAssoc[BitSetN]

### Ungrouped