small_gicp/doc_cpp/knn__result_8hpp_source.html

193 lines
30 KiB
HTML

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>small_gicp: /home/runner/work/small_gicp/small_gicp/include/small_gicp/ann/knn_result.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>
<link href="doxygen.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">small_gicp
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></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_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_8f93768a68ffc2367e7100c40b4e616a.html">small_gicp</a></li><li class="navelem"><a class="el" href="dir_c59a592f06e82849d331f7a80f9235b4.html">ann</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">knn_result.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="knn__result_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>&#160;<span class="comment">// SPDX-FileCopyrightText: Copyright 2024 Kenji Koide</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// SPDX-License-Identifier: MIT</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="preprocessor">#pragma once</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160; </div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="preprocessor">#include &lt;array&gt;</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="preprocessor">#include &lt;iostream&gt;</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160; </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacesmall__gicp.html">small_gicp</a> {</div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160; </div>
<div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnSetting.html"> 13</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structsmall__gicp_1_1KnnSetting.html">KnnSetting</a> {</div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160; <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Result&gt;</div>
<div class="line"><a name="l00017"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnSetting.html#ac71f9e05909a6b40586abfc064bd5688"> 17</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="structsmall__gicp_1_1KnnSetting.html#ac71f9e05909a6b40586abfc064bd5688">fulfilled</a>(<span class="keyword">const</span> Result&amp; result)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160; <span class="keywordflow">return</span> result.worst_distance() &lt; <a class="code" href="structsmall__gicp_1_1KnnSetting.html#a4fd7c9a0d1434abc4d63c905bb17005e">epsilon</a>;</div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160; }</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160; </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnSetting.html#a4fd7c9a0d1434abc4d63c905bb17005e"> 22</a></span>&#160; <span class="keywordtype">double</span> <a class="code" href="structsmall__gicp_1_1KnnSetting.html#a4fd7c9a0d1434abc4d63c905bb17005e">epsilon</a> = 0.0; </div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;};</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; </div>
<div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1identity__transform.html"> 26</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structsmall__gicp_1_1identity__transform.html">identity_transform</a> {</div>
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1identity__transform.html#a4acec36f5a756a63ee2730aaf31743ff"> 27</a></span>&#160; <span class="keywordtype">size_t</span> <a class="code" href="structsmall__gicp_1_1identity__transform.html#a4acec36f5a756a63ee2730aaf31743ff">operator()</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> i; }</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160;};</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; </div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;<span class="keyword">template</span> &lt;<span class="keywordtype">int</span> N, <span class="keyword">typename</span> IndexTransform = <span class="keywordtype">id</span>entity_transform&gt;</div>
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html"> 33</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structsmall__gicp_1_1KnnResult.html">KnnResult</a> {</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a5ecf0353f5e9d5dab6b3dd890c04736e"> 35</a></span>&#160; <span class="keyword">static</span> constexpr <span class="keywordtype">size_t</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a5ecf0353f5e9d5dab6b3dd890c04736e">INVALID</a> = std::numeric_limits&lt;size_t&gt;::max();</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; </div>
<div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#aa03cd14f8a2656a96ede4ece59765b3c"> 41</a></span>&#160; <span class="keyword">explicit</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#aa03cd14f8a2656a96ede4ece59765b3c">KnnResult</a>(<span class="keywordtype">size_t</span>* <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>, <span class="keywordtype">double</span>* <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>, <span class="keywordtype">int</span> num_neighbors = -1, <span class="keyword">const</span> IndexTransform&amp; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">index_transform</a> = <a class="code" href="structsmall__gicp_1_1identity__transform.html">identity_transform</a>())</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; : <a class="code" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">index_transform</a>(<a class="code" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">index_transform</a>),</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a72aa5dc37a15d67ee31b0286ac4810b0">capacity</a>(num_neighbors),</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">num_found_neighbors</a>(0),</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>(<a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>),</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>(<a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>) {</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keywordflow">if</span> constexpr (N &gt; 0) {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keywordflow">if</span> (num_neighbors &gt;= 0) {</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; std::cerr &lt;&lt; <span class="stringliteral">&quot;warning: Specifying dynamic num_neighbors=&quot;</span> &lt;&lt; num_neighbors &lt;&lt; <span class="stringliteral">&quot; for a static KNN result container (N=&quot;</span> &lt;&lt; N &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; abort();</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; }</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">if</span> (num_neighbors &lt;= 0) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; std::cerr &lt;&lt; <span class="stringliteral">&quot;error: Specifying invalid num_neighbors=&quot;</span> &lt;&lt; num_neighbors &lt;&lt; <span class="stringliteral">&quot; for a dynamic KNN result container&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; abort();</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; </div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; std::fill(this-&gt;indices, this-&gt;indices + <a class="code" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">buffer_size</a>(), <a class="code" href="structsmall__gicp_1_1KnnResult.html#a5ecf0353f5e9d5dab6b3dd890c04736e">INVALID</a>);</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; std::fill(this-&gt;distances, this-&gt;distances + <a class="code" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">buffer_size</a>(), std::numeric_limits&lt;double&gt;::max());</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; }</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; </div>
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809"> 64</a></span>&#160; <span class="keywordtype">size_t</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">buffer_size</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">if</span> constexpr (N &gt; 0) {</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordflow">return</span> N;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keywordflow">return</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a72aa5dc37a15d67ee31b0286ac4810b0">capacity</a>;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; }</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; }</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; </div>
<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a98726a0269ad1bcc4b330176a1566a28"> 73</a></span>&#160; <span class="keywordtype">size_t</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a98726a0269ad1bcc4b330176a1566a28">num_found</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">num_found_neighbors</a>; }</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; </div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a02c3e5fef39d23fdc3d6a1ffa444f02f"> 76</a></span>&#160; <span class="keywordtype">double</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a02c3e5fef39d23fdc3d6a1ffa444f02f">worst_distance</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>[<a class="code" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">buffer_size</a>() - 1]; }</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; </div>
<div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a785e85874886bf700f0b12d87e342bf8"> 80</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a785e85874886bf700f0b12d87e342bf8">push</a>(<span class="keywordtype">size_t</span> index, <span class="keywordtype">double</span> distance) {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="keywordflow">if</span> (distance &gt;= <a class="code" href="structsmall__gicp_1_1KnnResult.html#a02c3e5fef39d23fdc3d6a1ffa444f02f">worst_distance</a>()) {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; }</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; </div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">if</span> constexpr (N == 1) {</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>[0] = <a class="code" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">index_transform</a>(index);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>[0] = distance;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="keywordtype">int</span> insert_loc = std::min&lt;int&gt;(<a class="code" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">num_found_neighbors</a>, <a class="code" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">buffer_size</a>() - 1);</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <span class="keywordflow">for</span> (; insert_loc &gt; 0 &amp;&amp; distance &lt; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>[insert_loc - 1]; insert_loc--) {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>[insert_loc] = <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>[insert_loc - 1];</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>[insert_loc] = <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>[insert_loc - 1];</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; }</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>[insert_loc] = <a class="code" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">index_transform</a>(index);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>[insert_loc] = distance;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; </div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <a class="code" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">num_found_neighbors</a> = std::min&lt;int&gt;(<a class="code" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">num_found_neighbors</a> + 1, <a class="code" href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">buffer_size</a>());</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; }</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; </div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9"> 103</a></span>&#160; <span class="keyword">const</span> IndexTransform <a class="code" href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">index_transform</a>; </div>
<div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a72aa5dc37a15d67ee31b0286ac4810b0"> 104</a></span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#a72aa5dc37a15d67ee31b0286ac4810b0">capacity</a>; </div>
<div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b"> 105</a></span>&#160; <span class="keywordtype">int</span> <a class="code" href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">num_found_neighbors</a>; </div>
<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a"> 106</a></span>&#160; <span class="keywordtype">size_t</span>* <a class="code" href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">indices</a>; </div>
<div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009"> 107</a></span>&#160; <span class="keywordtype">double</span>* <a class="code" href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">distances</a>; </div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160;};</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;} <span class="comment">// namespace small_gicp</span></div>
<div class="ttc" id="anamespacesmall__gicp_html"><div class="ttname"><a href="namespacesmall__gicp.html">small_gicp</a></div><div class="ttdef"><b>Definition:</b> flat_container.hpp:12</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html">small_gicp::KnnResult</a></div><div class="ttdoc">K-nearest neighbor search result container.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:33</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a02c3e5fef39d23fdc3d6a1ffa444f02f"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a02c3e5fef39d23fdc3d6a1ffa444f02f">small_gicp::KnnResult::worst_distance</a></div><div class="ttdeci">double worst_distance() const</div><div class="ttdoc">Worst distance in the result.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:76</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a0447be8a20d4f3e571ce8850b193f809"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a0447be8a20d4f3e571ce8850b193f809">small_gicp::KnnResult::buffer_size</a></div><div class="ttdeci">size_t buffer_size() const</div><div class="ttdoc">Buffer size (i.e., Maximum number of neighbors)</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:64</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a15258d860e0440fbdb5c733d04e9edb9"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a15258d860e0440fbdb5c733d04e9edb9">small_gicp::KnnResult::index_transform</a></div><div class="ttdeci">const IndexTransform index_transform</div><div class="ttdoc">Point index transformation (e.g., local point index to global point/voxel index)</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:103</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a1f883acc448bd5e01a0c7d4d077e8009"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a1f883acc448bd5e01a0c7d4d077e8009">small_gicp::KnnResult::distances</a></div><div class="ttdeci">double * distances</div><div class="ttdoc">Distances to neighbors.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:107</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a5ecf0353f5e9d5dab6b3dd890c04736e"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a5ecf0353f5e9d5dab6b3dd890c04736e">small_gicp::KnnResult::INVALID</a></div><div class="ttdeci">static constexpr size_t INVALID</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:35</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a72aa5dc37a15d67ee31b0286ac4810b0"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a72aa5dc37a15d67ee31b0286ac4810b0">small_gicp::KnnResult::capacity</a></div><div class="ttdeci">const int capacity</div><div class="ttdoc">Maximum number of neighbors to search.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:104</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a785e85874886bf700f0b12d87e342bf8"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a785e85874886bf700f0b12d87e342bf8">small_gicp::KnnResult::push</a></div><div class="ttdeci">void push(size_t index, double distance)</div><div class="ttdoc">Push a pair of point index and distance to the result.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:80</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_a98726a0269ad1bcc4b330176a1566a28"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#a98726a0269ad1bcc4b330176a1566a28">small_gicp::KnnResult::num_found</a></div><div class="ttdeci">size_t num_found() const</div><div class="ttdoc">Number of found neighbors.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:73</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_aa03cd14f8a2656a96ede4ece59765b3c"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#aa03cd14f8a2656a96ede4ece59765b3c">small_gicp::KnnResult::KnnResult</a></div><div class="ttdeci">KnnResult(size_t *indices, double *distances, int num_neighbors=-1, const IndexTransform &amp;index_transform=identity_transform())</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:41</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_aaf49d70bd20dd57890abf450e71ebc4a"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#aaf49d70bd20dd57890abf450e71ebc4a">small_gicp::KnnResult::indices</a></div><div class="ttdeci">size_t * indices</div><div class="ttdoc">Indices of neighbors.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:106</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnResult_html_ab1507a9270b4dd74215d4fcff27dc59b"><div class="ttname"><a href="structsmall__gicp_1_1KnnResult.html#ab1507a9270b4dd74215d4fcff27dc59b">small_gicp::KnnResult::num_found_neighbors</a></div><div class="ttdeci">int num_found_neighbors</div><div class="ttdoc">Number of found neighbors.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:105</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnSetting_html"><div class="ttname"><a href="structsmall__gicp_1_1KnnSetting.html">small_gicp::KnnSetting</a></div><div class="ttdoc">K-nearest neighbor search setting.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:13</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnSetting_html_a4fd7c9a0d1434abc4d63c905bb17005e"><div class="ttname"><a href="structsmall__gicp_1_1KnnSetting.html#a4fd7c9a0d1434abc4d63c905bb17005e">small_gicp::KnnSetting::epsilon</a></div><div class="ttdeci">double epsilon</div><div class="ttdoc">Early termination threshold.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:22</div></div>
<div class="ttc" id="astructsmall__gicp_1_1KnnSetting_html_ac71f9e05909a6b40586abfc064bd5688"><div class="ttname"><a href="structsmall__gicp_1_1KnnSetting.html#ac71f9e05909a6b40586abfc064bd5688">small_gicp::KnnSetting::fulfilled</a></div><div class="ttdeci">bool fulfilled(const Result &amp;result) const</div><div class="ttdoc">Check if the result satisfies the early termination condition.</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:17</div></div>
<div class="ttc" id="astructsmall__gicp_1_1identity__transform_html"><div class="ttname"><a href="structsmall__gicp_1_1identity__transform.html">small_gicp::identity_transform</a></div><div class="ttdoc">Identity transform (alternative to std::identity in C++20).</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:26</div></div>
<div class="ttc" id="astructsmall__gicp_1_1identity__transform_html_a4acec36f5a756a63ee2730aaf31743ff"><div class="ttname"><a href="structsmall__gicp_1_1identity__transform.html#a4acec36f5a756a63ee2730aaf31743ff">small_gicp::identity_transform::operator()</a></div><div class="ttdeci">size_t operator()(size_t i) const</div><div class="ttdef"><b>Definition:</b> knn_result.hpp:27</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1
</small></address>
</body>
</html>