992 lines
54 KiB
HTML
992 lines
54 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: mlpack::range::RangeSearchRules< MetricType, TreeType > Class Template Reference</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 class="current"><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><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="annotated.html"><span>Class List</span></a></li>
|
|
<li><a href="classes.html"><span>Class Index</span></a></li>
|
|
<li><a href="inherits.html"><span>Class Hierarchy</span></a></li>
|
|
<li><a href="functions.html"><span>Class 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="namespacemlpack.html">mlpack</a></li><li class="navelem"><a class="el" href="namespacemlpack_1_1range.html">range</a></li><li class="navelem"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">RangeSearchRules</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#pub-types">Public Types</a> |
|
|
<a href="#pub-methods">Public Member Functions</a> |
|
|
<a href="#pri-methods">Private Member Functions</a> |
|
|
<a href="#pri-attribs">Private Attributes</a> |
|
|
<a href="classmlpack_1_1range_1_1RangeSearchRules-members.html">List of all members</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">mlpack::range::RangeSearchRules< MetricType, TreeType > Class Template Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>The <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html" title="The RangeSearchRules class is a template helper class used by RangeSearch class when performing range...">RangeSearchRules</a> class is a template helper class used by <a class="el" href="classmlpack_1_1range_1_1RangeSearch.html" title="The RangeSearch class is a template class for performing range searches. ">RangeSearch</a> class when performing range searches.
|
|
<a href="classmlpack_1_1range_1_1RangeSearchRules.html#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
|
|
Public Types</h2></td></tr>
|
|
<tr class="memitem:aa3c017f9cc812ad80a4c414507923464"><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="classmlpack_1_1tree_1_1TraversalInfo.html">tree::TraversalInfo</a>< TreeType > </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a></td></tr>
|
|
<tr class="separator:aa3c017f9cc812ad80a4c414507923464"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
|
Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:a8c71af9710b33dd019a4547f9eb33ea4"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a8c71af9710b33dd019a4547f9eb33ea4">RangeSearchRules</a> (const arma::mat &<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a202f28e4ab01a714eb5b644bd7821050">referenceSet</a>, const arma::mat &<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a7927679667e0cc4c0b1154544d2939e5">querySet</a>, const <a class="el" href="namespacemlpack_1_1math.html#a927179bb8d2d0fb6164df385ab51cbce">math::Range</a> &<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#af6263200fa62906536242c2c92bcd272">range</a>, std::vector< std::vector< size_t > > &<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a71fa3848900b8380c628cbb65c459347">neighbors</a>, std::vector< std::vector< double > > &<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a8910c5f0507d5a9e91a49e5df1763d8b">distances</a>, MetricType &<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a62fe0c6a07cd9ffbf4c0b351399b12cc">metric</a>, const bool <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a91694e4345bce8e6e51f781e60bb08e7">sameSet</a>=false)</td></tr>
|
|
<tr class="memdesc:a8c71af9710b33dd019a4547f9eb33ea4"><td class="mdescLeft"> </td><td class="mdescRight">Construct the <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html" title="The RangeSearchRules class is a template helper class used by RangeSearch class when performing range...">RangeSearchRules</a> object. <a href="#a8c71af9710b33dd019a4547f9eb33ea4">More...</a><br /></td></tr>
|
|
<tr class="separator:a8c71af9710b33dd019a4547f9eb33ea4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a412f1a0f31a78e7c837b62526e1bd356"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a412f1a0f31a78e7c837b62526e1bd356">BaseCase</a> (const size_t queryIndex, const size_t referenceIndex)</td></tr>
|
|
<tr class="memdesc:a412f1a0f31a78e7c837b62526e1bd356"><td class="mdescLeft"> </td><td class="mdescRight">Compute the base case between the given query point and reference point. <a href="#a412f1a0f31a78e7c837b62526e1bd356">More...</a><br /></td></tr>
|
|
<tr class="separator:a412f1a0f31a78e7c837b62526e1bd356"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6f71c939a36aafe04372f4c42c727261"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a6f71c939a36aafe04372f4c42c727261">BaseCases</a> () const </td></tr>
|
|
<tr class="memdesc:a6f71c939a36aafe04372f4c42c727261"><td class="mdescLeft"> </td><td class="mdescRight">Get the number of base cases. <a href="#a6f71c939a36aafe04372f4c42c727261">More...</a><br /></td></tr>
|
|
<tr class="separator:a6f71c939a36aafe04372f4c42c727261"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a941cedcec6a89fe6b2c9cbe1a7ea2647"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a941cedcec6a89fe6b2c9cbe1a7ea2647">Rescore</a> (const size_t queryIndex, TreeType &referenceNode, const double oldScore) const </td></tr>
|
|
<tr class="memdesc:a941cedcec6a89fe6b2c9cbe1a7ea2647"><td class="mdescLeft"> </td><td class="mdescRight">Re-evaluate the score for recursion order. <a href="#a941cedcec6a89fe6b2c9cbe1a7ea2647">More...</a><br /></td></tr>
|
|
<tr class="separator:a941cedcec6a89fe6b2c9cbe1a7ea2647"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a7dc82bd61e93b5c0a1c9ea52a33ac4c8"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a7dc82bd61e93b5c0a1c9ea52a33ac4c8">Rescore</a> (TreeType &queryNode, TreeType &referenceNode, const double oldScore) const </td></tr>
|
|
<tr class="memdesc:a7dc82bd61e93b5c0a1c9ea52a33ac4c8"><td class="mdescLeft"> </td><td class="mdescRight">Re-evaluate the score for recursion order. <a href="#a7dc82bd61e93b5c0a1c9ea52a33ac4c8">More...</a><br /></td></tr>
|
|
<tr class="separator:a7dc82bd61e93b5c0a1c9ea52a33ac4c8"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae33fcd5076191e44cd0d54edd73d37f2"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#ae33fcd5076191e44cd0d54edd73d37f2">Score</a> (const size_t queryIndex, TreeType &referenceNode)</td></tr>
|
|
<tr class="memdesc:ae33fcd5076191e44cd0d54edd73d37f2"><td class="mdescLeft"> </td><td class="mdescRight">Get the score for recursion order. <a href="#ae33fcd5076191e44cd0d54edd73d37f2">More...</a><br /></td></tr>
|
|
<tr class="separator:ae33fcd5076191e44cd0d54edd73d37f2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8d0f21fa7c82dbccb0fe616598a037cc"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a8d0f21fa7c82dbccb0fe616598a037cc">Score</a> (TreeType &queryNode, TreeType &referenceNode)</td></tr>
|
|
<tr class="memdesc:a8d0f21fa7c82dbccb0fe616598a037cc"><td class="mdescLeft"> </td><td class="mdescRight">Get the score for recursion order. <a href="#a8d0f21fa7c82dbccb0fe616598a037cc">More...</a><br /></td></tr>
|
|
<tr class="separator:a8d0f21fa7c82dbccb0fe616598a037cc"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a2996938310676b70dcf647b0418f7bec"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a2996938310676b70dcf647b0418f7bec">Scores</a> () const </td></tr>
|
|
<tr class="memdesc:a2996938310676b70dcf647b0418f7bec"><td class="mdescLeft"> </td><td class="mdescRight">Get the number of scores (that is, calls to RangeDistance()). <a href="#a2996938310676b70dcf647b0418f7bec">More...</a><br /></td></tr>
|
|
<tr class="separator:a2996938310676b70dcf647b0418f7bec"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a004fdbd40796f40506ef97d6ef01f2c9"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a004fdbd40796f40506ef97d6ef01f2c9">TraversalInfo</a> () const </td></tr>
|
|
<tr class="separator:a004fdbd40796f40506ef97d6ef01f2c9"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ab99205163bf81d166727adb0584b2e23"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#ab99205163bf81d166727adb0584b2e23">TraversalInfo</a> ()</td></tr>
|
|
<tr class="separator:ab99205163bf81d166727adb0584b2e23"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
|
|
Private Member Functions</h2></td></tr>
|
|
<tr class="memitem:a177d2e37e1c46eb64dbb6af4587fda1e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a177d2e37e1c46eb64dbb6af4587fda1e">AddResult</a> (const size_t queryIndex, TreeType &referenceNode)</td></tr>
|
|
<tr class="memdesc:a177d2e37e1c46eb64dbb6af4587fda1e"><td class="mdescLeft"> </td><td class="mdescRight">Add all the points in the given node to the results for the given query point. <a href="#a177d2e37e1c46eb64dbb6af4587fda1e">More...</a><br /></td></tr>
|
|
<tr class="separator:a177d2e37e1c46eb64dbb6af4587fda1e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
|
|
Private Attributes</h2></td></tr>
|
|
<tr class="memitem:a9ae6114c71b0f3d2c25d00b739143ef3"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a9ae6114c71b0f3d2c25d00b739143ef3">baseCases</a></td></tr>
|
|
<tr class="memdesc:a9ae6114c71b0f3d2c25d00b739143ef3"><td class="mdescLeft"> </td><td class="mdescRight">The number of base cases. <a href="#a9ae6114c71b0f3d2c25d00b739143ef3">More...</a><br /></td></tr>
|
|
<tr class="separator:a9ae6114c71b0f3d2c25d00b739143ef3"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8910c5f0507d5a9e91a49e5df1763d8b"><td class="memItemLeft" align="right" valign="top">std::vector< std::vector< double > > & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a8910c5f0507d5a9e91a49e5df1763d8b">distances</a></td></tr>
|
|
<tr class="memdesc:a8910c5f0507d5a9e91a49e5df1763d8b"><td class="mdescLeft"> </td><td class="mdescRight">The vector the resultant neighbor distances should be stored in. <a href="#a8910c5f0507d5a9e91a49e5df1763d8b">More...</a><br /></td></tr>
|
|
<tr class="separator:a8910c5f0507d5a9e91a49e5df1763d8b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a468193ab4403a82be84a11e0e18d3769"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a468193ab4403a82be84a11e0e18d3769">lastQueryIndex</a></td></tr>
|
|
<tr class="memdesc:a468193ab4403a82be84a11e0e18d3769"><td class="mdescLeft"> </td><td class="mdescRight">The last query index. <a href="#a468193ab4403a82be84a11e0e18d3769">More...</a><br /></td></tr>
|
|
<tr class="separator:a468193ab4403a82be84a11e0e18d3769"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0e867af7397d7cd5f6d265adc8d45797"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a0e867af7397d7cd5f6d265adc8d45797">lastReferenceIndex</a></td></tr>
|
|
<tr class="memdesc:a0e867af7397d7cd5f6d265adc8d45797"><td class="mdescLeft"> </td><td class="mdescRight">The last reference index. <a href="#a0e867af7397d7cd5f6d265adc8d45797">More...</a><br /></td></tr>
|
|
<tr class="separator:a0e867af7397d7cd5f6d265adc8d45797"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a62fe0c6a07cd9ffbf4c0b351399b12cc"><td class="memItemLeft" align="right" valign="top">MetricType & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a62fe0c6a07cd9ffbf4c0b351399b12cc">metric</a></td></tr>
|
|
<tr class="memdesc:a62fe0c6a07cd9ffbf4c0b351399b12cc"><td class="mdescLeft"> </td><td class="mdescRight">The instantiated metric. <a href="#a62fe0c6a07cd9ffbf4c0b351399b12cc">More...</a><br /></td></tr>
|
|
<tr class="separator:a62fe0c6a07cd9ffbf4c0b351399b12cc"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a71fa3848900b8380c628cbb65c459347"><td class="memItemLeft" align="right" valign="top">std::vector< std::vector< size_t > > & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a71fa3848900b8380c628cbb65c459347">neighbors</a></td></tr>
|
|
<tr class="memdesc:a71fa3848900b8380c628cbb65c459347"><td class="mdescLeft"> </td><td class="mdescRight">The vector the resultant neighbor indices should be stored in. <a href="#a71fa3848900b8380c628cbb65c459347">More...</a><br /></td></tr>
|
|
<tr class="separator:a71fa3848900b8380c628cbb65c459347"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a7927679667e0cc4c0b1154544d2939e5"><td class="memItemLeft" align="right" valign="top">const arma::mat & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a7927679667e0cc4c0b1154544d2939e5">querySet</a></td></tr>
|
|
<tr class="memdesc:a7927679667e0cc4c0b1154544d2939e5"><td class="mdescLeft"> </td><td class="mdescRight">The query set. <a href="#a7927679667e0cc4c0b1154544d2939e5">More...</a><br /></td></tr>
|
|
<tr class="separator:a7927679667e0cc4c0b1154544d2939e5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af6263200fa62906536242c2c92bcd272"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="namespacemlpack_1_1math.html#a927179bb8d2d0fb6164df385ab51cbce">math::Range</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#af6263200fa62906536242c2c92bcd272">range</a></td></tr>
|
|
<tr class="memdesc:af6263200fa62906536242c2c92bcd272"><td class="mdescLeft"> </td><td class="mdescRight">The range of distances for which we are searching. <a href="#af6263200fa62906536242c2c92bcd272">More...</a><br /></td></tr>
|
|
<tr class="separator:af6263200fa62906536242c2c92bcd272"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a202f28e4ab01a714eb5b644bd7821050"><td class="memItemLeft" align="right" valign="top">const arma::mat & </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a202f28e4ab01a714eb5b644bd7821050">referenceSet</a></td></tr>
|
|
<tr class="memdesc:a202f28e4ab01a714eb5b644bd7821050"><td class="mdescLeft"> </td><td class="mdescRight">The reference set. <a href="#a202f28e4ab01a714eb5b644bd7821050">More...</a><br /></td></tr>
|
|
<tr class="separator:a202f28e4ab01a714eb5b644bd7821050"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a91694e4345bce8e6e51f781e60bb08e7"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a91694e4345bce8e6e51f781e60bb08e7">sameSet</a></td></tr>
|
|
<tr class="memdesc:a91694e4345bce8e6e51f781e60bb08e7"><td class="mdescLeft"> </td><td class="mdescRight">If true, the query and reference set are taken to be the same. <a href="#a91694e4345bce8e6e51f781e60bb08e7">More...</a><br /></td></tr>
|
|
<tr class="separator:a91694e4345bce8e6e51f781e60bb08e7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acdff8571b8681d7310a94939592470a5"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#acdff8571b8681d7310a94939592470a5">scores</a></td></tr>
|
|
<tr class="memdesc:acdff8571b8681d7310a94939592470a5"><td class="mdescLeft"> </td><td class="mdescRight">THe number of scores. <a href="#acdff8571b8681d7310a94939592470a5">More...</a><br /></td></tr>
|
|
<tr class="separator:acdff8571b8681d7310a94939592470a5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a4453109302b3a5e580514c0196900f72"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a4453109302b3a5e580514c0196900f72">traversalInfo</a></td></tr>
|
|
<tr class="separator:a4453109302b3a5e580514c0196900f72"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><h3>template<typename MetricType, typename TreeType><br />
|
|
class mlpack::range::RangeSearchRules< MetricType, TreeType ></h3>
|
|
|
|
<p>The <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html" title="The RangeSearchRules class is a template helper class used by RangeSearch class when performing range...">RangeSearchRules</a> class is a template helper class used by <a class="el" href="classmlpack_1_1range_1_1RangeSearch.html" title="The RangeSearch class is a template class for performing range searches. ">RangeSearch</a> class when performing range searches. </p>
|
|
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">MetricType</td><td>The metric to use for computation. </td></tr>
|
|
<tr><td class="paramname">TreeType</td><td>The tree type to use; must adhere to the TreeType API. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00028">28</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
</div><h2 class="groupheader">Member Typedef Documentation</h2>
|
|
<a class="anchor" id="aa3c017f9cc812ad80a4c414507923464"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">typedef <a class="el" href="classmlpack_1_1tree_1_1TraversalInfo.html">tree::TraversalInfo</a><TreeType> <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00110">110</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
|
<a class="anchor" id="a8c71af9710b33dd019a4547f9eb33ea4"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::<a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">RangeSearchRules</a> </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const arma::mat & </td>
|
|
<td class="paramname"><em>referenceSet</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const arma::mat & </td>
|
|
<td class="paramname"><em>querySet</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const <a class="el" href="namespacemlpack_1_1math.html#a927179bb8d2d0fb6164df385ab51cbce">math::Range</a> & </td>
|
|
<td class="paramname"><em>range</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< std::vector< size_t > > & </td>
|
|
<td class="paramname"><em>neighbors</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< std::vector< double > > & </td>
|
|
<td class="paramname"><em>distances</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">MetricType & </td>
|
|
<td class="paramname"><em>metric</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const bool </td>
|
|
<td class="paramname"><em>sameSet</em> = <code>false</code> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Construct the <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html" title="The RangeSearchRules class is a template helper class used by RangeSearch class when performing range...">RangeSearchRules</a> object. </p>
|
|
<p>This is usually done from within the <a class="el" href="classmlpack_1_1range_1_1RangeSearch.html" title="The RangeSearch class is a template class for performing range searches. ">RangeSearch</a> class at search time.</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">referenceSet</td><td>Set of reference data. </td></tr>
|
|
<tr><td class="paramname">querySet</td><td>Set of query data. </td></tr>
|
|
<tr><td class="paramname">range</td><td>Range to search for. </td></tr>
|
|
<tr><td class="paramname">neighbors</td><td>Vector to store resulting neighbors in. </td></tr>
|
|
<tr><td class="paramname">distances</td><td>Vector to store resulting distances in. </td></tr>
|
|
<tr><td class="paramname">metric</td><td>Instantiated metric. </td></tr>
|
|
<tr><td class="paramname">sameSet</td><td>If true, the query and reference set are taken to be the same, and a query point will not return itself in the results. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Member Function Documentation</h2>
|
|
<a class="anchor" id="a177d2e37e1c46eb64dbb6af4587fda1e"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::AddResult </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const size_t </td>
|
|
<td class="paramname"><em>queryIndex</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>referenceNode</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Add all the points in the given node to the results for the given query point. </p>
|
|
<p>If the base case has already been calculated, we make sure to not add that to the results twice. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a412f1a0f31a78e7c837b62526e1bd356"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">double <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::BaseCase </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const size_t </td>
|
|
<td class="paramname"><em>queryIndex</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const size_t </td>
|
|
<td class="paramname"><em>referenceIndex</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Compute the base case between the given query point and reference point. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">queryIndex</td><td>Index of query point. </td></tr>
|
|
<tr><td class="paramname">referenceIndex</td><td>Index of reference point. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a6f71c939a36aafe04372f4c42c727261"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::BaseCases </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td> const</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Get the number of base cases. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00116">116</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>References <a class="el" href="range__search__rules_8hpp_source.html#l00156">mlpack::range::RangeSearchRules< MetricType, TreeType >::baseCases</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a941cedcec6a89fe6b2c9cbe1a7ea2647"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">double <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::Rescore </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const size_t </td>
|
|
<td class="paramname"><em>queryIndex</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>referenceNode</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const double </td>
|
|
<td class="paramname"><em>oldScore</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td> const</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Re-evaluate the score for recursion order. </p>
|
|
<p>A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned). This is used when the score has already been calculated, but another recursion may have modified the bounds for pruning. So the old score is checked against the new pruning bound.</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">queryIndex</td><td>Index of query point. </td></tr>
|
|
<tr><td class="paramname">referenceNode</td><td>Candidate node to be recursed into. </td></tr>
|
|
<tr><td class="paramname">oldScore</td><td>Old score produced by <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#ae33fcd5076191e44cd0d54edd73d37f2" title="Get the score for recursion order. ">Score()</a> (or <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a941cedcec6a89fe6b2c9cbe1a7ea2647" title="Re-evaluate the score for recursion order. ">Rescore()</a>). </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a7dc82bd61e93b5c0a1c9ea52a33ac4c8"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">double <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::Rescore </td>
|
|
<td>(</td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>queryNode</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>referenceNode</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const double </td>
|
|
<td class="paramname"><em>oldScore</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td> const</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Re-evaluate the score for recursion order. </p>
|
|
<p>A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned). This is used when the score has already been calculated, but another recursion may have modified the bounds for pruning. So the old score is checked against the new pruning bound.</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">queryNode</td><td>Candidate query node to recurse into. </td></tr>
|
|
<tr><td class="paramname">referenceNode</td><td>Candidate reference node to recurse into. </td></tr>
|
|
<tr><td class="paramname">oldScore</td><td>Old score produced by <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#ae33fcd5076191e44cd0d54edd73d37f2" title="Get the score for recursion order. ">Score()</a> (or <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#a941cedcec6a89fe6b2c9cbe1a7ea2647" title="Re-evaluate the score for recursion order. ">Rescore()</a>). </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="ae33fcd5076191e44cd0d54edd73d37f2"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">double <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::Score </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const size_t </td>
|
|
<td class="paramname"><em>queryIndex</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>referenceNode</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Get the score for recursion order. </p>
|
|
<p>A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned).</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">queryIndex</td><td>Index of query point. </td></tr>
|
|
<tr><td class="paramname">referenceNode</td><td>Candidate node to be recursed into. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a8d0f21fa7c82dbccb0fe616598a037cc"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">double <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::Score </td>
|
|
<td>(</td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>queryNode</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">TreeType & </td>
|
|
<td class="paramname"><em>referenceNode</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Get the score for recursion order. </p>
|
|
<p>A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned).</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">queryNode</td><td>Candidate query node to recurse into. </td></tr>
|
|
<tr><td class="paramname">referenceNode</td><td>Candidate reference node to recurse into. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a2996938310676b70dcf647b0418f7bec"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::Scores </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td> const</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Get the number of scores (that is, calls to RangeDistance()). </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00118">118</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>References <a class="el" href="range__search__rules_8hpp_source.html#l00158">mlpack::range::RangeSearchRules< MetricType, TreeType >::scores</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a004fdbd40796f40506ef97d6ef01f2c9"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">const <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a>& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::TraversalInfo </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td> const</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00112">112</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>References <a class="el" href="range__search__rules_8hpp_source.html#l00153">mlpack::range::RangeSearchRules< MetricType, TreeType >::traversalInfo</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="ab99205163bf81d166727adb0584b2e23"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a>& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::TraversalInfo </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00113">113</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>References <a class="el" href="range__search__rules_8hpp_source.html#l00153">mlpack::range::RangeSearchRules< MetricType, TreeType >::traversalInfo</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Member Data Documentation</h2>
|
|
<a class="anchor" id="a9ae6114c71b0f3d2c25d00b739143ef3"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::baseCases</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The number of base cases. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00156">156</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>Referenced by <a class="el" href="range__search__rules_8hpp_source.html#l00116">mlpack::range::RangeSearchRules< MetricType, TreeType >::BaseCases()</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a8910c5f0507d5a9e91a49e5df1763d8b"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<std::vector<double> >& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::distances</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The vector the resultant neighbor distances should be stored in. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00134">134</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a468193ab4403a82be84a11e0e18d3769"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::lastQueryIndex</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The last query index. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00143">143</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a0e867af7397d7cd5f6d265adc8d45797"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::lastReferenceIndex</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The last reference index. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00145">145</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a62fe0c6a07cd9ffbf4c0b351399b12cc"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">MetricType& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::metric</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The instantiated metric. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00137">137</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a71fa3848900b8380c628cbb65c459347"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<std::vector<size_t> >& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::neighbors</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The vector the resultant neighbor indices should be stored in. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00131">131</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a7927679667e0cc4c0b1154544d2939e5"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">const arma::mat& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::querySet</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The query set. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00125">125</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="af6263200fa62906536242c2c92bcd272"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">const <a class="el" href="namespacemlpack_1_1math.html#a927179bb8d2d0fb6164df385ab51cbce">math::Range</a>& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::range</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The range of distances for which we are searching. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00128">128</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a202f28e4ab01a714eb5b644bd7821050"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">const arma::mat& <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::referenceSet</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>The reference set. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00122">122</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a91694e4345bce8e6e51f781e60bb08e7"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::sameSet</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>If true, the query and reference set are taken to be the same. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00140">140</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="acdff8571b8681d7310a94939592470a5"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::scores</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>THe number of scores. </p>
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00158">158</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>Referenced by <a class="el" href="range__search__rules_8hpp_source.html#l00118">mlpack::range::RangeSearchRules< MetricType, TreeType >::Scores()</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a4453109302b3a5e580514c0196900f72"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename MetricType , typename TreeType > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html#aa3c017f9cc812ad80a4c414507923464">TraversalInfoType</a> <a class="el" href="classmlpack_1_1range_1_1RangeSearchRules.html">mlpack::range::RangeSearchRules</a>< MetricType, TreeType >::traversalInfo</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="range__search__rules_8hpp_source.html#l00153">153</a> of file <a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a>.</p>
|
|
|
|
<p>Referenced by <a class="el" href="range__search__rules_8hpp_source.html#l00112">mlpack::range::RangeSearchRules< MetricType, TreeType >::TraversalInfo()</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<hr/>The documentation for this class was generated from the following file:<ul>
|
|
<li>src/mlpack/methods/range_search/<a class="el" href="range__search__rules_8hpp_source.html">range_search_rules.hpp</a></li>
|
|
</ul>
|
|
</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>
|