BitSet1

class BitSet1 extends BitSet

Annotations: @SerialVersionUID()

Linear Supertypes

BitSet, Serializable, Serializable, StrictOptimizedIterableOps[Int, Set, BitSet], collection.BitSet, BitSetOps[BitSet], SortedSet[Int], SortedSetOps[Int, SortedSet, BitSet], collection.SortedSet[Int], collection.SortedSetOps[Int, SortedSet, BitSet], SortedOps[Int, BitSet], Set[Int], SetOps[Int, Set, BitSet], collection.Set[Int], collection.SetOps[Int, Set, BitSet], Equals, (Int) ⇒ Boolean, Iterable[Int], collection.Iterable[Int], IterableOps[Int, Set, BitSet], IterableOnce[Int], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

BitSet1
BitSet
Serializable
Serializable
StrictOptimizedIterableOps
BitSet
BitSetOps
SortedSet
SortedSetOps
SortedSet
SortedSetOps
SortedOps
Set
SetOps
Set
SetOps
Equals
Function1
Iterable
Iterable
IterableOps
IterableOnce
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new BitSet1(elems: Long)

Type Members

class WithFilter extends AnyRef
A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.
A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

Definition Classes
IterableOps
class SortedWithFilter extends WithFilter
Specialize WithFilter for sorted collections
Specialize WithFilter for sorted collections

Definition Classes
SortedSetOps

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def &(that: collection.Set[Int]): BitSet
Alias for intersect
Alias for intersect

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

Definition Classes
SetOps
Annotations
@inline()
final def +(elem: Int): BitSet
Alias for incl
Alias for incl

Definition Classes
SetOps
final def ++(that: IterableOnce[Int]): BitSet
Alias for concat
Alias for concat

Definition Classes
SetOps
Annotations
@inline()
final def ++[B >: Int](suffix: IterableOnce[B]): Set[B]
Alias for concat
Alias for concat

Definition Classes
IterableOps
Annotations
@inline()
final def ++:[B >: Int](prefix: collection.Iterable[B]): Set[B]
Alias for prependAll
Alias for prependAll

Definition Classes
IterableOps
Annotations
@inline()
final def -(elem: Int): BitSet
Alias for excl
Alias for excl

Definition Classes
SetOps
Annotations
@inline()
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ^(other: collection.BitSet): BitSet

Definition Classes
BitSetOps
Annotations
@inline()
def andThen[A](g: (Boolean) ⇒ A): (Int) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
final def apply(elem: Int): Boolean
Tests if some element is contained in this set.
Tests if some element is contained in this set.
This method is equivalent to contains. It allows sets to be interpreted as predicates.
elem
the element to test for membership.
returns
true if elem is contained in this set, false otherwise.

Definition Classes
SetOps → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def canEqual(that: Any): Boolean

Definition Classes
SetOps → Equals
def className: String
The class name of this collection.
The class name of this collection. To be used for converting to string. Collections generally print like this:
<className>(elem_1, ..., elem_n)

Definition Classes
IterableOps
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def coll: BitSet1.this.type
The collection itself
The collection itself

Attributes
protected[this]
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[Int, B])(implicit arg0: Ordering[B]): SortedSet[B]

Definition Classes
SortedSetOps
def collect[B](pf: PartialFunction[Int, B]): Set[B]

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

Definition Classes
Function1
Annotations
@unspecialized()
def concat(that: IterableOnce[Int]): BitSet
Creates a new $coll by adding all elements contained in another collection to this $coll, omitting duplicates.
Creates a new $coll by adding all elements contained in another collection to this $coll, omitting duplicates.
This method takes a collection of elements and adds all elements, omitting duplicates, into $coll.
Example:
```
scala> val a = Set(1, 2) concat Set(2, 3)
a: scala.collection.immutable.Set[Int] = Set(1, 2, 3)
```
that
the collection containing the elements to add.
returns
a new $coll with the given elements added, omitting duplicates.

