Packages

trait BitSet extends SortedSet[Int] with BitSetLike[BitSet]

Base type of bitsets

Linear Supertypes
BitSetLike[BitSet], BitSetMonoTransforms[BitSet], SortedSet[Int], SortedSetLike[Int, SortedSet], SortedPolyTransforms[Int, SortedSet], Sorted[Int], SortedLike[Int, SortedSet[Int]], Set[Int], SetLike[Int, Set], Equals, SetMonoTransforms[Int, BitSet], Iterable[Int], IterableLike[Int, Set], IterablePolyTransforms[Int, Set], IterableMonoTransforms[Int, BitSet], IterableOps[Int], FromIterable[Set], IterableOnce[Int], AnyRef, Any
Known Subclasses
BitSet, BitSet
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BitSet
  2. BitSetLike
  3. BitSetMonoTransforms
  4. SortedSet
  5. SortedSetLike
  6. SortedPolyTransforms
  7. Sorted
  8. SortedLike
  9. Set
  10. SetLike
  11. Equals
  12. SetMonoTransforms
  13. Iterable
  14. IterableLike
  15. IterablePolyTransforms
  16. IterableMonoTransforms
  17. IterableOps
  18. FromIterable
  19. IterableOnce
  20. AnyRef
  21. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def &(that: Set[Int]): BitSet
    Definition Classes
    SetMonoTransforms
  2. abstract def ++(that: Set[Int]): BitSet
    Definition Classes
    SetMonoTransforms
  3. abstract def ^(other: BitSet): BitSet

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

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

    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
    BitSetMonoTransforms
  4. abstract def contains(elem: Int): Boolean
    Definition Classes
    SetLike
  5. abstract def fromIterable[B](coll: Iterable[B]): Set[B]
    Definition Classes
    IterablePolyTransforms
  6. abstract def fromIterableWithSameElemType(coll: Iterable[Int]): Set[Int]

    Create a collection of type C[A] from the elements of coll, which has the same element type as this collection.

    Create a collection of type C[A] from the elements of coll, which has the same element type as this collection. Overridden in StringOps and ArrayOps.

    Attributes
    protected[this]
    Definition Classes
    IterableLike → IterableMonoTransforms
  7. abstract def iterator(): Iterator[Int]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
    IterableOnce
  8. abstract def map(f: (Int) ⇒ Int): BitSet

    Builds a new bitset by applying a function to all elements of this bitset

    Builds a new bitset by applying a function to all elements of this bitset

    f

    the function to apply to each element.

    returns

    a new bitset resulting from applying the given function f to each element of this bitset and collecting the results

    Definition Classes
    BitSetMonoTransforms
  9. abstract def map[B](f: (Int) ⇒ B)(implicit ordering: Ordering[B]): SortedSet[B]
    Definition Classes
    SortedPolyTransforms
  10. abstract def range(from: Int, until: Int): SortedSet[Int]
    Definition Classes
    SortedLike
  11. abstract def subsetOf(that: Set[Int]): Boolean
    Definition Classes
    SetLike

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Int](xs: IterableOnce[B]): Set[B]

    Concatenation

    Concatenation

    Definition Classes
    IterablePolyTransforms
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def canEqual(that: Any): Boolean
    Definition Classes
    SetLike → Equals
  7. def className: String

    The class name of this collection.

    The class name of this collection. To be used for converting to string. Collections generally print like this:

    <className>(elem_1, ..., elem_n)

    Definition Classes
    IterableOps
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def coll: BitSet.this.type

    The collection itself

    The collection itself

    Attributes
    protected
    Definition Classes
    Iterable → IterablePolyTransforms → IterableMonoTransforms → IterableOps
  10. def copyToArray[B >: Int](xs: Array[B], start: Int = 0): xs.type

    Copy all elements of this collection to array xs, starting at start.

    Copy all elements of this collection to array xs, starting at start.

    Definition Classes
    IterableOps
  11. def drop(n: Int): BitSet

    The rest of the collection without its n first elements.

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

    Definition Classes
    IterableMonoTransforms
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(that: Any): Boolean
    Definition Classes
    SetLike → Equals → AnyRef → Any
  14. def filter(p: (Int) ⇒ Boolean): BitSet

    All elements satisfying predicate p

    All elements satisfying predicate p

    Definition Classes
    IterableMonoTransforms
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def flatMap[B](f: (Int) ⇒ IterableOnce[B]): Set[B]

    Flatmap

    Flatmap

    Definition Classes
    IterablePolyTransforms
  17. def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

    Fold left

    Fold left

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

    Fold right

    Fold right

    Definition Classes
    IterableOps
  19. def foreach[U](f: (Int) ⇒ U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    IterableOps
  20. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  21. def hashCode(): Int
    Definition Classes
    SetLike → AnyRef → Any
  22. def head: Int

    The first element of the collection.

    The first element of the collection.

    Definition Classes
    IterableOps
  23. def indexWhere(p: (Int) ⇒ Boolean): Int

    The index of the first element in this collection for which p holds.

    The index of the first element in this collection for which p holds.

    Definition Classes
    IterableOps
  24. def isEmpty: Boolean

    Is the collection empty?

    Is the collection empty?

    Definition Classes
    IterableOps
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def knownSize: Int

    The number of elements in this collection, if it can be cheaply computed, -1 otherwise.

    The number of elements in this collection, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
    IterableOps
  27. def map[B](f: (Int) ⇒ B): Set[B]

    Map

    Map

    Definition Classes
    IterablePolyTransforms
  28. def mkString(sep: String): String

    A string showing all elements of this collection, separated by string sep.

    A string showing all elements of this collection, separated by string sep.

    Definition Classes
    IterableOps
  29. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. def nonEmpty: Boolean

    Is the collection not empty?

    Is the collection not empty?

    Definition Classes
    IterableOps
  31. final def notify(): Unit
    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  33. final def ordering: Ordering[Int]
    Definition Classes
    BitSetLike → SortedLike
  34. def partition(p: (Int) ⇒ Boolean): (BitSet, BitSet)

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not.

    A pair of, first, all elements that satisfy prediacte p and, 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 partition in Buildable, which requires only a single traversal.

    Definition Classes
    IterableMonoTransforms
  35. def size: Int

    The number of elements in this collection.

    The number of elements in this collection. Does not terminate for infinite collections.

    Definition Classes
    IterableOps
  36. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  37. def tail: BitSet

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableMonoTransforms
  38. def take(n: Int): BitSet

    A collection containing the first n elements of this collection.

    A collection containing the first n elements of this collection.

    Definition Classes
    IterableMonoTransforms
  39. def to[C[X] <: Iterable[X]](fi: FromIterable[C]): C[Int]

    Given a collection factory fi for collections of type constructor C, convert this collection to one of type C[A].

    Given a collection factory fi for collections of type constructor C, convert this collection to one of type C[A]. Example uses:

    xs.to(List) xs.to(ArrayBuffer)

    Definition Classes
    IterableOps
  40. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Definition Classes
    IterableOps
  41. def toString(): String
    Definition Classes
    IterableOps → Any
  42. def view: View[Int]

    A view representing the elements of this collection.

    A view representing the elements of this collection.

    Definition Classes
    IterableOps
  43. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. def zip[B](xs: IterableOnce[B]): Set[(Int, B)]

    Zip.

    Zip. Interesting because it requires to align to source collections.

    Definition Classes
    IterablePolyTransforms

Inherited from BitSetLike[BitSet]

Inherited from BitSetMonoTransforms[BitSet]

Inherited from SortedSet[Int]

Inherited from SortedSetLike[Int, SortedSet]

Inherited from SortedPolyTransforms[Int, SortedSet]

Inherited from Sorted[Int]

Inherited from SortedLike[Int, SortedSet[Int]]

Inherited from Set[Int]

Inherited from SetLike[Int, Set]

Inherited from Equals

Inherited from SetMonoTransforms[Int, BitSet]

Inherited from Iterable[Int]

Inherited from IterableLike[Int, Set]

Inherited from IterablePolyTransforms[Int, Set]

Inherited from IterableMonoTransforms[Int, BitSet]

Inherited from IterableOps[Int]

Inherited from FromIterable[Set]

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Ungrouped