mirror of
https://github.com/mcneel/opennurbs.git
synced 2026-04-19 12:46:04 +08:00
82 lines
46 KiB
HTML
82 lines
46 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_quacksort_template.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_quacksort_template.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-2011 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 & Assoicates.</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="comment">/*</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">See opennurbs_sort.cpp for examples showing how to use</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">opennurbs_quacksort_template.h to define type specific</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">sorting functions.</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">*/</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#if !defined(ON_QSORT_FNAME)</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#error Define ON_QSORT_FNAME macro before including opennurbs_quacksort_template.h</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// ON_SORT_TEMPLATE_TYPE -> double, int, ....</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#if !defined(ON_SORT_TEMPLATE_TYPE)</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#define BASETYPE void *</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define DATATYPE unsigned char</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#define DATAWIDTH m_width</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define Swap(a,b) m_swapfunc(a,b,m_width)</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#if defined(ON_SORT_TEMPLATE_USE_CONTEXT)</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// use a compare function with context parameter</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#define GreaterThan(A,B) m_compare(m_context,A,B) > 0</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// use a compare function without context parameter</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#define GreaterThan(A,B) m_compare(A,B) > 0</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#define BASETYPE ON_SORT_TEMPLATE_TYPE *</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#define DATATYPE ON_SORT_TEMPLATE_TYPE</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#define DATAWIDTH 1</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#if defined(ON_SORT_TEMPLATE_USE_SWAP)</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#define Swap(a,b) m_swapfunc(a,b,m_width)</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// use intrinsic assigment</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#define Swap(a,b) ON_SORT_TEMPLATE_TYPE tmp = *a; *a = *b; *b = tmp</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#if defined(ON_SORT_TEMPLATE_COMPARE)</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// use a compare function like strcmp for char* strings</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#define GreaterThan(A,B) ON_SORT_TEMPLATE_COMPARE(A,B) > 0</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// use intrinsic type compares</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#define GreaterThan(A,B) *A > *B</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#if !defined(ON_QUACKSORT_SWAP_FUNCS_DEFINED)</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#if !defined(ON_SORT_TEMPLATE_TYPE) || defined(ON_SORT_TEMPLATE_USE_SWAP)</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// In some files this template is used multiple times.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// The ON_QUACKSORT_SWAP_FUNCS_DEFINED define prevents</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// multiple definitions of the static Swap*() functions.</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor">#define ON_QUACKSORT_SWAP_FUNCS_DEFINED</span></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="keyword">static</span> <span class="keywordtype">void</span> SwapChars( <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* a, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* b, <span class="keywordtype">size_t</span> width)</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> {</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">do</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="keywordtype">unsigned</span> <span class="keywordtype">char</span> x = *a;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  *a++ = *b;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  *b++ = x;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">while</span>( --width);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> }</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">static</span> <span class="keywordtype">void</span> SwapInts( <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* a, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* b, <span class="keywordtype">size_t</span> width)</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>  ON__UINT32* ai = (ON__UINT32*)a;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  ON__UINT32* bi = (ON__UINT32*)b;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">do</span></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>  ON__UINT32 x = *ai;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  *ai++ = *bi;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  *bi++ = x;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  width -= <span class="keyword">sizeof</span>(x);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">while</span>( width);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">static</span> <span class="keywordtype">void</span> SwapBigInts( <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* a, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* b, <span class="keywordtype">size_t</span> width)</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>  ON__UINT64* ai = (ON__UINT64*)a;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  ON__UINT64* bi = (ON__UINT64*)b;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">do</span></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>  ON__UINT64 x = *ai;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  *ai++ = *bi;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  *bi++ = x;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  width -= <span class="keyword">sizeof</span>(x);</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>  <span class="keywordflow">while</span>( width);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor">#endif</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">// implementation of quick sort with minimum swaps for partition sizes 4 and less</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="keywordtype">void</span> ON_quacksort( </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  BASETYPE *base</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  ,<span class="keywordtype">size_t</span> nel</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> #<span class="keywordflow">if</span> !defined(ON_SORT_TEMPLATE_TYPE)</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  ,<span class="keywordtype">size_t</span> width</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> #<span class="keywordflow">if</span> defined(ON_SORT_TEMPLATE_USE_CONTEXT)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  ,<span class="keywordtype">int</span> (*compar)(<span class="keywordtype">void</span>*, <span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  ,<span class="keywordtype">void</span>* context</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> #<span class="keywordflow">else</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  ,<span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *)</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> #endif</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> #endif</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  )</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">class </span>CSorter</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  DATATYPE *m_base;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">size_t</span> m_nel;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> m_width;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  int (*m_compar)(<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  void (*m_swapfunc)(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *, <span class="keywordtype">size_t</span> width);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_rnd;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">//#if defined(ON_SORT_TEMPLATE_TYPE) && !defined(ON_SORT_TEMPLATE_USE_SWAP)</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// ON_SORT_TEMPLATE_TYPE m_tmp;</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">//#endif</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>  CSorter( </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  DATATYPE *base</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  , <span class="keywordtype">size_t</span> nel</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  , <span class="keywordtype">size_t</span> width</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  , <span class="keywordtype">int</span> (*compar)(<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *)</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  )</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  : m_base((DATATYPE*)base)</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  , m_nel(nel)</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  , m_width(width)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  , m_compar(compar)</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  , m_rnd(62538161)</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>  <span class="comment">// When width is a multiple of 8 or 4 (with most arrays it probably is),</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// use faster integer swappers instead of byte swapper</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> ( 0 == width%<span class="keyword">sizeof</span>(ON__UINT64))</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  m_swapfunc = SwapBigInts;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( 0 == width%<span class="keyword">sizeof</span>(ON__UINT32))</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  m_swapfunc = SwapInts;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  m_swapfunc = SwapChars;</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> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  ~CSorter() {};</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  DATATYPE* Pivot( DATATYPE* base, <span class="keywordtype">size_t</span> 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>  <span class="comment">// Uses local quick and dirty pseudorandom number generator to </span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// give a fuzzy answer to avoid having the data be arranged in </span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// a way that mechanically always picking the pivot the same way </span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// affects the speed. Mostly affects chevron etc. patterns.</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// </span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// Totally random pivot would guarantee O(nlogn) worst case, but </span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// does not perform as well on sorted or nearly sorted sets.</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  m_rnd *= 1664525;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  m_rnd += 1013904223;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> dice = (m_rnd>>16)&7;</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>  <span class="keywordtype">size_t</span> p=count>>1; <span class="comment">// 1/2</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> ( dice&4)</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  p += count>>3; <span class="comment">// +1/8</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> ( dice&2)</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  p -= count>>4; <span class="comment">// -1/16</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> ( dice&1)</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  p -= count>>5; <span class="comment">// -1/32</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">return</span> base + p*DATAWIDTH;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">void</span> SortSmallRange( DATATYPE* p0, <span class="keywordtype">size_t</span> count)</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="comment">// use minimum compares and swaps for 2 to 4 items</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">switch</span> (count)</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="keywordflow">case</span> 2:</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  DATATYPE* p1 = p0 + DATAWIDTH;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> ( GreaterThan( p0, p1)) { Swap( p0, p1);}</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">case</span> 3:</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>  DATATYPE* p1 = p0 + DATAWIDTH;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  DATATYPE* p2 = p1 + DATAWIDTH;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordtype">bool</span> b = <span class="keyword">false</span>;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> ( GreaterThan( p0, p1)) { Swap( p0, p1); b = <span class="keyword">true</span>;}</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> ( GreaterThan( p1, p2)) { Swap( p1, p2); b = <span class="keyword">true</span>;}</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> ( b && GreaterThan( p0, p1)) { Swap( p0, p1);}</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">case</span> 4:</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  DATATYPE* p1 = p0 + DATAWIDTH;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  DATATYPE* p2 = p1 + DATAWIDTH;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  DATATYPE* p3 = p2 + DATAWIDTH;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> ( GreaterThan( p0, p3)) { Swap( p0, p3);}</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">if</span> ( GreaterThan( p1, p2)) { Swap( p1, p2);}</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">bool</span> b = <span class="keyword">false</span>;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">if</span> ( GreaterThan( p2, p3)) { Swap( p2, p3); b = <span class="keyword">true</span>;}</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> ( GreaterThan( p0, p1)) { Swap( p0, p1); b = <span class="keyword">true</span>;}</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> ( b && GreaterThan( p1, p2)) { Swap( p1, p2);}</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</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>  }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">void</span> SortRange( DATATYPE* left, DATATYPE* right)</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="keywordflow">while</span> ( left<right)</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  { </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">size_t</span> count = (right-left)/DATAWIDTH+1;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span> ( count < 5)</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">return</span> SortSmallRange( left, count);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  DATATYPE* pivotleft;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  DATATYPE* pivotright;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// partition range</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>  pivotleft = Pivot( left, count);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="comment">// move pivot to left end</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  Swap( left, pivotleft);</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>  pivotleft = left;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  pivotright = right + DATAWIDTH;</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>  <span class="comment">// move =< pivot to left, and > pivot to right</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">for</span>(;;)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  {</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// find next first item > pivot</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  pivotleft += DATAWIDTH;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> ( pivotleft >= pivotright)</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">if</span> ( !GreaterThan( pivotleft, left))</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// find next last item =< pivot</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">do</span></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>  pivotright -= DATAWIDTH;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> ( pivotleft >= pivotright)</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">goto</span> END; <span class="comment">// to quickly exit a nested loop</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">while</span>( GreaterThan( pivotright, left));</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>  Swap( pivotleft, pivotright);</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  END:</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  pivotright -= DATAWIDTH;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// move pivot to final place</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  Swap( left, pivotright);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  pivotleft = pivotright;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// avoid overhead when not likely that there are multiple items == pivot</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> ( pivotright >= right)</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="comment">// the whole range is less or equal than pivot</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// check if there are values == pivot left of it. Speeds up sorting arrays with all or lots of equal items.</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">for</span> ( pivotleft -= DATAWIDTH; pivotleft > left; pivotleft -= DATAWIDTH)</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">if</span> ( GreaterThan( pivotright, pivotleft))</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  pivotleft += DATAWIDTH;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// limit max recursion depth to log(nel) by only recursing shorter part</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> ( pivotleft-left < right-pivotright)</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  {</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// lower part is shorter</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  SortRange( left, pivotleft-DATAWIDTH);</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  left = pivotright+DATAWIDTH;</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>  <span class="keywordflow">else</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="comment">// upper part is shorter</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  SortRange( pivotright+DATAWIDTH, right);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  right = pivotleft-DATAWIDTH;</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>  }</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  }</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordtype">void</span> Sort()</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  {</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  SortRange( m_base, m_base + (m_nel-1)*DATAWIDTH);</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>  };</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="keywordflow">if</span> ( !base || nel < 2 )</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="preprocessor">#if !defined(ON_SORT_TEMPLATE_TYPE)</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">if</span> ( width < 1 || !compar)</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  CSorter sorter( base, nel, width, compar);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  sorter.Sort();</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="preprocessor">#undef Swap</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="preprocessor">#undef GreaterThan</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="preprocessor">#undef DATAWIDTH</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="preprocessor">#undef DATATYPE</span></div></div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated on Thu Jan 25 2018 17:01:09 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>
|