136 lines
33 KiB
HTML
136 lines
33 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.11"/>
|
|
<title>mlpack: src/mlpack/core/tree/rectangle_tree/dual_tree_traverser.hpp Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(function() { init_search(); });
|
|
</script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="extra-stylesheet.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">mlpack
|
|
 <span id="projectnumber">master</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.11 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
</script>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
<li>
|
|
<div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
<li><a href="globals.html"><span>File Members</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_44a936ef30fc126706c6284a2fc0c990.html">mlpack</a></li><li class="navelem"><a class="el" href="dir_f7ac9cdfd28b2e882eb44d163e3b98b4.html">core</a></li><li class="navelem"><a class="el" href="dir_d361cbf9654077cd65f7968e3f8eccf6.html">tree</a></li><li class="navelem"><a class="el" href="dir_7919cd971787b4fc956a50aa3613ed0a.html">rectangle_tree</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">dual_tree_traverser.hpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="rectangle__tree_2dual__tree__traverser_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_DUAL_TREE_TRAVERSER_HPP</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define MLPACK_CORE_TREE_RECTANGLE_TREE_DUAL_TREE_TRAVERSER_HPP</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <<a class="code" href="prereqs_8hpp.html">mlpack/prereqs.hpp</a>></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="rectangle__tree_2rectangle__tree_8hpp.html">rectangle_tree.hpp</a>"</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span><a class="code" href="namespacemlpack.html">mlpack</a> {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">namespace </span>tree {</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">template</span><<span class="keyword">typename</span> MetricType,</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">typename</span> StatisticType,</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keyword">typename</span> MatType,</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">typename</span> SplitType,</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">typename</span> DescentType,</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>AuxiliaryInformationType></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">template</span><<span class="keyword">typename</span> RuleType></div><div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html"> 31</a></span> <span class="keyword">class </span><a class="code" href="classmlpack_1_1tree_1_1RectangleTree.html">RectangleTree</a><MetricType, StatisticType, MatType, SplitType,</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  DescentType, AuxiliaryInformationType>::<a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html">DualTreeTraverser</a></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html">DualTreeTraverser</a>(RuleType& rule);</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordtype">void</span> Traverse(<a class="code" href="classmlpack_1_1tree_1_1RectangleTree.html">RectangleTree</a>& queryNode, <a class="code" href="classmlpack_1_1tree_1_1RectangleTree.html">RectangleTree</a>& referenceNode);</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a14135873b1b688c9a39ffc3b2757cba5"> 50</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a14135873b1b688c9a39ffc3b2757cba5">NumPrunes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numPrunes; }</div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ab590fc8beec04998918a35d09163a46c"> 52</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ab590fc8beec04998918a35d09163a46c">NumPrunes</a>() { <span class="keywordflow">return</span> numPrunes; }</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ad9ccabd421b08f1daa6b1db9a0be9adf"> 55</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ad9ccabd421b08f1daa6b1db9a0be9adf">NumVisited</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numVisited; }</div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a342cd4c408531b284a5a930116361024"> 57</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a342cd4c408531b284a5a930116361024">NumVisited</a>() { <span class="keywordflow">return</span> numVisited; }</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a27057155bae4ca33de0280cb06ff6cda"> 60</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a27057155bae4ca33de0280cb06ff6cda">NumScores</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numScores; }</div><div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a13d174f21d5e5abc26ed74e5b4e5023f"> 62</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a13d174f21d5e5abc26ed74e5b4e5023f">NumScores</a>() { <span class="keywordflow">return</span> numScores; }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a66cdb9b49aac5e5e7a6ddf0b88c0e802"> 65</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a66cdb9b49aac5e5e7a6ddf0b88c0e802">NumBaseCases</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numBaseCases; }</div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a653a5b66ed6e315841d22ca7796100db"> 67</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a653a5b66ed6e315841d22ca7796100db">NumBaseCases</a>() { <span class="keywordflow">return</span> numBaseCases; }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// We use this struct and this function to make the sorting and scoring easy</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// and efficient:</span></div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html"> 73</a></span>  <span class="keyword">struct </span><a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html">NodeAndScore</a></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  {</div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#afaa9fc6d7d076e1ee99a7c70b5e15885"> 75</a></span>  <a class="code" href="classmlpack_1_1tree_1_1RectangleTree.html">RectangleTree</a>* <a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#afaa9fc6d7d076e1ee99a7c70b5e15885">node</a>;</div><div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a80504d2ca447f3f0ba402a9d94404135"> 76</a></span>  <span class="keywordtype">double</span> <a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a80504d2ca447f3f0ba402a9d94404135">score</a>;</div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a5e0cbe275fdcb4c6ce0ebd080c329e47"> 77</a></span>  <span class="keyword">typename</span> RuleType::TraversalInfoType <a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a5e0cbe275fdcb4c6ce0ebd080c329e47">travInfo</a>;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  };</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#adaad75bf99f3a0f50d569494eb84886a"> 80</a></span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#adaad75bf99f3a0f50d569494eb84886a">nodeComparator</a>(<span class="keyword">const</span> <a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html">NodeAndScore</a>& obj1,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> <a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html">NodeAndScore</a>& obj2)</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> obj1.<a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a80504d2ca447f3f0ba402a9d94404135">score</a> < obj2.<a class="code" href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a80504d2ca447f3f0ba402a9d94404135">score</a>;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ab2092fd36ff02e28c4efc2d235f1b61d"> 87</a></span>  RuleType& <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ab2092fd36ff02e28c4efc2d235f1b61d">rule</a>;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a1db3b2b95418041a76ca0236fc1b143e"> 90</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a1db3b2b95418041a76ca0236fc1b143e">numPrunes</a>;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#aa5c4f93304a6e8181dcb922abb39a4aa"> 93</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#aa5c4f93304a6e8181dcb922abb39a4aa">numVisited</a>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#add565feea9cd2ea9800b75a8228de884"> 96</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#add565feea9cd2ea9800b75a8228de884">numScores</a>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a637e4544ee3c2f86136718a7d66590ca"> 99</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a637e4544ee3c2f86136718a7d66590ca">numBaseCases</a>;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#aa99ca1eb6bdb5e74d88f63a511e5bcf1"> 103</a></span>  <span class="keyword">typename</span> RuleType::TraversalInfoType <a class="code" href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#aa99ca1eb6bdb5e74d88f63a511e5bcf1">traversalInfo</a>;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> };</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> } <span class="comment">// namespace tree</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> } <span class="comment">// namespace mlpack</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// Include implementation.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor">#include "dual_tree_traverser_impl.hpp"</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a27057155bae4ca33de0280cb06ff6cda"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a27057155bae4ca33de0280cb06ff6cda">mlpack::tree::RectangleTree::DualTreeTraverser::NumScores</a></div><div class="ttdeci">size_t NumScores() const </div><div class="ttdoc">Get the number of times a node combination was scored. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00060">dual_tree_traverser.hpp:60</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a342cd4c408531b284a5a930116361024"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a342cd4c408531b284a5a930116361024">mlpack::tree::RectangleTree::DualTreeTraverser::NumVisited</a></div><div class="ttdeci">size_t & NumVisited()</div><div class="ttdoc">Modify the number of visited combinations. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00057">dual_tree_traverser.hpp:57</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a66cdb9b49aac5e5e7a6ddf0b88c0e802"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a66cdb9b49aac5e5e7a6ddf0b88c0e802">mlpack::tree::RectangleTree::DualTreeTraverser::NumBaseCases</a></div><div class="ttdeci">size_t NumBaseCases() const </div><div class="ttdoc">Get the number of times a base case was calculated. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00065">dual_tree_traverser.hpp:65</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a637e4544ee3c2f86136718a7d66590ca"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a637e4544ee3c2f86136718a7d66590ca">mlpack::tree::RectangleTree::DualTreeTraverser::numBaseCases</a></div><div class="ttdeci">size_t numBaseCases</div><div class="ttdoc">The number of times a base case was calculated. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00099">dual_tree_traverser.hpp:99</a></div></div>
|
|
<div class="ttc" id="namespacemlpack_html"><div class="ttname"><a href="namespacemlpack.html">mlpack</a></div><div class="ttdoc">Linear algebra utility functions, generally performed on matrices or vectors. </div><div class="ttdef"><b>Definition:</b> <a href="binarize_8hpp_source.html#l00018">binarize.hpp:18</a></div></div>
|
|
<div class="ttc" id="prereqs_8hpp_html"><div class="ttname"><a href="prereqs_8hpp.html">prereqs.hpp</a></div><div class="ttdoc">The core includes that mlpack expects; standard C++ includes and Armadillo. </div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a13d174f21d5e5abc26ed74e5b4e5023f"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a13d174f21d5e5abc26ed74e5b4e5023f">mlpack::tree::RectangleTree::DualTreeTraverser::NumScores</a></div><div class="ttdeci">size_t & NumScores()</div><div class="ttdoc">Modify the number of times a node combination was scored. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00062">dual_tree_traverser.hpp:62</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a1db3b2b95418041a76ca0236fc1b143e"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a1db3b2b95418041a76ca0236fc1b143e">mlpack::tree::RectangleTree::DualTreeTraverser::numPrunes</a></div><div class="ttdeci">size_t numPrunes</div><div class="ttdoc">The number of prunes. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00090">dual_tree_traverser.hpp:90</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore_html_afaa9fc6d7d076e1ee99a7c70b5e15885"><div class="ttname"><a href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#afaa9fc6d7d076e1ee99a7c70b5e15885">mlpack::tree::RectangleTree::DualTreeTraverser::NodeAndScore::node</a></div><div class="ttdeci">RectangleTree * node</div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00075">dual_tree_traverser.hpp:75</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a14135873b1b688c9a39ffc3b2757cba5"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a14135873b1b688c9a39ffc3b2757cba5">mlpack::tree::RectangleTree::DualTreeTraverser::NumPrunes</a></div><div class="ttdeci">size_t NumPrunes() const </div><div class="ttdoc">Get the number of prunes. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00050">dual_tree_traverser.hpp:50</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore_html_a80504d2ca447f3f0ba402a9d94404135"><div class="ttname"><a href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a80504d2ca447f3f0ba402a9d94404135">mlpack::tree::RectangleTree::DualTreeTraverser::NodeAndScore::score</a></div><div class="ttdeci">double score</div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00076">dual_tree_traverser.hpp:76</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore_html"><div class="ttname"><a href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html">mlpack::tree::RectangleTree::DualTreeTraverser::NodeAndScore</a></div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00073">dual_tree_traverser.hpp:73</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_html"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree.html">mlpack::tree::RectangleTree</a></div><div class="ttdoc">A rectangle type tree tree, such as an R-tree or X-tree. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2rectangle__tree_8hpp_source.html#l00053">rectangle_tree.hpp:53</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_add565feea9cd2ea9800b75a8228de884"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#add565feea9cd2ea9800b75a8228de884">mlpack::tree::RectangleTree::DualTreeTraverser::numScores</a></div><div class="ttdeci">size_t numScores</div><div class="ttdoc">The number of times a node combination was scored. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00096">dual_tree_traverser.hpp:96</a></div></div>
|
|
<div class="ttc" id="rectangle__tree_2rectangle__tree_8hpp_html"><div class="ttname"><a href="rectangle__tree_2rectangle__tree_8hpp.html">rectangle_tree.hpp</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_ab590fc8beec04998918a35d09163a46c"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ab590fc8beec04998918a35d09163a46c">mlpack::tree::RectangleTree::DualTreeTraverser::NumPrunes</a></div><div class="ttdeci">size_t & NumPrunes()</div><div class="ttdoc">Modify the number of prunes. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00052">dual_tree_traverser.hpp:52</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html">mlpack::tree::RectangleTree::DualTreeTraverser</a></div><div class="ttdoc">A dual tree traverser for rectangle type trees. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00031">dual_tree_traverser.hpp:31</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_aa99ca1eb6bdb5e74d88f63a511e5bcf1"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#aa99ca1eb6bdb5e74d88f63a511e5bcf1">mlpack::tree::RectangleTree::DualTreeTraverser::traversalInfo</a></div><div class="ttdeci">RuleType::TraversalInfoType traversalInfo</div><div class="ttdoc">Traversal information, held in the class so that it isn&#39;t continually being reallocated. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00103">dual_tree_traverser.hpp:103</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_adaad75bf99f3a0f50d569494eb84886a"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#adaad75bf99f3a0f50d569494eb84886a">mlpack::tree::RectangleTree::DualTreeTraverser::nodeComparator</a></div><div class="ttdeci">static bool nodeComparator(const NodeAndScore &obj1, const NodeAndScore &obj2)</div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00080">dual_tree_traverser.hpp:80</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore_html_a5e0cbe275fdcb4c6ce0ebd080c329e47"><div class="ttname"><a href="structmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_1_1NodeAndScore.html#a5e0cbe275fdcb4c6ce0ebd080c329e47">mlpack::tree::RectangleTree::DualTreeTraverser::NodeAndScore::travInfo</a></div><div class="ttdeci">RuleType::TraversalInfoType travInfo</div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00077">dual_tree_traverser.hpp:77</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_ab2092fd36ff02e28c4efc2d235f1b61d"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ab2092fd36ff02e28c4efc2d235f1b61d">mlpack::tree::RectangleTree::DualTreeTraverser::rule</a></div><div class="ttdeci">RuleType & rule</div><div class="ttdoc">Reference to the rules with which the trees will be traversed. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00087">dual_tree_traverser.hpp:87</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_a653a5b66ed6e315841d22ca7796100db"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#a653a5b66ed6e315841d22ca7796100db">mlpack::tree::RectangleTree::DualTreeTraverser::NumBaseCases</a></div><div class="ttdeci">size_t & NumBaseCases()</div><div class="ttdoc">Modify the number of times a base case was calculated. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00067">dual_tree_traverser.hpp:67</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_ad9ccabd421b08f1daa6b1db9a0be9adf"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#ad9ccabd421b08f1daa6b1db9a0be9adf">mlpack::tree::RectangleTree::DualTreeTraverser::NumVisited</a></div><div class="ttdeci">size_t NumVisited() const </div><div class="ttdoc">Get the number of visited combinations. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00055">dual_tree_traverser.hpp:55</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser_html_aa5c4f93304a6e8181dcb922abb39a4aa"><div class="ttname"><a href="classmlpack_1_1tree_1_1RectangleTree_1_1DualTreeTraverser.html#aa5c4f93304a6e8181dcb922abb39a4aa">mlpack::tree::RectangleTree::DualTreeTraverser::numVisited</a></div><div class="ttdeci">size_t numVisited</div><div class="ttdoc">The number of node combinations that have been visited during traversal. </div><div class="ttdef"><b>Definition:</b> <a href="rectangle__tree_2dual__tree__traverser_8hpp_source.html#l00093">dual_tree_traverser.hpp:93</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.11
|
|
</small></address>
|
|
</body>
|
|
<script type="text/javascript">
|
|
var x = document.getElementsByClassName("formulaDsp");
|
|
var i;
|
|
for (i = 0; i < x.length; i++)
|
|
{
|
|
x[i].width /= 4;
|
|
}
|
|
</script>
|
|
</html>
|