Scaladoc for scala.collection.immutable.BitSet.BitSet1

Inherits

BitSet
BitSet
BitSetLike
Set
Set
SetLike
Subtractable
Addable
GenericSetTemplate
Function1
Iterable
Iterable
IterableLike
Equals
Traversable
Immutable
Traversable
GenericTraversableTemplate
TraversableLike
HasNewBuilder
AnyRef
Any

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations

Value Members

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

definition classes: BitSetLike
def &(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
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".

definition classes: BitSetLike
def &~(that: Set[Int]): BitSet

The difference of this set and another set

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
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
def +(elem: Int): BitSet

Adds element to bitset, returning a new set

Adds element to bitset, returning a new set.

elem
the element to be added
returns
a new set that contains all elements of this set and that also contains elem.

definition classes: BitSet ⇐ SetLike ⇐ Addable
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: Addable
def ++(iter: Iterator[Int]): BitSet

Creates a new bitset by adding all elements produced by an iterator to this bitset

Creates a new bitset by adding all elements produced by an iterator to this bitset.

iter
the iterator producing the added elements.
returns
a new bitset with the given elements added.

definition classes: Addable
def ++(elems: Traversable[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: Addable
def ++[B >: Int, That](that: Iterator[B])(bf: CanBuildFrom[BitSet, B, That]): That

Concatenates this bitset with the elements of an iterator

Concatenates this bitset with the elements of an iterator.

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 iterator 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
def ++[B >: Int, That](that: Traversable[B])(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.

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
def -(elem: Int): BitSet

Removes element from bitset, returning a new set

Removes element from bitset, returning a new set

elem
the element to be removed
returns
a new set that contains all elements of this set but that does not contain elem.

definition classes: BitSet ⇐ SetLike ⇐ Subtractable
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
def --(iter: Iterator[Int]): BitSet

Creates a new bitset from this bitset by removing all elements produced by an iterator

Creates a new bitset from this bitset by removing all elements produced by an iterator.

iter
the iterator producing the removed elements.
returns
a new bitset that contains all elements of the current bitset except one less occurrence of each of the elements produced by iter.

definition classes: Subtractable
def --(elems: Traversable[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.

elems
the collection containing the removed elements.
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
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.
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, x₁), x₂), ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this bitset.

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

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(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this bitset.

definition classes: TraversableLike
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".

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

start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.

definition classes: BitSetLike ⇐ TraversableLike
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.

b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

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

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: TraversableLike
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
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
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: IterableLike ⇐ Equals
def companion: GenericCompanion[Set[A][A]]

The factory companion object that builds instances of class BitSet define bitsetinfo Bitsets are sets of non-negative integers which are represented as variable-size arrays of bits packed into 64-bit words

The factory companion object that builds instances of class BitSet define bitsetinfo Bitsets are sets of non-negative integers which are represented as variable-size arrays of bits packed into 64-bit words. The size of a bitset is determined by the largest number stored in it. .

definition classes: Set ⇐ Set ⇐ Iterable ⇐ Iterable ⇐ Traversable ⇐ Traversable ⇐ GenericTraversableTemplate
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
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: BitSetLike ⇐ SetLike
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: IterableLike ⇐ TraversableLike
def copyToArray[B >: Int](xs: Array[B]): Unit

Copies elements of this bitset to an array

Copies elements of this bitset to an array. Fills the given array xs with all elements of this bitset, starting at position 0. 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: TraversableLike
def copyToArray[B >: Int](xs: Array[B], start: Int): Unit

Copies elements of this bitset to an array

Copies elements of this bitset to an array. Fills the given array xs with all 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.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.

definition classes: TraversableLike
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: TraversableLike
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: TraversableLike
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
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: TraversableLike
def dropRight(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 take
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: IterableLike
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: TraversableLike
def elements: Iterator[Int]
val elems: Long
def empty: BitSet
def equals(that: Any): Boolean

Compares this set with another object for equality

Compares this set with another object for equality.

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

definition classes: SetLike ⇐ Equals ⇐ AnyRef ⇐ Any
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: IterableLike ⇐ TraversableLike
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: TraversableLike
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: TraversableLike
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: IterableLike ⇐ TraversableLike
def first: Int
def firstOption: Option[Int]

None if iterable is empty

None if iterable is empty.

definition classes: IterableLike
def flatMap[B, That](f: (Int) ⇒ Traversable[B])(bf: CanBuildFrom[BitSet, B, That]): That

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

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

definition classes: TraversableLike
def flatten[B](asTraversable: (Int) ⇒ Traversable[B]): Set[B]

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

Converts this bitset of traversable collections into a 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 bitset is a Traversable.
returns
a new bitset resulting from concatenating all element bitsets.

definition classes: GenericTraversableTemplate
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, x₁), x₂, ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this bitset.

definition classes: TraversableLike
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(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this bitset.

definition classes: IterableLike ⇐ TraversableLike
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: IterableLike ⇐ TraversableLike
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: BitSetLike ⇐ IterableLike ⇐ TraversableLike
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: BitSet ⇐ BitSetLike
def genericBuilder[B]: Builder[B, Set[B]]

The generic builder that builds instances of BitSet define bitsetinfo Bitsets are sets of non-negative integers which are represented as variable-size arrays of bits packed into 64-bit words

The generic builder that builds instances of BitSet define bitsetinfo Bitsets are sets of non-negative integers which are represented as variable-size arrays of bits packed into 64-bit words. The size of a bitset is determined by the largest number stored in it. at arbitrary element types.

definition classes: GenericTraversableTemplate
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: TraversableLike
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.

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

definition classes: SetLike ⇐ AnyRef ⇐ Any
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.

definition classes: IterableLike ⇐ TraversableLike
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.

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

definition classes: TraversableLike
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
def isEmpty: Boolean

Tests if this set is empty

Tests if this set is empty.

definition classes: SetLike ⇐ IterableLike ⇐ TraversableLike
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.

definition classes: BitSetLike ⇐ IterableLike
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.

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

definition classes: TraversableLike
def map[B, That](f: (Int) ⇒ B)(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: TraversableLike
def max[B >: Int](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: TraversableLike
def min[B >: Int](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: TraversableLike
def mkString: String

Displays all elements of this bitset in a string

Displays all elements of this bitset in a string.

definition classes: TraversableLike
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: TraversableLike
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: TraversableLike
def nonEmpty: Boolean

Tests whether the bitset is not empty

Tests whether the bitset is not empty.

definition classes: TraversableLike
def partialMap[B, That](pf: PartialFunction[Int, B])(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: TraversableLike
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: TraversableLike
def product[B >: Int](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: TraversableLike
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
def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B

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

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
the result of inserting op between consecutive elements of this bitset$, going left to right: {{{ op(...(op(x₁, x₂), ... ) , x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this bitset.

definition classes: TraversableLike
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: TraversableLike
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₁, op(x₂, ..., op(x_n-1, x_n)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this bitset.

definition classes: IterableLike ⇐ TraversableLike
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: TraversableLike
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: TraversableLike
def sameElements[B >: Int](that: Iterable[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: IterableLike
def size: Int

The size of this bitset

The size of this bitset.

definition classes: BitSetLike ⇐ TraversableLike
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 bitset.
until
the index one past the last returned element in this bitset.
returns
a bitset containing the elements starting at index from and extending up to (but not including) index until of this bitset.

definition classes: IterableLike ⇐ TraversableLike
def span(p: (Int) ⇒ Boolean): (BitSet, BitSet)

Spits this bitset into a prefix/suffix pair according to a predicate

Spits 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: TraversableLike
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: TraversableLike
def stringPrefix: String

Defines the prefix of this object's toString representation

Defines the prefix of this object's toString representation.

definition classes: BitSetLike ⇐ SetLike ⇐ TraversableLike
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.

definition classes: BitSetLike
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
def sum[B >: Int](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: TraversableLike
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.

definition classes: TraversableLike
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: IterableLike ⇐ TraversableLike
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
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: IterableLike ⇐ TraversableLike
def toArray[B >: Int](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: TraversableLike
def toIndexedSeq[B >: Int]: IndexedSeq[B]

Converts this bitset to an indexed sequence

Converts this bitset to an indexed sequence.

definition classes: TraversableLike
def toIterable: Iterable[Int]

Converts this bitset to an iterable collection

Converts this bitset to an iterable collection.
Note: Will not terminate for infinite-sized collections.

definition classes: IterableLike ⇐ TraversableLike
def toList: List[Int]

Converts this bitset to a list

Converts this bitset to a list.

definition classes: TraversableLike
def toSeq: Seq[Int]

Converts this bitset to a sequence

Converts this bitset to a sequence.

definition classes: TraversableLike
def toSet[B >: Int]: Set[B]

Converts this bitset to a set

Converts this bitset to a set.

definition classes: TraversableLike
def toStream: Stream[Int]

Converts this bitset to a stream

Converts this bitset to a stream.

definition classes: IterableLike ⇐ TraversableLike
def toString(): String

Converts this bitset to a string

Converts this bitset to a string

definition classes: SetLike ⇐ TraversableLike ⇐ AnyRef ⇐ Any
def transpose[B](asTraversable: (Int) ⇒ Traversable[B]): Set[Set[B]]

Transposes this bitset of traversable collections into

Transposes this bitset of traversable collections into

definition classes: GenericTraversableTemplate
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
def unzip[A1, A2](asPair: (Int) ⇒ (A1, A2)): (Set[A1], Set[A2])

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

Converts this 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 bitset is a pair.
returns
a pair bitsets, containing the first, respectively second half of each element pair of this bitset.

definition classes: GenericTraversableTemplate
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: IterableLike ⇐ TraversableLike
def view: IterableView[Int, BitSet]

Creates a non-strict view of this bitset

Creates a non-strict view of this bitset.

definition classes: IterableLike ⇐ TraversableLike
def withFilter(p: (Int) ⇒ Boolean): WithFilter

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 satify the predicate p.

definition classes: TraversableLike
def zip[A1 >: Int, B, That](that: Iterable[B])(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: IterableLike
def zipAll[B, A1 >: Int, That](that: Iterable[B], thisElem: A1, thatElem: B)(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: IterableLike
def zipWithIndex[A1 >: Int, That](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: IterableLike
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
def |(that: Set[Int]): BitSet

Computes the union between this set and another set

Computes the union between this 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

Instance constructors

new BitSet1(elems: Long)
new BitSet1()

BitSet1

class BitSet1 extends BitSet

Inherits

Type Members

class WithFilter extends AnyRef

Value Members

def &(other: BitSet): BitSet

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

def &~(other: BitSet): BitSet

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

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

def +(elem: Int): BitSet

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

def ++(iter: Iterator[Int]): BitSet

def ++(elems: Traversable[Int]): BitSet

def ++[B >: Int, That](that: Iterator[B])(bf: CanBuildFrom[BitSet, B, That]): That

def ++[B >: Int, That](that: Traversable[B])(bf: CanBuildFrom[BitSet, B, That]): That

def -(elem: Int): BitSet

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

def --(iter: Iterator[Int]): BitSet

def --(elems: Traversable[Int]): BitSet

def /:[B](z: B)(op: (B, Int) ⇒ B): B

def :\[B](z: B)(op: (Int, B) ⇒ B): B

def ^(other: BitSet): BitSet

def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def andThen[A](g: (Boolean) ⇒ A): (Int) ⇒ A

def apply(elem: Int): Boolean

def canEqual(that: Any): Boolean

def companion: GenericCompanion[Set[A][A]]

def compose[A](g: (A) ⇒ Int): (A) ⇒ Boolean

def contains(elem: Int): Boolean

def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Int](xs: Array[B]): Unit

def copyToArray[B >: Int](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

def count(p: (Int) ⇒ Boolean): Int

def diff(that: Set[Int]): BitSet

def drop(n: Int): BitSet

def dropRight(n: Int): BitSet

def dropWhile(p: (Int) ⇒ Boolean): BitSet

def elements: Iterator[Int]

val elems: Long

def empty: BitSet

def equals(that: Any): Boolean

def exists(p: (Int) ⇒ Boolean): Boolean

def filter(p: (Int) ⇒ Boolean): BitSet

def filterNot(p: (Int) ⇒ Boolean): BitSet

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

def first: Int

def firstOption: Option[Int]

def flatMap[B, That](f: (Int) ⇒ Traversable[B])(bf: CanBuildFrom[BitSet, B, That]): That

def flatten[B](asTraversable: (Int) ⇒ Traversable[B]): Set[B]

def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

def foldRight[B](z: B)(op: (Int, B) ⇒ B): B

def forall(p: (Int) ⇒ Boolean): Boolean

def foreach[B](f: (Int) ⇒ B): Unit

def fromArray(elems: Array[Long]): BitSet

def genericBuilder[B]: Builder[B, Set[B]]

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Int

def headOption: Option[Int]

def init: BitSet

def intersect(that: Set[Int]): BitSet

def isEmpty: Boolean

def iterator: Iterator[Int]

def last: Int

def lastOption: Option[Int]

def map[B, That](f: (Int) ⇒ B)(bf: CanBuildFrom[BitSet, B, That]): That

def max[B >: Int](cmp: Ordering[B]): Int

def min[B >: Int](cmp: Ordering[B]): Int

def mkString: String

def mkString(sep: String): String

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

def nonEmpty: Boolean

def partialMap[B, That](pf: PartialFunction[Int, B])(bf: CanBuildFrom[BitSet, B, That]): That

def partition(p: (Int) ⇒ Boolean): (BitSet, BitSet)