diff options
| author | unknown <paulx161@umn.edu> | 2021-02-03 14:22:28 -0600 |
|---|---|---|
| committer | unknown <paulx161@umn.edu> | 2021-02-03 14:22:28 -0600 |
| commit | 9b83919815f6a6ce5d73da1c28483970d0ca5589 (patch) | |
| tree | 4558864445dccc1605e5315e0bb11c46d2018da1 /dev/MinGfx/docs/html/stb__rect__pack_8h_source.html | |
| parent | Added worksheet and support code for assignment 2 (diff) | |
| download | csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.tar csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.tar.gz csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.tar.bz2 csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.tar.lz csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.tar.xz csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.tar.zst csci4611-9b83919815f6a6ce5d73da1c28483970d0ca5589.zip | |
added dev/MinGfx/
Diffstat (limited to 'dev/MinGfx/docs/html/stb__rect__pack_8h_source.html')
| -rw-r--r-- | dev/MinGfx/docs/html/stb__rect__pack_8h_source.html | 742 |
1 files changed, 742 insertions, 0 deletions
diff --git a/dev/MinGfx/docs/html/stb__rect__pack_8h_source.html b/dev/MinGfx/docs/html/stb__rect__pack_8h_source.html new file mode 100644 index 0000000..2d2f39e --- /dev/null +++ b/dev/MinGfx/docs/html/stb__rect__pack_8h_source.html @@ -0,0 +1,742 @@ +<!-- HTML header for doxygen 1.8.9.1--> +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<html xmlns="http://www.w3.org/1999/xhtml"> +<head> +<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> +<meta http-equiv="X-UA-Compatible" content="IE=9"/> +<meta name="generator" content="Doxygen 1.9.1"/> +<title>MinGfx Toolkit: src/stb_rect_pack.h Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="search/search.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="search/searchdata.js"></script> +<script type="text/javascript" src="search/search.js"></script> +<script type="text/x-mathjax-config"> + MathJax.Hub.Config({ + extensions: ["tex2jax.js"], + jax: ["input/TeX","output/HTML-CSS"], +}); +</script> +<script type="text/javascript" async="async" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script> +<link href="doxygen.css" rel="stylesheet" type="text/css" /> +<link href="customdoxygen.css" rel="stylesheet" type="text/css"/> +</head> +<body> +<div id="top"><!-- do not remove this div, it is closed by doxygen! --> +<div id="titlearea"> +<table cellspacing="0" cellpadding="0"> + <tbody> + <tr style="height: 56px;"> + <td style="padding-left: 0.5em;"> + <div id="projectname">MinGfx Toolkit +  <span id="projectnumber">1.0</span> + </div> + <div id="projectbrief">A minimal library for writing cross-platform (Windows, OSX, linux) graphics programs.</div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.9.1 --> +<script type="text/javascript"> +/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ +var searchBox = new SearchBox("searchBox", "search",false,'Search','.html'); +/* @license-end */ +</script> +<script type="text/javascript" src="menudata.js"></script> +<script type="text/javascript" src="menu.js"></script> +<script type="text/javascript"> +/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ +$(function() { + initMenu('',true,false,'search.php','Search'); + $(document).ready(function() { init_search(); }); +}); +/* @license-end */</script> +<div id="main-nav"></div> +<!-- window showing the filter options --> +<div id="MSearchSelectWindow" + onmouseover="return searchBox.OnSearchSelectShow()" + onmouseout="return searchBox.OnSearchSelectHide()" + onkeydown="return searchBox.OnSearchSelectKey(event)"> +</div> + +<!-- iframe showing the search results (closed by default) --> +<div id="MSearchResultsWindow"> +<iframe src="javascript:void(0)" frameborder="0" + name="MSearchResults" id="MSearchResults"> +</iframe> +</div> + +<div id="nav-path" class="navpath"> + <ul> +<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li> </ul> +</div> +</div><!-- top --> +<div class="header"> + <div class="headertitle"> +<div class="title">stb_rect_pack.h</div> </div> +</div><!--header--> +<div class="contents"> +<a href="stb__rect__pack_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a0455046a8d5457bbc4f3f3ec995c338f"> 1</a></span> <span class="comment">// stb_rect_pack.h - v0.11 - public domain - rectangle packing</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Sean Barrett 2014</span></div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Useful for e.g. packing rectangular textures into an atlas.</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Does not do rotation.</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">//</span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Not necessarily the awesomest packing method, but better than</span></div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// the totally naive one in stb_truetype (which is primarily what</span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// this is meant to replace).</span></div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">//</span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// Has only had a few tests run, may have issues.</span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">//</span></div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// More docs to come.</span></div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">//</span></div> +<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// No memory allocations; uses qsort() and assert() from stdlib.</span></div> +<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Can override those by defining STBRP_SORT and STBRP_ASSERT.</span></div> +<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">//</span></div> +<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// This library currently uses the Skyline Bottom-Left algorithm.</span></div> +<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">//</span></div> +<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// Please note: better rectangle packers are welcome! Please</span></div> +<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// implement them to the same API, but with a different init</span></div> +<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// function.</span></div> +<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">//</span></div> +<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// Credits</span></div> +<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">//</span></div> +<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// Library</span></div> +<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Sean Barrett</span></div> +<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// Minor features</span></div> +<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// Martins Mozeiko</span></div> +<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// github:IntellectualKitty</span></div> +<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// </span></div> +<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// Bugfixes / warning fixes</span></div> +<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// Jeremy Jaussaud</span></div> +<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">//</span></div> +<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// Version history:</span></div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">//</span></div> +<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// 0.11 (2017-03-03) return packing success/fail result</span></div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// 0.10 (2016-10-25) remove cast-away-const to avoid warnings</span></div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// 0.09 (2016-08-27) fix compiler warnings</span></div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// 0.08 (2015-09-13) really fix bug with empty rects (w=0 or h=0)</span></div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// 0.07 (2015-09-13) fix bug with empty rects (w=0 or h=0)</span></div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// 0.06 (2015-04-15) added STBRP_SORT to allow replacing qsort</span></div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// 0.05: added STBRP_ASSERT to allow replacing assert</span></div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// 0.04: fixed minor bug in STBRP_LARGE_RECTS support</span></div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// 0.01: initial release</span></div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">//</span></div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// LICENSE</span></div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">//</span></div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// See end of file for license information.</span></div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">//</span></div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// INCLUDE SECTION</span></div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">//</span></div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef STB_INCLUDE_STB_RECT_PACK_H</span></div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define STB_INCLUDE_STB_RECT_PACK_H</span></div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  </div> +<div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#af2f15dfcc6ad60b1df4f5902e2cc25ce"> 59</a></span> <span class="preprocessor">#define STB_RECT_PACK_VERSION 1</span></div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#ifdef STBRP_STATIC</span></div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#define STBRP_DEF static</span></div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#else</span></div> +<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753"> 64</a></span> <span class="preprocessor">#define STBRP_DEF extern</span></div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  </div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#ifdef __cplusplus</span></div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> {</div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  </div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structstbrp__context.html">stbrp_context</a> <a class="code" href="structstbrp__context.html">stbrp_context</a>;</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structstbrp__node.html">stbrp_node</a> <a class="code" href="structstbrp__node.html">stbrp_node</a>;</div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structstbrp__rect.html">stbrp_rect</a> <a class="code" href="structstbrp__rect.html">stbrp_rect</a>;</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  </div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor">#ifdef STBRP_LARGE_RECTS</span></div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="keyword">typedef</span> <span class="keywordtype">int</span> <a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>;</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor">#else</span></div> +<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9"> 78</a></span> <span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>;</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div> +<div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#af038ae1b98573f24736c9a3eed0478ba"> 81</a></span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">int</span> <a class="code" href="stb__rect__pack_8h.html#af038ae1b98573f24736c9a3eed0478ba">stbrp_pack_rects</a> (<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *rects, <span class="keywordtype">int</span> num_rects);</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Assign packed locations to rectangles. The rectangles are of type</span></div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// 'stbrp_rect' defined below, stored in the array 'rects', and there</span></div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// are 'num_rects' many of them.</span></div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment">//</span></div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// Rectangles which are successfully packed have the 'was_packed' flag</span></div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// set to a non-zero value and 'x' and 'y' store the minimum location</span></div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// on each axis (i.e. bottom-left in cartesian coordinates, top-left</span></div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// if you imagine y increasing downwards). Rectangles which do not fit</span></div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// have the 'was_packed' flag set to 0.</span></div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">//</span></div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// You should not try to access the 'rects' array from another thread</span></div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// while this function is running, as the function temporarily reorders</span></div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// the array while it executes.</span></div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment">//</span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// To pack into another rectangle, you need to call stbrp_init_target</span></div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// again. To continue packing into the same rectangle, you can call</span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// this function again. Calling this multiple times with multiple rect</span></div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// arrays will probably produce worse packing results than calling it</span></div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// a single time with the full rectangle array, but the option is</span></div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// available.</span></div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">//</span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// The function returns 1 if all of the rectangles were successfully</span></div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// packed and 0 otherwise.</span></div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  </div> +<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="structstbrp__rect.html"> 106</a></span> <span class="keyword">struct </span><a class="code" href="structstbrp__rect.html">stbrp_rect</a></div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> {</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// reserved for your use:</span></div> +<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="structstbrp__rect.html#a92da8626bc99df041c0c3bfd01c25f7a"> 109</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__rect.html#a92da8626bc99df041c0c3bfd01c25f7a">id</a>;</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// input:</span></div> +<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398"> 112</a></span>  <a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a> <a class="code" href="structstbrp__rect.html#a248d43f1eb979c1e7b92ba6df431dec5">w</a>, <a class="code" href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398">h</a>;</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// output:</span></div> +<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18"> 115</a></span>  <a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a> <a class="code" href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18">x</a>, <a class="code" href="structstbrp__rect.html#ae3034c1fbf86043b568f5a4dddf946fa">y</a>;</div> +<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49"> 116</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a>; <span class="comment">// non-zero if valid packing</span></div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> }; <span class="comment">// 16 bytes, nominally</span></div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div> +<div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a8b32f5ad458f614f5d419ef26cef5b3c"> 121</a></span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">void</span> <a class="code" href="stb__rect__pack_8h.html#a8b32f5ad458f614f5d419ef26cef5b3c">stbrp_init_target</a> (<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height, <a class="code" href="structstbrp__node.html">stbrp_node</a> *nodes, <span class="keywordtype">int</span> num_nodes);</div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// Initialize a rectangle packer to:</span></div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// pack a rectangle that is 'width' by 'height' in dimensions</span></div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// using temporary storage provided by the array 'nodes', which is 'num_nodes' long</span></div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment">//</span></div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// You must call this function every time you start packing into a new target.</span></div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">//</span></div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// There is no "shutdown" function. The 'nodes' memory must stay valid for</span></div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// the following stbrp_pack_rects() call (or calls), but can be freed after</span></div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// the call (or calls) finish.</span></div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">//</span></div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// Note: to guarantee best results, either:</span></div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// 1. make sure 'num_nodes' >= 'width'</span></div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// or 2. call stbrp_allow_out_of_mem() defined below with 'allow_out_of_mem = 1'</span></div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">//</span></div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// If you don't do either of the above things, widths will be quantized to multiples</span></div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// of small integers to guarantee the algorithm doesn't run out of temporary storage.</span></div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment">//</span></div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// If you do #2, then the non-quantized algorithm will be used, but the algorithm</span></div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// may run out of temporary storage and be unable to pack some rectangles.</span></div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div> +<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a1babd70b223e571305fd9753a83a4fda"> 142</a></span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">void</span> <a class="code" href="stb__rect__pack_8h.html#a1babd70b223e571305fd9753a83a4fda">stbrp_setup_allow_out_of_mem</a> (<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> allow_out_of_mem);</div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// Optionally call this function after init but before doing any packing to</span></div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// change the handling of the out-of-temp-memory scenario, described above.</span></div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// If you call init again, this will be reset to the default (false).</span></div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  </div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div> +<div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a5a8223866c146933da3e152066bf61a1"> 148</a></span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">void</span> <a class="code" href="stb__rect__pack_8h.html#a5a8223866c146933da3e152066bf61a1">stbrp_setup_heuristic</a> (<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> heuristic);</div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// Optionally select which packing heuristic the library should use. Different</span></div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// heuristics will produce better/worse results for different data sets.</span></div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// If you call init again, this will be reset to the default.</span></div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  </div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="keyword">enum</span></div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> {</div> +<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba5e4dd0b1cbee654bbfeebc5311f03525"> 155</a></span>  <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba5e4dd0b1cbee654bbfeebc5311f03525">STBRP_HEURISTIC_Skyline_default</a>=0,</div> +<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba13530b067fb1f9707dc0f9d51f8b074a"> 156</a></span>  <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba13530b067fb1f9707dc0f9d51f8b074a">STBRP_HEURISTIC_Skyline_BL_sortHeight</a> = <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba5e4dd0b1cbee654bbfeebc5311f03525">STBRP_HEURISTIC_Skyline_default</a>,</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba11d62749c4405a231a6fd1dd9d46615c">STBRP_HEURISTIC_Skyline_BF_sortHeight</a></div> +<div class="line"><a name="l00158"></a><span class="lineno"><a class="line" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba11d62749c4405a231a6fd1dd9d46615c"> 158</a></span> };</div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment">//</span></div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// the details of the following structures don't matter to you, but they must</span></div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// be visible so you can handle the memory allocations for them</span></div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div> +<div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="structstbrp__node.html"> 166</a></span> <span class="keyword">struct </span><a class="code" href="structstbrp__node.html">stbrp_node</a></div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> {</div> +<div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea"> 168</a></span>  <a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a> <a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a>,<a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a>;</div> +<div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4"> 169</a></span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *<a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> };</div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div> +<div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="structstbrp__context.html"> 172</a></span> <span class="keyword">struct </span><a class="code" href="structstbrp__context.html">stbrp_context</a></div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> {</div> +<div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="structstbrp__context.html#a70cfcb2044ce8397cc440d28b30c09b2"> 174</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__context.html#a70cfcb2044ce8397cc440d28b30c09b2">width</a>;</div> +<div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="structstbrp__context.html#af3715a6f3faecfb4fac8f6ccbb71f9c7"> 175</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__context.html#af3715a6f3faecfb4fac8f6ccbb71f9c7">height</a>;</div> +<div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481"> 176</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">align</a>;</div> +<div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="structstbrp__context.html#a007509feee322404083034e4c2d3dc5d"> 177</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__context.html#a007509feee322404083034e4c2d3dc5d">init_mode</a>;</div> +<div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a"> 178</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a">heuristic</a>;</div> +<div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58"> 179</a></span>  <span class="keywordtype">int</span> <a class="code" href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58">num_nodes</a>;</div> +<div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120"> 180</a></span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *<a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839"> 181</a></span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *<a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a>;</div> +<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624"> 182</a></span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> <a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[2]; <span class="comment">// we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2'</span></div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> };</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  </div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="preprocessor">#ifdef __cplusplus</span></div> +<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> }</div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  </div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment">//</span></div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// IMPLEMENTATION SECTION</span></div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment">//</span></div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="preprocessor">#ifdef STB_RECT_PACK_IMPLEMENTATION</span></div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="preprocessor">#ifndef STBRP_SORT</span></div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="preprocessor">#include <stdlib.h></span></div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="preprocessor">#define STBRP_SORT qsort</span></div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  </div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="preprocessor">#ifndef STBRP_ASSERT</span></div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor">#include <assert.h></span></div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="preprocessor">#define STBRP_ASSERT assert</span></div> +<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  </div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor">#ifdef _MSC_VER</span></div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="preprocessor">#define STBRP__NOTUSED(v) (void)(v)</span></div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor">#else</span></div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor">#define STBRP__NOTUSED(v) (void)sizeof(v)</span></div> +<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  </div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="keyword">enum</span></div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> {</div> +<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  STBRP__INIT_skyline = 1</div> +<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> };</div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">void</span> <a class="code" href="stb__rect__pack_8h.html#a5a8223866c146933da3e152066bf61a1">stbrp_setup_heuristic</a>(<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> heuristic)</div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> {</div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">switch</span> (context-><a class="code" href="structstbrp__context.html#a007509feee322404083034e4c2d3dc5d">init_mode</a>) {</div> +<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">case</span> STBRP__INIT_skyline:</div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  STBRP_ASSERT(heuristic == <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba13530b067fb1f9707dc0f9d51f8b074a">STBRP_HEURISTIC_Skyline_BL_sortHeight</a> || heuristic == <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba11d62749c4405a231a6fd1dd9d46615c">STBRP_HEURISTIC_Skyline_BF_sortHeight</a>);</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  context-><a class="code" href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a">heuristic</a> = heuristic;</div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">default</span>:</div> +<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  STBRP_ASSERT(0);</div> +<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> }</div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  </div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">void</span> <a class="code" href="stb__rect__pack_8h.html#a1babd70b223e571305fd9753a83a4fda">stbrp_setup_allow_out_of_mem</a>(<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> allow_out_of_mem)</div> +<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> {</div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (allow_out_of_mem)</div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// if it's ok to run out of memory, then don't bother aligning them;</span></div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// this gives better packing, but may fail due to OOM (even though</span></div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// the rectangles easily fit). @TODO a smarter approach would be to only</span></div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// quantize once we've hit OOM, then we could get rid of this parameter.</span></div> +<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  context-><a class="code" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">align</a> = 1;</div> +<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// if it's not ok to run out of memory, then quantize the widths</span></div> +<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// so that num_nodes is always enough nodes.</span></div> +<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// I.e. num_nodes * align >= width</span></div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// align >= width / num_nodes</span></div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// align = ceil(width/num_nodes)</span></div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  context-><a class="code" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">align</a> = (context-><a class="code" href="structstbrp__context.html#a70cfcb2044ce8397cc440d28b30c09b2">width</a> + context-><a class="code" href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58">num_nodes</a>-1) / context-><a class="code" href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58">num_nodes</a>;</div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> }</div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div> +<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">void</span> <a class="code" href="stb__rect__pack_8h.html#a8b32f5ad458f614f5d419ef26cef5b3c">stbrp_init_target</a>(<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height, <a class="code" href="structstbrp__node.html">stbrp_node</a> *nodes, <span class="keywordtype">int</span> num_nodes)</div> +<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> {</div> +<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">int</span> i;</div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="preprocessor">#ifndef STBRP_LARGE_RECTS</span></div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  STBRP_ASSERT(width <= 0xffff && height <= 0xffff);</div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div> +<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">for</span> (i=0; i < num_nodes-1; ++i)</div> +<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  nodes[i].next = &nodes[i+1];</div> +<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  nodes[i].<a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> = NULL;</div> +<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  context-><a class="code" href="structstbrp__context.html#a007509feee322404083034e4c2d3dc5d">init_mode</a> = STBRP__INIT_skyline;</div> +<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  context-><a class="code" href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a">heuristic</a> = <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba5e4dd0b1cbee654bbfeebc5311f03525">STBRP_HEURISTIC_Skyline_default</a>;</div> +<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a> = &nodes[0];</div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  context-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a> = &context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[0];</div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  context-><a class="code" href="structstbrp__context.html#a70cfcb2044ce8397cc440d28b30c09b2">width</a> = width;</div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  context-><a class="code" href="structstbrp__context.html#af3715a6f3faecfb4fac8f6ccbb71f9c7">height</a> = height;</div> +<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  context-><a class="code" href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58">num_nodes</a> = num_nodes;</div> +<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="stb__rect__pack_8h.html#a1babd70b223e571305fd9753a83a4fda">stbrp_setup_allow_out_of_mem</a>(context, 0);</div> +<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  </div> +<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// node 0 is the full width, node 1 is the sentinel (lets us not store width explicitly)</span></div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[0].<a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> = 0;</div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[0].<a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a> = 0;</div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[0].<a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> = &context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[1];</div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[1].<a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> = (<a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>) width;</div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="preprocessor">#ifdef STBRP_LARGE_RECTS</span></div> +<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[1].<a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a> = (1<<30);</div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="preprocessor">#else</span></div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[1].<a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a> = 65535;</div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  context-><a class="code" href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">extra</a>[1].<a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> = NULL;</div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> }</div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  </div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// find minimum y position if it starts at x1</span></div> +<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">static</span> <span class="keywordtype">int</span> stbrp__skyline_find_min_y(<a class="code" href="structstbrp__context.html">stbrp_context</a> *c, <a class="code" 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> +<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> {</div> +<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *node = first;</div> +<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordtype">int</span> x1 = x0 + width;</div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordtype">int</span> min_y, visited_width, waste_area;</div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div> +<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  STBRP__NOTUSED(c);</div> +<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div> +<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  STBRP_ASSERT(first-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> <= x0);</div> +<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div> +<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="preprocessor"> #if 0</span></div> +<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// skip in case we're past the node</span></div> +<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">while</span> (node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> <= x0)</div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  ++node;</div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="preprocessor"> #else</span></div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  STBRP_ASSERT(node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> > x0); <span class="comment">// we ended up handling this in the caller for efficiency</span></div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="preprocessor"> #endif</span></div> +<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div> +<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  STBRP_ASSERT(node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> <= x0);</div> +<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  min_y = 0;</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  waste_area = 0;</div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  visited_width = 0;</div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">while</span> (node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < x1) {</div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">if</span> (node-><a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a> > min_y) {</div> +<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// raise min_y higher.</span></div> +<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// we've accounted for all waste up to min_y,</span></div> +<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// but we'll now add more waste for everything we've visted</span></div> +<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  waste_area += visited_width * (node-><a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a> - min_y);</div> +<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  min_y = node-><a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a>;</div> +<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// the first time through, visited_width might be reduced</span></div> +<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < x0)</div> +<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  visited_width += node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> - x0;</div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">else</span></div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  visited_width += node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> - node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a>;</div> +<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  } <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// add waste area</span></div> +<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordtype">int</span> under_width = node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> - node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a>;</div> +<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">if</span> (under_width + visited_width > width)</div> +<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  under_width = width - visited_width;</div> +<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  waste_area += under_width * (min_y - node-><a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a>);</div> +<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  visited_width += under_width;</div> +<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div> +<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  node = node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div> +<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div> +<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  *pwaste = waste_area;</div> +<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">return</span> min_y;</div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> }</div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="keyword">typedef</span> <span class="keyword">struct</span></div> +<div class="line"><a name="l00334"></a><span class="lineno"> 334</span> {</div> +<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordtype">int</span> x,y;</div> +<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> **prev_link;</div> +<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> } stbrp__findresult;</div> +<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  </div> +<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="keyword">static</span> stbrp__findresult stbrp__skyline_find_best_pos(<a class="code" href="structstbrp__context.html">stbrp_context</a> *c, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height)</div> +<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> {</div> +<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordtype">int</span> best_waste = (1<<30), best_x, best_y = (1 << 30);</div> +<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  stbrp__findresult fr;</div> +<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> **prev, *node, *tail, **best = NULL;</div> +<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div> +<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// align to multiple of c->align</span></div> +<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  width = (width + c-><a class="code" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">align</a> - 1);</div> +<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  width -= width % c-><a class="code" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">align</a>;</div> +<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  STBRP_ASSERT(width % c-><a class="code" href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">align</a> == 0);</div> +<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  </div> +<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  node = c-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  prev = &c-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">while</span> (node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> + width <= c->width) {</div> +<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordtype">int</span> y,waste;</div> +<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  y = stbrp__skyline_find_min_y(c, node, node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a>, width, &waste);</div> +<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (c-><a class="code" href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a">heuristic</a> == <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba13530b067fb1f9707dc0f9d51f8b074a">STBRP_HEURISTIC_Skyline_BL_sortHeight</a>) { <span class="comment">// actually just want to test BL</span></div> +<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// bottom left</span></div> +<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">if</span> (y < best_y) {</div> +<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  best_y = y;</div> +<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  best = prev;</div> +<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div> +<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  } <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// best-fit</span></div> +<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">if</span> (y + height <= c->height) {</div> +<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">// can only use it if it first vertically</span></div> +<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (y < best_y || (y == best_y && waste < best_waste)) {</div> +<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  best_y = y;</div> +<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  best_waste = waste;</div> +<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  best = prev;</div> +<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  }</div> +<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</div> +<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div> +<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  prev = &node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  node = node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div> +<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  </div> +<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  best_x = (best == NULL) ? 0 : (*best)-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a>;</div> +<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  </div> +<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// if doing best-fit (BF), we also have to try aligning right edge to each node position</span></div> +<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="comment">// e.g, if fitting</span></div> +<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// ____________________</span></div> +<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// |____________________|</span></div> +<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// into</span></div> +<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// | |</span></div> +<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// | ____________|</span></div> +<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// |____________|</span></div> +<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="comment">// then right-aligned reduces waste, but bottom-left BL is always chooses left-aligned</span></div> +<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">// This makes BF take about 2x the time</span></div> +<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  </div> +<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  if (c-><a class="code" href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a">heuristic</a> == <a class="code" href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba11d62749c4405a231a6fd1dd9d46615c">STBRP_HEURISTIC_Skyline_BF_sortHeight</a>) {</div> +<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  tail = c-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  node = c-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  prev = &c-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">// find first node that's admissible</span></div> +<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">while</span> (tail-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < width)</div> +<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  tail = tail-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">while</span> (tail) {</div> +<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordtype">int</span> xpos = tail-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> - width;</div> +<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordtype">int</span> y,waste;</div> +<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  STBRP_ASSERT(xpos >= 0);</div> +<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// find the left position that matches this</span></div> +<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">while</span> (node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> <= xpos) {</div> +<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  prev = &node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  node = node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div> +<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  STBRP_ASSERT(node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> > xpos && node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> <= xpos);</div> +<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  y = stbrp__skyline_find_min_y(c, node, xpos, width, &waste);</div> +<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">if</span> (y + height < c->height) {</div> +<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">if</span> (y <= best_y) {</div> +<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">if</span> (y < best_y || waste < best_waste || (waste==best_waste && xpos < best_x)) {</div> +<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  best_x = xpos;</div> +<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  STBRP_ASSERT(y <= best_y);</div> +<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  best_y = y;</div> +<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  best_waste = waste;</div> +<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  best = prev;</div> +<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  }</div> +<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div> +<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div> +<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  tail = tail-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  } </div> +<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div> +<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div> +<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  fr.prev_link = best;</div> +<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  fr.<a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> = best_x;</div> +<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  fr.y = best_y;</div> +<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> fr;</div> +<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> }</div> +<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  </div> +<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="keyword">static</span> stbrp__findresult stbrp__skyline_pack_rectangle(<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <span class="keywordtype">int</span> width, <span class="keywordtype">int</span> height)</div> +<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> {</div> +<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// find best position according to heuristic</span></div> +<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  stbrp__findresult res = stbrp__skyline_find_best_pos(context, width, height);</div> +<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *node, *cur;</div> +<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  </div> +<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// bail if:</span></div> +<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// 1. it failed</span></div> +<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// 2. the best node doesn't fit (we don't always check this)</span></div> +<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// 3. we're out of memory</span></div> +<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">if</span> (res.prev_link == NULL || res.y + height > context-><a class="code" href="structstbrp__context.html#af3715a6f3faecfb4fac8f6ccbb71f9c7">height</a> || context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a> == NULL) {</div> +<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  res.prev_link = NULL;</div> +<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">return</span> res;</div> +<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div> +<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div> +<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// on success, create new node</span></div> +<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  node = context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a>;</div> +<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  node-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> = (<a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>) res.x;</div> +<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  node-><a class="code" href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">y</a> = (<a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>) (res.y + height);</div> +<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  </div> +<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a> = node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  </div> +<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// insert the new node into the right starting point, and</span></div> +<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// let 'cur' point to the remaining nodes needing to be</span></div> +<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// stiched back in</span></div> +<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  </div> +<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  cur = *res.prev_link;</div> +<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> (cur-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < res.x) {</div> +<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// preserve the existing one, so start testing with the next one</span></div> +<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *next = cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> = node;</div> +<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  cur = next;</div> +<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  } <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  *res.prev_link = node;</div> +<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  }</div> +<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  </div> +<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// from here, traverse cur and free the nodes, until we get to one</span></div> +<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// that shouldn't be freed</span></div> +<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">while</span> (cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> && cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> <= res.x + width) {</div> +<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *next = cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="comment">// move the current node to the free list</span></div> +<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> = context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a>;</div> +<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a> = cur;</div> +<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  cur = next;</div> +<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  }</div> +<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  </div> +<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="comment">// stitch the list back in</span></div> +<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  node-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> = cur;</div> +<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  </div> +<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">if</span> (cur-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < res.x + width)</div> +<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  cur-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> = (<a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>) (res.x + width);</div> +<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  </div> +<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="preprocessor">#ifdef _DEBUG</span></div> +<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  cur = context-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">while</span> (cur-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < context-><a class="code" href="structstbrp__context.html#a70cfcb2044ce8397cc440d28b30c09b2">width</a>) {</div> +<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  STBRP_ASSERT(cur-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a> < cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>-><a class="code" href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">x</a>);</div> +<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  cur = cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div> +<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  STBRP_ASSERT(cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a> == NULL);</div> +<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  </div> +<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  {</div> +<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="structstbrp__node.html">stbrp_node</a> *L1 = NULL, *L2 = NULL;</div> +<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordtype">int</span> count=0;</div> +<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  cur = context-><a class="code" href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">active_head</a>;</div> +<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">while</span> (cur) {</div> +<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  L1 = cur;</div> +<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  cur = cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  ++count;</div> +<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div> +<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  cur = context-><a class="code" href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">free_head</a>;</div> +<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">while</span> (cur) {</div> +<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  L2 = cur;</div> +<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  cur = cur-><a class="code" href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">next</a>;</div> +<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  ++count;</div> +<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div> +<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  STBRP_ASSERT(count == context-><a class="code" href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58">num_nodes</a>+2);</div> +<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div> +<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  </div> +<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">return</span> res;</div> +<div class="line"><a name="l00514"></a><span class="lineno"> 514</span> }</div> +<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  </div> +<div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="keyword">static</span> <span class="keywordtype">int</span> 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> +<div class="line"><a name="l00517"></a><span class="lineno"> 517</span> {</div> +<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *p = (<span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *) a;</div> +<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *q = (<span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *) b;</div> +<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (p-><a class="code" href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398">h</a> > q-><a class="code" href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398">h</a>)</div> +<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">return</span> -1;</div> +<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">if</span> (p-><a class="code" href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398">h</a> < q-><a class="code" href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398">h</a>)</div> +<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">return</span> 1;</div> +<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">return</span> (p-><a class="code" href="structstbrp__rect.html#a248d43f1eb979c1e7b92ba6df431dec5">w</a> > q-><a class="code" href="structstbrp__rect.html#a248d43f1eb979c1e7b92ba6df431dec5">w</a>) ? -1 : (p-><a class="code" href="structstbrp__rect.html#a248d43f1eb979c1e7b92ba6df431dec5">w</a> < q-><a class="code" href="structstbrp__rect.html#a248d43f1eb979c1e7b92ba6df431dec5">w</a>);</div> +<div class="line"><a name="l00525"></a><span class="lineno"> 525</span> }</div> +<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  </div> +<div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="keyword">static</span> <span class="keywordtype">int</span> 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> +<div class="line"><a name="l00528"></a><span class="lineno"> 528</span> {</div> +<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *p = (<span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *) a;</div> +<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *q = (<span class="keyword">const</span> <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *) b;</div> +<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">return</span> (p-><a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a> < q-><a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a>) ? -1 : (p-><a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a> > q-><a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a>);</div> +<div class="line"><a name="l00532"></a><span class="lineno"> 532</span> }</div> +<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  </div> +<div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="preprocessor">#ifdef STBRP_LARGE_RECTS</span></div> +<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="preprocessor">#define STBRP__MAXVAL 0xffffffff</span></div> +<div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="preprocessor">#else</span></div> +<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="preprocessor">#define STBRP__MAXVAL 0xffff</span></div> +<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  </div> +<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <a class="code" href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a> <span class="keywordtype">int</span> <a class="code" href="stb__rect__pack_8h.html#af038ae1b98573f24736c9a3eed0478ba">stbrp_pack_rects</a>(<a class="code" href="structstbrp__context.html">stbrp_context</a> *context, <a class="code" href="structstbrp__rect.html">stbrp_rect</a> *rects, <span class="keywordtype">int</span> num_rects)</div> +<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> {</div> +<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordtype">int</span> i, all_rects_packed = 1;</div> +<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  </div> +<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// we use the 'was_packed' field internally to allow sorting/unsorting</span></div> +<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">for</span> (i=0; i < num_rects; ++i) {</div> +<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  rects[i].<a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a> = i;</div> +<div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="preprocessor"> #ifndef STBRP_LARGE_RECTS</span></div> +<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  STBRP_ASSERT(rects[i].w <= 0xffff && rects[i].h <= 0xffff);</div> +<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="preprocessor"> #endif</span></div> +<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  }</div> +<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  </div> +<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="comment">// sort according to heuristic</span></div> +<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  STBRP_SORT(rects, num_rects, <span class="keyword">sizeof</span>(rects[0]), rect_height_compare);</div> +<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  </div> +<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">for</span> (i=0; i < num_rects; ++i) {</div> +<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">if</span> (rects[i].w == 0 || rects[i].h == 0) {</div> +<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  rects[i].<a class="code" href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18">x</a> = rects[i].<a class="code" href="structstbrp__rect.html#ae3034c1fbf86043b568f5a4dddf946fa">y</a> = 0; <span class="comment">// empty rect needs no space</span></div> +<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  } <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  stbrp__findresult fr = stbrp__skyline_pack_rectangle(context, rects[i].w, rects[i].h);</div> +<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">if</span> (fr.prev_link) {</div> +<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  rects[i].<a class="code" href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18">x</a> = (<a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>) fr.x;</div> +<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  rects[i].y = (<a class="code" href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a>) fr.y;</div> +<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  } <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  rects[i].<a class="code" href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18">x</a> = rects[i].<a class="code" href="structstbrp__rect.html#ae3034c1fbf86043b568f5a4dddf946fa">y</a> = STBRP__MAXVAL;</div> +<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div> +<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  }</div> +<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  }</div> +<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  </div> +<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// unsort</span></div> +<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  STBRP_SORT(rects, num_rects, <span class="keyword">sizeof</span>(rects[0]), rect_original_order);</div> +<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  </div> +<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// set was_packed flags and all_rects_packed status</span></div> +<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordflow">for</span> (i=0; i < num_rects; ++i) {</div> +<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  rects[i].<a class="code" href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">was_packed</a> = !(rects[i].<a class="code" href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18">x</a> == STBRP__MAXVAL && rects[i].<a class="code" href="structstbrp__rect.html#ae3034c1fbf86043b568f5a4dddf946fa">y</a> == STBRP__MAXVAL);</div> +<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordflow">if</span> (!rects[i].was_packed)</div> +<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  all_rects_packed = 0;</div> +<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  }</div> +<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  </div> +<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// return the all_rects_packed status</span></div> +<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">return</span> all_rects_packed;</div> +<div class="line"><a name="l00581"></a><span class="lineno"> 581</span> }</div> +<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="preprocessor">#endif</span></div> +<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  </div> +<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment">/*</span></div> +<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment">------------------------------------------------------------------------------</span></div> +<div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment">This software is available under 2 licenses -- choose whichever you prefer.</span></div> +<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="comment">------------------------------------------------------------------------------</span></div> +<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="comment">ALTERNATIVE A - MIT License</span></div> +<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment">Copyright (c) 2017 Sean Barrett</span></div> +<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment">Permission is hereby granted, free of charge, to any person obtaining a copy of </span></div> +<div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment">this software and associated documentation files (the "Software"), to deal in </span></div> +<div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment">the Software without restriction, including without limitation the rights to </span></div> +<div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="comment">use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies </span></div> +<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment">of the Software, and to permit persons to whom the Software is furnished to do </span></div> +<div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment">so, subject to the following conditions:</span></div> +<div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment">The above copyright notice and this permission notice shall be included in all </span></div> +<div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment">copies or substantial portions of the Software.</span></div> +<div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment">THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR </span></div> +<div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment">IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, </span></div> +<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment">FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE </span></div> +<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment">AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER </span></div> +<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment">LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, </span></div> +<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment">OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE </span></div> +<div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment">SOFTWARE.</span></div> +<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment">------------------------------------------------------------------------------</span></div> +<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment">ALTERNATIVE B - Public Domain (www.unlicense.org)</span></div> +<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment">This is free and unencumbered software released into the public domain.</span></div> +<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment">Anyone is free to copy, modify, publish, use, compile, sell, or distribute this </span></div> +<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment">software, either in source code form or as a compiled binary, for any purpose, </span></div> +<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="comment">commercial or non-commercial, and by any means.</span></div> +<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="comment">In jurisdictions that recognize copyright laws, the author or authors of this </span></div> +<div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="comment">software dedicate any and all copyright interest in the software to the public </span></div> +<div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment">domain. We make this dedication for the benefit of the public at large and to </span></div> +<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment">the detriment of our heirs and successors. We intend this dedication to be an </span></div> +<div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment">overt act of relinquishment in perpetuity of all present and future rights to </span></div> +<div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment">this software under copyright law.</span></div> +<div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="comment">THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR </span></div> +<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment">IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, </span></div> +<div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment">FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE </span></div> +<div class="line"><a name="l00620"></a><span class="lineno"> 620</span> <span class="comment">AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN </span></div> +<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <span class="comment">ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION </span></div> +<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment">WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.</span></div> +<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment">------------------------------------------------------------------------------</span></div> +<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment">*/</span></div> +<div class="ttc" id="astb__rect__pack_8h_html_a06fc87d81c62e9abb8790b6e5713c55ba11d62749c4405a231a6fd1dd9d46615c"><div class="ttname"><a href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba11d62749c4405a231a6fd1dd9d46615c">STBRP_HEURISTIC_Skyline_BF_sortHeight</a></div><div class="ttdeci">@ STBRP_HEURISTIC_Skyline_BF_sortHeight</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00158">stb_rect_pack.h:157</a></div></div> +<div class="ttc" id="astb__rect__pack_8h_html_a06fc87d81c62e9abb8790b6e5713c55ba13530b067fb1f9707dc0f9d51f8b074a"><div class="ttname"><a href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba13530b067fb1f9707dc0f9d51f8b074a">STBRP_HEURISTIC_Skyline_BL_sortHeight</a></div><div class="ttdeci">@ STBRP_HEURISTIC_Skyline_BL_sortHeight</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00156">stb_rect_pack.h:156</a></div></div> +<div class="ttc" id="astb__rect__pack_8h_html_a06fc87d81c62e9abb8790b6e5713c55ba5e4dd0b1cbee654bbfeebc5311f03525"><div class="ttname"><a href="stb__rect__pack_8h.html#a06fc87d81c62e9abb8790b6e5713c55ba5e4dd0b1cbee654bbfeebc5311f03525">STBRP_HEURISTIC_Skyline_default</a></div><div class="ttdeci">@ STBRP_HEURISTIC_Skyline_default</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00155">stb_rect_pack.h:155</a></div></div> +<div class="ttc" id="astb__rect__pack_8h_html_a0b73f2d2521fb81afc056a823e3ca753"><div class="ttname"><a href="stb__rect__pack_8h.html#a0b73f2d2521fb81afc056a823e3ca753">STBRP_DEF</a></div><div class="ttdeci">#define STBRP_DEF</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00064">stb_rect_pack.h:64</a></div></div> +<div class="ttc" id="astb__rect__pack_8h_html_a1babd70b223e571305fd9753a83a4fda"><div class="ttname"><a href="stb__rect__pack_8h.html#a1babd70b223e571305fd9753a83a4fda">stbrp_setup_allow_out_of_mem</a></div><div class="ttdeci">STBRP_DEF void stbrp_setup_allow_out_of_mem(stbrp_context *context, int allow_out_of_mem)</div></div> +<div class="ttc" id="astb__rect__pack_8h_html_a5a8223866c146933da3e152066bf61a1"><div class="ttname"><a href="stb__rect__pack_8h.html#a5a8223866c146933da3e152066bf61a1">stbrp_setup_heuristic</a></div><div class="ttdeci">STBRP_DEF void stbrp_setup_heuristic(stbrp_context *context, int heuristic)</div></div> +<div class="ttc" id="astb__rect__pack_8h_html_a8b32f5ad458f614f5d419ef26cef5b3c"><div class="ttname"><a href="stb__rect__pack_8h.html#a8b32f5ad458f614f5d419ef26cef5b3c">stbrp_init_target</a></div><div class="ttdeci">STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes)</div></div> +<div class="ttc" id="astb__rect__pack_8h_html_ac2c2491b95dea6a298b7423dc762dfd9"><div class="ttname"><a href="stb__rect__pack_8h.html#ac2c2491b95dea6a298b7423dc762dfd9">stbrp_coord</a></div><div class="ttdeci">unsigned short stbrp_coord</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00078">stb_rect_pack.h:78</a></div></div> +<div class="ttc" id="astb__rect__pack_8h_html_af038ae1b98573f24736c9a3eed0478ba"><div class="ttname"><a href="stb__rect__pack_8h.html#af038ae1b98573f24736c9a3eed0478ba">stbrp_pack_rects</a></div><div class="ttdeci">STBRP_DEF int stbrp_pack_rects(stbrp_context *context, stbrp_rect *rects, int num_rects)</div></div> +<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#l00172">stb_rect_pack.h:173</a></div></div> +<div class="ttc" id="astructstbrp__context_html_a007509feee322404083034e4c2d3dc5d"><div class="ttname"><a href="structstbrp__context.html#a007509feee322404083034e4c2d3dc5d">stbrp_context::init_mode</a></div><div class="ttdeci">int init_mode</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00177">stb_rect_pack.h:177</a></div></div> +<div class="ttc" id="astructstbrp__context_html_a0b80e1fbdac125427526f3500d4e7624"><div class="ttname"><a href="structstbrp__context.html#a0b80e1fbdac125427526f3500d4e7624">stbrp_context::extra</a></div><div class="ttdeci">stbrp_node extra[2]</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00182">stb_rect_pack.h:182</a></div></div> +<div class="ttc" id="astructstbrp__context_html_a13277239636803aff28f00b0a0376120"><div class="ttname"><a href="structstbrp__context.html#a13277239636803aff28f00b0a0376120">stbrp_context::active_head</a></div><div class="ttdeci">stbrp_node * active_head</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00180">stb_rect_pack.h:180</a></div></div> +<div class="ttc" id="astructstbrp__context_html_a1336ae32373663847866cc65904c2839"><div class="ttname"><a href="structstbrp__context.html#a1336ae32373663847866cc65904c2839">stbrp_context::free_head</a></div><div class="ttdeci">stbrp_node * free_head</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00181">stb_rect_pack.h:181</a></div></div> +<div class="ttc" id="astructstbrp__context_html_a4b61a7f94e50a54c075e2a8f99f6503a"><div class="ttname"><a href="structstbrp__context.html#a4b61a7f94e50a54c075e2a8f99f6503a">stbrp_context::heuristic</a></div><div class="ttdeci">int heuristic</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00178">stb_rect_pack.h:178</a></div></div> +<div class="ttc" id="astructstbrp__context_html_a70cfcb2044ce8397cc440d28b30c09b2"><div class="ttname"><a href="structstbrp__context.html#a70cfcb2044ce8397cc440d28b30c09b2">stbrp_context::width</a></div><div class="ttdeci">int width</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00174">stb_rect_pack.h:174</a></div></div> +<div class="ttc" id="astructstbrp__context_html_ae36053e2001a725aec2b5756dc990481"><div class="ttname"><a href="structstbrp__context.html#ae36053e2001a725aec2b5756dc990481">stbrp_context::align</a></div><div class="ttdeci">int align</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00176">stb_rect_pack.h:176</a></div></div> +<div class="ttc" id="astructstbrp__context_html_af3715a6f3faecfb4fac8f6ccbb71f9c7"><div class="ttname"><a href="structstbrp__context.html#af3715a6f3faecfb4fac8f6ccbb71f9c7">stbrp_context::height</a></div><div class="ttdeci">int height</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00175">stb_rect_pack.h:175</a></div></div> +<div class="ttc" id="astructstbrp__context_html_afa8105d4ef6d3e0ae5aaf8e1ed4b2c58"><div class="ttname"><a href="structstbrp__context.html#afa8105d4ef6d3e0ae5aaf8e1ed4b2c58">stbrp_context::num_nodes</a></div><div class="ttdeci">int num_nodes</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00179">stb_rect_pack.h:179</a></div></div> +<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#l00166">stb_rect_pack.h:167</a></div></div> +<div class="ttc" id="astructstbrp__node_html_a45ab31a88025db27d08040d715b129ea"><div class="ttname"><a href="structstbrp__node.html#a45ab31a88025db27d08040d715b129ea">stbrp_node::x</a></div><div class="ttdeci">stbrp_coord x</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00168">stb_rect_pack.h:168</a></div></div> +<div class="ttc" id="astructstbrp__node_html_a933cb2dd6cddc4fcaf10e3b40634bed4"><div class="ttname"><a href="structstbrp__node.html#a933cb2dd6cddc4fcaf10e3b40634bed4">stbrp_node::next</a></div><div class="ttdeci">stbrp_node * next</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00169">stb_rect_pack.h:169</a></div></div> +<div class="ttc" id="astructstbrp__node_html_ad0415cb102a4f37aa45073653307e67e"><div class="ttname"><a href="structstbrp__node.html#ad0415cb102a4f37aa45073653307e67e">stbrp_node::y</a></div><div class="ttdeci">stbrp_coord y</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00168">stb_rect_pack.h:168</a></div></div> +<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#l00106">stb_rect_pack.h:107</a></div></div> +<div class="ttc" id="astructstbrp__rect_html_a248d43f1eb979c1e7b92ba6df431dec5"><div class="ttname"><a href="structstbrp__rect.html#a248d43f1eb979c1e7b92ba6df431dec5">stbrp_rect::w</a></div><div class="ttdeci">stbrp_coord w</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00112">stb_rect_pack.h:112</a></div></div> +<div class="ttc" id="astructstbrp__rect_html_a4cc623a3e29f0bc0d3375f6645c84d18"><div class="ttname"><a href="structstbrp__rect.html#a4cc623a3e29f0bc0d3375f6645c84d18">stbrp_rect::x</a></div><div class="ttdeci">stbrp_coord x</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00115">stb_rect_pack.h:115</a></div></div> +<div class="ttc" id="astructstbrp__rect_html_a74ba347755ce17f2f8a2ea66c612af49"><div class="ttname"><a href="structstbrp__rect.html#a74ba347755ce17f2f8a2ea66c612af49">stbrp_rect::was_packed</a></div><div class="ttdeci">int was_packed</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00116">stb_rect_pack.h:116</a></div></div> +<div class="ttc" id="astructstbrp__rect_html_a92da8626bc99df041c0c3bfd01c25f7a"><div class="ttname"><a href="structstbrp__rect.html#a92da8626bc99df041c0c3bfd01c25f7a">stbrp_rect::id</a></div><div class="ttdeci">int id</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00109">stb_rect_pack.h:109</a></div></div> +<div class="ttc" id="astructstbrp__rect_html_ae3034c1fbf86043b568f5a4dddf946fa"><div class="ttname"><a href="structstbrp__rect.html#ae3034c1fbf86043b568f5a4dddf946fa">stbrp_rect::y</a></div><div class="ttdeci">stbrp_coord y</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00115">stb_rect_pack.h:115</a></div></div> +<div class="ttc" id="astructstbrp__rect_html_af68de2dadc7972b7c089d5e0c0558398"><div class="ttname"><a href="structstbrp__rect.html#af68de2dadc7972b7c089d5e0c0558398">stbrp_rect::h</a></div><div class="ttdeci">stbrp_coord h</div><div class="ttdef"><b>Definition:</b> <a href="stb__rect__pack_8h_source.html#l00112">stb_rect_pack.h:112</a></div></div> +</div><!-- fragment --></div><!-- contents --> +<!-- HTML footer for doxygen 1.8.9.1--> +<!-- start footer part --> +<hr class="footer"/><address class="footer"><small> +Generated by  <a href="http://www.doxygen.org/index.html"> +<img class="footer" src="doxygen.png" alt="doxygen"/> +</a> 1.9.1 +</small></address> +</body> +</html> |