public class BDDUniverse extends BDD implements Universe
insert() and member() functions are memory but not time efficient. The opposite of the mixed-radix package.
The set operators (unions, diff, etc) are however very efficient (BDDs, remember?).
CACHE_AND, CACHE_BIIMP, CACHE_EXISTS, CACHE_FORALL, CACHE_IMP, CACHE_NAND, CACHE_NOR, CACHE_OR, CACHE_RESTRICT, CACHE_XOR, ite_cache, last_sat_vars, nodeNames, not_cache, num_vars, oneSat_buffer, op_cache, quant_cache, quant_conj, quant_cube, quant_id, relprod_cache, replace_cache, restrict_careset, sat_cache, sign_vec, varset_last, varset_vecdead_nodes, ht_chain, mark_stack, NODE_MARK, NODE_UNMARK, nodesminfree, stat_gc_count, stat_gc_freed, stat_gc_time, stat_grow_time, stat_lookup_count, stat_notify_time, stat_nt_grow, table_size, work_stack, work_stack_tos| Constructor and Description |
|---|
BDDUniverse(int[] domains) |
| Modifier and Type | Method and Description |
|---|---|
int |
cardinality(int[] x) |
Set |
createEmptySet()
create a new set that is empty
|
Set |
createFullSet()
create a set that contains all possible elements
|
double |
domainSize()
The domainSize if the size of all elements in the universe.
|
void |
free()
cleanup before die
|
static void |
internal_test()
testbench.
|
int |
numberOfBits()
number of BDD bits (variables) allocated by this universe
|
void |
print(int[] v) |
void |
randomMember(int[] out) |
void |
satOneVector(int bdd,
int[] vec) |
Set |
simplify(Set s1,
Set s2) |
int |
subdomainCount() |
and, andTo, biimp, cleanup, createPermutation, createVar, cube, cube, exists, forall, getMemoryUsage, getOne, getZero, imp, isVariable, ite, member, minterm, minterm, mk, nand, nodeCount, nor, not, numberOfVariables, oneSat_rec, oneSat, oneSat, or, orTo, post_removal_callbak, print, printCubes, printDot, printSet, quasiReducedNodeCount, relProd, replace, restrict, satCount_rec, satCount, setNodeNames, showStats, simplify, support, xoradd, addDebugger, check_all_nodes, check_node, countRootNodes, deref, enableStackMarking, gc, getHigh, getLow, getRef, getVar, getVarUnmasked, grow, invalidate, isNodeMarked, isValid, mark_node, mark_tree, match_table, ref, saturate, setAll, setAll, show_table_all, show_table, show_tuple, signal_removed, tree_depth_changed, unmark_node, unmark_tree, update_grow_parameterspublic void free()
free in interface UniverseSet.free()public int cardinality(int[] x)
public Set createEmptySet()
UniversecreateEmptySet in interface Universepublic Set createFullSet()
UniversecreateFullSet in interface Universepublic double domainSize()
UniversedomainSize in interface Universepublic int subdomainCount()
subdomainCount in interface Universepublic int numberOfBits()
public void print(int[] v)
public void randomMember(int[] out)
public void satOneVector(int bdd,
int[] vec)
public static void internal_test()
This file is a part of the JDD package, a native Java Binary Decision Diagram Library.