1 //////////////////////////////////////////////////////////////////////////////
2 //
3 // (C) Copyright Ion Gaztanaga 2015-2016.
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://www.boost.org/libs/move for documentation.
9 //
10 //////////////////////////////////////////////////////////////////////////////
11
12 #include <cstdlib> //std::srand
13 #include <iostream> //std::cout
14
15 #include <boost/config.hpp>
16
17 #include <boost/move/unique_ptr.hpp>
18 #include <boost/move/algo/detail/merge_sort.hpp>
19
20 #include "order_type.hpp"
21 #include "random_shuffle.hpp"
22
23 #include <boost/move/algo/adaptive_merge.hpp>
24 #include <boost/move/core.hpp>
25 #include <cstdlib>
26
27
28 template<class T>
test_random_shuffled(std::size_t const element_count,std::size_t const num_keys,std::size_t const num_iter)29 bool test_random_shuffled(std::size_t const element_count, std::size_t const num_keys, std::size_t const num_iter)
30 {
31 boost::movelib::unique_ptr<T[]> elements(new T[element_count]);
32 boost::movelib::unique_ptr<std::size_t[]> key_reps(new std::size_t[num_keys ? num_keys : element_count]);
33 std::cout << "- - N: " << element_count << ", Keys: " << num_keys << ", It: " << num_iter << " \n";
34
35 //Initialize keys
36 for(std::size_t i=0; i < element_count; ++i){
37 std::size_t key = num_keys ? (i % num_keys) : i;
38 elements[i].key=key;
39 }
40
41 std::srand(0);
42
43 for (std::size_t i = 0; i != num_iter; ++i)
44 {
45 ::random_shuffle(elements.get(), elements.get() + element_count);
46 for(std::size_t j = 0; j < (num_keys ? num_keys : element_count); ++j){
47 key_reps[j]=0;
48 }
49 for(std::size_t j = 0; j < element_count; ++j){
50 elements[j].val = key_reps[elements[j].key]++;
51 }
52
53 boost::movelib::unique_ptr<char[]> buf(new char [sizeof(T)*(element_count-element_count/2)]);
54
55 std::size_t const split = std::size_t(std::rand()) % element_count;
56 boost::movelib::merge_sort(elements.get(), elements.get()+split, order_type_less(), (T*)buf.get());
57 boost::movelib::merge_sort(elements.get()+split, elements.get()+element_count, order_type_less(), (T*)buf.get());
58
59 boost::movelib::adaptive_merge(elements.get(), elements.get()+split, elements.get()+element_count, order_type_less());
60
61 if (!is_order_type_ordered(elements.get(), element_count))
62 {
63 std::cout << "\n ERROR\n";
64 std::abort();
65 }
66 }
67 return true;
68 }
69
instantiate_smalldiff_iterators()70 void instantiate_smalldiff_iterators()
71 {
72 typedef randit<int, short> short_rand_it_t;
73 boost::movelib::adaptive_merge(short_rand_it_t(), short_rand_it_t(), short_rand_it_t(), less_int());
74
75 typedef randit<int, signed char> schar_rand_it_t;
76 boost::movelib::adaptive_merge(schar_rand_it_t(), schar_rand_it_t(), schar_rand_it_t(), less_int());
77 }
78
main()79 int main()
80 {
81 instantiate_smalldiff_iterators();
82
83 const std::size_t NIter = 100;
84 test_random_shuffled<order_move_type>(10001, 3, NIter);
85 test_random_shuffled<order_move_type>(10001, 65, NIter);
86 test_random_shuffled<order_move_type>(10001, 101, NIter);
87 test_random_shuffled<order_move_type>(10001, 1023, NIter);
88 test_random_shuffled<order_move_type>(10001, 4095, NIter);
89 test_random_shuffled<order_move_type>(10001, 0, NIter);
90
91 return 0;
92 }
93