250 lines
33 KiB
HTML
250 lines
33 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>libctru: include/3ds/util/rbtree.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">libctru
|
|
 <span id="projectnumber">v2.4.1</span>
|
|
</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_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_d475325f6a9fe3bfc3a495c72a9e475e.html">3ds</a></li><li class="navelem"><a class="el" href="dir_1b1aef9f2527d990c50369cf62d7d9a1.html">util</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">rbtree.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="rbtree_8h.html">Go to the documentation of this file.</a><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"> * @file rbtree.h</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * @brief Red-black trees.</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="preprocessor">#pragma once</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>  </div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include <stdint.h></span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include <stddef.h></span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/// Retrieves an rbtree item.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a9a8909ab0b221c0c11d983a1d8746cf4"> 11</a></span> <span class="comment"></span><span class="preprocessor">#define rbtree_item(ptr, type, member) \</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor"> ((type*)(((char*)ptr) - offsetof(type, member)))</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structrbtree.html">rbtree</a> rbtree_t; <span class="comment">///< rbtree type.</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structrbtree__node.html">rbtree_node</a> rbtree_node_t; <span class="comment">///< rbtree node type.</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189"> 17</a></span> <span class="keyword">typedef</span> void (*<a class="code" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a>)(rbtree_node_t *Node); <span class="comment">///< rbtree node destructor.</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644"> 18</a></span> <span class="keyword">typedef</span> int (*<a class="code" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a>)(<span class="keyword">const</span> rbtree_node_t *lhs,</div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  <span class="keyword">const</span> rbtree_node_t *rhs); <span class="comment">///< rbtree node comparator.</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="comment">/// An rbtree node.</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="structrbtree__node.html"> 22</a></span> <span class="comment"></span><span class="keyword">struct </span><a class="code" href="structrbtree__node.html">rbtree_node</a></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="structrbtree__node.html#a626427e7352bdd7ca3c06d2fad573fa4"> 24</a></span>  uintptr_t <a class="code" href="structrbtree__node.html#a626427e7352bdd7ca3c06d2fad573fa4">parent_color</a>; <span class="comment">///< Parent color.</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="structrbtree__node.html#ac603d72a1e80ba3f3c5f27b63d3ff3f4"> 25</a></span>  rbtree_node_t *<a class="code" href="structrbtree__node.html#ac603d72a1e80ba3f3c5f27b63d3ff3f4">child</a>[2]; <span class="comment">///< Node children.</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> };</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">/// An rbtree.</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="structrbtree.html"> 29</a></span> <span class="comment"></span><span class="keyword">struct </span><a class="code" href="structrbtree.html">rbtree</a></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="structrbtree.html#afab999c0a76782781201a5bd01630715"> 31</a></span>  rbtree_node_t *<a class="code" href="structrbtree.html#afab999c0a76782781201a5bd01630715">root</a>; <span class="comment">///< Root node.</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="structrbtree.html#a8163cce8ee63d9e72fa4d727675d44ed"> 32</a></span>  <a class="code" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a> <a class="code" href="structrbtree.html#a8163cce8ee63d9e72fa4d727675d44ed">comparator</a>; <span class="comment">///< Node comparator.</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structrbtree.html#a5d2513a0bf879fbd38a0f96cc36c256f"> 33</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structrbtree.html#a5d2513a0bf879fbd38a0f96cc36c256f">size</a>; <span class="comment">///< Size.</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> };</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#ifdef __cplusplus</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * @brief Initializes an rbtree.</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * @param comparator Comparator to use.</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">void</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a333d73fc305d74c1751ac89f891f7ee5"> 46</a></span> <a class="code" href="rbtree_8h.html#a333d73fc305d74c1751ac89f891f7ee5">rbtree_init</a>(rbtree_t *tree,</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="code" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a> comparator);</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">/**</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * @brief Gets whether an rbtree is empty</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * @return A non-zero value if the tree is not empty.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keywordtype">int</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="rbtree_8h.html#adc5b8f32353f0452993aca76ae950098"> 55</a></span> <a class="code" href="rbtree_8h.html#adc5b8f32353f0452993aca76ae950098">rbtree_empty</a>(<span class="keyword">const</span> rbtree_t *tree);</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * @brief Gets the size of an rbtree.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keywordtype">size_t</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a635c19a896c3c43bd47929fb486a388f"> 62</a></span> <a class="code" href="rbtree_8h.html#a635c19a896c3c43bd47929fb486a388f">rbtree_size</a>(<span class="keyword">const</span> rbtree_t *tree);</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * @brief Inserts a node into an rbtree.</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * @param node Pointer to the node.</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * @return The inserted node.</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a797a3e1c8507a7c7b4e051d3f1349154"> 70</a></span> <a class="code" href="rbtree_8h.html#a797a3e1c8507a7c7b4e051d3f1349154">__attribute__</a>((warn_unused_result))</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> rbtree_insert(rbtree_t *tree,</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  rbtree_node_t *node);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @brief Inserts multiple nodes into an rbtree.</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * @param node Pointer to the nodes.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="keywordtype">void</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a5b5c543392277b07bc2dec7b1f383140"> 81</a></span> <a class="code" href="rbtree_8h.html#a5b5c543392277b07bc2dec7b1f383140">rbtree_insert_multi</a>(rbtree_t *tree,</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  rbtree_node_t *node);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * @brief Finds a node within an rbtree.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * @param node Pointer to the node.</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * @return The located node.</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="rbtree_8h.html#aa6573b2014ed4440df29d96ecc0e7592"> 91</a></span> <a class="code" href="rbtree_8h.html#aa6573b2014ed4440df29d96ecc0e7592">rbtree_find</a>(<span class="keyword">const</span> rbtree_t *tree,</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> rbtree_node_t *node);</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * @brief Gets the minimum node of an rbtree.</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * @return The minimum node.</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a96f0e838aff7f1cdac2f09804be44aa8"> 100</a></span> <a class="code" href="rbtree_8h.html#a96f0e838aff7f1cdac2f09804be44aa8">rbtree_min</a>(<span class="keyword">const</span> rbtree_t *tree);</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"></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"> * @brief Gets the maximum node of an rbtree.</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> * @return The maximum node.</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a9ecb580c8eb4e5c4c5c3c10766efe18c"> 108</a></span> <a class="code" href="rbtree_8h.html#a9ecb580c8eb4e5c4c5c3c10766efe18c">rbtree_max</a>(<span class="keyword">const</span> rbtree_t *tree);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * @brief Gets the next node from an rbtree node.</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * @param node Pointer to the node.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * @return The next node.</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="rbtree_8h.html#ae9774dcf5094b21c929defded278b5cc"> 116</a></span> <a class="code" href="rbtree_8h.html#ae9774dcf5094b21c929defded278b5cc">rbtree_node_next</a>(<span class="keyword">const</span> rbtree_node_t *node);</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> * @brief Gets the previous node from an rbtree node.</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> * @param node Pointer to the node.</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> * @return The previous node.</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="rbtree_8h.html#a55b41ea5178a00916c2c293743ea3c7c"> 124</a></span> <a class="code" href="rbtree_8h.html#a55b41ea5178a00916c2c293743ea3c7c">rbtree_node_prev</a>(<span class="keyword">const</span> rbtree_node_t *node);</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">/**</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> * @brief Removes a node from an rbtree.</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> * @param node Pointer to the node.</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> * @param destructor Destructor to use when removing the node.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> * @return The removed node.</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> rbtree_node_t*</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="rbtree_8h.html#aa85861ccd33a4e920aeb9f4cd3475e6f"> 134</a></span> <a class="code" href="rbtree_8h.html#aa85861ccd33a4e920aeb9f4cd3475e6f">rbtree_remove</a>(rbtree_t *tree,</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  rbtree_node_t *node,</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a> destructor);</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"></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"> * @brief Clears an rbtree.</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> * @param tree Pointer to the tree.</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> * @param destructor Destructor to use when clearing the tree's nodes.</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="keywordtype">void</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="rbtree_8h.html#ad01c203394956d0d8d80806a0bba97ce"> 144</a></span> <a class="code" href="rbtree_8h.html#ad01c203394956d0d8d80806a0bba97ce">rbtree_clear</a>(rbtree_t *tree,</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="code" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a> destructor);</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> <span class="preprocessor">#ifdef __cplusplus</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> }</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="ttc" id="arbtree_8h_html_a32532a9ceeff76fef73c59c66c666189"><div class="ttname"><a href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a></div><div class="ttdeci">void(* rbtree_node_destructor_t)(rbtree_node_t *Node)</div><div class="ttdoc">rbtree node destructor.</div><div class="ttdef"><b>Definition:</b> rbtree.h:17</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a333d73fc305d74c1751ac89f891f7ee5"><div class="ttname"><a href="rbtree_8h.html#a333d73fc305d74c1751ac89f891f7ee5">rbtree_init</a></div><div class="ttdeci">void rbtree_init(rbtree_t *tree, rbtree_node_comparator_t comparator)</div><div class="ttdoc">Initializes an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a55b41ea5178a00916c2c293743ea3c7c"><div class="ttname"><a href="rbtree_8h.html#a55b41ea5178a00916c2c293743ea3c7c">rbtree_node_prev</a></div><div class="ttdeci">rbtree_node_t * rbtree_node_prev(const rbtree_node_t *node)</div><div class="ttdoc">Gets the previous node from an rbtree node.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a5b5c543392277b07bc2dec7b1f383140"><div class="ttname"><a href="rbtree_8h.html#a5b5c543392277b07bc2dec7b1f383140">rbtree_insert_multi</a></div><div class="ttdeci">void rbtree_insert_multi(rbtree_t *tree, rbtree_node_t *node)</div><div class="ttdoc">Inserts multiple nodes into an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a635c19a896c3c43bd47929fb486a388f"><div class="ttname"><a href="rbtree_8h.html#a635c19a896c3c43bd47929fb486a388f">rbtree_size</a></div><div class="ttdeci">size_t rbtree_size(const rbtree_t *tree)</div><div class="ttdoc">Gets the size of an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a797a3e1c8507a7c7b4e051d3f1349154"><div class="ttname"><a href="rbtree_8h.html#a797a3e1c8507a7c7b4e051d3f1349154">__attribute__</a></div><div class="ttdeci">__attribute__((warn_unused_result)) rbtree_node_t *rbtree_insert(rbtree_t *tree</div><div class="ttdoc">Inserts a node into an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a96f0e838aff7f1cdac2f09804be44aa8"><div class="ttname"><a href="rbtree_8h.html#a96f0e838aff7f1cdac2f09804be44aa8">rbtree_min</a></div><div class="ttdeci">rbtree_node_t * rbtree_min(const rbtree_t *tree)</div><div class="ttdoc">Gets the minimum node of an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_a9ecb580c8eb4e5c4c5c3c10766efe18c"><div class="ttname"><a href="rbtree_8h.html#a9ecb580c8eb4e5c4c5c3c10766efe18c">rbtree_max</a></div><div class="ttdeci">rbtree_node_t * rbtree_max(const rbtree_t *tree)</div><div class="ttdoc">Gets the maximum node of an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_aa6573b2014ed4440df29d96ecc0e7592"><div class="ttname"><a href="rbtree_8h.html#aa6573b2014ed4440df29d96ecc0e7592">rbtree_find</a></div><div class="ttdeci">rbtree_node_t * rbtree_find(const rbtree_t *tree, const rbtree_node_t *node)</div><div class="ttdoc">Finds a node within an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_aa85861ccd33a4e920aeb9f4cd3475e6f"><div class="ttname"><a href="rbtree_8h.html#aa85861ccd33a4e920aeb9f4cd3475e6f">rbtree_remove</a></div><div class="ttdeci">rbtree_node_t * rbtree_remove(rbtree_t *tree, rbtree_node_t *node, rbtree_node_destructor_t destructor)</div><div class="ttdoc">Removes a node from an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_ad01c203394956d0d8d80806a0bba97ce"><div class="ttname"><a href="rbtree_8h.html#ad01c203394956d0d8d80806a0bba97ce">rbtree_clear</a></div><div class="ttdeci">void rbtree_clear(rbtree_t *tree, rbtree_node_destructor_t destructor)</div><div class="ttdoc">Clears an rbtree.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_adc5b8f32353f0452993aca76ae950098"><div class="ttname"><a href="rbtree_8h.html#adc5b8f32353f0452993aca76ae950098">rbtree_empty</a></div><div class="ttdeci">int rbtree_empty(const rbtree_t *tree)</div><div class="ttdoc">Gets whether an rbtree is empty.</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_ae05f4152c5dc8cc92b62d22f3b21a644"><div class="ttname"><a href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a></div><div class="ttdeci">int(* rbtree_node_comparator_t)(const rbtree_node_t *lhs, const rbtree_node_t *rhs)</div><div class="ttdoc">rbtree node comparator.</div><div class="ttdef"><b>Definition:</b> rbtree.h:18</div></div>
|
|
<div class="ttc" id="arbtree_8h_html_ae9774dcf5094b21c929defded278b5cc"><div class="ttname"><a href="rbtree_8h.html#ae9774dcf5094b21c929defded278b5cc">rbtree_node_next</a></div><div class="ttdeci">rbtree_node_t * rbtree_node_next(const rbtree_node_t *node)</div><div class="ttdoc">Gets the next node from an rbtree node.</div></div>
|
|
<div class="ttc" id="astructrbtree__node_html"><div class="ttname"><a href="structrbtree__node.html">rbtree_node</a></div><div class="ttdoc">An rbtree node.</div><div class="ttdef"><b>Definition:</b> rbtree.h:23</div></div>
|
|
<div class="ttc" id="astructrbtree__node_html_a626427e7352bdd7ca3c06d2fad573fa4"><div class="ttname"><a href="structrbtree__node.html#a626427e7352bdd7ca3c06d2fad573fa4">rbtree_node::parent_color</a></div><div class="ttdeci">uintptr_t parent_color</div><div class="ttdoc">Parent color.</div><div class="ttdef"><b>Definition:</b> rbtree.h:24</div></div>
|
|
<div class="ttc" id="astructrbtree__node_html_ac603d72a1e80ba3f3c5f27b63d3ff3f4"><div class="ttname"><a href="structrbtree__node.html#ac603d72a1e80ba3f3c5f27b63d3ff3f4">rbtree_node::child</a></div><div class="ttdeci">rbtree_node_t * child[2]</div><div class="ttdoc">Node children.</div><div class="ttdef"><b>Definition:</b> rbtree.h:25</div></div>
|
|
<div class="ttc" id="astructrbtree_html"><div class="ttname"><a href="structrbtree.html">rbtree</a></div><div class="ttdoc">An rbtree.</div><div class="ttdef"><b>Definition:</b> rbtree.h:30</div></div>
|
|
<div class="ttc" id="astructrbtree_html_a5d2513a0bf879fbd38a0f96cc36c256f"><div class="ttname"><a href="structrbtree.html#a5d2513a0bf879fbd38a0f96cc36c256f">rbtree::size</a></div><div class="ttdeci">size_t size</div><div class="ttdoc">Size.</div><div class="ttdef"><b>Definition:</b> rbtree.h:33</div></div>
|
|
<div class="ttc" id="astructrbtree_html_a8163cce8ee63d9e72fa4d727675d44ed"><div class="ttname"><a href="structrbtree.html#a8163cce8ee63d9e72fa4d727675d44ed">rbtree::comparator</a></div><div class="ttdeci">rbtree_node_comparator_t comparator</div><div class="ttdoc">Node comparator.</div><div class="ttdef"><b>Definition:</b> rbtree.h:32</div></div>
|
|
<div class="ttc" id="astructrbtree_html_afab999c0a76782781201a5bd01630715"><div class="ttname"><a href="structrbtree.html#afab999c0a76782781201a5bd01630715">rbtree::root</a></div><div class="ttdeci">rbtree_node_t * root</div><div class="ttdoc">Root node.</div><div class="ttdef"><b>Definition:</b> rbtree.h:31</div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1
|
|
</small></address>
|
|
</body>
|
|
</html>
|