From: Matthias Clasen <mclasen@redhat.com>
Date: Sat, 8 Feb 2014 20:50:17 +0000 (-0500)
Subject: Remove some informalexamples
X-Git-Tag: 2.39.90~38
X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=5acd7b01de2f9a1b22d0a06f62e7bb6b8f5e1849;p=platform%2Fupstream%2Fglib.git

Remove some informalexamples
---

diff --git a/glib/gnode.c b/glib/gnode.c
index 6677f33..9bc1b23 100644
--- a/glib/gnode.c
+++ b/glib/gnode.c
@@ -824,49 +824,26 @@ g_node_depth_traverse_level (GNode             *node,
  *              then its right child. This is the one to use if you
  *              want the output sorted according to the compare
  *              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.
- *              <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.
- *              <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
- *                 [balanced binary trees][glib-Balanced-Binary-Trees].
- *                 For [n-ary trees][glib-N-ary-Trees], it
- *                 vists the root node first, then its children, then
- *                 its grandchildren, and so on. Note that this is less
- *                 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>
+ *              [balanced binary trees][glib-Balanced-Binary-Trees].
+ *              For [n-ary trees][glib-N-ary-Trees], it
+ *              vists the root node first, then its children, then
+ *              its grandchildren, and so on. Note that this is less
+ *              efficient than the other orders.
  *
  * 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)
  */
 
 /**