[glib] ghash.c: fix docs
- From: Dan Winship <danw src gnome org>
- To: commits-list gnome org
- Cc:
- Subject: [glib] ghash.c: fix docs
- Date: Wed, 10 Oct 2012 14:03:21 +0000 (UTC)
commit 132c4cee4fa445b7de29711719090d61cd5903c3
Author: Dan Winship <danw gnome org>
Date: Wed Oct 10 10:02:39 2012 -0400
ghash.c: fix docs
A previous commit left an unclosed XML tag. Fix that.
glib/ghash.c | 15 +++++----------
1 files changed, 5 insertions(+), 10 deletions(-)
---
diff --git a/glib/ghash.c b/glib/ghash.c
index 8a382ec..587059e 100644
--- a/glib/ghash.c
+++ b/glib/ghash.c
@@ -82,19 +82,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>
- *
- * The functions g_hash_table_add(), g_hash_table_contains() are both
- * designed to be used when using #GHashTable 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.
*/
/**
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]