mirror of
https://gitlab.gnome.org/GNOME/glib.git
synced 2025-05-31 09:50:05 +02:00
docs: Improve punctuation in some of the GArray method documentation
This commit is contained in:
parent
cb7a5a8e94
commit
2122191595
@ -616,9 +616,9 @@ g_array_remove_range (GArray *farray,
|
|||||||
* greater than second arg).
|
* greater than second arg).
|
||||||
*
|
*
|
||||||
* If two array elements compare equal, their order in the sorted array
|
* If two array elements compare equal, their order in the sorted array
|
||||||
* is undefined. If you want equal elements to keep their order - ie
|
* 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,
|
* you want a stable sort – you can write a comparison function that,
|
||||||
* if two elements would otherwise compare equal, it compares them by
|
* if two elements would otherwise compare equal, compares them by
|
||||||
* their addresses.
|
* their addresses.
|
||||||
**/
|
**/
|
||||||
void
|
void
|
||||||
@ -1241,9 +1241,9 @@ g_ptr_array_add (GPtrArray *farray,
|
|||||||
* greater than second arg).
|
* greater than second arg).
|
||||||
*
|
*
|
||||||
* If two array elements compare equal, their order in the sorted array
|
* If two array elements compare equal, their order in the sorted array
|
||||||
* is undefined. If you want equal elements to keep their order - ie
|
* 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,
|
* you want a stable sort – you can write a comparison function that,
|
||||||
* if two elements would otherwise compare equal, it compares them by
|
* if two elements would otherwise compare equal, compares them by
|
||||||
* their addresses.
|
* their addresses.
|
||||||
*
|
*
|
||||||
* <note><para>The comparison function for g_ptr_array_sort() doesn't
|
* <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).
|
* first arg is greater than second arg).
|
||||||
*
|
*
|
||||||
* If two array elements compare equal, their order in the sorted array
|
* If two array elements compare equal, their order in the sorted array
|
||||||
* is undefined. If you want equal elements to keep their order - ie
|
* 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,
|
* you want a stable sort – you can write a comparison function that,
|
||||||
* if two elements would otherwise compare equal, it compares them by
|
* if two elements would otherwise compare equal, compares them by
|
||||||
* their addresses.
|
* their addresses.
|
||||||
**/
|
**/
|
||||||
void
|
void
|
||||||
|
Loading…
x
Reference in New Issue
Block a user