source: vis_dev/glu-2.3/src/cuBdd/doc/node8.html

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

library glu 2.3
File size: 36.1 KB
RevLine 
[13]1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
2
3<!--Converted with LaTeX2HTML 2K.1beta (1.47)
4original version by:  Nikos Drakos, CBLU, University of Leeds
5* revised and updated by:  Marcus Hennecke, Ross Moore, Herb Swan
6* with significant contributions from:
7  Jens Lippmann, Marek Rouchal, Martin Wilck and others -->
8<HTML>
9<HEAD>
10<TITLE>Index</TITLE>
11<META NAME="description" CONTENT="Index">
12<META NAME="keywords" CONTENT="cuddIntro">
13<META NAME="resource-type" CONTENT="document">
14<META NAME="distribution" CONTENT="global">
15
16<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
17<META NAME="Generator" CONTENT="LaTeX2HTML v2K.1beta">
18<META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css">
19
20<LINK REL="STYLESHEET" HREF="cuddIntro.css">
21
22<LINK REL="previous" HREF="node7.html">
23<LINK REL="up" HREF="cuddIntro.html">
24</HEAD>
25
26<BODY >
27<!--Navigation Panel-->
28<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
29 SRC="icons/next_g.png"> 
30<A NAME="tex2html375"
31  HREF="cuddIntro.html">
32<IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up"
33 SRC="icons/up.png"></A> 
34<A NAME="tex2html371"
35  HREF="node7.html">
36<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
37 SRC="icons/prev.png"></A>   
38<BR>
39<B> Up:</B> <A NAME="tex2html376"
40  HREF="cuddIntro.html">CUDD: CU Decision Diagram</A>
41<B> Previous:</B> <A NAME="tex2html372"
42  HREF="node7.html">Bibliography</A>
43<BR>
44<BR>
45<!--End of Navigation Panel-->
46<BR>
47
48<H2><A NAME="SECTION00080000000000000000">
49Index</A>
50</H2><DL COMPACT>
51<DT><STRONG>ADD</STRONG>
52<DD><A HREF="node1.html#15">Introduction</A>
53 | <A HREF="node3.html#119">Nodes</A>
54 | <A HREF="node3.html#289">New Constants</A>
55 | <A HREF="node3.html#379">Basic ADD Manipulation</A>
56<DT><STRONG>aggregation</STRONG>
57<DD><A HREF="node3.html#547">Variable Reordering for BDDs</A>
58<DT><STRONG>Algebraic Decision Diagram</STRONG>
59<DD><i>see </i> ADD
60<DT><STRONG>arc</STRONG>
61<DD><DL COMPACT>
62<DT><STRONG>complement</STRONG>
63<DD><A HREF="node3.html#298">New BDD and ADD</A>
64 | <A HREF="node3.html#768">Writing Decision Diagrams to</A>
65 | <A HREF="node3.html#768">Writing Decision Diagrams to</A>
66 | <A HREF="node4.html#926">Complement Arcs</A>
67 | <A HREF="node4.html#930">Complement Arcs</A>
68<DT><STRONG>regular</STRONG>
69<DD><A HREF="node3.html#769">Writing Decision Diagrams to</A>
70 | <A HREF="node3.html#769">Writing Decision Diagrams to</A>
71 | <A HREF="node4.html#929">Complement Arcs</A>
72</DL>
73<DT><STRONG>background value</STRONG>
74<DD><A HREF="node3.html#254">Background</A>
75<DT><STRONG>BDD</STRONG>
76<DD><A HREF="node1.html#13">Introduction</A>
77 | <A HREF="node3.html#118">Nodes</A>
78 | <A HREF="node3.html#213">One, Logic Zero, and</A>
79 | <A HREF="node3.html#339">Basic BDD Manipulation</A>
80<DT><STRONG>Binary Decision Diagram</STRONG>
81<DD><i>see </i> BDD
82<DT><STRONG>box</STRONG>
83<DD><DL COMPACT>
84<DT><STRONG>black</STRONG>
85<DD><A HREF="node1.html#26">Introduction</A>
86<DT><STRONG>clear</STRONG>
87<DD><A HREF="node1.html#31">Introduction</A>
88 | <A HREF="node4.html#795">Compiling and Linking</A>
89</DL>
90<DT><STRONG>cache</STRONG>
91<DD><A HREF="node3.html#147">Cache</A>
92 | <A HREF="node3.html#150">Cache</A>
93 | <A HREF="node3.html#152">Cache</A>
94 | <A HREF="node3.html#170">Initializing and Shutting Down</A>
95 | <A HREF="node4.html#928">Complement Arcs</A>
96 | <A HREF="node4.html#941">The Cache</A>
97<DL COMPACT>
98<DT><STRONG>collision</STRONG>
99<DD><A HREF="node4.html#1113">Non Modifiable Parameters</A>
100<DT><STRONG>collision list</STRONG>
101<DD><A HREF="node4.html#1010">The Unique Table</A>
102<DT><STRONG>deletion</STRONG>
103<DD><A HREF="node4.html#1114">Non Modifiable Parameters</A>
104<DT><STRONG>local</STRONG>
105<DD><A HREF="node4.html#951">The Cache</A>
106 | <A HREF="node4.html#987">Local Caches</A>
107<DT><STRONG>lossless</STRONG>
108<DD><A HREF="node4.html#989">Local Caches</A>
109<DT><STRONG>reward-based resizing</STRONG>
110<DD><A HREF="node4.html#981">Cache Sizing</A>
111 | <A HREF="node4.html#984">Cache Sizing</A>
112<DT><STRONG>sizing</STRONG>
113<DD><A HREF="node4.html#976">Cache Sizing</A>
114</DL>
115<DT><STRONG>cacheSize</STRONG>
116<DD><A HREF="node3.html#169">Initializing and Shutting Down</A>
117<DT><STRONG>canonical</STRONG>
118<DD><A HREF="node3.html#138">The Manager</A>
119 | <A HREF="node4.html#990">Local Caches</A>
120<DT><STRONG>compiling</STRONG>
121<DD><A HREF="node3.html#78">Compiling and Linking</A>
122 | <A HREF="node3.html#234">Predefined Constants</A>
123 | <A HREF="node4.html#793">Compiling and Linking</A>
124<DT><STRONG>configuration</STRONG>
125<DD><A HREF="node2.html#54">The CUDD Package</A>
126<DT><STRONG>conversion</STRONG>
127<DD><DL COMPACT>
128<DT><STRONG>of ADDs to BDDs</STRONG>
129<DD><A HREF="node3.html#429">Converting ADDs to BDDs</A>
130<DT><STRONG>of BDDs to ADDs</STRONG>
131<DD><A HREF="node3.html#430">Converting ADDs to BDDs</A>
132<DT><STRONG>of BDDs to ZDDs</STRONG>
133<DD><A HREF="node3.html#406">Basic ZDD Manipulation</A>
134 | <A HREF="node3.html#451">Converting BDDs to ZDDs</A>
135<DT><STRONG>of ZDDs to BDDs</STRONG>
136<DD><A HREF="node3.html#450">Converting BDDs to ZDDs</A>
137</DL>
138<DT><STRONG>cube sets</STRONG>
139<DD><A HREF="node1.html#22">Introduction</A>
140<DT><STRONG>cudd.h</STRONG>
141<DD><A HREF="node3.html#81">Compiling and Linking</A>
142 | <A HREF="node3.html#504">Variable Reordering for BDDs</A>
143 | <A HREF="node4.html#916">Saturating Increments and Decrements</A>
144<DT><STRONG><I>Cudd_addApply</I></STRONG>
145<DD><A HREF="node3.html#1505">Basic ADD Manipulation</A>
146 | <A HREF="node3.html#1507">Basic ADD Manipulation</A>
147<DT><STRONG><I>Cudd_addBddInterval</I></STRONG>
148<DD><A HREF="node3.html#1523">Converting ADDs to BDDs</A>
149<DT><STRONG><I>Cudd_addBddPattern</I></STRONG>
150<DD><A HREF="node3.html#1521">Converting ADDs to BDDs</A>
151<DT><STRONG><I>Cudd_addBddThreshold</I></STRONG>
152<DD><A HREF="node3.html#1525">Converting ADDs to BDDs</A>
153<DT><STRONG><I>Cudd_addConst</I></STRONG>
154<DD><A HREF="node3.html#1475">New Constants</A>
155<DT><STRONG><I>Cudd_addHarwell</I></STRONG>
156<DD><A HREF="node3.html#1467">Background</A>
157<DT><STRONG><I>Cudd_AddHook</I></STRONG>
158<DD><A HREF="node3.html#1591">Hooks</A>
159<DT><STRONG><I>Cudd_addIthBit</I></STRONG>
160<DD><A HREF="node3.html#1529">Converting ADDs to BDDs</A>
161<DT><STRONG><I>Cudd_addIthVar</I></STRONG>
162<DD><A HREF="node3.html#1487">New BDD and ADD</A>
163<DT><STRONG><I>Cudd_addNewVar</I></STRONG>
164<DD><A HREF="node3.html#1489">New BDD and ADD</A>
165<DT><STRONG><I>Cudd_addNewVarAtLevel</I></STRONG>
166<DD><A HREF="node3.html#1491">New BDD and ADD</A>
167 | <A HREF="node3.html#1573">Grouping Variables</A>
168<DT><STRONG><I>Cudd_addRead</I></STRONG>
169<DD><A HREF="node3.html#1465">Background</A>
170<DT><STRONG><I>Cudd_addTimes</I></STRONG>
171<DD><A HREF="node3.html#1509">Basic ADD Manipulation</A>
172<DT><STRONG><I>Cudd_AutodynDisable</I></STRONG>
173<DD><A HREF="node3.html#1543">Variable Reordering for BDDs</A>
174<DT><STRONG><I>Cudd_AutodynDisableZdd</I></STRONG>
175<DD><A HREF="node3.html#1581">Variable Reordering for ZDDs</A>
176<DT><STRONG><I>Cudd_AutodynEnable</I></STRONG>
177<DD><A HREF="node3.html#1541">Variable Reordering for BDDs</A>
178 | <A HREF="node3.html#1547">Variable Reordering for BDDs</A>
179<DT><STRONG><I>Cudd_AutodynEnableZdd</I></STRONG>
180<DD><A HREF="node3.html#1579">Variable Reordering for ZDDs</A>
181<DT><STRONG><I>Cudd_bddAnd</I></STRONG>
182<DD><A HREF="node3.html#1497">Basic BDD Manipulation</A>
183 | <A HREF="node3.html#1501">Basic BDD Manipulation</A>
184 | <A HREF="node3.html#1511">Basic ADD Manipulation</A>
185<DT><STRONG><I>Cudd_bddConstrain</I></STRONG>
186<DD><A HREF="node3.html#1427">Nodes</A>
187<DT><STRONG><I>Cudd_bddIte</I></STRONG>
188<DD><A HREF="node3.html#1495">Basic BDD Manipulation</A>
189<DT><STRONG><I>Cudd_bddIthVar</I></STRONG>
190<DD><A HREF="node3.html#1477">New BDD and ADD</A>
191<DT><STRONG><I>Cudd_bddNewVar</I></STRONG>
192<DD><A HREF="node3.html#1479">New BDD and ADD</A>
193 | <A HREF="node3.html#1483">New BDD and ADD</A>
194 | <A HREF="node3.html#1485">New BDD and ADD</A>
195<DT><STRONG><I>Cudd_bddNewVarAtLevel</I></STRONG>
196<DD><A HREF="node3.html#1481">New BDD and ADD</A>
197 | <A HREF="node3.html#1571">Grouping Variables</A>
198<DT><STRONG><I>Cudd_BddToAdd</I></STRONG>
199<DD><A HREF="node3.html#1527">Converting ADDs to BDDs</A>
200<DT><STRONG><I>Cudd_bddXor</I></STRONG>
201<DD><A HREF="node3.html#1513">Basic ADD Manipulation</A>
202<DT><STRONG>CUDD_CACHE_SLOTS</STRONG>
203<DD><A HREF="node3.html#171">Initializing and Shutting Down</A>
204<DT><STRONG><I>Cudd_CheckKeys</I></STRONG>
205<DD><A HREF="node4.html#1695">Debugging</A>
206<DT><STRONG><I>Cudd_CheckZeroRef</I></STRONG>
207<DD><A HREF="node4.html#1701">Debugging</A>
208<DT><STRONG><I>Cudd_CountMinterm</I></STRONG>
209<DD><A HREF="node3.html#1473">Background</A>
210<DT><STRONG><I>Cudd_DebugCheck</I></STRONG>
211<DD><A HREF="node4.html#1693">Debugging</A>
212<DT><STRONG><I>Cudd_DelayedDerefBdd</I></STRONG>
213<DD><A HREF="node4.html#1705">Non Modifiable Parameters</A>
214<DT><STRONG><I>Cudd_Deref</I></STRONG>
215<DD><A HREF="node4.html#1641"><EM>Cudd_RecursiveDeref</EM> vs. <EM>Cudd_Deref</EM></A>
216 | <A HREF="node4.html#1653">Saturating Increments and Decrements</A>
217<DT><STRONG><I>Cudd_DumpBlif</I></STRONG>
218<DD><A HREF="node3.html#1597">Writing Decision Diagrams to</A>
219<DT><STRONG><I>Cudd_DumpDaVinci</I></STRONG>
220<DD><A HREF="node3.html#1603">Writing Decision Diagrams to</A>
221<DT><STRONG><I>Cudd_DumpDot</I></STRONG>
222<DD><A HREF="node3.html#1599">Writing Decision Diagrams to</A>
223<DT><STRONG><I>Cudd_ForeachCube</I></STRONG>
224<DD><A HREF="node3.html#1423">Nodes</A>
225 | <A HREF="node3.html#1471">Background</A>
226<DT><STRONG><I>Cudd_ForeachNode</I></STRONG>
227<DD><A HREF="node3.html#1425">Nodes</A>
228<DT><STRONG><I>Cudd_HookType</I></STRONG>
229<DD><A HREF="node3.html#1589">Hooks</A>
230<DT><STRONG><I>Cudd_Init</I></STRONG>
231<DD><A HREF="node3.html#1435">Initializing and Shutting Down</A>
232 | <A HREF="node3.html#1437">Initializing and Shutting Down</A>
233<DT><STRONG><I>Cudd_MakeTreeNode</I></STRONG>
234<DD><A HREF="node3.html#1563">Grouping Variables</A>
235 | <A HREF="node3.html#1569">Grouping Variables</A>
236<DT><STRONG><I>Cudd_MakeZddTreeNode</I></STRONG>
237<DD><A HREF="node3.html#1583">Variable Reordering for ZDDs</A>
238<DT><STRONG><I>Cudd_Not</I></STRONG>
239<DD><A HREF="node3.html#1449">One, Logic Zero, and</A>
240<DT><STRONG><I>Cudd_PrintInfo</I></STRONG>
241<DD><A HREF="node4.html#1703">Gathering and Interpreting Statistics</A>
242<DT><STRONG><I>Cudd_PrintMinterm</I></STRONG>
243<DD><A HREF="node3.html#1469">Background</A>
244<DT><STRONG><I>Cudd_Quit</I></STRONG>
245<DD><A HREF="node3.html#1439">Initializing and Shutting Down</A>
246<DT><STRONG><I>Cudd_ReadBackground</I></STRONG>
247<DD><A HREF="node3.html#1463">Background</A>
248<DT><STRONG><I>Cudd_ReadEpsilon</I></STRONG>
249<DD><A HREF="node3.html#1459">Predefined Constants</A>
250<DT><STRONG><I>Cudd_ReadErrorCode</I></STRONG>
251<DD><A HREF="node4.html#1637">NULL Return Values</A>
252<DT><STRONG><I>Cudd_ReadInvPerm</I></STRONG>
253<DD><A HREF="node3.html#1503">Basic BDD Manipulation</A>
254<DT><STRONG><I>Cudd_ReadLogicZero</I></STRONG>
255<DD><A HREF="node3.html#1451">One, Logic Zero, and</A>
256<DT><STRONG><I>Cudd_ReadLooseUpto</I></STRONG>
257<DD><A HREF="node3.html#1441">Setting Parameters</A>
258<DT><STRONG><I>Cudd_ReadMaxGrowth</I></STRONG>
259<DD><A HREF="node3.html#1555">Variable Reordering for BDDs</A>
260<DT><STRONG><I>Cudd_ReadMinusInfinity</I></STRONG>
261<DD><A HREF="node3.html#1457">Predefined Constants</A>
262<DT><STRONG><I>Cudd_ReadOne</I></STRONG>
263<DD><A HREF="node3.html#1445">One, Logic Zero, and</A>
264<DT><STRONG><I>Cudd_ReadPlusInfinity</I></STRONG>
265<DD><A HREF="node3.html#1455">Predefined Constants</A>
266<DT><STRONG><I>Cudd_ReadReorderings</I></STRONG>
267<DD><A HREF="node4.html#1689">Allowing Asynchronous Reordering</A>
268<DT><STRONG><I>Cudd_ReadSiftMaxVar</I></STRONG>
269<DD><A HREF="node3.html#1551">Variable Reordering for BDDs</A>
270<DT><STRONG><I>Cudd_ReadTree</I></STRONG>
271<DD><A HREF="node3.html#1567">Grouping Variables</A>
272<DT><STRONG><I>Cudd_ReadZddOne</I></STRONG>
273<DD><A HREF="node3.html#1447">One, Logic Zero, and</A>
274 | <A HREF="node3.html#1515">Basic ZDD Manipulation</A>
275<DT><STRONG><I>Cudd_ReadZero</I></STRONG>
276<DD><A HREF="node3.html#1453">Predefined Constants</A>
277<DT><STRONG><I>Cudd_RecursiveDeref</I></STRONG>
278<DD><A HREF="node3.html#1431">Nodes</A>
279 | <A HREF="node4.html#1619">Reference Counts</A>
280 | <A HREF="node4.html#1623">Reference Counts</A>
281 | <A HREF="node4.html#1633">Reference Counts</A>
282 | <A HREF="node4.html#1639"><EM>Cudd_RecursiveDeref</EM> vs. <EM>Cudd_Deref</EM></A>
283 | <A HREF="node4.html#1645">When Increasing the Reference</A>
284 | <A HREF="node4.html#1649">Saturating Increments and Decrements</A>
285 | <A HREF="node4.html#1677">Local Caches</A>
286 | <A HREF="node4.html#1699">Debugging</A>
287<DT><STRONG><I>Cudd_RecursiveDerefZdd</I></STRONG>
288<DD><A HREF="node3.html#1433">Nodes</A>
289 | <A HREF="node4.html#1621">Reference Counts</A>
290 | <A HREF="node4.html#1625">Reference Counts</A>
291 | <A HREF="node4.html#1635">Reference Counts</A>
292 | <A HREF="node4.html#1647">When Increasing the Reference</A>
293 | <A HREF="node4.html#1651">Saturating Increments and Decrements</A>
294<DT><STRONG><I>Cudd_ReduceHeap</I></STRONG>
295<DD><A HREF="node3.html#1539">Variable Reordering for BDDs</A>
296 | <A HREF="node3.html#1545">Variable Reordering for BDDs</A>
297 | <A HREF="node3.html#1549">Variable Reordering for BDDs</A>
298<DT><STRONG><I>Cudd_Ref</I></STRONG>
299<DD><A HREF="node3.html#1429">Nodes</A>
300 | <A HREF="node3.html#1499">Basic BDD Manipulation</A>
301 | <A HREF="node4.html#1617">Reference Counts</A>
302 | <A HREF="node4.html#1643">When Increasing the Reference</A>
303<DT><STRONG><I>Cudd_Regular</I></STRONG>
304<DD><A HREF="node4.html#1659">Complement Arcs</A>
305<DT><STRONG>CUDD_REORDER_ANNEALING</STRONG>
306<DD><A HREF="node3.html#559">Variable Reordering for BDDs</A>
307<DT><STRONG>CUDD_REORDER_EXACT</STRONG>
308<DD><A HREF="node3.html#565">Variable Reordering for BDDs</A>
309<DT><STRONG>CUDD_REORDER_GENETIC</STRONG>
310<DD><A HREF="node3.html#562">Variable Reordering for BDDs</A>
311<DT><STRONG>CUDD_REORDER_GROUP_SIFT</STRONG>
312<DD><A HREF="node3.html#544">Variable Reordering for BDDs</A>
313<DT><STRONG>CUDD_REORDER_GROUP_SIFT_CONV</STRONG>
314<DD><A HREF="node3.html#548">Variable Reordering for BDDs</A>
315<DT><STRONG>CUDD_REORDER_NONE</STRONG>
316<DD><A HREF="node3.html#507">Variable Reordering for BDDs</A>
317 | <A HREF="node3.html#631">Variable Reordering for ZDDs</A>
318<DT><STRONG>CUDD_REORDER_RANDOM</STRONG>
319<DD><A HREF="node3.html#515">Variable Reordering for BDDs</A>
320 | <A HREF="node3.html#633">Variable Reordering for ZDDs</A>
321<DT><STRONG>CUDD_REORDER_RANDOM_PIVOT</STRONG>
322<DD><A HREF="node3.html#517">Variable Reordering for BDDs</A>
323 | <A HREF="node3.html#634">Variable Reordering for ZDDs</A>
324<DT><STRONG>CUDD_REORDER_SAME</STRONG>
325<DD><A HREF="node3.html#508">Variable Reordering for BDDs</A>
326 | <A HREF="node3.html#632">Variable Reordering for ZDDs</A>
327<DT><STRONG>CUDD_REORDER_SIFT</STRONG>
328<DD><A HREF="node3.html#518">Variable Reordering for BDDs</A>
329 | <A HREF="node3.html#635">Variable Reordering for ZDDs</A>
330<DT><STRONG>CUDD_REORDER_SIFT_CONVERGE</STRONG>
331<DD><A HREF="node3.html#533">Variable Reordering for BDDs</A>
332 | <A HREF="node3.html#636">Variable Reordering for ZDDs</A>
333<DT><STRONG>CUDD_REORDER_SYMM_SIFT</STRONG>
334<DD><A HREF="node3.html#535">Variable Reordering for BDDs</A>
335 | <A HREF="node3.html#637">Variable Reordering for ZDDs</A>
336<DT><STRONG>CUDD_REORDER_SYMM_SIFT_CONV</STRONG>
337<DD><A HREF="node3.html#542">Variable Reordering for BDDs</A>
338 | <A HREF="node3.html#638">Variable Reordering for ZDDs</A>
339<DT><STRONG>CUDD_REORDER_WINDOW2</STRONG>
340<DD><A HREF="node3.html#549">Variable Reordering for BDDs</A>
341<DT><STRONG>CUDD_REORDER_WINDOW2_CONV</STRONG>
342<DD><A HREF="node3.html#555">Variable Reordering for BDDs</A>
343<DT><STRONG>CUDD_REORDER_WINDOW3</STRONG>
344<DD><A HREF="node3.html#553">Variable Reordering for BDDs</A>
345<DT><STRONG>CUDD_REORDER_WINDOW3_CONV</STRONG>
346<DD><A HREF="node3.html#557">Variable Reordering for BDDs</A>
347<DT><STRONG>CUDD_REORDER_WINDOW4</STRONG>
348<DD><A HREF="node3.html#554">Variable Reordering for BDDs</A>
349<DT><STRONG>CUDD_REORDER_WINDOW4_CONV</STRONG>
350<DD><A HREF="node3.html#558">Variable Reordering for BDDs</A>
351<DT><STRONG><I>Cudd_SetEpsilon</I></STRONG>
352<DD><A HREF="node3.html#1461">Predefined Constants</A>
353<DT><STRONG><I>Cudd_SetLooseUpTo</I></STRONG>
354<DD><A HREF="node3.html#1443">Setting Parameters</A>
355<DT><STRONG><I>Cudd_SetMaxCacheHard</I></STRONG>
356<DD><A HREF="node4.html#1707">Modifiable Parameters</A>
357<DT><STRONG><I>Cudd_SetMaxGrowth</I></STRONG>
358<DD><A HREF="node3.html#1557">Variable Reordering for BDDs</A>
359<DT><STRONG><I>Cudd_SetSiftMaxVar</I></STRONG>
360<DD><A HREF="node3.html#1553">Variable Reordering for BDDs</A>
361<DT><STRONG><I>Cudd_SetTree</I></STRONG>
362<DD><A HREF="node3.html#1565">Grouping Variables</A>
363<DT><STRONG><I>Cudd_ShuffleHeap</I></STRONG>
364<DD><A HREF="node3.html#1561">Variable Reordering for BDDs</A>
365<DT><STRONG><I>Cudd_StdPostReordHook</I></STRONG>
366<DD><A HREF="node3.html#1595">Hooks</A>
367<DT><STRONG><I>Cudd_StdPreReordHook</I></STRONG>
368<DD><A HREF="node3.html#1593">Hooks</A>
369<DT><STRONG><I>Cudd_SymmProfile</I></STRONG>
370<DD><A HREF="node3.html#1559">Variable Reordering for BDDs</A>
371<DT><STRONG>CUDD_UNIQUE_SLOTS</STRONG>
372<DD><A HREF="node3.html#168">Initializing and Shutting Down</A>
373<DT><STRONG><I>Cudd_zddDumpDot</I></STRONG>
374<DD><A HREF="node3.html#1601">Writing Decision Diagrams to</A>
375<DT><STRONG><I>Cudd_zddIsop</I></STRONG>
376<DD><A HREF="node3.html#1517">Basic ZDD Manipulation</A>
377<DT><STRONG><I>Cudd_zddIthVar</I></STRONG>
378<DD><A HREF="node3.html#1493">New ZDD Variables</A>
379<DT><STRONG><I>Cudd_zddPortFromBdd</I></STRONG>
380<DD><A HREF="node3.html#1533">Converting BDDs to ZDDs</A>
381<DT><STRONG><I>Cudd_zddPortToBdd</I></STRONG>
382<DD><A HREF="node3.html#1535">Converting BDDs to ZDDs</A>
383<DT><STRONG><I>Cudd_zddRealignDisable</I></STRONG>
384<DD><A HREF="node3.html#1587">Keeping Consistent Variable Orders</A>
385<DT><STRONG><I>Cudd_zddRealignEnable</I></STRONG>
386<DD><A HREF="node3.html#1585">Keeping Consistent Variable Orders</A>
387<DT><STRONG><I>Cudd_zddReduceHeap</I></STRONG>
388<DD><A HREF="node3.html#1575">Variable Reordering for ZDDs</A>
389<DT><STRONG><I>Cudd_zddShuffleHeap</I></STRONG>
390<DD><A HREF="node3.html#1577">Variable Reordering for ZDDs</A>
391<DT><STRONG><I>Cudd_zddVarsFromBddVars</I></STRONG>
392<DD><A HREF="node3.html#1531">Converting BDDs to ZDDs</A>
393 | <A HREF="node3.html#1537">Converting BDDs to ZDDs</A>
394<DT><STRONG><I>Cudd_zddWeakDiv</I></STRONG>
395<DD><A HREF="node3.html#1519">Basic ZDD Manipulation</A>
396<DT><STRONG><I>cuddCacheInsert</I></STRONG>
397<DD><A HREF="node4.html#1665">The Cache</A>
398<DT><STRONG><I>cuddCacheInsert1</I></STRONG>
399<DD><A HREF="node4.html#1673">The Cache</A>
400<DT><STRONG><I>cuddCacheInsert2</I></STRONG>
401<DD><A HREF="node4.html#1669">The Cache</A>
402<DT><STRONG><I>cuddCacheLookup</I></STRONG>
403<DD><A HREF="node4.html#1667">The Cache</A>
404<DT><STRONG><I>cuddCacheLookup1</I></STRONG>
405<DD><A HREF="node4.html#1675">The Cache</A>
406<DT><STRONG><I>cuddCacheLookup2</I></STRONG>
407<DD><A HREF="node4.html#1671">The Cache</A>
408<DT><STRONG>CUDDDIR</STRONG>
409<DD><A HREF="node3.html#680">Using the CUDD Package</A>
410<DT><STRONG><I>cuddHeapProfile</I></STRONG>
411<DD><A HREF="node4.html#1697">Debugging</A>
412<DT><STRONG><I>cuddI</I></STRONG>
413<DD><A HREF="node4.html#1679">The Unique Table</A>
414<DT><STRONG>cuddInt.h</STRONG>
415<DD><A HREF="node4.html#1069">Debugging</A>
416<DT><STRONG><I>cuddIZ</I></STRONG>
417<DD><A HREF="node4.html#1681">The Unique Table</A>
418<DT><STRONG><I>cuddSatDec</I></STRONG>
419<DD><A HREF="node4.html#1657">Saturating Increments and Decrements</A>
420<DT><STRONG><I>cuddSatInc</I></STRONG>
421<DD><A HREF="node4.html#1655">Saturating Increments and Decrements</A>
422<DT><STRONG><I>cuddUniqueConst</I></STRONG>
423<DD><A HREF="node4.html#1609">Reference Counts</A>
424 | <A HREF="node4.html#1615">Reference Counts</A>
425 | <A HREF="node4.html#1631">Reference Counts</A>
426<DT><STRONG><I>cuddUniqueInter</I></STRONG>
427<DD><A HREF="node4.html#1605">Reference Counts</A>
428 | <A HREF="node4.html#1611">Reference Counts</A>
429 | <A HREF="node4.html#1627">Reference Counts</A>
430 | <A HREF="node4.html#1661">Complement Arcs</A>
431 | <A HREF="node4.html#1663">Complement Arcs</A>
432 | <A HREF="node4.html#1683">Allowing Asynchronous Reordering</A>
433 | <A HREF="node4.html#1687">Allowing Asynchronous Reordering</A>
434 | <A HREF="node4.html#1691">Allowing Asynchronous Reordering</A>
435<DT><STRONG><I>cuddUniqueInterZdd</I></STRONG>
436<DD><A HREF="node4.html#1607">Reference Counts</A>
437 | <A HREF="node4.html#1613">Reference Counts</A>
438 | <A HREF="node4.html#1629">Reference Counts</A>
439 | <A HREF="node4.html#1685">Allowing Asynchronous Reordering</A>
440<DT><STRONG>DD_CACHE_PROFILE</STRONG>
441<DD><A HREF="node4.html#1172">Extended Statistics and Reporting</A>
442<DT><STRONG>DD_DEBUG</STRONG>
443<DD><A HREF="node4.html#1056">Debugging</A>
444<DT><STRONG>DD_STATS</STRONG>
445<DD><A HREF="node4.html#1171">Extended Statistics and Reporting</A>
446<DT><STRONG>DD_UNIQUE_PROFILE</STRONG>
447<DD><A HREF="node4.html#1173">Extended Statistics and Reporting</A>
448<DT><STRONG>DD_VERBOSE</STRONG>
449<DD><A HREF="node4.html#1174">Extended Statistics and Reporting</A>
450<DT><STRONG>DdManager</STRONG>
451<DD><A HREF="node3.html#140">The Manager</A>
452 | <A HREF="node3.html#155">Initializing and Shutting Down</A>
453<DT><STRONG>DdNode</STRONG>
454<DD><A HREF="node3.html#91">Nodes</A>
455 | <A HREF="node4.html#949">The Cache</A>
456<DT><STRONG>debugging</STRONG>
457<DD><A HREF="node4.html#1054">Debugging</A>
458<DT><STRONG>DEC Alpha</STRONG>
459<DD><A HREF="node3.html#233">Predefined Constants</A>
460 | <A HREF="node3.html#747">Using the CUDD Package</A>
461<DT><STRONG>documentation</STRONG>
462<DD><A HREF="node4.html#1178">Guidelines for Documentation</A>
463<DL COMPACT>
464<DT><STRONG><I>Description</I></STRONG>
465<DD><A HREF="node4.html#1412">Guidelines for Documentation</A>
466<DT><STRONG>HTML files</STRONG>
467<DD><A HREF="node4.html#1194">Guidelines for Documentation</A>
468<DT><STRONG><I>SeeAlso</I></STRONG>
469<DD><A HREF="node4.html#1411">Guidelines for Documentation</A>
470<DT><STRONG><I>Synopsis</I></STRONG>
471<DD><A HREF="node4.html#1413">Guidelines for Documentation</A>
472</DL>
473<DT><STRONG>dot</STRONG>
474<DD><i>see </i> graph, drawing
475<DT><STRONG>Epsilon</STRONG>
476<DD><A HREF="node3.html#244">Predefined Constants</A>
477<DT><STRONG>extdoc</STRONG>
478<DD><i>see </i> documentation
479<DT><STRONG>floating point</STRONG>
480<DD><A HREF="node3.html#231">Predefined Constants</A>
481<DL COMPACT>
482<DT><STRONG>double (C type)</STRONG>
483<DD><A HREF="node3.html#132">Nodes</A>
484<DT><STRONG>IEEE Standard 754</STRONG>
485<DD><A HREF="node3.html#230">Predefined Constants</A>
486</DL>
487<DT><STRONG>free list</STRONG>
488<DD><A HREF="node4.html#845">Reference Counts</A>
489<DT><STRONG>FTP</STRONG>
490<DD><A HREF="node2.html#45">The CUDD Package</A>
491 | <A HREF="node2.html#67">CUDD Friends</A>
492 | <A HREF="node3.html#742">Using the CUDD Package</A>
493 | <A HREF="node4.html#1179">Guidelines for Documentation</A>
494<DT><STRONG>function</STRONG>
495<DD><DL COMPACT>
496<DT><STRONG>characteristic</STRONG>
497<DD><A HREF="node1.html#21">Introduction</A>
498 | <A HREF="node3.html#476">Converting BDDs to ZDDs</A>
499<DT><STRONG>cover</STRONG>
500<DD><A HREF="node3.html#417">Basic ZDD Manipulation</A>
501 | <A HREF="node3.html#467">Converting BDDs to ZDDs</A>
502 | <A HREF="node3.html#475">Converting BDDs to ZDDs</A>
503<DD><DL COMPACT>
504<DT><STRONG>irredundant</STRONG>
505<DD><A HREF="node3.html#421">Basic ZDD Manipulation</A>
506</DL>
507<DT><STRONG>minterms</STRONG>
508<DD><A HREF="node3.html#279">Background</A>
509 | <A HREF="node4.html#1027">Allowing Asynchronous Reordering</A>
510<DT><STRONG>ON-set</STRONG>
511<DD><A HREF="node1.html#23">Introduction</A>
512<DT><STRONG>sum of products</STRONG>
513<DD><A HREF="node3.html#272">Background</A>
514<DT><STRONG>switching</STRONG>
515<DD><A HREF="node1.html#19">Introduction</A>
516 | <A HREF="node1.html#20">Introduction</A>
517</DL>
518<DT><STRONG>garbage collection</STRONG>
519<DD><A HREF="node3.html#116">Nodes</A>
520 | <A HREF="node3.html#151">Cache</A>
521 | <A HREF="node3.html#189">Setting Parameters</A>
522 | <A HREF="node4.html#802">Reference Counts</A>
523 | <A HREF="node4.html#844">Reference Counts</A>
524 | <A HREF="node4.html#946">The Cache</A>
525 | <A HREF="node4.html#991">Local Caches</A>
526 | <A HREF="node4.html#1012">The Unique Table</A>
527<DL COMPACT>
528<DT><STRONG>hooks</STRONG>
529<DD><A HREF="node3.html#659">Hooks</A>
530</DL>
531<DT><STRONG>gcc</STRONG>
532<DD><A HREF="node3.html#235">Predefined Constants</A>
533<DT><STRONG>generator</STRONG>
534<DD><A HREF="node3.html#103">Nodes</A>
535<DT><STRONG>global variables</STRONG>
536<DD><A HREF="node3.html#144">The Manager</A>
537<DT><STRONG>graph</STRONG>
538<DD><DL COMPACT>
539<DT><STRONG>arc capacity</STRONG>
540<DD><A HREF="node3.html#259">Background</A>
541<DT><STRONG>arc length</STRONG>
542<DD><A HREF="node3.html#257">Background</A>
543<DT><STRONG>drawing</STRONG>
544<DD><A HREF="node3.html#760">Writing Decision Diagrams to</A>
545 | <A HREF="node3.html#780">Writing Decision Diagrams to</A>
546</DL>
547<DT><STRONG>growth</STRONG>
548<DD><A HREF="node3.html#190">Setting Parameters</A>
549<DT><STRONG>gzip</STRONG>
550<DD><A HREF="node2.html#49">The CUDD Package</A>
551<DT><STRONG>HAVE_IEEE_754</STRONG>
552<DD><A HREF="node3.html#236">Predefined Constants</A>
553<DT><STRONG>header files</STRONG>
554<DD><A HREF="node3.html#505">Variable Reordering for BDDs</A>
555 | <A HREF="node4.html#914">Saturating Increments and Decrements</A>
556<DT><STRONG>hook</STRONG>
557<DD><A HREF="node3.html#652">Hooks</A>
558<DT><STRONG>infinities</STRONG>
559<DD><A HREF="node3.html#232">Predefined Constants</A>
560<DT><STRONG>installation</STRONG>
561<DD><A HREF="node2.html#55">The CUDD Package</A>
562<DT><STRONG>Intel PentiumPro</STRONG>
563<DD><A HREF="node2.html#60">The CUDD Package</A>
564<DT><STRONG>interface</STRONG>
565<DD><DL COMPACT>
566<DT><STRONG>cache</STRONG>
567<DD><A HREF="node4.html#956">The Cache</A>
568<DT><STRONG>SIS</STRONG>
569<DD><A HREF="node3.html#669">The SIS/VIS Interface</A>
570 | <A HREF="node3.html#677">Using the CUDD Package</A>
571<DT><STRONG>VIS</STRONG>
572<DD><A HREF="node3.html#670">The SIS/VIS Interface</A>
573</DL>
574<DT><STRONG>libraries</STRONG>
575<DD><A HREF="node2.html#52">The CUDD Package</A>
576<DL COMPACT>
577<DT><STRONG>cudd</STRONG>
578<DD><A HREF="node3.html#82">Compiling and Linking</A>
579<DT><STRONG>dddmp</STRONG>
580<DD><A HREF="node3.html#789">Saving and Restoring BDDs</A>
581<DT><STRONG>mtr</STRONG>
582<DD><A HREF="node3.html#83">Compiling and Linking</A>
583 | <A HREF="node3.html#581">Grouping Variables</A>
584<DT><STRONG>obj</STRONG>
585<DD><A HREF="node5.html#1204">Compiling and Linking</A>
586<DT><STRONG>st</STRONG>
587<DD><A HREF="node3.html#84">Compiling and Linking</A>
588 | <A HREF="node4.html#953">The Cache</A>
589<DT><STRONG>util</STRONG>
590<DD><A HREF="node3.html#85">Compiling and Linking</A>
591</DL>
592<DT><STRONG>Makefile</STRONG>
593<DD><A HREF="node3.html#86">Compiling and Linking</A>
594 | <A HREF="node3.html#237">Predefined Constants</A>
595 | <A HREF="node5.html#1205">Compiling and Linking</A>
596<DT><STRONG>manager</STRONG>
597<DD><A HREF="node3.html#134">The Manager</A>
598 | <A HREF="node3.html#141">The Manager</A>
599 | <A HREF="node3.html#201">Constant Functions</A>
600<DT><STRONG>matrix</STRONG>
601<DD><DL COMPACT>
602<DT><STRONG>sparse</STRONG>
603<DD><A HREF="node3.html#260">Background</A>
604</DL>
605<DT><STRONG>maxCache</STRONG>
606<DD><A HREF="node4.html#979">Cache Sizing</A>
607<DT><STRONG>maxMemory</STRONG>
608<DD><A HREF="node3.html#172">Initializing and Shutting Down</A>
609<DT><STRONG>MinusInfinity</STRONG>
610<DD><A HREF="node3.html#229">Predefined Constants</A>
611<DT><STRONG>MTR_DEFAULT</STRONG>
612<DD><A HREF="node3.html#598">Grouping Variables</A>
613<DT><STRONG>MTR_FIXED</STRONG>
614<DD><A HREF="node3.html#593">Grouping Variables</A>
615<DT><STRONG>nanotrav</STRONG>
616<DD><A HREF="node2.html#58">The CUDD Package</A>
617 | <A HREF="node2.html#62">The CUDD Package</A>
618<DT><STRONG>node</STRONG>
619<DD><A HREF="node3.html#92">Nodes</A>
620<DL COMPACT>
621<DT><STRONG>constant</STRONG>
622<DD><A HREF="node3.html#99">Nodes</A>
623 | <A HREF="node3.html#199">Constant Functions</A>
624 | <A HREF="node3.html#206">One, Logic Zero, and</A>
625 | <A HREF="node3.html#226">Predefined Constants</A>
626 | <A HREF="node3.html#256">Background</A>
627 | <A HREF="node3.html#285">New Constants</A>
628 | <A HREF="node4.html#809">Reference Counts</A>
629 | <A HREF="node4.html#883">When Increasing the Reference</A>
630<DD><DL COMPACT>
631<DT><STRONG>value</STRONG>
632<DD><A HREF="node3.html#131">Nodes</A>
633</DL>
634<DT><STRONG>dead</STRONG>
635<DD><A HREF="node4.html#833">Reference Counts</A>
636 | <A HREF="node4.html#947">The Cache</A>
637 | <A HREF="node4.html#1011">The Unique Table</A>
638<DT><STRONG>dereference</STRONG>
639<DD><A HREF="node3.html#389">Basic ADD Manipulation</A>
640<DT><STRONG>reclaimed</STRONG>
641<DD><A HREF="node4.html#1015">The Unique Table</A>
642<DT><STRONG>recycling</STRONG>
643<DD><A HREF="node3.html#130">Nodes</A>
644<DT><STRONG>reference</STRONG>
645<DD><A HREF="node3.html#388">Basic ADD Manipulation</A>
646<DT><STRONG>reference count</STRONG>
647<DD><A HREF="node3.html#94">Nodes</A>
648 | <A HREF="node3.html#117">Nodes</A>
649 | <A HREF="node3.html#356">Basic BDD Manipulation</A>
650 | <A HREF="node3.html#370">Basic BDD Manipulation</A>
651 | <A HREF="node4.html#800">Reference Counts</A>
652 | <A HREF="node4.html#831">Reference Counts</A>
653 | <A HREF="node4.html#846">Reference Counts</A>
654 | <A HREF="node4.html#881">When Increasing the Reference</A>
655 | <A HREF="node4.html#899">Saturating Increments and Decrements</A>
656 | <A HREF="node4.html#945">The Cache</A>
657 | <A HREF="node4.html#992">Local Caches</A>
658 | <A HREF="node4.html#1086">Debugging</A>
659<DD><DL COMPACT>
660<DT><STRONG>saturated</STRONG>
661<DD><A HREF="node4.html#1088">Debugging</A>
662</DL>
663<DT><STRONG>terminal</STRONG>
664<DD><i>see </i> node, constant
665<DT><STRONG>variable index</STRONG>
666<DD><A HREF="node3.html#93">Nodes</A>
667</DL>
668<DT><STRONG>numSlots</STRONG>
669<DD><A HREF="node3.html#165">Initializing and Shutting Down</A>
670<DT><STRONG>numVars</STRONG>
671<DD><A HREF="node3.html#161">Initializing and Shutting Down</A>
672<DT><STRONG>numVarsZ</STRONG>
673<DD><A HREF="node3.html#162">Initializing and Shutting Down</A>
674<DT><STRONG>PlusInfinity</STRONG>
675<DD><A HREF="node3.html#228">Predefined Constants</A>
676 | <A HREF="node3.html#258">Background</A>
677<DT><STRONG>projection functions</STRONG>
678<DD><A HREF="node3.html#293">Creating Variables</A>
679 | <A HREF="node3.html#296">New BDD and ADD</A>
680 | <A HREF="node3.html#305">New BDD and ADD</A>
681 | <A HREF="node3.html#309">New BDD and ADD</A>
682 | <A HREF="node3.html#333">New ZDD Variables</A>
683 | <A HREF="node3.html#355">Basic BDD Manipulation</A>
684 | <A HREF="node3.html#387">Basic ADD Manipulation</A>
685 | <A HREF="node3.html#408">Basic ZDD Manipulation</A>
686 | <A HREF="node3.html#412">Basic ZDD Manipulation</A>
687 | <A HREF="node4.html#1087">Debugging</A>
688<DT><STRONG>README file</STRONG>
689<DD><A HREF="node2.html#63">The CUDD Package</A>
690 | <A HREF="node2.html#53">The CUDD Package</A>
691<DT><STRONG>reordering</STRONG>
692<DD><A HREF="node1.html#24">Introduction</A>
693 | <A HREF="node1.html#28">Introduction</A>
694 | <A HREF="node3.html#101">Nodes</A>
695 | <A HREF="node4.html#948">The Cache</A>
696<DL COMPACT>
697<DT><STRONG>abort and retry</STRONG>
698<DD><A HREF="node4.html#1029">Allowing Asynchronous Reordering</A>
699<DT><STRONG>asynchronous</STRONG>
700<DD><A HREF="node3.html#489">Variable Reordering for BDDs</A>
701 | <A HREF="node4.html#1024">Allowing Asynchronous Reordering</A>
702<DT><STRONG>converging</STRONG>
703<DD><A HREF="node3.html#499">Variable Reordering for BDDs</A>
704 | <A HREF="node3.html#534">Variable Reordering for BDDs</A>
705 | <A HREF="node3.html#543">Variable Reordering for BDDs</A>
706 | <A HREF="node3.html#556">Variable Reordering for BDDs</A>
707<DT><STRONG>Cudd_ReorderingType</STRONG>
708<DD><A HREF="node3.html#503">Variable Reordering for BDDs</A>
709<DT><STRONG>dynamic</STRONG>
710<DD><A HREF="node1.html#33">Introduction</A>
711 | <A HREF="node3.html#480">Variable Reordering for BDDs</A>
712 | <A HREF="node3.html#623">Variable Reordering for ZDDs</A>
713<DT><STRONG>exact</STRONG>
714<DD><A HREF="node3.html#566">Variable Reordering for BDDs</A>
715<DT><STRONG>function wrapper</STRONG>
716<DD><A HREF="node4.html#1031">Allowing Asynchronous Reordering</A>
717 | <A HREF="node4.html#1051">Allowing Asynchronous Reordering</A>
718<DT><STRONG>genetic</STRONG>
719<DD><A HREF="node3.html#563">Variable Reordering for BDDs</A>
720<DT><STRONG>group</STRONG>
721<DD><A HREF="node3.html#501">Variable Reordering for BDDs</A>
722 | <A HREF="node3.html#545">Variable Reordering for BDDs</A>
723<DT><STRONG>hooks</STRONG>
724<DD><A HREF="node3.html#660">Hooks</A>
725<DT><STRONG>interruptible procedure</STRONG>
726<DD><A HREF="node4.html#1030">Allowing Asynchronous Reordering</A>
727<DT><STRONG>of BDDs and ADDs</STRONG>
728<DD><A HREF="node3.html#478">Variable Reordering for BDDs</A>
729<DT><STRONG>of ZDDs</STRONG>
730<DD><A HREF="node3.html#426">Basic ZDD Manipulation</A>
731 | <A HREF="node3.html#611">Variable Reordering for ZDDs</A>
732<DT><STRONG>random</STRONG>
733<DD><A HREF="node3.html#516">Variable Reordering for BDDs</A>
734<DT><STRONG>sifting</STRONG>
735<DD><A HREF="node3.html#502">Variable Reordering for BDDs</A>
736 | <A HREF="node3.html#519">Variable Reordering for BDDs</A>
737<DT><STRONG>simulated annealing</STRONG>
738<DD><A HREF="node3.html#560">Variable Reordering for BDDs</A>
739<DT><STRONG>symmetric</STRONG>
740<DD><A HREF="node3.html#536">Variable Reordering for BDDs</A>
741<DT><STRONG>threshold</STRONG>
742<DD><A HREF="node3.html#488">Variable Reordering for BDDs</A>
743 | <A HREF="node4.html#1026">Allowing Asynchronous Reordering</A>
744<DT><STRONG>window</STRONG>
745<DD><A HREF="node3.html#550">Variable Reordering for BDDs</A>
746</DL>
747<DT><STRONG>saturating</STRONG>
748<DD><DL COMPACT>
749<DT><STRONG>decrements</STRONG>
750<DD><A HREF="node4.html#897">Saturating Increments and Decrements</A>
751<DT><STRONG>increments</STRONG>
752<DD><A HREF="node4.html#896">Saturating Increments and Decrements</A>
753</DL>
754<DT><STRONG>SISDIR</STRONG>
755<DD><A HREF="node3.html#679">Using the CUDD Package</A>
756<DT><STRONG>SIZEOF_INT</STRONG>
757<DD><A HREF="node4.html#913">Saturating Increments and Decrements</A>
758 | <A HREF="node4.html#924">Saturating Increments and Decrements</A>
759<DT><STRONG>SIZEOF_VOID_P</STRONG>
760<DD><A HREF="node4.html#912">Saturating Increments and Decrements</A>
761 | <A HREF="node4.html#923">Saturating Increments and Decrements</A>
762<DT><STRONG>statistical counters</STRONG>
763<DD><A HREF="node3.html#143">The Manager</A>
764 | <A HREF="node4.html#834">Reference Counts</A>
765 | <A HREF="node4.html#983">Cache Sizing</A>
766<DT><STRONG>statistics</STRONG>
767<DD><A HREF="node4.html#1090">Gathering and Interpreting Statistics</A>
768<DT><STRONG>subtable</STRONG>
769<DD><A HREF="node3.html#166">Initializing and Shutting Down</A>
770 | <A HREF="node4.html#835">Reference Counts</A>
771<DT><STRONG>symmetry</STRONG>
772<DD><A HREF="node3.html#538">Variable Reordering for BDDs</A>
773<DT><STRONG>table</STRONG>
774<DD><DL COMPACT>
775<DT><STRONG>computed</STRONG>
776<DD><A HREF="node3.html#149">Cache</A>
777<DT><STRONG>growth</STRONG>
778<DD><A HREF="node3.html#188">Setting Parameters</A>
779<DT><STRONG>hash</STRONG>
780<DD><A HREF="node3.html#136">The Manager</A>
781 | <A HREF="node4.html#1007">The Unique Table</A>
782<DT><STRONG>unique</STRONG>
783<DD><A HREF="node3.html#95">Nodes</A>
784 | <A HREF="node3.html#137">The Manager</A>
785 | <A HREF="node3.html#139">The Manager</A>
786 | <A HREF="node3.html#167">Initializing and Shutting Down</A>
787 | <A HREF="node3.html#174">Initializing and Shutting Down</A>
788 | <A HREF="node3.html#187">Setting Parameters</A>
789 | <A HREF="node3.html#483">Variable Reordering for BDDs</A>
790 | <A HREF="node4.html#836">Reference Counts</A>
791 | <A HREF="node4.html#980">Cache Sizing</A>
792 | <A HREF="node4.html#985">Cache Sizing</A>
793 | <A HREF="node4.html#998">The Unique Table</A>
794<DD><DL COMPACT>
795<DT><STRONG>fast growth</STRONG>
796<DD><A HREF="node4.html#1018">The Unique Table</A>
797<DT><STRONG>reward-based resizing</STRONG>
798<DD><A HREF="node4.html#1016">The Unique Table</A>
799<DT><STRONG>slow growth</STRONG>
800<DD><A HREF="node4.html#1019">The Unique Table</A>
801</DL>
802</DL>
803<DT><STRONG>variable</STRONG>
804<DD><DL COMPACT>
805<DT><STRONG>groups</STRONG>
806<DD><A HREF="node3.html#574">Grouping Variables</A>
807<DT><STRONG>order</STRONG>
808<DD><A HREF="node3.html#98">Nodes</A>
809 | <A HREF="node3.html#316">New BDD and ADD</A>
810<DT><STRONG>permutation</STRONG>
811<DD><A HREF="node3.html#100">Nodes</A>
812 | <A HREF="node4.html#1000">The Unique Table</A>
813<DT><STRONG>tree</STRONG>
814<DD><A HREF="node3.html#576">Grouping Variables</A>
815 | <A HREF="node3.html#603">Grouping Variables</A>
816</DL>
817<DT><STRONG>ZDD</STRONG>
818<DD><A HREF="node1.html#17">Introduction</A>
819 | <A HREF="node3.html#120">Nodes</A>
820 | <A HREF="node3.html#331">New ZDD Variables</A>
821 | <A HREF="node3.html#404">Basic ZDD Manipulation</A>
822 | <A HREF="node3.html#453">Converting BDDs to ZDDs</A>
823<DT><STRONG>zero</STRONG>
824<DD><DL COMPACT>
825<DT><STRONG>arithmetic</STRONG>
826<DD><A HREF="node3.html#204">One, Logic Zero, and</A>
827 | <A HREF="node3.html#300">New BDD and ADD</A>
828 | <A HREF="node3.html#445">Converting ADDs to BDDs</A>
829<DT><STRONG>logical</STRONG>
830<DD><A HREF="node3.html#203">One, Logic Zero, and</A>
831 | <A HREF="node3.html#444">Converting ADDs to BDDs</A>
832</DL>
833<DT><STRONG>Zero-suppressed Binary Decision Diagram</STRONG>
834<DD><i>see </i> ZDD
835
836</DL>
837<BR><HR>
838<ADDRESS>
839Fabio Somenzi
8402005-05-17
841</ADDRESS>
842</BODY>
843</HTML>
Note: See TracBrowser for help on using the repository browser.