#define ASORT_ELT(i) a[i].key
#define ASORT_SWAP(i,j) do { struct elt t=a[i]; a[i]=a[j]; a[j]=t; } while (0)
#define ASORT_EXTRA_ARGS , struct elt *a
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
#define ASORT_PREFIX(x) asi_##x
#define ASORT_KEY_TYPE u32
#define ASORT_ELT(i) ind[i]->key
#define ASORT_SWAP(i,j) do { struct elt *t=ind[i]; ind[i]=ind[j]; ind[j]=t; } while (0)
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
static void r1_sort(void)
{
#define ASORT_KEY_TYPE uns
#define ASORT_ELT(i) items[i]
#define ASORT_EXTRA_ARGS , uns *items
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
#define EXPLAIN
#include "images/sig-cmp-gen.h"
#define ASORT_KEY_TYPE uns
#define ASORT_ELT(i) val[i]
#define ASORT_EXTRA_ARGS , uns *val
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
static uns
prequant(struct image_sig_block *blocks, uns blocks_count, struct image_sig_region *regions)
}
#define ASORT_PREFIX(x) as_##x
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
int main(void)
{
#define ASORT_KEY_TYPE struct dirty_section
#define ASORT_ELT(i) dirty.ptr[i]
#define ASORT_LT(x,y) x.sec < y.sec || x.sec == y.sec && x.ptr < y.ptr
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
static void
sort_dirty(void)
#define ASORT_KEY_TYPE u32
#define ASORT_ELT(i) ary[i]
#define ASORT_EXTRA_ARGS , u32 *ary
-#include "ucw/arraysort.h"
+#include "ucw/sorter/array-simple.h"
static void s5_write_merged(struct fastbuf *f, struct key5 **keys, void **data, uns n, void *buf)
{