src/lib/sort.h

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
#ifndef SORT_H
#define SORT_H

#define INTEGER_CMP(name, type)                      \
    static inline int name(const type *i1, const type *i2)       \
    {                                \
        if (*i1 < *i2)                       \
            return -1;                   \
        else if (*i1 > *i2)                  \
            return 1;                    \
        else                             \
            return 0;                    \
    }

INTEGER_CMP(uint64_cmp, uint64_t)
INTEGER_CMP(uint32_cmp, uint32_t)

#define i_qsort(base, nmemb, size, cmp) \
    qsort(base, nmemb, size +                   \
          CALLBACK_TYPECHECK(cmp, int (*)(typeof(const typeof(*base) *), \
                          typeof(const typeof(*base) *))), \
          (int (*)(const void *, const void *))cmp)

#define i_bsearch(key, base, nmemb, size, cmp) \
    bsearch(key, base, nmemb, size + \
        CALLBACK_TYPECHECK(cmp, int (*)(typeof(const typeof(*key) *), \
                        typeof(const typeof(*base) *))), \
        (int (*)(const void *, const void *))cmp)

int bsearch_strcmp(const char *key, const char *const *member) ATTR_PURE;
int bsearch_strcasecmp(const char *key, const char *const *member) ATTR_PURE;

#endif