136 lines
34 KiB
HTML
136 lines
34 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/binary_space_tree/breadth_first_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_f2c902aa2e0a74bdfe4e54224fb2267f.html">binary_space_tree</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">breadth_first_dual_tree_traverser.hpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="breadth__first__dual__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="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef MLPACK_CORE_TREE_BINARY_SPACE_TREE_BREADTH_FIRST_DUAL_TREE_TRAVERSER_HPP</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define MLPACK_CORE_TREE_BINARY_SPACE_TREE_BREADTH_FIRST_DUAL_TREE_TRAVERSER_HPP</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <<a class="code" href="prereqs_8hpp.html">mlpack/prereqs.hpp</a>></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <queue></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="preprocessor">#include "../binary_space_tree.hpp"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span><a class="code" href="namespacemlpack.html">mlpack</a> {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>tree {</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">template</span><<span class="keyword">typename</span> TreeType, <span class="keyword">typename</span> TraversalInfoType></div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1QueueFrame.html"> 27</a></span> <span class="keyword">struct </span><a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html">QueueFrame</a></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> {</div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1QueueFrame.html#a80e569d9e3e85071cdf487845929a0e2"> 29</a></span>  TreeType* <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a80e569d9e3e85071cdf487845929a0e2">queryNode</a>;</div><div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1QueueFrame.html#a8cee48e6adf4fa74962e1f9695cb457e"> 30</a></span>  TreeType* <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a8cee48e6adf4fa74962e1f9695cb457e">referenceNode</a>;</div><div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1QueueFrame.html#a760f0d74a729c8203b1f9a4c3424720c"> 31</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a760f0d74a729c8203b1f9a4c3424720c">queryDepth</a>;</div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1QueueFrame.html#a3d147bd089c175b909784626a67611f4"> 32</a></span>  <span class="keywordtype">double</span> <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a3d147bd089c175b909784626a67611f4">score</a>;</div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structmlpack_1_1tree_1_1QueueFrame.html#a6628f67f985180a60ceb80716d84def1"> 33</a></span>  TraversalInfoType <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a6628f67f985180a60ceb80716d84def1">traversalInfo</a>;</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> };</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">template</span><<span class="keyword">typename</span> MetricType,</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">typename</span> StatisticType,</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">typename</span> MatType,</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">template</span><<span class="keyword">typename</span> BoundMetricType, <span class="keyword">typename</span>...> <span class="keyword">class </span>BoundType,</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">template</span><<span class="keyword">typename</span> SplitBoundType, <span class="keyword">typename</span> SplitMatType></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">class </span>SplitType></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">template</span><<span class="keyword">typename</span> RuleType></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">class </span><a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree.html">BinarySpaceTree</a><MetricType, StatisticType, MatType, BoundType,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  SplitType>::BreadthFirstDualTreeTraverser</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  BreadthFirstDualTreeTraverser(RuleType& rule);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">typedef</span> <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html">QueueFrame<BinarySpaceTree, typename RuleType::TraversalInfoType></a></div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a3883d145979ea63e128b4caea3dd183d"> 53</a></span>  <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a3883d145979ea63e128b4caea3dd183d">QueueFrameType</a>;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordtype">void</span> Traverse(<a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree.html">BinarySpaceTree</a>& <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a80e569d9e3e85071cdf487845929a0e2">queryNode</a>,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree.html">BinarySpaceTree</a>& <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a8cee48e6adf4fa74962e1f9695cb457e">referenceNode</a>);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">void</span> Traverse(<a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree.html">BinarySpaceTree</a>& <a class="code" href="structmlpack_1_1tree_1_1QueueFrame.html#a80e569d9e3e85071cdf487845929a0e2">queryNode</a>,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  std::priority_queue<QueueFrameType>& referenceQueue);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#aea3f17e9cdb76174a09841f03525ebd6"> 68</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#aea3f17e9cdb76174a09841f03525ebd6">NumPrunes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numPrunes; }</div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a517058f5d757958d86b800128da97a12"> 70</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a517058f5d757958d86b800128da97a12">NumPrunes</a>() { <span class="keywordflow">return</span> numPrunes; }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a314694a3a03c8ec781263263c0e302c2"> 73</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a314694a3a03c8ec781263263c0e302c2">NumVisited</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numVisited; }</div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a17bd0b71411e2316e6c6a5f849faebc4"> 75</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a17bd0b71411e2316e6c6a5f849faebc4">NumVisited</a>() { <span class="keywordflow">return</span> numVisited; }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a50de51cd24ab20d9bf0ccbac32398503"> 78</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a50de51cd24ab20d9bf0ccbac32398503">NumScores</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numScores; }</div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a8cb73b27b133838c6a1a68ee9021cb2e"> 80</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a8cb73b27b133838c6a1a68ee9021cb2e">NumScores</a>() { <span class="keywordflow">return</span> numScores; }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#abc7e8d1ee558468be812a3637a3861af"> 83</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#abc7e8d1ee558468be812a3637a3861af">NumBaseCases</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> numBaseCases; }</div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ab4277c7a117ff347117c788552f3208c"> 85</a></span>  <span class="keywordtype">size_t</span>& <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ab4277c7a117ff347117c788552f3208c">NumBaseCases</a>() { <span class="keywordflow">return</span> numBaseCases; }</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ad9322d8ecd9244b9943f1e54be69ca7e"> 89</a></span>  RuleType& <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ad9322d8ecd9244b9943f1e54be69ca7e">rule</a>;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a9bded1e8f1cdbbbe673d59a03420179f"> 92</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a9bded1e8f1cdbbbe673d59a03420179f">numPrunes</a>;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ae3abb5b402baaa7b885305fa51c992e7"> 95</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ae3abb5b402baaa7b885305fa51c992e7">numVisited</a>;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#aa83135e31c9e8d1d5b745af29fe9cc37"> 98</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#aa83135e31c9e8d1d5b745af29fe9cc37">numScores</a>;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ab4a638fe9c4d10eab3624d1a291aef3f"> 101</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ab4a638fe9c4d10eab3624d1a291aef3f">numBaseCases</a>;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#adf3709b2d3fd4f6cb6984279597d6eb5"> 105</a></span>  <span class="keyword">typename</span> RuleType::TraversalInfoType <a class="code" href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#adf3709b2d3fd4f6cb6984279597d6eb5">traversalInfo</a>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> };</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> } <span class="comment">// namespace tree</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> } <span class="comment">// namespace mlpack</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// Include implementation.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor">#include "breadth_first_dual_tree_traverser_impl.hpp"</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor">#endif // MLPACK_CORE_TREE_BINARY_SPACE_TREE_BREADTH_FIRST_DUAL_TREE_TRAVERSER_HPP</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_abc7e8d1ee558468be812a3637a3861af"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#abc7e8d1ee558468be812a3637a3861af">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00083">breadth_first_dual_tree_traverser.hpp:83</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a9bded1e8f1cdbbbe673d59a03420179f"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a9bded1e8f1cdbbbe673d59a03420179f">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00092">breadth_first_dual_tree_traverser.hpp:92</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a3883d145979ea63e128b4caea3dd183d"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a3883d145979ea63e128b4caea3dd183d">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::QueueFrameType</a></div><div class="ttdeci">QueueFrame< BinarySpaceTree, typename RuleType::TraversalInfoType > QueueFrameType</div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00053">breadth_first_dual_tree_traverser.hpp:53</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="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_ab4277c7a117ff347117c788552f3208c"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ab4277c7a117ff347117c788552f3208c">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00085">breadth_first_dual_tree_traverser.hpp:85</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_ad9322d8ecd9244b9943f1e54be69ca7e"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ad9322d8ecd9244b9943f1e54be69ca7e">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00089">breadth_first_dual_tree_traverser.hpp:89</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_aa83135e31c9e8d1d5b745af29fe9cc37"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#aa83135e31c9e8d1d5b745af29fe9cc37">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00098">breadth_first_dual_tree_traverser.hpp:98</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_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a50de51cd24ab20d9bf0ccbac32398503"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a50de51cd24ab20d9bf0ccbac32398503">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00078">breadth_first_dual_tree_traverser.hpp:78</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a517058f5d757958d86b800128da97a12"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a517058f5d757958d86b800128da97a12">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00070">breadth_first_dual_tree_traverser.hpp:70</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_adf3709b2d3fd4f6cb6984279597d6eb5"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#adf3709b2d3fd4f6cb6984279597d6eb5">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00105">breadth_first_dual_tree_traverser.hpp:105</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_ab4a638fe9c4d10eab3624d1a291aef3f"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ab4a638fe9c4d10eab3624d1a291aef3f">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00101">breadth_first_dual_tree_traverser.hpp:101</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_html"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree.html">mlpack::tree::BinarySpaceTree</a></div><div class="ttdoc">A binary space partitioning tree, such as a KD-tree or a ball tree. </div><div class="ttdef"><b>Definition:</b> <a href="binary__space__tree_2binary__space__tree_8hpp_source.html#l00054">binary_space_tree.hpp:54</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1QueueFrame_html"><div class="ttname"><a href="structmlpack_1_1tree_1_1QueueFrame.html">mlpack::tree::QueueFrame</a></div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00027">breadth_first_dual_tree_traverser.hpp:27</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1QueueFrame_html_a6628f67f985180a60ceb80716d84def1"><div class="ttname"><a href="structmlpack_1_1tree_1_1QueueFrame.html#a6628f67f985180a60ceb80716d84def1">mlpack::tree::QueueFrame::traversalInfo</a></div><div class="ttdeci">TraversalInfoType traversalInfo</div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00033">breadth_first_dual_tree_traverser.hpp:33</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1QueueFrame_html_a760f0d74a729c8203b1f9a4c3424720c"><div class="ttname"><a href="structmlpack_1_1tree_1_1QueueFrame.html#a760f0d74a729c8203b1f9a4c3424720c">mlpack::tree::QueueFrame::queryDepth</a></div><div class="ttdeci">size_t queryDepth</div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00031">breadth_first_dual_tree_traverser.hpp:31</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1QueueFrame_html_a80e569d9e3e85071cdf487845929a0e2"><div class="ttname"><a href="structmlpack_1_1tree_1_1QueueFrame.html#a80e569d9e3e85071cdf487845929a0e2">mlpack::tree::QueueFrame::queryNode</a></div><div class="ttdeci">TreeType * queryNode</div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00029">breadth_first_dual_tree_traverser.hpp:29</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_ae3abb5b402baaa7b885305fa51c992e7"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#ae3abb5b402baaa7b885305fa51c992e7">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00095">breadth_first_dual_tree_traverser.hpp:95</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1QueueFrame_html_a8cee48e6adf4fa74962e1f9695cb457e"><div class="ttname"><a href="structmlpack_1_1tree_1_1QueueFrame.html#a8cee48e6adf4fa74962e1f9695cb457e">mlpack::tree::QueueFrame::referenceNode</a></div><div class="ttdeci">TreeType * referenceNode</div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00030">breadth_first_dual_tree_traverser.hpp:30</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a314694a3a03c8ec781263263c0e302c2"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a314694a3a03c8ec781263263c0e302c2">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00073">breadth_first_dual_tree_traverser.hpp:73</a></div></div>
|
|
<div class="ttc" id="structmlpack_1_1tree_1_1QueueFrame_html_a3d147bd089c175b909784626a67611f4"><div class="ttname"><a href="structmlpack_1_1tree_1_1QueueFrame.html#a3d147bd089c175b909784626a67611f4">mlpack::tree::QueueFrame::score</a></div><div class="ttdeci">double score</div><div class="ttdef"><b>Definition:</b> <a href="breadth__first__dual__tree__traverser_8hpp_source.html#l00032">breadth_first_dual_tree_traverser.hpp:32</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a17bd0b71411e2316e6c6a5f849faebc4"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a17bd0b71411e2316e6c6a5f849faebc4">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00075">breadth_first_dual_tree_traverser.hpp:75</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_a8cb73b27b133838c6a1a68ee9021cb2e"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#a8cb73b27b133838c6a1a68ee9021cb2e">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00080">breadth_first_dual_tree_traverser.hpp:80</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser_html_aea3f17e9cdb76174a09841f03525ebd6"><div class="ttname"><a href="classmlpack_1_1tree_1_1BinarySpaceTree_1_1BreadthFirstDualTreeTraverser.html#aea3f17e9cdb76174a09841f03525ebd6">mlpack::tree::BinarySpaceTree::BreadthFirstDualTreeTraverser::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="breadth__first__dual__tree__traverser_8hpp_source.html#l00068">breadth_first_dual_tree_traverser.hpp:68</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>
|