#define ASORT_PREFIX(x) SORT_PREFIX(array_##x)
#define ASORT_KEY_TYPE P(internal_item_t)
#define ASORT_LT(x,y) (P(compare)((x).key, (y).key) < 0)
-#define ASORT_PAGE_ALIGNED
+#ifdef SORT_INTERNAL_RADIX
+# define ASORT_HASH(x) P(hash)((x).key)
+# ifdef SORT_LONG_HASH
+# define ASORT_LONG_HASH
+# endif
+#endif
#include "lib/sorter/array.h"
/*
#ifdef SORT_UNIFY_WORKSPACE
ws += SORT_UNIFY_WORKSPACE(*key);
#endif
-#ifdef SORT_HASH_BITS
+#ifdef SORT_INTERNAL_RADIX
ws = MAX(ws, sizeof(P(internal_item_t)));
#endif
return ws;
timestamp_t timer;
init_timer(&timer);
item_array = P(array_sort)(item_array, count,
-#ifdef SORT_HASH_BITS
+#ifdef SORT_INTERNAL_RADIX
workspace, bin->hash_bits
#else
NULL, 0