diff options
author | Rico Tzschichholz <ricotz@t-online.de> | 2012-10-17 07:58:03 +0200 |
---|---|---|
committer | Rico Tzschichholz <ricotz@t-online.de> | 2012-10-17 07:58:03 +0200 |
commit | 72472408669305a2056d0a83c73a3dc186056067 (patch) | |
tree | a33bd4da41d4df8655e70989fcbe359018b07498 /gir/glib-2.0.c | |
parent | 448230b381a6ba0394962ca73f35af563b5de4c9 (diff) | |
download | gobject-introspection-72472408669305a2056d0a83c73a3dc186056067.tar.gz |
Update annotations from glib git
Diffstat (limited to 'gir/glib-2.0.c')
-rw-r--r-- | gir/glib-2.0.c | 48 |
1 files changed, 6 insertions, 42 deletions
diff --git a/gir/glib-2.0.c b/gir/glib-2.0.c index 90ec0003..85399cac 100644 --- a/gir/glib-2.0.c +++ b/gir/glib-2.0.c @@ -6434,50 +6434,14 @@ * * To destroy a #GHashTable use g_hash_table_destroy(). * - * <example> - * <title>Using a GHashTable as a set</title> - * <para> - * A common use-case for hash tables is to store information about - * a set of keys, without associating any particular value with each + * A common use-case for hash tables is to store information about a + * set of keys, without associating any particular value with each * key. GHashTable optimizes one way of doing so: If you store only * key-value pairs where key == value, then GHashTable does not * allocate memory to store the values, which can be a considerable - * space saving, if your set is large. - * </para> - * <programlisting> - * GHashTable * - * set_new (GHashFunc hash_func, - * GEqualFunc equal_func, - * GDestroyNotify destroy) - * { - * return g_hash_table_new_full (hash_func, equal_func, destroy, NULL); - * } - * - * void - * set_add (GHashTable *set, - * gpointer element) - * { - * g_hash_table_replace (set, element, element); - * } - * - * gboolean - * set_contains (GHashTable *set, - * gpointer element) - * { - * return g_hash_table_lookup_extended (set, element, NULL, NULL); - * } - * - * gboolean - * set_remove (GHashTable *set, - * gpointer element) - * { - * return g_hash_table_remove (set, element); - * } - * </programlisting> - * </example> - * - * As of version 2.32, there is also a g_hash_table_add() function to - * add a key to a #GHashTable that is being used as a set. + * space saving, if your set is large. The functions + * g_hash_table_add() and g_hash_table_contains() are designed to be + * used when using #GHashTable this way. */ @@ -25975,7 +25939,7 @@ * gracefully by sorting it before non-%NULL strings. * Comparing two %NULL pointers returns 0. * - * Returns: -1, 0 or 1, if @str1 is <, == or > than @str2. + * Returns: an integer less than, equal to, or greater than zero, if @str1 is <, == or > than @str2. * Since: 2.16 */ |