120 lines
15 KiB
HTML
120 lines
15 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/hilbert_r_tree_split.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">hilbert_r_tree_split.hpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="hilbert__r__tree__split_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="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_SPLIT_HPP</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#define MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_SPLIT_HPP</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <<a class="code" href="prereqs_8hpp.html">mlpack/prereqs.hpp</a>></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="keyword">namespace </span><a class="code" href="namespacemlpack.html">mlpack</a> {</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="keyword">namespace </span>tree {</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">template</span><<span class="keywordtype">size_t</span> splitOrder = 2></div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html"> 29</a></span> <span class="keyword">class </span><a class="code" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html">HilbertRTreeSplit</a></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">template</span><<span class="keyword">typename</span> TreeType></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a997935ef77a0fac91b5477b6e7243420">SplitLeafNode</a>(TreeType* tree, std::vector<bool>& relevels);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">template</span><<span class="keyword">typename</span> TreeType></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a5781dc4e0677cbdeb0a92fd7bcb45c2c">SplitNonLeafNode</a>(TreeType* tree, std::vector<bool>& relevels);</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">private</span>:</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">template</span><<span class="keyword">typename</span> TreeType></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a58c831e8d918028ce02c72c42504fed1">FindCooperatingSiblings</a>(TreeType* parent,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> iTree,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">size_t</span>& firstSibling,</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">size_t</span>& lastSibling);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">template</span><<span class="keyword">typename</span> TreeType></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a4c9fcf3038bbee3d18c38811c86ae343">RedistributeNodesEvenly</a>(<span class="keyword">const</span> TreeType* parent,</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstSibling,</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> lastSibling);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">template</span><<span class="keyword">typename</span> TreeType></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a23e37c440350e73a80586c9297332bf0">RedistributePointsEvenly</a>(TreeType* parent,</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstSibling,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> lastSibling);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> };</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> } <span class="comment">// namespace tree</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> } <span class="comment">// namespace mlpack</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// Include implementation.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#include "hilbert_r_tree_split_impl.hpp"</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </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_1HilbertRTreeSplit_html_a4c9fcf3038bbee3d18c38811c86ae343"><div class="ttname"><a href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a4c9fcf3038bbee3d18c38811c86ae343">mlpack::tree::HilbertRTreeSplit::RedistributeNodesEvenly</a></div><div class="ttdeci">static void RedistributeNodesEvenly(const TreeType *parent, const size_t firstSibling, const size_t lastSibling)</div><div class="ttdoc">Redistribute the children of the cooperating siblings evenly among them. </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_1HilbertRTreeSplit_html"><div class="ttname"><a href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html">mlpack::tree::HilbertRTreeSplit</a></div><div class="ttdoc">The splitting procedure for the Hilbert R tree. </div><div class="ttdef"><b>Definition:</b> <a href="hilbert__r__tree__split_8hpp_source.html#l00029">hilbert_r_tree_split.hpp:29</a></div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1HilbertRTreeSplit_html_a5781dc4e0677cbdeb0a92fd7bcb45c2c"><div class="ttname"><a href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a5781dc4e0677cbdeb0a92fd7bcb45c2c">mlpack::tree::HilbertRTreeSplit::SplitNonLeafNode</a></div><div class="ttdeci">static bool SplitNonLeafNode(TreeType *tree, std::vector< bool > &relevels)</div><div class="ttdoc">Split a non-leaf node using the "default" algorithm. </div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1HilbertRTreeSplit_html_a23e37c440350e73a80586c9297332bf0"><div class="ttname"><a href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a23e37c440350e73a80586c9297332bf0">mlpack::tree::HilbertRTreeSplit::RedistributePointsEvenly</a></div><div class="ttdeci">static void RedistributePointsEvenly(TreeType *parent, const size_t firstSibling, const size_t lastSibling)</div><div class="ttdoc">Redistribute the points of the cooperating siblings evenly among them. </div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1HilbertRTreeSplit_html_a58c831e8d918028ce02c72c42504fed1"><div class="ttname"><a href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a58c831e8d918028ce02c72c42504fed1">mlpack::tree::HilbertRTreeSplit::FindCooperatingSiblings</a></div><div class="ttdeci">static bool FindCooperatingSiblings(TreeType *parent, const size_t iTree, size_t &firstSibling, size_t &lastSibling)</div><div class="ttdoc">Try to find splitOrder cooperating siblings in order to redistribute their children evenly...</div></div>
|
|
<div class="ttc" id="classmlpack_1_1tree_1_1HilbertRTreeSplit_html_a997935ef77a0fac91b5477b6e7243420"><div class="ttname"><a href="classmlpack_1_1tree_1_1HilbertRTreeSplit.html#a997935ef77a0fac91b5477b6e7243420">mlpack::tree::HilbertRTreeSplit::SplitLeafNode</a></div><div class="ttdeci">static void SplitLeafNode(TreeType *tree, std::vector< bool > &relevels)</div><div class="ttdoc">Split a leaf node using the "default" algorithm. </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>
|