📄 element__parser_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: element_parser.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>element_parser.h</h1><a href="element__parser_8h.html">Go to the documentation of this file.</a><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="l00023"></a>00023 <span class="preprocessor">#ifndef _ELEMENT_PARSER</span><a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#define _ELEMENT_PARSER</span><a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor">#include<sstream></span><a name="l00026"></a>00026 <span class="preprocessor">#include "helper_funs.h"</span><a name="l00027"></a>00027 <a name="l00034"></a>00034 <span class="keyword">template</span><<span class="keyword">typename</span> P><a name="l00035"></a><a class="code" href="classelement__parser.html">00035</a> <span class="keyword">class </span><a class="code" href="classelement__parser.html">element_parser</a> {};<a name="l00036"></a>00036 <a name="l00041"></a>00041 <span class="keyword">template</span><><a name="l00042"></a><a class="code" href="classelement__parser_3_01int_01_4.html">00042</a> <span class="keyword">class </span><a class="code" href="classelement__parser.html">element_parser</a><int><a name="l00043"></a>00043 {<a name="l00044"></a>00044 <a name="l00045"></a>00045 <span class="keyword">public</span>:<a name="l00046"></a>00046 <a name="l00047"></a><a class="code" href="classelement__parser_3_01int_01_4.html#734b899a2ef6d2bb361c99b434c8fc4c">00047</a> <span class="keyword">typedef</span> <span class="keywordtype">int</span> OBJ_T; <a name="l00048"></a>00048 <span class="keyword">typedef</span> <span class="keywordtype">int</span> HASH_TYPE; <span class="comment">// Input type for the hash function.</span><a name="l00049"></a>00049 <span class="keyword">typedef</span> <a class="code" href="structeqint.html">eqint</a> <a class="code" href="structeqint.html">COMP_FUNC</a>; <span class="comment">// Comparison function.</span><a name="l00050"></a>00050 <a name="l00056"></a><a class="code" href="classelement__parser_3_01int_01_4.html#c724e77181f7833ba31f71c203d17ef8">00056</a> <span class="keyword">static</span> <span class="keyword">inline</span> OBJ_T parse_element(<span class="keywordtype">char</span>* word) { <a name="l00057"></a>00057 <span class="keywordflow">return</span> atoi(word);<a name="l00058"></a>00058 }<a name="l00059"></a>00059 <a name="l00060"></a>00060 <span class="keyword">static</span> <span class="keyword">const</span> OBJ_T& convert(<span class="keyword">const</span> <span class="keywordtype">int</span>& i) {<a name="l00061"></a>00061 <a name="l00062"></a>00062 <span class="keywordflow">return</span> i;<a name="l00063"></a>00063 }<a name="l00064"></a>00064 <a name="l00065"></a>00065 <span class="keyword">static</span> <span class="keywordtype">bool</span> notEq(<span class="keyword">const</span> <span class="keywordtype">int</span>& i1, <span class="keyword">const</span> <span class="keywordtype">int</span>& i2) {<a name="l00066"></a>00066 <span class="keywordflow">return</span> !(i1 == i2);<a name="l00067"></a>00067 }<a name="l00068"></a>00068 <a name="l00069"></a>00069 <span class="keyword">static</span> <span class="keyword">const</span> HASH_TYPE& conv_hash_type(<span class="keyword">const</span> OBJ_T& s) {<a name="l00070"></a>00070 <span class="keywordflow">return</span> s;<a name="l00071"></a>00071 }<a name="l00072"></a>00072 <a name="l00073"></a>00073 <a name="l00074"></a>00074 };<span class="comment">//end clas element_parser<int></span><a name="l00075"></a>00075 <a name="l00079"></a>00079 <span class="keyword">template</span><><a name="l00080"></a><a class="code" href="classelement__parser_3_01std_1_1string_01_4.html">00080</a> <span class="keyword">class </span><a class="code" href="classelement__parser.html">element_parser</a><std::string><a name="l00081"></a>00081 {<a name="l00082"></a>00082 <a name="l00083"></a>00083 <span class="keyword">public</span>:<a name="l00084"></a>00084 <a name="l00085"></a><a class="code" href="classelement__parser_3_01std_1_1string_01_4.html#60affa8b123524756192cd699134c372">00085</a> <span class="keyword">typedef</span> std::string OBJ_T; <a name="l00086"></a>00086 <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* HASH_TYPE; <span class="comment">// Input type for the hash function.</span><a name="l00087"></a>00087 <span class="keyword">typedef</span> <a class="code" href="structeqstr.html">eqstr</a> <a class="code" href="structeqstr.html">COMP_FUNC</a>; <span class="comment">// Comparison function.</span><a name="l00088"></a>00088 <a name="l00094"></a>00094 <span class="keyword">static</span> <span class="keyword">inline</span> OBJ_T parse_element(<span class="keyword">const</span> <span class="keywordtype">char</span>* word) { <a name="l00095"></a>00095 <span class="keywordflow">return</span> std::string(word);<a name="l00096"></a>00096 }<a name="l00097"></a>00097 <a name="l00098"></a>00098 <span class="keyword">static</span> OBJ_T convert(<span class="keyword">const</span> <span class="keywordtype">char</span>* s) {<a name="l00099"></a>00099 <span class="keywordflow">return</span> parse_element(s);<a name="l00100"></a>00100 }<a name="l00101"></a>00101 <a name="l00102"></a>00102 <span class="keyword">static</span> OBJ_T convert(<span class="keyword">const</span> <span class="keywordtype">int</span> i) {<a name="l00103"></a>00103 std::ostringstream t_ss;<a name="l00104"></a>00104 t_ss << i;<a name="l00105"></a>00105 <a name="l00106"></a>00106 <span class="keywordflow">return</span> t_ss.str();<a name="l00107"></a>00107 }<a name="l00108"></a>00108 <a name="l00109"></a>00109 <span class="keyword">static</span> <span class="keywordtype">bool</span> notEq(<span class="keyword">const</span> std::string s1, <span class="keyword">const</span> std::string s2) {<a name="l00110"></a>00110 <span class="keywordflow">return</span> !(s1 == s2);<a name="l00111"></a>00111 }<a name="l00112"></a>00112 <a name="l00113"></a>00113 <span class="keyword">static</span> HASH_TYPE conv_hash_type(<span class="keyword">const</span> OBJ_T& s) {<a name="l00114"></a>00114 <span class="keywordflow">return</span> s.c_str();<a name="l00115"></a>00115 }<a name="l00116"></a>00116 <a name="l00117"></a>00117 };<span class="comment">//end clas element_parser<std::string></span><a name="l00118"></a>00118 <a name="l00119"></a>00119 <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 + -