Home Explore Help
Sign In
cpp
/
JoltPhysics
mirror of https://github.com/jrouwe/JoltPhysics.git
2
0
Fork 0
Files Issues 0 Wiki
Branch: gh-pages
Branches Tags
JoltPhysics
/
_quick_sort_8h_source.html

_quick_sort_8h_source.html 28 KB
Permalink History Raw

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270 
  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
    2. 

  2. <html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
    3. 

  3. <head>
    4. 

  4. <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
    5. 

  5. <meta http-equiv="X-UA-Compatible" content="IE=11"/>
    6. 

  6. <meta name="generator" content="Doxygen 1.12.0"/>
    7. 

  7. <meta name="viewport" content="width=device-width, initial-scale=1"/>
    8. 

  8. <title>Jolt Physics: Jolt/Core/QuickSort.h Source File</title>
    9. 

  9. <link href="tabs.css" rel="stylesheet" type="text/css"/>
    10. 

  10. <script type="text/javascript" src="jquery.js"></script>
    11. 

  11. <script type="text/javascript" src="dynsections.js"></script>
    12. 

  12. <script type="text/javascript" src="clipboard.js"></script>
    13. 

  13. <link href="navtree.css" rel="stylesheet" type="text/css"/>
    14. 

  14. <script type="text/javascript" src="navtreedata.js"></script>
    15. 

  15. <script type="text/javascript" src="navtree.js"></script>
    16. 

  16. <script type="text/javascript" src="resize.js"></script>
    17. 

  17. <script type="text/javascript" src="cookie.js"></script>
    18. 

  18. <link href="search/search.css" rel="stylesheet" type="text/css"/>
    19. 

  19. <script type="text/javascript" src="search/searchdata.js"></script>
    20. 

  20. <script type="text/javascript" src="search/search.js"></script>
    21. 

  21. <script type="text/x-mathjax-config">
    22. 

  22. MathJax.Hub.Config({
    23. 

  23.   extensions: ["tex2jax.js"],
    24. 

  24.   jax: ["input/TeX","output/HTML-CSS"],
    25. 

  25. });
    26. 

  26. </script>
    27. 

  27. <script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js"></script>
    28. 

  28. <link href="doxygen.css" rel="stylesheet" type="text/css" />
    29. 

  29. </head>
    30. 

  30. <body>
    31. 

  31. <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
    32. 

  32. <div id="titlearea">
    33. 

  33. <table cellspacing="0" cellpadding="0">
    34. 

  34.  <tbody>
    35. 

  35.  <tr id="projectrow">
    36. 

  36.   <td id="projectlogo"><img alt="Logo" src="LogoSmall.png"/></td>
    37. 

  37.   <td id="projectalign">
    38. 

  38.    <div id="projectname">Jolt Physics
    39. 

  39.    </div>
    40. 

  40.    <div id="projectbrief">A multi core friendly Game Physics Engine</div>
    41. 

  41.   </td>
    42. 

  42.  </tr>
    43. 

  43.  </tbody>
    44. 

  44. </table>
    45. 

  45. </div>
    46. 

  46. <!-- end header part -->
    47. 

  47. <!-- Generated by Doxygen 1.12.0 -->
    48. 

  48. <script type="text/javascript">
    49. 

  49. /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
    50. 

  50. var searchBox = new SearchBox("searchBox", "search/",'.html');
    51. 

  51. /* @license-end */
    52. 

  52. </script>
    53. 

  53. <script type="text/javascript">
    54. 

  54. /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
    55. 

  55. $(function() { codefold.init(0); });
    56. 

  56. /* @license-end */
    57. 

  57. </script>
    58. 

  58. <script type="text/javascript" src="menudata.js"></script>
    59. 

  59. <script type="text/javascript" src="menu.js"></script>
    60. 

  60. <script type="text/javascript">
    61. 

  61. /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
    62. 

  62. $(function() {
    63. 

  63.   initMenu('',true,false,'search.php','Search',true);
    64. 

  64.   $(function() { init_search(); });
    65. 

  65. });
    66. 

  66. /* @license-end */
    67. 

  67. </script>
    68. 

  68. <div id="main-nav"></div>
    69. 

  69. </div><!-- top -->
    70. 

  70. <div id="side-nav" class="ui-resizable side-nav-resizable">
    71. 

  71.   <div id="nav-tree">
    72. 

  72.     <div id="nav-tree-contents">
    73. 

  73.       <div id="nav-sync" class="sync"></div>
    74. 

  74.     </div>
    75. 

  75.   </div>
    76. 

  76.   <div id="splitbar" style="-moz-user-select:none;" 
    77. 

  77.        class="ui-resizable-handle">
    78. 

  78.   </div>
    79. 

  79. </div>
    80. 

  80. <script type="text/javascript">
    81. 

  81. /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
    82. 

  82. $(function(){initNavTree('_quick_sort_8h_source.html',''); initResizable(true); });
    83. 

  83. /* @license-end */
    84. 

  84. </script>
    85. 

  85. <div id="doc-content">
    86. 

  86. <!-- window showing the filter options -->
    87. 

  87. <div id="MSearchSelectWindow"
    88. 

  88.      onmouseover="return searchBox.OnSearchSelectShow()"
    89. 

  89.      onmouseout="return searchBox.OnSearchSelectHide()"
    90. 

  90.      onkeydown="return searchBox.OnSearchSelectKey(event)">
    91. 

  91. </div>
    92. 

  92. 

  93. <!-- iframe showing the search results (closed by default) -->
    94. 

  94. <div id="MSearchResultsWindow">
    95. 

  95. <div id="MSearchResults">
    96. 

  96. <div class="SRPage">
    97. 

  97. <div id="SRIndex">
    98. 

  98. <div id="SRResults"></div>
    99. 

  99. <div class="SRStatus" id="Loading">Loading...</div>
    100. 

  100. <div class="SRStatus" id="Searching">Searching...</div>
    101. 

  101. <div class="SRStatus" id="NoMatches">No Matches</div>
    102. 

  102. </div>
    103. 

  103. </div>
    104. 

  104. </div>
    105. 

  105. </div>
    106. 

  106. 

  107. <div class="header">
    108. 

  108.   <div class="headertitle"><div class="title">QuickSort.h</div></div>
    109. 

  109. </div><!--header-->
    110. 

  110. <div class="contents">
    111. 

  111. <a href="_quick_sort_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)</span></div>
    112. 

  112. <div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">// SPDX-FileCopyrightText: 2022 Jorrit Rouwe</span></div>
    113. 

  113. <div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">// SPDX-License-Identifier: MIT</span></div>
    114. 

  114. <div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
    115. 

  115. <div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#pragma once</span></div>
    116. 

  116. <div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
    117. 

  117. <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;<a class="code" href="_insertion_sort_8h.html">Jolt/Core/InsertionSort.h</a>&gt;</span></div>
    118. 

  118. <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
    119. 

  119. <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><a class="code hl_define" href="_core_8h.html#ad14098b68b8c44ea6112601031268405">JPH_NAMESPACE_BEGIN</a></div>
    120. 

  120. <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
    121. 

  121. <div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Iterator, <span class="keyword">typename</span> Compare&gt;</div>
    122. 

  122. <div class="foldopen" id="foldopen00013" data-start="{" data-end="}">
    123. 

  123. <div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">   13</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">QuickSortMedianOfThree</a>(Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)</div>
    124. 

  124. <div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>{</div>
    125. 

  125. <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="comment">// This should be guaranteed because we switch over to insertion sort when there&#39;s 32 or less elements</span></div>
    126. 

  126. <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <a class="code hl_define" href="_issue_reporting_8h.html#aaf6b1df827e11b7ca5f6f8778bd8f8cd">JPH_ASSERT</a>(inFirst != inMiddle &amp;&amp; inMiddle != inLast);</div>
    127. 

  127. <div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
    128. 

  128. <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">if</span> (inCompare(*inMiddle, *inFirst))</div>
    129. 

  129. <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        std::swap(*inFirst, *inMiddle);</div>
    130. 

  130. <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
    131. 

  131. <div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">if</span> (inCompare(*inLast, *inFirst))</div>
    132. 

  132. <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        std::swap(*inFirst, *inLast);</div>
    133. 

  133. <div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
    134. 

  134. <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">if</span> (inCompare(*inLast, *inMiddle))</div>
    135. 

  135. <div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        std::swap(*inMiddle, *inLast);</div>
    136. 

  136. <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>}</div>
    137. 

  137. </div>
    138. 

  138. <div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
    139. 

  139. <div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Iterator, <span class="keyword">typename</span> Compare&gt;</div>
    140. 

  140. <div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
    141. 

  141. <div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="_quick_sort_8h.html#a7f9496a620493fec0bb6e08af489dc27">   30</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="_quick_sort_8h.html#a7f9496a620493fec0bb6e08af489dc27">QuickSortNinther</a>(Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)</div>
    142. 

  142. <div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>{</div>
    143. 

  143. <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// Divide the range in 8 equal parts (this means there are 9 points)</span></div>
    144. 

  144. <div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keyword">auto</span> diff = (inLast - inFirst) &gt;&gt; 3;</div>
    145. 

  145. <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keyword">auto</span> two_diff = diff &lt;&lt; 1;</div>
    146. 

  146. <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
    147. 

  147. <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// Median of first 3 points</span></div>
    148. 

  148. <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    Iterator mid1 = inFirst + diff;</div>
    149. 

  149. <div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <a class="code hl_function" href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">QuickSortMedianOfThree</a>(inFirst, mid1, inFirst + two_diff, inCompare);</div>
    150. 

  150. <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
    151. 

  151. <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// Median of second 3 points</span></div>
    152. 

  152. <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <a class="code hl_function" href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">QuickSortMedianOfThree</a>(inMiddle - diff, inMiddle, inMiddle + diff, inCompare);</div>
    153. 

  153. <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
    154. 

  154. <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// Median of third 3 points</span></div>
    155. 

  155. <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    Iterator mid3 = inLast - diff;</div>
    156. 

  156. <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <a class="code hl_function" href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">QuickSortMedianOfThree</a>(inLast - two_diff, mid3, inLast, inCompare);</div>
    157. 

  157. <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
    158. 

  158. <div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="comment">// Determine the median of the 3 medians</span></div>
    159. 

  159. <div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <a class="code hl_function" href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">QuickSortMedianOfThree</a>(mid1, inMiddle, mid3, inCompare);</div>
    160. 

  160. <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
    161. 

  161. </div>
    162. 

  162. <div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
    163. 

  163. <div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Iterator, <span class="keyword">typename</span> Compare&gt;</div>
    164. 

  164. <div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
    165. 

  165. <div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">   53</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">QuickSort</a>(Iterator inBegin, Iterator inEnd, Compare inCompare)</div>
    166. 

  166. <div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>{</div>
    167. 

  167. <div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// Implementation based on https://en.wikipedia.org/wiki/Quicksort using Hoare&#39;s partition scheme</span></div>
    168. 

  168. <div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
    169. 

  169. <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="comment">// Loop so that we only need to do 1 recursive call instead of 2.</span></div>
    170. 

  170. <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">for</span> (;;)</div>
    171. 

  171. <div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    {</div>
    172. 

  172. <div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="comment">// If there&#39;s less than 2 elements we&#39;re done</span></div>
    173. 

  173. <div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keyword">auto</span> num_elements = inEnd - inBegin;</div>
    174. 

  174. <div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (num_elements &lt; 2)</div>
    175. 

  175. <div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">return</span>;</div>
    176. 

  176. <div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
    177. 

  177. <div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="comment">// Fall back to insertion sort if there are too few elements</span></div>
    178. 

  178. <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (num_elements &lt;= 32)</div>
    179. 

  179. <div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        {</div>
    180. 

  180. <div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <a class="code hl_function" href="_insertion_sort_8h.html#a1c833812e3ce3c4848ccd57826ab2463">InsertionSort</a>(inBegin, inEnd, inCompare);</div>
    181. 

  181. <div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">return</span>;</div>
    182. 

  182. <div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        }</div>
    183. 

  183. <div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
    184. 

  184. <div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="comment">// Determine pivot</span></div>
    185. 

  185. <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        Iterator pivot_iterator = inBegin + ((num_elements - 1) &gt;&gt; 1);</div>
    186. 

  186. <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_function" href="_quick_sort_8h.html#a7f9496a620493fec0bb6e08af489dc27">QuickSortNinther</a>(inBegin, pivot_iterator, inEnd - 1, inCompare);</div>
    187. 

  187. <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keyword">auto</span> pivot = *pivot_iterator;</div>
    188. 

  188. <div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
    189. 

  189. <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="comment">// Left and right iterators</span></div>
    190. 

  190. <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        Iterator i = inBegin;</div>
    191. 

  191. <div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        Iterator j = inEnd;</div>
    192. 

  192. <div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
    193. 

  193. <div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">for</span> (;;)</div>
    194. 

  194. <div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        {</div>
    195. 

  195. <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="comment">// Find the first element that is bigger than the pivot</span></div>
    196. 

  196. <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">while</span> (inCompare(*i, pivot))</div>
    197. 

  197. <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                i++;</div>
    198. 

  198. <div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
    199. 

  199. <div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="comment">// Find the last element that is smaller than the pivot</span></div>
    200. 

  200. <div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            <span class="keywordflow">do</span></div>
    201. 

  201. <div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                --j;</div>
    202. 

  202. <div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keywordflow">while</span> (inCompare(pivot, *j));</div>
    203. 

  203. <div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
    204. 

  204. <div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <span class="comment">// If the two iterators crossed, we&#39;re done</span></div>
    205. 

  205. <div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="keywordflow">if</span> (i &gt;= j)</div>
    206. 

  206. <div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                <span class="keywordflow">break</span>;</div>
    207. 

  207. <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
    208. 

  208. <div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="comment">// Swap the elements</span></div>
    209. 

  209. <div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            std::swap(*i, *j);</div>
    210. 

  210. <div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
    211. 

  211. <div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="comment">// Note that the first while loop in this function should</span></div>
    212. 

  212. <div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <span class="comment">// have been do i++ while (...) but since we cannot decrement</span></div>
    213. 

  213. <div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <span class="comment">// the iterator from inBegin we left that out, so we need to do</span></div>
    214. 

  214. <div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            <span class="comment">// it here.</span></div>
    215. 

  215. <div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            ++i;</div>
    216. 

  216. <div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        }</div>
    217. 

  217. <div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
    218. 

  218. <div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="comment">// Include the middle element on the left side</span></div>
    219. 

  219. <div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        j++;</div>
    220. 

  220. <div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
    221. 

  221. <div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="comment">// Check which partition is smaller</span></div>
    222. 

  222. <div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">if</span> (j - inBegin &lt; inEnd - j)</div>
    223. 

  223. <div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        {</div>
    224. 

  224. <div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="comment">// Left side is smaller, recurse to left first</span></div>
    225. 

  225. <div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            <a class="code hl_function" href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">QuickSort</a>(inBegin, j, inCompare);</div>
    226. 

  226. <div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
    227. 

  227. <div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <span class="comment">// Loop again with the right side to avoid a call</span></div>
    228. 

  228. <div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            inBegin = j;</div>
    229. 

  229. <div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        }</div>
    230. 

  230. <div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">else</span></div>
    231. 

  231. <div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        {</div>
    232. 

  232. <div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            <span class="comment">// Right side is smaller, recurse to right first</span></div>
    233. 

  233. <div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <a class="code hl_function" href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">QuickSort</a>(j, inEnd, inCompare);</div>
    234. 

  234. <div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
    235. 

  235. <div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            <span class="comment">// Loop again with the left side to avoid a call</span></div>
    236. 

  236. <div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            inEnd = j;</div>
    237. 

  237. <div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        }</div>
    238. 

  238. <div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    }</div>
    239. 

  239. <div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}</div>
    240. 

  240. </div>
    241. 

  241. <div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
    242. 

  242. <div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Iterator&gt;</div>
    243. 

  243. <div class="foldopen" id="foldopen00131" data-start="{" data-end="}">
    244. 

  244. <div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="_quick_sort_8h.html#ada159782c0a49512044e5eb1cdb97684">  131</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">QuickSort</a>(Iterator inBegin, Iterator inEnd)</div>
    245. 

  245. <div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>{</div>
    246. 

  246. <div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::less&lt;&gt; compare;</div>
    247. 

  247. <div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_function" href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">QuickSort</a>(inBegin, inEnd, compare);</div>
    248. 

  248. <div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>}</div>
    249. 

  249. </div>
    250. 

  250. <div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
    251. 

  251. <div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><a class="code hl_define" href="_core_8h.html#a73da8725998b00321a9db341202d650d">JPH_NAMESPACE_END</a></div>
    252. 

  252. <div class="ttc" id="a_core_8h_html_a73da8725998b00321a9db341202d650d"><div class="ttname"><a href="_core_8h.html#a73da8725998b00321a9db341202d650d">JPH_NAMESPACE_END</a></div><div class="ttdeci">#define JPH_NAMESPACE_END</div><div class="ttdef"><b>Definition</b> Core.h:425</div></div>
    253. 

  253. <div class="ttc" id="a_core_8h_html_ad14098b68b8c44ea6112601031268405"><div class="ttname"><a href="_core_8h.html#ad14098b68b8c44ea6112601031268405">JPH_NAMESPACE_BEGIN</a></div><div class="ttdeci">#define JPH_NAMESPACE_BEGIN</div><div class="ttdef"><b>Definition</b> Core.h:419</div></div>
    254. 

  254. <div class="ttc" id="a_insertion_sort_8h_html"><div class="ttname"><a href="_insertion_sort_8h.html">InsertionSort.h</a></div></div>
    255. 

  255. <div class="ttc" id="a_insertion_sort_8h_html_a1c833812e3ce3c4848ccd57826ab2463"><div class="ttname"><a href="_insertion_sort_8h.html#a1c833812e3ce3c4848ccd57826ab2463">InsertionSort</a></div><div class="ttdeci">JPH_NAMESPACE_BEGIN void InsertionSort(Iterator inBegin, Iterator inEnd, Compare inCompare)</div><div class="ttdoc">Implementation of the insertion sort algorithm.</div><div class="ttdef"><b>Definition</b> InsertionSort.h:11</div></div>
    256. 

  256. <div class="ttc" id="a_issue_reporting_8h_html_aaf6b1df827e11b7ca5f6f8778bd8f8cd"><div class="ttname"><a href="_issue_reporting_8h.html#aaf6b1df827e11b7ca5f6f8778bd8f8cd">JPH_ASSERT</a></div><div class="ttdeci">#define JPH_ASSERT(...)</div><div class="ttdef"><b>Definition</b> IssueReporting.h:33</div></div>
    257. 

  257. <div class="ttc" id="a_quick_sort_8h_html_a09973cb7cb8a1e98a51005ecedaf6eff"><div class="ttname"><a href="_quick_sort_8h.html#a09973cb7cb8a1e98a51005ecedaf6eff">QuickSort</a></div><div class="ttdeci">void QuickSort(Iterator inBegin, Iterator inEnd, Compare inCompare)</div><div class="ttdoc">Implementation of the quick sort algorithm. The STL version implementation is not consistent across p...</div><div class="ttdef"><b>Definition</b> QuickSort.h:53</div></div>
    258. 

  258. <div class="ttc" id="a_quick_sort_8h_html_a7f9496a620493fec0bb6e08af489dc27"><div class="ttname"><a href="_quick_sort_8h.html#a7f9496a620493fec0bb6e08af489dc27">QuickSortNinther</a></div><div class="ttdeci">void QuickSortNinther(Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)</div><div class="ttdoc">Helper function for QuickSort using the Ninther method, will move the pivot element to inMiddle.</div><div class="ttdef"><b>Definition</b> QuickSort.h:30</div></div>
    259. 

  259. <div class="ttc" id="a_quick_sort_8h_html_aa6450fb30b4a42e991c89908bd3575b9"><div class="ttname"><a href="_quick_sort_8h.html#aa6450fb30b4a42e991c89908bd3575b9">QuickSortMedianOfThree</a></div><div class="ttdeci">JPH_NAMESPACE_BEGIN void QuickSortMedianOfThree(Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)</div><div class="ttdoc">Helper function for QuickSort, will move the pivot element to inMiddle.</div><div class="ttdef"><b>Definition</b> QuickSort.h:13</div></div>
    260. 

  260. </div><!-- fragment --></div><!-- contents -->
    261. 

  261. </div><!-- doc-content -->
    262. 

  262. <!-- start footer part -->
    263. 

  263. <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
    264. 

  264.   <ul>
    265. 

  265.     <li class="navelem"><a class="el" href="dir_d99289a5d3c46cf26f14ff6c90658d9f.html">Jolt</a></li><li class="navelem"><a class="el" href="dir_1b21a6f5692b6d84bf3b848a79181d46.html">Core</a></li><li class="navelem"><a class="el" href="_quick_sort_8h.html">QuickSort.h</a></li>
    266. 

  266.     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
    267. 

  267.   </ul>
    268. 

  268. </div>
    269. 

  269. </body>
    270. 

  270. </html>
    271.