Halaman utama Jelajahi Bantuan
Masuk
c
/
Immediate-Mode-UI.Nuklear
cermin dari https://github.com/Immediate-Mode-UI/Nuklear.git
2
0
Fork 0
Berkas Masalah 0 Wiki
Cabang: gh-pages
Ranting Tag
Immediate-Mode-...
/
stb__rect__pack_8h_source.html

stb__rect__pack_8h_source.html 96 KB
Permalink Riwayat Mentahan

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742 
  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.9.8"/>
    7. 

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

  8. <title>Nuklear: src/stb_rect_pack.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. <link href="navtree.css" rel="stylesheet" type="text/css"/>
    13. 

  13. <script type="text/javascript" src="resize.js"></script>
    14. 

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

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

  16. <link href="search/search.css" rel="stylesheet" type="text/css"/>
    17. 

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

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

  19. <script type="text/javascript">
    20. 

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

  21.   $(document).ready(function() { init_search(); });
    22. 

  22. /* @license-end */
    23. 

  23. </script>
    24. 

  24. <link href="doxygen.css" rel="stylesheet" type="text/css" />
    25. 

  25. <link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
    26. 

  26. </head>
    27. 

  27. <body>
    28. 

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

  29. <div id="titlearea">
    30. 

  30. <table cellspacing="0" cellpadding="0">
    31. 

  31.  <tbody>
    32. 

  32.  <tr id="projectrow">
    33. 

  33.   <td id="projectalign">
    34. 

  34.    <div id="projectname">Nuklear
    35. 

  35.    </div>
    36. 

  36.    <div id="projectbrief">This is a minimal-state, immediate-mode graphical user interface toolkit written in ANSI C and licensed under public domain. It was designed as a simple embeddable user interface for application and does not have any dependencies, a default render backend or OS window/input handling but instead provides a highly modular, library-based approach, with simple input state for input and draw commands describing primitive shapes as output. So instead of providing a layered library that tries to abstract over a number of platform and render backends, it focuses only on the actual UI.</div>
    37. 

  37.   </td>
    38. 

  38.     <td>        <div id="MSearchBox" class="MSearchBoxInactive">
    39. 

  39.         <span class="left">
    40. 

  40.           <span id="MSearchSelect"                onmouseover="return searchBox.OnSearchSelectShow()"                onmouseout="return searchBox.OnSearchSelectHide()">&#160;</span>
    41. 

  41.           <input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"
    42. 

  42.                onfocus="searchBox.OnSearchFieldFocus(true)" 
    43. 

  43.                onblur="searchBox.OnSearchFieldFocus(false)" 
    44. 

  44.                onkeyup="searchBox.OnSearchFieldChange(event)"/>
    45. 

  45.           </span><span class="right">
    46. 

  46.             <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.svg" alt=""/></a>
    47. 

  47.           </span>
    48. 

  48.         </div>
    49. 

  49. </td>
    50. 

  50.  </tr>
    51. 

  51.  </tbody>
    52. 

  52. </table>
    53. 

  53. </div>
    54. 

  54. <!-- end header part -->
    55. 

  55. <!-- Generated by Doxygen 1.9.8 -->
    56. 

  56. <script type="text/javascript">
    57. 

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

  58. var searchBox = new SearchBox("searchBox", "search/",'.html');
    59. 

  59. /* @license-end */
    60. 

  60. </script>
    61. 

  61. </div><!-- top -->
    62. 

  62. <div id="side-nav" class="ui-resizable side-nav-resizable">
    63. 

  63.   <div id="nav-tree">
    64. 

  64.     <div id="nav-tree-contents">
    65. 

  65.       <div id="nav-sync" class="sync"></div>
    66. 

  66.     </div>
    67. 

  67.   </div>
    68. 

  68.   <div id="splitbar" style="-moz-user-select:none;" 
    69. 

  69.        class="ui-resizable-handle">
    70. 

  70.   </div>
    71. 

  71. </div>
    72. 

  72. <script type="text/javascript">
    73. 

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

  74. $(document).ready(function(){initNavTree('stb__rect__pack_8h_source.html',''); initResizable(); });
    75. 

  75. /* @license-end */
    76. 

  76. </script>
    77. 

  77. <div id="doc-content">
    78. 

  78. <!-- window showing the filter options -->
    79. 

  79. <div id="MSearchSelectWindow"
    80. 

  80.      onmouseover="return searchBox.OnSearchSelectShow()"
    81. 

  81.      onmouseout="return searchBox.OnSearchSelectHide()"
    82. 

  82.      onkeydown="return searchBox.OnSearchSelectKey(event)">
    83. 

  83. </div>
    84. 

  84. 

  85. <!-- iframe showing the search results (closed by default) -->
    86. 

  86. <div id="MSearchResultsWindow">
    87. 

  87. <div id="MSearchResults">
    88. 

  88. <div class="SRPage">
    89. 

  89. <div id="SRIndex">
    90. 

  90. <div id="SRResults"></div>
    91. 

  91. <div class="SRStatus" id="Loading">Loading...</div>
    92. 

  92. <div class="SRStatus" id="Searching">Searching...</div>
    93. 

  93. <div class="SRStatus" id="NoMatches">No Matches</div>
    94. 

  94. </div>
    95. 

  95. </div>
    96. 

  96. </div>
    97. 

  97. </div>
    98. 

  98. 

  99. <div class="header">
    100. 

  100.   <div class="headertitle"><div class="title">stb_rect_pack.h</div></div>
    101. 

  101. </div><!--header-->
    102. 

  102. <div class="contents">
    103. 

  103. <div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// stb_rect_pack.h - v1.01 - public domain - rectangle packing</span></div>
    104. 

  104. <div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">// Sean Barrett 2014</span></div>
    105. 

  105. <div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">//</span></div>
    106. 

  106. <div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">// Useful for e.g. packing rectangular textures into an atlas.</span></div>
    107. 

  107. <div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">// Does not do rotation.</span></div>
    108. 

  108. <div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">//</span></div>
    109. 

  109. <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">// Before #including,</span></div>
    110. 

  110. <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment">//</span></div>
    111. 

  111. <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">//    #define STB_RECT_PACK_IMPLEMENTATION</span></div>
    112. 

  112. <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment">//</span></div>
    113. 

  113. <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment">// in the file that you want to have the implementation.</span></div>
    114. 

  114. <div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment">//</span></div>
    115. 

  115. <div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment">// Not necessarily the awesomest packing method, but better than</span></div>
    116. 

  116. <div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment">// the totally naive one in stb_truetype (which is primarily what</span></div>
    117. 

  117. <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment">// this is meant to replace).</span></div>
    118. 

  118. <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">//</span></div>
    119. 

  119. <div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">// Has only had a few tests run, may have issues.</span></div>
    120. 

  120. <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">//</span></div>
    121. 

  121. <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">// More docs to come.</span></div>
    122. 

  122. <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">//</span></div>
    123. 

  123. <div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">// No memory allocations; uses qsort() and assert() from stdlib.</span></div>
    124. 

  124. <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">// Can override those by defining STBRP_SORT and STBRP_ASSERT.</span></div>
    125. 

  125. <div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment">//</span></div>
    126. 

  126. <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">// This library currently uses the Skyline Bottom-Left algorithm.</span></div>
    127. 

  127. <div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">//</span></div>
    128. 

  128. <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">// Please note: better rectangle packers are welcome! Please</span></div>
    129. 

  129. <div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">// implement them to the same API, but with a different init</span></div>
    130. 

  130. <div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment">// function.</span></div>
    131. 

  131. <div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">//</span></div>
    132. 

  132. <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment">// Credits</span></div>
    133. 

  133. <div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment">//</span></div>
    134. 

  134. <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment">//  Library</span></div>
    135. 

  135. <div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">//    Sean Barrett</span></div>
    136. 

  136. <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment">//  Minor features</span></div>
    137. 

  137. <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">//    Martins Mozeiko</span></div>
    138. 

  138. <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">//    github:IntellectualKitty</span></div>
    139. 

  139. <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">//</span></div>
    140. 

  140. <div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">//  Bugfixes / warning fixes</span></div>
    141. 

  141. <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment">//    Jeremy Jaussaud</span></div>
    142. 

  142. <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">//    Fabian Giesen</span></div>
    143. 

  143. <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">//</span></div>
    144. 

  144. <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment">// Version history:</span></div>
    145. 

  145. <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">//</span></div>
    146. 

  146. <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment">//     1.01  (2021-07-11)  always use large rect mode, expose STBRP__MAXVAL in public section</span></div>
    147. 

  147. <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">//     1.00  (2019-02-25)  avoid small space waste; gracefully fail too-wide rectangles</span></div>
    148. 

  148. <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">//     0.99  (2019-02-07)  warning fixes</span></div>
    149. 

  149. <div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">//     0.11  (2017-03-03)  return packing success/fail result</span></div>
    150. 

  150. <div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">//     0.10  (2016-10-25)  remove cast-away-const to avoid warnings</span></div>
    151. 

  151. <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">//     0.09  (2016-08-27)  fix compiler warnings</span></div>
    152. 

  152. <div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">//     0.08  (2015-09-13)  really fix bug with empty rects (w=0 or h=0)</span></div>
    153. 

  153. <div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">//     0.07  (2015-09-13)  fix bug with empty rects (w=0 or h=0)</span></div>
    154. 

  154. <div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">//     0.06  (2015-04-15)  added STBRP_SORT to allow replacing qsort</span></div>
    155. 

  155. <div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">//     0.05:  added STBRP_ASSERT to allow replacing assert</span></div>
    156. 

  156. <div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment">//     0.04:  fixed minor bug in STBRP_LARGE_RECTS support</span></div>
    157. 

  157. <div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">//     0.01:  initial release</span></div>
    158. 

  158. <div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">//</span></div>
    159. 

  159. <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">// LICENSE</span></div>
    160. 

  160. <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment">//</span></div>
    161. 

  161. <div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">//   See end of file for license information.</span></div>
    162. 

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

  163. <div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">//</span></div>
    164. 

  164. <div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">//       INCLUDE SECTION</span></div>
    165. 

  165. <div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">//</span></div>
    166. 

  166. <div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
    167. 

  167. <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="preprocessor">#ifndef STB_INCLUDE_STB_RECT_PACK_H</span></div>
    168. 

  168. <div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="preprocessor">#define STB_INCLUDE_STB_RECT_PACK_H</span></div>
    169. 

  169. <div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
    170. 

  170. <div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="preprocessor">#define STB_RECT_PACK_VERSION  1</span></div>
    171. 

  171. <div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
    172. 

  172. <div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="preprocessor">#ifdef STBRP_STATIC</span></div>
    173. 

  173. <div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="preprocessor">#define STBRP_DEF static</span></div>
    174. 

  174. <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="preprocessor">#else</span></div>
    175. 

  175. <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="preprocessor">#define STBRP_DEF extern</span></div>
    176. 

  176. <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="preprocessor">#endif</span></div>
    177. 

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

  178. <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="preprocessor">#ifdef __cplusplus</span></div>
    179. 

  179. <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {</div>
    180. 

  180. <div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="preprocessor">#endif</span></div>
    181. 

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

  182. <div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> <a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a>;</div>
    183. 

  183. <div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a>    <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a>;</div>
    184. 

  184. <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a>    <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a>;</div>
    185. 

  185. <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
    186. 

  186. <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keyword">typedef</span> <span class="keywordtype">int</span>            stbrp_coord;</div>
    187. 

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

  188. <div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="preprocessor">#define STBRP__MAXVAL  0x7fffffff</span></div>
    189. 

  189. <div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">// Mostly for internal use, but this is the maximum supported coordinate value.</span></div>
    190. 

  190. <div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
    191. 

  191. <div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>STBRP_DEF <span class="keywordtype">int</span> stbrp_pack_rects (<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *rects, <span class="keywordtype">int</span> num_rects);</div>
    192. 

  192. <div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">// Assign packed locations to rectangles. The rectangles are of type</span></div>
    193. 

  193. <div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment">// &#39;stbrp_rect&#39; defined below, stored in the array &#39;rects&#39;, and there</span></div>
    194. 

  194. <div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">// are &#39;num_rects&#39; many of them.</span></div>
    195. 

  195. <div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">//</span></div>
    196. 

  196. <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">// Rectangles which are successfully packed have the &#39;was_packed&#39; flag</span></div>
    197. 

  197. <div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment">// set to a non-zero value and &#39;x&#39; and &#39;y&#39; store the minimum location</span></div>
    198. 

  198. <div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">// on each axis (i.e. bottom-left in cartesian coordinates, top-left</span></div>
    199. 

  199. <div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">// if you imagine y increasing downwards). Rectangles which do not fit</span></div>
    200. 

  200. <div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment">// have the &#39;was_packed&#39; flag set to 0.</span></div>
    201. 

  201. <div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment">//</span></div>
    202. 

  202. <div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment">// You should not try to access the &#39;rects&#39; array from another thread</span></div>
    203. 

  203. <div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment">// while this function is running, as the function temporarily reorders</span></div>
    204. 

  204. <div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="comment">// the array while it executes.</span></div>
    205. 

  205. <div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="comment">//</span></div>
    206. 

  206. <div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="comment">// To pack into another rectangle, you need to call stbrp_init_target</span></div>
    207. 

  207. <div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment">// again. To continue packing into the same rectangle, you can call</span></div>
    208. 

  208. <div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">// this function again. Calling this multiple times with multiple rect</span></div>
    209. 

  209. <div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment">// arrays will probably produce worse packing results than calling it</span></div>
    210. 

  210. <div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">// a single time with the full rectangle array, but the option is</span></div>
    211. 

  211. <div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">// available.</span></div>
    212. 

  212. <div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment">//</span></div>
    213. 

  213. <div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">// The function returns 1 if all of the rectangles were successfully</span></div>
    214. 

  214. <div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">// packed and 0 otherwise.</span></div>
    215. 

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

  216. <div class="foldopen" id="foldopen00115" data-start="{" data-end="};">
    217. 

  217. <div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="structstbrp__rect.html">  115</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a></div>
    218. 

  218. <div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>{</div>
    219. 

  219. <div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>   <span class="comment">// reserved for your use:</span></div>
    220. 

  220. <div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>   <span class="keywordtype">int</span>            id;</div>
    221. 

  221. <div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
    222. 

  222. <div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>   <span class="comment">// input:</span></div>
    223. 

  223. <div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>   stbrp_coord    w, h;</div>
    224. 

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

  225. <div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>   <span class="comment">// output:</span></div>
    226. 

  226. <div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>   stbrp_coord    x, y;</div>
    227. 

  227. <div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>   <span class="keywordtype">int</span>            was_packed;  <span class="comment">// non-zero if valid packing</span></div>
    228. 

  228. <div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
    229. 

  229. <div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}; <span class="comment">// 16 bytes, nominally</span></div>
    230. 

  230. </div>
    231. 

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

  232. <div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
    233. 

  233. <div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>STBRP_DEF <span class="keywordtype">void</span> stbrp_init_target (<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height, <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *nodes, <span class="keywordtype">int</span> num_nodes);</div>
    234. 

  234. <div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">// Initialize a rectangle packer to:</span></div>
    235. 

  235. <div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">//    pack a rectangle that is &#39;width&#39; by &#39;height&#39; in dimensions</span></div>
    236. 

  236. <div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">//    using temporary storage provided by the array &#39;nodes&#39;, which is &#39;num_nodes&#39; long</span></div>
    237. 

  237. <div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">//</span></div>
    238. 

  238. <div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">// You must call this function every time you start packing into a new target.</span></div>
    239. 

  239. <div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment">//</span></div>
    240. 

  240. <div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment">// There is no &quot;shutdown&quot; function. The &#39;nodes&#39; memory must stay valid for</span></div>
    241. 

  241. <div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment">// the following stbrp_pack_rects() call (or calls), but can be freed after</span></div>
    242. 

  242. <div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="comment">// the call (or calls) finish.</span></div>
    243. 

  243. <div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="comment">//</span></div>
    244. 

  244. <div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment">// Note: to guarantee best results, either:</span></div>
    245. 

  245. <div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">//       1. make sure &#39;num_nodes&#39; &gt;= &#39;width&#39;</span></div>
    246. 

  246. <div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment">//   or  2. call stbrp_allow_out_of_mem() defined below with &#39;allow_out_of_mem = 1&#39;</span></div>
    247. 

  247. <div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">//</span></div>
    248. 

  248. <div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">// If you don&#39;t do either of the above things, widths will be quantized to multiples</span></div>
    249. 

  249. <div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="comment">// of small integers to guarantee the algorithm doesn&#39;t run out of temporary storage.</span></div>
    250. 

  250. <div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="comment">//</span></div>
    251. 

  251. <div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="comment">// If you do #2, then the non-quantized algorithm will be used, but the algorithm</span></div>
    252. 

  252. <div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="comment">// may run out of temporary storage and be unable to pack some rectangles.</span></div>
    253. 

  253. <div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
    254. 

  254. <div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>STBRP_DEF <span class="keywordtype">void</span> stbrp_setup_allow_out_of_mem (<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> allow_out_of_mem);</div>
    255. 

  255. <div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="comment">// Optionally call this function after init but before doing any packing to</span></div>
    256. 

  256. <div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="comment">// change the handling of the out-of-temp-memory scenario, described above.</span></div>
    257. 

  257. <div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="comment">// If you call init again, this will be reset to the default (false).</span></div>
    258. 

  258. <div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
    259. 

  259. <div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
    260. 

  260. <div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>STBRP_DEF <span class="keywordtype">void</span> stbrp_setup_heuristic (<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> heuristic);</div>
    261. 

  261. <div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment">// Optionally select which packing heuristic the library should use. Different</span></div>
    262. 

  262. <div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment">// heuristics will produce better/worse results for different data sets.</span></div>
    263. 

  263. <div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment">// If you call init again, this will be reset to the default.</span></div>
    264. 

  264. <div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
    265. 

  265. <div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="keyword">enum</span></div>
    266. 

  266. <div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>{</div>
    267. 

  267. <div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>   STBRP_HEURISTIC_Skyline_default=0,</div>
    268. 

  268. <div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>   STBRP_HEURISTIC_Skyline_BL_sortHeight = STBRP_HEURISTIC_Skyline_default,</div>
    269. 

  269. <div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>   STBRP_HEURISTIC_Skyline_BF_sortHeight</div>
    270. 

  270. <div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>};</div>
    271. 

  271. <div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
    272. 

  272. <div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
    273. 

  273. <div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="comment">//</span></div>
    274. 

  274. <div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="comment">// the details of the following structures don&#39;t matter to you, but they must</span></div>
    275. 

  275. <div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment">// be visible so you can handle the memory allocations for them</span></div>
    276. 

  276. <div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
    277. 

  277. <div class="foldopen" id="foldopen00175" data-start="{" data-end="};">
    278. 

  278. <div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="structstbrp__node.html">  175</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a></div>
    279. 

  279. <div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>{</div>
    280. 

  280. <div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>   stbrp_coord  x,y;</div>
    281. 

  281. <div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a>  *next;</div>
    282. 

  282. <div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>};</div>
    283. 

  283. </div>
    284. 

  284. <div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
    285. 

  285. <div class="foldopen" id="foldopen00181" data-start="{" data-end="};">
    286. 

  286. <div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="structstbrp__context.html">  181</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a></div>
    287. 

  287. <div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>{</div>
    288. 

  288. <div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>   <span class="keywordtype">int</span> width;</div>
    289. 

  289. <div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>   <span class="keywordtype">int</span> height;</div>
    290. 

  290. <div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>   <span class="keywordtype">int</span> align;</div>
    291. 

  291. <div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>   <span class="keywordtype">int</span> init_mode;</div>
    292. 

  292. <div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>   <span class="keywordtype">int</span> heuristic;</div>
    293. 

  293. <div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>   <span class="keywordtype">int</span> num_nodes;</div>
    294. 

  294. <div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *active_head;</div>
    295. 

  295. <div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *free_head;</div>
    296. 

  296. <div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> extra[2]; <span class="comment">// we allocate two extra nodes so optimal user-node-count is &#39;width&#39; not &#39;width+2&#39;</span></div>
    297. 

  297. <div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>};</div>
    298. 

  298. </div>
    299. 

  299. <div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
    300. 

  300. <div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span><span class="preprocessor">#ifdef __cplusplus</span></div>
    301. 

  301. <div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>}</div>
    302. 

  302. <div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="preprocessor">#endif</span></div>
    303. 

  303. <div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
    304. 

  304. <div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="preprocessor">#endif</span></div>
    305. 

  305. <div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
    306. 

  306. <div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="comment">//</span></div>
    307. 

  307. <div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="comment">//     IMPLEMENTATION SECTION</span></div>
    308. 

  308. <div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="comment">//</span></div>
    309. 

  309. <div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
    310. 

  310. <div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="preprocessor">#ifdef STB_RECT_PACK_IMPLEMENTATION</span></div>
    311. 

  311. <div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="preprocessor">#ifndef STBRP_SORT</span></div>
    312. 

  312. <div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="preprocessor">#include &lt;stdlib.h&gt;</span></div>
    313. 

  313. <div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="preprocessor">#define STBRP_SORT qsort</span></div>
    314. 

  314. <div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="preprocessor">#endif</span></div>
    315. 

  315. <div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
    316. 

  316. <div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="preprocessor">#ifndef STBRP_ASSERT</span></div>
    317. 

  317. <div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="preprocessor">#include &lt;assert.h&gt;</span></div>
    318. 

  318. <div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span><span class="preprocessor">#define STBRP_ASSERT assert</span></div>
    319. 

  319. <div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span><span class="preprocessor">#endif</span></div>
    320. 

  320. <div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
    321. 

  321. <div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
    322. 

  322. <div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="preprocessor">#define STBRP__NOTUSED(v)  (void)(v)</span></div>
    323. 

  323. <div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="preprocessor">#define STBRP__CDECL       __cdecl</span></div>
    324. 

  324. <div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span><span class="preprocessor">#else</span></div>
    325. 

  325. <div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span><span class="preprocessor">#define STBRP__NOTUSED(v)  (void)sizeof(v)</span></div>
    326. 

  326. <div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span><span class="preprocessor">#define STBRP__CDECL</span></div>
    327. 

  327. <div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="preprocessor">#endif</span></div>
    328. 

  328. <div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
    329. 

  329. <div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="keyword">enum</span></div>
    330. 

  330. <div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>{</div>
    331. 

  331. <div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>   STBRP__INIT_skyline = 1</div>
    332. 

  332. <div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>};</div>
    333. 

  333. <div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span> </div>
    334. 

  334. <div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>STBRP_DEF <span class="keywordtype">void</span> stbrp_setup_heuristic(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> heuristic)</div>
    335. 

  335. <div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>{</div>
    336. 

  336. <div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>   <span class="keywordflow">switch</span> (context-&gt;init_mode) {</div>
    337. 

  337. <div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>      <span class="keywordflow">case</span> STBRP__INIT_skyline:</div>
    338. 

  338. <div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>         STBRP_ASSERT(heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight || heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight);</div>
    339. 

  339. <div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>         context-&gt;heuristic = heuristic;</div>
    340. 

  340. <div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>         <span class="keywordflow">break</span>;</div>
    341. 

  341. <div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>      <span class="keywordflow">default</span>:</div>
    342. 

  342. <div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>         STBRP_ASSERT(0);</div>
    343. 

  343. <div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>   }</div>
    344. 

  344. <div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>}</div>
    345. 

  345. <div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
    346. 

  346. <div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>STBRP_DEF <span class="keywordtype">void</span> stbrp_setup_allow_out_of_mem(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> allow_out_of_mem)</div>
    347. 

  347. <div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>{</div>
    348. 

  348. <div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>   <span class="keywordflow">if</span> (allow_out_of_mem)</div>
    349. 

  349. <div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>      <span class="comment">// if it&#39;s ok to run out of memory, then don&#39;t bother aligning them;</span></div>
    350. 

  350. <div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>      <span class="comment">// this gives better packing, but may fail due to OOM (even though</span></div>
    351. 

  351. <div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>      <span class="comment">// the rectangles easily fit). @TODO a smarter approach would be to only</span></div>
    352. 

  352. <div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>      <span class="comment">// quantize once we&#39;ve hit OOM, then we could get rid of this parameter.</span></div>
    353. 

  353. <div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>      context-&gt;align = 1;</div>
    354. 

  354. <div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>   <span class="keywordflow">else</span> {</div>
    355. 

  355. <div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>      <span class="comment">// if it&#39;s not ok to run out of memory, then quantize the widths</span></div>
    356. 

  356. <div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>      <span class="comment">// so that num_nodes is always enough nodes.</span></div>
    357. 

  357. <div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>      <span class="comment">//</span></div>
    358. 

  358. <div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>      <span class="comment">// I.e. num_nodes * align &gt;= width</span></div>
    359. 

  359. <div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>      <span class="comment">//                  align &gt;= width / num_nodes</span></div>
    360. 

  360. <div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>      <span class="comment">//                  align = ceil(width/num_nodes)</span></div>
    361. 

  361. <div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
    362. 

  362. <div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>      context-&gt;align = (context-&gt;width + context-&gt;num_nodes-1) / context-&gt;num_nodes;</div>
    363. 

  363. <div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>   }</div>
    364. 

  364. <div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>}</div>
    365. 

  365. <div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span> </div>
    366. 

  366. <div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>STBRP_DEF <span class="keywordtype">void</span> stbrp_init_target(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height, <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *nodes, <span class="keywordtype">int</span> num_nodes)</div>
    367. 

  367. <div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>{</div>
    368. 

  368. <div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>   <span class="keywordtype">int</span> i;</div>
    369. 

  369. <div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
    370. 

  370. <div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>   <span class="keywordflow">for</span> (i=0; i &lt; num_nodes-1; ++i)</div>
    371. 

  371. <div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>      nodes[i].next = &amp;nodes[i+1];</div>
    372. 

  372. <div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>   nodes[i].next = NULL;</div>
    373. 

  373. <div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>   context-&gt;init_mode = STBRP__INIT_skyline;</div>
    374. 

  374. <div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>   context-&gt;heuristic = STBRP_HEURISTIC_Skyline_default;</div>
    375. 

  375. <div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>   context-&gt;free_head = &amp;nodes[0];</div>
    376. 

  376. <div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>   context-&gt;active_head = &amp;context-&gt;extra[0];</div>
    377. 

  377. <div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>   context-&gt;width = width;</div>
    378. 

  378. <div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>   context-&gt;height = height;</div>
    379. 

  379. <div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>   context-&gt;num_nodes = num_nodes;</div>
    380. 

  380. <div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>   stbrp_setup_allow_out_of_mem(context, 0);</div>
    381. 

  381. <div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span> </div>
    382. 

  382. <div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>   <span class="comment">// node 0 is the full width, node 1 is the sentinel (lets us not store width explicitly)</span></div>
    383. 

  383. <div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>   context-&gt;extra[0].x = 0;</div>
    384. 

  384. <div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>   context-&gt;extra[0].y = 0;</div>
    385. 

  385. <div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>   context-&gt;extra[0].next = &amp;context-&gt;extra[1];</div>
    386. 

  386. <div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>   context-&gt;extra[1].x = (stbrp_coord) width;</div>
    387. 

  387. <div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>   context-&gt;extra[1].y = (1&lt;&lt;30);</div>
    388. 

  388. <div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>   context-&gt;extra[1].next = NULL;</div>
    389. 

  389. <div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>}</div>
    390. 

  390. <div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span> </div>
    391. 

  391. <div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span><span class="comment">// find minimum y position if it starts at x1</span></div>
    392. 

  392. <div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span><span class="keyword">static</span> <span class="keywordtype">int</span> stbrp__skyline_find_min_y(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *c, <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *first, <span class="keywordtype">int</span> x0, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> *pwaste)</div>
    393. 

  393. <div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>{</div>
    394. 

  394. <div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *node = first;</div>
    395. 

  395. <div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>   <span class="keywordtype">int</span> x1 = x0 + width;</div>
    396. 

  396. <div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>   <span class="keywordtype">int</span> min_y, visited_width, waste_area;</div>
    397. 

  397. <div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
    398. 

  398. <div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>   STBRP__NOTUSED(c);</div>
    399. 

  399. <div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span> </div>
    400. 

  400. <div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>   STBRP_ASSERT(first-&gt;x &lt;= x0);</div>
    401. 

  401. <div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span> </div>
    402. 

  402. <div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="preprocessor">   #if 0</span></div>
    403. 

  403. <div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>   <span class="comment">// skip in case we&#39;re past the node</span></div>
    404. 

  404. <div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>   <span class="keywordflow">while</span> (node-&gt;next-&gt;x &lt;= x0)</div>
    405. 

  405. <div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>      ++node;</div>
    406. 

  406. <div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span><span class="preprocessor">   #else</span></div>
    407. 

  407. <div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>   STBRP_ASSERT(node-&gt;next-&gt;x &gt; x0); <span class="comment">// we ended up handling this in the caller for efficiency</span></div>
    408. 

  408. <div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="preprocessor">   #endif</span></div>
    409. 

  409. <div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span> </div>
    410. 

  410. <div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>   STBRP_ASSERT(node-&gt;x &lt;= x0);</div>
    411. 

  411. <div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
    412. 

  412. <div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>   min_y = 0;</div>
    413. 

  413. <div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>   waste_area = 0;</div>
    414. 

  414. <div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>   visited_width = 0;</div>
    415. 

  415. <div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>   <span class="keywordflow">while</span> (node-&gt;x &lt; x1) {</div>
    416. 

  416. <div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>      <span class="keywordflow">if</span> (node-&gt;y &gt; min_y) {</div>
    417. 

  417. <div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>         <span class="comment">// raise min_y higher.</span></div>
    418. 

  418. <div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>         <span class="comment">// we&#39;ve accounted for all waste up to min_y,</span></div>
    419. 

  419. <div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>         <span class="comment">// but we&#39;ll now add more waste for everything we&#39;ve visited</span></div>
    420. 

  420. <div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>         waste_area += visited_width * (node-&gt;y - min_y);</div>
    421. 

  421. <div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>         min_y = node-&gt;y;</div>
    422. 

  422. <div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>         <span class="comment">// the first time through, visited_width might be reduced</span></div>
    423. 

  423. <div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>         <span class="keywordflow">if</span> (node-&gt;x &lt; x0)</div>
    424. 

  424. <div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>            visited_width += node-&gt;next-&gt;x - x0;</div>
    425. 

  425. <div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>         <span class="keywordflow">else</span></div>
    426. 

  426. <div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>            visited_width += node-&gt;next-&gt;x - node-&gt;x;</div>
    427. 

  427. <div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>      } <span class="keywordflow">else</span> {</div>
    428. 

  428. <div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>         <span class="comment">// add waste area</span></div>
    429. 

  429. <div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>         <span class="keywordtype">int</span> under_width = node-&gt;next-&gt;x - node-&gt;x;</div>
    430. 

  430. <div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>         <span class="keywordflow">if</span> (under_width + visited_width &gt; width)</div>
    431. 

  431. <div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>            under_width = width - visited_width;</div>
    432. 

  432. <div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>         waste_area += under_width * (min_y - node-&gt;y);</div>
    433. 

  433. <div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>         visited_width += under_width;</div>
    434. 

  434. <div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>      }</div>
    435. 

  435. <div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>      node = node-&gt;next;</div>
    436. 

  436. <div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>   }</div>
    437. 

  437. <div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
    438. 

  438. <div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>   *pwaste = waste_area;</div>
    439. 

  439. <div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>   <span class="keywordflow">return</span> min_y;</div>
    440. 

  440. <div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>}</div>
    441. 

  441. <div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span> </div>
    442. 

  442. <div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span><span class="keyword">typedef</span> <span class="keyword">struct</span></div>
    443. 

  443. <div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>{</div>
    444. 

  444. <div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>   <span class="keywordtype">int</span> x,y;</div>
    445. 

  445. <div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> **prev_link;</div>
    446. 

  446. <div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>} stbrp__findresult;</div>
    447. 

  447. <div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span> </div>
    448. 

  448. <div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="keyword">static</span> stbrp__findresult stbrp__skyline_find_best_pos(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *c, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height)</div>
    449. 

  449. <div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>{</div>
    450. 

  450. <div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>   <span class="keywordtype">int</span> best_waste = (1&lt;&lt;30), best_x, best_y = (1 &lt;&lt; 30);</div>
    451. 

  451. <div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>   stbrp__findresult fr;</div>
    452. 

  452. <div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> **prev, *node, *tail, **best = NULL;</div>
    453. 

  453. <div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
    454. 

  454. <div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>   <span class="comment">// align to multiple of c-&gt;align</span></div>
    455. 

  455. <div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>   width = (width + c-&gt;align - 1);</div>
    456. 

  456. <div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>   width -= width % c-&gt;align;</div>
    457. 

  457. <div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>   STBRP_ASSERT(width % c-&gt;align == 0);</div>
    458. 

  458. <div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span> </div>
    459. 

  459. <div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>   <span class="comment">// if it can&#39;t possibly fit, bail immediately</span></div>
    460. 

  460. <div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>   <span class="keywordflow">if</span> (width &gt; c-&gt;width || height &gt; c-&gt;height) {</div>
    461. 

  461. <div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>      fr.prev_link = NULL;</div>
    462. 

  462. <div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>      fr.x = fr.y = 0;</div>
    463. 

  463. <div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>      <span class="keywordflow">return</span> fr;</div>
    464. 

  464. <div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>   }</div>
    465. 

  465. <div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span> </div>
    466. 

  466. <div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>   node = c-&gt;active_head;</div>
    467. 

  467. <div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>   prev = &amp;c-&gt;active_head;</div>
    468. 

  468. <div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>   <span class="keywordflow">while</span> (node-&gt;x + width &lt;= c-&gt;width) {</div>
    469. 

  469. <div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>      <span class="keywordtype">int</span> y,waste;</div>
    470. 

  470. <div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>      y = stbrp__skyline_find_min_y(c, node, node-&gt;x, width, &amp;waste);</div>
    471. 

  471. <div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>      <span class="keywordflow">if</span> (c-&gt;heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight) { <span class="comment">// actually just want to test BL</span></div>
    472. 

  472. <div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>         <span class="comment">// bottom left</span></div>
    473. 

  473. <div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>         <span class="keywordflow">if</span> (y &lt; best_y) {</div>
    474. 

  474. <div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>            best_y = y;</div>
    475. 

  475. <div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>            best = prev;</div>
    476. 

  476. <div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>         }</div>
    477. 

  477. <div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>      } <span class="keywordflow">else</span> {</div>
    478. 

  478. <div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>         <span class="comment">// best-fit</span></div>
    479. 

  479. <div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>         <span class="keywordflow">if</span> (y + height &lt;= c-&gt;height) {</div>
    480. 

  480. <div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>            <span class="comment">// can only use it if it first vertically</span></div>
    481. 

  481. <div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>            <span class="keywordflow">if</span> (y &lt; best_y || (y == best_y &amp;&amp; waste &lt; best_waste)) {</div>
    482. 

  482. <div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>               best_y = y;</div>
    483. 

  483. <div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>               best_waste = waste;</div>
    484. 

  484. <div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>               best = prev;</div>
    485. 

  485. <div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>            }</div>
    486. 

  486. <div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>         }</div>
    487. 

  487. <div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>      }</div>
    488. 

  488. <div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>      prev = &amp;node-&gt;next;</div>
    489. 

  489. <div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>      node = node-&gt;next;</div>
    490. 

  490. <div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>   }</div>
    491. 

  491. <div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span> </div>
    492. 

  492. <div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>   best_x = (best == NULL) ? 0 : (*best)-&gt;x;</div>
    493. 

  493. <div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span> </div>
    494. 

  494. <div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>   <span class="comment">// if doing best-fit (BF), we also have to try aligning right edge to each node position</span></div>
    495. 

  495. <div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>   <span class="comment">//</span></div>
    496. 

  496. <div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>   <span class="comment">// e.g, if fitting</span></div>
    497. 

  497. <div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>   <span class="comment">//</span></div>
    498. 

  498. <div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>   <span class="comment">//     ____________________</span></div>
    499. 

  499. <div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>   <span class="comment">//    |____________________|</span></div>
    500. 

  500. <div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>   <span class="comment">//</span></div>
    501. 

  501. <div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>   <span class="comment">//            into</span></div>
    502. 

  502. <div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>   <span class="comment">//</span></div>
    503. 

  503. <div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>   <span class="comment">//   |                         |</span></div>
    504. 

  504. <div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>   <span class="comment">//   |             ____________|</span></div>
    505. 

  505. <div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>   <span class="comment">//   |____________|</span></div>
    506. 

  506. <div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>   <span class="comment">//</span></div>
    507. 

  507. <div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>   <span class="comment">// then right-aligned reduces waste, but bottom-left BL is always chooses left-aligned</span></div>
    508. 

  508. <div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>   <span class="comment">//</span></div>
    509. 

  509. <div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>   <span class="comment">// This makes BF take about 2x the time</span></div>
    510. 

  510. <div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span> </div>
    511. 

  511. <div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>   <span class="keywordflow">if</span> (c-&gt;heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight) {</div>
    512. 

  512. <div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>      tail = c-&gt;active_head;</div>
    513. 

  513. <div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>      node = c-&gt;active_head;</div>
    514. 

  514. <div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>      prev = &amp;c-&gt;active_head;</div>
    515. 

  515. <div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>      <span class="comment">// find first node that&#39;s admissible</span></div>
    516. 

  516. <div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>      <span class="keywordflow">while</span> (tail-&gt;x &lt; width)</div>
    517. 

  517. <div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>         tail = tail-&gt;next;</div>
    518. 

  518. <div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>      <span class="keywordflow">while</span> (tail) {</div>
    519. 

  519. <div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>         <span class="keywordtype">int</span> xpos = tail-&gt;x - width;</div>
    520. 

  520. <div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>         <span class="keywordtype">int</span> y,waste;</div>
    521. 

  521. <div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>         STBRP_ASSERT(xpos &gt;= 0);</div>
    522. 

  522. <div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>         <span class="comment">// find the left position that matches this</span></div>
    523. 

  523. <div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>         <span class="keywordflow">while</span> (node-&gt;next-&gt;x &lt;= xpos) {</div>
    524. 

  524. <div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>            prev = &amp;node-&gt;next;</div>
    525. 

  525. <div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>            node = node-&gt;next;</div>
    526. 

  526. <div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>         }</div>
    527. 

  527. <div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>         STBRP_ASSERT(node-&gt;next-&gt;x &gt; xpos &amp;&amp; node-&gt;x &lt;= xpos);</div>
    528. 

  528. <div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>         y = stbrp__skyline_find_min_y(c, node, xpos, width, &amp;waste);</div>
    529. 

  529. <div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>         <span class="keywordflow">if</span> (y + height &lt;= c-&gt;height) {</div>
    530. 

  530. <div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>            <span class="keywordflow">if</span> (y &lt;= best_y) {</div>
    531. 

  531. <div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>               <span class="keywordflow">if</span> (y &lt; best_y || waste &lt; best_waste || (waste==best_waste &amp;&amp; xpos &lt; best_x)) {</div>
    532. 

  532. <div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>                  best_x = xpos;</div>
    533. 

  533. <div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>                  STBRP_ASSERT(y &lt;= best_y);</div>
    534. 

  534. <div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>                  best_y = y;</div>
    535. 

  535. <div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>                  best_waste = waste;</div>
    536. 

  536. <div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>                  best = prev;</div>
    537. 

  537. <div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>               }</div>
    538. 

  538. <div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>            }</div>
    539. 

  539. <div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>         }</div>
    540. 

  540. <div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>         tail = tail-&gt;next;</div>
    541. 

  541. <div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>      }</div>
    542. 

  542. <div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>   }</div>
    543. 

  543. <div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span> </div>
    544. 

  544. <div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>   fr.prev_link = best;</div>
    545. 

  545. <div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>   fr.x = best_x;</div>
    546. 

  546. <div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>   fr.y = best_y;</div>
    547. 

  547. <div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>   <span class="keywordflow">return</span> fr;</div>
    548. 

  548. <div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>}</div>
    549. 

  549. <div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span> </div>
    550. 

  550. <div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="keyword">static</span> stbrp__findresult stbrp__skyline_pack_rectangle(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height)</div>
    551. 

  551. <div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>{</div>
    552. 

  552. <div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>   <span class="comment">// find best position according to heuristic</span></div>
    553. 

  553. <div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>   stbrp__findresult res = stbrp__skyline_find_best_pos(context, width, height);</div>
    554. 

  554. <div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>   <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *node, *cur;</div>
    555. 

  555. <div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span> </div>
    556. 

  556. <div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>   <span class="comment">// bail if:</span></div>
    557. 

  557. <div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>   <span class="comment">//    1. it failed</span></div>
    558. 

  558. <div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>   <span class="comment">//    2. the best node doesn&#39;t fit (we don&#39;t always check this)</span></div>
    559. 

  559. <div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>   <span class="comment">//    3. we&#39;re out of memory</span></div>
    560. 

  560. <div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>   <span class="keywordflow">if</span> (res.prev_link == NULL || res.y + height &gt; context-&gt;height || context-&gt;free_head == NULL) {</div>
    561. 

  561. <div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>      res.prev_link = NULL;</div>
    562. 

  562. <div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>      <span class="keywordflow">return</span> res;</div>
    563. 

  563. <div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>   }</div>
    564. 

  564. <div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
    565. 

  565. <div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>   <span class="comment">// on success, create new node</span></div>
    566. 

  566. <div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>   node = context-&gt;free_head;</div>
    567. 

  567. <div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>   node-&gt;x = (stbrp_coord) res.x;</div>
    568. 

  568. <div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>   node-&gt;y = (stbrp_coord) (res.y + height);</div>
    569. 

  569. <div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span> </div>
    570. 

  570. <div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>   context-&gt;free_head = node-&gt;next;</div>
    571. 

  571. <div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span> </div>
    572. 

  572. <div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>   <span class="comment">// insert the new node into the right starting point, and</span></div>
    573. 

  573. <div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>   <span class="comment">// let &#39;cur&#39; point to the remaining nodes needing to be</span></div>
    574. 

  574. <div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>   <span class="comment">// stitched back in</span></div>
    575. 

  575. <div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span> </div>
    576. 

  576. <div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>   cur = *res.prev_link;</div>
    577. 

  577. <div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>   <span class="keywordflow">if</span> (cur-&gt;x &lt; res.x) {</div>
    578. 

  578. <div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>      <span class="comment">// preserve the existing one, so start testing with the next one</span></div>
    579. 

  579. <div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>      <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *next = cur-&gt;next;</div>
    580. 

  580. <div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>      cur-&gt;next = node;</div>
    581. 

  581. <div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>      cur = next;</div>
    582. 

  582. <div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>   } <span class="keywordflow">else</span> {</div>
    583. 

  583. <div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>      *res.prev_link = node;</div>
    584. 

  584. <div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>   }</div>
    585. 

  585. <div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span> </div>
    586. 

  586. <div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>   <span class="comment">// from here, traverse cur and free the nodes, until we get to one</span></div>
    587. 

  587. <div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>   <span class="comment">// that shouldn&#39;t be freed</span></div>
    588. 

  588. <div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>   <span class="keywordflow">while</span> (cur-&gt;next &amp;&amp; cur-&gt;next-&gt;x &lt;= res.x + width) {</div>
    589. 

  589. <div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>      <a class="code hl_struct" href="structstbrp__node.html">stbrp_node</a> *next = cur-&gt;next;</div>
    590. 

  590. <div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>      <span class="comment">// move the current node to the free list</span></div>
    591. 

  591. <div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>      cur-&gt;next = context-&gt;free_head;</div>
    592. 

  592. <div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>      context-&gt;free_head = cur;</div>
    593. 

  593. <div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>      cur = next;</div>
    594. 

  594. <div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>   }</div>
    595. 

  595. <div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span> </div>
    596. 

  596. <div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>   <span class="comment">// stitch the list back in</span></div>
    597. 

  597. <div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>   node-&gt;next = cur;</div>
    598. 

  598. <div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span> </div>
    599. 

  599. <div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>   <span class="keywordflow">if</span> (cur-&gt;x &lt; res.x + width)</div>
    600. 

  600. <div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>      cur-&gt;x = (stbrp_coord) (res.x + width);</div>
    601. 

  601. <div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span> </div>
    602. 

  602. <div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span><span class="preprocessor">#ifdef _DEBUG</span></div>
    603. 

  603. <div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>   cur = context-&gt;active_head;</div>
    604. 

  604. <div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>   <span class="keywordflow">while</span> (cur-&gt;x &lt; context-&gt;width) {</div>
    605. 

  605. <div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>      STBRP_ASSERT(cur-&gt;x &lt; cur-&gt;next-&gt;x);</div>
    606. 

  606. <div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>      cur = cur-&gt;next;</div>
    607. 

  607. <div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>   }</div>
    608. 

  608. <div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>   STBRP_ASSERT(cur-&gt;next == NULL);</div>
    609. 

  609. <div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span> </div>
    610. 

  610. <div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>   {</div>
    611. 

  611. <div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>      <span class="keywordtype">int</span> count=0;</div>
    612. 

  612. <div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>      cur = context-&gt;active_head;</div>
    613. 

  613. <div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>      <span class="keywordflow">while</span> (cur) {</div>
    614. 

  614. <div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>         cur = cur-&gt;next;</div>
    615. 

  615. <div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>         ++count;</div>
    616. 

  616. <div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>      }</div>
    617. 

  617. <div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>      cur = context-&gt;free_head;</div>
    618. 

  618. <div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>      <span class="keywordflow">while</span> (cur) {</div>
    619. 

  619. <div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>         cur = cur-&gt;next;</div>
    620. 

  620. <div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>         ++count;</div>
    621. 

  621. <div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>      }</div>
    622. 

  622. <div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>      STBRP_ASSERT(count == context-&gt;num_nodes+2);</div>
    623. 

  623. <div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>   }</div>
    624. 

  624. <div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span><span class="preprocessor">#endif</span></div>
    625. 

  625. <div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span> </div>
    626. 

  626. <div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>   <span class="keywordflow">return</span> res;</div>
    627. 

  627. <div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>}</div>
    628. 

  628. <div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span> </div>
    629. 

  629. <div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span><span class="keyword">static</span> <span class="keywordtype">int</span> STBRP__CDECL rect_height_compare(<span class="keyword">const</span> <span class="keywordtype">void</span> *a, <span class="keyword">const</span> <span class="keywordtype">void</span> *b)</div>
    630. 

  630. <div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>{</div>
    631. 

  631. <div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>   <span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *p = (<span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *) a;</div>
    632. 

  632. <div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>   <span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *q = (<span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *) b;</div>
    633. 

  633. <div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>   <span class="keywordflow">if</span> (p-&gt;h &gt; q-&gt;h)</div>
    634. 

  634. <div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>      <span class="keywordflow">return</span> -1;</div>
    635. 

  635. <div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>   <span class="keywordflow">if</span> (p-&gt;h &lt; q-&gt;h)</div>
    636. 

  636. <div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>      <span class="keywordflow">return</span>  1;</div>
    637. 

  637. <div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>   <span class="keywordflow">return</span> (p-&gt;w &gt; q-&gt;w) ? -1 : (p-&gt;w &lt; q-&gt;w);</div>
    638. 

  638. <div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>}</div>
    639. 

  639. <div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span> </div>
    640. 

  640. <div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span><span class="keyword">static</span> <span class="keywordtype">int</span> STBRP__CDECL rect_original_order(<span class="keyword">const</span> <span class="keywordtype">void</span> *a, <span class="keyword">const</span> <span class="keywordtype">void</span> *b)</div>
    641. 

  641. <div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>{</div>
    642. 

  642. <div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>   <span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *p = (<span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *) a;</div>
    643. 

  643. <div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>   <span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *q = (<span class="keyword">const</span> <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *) b;</div>
    644. 

  644. <div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>   <span class="keywordflow">return</span> (p-&gt;was_packed &lt; q-&gt;was_packed) ? -1 : (p-&gt;was_packed &gt; q-&gt;was_packed);</div>
    645. 

  645. <div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>}</div>
    646. 

  646. <div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span> </div>
    647. 

  647. <div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>STBRP_DEF <span class="keywordtype">int</span> stbrp_pack_rects(<a class="code hl_struct" href="structstbrp__context.html">stbrp_context</a> *context, <a class="code hl_struct" href="structstbrp__rect.html">stbrp_rect</a> *rects, <span class="keywordtype">int</span> num_rects)</div>
    648. 

  648. <div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>{</div>
    649. 

  649. <div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>   <span class="keywordtype">int</span> i, all_rects_packed = 1;</div>
    650. 

  650. <div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span> </div>
    651. 

  651. <div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>   <span class="comment">// we use the &#39;was_packed&#39; field internally to allow sorting/unsorting</span></div>
    652. 

  652. <div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>   <span class="keywordflow">for</span> (i=0; i &lt; num_rects; ++i) {</div>
    653. 

  653. <div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>      rects[i].was_packed = i;</div>
    654. 

  654. <div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>   }</div>
    655. 

  655. <div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span> </div>
    656. 

  656. <div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>   <span class="comment">// sort according to heuristic</span></div>
    657. 

  657. <div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>   STBRP_SORT(rects, num_rects, <span class="keyword">sizeof</span>(rects[0]), rect_height_compare);</div>
    658. 

  658. <div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span> </div>
    659. 

  659. <div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>   <span class="keywordflow">for</span> (i=0; i &lt; num_rects; ++i) {</div>
    660. 

  660. <div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>      <span class="keywordflow">if</span> (rects[i].w == 0 || rects[i].h == 0) {</div>
    661. 

  661. <div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>         rects[i].x = rects[i].y = 0;  <span class="comment">// empty rect needs no space</span></div>
    662. 

  662. <div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>      } <span class="keywordflow">else</span> {</div>
    663. 

  663. <div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>         stbrp__findresult fr = stbrp__skyline_pack_rectangle(context, rects[i].w, rects[i].h);</div>
    664. 

  664. <div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>         <span class="keywordflow">if</span> (fr.prev_link) {</div>
    665. 

  665. <div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>            rects[i].x = (stbrp_coord) fr.x;</div>
    666. 

  666. <div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>            rects[i].y = (stbrp_coord) fr.y;</div>
    667. 

  667. <div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>         } <span class="keywordflow">else</span> {</div>
    668. 

  668. <div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>            rects[i].x = rects[i].y = STBRP__MAXVAL;</div>
    669. 

  669. <div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>         }</div>
    670. 

  670. <div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>      }</div>
    671. 

  671. <div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>   }</div>
    672. 

  672. <div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span> </div>
    673. 

  673. <div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>   <span class="comment">// unsort</span></div>
    674. 

  674. <div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>   STBRP_SORT(rects, num_rects, <span class="keyword">sizeof</span>(rects[0]), rect_original_order);</div>
    675. 

  675. <div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span> </div>
    676. 

  676. <div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>   <span class="comment">// set was_packed flags and all_rects_packed status</span></div>
    677. 

  677. <div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>   <span class="keywordflow">for</span> (i=0; i &lt; num_rects; ++i) {</div>
    678. 

  678. <div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>      rects[i].was_packed = !(rects[i].x == STBRP__MAXVAL &amp;&amp; rects[i].y == STBRP__MAXVAL);</div>
    679. 

  679. <div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>      <span class="keywordflow">if</span> (!rects[i].was_packed)</div>
    680. 

  680. <div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>         all_rects_packed = 0;</div>
    681. 

  681. <div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>   }</div>
    682. 

  682. <div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span> </div>
    683. 

  683. <div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>   <span class="comment">// return the all_rects_packed status</span></div>
    684. 

  684. <div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>   <span class="keywordflow">return</span> all_rects_packed;</div>
    685. 

  685. <div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>}</div>
    686. 

  686. <div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span><span class="preprocessor">#endif</span></div>
    687. 

  687. <div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span> </div>
    688. 

  688. <div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span><span class="comment">/*</span></div>
    689. 

  689. <div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span><span class="comment">------------------------------------------------------------------------------</span></div>
    690. 

  690. <div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span><span class="comment">This software is available under 2 licenses -- choose whichever you prefer.</span></div>
    691. 

  691. <div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span><span class="comment">------------------------------------------------------------------------------</span></div>
    692. 

  692. <div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span><span class="comment">ALTERNATIVE A - MIT License</span></div>
    693. 

  693. <div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span><span class="comment">Copyright (c) 2017 Sean Barrett</span></div>
    694. 

  694. <div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span><span class="comment">Permission is hereby granted, free of charge, to any person obtaining a copy of</span></div>
    695. 

  695. <div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span><span class="comment">this software and associated documentation files (the &quot;Software&quot;), to deal in</span></div>
    696. 

  696. <div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span><span class="comment">the Software without restriction, including without limitation the rights to</span></div>
    697. 

  697. <div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span><span class="comment">use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies</span></div>
    698. 

  698. <div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span><span class="comment">of the Software, and to permit persons to whom the Software is furnished to do</span></div>
    699. 

  699. <div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span><span class="comment">so, subject to the following conditions:</span></div>
    700. 

  700. <div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span><span class="comment">The above copyright notice and this permission notice shall be included in all</span></div>
    701. 

  701. <div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span><span class="comment">copies or substantial portions of the Software.</span></div>
    702. 

  702. <div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span><span class="comment">THE SOFTWARE IS PROVIDED &quot;AS IS&quot;, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR</span></div>
    703. 

  703. <div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span><span class="comment">IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span></div>
    704. 

  704. <div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span><span class="comment">FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE</span></div>
    705. 

  705. <div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span><span class="comment">AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER</span></div>
    706. 

  706. <div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span><span class="comment">LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,</span></div>
    707. 

  707. <div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span><span class="comment">OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE</span></div>
    708. 

  708. <div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span><span class="comment">SOFTWARE.</span></div>
    709. 

  709. <div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span><span class="comment">------------------------------------------------------------------------------</span></div>
    710. 

  710. <div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span><span class="comment">ALTERNATIVE B - Public Domain (www.unlicense.org)</span></div>
    711. 

  711. <div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span><span class="comment">This is free and unencumbered software released into the public domain.</span></div>
    712. 

  712. <div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span><span class="comment">Anyone is free to copy, modify, publish, use, compile, sell, or distribute this</span></div>
    713. 

  713. <div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span><span class="comment">software, either in source code form or as a compiled binary, for any purpose,</span></div>
    714. 

  714. <div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="comment">commercial or non-commercial, and by any means.</span></div>
    715. 

  715. <div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span><span class="comment">In jurisdictions that recognize copyright laws, the author or authors of this</span></div>
    716. 

  716. <div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span><span class="comment">software dedicate any and all copyright interest in the software to the public</span></div>
    717. 

  717. <div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span><span class="comment">domain. We make this dedication for the benefit of the public at large and to</span></div>
    718. 

  718. <div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span><span class="comment">the detriment of our heirs and successors. We intend this dedication to be an</span></div>
    719. 

  719. <div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="comment">overt act of relinquishment in perpetuity of all present and future rights to</span></div>
    720. 

  720. <div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span><span class="comment">this software under copyright law.</span></div>
    721. 

  721. <div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span><span class="comment">THE SOFTWARE IS PROVIDED &quot;AS IS&quot;, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR</span></div>
    722. 

  722. <div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span><span class="comment">IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span></div>
    723. 

  723. <div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span><span class="comment">FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE</span></div>
    724. 

  724. <div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span><span class="comment">AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN</span></div>
    725. 

  725. <div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span><span class="comment">ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION</span></div>
    726. 

  726. <div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span><span class="comment">WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.</span></div>
    727. 

  727. <div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span><span class="comment">------------------------------------------------------------------------------</span></div>
    728. 

  728. <div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span><span class="comment">*/</span></div>
    729. 

  729. <div class="ttc" id="astructstbrp__context_html"><div class="ttname"><a href="structstbrp__context.html">stbrp_context</a></div><div class="ttdef"><b>Definition</b> <a href="stb__rect__pack_8h_source.html#l00181">stb_rect_pack.h:182</a></div></div>
    730. 

  730. <div class="ttc" id="astructstbrp__node_html"><div class="ttname"><a href="structstbrp__node.html">stbrp_node</a></div><div class="ttdef"><b>Definition</b> <a href="stb__rect__pack_8h_source.html#l00175">stb_rect_pack.h:176</a></div></div>
    731. 

  731. <div class="ttc" id="astructstbrp__rect_html"><div class="ttname"><a href="structstbrp__rect.html">stbrp_rect</a></div><div class="ttdef"><b>Definition</b> <a href="stb__rect__pack_8h_source.html#l00115">stb_rect_pack.h:116</a></div></div>
    732. 

  732. </div><!-- fragment --></div><!-- contents -->
    733. 

  733. </div><!-- doc-content -->
    734. 

  734. <!-- start footer part -->
    735. 

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

  736.   <ul>
    737. 

  737.     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>stb_rect_pack.h</b></li>
    738. 

  738.     <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.9.8 </li>
    739. 

  739.   </ul>
    740. 

  740. </div>
    741. 

  741. </body>
    742. 

  742. </html>
    743.