<link rel="up" href="glib-data-types.html" title="GLib Data Types">
<link rel="prev" href="glib-Byte-Arrays.html" title="Byte Arrays">
<link rel="next" href="glib-N-ary-Trees.html" title="N-ary Trees">
-<meta name="generator" content="GTK-Doc V1.24 (XML mode)">
+<meta name="generator" content="GTK-Doc V1.25.1 (XML mode)">
<link rel="stylesheet" href="style.css" type="text/css">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
g_tree_new (<em class="parameter"><code><a class="link" href="glib-Doubly-Linked-Lists.html#GCompareFunc" title="GCompareFunc ()"><span class="type">GCompareFunc</span></a> key_compare_func</code></em>);</pre>
<p>Creates a new <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.2.5"></a><h4>Parameters</h4>
+<a name="g-tree-new.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.2.6"></a><h4>Returns</h4>
+<a name="g-tree-new.returns"></a><h4>Returns</h4>
<p> a newly allocated <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a></p>
</div>
</div>
by one.</p>
<p>It is safe to call this function from any thread.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.3.6"></a><h4>Parameters</h4>
+<a name="g-tree-ref.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.3.7"></a><h4>Returns</h4>
+<a name="g-tree-ref.returns"></a><h4>Returns</h4>
<p> the passed in <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a></p>
</div>
<p class="since">Since: <a class="link" href="api-index-2-22.html#api-index-2.22">2.22</a></p>
will be released.</p>
<p>It is safe to call this function from any thread.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.4.6"></a><h4>Parameters</h4>
+<a name="g-tree-unref.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
<p>Creates a new <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a> with a comparison function that accepts user data.
See <a class="link" href="glib-Balanced-Binary-Trees.html#g-tree-new" title="g_tree_new ()"><code class="function">g_tree_new()</code></a> for more details.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.5.5"></a><h4>Parameters</h4>
+<a name="g-tree-new-with-data.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.5.6"></a><h4>Returns</h4>
+<a name="g-tree-new-with-data.returns"></a><h4>Returns</h4>
<p> a newly allocated <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a></p>
</div>
</div>
to free the memory allocated for the key and value that get called when
removing the entry from the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.6.5"></a><h4>Parameters</h4>
+<a name="g-tree-new-full.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.6.6"></a><h4>Returns</h4>
+<a name="g-tree-new-full.returns"></a><h4>Returns</h4>
<p> a newly allocated <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a></p>
</div>
</div>
<p>The tree is automatically 'balanced' as new key/value pairs are added,
so that the distance from the root to every leaf is as small as possible.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.7.7"></a><h4>Parameters</h4>
+<a name="g-tree-insert.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
<p>The tree is automatically 'balanced' as new key/value pairs are added,
so that the distance from the root to every leaf is as small as possible.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.8.6"></a><h4>Parameters</h4>
+<a name="g-tree-replace.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
g_tree_nnodes (<em class="parameter"><code><a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a> *tree</code></em>);</pre>
<p>Gets the number of nodes in a <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.9.5"></a><h4>Parameters</h4>
+<a name="g-tree-nnodes.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.9.6"></a><h4>Returns</h4>
+<a name="g-tree-nnodes.returns"></a><h4>Returns</h4>
<p> the number of nodes in <em class="parameter"><code>tree</code></em>
</p>
</div>
If the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a> contains only one root node the height is 1.
If the root node has children the height is 2, etc.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.10.6"></a><h4>Parameters</h4>
+<a name="g-tree-height.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.10.7"></a><h4>Returns</h4>
+<a name="g-tree-height.returns"></a><h4>Returns</h4>
<p> the height of <em class="parameter"><code>tree</code></em>
</p>
</div>
automatically balanced as key/value pairs are added, key lookup
is O(log n) (where n is the number of key/value pairs in the tree).</p>
<div class="refsect3">
-<a name="id-1.6.13.7.11.5"></a><h4>Parameters</h4>
+<a name="g-tree-lookup.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.11.6"></a><h4>Returns</h4>
+<a name="g-tree-lookup.returns"></a><h4>Returns</h4>
<p> the value corresponding to the key, or <a class="link" href="glib-Standard-Macros.html#NULL:CAPS" title="NULL"><code class="literal">NULL</code></a>
if the key was not found</p>
</div>
allocated for the original key, for example before calling
<a class="link" href="glib-Balanced-Binary-Trees.html#g-tree-remove" title="g_tree_remove ()"><code class="function">g_tree_remove()</code></a>.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.12.5"></a><h4>Parameters</h4>
+<a name="g-tree-lookup-extended.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.12.6"></a><h4>Returns</h4>
+<a name="g-tree-lookup-extended.returns"></a><h4>Returns</h4>
<p> <a class="link" href="glib-Standard-Macros.html#TRUE:CAPS" title="TRUE"><code class="literal">TRUE</code></a> if the key was found in the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a></p>
</div>
</div>
to add each item to a list in your <a class="link" href="glib-Balanced-Binary-Trees.html#GTraverseFunc" title="GTraverseFunc ()"><span class="type">GTraverseFunc</span></a> as you walk over
the tree, then walk the list and remove each item.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.13.6"></a><h4>Parameters</h4>
+<a name="g-tree-foreach.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</div>
<p>Calls the given function for each node in the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.14.6"></a><h4>Parameters</h4>
+<a name="g-tree-traverse.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
parameter passed to <a class="link" href="glib-Balanced-Binary-Trees.html#g-tree-traverse" title="g_tree_traverse ()"><code class="function">g_tree_traverse()</code></a>. If the function returns
<a class="link" href="glib-Standard-Macros.html#TRUE:CAPS" title="TRUE"><code class="literal">TRUE</code></a>, the traversal is stopped.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.15.5"></a><h4>Parameters</h4>
+<a name="GTraverseFunc.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.15.6"></a><h4>Returns</h4>
+<a name="GTraverseFunc.returns"></a><h4>Returns</h4>
<p> <a class="link" href="glib-Standard-Macros.html#TRUE:CAPS" title="TRUE"><code class="literal">TRUE</code></a> to stop the traversal</p>
</div>
</div>
returns 1, searching will proceed among the key/value
pairs that have a larger key.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.16.6"></a><h4>Parameters</h4>
+<a name="g-tree-search.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.16.7"></a><h4>Returns</h4>
+<a name="g-tree-search.returns"></a><h4>Returns</h4>
<p> the value corresponding to the found key, or <a class="link" href="glib-Standard-Macros.html#NULL:CAPS" title="NULL"><code class="literal">NULL</code></a>
if the key was not found</p>
</div>
make sure that any dynamically allocated values are freed yourself.
If the key does not exist in the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>, the function does nothing.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.17.6"></a><h4>Parameters</h4>
+<a name="g-tree-remove.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.17.7"></a><h4>Returns</h4>
+<a name="g-tree-remove.returns"></a><h4>Returns</h4>
<p> <a class="link" href="glib-Standard-Macros.html#TRUE:CAPS" title="TRUE"><code class="literal">TRUE</code></a> if the key was found (prior to 2.8, this function
returned nothing)</p>
</div>
the key and value destroy functions.</p>
<p>If the key does not exist in the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>, the function does nothing.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.18.6"></a><h4>Parameters</h4>
+<a name="g-tree-steal.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</table></div>
</div>
<div class="refsect3">
-<a name="id-1.6.13.7.18.7"></a><h4>Returns</h4>
+<a name="g-tree-steal.returns"></a><h4>Returns</h4>
<p> <a class="link" href="glib-Standard-Macros.html#TRUE:CAPS" title="TRUE"><code class="literal">TRUE</code></a> if the key was found (prior to 2.8, this function
returned nothing)</p>
</div>
you supplied will be called on all keys and values before destroying
the <a class="link" href="glib-Balanced-Binary-Trees.html#GTree" title="GTree"><span class="type">GTree</span></a>.</p>
<div class="refsect3">
-<a name="id-1.6.13.7.19.5"></a><h4>Parameters</h4>
+<a name="g-tree-destroy.parameters"></a><h4>Parameters</h4>
<div class="informaltable"><table class="informaltable" width="100%" border="0">
<colgroup>
<col width="150px" class="parameters_name">
</div>
</div>
<div class="footer">
-<hr>Generated by GTK-Doc V1.24</div>
+<hr>Generated by GTK-Doc V1.25.1</div>
</body>
</html>
\ No newline at end of file