_cstringstream | Type of a simple extensible string buffer |

ABDD | Class for ADDs and BDDs |

ADD | Class for ADDs |

ApproxInfo | Main bookkeeping data structure for approximation algorithms |

AssortedInfo | Assorted information needed by the BuildSubsetBdd procedure |

BDD | Class for BDDs |

BnetNetwork | Very simple boolean network data structure |

BnetNode | Node of the boolean network |

BnetTabline | Type to store a line of the truth table of a node |

Capsule | Class for reference counting of CUDD managers |

Conjuncts | Type of a pair of conjoined BDDs |

Cudd | Class for CUDD managers |

cuddPathPair | Type of item stored in memoization table |

DD | Base class for all decision diagrams in CUDD |

DdCache | Computed table |

DdChildren | The two children of a non-terminal node |

DdGen | CUDD generator |

DdHashItem | Local hash table item |

DdHashTable | Local hash table |

DdHook | CUDD hook |

DdLevelQueue | Level queue |

DdLocalCache | Local cache |

DdLocalCacheItem | Generic local cache item |

DdManager | Specialized DD symbol table |

DdNode | Decision diagram node |

DdQueueItem | Generic level queue item |

DdSubtable | Subtable for one index |

DdTlcInfo | This structure holds the set of clauses for a node |

EpDoubleStruct | Extended precision double to keep very large value |

EpTypeUnion | Different views of a double |

flowStatsStruct | Structure to hold statistics |

GeneticInfo | Miscellaneous information |

GlobalInfo | Bookkeeping data structure for subsetting algorithm |

GlobalQueueItem | Item of the queue used in the levelized traversal of the BDD |

hack | This is a hack for when CUDD_VALUE_TYPE is double |

hashEntry | |

IeeeDoubleStruct | IEEE double struct |

IeeeNanStruct | IEEE double NaN struct |

IndexKey | Used to sort variables for reordering |

info_t | Miscellaneous information |

LocalQueueItem | Type of the item of the local queue |

MarkCacheKey | |

Move | Reordering move record |

MtrNode_ | Multi-way tree node |

mys | Just some struct type |

NodeData | Data structure to store the information on each node |

NodeDist | Structure created to store subset results for each node and distances with odd and even parity of the node from the root and sink |

NodeStat | Stats for one node |

NtrHeap | Heap-based priority queue |

NtrHeapSlot | Entry of NtrHeap |

NtrOptions | Options for nanotrav |

NtrPartTR | Data structure for partitioned transition relation |

st_generator | Symbol table generator |

st_table | Symbol table header |

st_table_entry | Symbol table entry |

SubsetInfo | Miscellaneous info |

TlClause | This structure is for temporary representation of sets of clauses |

ZDD | Class for ZDDs |

Generated on 31 Dec 2015 for cudd by 1.6.1