public final class BitSetUtil
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
static java.util.BitSet |
bsNull |
Constructor and Description |
---|
BitSetUtil() |
Modifier and Type | Method and Description |
---|---|
static java.util.BitSet |
andNot(java.util.BitSet a,
java.util.BitSet b) |
static boolean |
areEqual(java.util.BitSet a,
java.util.BitSet b) |
static int |
cardinalityOf(java.util.BitSet bs)
cardinality = "total number of set bits"
|
static java.util.BitSet |
copy(java.util.BitSet bs) |
static java.util.BitSet |
copy(java.util.BitSet a,
java.util.BitSet b) |
static java.util.BitSet |
copyInvert(java.util.BitSet bs,
int n) |
static java.util.BitSet |
deleteBits(java.util.BitSet bs,
java.util.BitSet bsDelete)
this one slides deleted bits out of a pattern.
|
static boolean |
haveCommon(java.util.BitSet a,
java.util.BitSet b) |
static java.util.BitSet |
invertInPlace(java.util.BitSet bs,
int n)
inverts the bitset bits 0 through n-1,
and returns a reference to the modified bitset
|
static java.util.BitSet |
newBitSet(int i0,
int i1) |
static java.util.BitSet |
setAll(int n) |
static java.util.BitSet |
setBit(int i) |
static java.util.BitSet |
toggleInPlace(java.util.BitSet a,
java.util.BitSet b)
a perhaps curious method:
b is a reference set, perhaps all atoms in a certain molecule a is the
working set, perhaps representing all displayed atoms
For each set bit in b: a) if a is also set, then clear a's bit UNLESS b) if
a is not set, then add to a all set bits of b
Thus, if a equals b --> clear all if a is a subset of b, then --> b if b is
a subset of a, then --> a not b if a only intersects with b, then --> a or
b if a does not intersect with b, then a or b
In "toggle" mode, when you click on any atom of the molecule, you want
either:
(a) all the atoms in the molecule to be displayed if not all are already
displayed, or
(b) the whole molecule to be hidden if all the atoms of the molecule are
already displayed.
|
public static java.util.BitSet setBit(int i)
public static boolean areEqual(java.util.BitSet a, java.util.BitSet b)
public static boolean haveCommon(java.util.BitSet a, java.util.BitSet b)
public static int cardinalityOf(java.util.BitSet bs)
bs
- public static java.util.BitSet newBitSet(int i0, int i1)
public static java.util.BitSet setAll(int n)
public static java.util.BitSet andNot(java.util.BitSet a, java.util.BitSet b)
public static java.util.BitSet copy(java.util.BitSet bs)
public static java.util.BitSet copy(java.util.BitSet a, java.util.BitSet b)
public static java.util.BitSet copyInvert(java.util.BitSet bs, int n)
public static java.util.BitSet invertInPlace(java.util.BitSet bs, int n)
bs
- n
- public static java.util.BitSet toggleInPlace(java.util.BitSet a, java.util.BitSet b)
a
- b
- public static java.util.BitSet deleteBits(java.util.BitSet bs, java.util.BitSet bsDelete)
bs
- bsDelete
-