📄 tree__operators_8h-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>DMTL: tree_operators.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.7 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="annotated.html"><span>Classes</span></a></li> <li id="current"><a href="files.html"><span>Files</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> </ul></div><h1>tree_operators.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span><a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2005 M.J. Zaki <zaki@cs.rpi.edu> Rensselaer Polytechnic Institute</span><a name="l00003"></a>00003 <span class="comment"> * Written by parimi@cs.rpi.edu</span><a name="l00004"></a>00004 <span class="comment"> * Updated by chaojv@cs.rpi.edu, alhasan@cs.rpi.edu, salems@cs.rpi.edu</span><a name="l00005"></a>00005 <span class="comment"> *</span><a name="l00006"></a>00006 <span class="comment"> * This program is free software; you can redistribute it and/or</span><a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU General Public License</span><a name="l00008"></a>00008 <span class="comment"> * as published by the Free Software Foundation; either version 2</span><a name="l00009"></a>00009 <span class="comment"> * of the License, or (at your option) any later version.</span><a name="l00010"></a>00010 <span class="comment"> *</span><a name="l00011"></a>00011 <span class="comment"> * This program is distributed in the hope that it will be useful,</span><a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span><a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span><a name="l00014"></a>00014 <span class="comment"> * GNU General Public License for more details.</span><a name="l00015"></a>00015 <span class="comment"> *</span><a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU General Public License along</span><a name="l00017"></a>00017 <span class="comment"> * with this program; if not, write to the Free Software Foundation, Inc.,</span><a name="l00018"></a>00018 <span class="comment"> * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.</span><a name="l00019"></a>00019 <span class="comment"> */</span><a name="l00020"></a>00020 <span class="preprocessor">#ifndef _TREE_OPERATORS_H</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_OPERATORS_H</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include "typedefs.h"</span><a name="l00024"></a>00024 <a name="l00025"></a>00025 <span class="keyword">class </span>Fk_Fk;<a name="l00026"></a>00026 <a name="l00032"></a>00032 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> PAT_ST, <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>> <span class="keyword">class </span>CC,<a name="l00033"></a>00033 template <typename> class ALLOC ><a name="l00034"></a>00034 int compute_pos(const TREE_PATTERN* pat) {<a name="l00035"></a>00035 <span class="keyword">typename</span> TREE_PATTERN::CONST_EIT_PAIR ep=pat->in_edges(pat->rmost_vid());<a name="l00036"></a>00036 <span class="keywordflow">if</span>(ep.first==ep.second) {<a name="l00037"></a>00037 <span class="comment">// single node tree</span><a name="l00038"></a>00038 <span class="keywordflow">return</span> -1;<a name="l00039"></a>00039 }<a name="l00040"></a>00040 <a name="l00041"></a>00041 <span class="keywordflow">return</span> ep.first->first;<a name="l00042"></a>00042 }<span class="comment">//end compute_pos()</span><a name="l00043"></a>00043 <a name="l00047"></a>00047 <span class="keyword">template</span><<span class="keyword">typename</span> PATTERN><a name="l00048"></a><a class="code" href="classcompare__pos.html">00048</a> <span class="keyword">class </span><a class="code" href="classcompare__pos.html">compare_pos</a><a name="l00049"></a>00049 {<a name="l00050"></a>00050 <span class="keyword">public</span>:<a name="l00051"></a>00051 <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> PATTERN* p1, <span class="keyword">const</span> PATTERN* p2)<span class="keyword"> const </span>{<a name="l00052"></a>00052 <span class="keywordflow">return</span> compute_pos(p1)>compute_pos(p2);<a name="l00053"></a>00053 }<a name="l00054"></a>00054 };<a name="l00055"></a>00055 <a name="l00056"></a>00056 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> PAT_ST, <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>> <span class="keyword">class </span>CC,<a name="l00057"></a>00057 template <typename> class ALLOC ><a name="l00058"></a>00058 ostream& operator<< (ostream& ostr, <span class="keyword">const</span> TREE_PATTERN* p) {<a name="l00059"></a>00059 <a name="l00060"></a>00060 stack<typename TREE_PATTERN::CONST_EIT_PAIR> st;<a name="l00061"></a>00061 <a name="l00062"></a>00062 <span class="keyword">typename</span> TREE_PATTERN::CONST_IT it;<a name="l00063"></a>00063 <span class="keywordflow">for</span>(it=p->begin(); it!=p->end(); it++) {<a name="l00064"></a>00064 <span class="keywordflow">if</span>(it == p->begin()) {<a name="l00065"></a>00065 ostr << (*it).v;<a name="l00066"></a>00066 st.push(p->out_edges((*it).id));<a name="l00067"></a>00067 <a name="l00068"></a>00068 } <span class="keywordflow">else</span> {<a name="l00069"></a>00069 <span class="keywordtype">bool</span> btrack = <span class="keyword">false</span>;<a name="l00070"></a>00070 <span class="keywordflow">while</span>(st.top().first == st.top().second) {<a name="l00071"></a>00071 st.pop();<a name="l00072"></a>00072 ostr << <span class="stringliteral">" <-- "</span>; <span class="comment">// backtracking </span><a name="l00073"></a>00073 btrack = <span class="keyword">true</span>;<a name="l00074"></a>00074 st.top().first++;<a name="l00075"></a>00075 }<a name="l00076"></a>00076 <a name="l00077"></a>00077 <span class="keywordflow">if</span>(!btrack) {<a name="l00078"></a>00078 ostr << <span class="stringliteral">" --- "</span> << (*it).v; <span class="comment">// forward edge</span><a name="l00079"></a>00079 } <span class="keywordflow">else</span> {<a name="l00080"></a>00080 ostr << (*it).v;<a name="l00081"></a>00081 }<a name="l00082"></a>00082 <a name="l00083"></a>00083 st.push(p->out_edges((*it).id));<a name="l00084"></a>00084 }<a name="l00085"></a>00085 }<a name="l00086"></a>00086 ostr <<<span class="stringliteral">" -- "</span> <<p->_pat_sup;<a name="l00087"></a>00087 <a name="l00088"></a>00088 <span class="keywordflow">return</span> ostr;<a name="l00089"></a>00089 }<a name="l00090"></a>00090 <a name="l00091"></a>00091 <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 + -