File: sort_cell.c

package info (click to toggle)
grass 6.4.4-1
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 104,028 kB
  • ctags: 40,409
  • sloc: ansic: 419,980; python: 63,559; tcl: 46,692; cpp: 29,791; sh: 18,564; makefile: 7,000; xml: 3,505; yacc: 561; perl: 559; lex: 480; sed: 70; objc: 7
file content (45 lines) | stat: -rw-r--r-- 793 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <stdlib.h>
#include <grass/gis.h>
#include <grass/stats.h>

static int ascending(const void *aa, const void *bb)
{
    const DCELL *a = aa, *b = bb;

    if (G_is_d_null_value((DCELL *) a) && G_is_d_null_value((DCELL *) b))
	return 0;

    if (G_is_d_null_value((DCELL *) a))
	return 1;

    if (G_is_d_null_value((DCELL *) b))
	return -1;

    return (*a < *b) ? -1 : (*a > *b) ? 1 : 0;
}

int sort_cell(DCELL * array, int n)
{
    int i;

    qsort(array, n, sizeof(DCELL), ascending);

    for (i = 0; i < n; i++)
	if (G_is_d_null_value(&array[i]))
	    break;

    return i;
}

int sort_cell_w(DCELL(*array)[2], int n)
{
    int i;

    qsort(array, n, 2 * sizeof(DCELL), ascending);

    for (i = 0; i < n; i++)
	if (G_is_d_null_value(&array[i][0]))
	    break;

    return i;
}