test_radix_sort.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543
  1. //---------------------------------------------------------------------------//
  2. // Copyright (c) 2013 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. #define BOOST_TEST_MODULE TestRadixSort
  11. #include <boost/test/unit_test.hpp>
  12. #include <iostream>
  13. #include <boost/compute/system.hpp>
  14. #include <boost/compute/algorithm/is_sorted.hpp>
  15. #include <boost/compute/algorithm/detail/radix_sort.hpp>
  16. #include <boost/compute/container/vector.hpp>
  17. #include "quirks.hpp"
  18. #include "check_macros.hpp"
  19. #include "context_setup.hpp"
  20. namespace bc = boost::compute;
  21. const bool descending = false;
  22. BOOST_AUTO_TEST_CASE(sort_char_vector)
  23. {
  24. if(is_apple_cpu_device(device)) {
  25. std::cerr
  26. << "skipping all radix_sort tests due to Apple platform"
  27. << " behavior when local memory is used on a CPU device"
  28. << std::endl;
  29. return;
  30. }
  31. using boost::compute::char_;
  32. char_ data[] = { 'c', 'a', '0', '7', 'B', 'F', '\0', '$' };
  33. boost::compute::vector<char_> vector(data, data + 8, queue);
  34. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  35. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  36. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  37. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  38. CHECK_RANGE_EQUAL(char_, 8, vector, ('\0', '$', '0', '7', 'B', 'F', 'a', 'c'));
  39. }
  40. BOOST_AUTO_TEST_CASE(sort_uchar_vector)
  41. {
  42. if(is_apple_cpu_device(device)) {
  43. return;
  44. }
  45. using boost::compute::uchar_;
  46. uchar_ data[] = { 0x12, 0x00, 0xFF, 0xB4, 0x80, 0x32, 0x64, 0xA2 };
  47. boost::compute::vector<uchar_> vector(data, data + 8, queue);
  48. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  49. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  50. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  51. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  52. CHECK_RANGE_EQUAL(uchar_, 8, vector, (0x00, 0x12, 0x32, 0x64, 0x80, 0xA2, 0xB4, 0xFF));
  53. }
  54. BOOST_AUTO_TEST_CASE(sort_short_vector)
  55. {
  56. if(is_apple_cpu_device(device)) {
  57. return;
  58. }
  59. using boost::compute::short_;
  60. short_ data[] = { -4, 152, -94, 963, 31002, -456, 0, -2113 };
  61. boost::compute::vector<short_> vector(data, data + 8, queue);
  62. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  63. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  64. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  65. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  66. CHECK_RANGE_EQUAL(short_, 8, vector, (-2113, -456, -94, -4, 0, 152, 963, 31002));
  67. }
  68. BOOST_AUTO_TEST_CASE(sort_ushort_vector)
  69. {
  70. if(is_apple_cpu_device(device)) {
  71. return;
  72. }
  73. using boost::compute::ushort_;
  74. ushort_ data[] = { 4, 152, 94, 963, 63202, 34560, 0, 2113 };
  75. boost::compute::vector<ushort_> vector(data, data + 8, queue);
  76. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  77. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  78. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  79. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  80. CHECK_RANGE_EQUAL(ushort_, 8, vector, (0, 4, 94, 152, 963, 2113, 34560, 63202));
  81. }
  82. BOOST_AUTO_TEST_CASE(sort_int_vector)
  83. {
  84. if(is_apple_cpu_device(device)) {
  85. return;
  86. }
  87. int data[] = { -4, 152, -5000, 963, 75321, -456, 0, 1112 };
  88. boost::compute::vector<int> vector(data, data + 8, queue);
  89. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  90. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  91. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  92. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  93. CHECK_RANGE_EQUAL(int, 8, vector, (-5000, -456, -4, 0, 152, 963, 1112, 75321));
  94. }
  95. BOOST_AUTO_TEST_CASE(sort_uint_vector)
  96. {
  97. if(is_apple_cpu_device(device)) {
  98. return;
  99. }
  100. using boost::compute::uint_;
  101. uint_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
  102. boost::compute::vector<uint_> vector(data, data + 8, queue);
  103. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  104. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  105. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  106. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  107. CHECK_RANGE_EQUAL(uint_, 8, vector, (0, 500, 562, 1988, 9852, 102030, 123456, 4000000));
  108. }
  109. BOOST_AUTO_TEST_CASE(sort_long_vector)
  110. {
  111. if(is_apple_cpu_device(device)) {
  112. return;
  113. }
  114. using boost::compute::long_;
  115. long_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
  116. boost::compute::vector<long_> vector(data, data + 8, queue);
  117. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  118. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  119. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  120. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  121. CHECK_RANGE_EQUAL(long_, 8, vector, (0, 500, 562, 1988, 9852, 102030, 123456, 4000000));
  122. }
  123. BOOST_AUTO_TEST_CASE(sort_ulong_vector)
  124. {
  125. if(is_apple_cpu_device(device)) {
  126. return;
  127. }
  128. using boost::compute::ulong_;
  129. ulong_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
  130. boost::compute::vector<ulong_> vector(data, data + 8, queue);
  131. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  132. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  133. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  134. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  135. CHECK_RANGE_EQUAL(ulong_, 8, vector, (0, 500, 562, 1988, 9852, 102030, 123456, 4000000));
  136. }
  137. BOOST_AUTO_TEST_CASE(sort_float_vector)
  138. {
  139. if(is_apple_cpu_device(device)) {
  140. return;
  141. }
  142. float data[] = { -6023.0f, 152.5f, -63.0f, 1234567.0f, 11.2f,
  143. -5000.1f, 0.0f, 14.0f, -8.25f, -0.0f };
  144. boost::compute::vector<float> vector(data, data + 10, queue);
  145. BOOST_CHECK_EQUAL(vector.size(), size_t(10));
  146. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  147. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  148. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  149. CHECK_RANGE_EQUAL(
  150. float, 10, vector,
  151. (-6023.0f, -5000.1f, -63.0f, -8.25f, -0.0f, 0.0f, 11.2f, 14.0f, 152.5f, 1234567.0f)
  152. );
  153. // copy data, sort, and check again (to check program caching)
  154. boost::compute::copy(data, data + 10, vector.begin(), queue);
  155. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  156. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  157. CHECK_RANGE_EQUAL(
  158. float, 10, vector,
  159. (-6023.0f, -5000.1f, -63.0f, -8.25f, -0.0f, 0.0f, 11.2f, 14.0f, 152.5f, 1234567.0f)
  160. );
  161. }
  162. BOOST_AUTO_TEST_CASE(sort_double_vector)
  163. {
  164. if(is_apple_cpu_device(device)) {
  165. return;
  166. }
  167. if(!device.supports_extension("cl_khr_fp64")){
  168. std::cout << "skipping test: device does not support double" << std::endl;
  169. return;
  170. }
  171. double data[] = { -6023.0, 152.5, -63.0, 1234567.0, 11.2,
  172. -5000.1, 0.0, 14.0, -8.25, -0.0 };
  173. boost::compute::vector<double> vector(data, data + 10, queue);
  174. BOOST_CHECK_EQUAL(vector.size(), size_t(10));
  175. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false);
  176. boost::compute::detail::radix_sort(vector.begin(), vector.end(), queue);
  177. BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true);
  178. CHECK_RANGE_EQUAL(
  179. double, 10, vector,
  180. (-6023.0, -5000.1, -63.0, -8.25, -0.0, 0.0, 11.2, 14.0, 152.5, 1234567.0)
  181. );
  182. }
  183. BOOST_AUTO_TEST_CASE(sort_char_vector_desc)
  184. {
  185. if(is_apple_cpu_device(device)) {
  186. return;
  187. }
  188. using boost::compute::char_;
  189. char_ data[] = { 'c', 'a', '0', '7', 'B', 'F', '\0', '$' };
  190. boost::compute::vector<char_> vector(data, data + 8, queue);
  191. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  192. BOOST_CHECK(!boost::compute::is_sorted(
  193. vector.begin(), vector.end(), boost::compute::greater<char_>(), queue
  194. ));
  195. boost::compute::detail::radix_sort(
  196. vector.begin(), vector.end(), descending, queue
  197. );
  198. BOOST_CHECK(boost::compute::is_sorted(
  199. vector.begin(), vector.end(), boost::compute::greater<char_>(), queue
  200. ));
  201. CHECK_RANGE_EQUAL(
  202. char_, 8, vector,
  203. ('c', 'a', 'F', 'B', '7', '0', '$', '\0')
  204. );
  205. }
  206. BOOST_AUTO_TEST_CASE(sort_uchar_vector_desc)
  207. {
  208. if(is_apple_cpu_device(device)) {
  209. return;
  210. }
  211. using boost::compute::uchar_;
  212. uchar_ data[] = { 0x12, 0x00, 0xFF, 0xB4, 0x80, 0x32, 0x64, 0xA2 };
  213. boost::compute::vector<uchar_> vector(data, data + 8, queue);
  214. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  215. BOOST_CHECK(!boost::compute::is_sorted(
  216. vector.begin(), vector.end(), boost::compute::greater<uchar_>(), queue
  217. ));
  218. boost::compute::detail::radix_sort(
  219. vector.begin(), vector.end(), descending, queue
  220. );
  221. BOOST_CHECK(boost::compute::is_sorted(
  222. vector.begin(), vector.end(), boost::compute::greater<uchar_>(), queue
  223. ));
  224. CHECK_RANGE_EQUAL(
  225. uchar_, 8, vector,
  226. (0xFF, 0xB4, 0xA2, 0x80, 0x64, 0x32, 0x12, 0x00)
  227. );
  228. }
  229. BOOST_AUTO_TEST_CASE(sort_short_vector_desc)
  230. {
  231. if(is_apple_cpu_device(device)) {
  232. return;
  233. }
  234. using boost::compute::short_;
  235. short_ data[] = { -4, 152, -94, 963, 31002, -456, 0, -2113 };
  236. boost::compute::vector<short_> vector(data, data + 8, queue);
  237. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  238. BOOST_CHECK(!boost::compute::is_sorted(
  239. vector.begin(), vector.end(), boost::compute::greater<short_>(), queue
  240. ));
  241. boost::compute::detail::radix_sort(
  242. vector.begin(), vector.end(), descending, queue
  243. );
  244. BOOST_CHECK(boost::compute::is_sorted(
  245. vector.begin(), vector.end(), boost::compute::greater<short_>(), queue
  246. ));
  247. CHECK_RANGE_EQUAL(
  248. short_, 8, vector,
  249. (31002, 963, 152, 0, -4, -94, -456, -2113)
  250. );
  251. }
  252. BOOST_AUTO_TEST_CASE(sort_ushort_vector_desc)
  253. {
  254. if(is_apple_cpu_device(device)) {
  255. return;
  256. }
  257. using boost::compute::ushort_;
  258. ushort_ data[] = { 4, 152, 94, 963, 63202, 34560, 0, 2113 };
  259. boost::compute::vector<ushort_> vector(data, data + 8, queue);
  260. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  261. BOOST_CHECK(!boost::compute::is_sorted(
  262. vector.begin(), vector.end(), boost::compute::greater<ushort_>(), queue
  263. ));
  264. boost::compute::detail::radix_sort(
  265. vector.begin(), vector.end(), descending, queue
  266. );
  267. BOOST_CHECK(boost::compute::is_sorted(
  268. vector.begin(), vector.end(), boost::compute::greater<ushort_>(), queue
  269. ));
  270. CHECK_RANGE_EQUAL(
  271. ushort_, 8, vector,
  272. (63202, 34560, 2113, 963, 152, 94, 4, 0)
  273. );
  274. }
  275. BOOST_AUTO_TEST_CASE(sort_int_vector_desc)
  276. {
  277. if(is_apple_cpu_device(device)) {
  278. return;
  279. }
  280. using boost::compute::int_;
  281. int_ data[] = { -4, 152, -5000, 963, 75321, -456, 0, 1112 };
  282. boost::compute::vector<int_> vector(data, data + 8, queue);
  283. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  284. BOOST_CHECK(!boost::compute::is_sorted(
  285. vector.begin(), vector.end(), boost::compute::greater<int_>(), queue
  286. ));
  287. boost::compute::detail::radix_sort(
  288. vector.begin(), vector.end(), descending, queue
  289. );
  290. BOOST_CHECK(boost::compute::is_sorted(
  291. vector.begin(), vector.end(), boost::compute::greater<int_>(), queue
  292. ));
  293. CHECK_RANGE_EQUAL(
  294. int_, 8, vector,
  295. (75321, 1112, 963, 152, 0, -4, -456, -5000)
  296. );
  297. }
  298. BOOST_AUTO_TEST_CASE(sort_uint_vector_desc)
  299. {
  300. if(is_apple_cpu_device(device)) {
  301. return;
  302. }
  303. using boost::compute::uint_;
  304. uint_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
  305. boost::compute::vector<uint_> vector(data, data + 8, queue);
  306. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  307. BOOST_CHECK(!boost::compute::is_sorted(
  308. vector.begin(), vector.end(), boost::compute::greater<uint_>(), queue
  309. ));
  310. boost::compute::detail::radix_sort(
  311. vector.begin(), vector.end(), descending, queue
  312. );
  313. BOOST_CHECK(boost::compute::is_sorted(
  314. vector.begin(), vector.end(), boost::compute::greater<uint_>(), queue
  315. ));
  316. CHECK_RANGE_EQUAL(
  317. uint_, 8, vector,
  318. (4000000, 123456, 102030, 9852, 1988, 562, 500, 0)
  319. );
  320. }
  321. BOOST_AUTO_TEST_CASE(sort_long_vector_desc)
  322. {
  323. if(is_apple_cpu_device(device)) {
  324. return;
  325. }
  326. using boost::compute::long_;
  327. long_ data[] = { -500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
  328. boost::compute::vector<long_> vector(data, data + 8, queue);
  329. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  330. BOOST_CHECK(!boost::compute::is_sorted(
  331. vector.begin(), vector.end(), boost::compute::greater<long_>(), queue
  332. ));
  333. boost::compute::detail::radix_sort(
  334. vector.begin(), vector.end(), descending, queue
  335. );
  336. BOOST_CHECK(boost::compute::is_sorted(
  337. vector.begin(), vector.end(), boost::compute::greater<long_>(), queue
  338. ));
  339. CHECK_RANGE_EQUAL(
  340. long_, 8, vector,
  341. (4000000, 123456, 102030, 9852, 1988, 562, 0, -500)
  342. );
  343. }
  344. BOOST_AUTO_TEST_CASE(sort_ulong_vector_desc)
  345. {
  346. if(is_apple_cpu_device(device)) {
  347. return;
  348. }
  349. using boost::compute::ulong_;
  350. ulong_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
  351. boost::compute::vector<ulong_> vector(data, data + 8, queue);
  352. BOOST_CHECK_EQUAL(vector.size(), size_t(8));
  353. BOOST_CHECK(!boost::compute::is_sorted(
  354. vector.begin(), vector.end(), boost::compute::greater<ulong_>(), queue
  355. ));
  356. boost::compute::detail::radix_sort(
  357. vector.begin(), vector.end(), descending, queue
  358. );
  359. BOOST_CHECK(boost::compute::is_sorted(
  360. vector.begin(), vector.end(), boost::compute::greater<ulong_>(), queue
  361. ));
  362. CHECK_RANGE_EQUAL(
  363. ulong_, 8, vector,
  364. (4000000, 123456, 102030, 9852, 1988, 562, 500, 0)
  365. );
  366. }
  367. BOOST_AUTO_TEST_CASE(sort_float_vector_desc)
  368. {
  369. if(is_apple_cpu_device(device)) {
  370. return;
  371. }
  372. float data[] = {
  373. -6023.0f, 152.5f, -63.0f, 1234567.0f, 11.2f,
  374. -5000.1f, 0.0f, 14.0f, -8.25f, -0.0f
  375. };
  376. boost::compute::vector<float> vector(data, data + 10, queue);
  377. BOOST_CHECK_EQUAL(vector.size(), size_t(10));
  378. BOOST_CHECK(!boost::compute::is_sorted(
  379. vector.begin(), vector.end(), boost::compute::greater<float>(), queue
  380. ));
  381. boost::compute::detail::radix_sort(
  382. vector.begin(), vector.end(), descending, queue
  383. );
  384. BOOST_CHECK(boost::compute::is_sorted(
  385. vector.begin(), vector.end(), boost::compute::greater<float>(), queue
  386. ));
  387. CHECK_RANGE_EQUAL(
  388. float, 10, vector,
  389. (1234567.0f, 152.5f, 14.0f, 11.2f, 0.0f, -0.0f, -8.25f, -63.0f, -5000.1f, -6023.0f)
  390. );
  391. // copy data, sort, and check again (to check program caching)
  392. boost::compute::copy(data, data + 10, vector.begin(), queue);
  393. boost::compute::detail::radix_sort(
  394. vector.begin(), vector.end(), descending, queue
  395. );
  396. BOOST_CHECK(boost::compute::is_sorted(
  397. vector.begin(), vector.end(), boost::compute::greater<float>(), queue
  398. ));
  399. CHECK_RANGE_EQUAL(
  400. float, 10, vector,
  401. (1234567.0f, 152.5f, 14.0f, 11.2f, 0.0f, -0.0f, -8.25f, -63.0f, -5000.1f, -6023.0f)
  402. );
  403. }
  404. BOOST_AUTO_TEST_CASE(sort_double_vector_desc)
  405. {
  406. if(is_apple_cpu_device(device)) {
  407. return;
  408. }
  409. if(!device.supports_extension("cl_khr_fp64")){
  410. std::cout << "skipping test: device does not support double" << std::endl;
  411. return;
  412. }
  413. double data[] = {
  414. -6023.0, 152.5, -63.0, 1234567.0, 11.2, -5000.1, 0.0, 14.0, -8.25, -0.0
  415. };
  416. boost::compute::vector<double> vector(data, data + 10, queue);
  417. BOOST_CHECK_EQUAL(vector.size(), size_t(10));
  418. BOOST_CHECK(!boost::compute::is_sorted(
  419. vector.begin(), vector.end(), boost::compute::greater<double>(), queue
  420. ));
  421. boost::compute::detail::radix_sort(
  422. vector.begin(), vector.end(), descending, queue
  423. );
  424. BOOST_CHECK(boost::compute::is_sorted(
  425. vector.begin(), vector.end(), boost::compute::greater<double>(), queue
  426. ));
  427. CHECK_RANGE_EQUAL(
  428. double, 10, vector,
  429. (1234567.0, 152.5, 14.0, 11.2, 0.0, -0.0, -8.25, -63.0, -5000.1, -6023.0)
  430. );
  431. }
  432. BOOST_AUTO_TEST_CASE(sort_partial_vector)
  433. {
  434. if(is_apple_cpu_device(device)) {
  435. return;
  436. }
  437. int data[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
  438. boost::compute::vector<int> vec(data, data + 10, queue);
  439. boost::compute::detail::radix_sort(vec.begin() + 2, vec.end() - 2, queue);
  440. CHECK_RANGE_EQUAL(int, 10, vec, (9, 8, 2, 3, 4, 5, 6, 7, 1, 0));
  441. }
  442. BOOST_AUTO_TEST_SUITE_END()