ProfiledBDD2

java.lang.Object
- jdd.bdd.NodeTable
- - jdd.bdd.BDD
  - - jdd.bdd.debug.ProfiledBDD2

Direct Known Subclasses:

Milner, Solitaire
```
public class ProfiledBDD2
extends BDD
```
profiling the BDD by counting and timing each operation

See Also:

ProfiledBDD, BDD

Field Summary
- Fields inherited from class jdd.bdd.BDD
  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_vec
- Fields inherited from class jdd.bdd.NodeTable
  dead_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 Summary

Constructors
Constructor and Description

ProfiledBDD2(int nodesize)

ProfiledBDD2(int nodesize, int cache_size)

Constructors
Constructor and Description
`ProfiledBDD2(int nodesize)`
`ProfiledBDD2(int nodesize, int cache_size)`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`Collection`	`addDebugger(BDDDebuger d)` for debugging: install a debugger.
`int`	`and(int a, int b)` binary AND.
`int`	`biimp(int a, int b)` binary BI-IMPLICATION (double implication, equivalence, whatever...).
`Permutation`	`createPermutation(int[] cube_from, int[] cube_to)` create a Permutation vector for a given variable permutation. A permutation is used by `replace` to re-label nodes in a BDD. NOTE: the from and to-cubes must not overlap!
`int`	`exists(int a, int b)` binary EXISTS, existential quantification. Let exists(bdd, variable) to be bdd(variable) OR bdd(NOT variable).
`int`	`forall(int a, int b)` binary FOR-ALL, universal quantification. Let forall(bdd, variable) to be bdd(variable) AND bdd(NOT variable).
`int`	`imp(int a, int b)` binary implication.
`int`	`ite(int a, int b, int c)` this is the `If-Then-Else` BDD function. it can be used to (inefficiently) simulate and binary operation. (i think it is described in the "Long" paper).
`int`	`nand(int a, int b)` binary NAND.
`int`	`nor(int a, int b)` binary NOR.
`int`	`not(int a)` binary NOT.
`int`	`or(int a, int b)` binary OR.
`int`	`relProd(int a, int b, int c)` This is the relational-product of Clarke et al.. It combines a conjunction and existential quantification that is often seen in image computation: EXISTS c.
`int`	`replace(int a, Permutation b)` Given a permutation, this function will re-label (some) nodes in a BDD to associate with a new sets of variables.
`void`	`report(String what, long count, long time)`
`int`	`restrict(int a, int b)` The BDD restrict operation.
`double`	`satCount(int a)` returns the number of satisfying assignments for this BDD.
`void`	`showStats()` show some statistics ...
`int`	`simplify(int a, int b)` The BDD simplification operation.
`int`	`support(int a)` returns the support set of a variable, that is a cube C where each of its variables are used somewhere in the ibpu bdd.
`int`	`xor(int a, int b)` binary XOR.

Methods inherited from class jdd.bdd.BDD
andTo, cleanup, createVar, cube, cube, getMemoryUsage, getOne, getZero, internal_test, isVariable, member, minterm, minterm, mk, nodeCount, numberOfVariables, oneSat_rec, oneSat, oneSat, orTo, post_removal_callbak, print, printCubes, printDot, printSet, quasiReducedNodeCount, satCount_rec, setNodeNames

Methods inherited from class jdd.bdd.NodeTable
add, 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_parameters

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - ProfiledBDD2
```
public ProfiledBDD2(int nodesize)
```
  - ProfiledBDD2
```
public ProfiledBDD2(int nodesize,
                    int cache_size)
```
- Method Detail
  - addDebugger
```
public Collection addDebugger(BDDDebuger d)
```
    Description copied from class: NodeTable
    
    for debugging: install a debugger. returns the set of caches.
    
    Overrides:
    
    addDebugger in class NodeTable
  - and
```
public int and(int a,
               int b)
```
    Description copied from class: BDD
    
    binary AND.
    
    Overrides:
    
    and in class BDD
    
    Returns:
    
    u1 AND u2
    
    See Also:
    
    BDD.or(int, int)
  - or
```
public int or(int a,
              int b)
```
    Description copied from class: BDD
    
    binary OR.
    
    Overrides:
    
    or in class BDD
    
    Returns:
    
    u1 OR u2
    
    See Also:
    
    BDD.and(int, int)
  - xor
```
public int xor(int a,
               int b)
```
    Description copied from class: BDD
    
    binary XOR.
    
    Overrides:
    
    xor in class BDD
    
    Returns:
    
    u1 XOR u2
    
    See Also:
    
    BDD.biimp(int, int)
  - biimp
```
public int biimp(int a,
                 int b)
```
    Description copied from class: BDD
    
    binary BI-IMPLICATION (double implication, equivalence, whatever...).
    
    Overrides:
    
    biimp in class BDD
    
    Returns:
    
    (u1 <--> u2)
    
    See Also:
    
    BDD.xor(int, int)
  - imp
```
public int imp(int a,
               int b)
```
    Description copied from class: BDD
    
    binary implication.
    
    Overrides:
    
    imp in class BDD
    
    Returns:
    
    u1 -> u2
  - nor
