distr/cudd/doc/cuddAllAbs.html

   1 <HTML>
   2 <HEAD><TITLE>cudd package abstract</TITLE></HEAD>
   3 <BODY>
   4
   5
   6 <!-- Function Abstracts -->
   7
   8 <dl>
   9 <DT> <A HREF="cuddAllDet.html#AssessPathLength" TARGET="MAIN"><CODE>AssessPathLength()</CODE></A>
  10 <DD> Chooses the maximum allowable path length of nodes under the
  11   threshold.
  12
  13 <DT> <A HREF="cuddAllDet.html#BAapplyBias" TARGET="MAIN"><CODE>BAapplyBias()</CODE></A>
  14 <DD> Finds don't care nodes.
  15
  16 <DT> <A HREF="cuddAllDet.html#BAmarkNodes" TARGET="MAIN"><CODE>BAmarkNodes()</CODE></A>
  17 <DD> Marks nodes for remapping.
  18
  19 <DT> <A HREF="cuddAllDet.html#BuildConjuncts" TARGET="MAIN"><CODE>BuildConjuncts()</CODE></A>
  20 <DD> Builds the conjuncts recursively, bottom up.
  21
  22 <DT> <A HREF="cuddAllDet.html#BuildSubsetBdd" TARGET="MAIN"><CODE>BuildSubsetBdd()</CODE></A>
  23 <DD> Builds the BDD with nodes labeled with path length less than or equal to maxpath
  24
  25 <DT> <A HREF="cuddAllDet.html#BuildSubsetBdd" TARGET="MAIN"><CODE>BuildSubsetBdd()</CODE></A>
  26 <DD> Builds the subset BDD using the heavy branch method.
  27
  28 <DT> <A HREF="cuddAllDet.html#CheckInTables" TARGET="MAIN"><CODE>CheckInTables()</CODE></A>
  29 <DD> Check if the two pairs exist in the table, If any of the
  30   conjuncts do exist, store in the cache and return the corresponding pair.
  31
  32 <DT> <A HREF="cuddAllDet.html#CheckTablesCacheAndReturn" TARGET="MAIN"><CODE>CheckTablesCacheAndReturn()</CODE></A>
  33 <DD> Check the tables for the existence of pair and return one
  34   combination, cache the result.
  35
  36 <DT> <A HREF="cuddAllDet.html#ConjunctsFree" TARGET="MAIN"><CODE>ConjunctsFree()</CODE></A>
  37 <DD> Free factors structure
  38
  39 <DT> <A HREF="cuddAllDet.html#CorrelCleanUp" TARGET="MAIN"><CODE>CorrelCleanUp()</CODE></A>
  40 <DD> Frees memory associated with hash table.
  41
  42 <DT> <A HREF="cuddAllDet.html#CorrelCompare" TARGET="MAIN"><CODE>CorrelCompare()</CODE></A>
  43 <DD> Compares two hash table entries.
  44
  45 <DT> <A HREF="cuddAllDet.html#CorrelHash" TARGET="MAIN"><CODE>CorrelHash()</CODE></A>
  46 <DD> Hashes a hash table entry.
  47
  48 <DT> <A HREF="cuddAllDet.html#CountMinterms" TARGET="MAIN"><CODE>CountMinterms()</CODE></A>
  49 <DD> Count the number of minterms of each node ina a BDD and
  50   store it in a hash table.
  51
  52 <DT> <A HREF="cuddAllDet.html#CreateBotDist" TARGET="MAIN"><CODE>CreateBotDist()</CODE></A>
  53 <DD> Get longest distance of node from constant.
  54
  55 <DT> <A HREF="cuddAllDet.html#CreateBotDist" TARGET="MAIN"><CODE>CreateBotDist()</CODE></A>
  56 <DD> Labels each node with the shortest distance from the constant.
  57
  58 <DT> <A HREF="cuddAllDet.html#CreatePathTable" TARGET="MAIN"><CODE>CreatePathTable()</CODE></A>
  59 <DD> The outer procedure to label each node with its shortest
  60   distance from the root and constant
  61
  62 <DT> <A HREF="cuddAllDet.html#CreateTopDist" TARGET="MAIN"><CODE>CreateTopDist()</CODE></A>
  63 <DD> Labels each node with its shortest distance from the root
  64
  65 <DT> <A HREF="cuddAllDet.html#Cudd_AddHook" TARGET="MAIN"><CODE>Cudd_AddHook()</CODE></A>
  66 <DD> Adds a function to a hook.
  67
  68 <DT> <A HREF="cuddAllDet.html#Cudd_ApaAdd" TARGET="MAIN"><CODE>Cudd_ApaAdd()</CODE></A>
  69 <DD> Adds two arbitrary precision integers.
  70
  71 <DT> <A HREF="cuddAllDet.html#Cudd_ApaCompareRatios" TARGET="MAIN"><CODE>Cudd_ApaCompareRatios()</CODE></A>
  72 <DD> Compares the ratios of two arbitrary precision integers to two
  73   unsigned ints.
  74
  75 <DT> <A HREF="cuddAllDet.html#Cudd_ApaCompare" TARGET="MAIN"><CODE>Cudd_ApaCompare()</CODE></A>
  76 <DD> Compares two arbitrary precision integers.
  77
  78 <DT> <A HREF="cuddAllDet.html#Cudd_ApaCopy" TARGET="MAIN"><CODE>Cudd_ApaCopy()</CODE></A>
  79 <DD> Makes a copy of an arbitrary precision integer.
  80
  81 <DT> <A HREF="cuddAllDet.html#Cudd_ApaCountMinterm" TARGET="MAIN"><CODE>Cudd_ApaCountMinterm()</CODE></A>
  82 <DD> Counts the number of minterms of a DD.
  83
  84 <DT> <A HREF="cuddAllDet.html#Cudd_ApaIntDivision" TARGET="MAIN"><CODE>Cudd_ApaIntDivision()</CODE></A>
  85 <DD> Divides an arbitrary precision integer by an integer.
  86
  87 <DT> <A HREF="cuddAllDet.html#Cudd_ApaNumberOfDigits" TARGET="MAIN"><CODE>Cudd_ApaNumberOfDigits()</CODE></A>
  88 <DD> Finds the number of digits for an arbitrary precision
  89   integer.
  90
  91 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPowerOfTwo" TARGET="MAIN"><CODE>Cudd_ApaPowerOfTwo()</CODE></A>
  92 <DD> Sets an arbitrary precision integer to a power of two.
  93
  94 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPrintDecimal" TARGET="MAIN"><CODE>Cudd_ApaPrintDecimal()</CODE></A>
  95 <DD> Prints an arbitrary precision integer in decimal format.
  96
  97 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPrintDensity" TARGET="MAIN"><CODE>Cudd_ApaPrintDensity()</CODE></A>
  98 <DD> Prints the density of a BDD or ADD using
  99   arbitrary precision arithmetic.
 100
 101 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPrintExponential" TARGET="MAIN"><CODE>Cudd_ApaPrintExponential()</CODE></A>
 102 <DD> Prints an arbitrary precision integer in exponential format.
 103
 104 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPrintHex" TARGET="MAIN"><CODE>Cudd_ApaPrintHex()</CODE></A>
 105 <DD> Prints an arbitrary precision integer in hexadecimal format.
 106
 107 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPrintMintermExp" TARGET="MAIN"><CODE>Cudd_ApaPrintMintermExp()</CODE></A>
 108 <DD> Prints the number of minterms of a BDD or ADD in exponential
 109   format using arbitrary precision arithmetic.
 110
 111 <DT> <A HREF="cuddAllDet.html#Cudd_ApaPrintMinterm" TARGET="MAIN"><CODE>Cudd_ApaPrintMinterm()</CODE></A>
 112 <DD> Prints the number of minterms of a BDD or ADD using
 113   arbitrary precision arithmetic.
 114
 115 <DT> <A HREF="cuddAllDet.html#Cudd_ApaSetToLiteral" TARGET="MAIN"><CODE>Cudd_ApaSetToLiteral()</CODE></A>
 116 <DD> Sets an arbitrary precision integer to a one-digit literal.
 117
 118 <DT> <A HREF="cuddAllDet.html#Cudd_ApaShiftRight" TARGET="MAIN"><CODE>Cudd_ApaShiftRight()</CODE></A>
 119 <DD> Shifts right an arbitrary precision integer by one binary
 120   place.
 121
 122 <DT> <A HREF="cuddAllDet.html#Cudd_ApaShortDivision" TARGET="MAIN"><CODE>Cudd_ApaShortDivision()</CODE></A>
 123 <DD> Divides an arbitrary precision integer by a digit.
 124
 125 <DT> <A HREF="cuddAllDet.html#Cudd_ApaSubtract" TARGET="MAIN"><CODE>Cudd_ApaSubtract()</CODE></A>
 126 <DD> Subtracts two arbitrary precision integers.
 127
 128 <DT> <A HREF="cuddAllDet.html#Cudd_AutodynDisableZdd" TARGET="MAIN"><CODE>Cudd_AutodynDisableZdd()</CODE></A>
 129 <DD> Disables automatic dynamic reordering of ZDDs.
 130
 131 <DT> <A HREF="cuddAllDet.html#Cudd_AutodynDisable" TARGET="MAIN"><CODE>Cudd_AutodynDisable()</CODE></A>
 132 <DD> Disables automatic dynamic reordering.
 133
 134 <DT> <A HREF="cuddAllDet.html#Cudd_AutodynEnableZdd" TARGET="MAIN"><CODE>Cudd_AutodynEnableZdd()</CODE></A>
 135 <DD> Enables automatic dynamic reordering of ZDDs.
 136
 137 <DT> <A HREF="cuddAllDet.html#Cudd_AutodynEnable" TARGET="MAIN"><CODE>Cudd_AutodynEnable()</CODE></A>
 138 <DD> Enables automatic dynamic reordering of BDDs and ADDs.
 139
 140 <DT> <A HREF="cuddAllDet.html#Cudd_AverageDistance" TARGET="MAIN"><CODE>Cudd_AverageDistance()</CODE></A>
 141 <DD> Computes the average distance between adjacent nodes.
 142
 143 <DT> <A HREF="cuddAllDet.html#Cudd_BddToAdd" TARGET="MAIN"><CODE>Cudd_BddToAdd()</CODE></A>
 144 <DD> Converts a BDD to a 0-1 ADD.
 145
 146 <DT> <A HREF="cuddAllDet.html#Cudd_BddToCubeArray" TARGET="MAIN"><CODE>Cudd_BddToCubeArray()</CODE></A>
 147 <DD> Builds a positional array from the BDD of a cube.
 148
 149 <DT> <A HREF="cuddAllDet.html#Cudd_BiasedOverApprox" TARGET="MAIN"><CODE>Cudd_BiasedOverApprox()</CODE></A>
 150 <DD> Extracts a dense superset from a BDD with the biased
 151   underapproximation method.
 152
 153 <DT> <A HREF="cuddAllDet.html#Cudd_BiasedUnderApprox" TARGET="MAIN"><CODE>Cudd_BiasedUnderApprox()</CODE></A>
 154 <DD> Extracts a dense subset from a BDD with the biased
 155   underapproximation method.
 156
 157 <DT> <A HREF="cuddAllDet.html#Cudd_CProjection" TARGET="MAIN"><CODE>Cudd_CProjection()</CODE></A>
 158 <DD> Computes the compatible projection of R w.r.t. cube Y.
 159
 160 <DT> <A HREF="cuddAllDet.html#Cudd_CheckKeys" TARGET="MAIN"><CODE>Cudd_CheckKeys()</CODE></A>
 161 <DD> Checks for several conditions that should not occur.
 162
 163 <DT> <A HREF="cuddAllDet.html#Cudd_CheckZeroRef" TARGET="MAIN"><CODE>Cudd_CheckZeroRef()</CODE></A>
 164 <DD> Checks the unique table for nodes with non-zero reference
 165   counts.
 166
 167 <DT> <A HREF="cuddAllDet.html#Cudd_ClassifySupport" TARGET="MAIN"><CODE>Cudd_ClassifySupport()</CODE></A>
 168 <DD> Classifies the variables in the support of two DDs.
 169
 170 <DT> <A HREF="cuddAllDet.html#Cudd_ClearErrorCode" TARGET="MAIN"><CODE>Cudd_ClearErrorCode()</CODE></A>
 171 <DD> Clear the error code of a manager.
 172
 173 <DT> <A HREF="cuddAllDet.html#Cudd_CofMinterm" TARGET="MAIN"><CODE>Cudd_CofMinterm()</CODE></A>
 174 <DD> Computes the fraction of minterms in the on-set of all the
 175   positive cofactors of a BDD or ADD.
 176
 177 <DT> <A HREF="cuddAllDet.html#Cudd_Cofactor" TARGET="MAIN"><CODE>Cudd_Cofactor()</CODE></A>
 178 <DD> Computes the cofactor of f with respect to g.
 179
 180 <DT> <A HREF="cuddAllDet.html#Cudd_CountLeaves" TARGET="MAIN"><CODE>Cudd_CountLeaves()</CODE></A>
 181 <DD> Counts the number of leaves in a DD.
 182
 183 <DT> <A HREF="cuddAllDet.html#Cudd_CountMinterm" TARGET="MAIN"><CODE>Cudd_CountMinterm()</CODE></A>
 184 <DD> Counts the number of minterms of a DD.
 185
 186 <DT> <A HREF="cuddAllDet.html#Cudd_CountPathsToNonZero" TARGET="MAIN"><CODE>Cudd_CountPathsToNonZero()</CODE></A>
 187 <DD> Counts the number of paths to a non-zero terminal of a DD.
 188
 189 <DT> <A HREF="cuddAllDet.html#Cudd_CountPath" TARGET="MAIN"><CODE>Cudd_CountPath()</CODE></A>
 190 <DD> Counts the number of paths of a DD.
 191
 192 <DT> <A HREF="cuddAllDet.html#Cudd_CubeArrayToBdd" TARGET="MAIN"><CODE>Cudd_CubeArrayToBdd()</CODE></A>
 193 <DD> Builds the BDD of a cube from a positional array.
 194
 195 <DT> <A HREF="cuddAllDet.html#Cudd_DagSize" TARGET="MAIN"><CODE>Cudd_DagSize()</CODE></A>
 196 <DD> Counts the number of nodes in a DD.
 197
 198 <DT> <A HREF="cuddAllDet.html#Cudd_DeadAreCounted" TARGET="MAIN"><CODE>Cudd_DeadAreCounted()</CODE></A>
 199 <DD> Tells whether dead nodes are counted towards triggering
 200   reordering.
 201
 202 <DT> <A HREF="cuddAllDet.html#Cudd_DebugCheck" TARGET="MAIN"><CODE>Cudd_DebugCheck()</CODE></A>
 203 <DD> Checks for inconsistencies in the DD heap.
 204
 205 <DT> <A HREF="cuddAllDet.html#Cudd_Decreasing" TARGET="MAIN"><CODE>Cudd_Decreasing()</CODE></A>
 206 <DD> Determines whether a BDD is negative unate in a
 207   variable.
 208
 209 <DT> <A HREF="cuddAllDet.html#Cudd_DelayedDerefBdd" TARGET="MAIN"><CODE>Cudd_DelayedDerefBdd()</CODE></A>
 210 <DD> Decreases the reference count of BDD node n.
 211
 212 <DT> <A HREF="cuddAllDet.html#Cudd_Density" TARGET="MAIN"><CODE>Cudd_Density()</CODE></A>
 213 <DD> Computes the density of a BDD or ADD.
 214
 215 <DT> <A HREF="cuddAllDet.html#Cudd_Deref" TARGET="MAIN"><CODE>Cudd_Deref()</CODE></A>
 216 <DD> Decreases the reference count of node.
 217
 218 <DT> <A HREF="cuddAllDet.html#Cudd_DisableGarbageCollection" TARGET="MAIN"><CODE>Cudd_DisableGarbageCollection()</CODE></A>
 219 <DD> Disables garbage collection.
 220
 221 <DT> <A HREF="cuddAllDet.html#Cudd_DisableReorderingReporting" TARGET="MAIN"><CODE>Cudd_DisableReorderingReporting()</CODE></A>
 222 <DD> Disables reporting of reordering stats.
 223
 224 <DT> <A HREF="cuddAllDet.html#Cudd_Disequality" TARGET="MAIN"><CODE>Cudd_Disequality()</CODE></A>
 225 <DD> Generates a BDD for the function x - y != c.
 226
 227 <DT> <A HREF="cuddAllDet.html#Cudd_DumpBlifBody" TARGET="MAIN"><CODE>Cudd_DumpBlifBody()</CODE></A>
 228 <DD> Writes a blif body representing the argument BDDs.
 229
 230 <DT> <A HREF="cuddAllDet.html#Cudd_DumpBlif" TARGET="MAIN"><CODE>Cudd_DumpBlif()</CODE></A>
 231 <DD> Writes a blif file representing the argument BDDs.
 232
 233 <DT> <A HREF="cuddAllDet.html#Cudd_DumpDDcal" TARGET="MAIN"><CODE>Cudd_DumpDDcal()</CODE></A>
 234 <DD> Writes a DDcal file representing the argument BDDs.
 235
 236 <DT> <A HREF="cuddAllDet.html#Cudd_DumpDaVinci" TARGET="MAIN"><CODE>Cudd_DumpDaVinci()</CODE></A>
 237 <DD> Writes a daVinci file representing the argument BDDs.
 238
 239 <DT> <A HREF="cuddAllDet.html#Cudd_DumpDot" TARGET="MAIN"><CODE>Cudd_DumpDot()</CODE></A>
 240 <DD> Writes a dot file representing the argument DDs.
 241
 242 <DT> <A HREF="cuddAllDet.html#Cudd_DumpFactoredForm" TARGET="MAIN"><CODE>Cudd_DumpFactoredForm()</CODE></A>
 243 <DD> Writes factored forms representing the argument BDDs.
 244
 245 <DT> <A HREF="cuddAllDet.html#Cudd_Dxygtdxz" TARGET="MAIN"><CODE>Cudd_Dxygtdxz()</CODE></A>
 246 <DD> Generates a BDD for the function d(x,y) &gt; d(x,z).
 247
 248 <DT> <A HREF="cuddAllDet.html#Cudd_Dxygtdyz" TARGET="MAIN"><CODE>Cudd_Dxygtdyz()</CODE></A>
 249 <DD> Generates a BDD for the function d(x,y) &gt; d(y,z).
 250
 251 <DT> <A HREF="cuddAllDet.html#Cudd_EnableGarbageCollection" TARGET="MAIN"><CODE>Cudd_EnableGarbageCollection()</CODE></A>
 252 <DD> Enables garbage collection.
 253
 254 <DT> <A HREF="cuddAllDet.html#Cudd_EnableReorderingReporting" TARGET="MAIN"><CODE>Cudd_EnableReorderingReporting()</CODE></A>
 255 <DD> Enables reporting of reordering stats.
 256
 257 <DT> <A HREF="cuddAllDet.html#Cudd_EpdCountMinterm" TARGET="MAIN"><CODE>Cudd_EpdCountMinterm()</CODE></A>
 258 <DD> Counts the number of minterms of a DD with extended precision.
 259
 260 <DT> <A HREF="cuddAllDet.html#Cudd_EqualSupNorm" TARGET="MAIN"><CODE>Cudd_EqualSupNorm()</CODE></A>
 261 <DD> Compares two ADDs for equality within tolerance.
 262
 263 <DT> <A HREF="cuddAllDet.html#Cudd_EquivDC" TARGET="MAIN"><CODE>Cudd_EquivDC()</CODE></A>
 264 <DD> Tells whether F and G are identical wherever D is 0.
 265
 266 <DT> <A HREF="cuddAllDet.html#Cudd_EstimateCofactorSimple" TARGET="MAIN"><CODE>Cudd_EstimateCofactorSimple()</CODE></A>
 267 <DD> Estimates the number of nodes in a cofactor of a DD.
 268
 269 <DT> <A HREF="cuddAllDet.html#Cudd_EstimateCofactor" TARGET="MAIN"><CODE>Cudd_EstimateCofactor()</CODE></A>
 270 <DD> Estimates the number of nodes in a cofactor of a DD.
 271
 272 <DT> <A HREF="cuddAllDet.html#Cudd_Eval" TARGET="MAIN"><CODE>Cudd_Eval()</CODE></A>
 273 <DD> Returns the value of a DD for a given variable assignment.
 274
 275 <DT> <A HREF="cuddAllDet.html#Cudd_ExpectedUsedSlots" TARGET="MAIN"><CODE>Cudd_ExpectedUsedSlots()</CODE></A>
 276 <DD> Computes the expected fraction of used slots in the unique
 277   table.
 278
 279 <DT> <A HREF="cuddAllDet.html#Cudd_FindEssential" TARGET="MAIN"><CODE>Cudd_FindEssential()</CODE></A>
 280 <DD> Finds the essential variables of a DD.
 281
 282 <DT> <A HREF="cuddAllDet.html#Cudd_FindTwoLiteralClauses" TARGET="MAIN"><CODE>Cudd_FindTwoLiteralClauses()</CODE></A>
 283 <DD> Finds the two literal clauses of a DD.
 284
 285 <DT> <A HREF="cuddAllDet.html#Cudd_FirstCube" TARGET="MAIN"><CODE>Cudd_FirstCube()</CODE></A>
 286 <DD> Finds the first cube of a decision diagram.
 287
 288 <DT> <A HREF="cuddAllDet.html#Cudd_FirstNode" TARGET="MAIN"><CODE>Cudd_FirstNode()</CODE></A>
 289 <DD> Finds the first node of a decision diagram.
 290
 291 <DT> <A HREF="cuddAllDet.html#Cudd_FirstPrime" TARGET="MAIN"><CODE>Cudd_FirstPrime()</CODE></A>
 292 <DD> Finds the first prime of a Boolean function.
 293
 294 <DT> <A HREF="cuddAllDet.html#Cudd_FreeTree" TARGET="MAIN"><CODE>Cudd_FreeTree()</CODE></A>
 295 <DD> Frees the variable group tree of the manager.
 296
 297 <DT> <A HREF="cuddAllDet.html#Cudd_FreeZddTree" TARGET="MAIN"><CODE>Cudd_FreeZddTree()</CODE></A>
 298 <DD> Frees the variable group tree of the manager.
 299
 300 <DT> <A HREF="cuddAllDet.html#Cudd_GarbageCollectionEnabled" TARGET="MAIN"><CODE>Cudd_GarbageCollectionEnabled()</CODE></A>
 301 <DD> Tells whether garbage collection is enabled.
 302
 303 <DT> <A HREF="cuddAllDet.html#Cudd_GenFree" TARGET="MAIN"><CODE>Cudd_GenFree()</CODE></A>
 304 <DD> Frees a CUDD generator.
 305
 306 <DT> <A HREF="cuddAllDet.html#Cudd_Increasing" TARGET="MAIN"><CODE>Cudd_Increasing()</CODE></A>
 307 <DD> Determines whether a BDD is positive unate in a
 308   variable.
 309
 310 <DT> <A HREF="cuddAllDet.html#Cudd_IndicesToCube" TARGET="MAIN"><CODE>Cudd_IndicesToCube()</CODE></A>
 311 <DD> Builds a cube of BDD variables from an array of indices.
 312
 313 <DT> <A HREF="cuddAllDet.html#Cudd_Inequality" TARGET="MAIN"><CODE>Cudd_Inequality()</CODE></A>
 314 <DD> Generates a BDD for the function x - y &ge; c.
 315
 316 <DT> <A HREF="cuddAllDet.html#Cudd_Init" TARGET="MAIN"><CODE>Cudd_Init()</CODE></A>
 317 <DD> Creates a new DD manager.
 318
 319 <DT> <A HREF="cuddAllDet.html#Cudd_IsGenEmpty" TARGET="MAIN"><CODE>Cudd_IsGenEmpty()</CODE></A>
 320 <DD> Queries the status of a generator.
 321
 322 <DT> <A HREF="cuddAllDet.html#Cudd_IsInHook" TARGET="MAIN"><CODE>Cudd_IsInHook()</CODE></A>
 323 <DD> Checks whether a function is in a hook.
 324
 325 <DT> <A HREF="cuddAllDet.html#Cudd_IsNonConstant" TARGET="MAIN"><CODE>Cudd_IsNonConstant()</CODE></A>
 326 <DD> Returns 1 if a DD node is not constant.
 327
 328 <DT> <A HREF="cuddAllDet.html#Cudd_IterDerefBdd" TARGET="MAIN"><CODE>Cudd_IterDerefBdd()</CODE></A>
 329 <DD> Decreases the reference count of BDD node n.
 330
 331 <DT> <A HREF="cuddAllDet.html#Cudd_LargestCube" TARGET="MAIN"><CODE>Cudd_LargestCube()</CODE></A>
 332 <DD> Finds a largest cube in a DD.
 333
 334 <DT> <A HREF="cuddAllDet.html#Cudd_MakeBddFromZddCover" TARGET="MAIN"><CODE>Cudd_MakeBddFromZddCover()</CODE></A>
 335 <DD> Converts a ZDD cover to a BDD graph.
 336
 337 <DT> <A HREF="cuddAllDet.html#Cudd_MakeTreeNode" TARGET="MAIN"><CODE>Cudd_MakeTreeNode()</CODE></A>
 338 <DD> Creates a new variable group.
 339
 340 <DT> <A HREF="cuddAllDet.html#Cudd_MakeZddTreeNode" TARGET="MAIN"><CODE>Cudd_MakeZddTreeNode()</CODE></A>
 341 <DD> Creates a new ZDD variable group.
 342
 343 <DT> <A HREF="cuddAllDet.html#Cudd_MinHammingDist" TARGET="MAIN"><CODE>Cudd_MinHammingDist()</CODE></A>
 344 <DD> Returns the minimum Hamming distance between f and minterm.
 345
 346 <DT> <A HREF="cuddAllDet.html#Cudd_NewApaNumber" TARGET="MAIN"><CODE>Cudd_NewApaNumber()</CODE></A>
 347 <DD> Allocates memory for an arbitrary precision integer.
 348
 349 <DT> <A HREF="cuddAllDet.html#Cudd_NextCube" TARGET="MAIN"><CODE>Cudd_NextCube()</CODE></A>
 350 <DD> Generates the next cube of a decision diagram onset.
 351
 352 <DT> <A HREF="cuddAllDet.html#Cudd_NextNode" TARGET="MAIN"><CODE>Cudd_NextNode()</CODE></A>
 353 <DD> Finds the next node of a decision diagram.
 354
 355 <DT> <A HREF="cuddAllDet.html#Cudd_NextPrime" TARGET="MAIN"><CODE>Cudd_NextPrime()</CODE></A>
 356 <DD> Generates the next prime of a Boolean function.
 357
 358 <DT> <A HREF="cuddAllDet.html#Cudd_NodeReadIndex" TARGET="MAIN"><CODE>Cudd_NodeReadIndex()</CODE></A>
 359 <DD> Returns the index of the node.
 360
 361 <DT> <A HREF="cuddAllDet.html#Cudd_OutOfMem" TARGET="MAIN"><CODE>Cudd_OutOfMem()</CODE></A>
 362 <DD> Warns that a memory allocation failed.
 363
 364 <DT> <A HREF="cuddAllDet.html#Cudd_OverApprox" TARGET="MAIN"><CODE>Cudd_OverApprox()</CODE></A>
 365 <DD> Extracts a dense superset from a BDD with Shiple's
 366   underapproximation method.
 367
 368 <DT> <A HREF="cuddAllDet.html#Cudd_Prime" TARGET="MAIN"><CODE>Cudd_Prime()</CODE></A>
 369 <DD> Returns the next prime &gt;= p.
 370
 371 <DT> <A HREF="cuddAllDet.html#Cudd_PrintDebug" TARGET="MAIN"><CODE>Cudd_PrintDebug()</CODE></A>
 372 <DD> Prints to the standard output a DD and its statistics.
 373
 374 <DT> <A HREF="cuddAllDet.html#Cudd_PrintInfo" TARGET="MAIN"><CODE>Cudd_PrintInfo()</CODE></A>
 375 <DD> Prints out statistics and settings for a CUDD manager.
 376
 377 <DT> <A HREF="cuddAllDet.html#Cudd_PrintLinear" TARGET="MAIN"><CODE>Cudd_PrintLinear()</CODE></A>
 378 <DD> Prints the linear transform matrix.
 379
 380 <DT> <A HREF="cuddAllDet.html#Cudd_PrintMinterm" TARGET="MAIN"><CODE>Cudd_PrintMinterm()</CODE></A>
 381 <DD> Prints a disjoint sum of products.
 382
 383 <DT> <A HREF="cuddAllDet.html#Cudd_PrintTwoLiteralClauses" TARGET="MAIN"><CODE>Cudd_PrintTwoLiteralClauses()</CODE></A>
 384 <DD> Prints the two literal clauses of a DD.
 385
 386 <DT> <A HREF="cuddAllDet.html#Cudd_PrintVersion" TARGET="MAIN"><CODE>Cudd_PrintVersion()</CODE></A>
 387 <DD> Prints the package version number.
 388
 389 <DT> <A HREF="cuddAllDet.html#Cudd_PrioritySelect" TARGET="MAIN"><CODE>Cudd_PrioritySelect()</CODE></A>
 390 <DD> Selects pairs from R using a priority function.
 391
 392 <DT> <A HREF="cuddAllDet.html#Cudd_Quit" TARGET="MAIN"><CODE>Cudd_Quit()</CODE></A>
 393 <DD> Deletes resources associated with a DD manager.
 394
 395 <DT> <A HREF="cuddAllDet.html#Cudd_Random" TARGET="MAIN"><CODE>Cudd_Random()</CODE></A>
 396 <DD> Portable random number generator.
 397
 398 <DT> <A HREF="cuddAllDet.html#Cudd_ReadArcviolation" TARGET="MAIN"><CODE>Cudd_ReadArcviolation()</CODE></A>
 399 <DD> Returns the current value of the arcviolation parameter used
 400   in group sifting.
 401
 402 <DT> <A HREF="cuddAllDet.html#Cudd_ReadBackground" TARGET="MAIN"><CODE>Cudd_ReadBackground()</CODE></A>
 403 <DD> Reads the background constant of the manager.
 404
 405 <DT> <A HREF="cuddAllDet.html#Cudd_ReadCacheHits" TARGET="MAIN"><CODE>Cudd_ReadCacheHits()</CODE></A>
 406 <DD> Returns the number of cache hits.
 407
 408 <DT> <A HREF="cuddAllDet.html#Cudd_ReadCacheLookUps" TARGET="MAIN"><CODE>Cudd_ReadCacheLookUps()</CODE></A>
 409 <DD> Returns the number of cache look-ups.
 410
 411 <DT> <A HREF="cuddAllDet.html#Cudd_ReadCacheSlots" TARGET="MAIN"><CODE>Cudd_ReadCacheSlots()</CODE></A>
 412 <DD> Reads the number of slots in the cache.
 413
 414 <DT> <A HREF="cuddAllDet.html#Cudd_ReadCacheUsedSlots" TARGET="MAIN"><CODE>Cudd_ReadCacheUsedSlots()</CODE></A>
 415 <DD> Reads the fraction of used slots in the cache.
 416
 417 <DT> <A HREF="cuddAllDet.html#Cudd_ReadDead" TARGET="MAIN"><CODE>Cudd_ReadDead()</CODE></A>
 418 <DD> Returns the number of dead nodes in the unique table.
 419
 420 <DT> <A HREF="cuddAllDet.html#Cudd_ReadEpsilon" TARGET="MAIN"><CODE>Cudd_ReadEpsilon()</CODE></A>
 421 <DD> Reads the epsilon parameter of the manager.
 422
 423 <DT> <A HREF="cuddAllDet.html#Cudd_ReadErrorCode" TARGET="MAIN"><CODE>Cudd_ReadErrorCode()</CODE></A>
 424 <DD> Returns the code of the last error.
 425
 426 <DT> <A HREF="cuddAllDet.html#Cudd_ReadGarbageCollectionTime" TARGET="MAIN"><CODE>Cudd_ReadGarbageCollectionTime()</CODE></A>
 427 <DD> Returns the time spent in garbage collection.
 428
 429 <DT> <A HREF="cuddAllDet.html#Cudd_ReadGarbageCollections" TARGET="MAIN"><CODE>Cudd_ReadGarbageCollections()</CODE></A>
 430 <DD> Returns the number of times garbage collection has occurred.
 431
 432 <DT> <A HREF="cuddAllDet.html#Cudd_ReadGroupcheck" TARGET="MAIN"><CODE>Cudd_ReadGroupcheck()</CODE></A>
 433 <DD> Reads the groupcheck parameter of the manager.
 434
 435 <DT> <A HREF="cuddAllDet.html#Cudd_ReadInvPermZdd" TARGET="MAIN"><CODE>Cudd_ReadInvPermZdd()</CODE></A>
 436 <DD> Returns the index of the ZDD variable currently in the i-th
 437   position of the order.
 438
 439 <DT> <A HREF="cuddAllDet.html#Cudd_ReadInvPerm" TARGET="MAIN"><CODE>Cudd_ReadInvPerm()</CODE></A>
 440 <DD> Returns the index of the variable currently in the i-th
 441   position of the order.
 442
 443 <DT> <A HREF="cuddAllDet.html#Cudd_ReadIthClause" TARGET="MAIN"><CODE>Cudd_ReadIthClause()</CODE></A>
 444 <DD> Accesses the i-th clause of a DD.
 445
 446 <DT> <A HREF="cuddAllDet.html#Cudd_ReadKeys" TARGET="MAIN"><CODE>Cudd_ReadKeys()</CODE></A>
 447 <DD> Returns the number of nodes in the unique table.
 448
 449 <DT> <A HREF="cuddAllDet.html#Cudd_ReadLinear" TARGET="MAIN"><CODE>Cudd_ReadLinear()</CODE></A>
 450 <DD> Reads an entry of the linear transform matrix.
 451
 452 <DT> <A HREF="cuddAllDet.html#Cudd_ReadLogicZero" TARGET="MAIN"><CODE>Cudd_ReadLogicZero()</CODE></A>
 453 <DD> Returns the logic zero constant of the manager.
 454
 455 <DT> <A HREF="cuddAllDet.html#Cudd_ReadLooseUpTo" TARGET="MAIN"><CODE>Cudd_ReadLooseUpTo()</CODE></A>
 456 <DD> Reads the looseUpTo parameter of the manager.
 457
 458 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMaxCacheHard" TARGET="MAIN"><CODE>Cudd_ReadMaxCacheHard()</CODE></A>
 459 <DD> Reads the maxCacheHard parameter of the manager.
 460
 461 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMaxCache" TARGET="MAIN"><CODE>Cudd_ReadMaxCache()</CODE></A>
 462 <DD> Returns the soft limit for the cache size.
 463
 464 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMaxGrowthAlternate" TARGET="MAIN"><CODE>Cudd_ReadMaxGrowthAlternate()</CODE></A>
 465 <DD> Reads the maxGrowthAlt parameter of the manager.
 466
 467 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMaxGrowth" TARGET="MAIN"><CODE>Cudd_ReadMaxGrowth()</CODE></A>
 468 <DD> Reads the maxGrowth parameter of the manager.
 469
 470 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMaxLive" TARGET="MAIN"><CODE>Cudd_ReadMaxLive()</CODE></A>
 471 <DD> Reads the maximum allowed number of live nodes.
 472
 473 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMaxMemory" TARGET="MAIN"><CODE>Cudd_ReadMaxMemory()</CODE></A>
 474 <DD> Reads the maximum allowed memory.
 475
 476 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMemoryInUse" TARGET="MAIN"><CODE>Cudd_ReadMemoryInUse()</CODE></A>
 477 <DD> Returns the memory in use by the manager measured in bytes.
 478
 479 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMinDead" TARGET="MAIN"><CODE>Cudd_ReadMinDead()</CODE></A>
 480 <DD> Reads the minDead parameter of the manager.
 481
 482 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMinHit" TARGET="MAIN"><CODE>Cudd_ReadMinHit()</CODE></A>
 483 <DD> Reads the hit rate that causes resizinig of the computed
 484   table.
 485
 486 <DT> <A HREF="cuddAllDet.html#Cudd_ReadMinusInfinity" TARGET="MAIN"><CODE>Cudd_ReadMinusInfinity()</CODE></A>
 487 <DD> Reads the minus-infinity constant from the manager.
 488
 489 <DT> <A HREF="cuddAllDet.html#Cudd_ReadNextReordering" TARGET="MAIN"><CODE>Cudd_ReadNextReordering()</CODE></A>
 490 <DD> Returns the threshold for the next dynamic reordering.
 491
 492 <DT> <A HREF="cuddAllDet.html#Cudd_ReadNodeCount" TARGET="MAIN"><CODE>Cudd_ReadNodeCount()</CODE></A>
 493 <DD> Reports the number of nodes in BDDs and ADDs.
 494
 495 <DT> <A HREF="cuddAllDet.html#Cudd_ReadNodesDropped" TARGET="MAIN"><CODE>Cudd_ReadNodesDropped()</CODE></A>
 496 <DD> Returns the number of nodes dropped.
 497
 498 <DT> <A HREF="cuddAllDet.html#Cudd_ReadNodesFreed" TARGET="MAIN"><CODE>Cudd_ReadNodesFreed()</CODE></A>
 499 <DD> Returns the number of nodes freed.
 500
 501 <DT> <A HREF="cuddAllDet.html#Cudd_ReadNumberXovers" TARGET="MAIN"><CODE>Cudd_ReadNumberXovers()</CODE></A>
 502 <DD> Reads the current number of crossovers used by the
 503   genetic algorithm for reordering.
 504
 505 <DT> <A HREF="cuddAllDet.html#Cudd_ReadOne" TARGET="MAIN"><CODE>Cudd_ReadOne()</CODE></A>
 506 <DD> Returns the one constant of the manager.
 507
 508 <DT> <A HREF="cuddAllDet.html#Cudd_ReadPeakLiveNodeCount" TARGET="MAIN"><CODE>Cudd_ReadPeakLiveNodeCount()</CODE></A>
 509 <DD> Reports the peak number of live nodes.
 510
 511 <DT> <A HREF="cuddAllDet.html#Cudd_ReadPeakNodeCount" TARGET="MAIN"><CODE>Cudd_ReadPeakNodeCount()</CODE></A>
 512 <DD> Reports the peak number of nodes.
 513
 514 <DT> <A HREF="cuddAllDet.html#Cudd_ReadPermZdd" TARGET="MAIN"><CODE>Cudd_ReadPermZdd()</CODE></A>
 515 <DD> Returns the current position of the i-th ZDD variable in the
 516   order.
 517
 518 <DT> <A HREF="cuddAllDet.html#Cudd_ReadPerm" TARGET="MAIN"><CODE>Cudd_ReadPerm()</CODE></A>
 519 <DD> Returns the current position of the i-th variable in the
 520   order.
 521
 522 <DT> <A HREF="cuddAllDet.html#Cudd_ReadPlusInfinity" TARGET="MAIN"><CODE>Cudd_ReadPlusInfinity()</CODE></A>
 523 <DD> Reads the plus-infinity constant from the manager.
 524
 525 <DT> <A HREF="cuddAllDet.html#Cudd_ReadPopulationSize" TARGET="MAIN"><CODE>Cudd_ReadPopulationSize()</CODE></A>
 526 <DD> Reads the current size of the population used by the
 527   genetic algorithm for reordering.
 528
 529 <DT> <A HREF="cuddAllDet.html#Cudd_ReadRecomb" TARGET="MAIN"><CODE>Cudd_ReadRecomb()</CODE></A>
 530 <DD> Returns the current value of the recombination parameter used
 531   in group sifting.
 532
 533 <DT> <A HREF="cuddAllDet.html#Cudd_ReadRecursiveCalls" TARGET="MAIN"><CODE>Cudd_ReadRecursiveCalls()</CODE></A>
 534 <DD> Returns the number of recursive calls.
 535
 536 <DT> <A HREF="cuddAllDet.html#Cudd_ReadReorderingCycle" TARGET="MAIN"><CODE>Cudd_ReadReorderingCycle()</CODE></A>
 537 <DD> Reads the reordCycle parameter of the manager.
 538
 539 <DT> <A HREF="cuddAllDet.html#Cudd_ReadReorderingTime" TARGET="MAIN"><CODE>Cudd_ReadReorderingTime()</CODE></A>
 540 <DD> Returns the time spent in reordering.
 541
 542 <DT> <A HREF="cuddAllDet.html#Cudd_ReadReorderings" TARGET="MAIN"><CODE>Cudd_ReadReorderings()</CODE></A>
 543 <DD> Returns the number of times reordering has occurred.
 544
 545 <DT> <A HREF="cuddAllDet.html#Cudd_ReadSiftMaxSwap" TARGET="MAIN"><CODE>Cudd_ReadSiftMaxSwap()</CODE></A>
 546 <DD> Reads the siftMaxSwap parameter of the manager.
 547
 548 <DT> <A HREF="cuddAllDet.html#Cudd_ReadSiftMaxVar" TARGET="MAIN"><CODE>Cudd_ReadSiftMaxVar()</CODE></A>
 549 <DD> Reads the siftMaxVar parameter of the manager.
 550
 551 <DT> <A HREF="cuddAllDet.html#Cudd_ReadSize" TARGET="MAIN"><CODE>Cudd_ReadSize()</CODE></A>
 552 <DD> Returns the number of BDD variables in existance.
 553
 554 <DT> <A HREF="cuddAllDet.html#Cudd_ReadSlots" TARGET="MAIN"><CODE>Cudd_ReadSlots()</CODE></A>
 555 <DD> Returns the total number of slots of the unique table.
 556
 557 <DT> <A HREF="cuddAllDet.html#Cudd_ReadStderr" TARGET="MAIN"><CODE>Cudd_ReadStderr()</CODE></A>
 558 <DD> Reads the stderr of a manager.
 559
 560 <DT> <A HREF="cuddAllDet.html#Cudd_ReadStdout" TARGET="MAIN"><CODE>Cudd_ReadStdout()</CODE></A>
 561 <DD> Reads the stdout of a manager.
 562
 563 <DT> <A HREF="cuddAllDet.html#Cudd_ReadSwapSteps" TARGET="MAIN"><CODE>Cudd_ReadSwapSteps()</CODE></A>
 564 <DD> Reads the number of elementary reordering steps.
 565
 566 <DT> <A HREF="cuddAllDet.html#Cudd_ReadSymmviolation" TARGET="MAIN"><CODE>Cudd_ReadSymmviolation()</CODE></A>
 567 <DD> Returns the current value of the symmviolation parameter used
 568   in group sifting.
 569
 570 <DT> <A HREF="cuddAllDet.html#Cudd_ReadTree" TARGET="MAIN"><CODE>Cudd_ReadTree()</CODE></A>
 571 <DD> Returns the variable group tree of the manager.
 572
 573 <DT> <A HREF="cuddAllDet.html#Cudd_ReadUniqueLinks" TARGET="MAIN"><CODE>Cudd_ReadUniqueLinks()</CODE></A>
 574 <DD> Returns the number of links followed in the unique table.
 575
 576 <DT> <A HREF="cuddAllDet.html#Cudd_ReadUniqueLookUps" TARGET="MAIN"><CODE>Cudd_ReadUniqueLookUps()</CODE></A>
 577 <DD> Returns the number of look-ups in the unique table.
 578
 579 <DT> <A HREF="cuddAllDet.html#Cudd_ReadUsedSlots" TARGET="MAIN"><CODE>Cudd_ReadUsedSlots()</CODE></A>
 580 <DD> Reads the fraction of used slots in the unique table.
 581
 582 <DT> <A HREF="cuddAllDet.html#Cudd_ReadVars" TARGET="MAIN"><CODE>Cudd_ReadVars()</CODE></A>
 583 <DD> Returns the i-th element of the vars array.
 584
 585 <DT> <A HREF="cuddAllDet.html#Cudd_ReadZddOne" TARGET="MAIN"><CODE>Cudd_ReadZddOne()</CODE></A>
 586 <DD> Returns the ZDD for the constant 1 function.
 587
 588 <DT> <A HREF="cuddAllDet.html#Cudd_ReadZddSize" TARGET="MAIN"><CODE>Cudd_ReadZddSize()</CODE></A>
 589 <DD> Returns the number of ZDD variables in existance.
 590
 591 <DT> <A HREF="cuddAllDet.html#Cudd_ReadZddTree" TARGET="MAIN"><CODE>Cudd_ReadZddTree()</CODE></A>
 592 <DD> Returns the variable group tree of the manager.
 593
 594 <DT> <A HREF="cuddAllDet.html#Cudd_ReadZero" TARGET="MAIN"><CODE>Cudd_ReadZero()</CODE></A>
 595 <DD> Returns the zero constant of the manager.
 596
 597 <DT> <A HREF="cuddAllDet.html#Cudd_RecursiveDerefZdd" TARGET="MAIN"><CODE>Cudd_RecursiveDerefZdd()</CODE></A>
 598 <DD> Decreases the reference count of ZDD node n.
 599
 600 <DT> <A HREF="cuddAllDet.html#Cudd_RecursiveDeref" TARGET="MAIN"><CODE>Cudd_RecursiveDeref()</CODE></A>
 601 <DD> Decreases the reference count of node n.
 602
 603 <DT> <A HREF="cuddAllDet.html#Cudd_ReduceHeap" TARGET="MAIN"><CODE>Cudd_ReduceHeap()</CODE></A>
 604 <DD> Main dynamic reordering routine.
 605
 606 <DT> <A HREF="cuddAllDet.html#Cudd_Ref" TARGET="MAIN"><CODE>Cudd_Ref()</CODE></A>
 607 <DD> Increases the reference count of a node, if it is not
 608   saturated.
 609
 610 <DT> <A HREF="cuddAllDet.html#Cudd_RemapOverApprox" TARGET="MAIN"><CODE>Cudd_RemapOverApprox()</CODE></A>
 611 <DD> Extracts a dense superset from a BDD with the remapping
 612   underapproximation method.
 613
 614 <DT> <A HREF="cuddAllDet.html#Cudd_RemapUnderApprox" TARGET="MAIN"><CODE>Cudd_RemapUnderApprox()</CODE></A>
 615 <DD> Extracts a dense subset from a BDD with the remapping
 616   underapproximation method.
 617
 618 <DT> <A HREF="cuddAllDet.html#Cudd_RemoveHook" TARGET="MAIN"><CODE>Cudd_RemoveHook()</CODE></A>
 619 <DD> Removes a function from a hook.
 620
 621 <DT> <A HREF="cuddAllDet.html#Cudd_ReorderingReporting" TARGET="MAIN"><CODE>Cudd_ReorderingReporting()</CODE></A>
 622 <DD> Returns 1 if reporting of reordering stats is enabled.
 623
 624 <DT> <A HREF="cuddAllDet.html#Cudd_ReorderingStatusZdd" TARGET="MAIN"><CODE>Cudd_ReorderingStatusZdd()</CODE></A>
 625 <DD> Reports the status of automatic dynamic reordering of ZDDs.
 626
 627 <DT> <A HREF="cuddAllDet.html#Cudd_ReorderingStatus" TARGET="MAIN"><CODE>Cudd_ReorderingStatus()</CODE></A>
 628 <DD> Reports the status of automatic dynamic reordering of BDDs
 629   and ADDs.
 630
 631 <DT> <A HREF="cuddAllDet.html#Cudd_SetArcviolation" TARGET="MAIN"><CODE>Cudd_SetArcviolation()</CODE></A>
 632 <DD> Sets the value of the arcviolation parameter used
 633   in group sifting.
 634
 635 <DT> <A HREF="cuddAllDet.html#Cudd_SetBackground" TARGET="MAIN"><CODE>Cudd_SetBackground()</CODE></A>
 636 <DD> Sets the background constant of the manager.
 637
 638 <DT> <A HREF="cuddAllDet.html#Cudd_SetEpsilon" TARGET="MAIN"><CODE>Cudd_SetEpsilon()</CODE></A>
 639 <DD> Sets the epsilon parameter of the manager to ep.
 640
 641 <DT> <A HREF="cuddAllDet.html#Cudd_SetGroupcheck" TARGET="MAIN"><CODE>Cudd_SetGroupcheck()</CODE></A>
 642 <DD> Sets the parameter groupcheck of the manager to gc.
 643
 644 <DT> <A HREF="cuddAllDet.html#Cudd_SetLooseUpTo" TARGET="MAIN"><CODE>Cudd_SetLooseUpTo()</CODE></A>
 645 <DD> Sets the looseUpTo parameter of the manager.
 646
 647 <DT> <A HREF="cuddAllDet.html#Cudd_SetMaxCacheHard" TARGET="MAIN"><CODE>Cudd_SetMaxCacheHard()</CODE></A>
 648 <DD> Sets the maxCacheHard parameter of the manager.
 649
 650 <DT> <A HREF="cuddAllDet.html#Cudd_SetMaxGrowthAlternate" TARGET="MAIN"><CODE>Cudd_SetMaxGrowthAlternate()</CODE></A>
 651 <DD> Sets the maxGrowthAlt parameter of the manager.
 652
 653 <DT> <A HREF="cuddAllDet.html#Cudd_SetMaxGrowth" TARGET="MAIN"><CODE>Cudd_SetMaxGrowth()</CODE></A>
 654 <DD> Sets the maxGrowth parameter of the manager.
 655
 656 <DT> <A HREF="cuddAllDet.html#Cudd_SetMaxLive" TARGET="MAIN"><CODE>Cudd_SetMaxLive()</CODE></A>
 657 <DD> Sets the maximum allowed number of live nodes.
 658
 659 <DT> <A HREF="cuddAllDet.html#Cudd_SetMaxMemory" TARGET="MAIN"><CODE>Cudd_SetMaxMemory()</CODE></A>
 660 <DD> Sets the maximum allowed memory.
 661
 662 <DT> <A HREF="cuddAllDet.html#Cudd_SetMinHit" TARGET="MAIN"><CODE>Cudd_SetMinHit()</CODE></A>
 663 <DD> Sets the hit rate that causes resizinig of the computed
 664   table.
 665
 666 <DT> <A HREF="cuddAllDet.html#Cudd_SetNextReordering" TARGET="MAIN"><CODE>Cudd_SetNextReordering()</CODE></A>
 667 <DD> Sets the threshold for the next dynamic reordering.
 668
 669 <DT> <A HREF="cuddAllDet.html#Cudd_SetNumberXovers" TARGET="MAIN"><CODE>Cudd_SetNumberXovers()</CODE></A>
 670 <DD> Sets the number of crossovers used by the
 671   genetic algorithm for reordering.
 672
 673 <DT> <A HREF="cuddAllDet.html#Cudd_SetPopulationSize" TARGET="MAIN"><CODE>Cudd_SetPopulationSize()</CODE></A>
 674 <DD> Sets the size of the population used by the
 675   genetic algorithm for reordering.
 676
 677 <DT> <A HREF="cuddAllDet.html#Cudd_SetRecomb" TARGET="MAIN"><CODE>Cudd_SetRecomb()</CODE></A>
 678 <DD> Sets the value of the recombination parameter used in group
 679   sifting.
 680
 681 <DT> <A HREF="cuddAllDet.html#Cudd_SetReorderingCycle" TARGET="MAIN"><CODE>Cudd_SetReorderingCycle()</CODE></A>
 682 <DD> Sets the reordCycle parameter of the manager.
 683
 684 <DT> <A HREF="cuddAllDet.html#Cudd_SetSiftMaxSwap" TARGET="MAIN"><CODE>Cudd_SetSiftMaxSwap()</CODE></A>
 685 <DD> Sets the siftMaxSwap parameter of the manager.
 686
 687 <DT> <A HREF="cuddAllDet.html#Cudd_SetSiftMaxVar" TARGET="MAIN"><CODE>Cudd_SetSiftMaxVar()</CODE></A>
 688 <DD> Sets the siftMaxVar parameter of the manager.
 689
 690 <DT> <A HREF="cuddAllDet.html#Cudd_SetStderr" TARGET="MAIN"><CODE>Cudd_SetStderr()</CODE></A>
 691 <DD> Sets the stderr of a manager.
 692
 693 <DT> <A HREF="cuddAllDet.html#Cudd_SetStdout" TARGET="MAIN"><CODE>Cudd_SetStdout()</CODE></A>
 694 <DD> Sets the stdout of a manager.
 695
 696 <DT> <A HREF="cuddAllDet.html#Cudd_SetSymmviolation" TARGET="MAIN"><CODE>Cudd_SetSymmviolation()</CODE></A>
 697 <DD> Sets the value of the symmviolation parameter used
 698   in group sifting.
 699
 700 <DT> <A HREF="cuddAllDet.html#Cudd_SetTree" TARGET="MAIN"><CODE>Cudd_SetTree()</CODE></A>
 701 <DD> Sets the variable group tree of the manager.
 702
 703 <DT> <A HREF="cuddAllDet.html#Cudd_SetVarMap" TARGET="MAIN"><CODE>Cudd_SetVarMap()</CODE></A>
 704 <DD> Registers a variable mapping with the manager.
 705
 706 <DT> <A HREF="cuddAllDet.html#Cudd_SetZddTree" TARGET="MAIN"><CODE>Cudd_SetZddTree()</CODE></A>
 707 <DD> Sets the ZDD variable group tree of the manager.
 708
 709 <DT> <A HREF="cuddAllDet.html#Cudd_SharingSize" TARGET="MAIN"><CODE>Cudd_SharingSize()</CODE></A>
 710 <DD> Counts the number of nodes in an array of DDs.
 711
 712 <DT> <A HREF="cuddAllDet.html#Cudd_ShortestLength" TARGET="MAIN"><CODE>Cudd_ShortestLength()</CODE></A>
 713 <DD> Find the length of the shortest path(s) in a DD.
 714
 715 <DT> <A HREF="cuddAllDet.html#Cudd_ShortestPath" TARGET="MAIN"><CODE>Cudd_ShortestPath()</CODE></A>
 716 <DD> Finds a shortest path in a DD.
 717
 718 <DT> <A HREF="cuddAllDet.html#Cudd_ShuffleHeap" TARGET="MAIN"><CODE>Cudd_ShuffleHeap()</CODE></A>
 719 <DD> Reorders variables according to given permutation.
 720
 721 <DT> <A HREF="cuddAllDet.html#Cudd_SolveEqn" TARGET="MAIN"><CODE>Cudd_SolveEqn()</CODE></A>
 722 <DD> Implements the solution of F(x,y) = 0.
 723
 724 <DT> <A HREF="cuddAllDet.html#Cudd_SplitSet" TARGET="MAIN"><CODE>Cudd_SplitSet()</CODE></A>
 725 <DD> Returns m minterms from a BDD.
 726
 727 <DT> <A HREF="cuddAllDet.html#Cudd_Srandom" TARGET="MAIN"><CODE>Cudd_Srandom()</CODE></A>
 728 <DD> Initializer for the portable random number generator.
 729
 730 <DT> <A HREF="cuddAllDet.html#Cudd_StdPostReordHook" TARGET="MAIN"><CODE>Cudd_StdPostReordHook()</CODE></A>
 731 <DD> Sample hook function to call after reordering.
 732
 733 <DT> <A HREF="cuddAllDet.html#Cudd_StdPreReordHook" TARGET="MAIN"><CODE>Cudd_StdPreReordHook()</CODE></A>
 734 <DD> Sample hook function to call before reordering.
 735
 736 <DT> <A HREF="cuddAllDet.html#Cudd_SubsetCompress" TARGET="MAIN"><CODE>Cudd_SubsetCompress()</CODE></A>
 737 <DD> Find a dense subset of BDD <code>f</code>.
 738
 739 <DT> <A HREF="cuddAllDet.html#Cudd_SubsetHeavyBranch" TARGET="MAIN"><CODE>Cudd_SubsetHeavyBranch()</CODE></A>
 740 <DD> Extracts a dense subset from a BDD with the heavy branch
 741   heuristic.
 742
 743 <DT> <A HREF="cuddAllDet.html#Cudd_SubsetShortPaths" TARGET="MAIN"><CODE>Cudd_SubsetShortPaths()</CODE></A>
 744 <DD> Extracts a dense subset from a BDD with the shortest paths
 745   heuristic.
 746
 747 <DT> <A HREF="cuddAllDet.html#Cudd_SubsetWithMaskVars" TARGET="MAIN"><CODE>Cudd_SubsetWithMaskVars()</CODE></A>
 748 <DD> Extracts a subset from a BDD.
 749
 750 <DT> <A HREF="cuddAllDet.html#Cudd_SupersetCompress" TARGET="MAIN"><CODE>Cudd_SupersetCompress()</CODE></A>
 751 <DD> Find a dense superset of BDD <code>f</code>.
 752
 753 <DT> <A HREF="cuddAllDet.html#Cudd_SupersetHeavyBranch" TARGET="MAIN"><CODE>Cudd_SupersetHeavyBranch()</CODE></A>
 754 <DD> Extracts a dense superset from a BDD with the heavy branch
 755   heuristic.
 756
 757 <DT> <A HREF="cuddAllDet.html#Cudd_SupersetShortPaths" TARGET="MAIN"><CODE>Cudd_SupersetShortPaths()</CODE></A>
 758 <DD> Extracts a dense superset from a BDD with the shortest paths
 759   heuristic.
 760
 761 <DT> <A HREF="cuddAllDet.html#Cudd_SupportIndex" TARGET="MAIN"><CODE>Cudd_SupportIndex()</CODE></A>
 762 <DD> Finds the variables on which a DD depends.
 763
 764 <DT> <A HREF="cuddAllDet.html#Cudd_SupportSize" TARGET="MAIN"><CODE>Cudd_SupportSize()</CODE></A>
 765 <DD> Counts the variables on which a DD depends.
 766
 767 <DT> <A HREF="cuddAllDet.html#Cudd_Support" TARGET="MAIN"><CODE>Cudd_Support()</CODE></A>
 768 <DD> Finds the variables on which a DD depends.
 769
 770 <DT> <A HREF="cuddAllDet.html#Cudd_SymmProfile" TARGET="MAIN"><CODE>Cudd_SymmProfile()</CODE></A>
 771 <DD> Prints statistics on symmetric variables.
 772
 773 <DT> <A HREF="cuddAllDet.html#Cudd_TurnOffCountDead" TARGET="MAIN"><CODE>Cudd_TurnOffCountDead()</CODE></A>
 774 <DD> Causes the dead nodes not to be counted towards triggering
 775   reordering.
 776
 777 <DT> <A HREF="cuddAllDet.html#Cudd_TurnOnCountDead" TARGET="MAIN"><CODE>Cudd_TurnOnCountDead()</CODE></A>
 778 <DD> Causes the dead nodes to be counted towards triggering
 779   reordering.
 780
 781 <DT> <A HREF="cuddAllDet.html#Cudd_UnderApprox" TARGET="MAIN"><CODE>Cudd_UnderApprox()</CODE></A>
 782 <DD> Extracts a dense subset from a BDD with Shiple's
 783   underapproximation method.
 784
 785 <DT> <A HREF="cuddAllDet.html#Cudd_VectorSupportIndex" TARGET="MAIN"><CODE>Cudd_VectorSupportIndex()</CODE></A>
 786 <DD> Finds the variables on which a set of DDs depends.
 787
 788 <DT> <A HREF="cuddAllDet.html#Cudd_VectorSupportSize" TARGET="MAIN"><CODE>Cudd_VectorSupportSize()</CODE></A>
 789 <DD> Counts the variables on which a set of DDs depends.
 790
 791 <DT> <A HREF="cuddAllDet.html#Cudd_VectorSupport" TARGET="MAIN"><CODE>Cudd_VectorSupport()</CODE></A>
 792 <DD> Finds the variables on which a set of DDs depends.
 793
 794 <DT> <A HREF="cuddAllDet.html#Cudd_VerifySol" TARGET="MAIN"><CODE>Cudd_VerifySol()</CODE></A>
 795 <DD> Checks the solution of F(x,y) = 0.
 796
 797 <DT> <A HREF="cuddAllDet.html#Cudd_Xeqy" TARGET="MAIN"><CODE>Cudd_Xeqy()</CODE></A>
 798 <DD> Generates a BDD for the function x==y.
 799
 800 <DT> <A HREF="cuddAllDet.html#Cudd_Xgty" TARGET="MAIN"><CODE>Cudd_Xgty()</CODE></A>
 801 <DD> Generates a BDD for the function x &gt; y.
 802
 803 <DT> <A HREF="cuddAllDet.html#Cudd_addAgreement" TARGET="MAIN"><CODE>Cudd_addAgreement()</CODE></A>
 804 <DD> f if f==g; background if f!=g.
 805
 806 <DT> <A HREF="cuddAllDet.html#Cudd_addApply" TARGET="MAIN"><CODE>Cudd_addApply()</CODE></A>
 807 <DD> Applies op to the corresponding discriminants of f and g.
 808
 809 <DT> <A HREF="cuddAllDet.html#Cudd_addBddInterval" TARGET="MAIN"><CODE>Cudd_addBddInterval()</CODE></A>
 810 <DD> Converts an ADD to a BDD.
 811
 812 <DT> <A HREF="cuddAllDet.html#Cudd_addBddIthBit" TARGET="MAIN"><CODE>Cudd_addBddIthBit()</CODE></A>
 813 <DD> Converts an ADD to a BDD by extracting the i-th bit from
 814   the leaves.
 815
 816 <DT> <A HREF="cuddAllDet.html#Cudd_addBddPattern" TARGET="MAIN"><CODE>Cudd_addBddPattern()</CODE></A>
 817 <DD> Converts an ADD to a BDD.
 818
 819 <DT> <A HREF="cuddAllDet.html#Cudd_addBddStrictThreshold" TARGET="MAIN"><CODE>Cudd_addBddStrictThreshold()</CODE></A>
 820 <DD> Converts an ADD to a BDD.
 821
 822 <DT> <A HREF="cuddAllDet.html#Cudd_addBddThreshold" TARGET="MAIN"><CODE>Cudd_addBddThreshold()</CODE></A>
 823 <DD> Converts an ADD to a BDD.
 824
 825 <DT> <A HREF="cuddAllDet.html#Cudd_addCmpl" TARGET="MAIN"><CODE>Cudd_addCmpl()</CODE></A>
 826 <DD> Computes the complement of an ADD a la C language.
 827
 828 <DT> <A HREF="cuddAllDet.html#Cudd_addCompose" TARGET="MAIN"><CODE>Cudd_addCompose()</CODE></A>
 829 <DD> Substitutes g for x_v in the ADD for f.
 830
 831 <DT> <A HREF="cuddAllDet.html#Cudd_addComputeCube" TARGET="MAIN"><CODE>Cudd_addComputeCube()</CODE></A>
 832 <DD> Computes the cube of an array of ADD variables.
 833
 834 <DT> <A HREF="cuddAllDet.html#Cudd_addConstrain" TARGET="MAIN"><CODE>Cudd_addConstrain()</CODE></A>
 835 <DD> Computes f constrain c for ADDs.
 836
 837 <DT> <A HREF="cuddAllDet.html#Cudd_addConst" TARGET="MAIN"><CODE>Cudd_addConst()</CODE></A>
 838 <DD> Returns the ADD for constant c.
 839
 840 <DT> <A HREF="cuddAllDet.html#Cudd_addDiff" TARGET="MAIN"><CODE>Cudd_addDiff()</CODE></A>
 841 <DD> Returns plusinfinity if f=g; returns min(f,g) if f!=g.
 842
 843 <DT> <A HREF="cuddAllDet.html#Cudd_addDivide" TARGET="MAIN"><CODE>Cudd_addDivide()</CODE></A>
 844 <DD> Integer and floating point division.
 845
 846 <DT> <A HREF="cuddAllDet.html#Cudd_addEvalConst" TARGET="MAIN"><CODE>Cudd_addEvalConst()</CODE></A>
 847 <DD> Checks whether ADD g is constant whenever ADD f is 1.
 848
 849 <DT> <A HREF="cuddAllDet.html#Cudd_addExistAbstract" TARGET="MAIN"><CODE>Cudd_addExistAbstract()</CODE></A>
 850 <DD> Existentially Abstracts all the variables in cube from f.
 851
 852 <DT> <A HREF="cuddAllDet.html#Cudd_addFindMax" TARGET="MAIN"><CODE>Cudd_addFindMax()</CODE></A>
 853 <DD> Finds the maximum discriminant of f.
 854
 855 <DT> <A HREF="cuddAllDet.html#Cudd_addFindMin" TARGET="MAIN"><CODE>Cudd_addFindMin()</CODE></A>
 856 <DD> Finds the minimum discriminant of f.
 857
 858 <DT> <A HREF="cuddAllDet.html#Cudd_addGeneralVectorCompose" TARGET="MAIN"><CODE>Cudd_addGeneralVectorCompose()</CODE></A>
 859 <DD> Composes an ADD with a vector of ADDs.
 860
 861 <DT> <A HREF="cuddAllDet.html#Cudd_addHamming" TARGET="MAIN"><CODE>Cudd_addHamming()</CODE></A>
 862 <DD> Computes the Hamming distance ADD.
 863
 864 <DT> <A HREF="cuddAllDet.html#Cudd_addHarwell" TARGET="MAIN"><CODE>Cudd_addHarwell()</CODE></A>
 865 <DD> Reads in a matrix in the format of the Harwell-Boeing
 866   benchmark suite.
 867
 868 <DT> <A HREF="cuddAllDet.html#Cudd_addIteConstant" TARGET="MAIN"><CODE>Cudd_addIteConstant()</CODE></A>
 869 <DD> Implements ITEconstant for ADDs.
 870
 871 <DT> <A HREF="cuddAllDet.html#Cudd_addIte" TARGET="MAIN"><CODE>Cudd_addIte()</CODE></A>
 872 <DD> Implements ITE(f,g,h).
 873
 874 <DT> <A HREF="cuddAllDet.html#Cudd_addIthBit" TARGET="MAIN"><CODE>Cudd_addIthBit()</CODE></A>
 875 <DD> Extracts the i-th bit from an ADD.
 876
 877 <DT> <A HREF="cuddAllDet.html#Cudd_addIthVar" TARGET="MAIN"><CODE>Cudd_addIthVar()</CODE></A>
 878 <DD> Returns the ADD variable with index i.
 879
 880 <DT> <A HREF="cuddAllDet.html#Cudd_addLeq" TARGET="MAIN"><CODE>Cudd_addLeq()</CODE></A>
 881 <DD> Determines whether f is less than or equal to g.
 882
 883 <DT> <A HREF="cuddAllDet.html#Cudd_addLog" TARGET="MAIN"><CODE>Cudd_addLog()</CODE></A>
 884 <DD> Natural logarithm of an ADD.
 885
 886 <DT> <A HREF="cuddAllDet.html#Cudd_addMatrixMultiply" TARGET="MAIN"><CODE>Cudd_addMatrixMultiply()</CODE></A>
 887 <DD> Calculates the product of two matrices represented as
 888   ADDs.
 889
 890 <DT> <A HREF="cuddAllDet.html#Cudd_addMaximum" TARGET="MAIN"><CODE>Cudd_addMaximum()</CODE></A>
 891 <DD> Integer and floating point max.
 892
 893 <DT> <A HREF="cuddAllDet.html#Cudd_addMinimum" TARGET="MAIN"><CODE>Cudd_addMinimum()</CODE></A>
 894 <DD> Integer and floating point min.
 895
 896 <DT> <A HREF="cuddAllDet.html#Cudd_addMinus" TARGET="MAIN"><CODE>Cudd_addMinus()</CODE></A>
 897 <DD> Integer and floating point subtraction.
 898
 899 <DT> <A HREF="cuddAllDet.html#Cudd_addMonadicApply" TARGET="MAIN"><CODE>Cudd_addMonadicApply()</CODE></A>
 900 <DD> Applies op to the discriminants of f.
 901
 902 <DT> <A HREF="cuddAllDet.html#Cudd_addNand" TARGET="MAIN"><CODE>Cudd_addNand()</CODE></A>
 903 <DD> NAND of two 0-1 ADDs.
 904
 905 <DT> <A HREF="cuddAllDet.html#Cudd_addNegate" TARGET="MAIN"><CODE>Cudd_addNegate()</CODE></A>
 906 <DD> Computes the additive inverse of an ADD.
 907
 908 <DT> <A HREF="cuddAllDet.html#Cudd_addNewVarAtLevel" TARGET="MAIN"><CODE>Cudd_addNewVarAtLevel()</CODE></A>
 909 <DD> Returns a new ADD variable at a specified level.
 910
 911 <DT> <A HREF="cuddAllDet.html#Cudd_addNewVar" TARGET="MAIN"><CODE>Cudd_addNewVar()</CODE></A>
 912 <DD> Returns a new ADD variable.
 913
 914 <DT> <A HREF="cuddAllDet.html#Cudd_addNonSimCompose" TARGET="MAIN"><CODE>Cudd_addNonSimCompose()</CODE></A>
 915 <DD> Composes an ADD with a vector of 0-1 ADDs.
 916
 917 <DT> <A HREF="cuddAllDet.html#Cudd_addNor" TARGET="MAIN"><CODE>Cudd_addNor()</CODE></A>
 918 <DD> NOR of two 0-1 ADDs.
 919
 920 <DT> <A HREF="cuddAllDet.html#Cudd_addOneZeroMaximum" TARGET="MAIN"><CODE>Cudd_addOneZeroMaximum()</CODE></A>
 921 <DD> Returns 1 if f &gt; g and 0 otherwise.
 922
 923 <DT> <A HREF="cuddAllDet.html#Cudd_addOrAbstract" TARGET="MAIN"><CODE>Cudd_addOrAbstract()</CODE></A>
 924 <DD> Disjunctively abstracts all the variables in cube from the
 925   0-1 ADD f.
 926
 927 <DT> <A HREF="cuddAllDet.html#Cudd_addOr" TARGET="MAIN"><CODE>Cudd_addOr()</CODE></A>
 928 <DD> Disjunction of two 0-1 ADDs.
 929
 930 <DT> <A HREF="cuddAllDet.html#Cudd_addOuterSum" TARGET="MAIN"><CODE>Cudd_addOuterSum()</CODE></A>
 931 <DD> Takes the minimum of a matrix and the outer sum of two vectors.
 932
 933 <DT> <A HREF="cuddAllDet.html#Cudd_addPermute" TARGET="MAIN"><CODE>Cudd_addPermute()</CODE></A>
 934 <DD> Permutes the variables of an ADD.
 935
 936 <DT> <A HREF="cuddAllDet.html#Cudd_addPlus" TARGET="MAIN"><CODE>Cudd_addPlus()</CODE></A>
 937 <DD> Integer and floating point addition.
 938
 939 <DT> <A HREF="cuddAllDet.html#Cudd_addRead" TARGET="MAIN"><CODE>Cudd_addRead()</CODE></A>
 940 <DD> Reads in a sparse matrix.
 941
 942 <DT> <A HREF="cuddAllDet.html#Cudd_addResidue" TARGET="MAIN"><CODE>Cudd_addResidue()</CODE></A>
 943 <DD> Builds an ADD for the residue modulo m of an n-bit
 944   number.
 945
 946 <DT> <A HREF="cuddAllDet.html#Cudd_addRestrict" TARGET="MAIN"><CODE>Cudd_addRestrict()</CODE></A>
 947 <DD> ADD restrict according to Coudert and Madre's algorithm
 948   (ICCAD90).
 949
 950 <DT> <A HREF="cuddAllDet.html#Cudd_addRoundOff" TARGET="MAIN"><CODE>Cudd_addRoundOff()</CODE></A>
 951 <DD> Rounds off the discriminants of an ADD.
 952
 953 <DT> <A HREF="cuddAllDet.html#Cudd_addScalarInverse" TARGET="MAIN"><CODE>Cudd_addScalarInverse()</CODE></A>
 954 <DD> Computes the scalar inverse of an ADD.
 955
 956 <DT> <A HREF="cuddAllDet.html#Cudd_addSetNZ" TARGET="MAIN"><CODE>Cudd_addSetNZ()</CODE></A>
 957 <DD> This operator sets f to the value of g wherever g != 0.
 958
 959 <DT> <A HREF="cuddAllDet.html#Cudd_addSwapVariables" TARGET="MAIN"><CODE>Cudd_addSwapVariables()</CODE></A>
 960 <DD> Swaps two sets of variables of the same size (x and y) in
 961   the ADD f.
 962
 963 <DT> <A HREF="cuddAllDet.html#Cudd_addThreshold" TARGET="MAIN"><CODE>Cudd_addThreshold()</CODE></A>
 964 <DD> f if f&gt;=g; 0 if f&lt;g.
 965
 966 <DT> <A HREF="cuddAllDet.html#Cudd_addTimesPlus" TARGET="MAIN"><CODE>Cudd_addTimesPlus()</CODE></A>
 967 <DD> Calculates the product of two matrices represented as
 968   ADDs.
 969
 970 <DT> <A HREF="cuddAllDet.html#Cudd_addTimes" TARGET="MAIN"><CODE>Cudd_addTimes()</CODE></A>
 971 <DD> Integer and floating point multiplication.
 972
 973 <DT> <A HREF="cuddAllDet.html#Cudd_addTriangle" TARGET="MAIN"><CODE>Cudd_addTriangle()</CODE></A>
 974 <DD> Performs the triangulation step for the shortest path
 975   computation.
 976
 977 <DT> <A HREF="cuddAllDet.html#Cudd_addUnivAbstract" TARGET="MAIN"><CODE>Cudd_addUnivAbstract()</CODE></A>
 978 <DD> Universally Abstracts all the variables in cube from f.
 979
 980 <DT> <A HREF="cuddAllDet.html#Cudd_addVectorCompose" TARGET="MAIN"><CODE>Cudd_addVectorCompose()</CODE></A>
 981 <DD> Composes an ADD with a vector of 0-1 ADDs.
 982
 983 <DT> <A HREF="cuddAllDet.html#Cudd_addWalsh" TARGET="MAIN"><CODE>Cudd_addWalsh()</CODE></A>
 984 <DD> Generates a Walsh matrix in ADD form.
 985
 986 <DT> <A HREF="cuddAllDet.html#Cudd_addXeqy" TARGET="MAIN"><CODE>Cudd_addXeqy()</CODE></A>
 987 <DD> Generates an ADD for the function x==y.
 988
 989 <DT> <A HREF="cuddAllDet.html#Cudd_addXnor" TARGET="MAIN"><CODE>Cudd_addXnor()</CODE></A>
 990 <DD> XNOR of two 0-1 ADDs.
 991
 992 <DT> <A HREF="cuddAllDet.html#Cudd_addXor" TARGET="MAIN"><CODE>Cudd_addXor()</CODE></A>
 993 <DD> XOR of two 0-1 ADDs.
 994
 995 <DT> <A HREF="cuddAllDet.html#Cudd_bddAdjPermuteX" TARGET="MAIN"><CODE>Cudd_bddAdjPermuteX()</CODE></A>
 996 <DD> Rearranges a set of variables in the BDD B.
 997
 998 <DT> <A HREF="cuddAllDet.html#Cudd_bddAndAbstractLimit" TARGET="MAIN"><CODE>Cudd_bddAndAbstractLimit()</CODE></A>
 999 <DD> Takes the AND of two BDDs and simultaneously abstracts the
