32 enum class Order {  enum
41 struct AllOrders : EnumValuesAsTuple<AllOrders, Order, 7> {
92 void fillValues(std::vector<T>& V, size_t N, Order O) {  in fillValues()
93   if (O == Order::SingleElement) {  in fillValues()
95   } else if (O == Order::QuickSortAdversary) {  in fillValues()
104 void fillValues(std::vector<std::pair<T, T> >& V, size_t N, Order O) {  in fillValues()
105   if (O == Order::SingleElement) {  in fillValues()
119 void fillValues(std::vector<std::tuple<T1, T2, T3> >& V, size_t N, Order O) {  in fillValues()
120   if (O == Order::SingleElement) {  in fillValues()
140 inline void fillValues(std::vector<std::string>& V, size_t N, Order O) {  in fillValues()
141   if (O == Order::SingleElement) {  in fillValues()
150 void sortValues(T& V, Order O) {  in sortValues()
152   case Order::Random: {  in sortValues()
158   case Order::Ascending:  in sortValues()
161   case Order::Descending:  in sortValues()
164   case Order::SingleElement:  in sortValues()
167   case Order::PipeOrgan:  in sortValues()
171   case Order::Heap:  in sortValues()
174   case Order::QuickSortAdversary:  in sortValues()
189                                                                Order O) {  in makeOrderedValues()
215 void runOpOnCopies(benchmark::State& state, size_t Quantity, Order O,  in runOpOnCopies()