Skip to content

Commit a127310

Browse files
jszuppejszuppe
committed
Add test for stable_sort_by_key()
1 parent 73ef474 commit a127310

File tree

2 files changed

+166
-0
lines changed

2 files changed

+166
-0
lines changed

‎test/CMakeLists.txt

+1
Original file line numberDiff line numberDiff line change
@@ -142,6 +142,7 @@ add_compute_test("algorithm.sort" test_sort.cpp)
142142
add_compute_test("algorithm.sort_by_key" test_sort_by_key.cpp)
143143
add_compute_test("algorithm.stable_partition" test_stable_partition.cpp)
144144
add_compute_test("algorithm.stable_sort" test_stable_sort.cpp)
145+
add_compute_test("algorithm.stable_sort_by_key" test_stable_sort_by_key.cpp)
145146
add_compute_test("algorithm.transform" test_transform.cpp)
146147
add_compute_test("algorithm.transform_if" test_transform_if.cpp)
147148
add_compute_test("algorithm.transform_reduce" test_transform_reduce.cpp)

‎test/test_stable_sort_by_key.cpp

+165
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,165 @@
1+
//---------------------------------------------------------------------------//
2+
// Copyright (c) 2016 Jakub Szuppe <[email protected]>
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 TestStableSortByKey
12+
#include <boost/test/unit_test.hpp>
13+
14+
#include <boost/compute/system.hpp>
15+
#include <boost/compute/algorithm/stable_sort_by_key.hpp>
16+
#include <boost/compute/algorithm/is_sorted.hpp>
17+
#include <boost/compute/container/vector.hpp>
18+
19+
#include "check_macros.hpp"
20+
#include "context_setup.hpp"
21+
22+
namespace compute = boost::compute;
23+
24+
BOOST_AUTO_TEST_CASE(empty_int_by_int)
25+
{
26+
compute::vector<compute::int_> keys(size_t(0), compute::int_(0), queue);
27+
compute::vector<compute::int_> values(size_t(0), compute::int_(0), queue);
28+
29+
BOOST_CHECK_EQUAL(keys.size(), size_t(0));
30+
BOOST_CHECK_EQUAL(values.size(), size_t(0));
31+
32+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
33+
BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue));
34+
35+
compute::stable_sort_by_key(
36+
keys.begin(), keys.end(), values.begin(), queue
37+
);
38+
39+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end()));
40+
BOOST_CHECK(compute::is_sorted(values.begin(), values.end()));
41+
}
42+
43+
BOOST_AUTO_TEST_CASE(one_element_int_by_int)
44+
{
45+
compute::int_ keys_data[] = { 1 };
46+
compute::int_ values_data[] = { 2 };
47+
48+
compute::vector<compute::int_> keys(keys_data, keys_data + 1, queue);
49+
compute::vector<compute::int_> values(values_data, values_data + 1, queue);
50+
51+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
52+
BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue));
53+
54+
compute::stable_sort_by_key(keys.begin(), keys.end(), values.begin(), queue);
55+
56+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
57+
BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue));
58+
}
59+
60+
BOOST_AUTO_TEST_CASE(two_elements_int_by_int)
61+
{
62+
compute::int_ keys_data[] = { 1, -1 };
63+
compute::int_ values_data[] = { -10, 1 };
64+
65+
compute::vector<compute::int_> keys(keys_data, keys_data + 2, queue);
66+
compute::vector<compute::int_> values(values_data, values_data + 2, queue);
67+
68+
BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue));
69+
compute::stable_sort_by_key(keys.begin(), keys.end(), values.begin(), queue);
70+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
71+
}
72+
73+
BOOST_AUTO_TEST_CASE(stable_sort_int_by_int)
74+
{
75+
compute::int_ keys_data[] = { 10, 9, 2, 7, 6, -1, 4, 2, 2, 10 };
76+
compute::int_ values_data[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
77+
78+
compute::vector<compute::int_> keys(keys_data, keys_data + 10, queue);
79+
compute::vector<compute::int_> values(values_data, values_data + 10, queue);
80+
81+
BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue));
82+
compute::stable_sort_by_key(keys.begin(), keys.end(), values.begin(), queue);
83+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
84+
85+
CHECK_RANGE_EQUAL(
86+
compute::int_, 10, keys,
87+
(-1, 2, 2, 2, 4, 6, 7, 9, 10, 10) // keys
88+
// ( 6, 3, 8, 9, 7, 5, 4, 2, 1, 10) values
89+
);
90+
CHECK_RANGE_EQUAL(
91+
compute::int_, 10, values,
92+
// (-1, 2, 2, 2, 4, 6, 7, 9, 10, 10) keys
93+
( 6, 3, 8, 9, 7, 5, 4, 2, 1, 10) // values
94+
);
95+
}
96+
97+
BOOST_AUTO_TEST_CASE(stable_sort_uint_by_uint)
98+
{
99+
compute::uint_ keys_data[] = { 10, 9, 2, 7, 6, 1, 4, 2, 2, 10 };
100+
compute::uint_ values_data[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
101+
102+
compute::vector<compute::uint_> keys(keys_data, keys_data + 10, queue);
103+
compute::vector<compute::uint_> values(values_data, values_data + 10, queue);
104+
105+
BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue));
106+
compute::stable_sort_by_key(keys.begin(), keys.end(), values.begin(), queue);
107+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
108+
109+
CHECK_RANGE_EQUAL(
110+
compute::uint_, 10, keys,
111+
(1, 2, 2, 2, 4, 6, 7, 9, 10, 10) // keys
112+
// (6, 3, 8, 9, 7, 5, 4, 2, 1, 10) values
113+
);
114+
CHECK_RANGE_EQUAL(
115+
compute::uint_, 10, values,
116+
// (1, 2, 2, 2, 4, 6, 7, 9, 10, 10) keys
117+
(6, 3, 8, 9, 7, 5, 4, 2, 1, 10) // values
118+
);
119+
}
120+
121+
BOOST_AUTO_TEST_CASE(stable_sort_int_by_float)
122+
{
123+
compute::float_ keys_data[] = { 10., 5.5, 10., 7., 5.5};
124+
compute::int_ values_data[] = { 1, 200, -10, 2, 4 };
125+
126+
compute::vector<compute::float_> keys(keys_data, keys_data + 5, queue);
127+
compute::vector<compute::uint_> values(values_data, values_data + 5, queue);
128+
129+
BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue));
130+
compute::stable_sort_by_key(keys.begin(), keys.end(), values.begin(), queue);
131+
BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue));
132+
133+
CHECK_RANGE_EQUAL(
134+
compute::float_, 5, keys,
135+
(5.5, 5.5, 7., 10., 10.) // keys
136+
// (200, 4, 2, 1, -10) values
137+
);
138+
CHECK_RANGE_EQUAL(
139+
compute::int_, 5, values,
140+
// (5.5, 5.5, 7., 10., 10.) keys
141+
(200, 4, 2, 1, -10) // values
142+
);
143+
}
144+
145+
BOOST_AUTO_TEST_CASE(stable_sort_char_by_int)
146+
{
147+
compute::int_ keys_data[] = { 6, 1, 1, 3, 4, 7, 5, 1 };
148+
compute::char_ values_data[] = { 'g', 'c', 'b', 'd', 'e', 'h', 'f', 'a' };
149+
150+
compute::vector<compute::int_> keys(keys_data, keys_data + 8, queue);
151+
compute::vector<compute::char_> values(values_data, values_data + 8, queue);
152+
153+
compute::sort_by_key(keys.begin(), keys.end(), values.begin(), queue);
154+
155+
CHECK_RANGE_EQUAL(
156+
compute::int_, 8, keys,
157+
(1, 1, 1, 3, 4, 5, 6, 7)
158+
);
159+
CHECK_RANGE_EQUAL(
160+
compute::char_, 8, values,
161+
('c', 'b', 'a', 'd', 'e', 'f', 'g', 'h')
162+
);
163+
}
164+
165+
BOOST_AUTO_TEST_SUITE_END()

0 commit comments

Comments
 (0)