<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>FAUST compiler: CTree Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.3 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="classes.html"><span>Class Index</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1>CTree Class Reference</h1><!-- doxytag: class="CTree" -->
<p>A <a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a> = (<a class="el" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> x [<a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a>]) is a <a class="el" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> associated with a list of subtrees called branches.
<a href="#_details">More...</a></p>
<p><code>#include <<a class="el" href="tree_8hh_source.html">tree.hh</a>></code></p>
<div class="dynheader">
Collaboration diagram for CTree:</div>
<div class="dynsection">
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<p><a href="classCTree-members.html">List of all members.</a></p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td colspan="2"><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a03282df290b747bb7a400919ec366af5">~CTree</a> ()</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classNode.html">Node</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a8de786fec095c8304b9ffa7c1c316237">node</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return the content of the tree <a href="#a8de786fec095c8304b9ffa7c1c316237"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a68f2be5e845407bc956a2893fe6f0d03">arity</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return the number of branches (subtrees) of a tree <a href="#a68f2be5e845407bc956a2893fe6f0d03"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="classCTree.html">Tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a06c1513b23dc7b0d9da9c930c6dc43c5">branch</a> (int i) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return the ith branch (subtree) of a tree <a href="#a06c1513b23dc7b0d9da9c930c6dc43c5"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#ac857fdcad70269113f3502eb1af7b4fb">hashkey</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return the hashkey of the tree <a href="#ac857fdcad70269113f3502eb1af7b4fb"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a3ce05a5474896a873ddbccd7caea2680">aperture</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return how "open" is a tree in terms of free variables <a href="#a3ce05a5474896a873ddbccd7caea2680"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a43dfbeab91c992660762d3d6783baff7">setAperture</a> (int a)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">modify the aperture of a tree <a href="#a43dfbeab91c992660762d3d6783baff7"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">ostream & </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a47b39b985a852b02b12c8dd2d790543e">print</a> (ostream &fout) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">print recursively the content of a tree on a stream <a href="#a47b39b985a852b02b12c8dd2d790543e"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#ac8a19f4ef59fae1449e60dbd990eb90f">setType</a> (void *t)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void * </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#adfb1030a444053685b84e45c76eabe6a">getType</a> ()</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#ac628a2ad0d2a21de584e3bca291bd38c">setProperty</a> (<a class="el" href="classCTree.html">Tree</a> key, <a class="el" href="classCTree.html">Tree</a> value)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#af2869391b5fbcf5a34cc034533fb207d">clearProperty</a> (<a class="el" href="classCTree.html">Tree</a> key)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="classCTree.html">Tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a902b48b83db587f14dbd31999c0f715f">getProperty</a> (<a class="el" href="classCTree.html">Tree</a> key)</td></tr>
<tr><td colspan="2"><h2>Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classCTree.html">Tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a3184c572cef05308f59e36ea2bdf537e">make</a> (const <a class="el" href="classNode.html">Node</a> &n, int ar, <a class="el" href="classCTree.html">Tree</a> br[])</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return a new tree or an existing equivalent one <a href="#a3184c572cef05308f59e36ea2bdf537e"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classCTree.html">Tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a67a668abaa84ce9efb58e5d2668fdc9d">make</a> (const <a class="el" href="classNode.html">Node</a> &n, const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> &br)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">return a new tree or an existing equivalent one <a href="#a67a668abaa84ce9efb58e5d2668fdc9d"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a52be1b22c7c2c7eb71d22fb4b4bc6033">control</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">print the hash table content (for debug purpose) <a href="#a52be1b22c7c2c7eb71d22fb4b4bc6033"></a><br/></td></tr>
<tr><td colspan="2"><h2>Static Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a85407e2333d3a3cc0f7859dad785e09f">gDetails</a> = false</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="list_8cpp.html#a850f2e459a901e0c9908d3a3a54b306e">Ctree::print()</a> print with more details when true. <a href="#a85407e2333d3a3cc0f7859dad785e09f"></a><br/></td></tr>
<tr><td colspan="2"><h2>Private Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a468bc99b4d0fcc746c98e56a2faa3624">CTree</a> (unsigned int hk, const <a class="el" href="classNode.html">Node</a> &n, const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> &br)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">construction is private, uses tree::make instead <a href="#a468bc99b4d0fcc746c98e56a2faa3624"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a91fbc2f14773afbdfb20c1ce59262464">equiv</a> (const <a class="el" href="classNode.html">Node</a> &n, const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> &br) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">used to check if an equivalent tree already exists <a href="#a91fbc2f14773afbdfb20c1ce59262464"></a><br/></td></tr>
<tr><td colspan="2"><h2>Static Private Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#aed5575466db4ca391077245aa036a458">calcTreeHash</a> (const <a class="el" href="classNode.html">Node</a> &n, const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> &br)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">compute the hash key of a tree according to its node and branches <a href="#aed5575466db4ca391077245aa036a458"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#ab6f456ea4f5400fb5b93807b281e6eb3">calcTreeAperture</a> (const <a class="el" href="classNode.html">Node</a> &n, const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> &br)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">compute how open is a tree <a href="#ab6f456ea4f5400fb5b93807b281e6eb3"></a><br/></td></tr>
<tr><td colspan="2"><h2>Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="classCTree.html">Tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9">fNext</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">next tree in the same hashtable entry <a href="#a4ef66f2806d14e5f23c5e836b62375c9"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="classNode.html">Node</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a91ef5d8ea6566e34450e7a14a45d0b1c">fNode</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the node content of the tree <a href="#a91ef5d8ea6566e34450e7a14a45d0b1c"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void * </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#adcb3bc208e0afc57732591da133dbc1c">fType</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the type of a tree <a href="#adcb3bc208e0afc57732591da133dbc1c"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="tree_8hh.html#a22ad9111eca5d638262f4744720be347">plist</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#afaa8b85a64115a64f26fea7c7c778c53">fProperties</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the properties list attached to the tree <a href="#afaa8b85a64115a64f26fea7c7c778c53"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a89094f441d0df103119ef5b1483f66f4">fHashKey</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the hashtable key <a href="#a89094f441d0df103119ef5b1483f66f4"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a711625a5c7ad5c643600ac0ef3fff9d3">fAperture</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">how "open" is a tree (synthezised field) <a href="#a711625a5c7ad5c643600ac0ef3fff9d3"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a85d23b2c4b83c8c41de55fd3dacbc929">fBranch</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the subtrees <a href="#a85d23b2c4b83c8c41de55fd3dacbc929"></a><br/></td></tr>
<tr><td colspan="2"><h2>Static Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static const int </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">kHashTableSize</a> = 2000000</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classCTree.html">Tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128">gHashTable</a> [<a class="el" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">kHashTableSize</a>]</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">hash table used for "hash consing" <a href="#a3af2b052219194e951e1fe16ba9c0128"></a><br/></td></tr>
</table>
<hr/><a name="_details"></a><h2>Detailed Description</h2>
<p>A <a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a> = (<a class="el" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> x [<a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a>]) is a <a class="el" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> associated with a list of subtrees called branches. </p>
<p>A <a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a> = (<a class="el" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> x [<a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a>]) is the association of a content <a class="el" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> and a list of subtrees called branches. In order to maximize the sharing of trees, hashconsing techniques are used. Ctrees at different addresses always have a different content. A first consequence of this approach is that a fast equality test on pointers can be used as an equality test on CTrees. A second consequence is that a <a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a> can NEVER be modified. But a property list is associated to each <a class="el" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a> that can be used to attach arbitrary information to it. Due to the maximal sharing property it is therefore easy to do memoization using these property lists.</p>
<p>Means are also provided to do maximal sharing on recursive trees. The idea is to start from a deBruijn representation and progressively build a classical representation such that alpha-equivalent recursive CTrees are necesseraly identical (and therefore shared).</p>
<p>WARNING : in the current implementation CTrees are allocated but never deleted </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00109">109</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<hr/><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" id="a468bc99b4d0fcc746c98e56a2faa3624"></a><!-- doxytag: member="CTree::CTree" ref="a468bc99b4d0fcc746c98e56a2faa3624" args="(unsigned int hk, const Node &n, const tvec &br)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">CTree::CTree </td>
<td>(</td>
<td class="paramtype">unsigned int </td>
<td class="paramname"> <em>hk</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classNode.html">Node</a> & </td>
<td class="paramname"> <em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> & </td>
<td class="paramname"> <em>br</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>construction is private, uses tree::make instead </p>
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00103">103</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00120">fNext</a>, <a class="el" href="tree_8hh_source.html#l00113">gHashTable</a>, and <a class="el" href="tree_8hh_source.html#l00112">kHashTableSize</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00177">make()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00104"></a>00104 : <a class="code" href="classCTree.html#a91ef5d8ea6566e34450e7a14a45d0b1c" title="the node content of the tree">fNode</a>(n),
<a name="l00105"></a>00105 <a class="code" href="classCTree.html#adcb3bc208e0afc57732591da133dbc1c" title="the type of a tree">fType</a>(0),
<a name="l00106"></a>00106 <a class="code" href="classCTree.html#a89094f441d0df103119ef5b1483f66f4" title="the hashtable key">fHashKey</a>(hk),
<a name="l00107"></a>00107 <a class="code" href="classCTree.html#a711625a5c7ad5c643600ac0ef3fff9d3" title="how &quot;open&quot; is a tree (synthezised field)">fAperture</a>(<a class="code" href="classCTree.html#ab6f456ea4f5400fb5b93807b281e6eb3" title="compute how open is a tree">calcTreeAperture</a>(n,br)),
<a name="l00108"></a>00108 <a class="code" href="classCTree.html#a85d23b2c4b83c8c41de55fd3dacbc929" title="the subtrees">fBranch</a>(br)
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 <span class="comment">// link dans la hash table</span>
<a name="l00111"></a>00111 <span class="keywordtype">int</span> j = hk % <a class="code" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">kHashTableSize</a>;
<a name="l00112"></a>00112 <a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a> = <a class="code" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128" title="hash table used for &quot;hash consing&quot;">gHashTable</a>[j];
<a name="l00113"></a>00113 <a class="code" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128" title="hash table used for &quot;hash consing&quot;">gHashTable</a>[j] = <span class="keyword">this</span>;
<a name="l00114"></a>00114
<a name="l00115"></a>00115 }
</pre></div></p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a03282df290b747bb7a400919ec366af5"></a><!-- doxytag: member="CTree::~CTree" ref="a03282df290b747bb7a400919ec366af5" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">CTree::~CTree </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00118">118</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00124">fHashKey</a>, <a class="el" href="tree_8hh_source.html#l00120">fNext</a>, <a class="el" href="tree_8hh_source.html#l00113">gHashTable</a>, and <a class="el" href="tree_8hh_source.html#l00112">kHashTableSize</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00119"></a>00119 {
<a name="l00120"></a>00120 <span class="keywordtype">int</span> i = <a class="code" href="classCTree.html#a89094f441d0df103119ef5b1483f66f4" title="the hashtable key">fHashKey</a> % <a class="code" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">kHashTableSize</a>;
<a name="l00121"></a>00121 <a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> t = <a class="code" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128" title="hash table used for &quot;hash consing&quot;">gHashTable</a>[i];
<a name="l00122"></a>00122
<a name="l00123"></a>00123 <span class="comment">//printf("Delete of "); this->print(); printf("\n");</span>
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (t == <span class="keyword">this</span>) {
<a name="l00125"></a>00125 <a class="code" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128" title="hash table used for &quot;hash consing&quot;">gHashTable</a>[i] = <a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a>;
<a name="l00126"></a>00126 } <span class="keywordflow">else</span> {
<a name="l00127"></a>00127 <a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> p;
<a name="l00128"></a>00128 <span class="keywordflow">while</span> (t != <span class="keyword">this</span>) {
<a name="l00129"></a>00129 p = t;
<a name="l00130"></a>00130 t = t-><a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a>;
<a name="l00131"></a>00131 }
<a name="l00132"></a>00132 p-><a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a> = <a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a>;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 }
</pre></div></p>
</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="a3ce05a5474896a873ddbccd7caea2680"></a><!-- doxytag: member="CTree::aperture" ref="a3ce05a5474896a873ddbccd7caea2680" args="() const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int CTree::aperture </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return how "open" is a tree in terms of free variables </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00145">145</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00125">fAperture</a>.</p>
<p>Referenced by <a class="el" href="recursive-tree_8cpp_source.html#l00284">calcsubstitute()</a>, <a class="el" href="tree_8hh_source.html#l00225">isClosed()</a>, <a class="el" href="tree_8hh_source.html#l00224">isOpen()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00328">markOpen()</a>, and <a class="el" href="recursive-tree_8cpp_source.html#l00338">recomputeAperture()</a>.</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a68f2be5e845407bc956a2893fe6f0d03"></a><!-- doxytag: member="CTree::arity" ref="a68f2be5e845407bc956a2893fe6f0d03" args="() const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int CTree::arity </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return the number of branches (subtrees) of a tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00142">142</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00126">fBranch</a>.</p>
<p>Referenced by <a class="el" href="shlysis_8cpp_source.html#l00129">annotate()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00235">calcDeBruijn2Sym()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00182">calcliftn()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00284">calcsubstitute()</a>, <a class="el" href="privatise_8cpp_source.html#l00102">computePrivatisation()</a>, <a class="el" href="occurrences_8cpp_source.html#l00078">Occurrences::countOccurrences()</a>, <a class="el" href="doc__compile_8cpp_source.html#l01058">DocCompiler::generateXtended()</a>, <a class="el" href="compile__scal_8cpp_source.html#l01007">ScalarCompiler::generateXtended()</a>, <a class="el" href="subsignals_8cpp_source.html#l00010">getSubSignals()</a>, <a class="el" href="sigorderrules_8cpp_source.html#l00084">infereSigOrder()</a>, <a class="el" href="sigtyperules_8cpp_source.html#l00654">infereXType()</a>, <a class="el" href="list_8hh_source.html#l00138">isList()</a>, <a class="el" href="list_8hh_source.html#l00137">isNil()</a>, <a class="el" href="tree_8cpp_source.html#l00324">isTree()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00328">markOpen()</a>, <a class="el" href="tree_8cpp_source.html#l00188">print()</a>, <a class="el" href="list_8cpp_source.html#l00154">print()</a>, <a class="el" href="ppsig_8cpp_source.html#l00163">ppsig::printextended()</a>, <a class="el" href="privatise_8cpp_source.html#l00071">privatisation()</a>, <a class="el" href="eval_8cpp_source.html#l00150">real_a2sb()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00338">recomputeAperture()</a>, <a class="el" href="simplify_8cpp_source.html#l00154">sigMap()</a>, <a class="el" href="simplify_8cpp_source.html#l00080">simplification()</a>, <a class="el" href="list_8cpp_source.html#l00506">subst()</a>, and <a class="el" href="list_8cpp_source.html#l00445">tmap()</a>.</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a06c1513b23dc7b0d9da9c930c6dc43c5"></a><!-- doxytag: member="CTree::branch" ref="a06c1513b23dc7b0d9da9c930c6dc43c5" args="(int i) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classCTree.html">Tree</a> CTree::branch </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> <em>i</em></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return the ith branch (subtree) of a tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00143">143</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00126">fBranch</a>.</p>
<p>Referenced by <a class="el" href="shlysis_8cpp_source.html#l00129">annotate()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00235">calcDeBruijn2Sym()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00182">calcliftn()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00284">calcsubstitute()</a>, <a class="el" href="privatise_8cpp_source.html#l00102">computePrivatisation()</a>, <a class="el" href="occurrences_8cpp_source.html#l00078">Occurrences::countOccurrences()</a>, <a class="el" href="eval_8cpp_source.html#l01251">evalIdDef()</a>, <a class="el" href="prim2_8cpp_source.html#l00044">ffincfile()</a>, <a class="el" href="prim2_8cpp_source.html#l00049">fflibfile()</a>, <a class="el" href="prim2_8cpp_source.html#l00039">ffsignature()</a>, <a class="el" href="doc__compile_8cpp_source.html#l01058">DocCompiler::generateXtended()</a>, <a class="el" href="compile__scal_8cpp_source.html#l01007">ScalarCompiler::generateXtended()</a>, <a class="el" href="subsignals_8cpp_source.html#l00010">getSubSignals()</a>, <a class="el" href="list_8hh_source.html#l00133">hd()</a>, <a class="el" href="sigorderrules_8cpp_source.html#l00084">infereSigOrder()</a>, <a class="el" href="sigtyperules_8cpp_source.html#l00654">infereXType()</a>, <a class="el" href="tree_8cpp_source.html#l00324">isTree()</a>, <a class="el" href="list_8hh_source.html#l00170">left()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00328">markOpen()</a>, <a class="el" href="tree_8cpp_source.html#l00188">print()</a>, <a class="el" href="list_8cpp_source.html#l00154">print()</a>, <a class="el" href="doc_8cpp_source.html#l00445">printdoccontent()</a>, <a class="el" href="ppsig_8cpp_source.html#l00163">ppsig::printextended()</a>, <a class="el" href="eval_8cpp_source.html#l00150">real_a2sb()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00338">recomputeAperture()</a>, <a class="el" href="list_8hh_source.html#l00171">right()</a>, <a class="el" href="eval_8cpp_source.html#l01229">searchIdDef()</a>, <a class="el" href="simplify_8cpp_source.html#l00154">sigMap()</a>, <a class="el" href="simplify_8cpp_source.html#l00080">simplification()</a>, <a class="el" href="list_8cpp_source.html#l00506">subst()</a>, <a class="el" href="list_8hh_source.html#l00134">tl()</a>, <a class="el" href="list_8cpp_source.html#l00445">tmap()</a>, and <a class="el" href="uitree_8hh_source.html#l00038">uiLabel()</a>.</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="ab6f456ea4f5400fb5b93807b281e6eb3"></a><!-- doxytag: member="CTree::calcTreeAperture" ref="ab6f456ea4f5400fb5b93807b281e6eb3" args="(const Node &n, const tvec &br)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int CTree::calcTreeAperture </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classNode.html">Node</a> & </td>
<td class="paramname"> <em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> & </td>
<td class="paramname"> <em>br</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [static, private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>compute how open is a tree </p>
<p>Definition at line <a class="el" href="recursive-tree_8cpp_source.html#l00121">121</a> of file <a class="el" href="recursive-tree_8cpp_source.html">recursive-tree.cpp</a>.</p>
<p>References <a class="el" href="node_8hh_source.html#l00120">isInt()</a>, and <a class="el" href="tree_8hh_source.html#l00141">node()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00122"></a>00122 {
<a name="l00123"></a>00123 <span class="keywordtype">int</span> x;
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (n == <a class="code" href="recursive-tree_8cpp.html#a0a0bb7149e09722eb48442f920afa94a">DEBRUIJNREF</a>) {
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="keywordflow">if</span> (<a class="code" href="node_8hh.html#a8c9b968ac68f6cac1c361002da8afe99">isInt</a>(br[0]-><a class="code" href="classCTree.html#a8de786fec095c8304b9ffa7c1c316237" title="return the content of the tree">node</a>(), &x)) {
<a name="l00127"></a>00127 <span class="keywordflow">return</span> x;
<a name="l00128"></a>00128 } <span class="keywordflow">else</span> {
<a name="l00129"></a>00129 <span class="keywordflow">return</span> 0;
<a name="l00130"></a>00130 }
<a name="l00131"></a>00131
<a name="l00132"></a>00132 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n == <a class="code" href="recursive-tree_8cpp.html#a079e594f132e158b05af96450deaeeb5">DEBRUIJN</a>) {
<a name="l00133"></a>00133
<a name="l00134"></a>00134 <span class="keywordflow">return</span> br[0]->fAperture - 1;
<a name="l00135"></a>00135
<a name="l00136"></a>00136 } <span class="keywordflow">else</span> {
<a name="l00137"></a>00137 <span class="comment">// return max aperture of branches</span>
<a name="l00138"></a>00138 <span class="keywordtype">int</span> rc = 0;
<a name="l00139"></a>00139 tvec::const_iterator b = br.begin();
<a name="l00140"></a>00140 tvec::const_iterator z = br.end();
<a name="l00141"></a>00141 <span class="keywordflow">while</span> (b != z) {
<a name="l00142"></a>00142 <span class="keywordflow">if</span> ((*b)->aperture() > rc) rc = (*b)->aperture();
<a name="l00143"></a>00143 ++b;
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145 <span class="keywordflow">return</span> rc;
<a name="l00146"></a>00146 }
<a name="l00147"></a>00147 }
</pre></div></p>
<p><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="aed5575466db4ca391077245aa036a458"></a><!-- doxytag: member="CTree::calcTreeHash" ref="aed5575466db4ca391077245aa036a458" args="(const Node &n, const tvec &br)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">unsigned int CTree::calcTreeHash </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classNode.html">Node</a> & </td>
<td class="paramname"> <em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> & </td>
<td class="paramname"> <em>br</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [static, private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>compute the hash key of a tree according to its node and branches </p>
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00147">147</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="node_8hh_source.html#l00098">Node::getInt()</a>, and <a class="el" href="node_8hh_source.html#l00096">Node::type()</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00177">make()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00148"></a>00148 {
<a name="l00149"></a>00149 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> hk = n.<a class="code" href="classNode.html#aff078c9f1e1673b275e4eab069fb34b6">type</a>() ^ n.<a class="code" href="classNode.html#a0ac89402d0e51d19bed062529a375efe">getInt</a>();
<a name="l00150"></a>00150 tvec::const_iterator b = br.begin();
<a name="l00151"></a>00151 tvec::const_iterator z = br.end();
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keywordflow">while</span> (b != z) {
<a name="l00154"></a>00154 hk = (hk << 1) ^ (hk >> 20) ^ ((*b)->fHashKey);
<a name="l00155"></a>00155 ++b;
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157 <span class="keywordflow">return</span> hk;
<a name="l00158"></a>00158 }
</pre></div></p>
<p><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dynsection">
</div>
</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="af2869391b5fbcf5a34cc034533fb207d"></a><!-- doxytag: member="CTree::clearProperty" ref="af2869391b5fbcf5a34cc034533fb207d" args="(Tree key)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void CTree::clearProperty </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classCTree.html">Tree</a> </td>
<td class="paramname"> <em>key</em></td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00159">159</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00123">fProperties</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00159"></a>00159 { <a class="code" href="classCTree.html#afaa8b85a64115a64f26fea7c7c778c53" title="the properties list attached to the tree">fProperties</a>.erase(key); }
</pre></div></p>
</div>
</div>
<a class="anchor" id="a52be1b22c7c2c7eb71d22fb4b4bc6033"></a><!-- doxytag: member="CTree::control" ref="a52be1b22c7c2c7eb71d22fb4b4bc6033" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void CTree::control </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>print the hash table content (for debug purpose) </p>
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00224">224</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00120">fNext</a>, <a class="el" href="tree_8hh_source.html#l00113">gHashTable</a>, and <a class="el" href="tree_8hh_source.html#l00112">kHashTableSize</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00225"></a>00225 {
<a name="l00226"></a>00226 printf(<span class="stringliteral">"\ngHashTable Content :\n\n"</span>);
<a name="l00227"></a>00227 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">kHashTableSize</a>; i++) {
<a name="l00228"></a>00228 <a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> t = <a class="code" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128" title="hash table used for &quot;hash consing&quot;">gHashTable</a>[i];
<a name="l00229"></a>00229 <span class="keywordflow">if</span> (t) {
<a name="l00230"></a>00230 printf (<span class="stringliteral">"%4d = "</span>, i);
<a name="l00231"></a>00231 <span class="keywordflow">while</span> (t) {
<a name="l00232"></a>00232 <span class="comment">/*t->print();*/</span>
<a name="l00233"></a>00233 printf(<span class="stringliteral">" => "</span>);
<a name="l00234"></a>00234 t = t-><a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a>;
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236 printf(<span class="stringliteral">"VOID\n"</span>);
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239 printf(<span class="stringliteral">"\nEnd gHashTable\n"</span>);
<a name="l00240"></a>00240
<a name="l00241"></a>00241 }
</pre></div></p>
</div>
</div>
<a class="anchor" id="a91fbc2f14773afbdfb20c1ce59262464"></a><!-- doxytag: member="CTree::equiv" ref="a91fbc2f14773afbdfb20c1ce59262464" args="(const Node &n, const tvec &br) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool CTree::equiv </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classNode.html">Node</a> & </td>
<td class="paramname"> <em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> & </td>
<td class="paramname"> <em>br</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td> const<code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>used to check if an equivalent tree already exists </p>
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00137">137</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00126">fBranch</a>, and <a class="el" href="tree_8hh_source.html#l00121">fNode</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00177">make()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00138"></a>00138 {
<a name="l00139"></a>00139 <span class="keywordflow">return</span> (<a class="code" href="classCTree.html#a91ef5d8ea6566e34450e7a14a45d0b1c" title="the node content of the tree">fNode</a> == n) && (<a class="code" href="classCTree.html#a85d23b2c4b83c8c41de55fd3dacbc929" title="the subtrees">fBranch</a> == br);
<a name="l00140"></a>00140 }
</pre></div></p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a902b48b83db587f14dbd31999c0f715f"></a><!-- doxytag: member="CTree::getProperty" ref="a902b48b83db587f14dbd31999c0f715f" args="(Tree key)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classCTree.html">Tree</a> CTree::getProperty </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classCTree.html">Tree</a> </td>
<td class="paramname"> <em>key</em></td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00160">160</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00123">fProperties</a>.</p>
<p>Referenced by <a class="el" href="property_8hh_source.html#l00010">property< Loop * >::access()</a>, <a class="el" href="boxcomplexity_8cpp_source.html#l00056">boxComplexity()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00223">deBruijn2Sym()</a>, <a class="el" href="occurences_8cpp_source.html#l00137">OccMarkup::getOcc()</a>, <a class="el" href="list_8cpp_source.html#l00423">getProperty()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00095">isRec()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00169">liftn()</a>, and <a class="el" href="recursive-tree_8cpp_source.html#l00271">substitute()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00160"></a>00160 {
<a name="l00161"></a>00161 plist::iterator i = <a class="code" href="classCTree.html#afaa8b85a64115a64f26fea7c7c778c53" title="the properties list attached to the tree">fProperties</a>.find(key);
<a name="l00162"></a>00162 <span class="keywordflow">if</span> (i==<a class="code" href="classCTree.html#afaa8b85a64115a64f26fea7c7c778c53" title="the properties list attached to the tree">fProperties</a>.end()) {
<a name="l00163"></a>00163 <span class="keywordflow">return</span> 0;
<a name="l00164"></a>00164 } <span class="keywordflow">else</span> {
<a name="l00165"></a>00165 <span class="keywordflow">return</span> i->second;
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167 }
</pre></div></p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="adfb1030a444053685b84e45c76eabe6a"></a><!-- doxytag: member="CTree::getType" ref="adfb1030a444053685b84e45c76eabe6a" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void* CTree::getType </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00155">155</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00122">fType</a>.</p>
<p>Referenced by <a class="el" href="sigtyperules_8cpp_source.html#l00184">getInferredType()</a>, and <a class="el" href="sigtyperules_8cpp_source.html#l00082">getSigType()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00155"></a>00155 { <span class="keywordflow">return</span> <a class="code" href="classCTree.html#adcb3bc208e0afc57732591da133dbc1c" title="the type of a tree">fType</a>; }
</pre></div></p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="ac857fdcad70269113f3502eb1af7b4fb"></a><!-- doxytag: member="CTree::hashkey" ref="ac857fdcad70269113f3502eb1af7b4fb" args="() const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">unsigned int CTree::hashkey </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return the hashkey of the tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00144">144</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00124">fHashKey</a>.</p>
</div>
</div>
<a class="anchor" id="a67a668abaa84ce9efb58e5d2668fdc9d"></a><!-- doxytag: member="CTree::make" ref="a67a668abaa84ce9efb58e5d2668fdc9d" args="(const Node &n, const tvec &br)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classCTree.html">Tree</a> CTree::make </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classNode.html">Node</a> & </td>
<td class="paramname"> <em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> & </td>
<td class="paramname"> <em>br</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return a new tree or an existing equivalent one </p>
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00177">177</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="tree_8cpp_source.html#l00147">calcTreeHash()</a>, <a class="el" href="tree_8cpp_source.html#l00103">CTree()</a>, <a class="el" href="tree_8cpp_source.html#l00137">equiv()</a>, <a class="el" href="tree_8hh_source.html#l00120">fNext</a>, <a class="el" href="tree_8hh_source.html#l00113">gHashTable</a>, and <a class="el" href="tree_8hh_source.html#l00112">kHashTableSize</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00178"></a>00178 {
<a name="l00179"></a>00179 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> hk = <a class="code" href="classCTree.html#aed5575466db4ca391077245aa036a458" title="compute the hash key of a tree according to its node and branches">calcTreeHash</a>(n, br);
<a name="l00180"></a>00180 <a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> t = <a class="code" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128" title="hash table used for &quot;hash consing&quot;">gHashTable</a>[hk % <a class="code" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">kHashTableSize</a>];
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">while</span> (t && !t-><a class="code" href="classCTree.html#a91fbc2f14773afbdfb20c1ce59262464" title="used to check if an equivalent tree already exists">equiv</a>(n, br)) {
<a name="l00183"></a>00183 t = t-><a class="code" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9" title="next tree in the same hashtable entry">fNext</a>;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 <span class="keywordflow">return</span> (t) ? t : <span class="keyword">new</span> <a class="code" href="classCTree.html#a468bc99b4d0fcc746c98e56a2faa3624" title="construction is private, uses tree::make instead">CTree</a>(hk, n, br);
<a name="l00186"></a>00186 }
</pre></div></p>
<p><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a3184c572cef05308f59e36ea2bdf537e"></a><!-- doxytag: member="CTree::make" ref="a3184c572cef05308f59e36ea2bdf537e" args="(const Node &n, int ar, Tree br[])" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="classCTree.html">Tree</a> CTree::make </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classNode.html">Node</a> & </td>
<td class="paramname"> <em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int </td>
<td class="paramname"> <em>ar</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classCTree.html">Tree</a> </td>
<td class="paramname"> <em>br</em>[]</td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return a new tree or an existing equivalent one </p>
<p>Referenced by <a class="el" href="recursive-tree_8cpp_source.html#l00235">calcDeBruijn2Sym()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00182">calcliftn()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00284">calcsubstitute()</a>, <a class="el" href="eval_8cpp_source.html#l00150">real_a2sb()</a>, and <a class="el" href="tree_8hh_source.html#l00173">tree()</a>.</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a8de786fec095c8304b9ffa7c1c316237"></a><!-- doxytag: member="CTree::node" ref="a8de786fec095c8304b9ffa7c1c316237" args="() const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="classNode.html">Node</a>& CTree::node </td>
<td>(</td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>return the content of the tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00141">141</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00121">fNode</a>.</p>
<p>Referenced by <a class="el" href="property_8hh_source.html#l00010">property< Loop * >::access()</a>, <a class="el" href="signals_8cpp_source.html#l00290">addNums()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00235">calcDeBruijn2Sym()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00182">calcliftn()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00284">calcsubstitute()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00121">calcTreeAperture()</a>, <a class="el" href="privatise_8cpp_source.html#l00102">computePrivatisation()</a>, <a class="el" href="signals_8cpp_source.html#l00318">divExtendedNums()</a>, <a class="el" href="signals_8cpp_source.html#l00311">divNums()</a>, <a class="el" href="boxtype_8cpp_source.html#l00063">getBoxType()</a>, <a class="el" href="occurrences_8cpp_source.html#l00048">Occurrences::getCount()</a>, <a class="el" href="errormsg_8cpp_source.html#l00082">getDefLineProp()</a>, <a class="el" href="sharing_8cpp_source.html#l00062">ScalarCompiler::getSharingCount()</a>, <a class="el" href="doc__sharing_8cpp_source.html#l00066">DocCompiler::getSharingCount()</a>, <a class="el" href="tree_8cpp_source.html#l00386">getUserData()</a>, <a class="el" href="signals_8cpp_source.html#l00332">inverseNum()</a>, <a class="el" href="uitree_8cpp_source.html#l00072">isBefore()</a>, <a class="el" href="boxes_8cpp_source.html#l00173">isBoxAbstr()</a>, <a class="el" href="boxes_8cpp_source.html#l00174">isBoxAppl()</a>, <a class="el" href="boxes_8cpp_source.html#l00057">isBoxIdent()</a>, <a class="el" href="boxes_8cpp_source.html#l00077">isBoxInt()</a>, <a class="el" href="eval_8cpp_source.html#l00540">isBoxPatternOp()</a>, <a class="el" href="boxes_8cpp_source.html#l00271">isBoxPrim0()</a>, <a class="el" href="boxes_8cpp_source.html#l00276">isBoxPrim1()</a>, <a class="el" href="boxes_8cpp_source.html#l00281">isBoxPrim2()</a>, <a class="el" href="boxes_8cpp_source.html#l00286">isBoxPrim3()</a>, <a class="el" href="boxes_8cpp_source.html#l00291">isBoxPrim4()</a>, <a class="el" href="boxes_8cpp_source.html#l00296">isBoxPrim5()</a>, <a class="el" href="boxes_8cpp_source.html#l00078">isBoxReal()</a>, <a class="el" href="boxes_8cpp_source.html#l00105">isBoxSlot()</a>, <a class="el" href="doc_8cpp_source.html#l00167">isDocTxt()</a>, <a class="el" href="prim2_8cpp_source.html#l00034">isffunction()</a>, <a class="el" href="signals_8hh_source.html#l00187">isGEZero()</a>, <a class="el" href="signals_8hh_source.html#l00186">isGTZero()</a>, <a class="el" href="list_8hh_source.html#l00138">isList()</a>, <a class="el" href="signals_8hh_source.html#l00189">isMinusOne()</a>, <a class="el" href="list_8hh_source.html#l00137">isNil()</a>, <a class="el" href="signals_8hh_source.html#l00184">isNum()</a>, <a class="el" href="signals_8hh_source.html#l00188">isOne()</a>, <a class="el" href="signals_8cpp_source.html#l00151">isProj()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00070">isRef()</a>, <a class="el" href="signals_8cpp_source.html#l00126">isSigBinOp()</a>, <a class="el" href="signals_8cpp_source.html#l00092">isSigGen()</a>, <a class="el" href="signals_8cpp_source.html#l00048">isSigInput()</a>, <a class="el" href="signals_8cpp_source.html#l00041">isSigInt()</a>, <a class="el" href="signals_8cpp_source.html#l00052">isSigOutput()</a>, <a class="el" href="signals_8cpp_source.html#l00044">isSigReal()</a>, <a class="el" href="signals_8cpp_source.html#l00375">isSigTuple()</a>, <a class="el" href="tree_8cpp_source.html#l00319">isTree()</a>, <a class="el" href="signals_8hh_source.html#l00185">isZero()</a>, <a class="el" href="signals_8cpp_source.html#l00325">minusNum()</a>, <a class="el" href="signals_8cpp_source.html#l00304">mulNums()</a>, <a class="el" href="labels_8cpp_source.html#l00119">normalizeLabel()</a>, <a class="el" href="tree_8cpp_source.html#l00188">print()</a>, <a class="el" href="list_8cpp_source.html#l00154">print()</a>, <a class="el" href="eval_8cpp_source.html#l00150">real_a2sb()</a>, <a class="el" href="shlysis_8cpp_source.html#l00081">shcount()</a>, <a class="el" href="signals_8cpp_source.html#l00170">sigFloatCast()</a>, <a class="el" href="signals_8cpp_source.html#l00159">sigIntCast()</a>, <a class="el" href="simplify_8cpp_source.html#l00154">sigMap()</a>, <a class="el" href="simplify_8cpp_source.html#l00080">simplification()</a>, <a class="el" href="signals_8cpp_source.html#l00297">subNums()</a>, <a class="el" href="list_8cpp_source.html#l00506">subst()</a>, <a class="el" href="list_8cpp_source.html#l00445">tmap()</a>, <a class="el" href="tree_8cpp_source.html#l00276">tree2double()</a>, <a class="el" href="tree_8cpp_source.html#l00260">tree2float()</a>, <a class="el" href="tree_8cpp_source.html#l00244">tree2int()</a>, <a class="el" href="tree_8cpp_source.html#l00302">tree2ptr()</a>, and <a class="el" href="tree_8cpp_source.html#l00292">tree2str()</a>.</p>
</div>
</div>
<a class="anchor" id="a47b39b985a852b02b12c8dd2d790543e"></a><!-- doxytag: member="CTree::print" ref="a47b39b985a852b02b12c8dd2d790543e" args="(ostream &fout) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">ostream & CTree::print </td>
<td>(</td>
<td class="paramtype">ostream & </td>
<td class="paramname"> <em>fout</em></td>
<td> ) </td>
<td> const</td>
</tr>
</table>
</div>
<div class="memdoc">
<p>print recursively the content of a tree on a stream </p>
<p>Definition at line <a class="el" href="tree_8cpp_source.html#l00188">188</a> of file <a class="el" href="tree_8cpp_source.html">tree.cpp</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00142">arity()</a>, <a class="el" href="tree_8hh_source.html#l00143">branch()</a>, <a class="el" href="tree_8hh_source.html#l00116">gDetails</a>, <a class="el" href="tree_8hh_source.html#l00141">node()</a>, and <a class="el" href="tree_8cpp_source.html#l00188">print()</a>.</p>
<p>Referenced by <a class="el" href="tree_8hh_source.html#l00198">operator<<()</a>, and <a class="el" href="tree_8cpp_source.html#l00188">print()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00189"></a>00189 {
<a name="l00190"></a>00190 <span class="keywordflow">if</span> (<a class="code" href="classCTree.html#a85407e2333d3a3cc0f7859dad785e09f" title="Ctree::print() print with more details when true.">gDetails</a>) {
<a name="l00191"></a>00191 <span class="comment">// print the adresse of the tree</span>
<a name="l00192"></a>00192 fout << <span class="stringliteral">"<"</span> << <span class="keyword">this</span> << <span class="stringliteral">">@"</span>;
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 <span class="comment">/*</span>
<a name="l00195"></a>00195 <span class="comment"> switch (node().type()) {</span>
<a name="l00196"></a>00196 <span class="comment"> case kIntNode : </span>
<a name="l00197"></a>00197 <span class="comment"> fout << node().getInt(); </span>
<a name="l00198"></a>00198 <span class="comment"> break;</span>
<a name="l00199"></a>00199 <span class="comment"> case kFloatNode : </span>
<a name="l00200"></a>00200 <span class="comment"> fout << node().getFloat(); </span>
<a name="l00201"></a>00201 <span class="comment"> break;</span>
<a name="l00202"></a>00202 <span class="comment"> case kSymNode : </span>
<a name="l00203"></a>00203 <span class="comment"> fout << name(node().getSym()); </span>
<a name="l00204"></a>00204 <span class="comment"> break;</span>
<a name="l00205"></a>00205 <span class="comment"> case kPointerNode : </span>
<a name="l00206"></a>00206 <span class="comment"> fout << node().getPointer(); </span>
<a name="l00207"></a>00207 <span class="comment"> break;</span>
<a name="l00208"></a>00208 <span class="comment"> }</span>
<a name="l00209"></a>00209 <span class="comment"> */</span>
<a name="l00210"></a>00210 fout << <a class="code" href="classCTree.html#a8de786fec095c8304b9ffa7c1c316237" title="return the content of the tree">node</a>();
<a name="l00211"></a>00211 <span class="keywordtype">int</span> a = <a class="code" href="classCTree.html#a68f2be5e845407bc956a2893fe6f0d03" title="return the number of branches (subtrees) of a tree">arity</a>();
<a name="l00212"></a>00212 <span class="keywordflow">if</span> (a > 0) {
<a name="l00213"></a>00213 <span class="keywordtype">int</span> i; <span class="keywordtype">char</span> sep;
<a name="l00214"></a>00214 <span class="keywordflow">for</span> (sep = <span class="charliteral">'['</span>, i = 0; i < a; sep = <span class="charliteral">','</span>, i++) {
<a name="l00215"></a>00215 fout << sep; <a class="code" href="classCTree.html#a06c1513b23dc7b0d9da9c930c6dc43c5" title="return the ith branch (subtree) of a tree">branch</a>(i)-><a class="code" href="classCTree.html#a47b39b985a852b02b12c8dd2d790543e" title="print recursively the content of a tree on a stream">print</a>(fout);
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217 fout << <span class="charliteral">']'</span>;
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="keywordflow">return</span> fout;
<a name="l00221"></a>00221 }
</pre></div></p>
<p><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dynsection">
</div>
</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="a43dfbeab91c992660762d3d6783baff7"></a><!-- doxytag: member="CTree::setAperture" ref="a43dfbeab91c992660762d3d6783baff7" args="(int a)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void CTree::setAperture </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> <em>a</em></td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>modify the aperture of a tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00146">146</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00125">fAperture</a>.</p>
<p>Referenced by <a class="el" href="recursive-tree_8cpp_source.html#l00328">markOpen()</a>, and <a class="el" href="recursive-tree_8cpp_source.html#l00338">recomputeAperture()</a>.</p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="ac628a2ad0d2a21de584e3bca291bd38c"></a><!-- doxytag: member="CTree::setProperty" ref="ac628a2ad0d2a21de584e3bca291bd38c" args="(Tree key, Tree value)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void CTree::setProperty </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classCTree.html">Tree</a> </td>
<td class="paramname"> <em>key</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classCTree.html">Tree</a> </td>
<td class="paramname"> <em>value</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00158">158</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00123">fProperties</a>.</p>
<p>Referenced by <a class="el" href="boxcomplexity_8cpp_source.html#l00056">boxComplexity()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00223">deBruijn2Sym()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00169">liftn()</a>, <a class="el" href="recursive-tree_8cpp_source.html#l00088">rec()</a>, <a class="el" href="occurences_8cpp_source.html#l00148">OccMarkup::setOcc()</a>, <a class="el" href="list_8cpp_source.html#l00418">setProperty()</a>, and <a class="el" href="recursive-tree_8cpp_source.html#l00271">substitute()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00158"></a>00158 { <a class="code" href="classCTree.html#afaa8b85a64115a64f26fea7c7c778c53" title="the properties list attached to the tree">fProperties</a>[key] = value; }
</pre></div></p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<a class="anchor" id="ac8a19f4ef59fae1449e60dbd990eb90f"></a><!-- doxytag: member="CTree::setType" ref="ac8a19f4ef59fae1449e60dbd990eb90f" args="(void *t)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void CTree::setType </td>
<td>(</td>
<td class="paramtype">void * </td>
<td class="paramname"> <em>t</em></td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00154">154</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>References <a class="el" href="tree_8hh_source.html#l00122">fType</a>.</p>
<p>Referenced by <a class="el" href="sigtyperules_8cpp_source.html#l00070">setSigType()</a>.</p>
<p><div class="fragment"><pre class="fragment"><a name="l00154"></a>00154 { <a class="code" href="classCTree.html#adcb3bc208e0afc57732591da133dbc1c" title="the type of a tree">fType</a> = t; }
</pre></div></p>
<p><div class="dynheader">
Here is the caller graph for this function:</div>
<div class="dynsection">
</div>
</p>
</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="a711625a5c7ad5c643600ac0ef3fff9d3"></a><!-- doxytag: member="CTree::fAperture" ref="a711625a5c7ad5c643600ac0ef3fff9d3" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="classCTree.html#a711625a5c7ad5c643600ac0ef3fff9d3">CTree::fAperture</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>how "open" is a tree (synthezised field) </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00125">125</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8hh_source.html#l00145">aperture()</a>, and <a class="el" href="tree_8hh_source.html#l00146">setAperture()</a>.</p>
</div>
</div>
<a class="anchor" id="a85d23b2c4b83c8c41de55fd3dacbc929"></a><!-- doxytag: member="CTree::fBranch" ref="a85d23b2c4b83c8c41de55fd3dacbc929" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="tree_8hh.html#ad425127c677ce9f82f03e6dc57a87937">tvec</a> <a class="el" href="classCTree.html#a85d23b2c4b83c8c41de55fd3dacbc929">CTree::fBranch</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>the subtrees </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00126">126</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8hh_source.html#l00142">arity()</a>, <a class="el" href="tree_8hh_source.html#l00143">branch()</a>, and <a class="el" href="tree_8cpp_source.html#l00137">equiv()</a>.</p>
</div>
</div>
<a class="anchor" id="a89094f441d0df103119ef5b1483f66f4"></a><!-- doxytag: member="CTree::fHashKey" ref="a89094f441d0df103119ef5b1483f66f4" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">unsigned int <a class="el" href="classCTree.html#a89094f441d0df103119ef5b1483f66f4">CTree::fHashKey</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>the hashtable key </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00124">124</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8hh_source.html#l00144">hashkey()</a>, and <a class="el" href="tree_8cpp_source.html#l00118">~CTree()</a>.</p>
</div>
</div>
<a class="anchor" id="a4ef66f2806d14e5f23c5e836b62375c9"></a><!-- doxytag: member="CTree::fNext" ref="a4ef66f2806d14e5f23c5e836b62375c9" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classCTree.html">Tree</a> <a class="el" href="classCTree.html#a4ef66f2806d14e5f23c5e836b62375c9">CTree::fNext</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>next tree in the same hashtable entry </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00120">120</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00224">control()</a>, <a class="el" href="tree_8cpp_source.html#l00103">CTree()</a>, <a class="el" href="tree_8cpp_source.html#l00177">make()</a>, and <a class="el" href="tree_8cpp_source.html#l00118">~CTree()</a>.</p>
</div>
</div>
<a class="anchor" id="a91ef5d8ea6566e34450e7a14a45d0b1c"></a><!-- doxytag: member="CTree::fNode" ref="a91ef5d8ea6566e34450e7a14a45d0b1c" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classNode.html">Node</a> <a class="el" href="classCTree.html#a91ef5d8ea6566e34450e7a14a45d0b1c">CTree::fNode</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>the node content of the tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00121">121</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00137">equiv()</a>, and <a class="el" href="tree_8hh_source.html#l00141">node()</a>.</p>
</div>
</div>
<a class="anchor" id="afaa8b85a64115a64f26fea7c7c778c53"></a><!-- doxytag: member="CTree::fProperties" ref="afaa8b85a64115a64f26fea7c7c778c53" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="tree_8hh.html#a22ad9111eca5d638262f4744720be347">plist</a> <a class="el" href="classCTree.html#afaa8b85a64115a64f26fea7c7c778c53">CTree::fProperties</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>the properties list attached to the tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00123">123</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8hh_source.html#l00159">clearProperty()</a>, <a class="el" href="tree_8hh_source.html#l00160">getProperty()</a>, and <a class="el" href="tree_8hh_source.html#l00158">setProperty()</a>.</p>
</div>
</div>
<a class="anchor" id="adcb3bc208e0afc57732591da133dbc1c"></a><!-- doxytag: member="CTree::fType" ref="adcb3bc208e0afc57732591da133dbc1c" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void* <a class="el" href="classCTree.html#adcb3bc208e0afc57732591da133dbc1c">CTree::fType</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>the type of a tree </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00122">122</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8hh_source.html#l00155">getType()</a>, and <a class="el" href="tree_8hh_source.html#l00154">setType()</a>.</p>
</div>
</div>
<a class="anchor" id="a85407e2333d3a3cc0f7859dad785e09f"></a><!-- doxytag: member="CTree::gDetails" ref="a85407e2333d3a3cc0f7859dad785e09f" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classCTree.html#a85407e2333d3a3cc0f7859dad785e09f">CTree::gDetails</a> = false<code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p><a class="el" href="list_8cpp.html#a850f2e459a901e0c9908d3a3a54b306e">Ctree::print()</a> print with more details when true. </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00116">116</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00188">print()</a>.</p>
</div>
</div>
<a class="anchor" id="a3af2b052219194e951e1fe16ba9c0128"></a><!-- doxytag: member="CTree::gHashTable" ref="a3af2b052219194e951e1fe16ba9c0128" args="[kHashTableSize]" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classCTree.html">Tree</a> <a class="el" href="classCTree.html#a3af2b052219194e951e1fe16ba9c0128">CTree::gHashTable</a><code> [static, private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>hash table used for "hash consing" </p>
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00113">113</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00224">control()</a>, <a class="el" href="tree_8cpp_source.html#l00103">CTree()</a>, <a class="el" href="tree_8cpp_source.html#l00177">make()</a>, and <a class="el" href="tree_8cpp_source.html#l00118">~CTree()</a>.</p>
</div>
</div>
<a class="anchor" id="a29bf4e2903225271f81664d165bfef16"></a><!-- doxytag: member="CTree::kHashTableSize" ref="a29bf4e2903225271f81664d165bfef16" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">const int <a class="el" href="classCTree.html#a29bf4e2903225271f81664d165bfef16">CTree::kHashTableSize</a> = 2000000<code> [static, private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="tree_8hh_source.html#l00112">112</a> of file <a class="el" href="tree_8hh_source.html">tree.hh</a>.</p>
<p>Referenced by <a class="el" href="tree_8cpp_source.html#l00224">control()</a>, <a class="el" href="tree_8cpp_source.html#l00103">CTree()</a>, <a class="el" href="tree_8cpp_source.html#l00177">make()</a>, and <a class="el" href="tree_8cpp_source.html#l00118">~CTree()</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="tree_8hh_source.html">tree.hh</a></li>
<li><a class="el" href="recursive-tree_8cpp_source.html">recursive-tree.cpp</a></li>
<li><a class="el" href="tree_8cpp_source.html">tree.cpp</a></li>
</ul>
</div>
<hr class="footer"/><address style="text-align: right;"><small>Generated on Thu Apr 29 00:00:18 2010 for FAUST compiler by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>
