level__one__hmap_8h-source.html

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

<a name="l00095"></a>00095     <span class="comment">// if((it=_hmap.find(V_EP::conv_hash_type(src)))!=_hmap.end()) {</span>
<a name="l00096"></a>00096     <span class="keywordflow">if</span>((it=_hmap.find(ret))!=_hmap.end()) {
<a name="l00097"></a>00097       <span class="comment">// src exists in hmap</span>
<a name="l00098"></a>00098       <span class="keywordflow">if</span>((nit=it-&gt;second.find(V_EP::conv_hash_type(dest)))!=it-&gt;second.end()) {
<a name="l00099"></a>00099         <span class="comment">// dest exists in neighbor list</span>
<a name="l00100"></a>00100         <span class="keywordflow">if</span>(nit-&gt;second.find(lbl)==nit-&gt;second.end()) {
<a name="l00101"></a>00101           <span class="comment">// lbl does not exist</span>
<a name="l00102"></a>00102           lit_p=nit-&gt;second.insert(lbl);
<a name="l00103"></a>00103           <span class="keywordflow">if</span>(!lit_p.second) {
<a name="l00104"></a>00104             cout&lt;&lt;<span class="stringliteral">"level_one_map.insert: lbl insert(1) failed for lbl="</span>&lt;&lt;lbl&lt;&lt;endl;
<a name="l00105"></a>00105             <span class="keywordflow">return</span>;
<a name="l00106"></a>00106           }
<a name="l00107"></a>00107         }
<a name="l00108"></a>00108       }
<a name="l00109"></a>00109       <span class="keywordflow">else</span> {
<a name="l00110"></a>00110         <span class="comment">// dest not found in neighbor list of src</span>
<a name="l00111"></a>00111         LABELS lset;
<a name="l00112"></a>00112         lit_p=lset.insert(lbl);
<a name="l00113"></a>00113 
<a name="l00114"></a>00114         <span class="keywordflow">if</span>(!lit_p.second) {
<a name="l00115"></a>00115           cout&lt;&lt;<span class="stringliteral">"level_one_map.insert: lbl insert(2) failed for lbl="</span>&lt;&lt;lbl&lt;&lt;endl;
<a name="l00116"></a>00116           <span class="keywordflow">return</span>;
<a name="l00117"></a>00117         }
<a name="l00118"></a>00118     
<a name="l00119"></a>00119         nit_p=it-&gt;second.insert(make_pair(V_EP::conv_hash_type(dest), lset));
<a name="l00120"></a>00120         <span class="keywordflow">if</span>(!nit_p.second) {
<a name="l00121"></a>00121           cout&lt;&lt;<span class="stringliteral">"level_one_map.insert: dest insert(1) failed for dest="</span>&lt;&lt;dest&lt;&lt;endl;
<a name="l00122"></a>00122           <span class="keywordflow">return</span>;
<a name="l00123"></a>00123         }    
<a name="l00124"></a>00124       }
<a name="l00125"></a>00125     }<span class="comment">//end if it=hmap.find..</span>
<a name="l00126"></a>00126 
<a name="l00127"></a>00127     <span class="keywordflow">else</span> {
<a name="l00128"></a>00128 
<a name="l00129"></a>00129       <span class="comment">// src not found in hmap</span>
<a name="l00130"></a>00130       NEIGHBORS nbr;
<a name="l00131"></a>00131       LABELS lset;
<a name="l00132"></a>00132       lit_p=lset.insert(lbl);
<a name="l00133"></a>00133 
<a name="l00134"></a>00134       <span class="keywordflow">if</span>(!lit_p.second) {
<a name="l00135"></a>00135         cout&lt;&lt;<span class="stringliteral">"level_one_map.insert: lbl insert(3) failed for lbl="</span>&lt;&lt;lbl&lt;&lt;endl;
<a name="l00136"></a>00136         <span class="keywordflow">return</span>;
<a name="l00137"></a>00137       }
<a name="l00138"></a>00138 
<a name="l00139"></a>00139       nit_p=nbr.insert(make_pair(V_EP::conv_hash_type(dest), lset));
<a name="l00140"></a>00140       <span class="keywordflow">if</span>(!nit_p.second) {
<a name="l00141"></a>00141         cout&lt;&lt;<span class="stringliteral">"level_one_map.insert: dest insert(2) failed for dest="</span>&lt;&lt;dest&lt;&lt;endl;
<a name="l00142"></a>00142         <span class="keywordflow">return</span>;
<a name="l00143"></a>00143       }
<a name="l00144"></a>00144 
<a name="l00145"></a>00145       it_p=_hmap.insert(make_pair(V_EP::conv_hash_type(src), nbr));
<a name="l00146"></a>00146       <span class="keywordflow">if</span>(!it_p.second) {
<a name="l00147"></a>00147         cout&lt;&lt;<span class="stringliteral">"level_one_map.insert: src insert(1) failed for src="</span>&lt;&lt;src&lt;&lt;endl;
<a name="l00148"></a>00148         <span class="keywordflow">return</span>;
<a name="l00149"></a>00149       }
<a name="l00150"></a>00150     }<span class="comment">//end else it!=hmap.find ..</span>
<a name="l00151"></a>00151 
<a name="l00152"></a>00152   }<span class="comment">//end insert()</span>
<a name="l00153"></a>00153 
<a name="l00154"></a>00154 
<a name="l00155"></a>00155   <span class="keyword">const</span> LABELS&amp; get_labels(<span class="keyword">const</span> V_T&amp; src, <span class="keyword">const</span> V_T&amp; dest)<span class="keyword"> const </span>{
<a name="l00156"></a>00156     CONST_IT it=_hmap.find(V_EP::conv_hash_type(src));
<a name="l00157"></a>00157     <span class="keywordflow">if</span>(it==_hmap.end()) {
<a name="l00158"></a>00158       cout&lt;&lt;<span class="stringliteral">"level_one_map.get_labels: src not found in hmap for src="</span>&lt;&lt;src&lt;&lt;<span class="stringliteral">"*"</span>&lt;&lt;endl;
<a name="l00159"></a>00159       exit(0);
<a name="l00160"></a>00160     }
<a name="l00161"></a>00161     
<a name="l00162"></a>00162     CONST_NIT nit=it-&gt;second.find(V_EP::conv_hash_type(dest));
<a name="l00163"></a>00163     <span class="keywordflow">if</span>(nit==it-&gt;second.end()) {
<a name="l00164"></a>00164       <span class="keywordflow">return</span> _empty_lbls;
<a name="l00165"></a>00165     }
<a name="l00166"></a>00166 
<a name="l00167"></a>00167     <span class="keywordflow">return</span> nit-&gt;second;
<a name="l00168"></a>00168   }<span class="comment">//end get_labels()</span>
<a name="l00169"></a>00169 
<a name="l00170"></a>00170   <span class="keyword">const</span> NEIGHBORS&amp; get_neighbors(<span class="keyword">const</span> V_T&amp; src)<span class="keyword"> const </span>{
<a name="l00171"></a>00171     CONST_IT it=_hmap.find(V_EP::conv_hash_type(src));
<a name="l00172"></a>00172     <span class="keywordflow">if</span>(it==_hmap.end()) {
<a name="l00173"></a>00173       cout&lt;&lt;<span class="stringliteral">"level_one_map.get_neighbors: src not found in hmap for src="</span>&lt;&lt;src&lt;&lt;endl;
<a name="l00174"></a>00174       exit(0);
<a name="l00175"></a>00175     }
<a name="l00176"></a>00176     <span class="keywordflow">return</span> it-&gt;second;
<a name="l00177"></a>00177   }<span class="comment">//end get_neighbors()</span>
<a name="l00178"></a>00178 
<a name="l00179"></a>00179 
<a name="l00180"></a>00180 <span class="keyword">private</span>:
<a name="l00181"></a>00181     <span class="comment">// HMAP _hmap(HASHNS::hash&lt;typename V_EP::HASH_TYPE&gt;(), ALLOC&lt;std::pair&lt;const typename V_EP::HASH_TYPE, NEIGHBORS&gt; &gt;());</span>
<a name="l00182"></a>00182     HMAP _hmap;
<a name="l00183"></a>00183     LABELS _empty_lbls;
<a name="l00184"></a>00184     
<a name="l00185"></a>00185 };<span class="comment">//end class level_one_map</span>
<a name="l00186"></a>00186 
<a name="l00187"></a>00187 <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>