1 //---------------------------------------------------------------------------//
2 // Copyright (c) 2013-2014 Kyle Lutz <kyle.r.lutz@gmail.com>
3 //
4 // Distributed under the Boost Software License, Version 1.0
5 // See accompanying file LICENSE_1_0.txt or copy at
6 // http://www.boost.org/LICENSE_1_0.txt
7 //
8 // See http://boostorg.github.com/compute for more information.
9 //---------------------------------------------------------------------------//
10
11 #define BOOST_TEST_MODULE TestIsSorted
12 #include <boost/test/unit_test.hpp>
13
14 #include <boost/compute/system.hpp>
15 #include <boost/compute/algorithm/iota.hpp>
16 #include <boost/compute/algorithm/is_sorted.hpp>
17 #include <boost/compute/algorithm/sort.hpp>
18 #include <boost/compute/algorithm/reverse.hpp>
19 #include <boost/compute/container/vector.hpp>
20
21 #include "context_setup.hpp"
22
23 namespace compute = boost::compute;
24
BOOST_AUTO_TEST_CASE(is_sorted_int)25 BOOST_AUTO_TEST_CASE(is_sorted_int)
26 {
27 compute::vector<int> vec(context);
28 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
29
30 vec.push_back(1, queue);
31 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
32
33 vec.push_back(2, queue);
34 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
35
36 vec.push_back(0, queue);
37 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue) == false);
38
39 vec.push_back(-2, queue);
40 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue) == false);
41
42 compute::sort(vec.begin(), vec.end(), queue);
43 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
44 }
45
BOOST_AUTO_TEST_CASE(is_sorted_ones)46 BOOST_AUTO_TEST_CASE(is_sorted_ones)
47 {
48 compute::vector<int> vec(2048, context);
49 compute::fill(vec.begin(), vec.end(), 1, queue);
50 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
51 }
52
BOOST_AUTO_TEST_CASE(is_sorted_iota)53 BOOST_AUTO_TEST_CASE(is_sorted_iota)
54 {
55 // create vector with values from 1..1000
56 compute::vector<int> vec(1000, context);
57 compute::iota(vec.begin(), vec.end(), 1, queue);
58 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
59
60 // reverse the range
61 compute::reverse(vec.begin(), vec.end(), queue);
62 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue) == false);
63 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), compute::greater<int>(), queue));
64
65 // reverse it back
66 compute::reverse(vec.begin(), vec.end(), queue);
67 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue));
68 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), compute::greater<int>(), queue) == false);
69 }
70
71 BOOST_AUTO_TEST_SUITE_END()
72