[glib] docs: Improve punctuation in some of the GArray method documentation
- From: Philip Withnall <pwithnall src gnome org>
- To: commits-list gnome org
- Cc:
- Subject: [glib] docs: Improve punctuation in some of the GArray method documentation
- Date: Sun, 15 May 2011 14:31:57 +0000 (UTC)
commit 2122191595fc7059ff4838b967ea0beb19b18d47
Author: Philip Withnall <philip tecnocode co uk>
Date: Sun May 15 15:31:16 2011 +0100
docs: Improve punctuation in some of the GArray method documentation
glib/garray.c | 18 +++++++++---------
1 files changed, 9 insertions(+), 9 deletions(-)
---
diff --git a/glib/garray.c b/glib/garray.c
index f12a8f9..d9e7616 100644
--- a/glib/garray.c
+++ b/glib/garray.c
@@ -616,9 +616,9 @@ g_array_remove_range (GArray *farray,
* greater than second arg).
*
* If two array elements compare equal, their order in the sorted array
- * is undefined. If you want equal elements to keep their order - ie
- * you want a stable sort - you can write a comparison function that,
- * if two elements would otherwise compare equal, it compares them by
+ * is undefined. If you want equal elements to keep their order – i.e.
+ * you want a stable sort – you can write a comparison function that,
+ * if two elements would otherwise compare equal, compares them by
* their addresses.
**/
void
@@ -1241,9 +1241,9 @@ g_ptr_array_add (GPtrArray *farray,
* greater than second arg).
*
* If two array elements compare equal, their order in the sorted array
- * is undefined. If you want equal elements to keep their order - ie
- * you want a stable sort - you can write a comparison function that,
- * if two elements would otherwise compare equal, it compares them by
+ * is undefined. If you want equal elements to keep their order – i.e.
+ * you want a stable sort – you can write a comparison function that,
+ * if two elements would otherwise compare equal, compares them by
* their addresses.
*
* <note><para>The comparison function for g_ptr_array_sort() doesn't
@@ -1566,9 +1566,9 @@ g_byte_array_remove_range (GByteArray *array,
* first arg is greater than second arg).
*
* If two array elements compare equal, their order in the sorted array
- * is undefined. If you want equal elements to keep their order - ie
- * you want a stable sort - you can write a comparison function that,
- * if two elements would otherwise compare equal, it compares them by
+ * is undefined. If you want equal elements to keep their order – i.e.
+ * you want a stable sort – you can write a comparison function that,
+ * if two elements would otherwise compare equal, compares them by
* their addresses.
**/
void
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]