+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
+2001-12-05 Sven Neumann <sven@gimp.org>
+
+ * glib/gtree.c (g_tree_foreach): mention the fact that the tree is
+ traversed in sorted order.
+
2001-12-03 Manish Singh <yosh@gimp.org>
* tests/module-test.c: g_module_symbol takes a gpointer *, not just
*
* Calls the given function for each of the key/value pairs in the #GTree.
* The function is passed the key and value of each pair, and the given
- * @data parameter. The tree may not be modified while iterating over
- * it (you can't add/remove items). To remove all items matching
- * a predicate, you need to add each item to a list as in your
- * #GTraverseFunc as you walk over the tree, then walk the list
- * and remove each item.
+ * @data parameter. The tree is traversed in sorted order.
+ *
+ * The tree may not be modified while iterating over it (you can't
+ * add/remove items). To remove all items matching a predicate, you need
+ * to add each item to a list in your #GTraverseFunc as you walk over
+ * the tree, then walk the list and remove each item.
**/
void
g_tree_foreach (GTree *tree,
*
* Calls the given function for each node in the GTree. This function is
* deprecated, since the order of a balanced tree is somewhat arbitrary.
- * If you just want to visit all nodes in some order, use g_tree_foreach()
- * instead. If you really need to visit nodes in a specific order, consider
+ * If you just want to visit all nodes in sorted order, use g_tree_foreach()
+ * instead. If you really need to visit nodes in a different order, consider
* using an <link linkend="glib-N-ary-Trees">N-ary Tree</link>.
**/
void