📄 tree__can__code_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_can_code.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_can_code.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">// canonical code specialization for trees</span><a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="preprocessor">#ifndef _TREE_CAN_CODE_</span><a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_CAN_CODE_</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="keyword">using namespace </span>std;<a name="l00026"></a>00026 <a name="l00027"></a>00027 <span class="preprocessor">#include <string></span><a name="l00028"></a>00028 <span class="preprocessor">#include <sstream></span><a name="l00029"></a>00029 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00030"></a>00030 <span class="preprocessor">#include "typedefs.h"</span><a name="l00031"></a>00031 <a name="l00038"></a>00038 <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="l00039"></a><a class="code" href="classcanonical__code_3_01TREE__PROP_00_01V__T_00_01E__T_00_01ALLOC_01_4.html">00039</a> <span class="keyword">class </span><a class="code" href="classcanonical__code.html">canonical_code</a><TREE_PROP, V_T, E_T, ALLOC><a name="l00040"></a>00040 {<a name="l00041"></a>00041 <a name="l00042"></a>00042 <span class="keyword">public</span>:<a name="l00043"></a>00043 <a name="l00044"></a>00044 <span class="keyword">typedef</span> <span class="keywordtype">int</span> STORAGE_TYPE;<a name="l00045"></a>00045 <span class="keyword">typedef</span> V_T INIT_TYPE;<a name="l00046"></a>00046 <span class="keyword">typedef</span> <a class="code" href="structeqint.html">eqint</a> <a class="code" href="structeqint.html">COMPARISON_FUNC</a>;<a name="l00047"></a>00047 <a name="l00048"></a>00048 <a class="code" href="classcanonical__code.html">canonical_code</a>() {}<a name="l00049"></a>00049 <a name="l00050"></a>00050 <span class="keywordtype">void</span> backtrack() {<a name="l00051"></a>00051 }<a name="l00052"></a>00052 <a name="l00053"></a>00053 <span class="keyword">template</span><<span class="keyword">class</span> PAT><a name="l00054"></a>00054 <span class="keywordtype">void</span> init(<span class="keyword">const</span> INIT_TYPE& v, PAT* <a class="code" href="classpattern.html">pattern</a>) { <a name="l00055"></a>00055 <span class="keyword">typename</span> map<V_T, int>::iterator i;<a name="l00056"></a>00056 i = len1_pat_map.find(v);<a name="l00057"></a>00057 <a name="l00058"></a>00058 <span class="keywordflow">if</span>(i != len1_pat_map.end())<a name="l00059"></a>00059 _can_code = i->second;<a name="l00060"></a>00060 <span class="keywordflow">else</span> {<a name="l00061"></a>00061 len1_pat_map[v] = init_counter;<a name="l00062"></a>00062 _can_code = init_counter++;<a name="l00063"></a>00063 }<a name="l00064"></a>00064 <a name="l00065"></a>00065 pattern->update_rmpath(0);<a name="l00066"></a>00066 }<a name="l00067"></a>00067 <a name="l00068"></a>00068 <span class="keywordtype">void</span> insert_vertex(<span class="keyword">const</span> INIT_TYPE& v) {<a name="l00069"></a>00069 }<a name="l00070"></a>00070 <a name="l00071"></a>00071 <span class="keywordtype">void</span> update_code() { <a name="l00072"></a>00072 _can_code = id_generator--;<a name="l00073"></a>00073 }<a name="l00074"></a>00074 <a name="l00075"></a>00075 <a name="l00076"></a>00076 STORAGE_TYPE getCode()<span class="keyword"> const </span>{<a name="l00077"></a>00077 <span class="keywordflow">return</span> _can_code;<a name="l00078"></a>00078 }<a name="l00079"></a>00079 <a name="l00080"></a>00080 <span class="keyword">private</span>:<a name="l00081"></a>00081 STORAGE_TYPE _can_code;<a name="l00082"></a>00082 <span class="keyword">static</span> <span class="keywordtype">int</span> id_generator;<a name="l00083"></a>00083 <span class="keyword">static</span> map<V_T, int> len1_pat_map;<a name="l00084"></a>00084 <span class="keyword">static</span> <span class="keywordtype">int</span> init_counter;<a name="l00085"></a>00085 <a name="l00086"></a>00086 };<span class="comment">//end class canonical_code for tree</span><a name="l00087"></a>00087 <a name="l00088"></a>00088 <span class="keyword">template</span><<span class="keyword">class</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="l00089"></a>00089 <span class="keywordtype">int</span> <a class="code" href="classcanonical__code.html">canonical_code<TREE_PROP, V_T, E_T, ALLOC >::id_generator</a> = -1;<a name="l00090"></a>00090 <a name="l00091"></a>00091 <span class="keyword">template</span><<span class="keyword">class</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="l00092"></a>00092 <span class="keywordtype">int</span> <a class="code" href="classcanonical__code.html">canonical_code<TREE_PROP, V_T, E_T, ALLOC >::init_counter</a> = 1;<a name="l00093"></a>00093 <a name="l00094"></a>00094 <span class="keyword">template</span><<span class="keyword">class</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="l00095"></a>00095 map<V_T, int> <a class="code" href="classcanonical__code.html">canonical_code<TREE_PROP, V_T, E_T, ALLOC >::len1_pat_map</a>;<a name="l00096"></a>00096 <a name="l00097"></a>00097 <a name="l00098"></a>00098 <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 + -