luc14n0/glib
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/glib.git synced 2024-11-05 08:56:16 +01:00
Code Issues Packages Projects Releases Wiki Activity

docs: Improve punctuation in some of the GArray method documentation

Browse Source
This commit is contained in:
Philip Withnall 2011-05-15 15:31:16 +01:00
parent cb7a5a8e94
commit 2122191595
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
glib/garray.c
View File

@ -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 &#8211; i.e.
* you want a stable sort &#8211; you can write a comparison function that,
* if two elements would otherwise compare equal, compares them by
* their addresses.
**/
void