scala.collection.immutable

BitSet

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

A class for 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.

attributes: abstract
go to: companion
linear super types: BitSet, BitSetLike[BitSet], Set[Int], Set[Int], SetLike[Int, BitSet], Subtractable[Int, BitSet], Addable[Int, BitSet], GenericSetTemplate[Int, Set], (Int) ⇒ Boolean, Iterable[Int], Iterable[Int], IterableLike[Int, BitSet], Equals, Traversable[Int], Immutable, Traversable[Int], GenericTraversableTemplate[Int, Set], TraversableLike[Int, BitSet], TraversableOnce[Int], FilterMonadic[Int, BitSet], HasNewBuilder[Int, BitSet], AnyRef, Any
known subclasses: BitSetN, BitSet2, BitSet1
source: BitSet.scala
    version
  1. 2.8

    since
  1. 2.8

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. BitSet
  2. BitSet
  3. BitSetLike
  4. Set
  5. Set
  6. SetLike
  7. Subtractable
  8. Addable
  9. GenericSetTemplate
  10. Function1
  11. Iterable
  12. Iterable
  13. IterableLike
  14. Equals
  15. Traversable
  16. Immutable
  17. Traversable
  18. GenericTraversableTemplate
  19. TraversableLike
  20. TraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. AnyRef
  24. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new BitSet ()

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.

