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

📄 graph__tokenizer_8h-source.html

📁 这是一个用于数据挖掘的常用算法的模板库(数据挖掘的C++模板库for UNIX)
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<!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_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&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_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 &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"> *  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="preprocessor">#ifndef _GRAPH_TOKENIZER_H</span><a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _GRAPH_TOKENIZER_H</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="preprocessor">#include &lt;fstream&gt;</span><a name="l00026"></a>00026 <span class="preprocessor">#include "graph_vat.h"</span><a name="l00027"></a>00027 <span class="preprocessor">#include "<a class="code" href="element__parser_8h.html">element_parser.h</a>"</span><a name="l00028"></a>00028 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00029"></a>00029 <span class="preprocessor">#include "tokenizer_utils.h"</span><a name="l00030"></a>00030 <a name="l00031"></a>00031 <span class="keyword">using namespace </span>std;<a name="l00032"></a>00032 <a name="l00033"></a>00033 <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">typename</span> TP, <span class="keyword">typename</span> PAT_ST, <span class="keyword">template</span>&lt;<span class="keyword">class</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">template</span> &lt;<span class="keyword">typename</span>&gt; <span class="keyword">class</span>&gt; <span class="keyword">class </span>CC, <a name="l00042"></a>00042 template &lt;typename&gt; class ALLOC &gt;<a name="l00043"></a><a class="code" href="classtokenizer_3_01GRAPH__PATTERN_00_01DMTL__TKNZ__PROP_00_01ALLOC_01_4.html">00043</a> class <a class="code" href="classtokenizer.html">tokenizer</a>&lt;GRAPH_PATTERN, DMTL_TKNZ_PROP, ALLOC &gt;<a name="l00044"></a>00044 {<a name="l00045"></a>00045 <span class="keyword">public</span>:<a name="l00046"></a>00046   <span class="keyword">typedef</span> <a class="code" href="classvat.html">vat&lt;GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, std::vector &gt;</a> <a class="code" href="classvat.html">VAT</a>;<a name="l00047"></a>00047   <a name="l00048"></a><a class="code" href="classtokenizer_3_01GRAPH__PATTERN_00_01DMTL__TKNZ__PROP_00_01ALLOC_01_4.html#6b534e815d9b7bc6db390545b83f9ed5">00048</a>   <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="l00055"></a>00055   <span class="keyword">template</span>&lt;<span class="keyword">class</span> SM_T&gt;<a name="l00056"></a><a class="code" href="classtokenizer_3_01GRAPH__PATTERN_00_01DMTL__TKNZ__PROP_00_01ALLOC_01_4.html#d0518f28456a0e7448ea7a54a108a2d4">00056</a>   <span class="keywordtype">int</span> parse_next_trans(ifstream&amp; infile, <a class="code" href="classpat__fam.html">pat_fam&lt;GRAPH_PATTERN&gt;</a>&amp; freq_pats, <a class="code" href="classstorage__manager.html">storage_manager</a>&lt;GRAPH_PATTERN, <a name="l00057"></a>00057                        <a class="code" href="classvat.html">VAT</a>, ALLOC, SM_T&gt;&amp; vat_hmap) {<a name="l00058"></a>00058     <span class="keywordtype">char</span>* line=<span class="keyword">new</span> <span class="keywordtype">char</span>[MAXLINE];<a name="l00059"></a>00059     <span class="keywordtype">char</span> word[MAXLINE];<a name="l00060"></a>00060     <span class="keywordtype">char</span>* startline=line;<a name="l00061"></a>00061     <a name="l00062"></a>00062     <span class="keywordtype">int</span> len;<a name="l00063"></a>00063     <span class="keywordtype">int</span> count; <span class="comment">//# of words parsed from line</span><a name="l00064"></a>00064     <span class="keywordtype">int</span> tid=-1;<a name="l00065"></a>00065     <span class="keywordtype">int</span> num_items=-1; <span class="comment">//# of words to be read from this line</span><a name="l00066"></a>00066     <span class="keywordtype">int</span> pos; <span class="comment">//stores starting position of input stream's get pointer</span><a name="l00067"></a>00067     <a class="code" href="classvat.html">VAT</a>* gvat;<a name="l00068"></a>00068     GRAPH_PATTERN* g1;<a name="l00069"></a>00069     <a name="l00070"></a>00070     map&lt;int, typename GRAPH_PATTERN::VERTEX_T&gt; vid_to_lbl; <span class="comment">// map from vertex-id </span><a name="l00071"></a>00071                                  <span class="comment">// to its label</span><a name="l00072"></a>00072     <span class="keyword">typename</span> map&lt;int, typename GRAPH_PATTERN::VERTEX_T&gt;::iterator tmp_it;<a name="l00073"></a>00073     <a name="l00074"></a>00074     <span class="keywordflow">while</span>(1) {<a name="l00075"></a>00075       pos=infile.tellg();<a name="l00076"></a>00076       line=startline;<a name="l00077"></a>00077       *line=<span class="charliteral">'\0'</span>;<a name="l00078"></a>00078       infile.getline(line, MAXLINE-1);<a name="l00079"></a>00079       len=strlen(line);<a name="l00080"></a>00080       <span class="keywordflow">if</span>(!len || !line) {<a name="l00081"></a>00081         <span class="keyword">delete</span>[] startline;<a name="l00082"></a>00082         <span class="keywordflow">return</span> tid;<a name="l00083"></a>00083       }<a name="l00084"></a>00084       <a name="l00085"></a>00085       line[len++]=<span class="charliteral">'\0'</span>;<a name="l00086"></a>00086       count=0;<a name="l00087"></a>00087       <a name="l00088"></a>00088       <span class="keywordflow">if</span>(line[0]==<span class="charliteral">'#'</span>) <span class="comment">// comment line</span><a name="l00089"></a>00089         <span class="keywordflow">continue</span>;<a name="l00090"></a>00090       <a name="l00091"></a>00091       <span class="keywordflow">if</span>(!(line=parse_word()(line, word))) {<a name="l00092"></a>00092         <span class="comment">//parse_word() failed</span><a name="l00093"></a>00093         <span class="keyword">delete</span>[] startline;<a name="l00094"></a>00094         <span class="keywordflow">return</span> -1;<a name="l00095"></a>00095       }<a name="l00096"></a>00096       <a name="l00097"></a>00097       <span class="keywordflow">if</span>(word[0]==<span class="charliteral">'t'</span>) { <span class="comment">// this is the tid line</span><a name="l00098"></a>00098         <span class="keywordflow">if</span>(tid!=-1) { <span class="comment">// this is a new tid, stop here</span><a name="l00099"></a>00099           infile.seekg(pos);<a name="l00100"></a>00100           <span class="keyword">delete</span>[] startline;<a name="l00101"></a>00101           <span class="keywordflow">return</span> tid; <span class="comment">// this is the line from where function should </span><a name="l00102"></a>00102                 <span class="comment">// return on most calls </span><a name="l00103"></a>00103         }<a name="l00104"></a>00104         <a name="l00105"></a>00105         line=parse_word()(line, word); <span class="comment">// read in the '#'</span><a name="l00106"></a>00106         <span class="keywordflow">if</span>(!line) {<a name="l00107"></a>00107           <span class="comment">//parse_word() failed</span><a name="l00108"></a>00108           <span class="keyword">delete</span>[] startline;<a name="l00109"></a>00109           <span class="keywordflow">return</span> -1;<a name="l00110"></a>00110         }<a name="l00111"></a>00111         <a name="l00112"></a>00112         line=parse_word()(line, word); <span class="comment">// read in the tid</span><a name="l00113"></a>00113         <span class="keywordflow">if</span>(!line) {<a name="l00114"></a>00114           <span class="comment">//parse_word() failed</span><a name="l00115"></a>00115           <span class="keyword">delete</span>[] startline;<a name="l00116"></a>00116           <span class="keywordflow">return</span> -1;<a name="l00117"></a>00117         }<a name="l00118"></a>00118         tid=atoi(word);<a name="l00119"></a>00119         <a name="l00120"></a>00120       }<span class="comment">//if word[0]=='t'</span><a name="l00121"></a>00121       <span class="keywordflow">else</span> <span class="keywordflow">if</span>(word[0]==<span class="charliteral">'v'</span>) { <span class="comment">// this is a vid-line</span><a name="l00122"></a>00122         num_items=2; <span class="comment">// 2 more words to be parsed from this line</span><a name="l00123"></a>00123         <span class="keywordtype">int</span> vid=0;<a name="l00124"></a>00124         <span class="keyword">typename</span> GRAPH_PATTERN::VERTEX_T v_lbl;<a name="l00125"></a>00125         <a name="l00126"></a>00126         <span class="keywordflow">while</span>(count&lt;num_items) {

⌨️ 快捷键说明

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