29 template <class V>
30 using Value = std::tuple_element_t<(int)V::value, Types>;
56 void fillAdversarialQuickSortInput(T& V, size_t N) {  in fillAdversarialQuickSortInput()  argument
61   V.resize(N);  in fillAdversarialQuickSortInput()
63     V[i] = gas;  in fillAdversarialQuickSortInput()
69   std::vector<int> ascVals(V.size());  in fillAdversarialQuickSortInput()
74     if (V[x] == gas && V[y] == gas) {  in fillAdversarialQuickSortInput()
77         V[x] = nsolid++;  in fillAdversarialQuickSortInput()
79         V[y] = nsolid++;  in fillAdversarialQuickSortInput()
82     if (V[x] == gas) {  in fillAdversarialQuickSortInput()
84     } else if (V[y] == gas) {  in fillAdversarialQuickSortInput()
87     return V[x] < V[y];  in fillAdversarialQuickSortInput()
92 void fillValues(std::vector<T>& V, size_t N, Order O) {  in fillValues()  argument
94     V.resize(N, 0);  in fillValues()
96     fillAdversarialQuickSortInput(V, N);  in fillValues()
98     while (V.size() < N)  in fillValues()
99       V.push_back(V.size());  in fillValues()
104 void fillValues(std::vector<std::pair<T, T> >& V, size_t N, Order O) {  in fillValues()  argument
106     V.resize(N, std::make_pair(0, 0));  in fillValues()
108     while (V.size() < N)  in fillValues()
110       if (V.size() % 2) {  in fillValues()
111         V.push_back(std::make_pair(V.size(), V.size()));  in fillValues()
113         V.push_back(std::make_pair(0, V.size()));  in fillValues()
119 void fillValues(std::vector<std::tuple<T1, T2, T3> >& V, size_t N, Order O) {  in fillValues()  argument
121     V.resize(N, std::make_tuple(0, 0, 0));  in fillValues()
123     while (V.size() < N)  in fillValues()
126       switch (V.size() % 3) {  in fillValues()
128         V.push_back(std::make_tuple(V.size(), V.size(), V.size()));  in fillValues()
131         V.push_back(std::make_tuple(0, V.size(), V.size()));  in fillValues()
134         V.push_back(std::make_tuple(0, 0, V.size()));  in fillValues()
140 inline void fillValues(std::vector<std::string>& V, size_t N, Order O) {  in fillValues()  argument
142     V.resize(N, getRandomString(64));  in fillValues()
144     while (V.size() < N)  in fillValues()
145       V.push_back(getRandomString(64));  in fillValues()
150 void sortValues(T& V, Order O) {  in sortValues()  argument
155     std::shuffle(V.begin(), V.end(), M);  in sortValues()
159     std::sort(V.begin(), V.end());  in sortValues()
162     std::sort(V.begin(), V.end(), std::greater<>());  in sortValues()
168     std::sort(V.begin(), V.end());  in sortValues()
169     std::reverse(V.begin() + V.size() / 2, V.end());  in sortValues()
172     std::make_heap(V.begin(), V.end());  in sortValues()
193   for (auto& V : Ret) {  in makeOrderedValues()
194     fillValues(V, N, O);  in makeOrderedValues()
195     sortValues(V, O);  in makeOrderedValues()