Lines Matching defs:Order
35 enum class Order {
43 struct AllOrders : EnumValuesAsTuple<AllOrders, Order, 6> {
50 void fillValues(std::vector<T>& V, size_t N, Order O) {
51 if (O == Order::SingleElement) {
60 void fillValues(std::vector<std::pair<T, T> >& V, size_t N, Order O) {
61 if (O == Order::SingleElement) {
75 void fillValues(std::vector<std::tuple<T1, T2, T3> >& V, size_t N, Order O) {
76 if (O == Order::SingleElement) {
96 void fillValues(std::vector<std::string>& V, size_t N, Order O) {
97 if (O == Order::SingleElement) {
106 void sortValues(T& V, Order O) {
109 case Order::Random: {
115 case Order::Ascending:
118 case Order::Descending:
121 case Order::SingleElement:
124 case Order::PipeOrgan:
128 case Order::Heap:
143 Order O) {
169 void runOpOnCopies(benchmark::State& state, size_t Quantity, Order O,
188 template <class ValueType, class Order>
194 state, Quantity, Order(), BatchSize::CountElements,
198 bool skip() const { return Order() == ::Order::Heap; }
201 return "BM_Sort" + ValueType::name() + Order::name() + "_" +
206 template <class ValueType, class Order>
212 state, Quantity, Order(), BatchSize::CountElements,
216 bool skip() const { return Order() == ::Order::Heap; }
219 return "BM_StableSort" + ValueType::name() + Order::name() + "_" +
224 template <class ValueType, class Order>
230 state, Quantity, Order(), BatchSize::CountElements,
235 return "BM_MakeHeap" + ValueType::name() + Order::name() + "_" +
246 state, Quantity, Order::Heap, BatchSize::CountElements,
255 template <class ValueType, class Order>
260 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements,
268 return "BM_MakeThenSortHeap" + ValueType::name() + Order::name() + "_" +
273 template <class ValueType, class Order>
279 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
286 bool skip() const { return Order() == ::Order::Heap; }
289 return "BM_PushHeap" + ValueType::name() + Order::name() + "_" +
300 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {