📄 trie_8hpp-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>APRIORI algorithm: Trie.hpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.9.1 --><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 class="fragment">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@cs.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="classApriori__Trie.html">Apriori_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> label;<a name="l00032"></a><a class="code" href="structEdge.html#o1">00032</a> <a class="code" href="classTrie.html">Trie</a>* subtrie;00033 };00034 <a name="l00045"></a><a class="code" href="classTrie.html">00045</a> <span class="keyword">class </span><a class="code" href="classTrie.html">Trie</a>00046 {<a name="l00047"></a><a class="code" href="classTrie.html#n0">00047</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classApriori__Trie.html">Apriori_Trie</a>;00048 00049 <span class="keyword">public</span>:<a name="l00053"></a><a class="code" href="classTrie.html#a0">00053</a> <a class="code" href="classTrie.html">Trie</a>( <span class="keyword">const</span> countertype init_counter ):counter(init_counter){}00054 00056 <span class="keyword">const</span> <a class="code" href="classTrie.html">Trie</a>* is_included( <span class="keyword">const</span> set<itemtype>& an_itemset, 00057 set<itemtype>::const_iterator item_it ) <span class="keyword">const</span>;00058 00061 <span class="keywordtype">void</span> <a class="code" href="classApriori__Trie.html#a3">find_candidate</a>( vector<itemtype>::const_iterator it_basket_upper_bound,00062 vector<itemtype>::const_iterator it_basket, 00063 <span class="keyword">const</span> countertype counter_incr );00064 00066 <span class="keywordtype">void</span> <a class="code" href="classApriori__Trie.html#a4">delete_infrequent</a>( <span class="keyword">const</span> <span class="keywordtype">double</span> min_occurrence );00067 00068 ~<a class="code" href="classTrie.html">Trie</a>();00069 00070 <span class="keyword">private</span>:00071 00073 <span class="keywordtype">void</span> add_empty_state( <span class="keyword">const</span> itemtype item, 00074 <span class="keyword">const</span> countertype init_counter=0 );00075 00076 <span class="keyword">public</span>:00077 <span class="comment">// No public members</span>00078 00079 <span class="keyword">private</span>:00080 <a name="l00082"></a><a class="code" href="classTrie.html#r0">00082</a> <a class="code" href="common_8hpp.html#a1">countertype</a> counter;00083 <a name="l00088"></a><a class="code" href="classTrie.html#r1">00088</a> vector<Edge> edgevector;00089 00090 };00091 00092 00093 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Fri Mar 11 14:48:06 2005 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.9.1 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -