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

📄 helper__funs_8h-source.html

📁 这是一个用于数据挖掘的常用算法的模板库(数据挖掘的C++模板库for UNIX)
💻 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: helper_funs.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>helper_funs.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 _HELPER_FUNS_H_</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _HELPER_FUNS_H_</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#define HASHNS __gnu_cxx</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="comment">//#include "pattern.h"</span><a name="l00026"></a>00026 <a name="l00031"></a><a class="code" href="structeqstr.html">00031</a> <span class="keyword">struct </span><a class="code" href="structeqstr.html">eqstr</a><a name="l00032"></a>00032 {<a name="l00037"></a><a class="code" href="structeqstr.html#eaa5304f3a78d29601f6103fed3a5e54">00037</a>   <span class="keywordtype">bool</span> <a class="code" href="structeqstr.html#eaa5304f3a78d29601f6103fed3a5e54">operator()</a>(<span class="keyword">const</span> <span class="keywordtype">char</span>* s1, <span class="keyword">const</span> <span class="keywordtype">char</span>* s2)<span class="keyword"> const </span>{<a name="l00038"></a>00038     <span class="keywordflow">return</span> strcmp(s1, s2) == 0;<a name="l00039"></a>00039   }<a name="l00040"></a>00040 }; <span class="comment">//end struct eqstr</span><a name="l00041"></a>00041 <a name="l00046"></a><a class="code" href="structeqint.html">00046</a> <span class="keyword">struct </span><a class="code" href="structeqint.html">eqint</a><a name="l00047"></a>00047 {<a name="l00052"></a><a class="code" href="structeqint.html#e8d67831e565d1badf4f9e99a6cadcbc">00052</a>   <span class="keywordtype">bool</span> <a class="code" href="structeqint.html#e8d67831e565d1badf4f9e99a6cadcbc">operator()</a>(<span class="keywordtype">int</span> i1, <span class="keywordtype">int</span> i2)<span class="keyword"> const </span>{<a name="l00053"></a>00053     <span class="keywordflow">return</span> i1 == i2;<a name="l00054"></a>00054   }<a name="l00055"></a>00055 }; <span class="comment">//end struct eqint</span><a name="l00056"></a>00056 <a name="l00061"></a>00061 <span class="keyword">template</span>&lt;<span class="keyword">class</span> PAT&gt;<a name="l00062"></a><a class="code" href="structless__than.html">00062</a> <span class="keyword">struct </span><a class="code" href="structless__than.html">less_than</a><a name="l00063"></a>00063 {<a name="l00064"></a>00064    <span class="keywordtype">bool</span> operator() (<span class="keyword">const</span> PAT* p1, <span class="keyword">const</span> PAT* p2)<span class="keyword"> const </span>{<a name="l00065"></a>00065      <span class="keywordflow">return</span> (*p1 &lt; *p2);<a name="l00066"></a>00066    }<a name="l00067"></a>00067 };<a name="l00068"></a>00068 <a name="l00069"></a>00069 <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&nbsp;<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 + -