lili/opennurbs
1
0
Fork 0
mirror of https://github.com/mcneel/opennurbs.git synced 2026-03-30 15:36:52 +08:00
Code Issues Packages Projects Releases Wiki Activity
Files
05ca20eaf4faacef2aba407d3d0ce037e9ed1e16
opennurbs/6/d9/df9/opennurbs__rtree_8h_source.html
Bozo 832ccb5c1a Publish! 
Generated from v6.0.11315.11111-test14
2018-02-03 11:08:49 -08:00

100 lines
134 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.8.13-->
<!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.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>openNURBS SDK Help: D:/BuildAgent/work/d8e3bf9e94f4c621/src4/bin/opennurbs_public/opennurbs_rtree.h 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="https://code.jquery.com/jquery-2.1.1.min.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../customdoxygen.css" rel="stylesheet" type="text/css"/>
<!-- bootstrap -->
<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css" integrity="sha384-BVYiiSIFeK1dGmJRAkycuHAHRg32OmUcww7on3RYdg4Va+PmSTsz/K68vbdEjh4u" crossorigin="anonymous">
<script src="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/js/bootstrap.min.js" integrity="sha384-Tc5IQib027qvyjSMfHjOMaLkfuWVxZxUPnCJA7l2mCWNIpG9mGCD8wGNIcPD7Txa" crossorigin="anonymous"></script>
<!-- smartmenus -->
<link href="../../jquery.smartmenus.bootstrap.css" rel="stylesheet">
<script type="text/javascript" src="../../jquery.smartmenus.js"></script>
<script type="text/javascript" src="../../jquery.smartmenus.bootstrap.js"></script>
</head>
<body>
<!-- <div class="version-banner">
Go back to the <a href="/">main site</a>...
</div> -->
<div class="container">
<!-- navbar -->
<nav class="navbar navbar-default">
<div class="container-fluid">
<a class="navbar-brand" href="#">openNURBS SDK Help</a>
<div class="navbar-collapse collapse" id="main-nav-placeholder">
<!-- <p class="navbar-text navbar-right">v6.0</p> -->
<ul class="nav navbar-nav navbar-right">
<li class="dropdown">
<a class="dropdown-toggle" href="#">v6.0 <span class="caret"></span></a>
<ul class="dropdown-menu">
<li><a href="#">Latest (6.x)</a></li>
<li class="disabled"><a href="#">WIP (7.x)</a></li>
</ul>
</li>
</ul>
</div>
</div>
</nav>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div class="page-content">
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',false,false,'search.php','Search');
});
</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="../../dir_2ea30aa2956a8db99dd22aa5e597f384.html">bin</a></li><li class="navelem"><a class="el" href="../../dir_7a6cfee8d318bd47c162fe536aecd3a7.html">opennurbs_public</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">opennurbs_rtree.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">/* $NoKeywords: $ */</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment">// Copyright (c) 1993-2012 Robert McNeel &amp; Associates. All rights reserved.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment">// OpenNURBS, Rhinoceros, and Rhino3D are registered trademarks of Robert</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment">// McNeel &amp; Associates.</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment">// THIS SOFTWARE IS PROVIDED &quot;AS IS&quot; WITHOUT EXPRESS OR IMPLIED WARRANTY.</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="comment">// ALL IMPLIED WARRANTIES OF FITNESS FOR ANY PARTICULAR PURPOSE AND OF</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="comment">// MERCHANTABILITY ARE HEREBY DISCLAIMED.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="comment">// </span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="comment">// For complete openNURBS copyright information see &lt;http://www.opennurbs.org&gt;.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="comment">//</span><span class="comment"></span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment">////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment"></span>*/</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#if !defined(OPENNURBS_RTREE_INC_)</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#define OPENNURBS_RTREE_INC_</span></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;<span class="comment">/*</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">The opennurbs rtree code is a modifed version of the</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">free and unrestricted R-tree implementation obtianed from </span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="comment">http://www.superliminal.com/sources/sources.htm</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="comment">The first lines on the website indicate the code is free and unrestricted:</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span class="comment"> Free Source Code</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160;<span class="comment"> Here are a few useful bits of free source code. </span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160;<span class="comment"> You&#39;re completely free to use them for any purpose whatsoever.</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;<span class="comment"> All I ask is that if you find one to be particularly valuable, </span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;<span class="comment"> then consider sending feedback. Please send bugs and suggestions too. </span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;<span class="comment"> Enjoy </span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160;<span class="comment">The readme.txt file included with the R-tree source says</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;<span class="comment"> LICENSE:</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;<span class="comment"> Entirely free for all uses. Enjoy!</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;<span class="comment">The original authors are </span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;<span class="comment">AUTHORS</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160;<span class="comment"> * 1983 Original algorithm and test code by Antonin Guttman and Michael Stonebraker, UC Berkely</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160;<span class="comment"> * 1994 ANCI C ported from original test code by Melinda Green - melinda@superliminal.com</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;<span class="comment"> * 1995 Sphere volume fix for degeneracy problem submitted by Paul Brook</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160;<span class="comment"> * 2004 Templated C++ port by Greg Douglas</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160;<span class="comment">The opennurbs version adds some custom memory allocation and replaces</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160;<span class="comment">the leaf iterator. The rest of the changes are cosmetic.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;<span class="comment">*/</span></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;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160;<span class="comment">// Minimum and maximum number of elements </span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160;<span class="comment">// in ON_RTreeNode::m_branch[].</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160;<span class="comment">// must have ON_RTree_MAX_NODE_COUNT &gt; ON_RTree_MIN_NODE_COUNT</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;<span class="preprocessor">#define ON_RTree_MIN_NODE_COUNT 2</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160;<span class="preprocessor">#define ON_RTree_MAX_NODE_COUNT 6</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="comment">In a test of a sphere mesh with mesh: 8385 vertices, 8192 polygons</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;<span class="comment">and ON_RTree_MAX_NODE_COUNT = 3, 4, 5, and 6, the memory use was </span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160;<span class="comment">most efficient with ON_RTree_MAX_NODE_COUNT=6</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160;<span class="comment">Memory Usage MAX_NODE_COUNT = 3</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;<span class="comment"> ON_RTree: 1212 KB (1241136) (352 wasted)</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160;<span class="comment"> ON_RTree: 7036 nodes, 5881 unused branches (321 KB) 0.835844 per node</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160;<span class="comment">Memory Usage MAX_NODE_COUNT = 4</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;<span class="comment"> ON_RTree: 1152 KB (1179720) (5568 wasted)</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;<span class="comment"> ON_RTree: 5051 nodes, 6962 unused branches (380 KB) 1.37834 per node</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;<span class="comment">Memory Usage MAX_NODE_COUNT = 5</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;<span class="comment"> ON_RTree: 1040 KB (1065504) (11808 wasted)</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;<span class="comment"> ON_RTree: 3655 nodes, 6429 unused branches (351 KB) 1.75896 per node</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160;<span class="comment">Memory Usage MAX_NODE_COUNT = 6</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;<span class="comment"> ON_RTree: 995 KB (1019592) (3440 wasted)</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="comment"> ON_RTree: 2951 nodes, 6564 unused branches (358 KB) 2.22433 per node</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;<span class="comment">*/</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160;<span class="comment">// This struct is used instead of ON_BoundingBox to avoid calling</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160;<span class="comment">// constructors.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160;<span class="keyword">struct </span><a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;{</div><div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="../../da/dce/struct_o_n___r_tree_b_box.html"> 86</a></span>&#160; <span class="keywordtype">double</span> <a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html#a5d54876fe2f12b36d33b5bae4beaeae0">m_min</a>[3];</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="keywordtype">double</span> <a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html#acf038f554280b393f49b3e9f492b7aed">m_max</a>[3];</div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="../../da/dce/struct_o_n___r_tree_b_box.html#a5d54876fe2f12b36d33b5bae4beaeae0"> 88</a></span>&#160;};</div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="../../da/dce/struct_o_n___r_tree_b_box.html#acf038f554280b393f49b3e9f492b7aed"> 89</a></span>&#160;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160;<span class="keyword">struct </span><a class="code" href="../../d3/d7f/struct_o_n___r_tree_sphere.html">ON_RTreeSphere</a></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;{</div><div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="../../d3/d7f/struct_o_n___r_tree_sphere.html"> 92</a></span>&#160; <span class="keywordtype">double</span> m_point[3];</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="keywordtype">double</span> m_radius;</div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="../../d3/d7f/struct_o_n___r_tree_sphere.html#ac911f1d84ced53df8d7e148fc5f15d65"> 94</a></span>&#160;};</div><div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="../../d3/d7f/struct_o_n___r_tree_sphere.html#ad4055b617473e3b21e71e8290d57cc4b"> 95</a></span>&#160;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;<span class="keyword">struct </span><a class="code" href="../../df/d46/struct_o_n___r_tree_capsule.html">ON_RTreeCapsule</a></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"><a class="line" href="../../df/d46/struct_o_n___r_tree_capsule.html"> 98</a></span>&#160; <span class="keywordtype">double</span> m_point[2][3];</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="keywordtype">double</span> m_radius;</div><div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="../../df/d46/struct_o_n___r_tree_capsule.html#abcb2b076ee23410df57999167f92da07"> 100</a></span>&#160; <span class="keywordtype">double</span> m_domain[2];</div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="../../df/d46/struct_o_n___r_tree_capsule.html#a1f4722c1c3aef2eac0f9d0ebd5ef0d12"> 101</a></span>&#160;};</div><div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="../../df/d46/struct_o_n___r_tree_capsule.html#a9ebff3c490cfde38dc495b7c9c5f5c6d"> 102</a></span>&#160;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160;<span class="keyword">struct </span><a class="code" href="../../d6/df6/struct_o_n___r_tree_branch.html">ON_RTreeBranch</a></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160;{</div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="../../d6/df6/struct_o_n___r_tree_branch.html"> 105</a></span>&#160; <a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a> m_rect;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="../../d6/df6/struct_o_n___r_tree_branch.html#a6040384abd1d39080d94ac2bac8d4ec7"> 107</a></span>&#160; <span class="comment">// If ON_RTreeNode.m_level &gt; 0, then m_child points to a child node.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="comment">// If ON_RTreeNode.m_level == 0, then m_id identifies the leaf element.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keyword">union</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="keyword">struct </span><a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* m_child;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; ON__INT_PTR m_id;</div><div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="../../d6/df6/struct_o_n___r_tree_branch.html#a0c1b8f1f31cfd2dda7cc9ea4920a9834"> 113</a></span>&#160; };</div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="../../d6/df6/struct_o_n___r_tree_branch.html#a92927792b8efb871942c6bab4d0df7fc"> 114</a></span>&#160;};</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160;<span class="keyword">struct </span><a class="code" href="../../db/d66/struct_o_n___r_tree_leaf.html">ON_RTreeLeaf</a></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160;{</div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="../../db/d66/struct_o_n___r_tree_leaf.html"> 118</a></span>&#160; <a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a> m_rect;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; ON__INT_PTR m_id;</div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="../../db/d66/struct_o_n___r_tree_leaf.html#a62522c697b7348a3835da57153773d78"> 120</a></span>&#160;};</div><div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="../../db/d66/struct_o_n___r_tree_leaf.html#a5cf588e53eb791b4aae8cee725a53643"> 121</a></span>&#160;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;<span class="comment">// The ON_RTreeNode is used at root, branch and leaf nodes.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160;<span class="comment">// When m_level &gt; 0, the node is a branch.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160;<span class="comment">// When m_level = 0, the node is a leaf.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160;<span class="keyword">struct </span><a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160;{</div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="../../de/d18/struct_o_n___r_tree_node.html"> 127</a></span>&#160; <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsInternalNode()<span class="keyword"> const</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160;<span class="keyword"> </span>{ <span class="keywordflow">return</span> (m_level &gt; 0); } <span class="comment">// internal nodes have m_level &gt; 0</span></div><div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="../../de/d18/struct_o_n___r_tree_node.html#aed7b29a0fe4bacf8d56ab6cf3abd59b0"> 129</a></span>&#160; <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsLeaf()<span class="keyword"> const</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160;<span class="keyword"> </span>{ <span class="keywordflow">return</span> (m_level == 0); } <span class="comment">// branch nodes have m_level = 0</span></div><div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="../../de/d18/struct_o_n___r_tree_node.html#a1b79274a571b8bef6a494aa99652f768"> 131</a></span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <span class="comment">// m_level must be a signed int to insure signed compares work correctly</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="keywordtype">int</span> m_level; <span class="comment">// =0 at leaf nodes, &gt; 0 at branch nodes</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160;</div><div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="../../de/d18/struct_o_n___r_tree_node.html#a4d49210e3bb215fb7b2dee29b53a99a4"> 135</a></span>&#160; <span class="comment">// The m_branch[] array contains m_count elements</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="comment">// 0 &lt;= m_count &lt;= ON_RTree_MAX_NODE_COUNT</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <span class="comment">// m_count must be a signed int to insure signed compares work correctly</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <span class="keywordtype">int</span> m_count; </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <a class="code" href="../../d6/df6/struct_o_n___r_tree_branch.html">ON_RTreeBranch</a> m_branch[ON_RTree_MAX_NODE_COUNT];</div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="../../de/d18/struct_o_n___r_tree_node.html#ab6aa9ebca2c1594df59bb318dcdc2f56"> 140</a></span>&#160;};</div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="../../de/d18/struct_o_n___r_tree_node.html#ab7c1f24171c03adb8d6af2a1c765bb1c"> 141</a></span>&#160;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160;<span class="keyword">struct </span><a class="code" href="../../d4/d7d/struct_o_n___r_tree_search_result.html">ON_RTreeSearchResult</a></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160;{</div><div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="../../d4/d7d/struct_o_n___r_tree_search_result.html"> 144</a></span>&#160; <span class="keywordtype">int</span> m_capacity; <span class="comment">// m_id[] array capacity (search terminates when m_count == m_capacity)</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keywordtype">int</span> m_count; <span class="comment">// number of elements in m_id[]</span></div><div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="../../d4/d7d/struct_o_n___r_tree_search_result.html#a5fa8e4f872700937952d4fc2d3c6d0e5"> 146</a></span>&#160; ON__INT_PTR* m_id; <span class="comment">// m_id[] = array of search results.</span></div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="../../d4/d7d/struct_o_n___r_tree_search_result.html#aa0c4e6752c3164eb8f2c5352586b8a76"> 147</a></span>&#160;};</div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="../../d4/d7d/struct_o_n___r_tree_search_result.html#a8be1f578d6a4e8d4c6d19cbeb8dda0a7"> 148</a></span>&#160;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160;<span class="keyword">class </span>ON_CLASS <a class="code" href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160;{</div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="../../d7/d10/class_o_n___r_tree_mem_pool.html"> 151</a></span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a> Empty;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160;</div><div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="../../d7/d10/class_o_n___r_tree_mem_pool.html#a273cb3a0792613b7cf5576b54c07689f"> 154</a></span>&#160; <a class="code" href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <a class="code" href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a>( <span class="keywordtype">size_t</span> leaf_count );</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; ~<a class="code" href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a>();</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* AllocNode();</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; <span class="keywordtype">void</span> FreeNode(<a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* node);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="keyword">struct </span>ON_RTreeListNode* AllocListNode();</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="keywordtype">void</span> FreeListNode(<span class="keyword">struct</span> ON_RTreeListNode* list_node);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordtype">void</span> DeallocateAll();</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160;<span class="comment"> Total number of bytes of heap memory allocated.</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; <span class="keywordtype">size_t</span> SizeOf() <span class="keyword">const</span>;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160;<span class="comment"> Number of bytes of heap memory not currently in use.</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="keywordtype">size_t</span> SizeOfUnusedBuffer() <span class="keyword">const</span>;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <span class="keywordtype">void</span> GrowBuffer();</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <span class="keyword">struct </span>Blk</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; {</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keyword">struct </span>Blk* m_next;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; };</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="comment">// linked list of unused ON_RTreeNode </span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="keyword">struct </span>Blk* m_nodes = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <span class="comment">// linked list of unused ON_RTreeListNode</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keyword">struct </span>Blk* m_list_nodes = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <span class="comment">// buffer for new allocations</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* m_buffer = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keywordtype">size_t</span> m_buffer_capacity = 0;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <span class="keyword">struct </span>Blk* m_blk_list = <span class="keyword">nullptr</span>; <span class="comment">// linked list used to free all allocated memory</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordtype">size_t</span> m_sizeof_blk = 0; <span class="comment">// total amount of memory in each block.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordtype">size_t</span> m_sizeof_heap = 0; <span class="comment">// total amount of heap memory in this rtree</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160;};</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160;<span class="comment">////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160;<span class="comment"></span><span class="comment">//</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160;<span class="comment">// ON_RTreeIterator</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160;<span class="comment">// The ON_RTreeIterator class can be used to iterate each leaf </span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160;<span class="comment">// in an ON_RTree.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="../../db/db0/class_o_n___r_tree_iterator.html"> 209</a></span>&#160;<span class="keyword">class </span>ON_CLASS <a class="code" href="../../db/db0/class_o_n___r_tree_iterator.html">ON_RTreeIterator</a></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160;{</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160;<span class="comment"> Construct an empty iterator. Call Initialize() to attach</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160;<span class="comment"> the iterator to an R-tree.</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160;<span class="comment"> Remark:</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160;<span class="comment"> Any calls to ON_RTree::Insert() or ON_RTree::Remove() that modify</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160;<span class="comment"> an R-tree being iterated invalidate the iterator. The iterator</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160;<span class="comment"> must be re-initialized before being used again.</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160;<span class="comment"> There is no connection between the order elements are inserted</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160;<span class="comment"> in an R-tree and the order the elements are iterated by an</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160;<span class="comment"> iterator. </span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <a class="code" href="../../db/db0/class_o_n___r_tree_iterator.html">ON_RTreeIterator</a>();</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <a class="code" href="../../db/db0/class_o_n___r_tree_iterator.html">ON_RTreeIterator</a>(<span class="keyword">const</span> <span class="keyword">class</span> <a class="code" href="../../dc/d3e/class_o_n___r_tree.html">ON_RTree</a>&amp; a_rtree);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; ~<a class="code" href="../../db/db0/class_o_n___r_tree_iterator.html">ON_RTreeIterator</a>();</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160;<span class="comment"> Initialize an iterator to iterate every leaf in the rtree.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160;<span class="comment"> a_rtree - [in]</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160;<span class="comment"> R-tree to iterate</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160;<span class="comment"> See the comment for ON_RTreeIterator::First().</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160;<span class="comment"> True if a_rtree has at least one element.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160;<span class="comment"> Any calls to ON_RTree::Insert() or ON_RTree::Remove() that modify</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160;<span class="comment"> this node or its children will invalidate this iterator and it</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160;<span class="comment"> must be re-initialized.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160;<span class="comment"> There is no connection between the order elements are inserted</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160;<span class="comment"> in an R-tree and the order the elements are iterated by an</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;<span class="comment"> iterator. </span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; <span class="keywordtype">bool</span> Initialize(<span class="keyword">const</span> <span class="keyword">class</span> <a class="code" href="../../dc/d3e/class_o_n___r_tree.html">ON_RTree</a>&amp; a_rtree);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160;<span class="comment"> Initialize an iterator to iterate every leaf on or below a_node.</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160;<span class="comment"> a_node - [in]</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160;<span class="comment"> R-tree node to iterate</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160;<span class="comment"> See the comment for ON_RTreeIterator::First().</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160;<span class="comment"> True if a_node has at least one element.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160;<span class="comment"> Any calls to ON_RTree::Insert() or ON_RTree::Remove() that modify</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160;<span class="comment"> this node or its children will invalidate this iterator and it</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160;<span class="comment"> must be re-initialized.</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160;<span class="comment"> There is no connection between the order elements are inserted</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160;<span class="comment"> in an R-tree and the order the elements are iterated by an</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160;<span class="comment"> iterator. </span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; <span class="keywordtype">bool</span> Initialize(<span class="keyword">const</span> <span class="keyword">struct</span> <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* a_node);</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160;<span class="comment"> Get the value of the current leaf element. Calling Value()</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160;<span class="comment"> does not increment or decrement the iterator.</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160;<span class="comment"> See the comment for ON_RTreeIterator::First().</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160;<span class="comment"> Return:</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160;<span class="comment"> Null pointer if there are no more leaves to iterate</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160;<span class="comment"> A pointer to the current R-tree leaf. When there are no more leaves,</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160;<span class="comment"> the returned pointer is null.</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="keyword">const</span> <a class="code" href="../../d6/df6/struct_o_n___r_tree_branch.html">ON_RTreeBranch</a>* Value() <span class="keyword">const</span>;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160;<span class="comment"> Reset the iterator so the current leaf is the first leaf in</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160;<span class="comment"> the R-tree. The Initialize() functions automatically do</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160;<span class="comment"> this, but First() can be called if an iterator needs to be</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160;<span class="comment"> used more than once or to make code easy to read and understand.</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160;<span class="comment"> Iterate every leaf in an R-tree.</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160;<span class="comment"> ON_RTree rtree;</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160;<span class="comment"> ...</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160;<span class="comment"> ON_RtreeIterator rit(rtree);</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160;<span class="comment"> const ON_RTreeBranch* rtree_leaf;</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160;<span class="comment"> for ( rit.First(); 0 != (rtree_leaf = rit.Value()); rit.Next() )</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160;<span class="comment"> {</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160;<span class="comment"> // leaf id = rtree_leaf-&gt;m_id</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160;<span class="comment"> // leaf bounding box = rtree-&gt;m_rect</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160;<span class="comment"> }</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160;<span class="comment"> True if a call to Value() will return a non-null pointer.</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160;<span class="comment"> See Also:</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160;<span class="comment"> ON_RTreeIterator::Last();</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160; <span class="keywordtype">bool</span> First();</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160;<span class="comment"> Increment the iterator to the next leaf in the R-tree.</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160;<span class="comment"> See the comment for ON_RTreeIterator::First()</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160;<span class="comment"> True if a call to Value() will return a non-null pointer.</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160;<span class="comment"> False if there is not a next leaf and all susequent calls to</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160;<span class="comment"> Value() will return null.</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160;<span class="comment"> See Also:</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160;<span class="comment"> ON_RTreeIterator::Prev();</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; <span class="keywordtype">bool</span> Next();</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160;<span class="comment"> Set the iterator so the current leaf is the last leaf in the R-tree.</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160;<span class="comment"> Iterate an R-tree in reverse order.</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160;<span class="comment"> ON_RTree rtree;</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160;<span class="comment"> ...</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160;<span class="comment"> ON_RTreeIterator rit(rtree);</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160;<span class="comment"> const ON_RTreeBranch* rtree_leaf;</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160;<span class="comment"> for ( rit.Last(); 0 != (rtree_leaf = rit.Value()); rit.Prev() )</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160;<span class="comment"> {</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>&#160;<span class="comment"> // leaf id = rtree_leaf-&gt;m_id</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>&#160;<span class="comment"> // leaf bounding box = rtree-&gt;m_rect</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>&#160;<span class="comment"> }</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>&#160;<span class="comment"> True if a call to Value() will return a non-null pointer.</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160;<span class="comment"> See Also:</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160;<span class="comment"> ON_RTreeIterator::First();</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; <span class="keywordtype">bool</span> Last();</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160;<span class="comment"> Decrement the iterator to the previous leaf in the R-tree.</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>&#160;<span class="comment"> Example:</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160;<span class="comment"> See the comment for ON_RTreeIterator::Last()</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160;<span class="comment"> True if a call to Value() will return a non-null pointer.</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160;<span class="comment"> False if there is not a previous leaf and all susequent calls to</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160;<span class="comment"> Value() will return null.</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160;<span class="comment"> See Also:</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160;<span class="comment"> ON_RTreeIterator::Next();</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160; <span class="keywordtype">bool</span> Prev();</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>&#160;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160; <span class="keyword">enum</span> { MAX_STACK = 32 }; <span class="comment">// Max stack size. Allows almost n^32 where n is number of branches in node</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160; </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160; <span class="keyword">struct </span>StackElement</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160; {</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; <span class="keyword">const</span> <span class="keyword">struct </span><a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* m_node;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; <span class="keywordtype">int</span> m_branchIndex; <span class="comment">// must be a signed int to insure signed compares work correctly</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; };</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; <span class="keywordtype">bool</span> PushChildren(<span class="keyword">struct</span> StackElement* sp, <span class="keywordtype">bool</span> bFirstChild);</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160; StackElement m_stack[MAX_STACK]; <span class="comment">// stack</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; StackElement* m_sp; <span class="comment">// stack pointer (null or points into m_stack[])</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; <span class="keyword">const</span> <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* m_root; <span class="comment">// root of tree being iterated</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160;};</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>&#160;<span class="keyword">class </span>ON_CLASS ON_RTree</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>&#160;{</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>&#160; <span class="keyword">static</span> <span class="keyword">const</span> ON_RTree Empty;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>&#160;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>&#160; ON_RTree( <span class="keywordtype">size_t</span> leaf_count = 0 );</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>&#160; ~ON_RTree();</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>&#160;</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>&#160;<span class="comment"> Create an R-tree with an element for each face in the mesh.</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>&#160;<span class="comment"> The element id is set to the index of the face.</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>&#160;<span class="comment"> mesh - [in]</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>&#160;<span class="comment"> True if successful.</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00398"></a><span class="lineno"><a class="line" href="../../dc/d3e/class_o_n___r_tree.html"> 398</a></span>&#160; <span class="keywordtype">bool</span> CreateMeshFaceTree( <span class="keyword">const</span> <span class="keyword">class</span> <a class="code" href="../../df/d11/class_o_n___mesh.html">ON_Mesh</a>* mesh );</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160; </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00401"></a><span class="lineno"><a class="line" href="../../dc/d3e/class_o_n___r_tree.html#a195f4a9b64b621cf180e09efd53fbe82"> 401</a></span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160;<span class="comment"> Insert an element into the RTree.</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>&#160;<span class="comment"> a_min - [in]</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160;<span class="comment"> a_max - [in]</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160;<span class="comment"> 3d bounding box of the element. The values in a_min[3] and a_max[3]</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160;<span class="comment"> must satisfy</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160;<span class="comment"> a_min[0] &lt;= a_max[0], </span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160;<span class="comment"> a_min[1] &lt;= a_max[1], and</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160;<span class="comment"> a_min[1] &lt;= a_max[1].</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160;<span class="comment"> a_dataId - [in]</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160;<span class="comment"> id of the element. This can be either a pointer or an integer id.</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160;<span class="comment"> True if element was successfully inserted.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160;<span class="comment"> Calling Insert() or Remove() invalidates any ON_RTreeIterator</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160;<span class="comment"> used to iterate this rtree. </span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; <span class="keywordtype">bool</span> Insert(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3], <span class="keywordtype">void</span>* a_element_id);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; <span class="keywordtype">bool</span> Insert(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3], <span class="keywordtype">int</span> a_element_id);</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; <span class="keywordtype">bool</span> Insert2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2], <span class="keywordtype">void</span>* a_element_id);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160; <span class="keywordtype">bool</span> Insert2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2], <span class="keywordtype">int</span> a_element_id);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160; </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>&#160;<span class="comment"> Remove an element from the RTree.</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160;<span class="comment"> a_min - [in]</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160;<span class="comment"> a_max - [in]</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>&#160;<span class="comment"> 3d bounding box of the element. The values in a_min[3] and a_max[3]</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160;<span class="comment"> must satisfy</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>&#160;<span class="comment"> a_min[0] &lt;= a_max[0], </span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>&#160;<span class="comment"> a_min[1] &lt;= a_max[1], and</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>&#160;<span class="comment"> a_min[2] &lt;= a_max[2].</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>&#160;<span class="comment"> a_dataId - [in]</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>&#160;<span class="comment"> id of the element. This can be either a pointer or an integer id.</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>&#160;<span class="comment"> True if element was successfully removed.</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>&#160;<span class="comment"> Calling Insert() or Remove() invalidates any ON_RTreeIterator</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>&#160;<span class="comment"> used to iterate this rtree. </span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>&#160; <span class="keywordtype">bool</span> Remove(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3], <span class="keywordtype">void</span>* a_elementId);</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>&#160; <span class="keywordtype">bool</span> Remove(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3], <span class="keywordtype">int</span> a_elementId);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>&#160; <span class="keywordtype">bool</span> Remove2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2], <span class="keywordtype">void</span>* a_elementId);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>&#160; <span class="keywordtype">bool</span> Remove2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2], <span class="keywordtype">int</span> a_elementId);</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>&#160; </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>&#160;<span class="comment"> Remove all elements from the R-tree.</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>&#160; <span class="keywordtype">void</span> RemoveAll();</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>&#160;</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>&#160;<span class="comment"> Search the R-tree for all elements whose bounding boxes overlap</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>&#160;<span class="comment"> a_rect.</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>&#160;<span class="comment"> a_rect - [in/out]</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>&#160;<span class="comment"> The version of search that has ON_RTreeBBox* a_rect as the first</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>&#160;<span class="comment"> argument, allows you to shrink the a_rect as the search progresses.</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>&#160;<span class="comment"> This is useful for doing things like searching for closest points.</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>&#160;<span class="comment"> If you want to shrink a_rect, you must use a_context to pass it</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>&#160;<span class="comment"> to the resultCallback function and shrink it in the resultCallback</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>&#160;<span class="comment"> function. In the callback, the modified rect must be contained</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>&#160;<span class="comment"> in the previous rect.</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>&#160;<span class="comment"> a_sphere - [in/out]</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>&#160;<span class="comment"> The version of search that has ON_RTreeSphere* a_sphere as the first</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>&#160;<span class="comment"> argument, allows you to shrink the a_sphere as the search progresses.</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>&#160;<span class="comment"> This is useful for doing things like searching for closest points.</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>&#160;<span class="comment"> If you want to shrink a_sphere, you must use a_context to pass it</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>&#160;<span class="comment"> to the resultCallback function and shrink it in the resultCallback</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>&#160;<span class="comment"> function. In the callback, the modified sphere must be contained</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>&#160;<span class="comment"> in the previous sphere.</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>&#160;<span class="comment"> a_capsule - [in/out]</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>&#160;<span class="comment"> The version of search that has ON_RTreeSphere* a_capsule as the first</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>&#160;<span class="comment"> argument, allows you to shrink the a_capsule as the search progresses.</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>&#160;<span class="comment"> This is useful for doing things like searching for closest points.</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>&#160;<span class="comment"> If you want to shrink a_capsule, you must use a_context to pass it</span></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>&#160;<span class="comment"> to the resultCallback function and shrink it in the resultCallback</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>&#160;<span class="comment"> function. In the callback, the modified capsule must be contained</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>&#160;<span class="comment"> in the previous capsule.</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>&#160;<span class="comment"> a_min - [in]</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>&#160;<span class="comment"> a_max - [in]</span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>&#160;<span class="comment"> (a_min,a_max) is the bounding box of the search region.</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>&#160;<span class="comment"> a_results - [out]</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>&#160;<span class="comment"> The ids of elements that overlaps the search region.</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>&#160;<span class="comment"> resultCallback - [in]</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>&#160;<span class="comment"> A function to call when leaf nodes overlap.</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>&#160;<span class="comment"> a_context - [in]</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>&#160;<span class="comment"> pointer passed to the resultCallback() function.</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>&#160;<span class="comment"> If you are using a Search() that uses a resultCallback() function,</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>&#160;<span class="comment"> then return true to keep searching and false to terminate the search.</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>&#160; <span class="keywordtype">bool</span> Search( </div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>&#160; <a class="code" href="../../d3/d7f/struct_o_n___r_tree_sphere.html">ON_RTreeSphere</a>* a_sphere,</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id),</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>&#160;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>&#160; <span class="keywordtype">bool</span> Search( </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>&#160; <a class="code" href="../../df/d46/struct_o_n___r_tree_capsule.html">ON_RTreeCapsule</a>* a_capsule,</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id),</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>&#160;</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>&#160; <span class="keywordtype">bool</span> Search( </div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>&#160; <a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a>* a_rect,</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id),</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>&#160;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>&#160;<span class="comment"> Search the R-tree for all elements whose bounding boxes overlap</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>&#160;<span class="comment"> the set of points between to parallel planes.</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>&#160;<span class="comment"> a_plane_eqn - [in]</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>&#160;<span class="comment"> a_min - [in]</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>&#160;<span class="comment"> a_max - [in]</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>&#160;<span class="comment"> The region between the parallel planes is the set point points</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>&#160;<span class="comment"> where the value of the plane equation is &gt;= a_min and &lt;= a_max.</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>&#160;<span class="comment"> resultCallback - [in]</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>&#160;<span class="comment"> A function to call when leaf nodes overlap the region between</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>&#160;<span class="comment"> the parallel planes.</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>&#160;<span class="comment"> a_context - [in]</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>&#160;<span class="comment"> pointer passed to the resultCallback() function.</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>&#160;<span class="comment"> If you are using a Search() that uses a resultCallback() function,</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>&#160;<span class="comment"> then return true to keep searching and false to terminate the search.</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>&#160; <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>&#160; <span class="keyword">const</span> <span class="keywordtype">double</span> a_plane_eqn[4],</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>&#160; <span class="keywordtype">double</span> a_min,</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>&#160; <span class="keywordtype">double</span> a_max,</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id),</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>&#160;</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>&#160; <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>&#160; <span class="keyword">const</span> <span class="keyword">class</span> <a class="code" href="../../dd/d89/class_o_n___plane_equation.html">ON_PlaneEquation</a>&amp; a_plane_eqn,</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>&#160; <span class="keywordtype">double</span> a_min,</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>&#160; <span class="keywordtype">double</span> a_max,</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id),</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>&#160;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>&#160; <span class="keywordtype">bool</span> Search(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3],</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id), <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>&#160;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>&#160; <span class="keywordtype">bool</span> Search(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3],</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>&#160; <a class="code" href="../../d4/d7d/struct_o_n___r_tree_search_result.html">ON_RTreeSearchResult</a>&amp; a_result </div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>&#160;</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>&#160; <span class="keywordtype">bool</span> Search(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3],</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;ON_RTreeLeaf&gt;</a>&amp; a_result </div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>&#160;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>&#160; <span class="keywordtype">bool</span> Search(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3],</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;void*&gt;</a>&amp; a_result </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>&#160;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>&#160; <span class="keywordtype">bool</span> Search(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[3], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[3],</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;int&gt;</a>&amp; a_result </div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>&#160;</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>&#160; <span class="keywordtype">bool</span> Search2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2],</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_id), <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>&#160;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>&#160; <span class="keywordtype">bool</span> Search2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2],</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>&#160; <a class="code" href="../../d4/d7d/struct_o_n___r_tree_search_result.html">ON_RTreeSearchResult</a>&amp; a_result</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>&#160;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>&#160; <span class="keywordtype">bool</span> Search2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2],</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;ON_RTreeLeaf&gt;</a>&amp; a_result</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>&#160;</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>&#160; <span class="keywordtype">bool</span> Search2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2],</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;void*&gt;</a>&amp; a_result</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>&#160;</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>&#160; <span class="keywordtype">bool</span> Search2d(<span class="keyword">const</span> <span class="keywordtype">double</span> a_min[2], <span class="keyword">const</span> <span class="keywordtype">double</span> a_max[2],</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;int&gt;</a>&amp; a_result</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>&#160;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>&#160;<span class="comment"> Search two R-trees for all pairs elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>&#160;<span class="comment"> a_rtreeA - [in]</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>&#160;<span class="comment"> a_rtreeB - [in]</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance, </span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>&#160;<span class="comment"> then the pair is added to a_result[].</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>&#160;<span class="comment"> a_result - [out]</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>&#160;<span class="comment"> Pairs of ids of elements who bounding boxes overlap.</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>&#160;<span class="comment"> If you have a single R-tree and you want to find paris of distinct nodes whose</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>&#160;<span class="comment"> bounding boxes overlap, then use the non-static</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>&#160;<span class="comment"> ON_RTree::Search(double tolerance, ... results )</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>&#160;<span class="comment"> member functions.</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>&#160; <span class="keyword">static</span> <span class="keywordtype">bool</span> Search( </div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeA,</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeB, </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;ON_2dex&gt;</a>&amp; a_result</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>&#160; );</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>&#160;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>&#160;<span class="comment"> Search two R-trees for all pairs elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>&#160;<span class="comment"> a_rtreeA - [in]</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>&#160;<span class="comment"> a_rtreeB - [in]</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance, </span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>&#160;<span class="comment"> then resultCallback() is called.</span></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>&#160;<span class="comment"> resultCallback - [out]</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>&#160;<span class="comment"> callback function</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>&#160;<span class="comment"> a_context - [in] argument passed through to resultCallback().</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>&#160;<span class="comment"> If you have a single R-tree and you want to find paris of distinct nodes whose</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>&#160;<span class="comment"> bounding boxes overlap, then use the non-static</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>&#160;<span class="comment"> ON_RTree::Search(double tolerance, ... results )</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>&#160;<span class="comment"> member functions.</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>&#160; <span class="keyword">static</span> <span class="keywordtype">bool</span> Search( </div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeA,</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeB, </div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>&#160; <span class="keywordtype">void</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_idA, ON__INT_PTR a_idB),</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>&#160; );</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>&#160;</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>&#160;<span class="comment"> Search two R-trees for all pairs elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>&#160;<span class="comment"> a_rtreeA - [in]</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>&#160;<span class="comment"> a_rtreeB - [in]</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance, </span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>&#160;<span class="comment"> then resultCallback() is called.</span></div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>&#160;<span class="comment"> resultCallback - [out]</span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>&#160;<span class="comment"> callback function</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>&#160;<span class="comment"> Return true for the search to continue and false to terminate the search.</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>&#160;<span class="comment"> a_context - [in] argument passed through to resultCallback().</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>&#160;<span class="comment"> If you have a single R-tree and you want to find paris of distinct nodes whose</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>&#160;<span class="comment"> bounding boxes overlap, then use the non-static </span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>&#160;<span class="comment"> ON_RTree::Search(double tolerance, ... results )</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>&#160;<span class="comment"> member functions.</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>&#160; <span class="keyword">static</span> <span class="keywordtype">bool</span> Search( </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeA,</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeB, </div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_idA, ON__INT_PTR a_idB),</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>&#160; );</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>&#160;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>&#160;</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>&#160;<span class="comment"> Search two R-trees for all pairs elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>&#160;<span class="comment"> The tolerance can be reduced by the callback function during the search.</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>&#160;<span class="comment"> This version of search is well suited to finding closest points between</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>&#160;<span class="comment"> two objects.</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>&#160;<span class="comment"> a_rtreeA - [in]</span></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>&#160;<span class="comment"> a_rtreeB - [in]</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance,</span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>&#160;<span class="comment"> then resultCallback() is called.</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>&#160;<span class="comment"> resultCallback - [out]</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>&#160;<span class="comment"> callback function</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>&#160;<span class="comment"> Return true for the search to continue and false to terminate the search.</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>&#160;<span class="comment"> The callback may reduce the value of the tolerance parameter during the search.</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>&#160;<span class="comment"> Increasing the value of the tolerance or setting it to an invalid value is</span></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>&#160;<span class="comment"> not supported and will lead to unpredictable results.</span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>&#160;<span class="comment"> a_context - [in] argument passed through to resultCallback().</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>&#160;<span class="comment"> Remarks:</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>&#160;<span class="comment"> If you have a single R-tree and you want to find paris of distinct nodes whose</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>&#160;<span class="comment"> bounding boxes overlap, then use the non-static</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>&#160;<span class="comment"> ON_RTree::Search(double tolerance, ... results )</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>&#160;<span class="comment"> member functions.</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>&#160; <span class="keyword">static</span> <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeA,</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>&#160; <span class="keyword">const</span> ON_RTree&amp; a_rtreeB,</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_idA, ON__INT_PTR a_idB, <span class="keywordtype">double</span>* tolerance),</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>&#160; );</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>&#160;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>&#160;</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>&#160;<span class="comment"> Search a single R-tree for all pairs of distinct elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance,</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>&#160;<span class="comment"> then the pair is added to a_result[].</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>&#160;<span class="comment"> a_result - [out]</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>&#160;<span class="comment"> Pairs of ids of elements who bounding boxes overlap.</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>&#160; <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>&#160; <a class="code" href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray&lt;ON_2dex&gt;</a>&amp; a_result</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>&#160;</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>&#160;<span class="comment"> Search a single R-tree for all pairs of distinct elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance,</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>&#160;<span class="comment"> then resultCallback() is called.</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>&#160;<span class="comment"> resultCallback - [out]</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>&#160;<span class="comment"> callback function</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>&#160;<span class="comment"> a_context - [in] </span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>&#160;<span class="comment"> argument passed through to resultCallback().</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>&#160; <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>&#160; <span class="keywordtype">void</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_idA, ON__INT_PTR a_idB),</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>&#160;</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>&#160;<span class="comment"> Search a single R-tree for all pairs of distinct elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance,</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>&#160;<span class="comment"> then resultCallback() is called.</span></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>&#160;<span class="comment"> resultCallback - [out]</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>&#160;<span class="comment"> callback function</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>&#160;<span class="comment"> a_context - [in]</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>&#160;<span class="comment"> argument passed through to resultCallback().</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>&#160; <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_idA, ON__INT_PTR a_idB),</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>&#160;</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>&#160;<span class="comment"> Description:</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>&#160;<span class="comment"> Search a single R-tree for all pairs of distinct elements whose bounding boxes overlap.</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>&#160;<span class="comment"> Parameters:</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>&#160;<span class="comment"> tolerance - [in]</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>&#160;<span class="comment"> If the distance between a pair of bounding boxes is &lt;= tolerance,</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>&#160;<span class="comment"> then resultCallback() is called.</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>&#160;<span class="comment"> resultCallback - [out]</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>&#160;<span class="comment"> callback function</span></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>&#160;<span class="comment"> Return true for the search to continue and false to terminate the search.</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>&#160;<span class="comment"> The callback may reduce the value of the tolerance parameter during the search.</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>&#160;<span class="comment"> Increasing the value of the tolerance or setting it to an invalid value is</span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>&#160;<span class="comment"> not supported and will lead to unpredictable results.</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>&#160;<span class="comment"> a_context - [in]</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>&#160;<span class="comment"> argument passed through to resultCallback().</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>&#160;<span class="comment"> True if entire tree was searched. It is possible no results were found.</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>&#160; <span class="keywordtype">bool</span> Search(</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>&#160; <span class="keywordtype">double</span> tolerance,</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>&#160; <span class="keywordtype">bool</span> ON_CALLBACK_CDECL resultCallback(<span class="keywordtype">void</span>* a_context, ON__INT_PTR a_idA, ON__INT_PTR a_idB, <span class="keywordtype">double</span>* tolerance),</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>&#160; <span class="keywordtype">void</span>* a_context</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>&#160; ) <span class="keyword">const</span>;</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>&#160;</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>&#160;<span class="comment"> Number of elements (leaves).</span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>&#160;<span class="comment"> Remark:</span></div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>&#160;<span class="comment"> No internal count is maintained, so this function traverses the </span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>&#160;<span class="comment"> tree to count the leaves. If efficiency is important, save the</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>&#160;<span class="comment"> result.</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>&#160; <span class="keywordtype">int</span> ElementCount();</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>&#160;</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>&#160;<span class="comment"> Pointer to the root node.</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>&#160; <span class="keyword">const</span> <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* Root() <span class="keyword">const</span>;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>&#160; </div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>&#160;<span class="comment"> Bounding box of the entire R-tree;</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>&#160; <a class="code" href="../../d1/d17/class_o_n___bounding_box.html">ON_BoundingBox</a> BoundingBox() <span class="keyword">const</span>;</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>&#160;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>&#160; <span class="comment">/*</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>&#160;<span class="comment"> Returns:</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>&#160;<span class="comment"> Number of bytes of heap memory used by this R-tree.</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>&#160; <span class="keywordtype">size_t</span> SizeOf() <span class="keyword">const</span>;</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>&#160;</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>&#160; <span class="keywordtype">void</span> SplitNode(<a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <a class="code" href="../../d6/df6/struct_o_n___r_tree_branch.html">ON_RTreeBranch</a>*, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>**);</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>&#160; <span class="keywordtype">bool</span> AddBranch(<a class="code" href="../../d6/df6/struct_o_n___r_tree_branch.html">ON_RTreeBranch</a>*, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>**);</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>&#160; <span class="keywordtype">bool</span> InsertRectRec(<a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a>*, ON__INT_PTR, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>**, <span class="keywordtype">int</span>);</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>&#160; <span class="keywordtype">bool</span> InsertRect(<a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a>*, ON__INT_PTR, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>**, <span class="keywordtype">int</span>);</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>&#160; <span class="keywordtype">void</span> LoadNodes(<a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <span class="keyword">struct</span> ON_RTreePartitionVars*);</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>&#160; <span class="keywordtype">bool</span> RemoveRect(<a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a>*, ON__INT_PTR, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>**);</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>&#160; <span class="keywordtype">bool</span> RemoveRectRec(<a class="code" href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a>*, ON__INT_PTR, <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <span class="keyword">struct</span> ON_RTreeListNode**);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>&#160; <span class="keywordtype">void</span> ReInsert(<a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*, <span class="keyword">struct</span> ON_RTreeListNode**);</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>&#160; <span class="keywordtype">void</span> RemoveAllRec(<a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>*);</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>&#160; <a class="code" href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a>* m_root = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>&#160; <span class="keywordtype">size_t</span> m_reserved = 0;</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>&#160; <a class="code" href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a> m_mem_pool;</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>&#160;};</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>&#160;</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>&#160;<span class="preprocessor">#endif</span></div><div class="ttc" id="struct_o_n___r_tree_sphere_html"><div class="ttname"><a href="../../d3/d7f/struct_o_n___r_tree_sphere.html">ON_RTreeSphere</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:92</div></div>
<div class="ttc" id="struct_o_n___r_tree_search_result_html"><div class="ttname"><a href="../../d4/d7d/struct_o_n___r_tree_search_result.html">ON_RTreeSearchResult</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:144</div></div>
<div class="ttc" id="struct_o_n___r_tree_b_box_html"><div class="ttname"><a href="../../da/dce/struct_o_n___r_tree_b_box.html">ON_RTreeBBox</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:86</div></div>
<div class="ttc" id="class_o_n___r_tree_html"><div class="ttname"><a href="../../dc/d3e/class_o_n___r_tree.html">ON_RTree</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:398</div></div>
<div class="ttc" id="class_o_n___simple_array_html"><div class="ttname"><a href="../../dc/dfe/class_o_n___simple_array.html">ON_SimpleArray</a></div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:36</div></div>
<div class="ttc" id="struct_o_n___r_tree_capsule_html"><div class="ttname"><a href="../../df/d46/struct_o_n___r_tree_capsule.html">ON_RTreeCapsule</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:98</div></div>
<div class="ttc" id="struct_o_n___r_tree_node_html"><div class="ttname"><a href="../../de/d18/struct_o_n___r_tree_node.html">ON_RTreeNode</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:127</div></div>
<div class="ttc" id="struct_o_n___r_tree_b_box_html_a5d54876fe2f12b36d33b5bae4beaeae0"><div class="ttname"><a href="../../da/dce/struct_o_n___r_tree_b_box.html#a5d54876fe2f12b36d33b5bae4beaeae0">ON_RTreeBBox::m_min</a></div><div class="ttdeci">double m_min[3]</div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:88</div></div>
<div class="ttc" id="struct_o_n___r_tree_leaf_html"><div class="ttname"><a href="../../db/d66/struct_o_n___r_tree_leaf.html">ON_RTreeLeaf</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:118</div></div>
<div class="ttc" id="class_o_n___bounding_box_html"><div class="ttname"><a href="../../d1/d17/class_o_n___bounding_box.html">ON_BoundingBox</a></div><div class="ttdef"><b>Definition:</b> opennurbs_bounding_box.h:25</div></div>
<div class="ttc" id="class_o_n___r_tree_mem_pool_html"><div class="ttname"><a href="../../d7/d10/class_o_n___r_tree_mem_pool.html">ON_RTreeMemPool</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:151</div></div>
<div class="ttc" id="class_o_n___mesh_html"><div class="ttname"><a href="../../df/d11/class_o_n___mesh.html">ON_Mesh</a></div><div class="ttdef"><b>Definition:</b> opennurbs_mesh.h:2188</div></div>
<div class="ttc" id="struct_o_n___r_tree_branch_html"><div class="ttname"><a href="../../d6/df6/struct_o_n___r_tree_branch.html">ON_RTreeBranch</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:105</div></div>
<div class="ttc" id="class_o_n___r_tree_iterator_html"><div class="ttname"><a href="../../db/db0/class_o_n___r_tree_iterator.html">ON_RTreeIterator</a></div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:209</div></div>
<div class="ttc" id="struct_o_n___r_tree_b_box_html_acf038f554280b393f49b3e9f492b7aed"><div class="ttname"><a href="../../da/dce/struct_o_n___r_tree_b_box.html#acf038f554280b393f49b3e9f492b7aed">ON_RTreeBBox::m_max</a></div><div class="ttdeci">double m_max[3]</div><div class="ttdef"><b>Definition:</b> opennurbs_rtree.h:89</div></div>
<div class="ttc" id="class_o_n___plane_equation_html"><div class="ttname"><a href="../../dd/d89/class_o_n___plane_equation.html">ON_PlaneEquation</a></div><div class="ttdoc">Typically the vector portion is a unit vector and m_d = -(x*P.x + y*P.y + z*P.z) for a point P on the...</div><div class="ttdef"><b>Definition:</b> opennurbs_point.h:1433</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- HTML footer for doxygen 1.8.13-->
<!-- start footer part -->
</div> <!-- page-content -->
<hr class="footer"/><address class="footer"><small>
Generated on Sat Feb 3 2018 11:08:27 for openNURBS SDK Help by <a href="http://www.doxygen.org/index.html">
<!-- <img class="footer" src="../../doxygen.png" alt="doxygen"/> -->
Doxygen
</a> 1.8.13
</small></address>
</div> <!-- container -->
<!-- doxy-boot -->
<script type="text/javascript" src="../../doxy-boot.js"></script>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink