source: vis_dev/glu-2.3/src/cuBdd/doc/cuddAllAbs.html @ 99

Last change on this file since 99 was 13, checked in by cecile, 13 years ago

library glu 2.3
File size: 86.4 KB
Line 
1<html>
2<head><title>cudd package abstract (Internal)</title></head>
3<body>
4
5<h1>cudd package abstract (Internal)</h1>
6<h2>Internal data structures of the CUDD package.</h2>
7<hr>
8
9<!-- Function Abstracts -->
10
11<dl>
12<dt> <a href="cuddAllDet.html#Cudd_AddHook"><code>Cudd_AddHook()</code></a>
13<dd> Adds a function to a hook.
14
15<dt> <a href="cuddAllDet.html#Cudd_ApaAdd"><code>Cudd_ApaAdd()</code></a>
16<dd> Adds two arbitrary precision integers.
17
18<dt> <a href="cuddAllDet.html#Cudd_ApaCompareRatios"><code>Cudd_ApaCompareRatios()</code></a>
19<dd> Compares the ratios of two arbitrary precision integers to two unsigned ints.
20
21<dt> <a href="cuddAllDet.html#Cudd_ApaCompare"><code>Cudd_ApaCompare()</code></a>
22<dd> Compares two arbitrary precision integers.
23
24<dt> <a href="cuddAllDet.html#Cudd_ApaCopy"><code>Cudd_ApaCopy()</code></a>
25<dd> Makes a copy of an arbitrary precision integer.
26
27<dt> <a href="cuddAllDet.html#Cudd_ApaCountMinterm"><code>Cudd_ApaCountMinterm()</code></a>
28<dd> Counts the number of minterms of a DD.
29
30<dt> <a href="cuddAllDet.html#Cudd_ApaIntDivision"><code>Cudd_ApaIntDivision()</code></a>
31<dd> Divides an arbitrary precision integer by an integer.
32
33<dt> <a href="cuddAllDet.html#Cudd_ApaNumberOfDigits"><code>Cudd_ApaNumberOfDigits()</code></a>
34<dd> Finds the number of digits for an arbitrary precision integer.
35
36<dt> <a href="cuddAllDet.html#Cudd_ApaPowerOfTwo"><code>Cudd_ApaPowerOfTwo()</code></a>
37<dd> Sets an arbitrary precision integer to a power of two.
38
39<dt> <a href="cuddAllDet.html#Cudd_ApaPrintDecimal"><code>Cudd_ApaPrintDecimal()</code></a>
40<dd> Prints an arbitrary precision integer in decimal format.
41
42<dt> <a href="cuddAllDet.html#Cudd_ApaPrintDensity"><code>Cudd_ApaPrintDensity()</code></a>
43<dd> Prints the density of a BDD or ADD using arbitrary precision arithmetic.
44
45<dt> <a href="cuddAllDet.html#Cudd_ApaPrintExponential"><code>Cudd_ApaPrintExponential()</code></a>
46<dd> Prints an arbitrary precision integer in exponential format.
47
48<dt> <a href="cuddAllDet.html#Cudd_ApaPrintHex"><code>Cudd_ApaPrintHex()</code></a>
49<dd> Prints an arbitrary precision integer in hexadecimal format.
50
51<dt> <a href="cuddAllDet.html#Cudd_ApaPrintMintermExp"><code>Cudd_ApaPrintMintermExp()</code></a>
52<dd> Prints the number of minterms of a BDD or ADD in exponential format using arbitrary precision arithmetic.
53
54<dt> <a href="cuddAllDet.html#Cudd_ApaPrintMinterm"><code>Cudd_ApaPrintMinterm()</code></a>
55<dd> Prints the number of minterms of a BDD or ADD using arbitrary precision arithmetic.
56
57<dt> <a href="cuddAllDet.html#Cudd_ApaSetToLiteral"><code>Cudd_ApaSetToLiteral()</code></a>
58<dd> Sets an arbitrary precision integer to a one-digit literal.
59
60<dt> <a href="cuddAllDet.html#Cudd_ApaShiftRight"><code>Cudd_ApaShiftRight()</code></a>
61<dd> Shifts right an arbitrary precision integer by one binary place.
62
63<dt> <a href="cuddAllDet.html#Cudd_ApaShortDivision"><code>Cudd_ApaShortDivision()</code></a>
64<dd> Divides an arbitrary precision integer by a digit.
65
66<dt> <a href="cuddAllDet.html#Cudd_ApaSubtract"><code>Cudd_ApaSubtract()</code></a>
67<dd> Subtracts two arbitrary precision integers.
68
69<dt> <a href="cuddAllDet.html#Cudd_AutodynDisableZdd"><code>Cudd_AutodynDisableZdd()</code></a>
70<dd> Disables automatic dynamic reordering of ZDDs.
71
72<dt> <a href="cuddAllDet.html#Cudd_AutodynDisable"><code>Cudd_AutodynDisable()</code></a>
73<dd> Disables automatic dynamic reordering.
74
75<dt> <a href="cuddAllDet.html#Cudd_AutodynEnableZdd"><code>Cudd_AutodynEnableZdd()</code></a>
76<dd> Enables automatic dynamic reordering of ZDDs.
77
78<dt> <a href="cuddAllDet.html#Cudd_AutodynEnable"><code>Cudd_AutodynEnable()</code></a>
79<dd> Enables automatic dynamic reordering of BDDs and ADDs.
80
81<dt> <a href="cuddAllDet.html#Cudd_AverageDistance"><code>Cudd_AverageDistance()</code></a>
82<dd> Computes the average distance between adjacent nodes.
83
84<dt> <a href="cuddAllDet.html#Cudd_BddToAdd"><code>Cudd_BddToAdd()</code></a>
85<dd> Converts a BDD to a 0-1 ADD.
86
87<dt> <a href="cuddAllDet.html#Cudd_BddToCubeArray"><code>Cudd_BddToCubeArray()</code></a>
88<dd> Builds a positional array from the BDD of a cube.
89
90<dt> <a href="cuddAllDet.html#Cudd_BiasedOverApprox"><code>Cudd_BiasedOverApprox()</code></a>
91<dd> Extracts a dense superset from a BDD with the biased underapproximation method.
92
93<dt> <a href="cuddAllDet.html#Cudd_BiasedUnderApprox"><code>Cudd_BiasedUnderApprox()</code></a>
94<dd> Extracts a dense subset from a BDD with the biased underapproximation method.
95
96<dt> <a href="cuddAllDet.html#Cudd_CProjection"><code>Cudd_CProjection()</code></a>
97<dd> Computes the compatible projection of R w.r.t. cube Y.
98
99<dt> <a href="cuddAllDet.html#Cudd_CheckKeys"><code>Cudd_CheckKeys()</code></a>
100<dd> Checks for several conditions that should not occur.
101
102<dt> <a href="cuddAllDet.html#Cudd_CheckZeroRef"><code>Cudd_CheckZeroRef()</code></a>
103<dd> Checks the unique table for nodes with non-zero reference counts.
104
105<dt> <a href="cuddAllDet.html#Cudd_ClassifySupport"><code>Cudd_ClassifySupport()</code></a>
106<dd> Classifies the variables in the support of two DDs.
107
108<dt> <a href="cuddAllDet.html#Cudd_ClearErrorCode"><code>Cudd_ClearErrorCode()</code></a>
109<dd> Clear the error code of a manager.
110
111<dt> <a href="cuddAllDet.html#Cudd_CofMinterm"><code>Cudd_CofMinterm()</code></a>
112<dd> Computes the fraction of minterms in the on-set of all the positive cofactors of a BDD or ADD.
113
114<dt> <a href="cuddAllDet.html#Cudd_Cofactor"><code>Cudd_Cofactor()</code></a>
115<dd> Computes the cofactor of f with respect to g.
116
117<dt> <a href="cuddAllDet.html#Cudd_Complement"><code>Cudd_Complement()</code></a>
118<dd> Returns the complemented version of a pointer.
119
120<dt> <a href="cuddAllDet.html#Cudd_CountLeaves"><code>Cudd_CountLeaves()</code></a>
121<dd> Counts the number of leaves in a DD.
122
123<dt> <a href="cuddAllDet.html#Cudd_CountMinterm"><code>Cudd_CountMinterm()</code></a>
124<dd> Counts the number of minterms of a DD.
125
126<dt> <a href="cuddAllDet.html#Cudd_CountPathsToNonZero"><code>Cudd_CountPathsToNonZero()</code></a>
127<dd> Counts the number of paths to a non-zero terminal of a DD.
128
129<dt> <a href="cuddAllDet.html#Cudd_CountPath"><code>Cudd_CountPath()</code></a>
130<dd> Counts the number of paths of a DD.
131
132<dt> <a href="cuddAllDet.html#Cudd_CubeArrayToBdd"><code>Cudd_CubeArrayToBdd()</code></a>
133<dd> Builds the BDD of a cube from a positional array.
134
135<dt> <a href="cuddAllDet.html#Cudd_DagSize"><code>Cudd_DagSize()</code></a>
136<dd> Counts the number of nodes in a DD.
137
138<dt> <a href="cuddAllDet.html#Cudd_DeadAreCounted"><code>Cudd_DeadAreCounted()</code></a>
139<dd> Tells whether dead nodes are counted towards triggering reordering.
140
141<dt> <a href="cuddAllDet.html#Cudd_DebugCheck"><code>Cudd_DebugCheck()</code></a>
142<dd> Checks for inconsistencies in the DD heap.
143
144<dt> <a href="cuddAllDet.html#Cudd_Decreasing"><code>Cudd_Decreasing()</code></a>
145<dd> Determines whether a BDD is negative unate in a variable.
146
147<dt> <a href="cuddAllDet.html#Cudd_DelayedDerefBdd"><code>Cudd_DelayedDerefBdd()</code></a>
148<dd> Decreases the reference count of BDD node n.
149
150<dt> <a href="cuddAllDet.html#Cudd_Density"><code>Cudd_Density()</code></a>
151<dd> Computes the density of a BDD or ADD.
152
153<dt> <a href="cuddAllDet.html#Cudd_Deref"><code>Cudd_Deref()</code></a>
154<dd> Decreases the reference count of node.
155
156<dt> <a href="cuddAllDet.html#Cudd_DisableGarbageCollection"><code>Cudd_DisableGarbageCollection()</code></a>
157<dd> Disables garbage collection.
158
159<dt> <a href="cuddAllDet.html#Cudd_DisableReorderingReporting"><code>Cudd_DisableReorderingReporting()</code></a>
160<dd> Disables reporting of reordering stats.
161
162<dt> <a href="cuddAllDet.html#Cudd_DumpBlifBody"><code>Cudd_DumpBlifBody()</code></a>
163<dd> Writes a blif body representing the argument BDDs.
164
165<dt> <a href="cuddAllDet.html#Cudd_DumpBlif"><code>Cudd_DumpBlif()</code></a>
166<dd> Writes a blif file representing the argument BDDs.
167
168<dt> <a href="cuddAllDet.html#Cudd_DumpDDcal"><code>Cudd_DumpDDcal()</code></a>
169<dd> Writes a DDcal file representing the argument BDDs.
170
171<dt> <a href="cuddAllDet.html#Cudd_DumpDaVinci"><code>Cudd_DumpDaVinci()</code></a>
172<dd> Writes a daVinci file representing the argument BDDs.
173
174<dt> <a href="cuddAllDet.html#Cudd_DumpDot"><code>Cudd_DumpDot()</code></a>
175<dd> Writes a dot file representing the argument DDs.
176
177<dt> <a href="cuddAllDet.html#Cudd_DumpFactoredForm"><code>Cudd_DumpFactoredForm()</code></a>
178<dd> Writes factored forms representing the argument BDDs.
179
180<dt> <a href="cuddAllDet.html#Cudd_Dxygtdxz"><code>Cudd_Dxygtdxz()</code></a>
181<dd> Generates a BDD for the function d(x,y) &gt; d(x,z).
182
183<dt> <a href="cuddAllDet.html#Cudd_Dxygtdyz"><code>Cudd_Dxygtdyz()</code></a>
184<dd> Generates a BDD for the function d(x,y) &gt; d(y,z).
185
186<dt> <a href="cuddAllDet.html#Cudd_EnableGarbageCollection"><code>Cudd_EnableGarbageCollection()</code></a>
187<dd> Enables garbage collection.
188
189<dt> <a href="cuddAllDet.html#Cudd_EnableReorderingReporting"><code>Cudd_EnableReorderingReporting()</code></a>
190<dd> Enables reporting of reordering stats.
191
192<dt> <a href="cuddAllDet.html#Cudd_EpdCountMinterm"><code>Cudd_EpdCountMinterm()</code></a>
193<dd> Counts the number of minterms of a DD with extended precision.
194
195<dt> <a href="cuddAllDet.html#Cudd_EqualSupNorm"><code>Cudd_EqualSupNorm()</code></a>
196<dd> Compares two ADDs for equality within tolerance.
197
198<dt> <a href="cuddAllDet.html#Cudd_EquivDC"><code>Cudd_EquivDC()</code></a>
199<dd> Tells whether F and G are identical wherever D is 0.
200
201<dt> <a href="cuddAllDet.html#Cudd_EstimateCofactorSimple"><code>Cudd_EstimateCofactorSimple()</code></a>
202<dd> Estimates the number of nodes in a cofactor of a DD.
203
204<dt> <a href="cuddAllDet.html#Cudd_EstimateCofactor"><code>Cudd_EstimateCofactor()</code></a>
205<dd> Estimates the number of nodes in a cofactor of a DD.
206
207<dt> <a href="cuddAllDet.html#Cudd_Eval"><code>Cudd_Eval()</code></a>
208<dd> Returns the value of a DD for a given variable assignment.
209
210<dt> <a href="cuddAllDet.html#Cudd_ExpectedUsedSlots"><code>Cudd_ExpectedUsedSlots()</code></a>
211<dd> Computes the expected fraction of used slots in the unique table.
212
213<dt> <a href="cuddAllDet.html#Cudd_E"><code>Cudd_E()</code></a>
214<dd> Returns the else child of an internal node.
215
216<dt> <a href="cuddAllDet.html#Cudd_FindEssential"><code>Cudd_FindEssential()</code></a>
217<dd> Finds the essential variables of a DD.
218
219<dt> <a href="cuddAllDet.html#Cudd_FindTwoLiteralClauses"><code>Cudd_FindTwoLiteralClauses()</code></a>
220<dd> Finds the two literal clauses of a DD.
221
222<dt> <a href="cuddAllDet.html#Cudd_FirstCube"><code>Cudd_FirstCube()</code></a>
223<dd> Finds the first cube of a decision diagram.
224
225<dt> <a href="cuddAllDet.html#Cudd_FirstNode"><code>Cudd_FirstNode()</code></a>
226<dd> Finds the first node of a decision diagram.
227
228<dt> <a href="cuddAllDet.html#Cudd_FirstPrime"><code>Cudd_FirstPrime()</code></a>
229<dd> Finds the first prime of a Boolean function.
230
231<dt> <a href="cuddAllDet.html#Cudd_ForeachCube"><code>Cudd_ForeachCube()</code></a>
232<dd> Iterates over the cubes of a decision diagram.
233
234<dt> <a href="cuddAllDet.html#Cudd_ForeachNode"><code>Cudd_ForeachNode()</code></a>
235<dd> Iterates over the nodes of a decision diagram.
236
237<dt> <a href="cuddAllDet.html#Cudd_ForeachPrime"><code>Cudd_ForeachPrime()</code></a>
238<dd> Iterates over the primes of a Boolean function.
239
240<dt> <a href="cuddAllDet.html#Cudd_FreeTree"><code>Cudd_FreeTree()</code></a>
241<dd> Frees the variable group tree of the manager.
242
243<dt> <a href="cuddAllDet.html#Cudd_FreeZddTree"><code>Cudd_FreeZddTree()</code></a>
244<dd> Frees the variable group tree of the manager.
245
246<dt> <a href="cuddAllDet.html#Cudd_GarbageCollectionEnabled"><code>Cudd_GarbageCollectionEnabled()</code></a>
247<dd> Tells whether garbage collection is enabled.
248
249<dt> <a href="cuddAllDet.html#Cudd_GenFree"><code>Cudd_GenFree()</code></a>
250<dd> Frees a CUDD generator.
251
252<dt> <a href="cuddAllDet.html#Cudd_Increasing"><code>Cudd_Increasing()</code></a>
253<dd> Determines whether a BDD is positive unate in a variable.
254
255<dt> <a href="cuddAllDet.html#Cudd_IndicesToCube"><code>Cudd_IndicesToCube()</code></a>
256<dd> Builds a cube of BDD variables from an array of indices.
257
258<dt> <a href="cuddAllDet.html#Cudd_Init"><code>Cudd_Init()</code></a>
259<dd> Creates a new DD manager.
260
261<dt> <a href="cuddAllDet.html#Cudd_IsComplement"><code>Cudd_IsComplement()</code></a>
262<dd> Returns 1 if a pointer is complemented.
263
264<dt> <a href="cuddAllDet.html#Cudd_IsConstant"><code>Cudd_IsConstant()</code></a>
265<dd> Returns 1 if the node is a constant node.
266
267<dt> <a href="cuddAllDet.html#Cudd_IsGenEmpty"><code>Cudd_IsGenEmpty()</code></a>
268<dd> Queries the status of a generator.
269
270<dt> <a href="cuddAllDet.html#Cudd_IsInHook"><code>Cudd_IsInHook()</code></a>
271<dd> Checks whether a function is in a hook.
272
273<dt> <a href="cuddAllDet.html#Cudd_IsNonConstant"><code>Cudd_IsNonConstant()</code></a>
274<dd> Returns 1 if a DD node is not constant.
275
276<dt> <a href="cuddAllDet.html#Cudd_IterDerefBdd"><code>Cudd_IterDerefBdd()</code></a>
277<dd> Decreases the reference count of BDD node n.
278
279<dt> <a href="cuddAllDet.html#Cudd_LargestCube"><code>Cudd_LargestCube()</code></a>
280<dd> Finds a largest cube in a DD.
281
282<dt> <a href="cuddAllDet.html#Cudd_MakeBddFromZddCover"><code>Cudd_MakeBddFromZddCover()</code></a>
283<dd> Converts a ZDD cover to a BDD graph.
284
285<dt> <a href="cuddAllDet.html#Cudd_MakeTreeNode"><code>Cudd_MakeTreeNode()</code></a>
286<dd> Creates a new variable group.
287
288<dt> <a href="cuddAllDet.html#Cudd_MakeZddTreeNode"><code>Cudd_MakeZddTreeNode()</code></a>
289<dd> Creates a new ZDD variable group.
290
291<dt> <a href="cuddAllDet.html#Cudd_MinHammingDist"><code>Cudd_MinHammingDist()</code></a>
292<dd> Returns the minimum Hamming distance between f and minterm.
293
294<dt> <a href="cuddAllDet.html#Cudd_NewApaNumber"><code>Cudd_NewApaNumber()</code></a>
295<dd> Allocates memory for an arbitrary precision integer.
296
297<dt> <a href="cuddAllDet.html#Cudd_NextCube"><code>Cudd_NextCube()</code></a>
298<dd> Generates the next cube of a decision diagram onset.
299
300<dt> <a href="cuddAllDet.html#Cudd_NextNode"><code>Cudd_NextNode()</code></a>
301<dd> Finds the next node of a decision diagram.
302
303<dt> <a href="cuddAllDet.html#Cudd_NextPrime"><code>Cudd_NextPrime()</code></a>
304<dd> Generates the next prime of a Boolean function.
305
306<dt> <a href="cuddAllDet.html#Cudd_NodeReadIndex"><code>Cudd_NodeReadIndex()</code></a>
307<dd> Returns the index of the node.
308
309<dt> <a href="cuddAllDet.html#Cudd_NotCond"><code>Cudd_NotCond()</code></a>
310<dd> Complements a DD if a condition is true.
311
312<dt> <a href="cuddAllDet.html#Cudd_Not"><code>Cudd_Not()</code></a>
313<dd> Complements a DD.
314
315<dt> <a href="cuddAllDet.html#Cudd_OutOfMem"><code>Cudd_OutOfMem()</code></a>
316<dd> Warns that a memory allocation failed.
317
318<dt> <a href="cuddAllDet.html#Cudd_OverApprox"><code>Cudd_OverApprox()</code></a>
319<dd> Extracts a dense superset from a BDD with Shiple's underapproximation method.
320
321<dt> <a href="cuddAllDet.html#Cudd_Prime"><code>Cudd_Prime()</code></a>
322<dd> Returns the next prime &gt;= p.
323
324<dt> <a href="cuddAllDet.html#Cudd_PrintDebug"><code>Cudd_PrintDebug()</code></a>
325<dd> Prints to the standard output a DD and its statistics.
326
327<dt> <a href="cuddAllDet.html#Cudd_PrintInfo"><code>Cudd_PrintInfo()</code></a>
328<dd> Prints out statistics and settings for a CUDD manager.
329
330<dt> <a href="cuddAllDet.html#Cudd_PrintLinear"><code>Cudd_PrintLinear()</code></a>
331<dd> Prints the linear transform matrix.
332
333<dt> <a href="cuddAllDet.html#Cudd_PrintMinterm"><code>Cudd_PrintMinterm()</code></a>
334<dd> Prints a disjoint sum of products.
335
336<dt> <a href="cuddAllDet.html#Cudd_PrintTwoLiteralClauses"><code>Cudd_PrintTwoLiteralClauses()</code></a>
337<dd> Prints the two literal clauses of a DD.
338
339<dt> <a href="cuddAllDet.html#Cudd_PrintVersion"><code>Cudd_PrintVersion()</code></a>
340<dd> Prints the package version number.
341
342<dt> <a href="cuddAllDet.html#Cudd_PrioritySelect"><code>Cudd_PrioritySelect()</code></a>
343<dd> Selects pairs from R using a priority function.
344
345<dt> <a href="cuddAllDet.html#Cudd_Quit"><code>Cudd_Quit()</code></a>
346<dd> Deletes resources associated with a DD manager.
347
348<dt> <a href="cuddAllDet.html#Cudd_Random"><code>Cudd_Random()</code></a>
349<dd> Portable random number generator.
350
351<dt> <a href="cuddAllDet.html#Cudd_ReadArcviolation"><code>Cudd_ReadArcviolation()</code></a>
352<dd> Returns the current value of the arcviolation parameter used in group sifting.
353
354<dt> <a href="cuddAllDet.html#Cudd_ReadBackground"><code>Cudd_ReadBackground()</code></a>
355<dd> Reads the background constant of the manager.
356
357<dt> <a href="cuddAllDet.html#Cudd_ReadCacheHits"><code>Cudd_ReadCacheHits()</code></a>
358<dd> Returns the number of cache hits.
359
360<dt> <a href="cuddAllDet.html#Cudd_ReadCacheLookUps"><code>Cudd_ReadCacheLookUps()</code></a>
361<dd> Returns the number of cache look-ups.
362
363<dt> <a href="cuddAllDet.html#Cudd_ReadCacheSlots"><code>Cudd_ReadCacheSlots()</code></a>
364<dd> Reads the number of slots in the cache.
365
366<dt> <a href="cuddAllDet.html#Cudd_ReadCacheUsedSlots"><code>Cudd_ReadCacheUsedSlots()</code></a>
367<dd> Reads the fraction of used slots in the cache.
368
369<dt> <a href="cuddAllDet.html#Cudd_ReadDead"><code>Cudd_ReadDead()</code></a>
370<dd> Returns the number of dead nodes in the unique table.
371
372<dt> <a href="cuddAllDet.html#Cudd_ReadEpsilon"><code>Cudd_ReadEpsilon()</code></a>
373<dd> Reads the epsilon parameter of the manager.
374
375<dt> <a href="cuddAllDet.html#Cudd_ReadErrorCode"><code>Cudd_ReadErrorCode()</code></a>
376<dd> Returns the code of the last error.
377
378<dt> <a href="cuddAllDet.html#Cudd_ReadGarbageCollectionTime"><code>Cudd_ReadGarbageCollectionTime()</code></a>
379<dd> Returns the time spent in garbage collection.
380
381<dt> <a href="cuddAllDet.html#Cudd_ReadGarbageCollections"><code>Cudd_ReadGarbageCollections()</code></a>
382<dd> Returns the number of times garbage collection has occurred.
383
384<dt> <a href="cuddAllDet.html#Cudd_ReadGroupcheck"><code>Cudd_ReadGroupcheck()</code></a>
385<dd> Reads the groupcheck parameter of the manager.
386
387<dt> <a href="cuddAllDet.html#Cudd_ReadIndex"><code>Cudd_ReadIndex()</code></a>
388<dd> Returns the current position in the order of variable index.
389
390<dt> <a href="cuddAllDet.html#Cudd_ReadInvPermZdd"><code>Cudd_ReadInvPermZdd()</code></a>
391<dd> Returns the index of the ZDD variable currently in the i-th position of the order.
392
393<dt> <a href="cuddAllDet.html#Cudd_ReadInvPerm"><code>Cudd_ReadInvPerm()</code></a>
394<dd> Returns the index of the variable currently in the i-th position of the order.
395
396<dt> <a href="cuddAllDet.html#Cudd_ReadIthClause"><code>Cudd_ReadIthClause()</code></a>
397<dd> Accesses the i-th clause of a DD.
398
399<dt> <a href="cuddAllDet.html#Cudd_ReadKeys"><code>Cudd_ReadKeys()</code></a>
400<dd> Returns the number of nodes in the unique table.
401
402<dt> <a href="cuddAllDet.html#Cudd_ReadLinear"><code>Cudd_ReadLinear()</code></a>
403<dd> Reads an entry of the linear transform matrix.
404
405<dt> <a href="cuddAllDet.html#Cudd_ReadLogicZero"><code>Cudd_ReadLogicZero()</code></a>
406<dd> Returns the logic zero constant of the manager.
407
408<dt> <a href="cuddAllDet.html#Cudd_ReadLooseUpTo"><code>Cudd_ReadLooseUpTo()</code></a>
409<dd> Reads the looseUpTo parameter of the manager.
410
411<dt> <a href="cuddAllDet.html#Cudd_ReadMaxCacheHard"><code>Cudd_ReadMaxCacheHard()</code></a>
412<dd> Reads the maxCacheHard parameter of the manager.
413
414<dt> <a href="cuddAllDet.html#Cudd_ReadMaxCache"><code>Cudd_ReadMaxCache()</code></a>
415<dd> Returns the soft limit for the cache size.
416
417<dt> <a href="cuddAllDet.html#Cudd_ReadMaxGrowthAlternate"><code>Cudd_ReadMaxGrowthAlternate()</code></a>
418<dd> Reads the maxGrowthAlt parameter of the manager.
419
420<dt> <a href="cuddAllDet.html#Cudd_ReadMaxGrowth"><code>Cudd_ReadMaxGrowth()</code></a>
421<dd> Reads the maxGrowth parameter of the manager.
422
423<dt> <a href="cuddAllDet.html#Cudd_ReadMaxLive"><code>Cudd_ReadMaxLive()</code></a>
424<dd> Reads the maximum allowed number of live nodes.
425
426<dt> <a href="cuddAllDet.html#Cudd_ReadMaxMemory"><code>Cudd_ReadMaxMemory()</code></a>
427<dd> Reads the maximum allowed memory.
428
429<dt> <a href="cuddAllDet.html#Cudd_ReadMemoryInUse"><code>Cudd_ReadMemoryInUse()</code></a>
430<dd> Returns the memory in use by the manager measured in bytes.
431
432<dt> <a href="cuddAllDet.html#Cudd_ReadMinDead"><code>Cudd_ReadMinDead()</code></a>
433<dd> Reads the minDead parameter of the manager.
434
435<dt> <a href="cuddAllDet.html#Cudd_ReadMinHit"><code>Cudd_ReadMinHit()</code></a>
436<dd> Reads the hit rate that causes resizinig of the computed table.
437
438<dt> <a href="cuddAllDet.html#Cudd_ReadMinusInfinity"><code>Cudd_ReadMinusInfinity()</code></a>
439<dd> Reads the minus-infinity constant from the manager.
440
441<dt> <a href="cuddAllDet.html#Cudd_ReadNextReordering"><code>Cudd_ReadNextReordering()</code></a>
442<dd> Returns the threshold for the next dynamic reordering.
443
444<dt> <a href="cuddAllDet.html#Cudd_ReadNodeCount"><code>Cudd_ReadNodeCount()</code></a>
445<dd> Reports the number of nodes in BDDs and ADDs.
446
447<dt> <a href="cuddAllDet.html#Cudd_ReadNodesDropped"><code>Cudd_ReadNodesDropped()</code></a>
448<dd> Returns the number of nodes dropped.
449
450<dt> <a href="cuddAllDet.html#Cudd_ReadNodesFreed"><code>Cudd_ReadNodesFreed()</code></a>
451<dd> Returns the number of nodes freed.
452
453<dt> <a href="cuddAllDet.html#Cudd_ReadNumberXovers"><code>Cudd_ReadNumberXovers()</code></a>
454<dd> Reads the current number of crossovers used by the genetic algorithm for reordering.
455
456<dt> <a href="cuddAllDet.html#Cudd_ReadOne"><code>Cudd_ReadOne()</code></a>
457<dd> Returns the one constant of the manager.
458
459<dt> <a href="cuddAllDet.html#Cudd_ReadPeakLiveNodeCount"><code>Cudd_ReadPeakLiveNodeCount()</code></a>
460<dd> Reports the peak number of live nodes.
461
462<dt> <a href="cuddAllDet.html#Cudd_ReadPeakNodeCount"><code>Cudd_ReadPeakNodeCount()</code></a>
463<dd> Reports the peak number of nodes.
464
465<dt> <a href="cuddAllDet.html#Cudd_ReadPermZdd"><code>Cudd_ReadPermZdd()</code></a>
466<dd> Returns the current position of the i-th ZDD variable in the order.
467
468<dt> <a href="cuddAllDet.html#Cudd_ReadPerm"><code>Cudd_ReadPerm()</code></a>
469<dd> Returns the current position of the i-th variable in the order.
470
471<dt> <a href="cuddAllDet.html#Cudd_ReadPlusInfinity"><code>Cudd_ReadPlusInfinity()</code></a>
472<dd> Reads the plus-infinity constant from the manager.
473
474<dt> <a href="cuddAllDet.html#Cudd_ReadPopulationSize"><code>Cudd_ReadPopulationSize()</code></a>
475<dd> Reads the current size of the population used by the genetic algorithm for reordering.
476
477<dt> <a href="cuddAllDet.html#Cudd_ReadRecomb"><code>Cudd_ReadRecomb()</code></a>
478<dd> Returns the current value of the recombination parameter used in group sifting.
479
480<dt> <a href="cuddAllDet.html#Cudd_ReadRecursiveCalls"><code>Cudd_ReadRecursiveCalls()</code></a>
481<dd> Returns the number of recursive calls.
482
483<dt> <a href="cuddAllDet.html#Cudd_ReadReorderingCycle"><code>Cudd_ReadReorderingCycle()</code></a>
484<dd> Reads the reordCycle parameter of the manager.
485
486<dt> <a href="cuddAllDet.html#Cudd_ReadReorderingTime"><code>Cudd_ReadReorderingTime()</code></a>
487<dd> Returns the time spent in reordering.
488
489<dt> <a href="cuddAllDet.html#Cudd_ReadReorderings"><code>Cudd_ReadReorderings()</code></a>
490<dd> Returns the number of times reordering has occurred.
491
492<dt> <a href="cuddAllDet.html#Cudd_ReadSiftMaxSwap"><code>Cudd_ReadSiftMaxSwap()</code></a>
493<dd> Reads the siftMaxSwap parameter of the manager.
494
495<dt> <a href="cuddAllDet.html#Cudd_ReadSiftMaxVar"><code>Cudd_ReadSiftMaxVar()</code></a>
496<dd> Reads the siftMaxVar parameter of the manager.
497
498<dt> <a href="cuddAllDet.html#Cudd_ReadSize"><code>Cudd_ReadSize()</code></a>
499<dd> Returns the number of BDD variables in existance.
500
501<dt> <a href="cuddAllDet.html#Cudd_ReadSlots"><code>Cudd_ReadSlots()</code></a>
502<dd> Returns the total number of slots of the unique table.
503
504<dt> <a href="cuddAllDet.html#Cudd_ReadStderr"><code>Cudd_ReadStderr()</code></a>
505<dd> Reads the stderr of a manager.
506
507<dt> <a href="cuddAllDet.html#Cudd_ReadStdout"><code>Cudd_ReadStdout()</code></a>
508<dd> Reads the stdout of a manager.
509
510<dt> <a href="cuddAllDet.html#Cudd_ReadSwapSteps"><code>Cudd_ReadSwapSteps()</code></a>
511<dd> Reads the number of elementary reordering steps.
512
513<dt> <a href="cuddAllDet.html#Cudd_ReadSymmviolation"><code>Cudd_ReadSymmviolation()</code></a>
514<dd> Returns the current value of the symmviolation parameter used in group sifting.
515
516<dt> <a href="cuddAllDet.html#Cudd_ReadTree"><code>Cudd_ReadTree()</code></a>
517<dd> Returns the variable group tree of the manager.
518
519<dt> <a href="cuddAllDet.html#Cudd_ReadUniqueLinks"><code>Cudd_ReadUniqueLinks()</code></a>
520<dd> Returns the number of links followed in the unique table.
521
522<dt> <a href="cuddAllDet.html#Cudd_ReadUniqueLookUps"><code>Cudd_ReadUniqueLookUps()</code></a>
523<dd> Returns the number of look-ups in the unique table.
524
525<dt> <a href="cuddAllDet.html#Cudd_ReadUsedSlots"><code>Cudd_ReadUsedSlots()</code></a>
526<dd> Reads the fraction of used slots in the unique table.
527
528<dt> <a href="cuddAllDet.html#Cudd_ReadVars"><code>Cudd_ReadVars()</code></a>
529<dd> Returns the i-th element of the vars array.
530
531<dt> <a href="cuddAllDet.html#Cudd_ReadZddOne"><code>Cudd_ReadZddOne()</code></a>
532<dd> Returns the ZDD for the constant 1 function.
533
534<dt> <a href="cuddAllDet.html#Cudd_ReadZddSize"><code>Cudd_ReadZddSize()</code></a>
535<dd> Returns the number of ZDD variables in existance.
536
537<dt> <a href="cuddAllDet.html#Cudd_ReadZddTree"><code>Cudd_ReadZddTree()</code></a>
538<dd> Returns the variable group tree of the manager.
539
540<dt> <a href="cuddAllDet.html#Cudd_ReadZero"><code>Cudd_ReadZero()</code></a>
541<dd> Returns the zero constant of the manager.
542
543<dt> <a href="cuddAllDet.html#Cudd_RecursiveDerefZdd"><code>Cudd_RecursiveDerefZdd()</code></a>
544<dd> Decreases the reference count of ZDD node n.
545
546<dt> <a href="cuddAllDet.html#Cudd_RecursiveDeref"><code>Cudd_RecursiveDeref()</code></a>
547<dd> Decreases the reference count of node n.
548
549<dt> <a href="cuddAllDet.html#Cudd_ReduceHeap"><code>Cudd_ReduceHeap()</code></a>
550<dd> Main dynamic reordering routine.
551
552<dt> <a href="cuddAllDet.html#Cudd_Ref"><code>Cudd_Ref()</code></a>
553<dd> Increases the reference count of a node, if it is not saturated.
554
555<dt> <a href="cuddAllDet.html#Cudd_Regular"><code>Cudd_Regular()</code></a>
556<dd> Returns the regular version of a pointer.
557
558<dt> <a href="cuddAllDet.html#Cudd_RemapOverApprox"><code>Cudd_RemapOverApprox()</code></a>
559<dd> Extracts a dense superset from a BDD with the remapping underapproximation method.
560
561<dt> <a href="cuddAllDet.html#Cudd_RemapUnderApprox"><code>Cudd_RemapUnderApprox()</code></a>
562<dd> Extracts a dense subset from a BDD with the remapping underapproximation method.
563
564<dt> <a href="cuddAllDet.html#Cudd_RemoveHook"><code>Cudd_RemoveHook()</code></a>
565<dd> Removes a function from a hook.
566
567<dt> <a href="cuddAllDet.html#Cudd_ReorderingReporting"><code>Cudd_ReorderingReporting()</code></a>
568<dd> Returns 1 if reporting of reordering stats is enabled.
569
570<dt> <a href="cuddAllDet.html#Cudd_ReorderingStatusZdd"><code>Cudd_ReorderingStatusZdd()</code></a>
571<dd> Reports the status of automatic dynamic reordering of ZDDs.
572
573<dt> <a href="cuddAllDet.html#Cudd_ReorderingStatus"><code>Cudd_ReorderingStatus()</code></a>
574<dd> Reports the status of automatic dynamic reordering of BDDs and ADDs.
575
576<dt> <a href="cuddAllDet.html#Cudd_SetArcviolation"><code>Cudd_SetArcviolation()</code></a>
577<dd> Sets the value of the arcviolation parameter used in group sifting.
578
579<dt> <a href="cuddAllDet.html#Cudd_SetBackground"><code>Cudd_SetBackground()</code></a>
580<dd> Sets the background constant of the manager.
581
582<dt> <a href="cuddAllDet.html#Cudd_SetEpsilon"><code>Cudd_SetEpsilon()</code></a>
583<dd> Sets the epsilon parameter of the manager to ep.
584
585<dt> <a href="cuddAllDet.html#Cudd_SetGroupcheck"><code>Cudd_SetGroupcheck()</code></a>
586<dd> Sets the parameter groupcheck of the manager to gc.
587
588<dt> <a href="cuddAllDet.html#Cudd_SetLooseUpTo"><code>Cudd_SetLooseUpTo()</code></a>
589<dd> Sets the looseUpTo parameter of the manager.
590
591<dt> <a href="cuddAllDet.html#Cudd_SetMaxCacheHard"><code>Cudd_SetMaxCacheHard()</code></a>
592<dd> Sets the maxCacheHard parameter of the manager.
593
594<dt> <a href="cuddAllDet.html#Cudd_SetMaxGrowthAlternate"><code>Cudd_SetMaxGrowthAlternate()</code></a>
595<dd> Sets the maxGrowthAlt parameter of the manager.
596
597<dt> <a href="cuddAllDet.html#Cudd_SetMaxGrowth"><code>Cudd_SetMaxGrowth()</code></a>
598<dd> Sets the maxGrowth parameter of the manager.
599
600<dt> <a href="cuddAllDet.html#Cudd_SetMaxLive"><code>Cudd_SetMaxLive()</code></a>
601<dd> Sets the maximum allowed number of live nodes.
602
603<dt> <a href="cuddAllDet.html#Cudd_SetMaxMemory"><code>Cudd_SetMaxMemory()</code></a>
604<dd> Sets the maximum allowed memory.
605
606<dt> <a href="cuddAllDet.html#Cudd_SetMinHit"><code>Cudd_SetMinHit()</code></a>
607<dd> Sets the hit rate that causes resizinig of the computed table.
608
609<dt> <a href="cuddAllDet.html#Cudd_SetNextReordering"><code>Cudd_SetNextReordering()</code></a>
610<dd> Sets the threshold for the next dynamic reordering.
611
612<dt> <a href="cuddAllDet.html#Cudd_SetNumberXovers"><code>Cudd_SetNumberXovers()</code></a>
613<dd> Sets the number of crossovers used by the genetic algorithm for reordering.
614
615<dt> <a href="cuddAllDet.html#Cudd_SetPopulationSize"><code>Cudd_SetPopulationSize()</code></a>
616<dd> Sets the size of the population used by the genetic algorithm for reordering.
617
618<dt> <a href="cuddAllDet.html#Cudd_SetRecomb"><code>Cudd_SetRecomb()</code></a>
619<dd> Sets the value of the recombination parameter used in group sifting.
620
621<dt> <a href="cuddAllDet.html#Cudd_SetReorderingCycle"><code>Cudd_SetReorderingCycle()</code></a>
622<dd> Sets the reordCycle parameter of the manager.
623
624<dt> <a href="cuddAllDet.html#Cudd_SetSiftMaxSwap"><code>Cudd_SetSiftMaxSwap()</code></a>
625<dd> Sets the siftMaxSwap parameter of the manager.
626
627<dt> <a href="cuddAllDet.html#Cudd_SetSiftMaxVar"><code>Cudd_SetSiftMaxVar()</code></a>
628<dd> Sets the siftMaxVar parameter of the manager.
629
630<dt> <a href="cuddAllDet.html#Cudd_SetStderr"><code>Cudd_SetStderr()</code></a>
631<dd> Sets the stderr of a manager.
632
633<dt> <a href="cuddAllDet.html#Cudd_SetStdout"><code>Cudd_SetStdout()</code></a>
634<dd> Sets the stdout of a manager.
635
636<dt> <a href="cuddAllDet.html#Cudd_SetSymmviolation"><code>Cudd_SetSymmviolation()</code></a>
637<dd> Sets the value of the symmviolation parameter used in group sifting.
638
639<dt> <a href="cuddAllDet.html#Cudd_SetTree"><code>Cudd_SetTree()</code></a>
640<dd> Sets the variable group tree of the manager.
641
642<dt> <a href="cuddAllDet.html#Cudd_SetVarMap"><code>Cudd_SetVarMap()</code></a>
643<dd> Registers a variable mapping with the manager.
644
645<dt> <a href="cuddAllDet.html#Cudd_SetZddTree"><code>Cudd_SetZddTree()</code></a>
646<dd> Sets the ZDD variable group tree of the manager.
647
648<dt> <a href="cuddAllDet.html#Cudd_SharingSize"><code>Cudd_SharingSize()</code></a>
649<dd> Counts the number of nodes in an array of DDs.
650
651<dt> <a href="cuddAllDet.html#Cudd_ShortestLength"><code>Cudd_ShortestLength()</code></a>
652<dd> Find the length of the shortest path(s) in a DD.
653
654<dt> <a href="cuddAllDet.html#Cudd_ShortestPath"><code>Cudd_ShortestPath()</code></a>
655<dd> Finds a shortest path in a DD.
656
657<dt> <a href="cuddAllDet.html#Cudd_ShuffleHeap"><code>Cudd_ShuffleHeap()</code></a>
658<dd> Reorders variables according to given permutation.
659
660<dt> <a href="cuddAllDet.html#Cudd_SolveEqn"><code>Cudd_SolveEqn()</code></a>
661<dd> Implements the solution of F(x,y) = 0.
662
663<dt> <a href="cuddAllDet.html#Cudd_SplitSet"><code>Cudd_SplitSet()</code></a>
664<dd> Returns m minterms from a BDD.
665
666<dt> <a href="cuddAllDet.html#Cudd_Srandom"><code>Cudd_Srandom()</code></a>
667<dd> Initializer for the portable random number generator.
668
669<dt> <a href="cuddAllDet.html#Cudd_StdPostReordHook"><code>Cudd_StdPostReordHook()</code></a>
670<dd> Sample hook function to call after reordering.
671
672<dt> <a href="cuddAllDet.html#Cudd_StdPreReordHook"><code>Cudd_StdPreReordHook()</code></a>
673<dd> Sample hook function to call before reordering.
674
675<dt> <a href="cuddAllDet.html#Cudd_SubsetCompress"><code>Cudd_SubsetCompress()</code></a>
676<dd> Find a dense subset of BDD <code>f</code>.
677
678<dt> <a href="cuddAllDet.html#Cudd_SubsetHeavyBranch"><code>Cudd_SubsetHeavyBranch()</code></a>
679<dd> Extracts a dense subset from a BDD with the heavy branch heuristic.
680
681<dt> <a href="cuddAllDet.html#Cudd_SubsetShortPaths"><code>Cudd_SubsetShortPaths()</code></a>
682<dd> Extracts a dense subset from a BDD with the shortest paths heuristic.
683
684<dt> <a href="cuddAllDet.html#Cudd_SubsetWithMaskVars"><code>Cudd_SubsetWithMaskVars()</code></a>
685<dd> Extracts a subset from a BDD.
686
687<dt> <a href="cuddAllDet.html#Cudd_SupersetCompress"><code>Cudd_SupersetCompress()</code></a>
688<dd> Find a dense superset of BDD <code>f</code>.
689
690<dt> <a href="cuddAllDet.html#Cudd_SupersetHeavyBranch"><code>Cudd_SupersetHeavyBranch()</code></a>
691<dd> Extracts a dense superset from a BDD with the heavy branch heuristic.
692
693<dt> <a href="cuddAllDet.html#Cudd_SupersetShortPaths"><code>Cudd_SupersetShortPaths()</code></a>
694<dd> Extracts a dense superset from a BDD with the shortest paths heuristic.
695
696<dt> <a href="cuddAllDet.html#Cudd_SupportIndex"><code>Cudd_SupportIndex()</code></a>
697<dd> Finds the variables on which a DD depends.
698
699<dt> <a href="cuddAllDet.html#Cudd_SupportSize"><code>Cudd_SupportSize()</code></a>
700<dd> Counts the variables on which a DD depends.
701
702<dt> <a href="cuddAllDet.html#Cudd_Support"><code>Cudd_Support()</code></a>
703<dd> Finds the variables on which a DD depends.
704
705<dt> <a href="cuddAllDet.html#Cudd_SymmProfile"><code>Cudd_SymmProfile()</code></a>
706<dd> Prints statistics on symmetric variables.
707
708<dt> <a href="cuddAllDet.html#Cudd_TurnOffCountDead"><code>Cudd_TurnOffCountDead()</code></a>
709<dd> Causes the dead nodes not to be counted towards triggering reordering.
710
711<dt> <a href="cuddAllDet.html#Cudd_TurnOnCountDead"><code>Cudd_TurnOnCountDead()</code></a>
712<dd> Causes the dead nodes to be counted towards triggering reordering.
713
714<dt> <a href="cuddAllDet.html#Cudd_T"><code>Cudd_T()</code></a>
715<dd> Returns the then child of an internal node.
716
717<dt> <a href="cuddAllDet.html#Cudd_UnderApprox"><code>Cudd_UnderApprox()</code></a>
718<dd> Extracts a dense subset from a BDD with Shiple's underapproximation method.
719
720<dt> <a href="cuddAllDet.html#Cudd_VectorSupportIndex"><code>Cudd_VectorSupportIndex()</code></a>
721<dd> Finds the variables on which a set of DDs depends.
722
723<dt> <a href="cuddAllDet.html#Cudd_VectorSupportSize"><code>Cudd_VectorSupportSize()</code></a>
724<dd> Counts the variables on which a set of DDs depends.
725
726<dt> <a href="cuddAllDet.html#Cudd_VectorSupport"><code>Cudd_VectorSupport()</code></a>
727<dd> Finds the variables on which a set of DDs depends.
728
729<dt> <a href="cuddAllDet.html#Cudd_VerifySol"><code>Cudd_VerifySol()</code></a>
730<dd> Checks the solution of F(x,y) = 0.
731
732<dt> <a href="cuddAllDet.html#Cudd_V"><code>Cudd_V()</code></a>
733<dd> Returns the value of a constant node.
734
735<dt> <a href="cuddAllDet.html#Cudd_Xeqy"><code>Cudd_Xeqy()</code></a>
736<dd> Generates a BDD for the function x==y.
737
738<dt> <a href="cuddAllDet.html#Cudd_Xgty"><code>Cudd_Xgty()</code></a>
739<dd> Generates a BDD for the function x &gt; y.
740
741<dt> <a href="cuddAllDet.html#Cudd_addAgreement"><code>Cudd_addAgreement()</code></a>
742<dd> f if f==g; background if f!=g.
743
744<dt> <a href="cuddAllDet.html#Cudd_addApply"><code>Cudd_addApply()</code></a>
745<dd> Applies op to the corresponding discriminants of f and g.
746
747<dt> <a href="cuddAllDet.html#Cudd_addBddInterval"><code>Cudd_addBddInterval()</code></a>
748<dd> Converts an ADD to a BDD.
749
750<dt> <a href="cuddAllDet.html#Cudd_addBddIthBit"><code>Cudd_addBddIthBit()</code></a>
751<dd> Converts an ADD to a BDD by extracting the i-th bit from the leaves.
752
753<dt> <a href="cuddAllDet.html#Cudd_addBddPattern"><code>Cudd_addBddPattern()</code></a>
754<dd> Converts an ADD to a BDD.
755
756<dt> <a href="cuddAllDet.html#Cudd_addBddStrictThreshold"><code>Cudd_addBddStrictThreshold()</code></a>
757<dd> Converts an ADD to a BDD.
758
759<dt> <a href="cuddAllDet.html#Cudd_addBddThreshold"><code>Cudd_addBddThreshold()</code></a>
760<dd> Converts an ADD to a BDD.
761
762<dt> <a href="cuddAllDet.html#Cudd_addCmpl"><code>Cudd_addCmpl()</code></a>
763<dd> Computes the complement of an ADD a la C language.
764
765<dt> <a href="cuddAllDet.html#Cudd_addCompose"><code>Cudd_addCompose()</code></a>
766<dd> Substitutes g for x_v in the ADD for f.
767
768<dt> <a href="cuddAllDet.html#Cudd_addComputeCube"><code>Cudd_addComputeCube()</code></a>
769<dd> Computes the cube of an array of ADD variables.
770
771<dt> <a href="cuddAllDet.html#Cudd_addConstrain"><code>Cudd_addConstrain()</code></a>
772<dd> Computes f constrain c for ADDs.
773
774<dt> <a href="cuddAllDet.html#Cudd_addConst"><code>Cudd_addConst()</code></a>
775<dd> Returns the ADD for constant c.
776
777<dt> <a href="cuddAllDet.html#Cudd_addDiff"><code>Cudd_addDiff()</code></a>
778<dd> Returns plusinfinity if f=g; returns min(f,g) if f!=g.
779
780<dt> <a href="cuddAllDet.html#Cudd_addDivide"><code>Cudd_addDivide()</code></a>
781<dd> Integer and floating point division.
782
783<dt> <a href="cuddAllDet.html#Cudd_addEvalConst"><code>Cudd_addEvalConst()</code></a>
784<dd> Checks whether ADD g is constant whenever ADD f is 1.
785
786<dt> <a href="cuddAllDet.html#Cudd_addExistAbstract"><code>Cudd_addExistAbstract()</code></a>
787<dd> Existentially Abstracts all the variables in cube from f.
788
789<dt> <a href="cuddAllDet.html#Cudd_addFindMax"><code>Cudd_addFindMax()</code></a>
790<dd> Finds the maximum discriminant of f.
791
792<dt> <a href="cuddAllDet.html#Cudd_addFindMin"><code>Cudd_addFindMin()</code></a>
793<dd> Finds the minimum discriminant of f.
794
795<dt> <a href="cuddAllDet.html#Cudd_addGeneralVectorCompose"><code>Cudd_addGeneralVectorCompose()</code></a>
796<dd> Composes an ADD with a vector of ADDs.
797
798<dt> <a href="cuddAllDet.html#Cudd_addHamming"><code>Cudd_addHamming()</code></a>
799<dd> Computes the Hamming distance ADD.
800
801<dt> <a href="cuddAllDet.html#Cudd_addHarwell"><code>Cudd_addHarwell()</code></a>
802<dd> Reads in a matrix in the format of the Harwell-Boeing benchmark suite.
803
804<dt> <a href="cuddAllDet.html#Cudd_addIteConstant"><code>Cudd_addIteConstant()</code></a>
805<dd> Implements ITEconstant for ADDs.
806
807<dt> <a href="cuddAllDet.html#Cudd_addIte"><code>Cudd_addIte()</code></a>
808<dd> Implements ITE(f,g,h).
809
810<dt> <a href="cuddAllDet.html#Cudd_addIthBit"><code>Cudd_addIthBit()</code></a>
811<dd> Extracts the i-th bit from an ADD.
812
813<dt> <a href="cuddAllDet.html#Cudd_addIthVar"><code>Cudd_addIthVar()</code></a>
814<dd> Returns the ADD variable with index i.
815
816<dt> <a href="cuddAllDet.html#Cudd_addLeq"><code>Cudd_addLeq()</code></a>
817<dd> Determines whether f is less than or equal to g.
818
819<dt> <a href="cuddAllDet.html#Cudd_addLog"><code>Cudd_addLog()</code></a>
820<dd> Natural logarithm of an ADD.
821
822<dt> <a href="cuddAllDet.html#Cudd_addMatrixMultiply"><code>Cudd_addMatrixMultiply()</code></a>
823<dd> Calculates the product of two matrices represented as ADDs.
824
825<dt> <a href="cuddAllDet.html#Cudd_addMaximum"><code>Cudd_addMaximum()</code></a>
826<dd> Integer and floating point max.
827
828<dt> <a href="cuddAllDet.html#Cudd_addMinimum"><code>Cudd_addMinimum()</code></a>
829<dd> Integer and floating point min.
830
831<dt> <a href="cuddAllDet.html#Cudd_addMinus"><code>Cudd_addMinus()</code></a>
832<dd> Integer and floating point subtraction.
833
834<dt> <a href="cuddAllDet.html#Cudd_addMonadicApply"><code>Cudd_addMonadicApply()</code></a>
835<dd> Applies op to the discriminants of f.
836
837<dt> <a href="cuddAllDet.html#Cudd_addNand"><code>Cudd_addNand()</code></a>
838<dd> NAND of two 0-1 ADDs.
839
840<dt> <a href="cuddAllDet.html#Cudd_addNegate"><code>Cudd_addNegate()</code></a>
841<dd> Computes the additive inverse of an ADD.
842
843<dt> <a href="cuddAllDet.html#Cudd_addNewVarAtLevel"><code>Cudd_addNewVarAtLevel()</code></a>
844<dd> Returns a new ADD variable at a specified level.
845
846<dt> <a href="cuddAllDet.html#Cudd_addNewVar"><code>Cudd_addNewVar()</code></a>
847<dd> Returns a new ADD variable.
848
849<dt> <a href="cuddAllDet.html#Cudd_addNonSimCompose"><code>Cudd_addNonSimCompose()</code></a>
850<dd> Composes an ADD with a vector of 0-1 ADDs.
851
852<dt> <a href="cuddAllDet.html#Cudd_addNor"><code>Cudd_addNor()</code></a>
853<dd> NOR of two 0-1 ADDs.
854
855<dt> <a href="cuddAllDet.html#Cudd_addOneZeroMaximum"><code>Cudd_addOneZeroMaximum()</code></a>
856<dd> Returns 1 if f &gt; g and 0 otherwise.
857
858<dt> <a href="cuddAllDet.html#Cudd_addOrAbstract"><code>Cudd_addOrAbstract()</code></a>
859<dd> Disjunctively abstracts all the variables in cube from the 0-1 ADD f.
860
861<dt> <a href="cuddAllDet.html#Cudd_addOr"><code>Cudd_addOr()</code></a>
862<dd> Disjunction of two 0-1 ADDs.
863
864<dt> <a href="cuddAllDet.html#Cudd_addOuterSum"><code>Cudd_addOuterSum()</code></a>
865<dd> Takes the minimum of a matrix and the outer sum of two vectors.
866
867<dt> <a href="cuddAllDet.html#Cudd_addPermute"><code>Cudd_addPermute()</code></a>
868<dd> Permutes the variables of an ADD.
869
870<dt> <a href="cuddAllDet.html#Cudd_addPlus"><code>Cudd_addPlus()</code></a>
871<dd> Integer and floating point addition.
872
873<dt> <a href="cuddAllDet.html#Cudd_addRead"><code>Cudd_addRead()</code></a>
874<dd> Reads in a sparse matrix.
875
876<dt> <a href="cuddAllDet.html#Cudd_addResidue"><code>Cudd_addResidue()</code></a>
877<dd> Builds an ADD for the residue modulo m of an n-bit number.
878
879<dt> <a href="cuddAllDet.html#Cudd_addRestrict"><code>Cudd_addRestrict()</code></a>
880<dd> ADD restrict according to Coudert and Madre's algorithm (ICCAD90).
881
882<dt> <a href="cuddAllDet.html#Cudd_addRoundOff"><code>Cudd_addRoundOff()</code></a>
883<dd> Rounds off the discriminants of an ADD.
884
885<dt> <a href="cuddAllDet.html#Cudd_addScalarInverse"><code>Cudd_addScalarInverse()</code></a>
886<dd> Computes the scalar inverse of an ADD.
887
888<dt> <a href="cuddAllDet.html#Cudd_addSetNZ"><code>Cudd_addSetNZ()</code></a>
889<dd> This operator sets f to the value of g wherever g != 0.
890
891<dt> <a href="cuddAllDet.html#Cudd_addSwapVariables"><code>Cudd_addSwapVariables()</code></a>
892<dd> Swaps two sets of variables of the same size (x and y) in the ADD f.
893
894<dt> <a href="cuddAllDet.html#Cudd_addThreshold"><code>Cudd_addThreshold()</code></a>
895<dd> f if f&gt;=g; 0 if f&lt;g.
896
897<dt> <a href="cuddAllDet.html#Cudd_addTimesPlus"><code>Cudd_addTimesPlus()</code></a>
898<dd> Calculates the product of two matrices represented as ADDs.
899
900<dt> <a href="cuddAllDet.html#Cudd_addTimes"><code>Cudd_addTimes()</code></a>
901<dd> Integer and floating point multiplication.
902
903<dt> <a href="cuddAllDet.html#Cudd_addTriangle"><code>Cudd_addTriangle()</code></a>
904<dd> Performs the triangulation step for the shortest path computation.
905
906<dt> <a href="cuddAllDet.html#Cudd_addUnivAbstract"><code>Cudd_addUnivAbstract()</code></a>
907<dd> Universally Abstracts all the variables in cube from f.
908
909<dt> <a href="cuddAllDet.html#Cudd_addVectorCompose"><code>Cudd_addVectorCompose()</code></a>
910<dd> Composes an ADD with a vector of 0-1 ADDs.
911
912<dt> <a href="cuddAllDet.html#Cudd_addWalsh"><code>Cudd_addWalsh()</code></a>
913<dd> Generates a Walsh matrix in ADD form.
914
915<dt> <a href="cuddAllDet.html#Cudd_addXeqy"><code>Cudd_addXeqy()</code></a>
916<dd> Generates an ADD for the function x==y.
917
918<dt> <a href="cuddAllDet.html#Cudd_addXnor"><code>Cudd_addXnor()</code></a>
919<dd> XNOR of two 0-1 ADDs.
920
921<dt> <a href="cuddAllDet.html#Cudd_addXor"><code>Cudd_addXor()</code></a>
922<dd> XOR of two 0-1 ADDs.
923
924<dt> <a href="cuddAllDet.html#Cudd_bddAdjPermuteX"><code>Cudd_bddAdjPermuteX()</code></a>
925<dd> Rearranges a set of variables in the BDD B.
926
927<dt> <a href="cuddAllDet.html#Cudd_bddAndAbstractLimit"><code>Cudd_bddAndAbstractLimit()</code></a>
928<dd> Takes the AND of two BDDs and simultaneously abstracts the variables in cube. Returns NULL if too many nodes are required.
929
930<dt> <a href="cuddAllDet.html#Cudd_bddAndAbstract"><code>Cudd_bddAndAbstract()</code></a>
931<dd> Takes the AND of two BDDs and simultaneously abstracts the variables in cube.
932
933<dt> <a href="cuddAllDet.html#Cudd_bddAndLimit"><code>Cudd_bddAndLimit()</code></a>
934<dd> Computes the conjunction of two BDDs f and g. Returns NULL if too many nodes are required.
935
936<dt> <a href="cuddAllDet.html#Cudd_bddAnd"><code>Cudd_bddAnd()</code></a>
937<dd> Computes the conjunction of two BDDs f and g.
938
939<dt> <a href="cuddAllDet.html#Cudd_bddApproxConjDecomp"><code>Cudd_bddApproxConjDecomp()</code></a>
940<dd> Performs two-way conjunctive decomposition of a BDD.
941
942<dt> <a href="cuddAllDet.html#Cudd_bddApproxDisjDecomp"><code>Cudd_bddApproxDisjDecomp()</code></a>
943<dd> Performs two-way disjunctive decomposition of a BDD.
944
945<dt> <a href="cuddAllDet.html#Cudd_bddBindVar"><code>Cudd_bddBindVar()</code></a>
946<dd> Prevents sifting of a variable.
947
948<dt> <a href="cuddAllDet.html#Cudd_bddBooleanDiff"><code>Cudd_bddBooleanDiff()</code></a>
949<dd> Computes the boolean difference of f with respect to x.
950
951<dt> <a href="cuddAllDet.html#Cudd_bddCharToVect"><code>Cudd_bddCharToVect()</code></a>
952<dd> Computes a vector whose image equals a non-zero function.
953
954<dt> <a href="cuddAllDet.html#Cudd_bddClippingAndAbstract"><code>Cudd_bddClippingAndAbstract()</code></a>
955<dd> Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube.
956
957<dt> <a href="cuddAllDet.html#Cudd_bddClippingAnd"><code>Cudd_bddClippingAnd()</code></a>
958<dd> Approximates the conjunction of two BDDs f and g.
959
960<dt> <a href="cuddAllDet.html#Cudd_bddClosestCube"><code>Cudd_bddClosestCube()</code></a>
961<dd> Finds a cube of f at minimum Hamming distance from g.
962
963<dt> <a href="cuddAllDet.html#Cudd_bddCompose"><code>Cudd_bddCompose()</code></a>
964<dd> Substitutes g for x_v in the BDD for f.
965
966<dt> <a href="cuddAllDet.html#Cudd_bddComputeCube"><code>Cudd_bddComputeCube()</code></a>
967<dd> Computes the cube of an array of BDD variables.
968
969<dt> <a href="cuddAllDet.html#Cudd_bddConstrainDecomp"><code>Cudd_bddConstrainDecomp()</code></a>
970<dd> BDD conjunctive decomposition as in McMillan's CAV96 paper.
971
972<dt> <a href="cuddAllDet.html#Cudd_bddConstrain"><code>Cudd_bddConstrain()</code></a>
973<dd> Computes f constrain c.
974
975<dt> <a href="cuddAllDet.html#Cudd_bddCorrelationWeights"><code>Cudd_bddCorrelationWeights()</code></a>
976<dd> Computes the correlation of f and g for given input probabilities.
977
978<dt> <a href="cuddAllDet.html#Cudd_bddCorrelation"><code>Cudd_bddCorrelation()</code></a>
979<dd> Computes the correlation of f and g.
980
981<dt> <a href="cuddAllDet.html#Cudd_bddExistAbstract"><code>Cudd_bddExistAbstract()</code></a>
982<dd> Existentially abstracts all the variables in cube from f.
983
984<dt> <a href="cuddAllDet.html#Cudd_bddGenConjDecomp"><code>Cudd_bddGenConjDecomp()</code></a>
985<dd> Performs two-way conjunctive decomposition of a BDD.
986
987<dt> <a href="cuddAllDet.html#Cudd_bddGenDisjDecomp"><code>Cudd_bddGenDisjDecomp()</code></a>
988<dd> Performs two-way disjunctive decomposition of a BDD.
989
990<dt> <a href="cuddAllDet.html#Cudd_bddIntersect"><code>Cudd_bddIntersect()</code></a>
991<dd> Returns a function included in the intersection of f and g.
992
993<dt> <a href="cuddAllDet.html#Cudd_bddIsNsVar"><code>Cudd_bddIsNsVar()</code></a>
994<dd> Checks whether a variable is next state.
995
996<dt> <a href="cuddAllDet.html#Cudd_bddIsPiVar"><code>Cudd_bddIsPiVar()</code></a>
997<dd> Checks whether a variable is primary input.
998
999<dt> <a href="cuddAllDet.html#Cudd_bddIsPsVar"><code>Cudd_bddIsPsVar()</code></a>
1000<dd> Checks whether a variable is present state.
1001
1002<dt> <a href="cuddAllDet.html#Cudd_bddIsVarEssential"><code>Cudd_bddIsVarEssential()</code></a>
1003<dd> Determines whether a given variable is essential with a given phase in a BDD.
1004
1005<dt> <a href="cuddAllDet.html#Cudd_bddIsVarHardGroup"><code>Cudd_bddIsVarHardGroup()</code></a>
1006<dd> Checks whether a variable is set to be in a hard group.
1007
1008<dt> <a href="cuddAllDet.html#Cudd_bddIsVarToBeGrouped"><code>Cudd_bddIsVarToBeGrouped()</code></a>
1009<dd> Checks whether a variable is set to be grouped.
1010
1011<dt> <a href="cuddAllDet.html#Cudd_bddIsVarToBeUngrouped"><code>Cudd_bddIsVarToBeUngrouped()</code></a>
1012<dd> Checks whether a variable is set to be ungrouped.
1013
1014<dt> <a href="cuddAllDet.html#Cudd_bddIsop"><code>Cudd_bddIsop()</code></a>
1015<dd> Computes a BDD in the interval between L and U with a simple sum-of-produuct cover.
1016
1017<dt> <a href="cuddAllDet.html#Cudd_bddIteConstant"><code>Cudd_bddIteConstant()</code></a>
1018<dd> Implements ITEconstant(f,g,h).
1019
1020<dt> <a href="cuddAllDet.html#Cudd_bddIterConjDecomp"><code>Cudd_bddIterConjDecomp()</code></a>
1021<dd> Performs two-way conjunctive decomposition of a BDD.
1022
1023<dt> <a href="cuddAllDet.html#Cudd_bddIterDisjDecomp"><code>Cudd_bddIterDisjDecomp()</code></a>
1024<dd> Performs two-way disjunctive decomposition of a BDD.
1025
1026<dt> <a href="cuddAllDet.html#Cudd_bddIte"><code>Cudd_bddIte()</code></a>
1027<dd> Implements ITE(f,g,h).
1028
1029<dt> <a href="cuddAllDet.html#Cudd_bddIthVar"><code>Cudd_bddIthVar()</code></a>
1030<dd> Returns the BDD variable with index i.
1031
1032<dt> <a href="cuddAllDet.html#Cudd_bddLICompaction"><code>Cudd_bddLICompaction()</code></a>
1033<dd> Performs safe minimization of a BDD.
1034
1035<dt> <a href="cuddAllDet.html#Cudd_bddLeqUnless"><code>Cudd_bddLeqUnless()</code></a>
1036<dd> Tells whether f is less than of equal to G unless D is 1.
1037
1038<dt> <a href="cuddAllDet.html#Cudd_bddLeq"><code>Cudd_bddLeq()</code></a>
1039<dd> Determines whether f is less than or equal to g.
1040
1041<dt> <a href="cuddAllDet.html#Cudd_bddLiteralSetIntersection"><code>Cudd_bddLiteralSetIntersection()</code></a>
1042<dd> Computes the intesection of two sets of literals represented as BDDs.
1043
1044<dt> <a href="cuddAllDet.html#Cudd_bddMakePrime"><code>Cudd_bddMakePrime()</code></a>
1045<dd> Expands cube to a prime implicant of f.
1046
1047<dt> <a href="cuddAllDet.html#Cudd_bddMinimize"><code>Cudd_bddMinimize()</code></a>
1048<dd> Finds a small BDD that agrees with <code>f</code> over <code>c</code>.
1049
1050<dt> <a href="cuddAllDet.html#Cudd_bddNPAnd"><code>Cudd_bddNPAnd()</code></a>
1051<dd> Computes f non-polluting-and g.
1052
1053<dt> <a href="cuddAllDet.html#Cudd_bddNand"><code>Cudd_bddNand()</code></a>
1054<dd> Computes the NAND of two BDDs f and g.
1055
1056<dt> <a href="cuddAllDet.html#Cudd_bddNewVarAtLevel"><code>Cudd_bddNewVarAtLevel()</code></a>
1057<dd> Returns a new BDD variable at a specified level.
1058
1059<dt> <a href="cuddAllDet.html#Cudd_bddNewVar"><code>Cudd_bddNewVar()</code></a>
1060<dd> Returns a new BDD variable.
1061
1062<dt> <a href="cuddAllDet.html#Cudd_bddNor"><code>Cudd_bddNor()</code></a>
1063<dd> Computes the NOR of two BDDs f and g.
1064
1065<dt> <a href="cuddAllDet.html#Cudd_bddOr"><code>Cudd_bddOr()</code></a>
1066<dd> Computes the disjunction of two BDDs f and g.
1067
1068<dt> <a href="cuddAllDet.html#Cudd_bddPermute"><code>Cudd_bddPermute()</code></a>
1069<dd> Permutes the variables of a BDD.
1070
1071<dt> <a href="cuddAllDet.html#Cudd_bddPickArbitraryMinterms"><code>Cudd_bddPickArbitraryMinterms()</code></a>
1072<dd> Picks k on-set minterms evenly distributed from given DD.
1073
1074<dt> <a href="cuddAllDet.html#Cudd_bddPickOneCube"><code>Cudd_bddPickOneCube()</code></a>
1075<dd> Picks one on-set cube randomly from the given DD.
1076
1077<dt> <a href="cuddAllDet.html#Cudd_bddPickOneMinterm"><code>Cudd_bddPickOneMinterm()</code></a>
1078<dd> Picks one on-set minterm randomly from the given DD.
1079
1080<dt> <a href="cuddAllDet.html#Cudd_bddPrintCover"><code>Cudd_bddPrintCover()</code></a>
1081<dd> Prints a sum of prime implicants of a BDD.
1082
1083<dt> <a href="cuddAllDet.html#Cudd_bddReadPairIndex"><code>Cudd_bddReadPairIndex()</code></a>
1084<dd> Reads a corresponding pair index for a given index.
1085
1086<dt> <a href="cuddAllDet.html#Cudd_bddRead"><code>Cudd_bddRead()</code></a>
1087<dd> Reads in a graph (without labels) given as a list of arcs.
1088
1089<dt> <a href="cuddAllDet.html#Cudd_bddRealignDisable"><code>Cudd_bddRealignDisable()</code></a>
1090<dd> Disables realignment of ZDD order to BDD order.
1091
1092<dt> <a href="cuddAllDet.html#Cudd_bddRealignEnable"><code>Cudd_bddRealignEnable()</code></a>
1093<dd> Enables realignment of BDD order to ZDD order.
1094
1095<dt> <a href="cuddAllDet.html#Cudd_bddRealignmentEnabled"><code>Cudd_bddRealignmentEnabled()</code></a>
1096<dd> Tells whether the realignment of BDD order to ZDD order is enabled.
1097
1098<dt> <a href="cuddAllDet.html#Cudd_bddResetVarToBeGrouped"><code>Cudd_bddResetVarToBeGrouped()</code></a>
1099<dd> Resets a variable not to be grouped.
1100
1101<dt> <a href="cuddAllDet.html#Cudd_bddRestrict"><code>Cudd_bddRestrict()</code></a>
1102<dd> BDD restrict according to Coudert and Madre's algorithm (ICCAD90).
1103
1104<dt> <a href="cuddAllDet.html#Cudd_bddSetNsVar"><code>Cudd_bddSetNsVar()</code></a>
1105<dd> Sets a variable type to next state.
1106
1107<dt> <a href="cuddAllDet.html#Cudd_bddSetPairIndex"><code>Cudd_bddSetPairIndex()</code></a>
1108<dd> Sets a corresponding pair index for a given index.
1109
1110<dt> <a href="cuddAllDet.html#Cudd_bddSetPiVar"><code>Cudd_bddSetPiVar()</code></a>
1111<dd> Sets a variable type to primary input.
1112
1113<dt> <a href="cuddAllDet.html#Cudd_bddSetPsVar"><code>Cudd_bddSetPsVar()</code></a>
1114<dd> Sets a variable type to present state.
1115
1116<dt> <a href="cuddAllDet.html#Cudd_bddSetVarHardGroup"><code>Cudd_bddSetVarHardGroup()</code></a>
1117<dd> Sets a variable to be a hard group.
1118
1119<dt> <a href="cuddAllDet.html#Cudd_bddSetVarToBeGrouped"><code>Cudd_bddSetVarToBeGrouped()</code></a>
1120<dd> Sets a variable to be grouped.
1121
1122<dt> <a href="cuddAllDet.html#Cudd_bddSetVarToBeUngrouped"><code>Cudd_bddSetVarToBeUngrouped()</code></a>
1123<dd> Sets a variable to be ungrouped.
1124
1125<dt> <a href="cuddAllDet.html#Cudd_bddSqueeze"><code>Cudd_bddSqueeze()</code></a>
1126<dd> Finds a small BDD in a function interval.
1127
1128<dt> <a href="cuddAllDet.html#Cudd_bddSwapVariables"><code>Cudd_bddSwapVariables()</code></a>
1129<dd> Swaps two sets of variables of the same size (x and y) in the BDD f.
1130
1131<dt> <a href="cuddAllDet.html#Cudd_bddTransfer"><code>Cudd_bddTransfer()</code></a>
1132<dd> Convert a BDD from a manager to another one.
1133
1134<dt> <a href="cuddAllDet.html#Cudd_bddUnbindVar"><code>Cudd_bddUnbindVar()</code></a>
1135<dd> Allows the sifting of a variable.
1136
1137<dt> <a href="cuddAllDet.html#Cudd_bddUnivAbstract"><code>Cudd_bddUnivAbstract()</code></a>
1138<dd> Universally abstracts all the variables in cube from f.
1139
1140<dt> <a href="cuddAllDet.html#Cudd_bddVarConjDecomp"><code>Cudd_bddVarConjDecomp()</code></a>
1141<dd> Performs two-way conjunctive decomposition of a BDD.
1142
1143<dt> <a href="cuddAllDet.html#Cudd_bddVarDisjDecomp"><code>Cudd_bddVarDisjDecomp()</code></a>
1144<dd> Performs two-way disjunctive decomposition of a BDD.
1145
1146<dt> <a href="cuddAllDet.html#Cudd_bddVarIsBound"><code>Cudd_bddVarIsBound()</code></a>
1147<dd> Tells whether a variable can be sifted.
1148
1149<dt> <a href="cuddAllDet.html#Cudd_bddVarIsDependent"><code>Cudd_bddVarIsDependent()</code></a>
1150<dd> Checks whether a variable is dependent on others in a function.
1151
1152<dt> <a href="cuddAllDet.html#Cudd_bddVarMap"><code>Cudd_bddVarMap()</code></a>
1153<dd> Remaps the variables of a BDD using the default variable map.
1154
1155<dt> <a href="cuddAllDet.html#Cudd_bddVectorCompose"><code>Cudd_bddVectorCompose()</code></a>
1156<dd> Composes a BDD with a vector of BDDs.
1157
1158<dt> <a href="cuddAllDet.html#Cudd_bddXnor"><code>Cudd_bddXnor()</code></a>
1159<dd> Computes the exclusive NOR of two BDDs f and g.
1160
1161<dt> <a href="cuddAllDet.html#Cudd_bddXorExistAbstract"><code>Cudd_bddXorExistAbstract()</code></a>
1162<dd> Takes the exclusive OR of two BDDs and simultaneously abstracts the variables in cube.
1163
1164<dt> <a href="cuddAllDet.html#Cudd_bddXor"><code>Cudd_bddXor()</code></a>
1165<dd> Computes the exclusive OR of two BDDs f and g.
1166
1167<dt> <a href="cuddAllDet.html#Cudd_tlcInfoFree"><code>Cudd_tlcInfoFree()</code></a>
1168<dd> Frees a DdTlcInfo Structure.
1169
1170<dt> <a href="cuddAllDet.html#Cudd_zddChange"><code>Cudd_zddChange()</code></a>
1171<dd> Substitutes a variable with its complement in a ZDD.
1172
1173<dt> <a href="cuddAllDet.html#Cudd_zddComplement"><code>Cudd_zddComplement()</code></a>
1174<dd> Computes a complement cover for a ZDD node.
1175
1176<dt> <a href="cuddAllDet.html#Cudd_zddCountDouble"><code>Cudd_zddCountDouble()</code></a>
1177<dd> Counts the number of minterms of a ZDD.
1178
1179<dt> <a href="cuddAllDet.html#Cudd_zddCountMinterm"><code>Cudd_zddCountMinterm()</code></a>
1180<dd> Counts the number of minterms of a ZDD.
1181
1182<dt> <a href="cuddAllDet.html#Cudd_zddCount"><code>Cudd_zddCount()</code></a>
1183<dd> Counts the number of minterms in a ZDD.
1184
1185<dt> <a href="cuddAllDet.html#Cudd_zddCoverPathToString"><code>Cudd_zddCoverPathToString()</code></a>
1186<dd> Converts a path of a ZDD representing a cover to a string.
1187
1188<dt> <a href="cuddAllDet.html#Cudd_zddDagSize"><code>Cudd_zddDagSize()</code></a>
1189<dd> Counts the number of nodes in a ZDD.
1190
1191<dt> <a href="cuddAllDet.html#Cudd_zddDiffConst"><code>Cudd_zddDiffConst()</code></a>
1192<dd> Performs the inclusion test for ZDDs (P implies Q).
1193
1194<dt> <a href="cuddAllDet.html#Cudd_zddDiff"><code>Cudd_zddDiff()</code></a>
1195<dd> Computes the difference of two ZDDs.
1196
1197<dt> <a href="cuddAllDet.html#Cudd_zddDivideF"><code>Cudd_zddDivideF()</code></a>
1198<dd> Modified version of Cudd_zddDivide.
1199
1200<dt> <a href="cuddAllDet.html#Cudd_zddDivide"><code>Cudd_zddDivide()</code></a>
1201<dd> Computes the quotient of two unate covers.
1202
1203<dt> <a href="cuddAllDet.html#Cudd_zddDumpDot"><code>Cudd_zddDumpDot()</code></a>
1204<dd> Writes a dot file representing the argument ZDDs.
1205
1206<dt> <a href="cuddAllDet.html#Cudd_zddFirstPath"><code>Cudd_zddFirstPath()</code></a>
1207<dd> Finds the first path of a ZDD.
1208
1209<dt> <a href="cuddAllDet.html#Cudd_zddForeachPath"><code>Cudd_zddForeachPath()</code></a>
1210<dd> Iterates over the paths of a ZDD.
1211
1212<dt> <a href="cuddAllDet.html#Cudd_zddIntersect"><code>Cudd_zddIntersect()</code></a>
1213<dd> Computes the intersection of two ZDDs.
1214
1215<dt> <a href="cuddAllDet.html#Cudd_zddIsop"><code>Cudd_zddIsop()</code></a>
1216<dd> Computes an ISOP in ZDD form from BDDs.
1217
1218<dt> <a href="cuddAllDet.html#Cudd_zddIte"><code>Cudd_zddIte()</code></a>
1219<dd> Computes the ITE of three ZDDs.
1220
1221<dt> <a href="cuddAllDet.html#Cudd_zddIthVar"><code>Cudd_zddIthVar()</code></a>
1222<dd> Returns the ZDD variable with index i.
1223
1224<dt> <a href="cuddAllDet.html#Cudd_zddNextPath"><code>Cudd_zddNextPath()</code></a>
1225<dd> Generates the next path of a ZDD.
1226
1227<dt> <a href="cuddAllDet.html#Cudd_zddPortFromBdd"><code>Cudd_zddPortFromBdd()</code></a>
1228<dd> Converts a BDD into a ZDD.
1229
1230<dt> <a href="cuddAllDet.html#Cudd_zddPortToBdd"><code>Cudd_zddPortToBdd()</code></a>
1231<dd> Converts a ZDD into a BDD.
1232
1233<dt> <a href="cuddAllDet.html#Cudd_zddPrintCover"><code>Cudd_zddPrintCover()</code></a>
1234<dd> Prints a sum of products from a ZDD representing a cover.
1235
1236<dt> <a href="cuddAllDet.html#Cudd_zddPrintDebug"><code>Cudd_zddPrintDebug()</code></a>
1237<dd> Prints to the standard output a ZDD and its statistics.
1238
1239<dt> <a href="cuddAllDet.html#Cudd_zddPrintMinterm"><code>Cudd_zddPrintMinterm()</code></a>
1240<dd> Prints a disjoint sum of product form for a ZDD.
1241
1242<dt> <a href="cuddAllDet.html#Cudd_zddPrintSubtable"><code>Cudd_zddPrintSubtable()</code></a>
1243<dd> Prints the ZDD table.
1244
1245<dt> <a href="cuddAllDet.html#Cudd_zddProduct"><code>Cudd_zddProduct()</code></a>
1246<dd> Computes the product of two covers represented by ZDDs.
1247
1248<dt> <a href="cuddAllDet.html#Cudd_zddReadNodeCount"><code>Cudd_zddReadNodeCount()</code></a>
1249<dd> Reports the number of nodes in ZDDs.
1250
1251<dt> <a href="cuddAllDet.html#Cudd_zddRealignDisable"><code>Cudd_zddRealignDisable()</code></a>
1252<dd> Disables realignment of ZDD order to BDD order.
1253
1254<dt> <a href="cuddAllDet.html#Cudd_zddRealignEnable"><code>Cudd_zddRealignEnable()</code></a>
1255<dd> Enables realignment of ZDD order to BDD order.
1256
1257<dt> <a href="cuddAllDet.html#Cudd_zddRealignmentEnabled"><code>Cudd_zddRealignmentEnabled()</code></a>
1258<dd> Tells whether the realignment of ZDD order to BDD order is enabled.
1259
1260<dt> <a href="cuddAllDet.html#Cudd_zddReduceHeap"><code>Cudd_zddReduceHeap()</code></a>
1261<dd> Main dynamic reordering routine for ZDDs.
1262
1263<dt> <a href="cuddAllDet.html#Cudd_zddShuffleHeap"><code>Cudd_zddShuffleHeap()</code></a>
1264<dd> Reorders ZDD variables according to given permutation.
1265
1266<dt> <a href="cuddAllDet.html#Cudd_zddSubset0"><code>Cudd_zddSubset0()</code></a>
1267<dd> Computes the negative cofactor of a ZDD w.r.t. a variable.
1268
1269<dt> <a href="cuddAllDet.html#Cudd_zddSubset1"><code>Cudd_zddSubset1()</code></a>
1270<dd> Computes the positive cofactor of a ZDD w.r.t. a variable.
1271
1272<dt> <a href="cuddAllDet.html#Cudd_zddSymmProfile"><code>Cudd_zddSymmProfile()</code></a>
1273<dd> Prints statistics on symmetric ZDD variables.
1274
1275<dt> <a href="cuddAllDet.html#Cudd_zddUnateProduct"><code>Cudd_zddUnateProduct()</code></a>
1276<dd> Computes the product of two unate covers.
1277
1278<dt> <a href="cuddAllDet.html#Cudd_zddUnion"><code>Cudd_zddUnion()</code></a>
1279<dd> Computes the union of two ZDDs.
1280
1281<dt> <a href="cuddAllDet.html#Cudd_zddVarsFromBddVars"><code>Cudd_zddVarsFromBddVars()</code></a>
1282<dd> Creates one or more ZDD variables for each BDD variable.
1283
1284<dt> <a href="cuddAllDet.html#Cudd_zddWeakDivF"><code>Cudd_zddWeakDivF()</code></a>
1285<dd> Modified version of Cudd_zddWeakDiv.
1286
1287<dt> <a href="cuddAllDet.html#Cudd_zddWeakDiv"><code>Cudd_zddWeakDiv()</code></a>
1288<dd> Applies weak division to two covers.
1289
1290<dt> <a href="cuddAllDet.html#DD_LSDIGIT"><code>DD_LSDIGIT()</code></a>
1291<dd> Extract the least significant digit of a double digit.
1292
1293<dt> <a href="cuddAllDet.html#DD_MINUS_INFINITY"><code>DD_MINUS_INFINITY()</code></a>
1294<dd> Returns the minus infinity constant node.
1295
1296<dt> <a href="cuddAllDet.html#DD_MSDIGIT"><code>DD_MSDIGIT()</code></a>
1297<dd> Extract the most significant digit of a double digit.
1298
1299<dt> <a href="cuddAllDet.html#DD_ONE"><code>DD_ONE()</code></a>
1300<dd> Returns the constant 1 node.
1301
1302<dt> <a href="cuddAllDet.html#DD_PLUS_INFINITY"><code>DD_PLUS_INFINITY()</code></a>
1303<dd> Returns the plus infinity constant node.
1304
1305<dt> <a href="cuddAllDet.html#DD_ZERO"><code>DD_ZERO()</code></a>
1306<dd> Returns the arithmetic 0 constant node.
1307
1308<dt> <a href="cuddAllDet.html#cuddAddApplyRecur"><code>cuddAddApplyRecur()</code></a>
1309<dd> Performs the recursive step of Cudd_addApply.
1310
1311<dt> <a href="cuddAllDet.html#cuddAddBddDoPattern"><code>cuddAddBddDoPattern()</code></a>
1312<dd> Performs the recursive step for Cudd_addBddPattern.
1313
1314<dt> <a href="cuddAllDet.html#cuddAddCmplRecur"><code>cuddAddCmplRecur()</code></a>
1315<dd> Performs the recursive step of Cudd_addCmpl.
1316
1317<dt> <a href="cuddAllDet.html#cuddAddComposeRecur"><code>cuddAddComposeRecur()</code></a>
1318<dd> Performs the recursive step of Cudd_addCompose.
1319
1320<dt> <a href="cuddAllDet.html#cuddAddConstrainRecur"><code>cuddAddConstrainRecur()</code></a>
1321<dd> Performs the recursive step of Cudd_addConstrain.
1322
1323<dt> <a href="cuddAllDet.html#cuddAddExistAbstractRecur"><code>cuddAddExistAbstractRecur()</code></a>
1324<dd> Performs the recursive step of Cudd_addExistAbstract.
1325
1326<dt> <a href="cuddAllDet.html#cuddAddIteRecur"><code>cuddAddIteRecur()</code></a>
1327<dd> Implements the recursive step of Cudd_addIte(f,g,h).
1328
1329<dt> <a href="cuddAllDet.html#cuddAddMonadicApplyRecur"><code>cuddAddMonadicApplyRecur()</code></a>
1330<dd> Performs the recursive step of Cudd_addMonadicApply.
1331
1332<dt> <a href="cuddAllDet.html#cuddAddNegateRecur"><code>cuddAddNegateRecur()</code></a>
1333<dd> Implements the recursive step of Cudd_addNegate.
1334
1335<dt> <a href="cuddAllDet.html#cuddAddOrAbstractRecur"><code>cuddAddOrAbstractRecur()</code></a>
1336<dd> Performs the recursive step of Cudd_addOrAbstract.
1337
1338<dt> <a href="cuddAllDet.html#cuddAddRestrictRecur"><code>cuddAddRestrictRecur()</code></a>
1339<dd> Performs the recursive step of Cudd_addRestrict.
1340
1341<dt> <a href="cuddAllDet.html#cuddAddRoundOffRecur"><code>cuddAddRoundOffRecur()</code></a>
1342<dd> Implements the recursive step of Cudd_addRoundOff.
1343
1344<dt> <a href="cuddAllDet.html#cuddAddScalarInverseRecur"><code>cuddAddScalarInverseRecur()</code></a>
1345<dd> Performs the recursive step of addScalarInverse.
1346
1347<dt> <a href="cuddAllDet.html#cuddAddUnivAbstractRecur"><code>cuddAddUnivAbstractRecur()</code></a>
1348<dd> Performs the recursive step of Cudd_addUnivAbstract.
1349
1350<dt> <a href="cuddAllDet.html#cuddAdjust"><code>cuddAdjust()</code></a>
1351<dd> Enforces DD_MINUS_INF_VAL <= x <= DD_PLUS_INF_VAL.
1352
1353<dt> <a href="cuddAllDet.html#cuddAllocNode"><code>cuddAllocNode()</code></a>
1354<dd> Fast storage allocation for DdNodes in the table.
1355
1356<dt> <a href="cuddAllDet.html#cuddAnnealing"><code>cuddAnnealing()</code></a>
1357<dd> Get new variable-order by simulated annealing algorithm.
1358
1359<dt> <a href="cuddAllDet.html#cuddBddAlignToZdd"><code>cuddBddAlignToZdd()</code></a>
1360<dd> Reorders BDD variables according to the order of the ZDD variables.
1361
1362<dt> <a href="cuddAllDet.html#cuddBddAndAbstractRecur"><code>cuddBddAndAbstractRecur()</code></a>
1363<dd> Takes the AND of two BDDs and simultaneously abstracts the variables in cube.
1364
1365<dt> <a href="cuddAllDet.html#cuddBddAndRecur"><code>cuddBddAndRecur()</code></a>
1366<dd> Implements the recursive step of Cudd_bddAnd.
1367
1368<dt> <a href="cuddAllDet.html#cuddBddBooleanDiffRecur"><code>cuddBddBooleanDiffRecur()</code></a>
1369<dd> Performs the recursive steps of Cudd_bddBoleanDiff.
1370
1371<dt> <a href="cuddAllDet.html#cuddBddClippingAndAbstract"><code>cuddBddClippingAndAbstract()</code></a>
1372<dd> Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube.
1373
1374<dt> <a href="cuddAllDet.html#cuddBddClippingAnd"><code>cuddBddClippingAnd()</code></a>
1375<dd> Approximates the conjunction of two BDDs f and g.
1376
1377<dt> <a href="cuddAllDet.html#cuddBddClosestCube"><code>cuddBddClosestCube()</code></a>
1378<dd> Performs the recursive step of Cudd_bddClosestCube.
1379
1380<dt> <a href="cuddAllDet.html#cuddBddComposeRecur"><code>cuddBddComposeRecur()</code></a>
1381<dd> Performs the recursive step of Cudd_bddCompose.
1382
1383<dt> <a href="cuddAllDet.html#cuddBddConstrainRecur"><code>cuddBddConstrainRecur()</code></a>
1384<dd> Performs the recursive step of Cudd_bddConstrain.
1385
1386<dt> <a href="cuddAllDet.html#cuddBddExistAbstractRecur"><code>cuddBddExistAbstractRecur()</code></a>
1387<dd> Performs the recursive steps of Cudd_bddExistAbstract.
1388
1389<dt> <a href="cuddAllDet.html#cuddBddIntersectRecur"><code>cuddBddIntersectRecur()</code></a>
1390<dd> Implements the recursive step of Cudd_bddIntersect.
1391
1392<dt> <a href="cuddAllDet.html#cuddBddIsop"><code>cuddBddIsop()</code></a>
1393<dd> Performs the recursive step of Cudd_bddIsop.
1394
1395<dt> <a href="cuddAllDet.html#cuddBddIteRecur"><code>cuddBddIteRecur()</code></a>
1396<dd> Implements the recursive step of Cudd_bddIte.
1397
1398<dt> <a href="cuddAllDet.html#cuddBddLICompaction"><code>cuddBddLICompaction()</code></a>
1399<dd> Performs safe minimization of a BDD.
1400
1401<dt> <a href="cuddAllDet.html#cuddBddLiteralSetIntersectionRecur"><code>cuddBddLiteralSetIntersectionRecur()</code></a>
1402<dd> Performs the recursive step of Cudd_bddLiteralSetIntersection.
1403
1404<dt> <a href="cuddAllDet.html#cuddBddMakePrime"><code>cuddBddMakePrime()</code></a>
1405<dd> Performs the recursive step of Cudd_bddMakePrime.
1406
1407<dt> <a href="cuddAllDet.html#cuddBddNPAndRecur"><code>cuddBddNPAndRecur()</code></a>
1408<dd> Implements the recursive step of Cudd_bddAnd.
1409
1410<dt> <a href="cuddAllDet.html#cuddBddRestrictRecur"><code>cuddBddRestrictRecur()</code></a>
1411<dd> Performs the recursive step of Cudd_bddRestrict.
1412
1413<dt> <a href="cuddAllDet.html#cuddBddTransfer"><code>cuddBddTransfer()</code></a>
1414<dd> Convert a BDD from a manager to another one.
1415
1416<dt> <a href="cuddAllDet.html#cuddBddXorExistAbstractRecur"><code>cuddBddXorExistAbstractRecur()</code></a>
1417<dd> Takes the exclusive OR of two BDDs and simultaneously abstracts the variables in cube.
1418
1419<dt> <a href="cuddAllDet.html#cuddBddXorRecur"><code>cuddBddXorRecur()</code></a>
1420<dd> Implements the recursive step of Cudd_bddXor.
1421
1422<dt> <a href="cuddAllDet.html#cuddBiasedUnderApprox"><code>cuddBiasedUnderApprox()</code></a>
1423<dd> Applies the biased remapping underappoximation algorithm.
1424
1425<dt> <a href="cuddAllDet.html#cuddCProjectionRecur"><code>cuddCProjectionRecur()</code></a>
1426<dd> Performs the recursive step of Cudd_CProjection.
1427
1428<dt> <a href="cuddAllDet.html#cuddCacheFlush"><code>cuddCacheFlush()</code></a>
1429<dd> Flushes the cache.
1430
1431<dt> <a href="cuddAllDet.html#cuddCacheInsert1"><code>cuddCacheInsert1()</code></a>
1432<dd> Inserts a result in the cache for a function with two operands.
1433
1434<dt> <a href="cuddAllDet.html#cuddCacheInsert2"><code>cuddCacheInsert2()</code></a>
1435<dd> Inserts a result in the cache for a function with two operands.
1436
1437<dt> <a href="cuddAllDet.html#cuddCacheInsert"><code>cuddCacheInsert()</code></a>
1438<dd> Inserts a result in the cache.
1439
1440<dt> <a href="cuddAllDet.html#cuddCacheLookup1Zdd"><code>cuddCacheLookup1Zdd()</code></a>
1441<dd> Looks up in the cache for the result of op applied to f.
1442
1443<dt> <a href="cuddAllDet.html#cuddCacheLookup1"><code>cuddCacheLookup1()</code></a>
1444<dd> Looks up in the cache for the result of op applied to f.
1445
1446<dt> <a href="cuddAllDet.html#cuddCacheLookup2Zdd"><code>cuddCacheLookup2Zdd()</code></a>
1447<dd> Looks up in the cache for the result of op applied to f and g.
1448
1449<dt> <a href="cuddAllDet.html#cuddCacheLookup2"><code>cuddCacheLookup2()</code></a>
1450<dd> Looks up in the cache for the result of op applied to f and g.
1451
1452<dt> <a href="cuddAllDet.html#cuddCacheLookupZdd"><code>cuddCacheLookupZdd()</code></a>
1453<dd> Looks up in the cache for the result of op applied to f, g, and h.
1454
1455<dt> <a href="cuddAllDet.html#cuddCacheLookup"><code>cuddCacheLookup()</code></a>
1456<dd> Looks up in the cache for the result of op applied to f, g, and h.
1457
1458<dt> <a href="cuddAllDet.html#cuddCacheProfile"><code>cuddCacheProfile()</code></a>
1459<dd> Computes and prints a profile of the cache usage.
1460
1461<dt> <a href="cuddAllDet.html#cuddCacheResize"><code>cuddCacheResize()</code></a>
1462<dd> Resizes the cache.
1463
1464<dt> <a href="cuddAllDet.html#cuddCheckCube"><code>cuddCheckCube()</code></a>
1465<dd> Checks whether g is the BDD of a cube.
1466
1467<dt> <a href="cuddAllDet.html#cuddClean"><code>cuddClean()</code></a>
1468<dd> Clears the 4 least significant bits of a pointer.
1469
1470<dt> <a href="cuddAllDet.html#cuddClearDeathRow"><code>cuddClearDeathRow()</code></a>
1471<dd> Clears the death row.
1472
1473<dt> <a href="cuddAllDet.html#cuddCofactorRecur"><code>cuddCofactorRecur()</code></a>
1474<dd> Performs the recursive step of Cudd_Cofactor.
1475
1476<dt> <a href="cuddAllDet.html#cuddCollectNodes"><code>cuddCollectNodes()</code></a>
1477<dd> Recursively collects all the nodes of a DD in a symbol table.
1478
1479<dt> <a href="cuddAllDet.html#cuddComputeFloorLog2"><code>cuddComputeFloorLog2()</code></a>
1480<dd> Returns the floor of the logarithm to the base 2.
1481
1482<dt> <a href="cuddAllDet.html#cuddConstantLookup"><code>cuddConstantLookup()</code></a>
1483<dd> Looks up in the cache for the result of op applied to f, g, and h.
1484
1485<dt> <a href="cuddAllDet.html#cuddDeallocMove"><code>cuddDeallocMove()</code></a>
1486<dd> Adds node to the head of the free list.
1487
1488<dt> <a href="cuddAllDet.html#cuddDeallocNode"><code>cuddDeallocNode()</code></a>
1489<dd> Adds node to the head of the free list.
1490
1491<dt> <a href="cuddAllDet.html#cuddDeref"><code>cuddDeref()</code></a>
1492<dd> Decreases the reference count of a node, if it is not saturated.
1493
1494<dt> <a href="cuddAllDet.html#cuddDestroySubtables"><code>cuddDestroySubtables()</code></a>
1495<dd> Destroys the n most recently created subtables in a unique table.
1496
1497<dt> <a href="cuddAllDet.html#cuddDynamicAllocNode"><code>cuddDynamicAllocNode()</code></a>
1498<dd> Dynamically allocates a Node.
1499
1500<dt> <a href="cuddAllDet.html#cuddExact"><code>cuddExact()</code></a>
1501<dd> Exact variable ordering algorithm.
1502
1503<dt> <a href="cuddAllDet.html#cuddE"><code>cuddE()</code></a>
1504<dd> Returns the else child of an internal node.
1505
1506<dt> <a href="cuddAllDet.html#cuddFreeTable"><code>cuddFreeTable()</code></a>
1507<dd> Frees the resources associated to a unique table.
1508
1509<dt> <a href="cuddAllDet.html#cuddGarbageCollect"><code>cuddGarbageCollect()</code></a>
1510<dd> Performs garbage collection on the unique tables.
1511
1512<dt> <a href="cuddAllDet.html#cuddGa"><code>cuddGa()</code></a>
1513<dd> Genetic algorithm for DD reordering.
1514
1515<dt> <a href="cuddAllDet.html#cuddGetBranches"><code>cuddGetBranches()</code></a>
1516<dd> Computes the children of g.
1517
1518<dt> <a href="cuddAllDet.html#cuddHashTableInit"><code>cuddHashTableInit()</code></a>
1519<dd> Initializes a hash table.
1520
1521<dt> <a href="cuddAllDet.html#cuddHashTableInsert1"><code>cuddHashTableInsert1()</code></a>
1522<dd> Inserts an item in a hash table.
1523
1524<dt> <a href="cuddAllDet.html#cuddHashTableInsert2"><code>cuddHashTableInsert2()</code></a>
1525<dd> Inserts an item in a hash table.
1526
1527<dt> <a href="cuddAllDet.html#cuddHashTableInsert3"><code>cuddHashTableInsert3()</code></a>
1528<dd> Inserts an item in a hash table.
1529
1530<dt> <a href="cuddAllDet.html#cuddHashTableInsert"><code>cuddHashTableInsert()</code></a>
1531<dd> Inserts an item in a hash table.
1532
1533<dt> <a href="cuddAllDet.html#cuddHashTableLookup1"><code>cuddHashTableLookup1()</code></a>
1534<dd> Looks up a key consisting of one pointer in a hash table.
1535
1536<dt> <a href="cuddAllDet.html#cuddHashTableLookup2"><code>cuddHashTableLookup2()</code></a>
1537<dd> Looks up a key consisting of two pointers in a hash table.
1538
1539<dt> <a href="cuddAllDet.html#cuddHashTableLookup3"><code>cuddHashTableLookup3()</code></a>
1540<dd> Looks up a key consisting of three pointers in a hash table.
1541
1542<dt> <a href="cuddAllDet.html#cuddHashTableLookup"><code>cuddHashTableLookup()</code></a>
1543<dd> Looks up a key in a hash table.
1544
1545<dt> <a href="cuddAllDet.html#cuddHashTableQuit"><code>cuddHashTableQuit()</code></a>
1546<dd> Shuts down a hash table.
1547
1548<dt> <a href="cuddAllDet.html#cuddHeapProfile"><code>cuddHeapProfile()</code></a>
1549<dd> Prints information about the heap.
1550
1551<dt> <a href="cuddAllDet.html#cuddIZ"><code>cuddIZ()</code></a>
1552<dd> Finds the current position of ZDD variable index in the order.
1553
1554<dt> <a href="cuddAllDet.html#cuddInitCache"><code>cuddInitCache()</code></a>
1555<dd> Initializes the computed table.
1556
1557<dt> <a href="cuddAllDet.html#cuddInitInteract"><code>cuddInitInteract()</code></a>
1558<dd> Initializes the interaction matrix.
1559
1560<dt> <a href="cuddAllDet.html#cuddInitLinear"><code>cuddInitLinear()</code></a>
1561<dd> Initializes the linear transform matrix.
1562
1563<dt> <a href="cuddAllDet.html#cuddInitTable"><code>cuddInitTable()</code></a>
1564<dd> Creates and initializes the unique table.
1565
1566<dt> <a href="cuddAllDet.html#cuddInsertSubtables"><code>cuddInsertSubtables()</code></a>
1567<dd> Inserts n new subtables in a unique table at level.
1568
1569<dt> <a href="cuddAllDet.html#cuddIsConstant"><code>cuddIsConstant()</code></a>
1570<dd> Returns 1 if the node is a constant node.
1571
1572<dt> <a href="cuddAllDet.html#cuddIsInDeathRow"><code>cuddIsInDeathRow()</code></a>
1573<dd> Checks whether a node is in the death row.
1574
1575<dt> <a href="cuddAllDet.html#cuddI"><code>cuddI()</code></a>
1576<dd> Finds the current position of variable index in the order.
1577
1578<dt> <a href="cuddAllDet.html#cuddLevelQueueDequeue"><code>cuddLevelQueueDequeue()</code></a>
1579<dd> Remove an item from the front of a level queue.
1580
1581<dt> <a href="cuddAllDet.html#cuddLevelQueueEnqueue"><code>cuddLevelQueueEnqueue()</code></a>
1582<dd> Inserts a new key in a level queue.
1583
1584<dt> <a href="cuddAllDet.html#cuddLevelQueueInit"><code>cuddLevelQueueInit()</code></a>
1585<dd> Initializes a level queue.
1586
1587<dt> <a href="cuddAllDet.html#cuddLevelQueueQuit"><code>cuddLevelQueueQuit()</code></a>
1588<dd> Shuts down a level queue.
1589
1590<dt> <a href="cuddAllDet.html#cuddLinearAndSifting"><code>cuddLinearAndSifting()</code></a>
1591<dd> BDD reduction based on combination of sifting and linear transformations.
1592
1593<dt> <a href="cuddAllDet.html#cuddLinearInPlace"><code>cuddLinearInPlace()</code></a>
1594<dd> Linearly combines two adjacent variables.
1595
1596<dt> <a href="cuddAllDet.html#cuddLocalCacheClearAll"><code>cuddLocalCacheClearAll()</code></a>
1597<dd> Clears the local caches of a manager.
1598
1599<dt> <a href="cuddAllDet.html#cuddLocalCacheClearDead"><code>cuddLocalCacheClearDead()</code></a>
1600<dd> Clears the dead entries of the local caches of a manager.
1601
1602<dt> <a href="cuddAllDet.html#cuddLocalCacheInit"><code>cuddLocalCacheInit()</code></a>
1603<dd> Initializes a local computed table.
1604
1605<dt> <a href="cuddAllDet.html#cuddLocalCacheInsert"><code>cuddLocalCacheInsert()</code></a>
1606<dd> Inserts a result in a local cache.
1607
1608<dt> <a href="cuddAllDet.html#cuddLocalCacheLookup"><code>cuddLocalCacheLookup()</code></a>
1609<dd> Looks up in a local cache.
1610
1611<dt> <a href="cuddAllDet.html#cuddLocalCacheProfile"><code>cuddLocalCacheProfile()</code></a>
1612<dd> Computes and prints a profile of a local cache usage.
1613
1614<dt> <a href="cuddAllDet.html#cuddLocalCacheQuit"><code>cuddLocalCacheQuit()</code></a>
1615<dd> Shuts down a local computed table.
1616
1617<dt> <a href="cuddAllDet.html#cuddMakeBddFromZddCover"><code>cuddMakeBddFromZddCover()</code></a>
1618<dd> Converts a ZDD cover to a BDD graph.
1619
1620<dt> <a href="cuddAllDet.html#cuddNextHigh"><code>cuddNextHigh()</code></a>
1621<dd> Finds the next subtable with a larger index.
1622
1623<dt> <a href="cuddAllDet.html#cuddNextLow"><code>cuddNextLow()</code></a>
1624<dd> Finds the next subtable with a smaller index.
1625
1626<dt> <a href="cuddAllDet.html#cuddNodeArray"><code>cuddNodeArray()</code></a>
1627<dd> Recursively collects all the nodes of a DD in an array.
1628
1629<dt> <a href="cuddAllDet.html#cuddPrintNode"><code>cuddPrintNode()</code></a>
1630<dd> Prints out information on a node.
1631
1632<dt> <a href="cuddAllDet.html#cuddPrintVarGroups"><code>cuddPrintVarGroups()</code></a>
1633<dd> Prints the variable groups as a parenthesized list.
1634
1635<dt> <a href="cuddAllDet.html#cuddP"><code>cuddP()</code></a>
1636<dd> Prints a DD to the standard output. One line per node is printed.
1637
1638<dt> <a href="cuddAllDet.html#cuddReclaimZdd"><code>cuddReclaimZdd()</code></a>
1639<dd> Brings children of a dead ZDD node back.
1640
1641<dt> <a href="cuddAllDet.html#cuddReclaim"><code>cuddReclaim()</code></a>
1642<dd> Brings children of a dead node back.
1643
1644<dt> <a href="cuddAllDet.html#cuddRef"><code>cuddRef()</code></a>
1645<dd> Increases the reference count of a node, if it is not saturated.
1646
1647<dt> <a href="cuddAllDet.html#cuddRehash"><code>cuddRehash()</code></a>
1648<dd> Rehashes a unique subtable.
1649
1650<dt> <a href="cuddAllDet.html#cuddRemapUnderApprox"><code>cuddRemapUnderApprox()</code></a>
1651<dd> Applies the remapping underappoximation algorithm.
1652
1653<dt> <a href="cuddAllDet.html#cuddResizeLinear"><code>cuddResizeLinear()</code></a>
1654<dd> Resizes the linear transform matrix.
1655
1656<dt> <a href="cuddAllDet.html#cuddResizeTableZdd"><code>cuddResizeTableZdd()</code></a>
1657<dd> Increases the number of ZDD subtables in a unique table so that it meets or exceeds index.
1658
1659<dt> <a href="cuddAllDet.html#cuddSatDec"><code>cuddSatDec()</code></a>
1660<dd> Saturating decrement operator.
1661
1662<dt> <a href="cuddAllDet.html#cuddSatInc"><code>cuddSatInc()</code></a>
1663<dd> Saturating increment operator.
1664
1665<dt> <a href="cuddAllDet.html#cuddSetInteract"><code>cuddSetInteract()</code></a>
1666<dd> Set interaction matrix entries.
1667
1668<dt> <a href="cuddAllDet.html#cuddShrinkDeathRow"><code>cuddShrinkDeathRow()</code></a>
1669<dd> Shrinks the death row.
1670
1671<dt> <a href="cuddAllDet.html#cuddShrinkSubtable"><code>cuddShrinkSubtable()</code></a>
1672<dd> Shrinks a subtable.
1673
1674<dt> <a href="cuddAllDet.html#cuddSifting"><code>cuddSifting()</code></a>
1675<dd> Implementation of Rudell's sifting algorithm.
1676
1677<dt> <a href="cuddAllDet.html#cuddSlowTableGrowth"><code>cuddSlowTableGrowth()</code></a>
1678<dd> Adjusts parameters of a table to slow down its growth.
1679
1680<dt> <a href="cuddAllDet.html#cuddSolveEqnRecur"><code>cuddSolveEqnRecur()</code></a>
1681<dd> Implements the recursive step of Cudd_SolveEqn.
1682
1683<dt> <a href="cuddAllDet.html#cuddSplitSetRecur"><code>cuddSplitSetRecur()</code></a>
1684<dd> Implements the recursive step of Cudd_SplitSet.
1685
1686<dt> <a href="cuddAllDet.html#cuddStCountfree"><code>cuddStCountfree()</code></a>
1687<dd> Frees the memory used to store the minterm counts recorded in the visited table.
1688
1689<dt> <a href="cuddAllDet.html#cuddSubsetHeavyBranch"><code>cuddSubsetHeavyBranch()</code></a>
1690<dd> The main procedure that returns a subset by choosing the heavier branch in the BDD.
1691
1692<dt> <a href="cuddAllDet.html#cuddSubsetShortPaths"><code>cuddSubsetShortPaths()</code></a>
1693<dd> The outermost procedure to return a subset of the given BDD with the shortest path lengths.
1694
1695<dt> <a href="cuddAllDet.html#cuddSwapInPlace"><code>cuddSwapInPlace()</code></a>
1696<dd> Swaps two adjacent variables.
1697
1698<dt> <a href="cuddAllDet.html#cuddSwapping"><code>cuddSwapping()</code></a>
1699<dd> Reorders variables by a sequence of (non-adjacent) swaps.
1700
1701<dt> <a href="cuddAllDet.html#cuddSymmCheck"><code>cuddSymmCheck()</code></a>
1702<dd> Checks for symmetry of x and y.
1703
1704<dt> <a href="cuddAllDet.html#cuddSymmSiftingConv"><code>cuddSymmSiftingConv()</code></a>
1705<dd> Symmetric sifting to convergence algorithm.
1706
1707<dt> <a href="cuddAllDet.html#cuddSymmSifting"><code>cuddSymmSifting()</code></a>
1708<dd> Symmetric sifting algorithm.
1709
1710<dt> <a href="cuddAllDet.html#cuddTestInteract"><code>cuddTestInteract()</code></a>
1711<dd> Test interaction matrix entries.
1712
1713<dt> <a href="cuddAllDet.html#cuddTimesInDeathRow"><code>cuddTimesInDeathRow()</code></a>
1714<dd> Counts how many times a node is in the death row.
1715
1716<dt> <a href="cuddAllDet.html#cuddTreeSifting"><code>cuddTreeSifting()</code></a>
1717<dd> Tree sifting algorithm.
1718
1719<dt> <a href="cuddAllDet.html#cuddT"><code>cuddT()</code></a>
1720<dd> Returns the then child of an internal node.
1721
1722<dt> <a href="cuddAllDet.html#cuddUnderApprox"><code>cuddUnderApprox()</code></a>
1723<dd> Applies Tom Shiple's underappoximation algorithm.
1724
1725<dt> <a href="cuddAllDet.html#cuddUniqueConst"><code>cuddUniqueConst()</code></a>
1726<dd> Checks the unique table for the existence of a constant node.
1727
1728<dt> <a href="cuddAllDet.html#cuddUniqueInterIVO"><code>cuddUniqueInterIVO()</code></a>
1729<dd> Wrapper for cuddUniqueInter that is independent of variable ordering.
1730
1731<dt> <a href="cuddAllDet.html#cuddUniqueInterZdd"><code>cuddUniqueInterZdd()</code></a>
1732<dd> Checks the unique table for the existence of an internal ZDD node.
1733
1734<dt> <a href="cuddAllDet.html#cuddUniqueInter"><code>cuddUniqueInter()</code></a>
1735<dd> Checks the unique table for the existence of an internal node.
1736
1737<dt> <a href="cuddAllDet.html#cuddUpdateInteractionMatrix"><code>cuddUpdateInteractionMatrix()</code></a>
1738<dd> Updates the interaction matrix.
1739
1740<dt> <a href="cuddAllDet.html#cuddVerifySol"><code>cuddVerifySol()</code></a>
1741<dd> Implements the recursive step of Cudd_VerifySol.
1742
1743<dt> <a href="cuddAllDet.html#cuddV"><code>cuddV()</code></a>
1744<dd> Returns the value of a constant node.
1745
1746<dt> <a href="cuddAllDet.html#cuddWindowReorder"><code>cuddWindowReorder()</code></a>
1747<dd> Reorders by applying the method of the sliding window.
1748
1749<dt> <a href="cuddAllDet.html#cuddZddAlignToBdd"><code>cuddZddAlignToBdd()</code></a>
1750<dd> Reorders ZDD variables according to the order of the BDD variables.
1751
1752<dt> <a href="cuddAllDet.html#cuddZddChangeAux"><code>cuddZddChangeAux()</code></a>
1753<dd> Performs the recursive step of Cudd_zddChange.
1754
1755<dt> <a href="cuddAllDet.html#cuddZddChange"><code>cuddZddChange()</code></a>
1756<dd> Substitutes a variable with its complement in a ZDD.
1757
1758<dt> <a href="cuddAllDet.html#cuddZddComplement"><code>cuddZddComplement()</code></a>
1759<dd> Computes a complement of a ZDD node.
1760
1761<dt> <a href="cuddAllDet.html#cuddZddDiff"><code>cuddZddDiff()</code></a>
1762<dd> Performs the recursive step of Cudd_zddDiff.
1763
1764<dt> <a href="cuddAllDet.html#cuddZddDivideF"><code>cuddZddDivideF()</code></a>
1765<dd> Performs the recursive step of Cudd_zddDivideF.
1766
1767<dt> <a href="cuddAllDet.html#cuddZddDivide"><code>cuddZddDivide()</code></a>
1768<dd> Performs the recursive step of Cudd_zddDivide.
1769
1770<dt> <a href="cuddAllDet.html#cuddZddFreeUniv"><code>cuddZddFreeUniv()</code></a>
1771<dd> Frees the ZDD universe.
1772
1773<dt> <a href="cuddAllDet.html#cuddZddGetCofactors2"><code>cuddZddGetCofactors2()</code></a>
1774<dd> Computes the two-way decomposition of f w.r.t. v.
1775
1776<dt> <a href="cuddAllDet.html#cuddZddGetCofactors3"><code>cuddZddGetCofactors3()</code></a>
1777<dd> Computes the three-way decomposition of f w.r.t. v.
1778
1779<dt> <a href="cuddAllDet.html#cuddZddGetNegVarIndex"><code>cuddZddGetNegVarIndex()</code></a>
1780<dd> Returns the index of negative ZDD variable.
1781
1782<dt> <a href="cuddAllDet.html#cuddZddGetNegVarLevel"><code>cuddZddGetNegVarLevel()</code></a>
1783<dd> Returns the level of negative ZDD variable.
1784
1785<dt> <a href="cuddAllDet.html#cuddZddGetNodeIVO"><code>cuddZddGetNodeIVO()</code></a>
1786<dd> Wrapper for cuddUniqueInterZdd that is independent of variable ordering.
1787
1788<dt> <a href="cuddAllDet.html#cuddZddGetNode"><code>cuddZddGetNode()</code></a>
1789<dd> Wrapper for cuddUniqueInterZdd.
1790
1791<dt> <a href="cuddAllDet.html#cuddZddGetPosVarIndex"><code>cuddZddGetPosVarIndex()</code></a>
1792<dd> Returns the index of positive ZDD variable.
1793
1794<dt> <a href="cuddAllDet.html#cuddZddGetPosVarLevel"><code>cuddZddGetPosVarLevel()</code></a>
1795<dd> Returns the level of positive ZDD variable.
1796
1797<dt> <a href="cuddAllDet.html#cuddZddInitUniv"><code>cuddZddInitUniv()</code></a>
1798<dd> Initializes the ZDD universe.
1799
1800<dt> <a href="cuddAllDet.html#cuddZddIntersect"><code>cuddZddIntersect()</code></a>
1801<dd> Performs the recursive step of Cudd_zddIntersect.
1802
1803<dt> <a href="cuddAllDet.html#cuddZddIsop"><code>cuddZddIsop()</code></a>
1804<dd> Performs the recursive step of Cudd_zddIsop.
1805
1806<dt> <a href="cuddAllDet.html#cuddZddIte"><code>cuddZddIte()</code></a>
1807<dd> Performs the recursive step of Cudd_zddIte.
1808
1809<dt> <a href="cuddAllDet.html#cuddZddLinearSifting"><code>cuddZddLinearSifting()</code></a>
1810<dd> Implementation of the linear sifting algorithm for ZDDs.
1811
1812<dt> <a href="cuddAllDet.html#cuddZddNextHigh"><code>cuddZddNextHigh()</code></a>
1813<dd> Finds the next subtable with a larger index.
1814
1815<dt> <a href="cuddAllDet.html#cuddZddNextLow"><code>cuddZddNextLow()</code></a>
1816<dd> Finds the next subtable with a smaller index.
1817
1818<dt> <a href="cuddAllDet.html#cuddZddProduct"><code>cuddZddProduct()</code></a>
1819<dd> Performs the recursive step of Cudd_zddProduct.
1820
1821<dt> <a href="cuddAllDet.html#cuddZddP"><code>cuddZddP()</code></a>
1822<dd> Prints a ZDD to the standard output. One line per node is printed.
1823
1824<dt> <a href="cuddAllDet.html#cuddZddSifting"><code>cuddZddSifting()</code></a>
1825<dd> Implementation of Rudell's sifting algorithm.
1826
1827<dt> <a href="cuddAllDet.html#cuddZddSubset0"><code>cuddZddSubset0()</code></a>
1828<dd> Computes the negative cofactor of a ZDD w.r.t. a variable.
1829
1830<dt> <a href="cuddAllDet.html#cuddZddSubset1"><code>cuddZddSubset1()</code></a>
1831<dd> Computes the positive cofactor of a ZDD w.r.t. a variable.
1832
1833<dt> <a href="cuddAllDet.html#cuddZddSwapInPlace"><code>cuddZddSwapInPlace()</code></a>
1834<dd> Swaps two adjacent variables.
1835
1836<dt> <a href="cuddAllDet.html#cuddZddSwapping"><code>cuddZddSwapping()</code></a>
1837<dd> Reorders variables by a sequence of (non-adjacent) swaps.
1838
1839<dt> <a href="cuddAllDet.html#cuddZddSymmCheck"><code>cuddZddSymmCheck()</code></a>
1840<dd> Checks for symmetry of x and y.
1841
1842<dt> <a href="cuddAllDet.html#cuddZddSymmSiftingConv"><code>cuddZddSymmSiftingConv()</code></a>
1843<dd> Symmetric sifting to convergence algorithm for ZDDs.
1844
1845<dt> <a href="cuddAllDet.html#cuddZddSymmSifting"><code>cuddZddSymmSifting()</code></a>
1846<dd> Symmetric sifting algorithm for ZDDs.
1847
1848<dt> <a href="cuddAllDet.html#cuddZddTreeSifting"><code>cuddZddTreeSifting()</code></a>
1849<dd> Tree sifting algorithm for ZDDs.
1850
1851<dt> <a href="cuddAllDet.html#cuddZddUnateProduct"><code>cuddZddUnateProduct()</code></a>
1852<dd> Performs the recursive step of Cudd_zddUnateProduct.
1853
1854<dt> <a href="cuddAllDet.html#cuddZddUnion"><code>cuddZddUnion()</code></a>
1855<dd> Performs the recursive step of Cudd_zddUnion.
1856
1857<dt> <a href="cuddAllDet.html#cuddZddUniqueCompare"><code>cuddZddUniqueCompare()</code></a>
1858<dd> Comparison function used by qsort.
1859
1860<dt> <a href="cuddAllDet.html#cuddZddWeakDivF"><code>cuddZddWeakDivF()</code></a>
1861<dd> Performs the recursive step of Cudd_zddWeakDivF.
1862
1863<dt> <a href="cuddAllDet.html#cuddZddWeakDiv"><code>cuddZddWeakDiv()</code></a>
1864<dd> Performs the recursive step of Cudd_zddWeakDiv.
1865
1866<dt> <a href="cuddAllDet.html#ddAbs"><code>ddAbs()</code></a>
1867<dd> Computes the absolute value of a number.
1868
1869<dt> <a href="cuddAllDet.html#ddCHash2"><code>ddCHash2()</code></a>
1870<dd> Hash function for the cache for functions with two operands.
1871
1872<dt> <a href="cuddAllDet.html#ddCHash"><code>ddCHash()</code></a>
1873<dd> Hash function for the cache.
1874
1875<dt> <a href="cuddAllDet.html#ddEqualVal"><code>ddEqualVal()</code></a>
1876<dd> Returns 1 if the absolute value of the difference of the two arguments x and y is less than e.
1877
1878<dt> <a href="cuddAllDet.html#ddHash"><code>ddHash()</code></a>
1879<dd> Hash function for the unique table.
1880
1881<dt> <a href="cuddAllDet.html#ddLCHash2"><code>ddLCHash2()</code></a>
1882<dd> Computes hash function for keys of two operands.
1883
1884<dt> <a href="cuddAllDet.html#ddLCHash3"><code>ddLCHash3()</code></a>
1885<dd> Computes hash function for keys of three operands.
1886
1887<dt> <a href="cuddAllDet.html#ddMax"><code>ddMax()</code></a>
1888<dd> Computes the maximum of two numbers.
1889
1890<dt> <a href="cuddAllDet.html#ddMin"><code>ddMin()</code></a>
1891<dd> Computes the minimum of two numbers.
1892
1893<dt> <a href="cuddAllDet.html#lqHash"><code>lqHash()</code></a>
1894<dd> Hash function for the table of a level queue.
1895
1896<dt> <a href="cuddAllDet.html#statLine"><code>statLine()</code></a>
1897<dd> Outputs a line of stats.
1898
1899</dl>
1900
1901<hr>
1902
1903Generated automatically by <code>extdoc</code> on 20050517
1904
1905</body></html>
Note: See TracBrowser for help on using the repository browser.