public abstract class IntSetVariable<T extends IntSetVariable<T>> extends AbstractVariable<T>
TODO: optimize the representation more; e.g. BitVectors with non-zero lower bound.
| Constructor and Description |
|---|
IntSetVariable() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(int b)
Set a particular bit
|
boolean |
addAll(IntSet B)
Add all integers from the set B
|
boolean |
addAll(T other)
Add all integers from the other int set variable.
|
boolean |
addAllInIntersection(IntSet other,
IntSet filter) |
boolean |
addAllInIntersection(T other,
IntSet filter) |
boolean |
contains(int b)
Is a particular bit set?
|
boolean |
containsAny(IntSet instances) |
void |
copyState(T other)
Set this variable to have the same state as another one
|
MutableIntSet |
getValue() |
void |
remove(int i) |
void |
removeAll() |
boolean |
sameValue(IntSetVariable other) |
int |
size() |
String |
toString() |
equals, getOrderNumber, hashCode, nextHash, setOrderNumbergetGraphNodeId, setGraphNodeIdclone, finalize, getClass, notify, notifyAll, wait, wait, waitgetGraphNodeId, setGraphNodeIdpublic void copyState(T other)
IVariablepublic boolean addAll(IntSet B)
public boolean addAll(T other)
public boolean sameValue(IntSetVariable other)
public boolean add(int b)
b - the bit to setpublic boolean contains(int b)
b - the bit to checkpublic MutableIntSet getValue()
public void remove(int i)
public int size()
public boolean containsAny(IntSet instances)
public void removeAll()