glib-n-ary-trees.html

glid编写实例

</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182199"></a><h3>
<a name="g-node-last-child"></a>g_node_last_child ()</h3>
<a class="indexterm" name="id3182210"></a><pre class="programlisting"><a href="glib-N-ary-Trees.html#GNode">GNode</a>*      g_node_last_child               (<a href="glib-N-ary-Trees.html#GNode">GNode</a> *node);</pre>
<p>
Gets the last child of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a> (must not be <code class="literal">NULL</code>).
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the last child of <em class="parameter"><code>node</code></em>, or <code class="literal">NULL</code> if <em class="parameter"><code>node</code></em> has no children.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182306"></a><h3>
<a name="g-node-nth-child"></a>g_node_nth_child ()</h3>
<a class="indexterm" name="id3182317"></a><pre class="programlisting"><a href="glib-N-ary-Trees.html#GNode">GNode</a>*      g_node_nth_child                (<a href="glib-N-ary-Trees.html#GNode">GNode</a> *node,
                                             <a href="glib-Basic-Types.html#guint">guint</a> n);</pre>
<p>
Gets a child of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>, using the given index.
The first child is at index 0. If the index is too big, <code class="literal">NULL</code> is returned.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><em class="parameter"><code>n</code></em>&#160;:</span></td>
<td>the index of the desired child.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the child of <em class="parameter"><code>node</code></em> at index <em class="parameter"><code>n</code></em>.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182430"></a><h3>
<a name="g-node-first-sibling"></a>g_node_first_sibling ()</h3>
<a class="indexterm" name="id3182440"></a><pre class="programlisting"><a href="glib-N-ary-Trees.html#GNode">GNode</a>*      g_node_first_sibling            (<a href="glib-N-ary-Trees.html#GNode">GNode</a> *node);</pre>
<p>
Gets the first sibling of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
This could possibly be the node itself.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the first sibling of <em class="parameter"><code>node</code></em>.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182520"></a><h3>
<a name="g-node-next-sibling"></a>g_node_next_sibling()</h3>
<a class="indexterm" name="id3182531"></a><pre class="programlisting">#define     g_node_next_sibling(node)</pre>
<p>
Gets the next sibling of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the next sibling of <em class="parameter"><code>node</code></em>, or <code class="literal">NULL</code> if <em class="parameter"><code>node</code></em> is <code class="literal">NULL</code>.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182615"></a><h3>
<a name="g-node-prev-sibling"></a>g_node_prev_sibling()</h3>
<a class="indexterm" name="id3182626"></a><pre class="programlisting">#define     g_node_prev_sibling(node)</pre>
<p>
Gets the previous sibling of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the previous sibling of <em class="parameter"><code>node</code></em>, or <code class="literal">NULL</code> if <em class="parameter"><code>node</code></em> is <code class="literal">NULL</code>.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182710"></a><h3>
<a name="g-node-last-sibling"></a>g_node_last_sibling ()</h3>
<a class="indexterm" name="id3182720"></a><pre class="programlisting"><a href="glib-N-ary-Trees.html#GNode">GNode</a>*      g_node_last_sibling             (<a href="glib-N-ary-Trees.html#GNode">GNode</a> *node);</pre>
<p>
Gets the last sibling of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
This could possibly be the node itself.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the last sibling of <em class="parameter"><code>node</code></em>.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182800"></a><h3>
<a name="G-NODE-IS-LEAF:CAPS"></a>G_NODE_IS_LEAF()</h3>
<a class="indexterm" name="id3182810"></a><pre class="programlisting">#define	 G_NODE_IS_LEAF(node)	(((GNode*) (node))-&gt;children == NULL)
</pre>
<p>
Returns <code class="literal">TRUE</code> if a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a> is a leaf node.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>
<code class="literal">TRUE</code> if the <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a> is a leaf node (i.e. it has no children).


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182890"></a><h3>
<a name="G-NODE-IS-ROOT:CAPS"></a>G_NODE_IS_ROOT()</h3>
<a class="indexterm" name="id3182900"></a><pre class="programlisting">#define     G_NODE_IS_ROOT(node)</pre>
<p>
Returns <code class="literal">TRUE</code> if a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a> is the root of a tree.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>
<code class="literal">TRUE</code> if the <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a> is the root of a tree (i.e. it has no parent
or siblings).


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3182980"></a><h3>
<a name="g-node-depth"></a>g_node_depth ()</h3>
<a class="indexterm" name="id3182990"></a><pre class="programlisting"><a href="glib-Basic-Types.html#guint">guint</a>       g_node_depth                    (<a href="glib-N-ary-Trees.html#GNode">GNode</a> *node);</pre>
<p>
Gets the depth of a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</p>
<p>
If <em class="parameter"><code>node</code></em> is <code class="literal">NULL</code> the depth is 0.
The root node has a depth of 1.
For the children of the root node the depth is 2. And so on.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter"><code>node</code></em>&#160;:</span></td>
<td>a <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.
</td>
</tr>
<tr>
<td>
<span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td>
<td>the depth of the <a href="glib-N-ary-Trees.html#GNode"><span class="type">GNode</span></a>.


</td>
</tr>
</tbody>
</table></div>
</div>
<hr>
<div class="refsect2" lang="en">
<a name="id3183087"></a><h3>
<a name="g-node-n-nodes"></a>g_node_n_nodes ()</h3>
<a class="indexterm" name="id3183097"></a><pre class="programlisting"><a href="glib-Basic-Types.html#guint">guint</a>       g_node_n_nodes                  (<a href="glib-N-ary-Trees.html#GNode">GNode</a> *root,
                                             <a href="glib-N-ary-Trees.html#GTraverseFlags">GTraverseFlags</a> flags);</pre>
<p>
Gets the number of nodes in a tree.
</p>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
<tr>
<td>
<span class="term"><em class="parameter