+2005-04-29 Matthias Clasen <mclasen@redhat.com>
+
+ * glib/gtree.c: Clarify some docs. (#302062, Matthew F. Barnes)
+
2005-04-28 Matthias Clasen <mclasen@redhat.com>
* glib/gstrfuncs.c (g_strcompress): Warn and don't crash
+2005-04-29 Matthias Clasen <mclasen@redhat.com>
+
+ * glib/gtree.c: Clarify some docs. (#302062, Matthew F. Barnes)
+
2005-04-28 Matthias Clasen <mclasen@redhat.com>
* glib/gstrfuncs.c (g_strcompress): Warn and don't crash
+2005-04-29 Matthias Clasen <mclasen@redhat.com>
+
+ * glib/gtree.c: Clarify some docs. (#302062, Matthew F. Barnes)
+
2005-04-28 Matthias Clasen <mclasen@redhat.com>
* glib/gstrfuncs.c (g_strcompress): Warn and don't crash
+2005-04-29 Matthias Clasen <mclasen@redhat.com>
+
+ * glib/gtree.c: Clarify some docs. (#302062, Matthew F. Barnes)
+
2005-04-28 Matthias Clasen <mclasen@redhat.com>
* glib/gstrfuncs.c (g_strcompress): Warn and don't crash
* If the #GTree was created using g_tree_new_full(), the key and value
* are freed using the supplied destroy functions, otherwise you have to
* make sure that any dynamically allocated values are freed yourself.
+ * If the key does not exist in the #GTree, the function does nothing.
**/
void
g_tree_remove (GTree *tree,
*
* Removes a key and its associated value from a #GTree without calling
* the key and value destroy functions.
+ *
+ * If the key does not exist in the #GTree, the function does nothing.
**/
void
g_tree_steal (GTree *tree,
* automatically balanced as key/value pairs are added, key lookup is very
* fast.
*
- * Return value: the value corresponding to the key.
+ * Return value: the value corresponding to the key, or %NULL if the key was
+ * not found.
**/
gpointer
g_tree_lookup (GTree *tree,