class BitSet1 extends BitSet
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Implementation classes of BitSet should not be accessed directly
- Source
- BitSet.scala
- Alphabetic
- By Inheritance
- BitSet1
- BitSet
- Serializable
- BitSet
- BitSetOps
- StrictOptimizedSortedSetOps
- StrictOptimizedSetOps
- StrictOptimizedSortedSetOps
- StrictOptimizedSetOps
- StrictOptimizedIterableOps
- SortedSet
- SortedSetOps
- SortedSet
- SortedSetFactoryDefaults
- SortedSetOps
- SortedOps
- AbstractSet
- Set
- SetOps
- Iterable
- AbstractSet
- Set
- Equals
- SetOps
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- by iterableOnceExtensionMethods
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
Test two objects for inequality.
Test two objects for inequality.
- returns
trueif !(this == that), false otherwise.
- Definition Classes
- AnyRef → Any
- final def ##: Int
Equivalent to
x.hashCodeexcept for boxed numeric types andnull.Equivalent to
x.hashCodeexcept for boxed numeric types andnull. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. Fornullreturns a hashcode wherenull.hashCodethrows aNullPointerException.- returns
a hash value consistent with ==
- Definition Classes
- AnyRef → Any
- final def &(that: collection.Set[Int]): BitSet
Alias for
intersect - final def &~(that: collection.Set[Int]): BitSet
Alias for
diff - final def +(elem: Int): BitSet
Alias for
incl - final def ++(that: IterableOnce[Int]): BitSet
Alias for
concat - final def ++[B >: Int](suffix: IterableOnce[B]): Set[B]
Alias for
concatAlias for
concat- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def -(elem: Int): BitSet
Alias for
excl - final def --(that: IterableOnce[Int]): BitSet
Alias for removedAll
- def ->[B](y: B): (BitSet1, B)
- Implicit
- This member is added by an implicit conversion from BitSet1 toArrowAssoc[BitSet1] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
The expression
x == thatis equivalent toif (x eq null) that eq null else x.equals(that).The expression
x == thatis equivalent toif (x eq null) that eq null else x.equals(that).- returns
trueif the receiver object is equivalent to the argument;falseotherwise.
- Definition Classes
- AnyRef → Any
- final def ^(other: collection.BitSet): BitSet
- final def addString(b: mutable.StringBuilder): b.type
Appends all elements of this immutable bitset to a string builder.
Appends all elements of this immutable bitset to a string builder. The written text consists of the string representations (w.r.t. the method
toString) of all elements of this immutable bitset without any separator string.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
- b
the string builder to which elements are appended.
- returns
the string builder
bto which elements were appended.
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: mutable.StringBuilder, sep: String): b.type
Appends all elements of this immutable bitset to a string builder using a separator string.
Appends all elements of this immutable bitset to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method
toString) of all elements of this immutable bitset, separated by the stringsep.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
- b
the string builder to which elements are appended.
- sep
the separator string.
- returns
the string builder
bto which elements were appended.
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
Appends all elements of this immutable bitset to a string builder using start, end, and separator strings.
Appends all elements of this immutable bitset to a string builder using start, end, and separator strings. The written text begins with the string
startand ends with the stringend. Inside, the string representations (w.r.t. the methodtoString) of all elements of this immutable bitset are separated by the stringsep.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)
- b
the string builder to which elements are appended.
- start
the starting string.
- sep
the separator string.
- end
the ending string.
- returns
the string builder
bto which elements were appended.
- Definition Classes
- IterableOnceOps
- def andThen[A](g: (Boolean) => A): (Int) => A
Composes two instances of Function1 in a new Function1, with this function applied first.
Composes two instances of Function1 in a new Function1, with this function applied first.
- A
the result type of function
g- g
a function R => A
- returns
a new function
fsuch thatf(x) == g(apply(x))
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def apply(elem: Int): Boolean
Tests if some element is contained in this set.
- final def asInstanceOf[T0]: T0
Cast the receiver object to be of type
T0.Cast the receiver object to be of type
T0.Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression
1.asInstanceOf[String]will throw aClassCastExceptionat runtime, while the expressionList(1).asInstanceOf[List[String]]will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.- returns
the receiver object.
- Definition Classes
- Any
- Exceptions thrown
ClassCastExceptionif the receiver object is not an instance of the erasure of typeT0.
- def bitSetFactory: BitSet
- def canEqual(that: Any): Boolean
A method that should be called from every well-designed equals method that is open to be overridden in a subclass.
A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.
- that
the value being probed for possible equality
- returns
true if this instance can possibly equal
that, otherwise false
- def className: String
Defines the prefix of this object's
toStringrepresentation.Defines the prefix of this object's
toStringrepresentation.It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for
ListMapthis method should return"ListMap", not"Map"(the supertype) or"Node"(an implementation subclass).The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".
- returns
a string representation which starts the result of
toStringapplied to this immutable bitset. By default the string prefix is the simple name of the collection class immutable bitset.
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the
clonemethod is platform dependent.- returns
a copy of the receiver object.
- final def coll: BitSet1.this.type
- returns
This collection as a
C.
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Int, B])(implicit ev: Ordering[B]): SortedSet[B]
Builds a new sorted collection by applying a partial function to all elements of this immutable bitset on which the function is defined.
Builds a new sorted collection by applying a partial function to all elements of this immutable bitset on which the function is defined.
- B
the element type of the returned collection.
- pf
the partial function which filters and maps the immutable bitset.
- returns
a new immutable bitset resulting from applying the given partial function
pfto each element on which it is defined and collecting the results. The order of the elements is preserved.
- Definition Classes
- BitSet → StrictOptimizedSortedSetOps → SortedSetOps
- def collect(pf: PartialFunction[Int, Int]): BitSet
- def collect[B](pf: PartialFunction[Int, B]): Set[B]
Builds a new immutable bitset by applying a partial function to all elements of this immutable bitset on which the function is defined.
Builds a new immutable bitset by applying a partial function to all elements of this immutable bitset on which the function is defined.
- B
the element type of the returned immutable bitset.
- pf
the partial function which filters and maps the immutable bitset.
- returns
a new immutable bitset resulting from applying the given partial function
pfto each element on which it is defined and collecting the results. The order of the elements is preserved.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
Finds the first element of the immutable bitset for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the immutable bitset 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.
- pf
the partial function
- returns
an option value containing pf applied to the first value for which it is defined, or
Noneif none exists.
- Definition Classes
- IterableOnceOps
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
Example: - def compose[A](g: (A) => Int): (A) => Boolean
Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
- A
the type to which function
gcan be applied- g
a function A => T1
- returns
a new function
fsuch thatf(x) == apply(g(x))
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(other: IterableOnce[Int]): BitSet
Creates a new immutable bitset by adding all elements contained in another collection to this immutable bitset, omitting duplicates.
Creates a new immutable bitset by adding all elements contained in another collection to this immutable bitset, omitting duplicates.
This method takes a collection of elements and adds all elements, omitting duplicates, into immutable bitset.
Example:
scala> val a = Set(1, 2) concat Set(2, 3) a: scala.collection.immutable.Set[Int] = Set(1, 2, 3)
- returns
a new immutable bitset with the given elements added, omitting duplicates.
- def concat[B >: Int](suffix: IterableOnce[B]): Set[B]
Returns a new immutable bitset containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new immutable bitset containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the immutable bitset 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 immutable bitset which contains all elements of this immutable bitset followed by all elements of
suffix.
- Definition Classes
- IterableOps
- def contains(elem: Int): Boolean
- def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
Copy elements to an array, returning the number of elements written.
Copy elements to an array, returning the number of elements written.
Fills the given array
xsstarting at indexstartwith at mostlenelements of this immutable bitset.Copying will stop once either all the elements of this immutable bitset have been copied, or the end of the array is reached, or
lenelements have been copied.- B
the type of the elements of the array.
- xs
the array to fill.
- start
the starting index of xs.
- len
the maximal number of elements to copy.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- Note
Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.
- def copyToArray[B >: Int](xs: Array[B], start: Int): Int
Copy elements to an array, returning the number of elements written.
Copy elements to an array, returning the number of elements written.
Fills the given array
xsstarting at indexstartwith values of this immutable bitset.Copying will stop once either all the elements of this immutable bitset have been copied, 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 of xs.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- Note
Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.
- def copyToArray[B >: Int](xs: Array[B]): Int
Copy elements to an array, returning the number of elements written.
Copy elements to an array, returning the number of elements written.
Fills the given array
xsstarting at indexstartwith values of this immutable bitset.Copying will stop once either all the elements of this immutable bitset have been copied, or the end of the array is reached.
- B
the type of the elements of the array.
- xs
the array to fill.
- returns
the number of elements written to the array
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- Note
Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.
- 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.
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.
- B
the type of the elements of
that- that
the other collection
- p
the test predicate, which relates elements from both collections
- returns
trueif both collections have the same length andp(x, y)istruefor all corresponding elementsxof this iterator andyofthat, otherwisefalse
- Definition Classes
- IterableOnceOps
- def count(p: (Int) => Boolean): Int
Counts the number of elements in the immutable bitset which satisfy a predicate.
Counts the number of elements in the immutable bitset which satisfy a predicate.
Note: will not terminate for infinite-sized collections.
- p
the predicate used to test elements.
- returns
the number of elements satisfying the predicate
p.
- Definition Classes
- IterableOnceOps
- def diff(other: collection.Set[Int]): BitSet
Computes the difference of this set and another set.
- def drop(n: Int): BitSet
Selects all elements except first n ones.
Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- n
the number of elements to drop from this immutable bitset.
- returns
a immutable bitset consisting of all elements of this immutable bitset except the first
nones, or else the empty immutable bitset, if this immutable bitset has less thannelements. Ifnis negative, don't drop any elements.
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): BitSet
The rest of the collection without its
nlast elements.The rest of the collection without its
nlast 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.
- n
the number of elements to drop from this immutable bitset.
- returns
a immutable bitset consisting of all elements of this immutable bitset except the last
nones, or else the empty immutable bitset, if this immutable bitset has less thannelements. Ifnis negative, don't drop any elements.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def dropWhile(p: (Int) => Boolean): BitSet
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
The predicate used to test elements.
- returns
the longest suffix of this immutable bitset whose first element does not satisfy the predicate
p.
- Definition Classes
- IterableOps → IterableOnceOps
- val elems: Long
- def empty: BitSet
The empty iterable of the same type as this iterable
The empty iterable of the same type as this iterable
- returns
an empty iterable of type
C.
- Definition Classes
- BitSet → BitSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
- def ensuring(cond: (BitSet1) => Boolean, msg: => Any): BitSet1
- Implicit
- This member is added by an implicit conversion from BitSet1 toEnsuring[BitSet1] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (BitSet1) => Boolean): BitSet1
- Implicit
- This member is added by an implicit conversion from BitSet1 toEnsuring[BitSet1] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): BitSet1
- Implicit
- This member is added by an implicit conversion from BitSet1 toEnsuring[BitSet1] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): BitSet1
- Implicit
- This member is added by an implicit conversion from BitSet1 toEnsuring[BitSet1] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
Tests whether the argument (
that) is a reference to the receiver object (this).Tests whether the argument (
that) is a reference to the receiver object (this).The
eqmethod implements an equivalence relation on non-null instances ofAnyRef, and has three additional properties:- It is consistent: for any non-null instances
xandyof typeAnyRef, multiple invocations ofx.eq(y)consistently returnstrueor consistently returnsfalse. - For any non-null instance
xof typeAnyRef,x.eq(null)andnull.eq(x)returnsfalse. null.eq(null)returnstrue.
When overriding the
equalsorhashCodemethods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).- returns
trueif the argument is a reference to the receiver object;falseotherwise.
- Definition Classes
- AnyRef
- It is consistent: for any non-null instances
- def equals(that: Any): Boolean
Equality of sets is implemented using the lookup method contains.
Equality of sets is implemented using the lookup method contains. This method returns
trueif- the argument
thatis aSet, - the two sets have the same size, and
- for every
elementthis set,other.contains(element) == true.
The implementation of
equalschecks the canEqual method, so subclasses ofSetcan narrow down the equality to specific set types. TheSetimplementations in the standard library can all be compared, theircanEqualmethods returntrue.Note: The
equalsmethod only respects the equality laws (symmetry, transitivity) if the two sets use the same element equivalence function in their lookup operation. For example, the element equivalence operation in a scala.collection.immutable.TreeSet is defined by its ordering. Comparing aTreeSetwith aHashSetleads to unexpected results ifordering.equiv(e1, e2)(used for lookup inTreeSet) is different frome1 == e2(used for lookup inHashSet).scala> import scala.collection.immutable._ scala> val ord: Ordering[String] = _ compareToIgnoreCase _ scala> TreeSet("A")(ord) == HashSet("a") val res0: Boolean = false scala> HashSet("a") == TreeSet("A")(ord) val res1: Boolean = true
- that
The set to which this set is compared
- returns
trueif the two sets are equal according to the description
- the argument
- def excl(elem: Int): BitSet
Creates a new set with a given element removed from this set.
- def exists(p: (Int) => Boolean): Boolean
Tests whether a predicate holds for at least one element of this immutable bitset.
Tests whether a predicate holds for at least one element of this immutable bitset.
Note: may not terminate for infinite-sized collections.
- p
the predicate used to test elements.
- returns
trueif the given predicatepis satisfied by at least one element of this immutable bitset, otherwisefalse
- Definition Classes
- IterableOnceOps
- def filter(pred: (Int) => Boolean): BitSet
Selects all elements of this immutable bitset which satisfy a predicate.
Selects all elements of this immutable bitset which satisfy a predicate.
- returns
a new immutable bitset consisting of all elements of this immutable bitset that satisfy the given predicate
p. The order of the elements is preserved.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def filterImpl(pred: (Int) => Boolean, isFlipped: Boolean): BitSet
- Definition Classes
- BitSet1 → StrictOptimizedIterableOps
- def filterNot(pred: (Int) => Boolean): BitSet
Selects all elements of this immutable bitset which do not satisfy a predicate.
Selects all elements of this immutable bitset which do not satisfy a predicate.
- pred
the predicate used to test elements.
- returns
a new immutable bitset consisting of all elements of this immutable bitset that do not satisfy the given predicate
pred. Their order may not be preserved.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the
finalizemethod is invoked, as well as the interaction betweenfinalizeand non-local returns and exceptions, are all platform dependent.- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- Note
not specified by SLS as a member of AnyRef
- def find(p: (Int) => Boolean): Option[Int]
Finds the first element of the immutable bitset satisfying a predicate, if any.
Finds the first element of the immutable bitset satisfying a predicate, if any.
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
the predicate used to test elements.
- returns
an option value containing the first element in the immutable bitset that satisfies
p, orNoneif none exists.
- Definition Classes
- IterableOnceOps
- def firstKey: Int
Returns the first key of the collection.
Returns the first key of the collection.
- Definition Classes
- SortedSetOps → SortedOps
- def flatMap[B](f: (Int) => IterableOnce[B])(implicit ev: Ordering[B]): SortedSet[B]
Builds a new sorted collection by applying a function to all elements of this immutable bitset and using the elements of the resulting collections.
Builds a new sorted collection by applying a function to all elements of this immutable bitset and using the elements of the resulting collections.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new immutable bitset resulting from applying the given collection-valued function
fto each element of this immutable bitset and concatenating the results.
- Definition Classes
- BitSet → StrictOptimizedSortedSetOps → SortedSetOps
- def flatMap(f: (Int) => IterableOnce[Int]): BitSet
- def flatMap[B](f: (Int) => IterableOnce[B]): Set[B]
Builds a new immutable bitset by applying a function to all elements of this immutable bitset and using the elements of the resulting collections.
Builds a new immutable bitset by applying a function to all elements of this immutable bitset and using the elements of the resulting collections.
For example:
def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")
The type of the resulting collection is guided by the static type of immutable bitset. This might cause unexpected results sometimes. For example:
// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet) // lettersOf will return a Set[Char], not a Seq def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq) // xs will be an Iterable[Int] val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2) // ys will be a Map[Int, Int] val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new immutable bitset resulting from applying the given collection-valued function
fto each element of this immutable bitset and concatenating the results.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def flatten[B](implicit toIterableOnce: (Int) => IterableOnce[B]): Set[B]
Converts this immutable bitset of traversable collections into a immutable bitset formed by the elements of these traversable collections.
Converts this immutable bitset of traversable collections into a immutable bitset formed by the elements of these traversable collections.
The resulting collection's type will be guided by the type of immutable bitset. For example:
val xs = List( Set(1, 2, 3), Set(1, 2, 3) ).flatten // xs == List(1, 2, 3, 1, 2, 3) val ys = Set( List(1, 2, 3), List(3, 2, 1) ).flatten // ys == Set(1, 2, 3)
- B
the type of the elements of each traversable collection.
- returns
a new immutable bitset resulting from concatenating all element immutable bitsets.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1
Folds the elements of this immutable bitset using the specified associative binary operator.
Folds the elements of this immutable bitset using the specified associative binary operator. The default implementation in
IterableOnceis equivalent tofoldLeftbut 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.
- A1
a type parameter for the binary operator, a supertype of
A.- z
a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g.,
Nilfor list concatenation, 0 for addition, or 1 for multiplication).- op
a binary operator that must be associative.
- returns
the result of applying the fold operator
opbetween all the elements andz, orzif this immutable bitset is empty.
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Int) => B): B
Applies a binary operator to a start value and all elements of this immutable bitset, going left to right.
Applies a binary operator to a start value and all elements of this immutable bitset, going left to right.
Note: 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.
- B
the result type of the binary operator.
- z
the start value.
- op
the binary operator.
- returns
the result of inserting
opbetween consecutive elements of this immutable bitset, going left to right with the start valuezon the left:op(...op(z, x1), x2, ..., xn)wherex1, ..., xnare the elements of this immutable bitset. Returnszif this immutable bitset is empty.
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Int, B) => B): B
Applies a binary operator to all elements of this immutable bitset and a start value, going right to left.
Applies a binary operator to all elements of this immutable bitset and a start value, going right to left.
Note: 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.
- B
the result type of the binary operator.
- z
the start value.
- op
the binary operator.
- returns
the result of inserting
opbetween consecutive elements of this immutable bitset, going right to left with the start valuezon the right:op(x1, op(x2, ... op(xn, z)...))wherex1, ..., xnare the elements of this immutable bitset. Returnszif this immutable bitset is empty.
- Definition Classes
- IterableOnceOps
- def forall(p: (Int) => Boolean): Boolean
Tests whether a predicate holds for all elements of this immutable bitset.
Tests whether a predicate holds for all elements of this immutable bitset.
Note: may not terminate for infinite-sized collections.
- p
the predicate used to test elements.
- returns
trueif this immutable bitset is empty or the given predicatepholds for all elements of this immutable bitset, otherwisefalse.
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Int) => U): Unit
Apply
fto each element for its side effects Note: [U] parameter needed to help scalac's type inference.Apply
fto each element for its side effects Note: [U] parameter needed to help scalac's type inference.- Definition Classes
- BitSetOps → IterableOnceOps
- 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[collection]
- Definition Classes
- BitSet → BitSetOps
- def fromSpecific(coll: IterableOnce[Int]): BitSet
Defines how to turn a given
Iterable[A]into a collection of typeC.Defines how to turn a given
Iterable[A]into a collection of typeC.This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.
- Attributes
- protected
- Definition Classes
- BitSet → BitSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
- Note
When implementing a custom collection type and refining
,Cto the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case whereC =:= CC[A], this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.As witnessed by the
@uncheckedVarianceannotation, using this method might be unsound. However, as long as it is called with anIterable[A]obtained fromthiscollection (as it is the case in the implementations of operations where we use aView[A]), it is safe.
- final def getClass(): Class[_ <: AnyRef]
Returns the runtime class representation of the object.
- def groupBy[K](f: (Int) => K): Map[K, BitSet]
Partitions this immutable bitset into a map of immutable bitsets according to some discriminator function.
Partitions this immutable bitset into a map of immutable bitsets according to some discriminator function.
Note: Even 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 immutable bitsets such that the following invariant holds:
(xs groupBy f)(k) = xs filter (x => f(x) == k)That is, every key
kis bound to a immutable bitset of those elementsxfor whichf(x)equalsk.
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Int) => K)(f: (Int) => B): Map[K, Set[B]]
Partitions this immutable bitset into a map of immutable bitsets according to a discriminator function
key.Partitions this immutable bitset into a map of immutable bitsets according to a discriminator function
key. Each element in a group is transformed into a value of typeBusing thevaluefunction.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.
- K
the type of keys returned by the discriminator function
- B
the type of values returned by the transformation function
- key
the discriminator function
- f
the element transformation function
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): Map[K, B]
Partitions this immutable bitset into a map according to a discriminator function
key.Partitions this immutable bitset into a map according to a discriminator function
key. All the values that have the same discriminator are then transformed by theffunction and then reduced into a single value with thereducefunction.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.
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[BitSet]
Partitions elements in fixed size immutable bitsets.
Partitions elements in fixed size immutable bitsets.
- size
the number of elements per group
- returns
An iterator producing immutable bitsets of size
size, except the last will be less than sizesizeif the elements don't divide evenly.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
grouped
- def hashCode(): Int
The hashCode method for reference types.
- def head: Int
Selects the first element of this immutable bitset.
Selects the first element of this immutable bitset.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the first element of this immutable bitset.
- Definition Classes
- IterableOps
- Exceptions thrown
NoSuchElementExceptionif the immutable bitset is empty.
- def headOption: Option[Int]
Optionally selects the first element.
Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the first element of this immutable bitset if it is nonempty,
Noneif it is empty.
- Definition Classes
- IterableOps
- def incl(elem: Int): BitSet
Creates a new set with an additional element, unless the element is already present.
- def init: BitSet
The initial part of the collection without its last element.
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.
- Definition Classes
- IterableOps
- def inits: Iterator[BitSet]
Iterates over the inits of this immutable bitset.
Iterates over the inits of this immutable bitset. The first value will be this immutable bitset and the final one will be an empty immutable bitset, 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.
- returns
an iterator over all the inits of this immutable bitset
- Definition Classes
- IterableOps
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
Example: - def intersect(other: collection.Set[Int]): BitSet
Computes the intersection between this set and another set.
- def isEmpty: Boolean
Tests whether the immutable bitset is empty.
Tests whether the immutable bitset is empty.
Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when
isEmptyis called.- returns
trueif the immutable bitset contains no elements,falseotherwise.
- Definition Classes
- BitSetOps → IterableOnceOps
- final def isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object has the same erasure as
T0.Test whether the dynamic type of the receiver object has the same erasure as
T0.Depending on what
T0is, the test is done in one of the below ways:T0is a non-parameterized class type, e.g.BigDecimal: this method returnstrueif the value of the receiver object is aBigDecimalor a subtype ofBigDecimal.T0is a parameterized class type, e.g.List[Int]: this method returnstrueif the value of the receiver object is someList[X]for anyX. For example,List(1, 2, 3).isInstanceOf[List[String]]will return true.T0is some singleton typex.typeor literalx: this method returnsthis.eq(x). For example,x.isInstanceOf[1]is equivalent tox.eq(1)T0is an intersectionX with YorX & Y: this method is equivalent tox.isInstanceOf[X] && x.isInstanceOf[Y]T0is a unionX | Y: this method is equivalent tox.isInstanceOf[X] || x.isInstanceOf[Y]T0is a type parameter or an abstract type member: this method is equivalent toisInstanceOf[U]whereUisT0's upper bound,AnyifT0is unbounded. For example,x.isInstanceOf[A]whereAis an unbounded type parameter will return true for any value ofx.
This is exactly equivalent to the type pattern
_: T0- returns
trueif the receiver object is an instance of erasure of typeT0;falseotherwise.
- Definition Classes
- Any
- Note
due to the unexpectedness of
List(1, 2, 3).isInstanceOf[List[String]]returning true andx.isInstanceOf[A]whereAis a type parameter or abstract member returning true, these forms issue a warning.
- def isTraversableAgain: Boolean
Tests whether this immutable bitset can be repeatedly traversed.
Tests whether this immutable bitset can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.
- returns
trueif it is repeatedly traversable,falseotherwise.
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Set]
The companion object of this immutable bitset, providing various factory methods.
The companion object of this immutable bitset, providing various factory methods.
- Definition Classes
- Set → Set → Iterable → Iterable → IterableOps
- Note
When implementing a custom collection type and refining
CCto the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).
- def iterator: Iterator[Int]
Iterator can be used only once
Iterator can be used only once
- Definition Classes
- BitSetOps → IterableOnce
- def iteratorFrom(start: Int): Iterator[Int]
Creates an iterator that contains all values from this collection greater than or equal to
startaccording to the ordering of this collection.Creates an iterator that contains all values from this collection greater than or equal to
startaccording to the ordering of this collection. x.iteratorFrom(y) is equivalent to but will usually be more efficient than x.from(y).iterator- start
The lower-bound (inclusive) of the iterator
- Definition Classes
- BitSetOps → SortedSetOps
- def knownSize: Int
- returns
The number of elements in this immutable bitset, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.
- Definition Classes
- IterableOnce
- def last: Int
Selects the last element.
Selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
The last element of this immutable bitset.
- Definition Classes
- IterableOps
- Exceptions thrown
NoSuchElementExceptionIf the immutable bitset 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.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the last element of this immutable bitset$ if it is nonempty,
Noneif it is empty.
- Definition Classes
- IterableOps
- def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Int, B, BitSet1.this.type]
Analogous to
zipexcept that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2decorator.Analogous to
zipexcept that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2decorator.Calls to
lazyZipcan 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)
- B
the type of the second element in each eventual pair
- that
the iterable providing the second element of each eventual pair
- returns
a decorator
LazyZip2that allows strict operations to be performed on the lazily evaluated pairs or chained calls tolazyZip. Implicit conversion toIterable[(A, B)]is also supported.
- Definition Classes
- Iterable
- def map[B](f: (Int) => B)(implicit ev: Ordering[B]): SortedSet[B]
Builds a new sorted collection by applying a function to all elements of this immutable bitset.
Builds a new sorted collection by applying a function to all elements of this immutable bitset.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new immutable bitset resulting from applying the given function
fto each element of this immutable bitset and collecting the results.
- Definition Classes
- BitSet → StrictOptimizedSortedSetOps → SortedSetOps
- def map(f: (Int) => Int): BitSet
Builds a new bitset by applying a function to all elements of this bitset
- def map[B](f: (Int) => B): Set[B]
Builds a new immutable bitset by applying a function to all elements of this immutable bitset.
Builds a new immutable bitset by applying a function to all elements of this immutable bitset.
- B
the element type of the returned immutable bitset.
- f
the function to apply to each element.
- returns
a new immutable bitset resulting from applying the given function
fto each element of this immutable bitset and collecting the results.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def max[B >: Int](implicit ord: Ordering[B]): Int
Finds the largest element.
Finds the largest element.
Note: will not terminate for infinite-sized collections.
- B
The type over which the ordering is defined.
- ord
An ordering to be used for comparing elements.
- returns
the largest element of this immutable bitset with respect to the ordering
ord.
- Definition Classes
- BitSetOps → SortedSetOps → IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def maxBefore(key: Int): Option[Int]
Find the largest element less than a given key.
Find the largest element less than a given key.
- key
The given key.
- returns
Noneif there is no such node.
- Definition Classes
- SortedSetOps
- def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
Finds the first element which yields the largest value measured by function f.
Finds the first element which yields the largest value measured by function f.
Note: will not terminate for infinite-sized collections.
- B
The result type of the function f.
- f
The measuring function.
- cmp
An ordering to be used for comparing elements.
- returns
the first element of this immutable bitset with the largest value measured by function f with respect to the ordering
cmp.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def maxByOption[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Option[Int]
Finds the first element which yields the largest value measured by function f.
Finds the first element which yields the largest value measured by function f.
Note: will not terminate for infinite-sized collections.
- B
The result type of the function f.
- f
The measuring function.
- cmp
An ordering to be used for comparing elements.
- returns
an option value containing the first element of this immutable bitset with the largest value measured by function f with respect to the ordering
cmp.
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]
Finds the largest element.
Finds the largest element.
Note: will not terminate for infinite-sized collections.
- B
The type over which the ordering is defined.
- ord
An ordering to be used for comparing elements.
- returns
an option value containing the largest element of this immutable bitset with respect to the ordering
ord.
- Definition Classes
- IterableOnceOps
- def min[B >: Int](implicit ord: Ordering[B]): Int
Finds the smallest element.
Finds the smallest element.
Note: will not terminate for infinite-sized collections.
- B
The type over which the ordering is defined.
- ord
An ordering to be used for comparing elements.
- returns
the smallest element of this immutable bitset with respect to the ordering
ord.
- Definition Classes
- BitSetOps → SortedSetOps → IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def minAfter(key: Int): Option[Int]
Find the smallest element larger than or equal to a given key.
Find the smallest element larger than or equal to a given key.
- key
The given key.
- returns
Noneif there is no such node.
- Definition Classes
- SortedSetOps
- def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
Finds the first element which yields the smallest value measured by function f.
Finds the first element which yields the smallest value measured by function f.
Note: will not terminate for infinite-sized collections.
- B
The result type of the function f.
- f
The measuring function.
- cmp
An ordering to be used for comparing elements.
- returns
the first element of this immutable bitset with the smallest value measured by function f with respect to the ordering
cmp.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def minByOption[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Option[Int]
Finds the first element which yields the smallest value measured by function f.
Finds the first element which yields the smallest value measured by function f.
Note: will not terminate for infinite-sized collections.
- B
The result type of the function f.
- f
The measuring function.
- cmp
An ordering to be used for comparing elements.
- returns
an option value containing the first element of this immutable bitset with the smallest value measured by function f with respect to the ordering
cmp.
- Definition Classes
- IterableOnceOps
- def minOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]
Finds the smallest element.
Finds the smallest element.
Note: will not terminate for infinite-sized collections.
- B
The type over which the ordering is defined.
- ord
An ordering to be used for comparing elements.
- returns
an option value containing the smallest element of this immutable bitset with respect to the ordering
ord.
- Definition Classes
- IterableOnceOps
- final def mkString: String
Displays all elements of this immutable bitset in a string.
Displays all elements of this immutable bitset in a string.
Delegates to addString, which can be overridden.
- returns
a string representation of this immutable bitset. In the resulting string the string representations (w.r.t. the method
toString) of all elements of this immutable bitset follow each other without any separator string.
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
Displays all elements of this immutable bitset in a string using a separator string.
Displays all elements of this immutable bitset in a string using a separator string.
Delegates to addString, which can be overridden.
- sep
the separator string.
- returns
a string representation of this immutable bitset. In the resulting string the string representations (w.r.t. the method
toString) of all elements of this immutable bitset are separated by the stringsep.
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
List(1, 2, 3).mkString("|") = "1|2|3"
Example: - final def mkString(start: String, sep: String, end: String): String
Displays all elements of this immutable bitset in a string using start, end, and separator strings.
Displays all elements of this immutable bitset in a string using start, end, and separator strings.
Delegates to addString, which can be overridden.
- start
the starting string.
- sep
the separator string.
- end
the ending string.
- returns
a string representation of this immutable bitset. The resulting string begins with the string
startand ends with the stringend. Inside, the string representations (w.r.t. the methodtoString) of all elements of this immutable bitset are separated by the stringsep.
- Definition Classes
- IterableOnceOps
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
Example: - final def ne(arg0: AnyRef): Boolean
Equivalent to
!(this eq that).Equivalent to
!(this eq that).- returns
trueif the argument is not a reference to the receiver object;falseotherwise.
- 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. scala.collection.View or scala.collection.immutable.LazyList), it is possible to implement this method but the resulting
Builderwill break laziness. As a consequence, operations should preferably be implemented withfromSpecificinstead of this method.
- Attributes
- protected
- Definition Classes
- BitSet → BitSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
- Note
When implementing a custom collection type and refining
,Cto the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case whereC =:= CC[A], this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.As witnessed by the
@uncheckedVarianceannotation, using this method might be unsound. However, as long as the returned builder is only fed withAvalues taken fromthisinstance, it is safe.
- def nonEmpty: Boolean
Tests whether the immutable bitset is not empty.
Tests whether the immutable bitset is not empty.
- returns
trueif the immutable bitset contains at least one element,falseotherwise.
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
- final def notifyAll(): Unit
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of 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[collection]
- Definition Classes
- BitSet1 → BitSetOps
- final def ordering: Ordering[Int]
- def partition(p: (Int) => Boolean): (BitSet, BitSet)
A pair of, first, all elements that satisfy predicate
pand, second, all elements that do not.A pair of, first, all elements that satisfy predicate
pand, second, all elements that do not. Interesting because it splits a collection in two.The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of
partitioninStrictOptimizedIterableOps, which requires only a single traversal.- Definition Classes
- BitSetOps → IterableOps
- def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (Set[A1], Set[A2])
Applies a function
fto each element of the immutable bitset and returns a pair of immutable bitsets: the first one made of those values returned byfthat were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.Applies a function
fto each element of the immutable bitset and returns a pair of immutable bitsets: the first one made of those values returned byfthat were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.Example:
val xs = `immutable.BitSet`(1, "one", 2, "two", 3, "three") partitionMap { case i: Int => Left(i) case s: String => Right(s) } // xs == (`immutable.BitSet`(1, 2, 3), // `immutable.BitSet`(one, two, three))
- A1
the element type of the first resulting collection
- A2
the element type of the second resulting collection
- f
the 'split function' mapping the elements of this immutable bitset to an scala.util.Either
- returns
a pair of immutable bitsets: the first one made of those values returned by
fthat were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def product[B >: Int](implicit num: math.Numeric[B]): B
Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
Note: will not terminate for infinite-sized collections.
- B
the result type of the
*operator.- num
an implicit parameter defining a set of numeric operations which includes the
*operator to be used in forming the product.- returns
the product of all elements of this immutable bitset with respect to the
*operator innum.
- Definition Classes
- IterableOnceOps
- 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 rangeFrom(from: Int): BitSet
Creates a ranged projection of this collection with no upper-bound.
Creates a ranged projection of this collection with no upper-bound.
- from
The lower-bound (inclusive) 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.
Noneif there is no lower bound.- until
The upper-bound (exclusive) of the ranged projection.
Noneif there is no upper bound.
- def rangeTo(to: Int): BitSet
Create a range projection of this collection with no lower-bound.
Create a range projection of this collection with no lower-bound.
- to
The upper-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedSetOps → SortedOps
- def rangeUntil(until: Int): BitSet
Creates a ranged projection of this collection with no lower-bound.
Creates a ranged projection of this collection with no lower-bound.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
- def reduce[B >: Int](op: (B, B) => B): B
Reduces the elements of this immutable bitset using the specified associative binary operator.
Reduces the elements of this immutable bitset using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
- 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
opbetween all the elements if the immutable bitset is nonempty.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def reduceLeft[B >: Int](op: (B, Int) => B): B
Applies a binary operator to all elements of this immutable bitset, going left to right.
Applies a binary operator to all elements of this immutable bitset, going left to right.
Note: 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.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
opbetween consecutive elements of this immutable bitset, going left to right:op( op( ... op(x1, x2) ..., xn-1), xn)wherex1, ..., xnare the elements of this immutable bitset.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
Optionally applies a binary operator to all elements of this immutable bitset, going left to right.
Optionally applies a binary operator to all elements of this immutable bitset, going left to right.
Note: 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.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceLeft(op)if this immutable bitset is nonempty,Noneotherwise.
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Int](op: (B, B) => B): Option[B]
Reduces the elements of this immutable bitset, if any, using the specified associative binary operator.
Reduces the elements of this immutable bitset, if any, using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
- 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
opbetween all the elements if the collection is nonempty, andNoneotherwise.
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Int](op: (Int, B) => B): B
Applies a binary operator to all elements of this immutable bitset, going right to left.
Applies a binary operator to all elements of this immutable bitset, going right to left.
Note: 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.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
opbetween consecutive elements of this immutable bitset, going right to left:op(x1, op(x2, ..., op(xn-1, xn)...))wherex1, ..., xnare the elements of this immutable bitset.
- Definition Classes
- IterableOnceOps
- Exceptions thrown
UnsupportedOperationExceptionif this immutable bitset is empty.
- def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
Optionally applies a binary operator to all elements of this immutable bitset, going right to left.
Optionally applies a binary operator to all elements of this immutable bitset, going right to left.
Note: 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.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceRight(op)if this immutable bitset is nonempty,Noneotherwise.
- Definition Classes
- IterableOnceOps
- def removedAll(that: IterableOnce[Int]): BitSet
Creates a new immutable bitset from this immutable bitset by removing all elements of another collection.
Creates a new immutable bitset from this immutable bitset by removing all elements of another collection.
- that
the collection containing the elements to remove.
- returns
a new immutable bitset with the given elements removed, omitting duplicates.
- Definition Classes
- SetOps
- def reversed: collection.Iterable[Int]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- 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
zmay 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 immutable bitset containing the prefix scan of the elements in this immutable bitset
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Int) => B): Set[B]
Produces a immutable bitset containing cumulative results of applying the operator going left to right, including the initial value.
Produces a immutable bitset containing cumulative results of applying the operator going left to right, including the initial value.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- B
the type of the elements in the resulting collection
- z
the initial value
- op
the binary operator applied to the intermediate result and the element
- returns
collection with intermediate results
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- 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.
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)
- 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 size of this immutable bitset.
The size of this immutable bitset.
Note: will not terminate for infinite-sized collections.
- returns
the number of elements in this immutable bitset.
- Definition Classes
- BitSetOps → IterableOnceOps
- def sizeCompare(that: collection.Iterable[_]): Int
Compares the size of this immutable bitset to the size of another
Iterable.Compares the size of this immutable bitset to the size of another
Iterable.- that
the
Iterablewhose size is compared with this immutable bitset's size.- returns
A value
xwherex < 0 if this.size < that.size x == 0 if this.size == that.size x > 0 if this.size > that.size
The method as implemented here does not call
sizedirectly; its running time isO(this.size min that.size)instead ofO(this.size + that.size). The method should be overridden if computingsizeis cheap andknownSizereturns-1.
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
Compares the size of this immutable bitset to a test value.
Compares the size of this immutable bitset to a test value.
- otherSize
the test value that gets compared with the size.
- returns
A value
xwherex < 0 if this.size < otherSize x == 0 if this.size == otherSize x > 0 if this.size > otherSize
The method as implemented here does not call
sizedirectly; its running time isO(size min otherSize)instead ofO(size). The method should be overridden if computingsizeis cheap andknownSizereturns-1.
- Definition Classes
- IterableOps
- See also
- final def sizeIs: SizeCompareOps
Returns a value class containing operations for comparing the size of this immutable bitset to a test value.
Returns a value class containing operations for comparing the size of this immutable bitset 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
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): BitSet
Selects an interval of elements.
Selects an interval of elements. The returned immutable bitset is made up of all elements
xwhich satisfy the invariant:from <= indexOf(x) < until
Note: might return different results for different runs, unless the underlying collection type is ordered.
- from
the lowest index to include from this immutable bitset.
- until
the lowest index to EXCLUDE from this immutable bitset.
- returns
a immutable bitset containing the elements greater than or equal to index
fromextending up to (but not including) indexuntilof this immutable bitset.
- Definition Classes
- IterableOps → IterableOnceOps
- 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.)
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.
- size
the number of elements per group
- step
the distance between the first elements of successive groups
- returns
An iterator producing immutable bitsets of size
size, except the last element (which may be the only element) will be smaller if there are fewer thansizeelements remaining to be grouped.
- Definition Classes
- IterableOps
List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5)), List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))- See also
scala.collection.Iterator, method
sliding
Examples: - 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.)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.
- size
the number of elements per group
- returns
An iterator producing immutable bitsets of size
size, except for a non-empty collection with less thansizeelements, which returns an iterator that produces the source collection itself as its only element.
- Definition Classes
- IterableOps
List().sliding(2) = empty iterator, List(1).sliding(2) = Iterator(List(1)), List(1, 2).sliding(2) = Iterator(List(1, 2)), List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))- See also
scala.collection.Iterator, method
sliding
Examples: - def sortedIterableFactory: SortedIterableFactory[SortedSet]
The companion object of this sorted set, providing various factory methods.
The companion object of this sorted set, providing various factory methods.
- Definition Classes
- SortedSet → SortedSet → SortedSetOps
- Note
When implementing a custom collection type and refining
CCto the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).
- def span(p: (Int) => Boolean): (BitSet, BitSet)
Splits this immutable bitset into a prefix/suffix pair according to a predicate.
Splits this immutable bitset into a prefix/suffix pair according to a predicate.
Note:
c span pis equivalent to (but possibly more efficient than)(c takeWhile p, c dropWhile p), provided the evaluation of the predicatepdoes not cause any side-effects.Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
the test predicate
- returns
a pair consisting of the longest prefix of this immutable bitset whose elements all satisfy
p, and the rest of this immutable bitset.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def splitAt(n: Int): (BitSet, BitSet)
Splits this immutable bitset into a prefix/suffix pair at a given position.
Splits this immutable bitset into a prefix/suffix pair at a given position.
Note:
c splitAt nis equivalent to (but possibly more efficient than)(c take n, c drop n).Note: might return different results for different runs, unless the underlying collection type is ordered.
- n
the position at which to split.
- returns
a pair of immutable bitsets consisting of the first
nelements of this immutable bitset, and the other elements.
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S with EfficientSplit
Returns a scala.collection.Stepper for the elements of this collection.
Returns a scala.collection.Stepper for the elements of this collection.
The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.
The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.
- For collections of
Int,Short,ByteorChar, an scala.collection.IntStepper is returned - For collections of
DoubleorFloat, a scala.collection.DoubleStepper is returned - For collections of
Longa scala.collection.LongStepper is returned - For any other element type, an scala.collection.AnyStepper is returned
Note that this method is overridden in subclasses and the return type is refined to
S with EfficientSplit, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.- Definition Classes
- BitSetOps → IterableOnce
- For collections of
- final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Int, B]): C2
- B
Type of elements of the resulting collection (e.g.
String)- C2
Type of the resulting collection (e.g.
List[String])- b
Builder to use to build the resulting collection
- pf
Element transformation partial function
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedConcat[B >: Int, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
- B
Type of elements of the resulting collections (e.g.
Int)- C2
Type of the resulting collection (e.g.
List[Int])- that
Elements to concatenate to this collection
- b
Builder to use to build the resulting collection
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Int) => IterableOnce[B]): C2
- B
Type of elements of the resulting collection (e.g.
String)- C2
Type of the resulting collection (e.g.
List[String])- b
Builder to use to build the resulting collection
- f
Element transformation function
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Int) => IterableOnce[B]): C2
- B
Type of elements of the resulting collection (e.g.
Int)- C2
Type of the resulting collection (e.g.
List[Int])- b
Builder to use to build the resulting collection
- toIterableOnce
Evidence that
Acan be seen as anIterableOnce[B]- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Int) => B): C2
- B
Type of elements of the resulting collection (e.g.
String)- C2
Type of the resulting collection (e.g.
List[String])- b
Builder to use to build the resulting collection
- f
Element transformation function
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(Int, B), C2]): C2
- B
Type of elements of the second collection (e.g.
String)- C2
Type of the resulting collection (e.g.
List[(Int, String)])- that
Collection to zip with this collection
- b
Builder to use to build the resulting collection
- returns
The resulting collection
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- def stringPrefix: String
- 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
trueif this set is a subset ofthat, i.e. if every element of this set is also an element ofthat.
- Definition Classes
- SetOps
- def subsets(): Iterator[BitSet]
An iterator over all subsets of this set.
- 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[B >: Int](implicit num: math.Numeric[B]): B
Sums up the elements of this collection.
Sums up the elements of this collection.
Note: will not terminate for infinite-sized collections.
- B
the result type of the
+operator.- num
an implicit parameter defining a set of numeric operations which includes the
+operator to be used in forming the sum.- returns
the sum of all elements of this immutable bitset with respect to the
+operator innum.
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
Executes the code in
bodywith an exclusive lock onthis.Executes the code in
bodywith an exclusive lock onthis.- returns
the result of
body
- 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 tails: Iterator[BitSet]
Iterates over the tails of this immutable bitset.
Iterates over the tails of this immutable bitset. The first value will be this immutable bitset and the final one will be an empty immutable bitset, with the intervening values the results of successive applications of
tail.- returns
an iterator over all the tails of this immutable bitset
- Definition Classes
- IterableOps
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Example: - def take(n: Int): BitSet
Selects the first n elements.
Selects the first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- n
the number of elements to take from this immutable bitset.
- returns
a immutable bitset consisting only of the first
nelements of this immutable bitset, or else the whole immutable bitset, if it has less thannelements. Ifnis negative, returns an empty immutable bitset.
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): BitSet
A collection containing the last
nelements of this collection.A collection containing the last
nelements of this collection.Note: Even when applied to a view or a lazy collection it will always force the elements.
- n
the number of elements to take from this immutable bitset.
- returns
a immutable bitset consisting only of the last
nelements of this immutable bitset, or else the whole immutable bitset, if it has less thannelements. Ifnis negative, returns an empty immutable bitset.
- Definition Classes
- StrictOptimizedIterableOps → 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.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
The predicate used to test elements.
- returns
the longest prefix of this immutable bitset whose elements all satisfy the predicate
p.
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (Int) => U): BitSet
Applies a side-effecting function to each element in this collection.
Applies a side-effecting function to each element in this collection. Strict collections will apply
fto their elements immediately, while lazy collections like Views and LazyLists will only applyfon each element if and when that element is evaluated, and each time that element is evaluated.- U
the return type of f
- f
a function to apply to each element in this immutable bitset
- returns
The same logical collection as this
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Int, C1]): C1
Given a collection factory
factory, convert this collection to the appropriate representation for the current element typeA.Given a collection factory
factory, convert this collection to the appropriate representation for the current element typeA. Example uses:xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]
- Definition Classes
- IterableOnceOps
- def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
Convert collection to array.
Convert collection to array.
Implementation note: DO NOT call Array.from from this method.
- Definition Classes
- IterableOnceOps
- 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
- final def toBuffer[B >: Int]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[Int]
- Definition Classes
- IterableOnceOps
- def toList: List[Int]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Int]
- returns
This collection as a
Seq[A]. This is equivalent toto(Seq)but might be faster.
- Definition Classes
- IterableOnceOps
- def toSet[B >: Int]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
- returns
a String representation of the object.
- def toVector: Vector[Int]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (Int) => collection.Iterable[B]): Set[Set[B]]
Transposes this immutable bitset of iterable collections into a immutable bitset of immutable bitsets.
Transposes this immutable bitset of iterable collections into a immutable bitset of immutable bitsets.
The resulting collection's type will be guided by the static type of immutable bitset. 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.
- B
the type of the elements of each iterable collection.
- asIterable
an implicit conversion which asserts that the element type of this immutable bitset is an
Iterable.- returns
a two-dimensional immutable bitset of immutable bitsets which has as nth row the nth column of this immutable bitset.
- Definition Classes
- IterableOps
- Exceptions thrown
IllegalArgumentExceptionif all collections in this immutable bitset are not of the same size.
- final def union(that: collection.Set[Int]): BitSet
Computes the union between of set and another set.
- def unsorted: Set[Int]
- Definition Classes
- BitSet → BitSet → BitSetOps → SortedSet → SortedSetOps → SortedSet → SortedSetOps
- def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (Set[A1], Set[A2])
Converts this immutable bitset of pairs into two collections of the first and second half of each pair.
Converts this immutable bitset of pairs into two collections of the first and second half of each pair.
val xs = `immutable.BitSet`( (1, "one"), (2, "two"), (3, "three")).unzip // xs == (`immutable.BitSet`(1, 2, 3), // `immutable.BitSet`(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 immutable bitset is a pair.
- returns
a pair of immutable bitsets, containing the first, respectively second half of each element pair of this immutable bitset.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
Converts this immutable bitset of triples into three collections of the first, second, and third element of each triple.
Converts this immutable bitset of triples into three collections of the first, second, and third element of each triple.
val xs = `immutable.BitSet`( (1, "one", '1'), (2, "two", '2'), (3, "three", '3')).unzip3 // xs == (`immutable.BitSet`(1, 2, 3), // `immutable.BitSet`(one, two, three), // `immutable.BitSet`(1, 2, 3))
- A1
the type of the first member of the element triples
- A2
the type of the second member of the element triples
- A3
the type of the third member of the element triples
- asTriple
an implicit conversion which asserts that the element type of this immutable bitset is a triple.
- returns
a triple of immutable bitsets, containing the first, second, respectively third member of each element triple of this immutable bitset.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def updateWord(idx: Int, w: Long): BitSet
Update word at index
idx; enlarge set ifidxoutside range of set.Update word at index
idx; enlarge set ifidxoutside range of set.- Attributes
- protected[collection]
- Definition Classes
- BitSet1 → BitSet
- def view: View[Int]
A view over the elements of this collection.
A view over the elements of this collection.
- Definition Classes
- IterableOps
- final def wait(): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- Note
not specified by SLS as a member of AnyRef
- final def wait(arg0: Long, arg1: Int): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- Note
not specified by SLS as a member of AnyRef
- final def wait(arg0: Long): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.
- def withFilter(p: (Int) => Boolean): SortedSetOps.WithFilter[Int, [x]Set[x], [X]SortedSet[X]]
Creates a non-strict filter of this immutable bitset.
Creates a non-strict filter of this immutable bitset.
Note: the difference between
c filter pandc withFilter pis that the former creates a new collection, whereas the latter only restricts the domain of subsequentmap,flatMap,foreach, andwithFilteroperations.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 supportsmap,flatMap,foreach, andwithFilteroperations. All these operations apply to those elements of this immutable bitset which satisfy the predicatep.
- Definition Classes
- SortedSetFactoryDefaults → IterableOps
- def word(idx: Int): Long
The words at index
idx, or 0L if outside the range of the set Note: requiresidx >= 0The words at index
idx, or 0L if outside the range of the set Note: requiresidx >= 0- Attributes
- protected[collection]
- Definition Classes
- BitSet1 → BitSetOps
- def writeReplace(): AnyRef
- Attributes
- protected[this]
- Definition Classes
- BitSet
- 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](that: scala.IterableOnce[B])(implicit ev: Ordering[(Int, B)]): SortedSet[(Int, B)]
Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs.
Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
- B
the type of the second half of the returned pairs
- that
The iterable providing the second half of each result pair
- returns
a new immutable bitset containing pairs consisting of corresponding elements of this immutable bitset and
that. The length of the returned collection is the minimum of the lengths of this immutable bitset andthat.
- Definition Classes
- BitSet → StrictOptimizedSortedSetOps → SortedSetOps
- def zip[B](that: IterableOnce[B]): Set[(Int, B)]
Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs.
Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
- B
the type of the second half of the returned pairs
- that
The iterable providing the second half of each result pair
- returns
a new immutable bitset containing pairs consisting of corresponding elements of this immutable bitset and
that. The length of the returned collection is the minimum of the lengths of this immutable bitset andthat.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def zipAll[A1 >: Int, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs.
Returns a immutable bitset formed from this immutable bitset and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
- that
the iterable providing the second half of each result pair
- thisElem
the element to be used to fill up the result if this immutable bitset is shorter than
that.- thatElem
the element to be used to fill up the result if
thatis shorter than this immutable bitset.- returns
a new collection of type
Thatcontaining pairs consisting of corresponding elements of this immutable bitset andthat. The length of the returned collection is the maximum of the lengths of this immutable bitset andthat. If this immutable bitset is shorter thanthat,thisElemvalues are used to pad the result. Ifthatis shorter than this immutable bitset,thatElemvalues are used to pad the result.
- Definition Classes
- IterableOps
- def zipWithIndex: Set[(Int, Int)]
Zips this immutable bitset with its indices.
Zips this immutable bitset with its indices.
- returns
A new immutable bitset containing pairs consisting of all elements of this immutable bitset paired with their index. Indices start at
0.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
Example: - final def |(that: collection.Set[Int]): BitSet
Alias for
union
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from BitSet1 toany2stringadd[BitSet1] performed by method any2stringadd in scala.Predef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: any2stringadd[BitSet1]).+(other)
- Definition Classes
- any2stringadd
Deprecated Value Members
- def +(elem1: Int, elem2: Int, elems: Int*): BitSet
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def ++:[B >: Int](that: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- def -(elem1: Int, elem2: Int, elems: Int*): BitSet
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def /:[B](z: B)(op: (B, Int) => B): B
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- final def /:[B](z: B)(op: (B, Int) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (Int, B) => B): B
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (Int, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregateis not relevant for sequential collections. UsefoldLeft(z)(seqop)instead.
- def collectFirst[B](f: PartialFunction[Int, B]): Option[B]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).collectFirst(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
- def companion: IterableFactory[[_]Set[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def compare(k0: Int, k1: Int): Int
Comparison function that orders keys.
Comparison function that orders keys.
- Definition Classes
- SortedOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use ordering.compare instead
- def copyToBuffer(dest: Buffer[Int]): Unit
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= collinstead
- def count(f: (Int) => Boolean): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (Int) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (Int) => Boolean): Iterator[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def find(p: (Int) => Boolean): Option[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (Int) => IterableOnce[B]): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def foldLeft[B](z: B)(op: (B, Int) => B): B
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- def foldRight[B](z: B)(op: (Int, B) => B): B
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (Int) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (Int) => U): Unit
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- def formatted(fmtstr: String): String
Returns string formatted according to given
formatstring.Returns string formatted according to given
formatstring. Format strings are as forString.format(@see java.lang.String.format).- Implicit
- This member is added by an implicit conversion from BitSet1 toStringFormat[BitSet1] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- final def from(from: Int): BitSet
Creates a ranged projection of this collection with no upper-bound.
Creates a ranged projection of this collection with no upper-bound.
- from
The lower-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeFrom
- def hasDefiniteSize: Boolean
Tests whether this immutable bitset is known to have a finite size.
Tests whether this immutable bitset is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as
Stream, the predicate returnstrueif all elements have been computed. It returnsfalseif the stream is not yet evaluated to the end. Non-empty Iterators usually returnfalseeven if they were created from a collection with a known finite size.Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that
hasDefiniteSizereturnstrue. However, checkinghasDefiniteSizecan provide an assurance that size is well-defined and non-termination is not a concern.- returns
trueif this collection is known to have finite size,falseotherwise.
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- See also
method
knownSizefor a more useful alternative
- def isEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def keysIteratorFrom(start: Int): Iterator[Int]
- Definition Classes
- SortedSetOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
iteratorFrominstead.
- def map[B](f: (Int) => B): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
- def max(implicit ord: math.Ordering[Int]): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: math.Ordering[Int]): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).minBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
- def mkString: String
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def nonEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: math.Numeric[Int]): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (Int, Int) => Int): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (Int, Int) => Int): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (Int, Int) => Int): Option[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (Int, Int) => Int): Option[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (Int, Int) => Int): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (Int, Int) => Int): Option[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: BitSet
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def seq: BitSet1.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- def size: Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: math.Numeric[Int]): Int
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[Int, C1]): C1
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).to(factory)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
- final def to(to: Int): BitSet
Create a range projection of this collection with no lower-bound.
Create a range projection of this collection with no lower-bound.
- to
The upper-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeTo
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toArray
- def toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: collection.IndexedSeq[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: collection.Iterable[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toIterable: BitSet1.this.type
- returns
This collection as an
Iterable[A]. No new collection will be built ifthisis already anIterable[A].
- Definition Classes
- Iterable → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def toIterator: Iterator[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[Int]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
- def toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[Int]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: collection.Traversable[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toTraversable: collection.Traversable[Int]
Converts this immutable bitset to an unspecified Iterable.
Converts this immutable bitset to an unspecified Iterable. Will return the same collection if this instance is already Iterable.
- returns
An Iterable containing all elements of this immutable bitset.
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def toVector: Vector[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- final def until(until: Int): BitSet
Creates a ranged projection of this collection with no lower-bound.
Creates a ranged projection of this collection with no lower-bound.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeUntil
- def view(from: Int, until: Int): View[Int]
A view over a slice of the elements of this collection.
A view over a slice of the elements of this collection.
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: (Int) => Boolean): Iterator[Int]
- Implicit
- This member is added by an implicit conversion from BitSet1 toIterableOnceExtensionMethods[Int] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(bitSet1: IterableOnceExtensionMethods[Int]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
- def →[B](y: B): (BitSet1, B)
- Implicit
- This member is added by an implicit conversion from BitSet1 toArrowAssoc[BitSet1] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
This is the documentation for the Scala standard library.
Package structure
The scala package contains core types like
Int,Float,ArrayorOptionwhich are accessible in all Scala compilation units without explicit qualification or imports.Notable packages include:
scala.collectionand its sub-packages contain Scala's collections frameworkscala.collection.immutable- Immutable, sequential data-structures such asVector,List,Range,HashMaporHashSetscala.collection.mutable- Mutable, sequential data-structures such asArrayBuffer,StringBuilder,HashMaporHashSetscala.collection.concurrent- Mutable, concurrent data-structures such asTrieMapscala.concurrent- Primitives for concurrent programming such asFuturesandPromisesscala.io- Input and output operationsscala.math- Basic math functions and additional numeric types likeBigIntandBigDecimalscala.sys- Interaction with other processes and the operating systemscala.util.matching- Regular expressionsOther packages exist. See the complete list on the right.
Additional parts of the standard library are shipped as separate libraries. These include:
scala.reflect- Scala's reflection API (scala-reflect.jar)scala.xml- XML parsing, manipulation, and serialization (scala-xml.jar)scala.collection.parallel- Parallel collections (scala-parallel-collections.jar)scala.util.parsing- Parser combinators (scala-parser-combinators.jar)scala.swing- A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)Automatic imports
Identifiers in the scala package and the
scala.Predefobject are always in scope by default.Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example,
Listis an alias forscala.collection.immutable.List.Other aliases refer to classes provided by the underlying platform. For example, on the JVM,
Stringis an alias forjava.lang.String.