comparison: src/cx/array_list.h
src/cx/array_list.h
- changeset 1620
- bf5d647f939d
- parent 1618
- ef7cab6eb131
- child 1621
- c52a4c67e29e
equal
deleted
inserted
replaced
| 1619:0db02ab1457c | 1620:bf5d647f939d |
|---|---|
| 544 */ | 544 */ |
| 545 #define cx_array_insert_unique_array(array, cmp_func, sorted_data, n) \ | 545 #define cx_array_insert_unique_array(array, cmp_func, sorted_data, n) \ |
| 546 cx_array_insert_unique_array_a(cxDefaultAllocator, array, cmp_func, sorted_data, n) | 546 cx_array_insert_unique_array_a(cxDefaultAllocator, array, cmp_func, sorted_data, n) |
| 547 | 547 |
| 548 /** | 548 /** |
| 549 * An alternative to qsort_r() when that is not available on your platform. | |
| 550 * | |
| 551 * If it is available, qsort_r() is used directly. | |
| 552 * | |
| 553 * @param array the array that shall be sorted | |
| 554 * @param nmemb the number of elements in the array | |
| 555 * @param size the size of one element | |
| 556 * @param fn the compare function | |
| 557 * @param context the context for the compare function | |
| 558 */ | |
| 559 CX_EXPORT void cx_array_qsort_c(void *array, size_t nmemb, size_t size, | |
| 560 cx_compare_func2 fn, void *context); | |
| 561 | |
| 562 /** | |
| 549 * Creates an iterator over the elements of an array. | 563 * Creates an iterator over the elements of an array. |
| 550 * | 564 * |
| 551 * Internal function - do not use. | 565 * Internal function - do not use. |
| 552 * | 566 * |
| 553 * @param array a pointer to the array structure | 567 * @param array a pointer to the array structure |
