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

📄 classlevel__one__hmap.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: level_one_hmap&lt; V_T, E_T, ALLOC &gt; Class Template Reference</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 id="current"><a href="annotated.html"><span>Classes</span></a></li>    <li><a href="files.html"><span>Files</span></a></li>    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>  </ul></div><div class="tabs">  <ul>    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>  </ul></div><h1>level_one_hmap&lt; V_T, E_T, ALLOC &gt; Class Template Reference</h1><!-- doxytag: class="level_one_hmap" -->Class to store edges i.e. level one patterns for graphs;.  <a href="#_details">More...</a><p><code>#include &lt;<a class="el" href="level__one__hmap_8h-source.html">level_one_hmap.h</a>&gt;</code><p><a href="classlevel__one__hmap-members.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0"><tr><td></td></tr><tr><td colspan="2"><br><h2>Public Types</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="2486779a60e73d3287e09c2ce18db9cf"></a><!-- doxytag: member="level_one_hmap::V_EP" ref="2486779a60e73d3287e09c2ce18db9cf" args="" -->typedef <a class="el" href="classelement__parser.html">element_parser</a>&lt; V_T &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>V_EP</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="301b7945ad1371193f119d1a4c31763d"></a><!-- doxytag: member="level_one_hmap::LABELS" ref="301b7945ad1371193f119d1a4c31763d" args="" -->typedef HASHNS::hash_set&lt;<br> E_T, HASHNS::hash&lt; E_T &gt;,<br> std::equal_to&lt; E_T &gt;, ALLOC&lt;<br> E_T &gt; &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>LABELS</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="53615a39cb137a9840f1ac66c6090f45"></a><!-- doxytag: member="level_one_hmap::NEIGHBORS" ref="53615a39cb137a9840f1ac66c6090f45" args="" -->typedef HASHNS::hash_map&lt;<br> typename V_EP::HASH_TYPE,<br> LABELS, HASHNS::hash&lt; typename <br>V_EP::HASH_TYPE &gt;, typename <br>V_EP::COMP_FUNC, ALLOC&lt; std::pair&lt;<br> typename V_EP::HASH_TYPE,<br> LABELS &gt; &gt; &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>NEIGHBORS</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="21522a91089f0c0e8d6b1b29dfdc0257"></a><!-- doxytag: member="level_one_hmap::HMAP" ref="21522a91089f0c0e8d6b1b29dfdc0257" args="" -->typedef HASHNS::hash_map&lt;<br> typename V_EP::HASH_TYPE,<br> NEIGHBORS, HASHNS::hash&lt;<br> typename V_EP::HASH_TYPE &gt;,<br> typename V_EP::COMP_FUNC,<br> ALLOC&lt; std::pair&lt; typename <br>V_EP::HASH_TYPE, NEIGHBORS &gt; &gt; &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>HMAP</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a207752749c72dc839998fa0a70310b9"></a><!-- doxytag: member="level_one_hmap::CONST_IT" ref="a207752749c72dc839998fa0a70310b9" args="" -->typedef HMAP::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>CONST_IT</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="cc0609da994772b4daef8eef1e904ff3"></a><!-- doxytag: member="level_one_hmap::IT" ref="cc0609da994772b4daef8eef1e904ff3" args="" -->typedef HMAP::iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>IT</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="c80ca28c34a63a66c88a321be41e4719"></a><!-- doxytag: member="level_one_hmap::CONST_NIT" ref="c80ca28c34a63a66c88a321be41e4719" args="" -->typedef NEIGHBORS::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>CONST_NIT</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="d86872fad6788611731fdd976d8a9f8b"></a><!-- doxytag: member="level_one_hmap::NIT" ref="d86872fad6788611731fdd976d8a9f8b" args="" -->typedef NEIGHBORS::iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>NIT</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="0d1b7103445170b87a68525313104fff"></a><!-- doxytag: member="level_one_hmap::CONST_LIT" ref="0d1b7103445170b87a68525313104fff" args="" -->typedef LABELS::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>CONST_LIT</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f574b4df476a3fe80cf4972e55e6cd1c"></a><!-- doxytag: member="level_one_hmap::LIT" ref="f574b4df476a3fe80cf4972e55e6cd1c" args="" -->typedef LABELS::iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>LIT</b></td></tr><tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b6d559c67fa505b600bb63599443f32d"></a><!-- doxytag: member="level_one_hmap::print" ref="b6d559c67fa505b600bb63599443f32d" args="() const " -->void&nbsp;</td><td class="memItemRight" valign="bottom"><b>print</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b086901cb18e543ea38f67201a9c4cd1"></a><!-- doxytag: member="level_one_hmap::size" ref="b086901cb18e543ea38f67201a9c4cd1" args="() const " -->int&nbsp;</td><td class="memItemRight" valign="bottom"><b>size</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classlevel__one__hmap.html#7e64416a293d932deb50f1e0e511d132">insert</a> (const V_T &amp;src, const V_T &amp;dest, const E_T &amp;lbl)</td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="050d16af752dae1ee34d0ba6dc6866cf"></a><!-- doxytag: member="level_one_hmap::get_labels" ref="050d16af752dae1ee34d0ba6dc6866cf" args="(const V_T &amp;src, const V_T &amp;dest) const " -->const LABELS &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_labels</b> (const V_T &amp;src, const V_T &amp;dest) const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="fc315ae329877b8625dd156542d4fecd"></a><!-- doxytag: member="level_one_hmap::get_neighbors" ref="fc315ae329877b8625dd156542d4fecd" args="(const V_T &amp;src) const " -->const NEIGHBORS &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_neighbors</b> (const V_T &amp;src) const </td></tr></table><hr><a name="_details"></a><h2>Detailed Description</h2><h3>template&lt;typename V_T, typename E_T, template&lt; typename &gt; class ALLOC = std::allocator&gt;<br> class level_one_hmap&lt; V_T, E_T, ALLOC &gt;</h3>Class to store edges i.e. level one patterns for graphs;. <p>This class is designed to provide a fast lookup of possible labels/vertices <p><hr><h2>Member Function Documentation</h2><a class="anchor" name="7e64416a293d932deb50f1e0e511d132"></a><!-- doxytag: member="level_one_hmap::insert" ref="7e64416a293d932deb50f1e0e511d132" args="(const V_T &amp;src, const V_T &amp;dest, const E_T &amp;lbl)" --><div class="memitem"><div class="memproto"><div class="memtemplate">template&lt;typename V_T, typename E_T, template&lt; typename &gt; class ALLOC = std::allocator&gt; </div>      <table class="memname">        <tr>          <td class="memname">void <a class="el" href="classlevel__one__hmap.html">level_one_hmap</a>&lt; V_T, E_T, ALLOC &gt;::insert           </td>          <td>(</td>          <td class="paramtype">const V_T &amp;&nbsp;</td>          <td class="paramname"> <em>src</em>, </td>        </tr>        <tr>          <td class="paramkey"></td>          <td></td>          <td class="paramtype">const V_T &amp;&nbsp;</td>          <td class="paramname"> <em>dest</em>, </td>        </tr>        <tr>          <td class="paramkey"></td>          <td></td>          <td class="paramtype">const E_T &amp;&nbsp;</td>          <td class="paramname"> <em>lbl</em></td><td>&nbsp;</td>        </tr>        <tr>          <td></td>          <td>)</td>          <td></td><td></td><td width="100%"><code> [inline]</code></td>        </tr>      </table></div><div class="memdoc"><p>Inserts the edge from src to dest with label lbl in the hmap; If any of src/dest are not present in hmap, they are inserted as well; This hmap does not permit parallel edges between two nodes </div></div><p><hr>The documentation for this class was generated from the following file:<ul><li><a class="el" href="level__one__hmap_8h-source.html">level_one_hmap.h</a></ul><hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:09 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 + -