classtrie.html

来自「Aprior的C++实现算法」· HTML 代码 · 共 584 行 · 第 1/2 页

<p>
Increases the counter for those itemsets that is contained by the given basket. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign=top><em>basket</em>&nbsp;</td><td>the given basket </td></tr>
    <tr><td valign=top><em>distance_from_candidate</em>&nbsp;</td><td>The length of the path from the actual trie to a trie that represents a candidate </td></tr>
    <tr><td valign=top><em>it_basket</em>&nbsp;</td><td>*it_basket lead to the actual Trie. Only items following this item in the basket need to be considered </td></tr>
    <tr><td valign=top><em>counter_incr</em>&nbsp;</td><td>The number times this basket occurs </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="Trie_8cpp-source.html#l00058">58</a> of file <a class="el" href="Trie_8cpp-source.html">Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00082">counter</a>, <a class="el" href="Trie_8hpp-source.html#l00088">edgevector</a>, and <a class="el" href="common_8hpp-source.html#l00022">itemtype</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00057">MSApriori_Trie::find_candidate()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a1" doxytag="Trie::is_included" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> const <a class="el" href="classTrie.html">Trie</a> * Trie::is_included </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const set&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt; &amp;&nbsp;</td>
          <td class="mdname" nowrap> <em>an_itemset</em>, </td>
        </tr>
        <tr>
          <td></td>
          <td></td>
          <td class="md" nowrap>set&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt;::const_iterator&nbsp;</td>
          <td class="mdname" nowrap> <em>item_it</em></td>
        </tr>
        <tr>
          <td></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"> const</td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
It decides whether the given itemset is included in the trie or not. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign=top><em>an_itemset</em>&nbsp;</td><td>The given itemset. </td></tr>
    <tr><td valign=top><em>item_it</em>&nbsp;</td><td>This iterator shows the element of the basket that has to be processed. </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>NULL, if the itemset is not included, otherwise the trie, that represents the itemset. </dd></dl>

<p>
Definition at line <a class="el" href="Trie_8cpp-source.html#l00038">38</a> of file <a class="el" href="Trie_8cpp-source.html">Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00015">Edge_point_less()</a>, and <a class="el" href="Trie_8hpp-source.html#l00088">edgevector</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00240">MSApriori_Trie::assoc_rule_find()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00122">MSApriori_Trie::is_all_subset_frequent()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="d0" doxytag="Trie::max_path_set" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> void Trie::max_path_set </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="mdname1" valign="top" nowrap>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap><code> [private]</code></td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Sets the maximal path value. 
<p>

<p>
Definition at line <a class="el" href="Trie_8cpp-source.html#l00134">134</a> of file <a class="el" href="Trie_8cpp-source.html">Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00088">edgevector</a>, <a class="el" href="common_8hpp-source.html#l00022">itemtype</a>, <a class="el" href="Trie_8hpp-source.html#l00091">maxpath</a>, and <a class="el" href="Trie_8hpp-source.html#l00079">parent</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00181">MSApriori_Trie::candidate_generation_assist()</a>, <a class="el" href="Trie_8cpp-source.html#l00089">delete_infrequent()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">MSApriori_Trie::delete_infrequent_two()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a4" doxytag="Trie::show_content_preorder" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> void Trie::show_content_preorder </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="mdname1" valign="top" nowrap>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap> const</td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Shows the content in a preorder manner. 
<p>

<p>
Definition at line <a class="el" href="Trie_8cpp-source.html#l00117">117</a> of file <a class="el" href="Trie_8cpp-source.html">Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00082">counter</a>, <a class="el" href="Trie_8hpp-source.html#l00088">edgevector</a>, and <a class="el" href="Trie_8hpp-source.html#l00091">maxpath</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00108">MSApriori_Trie::show_content_preorder()</a>.    </td>
  </tr>
</table>
<hr><h2>Friends And Related Function Documentation</h2>
<a class="anchor" name="n0" doxytag="Trie::MSApriori_Trie" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> friend class <a class="el" href="classMSApriori__Trie.html">MSApriori_Trie</a><code> [friend]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>

<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00046">46</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.    </td>
  </tr>
</table>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="r1" doxytag="Trie::counter" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> unsigned long <a class="el" href="classTrie.html#r1">Trie::counter</a><code> [private]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
counter stores the occurrence of the itemset represented by the Trie 
<p>

<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00082">82</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00264">MSApriori_Trie::assoc_rule_assist()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00240">MSApriori_Trie::assoc_rule_find()</a>, <a class="el" href="Trie_8cpp-source.html#l00058">find_candidate()</a>, <a class="el" href="Trie_8cpp-source.html#l00117">show_content_preorder()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00096">MSApriori_Trie::write_content_to_file()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00278">MSApriori_Trie::write_content_to_file_assist()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="r2" doxytag="Trie::edgevector" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> vector&lt;<a class="el" href="structEdge.html">Edge</a>&gt; <a class="el" href="classTrie.html#r2">Trie::edgevector</a><code> [private]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
edgevector stores the edges of the root the trie. 
<p>
edgevector is always sorted! 
<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00088">88</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.
<p>
Referenced by <a class="el" href="Trie_8cpp-source.html#l00150">add_empty_state()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00264">MSApriori_Trie::assoc_rule_assist()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00181">MSApriori_Trie::candidate_generation_assist()</a>, <a class="el" href="Trie_8cpp-source.html#l00089">delete_infrequent()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00068">MSApriori_Trie::delete_infrequent()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">MSApriori_Trie::delete_infrequent_two()</a>, <a class="el" href="Trie_8cpp-source.html#l00058">find_candidate()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00030">MSApriori_Trie::insert_frequent_items()</a>, <a class="el" href="Trie_8cpp-source.html#l00038">is_included()</a>, <a class="el" href="Trie_8cpp-source.html#l00134">max_path_set()</a>, <a class="el" href="Trie_8cpp-source.html#l00117">show_content_preorder()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00278">MSApriori_Trie::write_content_to_file_assist()</a>, and <a class="el" href="Trie_8cpp-source.html#l00128">~Trie()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="r3" doxytag="Trie::maxpath" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> <a class="el" href="common_8hpp.html#a0">itemtype</a> <a class="el" href="classTrie.html#r3">Trie::maxpath</a><code> [private]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
maxpath stores the length of the longest path starting from the root node. 
<p>

<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00091">91</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00040">MSApriori_Trie::candidate_generation()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00181">MSApriori_Trie::candidate_generation_assist()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00165">MSApriori_Trie::candidate_generation_two()</a>, <a class="el" href="Trie_8cpp-source.html#l00089">delete_infrequent()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00030">MSApriori_Trie::insert_frequent_items()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00091">MSApriori_Trie::longest_path()</a>, <a class="el" href="Trie_8cpp-source.html#l00134">max_path_set()</a>, <a class="el" href="Trie_8cpp-source.html#l00117">show_content_preorder()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00096">MSApriori_Trie::write_content_to_file()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="r0" doxytag="Trie::parent" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> <a class="el" href="classTrie.html">Trie</a>* <a class="el" href="classTrie.html#r0">Trie::parent</a><code> [private]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
parent stores the address of the parent of the Trie. 
<p>

<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00079">79</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.
<p>
Referenced by <a class="el" href="Trie_8cpp-source.html#l00089">delete_infrequent()</a>, and <a class="el" href="Trie_8cpp-source.html#l00134">max_path_set()</a>.    </td>
  </tr>
</table>
<hr>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="Trie_8hpp-source.html">Trie.hpp</a><li><a class="el" href="Trie_8cpp-source.html">Trie.cpp</a></ul>
<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>