Class scala.collection.immutable.BitSet2

@deprecated("Implementation classes of BitSet should not be accessed directly", "2.13.0")

class BitSet2(val elems0: Long, val elems1: Long) extends BitSet

Concrete methods

Source

override def diff(other: Set[Int]): BitSet

Source

override def filterImpl(pred: Int => Boolean, isFlipped: Boolean): BitSet

Inherited methods

Source@inline

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

Alias for intersect

Source@inline

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

Alias for diff

Source

final override def +(elem: Int): BitSet

Alias for incl

Source@inline

final def ++(that: IterableOnce[Int]): BitSet

Alias for concat

Source@inline

final def ++[B >: Int](suffix: IterableOnce[B]): Set[B]

Alias for concat

Source@inline

final override def -(elem: Int): BitSet

Alias for excl

Source

final override def --(that: IterableOnce[Int]): BitSet

Alias for removedAll

Source@inline

final def ^(other: BitSet): BitSet

Source@inline

final def addString(b: StringBuilder): StringBuilder

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

Example:

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

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

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

Source@inline

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

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

Example:

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

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

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

Source

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

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

Example:

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

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

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

Source@unspecialized

def andThen[A](g: Boolean => A): Int => A

Composes two instances of Function1 in a new Function1, with this function applied first.

Source@inline

final def apply(elem: Int): Boolean

Tests if some element is contained in this set.

This method is equivalent to contains. It allows sets to be interpreted as predicates.

Source

def bitSetFactory: SpecificIterableFactory[Int, BitSet]

Source

def canEqual(that: Any): Boolean

Source

override def collect[B](pf: PartialFunction[Int, B])(implicit @implicitNotFound ev: Ordering[B]): SortedSet[B]

Source

override def collect(pf: PartialFunction[Int, Int]): BitSet

Source

override def collect[B](pf: PartialFunction[Int, B]): Set[B]

Source

def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

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

Note: may not terminate for infinite-sized collections.

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

Source@unspecialized

def compose[A](g: A => Int): A => Boolean

Composes two instances of Function1 in a new Function1, with this function applied last.

Source

override def concat(other: IterableOnce[Int]): BitSet

Source

def concat[B >: Int](suffix: IterableOnce[B]): Set[B]

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

Source

def contains(elem: Int): Boolean

Source

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

Copy elements to an array, returning the number of elements written.

Fills the given array xs starting at index start with at most len elements of this collection.

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

Source@deprecatedOverriding("This should always forward to the 3-arg version of this method", since = "2.13.4")

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

Copy elements to an array, returning the number of elements written.

Fills the given array xs starting at index start with values of this collection.

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

Source@deprecatedOverriding("This should always forward to the 3-arg version of this method", since = "2.13.4")

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

Copy elements to an array, returning the number of elements written.

Fills the given array xs starting at index start with values of this collection.

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

Source

def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean

Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

Note: will not terminate for infinite-sized collections.

Source

def count(p: Int => Boolean): Int

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

Note: will not terminate for infinite-sized collections.

Source

def drop(n: Int): BitSet

Source

override def dropRight(n: Int): BitSet

The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

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

Source

def dropWhile(p: Int => Boolean): BitSet

Source

override def empty: BitSet

Source

override def equals(that: Any): Boolean

Source

def excl(elem: Int): BitSet

Source

def exists(p: Int => Boolean): Boolean

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

Note: may not terminate for infinite-sized collections.

Source

override def filter(pred: Int => Boolean): BitSet

Source

override def filterNot(pred: Int => Boolean): BitSet

Source

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

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

Note: may not terminate for infinite-sized collections.

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

Source

def firstKey: Int

Source

override def flatMap[B](f: Int => IterableOnce[B])(implicit @implicitNotFound ev: Ordering[B]): SortedSet[B]

Source

override def flatMap(f: Int => IterableOnce[Int]): BitSet

Source

override def flatMap[B](f: Int => IterableOnce[B]): Set[B]

Source

override def flatten[B](implicit toIterableOnce: Int => IterableOnce[B]): Set[B]

Source

def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1

Folds the elements of this collection using the specified associative binary operator. The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

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

Note: will not terminate for infinite-sized collections.

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

def forall(p: Int => Boolean): Boolean

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

Note: may not terminate for infinite-sized collections.

Source

