📄 tree__instance_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_instance.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_instance.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="comment">// struct for one instance i.e. occurrence of tree</span><a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="preprocessor">#ifndef _TREE_INSTANCE_H</span><a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_INSTANCE_H</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="preprocessor">#include <vector></span><a name="l00026"></a>00026 <span class="preprocessor">#include <sstream></span><a name="l00027"></a>00027 <span class="keyword">using namespace </span>std;<a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="keyword">template</span><<span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>MATCH_LABEL_T, <span class="keyword">class </span>order><a name="l00030"></a>00030 <span class="keyword">class </span><a class="code" href="classtree__instance.html">tree_instance</a>;<a name="l00031"></a>00031 <a name="l00032"></a>00032 <span class="keyword">template</span><<span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>ST, <span class="keyword">typename</span> T><a name="l00033"></a>00033 <span class="keywordtype">bool</span> cousin_test(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">tree_instance<ST, T></a>& i1, <span class="keyword">const</span> <a class="code" href="classtree__instance.html">tree_instance<ST, T></a>& i2);<a name="l00034"></a>00034 <a name="l00035"></a>00035 <span class="keyword">template</span><<span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>MATCH_LABEL_T, <span class="keyword">class </span>order><a name="l00036"></a>00036 ostream& operator<< (ostream& ostr, const tree_instance<MATCH_LABEL_T, order>& inst);<a name="l00037"></a>00037 <a name="l00039"></a>00039 <span class="keyword">template</span><<span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>ST, <span class="keyword">typename</span> T><a name="l00040"></a>00040 <span class="keywordtype">bool</span> cousin_test(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">tree_instance</a><ST, <a class="code" href="classproplist.html">proplist<ordered, T></a> >& i1, <span class="keyword">const</span> <a class="code" href="classtree__instance.html">tree_instance</a><ST, <a class="code" href="classproplist.html">proplist<ordered, T></a> >& i2) {<a name="l00041"></a>00041 <span class="keywordflow">if</span>(!i1.match_label(i2._ml))<a name="l00042"></a>00042 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00043"></a>00043 <a name="l00044"></a>00044 <span class="keywordflow">if</span>(i1.less_than(i2))<a name="l00045"></a>00045 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00046"></a>00046 <a name="l00047"></a>00047 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00048"></a>00048 }<span class="comment">//end cousin_test() for unordered trees</span><a name="l00049"></a>00049 <a name="l00058"></a>00058 <span class="keyword">template</span><<span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>MATCH_LABEL_T, <span class="keyword">class </span>order><a name="l00059"></a><a class="code" href="classtree__instance.html">00059</a> <span class="keyword">class </span><a class="code" href="classtree__instance.html">tree_instance</a><a name="l00060"></a>00060 {<a name="l00061"></a>00061 <span class="keyword">public</span>:<a name="l00062"></a>00062 <span class="keyword">typedef</span> MATCH_LABEL_T<int> ML;<a name="l00063"></a>00063 <span class="keyword">typedef</span> <a class="code" href="classtree__instance.html">tree_instance<MATCH_LABEL_T, order></a> <a class="code" href="classtree__instance.html">TREE_INSTANCE</a>;<a name="l00064"></a>00064 <a name="l00065"></a>00065 <a class="code" href="classtree__instance.html">tree_instance</a>() {} <span class="comment">// default constructor</span><a name="l00066"></a>00066 <a name="l00067"></a>00067 <a class="code" href="classtree__instance.html">tree_instance</a>(<span class="keyword">const</span> <span class="keywordtype">int</span>& lx, <span class="keyword">const</span> <span class="keywordtype">int</span>& ux, <span class="keyword">const</span> <span class="keywordtype">int</span>& d=0, <span class="keywordtype">bool</span> ind=0): _lb(lx), _ub(ux), _depth(d), _is_induced(ind) {}<a name="l00068"></a>00068 <a class="code" href="classtree__instance.html">tree_instance</a>(ML& ml, <span class="keyword">const</span> <span class="keywordtype">int</span>& lx, <span class="keyword">const</span> <span class="keywordtype">int</span>& ux, <span class="keyword">const</span> <span class="keywordtype">int</span>& d=0, <span class="keywordtype">bool</span> ind=0): _ml(ml), _lb(lx), _ub(ux), _depth(d), _is_induced(ind) {}<a name="l00069"></a>00069 <a class="code" href="classtree__instance.html">tree_instance</a>(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">TREE_INSTANCE</a>& i2, <span class="keyword">const</span> <span class="keywordtype">int</span>& lx, <span class="keyword">const</span> <span class="keywordtype">int</span>& d=0, <span class="keywordtype">bool</span> ind=0): _ml(i2.<a class="code" href="classtree__instance.html#1ad16e2842115a6ec95543d4ef702b81">_ml</a>), _lb(i2.<a class="code" href="classtree__instance.html#7323a7c843e4da0d5e8b4dea6ca64562">_lb</a>), _ub(i2.<a class="code" href="classtree__instance.html#349045169644c26c2b8b4a75a245609b">_ub</a>), _depth(d), _is_induced(ind)<a name="l00070"></a>00070 { _ml.push_back(lx);}<span class="comment">//end constructor</span><a name="l00071"></a>00071 <a name="l00072"></a>00072 <span class="keyword">const</span> <span class="keywordtype">int</span>& lower()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _lb;}<a name="l00073"></a>00073 <span class="keyword">const</span> <span class="keywordtype">int</span>& upper()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _ub;}<a name="l00074"></a>00074 <a name="l00076"></a><a class="code" href="classtree__instance.html#a9935c93b299c6827fd281215cbebb1f">00076</a> <span class="keywordtype">bool</span> <a class="code" href="classtree__instance.html#a9935c93b299c6827fd281215cbebb1f">less_than</a>(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">TREE_INSTANCE</a>& i2)<span class="keyword"> const </span>{<a name="l00077"></a>00077 <span class="keywordflow">if</span> (_ub<i2.<a class="code" href="classtree__instance.html#7323a7c843e4da0d5e8b4dea6ca64562">_lb</a>)<a name="l00078"></a>00078 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00079"></a>00079 <a name="l00080"></a>00080 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00081"></a>00081 }<span class="comment">//end less_than()</span><a name="l00082"></a>00082 <a name="l00084"></a><a class="code" href="classtree__instance.html#6c2027a604839cbe2fd1ff6573ac4b0f">00084</a> <span class="keywordtype">bool</span> <a class="code" href="classtree__instance.html#6c2027a604839cbe2fd1ff6573ac4b0f">contains</a>(<span class="keyword">const</span> <a class="code" href="classtree__instance.html">TREE_INSTANCE</a>& i2)<span class="keyword"> const </span>{<a name="l00085"></a>00085 <span class="keywordflow">if</span>(_lb<i2._lb && _ub>=i2.<a class="code" href="classtree__instance.html#349045169644c26c2b8b4a75a245609b">_ub</a>)⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -