mirror of
https://github.com/mcneel/opennurbs.git
synced 2026-03-30 23:57:58 +08:00
176 lines
316 KiB
HTML
176 lines
316 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.14"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>openNURBS SDK Help: /Users/will/dev/github/mcneel/rhino/src4/bin/opennurbs_public/opennurbs_array_defs.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="dynsections.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">openNURBS SDK Help
|
|
 <span id="projectnumber">6.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.14 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_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_array_defs.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/* $NoKeywords: $ */</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">/*</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright (c) 1993-2012 Robert McNeel & Associates. All rights reserved.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <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> <span class="comment">// McNeel & Associates.</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY.</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <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> <span class="comment">// MERCHANTABILITY ARE HEREBY DISCLAIMED.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// </span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// For complete openNURBS copyright information see <http://www.opennurbs.org>.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">//</span><span class="comment"></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> <span class="comment"></span>*/</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#if !defined(ON_ARRAY_DEFS_INC_)</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define ON_ARRAY_DEFS_INC_</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// When this file is parsed with /W4 warnings, two bogus warnings</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// are generated.</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#pragma ON_PRAGMA_WARNING_PUSH</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// The ON_ClassArray<T>::DestroyElement template function generates a</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// C4100: 'x' : unreferenced formal parameter </span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// warning.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// This appears to be caused by a bug in the compiler warning code </span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// or the way templates are expanded. This pragma is needed squelch the</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// bogus warning.</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#pragma ON_PRAGMA_WARNING_DISABLE_MSC(4100)</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="comment">// The ON_CompareIncreasing and ON_CompareDecreasing templates generate a</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// C4211: nonstandard extension used : redefined extern to static</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// warning. Microsoft's compiler appears to have a little trouble </span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// when static functions are declared before they are defined in a </span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// single .cpp file. This pragma is needed squelch the bogus warning.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#pragma ON_PRAGMA_WARNING_DISABLE_MSC(4211)</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// The main reason the definitions of the functions for the </span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// ON_SimpleArray and ON_ClassArray templates are in this separate</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// file is so that the Microsoft developer studio autocomplete</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// functions will work on these classes.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">//</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// This file is included by opennurbs_array.h in the appropriate</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// spot. If you need the definitions in the file, then you</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// should include opennurbs_array.h and let it take care of</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// including this file.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"></span><span class="comment">// Class ON_SimpleArray<></span><span class="comment"></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// construction ////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#aba771b1bd1d30886c96da29ab89b86da"> 57</a></span> T* <a class="code" href="class_o_n___simple_array.html#aba771b1bd1d30886c96da29ab89b86da">ON_SimpleArray<T>::Realloc</a>(T* ptr,<span class="keywordtype">int</span> capacity)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> (T*)onrealloc(ptr,capacity*<span class="keyword">sizeof</span>(T));</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> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a40938b1db05c86fe59395dfabfe3d3be"> 63</a></span> <a class="code" href="class_o_n___simple_array.html#a40938b1db05c86fe59395dfabfe3d3be">ON_SimpleArray<T>::ON_SimpleArray</a>() ON_NOEXCEPT</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  : m_a(<span class="keywordtype">nullptr</span>)</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  , m_count(0)</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  , m_capacity(0)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> {}</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="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#aa4ba7b7d949098cba1e14d26eb0ee473"> 70</a></span> <a class="code" href="class_o_n___simple_array.html#a40938b1db05c86fe59395dfabfe3d3be">ON_SimpleArray<T>::ON_SimpleArray</a>( <span class="keywordtype">size_t</span> c )</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  : m_a(nullptr)</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  , m_count(0)</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  , m_capacity(0)</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> ( c > 0 ) </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="class_o_n___simple_array.html#a67e159de08eb6e1991ec10f551f6df05">SetCapacity</a>( c );</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// Copy constructor</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a2167720a815f88f9cf70acccbb8f22a2"> 81</a></span> <a class="code" href="class_o_n___simple_array.html#a40938b1db05c86fe59395dfabfe3d3be">ON_SimpleArray<T>::ON_SimpleArray</a>( <span class="keyword">const</span> <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T></a>& src )</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  : m_a(0)</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  , m_count(0)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  , m_capacity(0)</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  *<span class="keyword">this</span> = src; <span class="comment">// operator= defined below</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> }</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#af6ae46b8e2bc5ee8f0803fc87e60d4cc"> 90</a></span> <a class="code" href="class_o_n___simple_array.html#af6ae46b8e2bc5ee8f0803fc87e60d4cc">ON_SimpleArray<T>::~ON_SimpleArray</a>()</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>  SetCapacity(0);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> }</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ad64a5a71533d8a06eb1a4961628b6ea2"> 96</a></span> <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T></a>& <a class="code" href="class_o_n___simple_array.html#ad64a5a71533d8a06eb1a4961628b6ea2">ON_SimpleArray<T>::operator=</a>( <span class="keyword">const</span> <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T></a>& src )</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">if</span>( <span class="keyword">this</span> != &src ) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> ( src.<a class="code" href="class_o_n___simple_array.html#a36d30dac6b1d443f64c267e1dbc62ff8">m_count</a> <= 0 ) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  m_count = 0;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> ( m_capacity < src.<a class="code" href="class_o_n___simple_array.html#a36d30dac6b1d443f64c267e1dbc62ff8">m_count</a> ) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  SetCapacity( src.<a class="code" href="class_o_n___simple_array.html#a36d30dac6b1d443f64c267e1dbc62ff8">m_count</a> );</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> ( m_a ) {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  m_count = src.<a class="code" href="class_o_n___simple_array.html#a36d30dac6b1d443f64c267e1dbc62ff8">m_count</a>;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  memcpy( (<span class="keywordtype">void</span>*)(m_a), (<span class="keywordtype">void</span>*)(src.<a class="code" href="class_o_n___simple_array.html#a5a8b7b4e1c8d4720f86d7cdcc880bb1b">m_a</a>), m_count*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</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>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</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> <span class="preprocessor">#if defined(ON_HAS_RVALUEREF)</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// Clone constructor</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <a class="code" href="class_o_n___simple_array.html#a40938b1db05c86fe59395dfabfe3d3be">ON_SimpleArray<T>::ON_SimpleArray</a>( <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T></a>&& src ) ON_NOEXCEPT</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  : m_a(src.m_a)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  , m_count(src.m_count)</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  , m_capacity(src.m_capacity)</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>  src.m_a = 0;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  src.m_count = 0;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  src.m_capacity = 0;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// Clone assignment</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T></a>& <a class="code" href="class_o_n___simple_array.html#ad64a5a71533d8a06eb1a4961628b6ea2">ON_SimpleArray<T>::operator=</a>( <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T></a>&& src ) ON_NOEXCEPT</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span>( <span class="keyword">this</span> != &src ) </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  this->Destroy();</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  m_a = src.m_a;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  m_count = src.m_count;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  m_capacity = src.m_capacity;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  src.m_a = 0;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  src.m_count = 0;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  src.m_capacity = 0;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  } </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// emergency destroy ///////////////////////////////////////////////////</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"> 150</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a8c5f556cc24b13bfd1a4f6d09d1cb060"> 151</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a8c5f556cc24b13bfd1a4f6d09d1cb060">ON_SimpleArray<T>::EmergencyDestroy</a>(<span class="keywordtype">void</span>)</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  m_count = 0;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  m_capacity = 0;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  m_a = 0;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// query ///////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ad44741ad8393d128dae2ff39b8c596c9"> 161</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#ad44741ad8393d128dae2ff39b8c596c9">ON_SimpleArray<T>::Count</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword"></span>{</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span> m_count;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> }</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a7afd26b9d114490a7814353e3590f3a4"> 167</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#a7afd26b9d114490a7814353e3590f3a4">ON_SimpleArray<T>::UnsignedCount</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="keyword"></span>{</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_count);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00173"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ae06989b66432ab66a49511406d675ed9"> 173</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#ae06989b66432ab66a49511406d675ed9">ON_SimpleArray<T>::Capacity</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="keyword"></span>{</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">return</span> m_capacity;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> }</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a7ddb43ae86d40b5088a9ed0852354899"> 179</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#a7ddb43ae86d40b5088a9ed0852354899">ON_SimpleArray<T>::SizeOfArray</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="keyword"></span>{</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)(m_capacity*<span class="keyword">sizeof</span>(T)));</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> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ae78ec3ac6f59fd1d61e69e334124f2f5"> 185</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#ae78ec3ac6f59fd1d61e69e334124f2f5">ON_SimpleArray<T>::SizeOfElement</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="keyword"></span>{</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)(<span class="keyword">sizeof</span>(T)));</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#aa3c8412725dd56733bbabee62e45f60d"> 192</a></span> ON__UINT32 <a class="code" href="class_o_n___simple_array.html#aa3c8412725dd56733bbabee62e45f60d">ON_SimpleArray<T>::DataCRC</a>(ON__UINT32 current_remainder)<span class="keyword"> const</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="keyword"></span>{</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">return</span> ON_CRC32(current_remainder,m_count*<span class="keyword">sizeof</span>(m_a[0]),m_a);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316"> 198</a></span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>( <span class="keywordtype">int</span> i )</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> { </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> ( i < 0 || i > m_capacity )</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>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l00207"></a><span class="lineno"> 207</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ac42b39ddc18d712e7832d2ed7beaae48"> 210</a></span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i )</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> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_capacity )</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>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> }</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> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a68ee1659cd48cdae78a8b6eb8447ddb5"> 223</a></span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>( ON__INT64 i )</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> { </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> ( i < 0 || i > (ON__INT64)m_capacity )</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> }</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a2899531140c9ec8bba95b18834816322"> 235</a></span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>( ON__UINT64 i )</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> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span> ( i > (ON__UINT64)m_capacity )</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>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">return</span> m_a[i]; </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> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="preprocessor">#if defined(ON_RUNTIME_APPLE)</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>(<span class="keywordtype">size_t</span> i )</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> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">size_t</span>)m_capacity )</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> m_a[i]; </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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a641229ffd53108673b50706d895bd894"> 262</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="keyword"></span>{</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> ( i < 0 || i > m_capacity )</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>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00274"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ac894bc67c5ecd127b40eb0cd17fd9438"> 274</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="keyword"></span>{</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_capacity )</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>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">return</span> m_a[i];</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> </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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a6fb431a9f72adc2703af9726e8ffd90d"> 287</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>(ON__INT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="keyword"></span>{</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">if</span> ( i < 0 || i > ((ON__INT64)m_capacity) )</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00299"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#abfb3ee20b3487baee323f8900dc37282"> 299</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>(ON__UINT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="keyword"></span>{</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">if</span> ( i > (ON__UINT64)m_capacity )</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  {</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> m_a[i];</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> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="preprocessor">#if defined(ON_RUNTIME_APPLE)</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray<T>::operator[]</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="keyword"></span>{</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">size_t</span>)m_capacity )</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  ON_ERROR(<span class="stringliteral">"ON_SimpleArray[i]: i out of range."</span>);</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="preprocessor">#endif</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="preprocessor">#endif</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00325"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#aedf3af5aa6188ab4ade1f2fd3f910938"> 325</a></span> <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T>::operator</a> T*()</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</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> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a107e3d0dffa5187fed1ce114afdd7d5f"> 331</a></span> <a class="code" href="class_o_n___simple_array.html">ON_SimpleArray<T>::operator</a> <span class="keyword">const</span> T*() <span class="keyword">const</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#adce0cef747a0af8ba530d783803eebea"> 337</a></span> T* <a class="code" href="class_o_n___simple_array.html#adce0cef747a0af8ba530d783803eebea">ON_SimpleArray<T>::Array</a>()</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> }</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a0f00cbefe33723a49999cd813965ed44"> 343</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#adce0cef747a0af8ba530d783803eebea">ON_SimpleArray<T>::Array</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="keyword"></span>{</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#afff693cde3bcf58c12392bc286204962"> 349</a></span> T* <a class="code" href="class_o_n___simple_array.html#afff693cde3bcf58c12392bc286204962">ON_SimpleArray<T>::KeepArray</a>()</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  T* p = m_a;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  m_a = 0;</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  m_count = 0;</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  m_capacity = 0;</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">return</span> p;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> }</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00359"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a741ee52742f90e2c7f5747700e161ea4"> 359</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a741ee52742f90e2c7f5747700e161ea4">ON_SimpleArray<T>::SetArray</a>(T* p)</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> {</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> ( m_a && m_a != p )</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  onfree(m_a);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  m_a = p;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00367"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a1df4d304d2be6c2da1fec97a5cc462a3"> 367</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a741ee52742f90e2c7f5747700e161ea4">ON_SimpleArray<T>::SetArray</a>(T* p, <span class="keywordtype">int</span> count, <span class="keywordtype">int</span> capacity)</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> {</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> ( m_a && m_a != p )</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  onfree(m_a);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  m_a = p;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  m_count = count;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  m_capacity = capacity;</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> }</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00377"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#adc4dd6d8de7311c1be580a62b3bcb8e4"> 377</a></span> T* <a class="code" href="class_o_n___simple_array.html#adc4dd6d8de7311c1be580a62b3bcb8e4">ON_SimpleArray<T>::First</a>()</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> { </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</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> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00383"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a16d639114475493490dd7cb240b18c67"> 383</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#adc4dd6d8de7311c1be580a62b3bcb8e4">ON_SimpleArray<T>::First</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="keyword"></span>{</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00389"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda"> 389</a></span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( <span class="keywordtype">int</span> i )</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> { </div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">return</span> (i >= 0 && i < m_count) ? m_a+i : 0;</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> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#afa89dd45155f60eabc7dd1532c0765c0"> 395</a></span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i )</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> { </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> (i < (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_count) ? m_a+i : 0;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00401"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a880316e8fb44975018200ea437dc5b93"> 401</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( <span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="keyword"></span>{</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">return</span> (i >= 0 && i < m_count) ? m_a+i : 0;</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"> 406</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00407"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a96a27ef6a8d802224df16a88770514f4"> 407</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="keyword"></span>{</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">return</span> (i < (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_count) ? m_a+i : 0;</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> </div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00413"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a611694064836a1fb23972f7c335687d8"> 413</a></span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( ON__INT64 i )</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> { </div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> (i >= 0 && i < (ON__INT64)m_count) ? m_a+i : 0;</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> </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00419"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ad0783582413ac3a8de62b936fee0351b"> 419</a></span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( ON__UINT64 i )</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> { </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">return</span> (i < (ON__UINT64)m_count) ? m_a+i : 0;</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> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00425"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ae161661243669e43d36200489c54003e"> 425</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( ON__INT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="keyword"></span>{</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">return</span> (i >= 0 && i < (ON__INT64)m_count) ? m_a+i : 0;</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="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ad0d94bd1f923919e78b68e4e4e3072c9"> 431</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray<T>::At</a>( ON__UINT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="keyword"></span>{</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">return</span> (i < (ON__UINT64)m_count) ? m_a+i : 0;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00437"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a11948f1e15b893414a0b432fd23a9d80"> 437</a></span> T* <a class="code" href="class_o_n___simple_array.html#a11948f1e15b893414a0b432fd23a9d80">ON_SimpleArray<T>::Last</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>  <span class="keywordflow">return</span> (m_count > 0) ? m_a+(m_count-1) : 0;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> }</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> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00443"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a8a29206db50e59b7c598c8734444fe4a"> 443</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___simple_array.html#a11948f1e15b893414a0b432fd23a9d80">ON_SimpleArray<T>::Last</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="keyword"></span>{</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a+(m_count-1) : 0;</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="comment">// array operations ////////////////////////////////////////////////////</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00451"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a99f627acedd725d474cae55985b02c8e"> 451</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a99f627acedd725d474cae55985b02c8e">ON_SimpleArray<T>::Move</a>( <span class="keywordtype">int</span> dest_i, <span class="keywordtype">int</span> src_i, <span class="keywordtype">int</span> ele_cnt )</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> {</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// private function for moving blocks of array memory</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// caller is responsible for updating m_count.</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">if</span> ( ele_cnt <= 0 || src_i < 0 || dest_i < 0 || src_i == dest_i || </div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  src_i + ele_cnt > m_count || dest_i > m_count )</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordtype">int</span> capacity = dest_i + ele_cnt;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">if</span> ( capacity > m_capacity ) {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> ( capacity < 2*m_capacity )</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  capacity = 2*m_capacity;</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  SetCapacity( capacity );</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  }</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  memmove( &m_a[dest_i], &m_a[src_i], ele_cnt*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> }</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00470"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ad6fb51ad272618b034b8dd4695094a2d"> 470</a></span> T& <a class="code" href="class_o_n___simple_array.html#ad6fb51ad272618b034b8dd4695094a2d">ON_SimpleArray<T>::AppendNew</a>()</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> ( m_count == m_capacity ) </div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  {</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordtype">int</span> new_capacity = NewCapacity();</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  Reserve( new_capacity );</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[m_count]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">return</span> m_a[m_count++];</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> }</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00482"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a191f36f7af3813d99dac25c910a7f9a5"> 482</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a191f36f7af3813d99dac25c910a7f9a5">ON_SimpleArray<T>::Append</a>( <span class="keyword">const</span> T& x ) </div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> {</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">if</span> ( m_count == m_capacity ) </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">if</span> (m_a)</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  {</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> s = (int)(&x - m_a); <span class="comment">// (int) cast is for 64 bit pointers</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">if</span> ( s >= 0 && s < m_capacity )</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  {</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="comment">// 26 Sep 2005 Dale Lear</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// User passed in an element of the m_a[]</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// that will get reallocated by the call</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// to Reserve(newcapacity).</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  T temp; <span class="comment">// ON_*Array<> templates do not require robust copy constructor.</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  temp = x; <span class="comment">// ON_*Array<> templates require a robust operator=.</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  Reserve( newcapacity );</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  m_a[m_count++] = temp;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  Reserve(newcapacity);</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  }</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  m_a[m_count++] = x;</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> }</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00509"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a5e10b309af51f313e265059bb1240559"> 509</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a191f36f7af3813d99dac25c910a7f9a5">ON_SimpleArray<T>::Append</a>( <span class="keywordtype">int</span> count, <span class="keyword">const</span> T* p ) </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> {</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> ( count > 0 && p ) </div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  {</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> ( count + m_count > m_capacity ) </div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  {</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> ( newcapacity < count + m_count )</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  newcapacity = count + m_count;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  Reserve( newcapacity );</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  memcpy( (<span class="keywordtype">void</span>*)(m_a + m_count), (<span class="keywordtype">void</span>*)(p), count*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  m_count += count;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00526"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a4a0e9f915b7b24ce1c9d700e011f3cce"> 526</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a4a0e9f915b7b24ce1c9d700e011f3cce">ON_SimpleArray<T>::Insert</a>( <span class="keywordtype">int</span> i, <span class="keyword">const</span> T& x ) </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> {</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">if</span>( i >= 0 && i <= m_count ) </div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  {</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> ( m_count == m_capacity ) </div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  {</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  Reserve( newcapacity );</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  m_count++;</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  Move( i+1, i, m_count-1-i );</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  m_a[i] = x;</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00542"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#ab5bef8e837e8f2dc8556170a768974d2"> 542</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#ab5bef8e837e8f2dc8556170a768974d2">ON_SimpleArray<T>::Remove</a>()</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> {</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  Remove(m_count-1);</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> } </div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00548"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a2d6bf147723edfa66c5dbe7c85aac5c1"> 548</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#ab5bef8e837e8f2dc8556170a768974d2">ON_SimpleArray<T>::Remove</a>( <span class="keywordtype">int</span> i )</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> {</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">if</span> ( i >= 0 && i < m_count ) {</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  Move( i, i+1, m_count-1-i );</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  m_count--;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[m_count]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> } </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00558"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a8d37e0c0eaf603fffdd9c3e9e3d1fe48"> 558</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a8d37e0c0eaf603fffdd9c3e9e3d1fe48">ON_SimpleArray<T>::Empty</a>()</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> {</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">if</span> ( m_a )</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  memset( (<span class="keywordtype">void</span>*)(m_a), 0, m_capacity*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  m_count = 0;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> </div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00566"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a8ea224d8ba49b55fce89f04657ccb0e5"> 566</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a8ea224d8ba49b55fce89f04657ccb0e5">ON_SimpleArray<T>::Reverse</a>()</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// NOTE:</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// If anything in "T" depends on the value of this's address,</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// then don't call Reverse().</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  T t;</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordtype">int</span> i = 0; </div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordtype">int</span> j = m_count-1;</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">for</span> ( <span class="comment">/*empty*/</span>; i < j; i++, j-- ) {</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  t = m_a[i];</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  m_a[i] = m_a[j];</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  m_a[j] = t;</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> }</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a586cf6b13a035d38f5eeeafec97fdff6"> 582</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a586cf6b13a035d38f5eeeafec97fdff6">ON_SimpleArray<T>::Swap</a>( <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j )</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> {</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">if</span> ( i != j ) {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</span> T t(m_a[i]);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  m_a[i] = m_a[j];</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  m_a[j] = t;</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  }</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00592"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#aa4f0900f2e6c9ca19f49dbc2c0ed8a32"> 592</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#aa4f0900f2e6c9ca19f49dbc2c0ed8a32">ON_SimpleArray<T>::Search</a>( <span class="keyword">const</span> T& key )<span class="keyword"> const</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="keyword"></span>{</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">const</span> T* p = &key;</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">for</span> ( <span class="keywordtype">int</span> i = 0; i < m_count; i++ ) {</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">if</span> (!memcmp(p,m_a+i,<span class="keyword">sizeof</span>(T))) </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">return</span> i;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00603"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a6270dba096ef3655b75f3aeb211d1139"> 603</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#aa4f0900f2e6c9ca19f49dbc2c0ed8a32">ON_SimpleArray<T>::Search</a>( <span class="keyword">const</span> T* key, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )<span class="keyword"> const</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="keyword"></span>{</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keywordflow">for</span> ( <span class="keywordtype">int</span> i = 0; i < m_count; i++ ) {</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">if</span> (!compar(key,m_a+i)) </div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">return</span> i;</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> }</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00613"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#adfff8569ef8e5248c46a586d3a7f5d8d"> 613</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#adfff8569ef8e5248c46a586d3a7f5d8d">ON_SimpleArray<T>::BinarySearch</a>( <span class="keyword">const</span> T* key, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )<span class="keyword"> const</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="keyword"></span>{</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keyword">const</span> T* found = (key&&m_a&&m_count>0) </div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  ? (<span class="keyword">const</span> T*)bsearch( key, m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar ) </div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  : 0;</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// This worked on a wide range of 32 bit compilers.</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordtype">int</span> rc;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">if</span> ( 0 != found )</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  {</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// Convert "found" pointer to array index.</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="preprocessor">#if defined(ON_COMPILER_MSC1300)</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  rc = ((int)(found - m_a));</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="preprocessor">#elif 8 == ON_SIZEOF_POINTER</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// In an ideal world, return ((int)(found - m_a)) would work everywhere.</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// In practice, this should work any 64 bit compiler and we can hope</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// the optimzer generates efficient code.</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keyword">const</span> ON__UINT64 fptr = (ON__UINT64)found;</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keyword">const</span> ON__UINT64 aptr = (ON__UINT64)m_a;</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keyword">const</span> ON__UINT64 sz = (ON__UINT64)<span class="keyword">sizeof</span>(T);</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keyword">const</span> ON__UINT64 i = (fptr - aptr)/sz;</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  rc = (int)i;</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// In an ideal world, return ((int)(found - m_a)) would work everywhere.</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// In practice, this should work any 32 bit compiler and we can hope</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="comment">// the optimzer generates efficient code.</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keyword">const</span> ON__UINT32 fptr = (ON__UINT32)found;</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">const</span> ON__UINT32 aptr = (ON__UINT32)m_a;</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keyword">const</span> ON__UINT32 sz = (ON__UINT32)<span class="keyword">sizeof</span>(T);</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keyword">const</span> ON__UINT32 i = (fptr - aptr)/sz;</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  rc = (int)i;</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  {</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// "key" not found</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  rc = -1;</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  }</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> </div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00659"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a6772cea657f623fe7d690786433b12d2"> 659</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#adfff8569ef8e5248c46a586d3a7f5d8d">ON_SimpleArray<T>::BinarySearch</a>( <span class="keyword">const</span> T* key, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*), <span class="keywordtype">int</span> count )<span class="keyword"> const</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="keyword"></span>{</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> ( count > m_count )</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  count = m_count;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">if</span> ( count <= 0 )</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">const</span> T* found = (key&&m_a&&m_count>0) </div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  ? (<span class="keyword">const</span> T*)bsearch( key, m_a, count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar ) </div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  : 0;</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">// This worked on a wide range of 32 bit compilers.</span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> </div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordtype">int</span> rc;</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">if</span> ( 0 != found )</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  {</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// Convert "found" pointer to array index.</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> </div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="preprocessor">#if defined(ON_COMPILER_MSC1300)</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  rc = ((int)(found - m_a));</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="preprocessor">#elif 8 == ON_SIZEOF_POINTER</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// In an ideal world, return ((int)(found - m_a)) would work everywhere.</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// In practice, this should work any 64 bit compiler and we can hope</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// the optimzer generates efficient code.</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keyword">const</span> ON__UINT64 fptr = (ON__UINT64)found;</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">const</span> ON__UINT64 aptr = (ON__UINT64)m_a;</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">const</span> ON__UINT64 sz = (ON__UINT64)<span class="keyword">sizeof</span>(T);</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">const</span> ON__UINT64 i = (fptr - aptr)/sz;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  rc = (int)i;</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// In an ideal world, return ((int)(found - m_a)) would work everywhere.</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="comment">// In practice, this should work any 32 bit compiler and we can hope</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="comment">// the optimzer generates efficient code.</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">const</span> ON__UINT32 fptr = (ON__UINT32)found;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keyword">const</span> ON__UINT32 aptr = (ON__UINT32)m_a;</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keyword">const</span> ON__UINT32 sz = (ON__UINT32)<span class="keyword">sizeof</span>(T);</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keyword">const</span> ON__UINT32 i = (fptr - aptr)/sz;</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  rc = (int)i;</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  {</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// "key" not found</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  rc = -1;</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  }</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> }</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> </div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> </div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> </div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00709"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a81068392f935f0d7efa9d772960bf157"> 709</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___simple_array.html#a81068392f935f0d7efa9d772960bf157">ON_SimpleArray<T>::HeapSort</a>( <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> {</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar ) {</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  ON_hsort( m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  }</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> }</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> </div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00721"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a8edc28b59c54bb9ab779199dd0e9c937"> 721</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___simple_array.html#a8edc28b59c54bb9ab779199dd0e9c937">ON_SimpleArray<T>::QuickSort</a>( <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> {</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar ) {</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  ON_qsort( m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  }</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> }</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> </div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00733"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a14e3d8c3c9542339ffabe5b404b76062"> 733</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___simple_array.html#a14e3d8c3c9542339ffabe5b404b76062">ON_SimpleArray<T>::Sort</a>( ON::sort_algorithm sa, <span class="keywordtype">int</span>* index, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )<span class="keyword"> const</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="keyword"></span>{</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar && index ) {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  ON_Sort(sa, index, m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( m_count == 1 )</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  index[0] = 0;</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> }</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> </div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00747"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a984f3c72a00955b8aa497b4d7e716c72"> 747</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___simple_array.html#a14e3d8c3c9542339ffabe5b404b76062">ON_SimpleArray<T>::Sort</a>( ON::sort_algorithm sa, <span class="keywordtype">int</span>* index, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*,<span class="keywordtype">void</span>*),<span class="keywordtype">void</span>* p )<span class="keyword"> const</span></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="keyword"></span>{</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar && index ) {</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  ON_Sort(sa, index, m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keywordtype">void</span>*))compar, p );</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( m_count == 1 )</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  index[0] = 0;</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> }</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> </div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00761"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#abe6cd30eaa175e4c03cc23576acdd4f0"> 761</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___simple_array.html#abe6cd30eaa175e4c03cc23576acdd4f0">ON_SimpleArray<T>::Permute</a>( <span class="keyword">const</span> <span class="keywordtype">int</span>* index )</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && index ) {</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  T* buffer = (T*)onmalloc(m_count*<span class="keyword">sizeof</span>(buffer[0]));</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  memcpy( (<span class="keywordtype">void</span>*)(buffer), (<span class="keywordtype">void</span>*)(m_a), m_count*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">for</span> (i = 0; i < m_count; i++ )</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  memcpy( (<span class="keywordtype">void</span>*)(m_a+i), (<span class="keywordtype">void</span>*)(buffer+index[i]), <span class="keyword">sizeof</span>(T) ); <span class="comment">// must use memcopy and not operator=</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  onfree(buffer);</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> }</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> </div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00777"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a0cb4a97082e4918b628d81b1fbb1516a"> 777</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a0cb4a97082e4918b628d81b1fbb1516a">ON_SimpleArray<T>::Zero</a>()</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> {</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">if</span> ( m_a && m_capacity > 0 ) {</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  memset( (<span class="keywordtype">void</span>*)(m_a), 0, m_capacity*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> }</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> </div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00785"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a9e27ce66d3c528a0b4ab6423b3524d33"> 785</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a9e27ce66d3c528a0b4ab6423b3524d33">ON_SimpleArray<T>::MemSet</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> value )</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> {</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">if</span> ( m_a && m_capacity > 0 ) {</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  memset( (<span class="keywordtype">void</span>*)(m_a), value, m_capacity*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span> }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span> <span class="comment">// memory managment ////////////////////////////////////////////////////</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> </div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00795"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a854343dc47d8e351690acaa531f2b44a"> 795</a></span> T* <a class="code" href="class_o_n___simple_array.html#a854343dc47d8e351690acaa531f2b44a">ON_SimpleArray<T>::Reserve</a>( <span class="keywordtype">size_t</span> newcap ) </div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> {</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">if</span>( (<span class="keywordtype">size_t</span>)m_capacity < newcap )</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  SetCapacity( newcap );</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> }</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> </div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00803"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a02045fb0cf4c9c24aabba20a2ae0c9f0"> 803</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a02045fb0cf4c9c24aabba20a2ae0c9f0">ON_SimpleArray<T>::Shrink</a>()</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> {</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  SetCapacity( m_count );</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> }</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00809"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a56a43009d39635f9c0a08272391b5951"> 809</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a56a43009d39635f9c0a08272391b5951">ON_SimpleArray<T>::Destroy</a>()</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> {</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  SetCapacity( 0 );</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> }</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> </div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment">// low level memory managment //////////////////////////////////////////</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> </div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00817"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a449bfb832fcb364e9b8349ea4dc8a343"> 817</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___simple_array.html#a449bfb832fcb364e9b8349ea4dc8a343">ON_SimpleArray<T>::SetCount</a>( <span class="keywordtype">int</span> count ) </div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> {</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordflow">if</span> ( count >= 0 && count <= m_capacity )</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  m_count = count;</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> }</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> </div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00824"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a67e159de08eb6e1991ec10f551f6df05"> 824</a></span> T* <a class="code" href="class_o_n___simple_array.html#a67e159de08eb6e1991ec10f551f6df05">ON_SimpleArray<T>::SetCapacity</a>( <span class="keywordtype">size_t</span> new_capacity ) </div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">if</span> (0 == m_capacity)</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  {</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="comment">// Allow "expert" users of ON_SimpleArray<>.SetArray(*,*,0) to clean up after themselves</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// and deals with the case when the forget to clean up after themselves.</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  m_a = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  m_count = 0;</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  }</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> </div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// sets capacity to input value</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keywordtype">int</span> capacity = (new_capacity > 0 && new_capacity < ON_UNSET_UINT_INDEX) </div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  ? (<span class="keywordtype">int</span>)new_capacity </div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  : 0;</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">if</span> ( capacity != m_capacity ) {</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordflow">if</span>( capacity > 0 ) {</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> ( m_count > capacity )</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  m_count = capacity;</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// NOTE: Realloc() does an allocation if the first argument is nullptr.</span></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  m_a = Realloc( m_a, capacity );</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">if</span> ( m_a ) {</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">if</span> ( capacity > m_capacity ) {</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="comment">// zero new memory</span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  memset( (<span class="keywordtype">void</span>*) (m_a + m_capacity), 0, (capacity-m_capacity)*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  }</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  m_capacity = capacity;</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  }</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="comment">// out of memory</span></div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  m_count = m_capacity = 0;</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  }</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  }</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_a) {</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  Realloc(m_a,0);</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  m_a = 0;</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  m_count = m_capacity = 0;</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  }</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  }</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> }</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> </div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00866"></a><span class="lineno"><a class="line" href="class_o_n___simple_array.html#a5d2395da5bc042c230d799ed92c9c564"> 866</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___simple_array.html#a5d2395da5bc042c230d799ed92c9c564">ON_SimpleArray<T>::NewCapacity</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span> <span class="keyword"></span>{</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="comment">// Note: </span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment">// This code appears in ON_SimpleArray<T>::NewCapacity()</span></div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="comment">// and ON_ClassArray<T>::NewCapacity(). Changes made to</span></div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="comment">// either function should be made to both functions.</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="comment">// Because this code is template code that has to</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="comment">// support dynamic linking and the code is defined</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="comment">// in a header, I'm using copy-and-paste rather</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="comment">// than a static.</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span> </div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="comment">// This function returns 2*m_count unless that will</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="comment">// result in an additional allocation of more than</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="comment">// cap_size bytes. The cap_size concept was added in</span></div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="comment">// January 2010 because some calculations on enormous</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="comment">// models were slightly underestimating the initial</span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="comment">// Reserve() size and then wasting gigabytes of memory.</span></div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> </div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="comment">// cap_size = 128 MB on 32-bit os, 256 MB on 64 bit os</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> cap_size = 32*<span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)*1024*1024;</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordflow">if</span> (m_count*<span class="keyword">sizeof</span>(T) <= cap_size || m_count < 8)</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">return</span> ((m_count <= 2) ? 4 : 2*m_count);</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> </div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// Growing the array will increase the memory</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="comment">// use by more than cap_size.</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keywordtype">int</span> delta_count = 8 + cap_size/<span class="keyword">sizeof</span>(T);</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">if</span> ( delta_count > m_count )</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  delta_count = m_count;</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keywordflow">return</span> (m_count + delta_count);</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> }</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span> </div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00898"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a39b36908b477ca9e79dd435d1802237a"> 898</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a39b36908b477ca9e79dd435d1802237a">ON_ClassArray<T>::NewCapacity</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="keyword"></span>{</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="comment">// Note: </span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// This code appears in ON_SimpleArray<T>::NewCapacity()</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// and ON_ClassArray<T>::NewCapacity(). Changes made to</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// either function should be made to both functions.</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="comment">// Because this code is template code that has to</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// support dynamic linking and the code is defined</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// in a header, I'm using copy-and-paste rather</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="comment">// than a static.</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> </div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="comment">// This function returns 2*m_count unless that will</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="comment">// result in an additional allocation of more than</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// cap_size bytes. The cap_size concept was added in</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="comment">// January 2010 because some calculations on enormous</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="comment">// models were slightly underestimating the initial</span></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="comment">// Reserve() size and then wasting gigabytes of memory.</span></div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> </div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="comment">// cap_size = 128 MB on 32-bit os, 256 MB on 64 bit os</span></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> cap_size = 32*<span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)*1024*1024;</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keywordflow">if</span> (m_count*<span class="keyword">sizeof</span>(T) <= cap_size || m_count < 8)</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">return</span> ((m_count <= 2) ? 4 : 2*m_count);</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span> </div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="comment">// Growing the array will increase the memory</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="comment">// use by more than cap_size.</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keywordtype">int</span> delta_count = 8 + cap_size/<span class="keyword">sizeof</span>(T);</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">if</span> ( delta_count > m_count )</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  delta_count = m_count;</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">return</span> (m_count + delta_count);</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> }</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> <span class="comment"></span></div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment"></span><span class="comment">// Class ON_ObjectArray<></span><span class="comment"></span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment"></span></div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00934"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#a417bd2085eaae1ff3f432e30bded35d3"> 934</a></span> <a class="code" href="class_o_n___object_array.html#a417bd2085eaae1ff3f432e30bded35d3">ON_ObjectArray<T>::ON_ObjectArray</a>()</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> {</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> }</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> </div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00939"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#a3e17771cd9eaad00c29c1959d0973b21"> 939</a></span> <a class="code" href="class_o_n___object_array.html#a3e17771cd9eaad00c29c1959d0973b21">ON_ObjectArray<T>::~ON_ObjectArray</a>()</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> {</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> }</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> </div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00944"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#a3b32b3f66264bfdfa19f9467a396dc06"> 944</a></span> <a class="code" href="class_o_n___object_array.html#a417bd2085eaae1ff3f432e30bded35d3">ON_ObjectArray<T>::ON_ObjectArray</a>( <span class="keyword">const</span> <a class="code" href="class_o_n___object_array.html">ON_ObjectArray<T></a>& src ) : <a class="code" href="class_o_n___class_array.html">ON_ClassArray</a><T>(src)</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> {</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> }</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span> </div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00949"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#aaeb291f91e4c478ac08a8fe51e5c841b"> 949</a></span> <a class="code" href="class_o_n___object_array.html">ON_ObjectArray<T></a>& <a class="code" href="class_o_n___object_array.html#aaeb291f91e4c478ac08a8fe51e5c841b">ON_ObjectArray<T>::operator=</a>( <span class="keyword">const</span> <a class="code" href="class_o_n___object_array.html">ON_ObjectArray<T></a>& src)</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> {</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordflow">if</span>( <span class="keyword">this</span> != &src)</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  {</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <a class="code" href="class_o_n___class_array.html#ab7b741c3481b50b44d69bd4a620296e8">ON_ClassArray<T>::operator =</a>(src);</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  }</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> }</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> </div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="preprocessor">#if defined(ON_HAS_RVALUEREF)</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> </div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="comment">// Clone constructor</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> <a class="code" href="class_o_n___object_array.html#a417bd2085eaae1ff3f432e30bded35d3">ON_ObjectArray<T>::ON_ObjectArray</a>( <a class="code" href="class_o_n___object_array.html">ON_ObjectArray<T></a>&& src )</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  : <a class="code" href="class_o_n___class_array.html">ON_ClassArray</a><T>(std::move(src))</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> {}</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> </div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="comment">// Clone assignment</span></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span> <a class="code" href="class_o_n___object_array.html">ON_ObjectArray<T></a>& <a class="code" href="class_o_n___object_array.html#aaeb291f91e4c478ac08a8fe51e5c841b">ON_ObjectArray<T>::operator=</a>( <a class="code" href="class_o_n___object_array.html">ON_ObjectArray<T></a>&& src )</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span> {</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">if</span>( <span class="keyword">this</span> != &src ) </div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  {</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  this->Destroy();</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  m_a = src.m_a;</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  m_count = src.m_count;</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  m_capacity = src.m_capacity;</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  src.m_a = 0;</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  src.m_count = 0;</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  src.m_capacity = 0;</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  } </div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> }</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> </div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> </div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00986"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#ac5df2652a0a283e62764d0951339c471"> 986</a></span> <a class="code" href="class_o_n___object_array.html#a417bd2085eaae1ff3f432e30bded35d3">ON_ObjectArray<T>::ON_ObjectArray</a>( <span class="keywordtype">size_t</span> c )</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  : <a class="code" href="class_o_n___class_array.html">ON_ClassArray</a><T>(c)</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> {</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span> }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> </div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00992"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#a13c0a45951d15ca0d2a522e553b4a842"> 992</a></span> T* <a class="code" href="class_o_n___object_array.html#a13c0a45951d15ca0d2a522e553b4a842">ON_ObjectArray<T>::Realloc</a>(T* ptr,<span class="keywordtype">int</span> capacity)</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> {</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  T* reptr = (T*)onrealloc(ptr,capacity*<span class="keyword">sizeof</span>(T));</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keywordflow">if</span> ( ptr && reptr && reptr != ptr )</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  {</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="comment">// The "this->" in this->m_count and this->m_a </span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="comment">// are needed for gcc 4 to compile.</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">for</span> ( i = 0; i < this->m_count; i++ )</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  {</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  reptr[i].MemoryRelocate();</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  }</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keywordflow">return</span> reptr;</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> }</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="comment"></span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> <span class="comment"></span><span class="comment">// Class ON_ClassArray<></span><span class="comment"></span></div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> <span class="comment"></span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> </div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> <span class="comment">// construction ////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> </div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01016"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a6146b9447dfc2420fd1ddc79f4e25d13"> 1016</a></span> T* <a class="code" href="class_o_n___class_array.html#a6146b9447dfc2420fd1ddc79f4e25d13">ON_ClassArray<T>::Realloc</a>(T* ptr,<span class="keywordtype">int</span> capacity)</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> {</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keywordflow">return</span> (T*)onrealloc(ptr,capacity*<span class="keyword">sizeof</span>(T));</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> }</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> </div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01022"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#aa2fec44abac5a4ba4bd84ca6b50a44f9"> 1022</a></span> ON__UINT32 <a class="code" href="class_o_n___object_array.html#aa2fec44abac5a4ba4bd84ca6b50a44f9">ON_ObjectArray<T>::DataCRC</a>(ON__UINT32 current_remainder)<span class="keyword"> const</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="keyword"></span>{</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="comment">// The "this->" in this->m_count and this->m_a </span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="comment">// are needed for gcc 4 to compile.</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keywordflow">for</span> ( i = 0; i < this->m_count; i++ )</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  {</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  current_remainder = this->m_a[i].DataCRC(current_remainder);</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  }</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keywordflow">return</span> current_remainder;</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> }</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> </div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01035"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aa12a2a08c847c3221d9ebd037cd67236"> 1035</a></span> <a class="code" href="class_o_n___class_array.html#aa12a2a08c847c3221d9ebd037cd67236">ON_ClassArray<T>::ON_ClassArray</a>() ON_NOEXCEPT</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  : m_a(<span class="keywordtype">nullptr</span>)</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  , m_count(0)</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  , m_capacity(0) </div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> {}</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> </div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01042"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a2a29bdce0835c65c43d220d2bb3d18c7"> 1042</a></span> <a class="code" href="class_o_n___class_array.html#aa12a2a08c847c3221d9ebd037cd67236">ON_ClassArray<T>::ON_ClassArray</a>( <span class="keywordtype">size_t</span> c )</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  : m_a(nullptr)</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  , m_count(0)</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  , m_capacity(0) </div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> {</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">if</span> ( c > 0 ) </div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <a class="code" href="class_o_n___class_array.html#a49bc44bb095af6dd8173a91441b78bfd">SetCapacity</a>( c );</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> }</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span> </div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> <span class="comment">// Copy constructor</span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01053"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aa0a6a9e85b363987aede2c91e46b5036"> 1053</a></span> <a class="code" href="class_o_n___class_array.html#aa12a2a08c847c3221d9ebd037cd67236">ON_ClassArray<T>::ON_ClassArray</a>( <span class="keyword">const</span> <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T></a>& src )</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  : m_a(nullptr)</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  , m_count(0)</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  , m_capacity(0) </div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> {</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  *<span class="keyword">this</span> = src; <span class="comment">// operator= defined below</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> }</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> </div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01062"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ad8afae29c14a95b85324992907c38929"> 1062</a></span> <a class="code" href="class_o_n___class_array.html#ad8afae29c14a95b85324992907c38929">ON_ClassArray<T>::~ON_ClassArray</a>()</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> { </div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  SetCapacity(0);</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> }</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> </div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01068"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ab7b741c3481b50b44d69bd4a620296e8"> 1068</a></span> <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T></a>& <a class="code" href="class_o_n___class_array.html#ab7b741c3481b50b44d69bd4a620296e8">ON_ClassArray<T>::operator=</a>( <span class="keyword">const</span> <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T></a>& src )</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> {</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">if</span>( <span class="keyword">this</span> != &src ) {</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> ( src.<a class="code" href="class_o_n___class_array.html#af361d7cf1705dccf62a534ddd0c48a69">m_count</a> <= 0 ) {</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  m_count = 0;</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">if</span> ( m_capacity < src.<a class="code" href="class_o_n___class_array.html#af361d7cf1705dccf62a534ddd0c48a69">m_count</a> ) {</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  SetCapacity( src.<a class="code" href="class_o_n___class_array.html#af361d7cf1705dccf62a534ddd0c48a69">m_count</a> );</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">if</span> ( m_a ) {</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  m_count = src.<a class="code" href="class_o_n___class_array.html#af361d7cf1705dccf62a534ddd0c48a69">m_count</a>;</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">for</span> ( i = 0; i < m_count; i++ ) {</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  m_a[i] = src.<a class="code" href="class_o_n___class_array.html#adfced275ab81f79ae6a60d5f660c0fdf">m_a</a>[i];</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  }</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  } </div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> }</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="preprocessor">#if defined(ON_HAS_RVALUEREF)</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> </div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="comment">// Clone constructor</span></div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <a class="code" href="class_o_n___class_array.html#aa12a2a08c847c3221d9ebd037cd67236">ON_ClassArray<T>::ON_ClassArray</a>( <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T></a>&& src ) ON_NOEXCEPT</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  : m_a(src.m_a)</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  , m_count(src.m_count)</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  , m_capacity(src.m_capacity)</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> {</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  src.m_a = 0;</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  src.m_count = 0;</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  src.m_capacity = 0;</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> }</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="comment">// Clone assignment</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T></a>& <a class="code" href="class_o_n___class_array.html#ab7b741c3481b50b44d69bd4a620296e8">ON_ClassArray<T>::operator=</a>( <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T></a>&& src ) ON_NOEXCEPT</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> {</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keywordflow">if</span>( <span class="keyword">this</span> != &src ) </div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  {</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  this->Destroy();</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  m_a = src.m_a;</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  m_count = src.m_count;</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  m_capacity = src.m_capacity;</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  src.m_a = 0;</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  src.m_count = 0;</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  src.m_capacity = 0;</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  } </div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span> }</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span> </div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> </div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> <span class="comment">// emergency destroy ///////////////////////////////////////////////////</span></div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> </div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01126"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aebe0869a166cd4e3d74e5aaa731ab831"> 1126</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#aebe0869a166cd4e3d74e5aaa731ab831">ON_ClassArray<T>::EmergencyDestroy</a>(<span class="keywordtype">void</span>)</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> {</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  m_count = 0;</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  m_capacity = 0;</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  m_a = 0;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> }</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> </div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> <span class="comment">// query ///////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span> </div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01136"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a1845abffe10408c4ce46046d9232f8e8"> 1136</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a1845abffe10408c4ce46046d9232f8e8">ON_ClassArray<T>::Count</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> <span class="keyword"></span>{</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordflow">return</span> m_count;</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> }</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span> </div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01142"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a64d1db4495becbc776ba36549ad93fd1"> 1142</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a64d1db4495becbc776ba36549ad93fd1">ON_ClassArray<T>::UnsignedCount</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> <span class="keyword"></span>{</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_count);</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> }</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> </div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01148"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#af828eb3eedaefe303676b81b0b5bd0cd"> 1148</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#af828eb3eedaefe303676b81b0b5bd0cd">ON_ClassArray<T>::Capacity</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> <span class="keyword"></span>{</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keywordflow">return</span> m_capacity;</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span> }</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> </div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01154"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a317aa7fa09844d153876fa707ae87e2d"> 1154</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a317aa7fa09844d153876fa707ae87e2d">ON_ClassArray<T>::SizeOfArray</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="keyword"></span>{</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)(m_capacity*<span class="keyword">sizeof</span>(T)));</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> }</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> </div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01160"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#adf0b64e2722e1e77fa1dfd5fe1e222de"> 1160</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#adf0b64e2722e1e77fa1dfd5fe1e222de">ON_ClassArray<T>::SizeOfElement</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> <span class="keyword"></span>{</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)(<span class="keyword">sizeof</span>(T)));</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> }</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> </div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01166"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e"> 1166</a></span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>( <span class="keywordtype">int</span> i )</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> { </div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keywordflow">if</span> ( i < 0 || i > m_capacity )</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  {</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  }</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> }</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> </div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span> </div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01179"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#afcd3c038ace9e6b518f66a87cce6d496"> 1179</a></span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>( ON__INT64 i )</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> { </div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> ( i < 0 || i > (ON__INT64)m_capacity )</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  {</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  }</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span> }</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span> </div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01191"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a38a1f61c17d3a863abe8acc4b053bf9e"> 1191</a></span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i )</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span> { </div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_capacity )</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  {</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  }</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span> }</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span> </div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01203"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a015a992fe8121363317327c107c75c2d"> 1203</a></span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>( ON__UINT64 i )</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> { </div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keywordflow">if</span> ( i > (ON__UINT64)m_capacity )</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  {</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  }</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> }</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> </div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> <span class="preprocessor">#if defined(ON_RUNTIME_APPLE)</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>(<span class="keywordtype">size_t</span> i )</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> { </div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">size_t</span>)m_capacity )</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  {</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  }</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="keywordflow">return</span> m_a[i]; </div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> }</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> </div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01229"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a6e4d1684feca2845464635d1c43b83a1"> 1229</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span> <span class="keyword"></span>{</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="keywordflow">if</span> ( i < 0 || i > m_capacity )</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  {</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  }</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> }</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span> </div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01241"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a7ae5677ba6120233a127eed7c9f564a1"> 1241</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>(ON__INT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> <span class="keyword"></span>{</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="keywordflow">if</span> ( i < 0 || i > (ON__INT64)m_capacity )</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  {</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  }</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> }</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> </div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01253"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ad5f92b97d51e9aeb89e6c179a0fdd3fd"> 1253</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> <span class="keyword"></span>{</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_capacity )</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  {</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  }</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> }</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> </div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01265"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ac33045d46c4aeaa089909a8eb3f0af3c"> 1265</a></span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>(ON__UINT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> <span class="keyword"></span>{</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordflow">if</span> ( i > (ON__UINT64)m_capacity )</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  {</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  }</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> }</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> </div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> <span class="preprocessor">#if defined(ON_RUNTIME_APPLE)</span></div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span> <span class="keyword">const</span> T& <a class="code" href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray<T>::operator[]</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> <span class="keyword"></span>{</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span> <span class="preprocessor">#if defined(ON_DEBUG)</span></div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keywordflow">if</span> ( i > (<span class="keywordtype">size_t</span>)m_capacity )</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  {</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  ON_ERROR(<span class="stringliteral">"ON_ClassArray[i]: i out of range."</span>);</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  }</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="keywordflow">return</span> m_a[i];</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> }</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> </div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01291"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a5e8b150fdfb6f1c2d5a625ee09273432"> 1291</a></span> <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T>::operator</a> T*()</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> {</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> }</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> </div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01297"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ad42aed50f4d66e4a33379db171c71fd8"> 1297</a></span> <a class="code" href="class_o_n___class_array.html">ON_ClassArray<T>::operator</a> <span class="keyword">const</span> T*() <span class="keyword">const</span></div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> {</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span> }</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span> </div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01303"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a36597e8827a812df0d9c6c81c1db4e81"> 1303</a></span> T* <a class="code" href="class_o_n___class_array.html#a36597e8827a812df0d9c6c81c1db4e81">ON_ClassArray<T>::Array</a>()</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> {</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> }</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> </div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01309"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a4772c4d3558d1d2567310010fa3add1d"> 1309</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a36597e8827a812df0d9c6c81c1db4e81">ON_ClassArray<T>::Array</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> <span class="keyword"></span>{</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> }</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> </div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01315"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ac8ea996fc990ee251d88b324bc8b08f2"> 1315</a></span> T* <a class="code" href="class_o_n___class_array.html#ac8ea996fc990ee251d88b324bc8b08f2">ON_ClassArray<T>::KeepArray</a>()</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> {</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  T* p = m_a;</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  m_a = 0;</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  m_count = 0;</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  m_capacity = 0;</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordflow">return</span> p;</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> }</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> </div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01325"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a404695bf0683f18b0e2a1b2cc2538fa3"> 1325</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a404695bf0683f18b0e2a1b2cc2538fa3">ON_ClassArray<T>::SetArray</a>(T* p)</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> {</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordflow">if</span> ( m_a && m_a != p )</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  Destroy();</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  m_a = p;</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> }</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> </div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01333"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a382c44cb8eaa73cc598d587fdfda5220"> 1333</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a404695bf0683f18b0e2a1b2cc2538fa3">ON_ClassArray<T>::SetArray</a>(T* p, <span class="keywordtype">int</span> count, <span class="keywordtype">int</span> capacity)</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span> {</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keywordflow">if</span> ( m_a && m_a != p )</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  Destroy();</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  m_a = p;</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  m_count = count;</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  m_capacity = capacity;</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> }</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span> </div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01343"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a00c04a9b48b53459764dffe506b5e34c"> 1343</a></span> T* <a class="code" href="class_o_n___class_array.html#a00c04a9b48b53459764dffe506b5e34c">ON_ClassArray<T>::First</a>()</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span> { </div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> }</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> </div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01349"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a9069a7bc0b5126ff143f70aa43b43230"> 1349</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a00c04a9b48b53459764dffe506b5e34c">ON_ClassArray<T>::First</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> <span class="keyword"></span>{</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a : 0;</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span> }</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> </div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01355"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e"> 1355</a></span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( <span class="keywordtype">int</span> i )</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> { </div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="keywordflow">return</span> (i >= 0 && i < m_count) ? m_a+i : 0;</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> }</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> </div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01361"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aaffadd4ef6e89cd8a7834d7baa83104c"> 1361</a></span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i )</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> { </div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="keywordflow">return</span> (i < (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_count) ? m_a+i : 0;</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> }</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> </div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01367"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a2928f1f8fbc5c101e3250fe8ba5ac2c5"> 1367</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( <span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span> <span class="keyword"></span>{</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordflow">return</span> (i >= 0 && i < m_count) ? m_a+i : 0;</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span> }</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span> </div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01373"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aaedfef6fa79539b7de0be949c31cdee6"> 1373</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span> <span class="keyword"></span>{</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keywordflow">return</span> (i < (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)m_count) ? m_a+i : 0;</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> }</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> </div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span> </div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01380"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a2bbfab010d82d1cea6155b6cf49a72d1"> 1380</a></span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( ON__INT64 i )</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> { </div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordflow">return</span> (i >= 0 && i < (ON__INT64)m_count) ? m_a+i : 0;</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span> }</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span> </div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01386"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a3a8d1c926554aad1bc07de202572d88f"> 1386</a></span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( ON__UINT64 i )</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span> { </div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keywordflow">return</span> (i < (ON__UINT64)m_count) ? m_a+i : 0;</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> }</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span> </div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01392"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#af163db1328a3ff14d6eae781bb872dc4"> 1392</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( ON__INT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span> <span class="keyword"></span>{</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <span class="keywordflow">return</span> (i >= 0 && i < (ON__INT64)m_count) ? m_a+i : 0;</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> }</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> </div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01398"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ac1621f585217b42abd35061dabb7dfe2"> 1398</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray<T>::At</a>( ON__UINT64 i)<span class="keyword"> const</span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <span class="keyword"></span>{</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <span class="keywordflow">return</span> (i < (ON__UINT64)m_count) ? m_a+i : 0;</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> }</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> </div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> </div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01405"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a5e9dfdb1601fb20ce86dfe8244719665"> 1405</a></span> T* <a class="code" href="class_o_n___class_array.html#a5e9dfdb1601fb20ce86dfe8244719665">ON_ClassArray<T>::Last</a>()</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> { </div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a+(m_count-1) : 0;</div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span> }</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> </div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01411"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a558bc5d60a7dc8d9885a387e12bd8ae6"> 1411</a></span> <span class="keyword">const</span> T* <a class="code" href="class_o_n___class_array.html#a5e9dfdb1601fb20ce86dfe8244719665">ON_ClassArray<T>::Last</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span> <span class="keyword"></span>{</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keywordflow">return</span> (m_count > 0) ? m_a+(m_count-1) : 0;</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> }</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span> </div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> <span class="comment">// array operations ////////////////////////////////////////////////////</span></div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span> </div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01419"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a58673a8f943b627698b7f917b8bbcfdf"> 1419</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a58673a8f943b627698b7f917b8bbcfdf">ON_ClassArray<T>::Move</a>( <span class="keywordtype">int</span> dest_i, <span class="keywordtype">int</span> src_i, <span class="keywordtype">int</span> ele_cnt )</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> {</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  <span class="comment">// private function for moving blocks of array memory</span></div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="comment">// caller is responsible for updating m_count and managing</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <span class="comment">// destruction/creation.</span></div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <span class="keywordflow">if</span> ( ele_cnt <= 0 || src_i < 0 || dest_i < 0 || src_i == dest_i || </div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  src_i + ele_cnt > m_count || dest_i > m_count )</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> </div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="keywordtype">int</span> capacity = dest_i + ele_cnt;</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="keywordflow">if</span> ( capacity > m_capacity ) {</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keywordflow">if</span> ( capacity < 2*m_capacity )</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  capacity = 2*m_capacity;</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  SetCapacity( capacity );</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  }</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span> </div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="comment">// This call to memmove is ok, even when T is a class with a vtable</span></div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  <span class="comment">// because the it doesn't change the vtable for the class.</span></div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  <span class="comment">// Classes that have back pointers, like ON_UserData, are</span></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  <span class="comment">// handled elsewhere and cannot be in ON_ClassArray<>s.</span></div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  memmove( (<span class="keywordtype">void</span>*)(&m_a[dest_i]), (<span class="keyword">const</span> <span class="keywordtype">void</span>*)(&m_a[src_i]), ele_cnt*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span> }</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> </div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01443"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a827238e8843d73fc952018a49278b4c6"> 1443</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a827238e8843d73fc952018a49278b4c6">ON_ClassArray<T>::ConstructDefaultElement</a>(T* p)</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> {</div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="comment">// use placement ( new(size_t,void*) ) to construct</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="comment">// T in supplied memory</span></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keyword">new</span>(p) T;</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> }</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span> </div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01451"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ad4650327b91304e934de5bf6fe4bb9ae"> 1451</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#ad4650327b91304e934de5bf6fe4bb9ae">ON_ClassArray<T>::DestroyElement</a>(T& x)</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> {</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  x.~T();</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span> }</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span> </div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01457"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a3453ebec06da96dd2bc10f66b4312dda"> 1457</a></span> T& <a class="code" href="class_o_n___class_array.html#a3453ebec06da96dd2bc10f66b4312dda">ON_ClassArray<T>::AppendNew</a>()</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> {</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keywordflow">if</span> ( m_count == m_capacity ) </div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  {</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  Reserve( newcapacity );</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  }</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  {</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="comment">// First destroy what's there ..</span></div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  DestroyElement(m_a[m_count]);</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <span class="comment">// and then get a properly initialized element</span></div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  ConstructDefaultElement(&m_a[m_count]);</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  }</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="keywordflow">return</span> m_a[m_count++];</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span> }</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span> </div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01475"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a417093e16515cefacd17dc940ea4a52f"> 1475</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a417093e16515cefacd17dc940ea4a52f">ON_ClassArray<T>::Append</a>( <span class="keyword">const</span> T& x ) </div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span> {</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="keywordflow">if</span> ( m_count == m_capacity ) </div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  {</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  <span class="keywordflow">if</span> (m_a)</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  {</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> s = (int)(&x - m_a); <span class="comment">// (int) cast is for 64 bit pointers</span></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="keywordflow">if</span> ( s >= 0 && s < m_capacity )</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  {</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="comment">// 26 Sep 2005 Dale Lear</span></div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="comment">// User passed in an element of the m_a[]</span></div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <span class="comment">// that will get reallocated by the call</span></div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  <span class="comment">// to Reserve(newcapacity).</span></div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  T temp; <span class="comment">// ON_*Array<> templates do not require robust copy constructor.</span></div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  temp = x; <span class="comment">// ON_*Array<> templates require a robust operator=.</span></div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  Reserve( newcapacity );</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  m_a[m_count++] = temp;</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  }</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  }</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  Reserve(newcapacity);</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  }</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  m_a[m_count++] = x;</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> }</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> </div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01502"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ad863aa00c481c6d22cf0bab4d9fab0b7"> 1502</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a417093e16515cefacd17dc940ea4a52f">ON_ClassArray<T>::Append</a>( <span class="keywordtype">int</span> count, <span class="keyword">const</span> T* p ) </div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span> {</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <span class="keywordflow">if</span> ( count > 0 && p ) </div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  {</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordflow">if</span> ( count + m_count > m_capacity ) </div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  {</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="keywordflow">if</span> ( newcapacity < count + m_count )</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  newcapacity = count + m_count;</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  Reserve( newcapacity );</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  }</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="keywordflow">for</span> ( i = 0; i < count; i++ ) {</div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  m_a[m_count++] = p[i];</div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  }</div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  }</div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> }</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> </div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> <span class="comment">// Insert called with a reference uses operator =</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01522"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aebeebfb862065c0d62c00389ae3f499b"> 1522</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#aebeebfb862065c0d62c00389ae3f499b">ON_ClassArray<T>::Insert</a>( <span class="keywordtype">int</span> i, <span class="keyword">const</span> T& x ) </div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> {</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  <span class="keywordflow">if</span>( i >= 0 && i <= m_count ) </div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  {</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="keywordflow">if</span> ( m_count == m_capacity ) </div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  {</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordtype">int</span> newcapacity = NewCapacity();</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  Reserve( newcapacity );</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  }</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  DestroyElement( m_a[m_count] );</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  m_count++;</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  <span class="keywordflow">if</span> ( i < m_count-1 ) {</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  Move( i+1, i, m_count-1-i );</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  <span class="comment">// This call to memset is ok even when T has a vtable</span></div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="comment">// because in-place construction is used later.</span></div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[i]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  ConstructDefaultElement( &m_a[i] );</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  }</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  ConstructDefaultElement( &m_a[m_count-1] );</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  }</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  m_a[i] = x; <span class="comment">// uses T::operator=() to copy x to array</span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  }</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> }</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> </div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01548"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ac8613b7ab26dfabe4d630052a7167445"> 1548</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#ac8613b7ab26dfabe4d630052a7167445">ON_ClassArray<T>::Remove</a>( )</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> {</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  Remove(m_count-1);</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> } </div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span> </div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01554"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a91061614b1ec05b07b891579e83ed9a8"> 1554</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#ac8613b7ab26dfabe4d630052a7167445">ON_ClassArray<T>::Remove</a>( <span class="keywordtype">int</span> i )</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> {</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <span class="keywordflow">if</span> ( i >= 0 && i < m_count ) </div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  {</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  DestroyElement( m_a[i] );</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  <span class="comment">// This call to memset is ok even when T has a vtable</span></div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="comment">// because in-place construction is used later.</span></div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[i]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  Move( i, i+1, m_count-1-i );</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  <span class="comment">// This call to memset is ok even when T has a vtable</span></div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <span class="comment">// because in-place construction is used later.</span></div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[m_count-1]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  ConstructDefaultElement(&m_a[m_count-1]);</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  m_count--;</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  }</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> } </div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span> </div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01572"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#acc29b3806f214bf0253499255e307856"> 1572</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#acc29b3806f214bf0253499255e307856">ON_ClassArray<T>::Empty</a>()</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span> {</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keywordflow">for</span> ( i = m_count-1; i >= 0; i-- ) {</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  DestroyElement( m_a[i] );</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="comment">// This call to memset is ok even when T has a vtable</span></div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="comment">// because in-place construction is used later.</span></div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[i]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  ConstructDefaultElement( &m_a[i] );</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  }</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  m_count = 0;</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> }</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span> </div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01586"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ae0cf9e8ff629067820b78bf8fa4723fd"> 1586</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#ae0cf9e8ff629067820b78bf8fa4723fd">ON_ClassArray<T>::Reverse</a>()</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span> {</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="comment">// NOTE:</span></div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <span class="comment">// If anything in "T" depends on the value of this's address,</span></div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  <span class="comment">// then don't call Reverse().</span></div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  <span class="keywordtype">char</span> t[<span class="keyword">sizeof</span>(T)];</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="keywordtype">int</span> i = 0; </div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <span class="keywordtype">int</span> j = m_count-1;</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">for</span> ( <span class="comment">/*empty*/</span>; i < j; i++, j-- ) {</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  memcpy( (<span class="keywordtype">void</span>*)(t), (<span class="keywordtype">void</span>*)(&m_a[i]), <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  memcpy( (<span class="keywordtype">void</span>*)(&m_a[i]), (<span class="keywordtype">void</span>*)(&m_a[j]), <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  memcpy( (<span class="keywordtype">void</span>*)(&m_a[j]), (<span class="keywordtype">void</span>*)(t), <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  }</div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span> }</div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span> </div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01602"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aa00c91a632d42ebbd4a04715750953ca"> 1602</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#aa00c91a632d42ebbd4a04715750953ca">ON_ClassArray<T>::Swap</a>( <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j )</div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span> {</div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keywordflow">if</span> ( i != j && i >= 0 && j >= 0 && i < m_count && j < m_count ) {</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keywordtype">char</span> t[<span class="keyword">sizeof</span>(T)];</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  memcpy( (<span class="keywordtype">void</span>*)(t), (<span class="keywordtype">void</span>*)(&m_a[i]), <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  memcpy( (<span class="keywordtype">void</span>*)(&m_a[i]), (<span class="keywordtype">void</span>*)(&m_a[j]), <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  memcpy( (<span class="keywordtype">void</span>*)(&m_a[j]), (<span class="keywordtype">void</span>*)(t), <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  }</div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span> }</div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span> </div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01613"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a815f500f614c1742ba1f250b6e46ab1c"> 1613</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a815f500f614c1742ba1f250b6e46ab1c">ON_ClassArray<T>::Search</a>( <span class="keyword">const</span> T* key, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )<span class="keyword"> const</span></div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span> <span class="keyword"></span>{</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <span class="keywordflow">for</span> ( <span class="keywordtype">int</span> i = 0; i < m_count; i++ ) </div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  {</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  <span class="keywordflow">if</span> (!compar(key,m_a+i)) </div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  <span class="keywordflow">return</span> i;</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  }</div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span> }</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span> </div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01624"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a6f69264bb06391c81571f0182fbaef08"> 1624</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a6f69264bb06391c81571f0182fbaef08">ON_ClassArray<T>::BinarySearch</a>( <span class="keyword">const</span> T* key, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )<span class="keyword"> const</span></div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span> <span class="keyword"></span>{</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keyword">const</span> T* found = (key&&m_a&&m_count>0) ? (<span class="keyword">const</span> T*)bsearch( key, m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar ) : <span class="keyword">nullptr</span>;</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  <span class="keywordflow">return</span> (<span class="keyword">nullptr</span> != found && found >= m_a) ? ((int)(found - m_a)) : -1;</div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span> }</div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span> </div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01631"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#af70b91b3b3fd7ecfb8f8fcf3e1d342b8"> 1631</a></span> <span class="keywordtype">int</span> <a class="code" href="class_o_n___class_array.html#a6f69264bb06391c81571f0182fbaef08">ON_ClassArray<T>::BinarySearch</a>( <span class="keyword">const</span> T* key, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*), <span class="keywordtype">int</span> count )<span class="keyword"> const</span></div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span> <span class="keyword"></span>{</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  <span class="keywordflow">if</span> ( count > m_count )</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  count = m_count;</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keywordflow">if</span> ( count <= 0 )</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="keyword">const</span> T* found = (key&&m_a&&m_count>0) ? (<span class="keyword">const</span> T*)bsearch( key, m_a, count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar ) : <span class="keyword">nullptr</span>;</div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <span class="keywordflow">return</span> (<span class="keyword">nullptr</span> != found && found >= m_a) ? ((int)(found - m_a)) : -1;</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span> }</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span> </div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01642"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aeacff55bc065868229f3269bb47d0e31"> 1642</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___class_array.html#aeacff55bc065868229f3269bb47d0e31">ON_ClassArray<T>::HeapSort</a>( <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> {</div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar ) </div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  {</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  ON_hsort( m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  }</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span> }</div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span> </div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01655"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#aaaccc2915ed9407ed77e5355ed02f61a"> 1655</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___class_array.html#aaaccc2915ed9407ed77e5355ed02f61a">ON_ClassArray<T>::QuickSort</a>( <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span> {</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar ) </div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  {</div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  ON_qsort( m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  }</div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span> }</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> </div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span> </div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span> </div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01670"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#a51ee75049ffb91c10f2acb17b99d3a66"> 1670</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___object_array.html#a51ee75049ffb91c10f2acb17b99d3a66">ON_ObjectArray<T>::HeapSort</a>( <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span> {</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="comment">// The "this->" in this->m_count and this->m_a </span></div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="comment">// are needed for gcc 4 to compile.</span></div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="keywordflow">if</span> ( this->m_a && this->m_count > 0 && compar ) </div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  {</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  <span class="keywordflow">if</span> ( this->m_count > 1 )</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  {</div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  ON_hsort( this->m_a, this->m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  </div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  <span class="comment">// The MemoryRelocate step is required to synch userdata back pointers</span></div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  <span class="comment">// so the user data destructor will work correctly.</span></div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  <span class="keywordflow">for</span> ( i = 0; i < this->m_count; i++ )</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  {</div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  this->m_a[i].MemoryRelocate();</div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  }</div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  }</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  }</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span> }</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span> </div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01695"></a><span class="lineno"><a class="line" href="class_o_n___object_array.html#a53ef05dd586f31c2ddb4980185153398"> 1695</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___object_array.html#a53ef05dd586f31c2ddb4980185153398">ON_ObjectArray<T>::QuickSort</a>( <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )</div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> {</div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  <span class="comment">// The "this->" in this->m_count and this->m_a </span></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="comment">// are needed for gcc 4 to compile.</span></div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  <span class="keywordflow">if</span> ( this->m_a && this->m_count > 0 && compar ) </div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  {</div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <span class="keywordflow">if</span> ( this->m_count > 1 )</div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  {</div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  ON_qsort( this->m_a, this->m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span> </div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  <span class="comment">// The MemoryRelocate step is required to synch userdata back pointers</span></div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  <span class="comment">// so the user data destructor will work correctly.</span></div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  <span class="keywordflow">for</span> ( i = 0; i < this->m_count; i++ )</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  {</div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  this->m_a[i].MemoryRelocate();</div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  }</div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  }</div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  }</div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span> }</div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span> </div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span> </div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01721"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#acc32ae1ba071b666ae49a9d2c2a041e7"> 1721</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___class_array.html#acc32ae1ba071b666ae49a9d2c2a041e7">ON_ClassArray<T>::Sort</a>( ON::sort_algorithm sa, <span class="keywordtype">int</span>* index, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*) )<span class="keyword"> const</span></div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span> <span class="keyword"></span>{</div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar && index )</div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  {</div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  ON_Sort(sa, index, m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*))compar );</div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( m_count == 1 )</div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  index[0] = 0;</div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  }</div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span> }</div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span> </div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01736"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a62165890958430bf2e377aaabc7fd93c"> 1736</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___class_array.html#acc32ae1ba071b666ae49a9d2c2a041e7">ON_ClassArray<T>::Sort</a>( ON::sort_algorithm sa, <span class="keywordtype">int</span>* index, <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> T*,<span class="keyword">const</span> T*,<span class="keywordtype">void</span>*),<span class="keywordtype">void</span>* p )<span class="keyword"> const</span></div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span> <span class="keyword"></span>{</div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && compar && index ) </div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  {</div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  <span class="keywordflow">if</span> ( m_count > 1 )</div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  ON_Sort(sa, index, m_a, m_count, <span class="keyword">sizeof</span>(T), (<span class="keywordtype">int</span>(*)(<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keyword">const</span> <span class="keywordtype">void</span>*,<span class="keywordtype">void</span>*))compar, p );</div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( m_count == 1 )</div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  index[0] = 0;</div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  }</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span> }</div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span> </div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01751"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a5cd469fb4742e6424f9cabb1c8787c2a"> 1751</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_o_n___class_array.html#a5cd469fb4742e6424f9cabb1c8787c2a">ON_ClassArray<T>::Permute</a>( <span class="keyword">const</span> <span class="keywordtype">int</span>* index )</div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span> {</div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <span class="keywordtype">bool</span> rc = <span class="keyword">false</span>;</div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  <span class="keywordflow">if</span> ( m_a && m_count > 0 && index ) </div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  {</div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  T* buffer = (T*)onmalloc(m_count*<span class="keyword">sizeof</span>(buffer[0]));</div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  memcpy( (<span class="keywordtype">void</span>*)(buffer), (<span class="keywordtype">void</span>*)(m_a), m_count*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <span class="keywordflow">for</span> (i = 0; i < m_count; i++ )</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  memcpy( (<span class="keywordtype">void</span>*)(m_a+i), (<span class="keywordtype">void</span>*)(buffer+index[i]), <span class="keyword">sizeof</span>(T) ); <span class="comment">// must use memcopy and not operator=</span></div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  onfree(buffer);</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  rc = <span class="keyword">true</span>;</div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  }</div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keywordflow">return</span> rc;</div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span> }</div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span> </div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01768"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a4e749c63bb84c2b09ade86283f6d7707"> 1768</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a4e749c63bb84c2b09ade86283f6d7707">ON_ClassArray<T>::Zero</a>()</div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span> {</div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="keywordflow">if</span> ( m_a && m_capacity > 0 ) {</div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <span class="keywordflow">for</span> ( i = m_capacity-1; i >= 0; i-- ) {</div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  DestroyElement(m_a[i]);</div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="comment">// This call to memset is ok even when T has a vtable</span></div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="comment">// because in-place construction is used later.</span></div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  memset( (<span class="keywordtype">void</span>*)(&m_a[i]), 0, <span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  ConstructDefaultElement(&m_a[i]);</div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  }</div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  }</div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span> }</div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span> </div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span> <span class="comment">// memory managment ////////////////////////////////////////////////////</span></div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span> </div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01785"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a619516bde2761154d967c96ee6c2b044"> 1785</a></span> T* <a class="code" href="class_o_n___class_array.html#a619516bde2761154d967c96ee6c2b044">ON_ClassArray<T>::Reserve</a>( <span class="keywordtype">size_t</span> newcap ) </div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span> {</div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="keywordflow">if</span>( (<span class="keywordtype">size_t</span>)m_capacity < newcap )</div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  SetCapacity( newcap );</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span> }</div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span> </div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01793"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a34c5ba8cd96d26d1880e2ecd0f21b6e5"> 1793</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a34c5ba8cd96d26d1880e2ecd0f21b6e5">ON_ClassArray<T>::Shrink</a>()</div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span> {</div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  SetCapacity( m_count );</div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> }</div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span> </div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01799"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#ab8a86fe207a6b43c493104e166003250"> 1799</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#ab8a86fe207a6b43c493104e166003250">ON_ClassArray<T>::Destroy</a>()</div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span> {</div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  SetCapacity( 0 );</div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span> }</div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span> </div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span> <span class="comment">// low level memory managment //////////////////////////////////////////</span></div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span> </div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01807"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a7ffd376de3d1af10f22caea8e5b5d114"> 1807</a></span> <span class="keywordtype">void</span> <a class="code" href="class_o_n___class_array.html#a7ffd376de3d1af10f22caea8e5b5d114">ON_ClassArray<T>::SetCount</a>( <span class="keywordtype">int</span> count ) </div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span> {</div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  <span class="keywordflow">if</span> ( count >= 0 && count <= m_capacity )</div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  m_count = count;</div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span> }</div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span> </div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l01814"></a><span class="lineno"><a class="line" href="class_o_n___class_array.html#a49bc44bb095af6dd8173a91441b78bfd"> 1814</a></span> T* <a class="code" href="class_o_n___class_array.html#a49bc44bb095af6dd8173a91441b78bfd">ON_ClassArray<T>::SetCapacity</a>( <span class="keywordtype">size_t</span> new_capacity ) </div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span> {</div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <span class="keywordflow">if</span> (0 == m_capacity)</div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  {</div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="comment">// Allow "expert" users of ON_SimpleArray<>.SetArray(*,*,0) to clean up after themselves</span></div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="comment">// and deals with the case when the forget to clean up after themselves.</span></div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  m_a = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  m_count = 0;</div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  }</div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="comment">// uses "placement" for class construction/destruction</span></div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <span class="keywordtype">int</span> capacity = (new_capacity > 0 && new_capacity < ON_UNSET_UINT_INDEX)</div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  ? (<span class="keywordtype">int</span>)new_capacity </div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  : 0;</div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span> </div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="keywordflow">if</span> ( capacity <= 0 ) {</div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keywordflow">if</span> ( m_a ) {</div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="keywordflow">for</span> ( i = m_capacity-1; i >= 0; i-- ) {</div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  DestroyElement(m_a[i]);</div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  }</div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  Realloc(m_a,0);</div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  m_a = 0;</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  }</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  m_count = 0;</div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  m_capacity = 0;</div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  }</div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( m_capacity < capacity ) {</div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  <span class="comment">// growing</span></div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  m_a = Realloc( m_a, capacity );</div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="comment">// initialize new elements with default constructor</span></div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keywordflow">if</span> ( 0 != m_a )</div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  {</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  <span class="comment">// even when m_a is an array of classes with vtable pointers,</span></div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  <span class="comment">// this call to memset(..., 0, ...) is what I want to do</span></div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="comment">// because in-place construction will be used when needed</span></div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  <span class="comment">// on this memory.</span></div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  memset( (<span class="keywordtype">void</span>*)(m_a + m_capacity), 0, (capacity-m_capacity)*<span class="keyword">sizeof</span>(T) );</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  <span class="keywordflow">for</span> ( i = m_capacity; i < capacity; i++ ) {</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  ConstructDefaultElement(&m_a[i]);</div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  }</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  m_capacity = capacity;</div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  }</div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  {</div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  <span class="comment">// memory allocation failed</span></div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  m_capacity = 0;</div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  m_count = 0;</div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  }</div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  }</div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( m_capacity > capacity ) {</div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <span class="comment">// shrinking</span></div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <span class="keywordflow">for</span> ( i = m_capacity-1; i >= capacity; i-- ) {</div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  DestroyElement(m_a[i]);</div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  }</div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  <span class="keywordflow">if</span> ( m_count > capacity )</div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  m_count = capacity;</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  m_capacity = capacity;</div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  m_a = Realloc( m_a, capacity );</div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  <span class="keywordflow">if</span> ( 0 == m_a )</div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  {</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <span class="comment">// memory allocation failed</span></div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  m_capacity = 0;</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  m_count = 0;</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  }</div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  }</div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  <span class="keywordflow">return</span> m_a;</div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span> }</div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span> <span class="comment"></span></div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> <span class="comment">/////////////////////////////////////////////////////////////////////////////////////</span></div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> <span class="comment"></span></div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> <span class="keyword">template</span>< <span class="keyword">class</span> T></div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span> <span class="keywordtype">int</span> ON_CompareIncreasing( <span class="keyword">const</span> T* a, <span class="keyword">const</span> T* b)</div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> {</div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  <span class="keywordflow">if</span>( *a < *b ) </div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <span class="keywordflow">if</span>( *b < *a ) </div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span> }</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span> </div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span> <span class="keyword">template</span>< <span class="keyword">class</span> T></div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span> <span class="keywordtype">int</span> ON_CompareDecreasing( <span class="keyword">const</span> T* a, <span class="keyword">const</span> T* b)</div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span> {</div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <span class="keywordflow">if</span>( *b < *a ) </div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  <span class="keywordflow">if</span>( *a < *b ) </div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span> }</div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span> </div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span> <span class="preprocessor">#pragma ON_PRAGMA_WARNING_POP</span></div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span> </div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="class_o_n___simple_array_html_a8d37e0c0eaf603fffdd9c3e9e3d1fe48"><div class="ttname"><a href="class_o_n___simple_array.html#a8d37e0c0eaf603fffdd9c3e9e3d1fe48">ON_SimpleArray::Empty</a></div><div class="ttdeci">void Empty()</div><div class="ttdoc">Sets count to 0, leaves capacity untouched. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:558</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_aebe0869a166cd4e3d74e5aaa731ab831"><div class="ttname"><a href="class_o_n___class_array.html#aebe0869a166cd4e3d74e5aaa731ab831">ON_ClassArray::EmergencyDestroy</a></div><div class="ttdeci">void EmergencyDestroy(void)</div><div class="ttdoc">emergency bailout /////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1126</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_ae06989b66432ab66a49511406d675ed9"><div class="ttname"><a href="class_o_n___simple_array.html#ae06989b66432ab66a49511406d675ed9">ON_SimpleArray::Capacity</a></div><div class="ttdeci">int Capacity() const</div><div class="ttdoc">capacity of array </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:173</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_af6ae46b8e2bc5ee8f0803fc87e60d4cc"><div class="ttname"><a href="class_o_n___simple_array.html#af6ae46b8e2bc5ee8f0803fc87e60d4cc">ON_SimpleArray::~ON_SimpleArray</a></div><div class="ttdeci">virtual ~ON_SimpleArray()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:90</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a66e43c5172b763b79df57f2ebc6bc43e"><div class="ttname"><a href="class_o_n___class_array.html#a66e43c5172b763b79df57f2ebc6bc43e">ON_ClassArray::operator[]</a></div><div class="ttdeci">T & operator[](int)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1166</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a40938b1db05c86fe59395dfabfe3d3be"><div class="ttname"><a href="class_o_n___simple_array.html#a40938b1db05c86fe59395dfabfe3d3be">ON_SimpleArray::ON_SimpleArray</a></div><div class="ttdeci">ON_SimpleArray() ON_NOEXCEPT</div><div class="ttdoc">construction //////////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:63</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a1a2dd98978dcb410ffad30abdd8d6fda"><div class="ttname"><a href="class_o_n___simple_array.html#a1a2dd98978dcb410ffad30abdd8d6fda">ON_SimpleArray::At</a></div><div class="ttdeci">T * At(int)</div><div class="ttdoc">At(index) returns nullptr if index < 0 or index >= count. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:389</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a0cb4a97082e4918b628d81b1fbb1516a"><div class="ttname"><a href="class_o_n___simple_array.html#a0cb4a97082e4918b628d81b1fbb1516a">ON_SimpleArray::Zero</a></div><div class="ttdeci">void Zero()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:777</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a417093e16515cefacd17dc940ea4a52f"><div class="ttname"><a href="class_o_n___class_array.html#a417093e16515cefacd17dc940ea4a52f">ON_ClassArray::Append</a></div><div class="ttdeci">void Append(const T &)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1475</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_acc29b3806f214bf0253499255e307856"><div class="ttname"><a href="class_o_n___class_array.html#acc29b3806f214bf0253499255e307856">ON_ClassArray::Empty</a></div><div class="ttdeci">void Empty()</div><div class="ttdoc">Sets count to 0, leaves capacity untouched. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1572</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a1845abffe10408c4ce46046d9232f8e8"><div class="ttname"><a href="class_o_n___class_array.html#a1845abffe10408c4ce46046d9232f8e8">ON_ClassArray::Count</a></div><div class="ttdeci">int Count() const</div><div class="ttdoc">query /////////////////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1136</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a5e9dfdb1601fb20ce86dfe8244719665"><div class="ttname"><a href="class_o_n___class_array.html#a5e9dfdb1601fb20ce86dfe8244719665">ON_ClassArray::Last</a></div><div class="ttdeci">T * Last()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1405</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ac8ea996fc990ee251d88b324bc8b08f2"><div class="ttname"><a href="class_o_n___class_array.html#ac8ea996fc990ee251d88b324bc8b08f2">ON_ClassArray::KeepArray</a></div><div class="ttdeci">T * KeepArray()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1315</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a99f627acedd725d474cae55985b02c8e"><div class="ttname"><a href="class_o_n___simple_array.html#a99f627acedd725d474cae55985b02c8e">ON_SimpleArray::Move</a></div><div class="ttdeci">void Move(int, int, int)</div><div class="ttdoc">implimentation ////////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:451</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a39b36908b477ca9e79dd435d1802237a"><div class="ttname"><a href="class_o_n___class_array.html#a39b36908b477ca9e79dd435d1802237a">ON_ClassArray::NewCapacity</a></div><div class="ttdeci">int NewCapacity() const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:898</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_afff693cde3bcf58c12392bc286204962"><div class="ttname"><a href="class_o_n___simple_array.html#afff693cde3bcf58c12392bc286204962">ON_SimpleArray::KeepArray</a></div><div class="ttdeci">T * KeepArray()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:349</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a11948f1e15b893414a0b432fd23a9d80"><div class="ttname"><a href="class_o_n___simple_array.html#a11948f1e15b893414a0b432fd23a9d80">ON_SimpleArray::Last</a></div><div class="ttdeci">T * Last()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:437</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a36d30dac6b1d443f64c267e1dbc62ff8"><div class="ttname"><a href="class_o_n___simple_array.html#a36d30dac6b1d443f64c267e1dbc62ff8">ON_SimpleArray::m_count</a></div><div class="ttdeci">int m_count</div><div class="ttdoc">0 <= m_count <= m_capacity </div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:363</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ad8afae29c14a95b85324992907c38929"><div class="ttname"><a href="class_o_n___class_array.html#ad8afae29c14a95b85324992907c38929">ON_ClassArray::~ON_ClassArray</a></div><div class="ttdeci">virtual ~ON_ClassArray()</div><div class="ttdoc">override for struct member deallocation, etc. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1062</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a317aa7fa09844d153876fa707ae87e2d"><div class="ttname"><a href="class_o_n___class_array.html#a317aa7fa09844d153876fa707ae87e2d">ON_ClassArray::SizeOfArray</a></div><div class="ttdeci">unsigned int SizeOfArray() const</div><div class="ttdoc">amount of memory in the m_a[] array </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1154</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_a417bd2085eaae1ff3f432e30bded35d3"><div class="ttname"><a href="class_o_n___object_array.html#a417bd2085eaae1ff3f432e30bded35d3">ON_ObjectArray::ON_ObjectArray</a></div><div class="ttdeci">ON_ObjectArray()</div><div class="ttdoc">Class ON_ObjectArray<> </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:934</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a741ee52742f90e2c7f5747700e161ea4"><div class="ttname"><a href="class_o_n___simple_array.html#a741ee52742f90e2c7f5747700e161ea4">ON_SimpleArray::SetArray</a></div><div class="ttdeci">void SetArray(T *)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:359</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_ad64a5a71533d8a06eb1a4961628b6ea2"><div class="ttname"><a href="class_o_n___simple_array.html#ad64a5a71533d8a06eb1a4961628b6ea2">ON_SimpleArray::operator=</a></div><div class="ttdeci">ON_SimpleArray< T > & operator=(const ON_SimpleArray< T > &)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:96</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html"><div class="ttname"><a href="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="class_o_n___simple_array_html_a586cf6b13a035d38f5eeeafec97fdff6"><div class="ttname"><a href="class_o_n___simple_array.html#a586cf6b13a035d38f5eeeafec97fdff6">ON_SimpleArray::Swap</a></div><div class="ttdeci">void Swap(int, int)</div><div class="ttdoc">swap elements i and j </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:582</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a5cd469fb4742e6424f9cabb1c8787c2a"><div class="ttname"><a href="class_o_n___class_array.html#a5cd469fb4742e6424f9cabb1c8787c2a">ON_ClassArray::Permute</a></div><div class="ttdeci">bool Permute(const int *)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1751</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_af828eb3eedaefe303676b81b0b5bd0cd"><div class="ttname"><a href="class_o_n___class_array.html#af828eb3eedaefe303676b81b0b5bd0cd">ON_ClassArray::Capacity</a></div><div class="ttdeci">int Capacity() const</div><div class="ttdoc">capacity of array </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1148</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a02045fb0cf4c9c24aabba20a2ae0c9f0"><div class="ttname"><a href="class_o_n___simple_array.html#a02045fb0cf4c9c24aabba20a2ae0c9f0">ON_SimpleArray::Shrink</a></div><div class="ttdeci">void Shrink()</div><div class="ttdoc">remove unused capacity </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:803</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a67e159de08eb6e1991ec10f551f6df05"><div class="ttname"><a href="class_o_n___simple_array.html#a67e159de08eb6e1991ec10f551f6df05">ON_SimpleArray::SetCapacity</a></div><div class="ttdeci">T * SetCapacity(size_t)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:824</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_aaaccc2915ed9407ed77e5355ed02f61a"><div class="ttname"><a href="class_o_n___class_array.html#aaaccc2915ed9407ed77e5355ed02f61a">ON_ClassArray::QuickSort</a></div><div class="ttdeci">virtual bool QuickSort(int(*)(const T *, const T *))</div><div class="ttdoc">Sorts the array using the heap sort algorithm. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1655</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html"><div class="ttname"><a href="class_o_n___object_array.html">ON_ObjectArray</a></div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:732</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_adfff8569ef8e5248c46a586d3a7f5d8d"><div class="ttname"><a href="class_o_n___simple_array.html#adfff8569ef8e5248c46a586d3a7f5d8d">ON_SimpleArray::BinarySearch</a></div><div class="ttdeci">int BinarySearch(const T *, int(*)(const T *, const T *)) const</div><div class="ttdoc">See Also: ON_CompareIncreasing<T> and ON_CompareDeccreasing<T> </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:613</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a827238e8843d73fc952018a49278b4c6"><div class="ttname"><a href="class_o_n___class_array.html#a827238e8843d73fc952018a49278b4c6">ON_ClassArray::ConstructDefaultElement</a></div><div class="ttdeci">void ConstructDefaultElement(T *)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1443</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a619516bde2761154d967c96ee6c2b044"><div class="ttname"><a href="class_o_n___class_array.html#a619516bde2761154d967c96ee6c2b044">ON_ClassArray::Reserve</a></div><div class="ttdeci">T * Reserve(size_t)</div><div class="ttdoc">memory managment ///////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1785</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a6f69264bb06391c81571f0182fbaef08"><div class="ttname"><a href="class_o_n___class_array.html#a6f69264bb06391c81571f0182fbaef08">ON_ClassArray::BinarySearch</a></div><div class="ttdeci">int BinarySearch(const T *, int(*)(const T *, const T *)) const</div><div class="ttdoc">See Also: ON_CompareIncreasing<T> and ON_CompareDeccreasing<T> </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1624</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_aa4f0900f2e6c9ca19f49dbc2c0ed8a32"><div class="ttname"><a href="class_o_n___simple_array.html#aa4f0900f2e6c9ca19f49dbc2c0ed8a32">ON_SimpleArray::Search</a></div><div class="ttdeci">int Search(const T &) const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:592</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_aba771b1bd1d30886c96da29ab89b86da"><div class="ttname"><a href="class_o_n___simple_array.html#aba771b1bd1d30886c96da29ab89b86da">ON_SimpleArray::Realloc</a></div><div class="ttdeci">virtual T * Realloc(T *, int)</div><div class="ttdoc">low level memory managment ////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:57</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a58673a8f943b627698b7f917b8bbcfdf"><div class="ttname"><a href="class_o_n___class_array.html#a58673a8f943b627698b7f917b8bbcfdf">ON_ClassArray::Move</a></div><div class="ttdeci">void Move(int, int, int)</div><div class="ttdoc">implimentation ////////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1419</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_acc32ae1ba071b666ae49a9d2c2a041e7"><div class="ttname"><a href="class_o_n___class_array.html#acc32ae1ba071b666ae49a9d2c2a041e7">ON_ClassArray::Sort</a></div><div class="ttdeci">bool Sort(ON::sort_algorithm sort_algorithm, int *, int(*)(const T *, const T *)) const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1721</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_a13c0a45951d15ca0d2a522e553b4a842"><div class="ttname"><a href="class_o_n___object_array.html#a13c0a45951d15ca0d2a522e553b4a842">ON_ObjectArray::Realloc</a></div><div class="ttdeci">T * Realloc(T *, int)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:992</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a5a8b7b4e1c8d4720f86d7cdcc880bb1b"><div class="ttname"><a href="class_o_n___simple_array.html#a5a8b7b4e1c8d4720f86d7cdcc880bb1b">ON_SimpleArray::m_a</a></div><div class="ttdeci">T * m_a</div><div class="ttdoc">pointer to array memory </div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:362</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_aeacff55bc065868229f3269bb47d0e31"><div class="ttname"><a href="class_o_n___class_array.html#aeacff55bc065868229f3269bb47d0e31">ON_ClassArray::HeapSort</a></div><div class="ttdeci">virtual bool HeapSort(int(*)(const T *, const T *))</div><div class="ttdoc">QuickSort() is generally the better choice. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1642</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_aebeebfb862065c0d62c00389ae3f499b"><div class="ttname"><a href="class_o_n___class_array.html#aebeebfb862065c0d62c00389ae3f499b">ON_ClassArray::Insert</a></div><div class="ttdeci">void Insert(int, const T &)</div><div class="ttdoc">Insert called with a reference uses operator =. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1522</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a9e27ce66d3c528a0b4ab6423b3524d33"><div class="ttname"><a href="class_o_n___simple_array.html#a9e27ce66d3c528a0b4ab6423b3524d33">ON_SimpleArray::MemSet</a></div><div class="ttdeci">void MemSet(unsigned char)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:785</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_aa2fec44abac5a4ba4bd84ca6b50a44f9"><div class="ttname"><a href="class_o_n___object_array.html#aa2fec44abac5a4ba4bd84ca6b50a44f9">ON_ObjectArray::DataCRC</a></div><div class="ttdeci">ON__UINT32 DataCRC(ON__UINT32 current_remainder) const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1022</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a8edc28b59c54bb9ab779199dd0e9c937"><div class="ttname"><a href="class_o_n___simple_array.html#a8edc28b59c54bb9ab779199dd0e9c937">ON_SimpleArray::QuickSort</a></div><div class="ttdeci">bool QuickSort(int(*)(const T *, const T *))</div><div class="ttdoc">See Also: ON_CompareIncreasing<T> and ON_CompareDeccreasing<T> </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:721</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a4a0e9f915b7b24ce1c9d700e011f3cce"><div class="ttname"><a href="class_o_n___simple_array.html#a4a0e9f915b7b24ce1c9d700e011f3cce">ON_SimpleArray::Insert</a></div><div class="ttdeci">void Insert(int, const T &)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:526</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a7ffd376de3d1af10f22caea8e5b5d114"><div class="ttname"><a href="class_o_n___class_array.html#a7ffd376de3d1af10f22caea8e5b5d114">ON_ClassArray::SetCount</a></div><div class="ttdeci">void SetCount(int)</div><div class="ttdoc">low level memory managment ////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1807</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_a53ef05dd586f31c2ddb4980185153398"><div class="ttname"><a href="class_o_n___object_array.html#a53ef05dd586f31c2ddb4980185153398">ON_ObjectArray::QuickSort</a></div><div class="ttdeci">bool QuickSort(int(*)(const T *, const T *))</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1695</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_a51ee75049ffb91c10f2acb17b99d3a66"><div class="ttname"><a href="class_o_n___object_array.html#a51ee75049ffb91c10f2acb17b99d3a66">ON_ObjectArray::HeapSort</a></div><div class="ttdeci">bool HeapSort(int(*)(const T *, const T *))</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1670</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a00c04a9b48b53459764dffe506b5e34c"><div class="ttname"><a href="class_o_n___class_array.html#a00c04a9b48b53459764dffe506b5e34c">ON_ClassArray::First</a></div><div class="ttdeci">T * First()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1343</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ab7b741c3481b50b44d69bd4a620296e8"><div class="ttname"><a href="class_o_n___class_array.html#ab7b741c3481b50b44d69bd4a620296e8">ON_ClassArray::operator=</a></div><div class="ttdeci">ON_ClassArray< T > & operator=(const ON_ClassArray< T > &)</div><div class="ttdoc">Assignment operator. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1068</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ac8613b7ab26dfabe4d630052a7167445"><div class="ttname"><a href="class_o_n___class_array.html#ac8613b7ab26dfabe4d630052a7167445">ON_ClassArray::Remove</a></div><div class="ttdeci">void Remove()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1548</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_abe6cd30eaa175e4c03cc23576acdd4f0"><div class="ttname"><a href="class_o_n___simple_array.html#abe6cd30eaa175e4c03cc23576acdd4f0">ON_SimpleArray::Permute</a></div><div class="ttdeci">bool Permute(const int *)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:761</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a7afd26b9d114490a7814353e3590f3a4"><div class="ttname"><a href="class_o_n___simple_array.html#a7afd26b9d114490a7814353e3590f3a4">ON_SimpleArray::UnsignedCount</a></div><div class="ttdeci">unsigned int UnsignedCount() const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:167</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a34c5ba8cd96d26d1880e2ecd0f21b6e5"><div class="ttname"><a href="class_o_n___class_array.html#a34c5ba8cd96d26d1880e2ecd0f21b6e5">ON_ClassArray::Shrink</a></div><div class="ttdeci">void Shrink()</div><div class="ttdoc">remove unused capacity </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1793</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a191f36f7af3813d99dac25c910a7f9a5"><div class="ttname"><a href="class_o_n___simple_array.html#a191f36f7af3813d99dac25c910a7f9a5">ON_SimpleArray::Append</a></div><div class="ttdeci">void Append(const T &)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:482</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a854343dc47d8e351690acaa531f2b44a"><div class="ttname"><a href="class_o_n___simple_array.html#a854343dc47d8e351690acaa531f2b44a">ON_SimpleArray::Reserve</a></div><div class="ttdeci">T * Reserve(size_t)</div><div class="ttdoc">memory managment //////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:795</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a14e3d8c3c9542339ffabe5b404b76062"><div class="ttname"><a href="class_o_n___simple_array.html#a14e3d8c3c9542339ffabe5b404b76062">ON_SimpleArray::Sort</a></div><div class="ttdeci">bool Sort(ON::sort_algorithm sort_algorithm, int *, int(*)(const T *, const T *)) const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:733</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_af361d7cf1705dccf62a534ddd0c48a69"><div class="ttname"><a href="class_o_n___class_array.html#af361d7cf1705dccf62a534ddd0c48a69">ON_ClassArray::m_count</a></div><div class="ttdeci">int m_count</div><div class="ttdoc">0 <= m_count <= m_capacity </div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:713</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_aa00c91a632d42ebbd4a04715750953ca"><div class="ttname"><a href="class_o_n___class_array.html#aa00c91a632d42ebbd4a04715750953ca">ON_ClassArray::Swap</a></div><div class="ttdeci">void Swap(int, int)</div><div class="ttdoc">swap elements i and j </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1602</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_aa3c8412725dd56733bbabee62e45f60d"><div class="ttname"><a href="class_o_n___simple_array.html#aa3c8412725dd56733bbabee62e45f60d">ON_SimpleArray::DataCRC</a></div><div class="ttdeci">ON__UINT32 DataCRC(ON__UINT32 current_remainder) const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:192</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a6146b9447dfc2420fd1ddc79f4e25d13"><div class="ttname"><a href="class_o_n___class_array.html#a6146b9447dfc2420fd1ddc79f4e25d13">ON_ClassArray::Realloc</a></div><div class="ttdeci">virtual T * Realloc(T *, int)</div><div class="ttdoc">low level memory managment /////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1016</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_adfced275ab81f79ae6a60d5f660c0fdf"><div class="ttname"><a href="class_o_n___class_array.html#adfced275ab81f79ae6a60d5f660c0fdf">ON_ClassArray::m_a</a></div><div class="ttdeci">T * m_a</div><div class="ttdoc">pointer to array memory </div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:712</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a4e749c63bb84c2b09ade86283f6d7707"><div class="ttname"><a href="class_o_n___class_array.html#a4e749c63bb84c2b09ade86283f6d7707">ON_ClassArray::Zero</a></div><div class="ttdeci">void Zero()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1768</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_ae78ec3ac6f59fd1d61e69e334124f2f5"><div class="ttname"><a href="class_o_n___simple_array.html#ae78ec3ac6f59fd1d61e69e334124f2f5">ON_SimpleArray::SizeOfElement</a></div><div class="ttdeci">unsigned int SizeOfElement() const</div><div class="ttdoc">amount of memory in an m_a[] array element </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:185</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a5acea41054fd3321109b75cb7dbe1316"><div class="ttname"><a href="class_o_n___simple_array.html#a5acea41054fd3321109b75cb7dbe1316">ON_SimpleArray::operator[]</a></div><div class="ttdeci">T & operator[](int)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:198</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a3453ebec06da96dd2bc10f66b4312dda"><div class="ttname"><a href="class_o_n___class_array.html#a3453ebec06da96dd2bc10f66b4312dda">ON_ClassArray::AppendNew</a></div><div class="ttdeci">T & AppendNew()</div><div class="ttdoc">array operations //////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1457</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ab8a86fe207a6b43c493104e166003250"><div class="ttname"><a href="class_o_n___class_array.html#ab8a86fe207a6b43c493104e166003250">ON_ClassArray::Destroy</a></div><div class="ttdeci">void Destroy()</div><div class="ttdoc">onfree any memory and set count and capacity to zero </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1799</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a404695bf0683f18b0e2a1b2cc2538fa3"><div class="ttname"><a href="class_o_n___class_array.html#a404695bf0683f18b0e2a1b2cc2538fa3">ON_ClassArray::SetArray</a></div><div class="ttdeci">void SetArray(T *)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1325</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_a3e17771cd9eaad00c29c1959d0973b21"><div class="ttname"><a href="class_o_n___object_array.html#a3e17771cd9eaad00c29c1959d0973b21">ON_ObjectArray::~ON_ObjectArray</a></div><div class="ttdeci">~ON_ObjectArray()</div><div class="ttdoc">override for struct member deallocation, etc. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:939</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a8ea224d8ba49b55fce89f04657ccb0e5"><div class="ttname"><a href="class_o_n___simple_array.html#a8ea224d8ba49b55fce89f04657ccb0e5">ON_SimpleArray::Reverse</a></div><div class="ttdeci">void Reverse()</div><div class="ttdoc">reverse order </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:566</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a7ddb43ae86d40b5088a9ed0852354899"><div class="ttname"><a href="class_o_n___simple_array.html#a7ddb43ae86d40b5088a9ed0852354899">ON_SimpleArray::SizeOfArray</a></div><div class="ttdeci">unsigned int SizeOfArray() const</div><div class="ttdoc">amount of memory in the m_a[] array </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:179</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_adf0b64e2722e1e77fa1dfd5fe1e222de"><div class="ttname"><a href="class_o_n___class_array.html#adf0b64e2722e1e77fa1dfd5fe1e222de">ON_ClassArray::SizeOfElement</a></div><div class="ttdeci">unsigned int SizeOfElement() const</div><div class="ttdoc">amount of memory in an m_a[] array element </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1160</div></div>
|
|
<div class="ttc" id="class_o_n___object_array_html_aaeb291f91e4c478ac08a8fe51e5c841b"><div class="ttname"><a href="class_o_n___object_array.html#aaeb291f91e4c478ac08a8fe51e5c841b">ON_ObjectArray::operator=</a></div><div class="ttdeci">ON_ObjectArray< T > & operator=(const ON_ObjectArray< T > &)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:949</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html"><div class="ttname"><a href="class_o_n___class_array.html">ON_ClassArray</a></div><div class="ttdef"><b>Definition:</b> opennurbs_array.h:412</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a449bfb832fcb364e9b8349ea4dc8a343"><div class="ttname"><a href="class_o_n___simple_array.html#a449bfb832fcb364e9b8349ea4dc8a343">ON_SimpleArray::SetCount</a></div><div class="ttdeci">void SetCount(int)</div><div class="ttdoc">low level memory managment ////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:817</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ae0cf9e8ff629067820b78bf8fa4723fd"><div class="ttname"><a href="class_o_n___class_array.html#ae0cf9e8ff629067820b78bf8fa4723fd">ON_ClassArray::Reverse</a></div><div class="ttdeci">void Reverse()</div><div class="ttdoc">reverse order </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1586</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_aa12a2a08c847c3221d9ebd037cd67236"><div class="ttname"><a href="class_o_n___class_array.html#aa12a2a08c847c3221d9ebd037cd67236">ON_ClassArray::ON_ClassArray</a></div><div class="ttdeci">ON_ClassArray() ON_NOEXCEPT</div><div class="ttdoc">construction //////////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1035</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a49bc44bb095af6dd8173a91441b78bfd"><div class="ttname"><a href="class_o_n___class_array.html#a49bc44bb095af6dd8173a91441b78bfd">ON_ClassArray::SetCapacity</a></div><div class="ttdeci">T * SetCapacity(size_t)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1814</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_adc4dd6d8de7311c1be580a62b3bcb8e4"><div class="ttname"><a href="class_o_n___simple_array.html#adc4dd6d8de7311c1be580a62b3bcb8e4">ON_SimpleArray::First</a></div><div class="ttdeci">T * First()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:377</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a8c5f556cc24b13bfd1a4f6d09d1cb060"><div class="ttname"><a href="class_o_n___simple_array.html#a8c5f556cc24b13bfd1a4f6d09d1cb060">ON_SimpleArray::EmergencyDestroy</a></div><div class="ttdeci">void EmergencyDestroy(void)</div><div class="ttdoc">emergency bailout /////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:151</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a5451b98ba3fb0936ffbfe9f59cb4b09e"><div class="ttname"><a href="class_o_n___class_array.html#a5451b98ba3fb0936ffbfe9f59cb4b09e">ON_ClassArray::At</a></div><div class="ttdeci">T * At(int)</div><div class="ttdoc">At(index) returns nullptr if index < 0 or index >= count. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1355</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a36597e8827a812df0d9c6c81c1db4e81"><div class="ttname"><a href="class_o_n___class_array.html#a36597e8827a812df0d9c6c81c1db4e81">ON_ClassArray::Array</a></div><div class="ttdeci">T * Array()</div><div class="ttdoc">The Array() function return the. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1303</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a5d2395da5bc042c230d799ed92c9c564"><div class="ttname"><a href="class_o_n___simple_array.html#a5d2395da5bc042c230d799ed92c9c564">ON_SimpleArray::NewCapacity</a></div><div class="ttdeci">int NewCapacity() const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:866</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a81068392f935f0d7efa9d772960bf157"><div class="ttname"><a href="class_o_n___simple_array.html#a81068392f935f0d7efa9d772960bf157">ON_SimpleArray::HeapSort</a></div><div class="ttdeci">bool HeapSort(int(*)(const T *, const T *))</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:709</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_ad4650327b91304e934de5bf6fe4bb9ae"><div class="ttname"><a href="class_o_n___class_array.html#ad4650327b91304e934de5bf6fe4bb9ae">ON_ClassArray::DestroyElement</a></div><div class="ttdeci">void DestroyElement(T &)</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1451</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_ad44741ad8393d128dae2ff39b8c596c9"><div class="ttname"><a href="class_o_n___simple_array.html#ad44741ad8393d128dae2ff39b8c596c9">ON_SimpleArray::Count</a></div><div class="ttdeci">int Count() const</div><div class="ttdoc">query /////////////////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:161</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_adce0cef747a0af8ba530d783803eebea"><div class="ttname"><a href="class_o_n___simple_array.html#adce0cef747a0af8ba530d783803eebea">ON_SimpleArray::Array</a></div><div class="ttdeci">T * Array()</div><div class="ttdoc">The Array() function return the. </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:337</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a815f500f614c1742ba1f250b6e46ab1c"><div class="ttname"><a href="class_o_n___class_array.html#a815f500f614c1742ba1f250b6e46ab1c">ON_ClassArray::Search</a></div><div class="ttdeci">int Search(const T *, int(*)(const T *, const T *)) const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1613</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_ab5bef8e837e8f2dc8556170a768974d2"><div class="ttname"><a href="class_o_n___simple_array.html#ab5bef8e837e8f2dc8556170a768974d2">ON_SimpleArray::Remove</a></div><div class="ttdeci">void Remove()</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:542</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_a56a43009d39635f9c0a08272391b5951"><div class="ttname"><a href="class_o_n___simple_array.html#a56a43009d39635f9c0a08272391b5951">ON_SimpleArray::Destroy</a></div><div class="ttdeci">void Destroy()</div><div class="ttdoc">onfree any memory and set count and capacity to zero </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:809</div></div>
|
|
<div class="ttc" id="class_o_n___simple_array_html_ad6fb51ad272618b034b8dd4695094a2d"><div class="ttname"><a href="class_o_n___simple_array.html#ad6fb51ad272618b034b8dd4695094a2d">ON_SimpleArray::AppendNew</a></div><div class="ttdeci">T & AppendNew()</div><div class="ttdoc">array operations //////////////////////////////////////////////////// </div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:470</div></div>
|
|
<div class="ttc" id="class_o_n___class_array_html_a64d1db4495becbc776ba36549ad93fd1"><div class="ttname"><a href="class_o_n___class_array.html#a64d1db4495becbc776ba36549ad93fd1">ON_ClassArray::UnsignedCount</a></div><div class="ttdeci">unsigned int UnsignedCount() const</div><div class="ttdef"><b>Definition:</b> opennurbs_array_defs.h:1142</div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated on Thu Jan 25 2018 17:01:08 for openNURBS SDK Help by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.14
|
|
</small></address>
|
|
</body>
|
|
</html>
|