mirror of
https://github.com/boostorg/compute.git
synced 2026-01-24 05:42:14 +00:00
1b9e904cc7
This adds a new macro for the unit-tests which checks a range of values on the device against an array of values on the host. This simplifies writing tests and removes the need to explicitly copy values back to the host for verification.
172 lines
7.2 KiB
C++
172 lines
7.2 KiB
C++
//---------------------------------------------------------------------------//
|
|
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0
|
|
// See accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt
|
|
//
|
|
// See http://kylelutz.github.com/compute for more information.
|
|
//---------------------------------------------------------------------------//
|
|
|
|
#define BOOST_TEST_MODULE TestInsertionSort
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
#include <boost/compute/system.hpp>
|
|
#include <boost/compute/algorithm/is_sorted.hpp>
|
|
#include <boost/compute/algorithm/detail/insertion_sort.hpp>
|
|
#include <boost/compute/container/vector.hpp>
|
|
|
|
#include "check_macros.hpp"
|
|
#include "context_setup.hpp"
|
|
|
|
namespace bc = boost::compute;
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_char_vector)
|
|
{
|
|
using boost::compute::char_;
|
|
|
|
char_ data[] = { 'c', 'a', '0', '7', 'B', 'F', '\0', '$' };
|
|
boost::compute::vector<char_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(char_, 8, vector, ('\0', '$', '0', '7', 'B', 'F', 'a', 'c'));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_uchar_vector)
|
|
{
|
|
using boost::compute::uchar_;
|
|
|
|
uchar_ data[] = { 0x12, 0x00, 0xFF, 0xB4, 0x80, 0x32, 0x64, 0xA2 };
|
|
boost::compute::vector<uchar_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(uchar_, 8, vector, (0x00, 0x12, 0x32, 0x64, 0x80, 0xA2, 0xB4, 0xFF));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_short_vector)
|
|
{
|
|
using boost::compute::short_;
|
|
|
|
short_ data[] = { -4, 152, -94, 963, 31002, -456, 0, -2113 };
|
|
boost::compute::vector<short_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(short_, 8, vector, (-2113, -456, -94, -4, 0, 152, 963, 31002));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_ushort_vector)
|
|
{
|
|
using boost::compute::ushort_;
|
|
|
|
ushort_ data[] = { 4, 152, 94, 963, 63202, 34560, 0, 2113 };
|
|
boost::compute::vector<ushort_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(ushort_, 8, vector, (0, 4, 94, 152, 963, 2113, 34560, 63202));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_int_vector)
|
|
{
|
|
int data[] = { -4, 152, -5000, 963, 75321, -456, 0, 1112 };
|
|
boost::compute::vector<int> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(int, 8, vector, (-5000, -456, -4, 0, 152, 963, 1112, 75321));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_uint_vector)
|
|
{
|
|
using boost::compute::uint_;
|
|
|
|
uint_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
|
|
boost::compute::vector<uint_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(uint_, 8, vector, (0, 500, 562, 1988, 9852, 102030, 123456, 4000000));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_long_vector)
|
|
{
|
|
using boost::compute::long_;
|
|
|
|
long_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
|
|
boost::compute::vector<long_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(long_, 8, vector, (0, 500, 562, 1988, 9852, 102030, 123456, 4000000));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_ulong_vector)
|
|
{
|
|
using boost::compute::ulong_;
|
|
|
|
ulong_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
|
|
boost::compute::vector<ulong_> vector(data, data + 8, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(ulong_, 8, vector, (0, 500, 562, 1988, 9852, 102030, 123456, 4000000));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_float_vector)
|
|
{
|
|
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, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(10));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(
|
|
float, 10, vector,
|
|
(-6023.0f, -5000.1f, -63.0f, -8.25f, -0.0f, 0.0f, 11.2f, 14.0f, 152.5f, 1234567.0f)
|
|
);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(sort_double_vector)
|
|
{
|
|
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, context);
|
|
BOOST_CHECK_EQUAL(vector.size(), size_t(10));
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
|
|
|
|
boost::compute::detail::serial_insertion_sort(vector.begin(), vector.end(), queue);
|
|
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
|
|
CHECK_RANGE_EQUAL(
|
|
double, 10, vector,
|
|
(-6023.0, -5000.1, -63.0, -8.25, -0.0, 0.0, 11.2, 14.0, 152.5, 1234567.0)
|
|
);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|