override def foreach[U](f: Int => U): Unit

Source

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

Partitions this iterable collection into a map of iterable collections according to some discriminator function.

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

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

Source

def groupMap[K, B](key: Int => K)(f: Int => B): Map[K, Set[B]]

Partitions this iterable collection into a map of iterable collections according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

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

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

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

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

Source

def groupMapReduce[K, B](key: Int => K)(f: Int => B)(reduce: (B, B) => B): Map[K, B]

Partitions this iterable collection into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the f function and then reduced into a single value with the reduce function.

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

def occurrences[A](as: Seq[A]): Map[A, Int] =
  as.groupMapReduce(identity)(_ => 1)(_ + _)

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

Source

def grouped(size: Int): Iterator[BitSet]

Partitions elements in fixed size iterable collections.

Source

override def hashCode(): Int

Source

def head: Int

Selects the first element of this iterable collection.

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

Source

def headOption: Option[Int]

Optionally selects the first element.

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

Source

def incl(elem: Int): BitSet

Source

def init: BitSet

The initial part of the collection without its last element.

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

Source

def inits: Iterator[BitSet]

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

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

Source

override def intersect(other: Set[Int]): BitSet

Source

override def isEmpty: Boolean

Source

override def isTraversableAgain: Boolean

Source

override def iterableFactory: IterableFactory[Set]

Source

def iterator: Iterator[Int]

Source

def iteratorFrom(start: Int): Iterator[Int]

Source

def knownSize: Int

Source

def last: Int

Selects the last element.

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

Source

def lastKey: Int

Source

def lastOption: Option[Int]

Optionally selects the last element.

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

Source

def lazyZip[B](that: Iterable[B]): LazyZip2[Int, B, BitSet2]

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

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

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

Source

override def map[B](f: Int => B)(implicit @implicitNotFound ev: Ordering[B]): SortedSet[B]

Source

override def map(f: Int => Int): BitSet

Source

override def map[B](f: Int => B): Set[B]

Source

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

Source

def maxBefore(key: Int): Option[Int]

Find the largest element less than a given key.

Source

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

Finds the first element which yields the largest value measured by function f.

Note: will not terminate for infinite-sized collections.

Source

def maxByOption[B](f: Int => B)(implicit cmp: Ordering[B]): Option[Int]

Finds the first element which yields the largest value measured by function f.

Note: will not terminate for infinite-sized collections.

Source

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

Finds the largest element.

Note: will not terminate for infinite-sized collections.

Source

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

Source

def minAfter(key: Int): Option[Int]

Find the smallest element larger than or equal to a given key.

Source

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

Finds the first element which yields the smallest value measured by function f.

Note: will not terminate for infinite-sized collections.

Source

def minByOption[B](f: Int => B)(implicit cmp: Ordering[B]): Option[Int]

Finds the first element which yields the smallest value measured by function f.

Note: will not terminate for infinite-sized collections.

Source

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

Finds the smallest element.

Note: will not terminate for infinite-sized collections.

Source@inline

final def mkString: String

Displays all elements of this collection in a string.

Delegates to addString, which can be overridden.

Source@inline

final def mkString(sep: String): String

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

Delegates to addString, which can be overridden.

Source

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

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

Delegates to addString, which can be overridden.

Source@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")

def nonEmpty: Boolean

Tests whether the collection is not empty.

Source

final def ordering: Ordering[Int]

Source

override def partition(p: Int => Boolean): (BitSet, BitSet)

Source

override def partitionMap[A1, A2](f: Int => Either[A1, A2]): (Set[A1], Set[A2])

Source

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

Multiplies up the elements of this collection.

Note: will not terminate for infinite-sized collections.

Source

def range(from: Int, until: Int): BitSet

Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

Source

def rangeFrom(from: Int): BitSet

Creates a ranged projection of this collection with no upper-bound.

Source

def rangeImpl(from: Option[Int], until: Option[Int]): BitSet

Source

def rangeTo(to: Int): BitSet

Source

def rangeUntil(until: Int): BitSet

Creates a ranged projection of this collection with no lower-bound.

Source

def reduce[B >: Int](op: (B, B) => B): B

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

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

def reduceOption[B >: Int](op: (B, B) => B): Option[B]

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

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

Source

def reduceRight[B >: Int](op: (Int, B) => B): B

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

Note: will not terminate for infinite-sized collections.

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

def removedAll(that: IterableOnce[Int]): BitSet

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

Source

protected def reversed: Iterable[Int]

Source

def scan[B >: Int](z: B)(op: (B, B) => B): Set[B]

Computes a prefix scan of the elements of the collection.

Note: The neutral element z may be applied more than once.

Source

override def scanLeft[B](z: B)(op: (B, Int) => B): Set[B]

Source

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. The head of the collection is the last cumulative result.

Note: will not terminate for infinite-sized collections.

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

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

Example:

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

Source

override def size: Int

Source

def sizeCompare(that: Iterable[_]): Int

Compares the size of this iterable collection to the size of another Iterable.

x <  0       if this.size <  that.size
x == 0       if this.size == that.size
x >  0       if this.size >  that.size

Source

def sizeCompare(otherSize: Int): Int

Compares the size of this iterable collection to a test value.

x <  0       if this.size <  otherSize
x == 0       if this.size == otherSize
x >  0       if this.size >  otherSize

Source@inline

final def sizeIs: SizeCompareOps

Returns a value class containing operations for comparing the size of this iterable collection to a test value.

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

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

Source

def slice(from: Int, until: Int): BitSet

Source

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

The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

Source

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

An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

Source

override def sortedIterableFactory: SortedIterableFactory[SortedSet]

Source

override def span(p: Int => Boolean): (BitSet, BitSet)

Source

override def splitAt(n: Int): (BitSet, BitSet)

Source

override def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S & EfficientSplit

Source

def subsetOf(that: Set[Int]): Boolean

Tests whether this set is a subset of another set.

Source

def subsets(): Iterator[BitSet]

An iterator over all subsets of this set.

Source

def subsets(len: Int): Iterator[BitSet]

An iterator over all subsets of this set of the given size. If the requested size is impossible, an empty iterator is returned.

Source

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

Sums up the elements of this collection.

Note: will not terminate for infinite-sized collections.

Source

def tail: BitSet

The rest of the collection without its first element.

Source

def tails: Iterator[BitSet]

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

Source

def take(n: Int): BitSet

Source

override def takeRight(n: Int): BitSet

A collection containing the last n elements of this collection.

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

Source

def takeWhile(p: Int => Boolean): BitSet

Takes longest prefix of elements that satisfy a predicate.

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

Source

override def tapEach[U](f: Int => U): BitSet

Source

def to[C1](factory: Factory[Int, C1]): C1

Given a collection factory factory, 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]

Source

def toArray[B >: Int : ClassTag]: Array[B]

Convert collection to array.

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

Source

def toBitMask: Array[Long]

Creates a bit mask for this set as a new array of longs

Source@inline

final def toBuffer[B >: Int]: Buffer[B]

Source

def toIndexedSeq: IndexedSeq[Int]

Source

def toList: List[Int]

Source

def toMap[K, V](implicit ev: Int <:< (K, V)): Map[K, V]

Source

def toSeq: Seq[Int]

Source

def toSet[B >: Int]: Set[B]

Source

override def toString(): String

Source

def toVector: Vector[Int]

Source

def transpose[B](implicit asIterable: Int => Iterable[B]): Set[Set[B]]

Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.

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

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

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

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

Source@inline

final def union(that: Set[Int]): BitSet

Computes the union between of set and another set.

Source

override def unsorted: Set[Int]

Source

override def unzip[A1, A2](implicit asPair: Int => (A1, A2)): (Set[A1], Set[A2])

Source

override def unzip3[A1, A2, A3](implicit asTriple: Int => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

Source

def view: View[Int]

A view over the elements of this collection.

Source

override def withFilter(p: Int => Boolean): WithFilter[Int, Set, SortedSet]

Source

def xor(other: BitSet): BitSet

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

Source

override def zip[B](that: IterableOnce[B])(implicit @implicitNotFound ev: Ordering[(Int, B)]): SortedSet[(Int, B)]

Source

override def zip[B](that: IterableOnce[B]): Set[(Int, B)]

Source

def zipAll[A1 >: Int, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]

Returns a iterable collection formed from this iterable collection 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.

Source

override def zipWithIndex: Set[(Int, Int)]

Source@inline

final def |(that: Set[Int]): BitSet

Alias for union

Concrete fields

Source

val elems0: Long

Source

val elems1: Long