src/base/sort/uint.c


1
2
3
4
5
6
7
8
9
10
11
12

#include "internal.h"

void
sort·uint(uint arr[], uintptr sz)
{
    uint tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
    QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}