⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 graph__vat_8h-source.html

📁 这是一个用于数据挖掘的常用算法的模板库(数据挖掘的C++模板库for UNIX)
💻 HTML
📖 第 1 页 / 共 4 页
字号:
<!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: graph_vat.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&nbsp;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&nbsp;Pages</span></a></li>  </ul></div><h1>graph_vat.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 &lt;zaki@cs.rpi.edu&gt; 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 _GRAPH_VAT_H</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _GRAPH_VAT_H</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include &lt;ext/hash_set&gt;</span><a name="l00024"></a>00024 <span class="preprocessor">#include "graph_evat.h"</span><a name="l00025"></a>00025 <span class="preprocessor">#include "pattern.h"</span><a name="l00026"></a>00026 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00027"></a>00027 <span class="preprocessor">#include "typedefs.h"</span><a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="comment">//#include "pat_support.h"</span><a name="l00030"></a>00030 <a name="l00031"></a>00031 <a name="l00032"></a>00032 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_vat, tt_fwd_isect, tt_back_isect;<a name="l00033"></a>00033 <span class="keywordtype">int</span> fwd_isect_cnt=0;<a name="l00034"></a>00034 <span class="keywordtype">int</span> back_isect_cnt=0;<a name="l00035"></a>00035 <a name="l00036"></a>00036 <a name="l00037"></a>00037 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PP, <span class="keyword">typename</span> MP, <span class="keyword">template</span> &lt;<span class="keyword">typename</span>&gt; <span class="keyword">class </span>ALLOC, <a name="l00038"></a>00038          <span class="keyword">template</span>&lt;<span class="keyword">typename</span>, <span class="keyword">typename</span>&gt; <span class="keyword">class </span>ST&gt;<a name="l00039"></a>00039 <span class="keyword">class </span><a class="code" href="classvat.html">vat</a>&lt;GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST&gt;;<a name="l00040"></a>00040 <a name="l00041"></a>00041 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PP, <span class="keyword">typename</span> MP, <span class="keyword">template</span> &lt;<span class="keyword">typename</span>&gt; <span class="keyword">class </span>ALLOC,<a name="l00042"></a>00042          <span class="keyword">template</span>&lt;<span class="keyword">typename</span>, <span class="keyword">typename</span>&gt; <span class="keyword">class </span>ST&gt;<a name="l00043"></a>00043 ostream&amp; operator&lt;&lt; (ostream&amp; ostr, const vat&lt;PP, MP, ALLOC, ST&gt;* v);<a name="l00044"></a>00044 <a name="l00046"></a>00046 <span class="comment">// NOTE: ST should model a vector, else this class shall not compile</span><a name="l00047"></a>00047 <span class="comment">// vectors are used to make the design efficient</span><a name="l00048"></a>00048 <a name="l00058"></a>00058 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> PP, <span class="keyword">typename</span> MP, <span class="keyword">template</span> &lt;<span class="keyword">typename</span>&gt; <span class="keyword">class </span>ALLOC, <span class="keyword">template</span>&lt;<span class="keyword">typename</span>, <span class="keyword">typename</span>&gt; <span class="keyword">class </span>ST&gt;<a name="l00059"></a><a class="code" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html">00059</a> <span class="keyword">class </span><a class="code" href="classvat.html">vat</a>&lt;GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST&gt;<a name="l00060"></a>00060 {<a name="l00061"></a>00061  <span class="keyword">public</span>:<a name="l00062"></a>00062 <a name="l00063"></a>00063   <span class="keyword">typedef</span> <a class="code" href="classevat.html">evat&lt;ALLOC&gt;</a> <a class="code" href="classevat.html">EVAT</a>;<a name="l00064"></a>00064   <span class="keyword">typedef</span> <a class="code" href="classvat.html">vat&lt;GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST&gt;</a> <a class="code" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html">VAT</a>;<a name="l00065"></a>00065   <span class="keyword">typedef</span> ST&lt;EVAT, ALLOC&lt;EVAT&gt; &gt; RMP_VATS;<a name="l00066"></a>00066   <span class="keyword">typedef</span> ST&lt;pair&lt;int, RMP_VATS&gt;, ALLOC&lt;pair&lt;int, RMP_VATS&gt; &gt; &gt; GVAT;<a name="l00071"></a><a class="code" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#ff0176a2b4ec69537f5dcb9e50c82318">00071</a>   <span class="keyword">typedef</span> HASHNS::hash_set&lt;int, HASHNS::hash&lt;int&gt;, std::equal_to&lt;int&gt;, ALLOC&lt;int&gt; &gt; VSET; <a name="l00074"></a><a class="code" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#526a66d42ea4aab941d30c8bf37e6c16">00074</a>   <span class="keyword">typedef</span> vector&lt;vector&lt;VSET, ALLOC&lt;VSET&gt; &gt;, ALLOC&lt;vector&lt;VSET, ALLOC&lt;VSET&gt; &gt; &gt; &gt; VSETS; <a name="l00077"></a>00077   <span class="keyword">typedef</span> <span class="keyword">typename</span> GVAT::const_iterator CONST_IT;<a name="l00078"></a>00078   <span class="keyword">typedef</span> <span class="keyword">typename</span> GVAT::iterator IT;<a name="l00079"></a>00079   <span class="keyword">typedef</span> <span class="keyword">typename</span> ST&lt;EVAT, ALLOC&lt;EVAT&gt; &gt;::const_iterator CONST_EIT;<a name="l00080"></a>00080   <span class="keyword">typedef</span> <span class="keyword">typename</span> VSETS::iterator VS_IT;<a name="l00081"></a>00081   <span class="keyword">typedef</span> <span class="keyword">typename</span> VSETS::const_iterator CONST_VS_IT;<a name="l00082"></a>00082 <a name="l00083"></a>00083   <span class="keywordtype">void</span>* operator new(size_t size) {<a name="l00084"></a>00084     ALLOC&lt;VAT&gt; v;<a name="l00085"></a>00085     <span class="keywordflow">return</span> v.allocate(size);<a name="l00086"></a>00086   }<a name="l00087"></a>00087 <a name="l00088"></a>00088   <span class="keywordtype">void</span>  operator delete(<span class="keywordtype">void</span> *p, size_t size) {<a name="l00089"></a>00089     <span class="keywordflow">if</span> (p) {<a name="l00090"></a>00090       ALLOC&lt;VAT&gt; v;<a name="l00091"></a>00091       v.deallocate(static_cast&lt;VAT*&gt; (p), size);<a name="l00092"></a>00092     }<a name="l00093"></a>00093   }<a name="l00094"></a>00094 <a name="l00095"></a>00095   IT begin() { <a name="l00096"></a>00096     <span class="keywordflow">return</span> _vat.begin();<a name="l00097"></a>00097   }<a name="l00098"></a>00098   CONST_IT begin()<span class="keyword"> const </span>{ <a name="l00099"></a>00099     <span class="keywordflow">return</span> _vat.begin();<a name="l00100"></a>00100   }<a name="l00101"></a>00101   IT end() { <a name="l00102"></a>00102     <span class="keywordflow">return</span> _vat.end();<a name="l00103"></a>00103   }<a name="l00104"></a>00104   CONST_IT end()<span class="keyword"> const </span>{ <a name="l00105"></a>00105     <span class="keywordflow">return</span> _vat.end();<a name="l00106"></a>00106   }<a name="l00107"></a>00107 <a name="l00108"></a>00108   VS_IT begin_v() { <a name="l00109"></a>00109     <span class="keywordflow">return</span> _vids.begin();<a name="l00110"></a>00110   }<a name="l00111"></a>00111   CONST_VS_IT begin_v()<span class="keyword"> const </span>{ <a name="l00112"></a>00112     <span class="keywordflow">return</span> _vids.begin();<a name="l00113"></a>00113   }<a name="l00114"></a>00114   VS_IT end_v() { <a name="l00115"></a>00115     <span class="keywordflow">return</span> _vids.end();<a name="l00116"></a>00116   }<a name="l00117"></a>00117   CONST_VS_IT end_v()<span class="keyword"> const </span>{ <a name="l00118"></a>00118     <span class="keywordflow">return</span> _vids.end();<a name="l00119"></a>00119   }<a name="l00120"></a>00120 <a name="l00121"></a>00121   <span class="keyword">friend</span> ostream&amp; operator&lt;&lt; &lt;&gt;(ostream&amp;, <span class="keyword">const</span> VAT*);<a name="l00122"></a>00122 <a name="l00123"></a>00123   <span class="keywordtype">int</span> size()<span class="keyword"> const </span>{ <a name="l00124"></a>00124     <span class="keywordflow">return</span> _vat.size();<a name="l00125"></a>00125   }<a name="l00126"></a>00126 <a name="l00127"></a>00127   <span class="keywordtype">bool</span> empty()<span class="keyword"> const </span>{ <a name="l00128"></a>00128     <span class="keywordflow">return</span> _vat.empty();<a name="l00129"></a>00129   }<a name="l00130"></a>00130 <a name="l00131"></a>00131   <span class="keyword">const</span> pair&lt;int, ST&lt;EVAT, ALLOC&lt;EVAT&gt; &gt; &gt;&amp; back()<span class="keyword"> const </span>{ <a name="l00132"></a>00132     <span class="keywordflow">return</span> _vat.back();<a name="l00133"></a>00133   }<a name="l00134"></a>00134 <a name="l00135"></a>00135   <span class="keywordtype">void</span> insert_occurrence_tid(<span class="keyword">const</span> <span class="keywordtype">int</span>&amp; tid, <span class="keyword">const</span> pair&lt;int, int&gt;&amp; new_occurrence) {<a name="l00136"></a>00136     ST&lt;EVAT, ALLOC&lt;EVAT&gt; &gt; new_evats;<a name="l00137"></a>00137     <a class="code" href="classevat.html">evat&lt;ALLOC&gt;</a> new_evat;<a name="l00138"></a>00138     new_evat.<a class="code" href="classevat.html#32a3e3ee1a1a23bd65e7b33b854de201">push_back</a>(new_occurrence);<a name="l00139"></a>00139     new_evats.push_back(new_evat);<a name="l00140"></a>00140     _vat.push_back(make_pair(tid, new_evats));<a name="l00141"></a>00141   }<span class="comment">//insert_new_occurrence()</span><a name="l00142"></a>00142 <a name="l00143"></a>00143 <a name="l00144"></a>00144   <span class="keywordtype">void</span> insert_occurrence_evat(<span class="keyword">const</span> pair&lt;int, int&gt;&amp; new_occurrence) {<a name="l00145"></a>00145     <a class="code" href="classevat.html">evat&lt;ALLOC&gt;</a> new_evat;<a name="l00146"></a>00146     new_evat.<a class="code" href="classevat.html#32a3e3ee1a1a23bd65e7b33b854de201">push_back</a>(new_occurrence);<a name="l00147"></a>00147     _vat.back().second.push_back(new_evat);<a name="l00148"></a>00148   }<span class="comment">//insert_occurrence_evat()</span>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -