File: TestGNUQsortR.c

package info (click to toggle)
swi-prolog 9.2.9%2Bdfsg-1.1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 84,456 kB
  • sloc: ansic: 401,705; perl: 374,799; lisp: 9,080; cpp: 8,920; java: 5,525; sh: 3,282; javascript: 2,690; python: 2,655; ruby: 1,594; yacc: 845; makefile: 440; xml: 317; sed: 12; sql: 6
file content (23 lines) | stat: -rw-r--r-- 375 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
 
#define _GNU_SOURCE
#include <stdlib.h>

static int
mycompare(const void *p1, const void *p2, void *c)
{ const int *s1 = p1;
  const int *s2 = p2;
  int *ip = c;

  if ( *ip != 1 )
    exit(1);

  return *s1 - *s2;
}

int
main(int argc, char**argv)
{ int data[] = {0,1,2,3,4,5,6,7,8,9};
  int ctx = 1;

  qsort_r(data, 10, sizeof(int), mycompare, (void*)&ctx);
  return 0;
}