From: Matthias Clasen <matthiasc@src.gnome.org>
Date: Tue, 27 Nov 2001 22:16:54 +0000 (+0000)
Subject: Document G_LEVEL_ORDER better.
X-Git-Tag: GLIB_1_3_12~53
X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=1d5e8cbc7d15b35ff336c9c5dff61a2113498ac8;p=platform%2Fupstream%2Fglib.git

Document G_LEVEL_ORDER better.

        * glib/tmpl/trees-binary.sgml: Document G_LEVEL_ORDER better.
---

diff --git a/docs/reference/ChangeLog b/docs/reference/ChangeLog
index 6886f1e..fae00bb 100644
--- a/docs/reference/ChangeLog
+++ b/docs/reference/ChangeLog
@@ -1,6 +1,6 @@
 2001-11-26  Matthias Clasen  <matthiasc@poet.de>
 
-	* glib/tmpl/trees-nary.sgml: Document G_LEVEL_ORDER better.
+	* glib/tmpl/trees-binary.sgml: Document G_LEVEL_ORDER better.
 
 2001-11-22  Matthias Clasen  <matthiasc@poet.de>
 
diff --git a/docs/reference/glib/tmpl/trees-binary.sgml b/docs/reference/glib/tmpl/trees-binary.sgml
index ac6094f..7e9a558 100644
--- a/docs/reference/glib/tmpl/trees-binary.sgml
+++ b/docs/reference/glib/tmpl/trees-binary.sgml
@@ -176,32 +176,18 @@ If the function returns %TRUE, the traversal is stopped.
 <para>
 Specifies the type of traveral performed by g_tree_traverse(),
 g_node_traverse() and g_node_find().
-<itemizedlist>
-<listitem><para>
-%G_PRE_ORDER visits a node, then its children.
-</para></listitem>
-<listitem><para>
-%G_IN_ORDER vists a node's left child first, then the node itself, then its
-right child. This is the one to use if you want the output sorted according
-to the compare function.
-</para></listitem>
-<listitem><para>
-%G_POST_ORDER visits the node's children, then the node itself.
-</para></listitem>
-<listitem><para>
-%G_LEVEL_ORDER is not implemented for
-<link linkend="glib-Balanced-Binary-Trees">Balanced Binary Trees</link>.
-For <link linkend="glib-N-ary-Trees">N-ary Trees</link>
-it calls the function for each child of the node, then it recursively visits
-each child.
-</para></listitem>
-</itemizedlist>
-</para>
-
-@G_IN_ORDER: 
-@G_PRE_ORDER: 
-@G_POST_ORDER: 
-@G_LEVEL_ORDER: 
+</para>
+
+@G_PRE_ORDER: visits a node, then its children.
+@G_IN_ORDER: vists a node's left child first, then the node itself, then its
+  right child. This is the one to use if you want the output sorted according
+  to the compare function.
+@G_POST_ORDER: visits the node's children, then the node itself.
+@G_LEVEL_ORDER: is not implemented for
+  <link linkend="glib-Balanced-Binary-Trees">Balanced Binary Trees</link>.
+  For <link linkend="glib-N-ary-Trees">N-ary Trees</link>, 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.
 
 <!-- ##### FUNCTION g_tree_search ##### -->
 <para>
@@ -212,8 +198,6 @@ each child.
 @search_func: 
 @user_data: 
 @Returns: 
-<!-- # Unused Parameters # -->
-@data: 
 
 
 <!-- ##### FUNCTION g_tree_remove ##### -->