6 * asearch - typesafe binary search (bsearch)
8 * An ordered array of objects can be efficiently searched using a binary
9 * search algorithm; the time taken is around log(number of elements).
11 * This version uses macros to be typesafe on platforms which support it.
16 * #include <ccan/asearch/asearch.h>
20 * static int cmp(const char *key, char *const *elem)
22 * return strcmp(key, *elem);
25 * int main(int argc, char *argv[])
30 * fprintf(stderr, "Usage: %s <key> <list>...\n"
31 * "Print position of key in (sorted) list\n",
36 * p = asearch(argv[1], &argv[2], argc-2, cmp);
38 * printf("Not found!\n");
41 * printf("%u\n", p - &argv[2]);
45 int main(int argc, char *argv[])
50 if (strcmp(argv[1], "depends") == 0) {
51 printf("ccan/typesafe_cb\n");
52 printf("ccan/array_size\n");