1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
<html>
<head>
<title>sdk/extensions/authoring/source/VHACD/inc/btAlignedObjectArray.h Source File</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<LINK HREF="NVIDIA.css" REL="stylesheet" TYPE="text/css">
</head>
<body bgcolor="#FFFFFF">
<div id="header">
<hr class="first">
<img alt="" src="blast_logo.png">
<br>
<center>
<a class="qindex" href="main.html">Main Page</a>
<!-- <a class="qindex" href="hierarchy.html">Class Hierarchy</a> //-->
<a class="qindex" href="annotated.html">Class List</a>
<a class="qindex" href="functions.html">Class Members</a>
</center>
<hr class="second">
</div>
<!-- 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><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('bt_aligned_object_array_8h_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">btAlignedObjectArray.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="bt_aligned_object_array_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">Bullet Continuous Collision Detection and Physics Library</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"></span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">This software is provided 'as-is', without any express or implied warranty.</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">In no event will the authors be held liable for any damages arising from the use of this software.</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">Permission is granted to anyone to use this software for any purpose, </span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">including commercial applications, and to alter it and redistribute it freely, </span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">subject to the following restrictions:</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"></span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">3. This notice may not be removed or altered from any source distribution.</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">*/</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#ifndef BT_OBJECT_ARRAY__</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#define BT_OBJECT_ARRAY__</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="bt_aligned_allocator_8h.html">btAlignedAllocator.h</a>"</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="bt_scalar_8h.html">btScalar.h</a>"</span> <span class="comment">// has definitions like SIMD_FORCE_INLINE</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="bt_aligned_object_array_8h.html#abbaa34c72a791d366573e6e25e0bf702"> 28</a></span> <span class="preprocessor">#define BT_USE_PLACEMENT_NEW 1</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//#define BT_USE_MEMCPY 1 //disable, because it is cumbersome to find out for each platform where memcpy is defined. It can be in <memory.h> or <string.h> or otherwise...</span></div><div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="bt_aligned_object_array_8h.html#af679f7a130fd285561d684b76238ecd4"> 30</a></span> <span class="preprocessor">#define BT_ALLOW_ARRAY_COPY_OPERATOR // enabling this can accidently perform deep copies of data if you are not careful</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#ifdef BT_USE_MEMCPY</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <memory.h></span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <string.h></span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#endif //BT_USE_MEMCPY</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#ifdef BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <new></span> <span class="comment">//for placement new</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#endif //BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">//template <class T></span></div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html"> 45</a></span> <span class="keyword">class </span><a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray</a> {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="classbt_aligned_allocator.html">btAlignedAllocator<T, 16></a> m_allocator;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  int32_t m_size;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  int32_t m_capacity;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  T* m_data;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">//PCK: added this line</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordtype">bool</span> m_ownsMemory;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#ifdef BT_ALLOW_ARRAY_COPY_OPERATOR</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ab6ea335622f18386671194eb6bd6a41b"> 56</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray<T></a>& <a class="code" href="classbt_aligned_object_array.html#ab6ea335622f18386671194eb6bd6a41b">operator=</a>(<span class="keyword">const</span> <a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray<T></a>& other)</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="classbt_aligned_object_array.html#a1464bd66b0e5e3880b4c7aa4a2ce13a1">copyFromArray</a>(other);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#else //BT_ALLOW_ARRAY_COPY_OPERATOR</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray<T></a>& <a class="code" href="classbt_aligned_object_array.html#ab6ea335622f18386671194eb6bd6a41b">operator=</a>(<span class="keyword">const</span> <a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray<T></a>& other);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#endif //BT_ALLOW_ARRAY_COPY_OPERATOR</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">protected</span>:</div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#aa719fb250e71cf4c524fc10883d3f9cc"> 67</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> int32_t <a class="code" href="classbt_aligned_object_array.html#aa719fb250e71cf4c524fc10883d3f9cc">allocSize</a>(int32_t <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>)</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> (size ? size * 2 : 1);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#aef1de339623a0ad2c334ad2d5d5ed833"> 71</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#aef1de339623a0ad2c334ad2d5d5ed833">copy</a>(int32_t start, int32_t end, T* dest)<span class="keyword"> const</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  int32_t i;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">for</span> (i = start; i < end; ++i)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> #ifdef <a class="code" href="bt_aligned_object_array_8h.html#abbaa34c72a791d366573e6e25e0bf702">BT_USE_PLACEMENT_NEW</a></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">new</span> (&dest[i]) T(m_data[i]);</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  dest[i] = m_data[i];</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#endif //BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a336631607f9f5f08001866ed11b5fd64"> 82</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a336631607f9f5f08001866ed11b5fd64">init</a>()</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">//PCK: added this line</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  m_ownsMemory = <span class="keyword">true</span>;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  m_data = 0;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  m_size = 0;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  m_capacity = 0;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a8ef274b9d73a61593c17b9b21442e0a7"> 90</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a8ef274b9d73a61593c17b9b21442e0a7">destroy</a>(int32_t first, int32_t last)</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  int32_t i;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span> (i = first; i < last; i++) {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  m_data[i].~T();</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a2302b4abe7664283231e150ecadc4576"> 98</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span>* <a class="code" href="classbt_aligned_object_array.html#a2302b4abe7664283231e150ecadc4576">allocate</a>(int32_t <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (size)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> m_allocator.<a class="code" href="classbt_aligned_allocator.html#a5b14474126ff00cd364dfb74304ec6c3">allocate</a>(size);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#acebca91940aecdb1c11718bc08b511c9"> 105</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#acebca91940aecdb1c11718bc08b511c9">deallocate</a>()</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (m_data) {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">//PCK: enclosed the deallocation in this block</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (m_ownsMemory) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  m_allocator.<a class="code" href="classbt_aligned_allocator.html#a9aa2ce10c6b68eb249116f8712008724">deallocate</a>(m_data);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  m_data = 0;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ad596d8e3e18bf81d9aa3fd21e57e5735"> 117</a></span>  <a class="code" href="classbt_aligned_object_array.html#ad596d8e3e18bf81d9aa3fd21e57e5735">btAlignedObjectArray</a>()</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="classbt_aligned_object_array.html#a336631607f9f5f08001866ed11b5fd64">init</a>();</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a2a7ab868dd49dcf6e2e711d19eac9e54"> 122</a></span>  <a class="code" href="classbt_aligned_object_array.html#a2a7ab868dd49dcf6e2e711d19eac9e54">~btAlignedObjectArray</a>()</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="classbt_aligned_object_array.html#a12123db01dda7758f0df5e3bba10cc0a">clear</a>();</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ae91d1383db8069a02d23caf915bc2ce3"> 128</a></span>  <a class="code" href="classbt_aligned_object_array.html#ae91d1383db8069a02d23caf915bc2ce3">btAlignedObjectArray</a>(<span class="keyword">const</span> <a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray</a>& otherArray)</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="classbt_aligned_object_array.html#a336631607f9f5f08001866ed11b5fd64">init</a>();</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  int32_t otherSize = otherArray.<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="classbt_aligned_object_array.html#acb69833ed110d6db213a71533a8c804a">resize</a>(otherSize);</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  otherArray.<a class="code" href="classbt_aligned_object_array.html#aef1de339623a0ad2c334ad2d5d5ed833">copy</a>(0, otherSize, m_data);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029"> 138</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> int32_t <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">return</span> m_size;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a450b0e394d5ff44ac912bb5de06fc062"> 143</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keyword">const</span> T& <a class="code" href="classbt_aligned_object_array.html#a450b0e394d5ff44ac912bb5de06fc062">at</a>(int32_t n)<span class="keyword"> const</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n >= 0);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n < <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>());</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> m_data[n];</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a9ab50f401fff737aa8d15c6ea1c8de79"> 150</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> T& <a class="code" href="classbt_aligned_object_array.html#a9ab50f401fff737aa8d15c6ea1c8de79">at</a>(int32_t n)</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  {</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n >= 0);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n < <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>());</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">return</span> m_data[n];</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a22ca89a4c813dc8d9727b6bd44df8b13"> 157</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keyword">const</span> T& <a class="code" href="classbt_aligned_object_array.html#a22ca89a4c813dc8d9727b6bd44df8b13">operator[]</a>(int32_t n)<span class="keyword"> const</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n >= 0);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n < <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>());</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> m_data[n];</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ad6e2888f43fb2b23967ef23d6fe905ed"> 164</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> T& <a class="code" href="classbt_aligned_object_array.html#ad6e2888f43fb2b23967ef23d6fe905ed">operator[]</a>(int32_t n)</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n >= 0);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(n < <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>());</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> m_data[n];</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a12123db01dda7758f0df5e3bba10cc0a"> 172</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a12123db01dda7758f0df5e3bba10cc0a">clear</a>()</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="classbt_aligned_object_array.html#a8ef274b9d73a61593c17b9b21442e0a7">destroy</a>(0, <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>());</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="classbt_aligned_object_array.html#acebca91940aecdb1c11718bc08b511c9">deallocate</a>();</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="classbt_aligned_object_array.html#a336631607f9f5f08001866ed11b5fd64">init</a>();</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a6169be905e03b84ea3bc8d8f7c7fc39d"> 181</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a6169be905e03b84ea3bc8d8f7c7fc39d">pop_back</a>()</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a>(m_size > 0);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  m_size--;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  m_data[m_size].~T();</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#acb69833ed110d6db213a71533a8c804a"> 190</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#acb69833ed110d6db213a71533a8c804a">resize</a>(int32_t newsize, <span class="keyword">const</span> T& fillData = T())</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  int32_t curSize = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> (newsize < curSize) {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">for</span> (int32_t i = newsize; i < curSize; i++) {</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  m_data[i].~T();</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (newsize > <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()) {</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="code" href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df">reserve</a>(newsize);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor">#ifdef BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">for</span> (int32_t i = curSize; i < newsize; i++) {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">new</span> (&m_data[i]) T(fillData);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor">#endif //BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  m_size = newsize;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div><div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ad1f99f070780c42619386fd2a4336bec"> 213</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> T& <a class="code" href="classbt_aligned_object_array.html#ad1f99f070780c42619386fd2a4336bec">expandNonInitializing</a>()</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  int32_t sz = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">if</span> (sz == <a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>()) {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df">reserve</a>(<a class="code" href="classbt_aligned_object_array.html#aa719fb250e71cf4c524fc10883d3f9cc">allocSize</a>(<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()));</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  m_size++;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">return</span> m_data[sz];</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ad64affb4ed3f9db81f832cbac6b62527"> 224</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> T& <a class="code" href="classbt_aligned_object_array.html#ad64affb4ed3f9db81f832cbac6b62527">expand</a>(<span class="keyword">const</span> T& fillValue = T())</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  int32_t sz = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">if</span> (sz == <a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>()) {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df">reserve</a>(<a class="code" href="classbt_aligned_object_array.html#aa719fb250e71cf4c524fc10883d3f9cc">allocSize</a>(<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()));</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  m_size++;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="preprocessor">#ifdef BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">new</span> (&m_data[sz]) T(fillValue); <span class="comment">//use the in-place new (not really allocating heap memory)</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> m_data[sz];</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#ad61e10166e2c00f487095d3482b9edd1"> 238</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#ad61e10166e2c00f487095d3482b9edd1">push_back</a>(<span class="keyword">const</span> T& _Val)</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  {</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  int32_t sz = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (sz == <a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>()) {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df">reserve</a>(<a class="code" href="classbt_aligned_object_array.html#aa719fb250e71cf4c524fc10883d3f9cc">allocSize</a>(<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()));</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="preprocessor">#ifdef BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">new</span> (&m_data[m_size]) T(_Val);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  m_data[<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()] = _Val;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="preprocessor">#endif //BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  m_size++;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00255"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6"> 255</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> int32_t <a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> m_capacity;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df"> 260</a></span>  <a class="code" href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a> <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df">reserve</a>(int32_t _Count)</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  { <span class="comment">// determine new minimum length of allocated storage</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (<a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>() < _Count) { <span class="comment">// not enough room, reallocate</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  T* s = (T*)<a class="code" href="classbt_aligned_object_array.html#a2302b4abe7664283231e150ecadc4576">allocate</a>(_Count);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <a class="code" href="classbt_aligned_object_array.html#aef1de339623a0ad2c334ad2d5d5ed833">copy</a>(0, <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>(), s);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="classbt_aligned_object_array.html#a8ef274b9d73a61593c17b9b21442e0a7">destroy</a>(0, <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>());</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="classbt_aligned_object_array.html#acebca91940aecdb1c11718bc08b511c9">deallocate</a>();</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">//PCK: added this line</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  m_ownsMemory = <span class="keyword">true</span>;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  m_data = s;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  m_capacity = _Count;</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array_1_1less.html"> 280</a></span>  <span class="keyword">class </span><a class="code" href="classbt_aligned_object_array_1_1less.html">less</a> {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00282"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array_1_1less.html#a79f471a8270acde691dfb516fd9fe11a"> 282</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classbt_aligned_object_array_1_1less.html#a79f471a8270acde691dfb516fd9fe11a">operator()</a>(<span class="keyword">const</span> T& a, <span class="keyword">const</span> T& b)</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  {</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">return</span> (a < b);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  };</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> L></div><div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a3e15e3b8afa2e9ec6499d6a632db1bde"> 289</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a3e15e3b8afa2e9ec6499d6a632db1bde">quickSortInternal</a>(<span class="keyword">const</span> L& CompareFunc, int32_t lo, int32_t hi)</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  {</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// lo is the lower index, hi is the upper index</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// of the region of array a that is to be sorted</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  int32_t i = lo, j = hi;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  T <a class="code" href="bt_vector3_8h.html#a9ac999fc46ed7720280dca03ad1e4e62">x</a> = m_data[(lo + hi) / 2];</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// partition</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">while</span> (CompareFunc(m_data[i], x))</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  i++;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">while</span> (CompareFunc(x, m_data[j]))</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  j--;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">if</span> (i <= j) {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <a class="code" href="classbt_aligned_object_array.html#aff6f6234bb9c7cd1cea1cf00f07c1c09">swap</a>(i, j);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  i++;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  j--;</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  } <span class="keywordflow">while</span> (i <= j);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// recursion</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (lo < j)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="classbt_aligned_object_array.html#a3e15e3b8afa2e9ec6499d6a632db1bde">quickSortInternal</a>(CompareFunc, lo, j);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span> (i < hi)</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <a class="code" href="classbt_aligned_object_array.html#a3e15e3b8afa2e9ec6499d6a632db1bde">quickSortInternal</a>(CompareFunc, i, hi);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> L></div><div class="line"><a name="l00317"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a96e9890d9c406d43b53b0e5ff0723b2f"> 317</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a96e9890d9c406d43b53b0e5ff0723b2f">quickSort</a>(<span class="keyword">const</span> L& CompareFunc)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  {</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">//don't sort 0 or 1 elements</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">if</span> (<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>() > 1) {</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="code" href="classbt_aligned_object_array.html#a3e15e3b8afa2e9ec6499d6a632db1bde">quickSortInternal</a>(CompareFunc, 0, <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>() - 1);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> L></div><div class="line"><a name="l00327"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a95367248526d4f1a037873c3815ad83e"> 327</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a95367248526d4f1a037873c3815ad83e">downHeap</a>(T* pArr, int32_t k, int32_t n, <span class="keyword">const</span> L& CompareFunc)</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">/* PRE: a[k+1..N] is a heap */</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">/* POST: a[k..N] is a heap */</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  T temp = pArr[k - 1];</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">/* k has child(s) */</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">while</span> (k <= n / 2) {</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  int32_t child = 2 * k;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">if</span> ((child < n) && CompareFunc(pArr[child - 1], pArr[child])) {</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  child++;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">/* pick larger child */</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (CompareFunc(temp, pArr[child - 1])) {</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">/* move child up */</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  pArr[k - 1] = pArr[child - 1];</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  k = child;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  pArr[k - 1] = temp;</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  } <span class="comment">/*downHeap*/</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#aff6f6234bb9c7cd1cea1cf00f07c1c09"> 353</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#aff6f6234bb9c7cd1cea1cf00f07c1c09">swap</a>(int32_t index0, int32_t index1)</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="preprocessor">#ifdef BT_USE_MEMCPY</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordtype">char</span> temp[<span class="keyword">sizeof</span>(T)];</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  memcpy(temp, &m_data[index0], <span class="keyword">sizeof</span>(T));</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  memcpy(&m_data[index0], &m_data[index1], <span class="keyword">sizeof</span>(T));</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  memcpy(&m_data[index1], temp, <span class="keyword">sizeof</span>(T));</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  T temp = m_data[index0];</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  m_data[index0] = m_data[index1];</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  m_data[index1] = temp;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="preprocessor">#endif //BT_USE_PLACEMENT_NEW</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> L></div><div class="line"><a name="l00368"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#aa0979d77c9b1e397d656a0b1ef88b4e6"> 368</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#aa0979d77c9b1e397d656a0b1ef88b4e6">heapSort</a>(<span class="keyword">const</span> L& CompareFunc)</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="comment">/* sort a[0..N-1], N.B. 0 to N-1 */</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  int32_t k;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  int32_t n = m_size;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">for</span> (k = n / 2; k > 0; k--) {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="classbt_aligned_object_array.html#a95367248526d4f1a037873c3815ad83e">downHeap</a>(m_data, k, n, CompareFunc);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  }</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> </div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">/* a[1..N] is now a heap */</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">while</span> (n >= 1) {</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <a class="code" href="classbt_aligned_object_array.html#aff6f6234bb9c7cd1cea1cf00f07c1c09">swap</a>(0, n - 1); <span class="comment">/* largest of a[0..n-1] */</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  n = n - 1;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">/* restore a[1..i-1] heap */</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <a class="code" href="classbt_aligned_object_array.html#a95367248526d4f1a037873c3815ad83e">downHeap</a>(m_data, 1, n, CompareFunc);</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00388"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a41e866c29d79951db983b82bce11a0be"> 388</a></span>  int32_t <a class="code" href="classbt_aligned_object_array.html#a41e866c29d79951db983b82bce11a0be">findBinarySearch</a>(<span class="keyword">const</span> T& key)<span class="keyword"> const</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  int32_t first = 0;</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  int32_t last = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>() - 1;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">//assume sorted array</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">while</span> (first <= last) {</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  int32_t mid = (first + last) / 2; <span class="comment">// compute mid point.</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">if</span> (key > m_data[mid])</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  first = mid + 1; <span class="comment">// repeat search in top half.</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (key < m_data[mid])</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  last = mid - 1; <span class="comment">// repeat search in bottom half.</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">return</span> mid; <span class="comment">// found it. return position /////</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">return</span> <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>(); <span class="comment">// failed to find key</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00406"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a2279dcbcd72877880f91d993c63b2c53"> 406</a></span>  int32_t <a class="code" href="classbt_aligned_object_array.html#a2279dcbcd72877880f91d993c63b2c53">findLinearSearch</a>(<span class="keyword">const</span> T& key)<span class="keyword"> const</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  int32_t index = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  int32_t i;</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> </div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>(); i++) {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (m_data[i] == key) {</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  index = i;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">return</span> index;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a6782242f06df5bab0cffbd23195cd9cd"> 420</a></span>  <span class="keywordtype">void</span> <span class="keyword">remove</span>(<span class="keyword">const</span> T& key)</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  int32_t findIndex = <a class="code" href="classbt_aligned_object_array.html#a2279dcbcd72877880f91d993c63b2c53">findLinearSearch</a>(key);</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (findIndex < <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>()) {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <a class="code" href="classbt_aligned_object_array.html#aff6f6234bb9c7cd1cea1cf00f07c1c09">swap</a>(findIndex, <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>() - 1);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <a class="code" href="classbt_aligned_object_array.html#a6169be905e03b84ea3bc8d8f7c7fc39d">pop_back</a>();</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">//PCK: whole function</span></div><div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a2b1b904bdf0a1e4110406860f46615d5"> 431</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a2b1b904bdf0a1e4110406860f46615d5">initializeFromBuffer</a>(<span class="keywordtype">void</span>* buffer, int32_t <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>, int32_t <a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>)</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  {</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="classbt_aligned_object_array.html#a12123db01dda7758f0df5e3bba10cc0a">clear</a>();</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  m_ownsMemory = <span class="keyword">false</span>;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  m_data = (T*)buffer;</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  m_size = <a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  m_capacity = <a class="code" href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">capacity</a>;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  }</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> </div><div class="line"><a name="l00440"></a><span class="lineno"><a class="line" href="classbt_aligned_object_array.html#a1464bd66b0e5e3880b4c7aa4a2ce13a1"> 440</a></span>  <span class="keywordtype">void</span> <a class="code" href="classbt_aligned_object_array.html#a1464bd66b0e5e3880b4c7aa4a2ce13a1">copyFromArray</a>(<span class="keyword">const</span> <a class="code" href="classbt_aligned_object_array.html">btAlignedObjectArray</a>& otherArray)</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  {</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  int32_t otherSize = otherArray.<a class="code" href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">size</a>();</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="classbt_aligned_object_array.html#acb69833ed110d6db213a71533a8c804a">resize</a>(otherSize);</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  otherArray.<a class="code" href="classbt_aligned_object_array.html#aef1de339623a0ad2c334ad2d5d5ed833">copy</a>(0, otherSize, m_data);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> };</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="preprocessor">#endif //BT_OBJECT_ARRAY__</span></div><div class="ttc" id="classbt_aligned_object_array_html_a3e15e3b8afa2e9ec6499d6a632db1bde"><div class="ttname"><a href="classbt_aligned_object_array.html#a3e15e3b8afa2e9ec6499d6a632db1bde">btAlignedObjectArray::quickSortInternal</a></div><div class="ttdeci">void quickSortInternal(const L &CompareFunc, int32_t lo, int32_t hi)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:289</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a96e9890d9c406d43b53b0e5ff0723b2f"><div class="ttname"><a href="classbt_aligned_object_array.html#a96e9890d9c406d43b53b0e5ff0723b2f">btAlignedObjectArray::quickSort</a></div><div class="ttdeci">void quickSort(const L &CompareFunc)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:317</div></div>
<div class="ttc" id="classbt_aligned_allocator_html"><div class="ttname"><a href="classbt_aligned_allocator.html">btAlignedAllocator< T, 16 ></a></div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ad64affb4ed3f9db81f832cbac6b62527"><div class="ttname"><a href="classbt_aligned_object_array.html#ad64affb4ed3f9db81f832cbac6b62527">btAlignedObjectArray::expand</a></div><div class="ttdeci">SIMD_FORCE_INLINE T & expand(const T &fillValue=T())</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:224</div></div>
<div class="ttc" id="classbt_aligned_object_array_html"><div class="ttname"><a href="classbt_aligned_object_array.html">btAlignedObjectArray</a></div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:45</div></div>
<div class="ttc" id="bt_vector3_8h_html_a9ac999fc46ed7720280dca03ad1e4e62"><div class="ttname"><a href="bt_vector3_8h.html#a9ac999fc46ed7720280dca03ad1e4e62">x</a></div><div class="ttdeci">SIMD_FORCE_INLINE const btScalar & x() const</div><div class="ttdoc">Return the x value. </div><div class="ttdef"><b>Definition:</b> btVector3.h:275</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ae91d1383db8069a02d23caf915bc2ce3"><div class="ttname"><a href="classbt_aligned_object_array.html#ae91d1383db8069a02d23caf915bc2ce3">btAlignedObjectArray::btAlignedObjectArray</a></div><div class="ttdeci">btAlignedObjectArray(const btAlignedObjectArray &otherArray)</div><div class="ttdoc">Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead. </div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:128</div></div>
<div class="ttc" id="bt_aligned_allocator_8h_html"><div class="ttname"><a href="bt_aligned_allocator_8h.html">btAlignedAllocator.h</a></div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a12eda9a3801aad2f9628d82cbf9ba029"><div class="ttname"><a href="classbt_aligned_object_array.html#a12eda9a3801aad2f9628d82cbf9ba029">btAlignedObjectArray::size</a></div><div class="ttdeci">SIMD_FORCE_INLINE int32_t size() const</div><div class="ttdoc">return the number of elements in the array </div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:138</div></div>
<div class="ttc" id="classbt_aligned_allocator_html_a9aa2ce10c6b68eb249116f8712008724"><div class="ttname"><a href="classbt_aligned_allocator.html#a9aa2ce10c6b68eb249116f8712008724">btAlignedAllocator::deallocate</a></div><div class="ttdeci">void deallocate(pointer ptr)</div><div class="ttdef"><b>Definition:</b> btAlignedAllocator.h:88</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ad596d8e3e18bf81d9aa3fd21e57e5735"><div class="ttname"><a href="classbt_aligned_object_array.html#ad596d8e3e18bf81d9aa3fd21e57e5735">btAlignedObjectArray::btAlignedObjectArray</a></div><div class="ttdeci">btAlignedObjectArray()</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:117</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a6169be905e03b84ea3bc8d8f7c7fc39d"><div class="ttname"><a href="classbt_aligned_object_array.html#a6169be905e03b84ea3bc8d8f7c7fc39d">btAlignedObjectArray::pop_back</a></div><div class="ttdeci">SIMD_FORCE_INLINE void pop_back()</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:181</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a9ab50f401fff737aa8d15c6ea1c8de79"><div class="ttname"><a href="classbt_aligned_object_array.html#a9ab50f401fff737aa8d15c6ea1c8de79">btAlignedObjectArray::at</a></div><div class="ttdeci">SIMD_FORCE_INLINE T & at(int32_t n)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:150</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a2279dcbcd72877880f91d993c63b2c53"><div class="ttname"><a href="classbt_aligned_object_array.html#a2279dcbcd72877880f91d993c63b2c53">btAlignedObjectArray::findLinearSearch</a></div><div class="ttdeci">int32_t findLinearSearch(const T &key) const</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:406</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_af300957e9e9fe96ce1d7abf9e1ba1ec6"><div class="ttname"><a href="classbt_aligned_object_array.html#af300957e9e9fe96ce1d7abf9e1ba1ec6">btAlignedObjectArray::capacity</a></div><div class="ttdeci">SIMD_FORCE_INLINE int32_t capacity() const</div><div class="ttdoc">return the pre-allocated (reserved) elements, this is at least as large as the total number of elemen...</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:255</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a95367248526d4f1a037873c3815ad83e"><div class="ttname"><a href="classbt_aligned_object_array.html#a95367248526d4f1a037873c3815ad83e">btAlignedObjectArray::downHeap</a></div><div class="ttdeci">void downHeap(T *pArr, int32_t k, int32_t n, const L &CompareFunc)</div><div class="ttdoc">heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/ </div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:327</div></div>
<div class="ttc" id="classbt_aligned_allocator_html_a5b14474126ff00cd364dfb74304ec6c3"><div class="ttname"><a href="classbt_aligned_allocator.html#a5b14474126ff00cd364dfb74304ec6c3">btAlignedAllocator::allocate</a></div><div class="ttdeci">pointer allocate(size_type n, const_pointer *hint=0)</div><div class="ttdef"><b>Definition:</b> btAlignedAllocator.h:82</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a450b0e394d5ff44ac912bb5de06fc062"><div class="ttname"><a href="classbt_aligned_object_array.html#a450b0e394d5ff44ac912bb5de06fc062">btAlignedObjectArray::at</a></div><div class="ttdeci">SIMD_FORCE_INLINE const T & at(int32_t n) const</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:143</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a2a7ab868dd49dcf6e2e711d19eac9e54"><div class="ttname"><a href="classbt_aligned_object_array.html#a2a7ab868dd49dcf6e2e711d19eac9e54">btAlignedObjectArray::~btAlignedObjectArray</a></div><div class="ttdeci">~btAlignedObjectArray()</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:122</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a1464bd66b0e5e3880b4c7aa4a2ce13a1"><div class="ttname"><a href="classbt_aligned_object_array.html#a1464bd66b0e5e3880b4c7aa4a2ce13a1">btAlignedObjectArray::copyFromArray</a></div><div class="ttdeci">void copyFromArray(const btAlignedObjectArray &otherArray)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:440</div></div>
<div class="ttc" id="bt_scalar_8h_html_aff3e6078c073f6ba0edb95353f2c2c62"><div class="ttname"><a href="bt_scalar_8h.html#aff3e6078c073f6ba0edb95353f2c2c62">btAssert</a></div><div class="ttdeci">#define btAssert(x)</div><div class="ttdef"><b>Definition:</b> btScalar.h:188</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a2b1b904bdf0a1e4110406860f46615d5"><div class="ttname"><a href="classbt_aligned_object_array.html#a2b1b904bdf0a1e4110406860f46615d5">btAlignedObjectArray::initializeFromBuffer</a></div><div class="ttdeci">void initializeFromBuffer(void *buffer, int32_t size, int32_t capacity)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:431</div></div>
<div class="ttc" id="classbt_aligned_object_array_1_1less_html_a79f471a8270acde691dfb516fd9fe11a"><div class="ttname"><a href="classbt_aligned_object_array_1_1less.html#a79f471a8270acde691dfb516fd9fe11a">btAlignedObjectArray::less::operator()</a></div><div class="ttdeci">bool operator()(const T &a, const T &b)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:282</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_aff6f6234bb9c7cd1cea1cf00f07c1c09"><div class="ttname"><a href="classbt_aligned_object_array.html#aff6f6234bb9c7cd1cea1cf00f07c1c09">btAlignedObjectArray::swap</a></div><div class="ttdeci">void swap(int32_t index0, int32_t index1)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:353</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a41e866c29d79951db983b82bce11a0be"><div class="ttname"><a href="classbt_aligned_object_array.html#a41e866c29d79951db983b82bce11a0be">btAlignedObjectArray::findBinarySearch</a></div><div class="ttdeci">int32_t findBinarySearch(const T &key) const</div><div class="ttdoc">non-recursive binary search, assumes sorted array </div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:388</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_aa719fb250e71cf4c524fc10883d3f9cc"><div class="ttname"><a href="classbt_aligned_object_array.html#aa719fb250e71cf4c524fc10883d3f9cc">btAlignedObjectArray::allocSize</a></div><div class="ttdeci">SIMD_FORCE_INLINE int32_t allocSize(int32_t size)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:67</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a22ca89a4c813dc8d9727b6bd44df8b13"><div class="ttname"><a href="classbt_aligned_object_array.html#a22ca89a4c813dc8d9727b6bd44df8b13">btAlignedObjectArray::operator[]</a></div><div class="ttdeci">SIMD_FORCE_INLINE const T & operator[](int32_t n) const</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:157</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a336631607f9f5f08001866ed11b5fd64"><div class="ttname"><a href="classbt_aligned_object_array.html#a336631607f9f5f08001866ed11b5fd64">btAlignedObjectArray::init</a></div><div class="ttdeci">SIMD_FORCE_INLINE void init()</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:82</div></div>
<div class="ttc" id="bt_scalar_8h_html"><div class="ttname"><a href="bt_scalar_8h.html">btScalar.h</a></div></div>
<div class="ttc" id="classbt_aligned_object_array_1_1less_html"><div class="ttname"><a href="classbt_aligned_object_array_1_1less.html">btAlignedObjectArray::less</a></div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:280</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ab6ea335622f18386671194eb6bd6a41b"><div class="ttname"><a href="classbt_aligned_object_array.html#ab6ea335622f18386671194eb6bd6a41b">btAlignedObjectArray::operator=</a></div><div class="ttdeci">SIMD_FORCE_INLINE btAlignedObjectArray< T > & operator=(const btAlignedObjectArray< T > &other)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:56</div></div>
<div class="ttc" id="bt_scalar_8h_html_a8a6a3e8b28846a3d7271e376c738ec40"><div class="ttname"><a href="bt_scalar_8h.html#a8a6a3e8b28846a3d7271e376c738ec40">SIMD_FORCE_INLINE</a></div><div class="ttdeci">#define SIMD_FORCE_INLINE</div><div class="ttdef"><b>Definition:</b> btScalar.h:173</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a8ef274b9d73a61593c17b9b21442e0a7"><div class="ttname"><a href="classbt_aligned_object_array.html#a8ef274b9d73a61593c17b9b21442e0a7">btAlignedObjectArray::destroy</a></div><div class="ttdeci">SIMD_FORCE_INLINE void destroy(int32_t first, int32_t last)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:90</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ad61e10166e2c00f487095d3482b9edd1"><div class="ttname"><a href="classbt_aligned_object_array.html#ad61e10166e2c00f487095d3482b9edd1">btAlignedObjectArray::push_back</a></div><div class="ttdeci">SIMD_FORCE_INLINE void push_back(const T &_Val)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:238</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a8385df1a28956061def9b78cb55ea7df"><div class="ttname"><a href="classbt_aligned_object_array.html#a8385df1a28956061def9b78cb55ea7df">btAlignedObjectArray::reserve</a></div><div class="ttdeci">SIMD_FORCE_INLINE void reserve(int32_t _Count)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:260</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_acebca91940aecdb1c11718bc08b511c9"><div class="ttname"><a href="classbt_aligned_object_array.html#acebca91940aecdb1c11718bc08b511c9">btAlignedObjectArray::deallocate</a></div><div class="ttdeci">SIMD_FORCE_INLINE void deallocate()</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:105</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_aa0979d77c9b1e397d656a0b1ef88b4e6"><div class="ttname"><a href="classbt_aligned_object_array.html#aa0979d77c9b1e397d656a0b1ef88b4e6">btAlignedObjectArray::heapSort</a></div><div class="ttdeci">void heapSort(const L &CompareFunc)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:368</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_aef1de339623a0ad2c334ad2d5d5ed833"><div class="ttname"><a href="classbt_aligned_object_array.html#aef1de339623a0ad2c334ad2d5d5ed833">btAlignedObjectArray::copy</a></div><div class="ttdeci">SIMD_FORCE_INLINE void copy(int32_t start, int32_t end, T *dest) const</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:71</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a12123db01dda7758f0df5e3bba10cc0a"><div class="ttname"><a href="classbt_aligned_object_array.html#a12123db01dda7758f0df5e3bba10cc0a">btAlignedObjectArray::clear</a></div><div class="ttdeci">SIMD_FORCE_INLINE void clear()</div><div class="ttdoc">clear the array, deallocated memory. Generally it is better to use array.resize(0), to reduce performance overhead of run-time memory (de)allocations. </div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:172</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_acb69833ed110d6db213a71533a8c804a"><div class="ttname"><a href="classbt_aligned_object_array.html#acb69833ed110d6db213a71533a8c804a">btAlignedObjectArray::resize</a></div><div class="ttdeci">SIMD_FORCE_INLINE void resize(int32_t newsize, const T &fillData=T())</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:190</div></div>
<div class="ttc" id="bt_aligned_object_array_8h_html_abbaa34c72a791d366573e6e25e0bf702"><div class="ttname"><a href="bt_aligned_object_array_8h.html#abbaa34c72a791d366573e6e25e0bf702">BT_USE_PLACEMENT_NEW</a></div><div class="ttdeci">#define BT_USE_PLACEMENT_NEW</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:28</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ad6e2888f43fb2b23967ef23d6fe905ed"><div class="ttname"><a href="classbt_aligned_object_array.html#ad6e2888f43fb2b23967ef23d6fe905ed">btAlignedObjectArray::operator[]</a></div><div class="ttdeci">SIMD_FORCE_INLINE T & operator[](int32_t n)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:164</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_a2302b4abe7664283231e150ecadc4576"><div class="ttname"><a href="classbt_aligned_object_array.html#a2302b4abe7664283231e150ecadc4576">btAlignedObjectArray::allocate</a></div><div class="ttdeci">SIMD_FORCE_INLINE void * allocate(int32_t size)</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:98</div></div>
<div class="ttc" id="classbt_aligned_object_array_html_ad1f99f070780c42619386fd2a4336bec"><div class="ttname"><a href="classbt_aligned_object_array.html#ad1f99f070780c42619386fd2a4336bec">btAlignedObjectArray::expandNonInitializing</a></div><div class="ttdeci">SIMD_FORCE_INLINE T & expandNonInitializing()</div><div class="ttdef"><b>Definition:</b> btAlignedObjectArray.h:213</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div class="footer">
Copyright © 2015-2017 NVIDIA Corporation, 2701 San Tomas Expressway, Santa Clara, CA 95050 U.S.A. All rights reserved. <a href="http://www.nvidia.com ">www.nvidia.com</a>
</div>
</body>
</html>
|