```
public int nor(int a,
               int b)
```
    Description copied from class: BDD
    
    binary NOR.
    
    Overrides:
    
    nor in class BDD
    
    Returns:
    
    u1 NOR u2
    
    See Also:
    
    BDD.nand(int, int)
  - nand
```
public int nand(int a,
                int b)
```
    Description copied from class: BDD
    
    binary NAND.
    
    Overrides:
    
    nand in class BDD
    
    Returns:
    
    u1 NAND u2
    
    See Also:
    
    BDD.nor(int, int)
  - not
```
public int not(int a)
```
    Description copied from class: BDD
    
    binary NOT.
    
    Overrides:
    
    not in class BDD
    
    Returns:
    
    NOT u1
  - replace
```
public int replace(int a,
                   Permutation b)
```
    Description copied from class: BDD
    
    Given a permutation, this function will re-label (some) nodes in a BDD to associate with a new sets of variables.
    
    Overrides:
    
    replace in class BDD
    
    See Also:
    
    Permutation, BDD.createPermutation(int[], int[])
  - exists
```
public int exists(int a,
                  int b)
```
    Description copied from class: BDD
    
    binary EXISTS, existential quantification.
    Let exists(bdd, variable) to be bdd(variable) OR bdd(NOT variable). Then exists(bdd, cube) does this for every (combination of) variable in the cube.
    
    Note that all references of variable and the variables in cube will be removed from the resulting bdd.
    
    Overrides:
    
    exists in class BDD
    
    See Also:
    
    BDD.forall(int, int)
  - forall
```
public int forall(int a,
                  int b)
```
    Description copied from class: BDD
    
    binary FOR-ALL, universal quantification.
    Let forall(bdd, variable) to be bdd(variable) AND bdd(NOT variable). Then foral(bdd, cube) does this for every (combination of) variable in the cube.
    
    Note that all references of variable and the variables in cube will be removed from the resulting bdd.
    
    Overrides:
    
    forall in class BDD
    
    See Also:
    
    BDD.exists(int, int)
  - relProd
```
public int relProd(int a,
                   int b,
                   int c)
```
    Description copied from class: BDD
    
    This is the relational-product of Clarke et al..
    It combines a conjunction and existential quantification that is often seen in image computation:
    EXISTS c. (u1 AND u2)
    
    Use this operation for better runtime performance!
    
    Overrides:
    
    relProd in class BDD
  - support
```
public int support(int a)
```
    Description copied from class: BDD
```
 returns the support set of a variable, that is a cube C where each of its variables
 are used somewhere in the ibpu bdd.
```
    Overrides:
    
    support in class BDD
  - restrict
```
public int restrict(int a,
                    int b)
```
    Description copied from class: BDD
    
    The BDD restrict operation. Tries to minimize the size of a BDD by using dont-cares. For more details, check out "A unified framework for the formal verification of circuits, by Coudert and Madre.
    
    Overrides:
    
    restrict in class BDD
    
    See Also:
    
    BDD.simplify(int, int)
  - simplify
```
public int simplify(int a,
                    int b)
```
    Description copied from class: BDD
    
    The BDD simplification operation. Work like the restrict operation.
    
    . Check out Andersens BDD lecture notes for detailed information on this one. XXX: we have no cache for it yet!
    
    Overrides:
    
    simplify in class BDD
    
    See Also:
    
    BDD.restrict(int, int)
  - ite
```
public int ite(int a,
               int b,
               int c)
```
    Description copied from class: BDD
    
    this is the If-Then-Else BDD function.
    
    it can be used to (inefficiently) simulate and binary operation.
    (i think it is described in the "Long" paper).
    
    Overrides:
    
    ite in class BDD
    
    Returns:
    
    (f AND then_) OR (NOT f AND else_)
  - satCount
```
public double satCount(int a)
```
    Description copied from class: BDD
    
    returns the number of satisfying assignments for this BDD. beware of possible floating-point overflow here!
    Important note: this works becuase getVar() returns "numbers of variables plus one" for the terminal nodes!
    
    Overrides:
    
    satCount in class BDD
  - createPermutation
```
public Permutation createPermutation(int[] cube_from,
                                     int[] cube_to)
```
    Description copied from class: BDD
    
    create a Permutation vector for a given variable permutation.
    A permutation is used by replace to re-label nodes in a BDD.
    
    NOTE: the from and to-cubes must not overlap!
    
    Overrides:
    
    createPermutation in class BDD
    
    See Also:
    
    Permutation, BDD.replace(int, jdd.bdd.Permutation)
  - report
```
public void report(String what,
                   long count,
                   long time)
```
  - showStats
```
public void showStats()
```
    Description copied from class: NodeTable
    
    show some statistics ...
    
    Overrides:
    
    showStats in class BDD

Class ProfiledBDD2

Field Summary

Fields inherited from class jdd.bdd.BDD

Fields inherited from class jdd.bdd.NodeTable

Constructor Summary

Method Summary

Methods inherited from class jdd.bdd.BDD

Methods inherited from class jdd.bdd.NodeTable

Methods inherited from class java.lang.Object

Constructor Detail

ProfiledBDD2

ProfiledBDD2

Method Detail

addDebugger

and

or

xor

biimp

imp

nor

nand

not

replace

exists

forall

relProd

support

restrict

simplify

ite

satCount

createPermutation

report

showStats