Tests for radix sort in desc order

2026-02-17 13:42:17 +00:00 · 2016-04-23 18:06:21 +02:00
parent 6d5d9b0b5d
commit f29bbda7f8
2 changed files with 372 additions and 0 deletions
--- a/test/test_radix_sort.cpp
+++ b/test/test_radix_sort.cpp
@@ -21,6 +21,8 @@

 namespace bc = boost::compute;

+const bool descending = false;
+
 BOOST_AUTO_TEST_CASE(sort_char_vector)
 {
    using boost::compute::char_;
@@ -177,6 +179,267 @@ BOOST_AUTO_TEST_CASE(sort_double_vector)
    );
 }

+BOOST_AUTO_TEST_CASE(sort_char_vector_desc)
+{
+    using boost::compute::char_;
+
+    char_ data[] = { 'c', 'a', '0', '7', 'B', 'F', '\0', '$' };
+    boost::compute::vector<char_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<char_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<char_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        char_, 8, vector,
+        ('c', 'a', 'F', 'B', '7', '0', '$', '\0')
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_uchar_vector_desc)
+{
+    using boost::compute::uchar_;
+
+    uchar_ data[] = { 0x12, 0x00, 0xFF, 0xB4, 0x80, 0x32, 0x64, 0xA2 };
+    boost::compute::vector<uchar_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<uchar_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<uchar_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        uchar_, 8, vector,
+        (0xFF, 0xB4, 0xA2, 0x80, 0x64, 0x32, 0x12, 0x00)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_short_vector_desc)
+{
+    using boost::compute::short_;
+
+    short_ data[] = { -4, 152, -94, 963, 31002, -456, 0, -2113 };
+    boost::compute::vector<short_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<short_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<short_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        short_, 8, vector,
+        (31002, 963, 152, 0, -4, -94, -456, -2113)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_ushort_vector_desc)
+{
+    using boost::compute::ushort_;
+
+    ushort_ data[] = { 4, 152, 94, 963, 63202, 34560, 0, 2113 };
+    boost::compute::vector<ushort_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<ushort_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<ushort_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        ushort_, 8, vector,
+        (63202, 34560, 2113, 963, 152, 94, 4, 0)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_int_vector_desc)
+{
+    using boost::compute::int_;
+
+    int_ data[] = { -4, 152, -5000, 963, 75321, -456, 0, 1112 };
+    boost::compute::vector<int_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<int_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<int_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        int_, 8, vector,
+        (75321, 1112, 963, 152, 0, -4, -456, -5000)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_uint_vector_desc)
+{
+    using boost::compute::uint_;
+
+    uint_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
+    boost::compute::vector<uint_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<uint_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<uint_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        uint_, 8, vector,
+        (4000000, 123456, 102030, 9852, 1988, 562, 500, 0)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_long_vector_desc)
+{
+    using boost::compute::long_;
+
+    long_ data[] = { -500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
+    boost::compute::vector<long_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<long_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<long_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        long_, 8, vector,
+        (4000000, 123456, 102030, 9852, 1988, 562, 0, -500)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_ulong_vector_desc)
+{
+    using boost::compute::ulong_;
+
+    ulong_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
+    boost::compute::vector<ulong_> vector(data, data + 8, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(8));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<ulong_>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<ulong_>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        ulong_, 8, vector,
+        (4000000, 123456, 102030, 9852, 1988, 562, 500, 0)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_float_vector_desc)
+{
+    float data[] = {
+        -6023.0f, 152.5f, -63.0f, 1234567.0f, 11.2f,
+        -5000.1f, 0.0f, 14.0f, -8.25f, -0.0f
+    };
+
+    boost::compute::vector<float> vector(data, data + 10, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(10));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<float>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<float>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        float, 10, vector,
+        (1234567.0f, 152.5f, 14.0f, 11.2f, 0.0f, -0.0f, -8.25f, -63.0f, -5000.1f, -6023.0f)
+    );
+
+    // copy data, sort, and check again (to check program caching)
+    boost::compute::copy(data, data + 10, vector.begin(), queue);
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<float>(), queue
+    ));
+    CHECK_RANGE_EQUAL(
+        float, 10, vector,
+        (1234567.0f, 152.5f, 14.0f, 11.2f, 0.0f, -0.0f, -8.25f, -63.0f, -5000.1f, -6023.0f)
+    );
+}
+
+BOOST_AUTO_TEST_CASE(sort_double_vector_desc)
+{
+    if(!device.supports_extension("cl_khr_fp64")){
+        std::cout << "skipping test: device does not support double" << std::endl;
+        return;
+    }
+
+    double data[] = {
+        -6023.0, 152.5, -63.0, 1234567.0, 11.2, -5000.1, 0.0, 14.0, -8.25, -0.0
+    };
+
+    boost::compute::vector<double> vector(data, data + 10, queue);
+    BOOST_CHECK_EQUAL(vector.size(), size_t(10));
+
+    BOOST_CHECK(!boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<double>(), queue
+    ));
+    boost::compute::detail::radix_sort(
+        vector.begin(), vector.end(), descending, queue
+    );
+    BOOST_CHECK(boost::compute::is_sorted(
+        vector.begin(), vector.end(), boost::compute::greater<double>(), queue
+    ));
+
+    CHECK_RANGE_EQUAL(
+        double, 10, vector,
+        (1234567.0, 152.5, 14.0, 11.2, 0.0, -0.0, -8.25, -63.0, -5000.1, -6023.0)
+    );
+}
+
 BOOST_AUTO_TEST_CASE(sort_partial_vector)
 {
    int data[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
--- a/test/test_radix_sort_by_key.cpp
+++ b/test/test_radix_sort_by_key.cpp
@@ -21,6 +21,8 @@

 namespace compute = boost::compute;

+const bool descending = false;
+
 // radix_sort_by_key should be stable
 BOOST_AUTO_TEST_CASE(stable_radix_sort_int_by_int)
 {
@@ -46,6 +48,41 @@ BOOST_AUTO_TEST_CASE(stable_radix_sort_int_by_int)
    );
 }

+// radix_sort_by_key should be stable
+BOOST_AUTO_TEST_CASE(stable_radix_sort_int_by_int_desc)
+{
+    compute::int_ keys_data[] =   { 10, 9, 2, 7, 6, -1, 4, 2, 2, 10 };
+    compute::int_ values_data[] = { 1,  2, 3, 4, 5,  6, 7, 8, 9, 10 };
+
+    compute::vector<compute::int_> keys(keys_data, keys_data + 10, queue);
+    compute::vector<compute::int_> values(values_data, values_data + 10, queue);
+
+    BOOST_CHECK(
+        !compute::is_sorted(
+            keys.begin(), keys.end(), compute::greater<compute::int_>(), queue
+        )
+    );
+    compute::detail::radix_sort_by_key(
+        keys.begin(), keys.end(), values.begin(), descending, queue
+    );
+    BOOST_CHECK(
+        compute::is_sorted(
+            keys.begin(), keys.end(), compute::greater<compute::int_>(), queue
+        )
+    );
+
+    CHECK_RANGE_EQUAL(
+        compute::int_, 10, keys,
+        (10, 10, 9, 7, 6, 4, 2, 2, 2, -1) // keys
+     // ( 1, 10, 2, 4, 5, 7, 3, 8, 9,  6) values
+    );
+    CHECK_RANGE_EQUAL(
+        compute::int_, 10, values,
+    //  (10, 10, 9, 7, 6, 4, 2, 2, 2, -1) // keys
+        ( 1, 10, 2, 4, 5, 7, 3, 8, 9,  6) // values
+    );
+}
+
 // radix_sort_by_key should be stable
 BOOST_AUTO_TEST_CASE(stable_radix_sort_uint_by_uint)
 {
@@ -71,6 +108,42 @@ BOOST_AUTO_TEST_CASE(stable_radix_sort_uint_by_uint)
    );
 }

