Module cudd_sys::cudd [−][src]
Expand description
Contains the declarations present in cudd.h (main CUDD API).
Enums
Type of aggregation method algorithm.
Type of a hook.
Type of grouping used during lazy sifting.
Types of variable reordering algorithms.
Type of variable used during lazy sifting.
Constants
Recommended default size of the operation cache table.
An integer representation of a Boolean false constant. (This is not a DD construct!)
An special return value indicating an out-of-memory error.
Default option for Cudd_addResidue: specifies that the least-significant-bit is on top,
and the number is interpreted as unsigned.
Used with Cudd_addResidue: add (logical or) this flag to the default options to specify that
the most-significant-bit is on top.
Used with Cudd_addResidue: add (logical or) this flag to the default options to specify that
the number should be interpreted as a signed two’s complement.
An integer representation of a Boolean true constant. (This is not a DD construct!)
Recommended default size of the unique node table.
Functions
Computes the complemented version of a node pointer (i.e. with a complement bit set, regardless of its previous value).
Iterates over the cubes of a decision diagram f. The length of the cube is the number of variables in the CUDD manager when the iteration is started.
Iterates over the nodes of a decision diagram f. See also Cudd_FirstNode.
Iterates over the primes of a Boolean function producing
a prime (but not necessarily irredundant) cover.
For more information, see Cudd_FirstPrime.
Returns 1 if a pointer is complemented.
Complements a DD node by flipping the complement attribute of the pointer (the least significant bit).
Complements a DD node by flipping the complement attribute
of the pointer if a condition is satisfied. The condition
argument must be always either 1 or 0.
Returns the current position in the order of variable
index. This macro is obsolete and is kept for compatibility. New
applications should use Cudd_ReadPerm instead.
Computes the regular version of a node pointer (i.e. without the complement bit set, regardless of its previous value).
Iterates over the paths of a ZDD f.
Type Definitions
Type of the value of a terminal node.
Type of the apply operator function.
Type of the hook function.
Type of the monadic apply operator function.
Type of the out-of-memory function.
Type of the priority function.
Type of the termination handler function.
Type of the time-out handler function.