Definition Classes
SetOps → SetOps
def concat[B >: Int](suffix: IterableOnce[B]): Set[B]
Returns a new $coll containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new $coll containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the $coll is the most specific superclass encompassing the element types of the two operands.
B
the element type of the returned collection.
suffix
the traversable to append.
returns
a new collection of type CC[B] which contains all elements of this $coll followed by all elements of suffix.

Definition Classes
IterableOps
def contains(elem: Int): Boolean

Definition Classes
BitSetOps → SetOps
def copyToArray[B >: Int](xs: Array[B], start: Int = 0): xs.type
Copy all elements of this collection to array xs, starting at start.
Copy all elements of this collection to array xs, starting at start.

Definition Classes
IterableOps
def count(p: (Int) ⇒ Boolean): Int
Counts the number of elements in the $coll which satisfy a predicate.
Counts the number of elements in the $coll which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

Definition Classes
IterableOps
def diff(that: collection.Set[Int]): BitSet
Computes the difference of this set and another set.
Computes the difference of this set and another set.
that
the set of elements to exclude.
returns
a set containing those elements of this set that are not also contained in the given set that.

Definition Classes
SetOps → SetOps
def drop(n: Int): BitSet
The rest of the collection without its n first elements.
The rest of the collection without its n first elements. For linear, immutable collections this should avoid making a copy.

Definition Classes
IterableOps
def dropRight(n: Int): BitSet
The rest of the collection without its n last elements.
The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

Definition Classes
IterableOps
def dropWhile(p: (Int) ⇒ Boolean): BitSet
Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.
Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.
p
the predicate used to skip elements.
returns
an iterator consisting of the remaining elements

Definition Classes
IterableOps
Note
Reuse: $consumesAndProducesIterator
val elems: Long
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 C.

Definition Classes
BitSet → SetOps
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
SetOps → Equals → AnyRef → Any
def excl(elem: Int): BitSet
Creates a new set with a given element removed from this set.
Creates a new set with a given element removed from this set.
elem
the element to be removed
returns
a new set that contains all elements of this set but that does not contain elem.

Definition Classes
BitSet → SetOps
def exists(p: (Int) ⇒ Boolean): Boolean
Tests whether a predicate holds for at least one element of this $coll.
Tests whether a predicate holds for at least one element of this $coll.
$mayNotTerminateInf
p
the predicate used to test elements.
returns
true if the given predicate p is satisfied by at least one element of this $coll, otherwise false

Definition Classes
IterableOps
def filter(pred: (Int) ⇒ Boolean): BitSet
Selects all elements of this $coll which satisfy a predicate.
Selects all elements of this $coll which satisfy a predicate.
pred
the predicate used to test elements.
returns
a new $coll consisting of all elements of this $coll that satisfy the given predicate pred. Their order may not be preserved.

Definition Classes
IterableOps
def filterNot(pred: (Int) ⇒ Boolean): BitSet
Selects all elements of this $coll which do not satisfy a predicate.
Selects all elements of this $coll which do not satisfy a predicate.
pred
the predicate used to test elements.
returns
a new $coll consisting of all elements of this $coll that do not satisfy the given predicate pred. Their order may not be preserved.

Definition Classes
IterableOps
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (Int) ⇒ Boolean): Option[Int]
Finds the first element of the $coll satisfying a predicate, if any.
Finds the first element of the $coll satisfying a predicate, if any.
$mayNotTerminateInf $orderDependent
p
the predicate used to test elements.
returns
an option value containing the first element in the $coll that satisfies p, or None if none exists.

Definition Classes
IterableOps
def firstKey: Int
Returns the first key of the collection.
Returns the first key of the collection.

Definition Classes
SortedSetOps → SortedOps
def flatMap(f: (Int) ⇒ IterableOnce[Int]): BitSet

Definition Classes
BitSetOps
def flatMap[B](f: (Int) ⇒ IterableOnce[B])(implicit arg0: Ordering[B]): SortedSet[B]
Flatmap
Flatmap

Definition Classes
SortedSetOps
def flatMap[B](f: (Int) ⇒ IterableOnce[B]): Set[B]
Flatmap
Flatmap

Definition Classes
IterableOps
def flatten[B](implicit ev: (Int) ⇒ IterableOnce[B]): Set[B]

