32 #define NELEM 100000000  macro
88     Generator_sorted_end (NELEM / 1000);  in main()
91     Generator_sorted_end (NELEM / 100);  in main()
94     Generator_sorted_end (NELEM / 10);  in main()
98     Generator_sorted_middle (NELEM / 1000);  in main()
101     Generator_sorted_middle (NELEM / 100);  in main()
104     Generator_sorted_middle (NELEM / 10);  in main()
111     Generator_reverse_sorted_end (NELEM / 1000);  in main()
114     Generator_reverse_sorted_end (NELEM / 100);  in main()
117     Generator_reverse_sorted_end (NELEM / 10);  in main()
121     Generator_reverse_sorted_middle (NELEM / 1000);  in main()
124     Generator_reverse_sorted_middle (NELEM / 100);  in main()
127     Generator_reverse_sorted_middle (NELEM / 10);  in main()
136     A.reserve (NELEM);  in Generator_random()
138     if (fill_vector_uint64 ("input.bin", A, NELEM) != 0)  in Generator_random()
151     A.reserve (NELEM);  in Generator_sorted()
153     for (size_t i = 0; i < NELEM; ++i)  in Generator_sorted()
162     A.reserve (NELEM);  in Generator_sorted_end()
164     if (fill_vector_uint64 ("input.bin", A, NELEM + n_last) != 0)  in Generator_sorted_end()
169     std::sort (A.begin (), A.begin () + NELEM);  in Generator_sorted_end()
178     A.reserve (NELEM);  in Generator_sorted_middle()
180     if (fill_vector_uint64 ("input.bin", A, NELEM + n_last) != 0)  in Generator_sorted_middle()
185     for (size_t i = NELEM; i < A.size (); ++i)  in Generator_sorted_middle()
187     A.resize ( NELEM);  in Generator_sorted_middle()
188     for (size_t i = 0; i < (NELEM >> 1); ++i)  in Generator_sorted_middle()
189         std::swap (A[i], A[NELEM - 1 - i]);  in Generator_sorted_middle()
192     size_t step = NELEM / n_last + 1;  in Generator_sorted_middle()
211     A.reserve (NELEM);  in Generator_reverse_sorted()
213     for (size_t i = NELEM; i > 0; --i)  in Generator_reverse_sorted()
220     A.reserve (NELEM);  in Generator_reverse_sorted_end()
222     if (fill_vector_uint64 ("input.bin", A, NELEM + n_last) != 0)  in Generator_reverse_sorted_end()
227     std::sort (A.begin (), A.begin () + NELEM);  in Generator_reverse_sorted_end()
228     for (size_t i = 0; i < (NELEM >> 1); ++i)  in Generator_reverse_sorted_end()
229         std::swap (A[i], A[NELEM - 1 - i]);  in Generator_reverse_sorted_end()
236     A.reserve (NELEM);  in Generator_reverse_sorted_middle()
238     if (fill_vector_uint64 ("input.bin", A, NELEM + n_last) != 0)  in Generator_reverse_sorted_middle()
243     for (size_t i = NELEM; i < A.size (); ++i)  in Generator_reverse_sorted_middle()
245     A.resize ( NELEM);  in Generator_reverse_sorted_middle()
246     for (size_t i = 0; i < (NELEM >> 1); ++i)  in Generator_reverse_sorted_middle()
247         std::swap (A[i], A[NELEM - 1 - i]);  in Generator_reverse_sorted_middle()
250     size_t step = NELEM / n_last + 1;  in Generator_reverse_sorted_middle()