37     std::vector< uint64_t > V1;  in test1()  local
38     V1.reserve (NElem);  in test1()
41     V1.clear ( );  in test1()
42     for (uint32_t i = 0; i < NElem; ++i) V1.push_back (i);  in test1()
44     block_indirect_sort ( V1.begin ( ), V1.end ( ), 4);  in test1()
46     {   BOOST_CHECK (V1[ i - 1 ] <= V1[ i ]);  in test1()
50     V1.clear ( );  in test1()
51     for (uint32_t i = 0; i < NElem; ++i) V1.push_back (NElem - i);  in test1()
53     block_indirect_sort ( V1.begin ( ), V1.end ( ), 4);  in test1()
55     {   BOOST_CHECK (V1[ i - 1 ] <= V1[ i ]);  in test1()
59     V1.clear ( );  in test1()
60     for (uint32_t i = 0; i < NElem; ++i) V1.push_back (1000);  in test1()
62     block_indirect_sort (V1.begin ( ), V1.end ( ), 4);  in test1()
64     {   BOOST_CHECK (V1[ i - 1 ] == V1[ i ]);  in test1()
68     V1.clear ( );  in test1()
69     for (uint32_t i = 0; i < NElem; ++i) V1.push_back (i);      in test1()
71      block_indirect_sort ( V1.begin ( ), V1.end ( ), 8);  in test1()
73     {   BOOST_CHECK (V1[ i - 1 ] <= V1[ i ]);  in test1()
77     V1.clear ( );  in test1()
78     for (uint32_t i = 0; i < NElem; ++i) V1.push_back (NElem - i);  in test1()
80     block_indirect_sort ( V1.begin ( ), V1.end ( ), 8);  in test1()
82     {   BOOST_CHECK (V1[ i - 1 ] <= V1[ i ]);  in test1()
86     V1.clear ( );  in test1()
87     for (uint32_t i = 0; i < NElem; ++i) V1.push_back (1000);  in test1()
89     block_indirect_sort (V1.begin ( ), V1.end ( ), 8);  in test1()
91     {   BOOST_CHECK (V1[ i - 1 ] == V1[ i ]);  in test1()
98     std::vector< uint64_t > V1, V2;  in test2()  local
99     V1.reserve ( NELEM ) ;  in test2()
105     V1 = Vrandom;  in test2()
106     block_indirect_sort (V1.begin ( ), V1.end ( ), compare(), 0);  in test2()
107     for (unsigned i = 0; i < V1.size(); i++)  in test2()
108     {   BOOST_CHECK (V1[i] == V2[i]);  in test2()
112     V1 = Vrandom;  in test2()
113     block_indirect_sort (V1.begin ( ), V1.end ( ), compare(), 4);  in test2()
114     for (unsigned i = 0; i < V1.size(); i++)  in test2()
115     {   BOOST_CHECK (V1[i] == V2[i]);  in test2()
119     V1 = Vrandom;  in test2()
120     block_indirect_sort (V1.begin ( ), V1.end ( ), compare(), 8);  in test2()
121     for (unsigned i = 0; i < V1.size(); i++)  in test2()
122     {   BOOST_CHECK (V1[i] == V2[i]);  in test2()
126     V1 = Vrandom;  in test2()
127     block_indirect_sort ( V1.begin ( ), V1.end ( ), compare(), 16);  in test2()
128     for (unsigned i = 0; i < V1.size(); i++)  in test2()
129     {   BOOST_CHECK (V1[i] == V2[i]);  in test2()
133     V1 = Vrandom;  in test2()
134     block_indirect_sort ( V1.begin ( ), V1.end ( ), compare(), 100);  in test2()
135     for (unsigned i = 1; i < V1.size(); i++)  in test2()
136     {   BOOST_CHECK (V1[i] == V2[i]);  in test2()
157     std::vector<IA> V1;  in test_int_array()  local
158     V1.reserve(NELEM);  in test_int_array()
161         V1.emplace_back(Vrandom[i]);  in test_int_array()
163     bsp::block_indirect_sort(V1.begin(), V1.end());  in test_int_array()
165     {   BOOST_CHECK(not (V1[i] < V1[i-1]));  in test_int_array()