📄 count__support_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: count_support.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>count_support.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 _COUNT_SUPPORT_H_</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _COUNT_SUPPORT_H_</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include "pattern.h"</span><a name="l00024"></a>00024 <span class="preprocessor">#include "adj_list.h"</span><a name="l00025"></a>00025 <span class="preprocessor">#include "mem_storage_manager.h"</span><a name="l00026"></a>00026 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00027"></a>00027 <a name="l00028"></a>00028 <a name="l00033"></a>00033 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> JOIN_TYPE, <span class="keyword">class</span> TRANS, <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><a class="code" href="classcount__support_3_01PP_00_01proplist_3_01JOIN__TYPE_00_01proplist_3_01vert__mine_00_01TRANS_6554753e91fdf7e67014eb78021b8dc9.html">00035</a> class <a class="code" href="classcount__support.html">count_support</a><PP, <a class="code" href="classproplist.html">proplist</a><JOIN_TYPE, <a class="code" href="classproplist.html">proplist</a><vert_mine, TRANS > >, ST, CC, ALLOC, SM_TYPE ><a name="l00036"></a>00036 {<a name="l00037"></a>00037 <a name="l00038"></a>00038 <span class="keyword">public</span>:<a name="l00039"></a>00039 <span class="keyword">typedef</span> <a class="code" href="classproplist.html">proplist<JOIN_TYPE, proplist<vert_mine, TRANS ></a> > <a class="code" href="classproplist.html">MINING_PROPS</a>;<a name="l00040"></a>00040 <span class="keyword">typedef</span> ST PAT_ST_TYPE;<a name="l00041"></a>00041 <span class="keyword">typedef</span> PP PATTERN_PROPS;<a name="l00042"></a>00042 <span class="comment">// typedef SM_TYPE STORAGE_MANAGER_TYPE;</span><a name="l00043"></a>00043 <span class="keyword">typedef</span> <a class="code" href="classpattern.html">pattern<PATTERN_PROPS, MINING_PROPS, PAT_ST_TYPE, CC, ALLOC ></a> <a class="code" href="classpattern.html">PATTERN</a>;<a name="l00044"></a>00044 <span class="keyword">typedef</span> <a class="code" href="classvat.html">vat<PATTERN_PROPS, MINING_PROPS, ALLOC, std::vector ></a> <a class="code" href="classvat.html">VAT</a>;<a name="l00045"></a>00045 <span class="keyword">typedef</span> <a class="code" href="classpattern__support.html">pattern_support<MINING_PROPS></a> <a class="code" href="classpattern__support.html">PAT_SUP</a>;<a name="l00046"></a>00046 <a name="l00047"></a>00047 <a class="code" href="classcount__support.html">count_support</a>(<a class="code" href="classstorage__manager.html">storage_manager<PATTERN, VAT, ALLOC, SM_TYPE ></a> <span class="keyword">const</span>& sm) : _strg_mgr(sm) {} <a name="l00048"></a>00048 <a name="l00049"></a>00049 <span class="comment">// function to count support of candidate patterns</span><a name="l00050"></a>00050 <span class="comment">// cand_supports is populated, num is # of candidates generated</span><a name="l00051"></a>00051 <span class="keywordtype">void</span> count(<a class="code" href="classpattern.html">PATTERN</a>* <span class="keyword">const</span>& p1, <a class="code" href="classpattern.html">PATTERN</a>* <span class="keyword">const</span>& p2, <a class="code" href="classpattern.html">PATTERN</a>** <span class="keyword">const</span>& cand_pats, <span class="keyword">const</span> <span class="keywordtype">int</span>& minsup, <span class="keyword">const</span> <span class="keywordtype">int</span>& num) {<a name="l00052"></a>00052 <a name="l00053"></a>00053 <span class="comment">// invoke storage_mgr's intersect to get VATs and support for candidates</span><a name="l00054"></a>00054 <a class="code" href="classvat.html">VAT</a>** cand_vats; <span class="comment">// pointer to VAT ptrs for candidates</span><a name="l00055"></a>00055 <a class="code" href="classpattern__support.html">PAT_SUP</a>** cand_sups=<span class="keyword">new</span> <a class="code" href="classpattern__support.html">PAT_SUP</a>*[num];<a name="l00056"></a>00056 <a name="l00057"></a>00057 <span class="keywordtype">int</span> i;<a name="l00058"></a>00058 <span class="keywordflow">for</span>(i=0; i<num; i++)<a name="l00059"></a>00059 <span class="keywordflow">if</span>(cand_pats[i])<a name="l00060"></a>00060 cand_sups[i]=<span class="keyword">new</span> <a class="code" href="classpattern__support.html">PAT_SUP</a>;<a name="l00061"></a>00061 <span class="keywordflow">else</span><a name="l00062"></a>00062 cand_sups[i]=0;<a name="l00063"></a>00063 <a name="l00064"></a>00064 <span class="keywordtype">bool</span> is_l2=(p1-><a class="code" href="classpattern.html#a562aa4444ab51addee33f9ab09f1221">size</a>()==1);<a name="l00065"></a>00065 <a name="l00066"></a>00066 <span class="comment">// intersect() is expected to populate the support member </span><a name="l00067"></a>00067 <span class="comment">// of each cand_pat</span><a name="l00068"></a>00068 cand_vats= _strg_mgr.intersect(p1, p2, cand_sups, cand_pats, is_l2);<a name="l00069"></a>00069 <a name="l00070"></a>00070 <span class="comment">// check which candidates were frequent</span><a name="l00071"></a>00071 <span class="comment">// and add their VATs to strg_mgr</span><a name="l00072"></a>00072 <span class="keywordflow">for</span>(i=0;i<num;i++) {<a name="l00073"></a>00073 <span class="keywordflow">if</span>(!cand_pats[i])<a name="l00074"></a>00074 <span class="keywordflow">continue</span>;<a name="l00075"></a>00075 <a name="l00076"></a>00076 <span class="comment">//if(cand_pats[i]->is_valid(minsup))</span><a name="l00077"></a>00077 <span class="keywordflow">if</span>(cand_sups[i]->is_valid(minsup)) {<a name="l00078"></a>00078 cand_pats[i]->set_support(cand_sups[i]);<a name="l00079"></a>00079 _strg_mgr.add_vat(cand_pats[i], cand_vats[i]);<a name="l00080"></a>00080 }<a name="l00081"></a>00081 <span class="keywordflow">else</span> {<a name="l00082"></a>00082 <span class="comment">//reclaim memory</span><a name="l00083"></a>00083 <span class="keyword">delete</span> cand_vats[i];<a name="l00084"></a>00084 }<a name="l00085"></a>00085 <span class="keyword">delete</span> cand_sups[i];<a name="l00086"></a>00086 }<span class="comment">//end for</span><a name="l00087"></a>00087 <a name="l00088"></a>00088 <span class="keyword">delete</span>[] cand_sups;<a name="l00089"></a>00089 <span class="keyword">delete</span>[] cand_vats;<a name="l00090"></a>00090 <a name="l00091"></a>00091 }<span class="comment">//end count()</span><a name="l00092"></a>00092 <a name="l00093"></a>00093 <span class="keywordtype">void</span> delete_vat(<a class="code" href="classpattern.html">PATTERN</a>* <span class="keyword">const</span>& p) {<a name="l00094"></a>00094 _strg_mgr.delete_vat(p);<a name="l00095"></a>00095 }<a name="l00096"></a>00096 <a name="l00097"></a>00097 <span class="keyword">private</span>:<a name="l00098"></a>00098 <a class="code" href="classstorage__manager.html">storage_manager<PATTERN, VAT, ALLOC, SM_TYPE></a> _strg_mgr;<a name="l00099"></a>00099 <a name="l00100"></a>00100 }; <span class="comment">//end class count_support()</span><a name="l00101"></a>00101 <a name="l00102"></a>00102 <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 + -