1000   variables in cube.  Returns NULL if too many nodes are required.
1001
1002 <DT> <A HREF="cuddAllDet.html#Cudd_bddAndAbstract" TARGET="MAIN"><CODE>Cudd_bddAndAbstract()</CODE></A>
1003 <DD> Takes the AND of two BDDs and simultaneously abstracts the
1004   variables in cube.
1005
1006 <DT> <A HREF="cuddAllDet.html#Cudd_bddAndLimit" TARGET="MAIN"><CODE>Cudd_bddAndLimit()</CODE></A>
1007 <DD> Computes the conjunction of two BDDs f and g.  Returns
1008   NULL if too many nodes are required.
1009
1010 <DT> <A HREF="cuddAllDet.html#Cudd_bddAnd" TARGET="MAIN"><CODE>Cudd_bddAnd()</CODE></A>
1011 <DD> Computes the conjunction of two BDDs f and g.
1012
1013 <DT> <A HREF="cuddAllDet.html#Cudd_bddApproxConjDecomp" TARGET="MAIN"><CODE>Cudd_bddApproxConjDecomp()</CODE></A>
1014 <DD> Performs two-way conjunctive decomposition of a BDD.
1015
1016 <DT> <A HREF="cuddAllDet.html#Cudd_bddApproxDisjDecomp" TARGET="MAIN"><CODE>Cudd_bddApproxDisjDecomp()</CODE></A>
1017 <DD> Performs two-way disjunctive decomposition of a BDD.
1018
1019 <DT> <A HREF="cuddAllDet.html#Cudd_bddBindVar" TARGET="MAIN"><CODE>Cudd_bddBindVar()</CODE></A>
1020 <DD> Prevents sifting of a variable.
1021
1022 <DT> <A HREF="cuddAllDet.html#Cudd_bddBooleanDiff" TARGET="MAIN"><CODE>Cudd_bddBooleanDiff()</CODE></A>
1023 <DD> Computes the boolean difference of f with respect to x.
1024
1025 <DT> <A HREF="cuddAllDet.html#Cudd_bddCharToVect" TARGET="MAIN"><CODE>Cudd_bddCharToVect()</CODE></A>
1026 <DD> Computes a vector whose image equals a non-zero function.
1027
1028 <DT> <A HREF="cuddAllDet.html#Cudd_bddClippingAndAbstract" TARGET="MAIN"><CODE>Cudd_bddClippingAndAbstract()</CODE></A>
1029 <DD> Approximates the conjunction of two BDDs f and g and
1030   simultaneously abstracts the variables in cube.
1031
1032 <DT> <A HREF="cuddAllDet.html#Cudd_bddClippingAnd" TARGET="MAIN"><CODE>Cudd_bddClippingAnd()</CODE></A>
1033 <DD> Approximates the conjunction of two BDDs f and g.
1034
1035 <DT> <A HREF="cuddAllDet.html#Cudd_bddClosestCube" TARGET="MAIN"><CODE>Cudd_bddClosestCube()</CODE></A>
1036 <DD> Finds a cube of f at minimum Hamming distance from g.
1037
1038 <DT> <A HREF="cuddAllDet.html#Cudd_bddCompose" TARGET="MAIN"><CODE>Cudd_bddCompose()</CODE></A>
1039 <DD> Substitutes g for x_v in the BDD for f.
1040
1041 <DT> <A HREF="cuddAllDet.html#Cudd_bddComputeCube" TARGET="MAIN"><CODE>Cudd_bddComputeCube()</CODE></A>
1042 <DD> Computes the cube of an array of BDD variables.
1043
1044 <DT> <A HREF="cuddAllDet.html#Cudd_bddConstrainDecomp" TARGET="MAIN"><CODE>Cudd_bddConstrainDecomp()</CODE></A>
1045 <DD> BDD conjunctive decomposition as in McMillan's CAV96 paper.
1046
1047 <DT> <A HREF="cuddAllDet.html#Cudd_bddConstrain" TARGET="MAIN"><CODE>Cudd_bddConstrain()</CODE></A>
1048 <DD> Computes f constrain c.
1049
1050 <DT> <A HREF="cuddAllDet.html#Cudd_bddCorrelationWeights" TARGET="MAIN"><CODE>Cudd_bddCorrelationWeights()</CODE></A>
1051 <DD> Computes the correlation of f and g for given input
1052   probabilities.
1053
1054 <DT> <A HREF="cuddAllDet.html#Cudd_bddCorrelation" TARGET="MAIN"><CODE>Cudd_bddCorrelation()</CODE></A>
1055 <DD> Computes the correlation of f and g.
1056
1057 <DT> <A HREF="cuddAllDet.html#Cudd_bddExistAbstract" TARGET="MAIN"><CODE>Cudd_bddExistAbstract()</CODE></A>
1058 <DD> Existentially abstracts all the variables in cube from f.
1059
1060 <DT> <A HREF="cuddAllDet.html#Cudd_bddGenConjDecomp" TARGET="MAIN"><CODE>Cudd_bddGenConjDecomp()</CODE></A>
1061 <DD> Performs two-way conjunctive decomposition of a BDD.
1062
1063 <DT> <A HREF="cuddAllDet.html#Cudd_bddGenDisjDecomp" TARGET="MAIN"><CODE>Cudd_bddGenDisjDecomp()</CODE></A>
1064 <DD> Performs two-way disjunctive decomposition of a BDD.
1065
1066 <DT> <A HREF="cuddAllDet.html#Cudd_bddIntersect" TARGET="MAIN"><CODE>Cudd_bddIntersect()</CODE></A>
1067 <DD> Returns a function included in the intersection of f and g.
1068
1069 <DT> <A HREF="cuddAllDet.html#Cudd_bddInterval" TARGET="MAIN"><CODE>Cudd_bddInterval()</CODE></A>
1070 <DD> Generates a BDD for the function lowerB &le; x &le; upperB.
1071
1072 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsNsVar" TARGET="MAIN"><CODE>Cudd_bddIsNsVar()</CODE></A>
1073 <DD> Checks whether a variable is next state.
1074
1075 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsPiVar" TARGET="MAIN"><CODE>Cudd_bddIsPiVar()</CODE></A>
1076 <DD> Checks whether a variable is primary input.
1077
1078 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsPsVar" TARGET="MAIN"><CODE>Cudd_bddIsPsVar()</CODE></A>
1079 <DD> Checks whether a variable is present state.
1080
1081 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsVarEssential" TARGET="MAIN"><CODE>Cudd_bddIsVarEssential()</CODE></A>
1082 <DD> Determines whether a given variable is essential with a
1083   given phase in a BDD.
1084
1085 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsVarHardGroup" TARGET="MAIN"><CODE>Cudd_bddIsVarHardGroup()</CODE></A>
1086 <DD> Checks whether a variable is set to be in a hard group.
1087
1088 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsVarToBeGrouped" TARGET="MAIN"><CODE>Cudd_bddIsVarToBeGrouped()</CODE></A>
1089 <DD> Checks whether a variable is set to be grouped.
1090
1091 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsVarToBeUngrouped" TARGET="MAIN"><CODE>Cudd_bddIsVarToBeUngrouped()</CODE></A>
1092 <DD> Checks whether a variable is set to be ungrouped.
1093
1094 <DT> <A HREF="cuddAllDet.html#Cudd_bddIsop" TARGET="MAIN"><CODE>Cudd_bddIsop()</CODE></A>
1095 <DD> Computes a BDD in the interval between L and U with a
1096   simple sum-of-produuct cover.
1097
1098 <DT> <A HREF="cuddAllDet.html#Cudd_bddIteConstant" TARGET="MAIN"><CODE>Cudd_bddIteConstant()</CODE></A>
1099 <DD> Implements ITEconstant(f,g,h).
1100
1101 <DT> <A HREF="cuddAllDet.html#Cudd_bddIterConjDecomp" TARGET="MAIN"><CODE>Cudd_bddIterConjDecomp()</CODE></A>
1102 <DD> Performs two-way conjunctive decomposition of a BDD.
1103
1104 <DT> <A HREF="cuddAllDet.html#Cudd_bddIterDisjDecomp" TARGET="MAIN"><CODE>Cudd_bddIterDisjDecomp()</CODE></A>
1105 <DD> Performs two-way disjunctive decomposition of a BDD.
1106
1107 <DT> <A HREF="cuddAllDet.html#Cudd_bddIte" TARGET="MAIN"><CODE>Cudd_bddIte()</CODE></A>
1108 <DD> Implements ITE(f,g,h).
1109
1110 <DT> <A HREF="cuddAllDet.html#Cudd_bddIthVar" TARGET="MAIN"><CODE>Cudd_bddIthVar()</CODE></A>
1111 <DD> Returns the BDD variable with index i.
1112
1113 <DT> <A HREF="cuddAllDet.html#Cudd_bddLICompaction" TARGET="MAIN"><CODE>Cudd_bddLICompaction()</CODE></A>
1114 <DD> Performs safe minimization of a BDD.
1115
1116 <DT> <A HREF="cuddAllDet.html#Cudd_bddLeqUnless" TARGET="MAIN"><CODE>Cudd_bddLeqUnless()</CODE></A>
1117 <DD> Tells whether f is less than of equal to G unless D is 1.
1118
1119 <DT> <A HREF="cuddAllDet.html#Cudd_bddLeq" TARGET="MAIN"><CODE>Cudd_bddLeq()</CODE></A>
1120 <DD> Determines whether f is less than or equal to g.
1121
1122 <DT> <A HREF="cuddAllDet.html#Cudd_bddLiteralSetIntersection" TARGET="MAIN"><CODE>Cudd_bddLiteralSetIntersection()</CODE></A>
1123 <DD> Computes the intesection of two sets of literals
1124   represented as BDDs.
1125
1126 <DT> <A HREF="cuddAllDet.html#Cudd_bddMakePrime" TARGET="MAIN"><CODE>Cudd_bddMakePrime()</CODE></A>
1127 <DD> Expands cube to a prime implicant of f.
1128
1129 <DT> <A HREF="cuddAllDet.html#Cudd_bddMinimize" TARGET="MAIN"><CODE>Cudd_bddMinimize()</CODE></A>
1130 <DD> Finds a small BDD that agrees with <code>f</code> over
1131   <code>c</code>.
1132
1133 <DT> <A HREF="cuddAllDet.html#Cudd_bddNPAnd" TARGET="MAIN"><CODE>Cudd_bddNPAnd()</CODE></A>
1134 <DD> Computes f non-polluting-and g.
1135
1136 <DT> <A HREF="cuddAllDet.html#Cudd_bddNand" TARGET="MAIN"><CODE>Cudd_bddNand()</CODE></A>
1137 <DD> Computes the NAND of two BDDs f and g.
1138
1139 <DT> <A HREF="cuddAllDet.html#Cudd_bddNewVarAtLevel" TARGET="MAIN"><CODE>Cudd_bddNewVarAtLevel()</CODE></A>
1140 <DD> Returns a new BDD variable at a specified level.
1141
1142 <DT> <A HREF="cuddAllDet.html#Cudd_bddNewVar" TARGET="MAIN"><CODE>Cudd_bddNewVar()</CODE></A>
1143 <DD> Returns a new BDD variable.
1144
1145 <DT> <A HREF="cuddAllDet.html#Cudd_bddNor" TARGET="MAIN"><CODE>Cudd_bddNor()</CODE></A>
1146 <DD> Computes the NOR of two BDDs f and g.
1147
1148 <DT> <A HREF="cuddAllDet.html#Cudd_bddOr" TARGET="MAIN"><CODE>Cudd_bddOr()</CODE></A>
1149 <DD> Computes the disjunction of two BDDs f and g.
1150
1151 <DT> <A HREF="cuddAllDet.html#Cudd_bddPermute" TARGET="MAIN"><CODE>Cudd_bddPermute()</CODE></A>
1152 <DD> Permutes the variables of a BDD.
1153
1154 <DT> <A HREF="cuddAllDet.html#Cudd_bddPickArbitraryMinterms" TARGET="MAIN"><CODE>Cudd_bddPickArbitraryMinterms()</CODE></A>
1155 <DD> Picks k on-set minterms evenly distributed from given DD.
1156
1157 <DT> <A HREF="cuddAllDet.html#Cudd_bddPickOneCube" TARGET="MAIN"><CODE>Cudd_bddPickOneCube()</CODE></A>
1158 <DD> Picks one on-set cube randomly from the given DD.
1159
1160 <DT> <A HREF="cuddAllDet.html#Cudd_bddPickOneMinterm" TARGET="MAIN"><CODE>Cudd_bddPickOneMinterm()</CODE></A>
1161 <DD> Picks one on-set minterm randomly from the given DD.
1162
1163 <DT> <A HREF="cuddAllDet.html#Cudd_bddPrintCover" TARGET="MAIN"><CODE>Cudd_bddPrintCover()</CODE></A>
1164 <DD> Prints a sum of prime implicants of a BDD.
1165
1166 <DT> <A HREF="cuddAllDet.html#Cudd_bddReadPairIndex" TARGET="MAIN"><CODE>Cudd_bddReadPairIndex()</CODE></A>
1167 <DD> Reads a corresponding pair index for a given index.
1168
1169 <DT> <A HREF="cuddAllDet.html#Cudd_bddRead" TARGET="MAIN"><CODE>Cudd_bddRead()</CODE></A>
1170 <DD> Reads in a graph (without labels) given as a list of arcs.
1171
1172 <DT> <A HREF="cuddAllDet.html#Cudd_bddRealignDisable" TARGET="MAIN"><CODE>Cudd_bddRealignDisable()</CODE></A>
1173 <DD> Disables realignment of ZDD order to BDD order.
1174
1175 <DT> <A HREF="cuddAllDet.html#Cudd_bddRealignEnable" TARGET="MAIN"><CODE>Cudd_bddRealignEnable()</CODE></A>
1176 <DD> Enables realignment of BDD order to ZDD order.
1177
1178 <DT> <A HREF="cuddAllDet.html#Cudd_bddRealignmentEnabled" TARGET="MAIN"><CODE>Cudd_bddRealignmentEnabled()</CODE></A>
1179 <DD> Tells whether the realignment of BDD order to ZDD order is
1180   enabled.
1181
1182 <DT> <A HREF="cuddAllDet.html#Cudd_bddResetVarToBeGrouped" TARGET="MAIN"><CODE>Cudd_bddResetVarToBeGrouped()</CODE></A>
1183 <DD> Resets a variable not to be grouped.
1184
1185 <DT> <A HREF="cuddAllDet.html#Cudd_bddRestrict" TARGET="MAIN"><CODE>Cudd_bddRestrict()</CODE></A>
1186 <DD> BDD restrict according to Coudert and Madre's algorithm
1187   (ICCAD90).
1188
1189 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetNsVar" TARGET="MAIN"><CODE>Cudd_bddSetNsVar()</CODE></A>
1190 <DD> Sets a variable type to next state.
1191
1192 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetPairIndex" TARGET="MAIN"><CODE>Cudd_bddSetPairIndex()</CODE></A>
1193 <DD> Sets a corresponding pair index for a given index.
1194
1195 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetPiVar" TARGET="MAIN"><CODE>Cudd_bddSetPiVar()</CODE></A>
1196 <DD> Sets a variable type to primary input.
1197
1198 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetPsVar" TARGET="MAIN"><CODE>Cudd_bddSetPsVar()</CODE></A>
1199 <DD> Sets a variable type to present state.
1200
1201 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetVarHardGroup" TARGET="MAIN"><CODE>Cudd_bddSetVarHardGroup()</CODE></A>
1202 <DD> Sets a variable to be a hard group.
1203
1204 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetVarToBeGrouped" TARGET="MAIN"><CODE>Cudd_bddSetVarToBeGrouped()</CODE></A>
1205 <DD> Sets a variable to be grouped.
1206
1207 <DT> <A HREF="cuddAllDet.html#Cudd_bddSetVarToBeUngrouped" TARGET="MAIN"><CODE>Cudd_bddSetVarToBeUngrouped()</CODE></A>
1208 <DD> Sets a variable to be ungrouped.
1209
1210 <DT> <A HREF="cuddAllDet.html#Cudd_bddSqueeze" TARGET="MAIN"><CODE>Cudd_bddSqueeze()</CODE></A>
1211 <DD> Finds a small BDD in a function interval.
1212
1213 <DT> <A HREF="cuddAllDet.html#Cudd_bddSwapVariables" TARGET="MAIN"><CODE>Cudd_bddSwapVariables()</CODE></A>
1214 <DD> Swaps two sets of variables of the same size (x and y) in
1215   the BDD f.
1216
1217 <DT> <A HREF="cuddAllDet.html#Cudd_bddTransfer" TARGET="MAIN"><CODE>Cudd_bddTransfer()</CODE></A>
1218 <DD> Convert a BDD from a manager to another one.
1219
1220 <DT> <A HREF="cuddAllDet.html#Cudd_bddUnbindVar" TARGET="MAIN"><CODE>Cudd_bddUnbindVar()</CODE></A>
1221 <DD> Allows the sifting of a variable.
1222
1223 <DT> <A HREF="cuddAllDet.html#Cudd_bddUnivAbstract" TARGET="MAIN"><CODE>Cudd_bddUnivAbstract()</CODE></A>
1224 <DD> Universally abstracts all the variables in cube from f.
1225
1226 <DT> <A HREF="cuddAllDet.html#Cudd_bddVarConjDecomp" TARGET="MAIN"><CODE>Cudd_bddVarConjDecomp()</CODE></A>
1227 <DD> Performs two-way conjunctive decomposition of a BDD.
1228
1229 <DT> <A HREF="cuddAllDet.html#Cudd_bddVarDisjDecomp" TARGET="MAIN"><CODE>Cudd_bddVarDisjDecomp()</CODE></A>
1230 <DD> Performs two-way disjunctive decomposition of a BDD.
1231
1232 <DT> <A HREF="cuddAllDet.html#Cudd_bddVarIsBound" TARGET="MAIN"><CODE>Cudd_bddVarIsBound()</CODE></A>
1233 <DD> Tells whether a variable can be sifted.
1234
1235 <DT> <A HREF="cuddAllDet.html#Cudd_bddVarIsDependent" TARGET="MAIN"><CODE>Cudd_bddVarIsDependent()</CODE></A>
1236 <DD> Checks whether a variable is dependent on others in a
1237   function.
1238
1239 <DT> <A HREF="cuddAllDet.html#Cudd_bddVarMap" TARGET="MAIN"><CODE>Cudd_bddVarMap()</CODE></A>
1240 <DD> Remaps the variables of a BDD using the default variable map.
1241
1242 <DT> <A HREF="cuddAllDet.html#Cudd_bddVectorCompose" TARGET="MAIN"><CODE>Cudd_bddVectorCompose()</CODE></A>
1243 <DD> Composes a BDD with a vector of BDDs.
1244
1245 <DT> <A HREF="cuddAllDet.html#Cudd_bddXnor" TARGET="MAIN"><CODE>Cudd_bddXnor()</CODE></A>
1246 <DD> Computes the exclusive NOR of two BDDs f and g.
1247
1248 <DT> <A HREF="cuddAllDet.html#Cudd_bddXorExistAbstract" TARGET="MAIN"><CODE>Cudd_bddXorExistAbstract()</CODE></A>
1249 <DD> Takes the exclusive OR of two BDDs and simultaneously abstracts the
1250   variables in cube.
1251
1252 <DT> <A HREF="cuddAllDet.html#Cudd_bddXor" TARGET="MAIN"><CODE>Cudd_bddXor()</CODE></A>
1253 <DD> Computes the exclusive OR of two BDDs f and g.
1254
1255 <DT> <A HREF="cuddAllDet.html#Cudd_tlcInfoFree" TARGET="MAIN"><CODE>Cudd_tlcInfoFree()</CODE></A>
1256 <DD> Frees a DdTlcInfo Structure.
1257
1258 <DT> <A HREF="cuddAllDet.html#Cudd_zddChange" TARGET="MAIN"><CODE>Cudd_zddChange()</CODE></A>
1259 <DD> Substitutes a variable with its complement in a ZDD.
1260
1261 <DT> <A HREF="cuddAllDet.html#Cudd_zddComplement" TARGET="MAIN"><CODE>Cudd_zddComplement()</CODE></A>
1262 <DD> Computes a complement cover for a ZDD node.
1263
1264 <DT> <A HREF="cuddAllDet.html#Cudd_zddCountDouble" TARGET="MAIN"><CODE>Cudd_zddCountDouble()</CODE></A>
1265 <DD> Counts the number of minterms of a ZDD.
1266
1267 <DT> <A HREF="cuddAllDet.html#Cudd_zddCountMinterm" TARGET="MAIN"><CODE>Cudd_zddCountMinterm()</CODE></A>
1268 <DD> Counts the number of minterms of a ZDD.
1269
1270 <DT> <A HREF="cuddAllDet.html#Cudd_zddCount" TARGET="MAIN"><CODE>Cudd_zddCount()</CODE></A>
1271 <DD> Counts the number of minterms in a ZDD.
1272
1273 <DT> <A HREF="cuddAllDet.html#Cudd_zddCoverPathToString" TARGET="MAIN"><CODE>Cudd_zddCoverPathToString()</CODE></A>
1274 <DD> Converts a path of a ZDD representing a cover to a string.
1275
1276 <DT> <A HREF="cuddAllDet.html#Cudd_zddDagSize" TARGET="MAIN"><CODE>Cudd_zddDagSize()</CODE></A>
1277 <DD> Counts the number of nodes in a ZDD.
1278
1279 <DT> <A HREF="cuddAllDet.html#Cudd_zddDiffConst" TARGET="MAIN"><CODE>Cudd_zddDiffConst()</CODE></A>
1280 <DD> Performs the inclusion test for ZDDs (P implies Q).
1281
1282 <DT> <A HREF="cuddAllDet.html#Cudd_zddDiff" TARGET="MAIN"><CODE>Cudd_zddDiff()</CODE></A>
1283 <DD> Computes the difference of two ZDDs.
1284
1285 <DT> <A HREF="cuddAllDet.html#Cudd_zddDivideF" TARGET="MAIN"><CODE>Cudd_zddDivideF()</CODE></A>
1286 <DD> Modified version of Cudd_zddDivide.
1287
1288 <DT> <A HREF="cuddAllDet.html#Cudd_zddDivide" TARGET="MAIN"><CODE>Cudd_zddDivide()</CODE></A>
1289 <DD> Computes the quotient of two unate covers.
1290
1291 <DT> <A HREF="cuddAllDet.html#Cudd_zddDumpDot" TARGET="MAIN"><CODE>Cudd_zddDumpDot()</CODE></A>
1292 <DD> Writes a dot file representing the argument ZDDs.
1293
1294 <DT> <A HREF="cuddAllDet.html#Cudd_zddFirstPath" TARGET="MAIN"><CODE>Cudd_zddFirstPath()</CODE></A>
1295 <DD> Finds the first path of a ZDD.
1296
1297 <DT> <A HREF="cuddAllDet.html#Cudd_zddIntersect" TARGET="MAIN"><CODE>Cudd_zddIntersect()</CODE></A>
1298 <DD> Computes the intersection of two ZDDs.
1299
1300 <DT> <A HREF="cuddAllDet.html#Cudd_zddIsop" TARGET="MAIN"><CODE>Cudd_zddIsop()</CODE></A>
1301 <DD> Computes an ISOP in ZDD form from BDDs.
1302
1303 <DT> <A HREF="cuddAllDet.html#Cudd_zddIte" TARGET="MAIN"><CODE>Cudd_zddIte()</CODE></A>
1304 <DD> Computes the ITE of three ZDDs.
1305
1306 <DT> <A HREF="cuddAllDet.html#Cudd_zddIthVar" TARGET="MAIN"><CODE>Cudd_zddIthVar()</CODE></A>
1307 <DD> Returns the ZDD variable with index i.
1308
1309 <DT> <A HREF="cuddAllDet.html#Cudd_zddNextPath" TARGET="MAIN"><CODE>Cudd_zddNextPath()</CODE></A>
1310 <DD> Generates the next path of a ZDD.
1311
1312 <DT> <A HREF="cuddAllDet.html#Cudd_zddPortFromBdd" TARGET="MAIN"><CODE>Cudd_zddPortFromBdd()</CODE></A>
1313 <DD> Converts a BDD into a ZDD.
1314
1315 <DT> <A HREF="cuddAllDet.html#Cudd_zddPortToBdd" TARGET="MAIN"><CODE>Cudd_zddPortToBdd()</CODE></A>
1316 <DD> Converts a ZDD into a BDD.
1317
1318 <DT> <A HREF="cuddAllDet.html#Cudd_zddPrintCover" TARGET="MAIN"><CODE>Cudd_zddPrintCover()</CODE></A>
1319 <DD> Prints a sum of products from a ZDD representing a cover.
1320
1321 <DT> <A HREF="cuddAllDet.html#Cudd_zddPrintDebug" TARGET="MAIN"><CODE>Cudd_zddPrintDebug()</CODE></A>
1322 <DD> Prints to the standard output a ZDD and its statistics.
1323
1324 <DT> <A HREF="cuddAllDet.html#Cudd_zddPrintMinterm" TARGET="MAIN"><CODE>Cudd_zddPrintMinterm()</CODE></A>
1325 <DD> Prints a disjoint sum of product form for a ZDD.
1326
1327 <DT> <A HREF="cuddAllDet.html#Cudd_zddPrintSubtable" TARGET="MAIN"><CODE>Cudd_zddPrintSubtable()</CODE></A>
1328 <DD> Prints the ZDD table.
1329
1330 <DT> <A HREF="cuddAllDet.html#Cudd_zddProduct" TARGET="MAIN"><CODE>Cudd_zddProduct()</CODE></A>
1331 <DD> Computes the product of two covers represented by ZDDs.
1332
1333 <DT> <A HREF="cuddAllDet.html#Cudd_zddReadNodeCount" TARGET="MAIN"><CODE>Cudd_zddReadNodeCount()</CODE></A>
1334 <DD> Reports the number of nodes in ZDDs.
1335
1336 <DT> <A HREF="cuddAllDet.html#Cudd_zddRealignDisable" TARGET="MAIN"><CODE>Cudd_zddRealignDisable()</CODE></A>
1337 <DD> Disables realignment of ZDD order to BDD order.
1338
1339 <DT> <A HREF="cuddAllDet.html#Cudd_zddRealignEnable" TARGET="MAIN"><CODE>Cudd_zddRealignEnable()</CODE></A>
1340 <DD> Enables realignment of ZDD order to BDD order.
1341
1342 <DT> <A HREF="cuddAllDet.html#Cudd_zddRealignmentEnabled" TARGET="MAIN"><CODE>Cudd_zddRealignmentEnabled()</CODE></A>
1343 <DD> Tells whether the realignment of ZDD order to BDD order is
1344   enabled.
1345
1346 <DT> <A HREF="cuddAllDet.html#Cudd_zddReduceHeap" TARGET="MAIN"><CODE>Cudd_zddReduceHeap()</CODE></A>
1347 <DD> Main dynamic reordering routine for ZDDs.
1348
1349 <DT> <A HREF="cuddAllDet.html#Cudd_zddShuffleHeap" TARGET="MAIN"><CODE>Cudd_zddShuffleHeap()</CODE></A>
1350 <DD> Reorders ZDD variables according to given permutation.
1351
1352 <DT> <A HREF="cuddAllDet.html#Cudd_zddSubset0" TARGET="MAIN"><CODE>Cudd_zddSubset0()</CODE></A>
1353 <DD> Computes the negative cofactor of a ZDD w.r.t. a variable.
1354
1355 <DT> <A HREF="cuddAllDet.html#Cudd_zddSubset1" TARGET="MAIN"><CODE>Cudd_zddSubset1()</CODE></A>
1356 <DD> Computes the positive cofactor of a ZDD w.r.t. a variable.
1357
1358 <DT> <A HREF="cuddAllDet.html#Cudd_zddSymmProfile" TARGET="MAIN"><CODE>Cudd_zddSymmProfile()</CODE></A>
1359 <DD> Prints statistics on symmetric ZDD variables.
1360
1361 <DT> <A HREF="cuddAllDet.html#Cudd_zddUnateProduct" TARGET="MAIN"><CODE>Cudd_zddUnateProduct()</CODE></A>
1362 <DD> Computes the product of two unate covers.
1363
1364 <DT> <A HREF="cuddAllDet.html#Cudd_zddUnion" TARGET="MAIN"><CODE>Cudd_zddUnion()</CODE></A>
1365 <DD> Computes the union of two ZDDs.
1366
1367 <DT> <A HREF="cuddAllDet.html#Cudd_zddVarsFromBddVars" TARGET="MAIN"><CODE>Cudd_zddVarsFromBddVars()</CODE></A>
1368 <DD> Creates one or more ZDD variables for each BDD variable.
1369
1370 <DT> <A HREF="cuddAllDet.html#Cudd_zddWeakDivF" TARGET="MAIN"><CODE>Cudd_zddWeakDivF()</CODE></A>
1371 <DD> Modified version of Cudd_zddWeakDiv.
1372
1373 <DT> <A HREF="cuddAllDet.html#Cudd_zddWeakDiv" TARGET="MAIN"><CODE>Cudd_zddWeakDiv()</CODE></A>
1374 <DD> Applies weak division to two covers.
1375
1376 <DT> <A HREF="cuddAllDet.html#MarkCacheCleanUp" TARGET="MAIN"><CODE>MarkCacheCleanUp()</CODE></A>
1377 <DD> Frees memory associated with computed table of
1378   cuddBddLICMarkEdges.
1379
1380 <DT> <A HREF="cuddAllDet.html#MarkCacheCompare" TARGET="MAIN"><CODE>MarkCacheCompare()</CODE></A>
1381 <DD> Comparison function for the computed table of
1382   cuddBddLICMarkEdges.
1383
1384 <DT> <A HREF="cuddAllDet.html#MarkCacheHash" TARGET="MAIN"><CODE>MarkCacheHash()</CODE></A>
1385 <DD> Hash function for the computed table of cuddBddLICMarkEdges.
1386
1387 <DT> <A HREF="cuddAllDet.html#PMX" TARGET="MAIN"><CODE>PMX()</CODE></A>
1388 <DD> Performs the crossover between two parents.
1389
1390 <DT> <A HREF="cuddAllDet.html#PairInTables" TARGET="MAIN"><CODE>PairInTables()</CODE></A>
1391 <DD> Check whether the given pair is in the tables.
1392
1393 <DT> <A HREF="cuddAllDet.html#PickOnePair" TARGET="MAIN"><CODE>PickOnePair()</CODE></A>
1394 <DD> Check the tables for the existence of pair and return one
1395   combination, store in cache.
1396
1397 <DT> <A HREF="cuddAllDet.html#RAbuildSubset" TARGET="MAIN"><CODE>RAbuildSubset()</CODE></A>
1398 <DD> Builds the subset BDD for cuddRemapUnderApprox.
1399
1400 <DT> <A HREF="cuddAllDet.html#RAmarkNodes" TARGET="MAIN"><CODE>RAmarkNodes()</CODE></A>
1401 <DD> Marks nodes for remapping.
1402
1403 <DT> <A HREF="cuddAllDet.html#ResizeCountMintermPages" TARGET="MAIN"><CODE>ResizeCountMintermPages()</CODE></A>
1404 <DD> Resize the number of pages allocated to store the minterm
1405   counts.
1406
1407 <DT> <A HREF="cuddAllDet.html#ResizeCountNodePages" TARGET="MAIN"><CODE>ResizeCountNodePages()</CODE></A>
1408 <DD> Resize the number of pages allocated to store the node counts.
1409
1410 <DT> <A HREF="cuddAllDet.html#ResizeNodeDataPages" TARGET="MAIN"><CODE>ResizeNodeDataPages()</CODE></A>
1411 <DD> Resize the number of pages allocated to store the node data.
1412
1413 <DT> <A HREF="cuddAllDet.html#ResizeNodeDistPages" TARGET="MAIN"><CODE>ResizeNodeDistPages()</CODE></A>
1414 <DD> Resize the number of pages allocated to store the distances
1415   related to each node.
1416
1417 <DT> <A HREF="cuddAllDet.html#ResizeQueuePages" TARGET="MAIN"><CODE>ResizeQueuePages()</CODE></A>
1418 <DD> Resize the number of pages allocated to store nodes in the BFS
1419   traversal of the Bdd  .
1420
1421 <DT> <A HREF="cuddAllDet.html#StoreNodes" TARGET="MAIN"><CODE>StoreNodes()</CODE></A>
1422 <DD> Procedure to recursively store nodes that are retained in the subset.
1423
1424 <DT> <A HREF="cuddAllDet.html#SubsetCountMintermAux" TARGET="MAIN"><CODE>SubsetCountMintermAux()</CODE></A>
1425 <DD> Recursively counts minterms of each node in the DAG.
1426
1427 <DT> <A HREF="cuddAllDet.html#SubsetCountMinterm" TARGET="MAIN"><CODE>SubsetCountMinterm()</CODE></A>
1428 <DD> Counts minterms of each node in the DAG
1429
1430 <DT> <A HREF="cuddAllDet.html#SubsetCountNodesAux" TARGET="MAIN"><CODE>SubsetCountNodesAux()</CODE></A>
1431 <DD> Recursively counts the number of nodes under the dag.
1432   Also counts the number of nodes under the lighter child of
1433   this node.
1434
1435 <DT> <A HREF="cuddAllDet.html#SubsetCountNodes" TARGET="MAIN"><CODE>SubsetCountNodes()</CODE></A>
1436 <DD> Counts the nodes under the current node and its lighter child
1437
1438 <DT> <A HREF="cuddAllDet.html#UAbuildSubset" TARGET="MAIN"><CODE>UAbuildSubset()</CODE></A>
1439 <DD> Builds the subset BDD.
1440
1441 <DT> <A HREF="cuddAllDet.html#UAmarkNodes" TARGET="MAIN"><CODE>UAmarkNodes()</CODE></A>
1442 <DD> Marks nodes for replacement by zero.
1443
1444 <DT> <A HREF="cuddAllDet.html#ZeroCase" TARGET="MAIN"><CODE>ZeroCase()</CODE></A>
1445 <DD> If one child is zero, do explicitly what Restrict does or better
1446
1447 <DT> <A HREF="cuddAllDet.html#addBddDoInterval" TARGET="MAIN"><CODE>addBddDoInterval()</CODE></A>
1448 <DD> Performs the recursive step for Cudd_addBddInterval.
1449
1450 <DT> <A HREF="cuddAllDet.html#addBddDoIthBit" TARGET="MAIN"><CODE>addBddDoIthBit()</CODE></A>
1451 <DD> Performs the recursive step for Cudd_addBddIthBit.
1452
1453 <DT> <A HREF="cuddAllDet.html#addBddDoStrictThreshold" TARGET="MAIN"><CODE>addBddDoStrictThreshold()</CODE></A>
1454 <DD> Performs the recursive step for Cudd_addBddStrictThreshold.
1455
1456 <DT> <A HREF="cuddAllDet.html#addBddDoThreshold" TARGET="MAIN"><CODE>addBddDoThreshold()</CODE></A>
1457 <DD> Performs the recursive step for Cudd_addBddThreshold.
1458
1459 <DT> <A HREF="cuddAllDet.html#addCheckPositiveCube" TARGET="MAIN"><CODE>addCheckPositiveCube()</CODE></A>
1460 <DD> Checks whether cube is an ADD representing the product
1461   of positive literals.
1462
1463 <DT> <A HREF="cuddAllDet.html#addDoIthBit" TARGET="MAIN"><CODE>addDoIthBit()</CODE></A>
1464 <DD> Performs the recursive step for Cudd_addIthBit.
1465
1466 <DT> <A HREF="cuddAllDet.html#addMMRecur" TARGET="MAIN"><CODE>addMMRecur()</CODE></A>
1467 <DD> Performs the recursive step of Cudd_addMatrixMultiply.
1468
1469 <DT> <A HREF="cuddAllDet.html#addMultiplicityGroups" TARGET="MAIN"><CODE>addMultiplicityGroups()</CODE></A>
1470 <DD> Adds multiplicity groups to a ZDD variable group tree.
1471
1472 <DT> <A HREF="cuddAllDet.html#addTriangleRecur" TARGET="MAIN"><CODE>addTriangleRecur()</CODE></A>
1473 <DD> Performs the recursive step of Cudd_addTriangle.
1474
1475 <DT> <A HREF="cuddAllDet.html#addVarToConst" TARGET="MAIN"><CODE>addVarToConst()</CODE></A>
1476 <DD> Replaces variables with constants if possible (part of
1477   canonical form).
1478
1479 <DT> <A HREF="cuddAllDet.html#addWalshInt" TARGET="MAIN"><CODE>addWalshInt()</CODE></A>
1480 <DD> Implements the recursive step of Cudd_addWalsh.
1481
1482 <DT> <A HREF="cuddAllDet.html#array_compare" TARGET="MAIN"><CODE>array_compare()</CODE></A>
1483 <DD> Comparison function for the computed table.
1484
1485 <DT> <A HREF="cuddAllDet.html#array_hash" TARGET="MAIN"><CODE>array_hash()</CODE></A>
1486 <DD> Hash function for the computed table.
1487
1488 <DT> <A HREF="cuddAllDet.html#bddAnnotateMintermCount" TARGET="MAIN"><CODE>bddAnnotateMintermCount()</CODE></A>
1489 <DD> Annotates every node in the BDD node with its minterm count.
1490
1491 <DT> <A HREF="cuddAllDet.html#bddCheckPositiveCube" TARGET="MAIN"><CODE>bddCheckPositiveCube()</CODE></A>
1492 <DD> Checks whether cube is an BDD representing the product of
1493   positive literals.
1494
1495 <DT> <A HREF="cuddAllDet.html#bddCorrelationAux" TARGET="MAIN"><CODE>bddCorrelationAux()</CODE></A>
1496 <DD> Performs the recursive step of Cudd_bddCorrelation.
1497
1498 <DT> <A HREF="cuddAllDet.html#bddCorrelationWeightsAux" TARGET="MAIN"><CODE>bddCorrelationWeightsAux()</CODE></A>
1499 <DD> Performs the recursive step of Cudd_bddCorrelationWeigths.
1500
1501 <DT> <A HREF="cuddAllDet.html#bddFixTree" TARGET="MAIN"><CODE>bddFixTree()</CODE></A>
1502 <DD> Fixes the BDD variable group tree after a shuffle.
1503
1504 <DT> <A HREF="cuddAllDet.html#bddVarToCanonicalSimple" TARGET="MAIN"><CODE>bddVarToCanonicalSimple()</CODE></A>
1505 <DD> Picks unique member from equiv expressions.
1506
1507 <DT> <A HREF="cuddAllDet.html#bddVarToCanonical" TARGET="MAIN"><CODE>bddVarToCanonical()</CODE></A>
1508 <DD> Picks unique member from equiv expressions.
1509
1510 <DT> <A HREF="cuddAllDet.html#bddVarToConst" TARGET="MAIN"><CODE>bddVarToConst()</CODE></A>
1511 <DD> Replaces variables with constants if possible.
1512
1513 <DT> <A HREF="cuddAllDet.html#beforep" TARGET="MAIN"><CODE>beforep()</CODE></A>
1514 <DD> Returns true iff the first argument precedes the second in
1515   the clause order.
1516
1517 <DT> <A HREF="cuddAllDet.html#bitVectorAlloc" TARGET="MAIN"><CODE>bitVectorAlloc()</CODE></A>
1518 <DD> Allocates a bit vector.
1519
1520 <DT> <A HREF="cuddAllDet.html#bitVectorClear" TARGET="MAIN"><CODE>bitVectorClear()</CODE></A>
1521 <DD> Clears a bit vector.
1522
1523 <DT> <A HREF="cuddAllDet.html#bitVectorFree" TARGET="MAIN"><CODE>bitVectorFree()</CODE></A>
1524 <DD> Frees a bit vector.
1525
1526 <DT> <A HREF="cuddAllDet.html#bitVectorRead" TARGET="MAIN"><CODE>bitVectorRead()</CODE></A>
1527 <DD> Returns the i-th entry of a bit vector.
1528
1529 <DT> <A HREF="cuddAllDet.html#bitVectorSet" TARGET="MAIN"><CODE>bitVectorSet()</CODE></A>
1530 <DD> Sets the i-th entry of a bit vector to a value.
1531
1532 <DT> <A HREF="cuddAllDet.html#build_dd" TARGET="MAIN"><CODE>build_dd()</CODE></A>
1533 <DD> Builds a DD from a given order.
1534
1535 <DT> <A HREF="cuddAllDet.html#checkSymmInfo" TARGET="MAIN"><CODE>checkSymmInfo()</CODE></A>
1536 <DD> Check symmetry condition.
1537
1538 <DT> <A HREF="cuddAllDet.html#computeClausesWithUniverse" TARGET="MAIN"><CODE>computeClausesWithUniverse()</CODE></A>
1539 <DD> Computes the two-literal clauses for a node.
1540
1541 <DT> <A HREF="cuddAllDet.html#computeClauses" TARGET="MAIN"><CODE>computeClauses()</CODE></A>
1542 <DD> Computes the two-literal clauses for a node.
1543
1544 <DT> <A HREF="cuddAllDet.html#computeLB" TARGET="MAIN"><CODE>computeLB()</CODE></A>
1545 <DD> Computes a lower bound on the size of a BDD.
1546
1547 <DT> <A HREF="cuddAllDet.html#computeSavings" TARGET="MAIN"><CODE>computeSavings()</CODE></A>
1548 <DD> Counts the nodes that would be eliminated if a given node
1549   were replaced by zero.
1550
1551 <DT> <A HREF="cuddAllDet.html#copyOrder" TARGET="MAIN"><CODE>copyOrder()</CODE></A>
1552 <DD> Copies the current variable order to array.
1553
1554 <DT> <A HREF="cuddAllDet.html#createResult" TARGET="MAIN"><CODE>createResult()</CODE></A>
1555 <DD> Builds a result for cache storage.
1556
1557 <DT> <A HREF="cuddAllDet.html#cuddAddApplyRecur" TARGET="MAIN"><CODE>cuddAddApplyRecur()</CODE></A>
1558 <DD> Performs the recursive step of Cudd_addApply.
1559
1560 <DT> <A HREF="cuddAllDet.html#cuddAddBddDoPattern" TARGET="MAIN"><CODE>cuddAddBddDoPattern()</CODE></A>
1561 <DD> Performs the recursive step for Cudd_addBddPattern.
1562
1563 <DT> <A HREF="cuddAllDet.html#cuddAddCmplRecur" TARGET="MAIN"><CODE>cuddAddCmplRecur()</CODE></A>
1564 <DD> Performs the recursive step of Cudd_addCmpl.
1565
1566 <DT> <A HREF="cuddAllDet.html#cuddAddComposeRecur" TARGET="MAIN"><CODE>cuddAddComposeRecur()</CODE></A>
1567 <DD> Performs the recursive step of Cudd_addCompose.
1568
1569 <DT> <A HREF="cuddAllDet.html#cuddAddConstrainRecur" TARGET="MAIN"><CODE>cuddAddConstrainRecur()</CODE></A>
1570 <DD> Performs the recursive step of Cudd_addConstrain.
1571
1572 <DT> <A HREF="cuddAllDet.html#cuddAddExistAbstractRecur" TARGET="MAIN"><CODE>cuddAddExistAbstractRecur()</CODE></A>
1573 <DD> Performs the recursive step of Cudd_addExistAbstract.
1574
1575 <DT> <A HREF="cuddAllDet.html#cuddAddGeneralVectorComposeRecur" TARGET="MAIN"><CODE>cuddAddGeneralVectorComposeRecur()</CODE></A>
1576 <DD> Performs the recursive step of Cudd_addGeneralVectorCompose.
1577
1578 <DT> <A HREF="cuddAllDet.html#cuddAddIteRecur" TARGET="MAIN"><CODE>cuddAddIteRecur()</CODE></A>
1579 <DD> Implements the recursive step of Cudd_addIte(f,g,h).
1580
1581 <DT> <A HREF="cuddAllDet.html#cuddAddMonadicApplyRecur" TARGET="MAIN"><CODE>cuddAddMonadicApplyRecur()</CODE></A>
1582 <DD> Performs the recursive step of Cudd_addMonadicApply.
1583
1584 <DT> <A HREF="cuddAllDet.html#cuddAddNegateRecur" TARGET="MAIN"><CODE>cuddAddNegateRecur()</CODE></A>
1585 <DD> Implements the recursive step of Cudd_addNegate.
1586
1587 <DT> <A HREF="cuddAllDet.html#cuddAddNonSimComposeRecur" TARGET="MAIN"><CODE>cuddAddNonSimComposeRecur()</CODE></A>
1588 <DD> Performs the recursive step of Cudd_addNonSimCompose.
1589
1590 <DT> <A HREF="cuddAllDet.html#cuddAddOrAbstractRecur" TARGET="MAIN"><CODE>cuddAddOrAbstractRecur()</CODE></A>
1591 <DD> Performs the recursive step of Cudd_addOrAbstract.
1592
1593 <DT> <A HREF="cuddAllDet.html#cuddAddOuterSumRecur" TARGET="MAIN"><CODE>cuddAddOuterSumRecur()</CODE></A>
1594 <DD> Performs the recursive step of Cudd_addOuterSum.
1595
1596 <DT> <A HREF="cuddAllDet.html#cuddAddPermuteRecur" TARGET="MAIN"><CODE>cuddAddPermuteRecur()</CODE></A>
1597 <DD> Implements the recursive step of Cudd_addPermute.
1598
1599 <DT> <A HREF="cuddAllDet.html#cuddAddRestrictRecur" TARGET="MAIN"><CODE>cuddAddRestrictRecur()</CODE></A>
1600 <DD> Performs the recursive step of Cudd_addRestrict.
1601
1602 <DT> <A HREF="cuddAllDet.html#cuddAddRoundOffRecur" TARGET="MAIN"><CODE>cuddAddRoundOffRecur()</CODE></A>
1603 <DD> Implements the recursive step of Cudd_addRoundOff.
1604
1605 <DT> <A HREF="cuddAllDet.html#cuddAddScalarInverseRecur" TARGET="MAIN"><CODE>cuddAddScalarInverseRecur()</CODE></A>
1606 <DD> Performs the recursive step of addScalarInverse.
1607
1608 <DT> <A HREF="cuddAllDet.html#cuddAddUnivAbstractRecur" TARGET="MAIN"><CODE>cuddAddUnivAbstractRecur()</CODE></A>
1609 <DD> Performs the recursive step of Cudd_addUnivAbstract.
1610
1611 <DT> <A HREF="cuddAllDet.html#cuddAddVectorComposeRecur" TARGET="MAIN"><CODE>cuddAddVectorComposeRecur()</CODE></A>
1612 <DD> Performs the recursive step of Cudd_addVectorCompose.
1613
1614 <DT> <A HREF="cuddAllDet.html#cuddAllocNode" TARGET="MAIN"><CODE>cuddAllocNode()</CODE></A>
1615 <DD> Fast storage allocation for DdNodes in the table.
1616
1617 <DT> <A HREF="cuddAllDet.html#cuddAnnealing" TARGET="MAIN"><CODE>cuddAnnealing()</CODE></A>
1618 <DD> Get new variable-order by simulated annealing algorithm.
1619
1620 <DT> <A HREF="cuddAllDet.html#cuddApaCountMintermAux" TARGET="MAIN"><CODE>cuddApaCountMintermAux()</CODE></A>
1621 <DD> Performs the recursive step of Cudd_ApaCountMinterm.
1622
1623 <DT> <A HREF="cuddAllDet.html#cuddApaStCountfree" TARGET="MAIN"><CODE>cuddApaStCountfree()</CODE></A>
1624 <DD> Frees the memory used to store the minterm counts recorded
1625   in the visited table.
1626
1627 <DT> <A HREF="cuddAllDet.html#cuddBddAlignToZdd" TARGET="MAIN"><CODE>cuddBddAlignToZdd()</CODE></A>
1628 <DD> Reorders BDD variables according to the order of the ZDD
1629   variables.
1630
1631 <DT> <A HREF="cuddAllDet.html#cuddBddAndAbstractRecur" TARGET="MAIN"><CODE>cuddBddAndAbstractRecur()</CODE></A>
1632 <DD> Takes the AND of two BDDs and simultaneously abstracts the
1633   variables in cube.
1634
1635 <DT> <A HREF="cuddAllDet.html#cuddBddAndRecur" TARGET="MAIN"><CODE>cuddBddAndRecur()</CODE></A>
1636 <DD> Implements the recursive step of Cudd_bddAnd.
1637
1638 <DT> <A HREF="cuddAllDet.html#cuddBddBooleanDiffRecur" TARGET="MAIN"><CODE>cuddBddBooleanDiffRecur()</CODE></A>
1639 <DD> Performs the recursive steps of Cudd_bddBoleanDiff.
1640
1641 <DT> <A HREF="cuddAllDet.html#cuddBddCharToVect" TARGET="MAIN"><CODE>cuddBddCharToVect()</CODE></A>
1642 <DD> Performs the recursive step of Cudd_bddCharToVect.
1643
1644 <DT> <A HREF="cuddAllDet.html#cuddBddClipAndAbsRecur" TARGET="MAIN"><CODE>cuddBddClipAndAbsRecur()</CODE></A>
1645 <DD> Approximates the AND of two BDDs and simultaneously abstracts the
1646   variables in cube.
1647
1648 <DT> <A HREF="cuddAllDet.html#cuddBddClippingAndAbstract" TARGET="MAIN"><CODE>cuddBddClippingAndAbstract()</CODE></A>
1649 <DD> Approximates the conjunction of two BDDs f and g and
1650   simultaneously abstracts the variables in cube.
1651
1652 <DT> <A HREF="cuddAllDet.html#cuddBddClippingAndRecur" TARGET="MAIN"><CODE>cuddBddClippingAndRecur()</CODE></A>
1653 <DD> Implements the recursive step of Cudd_bddClippingAnd.
1654
1655 <DT> <A HREF="cuddAllDet.html#cuddBddClippingAnd" TARGET="MAIN"><CODE>cuddBddClippingAnd()</CODE></A>
1656 <DD> Approximates the conjunction of two BDDs f and g.
1657
1658 <DT> <A HREF="cuddAllDet.html#cuddBddClosestCube" TARGET="MAIN"><CODE>cuddBddClosestCube()</CODE></A>
1659 <DD> Performs the recursive step of Cudd_bddClosestCube.
1660
1661 <DT> <A HREF="cuddAllDet.html#cuddBddComposeRecur" TARGET="MAIN"><CODE>cuddBddComposeRecur()</CODE></A>
1662 <DD> Performs the recursive step of Cudd_bddCompose.
1663
1664 <DT> <A HREF="cuddAllDet.html#cuddBddConstrainDecomp" TARGET="MAIN"><CODE>cuddBddConstrainDecomp()</CODE></A>
1665 <DD> Performs the recursive step of Cudd_bddConstrainDecomp.
1666
1667 <DT> <A HREF="cuddAllDet.html#cuddBddConstrainRecur" TARGET="MAIN"><CODE>cuddBddConstrainRecur()</CODE></A>
1668 <DD> Performs the recursive step of Cudd_bddConstrain.
1669
1670 <DT> <A HREF="cuddAllDet.html#cuddBddExistAbstractRecur" TARGET="MAIN"><CODE>cuddBddExistAbstractRecur()</CODE></A>
1671 <DD> Performs the recursive steps of Cudd_bddExistAbstract.
1672
1673 <DT> <A HREF="cuddAllDet.html#cuddBddIntersectRecur" TARGET="MAIN"><CODE>cuddBddIntersectRecur()</CODE></A>
1674 <DD> Implements the recursive step of Cudd_bddIntersect.
1675
1676 <DT> <A HREF="cuddAllDet.html#cuddBddIsop" TARGET="MAIN"><CODE>cuddBddIsop()</CODE></A>
1677 <DD> Performs the recursive step of Cudd_bddIsop.
1678
1679 <DT> <A HREF="cuddAllDet.html#cuddBddIteRecur" TARGET="MAIN"><CODE>cuddBddIteRecur()</CODE></A>
1680 <DD> Implements the recursive step of Cudd_bddIte.
1681
1682 <DT> <A HREF="cuddAllDet.html#cuddBddLICBuildResult" TARGET="MAIN"><CODE>cuddBddLICBuildResult()</CODE></A>
1683 <DD> Builds the result of Cudd_bddLICompaction.
1684
1685 <DT> <A HREF="cuddAllDet.html#cuddBddLICMarkEdges" TARGET="MAIN"><CODE>cuddBddLICMarkEdges()</CODE></A>
1686 <DD> Performs the edge marking step of Cudd_bddLICompaction.
1687
1688 <DT> <A HREF="cuddAllDet.html#cuddBddLICompaction" TARGET="MAIN"><CODE>cuddBddLICompaction()</CODE></A>
1689 <DD> Performs safe minimization of a BDD.
1690
1691 <DT> <A HREF="cuddAllDet.html#cuddBddLiteralSetIntersectionRecur" TARGET="MAIN"><CODE>cuddBddLiteralSetIntersectionRecur()</CODE></A>
1692 <DD> Performs the recursive step of
1693   Cudd_bddLiteralSetIntersection.
1694
1695 <DT> <A HREF="cuddAllDet.html#cuddBddMakePrime" TARGET="MAIN"><CODE>cuddBddMakePrime()</CODE></A>
1696 <DD> Performs the recursive step of Cudd_bddMakePrime.
1697
1698 <DT> <A HREF="cuddAllDet.html#cuddBddNPAndRecur" TARGET="MAIN"><CODE>cuddBddNPAndRecur()</CODE></A>
1699 <DD> Implements the recursive step of Cudd_bddAnd.
1700
1701 <DT> <A HREF="cuddAllDet.html#cuddBddPermuteRecur" TARGET="MAIN"><CODE>cuddBddPermuteRecur()</CODE></A>
1702 <DD> Implements the recursive step of Cudd_bddPermute.
1703
1704 <DT> <A HREF="cuddAllDet.html#cuddBddRestrictRecur" TARGET="MAIN"><CODE>cuddBddRestrictRecur()</CODE></A>
1705 <DD> Performs the recursive step of Cudd_bddRestrict.
1706
1707 <DT> <A HREF="cuddAllDet.html#cuddBddSqueeze" TARGET="MAIN"><CODE>cuddBddSqueeze()</CODE></A>
1708 <DD> Performs the recursive step of Cudd_bddSqueeze.
1709
1710 <DT> <A HREF="cuddAllDet.html#cuddBddTransferRecur" TARGET="MAIN"><CODE>cuddBddTransferRecur()</CODE></A>
1711 <DD> Performs the recursive step of Cudd_bddTransfer.
1712
1713 <DT> <A HREF="cuddAllDet.html#cuddBddTransfer" TARGET="MAIN"><CODE>cuddBddTransfer()</CODE></A>
1714 <DD> Convert a BDD from a manager to another one.
1715
1716 <DT> <A HREF="cuddAllDet.html#cuddBddVarMapRecur" TARGET="MAIN"><CODE>cuddBddVarMapRecur()</CODE></A>
1717 <DD> Implements the recursive step of Cudd_bddVarMap.
1718
1719 <DT> <A HREF="cuddAllDet.html#cuddBddVectorComposeRecur" TARGET="MAIN"><CODE>cuddBddVectorComposeRecur()</CODE></A>
1720 <DD> Performs the recursive step of Cudd_bddVectorCompose.
1721
1722 <DT> <A HREF="cuddAllDet.html#cuddBddXorExistAbstractRecur" TARGET="MAIN"><CODE>cuddBddXorExistAbstractRecur()</CODE></A>
1723 <DD> Takes the exclusive OR of two BDDs and simultaneously abstracts the
1724   variables in cube.
1725
1726 <DT> <A HREF="cuddAllDet.html#cuddBddXorRecur" TARGET="MAIN"><CODE>cuddBddXorRecur()</CODE></A>
1727 <DD> Implements the recursive step of Cudd_bddXor.
1728
1729 <DT> <A HREF="cuddAllDet.html#cuddBiasedUnderApprox" TARGET="MAIN"><CODE>cuddBiasedUnderApprox()</CODE></A>
1730 <DD> Applies the biased remapping underappoximation algorithm.
1731
1732 <DT> <A HREF="cuddAllDet.html#cuddCProjectionRecur" TARGET="MAIN"><CODE>cuddCProjectionRecur()</CODE></A>
1733 <DD> Performs the recursive step of Cudd_CProjection.
1734
1735 <DT> <A HREF="cuddAllDet.html#cuddCacheFlush" TARGET="MAIN"><CODE>cuddCacheFlush()</CODE></A>
1736 <DD> Flushes the cache.
1737
1738 <DT> <A HREF="cuddAllDet.html#cuddCacheInsert1" TARGET="MAIN"><CODE>cuddCacheInsert1()</CODE></A>
1739 <DD> Inserts a result in the cache for a function with two
1740   operands.
1741
1742 <DT> <A HREF="cuddAllDet.html#cuddCacheInsert2" TARGET="MAIN"><CODE>cuddCacheInsert2()</CODE></A>
1743 <DD> Inserts a result in the cache for a function with two
1744   operands.
1745
1746 <DT> <A HREF="cuddAllDet.html#cuddCacheInsert" TARGET="MAIN"><CODE>cuddCacheInsert()</CODE></A>
1747 <DD> Inserts a result in the cache.
1748
1749 <DT> <A HREF="cuddAllDet.html#cuddCacheLookup1Zdd" TARGET="MAIN"><CODE>cuddCacheLookup1Zdd()</CODE></A>
1750 <DD> Looks up in the cache for the result of op applied to f.
1751
1752 <DT> <A HREF="cuddAllDet.html#cuddCacheLookup1" TARGET="MAIN"><CODE>cuddCacheLookup1()</CODE></A>
1753 <DD> Looks up in the cache for the result of op applied to f.
1754
1755 <DT> <A HREF="cuddAllDet.html#cuddCacheLookup2Zdd" TARGET="MAIN"><CODE>cuddCacheLookup2Zdd()</CODE></A>
1756 <DD> Looks up in the cache for the result of op applied to f
1757   and g.
1758
1759 <DT> <A HREF="cuddAllDet.html#cuddCacheLookup2" TARGET="MAIN"><CODE>cuddCacheLookup2()</CODE></A>
1760 <DD> Looks up in the cache for the result of op applied to f
1761   and g.
1762
1763 <DT> <A HREF="cuddAllDet.html#cuddCacheLookupZdd" TARGET="MAIN"><CODE>cuddCacheLookupZdd()</CODE></A>
1764 <DD> Looks up in the cache for the result of op applied to f,
1765   g, and h.
1766
1767 <DT> <A HREF="cuddAllDet.html#cuddCacheLookup" TARGET="MAIN"><CODE>cuddCacheLookup()</CODE></A>
1768 <DD> Looks up in the cache for the result of op applied to f,
1769   g, and h.
1770
1771 <DT> <A HREF="cuddAllDet.html#cuddCacheProfile" TARGET="MAIN"><CODE>cuddCacheProfile()</CODE></A>
1772 <DD> Computes and prints a profile of the cache usage.
1773
1774 <DT> <A HREF="cuddAllDet.html#cuddCacheResize" TARGET="MAIN"><CODE>cuddCacheResize()</CODE></A>
1775 <DD> Resizes the cache.
1776
1777 <DT> <A HREF="cuddAllDet.html#cuddCheckCollisionOrdering" TARGET="MAIN"><CODE>cuddCheckCollisionOrdering()</CODE></A>
1778 <DD> Checks whether a collision list is ordered.
1779
1780 <DT> <A HREF="cuddAllDet.html#cuddCheckCube" TARGET="MAIN"><CODE>cuddCheckCube()</CODE></A>
1781 <DD> Checks whether g is the BDD of a cube.
1782
1783 <DT> <A HREF="cuddAllDet.html#cuddClearDeathRow" TARGET="MAIN"><CODE>cuddClearDeathRow()</CODE></A>
1784 <DD> Clears the death row.
1785
1786 <DT> <A HREF="cuddAllDet.html#cuddCofactorRecur" TARGET="MAIN"><CODE>cuddCofactorRecur()</CODE></A>
1787 <DD> Performs the recursive step of Cudd_Cofactor.
1788
1789 <DT> <A HREF="cuddAllDet.html#cuddCollectNodes" TARGET="MAIN"><CODE>cuddCollectNodes()</CODE></A>
1790 <DD> Recursively collects all the nodes of a DD in a symbol
1791   table.
1792
1793 <DT> <A HREF="cuddAllDet.html#cuddComputeFloorLog2" TARGET="MAIN"><CODE>cuddComputeFloorLog2()</CODE></A>
1794 <DD> Returns the floor of the logarithm to the base 2.
1795
1796 <DT> <A HREF="cuddAllDet.html#cuddConjunctsAux" TARGET="MAIN"><CODE>cuddConjunctsAux()</CODE></A>
1797 <DD> Procedure to compute two conjunctive factors of f and place in *c1 and *c2.
1798
1799 <DT> <A HREF="cuddAllDet.html#cuddConstantLookup" TARGET="MAIN"><CODE>cuddConstantLookup()</CODE></A>
1800 <DD> Looks up in the cache for the result of op applied to f,
1801   g, and h.
1802
1803 <DT> <A HREF="cuddAllDet.html#cuddDestroySubtables" TARGET="MAIN"><CODE>cuddDestroySubtables()</CODE></A>
1804 <DD> Destroys the n most recently created subtables in a unique table.
1805
1806 <DT> <A HREF="cuddAllDet.html#cuddDoRebalance" TARGET="MAIN"><CODE>cuddDoRebalance()</CODE></A>
1807 <DD> Rebalances a red/black tree.
1808
1809 <DT> <A HREF="cuddAllDet.html#cuddDynamicAllocNode" TARGET="MAIN"><CODE>cuddDynamicAllocNode()</CODE></A>
1810 <DD> Dynamically allocates a Node.
1811
1812 <DT> <A HREF="cuddAllDet.html#cuddEstimateCofactorSimple" TARGET="MAIN"><CODE>cuddEstimateCofactorSimple()</CODE></A>
1813 <DD> Performs the recursive step of Cudd_CofactorEstimateSimple.
1814
1815 <DT> <A HREF="cuddAllDet.html#cuddEstimateCofactor" TARGET="MAIN"><CODE>cuddEstimateCofactor()</CODE></A>
1816 <DD> Performs the recursive step of Cudd_CofactorEstimate.
1817
1818 <DT> <A HREF="cuddAllDet.html#cuddExact" TARGET="MAIN"><CODE>cuddExact()</CODE></A>
1819 <DD> Exact variable ordering algorithm.
1820
1821 <DT> <A HREF="cuddAllDet.html#cuddFindParent" TARGET="MAIN"><CODE>cuddFindParent()</CODE></A>
1822 <DD> Searches the subtables above node for a parent.
1823
1824 <DT> <A HREF="cuddAllDet.html#cuddFreeTable" TARGET="MAIN"><CODE>cuddFreeTable()</CODE></A>
1825 <DD> Frees the resources associated to a unique table.
1826
1827 <DT> <A HREF="cuddAllDet.html#cuddGarbageCollect" TARGET="MAIN"><CODE>cuddGarbageCollect()</CODE></A>
1828 <DD> Performs garbage collection on the unique tables.
1829
1830 <DT> <A HREF="cuddAllDet.html#cuddGa" TARGET="MAIN"><CODE>cuddGa()</CODE></A>
1831 <DD> Genetic algorithm for DD reordering.
1832
1833 <DT> <A HREF="cuddAllDet.html#cuddGetBranches" TARGET="MAIN"><CODE>cuddGetBranches()</CODE></A>
1834 <DD> Computes the children of g.
1835
1836 <DT> <A HREF="cuddAllDet.html#cuddHashTableAlloc" TARGET="MAIN"><CODE>cuddHashTableAlloc()</CODE></A>
1837 <DD> Fast storage allocation for items in a hash table.
1838
1839 <DT> <A HREF="cuddAllDet.html#cuddHashTableInit" TARGET="MAIN"><CODE>cuddHashTableInit()</CODE></A>
1840 <DD> Initializes a hash table.
1841
1842 <DT> <A HREF="cuddAllDet.html#cuddHashTableInsert1" TARGET="MAIN"><CODE>cuddHashTableInsert1()</CODE></A>
1843 <DD> Inserts an item in a hash table.
1844
1845 <DT> <A HREF="cuddAllDet.html#cuddHashTableInsert2" TARGET="MAIN"><CODE>cuddHashTableInsert2()</CODE></A>
1846 <DD> Inserts an item in a hash table.
1847
1848 <DT> <A HREF="cuddAllDet.html#cuddHashTableInsert3" TARGET="MAIN"><CODE>cuddHashTableInsert3()</CODE></A>
1849 <DD> Inserts an item in a hash table.
1850
1851 <DT> <A HREF="cuddAllDet.html#cuddHashTableInsert" TARGET="MAIN"><CODE>cuddHashTableInsert()</CODE></A>
1852 <DD> Inserts an item in a hash table.
1853
1854 <DT> <A HREF="cuddAllDet.html#cuddHashTableLookup1" TARGET="MAIN"><CODE>cuddHashTableLookup1()</CODE></A>
1855 <DD> Looks up a key consisting of one pointer in a hash table.
1856
1857 <DT> <A HREF="cuddAllDet.html#cuddHashTableLookup2" TARGET="MAIN"><CODE>cuddHashTableLookup2()</CODE></A>
1858 <DD> Looks up a key consisting of two pointers in a hash table.
1859
1860 <DT> <A HREF="cuddAllDet.html#cuddHashTableLookup3" TARGET="MAIN"><CODE>cuddHashTableLookup3()</CODE></A>
1861 <DD> Looks up a key consisting of three pointers in a hash table.
1862
1863 <DT> <A HREF="cuddAllDet.html#cuddHashTableLookup" TARGET="MAIN"><CODE>cuddHashTableLookup()</CODE></A>
1864 <DD> Looks up a key in a hash table.
1865
1866 <DT> <A HREF="cuddAllDet.html#cuddHashTableQuit" TARGET="MAIN"><CODE>cuddHashTableQuit()</CODE></A>
1867 <DD> Shuts down a hash table.
1868
1869 <DT> <A HREF="cuddAllDet.html#cuddHashTableResize" TARGET="MAIN"><CODE>cuddHashTableResize()</CODE></A>
1870 <DD> Resizes a hash table.
1871
1872 <DT> <A HREF="cuddAllDet.html#cuddHeapProfile" TARGET="MAIN"><CODE>cuddHeapProfile()</CODE></A>
1873 <DD> Prints information about the heap.
1874
1875 <DT> <A HREF="cuddAllDet.html#cuddInitCache" TARGET="MAIN"><CODE>cuddInitCache()</CODE></A>
1876 <DD> Initializes the computed table.
1877
1878 <DT> <A HREF="cuddAllDet.html#cuddInitInteract" TARGET="MAIN"><CODE>cuddInitInteract()</CODE></A>
1879 <DD> Initializes the interaction matrix.
1880
1881 <DT> <A HREF="cuddAllDet.html#cuddInitLinear" TARGET="MAIN"><CODE>cuddInitLinear()</CODE></A>
1882 <DD> Initializes the linear transform matrix.
1883
1884 <DT> <A HREF="cuddAllDet.html#cuddInitTable" TARGET="MAIN"><CODE>cuddInitTable()</CODE></A>
1885 <DD> Creates and initializes the unique table.
1886
1887 <DT> <A HREF="cuddAllDet.html#cuddInsertSubtables" TARGET="MAIN"><CODE>cuddInsertSubtables()</CODE></A>
1888 <DD> Inserts n new subtables in a unique table at level.
1889
1890 <DT> <A HREF="cuddAllDet.html#cuddIsInDeathRow" TARGET="MAIN"><CODE>cuddIsInDeathRow()</CODE></A>
1891 <DD> Checks whether a node is in the death row.
1892
1893 <DT> <A HREF="cuddAllDet.html#cuddLevelQueueDequeue" TARGET="MAIN"><CODE>cuddLevelQueueDequeue()</CODE></A>
1894 <DD> Remove an item from the front of a level queue.
1895
1896 <DT> <A HREF="cuddAllDet.html#cuddLevelQueueEnqueue" TARGET="MAIN"><CODE>cuddLevelQueueEnqueue()</CODE></A>
1897 <DD> Inserts a new key in a level queue.
1898
1899 <DT> <A HREF="cuddAllDet.html#cuddLevelQueueInit" TARGET="MAIN"><CODE>cuddLevelQueueInit()</CODE></A>
1900 <DD> Initializes a level queue.
1901
1902 <DT> <A HREF="cuddAllDet.html#cuddLevelQueueQuit" TARGET="MAIN"><CODE>cuddLevelQueueQuit()</CODE></A>
1903 <DD> Shuts down a level queue.
1904
1905 <DT> <A HREF="cuddAllDet.html#cuddLinearAndSifting" TARGET="MAIN"><CODE>cuddLinearAndSifting()</CODE></A>
1906 <DD> BDD reduction based on combination of sifting and linear
1907   transformations.
1908
1909 <DT> <A HREF="cuddAllDet.html#cuddLinearInPlace" TARGET="MAIN"><CODE>cuddLinearInPlace()</CODE></A>
1910 <DD> Linearly combines two adjacent variables.
1911
1912 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheAddToList" TARGET="MAIN"><CODE>cuddLocalCacheAddToList()</CODE></A>
1913 <DD> Inserts a local cache in the manager list.
1914
1915 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheClearAll" TARGET="MAIN"><CODE>cuddLocalCacheClearAll()</CODE></A>
1916 <DD> Clears the local caches of a manager.
1917
1918 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheClearDead" TARGET="MAIN"><CODE>cuddLocalCacheClearDead()</CODE></A>
1919 <DD> Clears the dead entries of the local caches of a manager.
1920
1921 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheInit" TARGET="MAIN"><CODE>cuddLocalCacheInit()</CODE></A>
1922 <DD> Initializes a local computed table.
1923
1924 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheInsert" TARGET="MAIN"><CODE>cuddLocalCacheInsert()</CODE></A>
1925 <DD> Inserts a result in a local cache.
1926
1927 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheLookup" TARGET="MAIN"><CODE>cuddLocalCacheLookup()</CODE></A>
1928 <DD> Looks up in a local cache.
1929
1930 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheProfile" TARGET="MAIN"><CODE>cuddLocalCacheProfile()</CODE></A>
1931 <DD> Computes and prints a profile of a local cache usage.
1932
1933 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheQuit" TARGET="MAIN"><CODE>cuddLocalCacheQuit()</CODE></A>
1934 <DD> Shuts down a local computed table.
1935
1936 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheRemoveFromList" TARGET="MAIN"><CODE>cuddLocalCacheRemoveFromList()</CODE></A>
1937 <DD> Removes a local cache from the manager list.
1938
1939 <DT> <A HREF="cuddAllDet.html#cuddLocalCacheResize" TARGET="MAIN"><CODE>cuddLocalCacheResize()</CODE></A>
1940 <DD> Resizes a local cache.
1941
1942 <DT> <A HREF="cuddAllDet.html#cuddMakeBddFromZddCover" TARGET="MAIN"><CODE>cuddMakeBddFromZddCover()</CODE></A>
1943 <DD> Converts a ZDD cover to a BDD graph.
1944
1945 <DT> <A HREF="cuddAllDet.html#cuddMinHammingDistRecur" TARGET="MAIN"><CODE>cuddMinHammingDistRecur()</CODE></A>
1946 <DD> Performs the recursive step of Cudd_MinHammingDist.
1947
1948 <DT> <A HREF="cuddAllDet.html#cuddNextHigh" TARGET="MAIN"><CODE>cuddNextHigh()</CODE></A>
1949 <DD> Finds the next subtable with a larger index.
1950
1951 <DT> <A HREF="cuddAllDet.html#cuddNextLow" TARGET="MAIN"><CODE>cuddNextLow()</CODE></A>
1952 <DD> Finds the next subtable with a smaller index.
1953
1954 <DT> <A HREF="cuddAllDet.html#cuddNodeArrayRecur" TARGET="MAIN"><CODE>cuddNodeArrayRecur()</CODE></A>
1955 <DD> Performs the recursive step of cuddNodeArray.
1956
1957 <DT> <A HREF="cuddAllDet.html#cuddNodeArray" TARGET="MAIN"><CODE>cuddNodeArray()</CODE></A>
1958 <DD> Recursively collects all the nodes of a DD in an array.
1959
1960 <DT> <A HREF="cuddAllDet.html#cuddOrderedInsert" TARGET="MAIN"><CODE>cuddOrderedInsert()</CODE></A>
1961 <DD> Inserts a DdNode in a red/black search tree.
1962
1963 <DT> <A HREF="cuddAllDet.html#cuddOrderedThread" TARGET="MAIN"><CODE>cuddOrderedThread()</CODE></A>
1964 <DD> Threads all the nodes of a search tree into a linear list.
1965
1966 <DT> <A HREF="cuddAllDet.html#cuddPrintNode" TARGET="MAIN"><CODE>cuddPrintNode()</CODE></A>
1967 <DD> Prints out information on a node.
1968
1969 <DT> <A HREF="cuddAllDet.html#cuddPrintVarGroups" TARGET="MAIN"><CODE>cuddPrintVarGroups()</CODE></A>
1970 <DD> Prints the variable groups as a parenthesized list.
1971
1972 <DT> <A HREF="cuddAllDet.html#cuddP" TARGET="MAIN"><CODE>cuddP()</CODE></A>
1973 <DD> Prints a DD to the standard output. One line per node is
1974   printed.
1975
1976 <DT> <A HREF="cuddAllDet.html#cuddReclaimZdd" TARGET="MAIN"><CODE>cuddReclaimZdd()</CODE></A>
1977 <DD> Brings children of a dead ZDD node back.
1978
1979 <DT> <A HREF="cuddAllDet.html#cuddReclaim" TARGET="MAIN"><CODE>cuddReclaim()</CODE></A>
1980 <DD> Brings children of a dead node back.
1981
1982 <DT> <A HREF="cuddAllDet.html#cuddRehash" TARGET="MAIN"><CODE>cuddRehash()</CODE></A>
1983 <DD> Rehashes a unique subtable.
1984
1985 <DT> <A HREF="cuddAllDet.html#cuddRemapUnderApprox" TARGET="MAIN"><CODE>cuddRemapUnderApprox()</CODE></A>
1986 <DD> Applies the remapping underappoximation algorithm.
1987
1988 <DT> <A HREF="cuddAllDet.html#cuddResizeLinear" TARGET="MAIN"><CODE>cuddResizeLinear()</CODE></A>
1989 <DD> Resizes the linear transform matrix.
1990
1991 <DT> <A HREF="cuddAllDet.html#cuddResizeTableZdd" TARGET="MAIN"><CODE>cuddResizeTableZdd()</CODE></A>
1992 <DD> Increases the number of ZDD subtables in a unique table so
1993   that it meets or exceeds index.
1994
1995 <DT> <A HREF="cuddAllDet.html#cuddRotateLeft" TARGET="MAIN"><CODE>cuddRotateLeft()</CODE></A>
1996 <DD> Performs the left rotation for red/black trees.
1997
1998 <DT> <A HREF="cuddAllDet.html#cuddRotateRight" TARGET="MAIN"><CODE>cuddRotateRight()</CODE></A>
1999 <DD> Performs the right rotation for red/black trees.
2000
2001 <DT> <A HREF="cuddAllDet.html#cuddSetInteract" TARGET="MAIN"><CODE>cuddSetInteract()</CODE></A>
2002 <DD> Set interaction matrix entries.
2003
2004 <DT> <A HREF="cuddAllDet.html#cuddShrinkDeathRow" TARGET="MAIN"><CODE>cuddShrinkDeathRow()</CODE></A>
2005 <DD> Shrinks the death row.
2006
2007 <DT> <A HREF="cuddAllDet.html#cuddShrinkSubtable" TARGET="MAIN"><CODE>cuddShrinkSubtable()</CODE></A>
2008 <DD> Shrinks a subtable.
2009
2010 <DT> <A HREF="cuddAllDet.html#cuddSifting" TARGET="MAIN"><CODE>cuddSifting()</CODE></A>
2011 <DD> Implementation of Rudell's sifting algorithm.
2012
2013 <DT> <A HREF="cuddAllDet.html#cuddSlowTableGrowth" TARGET="MAIN"><CODE>cuddSlowTableGrowth()</CODE></A>
2014 <DD> Adjusts parameters of a table to slow down its growth.
2015
2016 <DT> <A HREF="cuddAllDet.html#cuddSolveEqnRecur" TARGET="MAIN"><CODE>cuddSolveEqnRecur()</CODE></A>
2017 <DD> Implements the recursive step of Cudd_SolveEqn.
2018
2019 <DT> <A HREF="cuddAllDet.html#cuddSplitSetRecur" TARGET="MAIN"><CODE>cuddSplitSetRecur()</CODE></A>
2020 <DD> Implements the recursive step of Cudd_SplitSet.
2021
2022 <DT> <A HREF="cuddAllDet.html#cuddStCountfree" TARGET="MAIN"><CODE>cuddStCountfree()</CODE></A>
2023 <DD> Frees the memory used to store the minterm counts recorded
2024   in the visited table.
2025
2026 <DT> <A HREF="cuddAllDet.html#cuddSubsetHeavyBranch" TARGET="MAIN"><CODE>cuddSubsetHeavyBranch()</CODE></A>
2027 <DD> The main procedure that returns a subset by choosing the heavier
2028   branch in the BDD.
2029
2030 <DT> <A HREF="cuddAllDet.html#cuddSubsetShortPaths" TARGET="MAIN"><CODE>cuddSubsetShortPaths()</CODE></A>
2031 <DD> The outermost procedure to return a subset of the given BDD
2032   with the shortest path lengths.
2033
2034 <DT> <A HREF="cuddAllDet.html#cuddSwapInPlace" TARGET="MAIN"><CODE>cuddSwapInPlace()</CODE></A>
2035 <DD> Swaps two adjacent variables.
2036
2037 <DT> <A HREF="cuddAllDet.html#cuddSwapping" TARGET="MAIN"><CODE>cuddSwapping()</CODE></A>
2038 <DD> Reorders variables by a sequence of (non-adjacent) swaps.
2039
2040 <DT> <A HREF="cuddAllDet.html#cuddSymmCheck" TARGET="MAIN"><CODE>cuddSymmCheck()</CODE></A>
2041 <DD> Checks for symmetry of x and y.
2042
2043 <DT> <A HREF="cuddAllDet.html#cuddSymmSiftingConv" TARGET="MAIN"><CODE>cuddSymmSiftingConv()</CODE></A>
2044 <DD> Symmetric sifting to convergence algorithm.
2045
2046 <DT> <A HREF="cuddAllDet.html#cuddSymmSifting" TARGET="MAIN"><CODE>cuddSymmSifting()</CODE></A>
2047 <DD> Symmetric sifting algorithm.
2048
2049 <DT> <A HREF="cuddAllDet.html#cuddTestInteract" TARGET="MAIN"><CODE>cuddTestInteract()</CODE></A>
2050 <DD> Test interaction matrix entries.
2051
2052 <DT> <A HREF="cuddAllDet.html#cuddTimesInDeathRow" TARGET="MAIN"><CODE>cuddTimesInDeathRow()</CODE></A>
2053 <DD> Counts how many times a node is in the death row.
2054
2055 <DT> <A HREF="cuddAllDet.html#cuddTreeSifting" TARGET="MAIN"><CODE>cuddTreeSifting()</CODE></A>
2056 <DD> Tree sifting algorithm.
2057
2058 <DT> <A HREF="cuddAllDet.html#cuddUnderApprox" TARGET="MAIN"><CODE>cuddUnderApprox()</CODE></A>
2059 <DD> Applies Tom Shiple's underappoximation algorithm.
2060
2061 <DT> <A HREF="cuddAllDet.html#cuddUniqueConst" TARGET="MAIN"><CODE>cuddUniqueConst()</CODE></A>
2062 <DD> Checks the unique table for the existence of a constant node.
2063
2064 <DT> <A HREF="cuddAllDet.html#cuddUniqueInterIVO" TARGET="MAIN"><CODE>cuddUniqueInterIVO()</CODE></A>
2065 <DD> Wrapper for cuddUniqueInter that is independent of variable
2066   ordering.
2067
2068 <DT> <A HREF="cuddAllDet.html#cuddUniqueInterZdd" TARGET="MAIN"><CODE>cuddUniqueInterZdd()</CODE></A>
2069 <DD> Checks the unique table for the existence of an internal
2070   ZDD node.
2071
2072 <DT> <A HREF="cuddAllDet.html#cuddUniqueInter" TARGET="MAIN"><CODE>cuddUniqueInter()</CODE></A>
2073 <DD> Checks the unique table for the existence of an internal node.
2074
2075 <DT> <A HREF="cuddAllDet.html#cuddUniqueLookup" TARGET="MAIN"><CODE>cuddUniqueLookup()</CODE></A>
2076 <DD> Checks the unique table for the existence of an internal node.
2077
2078 <DT> <A HREF="cuddAllDet.html#cuddUpdateInteractionMatrix" TARGET="MAIN"><CODE>cuddUpdateInteractionMatrix()</CODE></A>
2079 <DD> Updates the interaction matrix.
2080
2081 <DT> <A HREF="cuddAllDet.html#cuddVerifySol" TARGET="MAIN"><CODE>cuddVerifySol()</CODE></A>
2082 <DD> Implements the recursive step of Cudd_VerifySol.
2083
2084 <DT> <A HREF="cuddAllDet.html#cuddWindowReorder" TARGET="MAIN"><CODE>cuddWindowReorder()</CODE></A>
2085 <DD> Reorders by applying the method of the sliding window.
2086
2087 <DT> <A HREF="cuddAllDet.html#cuddXorLinear" TARGET="MAIN"><CODE>cuddXorLinear()</CODE></A>
2088 <DD> XORs two rows of the linear transform matrix.
2089
2090 <DT> <A HREF="cuddAllDet.html#cuddZddAlignToBdd" TARGET="MAIN"><CODE>cuddZddAlignToBdd()</CODE></A>
2091 <DD> Reorders ZDD variables according to the order of the BDD
2092   variables.
2093
2094 <DT> <A HREF="cuddAllDet.html#cuddZddChangeAux" TARGET="MAIN"><CODE>cuddZddChangeAux()</CODE></A>
2095 <DD> Performs the recursive step of Cudd_zddChange.
2096
2097 <DT> <A HREF="cuddAllDet.html#cuddZddChange" TARGET="MAIN"><CODE>cuddZddChange()</CODE></A>
2098 <DD> Substitutes a variable with its complement in a ZDD.
2099
2100 <DT> <A HREF="cuddAllDet.html#cuddZddComplement" TARGET="MAIN"><CODE>cuddZddComplement()</CODE></A>
2101 <DD> Computes a complement of a ZDD node.
2102
2103 <DT> <A HREF="cuddAllDet.html#cuddZddCountDoubleStep" TARGET="MAIN"><CODE>cuddZddCountDoubleStep()</CODE></A>
2104 <DD> Performs the recursive step of Cudd_zddCountDouble.
2105
2106 <DT> <A HREF="cuddAllDet.html#cuddZddCountStep" TARGET="MAIN"><CODE>cuddZddCountStep()</CODE></A>
2107 <DD> Performs the recursive step of Cudd_zddCount.
2108
2109 <DT> <A HREF="cuddAllDet.html#cuddZddDagInt" TARGET="MAIN"><CODE>cuddZddDagInt()</CODE></A>
2110 <DD> Performs the recursive step of Cudd_zddDagSize.
2111
2112 <DT> <A HREF="cuddAllDet.html#cuddZddDiff" TARGET="MAIN"><CODE>cuddZddDiff()</CODE></A>
2113 <DD> Performs the recursive step of Cudd_zddDiff.
2114
2115 <DT> <A HREF="cuddAllDet.html#cuddZddDivideF" TARGET="MAIN"><CODE>cuddZddDivideF()</CODE></A>
2116 <DD> Performs the recursive step of Cudd_zddDivideF.
2117
2118 <DT> <A HREF="cuddAllDet.html#cuddZddDivide" TARGET="MAIN"><CODE>cuddZddDivide()</CODE></A>
2119 <DD> Performs the recursive step of Cudd_zddDivide.
2120
2121 <DT> <A HREF="cuddAllDet.html#cuddZddFreeUniv" TARGET="MAIN"><CODE>cuddZddFreeUniv()</CODE></A>
2122 <DD> Frees the ZDD universe.
2123
2124 <DT> <A HREF="cuddAllDet.html#cuddZddGetCofactors2" TARGET="MAIN"><CODE>cuddZddGetCofactors2()</CODE></A>
2125 <DD> Computes the two-way decomposition of f w.r.t. v.
2126
2127 <DT> <A HREF="cuddAllDet.html#cuddZddGetCofactors3" TARGET="MAIN"><CODE>cuddZddGetCofactors3()</CODE></A>
2128 <DD> Computes the three-way decomposition of f w.r.t. v.
2129
2130 <DT> <A HREF="cuddAllDet.html#cuddZddGetNegVarIndex" TARGET="MAIN"><CODE>cuddZddGetNegVarIndex()</CODE></A>
2131 <DD> Returns the index of negative ZDD variable.
2132
2133 <DT> <A HREF="cuddAllDet.html#cuddZddGetNegVarLevel" TARGET="MAIN"><CODE>cuddZddGetNegVarLevel()</CODE></A>
2134 <DD> Returns the level of negative ZDD variable.
2135
2136 <DT> <A HREF="cuddAllDet.html#cuddZddGetNodeIVO" TARGET="MAIN"><CODE>cuddZddGetNodeIVO()</CODE></A>
2137 <DD> Wrapper for cuddUniqueInterZdd that is independent of variable
2138   ordering.
2139
2140 <DT> <A HREF="cuddAllDet.html#cuddZddGetNode" TARGET="MAIN"><CODE>cuddZddGetNode()</CODE></A>
2141 <DD> Wrapper for cuddUniqueInterZdd.
2142
2143 <DT> <A HREF="cuddAllDet.html#cuddZddGetPosVarIndex" TARGET="MAIN"><CODE>cuddZddGetPosVarIndex()</CODE></A>
2144 <DD> Returns the index of positive ZDD variable.
2145
2146 <DT> <A HREF="cuddAllDet.html#cuddZddGetPosVarLevel" TARGET="MAIN"><CODE>cuddZddGetPosVarLevel()</CODE></A>
2147 <DD> Returns the level of positive ZDD variable.
2148
2149 <DT> <A HREF="cuddAllDet.html#cuddZddInitUniv" TARGET="MAIN"><CODE>cuddZddInitUniv()</CODE></A>
2150 <DD> Initializes the ZDD universe.
2151
2152 <DT> <A HREF="cuddAllDet.html#cuddZddIntersect" TARGET="MAIN"><CODE>cuddZddIntersect()</CODE></A>
2153 <DD> Performs the recursive step of Cudd_zddIntersect.
2154
2155 <DT> <A HREF="cuddAllDet.html#cuddZddIsop" TARGET="MAIN"><CODE>cuddZddIsop()</CODE></A>
2156 <DD> Performs the recursive step of Cudd_zddIsop.
2157
2158 <DT> <A HREF="cuddAllDet.html#cuddZddIte" TARGET="MAIN"><CODE>cuddZddIte()</CODE></A>
2159 <DD> Performs the recursive step of Cudd_zddIte.
2160
2161 <DT> <A HREF="cuddAllDet.html#cuddZddLinearAux" TARGET="MAIN"><CODE>cuddZddLinearAux()</CODE></A>
2162 <DD> Given xLow <= x <= xHigh moves x up and down between the
2163   boundaries.
2164
2165 <DT> <A HREF="cuddAllDet.html#cuddZddLinearBackward" TARGET="MAIN"><CODE>cuddZddLinearBackward()</CODE></A>
2166 <DD> Given a set of moves, returns the ZDD heap to the position
2167   giving the minimum size.
2168
2169 <DT> <A HREF="cuddAllDet.html#cuddZddLinearDown" TARGET="MAIN"><CODE>cuddZddLinearDown()</CODE></A>
2170 <DD> Sifts a variable down and applies the XOR transformation.
2171
2172 <DT> <A HREF="cuddAllDet.html#cuddZddLinearInPlace" TARGET="MAIN"><CODE>cuddZddLinearInPlace()</CODE></A>
2173 <DD> Linearly combines two adjacent variables.
2174
2175 <DT> <A HREF="cuddAllDet.html#cuddZddLinearSifting" TARGET="MAIN"><CODE>cuddZddLinearSifting()</CODE></A>
2176 <DD> Implementation of the linear sifting algorithm for ZDDs.
2177
2178 <DT> <A HREF="cuddAllDet.html#cuddZddLinearUp" TARGET="MAIN"><CODE>cuddZddLinearUp()</CODE></A>
2179 <DD> Sifts a variable up applying the XOR transformation.
2180
2181 <DT> <A HREF="cuddAllDet.html#cuddZddNextHigh" TARGET="MAIN"><CODE>cuddZddNextHigh()</CODE></A>
2182 <DD> Finds the next subtable with a larger index.
2183
2184 <DT> <A HREF="cuddAllDet.html#cuddZddNextLow" TARGET="MAIN"><CODE>cuddZddNextLow()</CODE></A>
2185 <DD> Finds the next subtable with a smaller index.
2186
2187 <DT> <A HREF="cuddAllDet.html#cuddZddProduct" TARGET="MAIN"><CODE>cuddZddProduct()</CODE></A>
2188 <DD> Performs the recursive step of Cudd_zddProduct.
2189
2190 <DT> <A HREF="cuddAllDet.html#cuddZddP" TARGET="MAIN"><CODE>cuddZddP()</CODE></A>
2191 <DD> Prints a ZDD to the standard output. One line per node is
2192   printed.
2193
2194 <DT> <A HREF="cuddAllDet.html#cuddZddSiftingAux" TARGET="MAIN"><CODE>cuddZddSiftingAux()</CODE></A>
2195 <DD> Given xLow <= x <= xHigh moves x up and down between the
2196   boundaries.
2197
2198 <DT> <A HREF="cuddAllDet.html#cuddZddSiftingBackward" TARGET="MAIN"><CODE>cuddZddSiftingBackward()</CODE></A>
2199 <DD> Given a set of moves, returns the ZDD heap to the position
2200   giving the minimum size.
2201
2202 <DT> <A HREF="cuddAllDet.html#cuddZddSiftingDown" TARGET="MAIN"><CODE>cuddZddSiftingDown()</CODE></A>
2203 <DD> Sifts a variable down.
2204
2205 <DT> <A HREF="cuddAllDet.html#cuddZddSiftingUp" TARGET="MAIN"><CODE>cuddZddSiftingUp()</CODE></A>
2206 <DD> Sifts a variable up.
2207
2208 <DT> <A HREF="cuddAllDet.html#cuddZddSifting" TARGET="MAIN"><CODE>cuddZddSifting()</CODE></A>
2209 <DD> Implementation of Rudell's sifting algorithm.
2210
2211 <DT> <A HREF="cuddAllDet.html#cuddZddSubset0" TARGET="MAIN"><CODE>cuddZddSubset0()</CODE></A>
2212 <DD> Computes the negative cofactor of a ZDD w.r.t. a variable.
2213
2214 <DT> <A HREF="cuddAllDet.html#cuddZddSubset1" TARGET="MAIN"><CODE>cuddZddSubset1()</CODE></A>
2215 <DD> Computes the positive cofactor of a ZDD w.r.t. a variable.
2216
2217 <DT> <A HREF="cuddAllDet.html#cuddZddSwapInPlace" TARGET="MAIN"><CODE>cuddZddSwapInPlace()</CODE></A>
2218 <DD> Swaps two adjacent variables.
2219
2220 <DT> <A HREF="cuddAllDet.html#cuddZddSwapping" TARGET="MAIN"><CODE>cuddZddSwapping()</CODE></A>
2221 <DD> Reorders variables by a sequence of (non-adjacent) swaps.
2222
2223 <DT> <A HREF="cuddAllDet.html#cuddZddSymmCheck" TARGET="MAIN"><CODE>cuddZddSymmCheck()</CODE></A>
2224 <DD> Checks for symmetry of x and y.
2225
2226 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSiftingAux" TARGET="MAIN"><CODE>cuddZddSymmSiftingAux()</CODE></A>
2227 <DD> Given x_low <= x <= x_high moves x up and down between the
2228   boundaries.
2229
2230 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSiftingBackward" TARGET="MAIN"><CODE>cuddZddSymmSiftingBackward()</CODE></A>
2231 <DD> Given a set of moves, returns the ZDD heap to the position
2232   giving the minimum size.
2233
2234 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSiftingConvAux" TARGET="MAIN"><CODE>cuddZddSymmSiftingConvAux()</CODE></A>
2235 <DD> Given x_low <= x <= x_high moves x up and down between the
2236   boundaries.
2237
2238 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSiftingConv" TARGET="MAIN"><CODE>cuddZddSymmSiftingConv()</CODE></A>
2239 <DD> Symmetric sifting to convergence algorithm for ZDDs.
2240
2241 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSifting_down" TARGET="MAIN"><CODE>cuddZddSymmSifting_down()</CODE></A>
2242 <DD> Moves x down until either it reaches the bound (x_high) or
2243   the size of the ZDD heap increases too much.
2244
2245 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSifting_up" TARGET="MAIN"><CODE>cuddZddSymmSifting_up()</CODE></A>
2246 <DD> Moves x up until either it reaches the bound (x_low) or
2247   the size of the ZDD heap increases too much.
2248
2249 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSifting" TARGET="MAIN"><CODE>cuddZddSymmSifting()</CODE></A>
2250 <DD> Symmetric sifting algorithm for ZDDs.
2251
2252 <DT> <A HREF="cuddAllDet.html#cuddZddSymmSummary" TARGET="MAIN"><CODE>cuddZddSymmSummary()</CODE></A>
2253 <DD> Counts numbers of symmetric variables and symmetry
2254   groups.
2255
2256 <DT> <A HREF="cuddAllDet.html#cuddZddTreeSifting" TARGET="MAIN"><CODE>cuddZddTreeSifting()</CODE></A>
2257 <DD> Tree sifting algorithm for ZDDs.
2258
2259 <DT> <A HREF="cuddAllDet.html#cuddZddUnateProduct" TARGET="MAIN"><CODE>cuddZddUnateProduct()</CODE></A>
2260 <DD> Performs the recursive step of Cudd_zddUnateProduct.
2261
2262 <DT> <A HREF="cuddAllDet.html#cuddZddUndoMoves" TARGET="MAIN"><CODE>cuddZddUndoMoves()</CODE></A>
2263 <DD> Given a set of moves, returns the ZDD heap to the order
2264   in effect before the moves.
2265
2266 <DT> <A HREF="cuddAllDet.html#cuddZddUnion" TARGET="MAIN"><CODE>cuddZddUnion()</CODE></A>
2267 <DD> Performs the recursive step of Cudd_zddUnion.
2268
2269 <DT> <A HREF="cuddAllDet.html#cuddZddUniqueCompare" TARGET="MAIN"><CODE>cuddZddUniqueCompare()</CODE></A>
2270 <DD> Comparison function used by qsort.
2271
2272 <DT> <A HREF="cuddAllDet.html#cuddZddWeakDivF" TARGET="MAIN"><CODE>cuddZddWeakDivF()</CODE></A>
2273 <DD> Performs the recursive step of Cudd_zddWeakDivF.
2274
2275 <DT> <A HREF="cuddAllDet.html#cuddZddWeakDiv" TARGET="MAIN"><CODE>cuddZddWeakDiv()</CODE></A>
2276 <DD> Performs the recursive step of Cudd_zddWeakDiv.
2277
2278 <DT> <A HREF="cuddAllDet.html#ddBddToAddRecur" TARGET="MAIN"><CODE>ddBddToAddRecur()</CODE></A>
2279 <DD> Performs the recursive step for Cudd_BddToAdd.
2280
2281 <DT> <A HREF="cuddAllDet.html#ddCheckPermuation" TARGET="MAIN"><CODE>ddCheckPermuation()</CODE></A>
2282 <DD> Checks the BDD variable group tree before a shuffle.
2283
2284 <DT> <A HREF="cuddAllDet.html#ddClearFlag" TARGET="MAIN"><CODE>ddClearFlag()</CODE></A>
2285 <DD> Performs a DFS from f, clearing the LSB of the next
2286   pointers.
2287
2288 <DT> <A HREF="cuddAllDet.html#ddClearGlobal" TARGET="MAIN"><CODE>ddClearGlobal()</CODE></A>
2289 <DD> Scans the DD and clears the LSB of the next pointers.
2290
2291 <DT> <A HREF="cuddAllDet.html#ddClearGlobal" TARGET="MAIN"><CODE>ddClearGlobal()</CODE></A>
2292 <DD> Scans the DD and clears the LSB of the next pointers.
2293
2294 <DT> <A HREF="cuddAllDet.html#ddClearLocal" TARGET="MAIN"><CODE>ddClearLocal()</CODE></A>
2295 <DD> Performs a DFS from f, clearing the LSB of the then pointers.
2296
2297 <DT> <A HREF="cuddAllDet.html#ddCofMintermAux" TARGET="MAIN"><CODE>ddCofMintermAux()</CODE></A>
2298 <DD> Recursive Step for Cudd_CofMinterm function.
2299
2300 <DT> <A HREF="cuddAllDet.html#ddCountInternalMtrNodes" TARGET="MAIN"><CODE>ddCountInternalMtrNodes()</CODE></A>
2301 <DD> Counts the number of internal nodes of the group tree.
2302
2303 <DT> <A HREF="cuddAllDet.html#ddCountMintermAux" TARGET="MAIN"><CODE>ddCountMintermAux()</CODE></A>
2304 <DD> Performs the recursive step of Cudd_CountMinterm.
2305
2306 <DT> <A HREF="cuddAllDet.html#ddCountPathAux" TARGET="MAIN"><CODE>ddCountPathAux()</CODE></A>
2307 <DD> Performs the recursive step of Cudd_CountPath.
2308
2309 <DT> <A HREF="cuddAllDet.html#ddCountPathsToNonZero" TARGET="MAIN"><CODE>ddCountPathsToNonZero()</CODE></A>
2310 <DD> Performs the recursive step of Cudd_CountPathsToNonZero.
2311
2312 <DT> <A HREF="cuddAllDet.html#ddCountRoots" TARGET="MAIN"><CODE>ddCountRoots()</CODE></A>
2313 <DD> Counts the number of roots.
2314
2315 <DT> <A HREF="cuddAllDet.html#ddCreateGroup" TARGET="MAIN"><CODE>ddCreateGroup()</CODE></A>
2316 <DD> Creates a group encompassing variables from x to y in the
2317   DD table.
2318
2319 <DT> <A HREF="cuddAllDet.html#ddDagInt" TARGET="MAIN"><CODE>ddDagInt()</CODE></A>
2320 <DD> Performs the recursive step of Cudd_DagSize.
2321
2322 <DT> <A HREF="cuddAllDet.html#ddDissolveGroup" TARGET="MAIN"><CODE>ddDissolveGroup()</CODE></A>
2323 <DD> Dissolves a group in the DD table.
2324
2325 <DT> <A HREF="cuddAllDet.html#ddDoDumpBlif" TARGET="MAIN"><CODE>ddDoDumpBlif()</CODE></A>
2326 <DD> Performs the recursive step of Cudd_DumpBlif.
2327
2328 <DT> <A HREF="cuddAllDet.html#ddDoDumpDDcal" TARGET="MAIN"><CODE>ddDoDumpDDcal()</CODE></A>
2329 <DD> Performs the recursive step of Cudd_DumpDDcal.
2330
2331 <DT> <A HREF="cuddAllDet.html#ddDoDumpDaVinci" TARGET="MAIN"><CODE>ddDoDumpDaVinci()</CODE></A>
2332 <DD> Performs the recursive step of Cudd_DumpDaVinci.
2333
2334 <DT> <A HREF="cuddAllDet.html#ddDoDumpFactoredForm" TARGET="MAIN"><CODE>ddDoDumpFactoredForm()</CODE></A>
2335 <DD> Performs the recursive step of Cudd_DumpFactoredForm.
2336
2337 <DT> <A HREF="cuddAllDet.html#ddEpdCountMintermAux" TARGET="MAIN"><CODE>ddEpdCountMintermAux()</CODE></A>
2338 <DD> Performs the recursive step of Cudd_EpdCountMinterm.
2339
2340 <DT> <A HREF="cuddAllDet.html#ddEpdFree" TARGET="MAIN"><CODE>ddEpdFree()</CODE></A>
2341 <DD> Frees the memory used to store the minterm counts recorded
2342   in the visited table.
2343
2344 <DT> <A HREF="cuddAllDet.html#ddExchange" TARGET="MAIN"><CODE>ddExchange()</CODE></A>
2345 <DD> This function is for exchanging two variables, x and y.
2346
2347 <DT> <A HREF="cuddAllDet.html#ddExtSymmCheck" TARGET="MAIN"><CODE>ddExtSymmCheck()</CODE></A>
2348 <DD> Checks for extended symmetry of x and y.
2349
2350 <DT> <A HREF="cuddAllDet.html#ddFindEssentialRecur" TARGET="MAIN"><CODE>ddFindEssentialRecur()</CODE></A>
2351 <DD> Implements the recursive step of Cudd_FindEssential.
2352
2353 <DT> <A HREF="cuddAllDet.html#ddFindNodeHiLo" TARGET="MAIN"><CODE>ddFindNodeHiLo()</CODE></A>
2354 <DD> Finds the lower and upper bounds of the group represented
2355   by treenode.
2356
2357 <DT> <A HREF="cuddAllDet.html#ddFindTwoLiteralClausesRecur" TARGET="MAIN"><CODE>ddFindTwoLiteralClausesRecur()</CODE></A>
2358 <DD> Implements the recursive step of Cudd_FindTwoLiteralClauses.
2359
2360 <DT> <A HREF="cuddAllDet.html#ddFixLimits" TARGET="MAIN"><CODE>ddFixLimits()</CODE></A>
2361 <DD> Adjusts the values of table limits.
2362
2363 <DT> <A HREF="cuddAllDet.html#ddGroupMoveBackward" TARGET="MAIN"><CODE>ddGroupMoveBackward()</CODE></A>
2364 <DD> Undoes the swap two groups.
2365
2366 <DT> <A HREF="cuddAllDet.html#ddGroupMove" TARGET="MAIN"><CODE>ddGroupMove()</CODE></A>
2367 <DD> Swaps two groups and records the move.
2368
2369 <DT> <A HREF="cuddAllDet.html#ddGroupSiftingAux" TARGET="MAIN"><CODE>ddGroupSiftingAux()</CODE></A>
2370 <DD> Sifts one variable up and down until it has taken all
2371   positions. Checks for aggregation.
2372
2373 <DT> <A HREF="cuddAllDet.html#ddGroupSiftingBackward" TARGET="MAIN"><CODE>ddGroupSiftingBackward()</CODE></A>
2374 <DD> Determines the best position for a variables and returns
2375   it there.
2376
2377 <DT> <A HREF="cuddAllDet.html#ddGroupSiftingDown" TARGET="MAIN"><CODE>ddGroupSiftingDown()</CODE></A>
2378 <DD> Sifts down a variable until it reaches position xHigh.
2379
2380 <DT> <A HREF="cuddAllDet.html#ddGroupSiftingUp" TARGET="MAIN"><CODE>ddGroupSiftingUp()</CODE></A>
2381 <DD> Sifts up a variable until either it reaches position xLow
2382   or the size of the DD heap increases too much.
2383
2384 <DT> <A HREF="cuddAllDet.html#ddGroupSifting" TARGET="MAIN"><CODE>ddGroupSifting()</CODE></A>
2385 <DD> Sifts from treenode->low to treenode->high.
2386
2387 <DT> <A HREF="cuddAllDet.html#ddIsIthAddVarPair" TARGET="MAIN"><CODE>ddIsIthAddVarPair()</CODE></A>
2388 <DD> Comparison of a pair of functions to the i-th ADD variable.
2389
2390 <DT> <A HREF="cuddAllDet.html#ddIsIthAddVar" TARGET="MAIN"><CODE>ddIsIthAddVar()</CODE></A>
2391 <DD> Comparison of a function to the i-th ADD variable.
2392
2393 <DT> <A HREF="cuddAllDet.html#ddIsVarHandled" TARGET="MAIN"><CODE>ddIsVarHandled()</CODE></A>
2394 <DD> Checks whether a variables is already handled.
2395
2396 <DT> <A HREF="cuddAllDet.html#ddJumpingAux" TARGET="MAIN"><CODE>ddJumpingAux()</CODE></A>
2397 <DD> Moves a variable to a specified position.
2398
2399 <DT> <A HREF="cuddAllDet.html#ddJumpingDown" TARGET="MAIN"><CODE>ddJumpingDown()</CODE></A>
2400 <DD> This function is for jumping down.
2401
2402 <DT> <A HREF="cuddAllDet.html#ddJumpingUp" TARGET="MAIN"><CODE>ddJumpingUp()</CODE></A>
2403 <DD> This function is for jumping up.
2404
2405 <DT> <A HREF="cuddAllDet.html#ddLCHash" TARGET="MAIN"><CODE>ddLCHash()</CODE></A>
2406 <DD> Computes the hash value for a local cache.
2407
2408 <DT> <A HREF="cuddAllDet.html#ddLeavesInt" TARGET="MAIN"><CODE>ddLeavesInt()</CODE></A>
2409 <DD> Performs the recursive step of Cudd_CountLeaves.
2410
2411 <DT> <A HREF="cuddAllDet.html#ddLinearAndSiftingAux" TARGET="MAIN"><CODE>ddLinearAndSiftingAux()</CODE></A>
2412 <DD> Given xLow <= x <= xHigh moves x up and down between the
2413   boundaries.
2414
2415 <DT> <A HREF="cuddAllDet.html#ddLinearAndSiftingBackward" TARGET="MAIN"><CODE>ddLinearAndSiftingBackward()</CODE></A>
2416 <DD> Given a set of moves, returns the DD heap to the order
2417   giving the minimum size.
2418
2419 <DT> <A HREF="cuddAllDet.html#ddLinearAndSiftingDown" TARGET="MAIN"><CODE>ddLinearAndSiftingDown()</CODE></A>
2420 <DD> Sifts a variable down and applies linear transformations.
2421
2422 <DT> <A HREF="cuddAllDet.html#ddLinearAndSiftingUp" TARGET="MAIN"><CODE>ddLinearAndSiftingUp()</CODE></A>
2423 <DD> Sifts a variable up and applies linear transformations.
2424
2425 <DT> <A HREF="cuddAllDet.html#ddLinearUniqueCompare" TARGET="MAIN"><CODE>ddLinearUniqueCompare()</CODE></A>
2426 <DD> Comparison function used by qsort.
2427
2428 <DT> <A HREF="cuddAllDet.html#ddMergeGroups" TARGET="MAIN"><CODE>ddMergeGroups()</CODE></A>
2429 <DD> Merges groups in the DD table.
2430
2431 <DT> <A HREF="cuddAllDet.html#ddNoCheck" TARGET="MAIN"><CODE>ddNoCheck()</CODE></A>
2432 <DD> Pretends to check two variables for aggregation.
2433
2434 <DT> <A HREF="cuddAllDet.html#ddPatchTree" TARGET="MAIN"><CODE>ddPatchTree()</CODE></A>
2435 <DD> Fixes a variable tree after the insertion of new subtables.
2436
2437 <DT> <A HREF="cuddAllDet.html#ddPermuteWindow3" TARGET="MAIN"><CODE>ddPermuteWindow3()</CODE></A>
2438 <DD> Tries all the permutations of the three variables between
2439   x and x+2 and retains the best.
2440
2441 <DT> <A HREF="cuddAllDet.html#ddPermuteWindow4" TARGET="MAIN"><CODE>ddPermuteWindow4()</CODE></A>
2442 <DD> Tries all the permutations of the four variables between w
2443   and w+3 and retains the best.
2444
2445 <DT> <A HREF="cuddAllDet.html#ddPickArbitraryMinterms" TARGET="MAIN"><CODE>ddPickArbitraryMinterms()</CODE></A>
2446 <DD> Performs the recursive step of Cudd_bddPickArbitraryMinterms.
2447
2448 <DT> <A HREF="cuddAllDet.html#ddPickRepresentativeCube" TARGET="MAIN"><CODE>ddPickRepresentativeCube()</CODE></A>
2449 <DD> Finds a representative cube of a BDD.
2450
2451 <DT> <A HREF="cuddAllDet.html#ddPrintMintermAux" TARGET="MAIN"><CODE>ddPrintMintermAux()</CODE></A>
2452 <DD> Performs the recursive step of Cudd_PrintMinterm.
2453
2454 <DT> <A HREF="cuddAllDet.html#ddRehashZdd" TARGET="MAIN"><CODE>ddRehashZdd()</CODE></A>
2455 <DD> Rehashes a ZDD unique subtable.
2456
2457 <DT> <A HREF="cuddAllDet.html#ddReorderChildren" TARGET="MAIN"><CODE>ddReorderChildren()</CODE></A>
2458 <DD> Reorders the children of a group tree node according to
2459   the options.
2460
2461 <DT> <A HREF="cuddAllDet.html#ddReorderPostprocess" TARGET="MAIN"><CODE>ddReorderPostprocess()</CODE></A>
2462 <DD> Cleans up at the end of reordering.
2463
2464 <DT> <A HREF="cuddAllDet.html#ddReorderPreprocess" TARGET="MAIN"><CODE>ddReorderPreprocess()</CODE></A>
2465 <DD> Prepares the DD heap for dynamic reordering.
2466
2467 <DT> <A HREF="cuddAllDet.html#ddReportRefMess" TARGET="MAIN"><CODE>ddReportRefMess()</CODE></A>
2468 <DD> Reports problem in garbage collection.
2469
2470 <DT> <A HREF="cuddAllDet.html#ddResetVarHandled" TARGET="MAIN"><CODE>ddResetVarHandled()</CODE></A>
2471 <DD> Resets a variable to be processed.
2472
2473 <DT> <A HREF="cuddAllDet.html#ddResizeTable" TARGET="MAIN"><CODE>ddResizeTable()</CODE></A>
2474 <DD> Increases the number of subtables in a unique table so
2475   that it meets or exceeds index.
2476
2477 <DT> <A HREF="cuddAllDet.html#ddSecDiffCheck" TARGET="MAIN"><CODE>ddSecDiffCheck()</CODE></A>
2478 <DD> Checks two variables for aggregation.
2479
2480 <DT> <A HREF="cuddAllDet.html#ddSetVarHandled" TARGET="MAIN"><CODE>ddSetVarHandled()</CODE></A>
2481 <DD> Sets a variable to already handled.
2482
2483 <DT> <A HREF="cuddAllDet.html#ddShuffle" TARGET="MAIN"><CODE>ddShuffle()</CODE></A>
2484 <DD> Reorders variables according to a given permutation.
2485
2486 <DT> <A HREF="cuddAllDet.html#ddShuffle" TARGET="MAIN"><CODE>ddShuffle()</CODE></A>
2487 <DD> Reorders variables according to a given permutation.
2488
2489 <DT> <A HREF="cuddAllDet.html#ddSiftUp" TARGET="MAIN"><CODE>ddSiftUp()</CODE></A>
2490 <DD> Moves one variable up.
2491
2492 <DT> <A HREF="cuddAllDet.html#ddSiftUp" TARGET="MAIN"><CODE>ddSiftUp()</CODE></A>
2493 <DD> Moves one variable up.
2494
2495 <DT> <A HREF="cuddAllDet.html#ddSiftingAux" TARGET="MAIN"><CODE>ddSiftingAux()</CODE></A>
2496 <DD> Given xLow <= x <= xHigh moves x up and down between the
2497   boundaries.
2498
2499 <DT> <A HREF="cuddAllDet.html#ddSiftingBackward" TARGET="MAIN"><CODE>ddSiftingBackward()</CODE></A>
2500 <DD> Given a set of moves, returns the DD heap to the position
2501   giving the minimum size.
2502
2503 <DT> <A HREF="cuddAllDet.html#ddSiftingDown" TARGET="MAIN"><CODE>ddSiftingDown()</CODE></A>
2504 <DD> Sifts a variable down.
2505
2506 <DT> <A HREF="cuddAllDet.html#ddSiftingUp" TARGET="MAIN"><CODE>ddSiftingUp()</CODE></A>
2507 <DD> Sifts a variable up.
2508
2509 <DT> <A HREF="cuddAllDet.html#ddSuppInteract" TARGET="MAIN"><CODE>ddSuppInteract()</CODE></A>
2510 <DD> Find the support of f.
2511
2512 <DT> <A HREF="cuddAllDet.html#ddSupportStep" TARGET="MAIN"><CODE>ddSupportStep()</CODE></A>
2513 <DD> Performs the recursive step of Cudd_Support.
2514
2515 <DT> <A HREF="cuddAllDet.html#ddSwapAny" TARGET="MAIN"><CODE>ddSwapAny()</CODE></A>
2516 <DD> Swaps any two variables.
2517
2518 <DT> <A HREF="cuddAllDet.html#ddSymmGroupMoveBackward" TARGET="MAIN"><CODE>ddSymmGroupMoveBackward()</CODE></A>
2519 <DD> Undoes the swap of two groups.
2520
2521 <DT> <A HREF="cuddAllDet.html#ddSymmGroupMove" TARGET="MAIN"><CODE>ddSymmGroupMove()</CODE></A>
2522 <DD> Swaps two groups.
2523
2524 <DT> <A HREF="cuddAllDet.html#ddSymmSiftingAux" TARGET="MAIN"><CODE>ddSymmSiftingAux()</CODE></A>
2525 <DD> Given xLow <= x <= xHigh moves x up and down between the
2526   boundaries.
2527
2528 <DT> <A HREF="cuddAllDet.html#ddSymmSiftingBackward" TARGET="MAIN"><CODE>ddSymmSiftingBackward()</CODE></A>
2529 <DD> Given a set of moves, returns the DD heap to the position
2530   giving the minimum size.
2531
2532 <DT> <A HREF="cuddAllDet.html#ddSymmSiftingConvAux" TARGET="MAIN"><CODE>ddSymmSiftingConvAux()</CODE></A>
2533 <DD> Given xLow <= x <= xHigh moves x up and down between the
2534   boundaries.
2535
2536 <DT> <A HREF="cuddAllDet.html#ddSymmSiftingDown" TARGET="MAIN"><CODE>ddSymmSiftingDown()</CODE></A>
2537 <DD> Moves x down until either it reaches the bound (xHigh) or
2538   the size of the DD heap increases too much.
2539
2540 <DT> <A HREF="cuddAllDet.html#ddSymmSiftingUp" TARGET="MAIN"><CODE>ddSymmSiftingUp()</CODE></A>
2541 <DD> Moves x up until either it reaches the bound (xLow) or
2542   the size of the DD heap increases too much.
2543
2544 <DT> <A HREF="cuddAllDet.html#ddSymmSummary" TARGET="MAIN"><CODE>ddSymmSummary()</CODE></A>
2545 <DD> Counts numbers of symmetric variables and symmetry
2546   groups.
2547
2548 <DT> <A HREF="cuddAllDet.html#ddSymmUniqueCompare" TARGET="MAIN"><CODE>ddSymmUniqueCompare()</CODE></A>
2549 <DD> Comparison function used by qsort.
2550
2551 <DT> <A HREF="cuddAllDet.html#ddTreeSiftingAux" TARGET="MAIN"><CODE>ddTreeSiftingAux()</CODE></A>
2552 <DD> Visits the group tree and reorders each group.
2553
2554 <DT> <A HREF="cuddAllDet.html#ddUndoMoves" TARGET="MAIN"><CODE>ddUndoMoves()</CODE></A>
2555 <DD> Given a set of moves, returns the DD heap to the order
2556   in effect before the moves.
2557
2558 <DT> <A HREF="cuddAllDet.html#ddUniqueCompareGroup" TARGET="MAIN"><CODE>ddUniqueCompareGroup()</CODE></A>
2559 <DD> Comparison function used by qsort.
2560
2561 <DT> <A HREF="cuddAllDet.html#ddUniqueCompare" TARGET="MAIN"><CODE>ddUniqueCompare()</CODE></A>
2562 <DD> Comparison function used by qsort.
2563
2564 <DT> <A HREF="cuddAllDet.html#ddUpdateInteract" TARGET="MAIN"><CODE>ddUpdateInteract()</CODE></A>
2565 <DD> Marks as interacting all pairs of variables that appear in
2566   support.
2567
2568 <DT> <A HREF="cuddAllDet.html#ddUpdateMtrTree" TARGET="MAIN"><CODE>ddUpdateMtrTree()</CODE></A>
2569 <DD> Updates the BDD variable group tree before a shuffle.
2570
2571 <DT> <A HREF="cuddAllDet.html#ddVarGroupCheck" TARGET="MAIN"><CODE>ddVarGroupCheck()</CODE></A>
2572 <DD> Checks for grouping of x and y.
2573
2574 <DT> <A HREF="cuddAllDet.html#ddWindow2" TARGET="MAIN"><CODE>ddWindow2()</CODE></A>
2575 <DD> Reorders by applying a sliding window of width 2.
2576
2577 <DT> <A HREF="cuddAllDet.html#ddWindow3" TARGET="MAIN"><CODE>ddWindow3()</CODE></A>
2578 <DD> Reorders by applying a sliding window of width 3.
2579
2580 <DT> <A HREF="cuddAllDet.html#ddWindow4" TARGET="MAIN"><CODE>ddWindow4()</CODE></A>
2581 <DD> Reorders by applying a sliding window of width 4.
2582
2583 <DT> <A HREF="cuddAllDet.html#ddWindowConv2" TARGET="MAIN"><CODE>ddWindowConv2()</CODE></A>
2584 <DD> Reorders by repeatedly applying a sliding window of width 2.
2585
2586 <DT> <A HREF="cuddAllDet.html#ddWindowConv3" TARGET="MAIN"><CODE>ddWindowConv3()</CODE></A>
2587 <DD> Reorders by repeatedly applying a sliding window of width 3.
2588
2589 <DT> <A HREF="cuddAllDet.html#ddWindowConv4" TARGET="MAIN"><CODE>ddWindowConv4()</CODE></A>
2590 <DD> Reorders by repeatedly applying a sliding window of width 4.
2591
2592 <DT> <A HREF="cuddAllDet.html#debugCheckParent" TARGET="MAIN"><CODE>debugCheckParent()</CODE></A>
2593 <DD> Reports an error if a (dead) node has a non-dead parent.
2594
2595 <DT> <A HREF="cuddAllDet.html#debugFindParent" TARGET="MAIN"><CODE>debugFindParent()</CODE></A>
2596 <DD> Searches the subtables above node for its parents.
2597
2598 <DT> <A HREF="cuddAllDet.html#dp2" TARGET="MAIN"><CODE>dp2()</CODE></A>
2599 <DD> Performs the recursive step of cuddP.
2600
2601 <DT> <A HREF="cuddAllDet.html#emptyClauseSet" TARGET="MAIN"><CODE>emptyClauseSet()</CODE></A>
2602 <DD> Returns an enpty set of clauses.
2603
2604 <DT> <A HREF="cuddAllDet.html#equalp" TARGET="MAIN"><CODE>equalp()</CODE></A>
2605 <DD> Returns true iff the two arguments are identical clauses.
2606
2607 <DT> <A HREF="cuddAllDet.html#find_average_fitness" TARGET="MAIN"><CODE>find_average_fitness()</CODE></A>
2608 <DD> Returns the average fitness of the population.
2609
2610 <DT> <A HREF="cuddAllDet.html#find_best" TARGET="MAIN"><CODE>find_best()</CODE></A>
2611 <DD> Returns the index of the fittest individual.
2612
2613 <DT> <A HREF="cuddAllDet.html#fixVarTree" TARGET="MAIN"><CODE>fixVarTree()</CODE></A>
2614 <DD> Fixes a variable group tree.
2615
2616 <DT> <A HREF="cuddAllDet.html#freeMatrix" TARGET="MAIN"><CODE>freeMatrix()</CODE></A>
2617 <DD> Frees a two-dimensional matrix allocated by getMatrix.
2618
2619 <DT> <A HREF="cuddAllDet.html#freePathPair" TARGET="MAIN"><CODE>freePathPair()</CODE></A>
2620 <DD> Frees the entries of the visited symbol table.
2621
2622 <DT> <A HREF="cuddAllDet.html#gatherInfoAux" TARGET="MAIN"><CODE>gatherInfoAux()</CODE></A>
2623 <DD> Recursively counts minterms and computes reference counts
2624   of each node in the BDD.
2625
2626 <DT> <A HREF="cuddAllDet.html#gatherInfo" TARGET="MAIN"><CODE>gatherInfo()</CODE></A>
2627 <DD> Gathers information about each node.
2628
2629 <DT> <A HREF="cuddAllDet.html#gcd" TARGET="MAIN"><CODE>gcd()</CODE></A>
2630 <DD> Returns the gcd of two integers.
2631
2632 <DT> <A HREF="cuddAllDet.html#getCube" TARGET="MAIN"><CODE>getCube()</CODE></A>
2633 <DD> Build a BDD for a largest cube of f.
2634
2635 <DT> <A HREF="cuddAllDet.html#getLargest" TARGET="MAIN"><CODE>getLargest()</CODE></A>
2636 <DD> Finds the size of the largest cube(s) in a DD.
2637
2638 <DT> <A HREF="cuddAllDet.html#getLevelKeys" TARGET="MAIN"><CODE>getLevelKeys()</CODE></A>
2639 <DD> Returns the number of nodes at one level of a unique table.
2640
2641 <DT> <A HREF="cuddAllDet.html#getMatrix" TARGET="MAIN"><CODE>getMatrix()</CODE></A>
2642 <DD> Allocates a two-dimensional matrix of ints.
2643
2644 <DT> <A HREF="cuddAllDet.html#getMaxBinomial" TARGET="MAIN"><CODE>getMaxBinomial()</CODE></A>
2645 <DD> Returns the maximum value of (n choose k) for a given n.
2646
2647 <DT> <A HREF="cuddAllDet.html#getPath" TARGET="MAIN"><CODE>getPath()</CODE></A>
2648 <DD> Build a BDD for a shortest path of f.
2649
2650 <DT> <A HREF="cuddAllDet.html#getShortest" TARGET="MAIN"><CODE>getShortest()</CODE></A>
2651 <DD> Finds the length of the shortest path(s) in a DD.
2652
2653 <DT> <A HREF="cuddAllDet.html#hashDelete" TARGET="MAIN"><CODE>hashDelete()</CODE></A>
2654 <DD> Removes an item from the hash table of a level queue.
2655
2656 <DT> <A HREF="cuddAllDet.html#hashInsert" TARGET="MAIN"><CODE>hashInsert()</CODE></A>
2657 <DD> Inserts an item in the hash table of a level queue.
2658
2659 <DT> <A HREF="cuddAllDet.html#hashLookup" TARGET="MAIN"><CODE>hashLookup()</CODE></A>
2660 <DD> Looks up a key in the hash table of a level queue.
2661
2662 <DT> <A HREF="cuddAllDet.html#hashResize" TARGET="MAIN"><CODE>hashResize()</CODE></A>
2663 <DD> Resizes the hash table of a level queue.
2664
2665 <DT> <A HREF="cuddAllDet.html#impliedp" TARGET="MAIN"><CODE>impliedp()</CODE></A>
2666 <DD> Returns true iff either literal of a clause is in a set of
2667   literals.
2668
2669 <DT> <A HREF="cuddAllDet.html#initSymmInfo" TARGET="MAIN"><CODE>initSymmInfo()</CODE></A>
2670 <DD> Gathers symmetry information.
2671
2672 <DT> <A HREF="cuddAllDet.html#largest" TARGET="MAIN"><CODE>largest()</CODE></A>
2673 <DD> Finds the largest DD in the population.
2674
2675 <DT> <A HREF="cuddAllDet.html#make_random" TARGET="MAIN"><CODE>make_random()</CODE></A>
2676 <DD> Generates the random sequences for the initial population.
2677
2678 <DT> <A HREF="cuddAllDet.html#mintermsFromUniverse" TARGET="MAIN"><CODE>mintermsFromUniverse()</CODE></A>
2679 <DD> Recursive procedure to extract n mintems from constant 1.
2680
2681 <DT> <A HREF="cuddAllDet.html#oneliteralp" TARGET="MAIN"><CODE>oneliteralp()</CODE></A>
2682 <DD> Returns true iff the argument is a one-literal clause.
2683
2684 <DT> <A HREF="cuddAllDet.html#pushDown" TARGET="MAIN"><CODE>pushDown()</CODE></A>
2685 <DD> Pushes a variable in the order down to position "level."
2686
2687 <DT> <A HREF="cuddAllDet.html#rand_int" TARGET="MAIN"><CODE>rand_int()</CODE></A>
2688 <DD> Generates a random number between 0 and the integer a.
2689
2690 <DT> <A HREF="cuddAllDet.html#random_generator" TARGET="MAIN"><CODE>random_generator()</CODE></A>
2691 <DD> Random number generator.
2692
2693 <DT> <A HREF="cuddAllDet.html#restoreOrder" TARGET="MAIN"><CODE>restoreOrder()</CODE></A>
2694 <DD> Restores the variable order in array by a series of sifts up.
2695
2696 <DT> <A HREF="cuddAllDet.html#roulette" TARGET="MAIN"><CODE>roulette()</CODE></A>
2697 <DD> Selects two parents with the roulette wheel method.
2698
2699 <DT> <A HREF="cuddAllDet.html#selectMintermsFromUniverse" TARGET="MAIN"><CODE>selectMintermsFromUniverse()</CODE></A>
2700 <DD> This function prepares an array of variables which have not been
2701   encountered so far when traversing the procedure cuddSplitSetRecur.
2702
2703 <DT> <A HREF="cuddAllDet.html#sentinelp" TARGET="MAIN"><CODE>sentinelp()</CODE></A>
2704 <DD> Returns true iff the argument is the sentinel clause.
2705
2706 <DT> <A HREF="cuddAllDet.html#separateCube" TARGET="MAIN"><CODE>separateCube()</CODE></A>
2707 <DD> Separates cube from distance.
2708
2709 <DT> <A HREF="cuddAllDet.html#siftBackwardProb" TARGET="MAIN"><CODE>siftBackwardProb()</CODE></A>
2710 <DD> Returns the DD to the best position encountered during
2711   sifting if there was improvement.
2712
2713 <DT> <A HREF="cuddAllDet.html#sift_up" TARGET="MAIN"><CODE>sift_up()</CODE></A>
2714 <DD> Moves one variable up.
2715
2716 <DT> <A HREF="cuddAllDet.html#stPathTableDdFree" TARGET="MAIN"><CODE>stPathTableDdFree()</CODE></A>
2717 <DD> Procedure to free te result dds stored in the NodeDist pages.
2718
2719 <DT> <A HREF="cuddAllDet.html#st_zdd_count_dbl_free" TARGET="MAIN"><CODE>st_zdd_count_dbl_free()</CODE></A>
2720 <DD> Frees the memory associated with the computed table of
2721   Cudd_zddCountDouble.
2722
2723 <DT> <A HREF="cuddAllDet.html#st_zdd_countfree" TARGET="MAIN"><CODE>st_zdd_countfree()</CODE></A>
2724 <DD> Frees the memory associated with the computed table of
2725   Cudd_zddCount.
2726
2727 <DT> <A HREF="cuddAllDet.html#stopping_criterion" TARGET="MAIN"><CODE>stopping_criterion()</CODE></A>
2728 <DD> Checks termination condition.
2729
2730 <DT> <A HREF="cuddAllDet.html#tlcInfoAlloc" TARGET="MAIN"><CODE>tlcInfoAlloc()</CODE></A>
2731 <DD> Allocates a DdTlcInfo Structure.
2732
2733 <DT> <A HREF="cuddAllDet.html#updateEntry" TARGET="MAIN"><CODE>updateEntry()</CODE></A>
2734 <DD> Updates entry for a subset.
2735
2736 <DT> <A HREF="cuddAllDet.html#updateParity" TARGET="MAIN"><CODE>updateParity()</CODE></A>
2737 <DD> Recursively update the parity of the paths reaching a node.
2738
2739 <DT> <A HREF="cuddAllDet.html#updateRefs" TARGET="MAIN"><CODE>updateRefs()</CODE></A>
2740 <DD> Update function reference counts.
2741
2742 <DT> <A HREF="cuddAllDet.html#updateUB" TARGET="MAIN"><CODE>updateUB()</CODE></A>
2743 <DD> Updates the upper bound and saves the best order seen so far.
2744
2745 <DT> <A HREF="cuddAllDet.html#zddCountInternalMtrNodes" TARGET="MAIN"><CODE>zddCountInternalMtrNodes()</CODE></A>
2746 <DD> Counts the number of internal nodes of the group tree.
2747
2748 <DT> <A HREF="cuddAllDet.html#zddFindNodeHiLo" TARGET="MAIN"><CODE>zddFindNodeHiLo()</CODE></A>
2749 <DD> Finds the lower and upper bounds of the group represented
2750   by treenode.
2751
2752 <DT> <A HREF="cuddAllDet.html#zddFixTree" TARGET="MAIN"><CODE>zddFixTree()</CODE></A>
2753 <DD> Fixes the ZDD variable group tree after a shuffle.
2754
2755 <DT> <A HREF="cuddAllDet.html#zddGroupMoveBackward" TARGET="MAIN"><CODE>zddGroupMoveBackward()</CODE></A>
2756 <DD> Undoes the swap two groups.
2757
2758 <DT> <A HREF="cuddAllDet.html#zddGroupMove" TARGET="MAIN"><CODE>zddGroupMove()</CODE></A>
2759 <DD> Swaps two groups and records the move.
2760
2761 <DT> <A HREF="cuddAllDet.html#zddGroupSiftingAux" TARGET="MAIN"><CODE>zddGroupSiftingAux()</CODE></A>
2762 <DD> Sifts one variable up and down until it has taken all
2763   positions. Checks for aggregation.
2764
2765 <DT> <A HREF="cuddAllDet.html#zddGroupSiftingBackward" TARGET="MAIN"><CODE>zddGroupSiftingBackward()</CODE></A>
2766 <DD> Determines the best position for a variables and returns
2767   it there.
2768
2769 <DT> <A HREF="cuddAllDet.html#zddGroupSiftingDown" TARGET="MAIN"><CODE>zddGroupSiftingDown()</CODE></A>
2770 <DD> Sifts down a variable until it reaches position xHigh.
2771
2772 <DT> <A HREF="cuddAllDet.html#zddGroupSiftingUp" TARGET="MAIN"><CODE>zddGroupSiftingUp()</CODE></A>
2773 <DD> Sifts up a variable until either it reaches position xLow
2774   or the size of the DD heap increases too much.
2775
2776 <DT> <A HREF="cuddAllDet.html#zddGroupSifting" TARGET="MAIN"><CODE>zddGroupSifting()</CODE></A>
2777 <DD> Sifts from treenode->low to treenode->high.
2778
2779 <DT> <A HREF="cuddAllDet.html#zddMergeGroups" TARGET="MAIN"><CODE>zddMergeGroups()</CODE></A>
2780 <DD> Merges groups in the DD table.
2781
2782 <DT> <A HREF="cuddAllDet.html#zddPortFromBddStep" TARGET="MAIN"><CODE>zddPortFromBddStep()</CODE></A>
2783 <DD> Performs the recursive step of Cudd_zddPortFromBdd.
2784
2785 <DT> <A HREF="cuddAllDet.html#zddPortToBddStep" TARGET="MAIN"><CODE>zddPortToBddStep()</CODE></A>
2786 <DD> Performs the recursive step of Cudd_zddPortToBdd.
2787
2788 <DT> <A HREF="cuddAllDet.html#zddPrintCoverAux" TARGET="MAIN"><CODE>zddPrintCoverAux()</CODE></A>
2789 <DD> Performs the recursive step of Cudd_zddPrintCover.
2790
2791 <DT> <A HREF="cuddAllDet.html#zddReorderChildren" TARGET="MAIN"><CODE>zddReorderChildren()</CODE></A>
2792 <DD> Reorders the children of a group tree node according to
2793   the options.
2794
2795 <DT> <A HREF="cuddAllDet.html#zddReorderPostprocess" TARGET="MAIN"><CODE>zddReorderPostprocess()</CODE></A>
2796 <DD> Shrinks almost empty ZDD subtables at the end of reordering
2797   to guarantee that they have a reasonable load factor.
2798
2799 <DT> <A HREF="cuddAllDet.html#zddReorderPreprocess" TARGET="MAIN"><CODE>zddReorderPreprocess()</CODE></A>
2800 <DD> Prepares the ZDD heap for dynamic reordering.
2801
2802 <DT> <A HREF="cuddAllDet.html#zddShuffle" TARGET="MAIN"><CODE>zddShuffle()</CODE></A>
2803 <DD> Reorders ZDD variables according to a given permutation.
2804
2805 <DT> <A HREF="cuddAllDet.html#zddSiftUp" TARGET="MAIN"><CODE>zddSiftUp()</CODE></A>
2806 <DD> Moves one ZDD variable up.
2807
2808 <DT> <A HREF="cuddAllDet.html#zddSwapAny" TARGET="MAIN"><CODE>zddSwapAny()</CODE></A>
2809 <DD> Swaps any two variables.
2810
2811 <DT> <A HREF="cuddAllDet.html#zddTreeSiftingAux" TARGET="MAIN"><CODE>zddTreeSiftingAux()</CODE></A>
2812 <DD> Visits the group tree and reorders each group.
2813
2814 <DT> <A HREF="cuddAllDet.html#zddUniqueCompareGroup" TARGET="MAIN"><CODE>zddUniqueCompareGroup()</CODE></A>
2815 <DD> Comparison function used by qsort.
2816
2817 <DT> <A HREF="cuddAllDet.html#zddVarToConst" TARGET="MAIN"><CODE>zddVarToConst()</CODE></A>
2818 <DD> Replaces variables with constants if possible (part of
2819   canonical form).
2820
2821 <DT> <A HREF="cuddAllDet.html#zdd_group_move_backward" TARGET="MAIN"><CODE>zdd_group_move_backward()</CODE></A>
2822 <DD> Undoes the swap of two groups.
2823
2824 <DT> <A HREF="cuddAllDet.html#zdd_group_move" TARGET="MAIN"><CODE>zdd_group_move()</CODE></A>
2825 <DD> Swaps two groups.
2826
2827 <DT> <A HREF="cuddAllDet.html#zdd_print_minterm_aux" TARGET="MAIN"><CODE>zdd_print_minterm_aux()</CODE></A>
2828 <DD> Performs the recursive step of Cudd_zddPrintMinterm.
2829
2830 <DT> <A HREF="cuddAllDet.html#zdd_subset0_aux" TARGET="MAIN"><CODE>zdd_subset0_aux()</CODE></A>
2831 <DD> Performs the recursive step of Cudd_zddSubset0.
2832
2833 <DT> <A HREF="cuddAllDet.html#zdd_subset1_aux" TARGET="MAIN"><CODE>zdd_subset1_aux()</CODE></A>
2834 <DD> Performs the recursive step of Cudd_zddSubset1.
2835
2836 <DT> <A HREF="cuddAllDet.html#zp2" TARGET="MAIN"><CODE>zp2()</CODE></A>
2837 <DD> Performs the recursive step of cuddZddP.
2838
2839 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2840 <DD> Adds node to the head of the free list.
2841
2842 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2843 <DD> Adds node to the head of the free list.
2844
2845 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2846 <DD> Clears the 4 least significant bits of a pointer.
2847
2848 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2849 <DD> Complements a DD if a condition is true.
2850
2851 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2852 <DD> Complements a DD.
2853
2854 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2855 <DD> Computes hash function for keys of three operands.
2856
2857 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2858 <DD> Computes hash function for keys of two operands.
2859
2860 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2861 <DD> Computes the absolute value of a number.
2862
2863 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2864 <DD> Computes the maximum of two numbers.
2865
2866 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2867 <DD> Computes the minimum of two numbers.
2868
2869 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2870 <DD> Decreases the reference count of a node, if it is not
2871   saturated.
2872
2873 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2874 <DD> Enforces DD_MINUS_INF_VAL <= x <= DD_PLUS_INF_VAL.
2875
2876 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2877 <DD> Extract the least significant digit of a double digit.
2878
2879 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2880 <DD> Extract the most significant digit of a double digit.
2881
2882 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2883 <DD> Finds the current position of ZDD variable index in the
2884   order.
2885
2886 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2887 <DD> Finds the current position of variable index in the
2888   order.
2889
2890 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2891 <DD> Hash function for the cache for functions with two
2892   operands.
2893
2894 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2895 <DD> Hash function for the cache.
2896
2897 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2898 <DD> Hash function for the table of a level queue.
2899
2900 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2901 <DD> Hash function for the unique table.
2902
2903 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2904 <DD> Increases the reference count of a node, if it is not
2905   saturated.
2906
2907 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2908 <DD> Iterates over the cubes of a decision diagram.
2909
2910 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2911 <DD> Iterates over the nodes of a decision diagram.
2912
2913 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2914 <DD> Iterates over the paths of a ZDD.
2915
2916 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2917 <DD> Iterates over the primes of a Boolean function.
2918
2919 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2920 <DD> Outputs a line of stats.
2921
2922 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2923 <DD> Returns 1 if a pointer is complemented.
2924
2925 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2926 <DD> Returns 1 if the absolute value of the difference of the two
2927   arguments x and y is less than e.
2928
2929 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2930 <DD> Returns 1 if the node is a constant node.
2931
2932 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2933 <DD> Returns 1 if the node is a constant node.
2934
2935 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2936 <DD> Returns the arithmetic 0 constant node.
2937
2938 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2939 <DD> Returns the complemented version of a pointer.
2940
2941 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2942 <DD> Returns the constant 1 node.
2943
2944 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2945 <DD> Returns the current position in the order of variable
2946   index.
2947
2948 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2949 <DD> Returns the else child of an internal node.
2950
2951 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2952 <DD> Returns the else child of an internal node.
2953
2954 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2955 <DD> Returns the minus infinity constant node.
2956
2957 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2958 <DD> Returns the plus infinity constant node.
2959
2960 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2961 <DD> Returns the regular version of a pointer.
2962
2963 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2964 <DD> Returns the then child of an internal node.
2965
2966 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2967 <DD> Returns the then child of an internal node.
2968
2969 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2970 <DD> Returns the value of a constant node.
2971
2972 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2973 <DD> Returns the value of a constant node.
2974
2975 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2976 <DD> Saturating decrement operator.
2977
2978 <DT> <A HREF="cuddAllDet.html#" TARGET="MAIN"><CODE>()</CODE></A>
2979 <DD> Saturating increment operator.
2980
2981 </DL>
2982
2983 <HR>
2984
2985 Last updated on 20090220 23h06
2986 </BODY></HTML>