-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_random_binary_tree_8h_source.html
83 lines (83 loc) · 29.8 KB
/
_random_binary_tree_8h_source.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Gamedev Framework (gf): RandomBinaryTree.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>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script><script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="custom.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="gf_logo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Gamedev Framework (gf)
 <span id="projectnumber">0.15.0</span>
</div>
<div id="projectbrief">A C++14 framework for 2D games</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',false,false,'search.php','Search');
});
</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_6d069d519ae9d12fa11dd8e685586b60.html">gf</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">RandomBinaryTree.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Gamedev Framework (gf)</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Copyright (C) 2016-2019 Julien Bernard</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * This software is provided 'as-is', without any express or implied</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * warranty. In no event will the authors be held liable for any damages</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * arising from the use of this software.</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> *</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * Permission is granted to anyone to use this software for any purpose,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * including commercial applications, and to alter it and redistribute it</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * freely, subject to the following restrictions:</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"> * 1. The origin of this software must not be misrepresented; you must not</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * claim that you wrote the original software. If you use this software</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * in a product, an acknowledgment in the product documentation would be</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * appreciated but is not required.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * 2. Altered source versions must be plainly marked as such, and must not be</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * misrepresented as being the original software.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * 3. This notice may not be removed or altered from any source distribution.</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> */</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#ifndef GF_RANDOM_BINARY_TREE_H</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#define GF_RANDOM_BINARY_TREE_H</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "Portability.h"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "Random.h"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "Rect.h"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "Vector.h"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span><a class="code" href="namespacegf.html">gf</a> {</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef DOXYGEN_SHOULD_SKIP_THIS</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">inline</span> <span class="keyword">namespace </span>v1 {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree.html"> 41</a></span>  <span class="keyword">class </span>GF_API <a class="code" href="classgf_1_1_random_binary_tree.html">RandomBinaryTree</a> {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html"> 47</a></span>  <span class="keyword">class </span><a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a> {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#ae642870f1b2b707be13e5286667d6246"> 56</a></span>  <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#ae642870f1b2b707be13e5286667d6246">Node</a>(<span class="keyword">const</span> <a class="code" href="structgf_1_1_rect.html">RectI</a>& area, std::size_t parent, <span class="keywordtype">int</span> level)</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  : m_parent(parent)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  , m_left(0)</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  , m_right(0)</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  , m_level(level)</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  , m_area(area)</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  {</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#a0d2efc143bad72aa10b6d41eb4fc1698"> 73</a></span>  <span class="keywordtype">int</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#a0d2efc143bad72aa10b6d41eb4fc1698">getLevel</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> m_level;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#aa1155a68f21438d4d6574626f36da5d8"> 84</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#aa1155a68f21438d4d6574626f36da5d8">isLeaf</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> m_left == 0 && m_right == 0;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#a67506cde1ac29a53d3fcb18f0a31d2cf"> 95</a></span>  std::size_t <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#a67506cde1ac29a53d3fcb18f0a31d2cf">getParentIndex</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">return</span> m_parent;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#ab477f95824533d62f816690fc0f2865f"> 104</a></span>  std::size_t <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#ab477f95824533d62f816690fc0f2865f">getLeftChildIndex</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> m_left;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#aa3e6fcddba7161a459f843c5dbed41bf"> 113</a></span>  std::size_t <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#aa3e6fcddba7161a459f843c5dbed41bf">getRightChildIndex</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> m_right;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#ac9f42c84ec2c5a5728027fdb0fe1761c"> 122</a></span>  <span class="keyword">const</span> <a class="code" href="structgf_1_1_rect.html">RectI</a>& <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#ac9f42c84ec2c5a5728027fdb0fe1761c">getArea</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">return</span> m_area;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#a20826fe5d75683e940ba4364e75e8aa6"> 131</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#a20826fe5d75683e940ba4364e75e8aa6">contains</a>(<a class="code" href="structgf_1_1_vector.html">Vector2i</a> position)<span class="keyword"> const </span>{</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> m_area.contains(position);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree_1_1_node.html#acd5df37463d58958fa586a1aa1a70272"> 141</a></span>  <span class="keywordtype">void</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html#acd5df37463d58958fa586a1aa1a70272">setChildrenIndices</a>(std::size_t left, std::size_t right) {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  m_left = left;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  m_right = right;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  std::size_t m_parent;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  std::size_t m_left;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  std::size_t m_right;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">int</span> m_level;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="structgf_1_1_rect.html">RectI</a> m_area;</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> </div><div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db"> 160</a></span>  <span class="keyword">using</span> <a class="code" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">Callback</a> = std::function<bool(const RandomBinaryTree&, const Node&)>;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="classgf_1_1_random_binary_tree.html">RandomBinaryTree</a>(<span class="keyword">const</span> <a class="code" href="structgf_1_1_rect.html">RectI</a>& area);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">void</span> create(<a class="code" href="classgf_1_1_random.html">Random</a>& random, <span class="keywordtype">int</span> levelMax, <a class="code" href="structgf_1_1_vector.html">Vector2i</a> minSize, <a class="code" href="structgf_1_1_vector.html">Vector2i</a> maxSize, <span class="keywordtype">float</span> maxRatio = 1.5f);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& getRoot() <span class="keyword">const</span>;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& getLeftChild(<span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& node) <span class="keyword">const</span>;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& getRightChild(<span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& node) <span class="keyword">const</span>;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& getParent(<span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& node) <span class="keyword">const</span>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00217"></a><span class="lineno"><a class="line" href="classgf_1_1_random_binary_tree.html#ade28cce4b901a6491079843c4ac41b65"> 217</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classgf_1_1_random_binary_tree.html#ade28cce4b901a6491079843c4ac41b65">contains</a>(<a class="code" href="structgf_1_1_vector.html">Vector2i</a> position)<span class="keyword"> const </span>{</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">return</span> getRoot().contains(position);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">const</span> <a class="code" href="classgf_1_1_random_binary_tree_1_1_node.html">Node</a>& find(<a class="code" href="structgf_1_1_vector.html">Vector2i</a> position) <span class="keyword">const</span>;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordtype">bool</span> traversePreOrder(<a class="code" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">Callback</a> callback) <span class="keyword">const</span>;</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordtype">bool</span> traverseInOrder(<a class="code" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">Callback</a> callback) <span class="keyword">const</span>;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordtype">bool</span> traversePostOrder(<a class="code" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">Callback</a> callback) <span class="keyword">const</span>;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">bool</span> traverseLevelOrder(<a class="code" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">Callback</a> callback) <span class="keyword">const</span>;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordtype">bool</span> traverseInvertedLevelOrder(<a class="code" href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">Callback</a> callback) <span class="keyword">const</span>;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  std::vector<Node> m_nodes;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  };</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="preprocessor">#ifndef DOXYGEN_SHOULD_SKIP_THIS</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> }</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> }</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> <span class="preprocessor">#endif // GF_RANDOM_BINARY_TREE_H</span></div><div class="ttc" id="classgf_1_1_random_html"><div class="ttname"><a href="classgf_1_1_random.html">gf::Random</a></div><div class="ttdoc">A random engine. </div><div class="ttdef"><b>Definition:</b> Random.h:46</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_html"><div class="ttname"><a href="classgf_1_1_random_binary_tree.html">gf::RandomBinaryTree</a></div><div class="ttdoc">A random binary space partionning tree. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:41</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_a0d2efc143bad72aa10b6d41eb4fc1698"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#a0d2efc143bad72aa10b6d41eb4fc1698">gf::RandomBinaryTree::Node::getLevel</a></div><div class="ttdeci">int getLevel() const</div><div class="ttdoc">Get the level of the node in the tree. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:73</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_a20826fe5d75683e940ba4364e75e8aa6"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#a20826fe5d75683e940ba4364e75e8aa6">gf::RandomBinaryTree::Node::contains</a></div><div class="ttdeci">bool contains(Vector2i position) const</div><div class="ttdoc">Check if the area of the node contains a position. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:131</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_ab477f95824533d62f816690fc0f2865f"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#ab477f95824533d62f816690fc0f2865f">gf::RandomBinaryTree::Node::getLeftChildIndex</a></div><div class="ttdeci">std::size_t getLeftChildIndex() const</div><div class="ttdoc">Get the left child&#39;s index. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:104</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_html_a5c211f995ce273fb4b9788cead1a29db"><div class="ttname"><a href="classgf_1_1_random_binary_tree.html#a5c211f995ce273fb4b9788cead1a29db">gf::RandomBinaryTree::Callback</a></div><div class="ttdeci">std::function< bool(const RandomBinaryTree &, const Node &)> Callback</div><div class="ttdoc">A callback function for traversing the tree. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:160</div></div>
<div class="ttc" id="structgf_1_1_rect_html"><div class="ttname"><a href="structgf_1_1_rect.html">gf::Rect< int ></a></div></div>
<div class="ttc" id="namespacegf_html"><div class="ttname"><a href="namespacegf.html">gf</a></div><div class="ttdoc">The namespace for gf classes. </div><div class="ttdef"><b>Definition:</b> Action.h:35</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_html_ade28cce4b901a6491079843c4ac41b65"><div class="ttname"><a href="classgf_1_1_random_binary_tree.html#ade28cce4b901a6491079843c4ac41b65">gf::RandomBinaryTree::contains</a></div><div class="ttdeci">bool contains(Vector2i position) const</div><div class="ttdoc">Check if the tree contains a position. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:217</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_aa1155a68f21438d4d6574626f36da5d8"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#aa1155a68f21438d4d6574626f36da5d8">gf::RandomBinaryTree::Node::isLeaf</a></div><div class="ttdeci">bool isLeaf() const</div><div class="ttdoc">Check if a node is a leaf. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:84</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html">gf::RandomBinaryTree::Node</a></div><div class="ttdoc">A node of the random binary space partionning tree. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:47</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_a67506cde1ac29a53d3fcb18f0a31d2cf"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#a67506cde1ac29a53d3fcb18f0a31d2cf">gf::RandomBinaryTree::Node::getParentIndex</a></div><div class="ttdeci">std::size_t getParentIndex() const</div><div class="ttdoc">Get the parent&#39;s indes of the node. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:95</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_acd5df37463d58958fa586a1aa1a70272"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#acd5df37463d58958fa586a1aa1a70272">gf::RandomBinaryTree::Node::setChildrenIndices</a></div><div class="ttdeci">void setChildrenIndices(std::size_t left, std::size_t right)</div><div class="ttdoc">Set the children indices of the node. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:141</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_aa3e6fcddba7161a459f843c5dbed41bf"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#aa3e6fcddba7161a459f843c5dbed41bf">gf::RandomBinaryTree::Node::getRightChildIndex</a></div><div class="ttdeci">std::size_t getRightChildIndex() const</div><div class="ttdoc">Get the right child&#39;s index. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:113</div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_ae642870f1b2b707be13e5286667d6246"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#ae642870f1b2b707be13e5286667d6246">gf::RandomBinaryTree::Node::Node</a></div><div class="ttdeci">Node(const RectI &area, std::size_t parent, int level)</div><div class="ttdoc">Constructor. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:56</div></div>
<div class="ttc" id="structgf_1_1_vector_html"><div class="ttname"><a href="structgf_1_1_vector.html">gf::Vector< int, 2 ></a></div></div>
<div class="ttc" id="classgf_1_1_random_binary_tree_1_1_node_html_ac9f42c84ec2c5a5728027fdb0fe1761c"><div class="ttname"><a href="classgf_1_1_random_binary_tree_1_1_node.html#ac9f42c84ec2c5a5728027fdb0fe1761c">gf::RandomBinaryTree::Node::getArea</a></div><div class="ttdeci">const RectI & getArea() const</div><div class="ttdoc">Get the area of the node. </div><div class="ttdef"><b>Definition:</b> RandomBinaryTree.h:122</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- 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.8.13
</small></address>
</body>
</html>