Value Members

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

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

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

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. 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
  7. def & (that: Set[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: SetLike
  8. 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
  9. def &~ (that: Set[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: SetLike
  10. 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
      deprecated:
    1. use & instead

  11. def + (elem: Int) : BitSet

    Adds element to bitset, returning a new set.

    Adds element to bitset, returning a new [email protected] elem the element to be added

    returns

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

    definition classes: BitSetSetLikeAddable
  12. def + (elem1: Int, elem2: Int, elems: Int*) : BitSet

    Creates a new immutable bitset with additional elements.

    Creates a new immutable 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 immutable bitset with the given elements added.

    definition classes: Addable
  13. def ++ (xs: TraversableOnce[Int]) : BitSet

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

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

    returns

    a new immutable bitset with the given elements added.

    definition classes: Addable
  14. def ++ (that: TraversableOnce[Int]) : immutable.BitSet[Int]

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

    [use case]

    Concatenates this immutable bitset with the elements of a traversable collection.

    that

    the traversable to append.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  15. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[BitSet, B, That]) : That

    Concatenates this immutable bitset with the elements of a traversable collection.

    Concatenates this immutable bitset with the elements of a traversable collection.

    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 immutable bitset followed by all elements of that.

    definition classes: TraversableLike
  16. def - (elem: Int) : BitSet

    Removes element from bitset, returning a new [email protected] elem the element to be removed

    Removes element from bitset, returning a new [email protected] 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: BitSetSetLikeSubtractable
  17. def - (elem1: Int, elem2: Int, elems: Int*) : BitSet

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

    Creates a new immutable bitset from this immutable 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 immutable bitset that contains all elements of the current immutable bitset except one less occurrence of each of the given elements.

    definition classes: Subtractable
  18. def -- (xs: TraversableOnce[Int]) : BitSet

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

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

    returns

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

    definition classes: Subtractable
  19. def /: [B] (z: B)(op: (B, Int) ⇒ B) : B

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

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

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

    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 immutable bitset, going left to right with the start value z on the left: op(...op(op(z, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this immutable bitset.

    definition classes: TraversableOnce
  20. def :\ [B] (z: B)(op: (Int, B) ⇒ B) : B

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

    Applies a binary operator to all elements of this immutable 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.

    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 immutable bitset, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this immutable bitset.

    definition classes: TraversableOnce
  21. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  22. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  23. 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
  24. def addString (sb: StringBuilder, start: String, sep: String, end: String) : StringBuilder

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

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

    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
  25. def addString (b: StringBuilder) : StringBuilder

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

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  26. def addString (b: StringBuilder, sep: String) : StringBuilder

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

    Appends all elements of this immutable bitset to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this immutable bitset, separated by the string sep.

    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
  27. def andThen [A] (g: (Boolean) ⇒ A) : (Int) ⇒ A

    (f andThen g)(x) == g(f(x))

    (f andThen g)(x) == g(f(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: SetLike
  29. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to 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 expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  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 immutable bitset should be compared

    returns

    true, if this immutable 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

    This method creates and returns a copy of the receiver object.

    This method creates and returns 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
  32. def collect [B] (pf: PartialFunction[Int, B]) : immutable.BitSet[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the immutable bitset.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  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 immutable bitset on which the function is defined.

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

    B

    the element type of the returned collection.

    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 immutable 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: TraversableLike
  34. def companion : GenericCompanion[Set]

    The factory companion object that builds instances of class immutable.

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

    definition classes: SetSetIterableIterableTraversableTraversableGenericTraversableTemplate
  35. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ Boolean

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  36. 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: BitSetLikeSetLike
  37. def copyToArray (xs: Array[Int], start: Int, len: Int) : Unit

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

    [use case]

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

    attributes: abstract
    definition classes: TraversableLike
  38. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    Copies elements of this immutable bitset to an array.

    Copies elements of this immutable bitset to an array. Fills the given array xs with at most len elements of this immutable bitset, starting at position start. Copying will stop once either the end of the current immutable 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: IterableLikeTraversableLikeTraversableOnce
  39. def copyToArray (xs: Array[Int]) : Unit

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

    [use case]

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

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  40. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this immutable bitset to an array.

    Copies values of this immutable bitset to an array. Fills the given array xs with values of this immutable bitset. Copying will stop once either the end of the current immutable 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: TraversableOnce
  41. def copyToArray (xs: Array[Int], start: Int) : Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    attributes: abstract
    definition classes: TraversableOnce
  42. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    Copies values of this immutable bitset to an array.

    Copies values of this immutable bitset to an array. Fills the given array xs with values of this immutable bitset, after skipping start values. Copying will stop once either the end of the current immutable 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: TraversableOnce
  43. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    Copies all elements of this immutable bitset to a buffer.

    Copies all elements of this immutable bitset to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableOnce
  44. def count (p: (Int) ⇒ Boolean) : Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  45. def diff (that: Set[Int]) : BitSet

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

    the set of elements to exclude.

    returns

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

    definition classes: SetLike
  46. 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 immutable bitset.

    returns

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

    definition classes: TraversableLike
  47. 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 immutable bitset consisting of all elements of this immutable bitset except the first n ones, or else the empty immutable bitset, if this immutable bitset has less than n elements.

    definition classes: IterableLike
  48. 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 immutable bitset whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  49. def elements : Iterator[Int]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  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: BitSetBitSetBitSetLikeSetLikeGenericSetTemplate
  51. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other 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).

    arg0

    the object to compare against this object for reference equality.

    returns

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

    attributes: final
    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: SetLikeEquals → AnyRef → Any
  53. def exists (p: (Int) ⇒ Boolean) : Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  54. def filter (p: (Int) ⇒ Boolean) : BitSet

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  55. def filterNot (p: (Int) ⇒ Boolean) : BitSet

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  56. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

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

    attributes: protected[lang]
    definition classes: AnyRef
  57. def find (p: (Int) ⇒ Boolean) : Option[Int]

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

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  58. def first : Int

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  59. def firstOption : Option[Int]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  60. def flatMap [B] (f: (Int) ⇒ Traversable[B]) : immutable.BitSet[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable bitset and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable bitset and concatenating the results.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  61. def flatMap [B, That] (f: (Int) ⇒ Traversable[B])(implicit bf: CanBuildFrom[BitSet, B, That]) : That

    Builds a new collection by applying a function to all elements of this immutable bitset and concatenating the results.

    Builds a new collection by applying a function to all elements of this immutable bitset and concatenating the results.

    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 immutable bitset and concatenating the results.

    definition classes: TraversableLikeFilterMonadic
  62. def flatten [B] : immutable.BitSet[B]

    [use case] Converts this immutable bitset of traversable collections into a immutable bitset in which all element collections are concatenated.

    [use case]

    Converts this immutable bitset of traversable collections into a immutable bitset in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

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

    attributes: abstract
    definition classes: GenericTraversableTemplate
  63. def flatten [B] (implicit asTraversable: (Int) ⇒ Traversable[B]) : Set[B]

    Converts this immutable bitset of traversable collections into a immutable bitset in which all element collections are concatenated.

    Converts this immutable bitset of traversable collections into a immutable bitset in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    definition classes: GenericTraversableTemplate
  64. def foldLeft [B] (z: B)(op: (B, Int) ⇒ B) : B

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

    Applies a binary operator to a start value and all elements of this immutable 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 immutable bitset, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this immutable bitset.

    definition classes: TraversableOnce
  65. def foldRight [B] (z: B)(op: (Int, B) ⇒ B) : B

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

    Applies a binary operator to all elements of this immutable 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 immutable bitset, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this immutable bitset.

    definition classes: IterableLikeTraversableOnce
  66. def forall (p: (Int) ⇒ Boolean) : Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  67. def foreach (f: (Int) ⇒ Unit) : Unit

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

    [use case]

    Applies a function f to all elements of this immutable bitset.

    f

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

    attributes: abstract
    definition classes: IterableLike
  68. def foreach [B] (f: (Int) ⇒ B) : Unit

    Applies a function f to all elements of this immutable bitset.

    Applies a function f to all elements of this immutable 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.

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

    definition classes: BitSetBitSetLike
  70. def genericBuilder [B] : Builder[B, Set[B]]

    The generic builder that builds instances of immutable.

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

    definition classes: GenericTraversableTemplate
  71. def getClass () : java.lang.Class[_ <: java.lang.Object]

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

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

    attributes: final
    definition classes: AnyRef
  72. def groupBy [K] (f: (Int) ⇒ K) : Map[K, BitSet]

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

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

    Note: 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 immutable bitset.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to immutable bitsets such that the following invariant holds: (xs partition f)(k) = xs filter (x => f(x) == k) That is, every key k is bound to a immutable bitset of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  73. def grouped (size: Int) : Iterator[BitSet]

    Partitions elements in fixed size immutable bitsets.

    Partitions elements in fixed size immutable bitsets.

    size

    the number of elements per group

    returns

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

    definition classes: IterableLike
      see also:
    1. Iterator#grouped

  74. def hasDefiniteSize : Boolean

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

    Tests whether this immutable bitset is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    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: TraversableLikeTraversableOnce
  75. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

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

    returns

    the hash code value for the object.

    definition classes: SetLike → AnyRef → Any
  76. def head : Int

    Selects the first element of this immutable bitset.

    Selects the first element of this immutable bitset.

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

    returns

    the first element of this immutable bitset.

    definition classes: IterableLikeTraversableLike
  77. def headOption : Option[Int]

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

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

    definition classes: TraversableLike
  78. 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 immutable bitset consisting of all elements of this immutable bitset except the last one.

    definition classes: TraversableLike
  79. def intersect (that: Set[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: SetLike
  80. 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: SetLikeIterableLikeTraversableLikeTraversableOnce
  81. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.

    returns

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

    attributes: final
    definition classes: Any
  82. def isTraversableAgain : Boolean

    Tests whether this immutable bitset can be repeatedly traversed.

    Tests whether this immutable bitset can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  83. 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: BitSetLikeIterableLike
  84. def last : Int

    Selects the last element.

    Selects the last element.

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

    returns

    The last element of this immutable bitset.

    definition classes: TraversableLike
  85. def lastOption : Option[Int]

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

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

    definition classes: TraversableLike
  86. def map [B] (f: (Int) ⇒ B) : immutable.BitSet[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  87. 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 immutable bitset.

    Builds a new collection by applying a function to all elements of this immutable 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 immutable bitset and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  88. def max : Int

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this immutable bitset.

    attributes: abstract
    definition classes: TraversableOnce
  89. def max [B >: A] (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 immutable bitset with respect to the ordering cmp.

    definition classes: TraversableOnce
  90. def min : Int

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this immutable bitset

    attributes: abstract
    definition classes: TraversableOnce
  91. def min [B >: A] (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 immutable bitset with respect to the ordering cmp.

    definition classes: TraversableOnce
  92. def mkString : String

    Displays all elements of this immutable bitset in a string.

    Displays all elements of this immutable bitset in a string.

    returns

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

    definition classes: TraversableOnce
  93. def mkString (sep: String) : String

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

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

    sep

    the separator string.

    returns

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

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

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

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

    definition classes: TraversableOnce
  95. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

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

    attributes: final
    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 immutable bitset is not empty.

    Tests whether the immutable bitset is not empty.

    returns

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

    definition classes: TraversableOnce
  98. 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.

    attributes: final
    definition classes: AnyRef
  99. 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.

    attributes: final
    definition classes: AnyRef
  100. 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 abstract
    definition classes: BitSetLike
  101. def partition (p: (Int) ⇒ Boolean) : (BitSet, BitSet)

    Partitions this immutable bitset in two immutable bitsets according to a predicate.

    Partitions this immutable bitset in two immutable bitsets according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    definition classes: TraversableLike
  102. 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 in this immutable bitset of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable bitset and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  103. def product [B >: A] (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 immutable bitset with respect to the * operator in num.

    definition classes: TraversableOnce
  104. 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
      deprecated:
    1. use view' instead

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

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

    Applies a binary operator to all elements of this immutable 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

    the result of inserting op between consecutive elements of this immutable bitset, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this immutable bitset.

    definition classes: TraversableOnce
  106. def reduceLeftOption [B >: A] (op: (B, Int) ⇒ B) : Option[B]

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

    Optionally applies a binary operator to all elements of this immutable 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 immutable bitset is nonempty, None otherwise.

    definition classes: TraversableOnce
  107. def reduceRight [B >: A] (op: (Int, B) ⇒ B) : B

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

    Applies a binary operator to all elements of this immutable 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 immutable bitset, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this immutable bitset.

    definition classes: IterableLikeTraversableOnce
  108. def reduceRightOption [B >: A] (op: (Int, B) ⇒ B) : Option[B]

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

    Optionally applies a binary operator to all elements of this immutable 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 immutable bitset is nonempty, None otherwise.

    definition classes: TraversableOnce
  109. def repr : BitSet

    The collection of type immutable bitset underlying this TraversableLike object.

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

    definition classes: TraversableLike
  110. def reversed : List[Int]

    attributes: protected[this]
    definition classes: TraversableOnce
  111. def sameElements (that: Iterable[Int]) : Boolean

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

    attributes: abstract
    definition classes: IterableLike
  112. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

    Checks if the other iterable collection contains the same elements in the same order as this immutable 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: IterableLike
  113. 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: TraversableLike
  114. 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.

    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: TraversableLike
  115. def size : Int

    The size of this immutable bitset.

    The size of this immutable bitset.

    returns

    the number of elements in this immutable bitset.

    definition classes: BitSetLikeTraversableOnce
  116. def slice (from: Int, until: Int) : BitSet

    Selects an interval of elements.

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

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

    from

    the index of the first returned element in this immutable bitset.

    until

    the index one past the last returned element in this immutable bitset.

    returns

    a immutable bitset containing the elements starting at index from and extending up to (but not including) index until of this immutable bitset.

    definition classes: IterableLikeTraversableLike
  117. def sliding [B >: A] (size: Int, step: Int) : Iterator[BitSet]

    definition classes: IterableLike
  118. def sliding [B >: A] (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 immutable 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:
    1. Iterator#sliding

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

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

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

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

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

    p

    the test predicate

    returns

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

    definition classes: TraversableLike
  120. def splitAt (n: Int) : (BitSet, BitSet)

    Splits this immutable bitset into two at a given position.

    Splits this immutable 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 immutable bitsets consisting of the first n elements of this immutable bitset, and the other elements.

    definition classes: TraversableLike
  121. 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: BitSetLikeSetLikeTraversableLike
  122. 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
  123. def subsetOf (that: Set[Int]) : Boolean

    Tests whether this set is a subset of another set.

    Tests whether this set is a subset of another set.

    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: SetLike
  124. 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 in this immutable bitset of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable bitset and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  125. def sum [B >: A] (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 immutable bitset with respect to the + operator in num.

    definition classes: TraversableOnce
  126. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  127. 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 immutable bitset consisting of all elements of this immutable bitset except the first one.

    definition classes: TraversableLike
  128. 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 immutable bitset.

    returns

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

    definition classes: IterableLikeTraversableLike
  129. 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 immutable bitset consisting only of the last n elements of this immutable bitset, or else the whole immutable bitset, if it has less than n elements.

    definition classes: IterableLike
  130. def takeWhile (p: (Int) ⇒ Boolean) : BitSet

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

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

    p

    The predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLike
  131. def thisCollection : Iterable[Int]

    The underlying collection seen as an instance of immutable.BitSet.

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

    attributes: protected[this]
    definition classes: IterableLikeTraversableLike
  132. def toArray : Array[Int]

    [use case] Converts this immutable bitset to an array.

    [use case]

    Converts this immutable bitset to an array.

    returns

    an array containing all elements of this immutable bitset. A ClassManifest must be available for the element type of this immutable bitset.

    attributes: abstract
    definition classes: TraversableOnce
  133. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this immutable bitset to an array.

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

    definition classes: TraversableOnce
  134. def toBuffer [B >: A] : Buffer[B]

    Converts this immutable bitset to a mutable buffer.

    Converts this immutable bitset to a mutable buffer.

    returns

    a buffer containing all elements of this immutable bitset.

    definition classes: TraversableOnce
  135. def toCollection (repr: BitSet) : Iterable[Int]

    A conversion from collections of type Repr to immutable.BitSet objects.

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

    attributes: protected[this]
    definition classes: IterableLikeTraversableLike
  136. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this immutable bitset to an indexed sequence.

    Converts this immutable bitset to an indexed sequence.

    returns

    an indexed sequence containing all elements of this immutable bitset.

    definition classes: TraversableOnce
  137. def toIterable : Iterable[Int]

    Converts this immutable bitset to an iterable collection.

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

    definition classes: IterableLikeTraversableOnce
  138. def toIterator : Iterator[Int]

    Returns an Iterator over the elements in this immutable bitset.

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

    returns

    an Iterator containing all elements of this immutable bitset.

    definition classes: TraversableLikeTraversableOnce
  139. def toList : List[Int]

    Converts this immutable bitset to a list.

    Converts this immutable bitset to a list.

    returns

    a list containing all elements of this immutable bitset.

    definition classes: TraversableOnce
  140. def toMap [T, U] (implicit ev: <:<[Int, (T, U)]) : Map[T, U]

    Converts this immutable bitset to a map.

    Converts this immutable bitset to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) 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 immutable bitset.

    definition classes: TraversableOnce
  141. def toSeq : Seq[Int]

    Converts this immutable bitset to a sequence.

    Converts this immutable bitset to a sequence.

    returns

    a sequence containing all the elements of this immutable bitset.

    definition classes: IterableLikeTraversableOnce
  142. def toSet [B >: A] : Set[B]

    Converts this immutable bitset to a set.

    Converts this immutable bitset to a set.

    returns

    a set containing all elements of this immutable bitset.

    definition classes: TraversableOnce
  143. def toStream : Stream[Int]

    Converts this immutable bitset to a stream.

    Converts this immutable bitset to a stream.

    returns

    a stream containing all elements of this immutable bitset.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  144. def toString () : String

    Converts this immutable bitset to a string.

    Converts this immutable bitset to a string.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this immutable bitset, followed by all elements separated by commas and enclosed in parentheses.

    definition classes: SetLikeTraversableLike → AnyRef → Any
  145. def toTraversable : Traversable[Int]

    Converts this immutable bitset to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this immutable bitset.

    definition classes: TraversableLikeTraversableOnce
  146. def transpose [B] (implicit asTraversable: (Int) ⇒ Traversable[B]) : Set[Set[B]]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    definition classes: GenericTraversableTemplate
  147. def union (that: Set[Int]) : BitSet

    Computes the union between of set and another set.

    Computes the union between of set and another set.

    that

    the set to form the union with.

    returns

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

    definition classes: SetLike
  148. def unzip [A1, A2] (implicit asPair: (Int) ⇒ (A1, A2)) : (Set[A1], Set[A2])

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

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

    asPair

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

    returns

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

    definition classes: GenericTraversableTemplate
  149. def updateWord (idx: Int, w: Long) : BitSet

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

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

    attributes: protected abstract
  150. def view (from: Int, until: Int) : IterableView[Int, BitSet]

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

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

    Note: the difference between view and slice is that view produces a view of the current immutable bitset, whereas slice produces a new immutable 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 immutable bitset, starting at index from and extending up to (but not including) index until.

    definition classes: IterableLikeTraversableLike
  151. def view : IterableView[Int, BitSet]

    Creates a non-strict view of this immutable bitset.

    Creates a non-strict view of this immutable bitset.

    returns

    a non-strict view of this immutable bitset.

    definition classes: IterableLikeTraversableLike
  152. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  153. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  154. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  155. def withFilter (p: (Int) ⇒ Boolean) : FilterMonadic[Int, BitSet]

    Creates a non-strict filter of this immutable bitset.

    Creates a non-strict filter of this immutable bitset.

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLikeFilterMonadic
  156. 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 abstract
    definition classes: BitSetLike
  157. def zip [B] (that: Iterable[B]) : immutable.BitSet[(Int, B)]

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

    [use case]

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

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

    attributes: abstract
    definition classes: IterableLike
  158. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[BitSet, (A1, B), That]) : That

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

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

    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 immutable bitset and that. The length of the returned collection is the minimum of the lengths of this immutable bitset and that.

    definition classes: IterableLike
  159. def zipAll [B] (that: Iterable[B], thisElem: Int, thatElem: B) : immutable.BitSet[(Int, B)]

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

    [use case]

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    attributes: abstract
    definition classes: IterableLike
  160. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[BitSet, (A1, B), That]) : That

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

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

    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 immutable bitset is shorter than that.

    thatElem

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

    returns

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

    definition classes: IterableLike
  161. def zipWithIndex : immutable.BitSet[(Int, Int)]

    [use case] Zips this immutable bitset with its indices.

    [use case]

    Zips this immutable bitset with its indices.

    returns

    A new immutable bitset containing pairs consisting of all elements of this immutable bitset paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  162. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[BitSet, (A1, Int), That]) : That

    Zips this immutable bitset with its indices.

    Zips this immutable 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 immutable bitset paired with their index. Indices start at 0.

    definition classes: IterableLike
  163. 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
  164. def | (that: Set[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: SetLike

Inherited from BitSet

Inherited from BitSetLike[BitSet]

Inherited from Set[Int]

Inherited from Set[Int]

Inherited from SetLike[Int, BitSet]

Inherited from Subtractable[Int, BitSet]

Inherited from Addable[Int, BitSet]

Inherited from GenericSetTemplate[Int, Set]

Inherited from (Int) ⇒ Boolean

Inherited from Iterable[Int]

Inherited from Iterable[Int]

Inherited from IterableLike[Int, BitSet]

Inherited from Equals

Inherited from Traversable[Int]

Inherited from Immutable

Inherited from Traversable[Int]

Inherited from GenericTraversableTemplate[Int, Set]

Inherited from TraversableLike[Int, BitSet]

Inherited from TraversableOnce[Int]

Inherited from FilterMonadic[Int, BitSet]

Inherited from HasNewBuilder[Int, BitSet]

Inherited from AnyRef

Inherited from Any