Definition Classes
IterableOps
def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B
Fold left
Fold left

Definition Classes
IterableOps
def foldRight[B](z: B)(op: (Int, B) ⇒ B): B
Fold right
Fold right

Definition Classes
IterableOps
def forall(p: (Int) ⇒ Boolean): Boolean
Tests whether a predicate holds for all elements of this $coll.
Tests whether a predicate holds for all elements of this $coll.
$mayNotTerminateInf
p
the predicate used to test elements.
returns
true if this $coll is empty or the given predicate p holds for all elements of this $coll, otherwise false.

Definition Classes
IterableOps
def foreach[U](f: (Int) ⇒ U): Unit
Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.
Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

Definition Classes
BitSetOps → IterableOps
def fromBitMaskNoCopy(elems: Array[Long]): BitSet
Creates a new set of this kind from an array of longs
Creates a new set of this kind from an array of longs

Attributes
protected[strawman.collection]
Definition Classes
BitSet → BitSetOps
def fromIterable[E](it: collection.Iterable[E]): Set[E]

Attributes
protected[this]
Definition Classes
IterableOps
def fromSpecificIterable(coll: collection.Iterable[Int]): BitSet

Attributes
protected[this]
Definition Classes
BitSet → IterableOps
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (Int) ⇒ K): Map[K, BitSet]
Partitions this $coll into a map of ${coll}s according to some discriminator function.
Partitions this $coll into a map of ${coll}s according to some discriminator function.
Note: When applied to a view or a lazy collection it will always force the elements.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to ${coll}s such that the following invariant holds:
```
(xs groupBy f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a $coll of those elements x for which f(x) equals k.
Definition Classes
IterableOps
def grouped(size: Int): Iterator[BitSet]
Partitions elements in fixed size ${coll}s.
Partitions elements in fixed size ${coll}s.
size
the number of elements per group
returns
An iterator producing ${coll}s of size size, except the last will be less than size size if the elements don't divide evenly.

Definition Classes
IterableOps
See also
scala.collection.Iterator, method grouped
def hashCode(): Int

Definition Classes
SetOps → AnyRef → Any
def head: Int
The first element of the collection.
The first element of the collection.

Definition Classes
IterableOps
def incl(elem: Int): BitSet
Creates a new set with an additional element, unless the element is already present.
Creates a new set with an additional element, unless the element is already present.
elem
the element to be added
returns
a new set that contains all elements of this set and that also contains elem.

Definition Classes
BitSet → SetOps
def init: BitSet
The initial part of the collection without its last element.
The initial part of the collection without its last element.

Definition Classes
IterableOps
def intersect(that: collection.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
SetOps
def isEmpty: Boolean
Is the collection empty?
Is the collection empty?

Definition Classes
BitSetOps → IterableOps
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def iterableFactory: Set.type

Definition Classes
BitSet → IterableOps
def iterator(): Iterator[Int]

Definition Classes
BitSetOps
def keysIteratorFrom(start: Int): Iterator[Int]
Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to start according to the ordering of this collection.
Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to start according to the ordering of this collection. x.keysIteratorFrom(y) is equivalent to but often more efficient than x.from(y).keysIterator.
start
The lower bound (inclusive) on the keys to be returned

Definition Classes
BitSetOps → SortedOps
def knownSize: Int
The number of elements in this collection, if it can be cheaply computed, -1 otherwise.
The number of elements in this collection, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

Definition Classes
IterableOps
def last: Int
Selects the last element.
Selects the last element. $orderDependent
returns
The last element of this $coll.

Definition Classes
IterableOps
Exceptions thrown
NoSuchElementException If the $coll is empty.
def lastKey: Int
Returns the last key of the collection.
Returns the last key of the collection.

Definition Classes
SortedSetOps → SortedOps
def lastOption: Option[Int]
Optionally selects the last element.
Optionally selects the last element. $orderDependent
returns
the last element of this $coll$ if it is nonempty, None if it is empty.

Definition Classes
IterableOps
def map(f: (Int) ⇒ Int): BitSet
Builds a new bitset by applying a function to all elements of this bitset
Builds a new bitset by applying a function to all elements of this bitset
f
the function to apply to each element.
returns
a new bitset resulting from applying the given function f to each element of this bitset and collecting the results

Definition Classes
BitSetOps
def map[B](f: (Int) ⇒ B)(implicit arg0: Ordering[B]): SortedSet[B]
Map
Map

Definition Classes
SortedSetOps
def map[B](f: (Int) ⇒ B): Set[B]
Builds a new collection by applying a function to all elements of this $coll.
Builds a new collection by applying a function to all elements of this $coll.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new $coll resulting from applying the given function f to each element of this $coll and collecting the results.

Definition Classes
IterableOps
def max: Int
[use case] Finds the largest element.
[use case]
Finds the largest element.
returns
the largest element of this immutable bitset.

Definition Classes
IterableOps
Full Signature
def max[B >: Int](implicit ord: Ordering[B]): Int
def maxBy[B](f: (Int) ⇒ B): Int
[use case] Finds the first element which yields the largest value measured by function f.
[use case]
Finds the first element which yields the largest value measured by function f.
B
The result type of the function f.
f
The measuring function.
returns
the first element of this immutable bitset with the largest value measured by function f.

Definition Classes
IterableOps
Full Signature
def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int
def min: Int
[use case] Finds the smallest element.
[use case]
Finds the smallest element.
returns
the smallest element of this immutable bitset

Definition Classes
IterableOps
Full Signature
def min[B >: Int](implicit ord: Ordering[B]): Int
def minBy[B](f: (Int) ⇒ B): Int
[use case] Finds the first element which yields the smallest value measured by function f.
[use case]
Finds the first element which yields the smallest value measured by function f.
B
The result type of the function f.
f
The measuring function.
returns
the first element of this immutable bitset with the smallest value measured by function f.

Definition Classes
IterableOps
Full Signature
def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int
def mkString: String

Definition Classes
IterableOps
def mkString(sep: String): String

Definition Classes
IterableOps
def mkString(start: String, sep: String, end: String): String
A string showing all elements of this collection, separated by string sep.
A string showing all elements of this collection, separated by string sep.

Definition Classes
IterableOps
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newSpecificBuilder(): Builder[Int, BitSet]
returns
a strict builder for the same collection type. Note that in the case of lazy collections (e.g. View or immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented on top of views rather than builders.

Attributes
protected[this]
Definition Classes
BitSet → IterableOps
def nonEmpty: Boolean
Is the collection not empty?
Is the collection not empty?

Definition Classes
IterableOps
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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[strawman.collection]
Definition Classes
BitSet1 → BitSetOps
final def ordering: Ordering[Int]

Definition Classes
BitSetOps → SortedOps
def partition(p: (Int) ⇒ Boolean): (BitSet, BitSet)
Optimized, push-based version of partition.
Optimized, push-based version of partition.

Definition Classes
StrictOptimizedIterableOps → IterableOps
def prependAll[B](that: <error>): <error>
[use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
[use case]
As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.
Example:
```
scala> val x = List(1)
x: List[Int] = List(1)

