5 * asort - typesafe array sort (qsort)
7 * qsort() is the standard routine for sorting an array of objects.
8 * Unfortunately, it has two problems:
9 * 1) It isn't typesafe,
10 * 2) The comparison function doesn't take a context pointer.
15 * Author: Rusty Russell <rusty@rustcorp.com.au>
18 * #include <ccan/asort/asort.h>
22 * static int cmp(char *const *a, char *const *n, bool *casefold)
25 * return strcasecmp(*a, *n);
27 * return strcmp(*a, *n);
30 * int main(int argc, char *argv[])
32 * bool casefold = false;
36 * fprintf(stderr, "Usage: %s [-i] <list>...\n"
37 * "Sort arguments (-i = ignore case)\n",
42 * if (strcmp(argv[1], "-i") == 0) {
47 * asort(&argv[1], argc-1, cmp, &casefold);
48 * for (i = 1; i < argc; i++)
49 * printf("%s ", argv[i]);
54 int main(int argc, char *argv[])
59 if (strcmp(argv[1], "depends") == 0) {
60 printf("ccan/typesafe_cb\n");
61 printf("ccan/array_size\n");