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

📄 seq__vat_8h-source.html

📁 这是一个用于数据挖掘的常用算法的模板库(数据挖掘的C++模板库for UNIX)
💻 HTML
📖 第 1 页 / 共 3 页
字号:
<!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: seq_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>seq_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 _SEQ_VAT_H_</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _SEQ_VAT_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 "seq_instance.h"</span><a name="l00025"></a>00025 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00026"></a>00026 <a name="l00027"></a>00027 <span class="preprocessor">#include "typedefs.h"</span><a name="l00028"></a>00028 <a name="l00035"></a>00035 <span class="keyword">template</span>&lt;<span class="keyword">class</span> PP, <span class="keyword">class</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>VAT_ST &gt;<a name="l00036"></a>00036 ostream&amp; operator&lt;&lt; (ostream&amp; ostr, const vat&lt;SEQ_PROP, V_Fkk_MINE_PROP, ALLOC, VAT_ST&gt;&amp; svat);<a name="l00037"></a>00037 <a name="l00038"></a>00038 <span class="keyword">template</span>&lt;<span class="keyword">class</span> PP, <span class="keyword">class</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>VAT_ST &gt;<a name="l00039"></a>00039 <span class="keyword">class </span><a class="code" href="classvat.html">vat</a>&lt;SEQ_PROP, V_Fkk_EMB_MINE_PROP, ALLOC, VAT_ST&gt; <a name="l00040"></a>00040 {<a name="l00041"></a>00041 <span class="keyword">public</span>:  <a name="l00042"></a>00042   <span class="keyword">typedef</span> <a class="code" href="classpattern__support.html">pattern_support&lt;V_Fkk_EMB_MINE_PROP&gt;</a> PAT_SUP;<a name="l00043"></a>00043   <span class="keyword">typedef</span> <a class="code" href="classvat.html">vat&lt;SEQ_PROP, V_Fkk_EMB_MINE_PROP, ALLOC, VAT_ST&gt;</a> VAT;<a name="l00044"></a>00044   <span class="keyword">typedef</span> <a class="code" href="classseq__instance.html">seq_instance&lt;V_Fkk_EMB_MINE_PROP&gt;</a> INSTANCE;<a name="l00045"></a>00045   <span class="keyword">typedef</span> VAT_ST&lt;pair&lt;int, VAT_ST&lt;INSTANCE, ALLOC&lt;INSTANCE&gt; &gt; &gt;, ALLOC&lt;pair&lt;int, VAT_ST&lt;INSTANCE, ALLOC&lt;INSTANCE&gt; &gt; &gt; &gt; &gt; IDLIST_T;<a name="l00046"></a>00046   <span class="keyword">typedef</span> <span class="keyword">typename</span> IDLIST_T::const_iterator CONST_IT;<a name="l00047"></a>00047   <span class="keyword">typedef</span> <span class="keyword">typename</span> IDLIST_T::iterator IT;<a name="l00048"></a>00048   <a name="l00049"></a>00049   <span class="keyword">typedef</span> VAT_ST&lt;INSTANCE, ALLOC&lt;INSTANCE&gt; &gt; INSTANCES;<a name="l00050"></a>00050   <span class="keyword">typedef</span> <span class="keyword">typename</span> INSTANCES::const_iterator CONST_INST_IT;<a name="l00052"></a>00052     <span class="keywordtype">void</span>* operator new(size_t size) {<a name="l00053"></a>00053       ALLOC&lt;VAT&gt; va;<a name="l00054"></a>00054       <span class="keywordflow">return</span> va.allocate(size);<a name="l00055"></a>00055     }  <a name="l00056"></a>00056     <a name="l00057"></a>00057     <span class="keywordtype">void</span>  operator delete(<span class="keywordtype">void</span> *p, size_t size) {<a name="l00058"></a>00058       <span class="keywordflow">if</span> (p) {<a name="l00059"></a>00059         ALLOC&lt;VAT&gt; va;<a name="l00060"></a>00060         va.deallocate(static_cast&lt;VAT*&gt; (p), size);<a name="l00061"></a>00061       }<a name="l00062"></a>00062     }<a name="l00063"></a>00063     <a name="l00064"></a>00064     <span class="keyword">inline</span> IT begin() {<span class="keywordflow">return</span> _idlist.begin();}<a name="l00065"></a>00065     <span class="keyword">inline</span> CONST_IT begin()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _idlist.begin();}<a name="l00066"></a>00066     <span class="keyword">inline</span> IT end() {<span class="keywordflow">return</span> _idlist.end();}<a name="l00067"></a>00067     <span class="keyword">inline</span> CONST_IT end()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _idlist.end();}<a name="l00068"></a>00068     <a name="l00069"></a>00069     <span class="keywordtype">bool</span> empty()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _idlist.empty;}<a name="l00070"></a>00070     <span class="keywordtype">int</span> size()<span class="keyword"> const</span>{<span class="keywordflow">return</span> _idlist.size();}<a name="l00071"></a>00071     <a name="l00072"></a>00072     <span class="keywordtype">void</span> clear() {_idlist.clear();}<a name="l00073"></a>00073     <a name="l00074"></a>00074     <span class="keywordtype">void</span> push_back(pair&lt;<span class="keywordtype">int</span>, VAT_ST&lt;INSTANCE, ALLOC&lt;INSTANCE&gt; &gt; &gt; <span class="keyword">const</span>&amp; inst) {<a name="l00075"></a>00075       _idlist.push_back(inst);<a name="l00076"></a>00076     }<a name="l00077"></a>00077     <a name="l00078"></a>00078     <span class="comment">// Return the size of the Vat in bytes  </span><a name="l00079"></a>00079     <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> byte_size()<span class="keyword"> const</span>{<a name="l00080"></a>00080       <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span>  b_size=0;<a name="l00081"></a>00081       CONST_IT it;<a name="l00082"></a>00082       <span class="keywordflow">for</span> (it = begin(); it!=end();++it){<a name="l00083"></a>00083         b_size+=(2+it-&gt;second.size())*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>);<a name="l00084"></a>00084       }<a name="l00085"></a>00085       <span class="keywordflow">return</span> b_size;<a name="l00086"></a>00086     }<a name="l00087"></a>00087     <a name="l00088"></a>00088     <span class="comment">//serializing a VAT to an output stream</span><a name="l00089"></a>00089     <span class="keywordtype">void</span> write_file(ostream &amp; output_file) {<a name="l00090"></a>00090       <span class="keywordtype">int</span> ITSZ=<span class="keyword">sizeof</span>(int);<a name="l00091"></a>00091       ostringstream output;<a name="l00092"></a>00092       CONST_IT it;<a name="l00093"></a>00093       CONST_INST_IT it_inst;<a name="l00094"></a>00094       <span class="keywordtype">int</span> tid,inst_sz,ts;<a name="l00095"></a>00095       <span class="keywordflow">for</span> (it=begin();it!=end();it++){<a name="l00096"></a>00096         tid=it-&gt;first;<a name="l00097"></a>00097         inst_sz=it-&gt;second.size();<a name="l00098"></a>00098         output.write(reinterpret_cast&lt;const char *&gt;(&amp;tid), ITSZ);<a name="l00099"></a>00099         output.write(reinterpret_cast&lt;const char *&gt;(&amp;inst_sz), ITSZ);<a name="l00100"></a>00100         <span class="keywordflow">for</span> (it_inst =it-&gt;second.begin(); it_inst!=it-&gt;second.end(); ++it_inst){<a name="l00101"></a>00101           ts=it_inst-&gt;get_ts();  <a name="l00102"></a>00102           output.write(reinterpret_cast&lt;const char *&gt;(&amp;ts), ITSZ);<a name="l00103"></a>00103         } <span class="comment">//for it_inst</span><a name="l00104"></a>00104       }<span class="comment">//it</span><a name="l00105"></a>00105       output_file.write(output.str().c_str(), output.str().size());<a name="l00106"></a>00106     } <span class="comment">//end write_file</span><a name="l00107"></a>00107     <a name="l00108"></a>00108     <a name="l00109"></a>00109     <span class="comment">//deserialize a vat from an input stream </span><a name="l00110"></a>00110     <span class="keywordtype">void</span> read_file (istream &amp; input, <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> size) {<a name="l00111"></a>00111       <span class="comment">//cout&lt;&lt;"reading from the the file"&lt;&lt;endl;</span><a name="l00112"></a>00112       <span class="keywordtype">int</span> ITSZ=<span class="keyword">sizeof</span>(int);<a name="l00113"></a>00113       <span class="keywordtype">int</span> buf_size=size/ITSZ;   <a name="l00114"></a>00114       <span class="keywordtype">int</span> *buf = <span class="keyword">new</span> <span class="keywordtype">int</span>[buf_size];<a name="l00115"></a>00115       input.read((<span class="keywordtype">char</span> *)buf, (size)); <a name="l00116"></a>00116       <span class="keywordtype">int</span> current=0;<a name="l00117"></a>00117       <span class="keywordflow">while</span>(current&lt;buf_size){<a name="l00118"></a>00118         <span class="keywordtype">int</span> tid=buf[current++];<a name="l00119"></a>00119         <span class="keywordtype">int</span> inst_sz=buf[current++];<a name="l00120"></a>00120         <span class="keywordtype">int</span> inst_end=current+inst_sz;<a name="l00121"></a>00121         INSTANCES new_tidlist;<a name="l00122"></a>00122         <span class="keywordflow">while</span>(current &lt;inst_end){<a name="l00123"></a>00123           new_tidlist.push_back(INSTANCE(buf[current++]));<a name="l00124"></a>00124         }<a name="l00125"></a>00125         _idlist.push_back(make_pair(tid, new_tidlist));<a name="l00126"></a>00126       }      

⌨️ 快捷键说明

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