scala> val y = Vector(2)
y: scala.collection.immutable.Vector[Int] = Vector(2)

scala> val z = x ++: y
z: scala.collection.immutable.Vector[Int] = Vector(1, 2)
```
B
the element type of the returned collection.
returns
a new immutable bitset which contains all elements of prefix followed by all the elements of this immutable bitset.

Definition Classes
IterableOps
Full Signature
def prependAll[B >: Int](prefix: collection.Iterable[B]): Set[B]
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.

Definition Classes
IterableOps
Full Signature
def product[B >: Int](implicit num: Numeric[B]): B
def range(from: Int, until: Int): BitSet
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
from
The lower-bound (inclusive) of the ranged projection.
until
The upper-bound (exclusive) of the ranged projection.

Definition Classes
SortedOps
def rangeImpl(from: Option[Int], until: Option[Int]): BitSet
Creates a ranged projection of this collection.
Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa.
Note: keys are not guaranteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.
from
The lower-bound (inclusive) of the ranged projection. None if there is no lower bound.
until
The upper-bound (exclusive) of the ranged projection. None if there is no upper bound.

Definition Classes
BitSetOps → SortedOps
def reduce[B >: Int](op: (B, B) ⇒ B): B
Reduces the elements of this $coll using the specified associative binary operator.
Reduces the elements of this $coll using the specified associative binary operator.
$undefinedorder
B
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
The result of applying reduce operator op between all the elements if the $coll is nonempty.

Definition Classes
IterableOps
Exceptions thrown
UnsupportedOperationException if this $coll is empty.
def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B
Applies a binary operator to all elements of this $coll, going left to right.
Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this $coll, going left to right:
```
op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
```
where x₁, ..., x_n are the elements of this $coll.
Definition Classes
IterableOps
Exceptions thrown
UnsupportedOperationException if this $coll is empty.
def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going left to right.
Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) if this $coll is nonempty, None otherwise.

Definition Classes
IterableOps
def reduceOption[B >: Int](op: (B, B) ⇒ B): Option[B]
Reduces the elements of this $coll, if any, using the specified associative binary operator.
Reduces the elements of this $coll, if any, using the specified associative binary operator.
$undefinedorder
B
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

Definition Classes
IterableOps
def reduceRight[B >: Int](op: (Int, B) ⇒ B): B
Applies a binary operator to all elements of this $coll, going right to left.
Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this $coll, going right to left:
```
op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
```
where x₁, ..., x_n are the elements of this $coll.
Definition Classes
IterableOps
Exceptions thrown
UnsupportedOperationException if this $coll is empty.
def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going right to left.
Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) if this $coll is nonempty, None otherwise.

Definition Classes
IterableOps
def reversed: collection.Iterable[Int]

Attributes
protected[this]
Definition Classes
IterableOps
def scan[B >: Int](z: B)(op: (B, B) ⇒ B): Set[B]
Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z may be applied more than once.
B
element type of the resulting collection
z
neutral element for the operator op
op
the associative operator for the scan
returns
a new $coll containing the prefix scan of the elements in this $coll

Definition Classes
IterableOps
def scanLeft[B](z: B)(op: (B, Int) ⇒ B): Set[B]
Produces a collection containing cumulative results of applying the operator going left to right.
Produces a collection containing cumulative results of applying the operator going left to right.
$willNotTerminateInf $orderDependent
B
the type of the elements in the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
collection with intermediate results

Definition Classes
IterableOps
def scanRight[B](z: B)(op: (Int, B) ⇒ B): Set[B]
Produces a collection containing cumulative results of applying the operator going right to left.
Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result. $willNotTerminateInf $orderDependent
Example:
```
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
```
B
the type of the elements in the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
collection with intermediate results

Definition Classes
IterableOps
def size: Int
The number of elements in this collection.
The number of elements in this collection. Does not terminate for infinite collections.

Definition Classes
BitSetOps → IterableOps
def slice(from: Int, until: Int): BitSet
Selects an interval of elements.
Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:
```
from <= indexOf(x) < until
```
$orderDependent
from
the lowest index to include from this $coll.
until
the lowest index to EXCLUDE from this $coll.
returns
a $coll containing the elements greater than or equal to index from extending up to (but not including) index until of this $coll.

Definition Classes
IterableOps
def sliding(size: Int, step: Int): Iterator[BitSet]
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
size
the number of elements per group
step
the distance between the first elements of successive groups
returns
An iterator producing ${coll}s of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

Definition Classes
IterableOps
See also
scala.collection.Iterator, method sliding
def sliding(size: Int): Iterator[BitSet]
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) The "sliding window" step is set to one.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) The "sliding window" step is set to one.
size
the number of elements per group
returns
An iterator producing ${coll}s of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

Definition Classes
IterableOps
See also
scala.collection.Iterator, method sliding
def sortedFromIterable[B](it: collection.Iterable[B])(implicit arg0: Ordering[B]): SortedSet[B]

Attributes
protected[this]
Definition Classes
BitSet → SortedSetOps
def sortedIterableFactory: SortedSet.type

Definition Classes
BitSet → SortedSetOps
def span(p: (Int) ⇒ Boolean): (BitSet, BitSet)
Splits this $coll into a prefix/suffix pair according to a predicate.
Splits this $coll 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. $orderDependent
p
the test predicate
returns
a pair consisting of the longest prefix of this $coll whose elements all satisfy p, and the rest of this $coll.

Definition Classes
StrictOptimizedIterableOps → IterableOps
def splitAt(n: Int): (BitSet, BitSet)
Splits this $coll into two at a given position.
Splits this $coll into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n). $orderDependent
n
the position at which to split.
returns
a pair of ${coll}s consisting of the first n elements of this $coll, and the other elements.

Definition Classes
IterableOps
def subsetOf(that: collection.Set[Int]): Boolean
Tests whether this set is a subset of another set.
Tests whether this set is a subset of another set.
that
the set to test.
returns
true if this set is a subset of that, i.e. if every element of this set is also an element of that.

Definition Classes
SetOps
def subsets(): Iterator[BitSet]
An iterator over all subsets of this set.
An iterator over all subsets of this set.
returns
the iterator.

Definition Classes
SetOps
def subsets(len: Int): Iterator[BitSet]
An iterator over all subsets of this set of the given size.
An iterator over all subsets of this set of the given size. If the requested size is impossible, an empty iterator is returned.
len
the size of the subsets.
returns
the iterator.

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

Definition Classes
IterableOps
Full Signature
def sum[B >: Int](implicit num: Numeric[B]): B
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: BitSet
The rest of the collection without its first element.
The rest of the collection without its first element.

Definition Classes
IterableOps
def take(n: Int): BitSet
A collection containing the first n elements of this collection.
A collection containing the first n elements of this collection.

Definition Classes
IterableOps
def takeRight(n: Int): BitSet
A collection containing the last n elements of this collection.
A collection containing the last n elements of this collection.

Definition Classes
IterableOps
def takeWhile(p: (Int) ⇒ Boolean): BitSet
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate. $orderDependent
p
The predicate used to test elements.
returns
the longest prefix of this $coll whose elements all satisfy the predicate p.

Definition Classes
IterableOps
def to[C1](f: CanBuild[Int, C1]): C1
Given a collection factory fi, convert this collection to the appropriate representation for the current element type A.
Given a collection factory fi, convert this collection to the appropriate representation for the current element type A. Example uses:
xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

Definition Classes
IterableOps
def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
Convert collection to array.
Convert collection to array.

Definition Classes
IterableOps
def toBitMask: Array[Long]
Creates a bit mask for this set as a new array of longs
Creates a bit mask for this set as a new array of longs

Definition Classes
BitSetOps
def toString(): String

Definition Classes
SetOps → Function1 → IterableOps → AnyRef → Any
final def union(that: IterableOnce[Int]): BitSet
Computes the union between of set and another set.
Computes the union between of set and another set.
that
the set to form the union with.
returns
a new set consisting of all elements that are in this set or in the given set that.

Definition Classes
SetOps
Annotations
@inline()
def unordered: Set[Int]

Definition Classes
BitSet
def unzip[A1, A2](implicit asPair: <:<[Int, (A1, A2)]): (Set[A1], Set[A2])
Converts this $coll of pairs into two collections of the first and second half of each pair.
Converts this $coll of pairs into two collections of the first and second half of each pair.
```
val xs = $Coll(
           (1, "one"),
           (2, "two"),
           (3, "three")).unzip
// xs == ($Coll(1, 2, 3),
//        $Coll(one, two, three))
```
A1
the type of the first half of the element pairs
A2
the type of the second half of the element pairs
asPair
an implicit conversion which asserts that the element type of this $coll is a pair.
returns
a pair of ${coll}s, containing the first, respectively second half of each element pair of this $coll.

Definition Classes
StrictOptimizedIterableOps → IterableOps
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[strawman.collection]
Definition Classes
BitSet1 → BitSet
def view: View[Int]
A view representing the elements of this collection.
A view representing the elements of this collection.

Definition Classes
IterableOps
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (Int) ⇒ Boolean): SortedWithFilter
Creates a non-strict filter of this $coll.
Creates a non-strict filter of this $coll.
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. $orderDependent
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 $coll which satisfy the predicate p.

Definition Classes
SortedSetOps → IterableOps
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[strawman.collection]
Definition Classes
BitSet1 → BitSetOps
def xor(other: collection.BitSet): BitSet
Computes the symmetric difference of this bitset and another bitset by performing a bitwise "exclusive-or".
Computes the symmetric difference of this bitset and another bitset by performing a bitwise "exclusive-or".
other
the other bitset to take part in the symmetric difference.
returns
a bitset containing those bits of this bitset or the other bitset that are not contained in both bitsets.

Definition Classes
BitSetOps
def zip[B](xs: IterableOnce[B])(implicit ev: Ordering[(Int, B)]): SortedSet[(Int, B)]
Zip.
Zip. Interesting because it requires to align to source collections.

Definition Classes
SortedSetOps
def zip[B](xs: IterableOnce[B]): Set[(Int, B)]
Returns a $coll formed from this $coll and another iterable collection by combining corresponding elements in pairs.
Returns a $coll formed from this $coll 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
xs
The iterable providing the second half of each result pair
returns
a new collection of type That containing pairs consisting of corresponding elements of this $coll and that. The length of the returned collection is the minimum of the lengths of this $coll and that.

Definition Classes
IterableOps
def zipWithIndex: Set[(Int, Int)]
Zips this $coll with its indices.
Zips this $coll with its indices.
returns
A new collection of type That containing pairs consisting of all elements of this $coll paired with their index. Indices start at 0.
Definition Classes
IterableOps
Example:
1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
final def |(that: IterableOnce[Int]): BitSet
Alias for union
Alias for union

Definition Classes
SetOps
Annotations
@inline()

Packages

BitSet1

class BitSet1 extends BitSet

Instance Constructors

Type Members

Value Members

def max[B >: Int](implicit ord: Ordering[B]): Int

def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def min[B >: Int](implicit ord: Ordering[B]): Int

def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def prependAll[B >: Int](prefix: collection.Iterable[B]): Set[B]

def product[B >: Int](implicit num: Numeric[B]): B

def sum[B >: Int](implicit num: Numeric[B]): B

Inherited from BitSet

Inherited from Serializable

Inherited from Serializable

Inherited from StrictOptimizedIterableOps[Int, Set, BitSet]

Inherited from collection.BitSet

Inherited from BitSetOps[BitSet]

Inherited from SortedSet[Int]

Inherited from SortedSetOps[Int, SortedSet, BitSet]

Inherited from collection.SortedSet[Int]

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

Inherited from SortedOps[Int, BitSet]

Inherited from Set[Int]

Inherited from SetOps[Int, Set, BitSet]

Inherited from collection.Set[Int]

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

Inherited from Equals

Inherited from (Int) ⇒ Boolean

Inherited from Iterable[Int]

Inherited from collection.Iterable[Int]

Inherited from IterableOps[Int, Set, BitSet]

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

BitSet1 

class BitSet1 extends BitSet

Instance Constructors

Type Members

Value Members

def max[B >: Int](implicit ord: Ordering[B]): Int

def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def min[B >: Int](implicit ord: Ordering[B]): Int

def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def prependAll[B >: Int](prefix: collection.Iterable[B]): Set[B]

def product[B >: Int](implicit num: Numeric[B]): B

def sum[B >: Int](implicit num: Numeric[B]): B

Inherited from BitSet

Inherited from Serializable

Inherited from Serializable

Inherited from StrictOptimizedIterableOps[Int, Set, BitSet]

Inherited from collection.BitSet

Inherited from BitSetOps[BitSet]

Inherited from SortedSet[Int]

Inherited from SortedSetOps[Int, SortedSet, BitSet]

Inherited from collection.SortedSet[Int]

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

Inherited from SortedOps[Int, BitSet]

Inherited from Set[Int]

Inherited from SetOps[Int, Set, BitSet]

Inherited from collection.Set[Int]

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

Inherited from Equals

Inherited from (Int) ⇒ Boolean

Inherited from Iterable[Int]

Inherited from collection.Iterable[Int]

Inherited from IterableOps[Int, Set, BitSet]

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Ungrouped

BitSet1