| Modifier and Type | Method and Description |
|---|---|
void |
assign(Set s) |
double |
cardinality() |
void |
clear()
empties the set.
|
int |
compare(Set s_)
retruns 0 if equal, -1 if this \subset s, +1 if s \subset this, Integer.MAX_VALUE otherwise
|
Set |
copy()
creates a deep copy of this set.
|
Set |
diff(Set s_)
NOTE: sets must be from the same universe
|
SetEnumeration |
elements() |
boolean |
equals(Set s)
NOTE: the sets must be created with the same type of universe!
|
void |
free()
free the memory used by this set.
|
boolean |
insert(int[] assignments)
returns true if assignment was not alread in the set
|
static void |
internal_test()
testbench.
|
Set |
intersection(Set s) |
Set |
invert() |
boolean |
isEmpty() |
boolean |
member(int[] assignment)
fast membership test.
|
boolean |
memberDC(int[] assignment)
returns true if assignment is in the set.
|
boolean |
remove(int[] assignment)
returns true if assignment was in the set
|
void |
show(String name) |
Set |
union(Set s) |
public double cardinality()
cardinality in interface Setpublic void free()
SetNOTE: you can/need not to call this function after theUniverse has been freed!
public boolean equals(Set s)
Setpublic boolean isEmpty()
public void assign(Set s)
public void clear()
SetNOTE: this does not return the memory allocated by this set. to do that, call free()
clear in interface SetSet.free()public boolean memberDC(int[] assignment)
public boolean member(int[] assignment)
public boolean remove(int[] assignment)
public boolean insert(int[] assignments)
public Set invert()
public Set intersection(Set s)
intersection in interface Setpublic Set diff(Set s_)
SetNOTE: sets must be from the same universe
public int compare(Set s_)
public SetEnumeration elements()
public void show(String name)
public static void internal_test()
This file is a part of the JDD package, a native Java Binary Decision Diagram Library.