📄 tree__tokenizer_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_tokenizer.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_tokenizer.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"> * Modifications:</span><a name="l00006"></a>00006 <span class="comment"> * Added tokenizer properties -- Zaki, 5/8/06</span><a name="l00007"></a>00007 <span class="comment"> *</span><a name="l00008"></a>00008 <span class="comment"> * This program is free software; you can redistribute it and/or</span><a name="l00009"></a>00009 <span class="comment"> * modify it under the terms of the GNU General Public License</span><a name="l00010"></a>00010 <span class="comment"> * as published by the Free Software Foundation; either version 2</span><a name="l00011"></a>00011 <span class="comment"> * of the License, or (at your option) any later version.</span><a name="l00012"></a>00012 <span class="comment"> *</span><a name="l00013"></a>00013 <span class="comment"> * This program is distributed in the hope that it will be useful,</span><a name="l00014"></a>00014 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span><a name="l00015"></a>00015 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span><a name="l00016"></a>00016 <span class="comment"> * GNU General Public License for more details.</span><a name="l00017"></a>00017 <span class="comment"> *</span><a name="l00018"></a>00018 <span class="comment"> * You should have received a copy of the GNU General Public License along</span><a name="l00019"></a>00019 <span class="comment"> * with this program; if not, write to the Free Software Foundation, Inc.,</span><a name="l00020"></a>00020 <span class="comment"> * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.</span><a name="l00021"></a>00021 <span class="comment"> */</span><a name="l00022"></a>00022 <span class="comment">// tokenizer for trees</span><a name="l00023"></a>00023 <a name="l00024"></a>00024 <span class="preprocessor">#ifndef _TREE_TOKENIZER_H</span><a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_TOKENIZER_H</span><a name="l00026"></a>00026 <span class="preprocessor"></span><a name="l00027"></a>00027 <span class="preprocessor">#include "pattern.h"</span><a name="l00028"></a>00028 <span class="preprocessor">#include "<a class="code" href="pat__fam_8h.html">pat_fam.h</a>"</span><a name="l00029"></a>00029 <span class="preprocessor">#include "tree_vat.h"</span><a name="l00030"></a>00030 <span class="preprocessor">#include "<a class="code" href="element__parser_8h.html">element_parser.h</a>"</span><a name="l00031"></a>00031 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00032"></a>00032 <span class="preprocessor">#include "tokenizer_utils.h"</span><a name="l00033"></a>00033 <a name="l00041"></a>00041 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> MP, <span class="keyword">typename</span> TP, <span class="keyword">typename</span> PAT_ST, <span class="keyword">template</span><<span class="keyword">typename</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="l00042"></a>00042 template <typename> class ALLOC ><a name="l00043"></a><a class="code" href="classtokenizer_3_01TREE__PATTERN_00_01DMTL__TKNZ__PROP_00_01ALLOC_01_4.html">00043</a> class <a class="code" href="classtokenizer.html">tokenizer</a><TREE_PATTERN, DMTL_TKNZ_PROP, ALLOC ><a name="l00044"></a>00044 {<a name="l00045"></a>00045 <a name="l00046"></a>00046 <span class="keyword">public</span>:<a name="l00047"></a>00047 <span class="keyword">typedef</span> <a class="code" href="classvat.html">vat<TREE_PROP, V_Fkk_MINE_PROP, ALLOC, std::vector></a> <a class="code" href="classvat.html">VAT</a>;<a name="l00048"></a>00048 <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">TREE_INSTANCE</a>;<a name="l00049"></a>00049 <a name="l00050"></a>00050 <a name="l00051"></a>00051 <a class="code" href="classtokenizer.html">tokenizer</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> max=LINE_SZ): MAXLINE(max) {}<a name="l00052"></a>00052 <a name="l00053"></a>00053 <a name="l00060"></a>00060 <span class="keyword">template</span><<span class="keyword">class</span> SM_T><a name="l00061"></a><a class="code" href="classtokenizer_3_01TREE__PATTERN_00_01DMTL__TKNZ__PROP_00_01ALLOC_01_4.html#308c934284dafab3e033ad9eab1f4dc5">00061</a> <span class="keywordtype">int</span> parse_next_trans(ifstream& infile, <a class="code" href="classpat__fam.html">pat_fam<TREE_PATTERN></a>& freq_pats, <a class="code" href="classstorage__manager.html">storage_manager<TREE_PATTERN, VAT, ALLOC, SM_T></a>& vat_hmap) {<a name="l00062"></a>00062 <span class="keywordtype">char</span>* line=<span class="keyword">new</span> <span class="keywordtype">char</span>[MAXLINE];<a name="l00063"></a>00063 <span class="keywordtype">char</span> word[MAXLINE];<a name="l00064"></a>00064 <span class="keywordtype">char</span>* startline=line;<a name="l00065"></a>00065 <span class="keyword">const</span> <span class="keywordtype">int</span> BK_TRK=-1; <span class="comment">// backtrack symbol for trees</span><a name="l00066"></a>00066 <a name="l00067"></a>00067 <span class="keywordtype">int</span> len;<a name="l00068"></a>00068 <span class="keywordtype">int</span> count; <span class="comment">//# of words parsed from line</span><a name="l00069"></a>00069 <span class="keywordtype">int</span> tid=-1;<a name="l00070"></a>00070 <span class="keywordtype">int</span> dfs_id=-1;<a name="l00071"></a>00071 <span class="keywordtype">int</span> num_items=3; <span class="comment">//# of objects on this transaction</span><a name="l00072"></a>00072 <a class="code" href="classvat.html">VAT</a>* tvat;<a name="l00073"></a>00073 TREE_PATTERN* p;<a name="l00074"></a>00074 <span class="keywordtype">int</span> depth; <span class="comment">// maintains current depth in tree</span><a name="l00075"></a>00075 vector<pair<typename TREE_PATTERN::VERTEX_T, pair<int, bool> > > obj_data;<a name="l00076"></a>00076 <span class="comment">// stores info for scope computation for generating level-1 vats</span><a name="l00077"></a>00077 <span class="comment">// the first int in 2nd pair is current scope for pattern</span><a name="l00078"></a>00078 <span class="comment">// bool is if the object is still in scope</span><a name="l00079"></a>00079 <a name="l00080"></a>00080 <span class="keyword">typedef</span> <a class="code" href="classelement__parser.html">element_parser<typename TREE_PATTERN::VERTEX_T></a> V_P;<a name="l00081"></a>00081 <a name="l00082"></a>00082 *line=<span class="charliteral">'\0'</span>;<a name="l00083"></a>00083 infile.getline(line, MAXLINE-1);<a name="l00084"></a>00084 len=strlen(line);<a name="l00085"></a>00085 <span class="keywordflow">if</span>(!len || !line) {<a name="l00086"></a>00086 <span class="keyword">delete</span>[] startline;<a name="l00087"></a>00087 <span class="keywordflow">return</span> -1;<a name="l00088"></a>00088 }<a name="l00089"></a>00089 <a name="l00090"></a>00090 line[len++]=<span class="charliteral">'\0'</span>;<a name="l00091"></a>00091 count=0;<a name="l00092"></a>00092 depth=0;<a name="l00093"></a>00093 <span class="comment">//obj_data.reserve(MAXLINE-1);</span><a name="l00094"></a>00094 <a name="l00095"></a>00095 <span class="keywordflow">while</span>(count<num_items+3 && line<(startline+len)) {<a name="l00096"></a>00096 <span class="keywordflow">if</span>(!(line=parse_word()(line, word))) {<a name="l00097"></a>00097 <span class="comment">//parse_word() failed</span><a name="l00098"></a>00098 <span class="keyword">delete</span>[] startline;<a name="l00099"></a>00099 <span class="keywordflow">return</span> -1;<a name="l00100"></a>00100 }<a name="l00101"></a>00101 count++;<a name="l00102"></a>00102 <a name="l00103"></a>00103 <span class="keywordflow">switch</span>(count) {<a name="l00104"></a>00104 <span class="keywordflow">case</span> 1:<a name="l00105"></a>00105 <span class="comment">//this is tid</span><a name="l00106"></a>00106 tid=atoi(word); <span class="keywordflow">break</span>;<a name="l00107"></a>00107 <a name="l00108"></a>00108 <span class="keywordflow">case</span> 2: <a name="l00109"></a>00109 <span class="comment">//this is cid</span><a name="l00110"></a>00110 <span class="keywordflow">break</span>; <a name="l00111"></a>00111 <span class="keywordflow">case</span> 3:<a name="l00112"></a>00112 <span class="comment">//this is # of elements on line</span><a name="l00113"></a>00113 num_items=atoi(word);⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -