1 #include "util/joint_sort.hh"
2
3 #define BOOST_TEST_MODULE JointSortTest
4 #include <boost/test/unit_test.hpp>
5
6 namespace util { namespace {
7
BOOST_AUTO_TEST_CASE(just_flip)8 BOOST_AUTO_TEST_CASE(just_flip) {
9 char keys[2];
10 int values[2];
11 keys[0] = 1; values[0] = 327;
12 keys[1] = 0; values[1] = 87897;
13 JointSort<char *, int *>(keys + 0, keys + 2, values + 0);
14 BOOST_CHECK_EQUAL(0, keys[0]);
15 BOOST_CHECK_EQUAL(87897, values[0]);
16 BOOST_CHECK_EQUAL(1, keys[1]);
17 BOOST_CHECK_EQUAL(327, values[1]);
18 }
19
BOOST_AUTO_TEST_CASE(three)20 BOOST_AUTO_TEST_CASE(three) {
21 char keys[3];
22 int values[3];
23 keys[0] = 1; values[0] = 327;
24 keys[1] = 2; values[1] = 87897;
25 keys[2] = 0; values[2] = 10;
26 JointSort<char *, int *>(keys + 0, keys + 3, values + 0);
27 BOOST_CHECK_EQUAL(0, keys[0]);
28 BOOST_CHECK_EQUAL(1, keys[1]);
29 BOOST_CHECK_EQUAL(2, keys[2]);
30 }
31
BOOST_AUTO_TEST_CASE(char_int)32 BOOST_AUTO_TEST_CASE(char_int) {
33 char keys[4];
34 int values[4];
35 keys[0] = 3; values[0] = 327;
36 keys[1] = 1; values[1] = 87897;
37 keys[2] = 2; values[2] = 10;
38 keys[3] = 0; values[3] = 24347;
39 JointSort<char *, int *>(keys + 0, keys + 4, values + 0);
40 BOOST_CHECK_EQUAL(0, keys[0]);
41 BOOST_CHECK_EQUAL(24347, values[0]);
42 BOOST_CHECK_EQUAL(1, keys[1]);
43 BOOST_CHECK_EQUAL(87897, values[1]);
44 BOOST_CHECK_EQUAL(2, keys[2]);
45 BOOST_CHECK_EQUAL(10, values[2]);
46 BOOST_CHECK_EQUAL(3, keys[3]);
47 BOOST_CHECK_EQUAL(327, values[3]);
48 }
49
BOOST_AUTO_TEST_CASE(swap_proxy)50 BOOST_AUTO_TEST_CASE(swap_proxy) {
51 char keys[2] = {0, 1};
52 int values[2] = {2, 3};
53 detail::JointProxy<char *, int *> first(keys, values);
54 detail::JointProxy<char *, int *> second(keys + 1, values + 1);
55 swap(first, second);
56 BOOST_CHECK_EQUAL(1, keys[0]);
57 BOOST_CHECK_EQUAL(0, keys[1]);
58 BOOST_CHECK_EQUAL(3, values[0]);
59 BOOST_CHECK_EQUAL(2, values[1]);
60 }
61
62 }} // namespace anonymous util
63