trie_8hpp-source.html
来自「Aprior的C++实现算法」· HTML 代码 · 共 79 行
HTML
79 行
<!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>APRIORI algorithm: Trie.hpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.5 --><div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="annotated.html">Class List</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="functions.html">Class Members</a> | <a class="qindex" href="globals.html">File Members</a></div><h1>Trie.hpp</h1><a href="Trie_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><pre>00001 <span class="comment">/***************************************************************************</span>00002 <span class="comment"> Trie.hpp - description</span>00003 <span class="comment"> -------------------</span>00004 <span class="comment"> begin : cs dec 26 2002</span>00005 <span class="comment"> copyright : (C) 2002 by Ferenc Bodon</span>00006 <span class="comment"> email : bodon@mit.bme.hu</span>00007 <span class="comment"> ***************************************************************************/</span>00008 00009 <span class="preprocessor">#ifndef Trie_HPP</span>00010 <span class="preprocessor"></span><span class="preprocessor">#define Trie_HPP</span>00011 <span class="preprocessor"></span>00016 <span class="preprocessor">#include "<a class="code" href="common_8hpp.html">common.hpp</a>"</span>00017 <span class="preprocessor">#include <vector></span>00018 <span class="preprocessor">#include <set></span>00019 00020 <span class="keyword">using</span> <span class="keyword">namespace </span>std;00021 00022 <span class="keyword">class </span><a class="code" href="classMSApriori__Trie.html">MSApriori_Trie</a>;00023 <span class="keyword">class </span><a class="code" href="classTrie.html">Trie</a>;00024 <a name="l00029"></a><a class="code" href="structEdge.html">00029</a> <span class="keyword">struct </span><a class="code" href="structEdge.html">Edge</a>00030 {<a name="l00031"></a><a class="code" href="structEdge.html#o0">00031</a> <a class="code" href="common_8hpp.html#a0">itemtype</a> <a class="code" href="structEdge.html#o0">label</a>;<a name="l00032"></a><a class="code" href="structEdge.html#o1">00032</a> <a class="code" href="classTrie.html">Trie</a>* <a class="code" href="structEdge.html#o1">subtrie</a>;00033 };00034 <span class="keywordtype">bool</span> <a class="code" href="Trie_8hpp.html#a0">Edge_point_less</a>(<span class="keyword">const</span> <a class="code" href="structEdge.html">Edge</a> edge, <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> label);<a name="l00044"></a><a class="code" href="classTrie.html">00044</a> <span class="keyword">class </span><a class="code" href="classTrie.html">Trie</a>00045 {<a name="l00046"></a><a class="code" href="classTrie.html#n0">00046</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classMSApriori__Trie.html">MSApriori_Trie</a>;00047 00048 <span class="keyword">public</span>:00049 00050 <a class="code" href="classTrie.html#a0">Trie</a>( <a class="code" href="classTrie.html">Trie</a>* parent_trie, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> init_counter );00051 00053 <span class="keyword">const</span> <a class="code" href="classTrie.html">Trie</a>* <a class="code" href="classTrie.html#a1">is_included</a>( <span class="keyword">const</span> set<itemtype>& an_itemset, set<itemtype>::const_iterator item_it ) <span class="keyword">const</span>;00054 00056 <span class="keywordtype">void</span> <a class="code" href="classTrie.html#a2">find_candidate</a>( <span class="keyword">const</span> vector<itemtype>& basket, <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> distance_from_candidate,00057 vector<itemtype>::const_iterator it_basket, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> counter_incr=1);00058 00060 <span class="keywordtype">void</span> <a class="code" href="classTrie.html#a3">delete_infrequent</a>( <span class="keyword">const</span> <span class="keywordtype">double</span> min_occurrence, <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> distance_from_candidate );00061 00063 <span class="keywordtype">void</span> <a class="code" href="classTrie.html#a4">show_content_preorder</a>( ) <span class="keyword">const</span>;00064 <a class="code" href="classTrie.html#a5">~Trie</a>();00065 00066 <span class="keyword">private</span>:00068 <span class="keywordtype">void</span> <a class="code" href="classTrie.html#d0">max_path_set</a>( );00069 00071 <span class="keywordtype">void</span> <a class="code" href="classTrie.html#d1">add_empty_state</a>( <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> item, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> init_counter=0 );00072 00073 <span class="keyword">public</span>:00074 <span class="comment">// No public members</span>00075 00076 <span class="keyword">private</span>:00077 <a name="l00079"></a><a class="code" href="classTrie.html#r0">00079</a> <a class="code" href="classTrie.html">Trie</a>* <a class="code" href="classTrie.html#r0">parent</a>;00080 <a name="l00082"></a><a class="code" href="classTrie.html#r1">00082</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <a class="code" href="classTrie.html#r1">counter</a>;00083 <a name="l00088"></a><a class="code" href="classTrie.html#r2">00088</a> vector<Edge> <a class="code" href="classTrie.html#r2">edgevector</a>;00089 <a name="l00091"></a><a class="code" href="classTrie.html#r3">00091</a> <a class="code" href="common_8hpp.html#a0">itemtype</a> <a class="code" href="classTrie.html#r3">maxpath</a>;00092 };00093 00094 00095 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Sun Jun 20 23:41:08 2004 for APRIORI algorithm by<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border=0 > </a>1.3.5 </small></address></body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?