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

📄 mset__operators_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: mset_operators.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>mset_operators.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 _MSET_OPERATORS_H_</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _MSET_OPERATORS_H_</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include&lt;ostream&gt;</span><a name="l00024"></a>00024 <span class="keyword">using namespace </span>std;<a name="l00025"></a>00025 <a name="l00026"></a>00026 <span class="preprocessor">#include "typedefs.h"</span><a name="l00027"></a>00027 <a name="l00028"></a>00028 <span class="keyword">template</span>&lt;<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> 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="l00029"></a>00029          template &lt;typename&gt; class ALLOC &gt;<a name="l00030"></a>00030 class <a class="code" href="classpattern.html">pattern</a>;<a name="l00031"></a>00031 <a name="l00032"></a>00032 <span class="keyword">template</span>&lt;<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> PAT_ST, <span class="keyword">template</span>&lt;<span class="keyword">typename</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="l00033"></a>00033          template &lt;typename&gt; class ALLOC &gt;<a name="l00034"></a>00034 ostream&amp; operator&lt;&lt; (ostream&amp; ostr, <span class="keyword">const</span> MSET_PATTERN* p) {<a name="l00035"></a>00035   <span class="keyword">typename</span> MSET_PATTERN::CONST_IT it;<a name="l00036"></a>00036 <a name="l00037"></a>00037   <span class="keywordflow">for</span>(it=p-&gt;begin(); it!=p-&gt;end(); it++) {<a name="l00038"></a>00038 <a name="l00039"></a>00039     <span class="keywordflow">if</span>(it == p-&gt;begin()) {<a name="l00040"></a>00040       ostr &lt;&lt; (*it).v;<a name="l00041"></a>00041     } <span class="keywordflow">else</span> {<a name="l00042"></a>00042       ostr &lt;&lt; <span class="stringliteral">" "</span> &lt;&lt; (*it).v;<a name="l00043"></a>00043     }<a name="l00044"></a>00044   }<a name="l00045"></a>00045 <a name="l00046"></a>00046    ostr &lt;&lt;<span class="stringliteral">" -- "</span>&lt;&lt;p-&gt;_pat_sup; <a name="l00047"></a>00047 <a name="l00048"></a>00048    <span class="keywordflow">return</span> ostr;<a name="l00049"></a>00049 }<a name="l00050"></a>00050 <a name="l00051"></a>00051 <span class="preprocessor">#include "pattern.h"</span><a name="l00052"></a>00052 <a name="l00053"></a>00053 <a name="l00054"></a>00054 <span class="keyword">template</span>&lt;<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</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="l00055"></a>00055          template &lt;typename&gt; class ALLOC &gt;<a name="l00056"></a>00056 bool pattern&lt;PP,MP,PAT_ST,CC, ALLOC&gt;::operator&lt; (const pattern&lt;PP,MP,PAT_ST,CC, ALLOC&gt; rhs) const {<a name="l00057"></a>00057 <a name="l00058"></a>00058   CONST_IT it=begin(), rhs_it=rhs.begin();<a name="l00059"></a>00059 <a name="l00060"></a>00060   if(size()!=rhs.size()) {<a name="l00061"></a>00061     cerr&lt;&lt;"Sequences are not of the same size."&lt;&lt;endl;<a name="l00062"></a>00062     exit(0);<a name="l00063"></a>00063   }<a name="l00064"></a>00064 <a name="l00065"></a>00065   while(it!=end() &amp;&amp; rhs_it!=rhs.end()) {<a name="l00066"></a>00066     if((*it).v != (*rhs_it).v)<a name="l00067"></a>00067       return (*it) &lt; (*rhs_it);<a name="l00068"></a>00068 <a name="l00069"></a>00069     it++;<a name="l00070"></a>00070     rhs_it++;<a name="l00071"></a>00071   }<span class="comment">//end outer while</span><a name="l00072"></a>00072   <a name="l00073"></a>00073   <span class="comment">//if execuion reaches this point then sequences are equal</span><a name="l00074"></a>00074   return false;<a name="l00075"></a>00075 }<a name="l00076"></a>00076 <a name="l00077"></a>00077 #endif</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 + -