scala.collection

BitSet

trait BitSet extends Set[Int] with BitSetLike[BitSet]

A common base class for mutable and immutable bitsets.

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

Source
BitSet.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. BitSet
  2. BitSetLike
  3. Set
  4. SetLike
  5. Subtractable
  6. GenSet
  7. GenericSetTemplate
  8. GenSetLike
  9. Iterable
  10. IterableLike
  11. Equals
  12. GenIterable
  13. GenIterableLike
  14. Traversable
  15. GenTraversable
  16. GenericTraversableTemplate
  17. TraversableLike
  18. GenTraversableLike
  19. Parallelizable
  20. TraversableOnce
  21. GenTraversableOnce
  22. FilterMonadic
  23. HasNewBuilder
  24. Function1
  25. AnyRef
  26. Any
Visibility
  1. Public
  2. All

Type Members

  1. type Self = BitSet

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Abstract Value Members

  1. abstract def +(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
    SetLikeGenSetLike
  2. abstract def -(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
    SetLikeSubtractableGenSetLike
  3. abstract def fromArray(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
    Definition Classes
    BitSetLike
  4. abstract 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
    Definition Classes
    BitSetLike
  5. abstract 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
    Definition Classes
    BitSetLike

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    Any
  3. final def ##(): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. 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.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  4. def &(other: BitSet): BitSet

    Computes the intersection between this bitset and another bitset by performing a bitwise "and".

    Computes the intersection between this bitset and another bitset by performing a bitwise "and".

    returns

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

    Definition Classes
    BitSetLike
  5. def &(that: GenSet[Int]): BitSet

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    Note: Same as intersect.

    that

    the set to intersect with.

    returns

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

    Definition Classes
    GenSetLike
  6. def &~(other: BitSet): BitSet

    Computes the difference of this bitset and another bitset by performing a bitwise "and-not".

    Computes the difference of this bitset and another bitset by performing a bitwise "and-not".

    returns

    a bitset containing those bits of this bitset that are not also contained in the given bitset other.

    Definition Classes
    BitSetLike
  7. def &~(that: GenSet[Int]): BitSet

    The difference of this set and another set.

    The difference of this set and another set.

    Note: Same as diff.

    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
    GenSetLike
  8. def +(elem1: Int, elem2: Int, elems: Int*): BitSet

    Creates a new bitset with additional elements.

    Creates a new bitset with additional elements.

    This method takes two or more elements to be added. Another overloaded variant of this method handles the case where a single element is added.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new bitset with the given elements added.

    Definition Classes
    SetLike
  9. def ++(elems: GenTraversableOnce[Int]): BitSet

    Creates a new bitset by adding all elements contained in another collection to this bitset.

    Creates a new bitset by adding all elements contained in another collection to this bitset.

    elems

    the collection containing the added elements.

    returns

    a new bitset with the given elements added.

    Definition Classes
    SetLike
  10. abstract def ++[B](that: GenTraversableOnce[B]): BitSet[B]

    [use case] Returns a new bitset containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this bitset followed by all elements of that.

    Definition Classes
    GenTraversableLike
  11. def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[BitSet, B, That]): That

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

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

    Example:

        scala> val a = LinkedList(1)
        a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
        scala> val b = LinkedList(2)
        b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
        scala> val c = a ++ b
        c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
        scala> val d = LinkedList('a')
        d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
        scala> val e = c ++ d
        e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    
    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this bitset followed by all elements of that.

    Definition Classes
    TraversableLikeGenTraversableLike
  12. def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[BitSet, B, That]): That

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    Example:

        scala> val x = List(1)
        x: List[Int] = List(1)
    
        scala> val y = LinkedList(2)
        y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
        scala> val z = x ++: y
        z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    Since TraversableOnce has no ++ method, we have to implement that directly, but Traversable and down can use the overload.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new bitset which contains all elements of this bitset followed by all elements of that.

    Definition Classes
    TraversableLike
  13. abstract def ++:[B](that: TraversableOnce[B]): BitSet[B]

    [use case] Concatenates this bitset with the elements of a traversable collection.

    [use case]

    Concatenates this bitset with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this bitset followed by all elements of that.

    Definition Classes
    TraversableLike
  14. def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[BitSet, B, That]): That

    Concatenates this bitset with the elements of a traversable collection.

    Concatenates this bitset with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    Example:

        scala> val x = List(1)
        x: List[Int] = List(1)
    
        scala> val y = LinkedList(2)
        y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
        scala> val z = x ++: y
        z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this bitset followed by all elements of that.

    Definition Classes
    TraversableLike
  15. def -(elem1: Int, elem2: Int, elems: Int*): BitSet

    Creates a new bitset from this bitset with some elements removed.

    Creates a new bitset from this bitset with some elements removed.

    This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new bitset that contains all elements of the current bitset except one less occurrence of each of the given elements.

    Definition Classes
    Subtractable
  16. def --(xs: GenTraversableOnce[Int]): BitSet

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

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

    returns

    a new bitset that contains all elements of the current bitset except one less occurrence of each of the elements of elems.

    Definition Classes
    Subtractable
  17. def /:[B](z: B)(op: (B, Int) ⇒ B): B

    Applies a binary operator to a start value and all elements of this bitset, going left to right.

    Applies a binary operator to a start value and all elements of this bitset, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (5 /: a)(_+_)
         b: Int = 15
    
         scala> val c = (5 /: a)((x,y) => x + y)
         c: Int = 15
    

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this bitset, going left to right with the start value z on the left:

                op(...op(op(z, x1), x2), ..., xn)
    

    where x1, ..., xn are the elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  18. def /:\[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a /:\ 5)(_+_)
         b: Int = 15
    
    Definition Classes
    GenTraversableOnce
  19. def :\[B](z: B)(op: (Int, B) ⇒ B): B

    Applies a binary operator to all elements of this bitset and a start value, going right to left.

    Applies a binary operator to all elements of this bitset and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

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

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a :\ 5)(_+_)
         b: Int = 15
    
         scala> val c = (a :\ 5)((x,y) => x + y)
         c: Int = 15
    
    
    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this bitset, going right to left with the start value z on the right:

                op(x1, op(x2, ... op(xn, z)...))
    

    where x1, ..., xn are the elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  20. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Definition Classes
    Any
  22. def ^(other: BitSet): BitSet

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

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

    returns

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

    Definition Classes
    BitSetLike
  23. def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

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

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = new StringBuilder()
         b: StringBuilder =
    
         scala> a.addString(b, "LinkedList(", ", ", ")")
         res1: StringBuilder = LinkedList(1, 2, 3, 4)
    
    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    BitSetLikeTraversableOnce
  24. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this bitset to a string builder.

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

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = new StringBuilder()
         b: StringBuilder =
    
         scala> val h = a.addString(b)
         b: StringBuilder = 1234
    
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, sep: String): StringBuilder

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

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

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(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
    TraversableOnce
  26. 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.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    B

    the type of accumulated results

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  27. 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
  28. 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
    GenSetLikeFunction1
  29. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown
    ClassCastException

    if the receiver object is not an instance of the erasure of type T0.

  30. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this bitset should be compared

    returns

    true, if this bitset can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    IterableLikeEquals
  31. 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()
    Note

    not specified by SLS as a member of AnyRef

  32. abstract def collect[B](pf: PartialFunction[Int, B]): BitSet[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the bitset.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    GenTraversableLike
  33. def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[BitSet, B, That]): That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the bitset.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
  34. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

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

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

    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
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  35. def companion: GenericCompanion[Set]

    The factory companion object that builds instances of class BitSet.

    The factory companion object that builds instances of class BitSet. (or its Iterable superclass where class BitSet is not a Seq.)

    Definition Classes
    SetGenSetIterableGenIterableTraversableGenTraversableGenericTraversableTemplate
  36. 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
  37. def contains(elem: Int): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

    elem

    the element to test for membership.

    returns

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

    Definition Classes
    BitSetLikeSetLikeGenSetLike
  38. abstract def copyToArray(xs: Array[Int], start: Int, len: Int): Unit

    [use case] Copies elements of this bitset to an array.

    [use case]

    Copies elements of this bitset to an array. Fills the given array xs with at most len elements of this bitset, starting at position start. Copying will stop once either the end of the current bitset is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    TraversableLike
  39. def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this bitset to an array.

    Copies elements of this bitset to an array. Fills the given array xs with at most len elements of this bitset, starting at position start. Copying will stop once either the end of the current bitset is reached, 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.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  40. abstract def copyToArray(xs: Array[Int]): Unit

    [use case] Copies values of this bitset to an array.

    [use case]

    Copies values of this bitset to an array. Fills the given array xs with values of this bitset. Copying will stop once either the end of the current bitset is reached, or the end of the array is reached.

    xs

    the array to fill.

    Definition Classes
    GenTraversableOnce
  41. def copyToArray[B >: Int](xs: Array[B]): Unit

    Copies values of this bitset to an array.

    Copies values of this bitset to an array. Fills the given array xs with values of this bitset. Copying will stop once either the end of the current bitset is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
  42. abstract def copyToArray(xs: Array[Int], start: Int): Unit

    [use case] Copies values of this bitset to an array.

    [use case]

    Copies values of this bitset to an array. Fills the given array xs with values of this bitset, beginning at index start. Copying will stop once either the end of the current bitset is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    GenTraversableOnce
  43. def copyToArray[B >: Int](xs: Array[B], start: Int): Unit

    Copies values of this bitset to an array.

    Copies values of this bitset to an array. Fills the given array xs with values of this bitset, beginning at index start. Copying will stop once either the end of the current bitset is reached, 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.

    Definition Classes
    TraversableOnceGenTraversableOnce
  44. def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

    Copies all elements of this bitset to a buffer.

    Copies all elements of this bitset to a buffer.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  45. def count(p: (Int) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  46. def diff(that: GenSet[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
    SetLikeGenSetLike
  47. def drop(n: Int): BitSet

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

    the number of elements to drop from this bitset.

    returns

    a bitset consisting of all elements of this bitset except the first n ones, or else the empty bitset, if this bitset has less than n elements.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  48. def dropRight(n: Int): BitSet

    Selects all elements except last n ones.

    Selects all elements except last n ones.

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

    n

    The number of elements to take

    returns

    a bitset consisting of all elements of this bitset except the last n ones, or else the empty bitset, if this bitset has less than n elements.

    Definition Classes
    IterableLike
  49. def dropWhile(p: (Int) ⇒ Boolean): BitSet

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

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

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  50. def empty: BitSet

    The empty set of the same type as this set

    The empty set of the same type as this set

    returns

    an empty set of type This.

    Definition Classes
    BitSetBitSetLikeSetLikeGenericSetTemplate
  51. final def eq(arg0: AnyRef): Boolean

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

    Tests whether the argument (arg0) 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
  52. def equals(that: Any): Boolean

    Compares this set with another object for equality.

    Compares this set with another object for equality.

    Note: This operation contains an unchecked cast: if that is a set, it will assume with an unchecked cast that it has the same element type as this set. Any subsequent ClassCastException is treated as a false result.

    that

    the other object

    returns

    true if that is a set which contains the same elements as this set.

    Definition Classes
    GenSetLikeEquals → AnyRef → Any
  53. def exists(p: (Int) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this bitset.

    Tests whether a predicate holds for some of the elements of this bitset.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this bitset, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  54. def filter(p: (Int) ⇒ Boolean): BitSet

    Selects all elements of this bitset which satisfy a predicate.

    Selects all elements of this bitset which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  55. def filterNot(p: (Int) ⇒ Boolean): BitSet

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  56. 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()
    Note

    not specified by SLS as a member of AnyRef

  57. def find(p: (Int) ⇒ Boolean): Option[Int]

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

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

    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 bitset that satisfies p, or None if none exists.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  58. abstract def flatMap[B](f: (Int) ⇒ GenTraversableOnce[B]): BitSet[B]

    [use case] Builds a new collection by applying a function to all elements of this bitset and using the elements of the resulting collections.

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    GenTraversableLike
  59. def flatMap[B, That](f: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[BitSet, B, That]): That

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

    Builds a new collection by applying a function to all elements of this 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 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 => word.toSeq)
    
     // xs will be a 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.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
  60. abstract def flatten[B]: BitSet[B]

    [use case] Converts this bitset of traversable collections into a bitset formed by the elements of these traversable collections.

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

    a new bitset resulting from concatenating all element bitsets.

    Definition Classes
    GenericTraversableTemplate
  61. def fold[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this bitset using the specified associative binary operator.

    Folds the elements of this bitset using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

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

    z

    a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  62. def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

    Applies a binary operator to a start value and all elements of this bitset, going left to right.

    Applies a binary operator to a start value and all elements of this bitset, going left to right.

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this bitset, going left to right with the start value z on the left:

                op(...op(z, x1), x2, ..., xn)
    

    where x1, ..., xn are the elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  63. def foldRight[B](z: B)(op: (Int, B) ⇒ B): B

    Applies a binary operator to all elements of this bitset and a start value, going right to left.

    Applies a binary operator to all elements of this bitset and a start value, going right to left.

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this bitset, going right to left with the start value z on the right:

                op(x1, op(x2, ... op(xn, z)...))
    

    where x1, ..., xn are the elements of this bitset.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  64. def forall(p: (Int) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this bitset, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  65. abstract def foreach(f: (Int) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this bitset.

    [use case]

    Applies a function f to all elements of this bitset.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    Definition Classes
    IterableLike
  66. def foreach[B](f: (Int) ⇒ B): Unit

    Applies a function f to all elements of this bitset.

    Applies a function f to all elements of this bitset.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    Definition Classes
    BitSetLikeIterableLikeTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
  67. def genericBuilder[B]: Builder[B, Set[B]]

    The generic builder that builds instances of BitSet at arbitrary element types.

    The generic builder that builds instances of BitSet at arbitrary element types.

    Definition Classes
    GenericTraversableTemplate
  68. final def getClass(): java.lang.Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  69. def groupBy[K](f: (Int) ⇒ K): Map[K, BitSet]

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

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

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new bitset.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

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

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

    Definition Classes
    TraversableLikeGenTraversableLike
  70. def grouped(size: Int): Iterator[BitSet]

    Partitions elements in fixed size bitsets.

    Partitions elements in fixed size bitsets.

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

  71. def hasDefiniteSize: Boolean

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

    Tests whether this 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.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

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

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  72. def hashCode(): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    GenSetLike → AnyRef → Any
  73. def head: Int

    Selects the first element of this bitset.

    Selects the first element of this bitset.

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

    returns

    the first element of this bitset.

    Definition Classes
    IterableLikeGenIterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the bitset is empty.

  74. 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 bitset if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  75. def init: BitSet

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

    a bitset consisting of all elements of this bitset except the last one.

    Definition Classes
    TraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the bitset is empty.

  76. def inits: Iterator[BitSet]

    Iterates over the inits of this bitset.

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

    returns

    an iterator over all the inits of this bitset

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  77. def intersect(that: GenSet[Int]): BitSet

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

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

    Definition Classes
    GenSetLike
  78. def isEmpty: Boolean

    Tests if this set is empty.

    Tests if this set is empty.

    returns

    true if there is no element in the set, false otherwise.

    Definition Classes
    SetLikeIterableLikeGenIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  79. final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

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

    Definition Classes
    Any
  80. final def isTraversableAgain: Boolean

    Tests whether this bitset can be repeatedly traversed.

    Tests whether this bitset can be repeatedly traversed.

    returns

    true

    Definition Classes
    GenTraversableLikeGenTraversableOnce
  81. def iterator: Iterator[Int]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

    the new iterator

    Definition Classes
    BitSetLikeGenSetLikeIterableLikeGenIterableLike
  82. 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 bitset.

    Definition Classes
    TraversableLike
    Exceptions thrown
    NoSuchElementException

    If the bitset is empty.

  83. 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 bitset$ if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  84. abstract def map[B](f: (Int) ⇒ B): BitSet[B]

    [use case] Builds a new collection by applying a function to all elements of this bitset.

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    GenTraversableLike
  85. def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[BitSet, B, That]): That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

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

    Definition Classes
    SetLikeTraversableLikeGenTraversableLikeFilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  86. abstract def max: Int

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this bitset with respect to the ordering cmp.

    Definition Classes
    GenTraversableOnce
  87. def max[B >: Int](implicit cmp: Ordering[B]): Int

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this bitset with respect to the ordering cmp.

    Definition Classes
    TraversableOnceGenTraversableOnce
  88. def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

    Definition Classes
    TraversableOnceGenTraversableOnce
  89. abstract def min: Int

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this bitset with respect to the ordering cmp.

    Definition Classes
    GenTraversableOnce
  90. def min[B >: Int](implicit cmp: Ordering[B]): Int

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this bitset with respect to the ordering cmp.

    Definition Classes
    TraversableOnceGenTraversableOnce
  91. def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

    Definition Classes
    TraversableOnceGenTraversableOnce
  92. def mkString: String

    Displays all elements of this bitset in a string.

    Displays all elements of this bitset in a string.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  93. def mkString(sep: String): String

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

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

    sep

    the separator string.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  94. def mkString(start: String, sep: String, end: String): String

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  95. 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
  96. def newBuilder: Builder[Int, BitSet]

    A common implementation of newBuilder for all sets in terms of empty.

    A common implementation of newBuilder for all sets in terms of empty. Overridden for mutable sets in mutable.SetLike.

    Attributes
    protected[this]
    Definition Classes
    SetLikeTraversableLikeHasNewBuilder
  97. def nonEmpty: Boolean

    Tests whether the bitset is not empty.

    Tests whether the bitset is not empty.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  98. 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
    Note

    not specified by SLS as a member of AnyRef

  99. 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
    Note

    not specified by SLS as a member of AnyRef

  100. def par: ParSet[Int]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  101. def parCombiner: Combiner[Int, ParSet[Int]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    SetLikeTraversableLikeParallelizable
  102. def partition(p: (Int) ⇒ Boolean): (BitSet, BitSet)

    Partitions this bitset in two bitsets according to a predicate.

    Partitions this bitset in two bitsets according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of bitsets: the first bitset consists of all elements that satisfy the predicate p and the second bitset consists of all elements that don't. The relative order of the elements in the resulting bitsets is the same as in the original bitset.

    Definition Classes
    TraversableLikeGenTraversableLike
  103. abstract def product: Int

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    Definition Classes
    GenTraversableOnce
  104. def product[B >: Int](implicit num: Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    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 bitset with respect to the * operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  105. def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this bitset using the specified associative binary operator.

    Reduces the elements of this bitset using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

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

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the bitset is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this bitset is empty.

  106. def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B

    Definition Classes
    TraversableOnce
  107. def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this bitset, going left to right.

    Optionally applies a binary operator to all elements of this bitset, going left to right.

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this bitset is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  108. def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]

    Reduces the elements of this bitset, if any, using the specified associative binary operator.

    Reduces the elements of this bitset, if any, using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

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

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  109. def reduceRight[B >: Int](op: (Int, B) ⇒ B): B

    Applies a binary operator to all elements of this bitset, going right to left.

    Applies a binary operator to all elements of this bitset, going right to left.

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this bitset, going right to left:

                op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x1, ..., xn are the elements of this bitset.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this bitset is empty.

  110. def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this bitset, going right to left.

    Optionally applies a binary operator to all elements of this bitset, going right to left.

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this bitset is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  111. def repr: BitSet

    The collection of type bitset underlying this TraversableLike object.

    The collection of type bitset underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    Definition Classes
    TraversableLikeGenTraversableLike
  112. def reversed: List[Int]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  113. abstract def sameElements(that: GenIterable[Int]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this bitset.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this bitset.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Definition Classes
    GenIterableLike
  114. def sameElements[B >: Int](that: GenIterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this bitset.

    Checks if the other iterable collection contains the same elements in the same order as this bitset.

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Definition Classes
    IterableLikeGenIterableLike
  115. def scan[B >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[BitSet, B, That]): That

    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

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  116. def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[BitSet, B, That]): That

    Produces a collection containing cummulative results of applying the operator going left to right.

    Produces a collection containing cummulative results of applying the operator going left to right.

    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

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  117. def scanRight[B, That](z: B)(op: (Int, B) ⇒ B)(implicit bf: CanBuildFrom[BitSet, B, That]): That

    Produces a collection containing cummulative results of applying the operator going right to left.

    Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  118. def seq: Set[Int]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    SetGenSetGenSetLikeIterableGenIterableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  119. def size: Int

    The size of this bitset.

    The size of this bitset.

    returns

    the number of elements in this bitset.

    Definition Classes
    BitSetLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  120. def slice(from: Int, until: Int): BitSet

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    

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

    from

    the lowest index to include from this bitset.

    until

    the highest index to EXCLUDE from this bitset.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  121. def sliding[B >: Int](size: Int, step: Int): Iterator[BitSet]

    Definition Classes
    IterableLike
  122. def sliding[B >: Int](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.)

    size

    the number of elements per group

    returns

    An iterator producing bitsets of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    Iterator#sliding

  123. def span(p: (Int) ⇒ Boolean): (BitSet, BitSet)

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

    Splits this 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 bitset whose elements all satisfy p, and the rest of this bitset.

    Definition Classes
    TraversableLikeGenTraversableLike
  124. def splitAt(n: Int): (BitSet, BitSet)

    Splits this bitset into two at a given position.

    Splits this bitset into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

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

    n

    the position at which to split.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  125. def stringPrefix: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this set. Unless overridden this is simply "Set".

    Definition Classes
    BitSetLikeSetLikeTraversableLikeGenTraversableLike
  126. def subsetOf(other: BitSet): Boolean

    Tests whether this bitset is a subset of another bitset.

    Tests whether this bitset is a subset of another bitset.

    returns

    true if this bitset is a subset of other, i.e. if every bit of this set is also an element in other.

    Definition Classes
    BitSetLike
  127. def subsetOf(that: GenSet[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
    GenSetLike
  128. 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
    SetLike
  129. 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
    SetLike
  130. abstract def sum: Int

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

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

    Definition Classes
    GenTraversableOnce
  131. def sum[B >: Int](implicit num: Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    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 bitset with respect to the + operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  132. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  133. def tail: BitSet

    Selects all elements except the first.

    Selects all elements except the first.

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

    returns

    a bitset consisting of all elements of this bitset except the first one.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the bitset is empty.

  134. def tails: Iterator[BitSet]

    Iterates over the tails of this bitset.

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

    returns

    an iterator over all the tails of this bitset

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  135. def take(n: Int): BitSet

    Selects first n elements.

    Selects first n elements.

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

    n

    Tt number of elements to take from this bitset.

    returns

    a bitset consisting only of the first n elements of this bitset, or else the whole bitset, if it has less than n elements.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  136. def takeRight(n: Int): BitSet

    Selects last n elements.

    Selects last n elements.

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

    n

    the number of elements to take

    returns

    a bitset consisting only of the last n elements of this bitset, or else the whole bitset, if it has less than n elements.

    Definition Classes
    IterableLike
  137. 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 bitset whose elements all satisfy the predicate p.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  138. def thisCollection: Iterable[Int]

    The underlying collection seen as an instance of BitSet.

    The underlying collection seen as an instance of BitSet. By default this is implemented as the current collection object itself, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  139. abstract def toArray: Array[Int]

    [use case] Converts this bitset to an array.

    [use case]

    Converts this bitset to an array.

    returns

    an array containing all elements of this bitset.

    Definition Classes
    GenTraversableOnce
  140. def toArray[B >: Int](implicit arg0: ClassManifest[B]): Array[B]

    Converts this bitset to an array.

    Converts this bitset to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  141. def toBuffer[A1 >: Int]: Buffer[A1]

    Converts this bitset to a mutable buffer.

    Converts this bitset to a mutable buffer.

    returns

    a buffer containing all elements of this bitset.

    Definition Classes
    SetLikeTraversableOnceGenTraversableOnce
  142. def toCollection(repr: BitSet): Iterable[Int]

    A conversion from collections of type Repr to BitSet objects.

    A conversion from collections of type Repr to BitSet objects. By default this is implemented as just a cast, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  143. def toIndexedSeq[B >: Int]: IndexedSeq[B]

    Converts this bitset to an indexed sequence.

    Converts this bitset to an indexed sequence.

    returns

    an indexed sequence containing all elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  144. def toIterable: Iterable[Int]

    Converts this bitset to an iterable collection.

    Converts this bitset to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this bitset.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  145. def toIterator: Iterator[Int]

    Returns an Iterator over the elements in this bitset.

    Returns an Iterator over the elements in this bitset. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this bitset.

    Definition Classes
    TraversableLikeGenTraversableOnce
  146. def toList: List[Int]

    Converts this bitset to a list.

    Converts this bitset to a list.

    returns

    a list containing all elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  147. abstract def toMap[T, U]: Map[T, U]

    [use case] Converts this bitset to a map.

    [use case]

    Converts this bitset to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this bitset.

    Definition Classes
    GenTraversableOnce
  148. def toMap[T, U](implicit ev: <:<[Int, (T, U)]): Map[T, U]

    Converts this bitset to a map.

    Converts this bitset to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  149. def toSeq: Seq[Int]

    Overridden for efficiency.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this bitset.

    Definition Classes
    SetLikeTraversableOnceGenTraversableOnce
  150. def toSet[B >: Int]: Set[B]

    Converts this bitset to a set.

    Converts this bitset to a set.

    returns

    a set containing all elements of this bitset.

    Definition Classes
    TraversableOnceGenTraversableOnce
  151. def toStream: Stream[Int]

    Converts this bitset to a stream.

    Converts this bitset to a stream.

    returns

    a stream containing all elements of this bitset.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  152. 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
    SetLikeFunction1TraversableLike → AnyRef → Any
  153. def toTraversable: Traversable[Int]

    Converts this bitset to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this bitset.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  154. def transpose[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): Set[Set[B]]

    Transposes this bitset of traversable collections into a bitset of bitsets.

    Transposes this bitset of traversable collections into a bitset of bitsets.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

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

  155. def union(that: GenSet[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
    SetLikeGenSetLike
  156. def unzip[A1, A2](implicit asPair: (Int) ⇒ (A1, A2)): (Set[A1], Set[A2])

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

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

    asPair

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  157. def unzip3[A1, A2, A3](implicit asTriple: (Int) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

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

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

    asTriple

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  158. def view(from: Int, until: Int): IterableView[Int, BitSet]

    Creates a non-strict view of a slice of this bitset.

    Creates a non-strict view of a slice of this bitset.

    Note: the difference between view and slice is that view produces a view of the current bitset, whereas slice produces a new bitset.

    Note: view(from, to) is equivalent to view.slice(from, to)

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this bitset, starting at index from and extending up to (but not including) index until.

    Definition Classes
    IterableLikeTraversableLike
  159. def view: IterableView[Int, BitSet]

    Creates a non-strict view of this bitset.

    Creates a non-strict view of this bitset.

    returns

    a non-strict view of this bitset.

    Definition Classes
    IterableLikeTraversableLike
  160. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  161. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  162. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  163. def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, BitSet]

    Creates a non-strict filter of this bitset.

    Creates a non-strict filter of this 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 bitset which satisfy the predicate p.

    Definition Classes
    TraversableLikeFilterMonadic
  164. abstract def zip[B](that: GenIterable[B]): BitSet[(A, B)]

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

    [use case]

    Returns a bitset formed from this bitset and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    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 collection of type That containing pairs consisting of corresponding elements of this bitset and that. The length of the returned collection is the minimum of the lengths of this bitset and that.

    Definition Classes
    GenIterableLike
  165. def zip[A1 >: Int, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[BitSet, (A1, B), That]): That

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

    Returns a bitset formed from this bitset and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

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

    Definition Classes
    IterableLikeGenIterableLike
  166. abstract def zipAll[B](that: Iterable[B], thisElem: Int, thatElem: B): BitSet[(A, B)]

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

    [use case]

    Returns a bitset formed from this 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 bitset is shorter than that.

    thatElem

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

    returns

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

    Definition Classes
    GenIterableLike
  167. def zipAll[B, A1 >: Int, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[BitSet, (A1, B), That]): That

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

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

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    Definition Classes
    IterableLikeGenIterableLike
  168. abstract def zipWithIndex: BitSet[(A, Int)]

    [use case] Zips this bitset with its indices.

    [use case]

    Zips this bitset with its indices.

    returns

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

    Definition Classes
    GenIterableLike
  169. def zipWithIndex[A1 >: Int, That](implicit bf: CanBuildFrom[BitSet, (A1, Int), That]): That

    Zips this bitset with its indices.

    Zips this bitset with its indices.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

    Definition Classes
    IterableLikeGenIterableLike
  170. def |(other: BitSet): BitSet

    Computes the union between this bitset and another bitset by performing a bitwise "or".

    Computes the union between this bitset and another bitset by performing a bitwise "or".

    other

    the bitset to form the union with.

    returns

    a new bitset consisting of all bits that are in this bitset or in the given bitset other.

    Definition Classes
    BitSetLike
  171. def |(that: GenSet[Int]): BitSet

    Computes the union between this set and another set.

    Computes the union between this set and another set.

    Note: Same as union.

    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
    GenSetLike

Deprecated Value Members

  1. def **(that: Set[Int]): BitSet

    This method is an alias for intersect.

    This method is an alias for intersect. It computes an intersection with set that. It removes all the elements that are not present in that.

    that

    the set to intersect with

    Definition Classes
    SetLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use & instead

  2. def elements: Iterator[Int]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use iterator' instead

  3. def first: Int

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use head' instead

  4. def firstOption: Option[Int]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use headOption' instead

  5. def projection: IterableView[Int, BitSet]

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use view' instead

Inherited from BitSetLike[BitSet]

Inherited from Set[Int]

Inherited from SetLike[Int, BitSet]

Inherited from Subtractable[Int, BitSet]

Inherited from GenSet[Int]

Inherited from GenericSetTemplate[Int, Set]

Inherited from GenSetLike[Int, BitSet]

Inherited from Iterable[Int]

Inherited from IterableLike[Int, BitSet]

Inherited from Equals

Inherited from GenIterable[Int]

Inherited from GenIterableLike[Int, BitSet]

Inherited from Traversable[Int]

Inherited from GenTraversable[Int]

Inherited from TraversableLike[Int, BitSet]

Inherited from GenTraversableLike[Int, BitSet]

Inherited from Parallelizable[Int, ParSet[Int]]

Inherited from TraversableOnce[Int]

Inherited from GenTraversableOnce[Int]

Inherited from FilterMonadic[Int, BitSet]

Inherited from HasNewBuilder[Int, BitSet]

Inherited from (Int) ⇒ Boolean

Inherited from AnyRef

Inherited from Any