classtree__instance-members.html
来自「这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)」· HTML 代码 · 共 50 行
HTML
50 行
<!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: Member List</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 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 Pages</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="annotated.html"><span>Class List</span></a></li> <li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li> <li><a href="functions.html"><span>Class Members</span></a></li> </ul></div><h1>tree_instance< MATCH_LABEL_T, order > Member List</h1>This is the complete list of members for <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>, including all inherited members.<p><table> <tr class="memlist"><td><a class="el" href="classtree__instance.html#85fb6ef92b0780fc7ffe8b5f2ac143c0">child_test</a>(const TREE_INSTANCE &i2) const </td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="classtree__instance.html#6c2027a604839cbe2fd1ff6573ac4b0f">contains</a>(const TREE_INSTANCE &i2) const </td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>cousin_test</b> (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [friend]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>depth</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="classtree__instance.html#fd87975b2521f09b5ba343d1a363b513">depth_diff</a>(const TREE_INSTANCE &i2) const </td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>get_depth</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>get_lb</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>get_ml_begin</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>get_ml_end</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>get_ml_size</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>get_ub</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>induced</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="classtree__instance.html#a9935c93b299c6827fd281215cbebb1f">less_than</a>(const TREE_INSTANCE &i2) const </td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>lower</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr class="memlist"><td><a class="el" href="classtree__instance.html#84d628f3015c0e71353bf29a7309b566">match_label</a>(const ML &ml2) const </td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>ML</b> typedef (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>operator<<</b> (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [friend]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>TREE_INSTANCE</b> typedef (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td></td></tr> <tr bgcolor="#f0f0f0"><td><b>tree_instance</b>() (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>tree_instance</b>(const int &lx, const int &ux, const int &d=0, bool ind=0) (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>tree_instance</b>(ML &ml, const int &lx, const int &ux, const int &d=0, bool ind=0) (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>tree_instance</b>(const TREE_INSTANCE &i2, const int &lx, const int &d=0, bool ind=0) (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr> <tr bgcolor="#f0f0f0"><td><b>upper</b>() const (defined in <a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a>)</td><td><a class="el" href="classtree__instance.html">tree_instance< MATCH_LABEL_T, order ></a></td><td><code> [inline]</code></td></tr></table><hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:09 2006 for DMTL by <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 + =
减小字号Ctrl + -
显示快捷键?