summaryrefslogtreecommitdiff
path: root/gir/glib-2.0.c
diff options
context:
space:
mode:
authorRico Tzschichholz <ricotz@t-online.de>2012-03-20 19:54:18 +0100
committerRico Tzschichholz <ricotz@t-online.de>2012-03-20 19:54:18 +0100
commit68a7351a35f5fa1c039ee3504e654b0f6a2a5d8b (patch)
treec80ae19bc4a1dcff67098bd5e4f336bf9c580244 /gir/glib-2.0.c
parentb4afe8437f78a0259a3eb6f4c9af963acbed5b8a (diff)
downloadgobject-introspection-68a7351a35f5fa1c039ee3504e654b0f6a2a5d8b.tar.gz
Update glib annotations to 2.31.22
Diffstat (limited to 'gir/glib-2.0.c')
-rw-r--r--gir/glib-2.0.c24
1 files changed, 13 insertions, 11 deletions
diff --git a/gir/glib-2.0.c b/gir/glib-2.0.c
index fb17fa37..74d991a8 100644
--- a/gir/glib-2.0.c
+++ b/gir/glib-2.0.c
@@ -13467,11 +13467,7 @@
* than second arg, zero for equal, greater zero if 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 (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.
+ * This is guaranteed to be a stable sort since version 2.32.
*/
@@ -13483,6 +13479,12 @@
*
* Like g_array_sort(), but the comparison function receives an extra
* user data argument.
+ *
+ * This is guaranteed to be a stable sort since version 2.32.
+ *
+ * There used to be a comment here about making the sort stable by
+ * using the addresses of the elements in the comparison function.
+ * This did not actually work, so any such code should be removed.
*/
@@ -27170,15 +27172,11 @@
* than second arg, zero for equal, greater than zero if irst 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 (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
* take the pointers from the array as arguments, it takes pointers to
* the pointers in the array.</para></note>
+ *
+ * This is guaranteed to be a stable sort since version 2.32.
*/
@@ -27194,6 +27192,8 @@
* <note><para>The comparison function for g_ptr_array_sort_with_data()
* doesn't take the pointers from the array as arguments, it takes
* pointers to the pointers in the array.</para></note>
+ *
+ * This is guaranteed to be a stable sort since version 2.32.
*/
@@ -27220,6 +27220,8 @@
*
* This is just like the standard C qsort() function, but
* the comparison routine accepts a user data argument.
+ *
+ * This is guaranteed to be a stable sort since version 2.32.
*/