+// radix_sort_by_key should be stable
+BOOST_AUTO_TEST_CASE(stable_radix_sort_uint_by_uint_desc)
+{
+    compute::uint_ keys_data[] =   { 10, 9, 2, 7, 6, 1, 4, 2, 2, 10 };
+    compute::uint_ values_data[] = { 1,  2, 3, 4, 5, 6, 7, 8, 9, 10 };
+
+    compute::vector<compute::uint_> keys(keys_data, keys_data + 10, queue);
+    compute::vector<compute::uint_> values(values_data, values_data + 10, queue);
+
+    BOOST_CHECK(
+        !compute::is_sorted(
+            keys.begin(), keys.end(), compute::greater<compute::uint_>(), queue
+        )
+    );
+    compute::detail::radix_sort_by_key(
+        keys.begin(), keys.end(), values.begin(), descending, queue
+    );
+    BOOST_CHECK(
+        compute::is_sorted(
+            keys.begin(), keys.end(), compute::greater<compute::uint_>(), queue
+        )
+    );
+
+    CHECK_RANGE_EQUAL(
+        compute::uint_, 10, keys,
+        (10, 10, 9, 7, 6, 4, 2, 2, 2, 1) // keys
+     // ( 1, 10, 2, 4, 5, 7, 3, 8, 9, 6) values
+    );
+    CHECK_RANGE_EQUAL(
+        compute::uint_, 10, values,
+    //  (10, 10, 9, 7, 6, 4, 2, 2, 2, 1) // keys
+        ( 1, 10, 2, 4, 5, 7, 3, 8, 9, 6) // values
+    );
+}
+
+
 // radix_sort_by_key should be stable
 BOOST_AUTO_TEST_CASE(stable_radix_sort_int_by_float)
 {
@@ -96,6 +169,42 @@ BOOST_AUTO_TEST_CASE(stable_radix_sort_int_by_float)
    );
 }

+// radix_sort_by_key should be stable
+BOOST_AUTO_TEST_CASE(stable_radix_sort_int_by_float_desc)
+{
+    compute::float_ keys_data[]   = { 10., 5.5, 10., 7., 5.5};
+    compute::int_   values_data[] = {   1, 200, -10,  2, 4 };
+
+    compute::vector<compute::float_> keys(keys_data, keys_data + 5, queue);
+    compute::vector<compute::uint_> values(values_data, values_data + 5, queue);
+
+    BOOST_CHECK(
+        !compute::is_sorted(
+            keys.begin(), keys.end(), compute::greater<compute::float_>(), queue
+        )
+    );
+    compute::detail::radix_sort_by_key(
+        keys.begin(), keys.end(), values.begin(), descending, queue
+    );
+    BOOST_CHECK(
+        compute::is_sorted(
+            keys.begin(), keys.end(), compute::greater<compute::float_>(), queue
+        )
+    );
+
+    CHECK_RANGE_EQUAL(
+        compute::float_, 5, keys,
+        (10.,  10., 7., 5.5, 5.5) // keys
+     // (  1, -10,   2, 200, 4) values
+    );
+    CHECK_RANGE_EQUAL(
+        compute::int_, 5, values,
+     // (10.,  10., 7., 5.5, 5.5) // keys
+        (  1, -10,   2, 200, 4) // values
+    );
+}
+
+
 // radix_sort_by_key should be stable
 BOOST_AUTO_TEST_CASE(stable_radix_sort_char_by_int)
 {