* 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
* 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
* 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