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

📄 classtree__instance.html

📁 这是一个用于数据挖掘的常用算法的模板库(数据挖掘的C++模板库for UNIX)
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<!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: tree_instance&lt; MATCH_LABEL_T, order &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>tree_instance&lt; MATCH_LABEL_T, order &gt; Class Template Reference</h1><!-- doxytag: class="tree_instance" --><a class="el" href="classtree__instance.html">tree_instance</a> class represents one <a class="el" href="classtree__instance.html">tree_instance</a> in a transaction  <a href="#_details">More...</a><p><code>#include &lt;<a class="el" href="tree__instance_8h-source.html">tree_instance.h</a>&gt;</code><p><a href="classtree__instance-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="9a56417d084ed4682ec652017b940f61"></a><!-- doxytag: member="tree_instance::ML" ref="9a56417d084ed4682ec652017b940f61" args="" -->typedef MATCH_LABEL_T&lt; int &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>ML</b></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="ed7449cd69fe6b0457d3a5fdee8a225f"></a><!-- doxytag: member="tree_instance::TREE_INSTANCE" ref="ed7449cd69fe6b0457d3a5fdee8a225f" args="" -->typedef <a class="el" href="classtree__instance.html">tree_instance</a>&lt; MATCH_LABEL_T,<br> order &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>TREE_INSTANCE</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="17b205d8b47859ef4444a93be6a57957"></a><!-- doxytag: member="tree_instance::tree_instance" ref="17b205d8b47859ef4444a93be6a57957" args="(const int &amp;lx, const int &amp;ux, const int &amp;d=0, bool ind=0)" -->&nbsp;</td><td class="memItemRight" valign="bottom"><b>tree_instance</b> (const int &amp;lx, const int &amp;ux, const int &amp;d=0, bool ind=0)</td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="920603c699cb234ccdaa4a22ae2f86c3"></a><!-- doxytag: member="tree_instance::tree_instance" ref="920603c699cb234ccdaa4a22ae2f86c3" args="(ML &amp;ml, const int &amp;lx, const int &amp;ux, const int &amp;d=0, bool ind=0)" -->&nbsp;</td><td class="memItemRight" valign="bottom"><b>tree_instance</b> (ML &amp;ml, const int &amp;lx, const int &amp;ux, const int &amp;d=0, bool ind=0)</td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b5e3d53302329d2a1aadaf2c9d4c5f83"></a><!-- doxytag: member="tree_instance::tree_instance" ref="b5e3d53302329d2a1aadaf2c9d4c5f83" args="(const TREE_INSTANCE &amp;i2, const int &amp;lx, const int &amp;d=0, bool ind=0)" -->&nbsp;</td><td class="memItemRight" valign="bottom"><b>tree_instance</b> (const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;i2, const int &amp;lx, const int &amp;d=0, bool ind=0)</td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="eeefbae752a3a24c51776d7f53dafc9c"></a><!-- doxytag: member="tree_instance::lower" ref="eeefbae752a3a24c51776d7f53dafc9c" args="() const " -->const int &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>lower</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="d9752b471af774e1dfbd752c0e7a6a41"></a><!-- doxytag: member="tree_instance::upper" ref="d9752b471af774e1dfbd752c0e7a6a41" args="() const " -->const int &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>upper</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree__instance.html#a9935c93b299c6827fd281215cbebb1f">less_than</a> (const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;i2) const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree__instance.html#6c2027a604839cbe2fd1ff6573ac4b0f">contains</a> (const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;i2) const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree__instance.html#84d628f3015c0e71353bf29a7309b566">match_label</a> (const ML &amp;ml2) const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree__instance.html#85fb6ef92b0780fc7ffe8b5f2ac143c0">child_test</a> (const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;i2) const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree__instance.html#fd87975b2521f09b5ba343d1a363b513">depth_diff</a> (const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;i2) const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e0bc369a375ebb08c4db060a6ce33c11"></a><!-- doxytag: member="tree_instance::induced" ref="e0bc369a375ebb08c4db060a6ce33c11" args="() const " -->bool&nbsp;</td><td class="memItemRight" valign="bottom"><b>induced</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="34c7f799ecd7325e6634083e472eb102"></a><!-- doxytag: member="tree_instance::depth" ref="34c7f799ecd7325e6634083e472eb102" args="() const " -->const int &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>depth</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="c538c021a5e3531d87ca54d51fca36ee"></a><!-- doxytag: member="tree_instance::get_lb" ref="c538c021a5e3531d87ca54d51fca36ee" args="() const " -->int&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_lb</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="7d537121221371d8518ba2e4c9a53c69"></a><!-- doxytag: member="tree_instance::get_ub" ref="7d537121221371d8518ba2e4c9a53c69" args="() const " -->int&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_ub</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="6c2363ae31cd77a73c4811e19157bc75"></a><!-- doxytag: member="tree_instance::get_depth" ref="6c2363ae31cd77a73c4811e19157bc75" args="() const " -->int&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_depth</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="aea0582b8ad5e0236f3154236ce60498"></a><!-- doxytag: member="tree_instance::get_ml_begin" ref="aea0582b8ad5e0236f3154236ce60498" args="() const " -->ML::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_ml_begin</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="7955f864dff0481d147b786950b3512e"></a><!-- doxytag: member="tree_instance::get_ml_end" ref="7955f864dff0481d147b786950b3512e" args="() const " -->ML::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_ml_end</b> () const </td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="8d8bf7f37f6e411e51b85c9e58d1c800"></a><!-- doxytag: member="tree_instance::get_ml_size" ref="8d8bf7f37f6e411e51b85c9e58d1c800" args="() const " -->int&nbsp;</td><td class="memItemRight" valign="bottom"><b>get_ml_size</b> () const </td></tr><tr><td colspan="2"><br><h2>Friends</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a6ab1c983353909d6e0558266bf06e90"></a><!-- doxytag: member="tree_instance::cousin_test" ref="a6ab1c983353909d6e0558266bf06e90" args="(const TREE_INSTANCE &amp;, const TREE_INSTANCE &amp;)" -->bool&nbsp;</td><td class="memItemRight" valign="bottom"><b>cousin_test</b> (const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;, const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;)</td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="c5a00060f3b813c76e4f8ac618187edf"></a><!-- doxytag: member="tree_instance::operator&lt;&lt;" ref="c5a00060f3b813c76e4f8ac618187edf" args="(ostream &amp;, const TREE_INSTANCE &amp;)" -->ostream &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>operator&lt;&lt;</b> (ostream &amp;, const <a class="el" href="classtree__instance.html">TREE_INSTANCE</a> &amp;)</td></tr></table><hr><a name="_details"></a><h2>Detailed Description</h2><h3>template&lt;template&lt; typename &gt; class MATCH_LABEL_T, class order&gt;<br> class tree_instance&lt; MATCH_LABEL_T, order &gt;</h3><a class="el" href="classtree__instance.html">tree_instance</a> class represents one <a class="el" href="classtree__instance.html">tree_instance</a> in a transaction <p>This class is part of tree VAT. A instance of this class represents exactly one tree instance in a transaction. It takes two template arguments. MATCH_LABEL_T denotes the data structure that is used to make up the tree match label. Usually a vector of int is used. order denotes a class that determine whether the tree is ordered/unordered. <p><hr><h2>Member Function Documentation</h2><a class="anchor" name="85fb6ef92b0780fc7ffe8b5f2ac143c0"></a><!-- doxytag: member="tree_instance::child_test" ref="85fb6ef92b0780fc7ffe8b5f2ac143c0" args="(const TREE_INSTANCE &amp;i2) const " --><div class="memitem"><div class="memproto"><div class="memtemplate">template&lt;template&lt; typename &gt; class MATCH_LABEL_T, class order&gt; </div>      <table class="memname">        <tr>          <td class="memname">bool <a class="el" href="classtree__instance.html">tree_instance</a>&lt; MATCH_LABEL_T, order &gt;::child_test           </td>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -