Home
last modified time | relevance | path

Searched refs:makeCartesianProductBenchmark (Results 1 – 24 of 24) sorted by relevance

/llvm-project-15.0.7/libcxx/benchmarks/
H A Dfunction.bench.cpp222 makeCartesianProductBenchmark<ConstructAndDestroy, AllOpacity, in main()
224 makeCartesianProductBenchmark<Copy, AllFunctionTypes>(); in main()
225 makeCartesianProductBenchmark<Move, AllFunctionTypes>(); in main()
226 makeCartesianProductBenchmark<Swap, AllFunctionTypes, AllFunctionTypes>(); in main()
227 makeCartesianProductBenchmark<OperatorBool, AllFunctionTypes>(); in main()
228 makeCartesianProductBenchmark<Invoke, AllFunctionTypes>(); in main()
229 makeCartesianProductBenchmark<InvokeInlined, AllFunctionTypes>(); in main()
H A Dordered_set.bench.cpp236 makeCartesianProductBenchmark<Create, AllAccessPattern>(TableSize, NumTables); in main()
237 makeCartesianProductBenchmark<Find, AllHitTypes, AllAccessPattern>( in main()
239 makeCartesianProductBenchmark<FindNeEnd, AllHitTypes, AllAccessPattern>( in main()
241 makeCartesianProductBenchmark<InsertHit, AllAccessPattern>( in main()
243 makeCartesianProductBenchmark<InsertMissAndErase, AllAccessPattern>( in main()
245 makeCartesianProductBenchmark<IterateRangeFor>(TableSize, NumTables); in main()
246 makeCartesianProductBenchmark<IterateBeginEnd>(TableSize, NumTables); in main()
H A Dmap.bench.cpp1005 makeCartesianProductBenchmark<ConstructorDefault>(); in main()
1006 makeCartesianProductBenchmark<ConstructorIterator>(MapSize); in main()
1007 makeCartesianProductBenchmark<ConstructorCopy>(MapSize); in main()
1008 makeCartesianProductBenchmark<ConstructorMove>(MapSize); in main()
1011 makeCartesianProductBenchmark<Empty>(MapSize); in main()
1012 makeCartesianProductBenchmark<Size>(MapSize); in main()
1015 makeCartesianProductBenchmark<Clear>(MapSize); in main()
1025 makeCartesianProductBenchmark<Erase, AllModes, AllOrders>(MapSize); in main()
1026 makeCartesianProductBenchmark<EraseIterator, AllOrders>(MapSize); in main()
1027 makeCartesianProductBenchmark<EraseRange>(MapSize); in main()
[all …]
H A Dstring.bench.cpp599 makeCartesianProductBenchmark<StringConstructDestroyCStr, AllLengths, in main()
602 makeCartesianProductBenchmark<StringAssignStr, AllLengths, AllOpacity>(); in main()
604 makeCartesianProductBenchmark<StringAssignAsciizMix, AllOpacity>(); in main()
606 makeCartesianProductBenchmark<StringCopy, AllLengths>(); in main()
607 makeCartesianProductBenchmark<StringMove, AllLengths>(); in main()
608 makeCartesianProductBenchmark<StringDestroy, AllLengths>(); in main()
609 makeCartesianProductBenchmark<StringResizeDefaultInit, AllLengths, in main()
611 makeCartesianProductBenchmark<StringEraseToEnd, AllLengths, AllOpacity>(); in main()
613 makeCartesianProductBenchmark<StringRelational, AllRelations, AllLengths, in main()
615 makeCartesianProductBenchmark<StringRelationalLiteral, AllRelations, in main()
[all …]
H A DCartesianBenchmarks.h111 int makeCartesianProductBenchmark(const Args&... A) { in makeCartesianProductBenchmark() function
119 int makeCartesianProductBenchmark(const Args&... A) { in makeCartesianProductBenchmark() function
H A Dalgorithms.partition_point.bench.cpp121 makeCartesianProductBenchmark<PartitionPointBench, AllAlgs, AllTestTypes>( in main()
H A Dformatter_int.bench.cpp205 makeCartesianProductBenchmark<Integral, AllLocalizations, AllBases, AllTypes, AllAlignments>(); in main()
H A Dformatter_float.bench.cpp247makeCartesianProductBenchmark<FloatingPoint, AllLocalizations, AllDisplayTypes, AllTypes, AllValue… in main()
/llvm-project-15.0.7/libcxx/benchmarks/algorithms/
H A Dranges_sort_heap.bench.cpp34 makeCartesianProductBenchmark<RangesSortHeap, AllValueTypes>(Quantities); in main()
H A Dranges_make_heap.bench.cpp35 makeCartesianProductBenchmark<RangesMakeHeap, AllValueTypes, AllOrders>(Quantities); in main()
H A Dsort_heap.bench.cpp34 makeCartesianProductBenchmark<SortHeap, AllValueTypes>(Quantities); in main()
H A Dmake_heap.bench.cpp35 makeCartesianProductBenchmark<MakeHeap, AllValueTypes, AllOrders>(Quantities); in main()
H A Dranges_make_heap_then_sort_heap.bench.cpp37 makeCartesianProductBenchmark<RangesMakeThenSortHeap, AllValueTypes, AllOrders>(Quantities); in main()
H A Dranges_sort.bench.cpp37 makeCartesianProductBenchmark<Sort, AllValueTypes, AllOrders>(Quantities); in main()
H A Dmin_max_element.bench.cpp34 makeCartesianProductBenchmark<MinMaxElement, AllValueTypes, AllOrders>(Quantities); in main()
H A Dranges_stable_sort.bench.cpp37 makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>(Quantities); in main()
H A Dpop_heap.bench.cpp37 makeCartesianProductBenchmark<PopHeap, AllValueTypes>(Quantities); in main()
H A Dranges_pop_heap.bench.cpp37 makeCartesianProductBenchmark<RangesPopHeap, AllValueTypes>(Quantities); in main()
H A Dstable_sort.bench.cpp37 makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>(Quantities); in main()
H A Dsort.bench.cpp37 makeCartesianProductBenchmark<Sort, AllValueTypes, AllOrders>(Quantities); in main()
H A Dmake_heap_then_sort_heap.bench.cpp37 makeCartesianProductBenchmark<MakeThenSortHeap, AllValueTypes, AllOrders>(Quantities); in main()
H A Dlower_bound.bench.cpp40 makeCartesianProductBenchmark<LowerBound, AllValueTypes>(Quantities); in main()
H A Dpush_heap.bench.cpp40 makeCartesianProductBenchmark<PushHeap, AllValueTypes, AllOrders>(Quantities); in main()
H A Dranges_push_heap.bench.cpp40 makeCartesianProductBenchmark<RangesPushHeap, AllValueTypes, AllOrders>(Quantities); in main()