tree__instance_8h-source.html

这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)

<a name="l00086"></a>00086       <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00087"></a>00087     
<a name="l00088"></a>00088     <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00089"></a>00089   }<span class="comment">//end contains()</span>
<a name="l00090"></a>00090   
<a name="l00092"></a><a class="code" href="classtree__instance.html#84d628f3015c0e71353bf29a7309b566">00092</a>   <span class="keywordtype">bool</span> <a class="code" href="classtree__instance.html#84d628f3015c0e71353bf29a7309b566">match_label</a>(<span class="keyword">const</span> ML&amp; ml2)<span class="keyword"> const </span>{
<a name="l00093"></a>00093     <span class="keywordflow">if</span>(_ml.size()!=ml2.size())
<a name="l00094"></a>00094       <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00095"></a>00095     
<a name="l00096"></a>00096     <span class="keyword">typename</span> ML::const_iterator it1=_ml.begin(), it2=ml2.begin();
<a name="l00097"></a>00097     
<a name="l00098"></a>00098     <span class="keywordflow">while</span>(it1!=_ml.end() &amp;&amp; it2!=ml2.end()) {
<a name="l00099"></a>00099       <span class="keywordflow">if</span>(*it1 != *it2)
<a name="l00100"></a>00100         <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00101"></a>00101       it1++;
<a name="l00102"></a>00102       it2++;
<a name="l00103"></a>00103     }
<a name="l00104"></a>00104     
<a name="l00105"></a>00105     <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00106"></a>00106   }<span class="comment">//end match_label()</span>
<a name="l00107"></a>00107   
<a name="l00108"></a>00108   <span class="keyword">friend</span> <span class="keywordtype">bool</span> cousin_test&lt;&gt;(<span class="keyword">const</span> TREE_INSTANCE&amp;, <span class="keyword">const</span> TREE_INSTANCE&amp;);
<a name="l00109"></a>00109   
<a name="l00110"></a>00110   <span class="keyword">friend</span> ostream&amp; operator&lt;&lt; &lt;&gt;(ostream&amp;, <span class="keyword">const</span> TREE_INSTANCE&amp;);
<a name="l00111"></a>00111   
<a name="l00113"></a><a class="code" href="classtree__instance.html#85fb6ef92b0780fc7ffe8b5f2ac143c0">00113</a>   <span class="keywordtype">bool</span> <a class="code" href="classtree__instance.html#85fb6ef92b0780fc7ffe8b5f2ac143c0">child_test</a>(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">TREE_INSTANCE</a>&amp; i2)<span class="keyword"> const </span>{
<a name="l00114"></a>00114     <span class="keywordflow">if</span>(!<a class="code" href="classtree__instance.html#84d628f3015c0e71353bf29a7309b566">match_label</a>(i2.<a class="code" href="classtree__instance.html#1ad16e2842115a6ec95543d4ef702b81">_ml</a>))
<a name="l00115"></a>00115       <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00116"></a>00116     
<a name="l00117"></a>00117     <span class="keywordflow">if</span>(<a class="code" href="classtree__instance.html#6c2027a604839cbe2fd1ff6573ac4b0f">contains</a>(i2))
<a name="l00118"></a>00118       <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00119"></a>00119     
<a name="l00120"></a>00120     <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00121"></a>00121   }<span class="comment">//end child_test()</span>
<a name="l00122"></a>00122   
<a name="l00124"></a><a class="code" href="classtree__instance.html#fd87975b2521f09b5ba343d1a363b513">00124</a>   <span class="keywordtype">int</span> <a class="code" href="classtree__instance.html#fd87975b2521f09b5ba343d1a363b513">depth_diff</a>(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">TREE_INSTANCE</a>&amp; i2)<span class="keyword"> const</span>
<a name="l00125"></a>00125 <span class="keyword">    </span>{ <span class="keywordflow">return</span>(i2.<a class="code" href="classtree__instance.html#e507af6ddf13a223b4cd25bcd44613d9">_depth</a> - _depth);}
<a name="l00126"></a>00126 
<a name="l00127"></a>00127   <span class="keywordtype">bool</span> induced()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _is_induced;}
<a name="l00128"></a>00128 
<a name="l00129"></a>00129   <span class="keyword">const</span> <span class="keywordtype">int</span>&amp; depth()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _depth;}
<a name="l00130"></a>00130   <span class="keywordtype">int</span> get_lb()<span class="keyword">  const</span>{ <span class="keywordflow">return</span> _lb;}
<a name="l00131"></a>00131   <span class="keywordtype">int</span> get_ub()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _ub;}
<a name="l00132"></a>00132   <span class="keywordtype">int</span> get_depth()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _depth;}
<a name="l00133"></a>00133   
<a name="l00134"></a>00134   <span class="keyword">typename</span> ML::const_iterator  get_ml_begin()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _ml.begin();}
<a name="l00135"></a>00135   <span class="keyword">typename</span> ML::const_iterator  get_ml_end()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _ml.end();}
<a name="l00136"></a>00136    
<a name="l00137"></a>00137   <span class="keywordtype">int</span> get_ml_size()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _ml.size();}
<a name="l00138"></a>00138   <span class="keyword">private</span>:
<a name="l00139"></a>00139   ML _ml;
<a name="l00140"></a>00140   <span class="keywordtype">int</span> _lb;
<a name="l00141"></a>00141   <span class="keywordtype">int</span> _ub;
<a name="l00142"></a>00142   <span class="keywordtype">int</span> _depth;
<a name="l00143"></a>00143   <span class="keywordtype">bool</span> _is_induced;
<a name="l00144"></a>00144 
<a name="l00145"></a>00145 };<span class="comment">//end class tree_instance</span>
<a name="l00146"></a>00146 
<a name="l00148"></a>00148 <span class="keyword">template</span>&lt;<span class="keyword">template</span>&lt;<span class="keyword">typename</span>&gt; <span class="keyword">class </span>ST, <span class="keyword">typename</span> T&gt;
<a name="l00149"></a>00149 <span class="keywordtype">bool</span> cousin_test(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">tree_instance&lt;ST, T&gt;</a>&amp; i1, <span class="keyword">const</span> <a class="code" href="classtree__instance.html">tree_instance&lt;ST, T&gt;</a>&amp; i2) {
<a name="l00150"></a>00150   <span class="keywordflow">if</span>(!i1.<a class="code" href="classtree__instance.html#84d628f3015c0e71353bf29a7309b566">match_label</a>(i2.<a class="code" href="classtree__instance.html#1ad16e2842115a6ec95543d4ef702b81">_ml</a>))
<a name="l00151"></a>00151     <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00152"></a>00152   
<a name="l00153"></a>00153   <span class="keywordflow">if</span>(i1.<a class="code" href="classtree__instance.html#a9935c93b299c6827fd281215cbebb1f">less_than</a>(i2) || i2.less_than(i1))
<a name="l00154"></a>00154     <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00155"></a>00155   
<a name="l00156"></a>00156   <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00157"></a>00157 }<span class="comment">//end cousin_test() for ordered trees</span>
<a name="l00158"></a>00158 
<a name="l00159"></a>00159 <span class="keyword">template</span>&lt;<span class="keyword">template</span>&lt;<span class="keyword">typename</span>&gt; <span class="keyword">class </span>MATCH_LABEL_T, <span class="keyword">class </span>order&gt;
<a name="l00160"></a>00160 ostream&amp; operator&lt;&lt; (ostream&amp; ostr, const tree_instance&lt;MATCH_LABEL_T, order&gt;&amp; inst) {
<a name="l00161"></a>00161   ostr&lt;&lt;<span class="stringliteral">"[("</span>&lt;&lt;inst._lb&lt;&lt;<span class="stringliteral">", "</span>&lt;&lt;inst._ub&lt;&lt;<span class="stringliteral">") "</span>;
<a name="l00162"></a>00162   <span class="keyword">typename</span> MATCH_LABEL_T&lt;int&gt;::const_iterator it=inst._ml.begin();
<a name="l00163"></a>00163   <span class="keywordflow">while</span>(it!=inst._ml.end())
<a name="l00164"></a>00164     ostr&lt;&lt;*it++&lt;&lt;<span class="stringliteral">" "</span>;
<a name="l00165"></a>00165   ostr&lt;&lt;inst._depth&lt;&lt;<span class="stringliteral">" "</span>&lt;&lt;inst._is_induced;
<a name="l00166"></a>00166   ostr&lt;&lt;<span class="stringliteral">"]"</span>;
<a name="l00167"></a>00167   <span class="keywordflow">return</span> ostr;
<a name="l00168"></a>00168 }<span class="comment">//end friend operator&lt;&lt;</span>
<a name="l00169"></a>00169 
<a name="l00170"></a>00170 <span class="preprocessor">#endif</span>
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:08 2006 for DMTL by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>