22 using namespace folly;
25 TEST(DoubleRadixSort, Basic) {
26 std::unique_ptr<uint64_t[]> buckets(
new uint64_t[256 * 9]);
27 for (
int i = 0;
i < 100;
i++) {
29 std::unique_ptr<double[]> in(
new double[sz]);
30 std::unique_ptr<double[]> out(
new double[sz]);
31 for (
size_t j = 0; j < sz; j++) {
35 EXPECT_TRUE(std::is_sorted(in.get(), in.get() + sz));
void double_radix_sort(uint64_t n, uint64_t *buckets, double *in, double *tmp)
—— Concurrent Priority Queue Implementation ——
static double randDouble(double min, double max)
#define EXPECT_TRUE(condition)
TEST(SequencedExecutor, CPUThreadPoolExecutor)