📄 tree__vat_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_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 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_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 <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">// tree VAT classes</span><a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="preprocessor">#ifndef _TREE_VAT_H</span><a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_VAT_H</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="preprocessor">#include <vector></span><a name="l00026"></a>00026 <span class="preprocessor">#include <utility></span><a name="l00027"></a>00027 <span class="preprocessor">#include <sstream></span><a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="preprocessor">#include "pattern.h"</span><a name="l00030"></a>00030 <span class="preprocessor">#include "pat_support.h"</span><a name="l00031"></a>00031 <span class="preprocessor">#include "tree_instance.h"</span><a name="l00032"></a>00032 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00033"></a>00033 <a name="l00034"></a>00034 <span class="keyword">using namespace </span>std;<a name="l00035"></a>00035 <a name="l00036"></a>00036 <a name="l00037"></a>00037 <span class="comment">/*</span><a name="l00038"></a>00038 <span class="comment">template<typename PP, typename MP, template <typename> class ALLOC,</span><a name="l00039"></a>00039 <span class="comment"> template<typename, typename> class ST></span><a name="l00040"></a>00040 <span class="comment">class vat<TREE_PROP, V_Fkk_EMB_MINE_PROP, ALLOC, ST>;</span><a name="l00041"></a>00041 <span class="comment"></span><a name="l00042"></a>00042 <span class="comment">template<typename PP, typename MP, template <typename> class ALLOC,</span><a name="l00043"></a>00043 <span class="comment"> template<typename, typename> class ST></span><a name="l00044"></a>00044 <span class="comment">class vat<TREE_PROP, V_Fkk_IND_MINE_PROP, ALLOC, ST>;</span><a name="l00045"></a>00045 <span class="comment">template<typename PP, typename MP, template <typename> class ALLOC,</span><a name="l00046"></a>00046 <span class="comment"> template<typename, typename> class VAT_ST></span><a name="l00047"></a>00047 <span class="comment">ostream& operator<< (ostream& ostr, const vat<TREE_PROP, V_Fkk_EMB_MINE_PROP, ALLOC, VAT_ST>*);</span><a name="l00048"></a>00048 <span class="comment"></span><a name="l00049"></a>00049 <span class="comment">template<typename PP, typename MP, template <typename> class ALLOC,</span><a name="l00050"></a>00050 <span class="comment"> template<typename, typename> class VAT_ST></span><a name="l00051"></a>00051 <span class="comment">ostream& operator<< (ostream& ostr, const vat<TREE_PROP, V_Fkk_IND_MINE_PROP, ALLOC, VAT_ST>*);</span><a name="l00052"></a>00052 <span class="comment">*/</span><a name="l00053"></a>00053 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> MP, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC,<a name="l00054"></a>00054 <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>> <span class="keyword">class </span>VAT_ST><a name="l00055"></a>00055 ostream& operator<< (ostream& ostr, const vat<TREE_PROP, V_Fkk_MINE_PROP, ALLOC, VAT_ST>* );<a name="l00063"></a>00063 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> MP, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC, <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>> <span class="keyword">class </span>VAT_ST><a name="l00064"></a><a class="code" href="classvat_3_01TREE__PROP_00_01V__Fkk__EMB__MINE__PROP_00_01ALLOC_00_01VAT__ST_01_4.html">00064</a> <span class="keyword">class </span><a class="code" href="classvat.html">vat</a><TREE_PROP, V_Fkk_EMB_MINE_PROP, ALLOC, VAT_ST><a name="l00065"></a>00065 {<a name="l00066"></a>00066 <a name="l00067"></a>00067 <span class="keyword">public</span>:<a name="l00068"></a>00068 <span class="keyword">template</span><<span class="keyword">typename</span> T1, <span class="keyword">typename</span> A><a name="l00069"></a>00069 <span class="keyword">class </span>ST: <span class="keyword">public</span> VAT_ST<T1, A> {};<a name="l00070"></a>00070 <a name="l00071"></a>00071 <span class="keyword">typedef</span> <a class="code" href="classpattern__support.html">pattern_support<V_Fkk_EMB_MINE_PROP ></a> <a class="code" href="classpattern__support.html">PAT_SUP</a>;<a name="l00072"></a>00072 <span class="keyword">typedef</span> <a class="code" href="classvat.html">vat<TREE_PROP, V_Fkk_EMB_MINE_PROP, ALLOC, VAT_ST></a> <a class="code" href="classvat_3_01TREE__PROP_00_01V__Fkk__EMB__MINE__PROP_00_01ALLOC_00_01VAT__ST_01_4.html">VAT</a>;<a name="l00073"></a>00073 <span class="keyword">typedef</span> <a class="code" href="classtree__instance.html">tree_instance<std::vector, PP></a> <a class="code" href="classtree__instance.html">INSTANCE</a>;<a name="l00074"></a>00074 <span class="keyword">typedef</span> VAT_ST<pair<int, VAT_ST<INSTANCE, ALLOC<INSTANCE> > >, ALLOC<pair<int, VAT_ST<INSTANCE, ALLOC<INSTANCE> > > > > IDLIST_T;<a name="l00075"></a>00075 <span class="keyword">typedef</span> <span class="keyword">typename</span> IDLIST_T::const_iterator CONST_IT;<a name="l00076"></a>00076 <span class="keyword">typedef</span> <span class="keyword">typename</span> IDLIST_T::iterator IT;<a name="l00077"></a>00077 <span class="keyword">typedef</span> <span class="keyword">typename</span> VAT_ST<INSTANCE, ALLOC<INSTANCE> >::const_iterator CONST_INST_IT;<a name="l00078"></a>00078 <span class="keyword">typedef</span> VAT_ST<INSTANCE, ALLOC<INSTANCE> > INSTANCES;<a name="l00079"></a>00079 <span class="keyword">typedef</span> <span class="keyword">typename</span> VAT_ST<INSTANCE, ALLOC<INSTANCE> >::iterator INST_IT;<a name="l00080"></a>00080 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<int>::const_iterator CONST_STORE_IT;<a name="l00081"></a>00081 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<int>::iterator STORE_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<VAT> 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<VAT> v;<a name="l00091"></a>00091 v.deallocate(static_cast<VAT*> (p), size);<a name="l00092"></a>00092 }<a name="l00093"></a>00093 }<a name="l00094"></a>00094 <a name="l00095"></a>00095 <a name="l00096"></a>00096 IT begin() {<span class="keywordflow">return</span> _idlist.begin();}<a name="l00097"></a>00097 CONST_IT begin()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _idlist.begin();}<a name="l00098"></a>00098 IT end() {<span class="keywordflow">return</span> _idlist.end();}<a name="l00099"></a>00099 CONST_IT end()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _idlist.end();}<a name="l00100"></a>00100 <a name="l00101"></a>00101 <span class="keywordtype">bool</span> empty()<span class="keyword"> const </span>{<span class="keywordflow">return</span> _idlist.empty();}<a name="l00102"></a>00102 <span class="keywordtype">int</span> size() {<span class="keywordflow">return</span> _idlist.size();}<a name="l00103"></a>00103 <a name="l00105"></a><a class="code" href="classvat_3_01TREE__PROP_00_01V__Fkk__EMB__MINE__PROP_00_01ALLOC_00_01VAT__ST_01_4.html#8b2a704967f4a1a09cb096b2d68d0436">00105</a> <span class="keywordtype">void</span> push_back(<span class="keyword">const</span> pair<<span class="keywordtype">int</span>, VAT_ST<<a class="code" href="classtree__instance.html">INSTANCE</a>, ALLOC<INSTANCE> > >& val) {<a name="l00106"></a>00106 _idlist.push_back(val);<a name="l00107"></a>00107 }<a name="l00108"></a>00108 <a name="l00109"></a>00109 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> byte_size()<span class="keyword"> const</span>{<a name="l00110"></a>00110 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> b_size=0;<a name="l00111"></a>00111 CONST_IT it;<a name="l00112"></a>00112 CONST_INST_IT it_inst;<a name="l00113"></a>00113 <span class="comment">//for each instance we will store 5 integer (1 for the vector size) and the vector</span><a name="l00114"></a>00114 <span class="keywordflow">for</span> (it = begin(); it!=end();++it){<a name="l00115"></a>00115 b_size+=2*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>);<a name="l00116"></a>00116 <span class="keywordflow">for</span> (it_inst=it->second.begin();it_inst!=it->second.end();++it_inst)<a name="l00117"></a>00117 b_size+=(it_inst->get_ml_size()+5)*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>);<a name="l00118"></a>00118 }<a name="l00119"></a>00119 <span class="keywordflow">return</span> b_size;<a name="l00120"></a>00120 }<a name="l00121"></a>00121 <a name="l00122"></a>00122 <span class="comment">//writing a VAT to a binary file</span><a name="l00123"></a>00123 <span class="keywordtype">void</span> write_file(ostream & output_file) {<a name="l00124"></a>00124 <span class="keywordtype">int</span> ITSZ=<span class="keyword">sizeof</span>(int);<a name="l00125"></a>00125 ostringstream output;<a name="l00126"></a>00126 CONST_IT it;<a name="l00127"></a>00127 CONST_INST_IT it_inst;<a name="l00128"></a>00128 CONST_STORE_IT it_store;<a name="l00129"></a>00129 <span class="keywordtype">int</span> tid,inst_sz,ml_sz,_lb,_ub,_depth,_type;<a name="l00130"></a>00130 <span class="keywordflow">for</span> (it=begin();it!=end();++it){<a name="l00131"></a>00131 tid=it->first;<a name="l00132"></a>00132 inst_sz=it->second.size();<a name="l00133"></a>00133 output.write(reinterpret_cast<const char *>(&tid), ITSZ);<a name="l00134"></a>00134 output.write(reinterpret_cast<const char *>(&inst_sz), ITSZ);<a name="l00135"></a>00135 <span class="keywordflow">for</span> (it_inst =it->second.begin(); it_inst!=it->second.end(); ++it_inst){<a name="l00136"></a>00136 ml_sz=it_inst->get_ml_size();⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -