luc14n0/glib
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/glib.git synced 2025-08-20 15:48:54 +02:00
Code Issues Packages Projects Releases Wiki Activity

Remove some informalexamples

Browse Source
This commit is contained in:
Matthias Clasen
2014-02-08 15:50:17 -05:00
parent a59e3d69b4
commit 5acd7b01de
1 changed files with 15 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
glib/gnode.c
View File

@@ -824,49 +824,26 @@ g_node_depth_traverse_level (GNode *node,
* then its right child. This is the one to use if you * then its right child. This is the one to use if you
* want the output sorted according to the compare * want the output sorted according to the compare
* function. * function.
* <informalfigure>
* <mediaobject>
* <imageobject>
* <imagedata align="right" fileref="Sorted_binary_tree_inorder.svg" format="SVG"/>
* </imageobject>
* <caption>In order: A, B, C, D, E, F, G, H, I</caption>
* </mediaobject>
* </informalfigure>
* @G_PRE_ORDER: visits a node, then its children. * @G_PRE_ORDER: visits a node, then its children.
* <informalfigure>
* <mediaobject>
* <imageobject>
* <imagedata align="right" fileref="Sorted_binary_tree_preorder.svg" format="SVG"/>
* </imageobject>
* <caption>Pre order: F, B, A, D, C, E, G, I, H</caption>
* </mediaobject>
* </informalfigure>
* @G_POST_ORDER: visits the node's children, then the node itself. * @G_POST_ORDER: visits the node's children, then the node itself.
* <informalfigure>
* <mediaobject>
* <imageobject>
* <imagedata align="right" fileref="Sorted_binary_tree_postorder.svg" format="SVG"/>
* </imageobject>
* <caption>Post order: A, C, E, D, B, H, I, G, F</caption>
* </mediaobject>
* </informalfigure>
* @G_LEVEL_ORDER: is not implemented for * @G_LEVEL_ORDER: is not implemented for
* [balanced binary trees][glib-Balanced-Binary-Trees]. * [balanced binary trees][glib-Balanced-Binary-Trees].
* For [n-ary trees][glib-N-ary-Trees], it * For [n-ary trees][glib-N-ary-Trees], it
* vists the root node first, then its children, then * vists the root node first, then its children, then
* its grandchildren, and so on. Note that this is less * its grandchildren, and so on. Note that this is less
* efficient than the other orders. * efficient than the other orders.
* <informalfigure>
* <mediaobject>
* <imageobject>
* <imagedata align="right" fileref="Sorted_binary_tree_breadth-first_traversal.svg" format="SVG"/>
* </imageobject>
* <caption>Level order: F, B, G, A, D, I, C, E, H</caption>
* </mediaobject>
* </informalfigure>
* *
* Specifies the type of traveral performed by g_tree_traverse(), * Specifies the type of traveral performed by g_tree_traverse(),
* g_node_traverse() and g_node_find(). * g_node_traverse() and g_node_find(). The different orders are
* illustrated here:
* - In order: A, B, C, D, E, F, G, H, I
* ![](Sorted_binary_tree_inorder.svg)
* - Pre order: F, B, A, D, C, E, G, I, H
* ![](Sorted_binary_tree_preorder.svg)
* - Post order: A, C, E, D, B, H, I, G, F
* ![](Sorted_binary_tree_postorder.svg)
* - Level order: F, B, G, A, D, I, C, E, H
* ![](Sorted_binary_tree_breadth-first_traversal.svg)
*/ */
/** /**