A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/BitSet.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.BitSet

class BitSet extends AbstractSet[Int] with SortedSet[Int] with SortedSetOps[Int, SortedSet, BitSet] with StrictOptimizedIterableOps[Int, Set, BitSet] with StrictOptimizedSortedSetOps[Int, SortedSet, BitSet] with collection.BitSet with BitSetOps[BitSet] with Serializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BitSet
  2. Serializable
  3. BitSet
  4. BitSetOps
  5. StrictOptimizedSortedSetOps
  6. StrictOptimizedSetOps
  7. StrictOptimizedIterableOps
  8. SortedSet
  9. SortedSetOps
  10. SortedSet
  11. SortedSetFactoryDefaults
  12. SortedSetOps
  13. SortedOps
  14. AbstractSet
  15. Set
  16. SetOps
  17. Shrinkable
  18. Builder
  19. Growable
  20. Clearable
  21. Cloneable
  22. Cloneable
  23. Iterable
  24. AbstractSet
  25. Set
  26. Equals
  27. SetOps
  28. Function1
  29. AbstractIterable
  30. Iterable
  31. IterableFactoryDefaults
  32. IterableOps
  33. IterableOnceOps
  34. IterableOnce
  35. AnyRef
  36. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  final def &(that: collection.Set[Int]): BitSet
  4.  def &=(other: collection.BitSet): BitSet.this.type
  5.  final def &~(that: collection.Set[Int]): BitSet
  6.  def &~=(other: collection.BitSet): BitSet.this.type
  7.  final def ++(that: IterableOnce[Int]): BitSet
  8.  final def ++[B >: Int](suffix: IterableOnce[B]): Set[B]
  9.  final def ++=(xs: IterableOnce[Int]): BitSet.this.type
  10.  final def +=(elem: Int): BitSet.this.type
  11.  final def --=(xs: IterableOnce[Int]): BitSet.this.type
  12.  final def -=(elem: Int): BitSet.this.type
  13.  def ->[B](y: B): (BitSet, B)
  14.  final def ==(arg0: Any): Boolean
  15.  final def ^(other: collection.BitSet): BitSet
  16.  def ^=(other: collection.BitSet): BitSet.this.type
  17.  def add(elem: Int): Boolean
  18.  def addAll(xs: IterableOnce[Int]): BitSet.this.type
  19.  def addOne(elem: Int): BitSet.this.type
  20.  final def addString(b: StringBuilder): b.type
  21.  final def addString(b: StringBuilder, sep: String): b.type
  22.  def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
  23.  def andThen[A](g: (Boolean) => A): (Int) => A
  24.  final def apply(elem: Int): Boolean
  25.  final def asInstanceOf[T0]: T0
  26.  def bitSetFactory: BitSet
  27.  def canEqual(that: Any): Boolean
  28.  def className: String
  29.  def clear(): Unit
  30.  def clone(): BitSet
  31.  final def coll: BitSet.this.type
  32.  def collect[B](pf: PartialFunction[Int, B])(implicit ev: Ordering[B]): SortedSet[B]
  33.  def collect(pf: PartialFunction[Int, Int]): BitSet
  34.  def collect[B](pf: PartialFunction[Int, B]): Set[B]
  35.  def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
  36.  def compose[A](g: (A) => Int): (A) => Boolean
  37.  def concat(other: IterableOnce[Int]): BitSet
  38.  def concat[B >: Int](suffix: IterableOnce[B]): Set[B]
  39.  def contains(elem: Int): Boolean
  40.  def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
  41.  def copyToArray[B >: Int](xs: Array[B], start: Int): Int
  42.  def copyToArray[B >: Int](xs: Array[B]): Int
  43.  def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean
  44.  def count(p: (Int) => Boolean): Int
  45.  def diff(that: collection.Set[Int]): BitSet
  46.  def drop(n: Int): BitSet
  47.  def dropRight(n: Int): BitSet
  48.  def dropWhile(p: (Int) => Boolean): BitSet
  49.  final var elems: Array[Long]
  50.  def empty: BitSet
  51.  final def ensureCapacity(idx: Int): Unit
  52.  def ensuring(cond: (BitSet) => Boolean, msg: => Any): BitSet
  53.  def ensuring(cond: (BitSet) => Boolean): BitSet
  54.  def ensuring(cond: Boolean, msg: => Any): BitSet
  55.  def ensuring(cond: Boolean): BitSet
  56.  final def eq(arg0: AnyRef): Boolean
  57.  def equals(that: Any): Boolean
  58.  def exists(p: (Int) => Boolean): Boolean
  59.  def filter(pred: (Int) => Boolean): BitSet
  60.  def filterImpl(pred: (Int) => Boolean, isFlipped: Boolean): BitSet
  61.  def filterInPlace(p: (Int) => Boolean): BitSet.this.type
  62.  def filterNot(pred: (Int) => Boolean): BitSet
  63.  def finalize(): Unit
  64.  def find(p: (Int) => Boolean): Option[Int]
  65.  def firstKey: Int
  66.  def flatMap[B](f: (Int) => IterableOnce[B])(implicit ev: Ordering[B]): SortedSet[B]
  67.  def flatMap(f: (Int) => IterableOnce[Int]): BitSet
  68.  def flatMap[B](f: (Int) => IterableOnce[B]): Set[B]
  69.  def flatten[B](implicit toIterableOnce: (Int) => IterableOnce[B]): Set[B]
  70.  def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1
  71.  def foldLeft[B](z: B)(op: (B, Int) => B): B
  72.  def foldRight[B](z: B)(op: (Int, B) => B): B
  73.  def forall(p: (Int) => Boolean): Boolean
  74.  def foreach[U](f: (Int) => U): Unit
  75.  def fromBitMaskNoCopy(elems: Array[Long]): BitSet
  76.  def fromSpecific(coll: IterableOnce[Int]): BitSet
  77.  final def getClass(): Class[_ <: AnyRef]
  78.  def groupBy[K](f: (Int) => K): immutable.Map[K, BitSet]
  79.  def groupMap[K, B](key: (Int) => K)(f: (Int) => B): immutable.Map[K, Set[B]]
  80.  def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  81.  def grouped(size: Int): Iterator[BitSet]
  82.  def hashCode(): Int
  83.  def head: Int
  84.  def headOption: Option[Int]
  85.  def init: BitSet
  86.  def inits: Iterator[BitSet]
  87.  def intersect(other: collection.Set[Int]): BitSet
  88.  def isEmpty: Boolean
  89.  final def isInstanceOf[T0]: Boolean
  90.  def isTraversableAgain: Boolean
  91.  def iterableFactory: IterableFactory[Set]
  92.  def iterator: Iterator[Int]
  93.  def iteratorFrom(start: Int): Iterator[Int]
  94.  def knownSize: Int
  95.  def last: Int
  96.  def lastKey: Int
  97.  def lastOption: Option[Int]
  98.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Int, B, BitSet.this.type]
  99.  def map[B](f: (Int) => B)(implicit ev: Ordering[B]): SortedSet[B]
  100.  def map(f: (Int) => Int): BitSet
  101.  def map[B](f: (Int) => B): Set[B]
  102.  def mapResult[NewTo](f: (BitSet) => NewTo): Builder[Int, NewTo]
  103.  def max[B >: Int](implicit ord: Ordering[B]): Int
  104.  def maxBefore(key: Int): Option[Int]
  105.  def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
  106.  def maxByOption[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Option[Int]
  107.  def maxOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]
  108.  def min[B >: Int](implicit ord: Ordering[B]): Int
  109.  def minAfter(key: Int): Option[Int]
  110.  def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
  111.  def minByOption[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Option[Int]
  112.  def minOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]
  113.  final def mkString: String
  114.  final def mkString(sep: String): String
  115.  final def mkString(start: String, sep: String, end: String): String
  116.  final def ne(arg0: AnyRef): Boolean
  117.  def newSpecificBuilder: Builder[Int, BitSet]
  118.  def nonEmpty: Boolean
  119.  final def notify(): Unit
  120.  final def notifyAll(): Unit
  121.  final def nwords: Int
  122.  final def ordering: Ordering[Int]
  123.  def partition(p: (Int) => Boolean): (BitSet, BitSet)
  124.  def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (Set[A1], Set[A2])
  125.  def product[B >: Int](implicit num: math.Numeric[B]): B
  126.  def range(from: Int, until: Int): BitSet
  127.  def rangeFrom(from: Int): BitSet
  128.  def rangeImpl(from: Option[Int], until: Option[Int]): BitSet
  129.  def rangeTo(to: Int): BitSet
  130.  def rangeUntil(until: Int): BitSet
  131.  def reduce[B >: Int](op: (B, B) => B): B
  132.  def reduceLeft[B >: Int](op: (B, Int) => B): B
  133.  def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
  134.  def reduceOption[B >: Int](op: (B, B) => B): Option[B]
  135.  def reduceRight[B >: Int](op: (Int, B) => B): B
  136.  def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
  137.  def remove(elem: Int): Boolean
  138.  def result(): BitSet
  139.  def reversed: collection.Iterable[Int]
  140.  def scan[B >: Int](z: B)(op: (B, B) => B): Set[B]
  141.  def scanLeft[B](z: B)(op: (B, Int) => B): Set[B]
  142.  def scanRight[B](z: B)(op: (Int, B) => B): Set[B]
  143.  def size: Int
  144.  def sizeCompare(that: collection.Iterable[_]): Int
  145.  def sizeCompare(otherSize: Int): Int
  146.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  147.  def sizeHint(size: Int): Unit
  148.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  149.  final def sizeIs: SizeCompareOps
  150.  def slice(from: Int, until: Int): BitSet
  151.  def sliding(size: Int, step: Int): Iterator[BitSet]
  152.  def sliding(size: Int): Iterator[BitSet]
  153.  def sortedIterableFactory: SortedIterableFactory[SortedSet]
  154.  def span(p: (Int) => Boolean): (BitSet, BitSet)
  155.  def splitAt(n: Int): (BitSet, BitSet)
  156.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S with EfficientSplit
  157.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Int, B]): C2
  158.  final def strictOptimizedConcat[B >: Int, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  159.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Int) => IterableOnce[B]): C2
  160.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Int) => IterableOnce[B]): C2
  161.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Int) => B): C2
  162.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(Int, B), C2]): C2
  163.  def stringPrefix: String
  164.  def subsetOf(that: collection.Set[Int]): Boolean
  165.  def subsets(): Iterator[BitSet]
  166.  def subsets(len: Int): Iterator[BitSet]
  167.  def subtractAll(xs: IterableOnce[Int]): BitSet.this.type
  168.  def subtractOne(elem: Int): BitSet.this.type
  169.  def sum[B >: Int](implicit num: math.Numeric[B]): B
  170.  final def synchronized[T0](arg0: => T0): T0
  171.  def tail: BitSet
  172.  def tails: Iterator[BitSet]
  173.  def take(n: Int): BitSet
  174.  def takeRight(n: Int): BitSet
  175.  def takeWhile(p: (Int) => Boolean): BitSet
  176.  def tapEach[U](f: (Int) => U): BitSet
  177.  def to[C1](factory: Factory[Int, C1]): C1
  178.  def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
  179.  def toBitMask: Array[Long]
  180.  final def toBuffer[B >: Int]: Buffer[B]
  181.  def toImmutable: immutable.BitSet
  182.  def toIndexedSeq: immutable.IndexedSeq[Int]
  183.  def toList: immutable.List[Int]
  184.  def toMap[K, V](implicit ev: <:<[Int, (K, V)]): immutable.Map[K, V]
  185.  def toSeq: immutable.Seq[Int]
  186.  def toSet[B >: Int]: immutable.Set[B]
  187.  def toString(): String
  188.  def toVector: immutable.Vector[Int]
  189.  def transpose[B](implicit asIterable: (Int) => collection.Iterable[B]): Set[Set[B]]
  190.  def unconstrained: collection.Set[Int]
  191.  final def union(that: collection.Set[Int]): BitSet
  192.  def unsorted: Set[Int]
  193.  def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (Set[A1], Set[A2])
  194.  def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
  195.  def update(elem: Int, included: Boolean): Unit
  196.  final def updateWord(idx: Int, w: Long): Unit
  197.  def view: View[Int]
  198.  final def wait(): Unit
  199.  final def wait(arg0: Long, arg1: Int): Unit
  200.  final def wait(arg0: Long): Unit
  201.  def withFilter(p: (Int) => Boolean): SortedSetOps.WithFilter[Int, [x]Set[x], [X]SortedSet[X]]
  202.  final def word(idx: Int): Long
  203.  def writeReplace(): AnyRef
  204.  def xor(other: collection.BitSet): BitSet
  205.  def zip[B](that: IterableOnce[B])(implicit ev: Ordering[(Int, B)]): SortedSet[(Int, B)]
  206.  def zip[B](that: IterableOnce[B]): Set[(Int, B)]
  207.  def zipAll[A1 >: Int, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
  208.  def zipWithIndex: Set[(Int, Int)]
  209.  final def |(that: collection.Set[Int]): BitSet
  210.  def |=(other: collection.BitSet): BitSet.this.type
Deprecated Value Members
  1.  def +(elem1: Int, elem2: Int, elems: Int*): BitSet
  2.  def +(elem: Int): BitSet
  3.  def ++:[B >: Int](that: IterableOnce[B]): Set[B]
  4.  final def +=(elem1: Int, elem2: Int, elems: Int*): BitSet.this.type
  5.  def -(elem1: Int, elem2: Int, elems: Int*): BitSet
  6.  def -(elem: Int): BitSet
  7.  def --(that: IterableOnce[Int]): BitSet
  8.  def -=(elem1: Int, elem2: Int, elems: Int*): BitSet.this.type
  9.  def /:[B](z: B)(op: (B, Int) => B): B
  10.  final def /:[B](z: B)(op: (B, Int) => B): B
  11.  def :\[B](z: B)(op: (Int, B) => B): B
  12.  final def :\[B](z: B)(op: (Int, B) => B): B
  13.  def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B
  14.  def collectFirst[B](f: PartialFunction[Int, B]): Option[B]
  15.  def companion: IterableFactory[[_]Set[_]]
  16.  def compare(k0: Int, k1: Int): Int
  17.  def copyToBuffer(dest: Buffer[Int]): Unit
  18.  final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
  19.  def count(f: (Int) => Boolean): Int
  20.  def exists(f: (Int) => Boolean): Boolean
  21.  def filter(f: (Int) => Boolean): Iterator[Int]
  22.  def find(p: (Int) => Boolean): Option[Int]
  23.  def flatMap[B](f: (Int) => IterableOnce[B]): IterableOnce[B]
  24.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  25.  def foldLeft[B](z: B)(op: (B, Int) => B): B
  26.  def foldRight[B](z: B)(op: (Int, B) => B): B
  27.  def forall(f: (Int) => Boolean): Boolean
  28.  def foreach[U](f: (Int) => U): Unit
  29.  def formatted(fmtstr: String): String
  30.  final def from(from: Int): BitSet
  31.  def hasDefiniteSize: Boolean
  32.  def isEmpty: Boolean
  33.  def keysIteratorFrom(start: Int): Iterator[Int]
  34.  def map[B](f: (Int) => B): IterableOnce[B]
  35.  def max(implicit ord: math.Ordering[Int]): Int
  36.  def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
  37.  def min(implicit ord: math.Ordering[Int]): Int
  38.  def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
  39.  def mkString: String
  40.  def mkString(sep: String): String
  41.  def mkString(start: String, sep: String, end: String): String
  42.  def nonEmpty: Boolean
  43.  def product(implicit num: math.Numeric[Int]): Int
  44.  def reduce(f: (Int, Int) => Int): Int
  45.  def reduceLeft(f: (Int, Int) => Int): Int
  46.  def reduceLeftOption(f: (Int, Int) => Int): Option[Int]
  47.  def reduceOption(f: (Int, Int) => Int): Option[Int]
  48.  def reduceRight(f: (Int, Int) => Int): Int
  49.  def reduceRightOption(f: (Int, Int) => Int): Option[Int]
  50.  final def repr: BitSet
  51.  final def retain(p: (Int) => Boolean): Unit
  52.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  53.  def seq: BitSet.this.type
  54.  def size: Int
  55.  def sum(implicit num: math.Numeric[Int]): Int
  56.  def to[C1](factory: Factory[Int, C1]): C1
  57.  final def to(to: Int): BitSet
  58.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  59.  def toBuffer[B >: A]: Buffer[B]
  60.  def toIndexedSeq: collection.IndexedSeq[Int]
  61.  final def toIterable: collection.Iterable[Int]
  62.  final def toIterable: BitSet.this.type
  63.  def toIterator: Iterator[Int]
  64.  final def toIterator: Iterator[Int]
  65.  def toList: immutable.List[Int]
  66.  def toMap[K, V](implicit ev: <:<[Int, (K, V)]): immutable.Map[K, V]
  67.  def toSeq: immutable.Seq[Int]
  68.  def toSet[B >: A]: immutable.Set[B]
  69.  def toStream: immutable.Stream[Int]
  70.  final def toStream: immutable.Stream[Int]
  71.  final def toTraversable: collection.Traversable[Int]
  72.  final def toTraversable: collection.Traversable[Int]
  73.  def toVector: immutable.Vector[Int]
  74.  final def until(until: Int): BitSet
  75.  def view(from: Int, until: Int): View[Int]
  76.  def withFilter(f: (Int) => Boolean): Iterator[Int]
  77.  def →[B](y: B): (BitSet, B)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4