📄 graph__can__code_8h-source.html
字号:
<a name="l00156"></a>00156 <a name="l00157"></a>00157 <span class="keywordtype">void</span> init_rmp() {<a name="l00158"></a>00158 <span class="keywordflow">if</span>(!_rmp.empty())<a name="l00159"></a>00159 _rmp.clear();<a name="l00160"></a>00160 _rmp.push_back(0);<a name="l00161"></a>00161 _rmp.push_back(1);<a name="l00162"></a>00162 }<a name="l00163"></a>00163 <a name="l00164"></a>00164 <span class="keywordtype">void</span> update_rmp(<span class="keyword">const</span> FIVE_TUPLE& tuple) {<a name="l00165"></a>00165 <span class="keywordflow">if</span>(_rmp.empty()) {<a name="l00166"></a>00166 _rmp.push_back(tuple._i);<a name="l00167"></a>00167 _rmp.push_back(tuple._j);<a name="l00168"></a>00168 <span class="keywordflow">return</span>;<a name="l00169"></a>00169 }<a name="l00170"></a>00170 <a name="l00171"></a>00171 <span class="comment">// no changes to rmp if it's a back-edge</span><a name="l00172"></a>00172 <span class="keywordflow">if</span>(tuple._i>tuple._j)<a name="l00173"></a>00173 <span class="keywordflow">return</span>;<a name="l00174"></a>00174 <a name="l00175"></a>00175 <span class="keyword">typename</span> RMP_T::iterator rmp_it=_rmp.end()-1;<a name="l00176"></a>00176 <span class="keywordflow">while</span>(rmp_it>=_rmp.begin()) {<a name="l00177"></a>00177 <span class="keywordflow">if</span>(*rmp_it==tuple._i)<a name="l00178"></a>00178 <span class="keywordflow">break</span>;<a name="l00179"></a>00179 rmp_it=_rmp.erase(rmp_it);<a name="l00180"></a>00180 rmp_it--;<a name="l00181"></a>00181 }<a name="l00182"></a>00182 _rmp.push_back(tuple._j);<a name="l00183"></a>00183 <a name="l00184"></a>00184 }<span class="comment">//end update_rmp()</span><a name="l00185"></a>00185 <a name="l00186"></a>00186 <a name="l00187"></a>00187 <span class="keyword">template</span><<span class="keyword">class</span> PAT><a name="l00188"></a>00188 <span class="keywordtype">void</span> init(<span class="keyword">const</span> INIT_TYPE& tuple, PAT* <a class="code" href="classpattern.html">pattern</a>) { <a name="l00189"></a>00189 tt_iostream.<a class="code" href="classtime__tracker.html#cbe4e1e72cf61ff3f4c135e161fc5a50">start</a>();<a name="l00190"></a>00190 clear();<a name="l00191"></a>00191 _dfs_code.push_back(tuple);<a name="l00192"></a>00192 <a name="l00193"></a>00193 ostringstream t_ss;<a name="l00194"></a>00194 t_ss << tuple;<a name="l00195"></a>00195 string t_str = t_ss.str();<a name="l00196"></a>00196 <span class="keywordtype">char</span>* p = <span class="keyword">new</span> <span class="keywordtype">char</span>[t_str.length()+1];<a name="l00197"></a>00197 t_str.copy(p, string::npos);<a name="l00198"></a>00198 p[t_str.length()] = 0;<a name="l00199"></a>00199 HASHNS::hash_map<const char*, int, HASHNS::hash<const char*>, <a class="code" href="structeqstr.html">eqstr</a>>::iterator itr = level_one_hash.find(p); <a name="l00200"></a>00200 <span class="keywordflow">if</span>(itr != level_one_hash.end()) {<a name="l00201"></a>00201 _can_code = itr->second; <a name="l00202"></a>00202 <span class="keyword">delete</span> p;<a name="l00203"></a>00203 } <span class="keywordflow">else</span> {<a name="l00204"></a>00204 level_one_hash.insert(make_pair(p, _can_code));<a name="l00205"></a>00205 }<a name="l00206"></a>00206 <a name="l00207"></a>00207 tt_iostream.<a class="code" href="classtime__tracker.html#a6790d26a9c1c83569711a7634413856">stop</a>();<a name="l00208"></a>00208 <a name="l00209"></a>00209 pattern->update_rmpath(0);<a name="l00210"></a>00210 pattern->update_rmpath(1);<a name="l00211"></a>00211 }<a name="l00212"></a>00212 <a name="l00213"></a>00213 <span class="keywordtype">void</span> push_back(<span class="keyword">const</span> FIVE_TUPLE& tuple) {<a name="l00214"></a>00214 _dfs_code.push_back(tuple);<a name="l00215"></a>00215 tt_iostream.<a class="code" href="classtime__tracker.html#cbe4e1e72cf61ff3f4c135e161fc5a50">start</a>();<a name="l00216"></a>00216 tt_iostream.<a class="code" href="classtime__tracker.html#a6790d26a9c1c83569711a7634413856">stop</a>();<a name="l00217"></a>00217 }<a name="l00218"></a>00218 <a name="l00219"></a>00219 <span class="keywordtype">void</span> append(<span class="keyword">const</span> FIVE_TUPLE& tuple) { <a name="l00220"></a>00220 push_back(tuple);<a name="l00221"></a>00221 }<a name="l00222"></a>00222 <a name="l00223"></a>00223 <span class="keywordtype">void</span> append(<span class="keyword">const</span> FIVE_TUPLE& tuple, <span class="keyword">const</span> <span class="keywordtype">int</span>& gi, <span class="keyword">const</span> <span class="keywordtype">int</span>& gj) { <a name="l00224"></a>00224 push_back(tuple);<a name="l00225"></a>00225 _cid_to_gid.insert(make_pair(tuple._i, gi));<a name="l00226"></a>00226 _cid_to_gid.insert(make_pair(tuple._j, gj));<a name="l00227"></a>00227 _gid_to_cid.insert(make_pair(gi, tuple._i));<a name="l00228"></a>00228 _gid_to_cid.insert(make_pair(gj, tuple._j));<a name="l00229"></a>00229 }<a name="l00230"></a>00230 <a name="l00231"></a>00231 <span class="keywordtype">void</span> update_code() {<a name="l00232"></a>00232 _can_code = id_generator++;<a name="l00233"></a>00233 }<a name="l00234"></a>00234 <a name="l00235"></a>00235 <a name="l00236"></a>00236 STORAGE_TYPE getCode()<span class="keyword"> const </span>{<a name="l00237"></a>00237 <span class="keywordflow">return</span> _can_code;<a name="l00238"></a>00238 }<a name="l00239"></a>00239 <a name="l00240"></a>00240 <span class="keywordtype">bool</span> operator< (<span class="keyword">const</span> CAN_CODE& rhs)<span class="keyword"> const </span>{<a name="l00241"></a>00241 <span class="keywordtype">int</span> i=0, j=0;<a name="l00242"></a>00242 <span class="keywordflow">while</span>(i<_dfs_code.size() && j<rhs._dfs_code.size()) {<a name="l00243"></a>00243 <span class="keywordflow">if</span>(rhs._dfs_code[j]<_dfs_code[i])<a name="l00244"></a>00244 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00245"></a>00245 i++;<a name="l00246"></a>00246 j++;<a name="l00247"></a>00247 }<a name="l00248"></a>00248 <a name="l00249"></a>00249 <span class="comment">// both codes are equal till common length</span><a name="l00250"></a>00250 <span class="keywordflow">return</span> _dfs_code.size()>=rhs._dfs_code.size();<a name="l00251"></a>00251 }<a name="l00252"></a>00252 <a name="l00253"></a>00253 <span class="keywordtype">int</span> cid(<span class="keyword">const</span> <span class="keywordtype">int</span>& gi)<span class="keyword"> const </span>{<a name="l00254"></a>00254 VM_CONST_IT it=_gid_to_cid.find(gi);<a name="l00255"></a>00255 <span class="keywordflow">if</span>(it==_gid_to_cid.end()) {<a name="l00256"></a>00256 <span class="keywordflow">return</span> -1;<a name="l00257"></a>00257 }<a name="l00258"></a>00258 <span class="keywordflow">return</span> it->second;<a name="l00259"></a>00259 }<a name="l00260"></a>00260 <a name="l00261"></a>00261 <span class="keywordtype">int</span> gid(<span class="keyword">const</span> <span class="keywordtype">int</span>& ci)<span class="keyword"> const </span>{<a name="l00262"></a>00262 VM_CONST_IT it=_cid_to_gid.find(ci);<a name="l00263"></a>00263 <span class="keywordflow">if</span>(it==_cid_to_gid.end()) {<a name="l00264"></a>00264 <span class="keywordflow">return</span> -1;<a name="l00265"></a>00265 }<a name="l00266"></a>00266 <span class="keywordflow">return</span> it->second;<a name="l00267"></a>00267 }<a name="l00268"></a>00268 <a name="l00269"></a>00269 RMP_T& rmost_path() { <span class="keywordflow">return</span> _rmp;}<a name="l00270"></a>00270 <a name="l00271"></a>00271 <span class="keywordtype">void</span> append_rmp(<span class="keyword">const</span> <span class="keywordtype">int</span>& <span class="keywordtype">id</span>) {<a name="l00272"></a>00272 _rmp.push_back(<span class="keywordtype">id</span>);<a name="l00273"></a>00273 }<a name="l00274"></a>00274 <a name="l00275"></a>00275 <span class="keyword">friend</span> ostream& operator<< <>(ostream&, <span class="keyword">const</span> <a class="code" href="classcanonical__code.html">canonical_code<GRAPH_PROP, V_T, E_T, ALLOC></a>&);<a name="l00276"></a>00276 <a name="l00277"></a>00277 <span class="keyword">private</span>:<a name="l00278"></a>00278 STORAGE_TYPE _can_code;<a name="l00279"></a>00279 TUPLES _dfs_code; <a name="l00280"></a>00280 VID_HMAP _cid_to_gid;<a name="l00281"></a>00281 VID_HMAP _gid_to_cid;<a name="l00282"></a>00282 RMP_T _rmp;<a name="l00283"></a>00283 <span class="keyword">static</span> <span class="keywordtype">int</span> id_generator;<a name="l00284"></a>00284 <span class="keyword">static</span> HASHNS::hash_map<const char*, int, HASHNS::hash<const char*>, <a class="code" href="structeqstr.html">eqstr</a>> level_one_hash;<a name="l00285"></a>00285 <a name="l00286"></a>00286 };<span class="comment">//end class canonical_code for graph</span><a name="l00287"></a>00287 <a name="l00288"></a>00288 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC><a name="l00289"></a>00289 ostream& operator<< (ostream& ostr, const canonical_code<GRAPH_PROP, V_T, E_T, ALLOC>& cc) {<a name="l00290"></a>00290 <span class="keyword">typename</span> <a class="code" href="classcanonical__code.html">canonical_code<GRAPH_PROP, V_T, E_T, ALLOC>::TUPLES::const_iterator</a> it;<a name="l00291"></a>00291 <span class="keywordflow">for</span>(it=cc._dfs_code.begin(); it!=cc._dfs_code.end(); it++)<a name="l00292"></a>00292 ostr<<*it<<endl;<a name="l00293"></a>00293 <span class="keywordflow">return</span> ostr;<a name="l00294"></a>00294 }<a name="l00295"></a>00295 <a name="l00296"></a>00296 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">typename</span> v, <span class="keyword">typename</span> e, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC ><a name="l00297"></a>00297 <span class="keywordtype">int</span> <a class="code" href="classcanonical__code.html">canonical_code<GRAPH_PROP, v, e, ALLOC>::id_generator</a> = 1;<a name="l00298"></a>00298 <a name="l00299"></a>00299 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">typename</span> v, <span class="keyword">typename</span> e, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC ><a name="l00300"></a>00300 HASHNS::hash_map<const char*, int, HASHNS::hash<const char*>, <a class="code" href="structeqstr.html">eqstr</a>> <a name="l00301"></a>00301 <a class="code" href="classcanonical__code.html">canonical_code<GRAPH_PROP, v, e, ALLOC>::level_one_hash</a>;<a name="l00302"></a>00302 <a name="l00303"></a>00303 <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 <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>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -