📄 pattern_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: pattern.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>pattern.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 _PATTERN_H</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _PATTERN_H</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="comment">// NOTE: only pointers to pattern objects should be maintained, copying </span><a name="l00024"></a>00024 <span class="comment">// whole patterns each time shall be expensive in the current setup</span><a name="l00025"></a>00025 <a name="l00026"></a>00026 <span class="preprocessor">#include <vector></span><a name="l00027"></a>00027 <span class="preprocessor">#include <sstream></span><a name="l00028"></a>00028 <span class="preprocessor">#include "properties.h"</span><a name="l00029"></a>00029 <a name="l00030"></a>00030 <span class="keyword">using namespace </span>std;<a name="l00031"></a>00031 <a name="l00032"></a>00032 <a name="l00033"></a>00033 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> ST, <span class="keyword">template</span><<span class="keyword">class</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="l00034"></a>00034 template <typename> class ALLOC, class SM_TYPE><a name="l00035"></a>00035 class <a class="code" href="classcount__support.html">count_support</a>;<a name="l00036"></a>00036 <a name="l00037"></a>00037 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> ST, <span class="keyword">template</span><<span class="keyword">class</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, template <typename> class ALLOC ><a name="l00038"></a>00038 class <a class="code" href="classpattern.html">pattern</a>;<a name="l00039"></a>00039 <a name="l00040"></a>00040 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> ST, <span class="keyword">template</span><<span class="keyword">class</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, template <typename> class ALLOC ><a name="l00041"></a>00041 void update_rmost_path(<a class="code" href="classpattern.html">pattern</a><PP, MP, ST, CC, ALLOC>*<span class="keyword">const</span>&);<a name="l00042"></a>00042 <a name="l00043"></a>00043 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> ST, <span class="keyword">template</span><<span class="keyword">class</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, template <typename> class ALLOC ><a name="l00044"></a>00044 ostream& operator<<(ostream&, const pattern<PP, MP, ST, CC, ALLOC>*);<a name="l00045"></a>00045 <a name="l00046"></a>00046 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> ST, <span class="keyword">template</span><<span class="keyword">class</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, template <typename> class ALLOC ><a name="l00047"></a>00047 bool check_isomorphism(<a class="code" href="classpattern.html">pattern</a><PP, MP, ST, CC, ALLOC>* <span class="keyword">const</span>&);<a name="l00048"></a>00048 <a name="l00049"></a>00049 <span class="preprocessor">#include "adj_list.h"</span><a name="l00050"></a>00050 <span class="preprocessor">#include "pat_support.h"</span><a name="l00051"></a>00051 <a name="l00052"></a>00052 <a name="l00060"></a>00060 <span class="keyword">template</span><<span class="keyword">class</span> PATTERN_PROPS, <span class="keyword">class</span> MINING_PROPS, <span class="keyword">class</span> ST, <span class="keyword">template</span><<span class="keyword">class</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="l00061"></a>00061 template <typename> class ALLOC=std::allocator ><a name="l00062"></a><a class="code" href="classpattern.html">00062</a> <span class="keyword">class </span><a class="code" href="classpattern.html">pattern</a><a name="l00063"></a>00063 {<a name="l00064"></a>00064 <a name="l00065"></a>00065 <span class="keyword">public</span>:<a name="l00066"></a>00066 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::VERTEX_T VERTEX_T;<a name="l00067"></a>00067 <span class="keyword">typedef</span> PATTERN_PROPS PAT_PROPS;<a name="l00068"></a>00068 <span class="keyword">typedef</span> MINING_PROPS MINE_PROPS;<a name="l00069"></a>00069 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::EDGE_T EDGE_T;<a name="l00070"></a>00070 <span class="keyword">typedef</span> <a class="code" href="classpattern.html">pattern<PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC ></a> <a class="code" href="classpattern.html">PATTERN</a>;<a name="l00071"></a>00071 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::IT IT;<a name="l00072"></a>00072 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::CONST_IT CONST_IT;<a name="l00073"></a>00073 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::EIT EIT;<a name="l00074"></a>00074 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::CONST_EIT CONST_EIT;<a name="l00075"></a>00075 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::EIT_PAIR EIT_PAIR;<a name="l00076"></a>00076 <span class="keyword">typedef</span> <span class="keyword">typename</span> ST::CONST_EIT_PAIR CONST_EIT_PAIR;<a name="l00077"></a>00077 <span class="keyword">typedef</span> CC<PATTERN_PROPS, VERTEX_T, EDGE_T, ALLOC > CAN_CODE;<a name="l00078"></a>00078 <span class="keyword">typedef</span> std::vector<int, ALLOC<int> > RMP_T;<a name="l00079"></a>00079 <span class="keyword">typedef</span> <span class="keyword">typename</span> CAN_CODE::STORAGE_TYPE CC_STORAGE_TYPE;<a name="l00080"></a>00080 <span class="keyword">typedef</span> <span class="keyword">typename</span> CAN_CODE::INIT_TYPE CC_INIT_TYPE;<a name="l00081"></a>00081 <span class="keyword">typedef</span> <span class="keyword">typename</span> CAN_CODE::COMPARISON_FUNC CC_COMPARISON_FUNC;<a name="l00082"></a>00082 <a name="l00083"></a>00083 <a name="l00084"></a>00084 <span class="keywordtype">void</span>* operator new(size_t size) {<a name="l00085"></a>00085 ALLOC<PATTERN> pa;<a name="l00086"></a>00086 <span class="keywordflow">return</span> pa.allocate(size);<a name="l00087"></a>00087 }<a name="l00088"></a>00088 <a name="l00089"></a>00089 <span class="keywordtype">void</span> operator delete(<span class="keywordtype">void</span> *p, size_t size) {<a name="l00090"></a>00090 <span class="keywordflow">if</span> (p) {<a name="l00091"></a>00091 ALLOC<PATTERN> pa;<a name="l00092"></a>00092 pa.deallocate(static_cast<PATTERN*> (p), size);<a name="l00093"></a>00093 }<a name="l00094"></a>00094 }<a name="l00095"></a>00095 <a name="l00096"></a>00096 <a class="code" href="classpattern.html">pattern</a>(): _rmost_vid(-1), _is_canonical(<span class="keyword">false</span>) {} <a name="l00097"></a>00097 <a name="l00098"></a>00098 IT begin() {<span class="keywordflow">return</span> _graph.begin();}<a name="l00099"></a>00099 CONST_IT begin()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _graph.begin();}<a name="l00100"></a>00100 IT end() {<span class="keywordflow">return</span> _graph.end();}<a name="l00101"></a>00101 CONST_IT end()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _graph.end();}<a name="l00102"></a>00102 <a name="l00103"></a>00103 <span class="keywordtype">int</span> size()<span class="keyword"> const </span>{ <a name="l00104"></a>00104 <span class="keywordflow">return</span> _graph.size();<a name="l00105"></a>00105 }<a name="l00106"></a>00106 <a name="l00107"></a>00107 <span class="keywordtype">int</span> rmp_size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _rmost_path.size();}<a name="l00108"></a>00108 <a name="l00110"></a><a class="code" href="classpattern.html#71d3931874255439f8467d3bb3ee2d40">00110</a> <a class="code" href="classpattern.html">pattern<PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC></a>* <a class="code" href="classpattern.html#71d3931874255439f8467d3bb3ee2d40">clone</a>()<span class="keyword"> const </span>{<a name="l00111"></a>00111 <span class="comment">//allocate space for clone</span><a name="l00112"></a>00112 <a class="code" href="classpattern.html">pattern<PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC></a>* <a class="code" href="classpattern.html#71d3931874255439f8467d3bb3ee2d40">clone</a>=<span class="keyword">new</span> <a class="code" href="classpattern.html">pattern<PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC></a>();<a name="l00113"></a>00113 <a name="l00114"></a>00114 CONST_IT it;<a name="l00115"></a>00115 <span class="keywordflow">for</span>(it=this-><a class="code" href="classpattern.html#9072ce0ada8743fe93472c2ec2a02023">begin</a>(); it!=this->end(); it++)<a name="l00116"></a>00116 <a class="code" href="classpattern.html#71d3931874255439f8467d3bb3ee2d40">clone</a>->_graph.push_back(*it);<a name="l00117"></a>00117 <a name="l00118"></a>00118 <a class="code" href="classpattern.html#71d3931874255439f8467d3bb3ee2d40">clone</a>->_rmost_vid=_rmost_vid;<a name="l00119"></a>00119 <a class="code" href="classpattern.html#71d3931874255439f8467d3bb3ee2d40">clone</a>->_rmost_path=_rmost_path;⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -