📄 level__one__hmap_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: level_one_hmap.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>level_one_hmap.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"> *</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 _LEVEL_ONE_HMAP_H</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _LEVEL_ONE_HMAP_H</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include <ext/hash_map></span><a name="l00024"></a>00024 <span class="preprocessor">#include <ext/hash_set></span><a name="l00025"></a>00025 <span class="preprocessor">#include <iostream></span><a name="l00026"></a>00026 <span class="preprocessor">#include <utility></span><a name="l00027"></a>00027 <a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="keyword">using namespace </span>std;<a name="l00030"></a>00030 <a name="l00036"></a>00036 <span class="keyword">template</span><<span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC=std::allocator ><a name="l00037"></a><a class="code" href="classlevel__one__hmap.html">00037</a> <span class="keyword">class </span><a class="code" href="classlevel__one__hmap.html">level_one_hmap</a><a name="l00038"></a>00038 {<a name="l00039"></a>00039 <span class="keyword">public</span>:<a name="l00040"></a>00040 <span class="keyword">typedef</span> <a class="code" href="classelement__parser.html">element_parser<V_T></a> <a class="code" href="classelement__parser.html">V_EP</a>;<a name="l00041"></a>00041 <a name="l00042"></a>00042 <span class="comment">// typedef HASHNS::hash_set<E_T, HASHNS::hash<E_T>, std::equal_to<E_T>, ALLOC<const E_T> > LABELS;</span><a name="l00043"></a>00043 <span class="keyword">typedef</span> HASHNS::hash_set<E_T, HASHNS::hash<E_T>, std::equal_to<E_T>, ALLOC<E_T> > LABELS;<a name="l00044"></a>00044 <span class="keyword">typedef</span> HASHNS::hash_map<typename V_EP::HASH_TYPE, LABELS, HASHNS::hash<typename V_EP::HASH_TYPE>, <a name="l00045"></a>00045 <span class="comment">// typename V_EP::COMP_FUNC, ALLOC<std::pair<const typename V_EP::HASH_TYPE, LABELS> > > NEIGHBORS;</span><a name="l00046"></a>00046 <span class="keyword">typename</span> V_EP::COMP_FUNC, ALLOC<std::pair<typename V_EP::HASH_TYPE, LABELS> > > NEIGHBORS;<a name="l00047"></a>00047 <span class="keyword">typedef</span> HASHNS::hash_map<typename V_EP::HASH_TYPE, NEIGHBORS, HASHNS::hash<typename V_EP::HASH_TYPE>, <a name="l00048"></a>00048 <span class="comment">// typename V_EP::COMP_FUNC, ALLOC<std::pair<const typename V_EP::HASH_TYPE, NEIGHBORS> > > HMAP;</span><a name="l00049"></a>00049 <span class="keyword">typename</span> V_EP::COMP_FUNC, ALLOC<std::pair<typename V_EP::HASH_TYPE, NEIGHBORS> > > HMAP;<a name="l00050"></a>00050 <span class="keyword">typedef</span> <span class="keyword">typename</span> HMAP::const_iterator CONST_IT;<a name="l00051"></a>00051 <span class="keyword">typedef</span> <span class="keyword">typename</span> HMAP::iterator IT;<a name="l00052"></a>00052 <span class="keyword">typedef</span> <span class="keyword">typename</span> NEIGHBORS::const_iterator CONST_NIT;<a name="l00053"></a>00053 <span class="keyword">typedef</span> <span class="keyword">typename</span> NEIGHBORS::iterator NIT;<a name="l00054"></a>00054 <span class="keyword">typedef</span> <span class="keyword">typename</span> LABELS::const_iterator CONST_LIT;<a name="l00055"></a>00055 <span class="keyword">typedef</span> <span class="keyword">typename</span> LABELS::iterator LIT;<a name="l00056"></a>00056 <a name="l00057"></a>00057 <a name="l00058"></a>00058 <span class="keywordtype">void</span> print()<span class="keyword"> const </span>{<a name="l00059"></a>00059 cout<<<span class="stringliteral">"LEVEL ONE HMAP CONTENTS"</span><<endl<<endl;<a name="l00060"></a>00060 <a name="l00061"></a>00061 CONST_IT it;<a name="l00062"></a>00062 CONST_NIT nit;<a name="l00063"></a>00063 CONST_LIT lit;<a name="l00064"></a>00064 <a name="l00065"></a>00065 <span class="keywordflow">for</span>(it=_hmap.begin(); it!=_hmap.end(); it++) {<a name="l00066"></a>00066 cout<<<span class="stringliteral">"Vertex="</span><<it->first<<<span class="stringliteral">" has neighbors:"</span><<endl;<a name="l00067"></a>00067 <span class="keywordflow">for</span>(nit=it->second.begin(); nit!=it->second.end(); nit++) {<a name="l00068"></a>00068 cout<<nit->first<<<span class="stringliteral">" with labels:"</span>;<a name="l00069"></a>00069 <span class="keywordflow">for</span>(lit=nit->second.begin(); lit!=nit->second.end(); lit++)<a name="l00070"></a>00070 cout<<<span class="stringliteral">" "</span><<*lit;<a name="l00071"></a>00071 cout<<endl;<a name="l00072"></a>00072 }<a name="l00073"></a>00073 cout<<endl;<a name="l00074"></a>00074 }<a name="l00075"></a>00075 <a name="l00076"></a>00076 }<span class="comment">//print()</span><a name="l00077"></a>00077 <a name="l00078"></a>00078 <span class="keywordtype">int</span> size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _hmap.size();}<a name="l00079"></a>00079 <a name="l00083"></a>00083 <span class="comment">// NOTE: in order for this map to be applicable to both directed and</span><a name="l00084"></a>00084 <span class="comment">// undirected graphs, insert adds an edge FROM src TO dest only;</span><a name="l00085"></a>00085 <span class="comment">// hence for undirected graphs, insert shall have to be called twice</span><a name="l00086"></a><a class="code" href="classlevel__one__hmap.html#7e64416a293d932deb50f1e0e511d132">00086</a> <span class="keywordtype">void</span> <a class="code" href="classlevel__one__hmap.html#7e64416a293d932deb50f1e0e511d132">insert</a>(<span class="keyword">const</span> V_T& src, <span class="keyword">const</span> V_T& dest, <span class="keyword">const</span> E_T& lbl) {<a name="l00087"></a>00087 IT it;<a name="l00088"></a>00088 NIT nit;<a name="l00089"></a>00089 LIT lit;<a name="l00090"></a>00090 pair<LIT, bool> lit_p;<a name="l00091"></a>00091 pair<NIT, bool> nit_p;<a name="l00092"></a>00092 pair<IT, bool> it_p;<a name="l00093"></a>00093 <a name="l00094"></a>00094 <span class="keyword">typename</span> V_EP::HASH_TYPE ret = V_EP::conv_hash_type(src); ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -