DevKit7/libctru
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
gh-pages
libctru/rbtree_8h.html
WinterMute e52f3175e1 Deploying to gh-pages from @ 8cbcce773b 🚀
2024-11-03 20:36:34 +00:00

554 lines
28 KiB
HTML
Raw Permalink Blame History

<!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 File Reference</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
&#160;<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&amp;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&amp;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="summary">
<a href="#nested-classes">Data Structures</a> &#124;
<a href="#define-members">Macros</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<div class="headertitle">
<div class="title">rbtree.h File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Red-black trees.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdint.h&gt;</code><br />
<code>#include &lt;stddef.h&gt;</code><br />
</div>
<p><a href="rbtree_8h_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Data Structures</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structrbtree__node.html">rbtree_node_t</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">An rbtree node. <a href="structrbtree__node.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structrbtree.html">rbtree_t</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">An rbtree. <a href="structrbtree.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a9a8909ab0b221c0c11d983a1d8746cf4"><td class="memItemLeft" align="right" valign="top"><a id="a9a8909ab0b221c0c11d983a1d8746cf4"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a9a8909ab0b221c0c11d983a1d8746cf4">rbtree_item</a>(ptr, type, member)&#160;&#160;&#160; ((type*)(((char*)ptr) - offsetof(type, member)))</td></tr>
<tr class="memdesc:a9a8909ab0b221c0c11d983a1d8746cf4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Retrieves an rbtree item. <br /></td></tr>
<tr class="separator:a9a8909ab0b221c0c11d983a1d8746cf4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a32532a9ceeff76fef73c59c66c666189"><td class="memItemLeft" align="right" valign="top"><a id="a32532a9ceeff76fef73c59c66c666189"></a>
typedef void(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a>) (rbtree_node_t *Node)</td></tr>
<tr class="memdesc:a32532a9ceeff76fef73c59c66c666189"><td class="mdescLeft">&#160;</td><td class="mdescRight">rbtree node destructor. <br /></td></tr>
<tr class="separator:a32532a9ceeff76fef73c59c66c666189"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae05f4152c5dc8cc92b62d22f3b21a644"><td class="memItemLeft" align="right" valign="top"><a id="ae05f4152c5dc8cc92b62d22f3b21a644"></a>
typedef int(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a>) (const rbtree_node_t *lhs, const rbtree_node_t *rhs)</td></tr>
<tr class="memdesc:ae05f4152c5dc8cc92b62d22f3b21a644"><td class="mdescLeft">&#160;</td><td class="mdescRight">rbtree node comparator. <br /></td></tr>
<tr class="separator:ae05f4152c5dc8cc92b62d22f3b21a644"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a333d73fc305d74c1751ac89f891f7ee5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a333d73fc305d74c1751ac89f891f7ee5">rbtree_init</a> (rbtree_t *tree, <a class="el" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a> comparator)</td></tr>
<tr class="memdesc:a333d73fc305d74c1751ac89f891f7ee5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes an rbtree. <a href="rbtree_8h.html#a333d73fc305d74c1751ac89f891f7ee5">More...</a><br /></td></tr>
<tr class="separator:a333d73fc305d74c1751ac89f891f7ee5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adc5b8f32353f0452993aca76ae950098"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#adc5b8f32353f0452993aca76ae950098">rbtree_empty</a> (const rbtree_t *tree)</td></tr>
<tr class="memdesc:adc5b8f32353f0452993aca76ae950098"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets whether an rbtree is empty. <a href="rbtree_8h.html#adc5b8f32353f0452993aca76ae950098">More...</a><br /></td></tr>
<tr class="separator:adc5b8f32353f0452993aca76ae950098"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a635c19a896c3c43bd47929fb486a388f"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a635c19a896c3c43bd47929fb486a388f">rbtree_size</a> (const rbtree_t *tree)</td></tr>
<tr class="memdesc:a635c19a896c3c43bd47929fb486a388f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the size of an rbtree. <a href="rbtree_8h.html#a635c19a896c3c43bd47929fb486a388f">More...</a><br /></td></tr>
<tr class="separator:a635c19a896c3c43bd47929fb486a388f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a797a3e1c8507a7c7b4e051d3f1349154"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a797a3e1c8507a7c7b4e051d3f1349154">__attribute__</a> ((warn_unused_result)) rbtree_node_t *rbtree_insert(rbtree_t *tree</td></tr>
<tr class="memdesc:a797a3e1c8507a7c7b4e051d3f1349154"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts a node into an rbtree. <a href="rbtree_8h.html#a797a3e1c8507a7c7b4e051d3f1349154">More...</a><br /></td></tr>
<tr class="separator:a797a3e1c8507a7c7b4e051d3f1349154"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5b5c543392277b07bc2dec7b1f383140"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a5b5c543392277b07bc2dec7b1f383140">rbtree_insert_multi</a> (rbtree_t *tree, rbtree_node_t *node)</td></tr>
<tr class="memdesc:a5b5c543392277b07bc2dec7b1f383140"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts multiple nodes into an rbtree. <a href="rbtree_8h.html#a5b5c543392277b07bc2dec7b1f383140">More...</a><br /></td></tr>
<tr class="separator:a5b5c543392277b07bc2dec7b1f383140"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa6573b2014ed4440df29d96ecc0e7592"><td class="memItemLeft" align="right" valign="top">rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#aa6573b2014ed4440df29d96ecc0e7592">rbtree_find</a> (const rbtree_t *tree, const rbtree_node_t *node)</td></tr>
<tr class="memdesc:aa6573b2014ed4440df29d96ecc0e7592"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds a node within an rbtree. <a href="rbtree_8h.html#aa6573b2014ed4440df29d96ecc0e7592">More...</a><br /></td></tr>
<tr class="separator:aa6573b2014ed4440df29d96ecc0e7592"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a96f0e838aff7f1cdac2f09804be44aa8"><td class="memItemLeft" align="right" valign="top">rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a96f0e838aff7f1cdac2f09804be44aa8">rbtree_min</a> (const rbtree_t *tree)</td></tr>
<tr class="memdesc:a96f0e838aff7f1cdac2f09804be44aa8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the minimum node of an rbtree. <a href="rbtree_8h.html#a96f0e838aff7f1cdac2f09804be44aa8">More...</a><br /></td></tr>
<tr class="separator:a96f0e838aff7f1cdac2f09804be44aa8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9ecb580c8eb4e5c4c5c3c10766efe18c"><td class="memItemLeft" align="right" valign="top">rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a9ecb580c8eb4e5c4c5c3c10766efe18c">rbtree_max</a> (const rbtree_t *tree)</td></tr>
<tr class="memdesc:a9ecb580c8eb4e5c4c5c3c10766efe18c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum node of an rbtree. <a href="rbtree_8h.html#a9ecb580c8eb4e5c4c5c3c10766efe18c">More...</a><br /></td></tr>
<tr class="separator:a9ecb580c8eb4e5c4c5c3c10766efe18c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae9774dcf5094b21c929defded278b5cc"><td class="memItemLeft" align="right" valign="top">rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#ae9774dcf5094b21c929defded278b5cc">rbtree_node_next</a> (const rbtree_node_t *node)</td></tr>
<tr class="memdesc:ae9774dcf5094b21c929defded278b5cc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the next node from an rbtree node. <a href="rbtree_8h.html#ae9774dcf5094b21c929defded278b5cc">More...</a><br /></td></tr>
<tr class="separator:ae9774dcf5094b21c929defded278b5cc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a55b41ea5178a00916c2c293743ea3c7c"><td class="memItemLeft" align="right" valign="top">rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#a55b41ea5178a00916c2c293743ea3c7c">rbtree_node_prev</a> (const rbtree_node_t *node)</td></tr>
<tr class="memdesc:a55b41ea5178a00916c2c293743ea3c7c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the previous node from an rbtree node. <a href="rbtree_8h.html#a55b41ea5178a00916c2c293743ea3c7c">More...</a><br /></td></tr>
<tr class="separator:a55b41ea5178a00916c2c293743ea3c7c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa85861ccd33a4e920aeb9f4cd3475e6f"><td class="memItemLeft" align="right" valign="top">rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#aa85861ccd33a4e920aeb9f4cd3475e6f">rbtree_remove</a> (rbtree_t *tree, rbtree_node_t *node, <a class="el" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a> destructor)</td></tr>
<tr class="memdesc:aa85861ccd33a4e920aeb9f4cd3475e6f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Removes a node from an rbtree. <a href="rbtree_8h.html#aa85861ccd33a4e920aeb9f4cd3475e6f">More...</a><br /></td></tr>
<tr class="separator:aa85861ccd33a4e920aeb9f4cd3475e6f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad01c203394956d0d8d80806a0bba97ce"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="rbtree_8h.html#ad01c203394956d0d8d80806a0bba97ce">rbtree_clear</a> (rbtree_t *tree, <a class="el" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a> destructor)</td></tr>
<tr class="memdesc:ad01c203394956d0d8d80806a0bba97ce"><td class="mdescLeft">&#160;</td><td class="mdescRight">Clears an rbtree. <a href="rbtree_8h.html#ad01c203394956d0d8d80806a0bba97ce">More...</a><br /></td></tr>
<tr class="separator:ad01c203394956d0d8d80806a0bba97ce"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:ab55c00f2db9e9248d1009af67908d21f"><td class="memItemLeft" align="right" valign="top"><a id="ab55c00f2db9e9248d1009af67908d21f"></a>
rbtree_node_t *&#160;</td><td class="memItemRight" valign="bottom"><b>node</b></td></tr>
<tr class="separator:ab55c00f2db9e9248d1009af67908d21f"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Red-black trees. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a797a3e1c8507a7c7b4e051d3f1349154"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a797a3e1c8507a7c7b4e051d3f1349154">&#9670;&nbsp;</a></span>__attribute__()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">__attribute__ </td>
<td>(</td>
<td class="paramtype">(warn_unused_result)&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts a node into an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
<tr><td class="paramname">node</td><td>Pointer to the node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The inserted node. </dd></dl>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="network_2sockets_2source_2sockets_8c-example.html#a0">network/sockets/source/sockets.c</a>.</dd>
</dl>
</div>
</div>
<a id="ad01c203394956d0d8d80806a0bba97ce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad01c203394956d0d8d80806a0bba97ce">&#9670;&nbsp;</a></span>rbtree_clear()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void rbtree_clear </td>
<td>(</td>
<td class="paramtype">rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a>&#160;</td>
<td class="paramname"><em>destructor</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Clears an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
<tr><td class="paramname">destructor</td><td>Destructor to use when clearing the tree's nodes. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="adc5b8f32353f0452993aca76ae950098"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adc5b8f32353f0452993aca76ae950098">&#9670;&nbsp;</a></span>rbtree_empty()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int rbtree_empty </td>
<td>(</td>
<td class="paramtype">const rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets whether an rbtree is empty. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A non-zero value if the tree is not empty. </dd></dl>
</div>
</div>
<a id="aa6573b2014ed4440df29d96ecc0e7592"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa6573b2014ed4440df29d96ecc0e7592">&#9670;&nbsp;</a></span>rbtree_find()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">rbtree_node_t* rbtree_find </td>
<td>(</td>
<td class="paramtype">const rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const rbtree_node_t *&#160;</td>
<td class="paramname"><em>node</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds a node within an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
<tr><td class="paramname">node</td><td>Pointer to the node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The located node. </dd></dl>
</div>
</div>
<a id="a333d73fc305d74c1751ac89f891f7ee5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a333d73fc305d74c1751ac89f891f7ee5">&#9670;&nbsp;</a></span>rbtree_init()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void rbtree_init </td>
<td>(</td>
<td class="paramtype">rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="rbtree_8h.html#ae05f4152c5dc8cc92b62d22f3b21a644">rbtree_node_comparator_t</a>&#160;</td>
<td class="paramname"><em>comparator</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Initializes an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
<tr><td class="paramname">comparator</td><td>Comparator to use. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a5b5c543392277b07bc2dec7b1f383140"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5b5c543392277b07bc2dec7b1f383140">&#9670;&nbsp;</a></span>rbtree_insert_multi()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void rbtree_insert_multi </td>
<td>(</td>
<td class="paramtype">rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">rbtree_node_t *&#160;</td>
<td class="paramname"><em>node</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts multiple nodes into an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
<tr><td class="paramname">node</td><td>Pointer to the nodes. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a9ecb580c8eb4e5c4c5c3c10766efe18c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9ecb580c8eb4e5c4c5c3c10766efe18c">&#9670;&nbsp;</a></span>rbtree_max()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">rbtree_node_t* rbtree_max </td>
<td>(</td>
<td class="paramtype">const rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets the maximum node of an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The maximum node. </dd></dl>
</div>
</div>
<a id="a96f0e838aff7f1cdac2f09804be44aa8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a96f0e838aff7f1cdac2f09804be44aa8">&#9670;&nbsp;</a></span>rbtree_min()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">rbtree_node_t* rbtree_min </td>
<td>(</td>
<td class="paramtype">const rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets the minimum node of an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The minimum node. </dd></dl>
</div>
</div>
<a id="ae9774dcf5094b21c929defded278b5cc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae9774dcf5094b21c929defded278b5cc">&#9670;&nbsp;</a></span>rbtree_node_next()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">rbtree_node_t* rbtree_node_next </td>
<td>(</td>
<td class="paramtype">const rbtree_node_t *&#160;</td>
<td class="paramname"><em>node</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets the next node from an rbtree node. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node</td><td>Pointer to the node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The next node. </dd></dl>
</div>
</div>
<a id="a55b41ea5178a00916c2c293743ea3c7c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a55b41ea5178a00916c2c293743ea3c7c">&#9670;&nbsp;</a></span>rbtree_node_prev()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">rbtree_node_t* rbtree_node_prev </td>
<td>(</td>
<td class="paramtype">const rbtree_node_t *&#160;</td>
<td class="paramname"><em>node</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets the previous node from an rbtree node. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node</td><td>Pointer to the node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The previous node. </dd></dl>
</div>
</div>
<a id="aa85861ccd33a4e920aeb9f4cd3475e6f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa85861ccd33a4e920aeb9f4cd3475e6f">&#9670;&nbsp;</a></span>rbtree_remove()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">rbtree_node_t* rbtree_remove </td>
<td>(</td>
<td class="paramtype">rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">rbtree_node_t *&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="rbtree_8h.html#a32532a9ceeff76fef73c59c66c666189">rbtree_node_destructor_t</a>&#160;</td>
<td class="paramname"><em>destructor</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes a node from an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
<tr><td class="paramname">node</td><td>Pointer to the node. </td></tr>
<tr><td class="paramname">destructor</td><td>Destructor to use when removing the node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The removed node. </dd></dl>
</div>
</div>
<a id="a635c19a896c3c43bd47929fb486a388f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a635c19a896c3c43bd47929fb486a388f">&#9670;&nbsp;</a></span>rbtree_size()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">size_t rbtree_size </td>
<td>(</td>
<td class="paramtype">const rbtree_t *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets the size of an rbtree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>Pointer to the tree. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<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>
Reference in New Issue View Git Blame Copy Permalink