sealed trait BitSet extends AnyRef
A Set of BitPat
represents a set of bit vector with mask.
- Self Type
- BitSet
- Source
- BitPat.scala
- Alphabetic
- By Inheritance
- BitSet
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
cover(that: BitSet): Boolean
Check whether this
BitSet
covers that (i.e.Check whether this
BitSet
covers that (i.e. forall b matches that, b also matches this)- that
BitSet
to b covered- returns
true if this
BitSet
can cover thatBitSet
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(obj: Any): Boolean
Test whether two
BitSet
matches the same set of valueTest whether two
BitSet
matches the same set of value- returns
true if two
BitSet
is same.
- Definition Classes
- BitSet → AnyRef → Any
- Note
This method can be very expensive compared to ordinary == operator between two Objects
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getWidth: Int
Get specified width of said BitSet
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
intersect(that: BitSet): BitSet
Intersect
this
andthat
BitSet
.Intersect
this
andthat
BitSet
.- that
BitSet
to be intersected.- returns
a
BitSet
containing all elements ofthis
that also belong tothat
.
-
def
inverse: BitSet
Calculate the inverse of this pattern set.
Calculate the inverse of this pattern set.
- returns
A BitSet matching all value (of the given with) iff it doesn't match this pattern.
-
def
isEmpty: Boolean
whether this
BitSet
is empty (i.e.whether this
BitSet
is empty (i.e. no value matches) -
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def matches(input: UInt): Bool
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
overlap(that: BitSet): Boolean
Check whether this
BitSet
overlap with thatBitSet
, i.e.Check whether this
BitSet
overlap with thatBitSet
, i.e. !(intersect.isEmpty)- that
BitSet
to be checked.- returns
true if this and that
BitSet
have overlap.
-
def
subtract(that: BitSet): BitSet
Subtract that from this
BitSet
.Subtract that from this
BitSet
.- that
subtrahend
BitSet
.- returns
a
BitSet
contining elements ofthis
which are not the elements ofthat
.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- BitSet → AnyRef → Any
-
def
union(that: BitSet): BitSet
Union this and that
BitSet
Union this and that
BitSet
- that
BitSet
to union.- returns
a
BitSet
containing all elements ofthis
andthat
.
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()