7 static int ascending(
const void *aa,
const void *bb)
9 const DCELL *a = aa, *
b = bb;
25 return (*a < *b) ? -1 : (*a > *
b) ? 1 : 0;
33 for (i = 0; i < n; i++) {
42 qsort(array, n,
sizeof(
DCELL), ascending);
52 for (i = 0; i < n; i++) {
55 array[j][0] = array[i][0];
56 array[j][1] = array[i][1];
63 qsort(array, n, 2 *
sizeof(
DCELL), ascending);
#define Rast_is_d_null_value(dcellVal)
int sort_cell_w(DCELL(*array)[2], int n)
int sort_cell(DCELL *array, int n)