| /external/libcxx/benchmarks/ |
| D | function.bench.cpp | 223 makeCartesianProductBenchmark<ConstructAndDestroy, AllOpacity, in main()
225 makeCartesianProductBenchmark<Copy, AllFunctionTypes>(); in main()
226 makeCartesianProductBenchmark<Move, AllFunctionTypes>(); in main()
227 makeCartesianProductBenchmark<Swap, AllFunctionTypes, AllFunctionTypes>(); in main()
228 makeCartesianProductBenchmark<OperatorBool, AllFunctionTypes>(); in main()
229 makeCartesianProductBenchmark<Invoke, AllFunctionTypes>(); in main()
230 makeCartesianProductBenchmark<InvokeInlined, AllFunctionTypes>(); in main()
|
| D | ordered_set.bench.cpp | 237 makeCartesianProductBenchmark<Create, AllAccessPattern>(TableSize, NumTables); in main()
238 makeCartesianProductBenchmark<Find, AllHitTypes, AllAccessPattern>( in main()
240 makeCartesianProductBenchmark<FindNeEnd, AllHitTypes, AllAccessPattern>( in main()
242 makeCartesianProductBenchmark<InsertHit, AllAccessPattern>( in main()
244 makeCartesianProductBenchmark<InsertMissAndErase, AllAccessPattern>( in main()
246 makeCartesianProductBenchmark<IterateRangeFor>(TableSize, NumTables); in main()
247 makeCartesianProductBenchmark<IterateBeginEnd>(TableSize, NumTables); in main()
|
| D | algorithms.bench.cpp | 260 makeCartesianProductBenchmark<Sort, AllValueTypes, AllOrders>(Quantities); in main()
261 makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>( in main()
263 makeCartesianProductBenchmark<MakeHeap, AllValueTypes, AllOrders>(Quantities); in main()
264 makeCartesianProductBenchmark<SortHeap, AllValueTypes>(Quantities); in main()
265 makeCartesianProductBenchmark<MakeThenSortHeap, AllValueTypes, AllOrders>( in main()
267 makeCartesianProductBenchmark<PushHeap, AllValueTypes, AllOrders>(Quantities); in main()
268 makeCartesianProductBenchmark<PopHeap, AllValueTypes>(Quantities); in main()
|
| D | string.bench.cpp | 365 makeCartesianProductBenchmark<StringConstructDestroyCStr, AllLengths, in main()
367 makeCartesianProductBenchmark<StringCopy, AllLengths>(); in main()
368 makeCartesianProductBenchmark<StringMove, AllLengths>(); in main()
369 makeCartesianProductBenchmark<StringDestroy, AllLengths>(); in main()
370 makeCartesianProductBenchmark<StringRelational, AllRelations, AllLengths, in main()
372 makeCartesianProductBenchmark<StringRead, AllTemperatures, AllDepths, in main()
|
| D | CartesianBenchmarks.hpp | 112 int makeCartesianProductBenchmark(const Args&... A) { in makeCartesianProductBenchmark() function
120 int makeCartesianProductBenchmark(const Args&... A) { in makeCartesianProductBenchmark() function
|
| /external/cronet/buildtools/third_party/libc++/trunk/benchmarks/ |
| D | function.bench.cpp | 222 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()
|
| D | ordered_set.bench.cpp | 236 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()
|
| D | map.bench.cpp | 1005 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()
1016 makeCartesianProductBenchmark<Insert, AllModes, AllOrders>(MapSize); in main()
1017 makeCartesianProductBenchmark<InsertHint, AllModes, AllHints>(MapSize); in main()
1018 makeCartesianProductBenchmark<InsertAssign, AllModes, AllOrders>(MapSize); in main()
[all …]
|
| D | string.bench.cpp | 599 makeCartesianProductBenchmark<StringConstructDestroyCStr, AllLengths, in main()
602 makeCartesianProductBenchmark<StringAssignStr, AllLengths, AllOpacity>(); in main()
603 makeCartesianProductBenchmark<StringAssignAsciiz, 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()
612 makeCartesianProductBenchmark<StringEraseWithMove, AllLengths, AllOpacity>(); in main()
[all …]
|
| D | CartesianBenchmarks.h | 111 int makeCartesianProductBenchmark(const Args&... A) { in makeCartesianProductBenchmark() function
119 int makeCartesianProductBenchmark(const Args&... A) { in makeCartesianProductBenchmark() function
|
| /external/cronet/buildtools/third_party/libc++/trunk/benchmarks/algorithms/ |
| D | ranges_sort_heap.bench.cpp | 34 makeCartesianProductBenchmark<RangesSortHeap, AllValueTypes>(Quantities); in main()
|
| D | ranges_make_heap.bench.cpp | 35 makeCartesianProductBenchmark<RangesMakeHeap, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | sort_heap.bench.cpp | 34 makeCartesianProductBenchmark<SortHeap, AllValueTypes>(Quantities); in main()
|
| D | make_heap.bench.cpp | 35 makeCartesianProductBenchmark<MakeHeap, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | ranges_make_heap_then_sort_heap.bench.cpp | 37 makeCartesianProductBenchmark<RangesMakeThenSortHeap, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | ranges_sort.bench.cpp | 37 makeCartesianProductBenchmark<Sort, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | ranges_stable_sort.bench.cpp | 37 makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | min_max_element.bench.cpp | 34 makeCartesianProductBenchmark<MinMaxElement, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | ranges_pop_heap.bench.cpp | 37 makeCartesianProductBenchmark<RangesPopHeap, AllValueTypes>(Quantities); in main()
|
| D | stable_sort.bench.cpp | 37 makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | sort.bench.cpp | 37 makeCartesianProductBenchmark<Sort, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | pop_heap.bench.cpp | 37 makeCartesianProductBenchmark<PopHeap, AllValueTypes>(Quantities); in main()
|
| D | make_heap_then_sort_heap.bench.cpp | 37 makeCartesianProductBenchmark<MakeThenSortHeap, AllValueTypes, AllOrders>(Quantities); in main()
|
| D | lower_bound.bench.cpp | 40 makeCartesianProductBenchmark<LowerBound, AllValueTypes>(Quantities); in main()
|
| D | push_heap.bench.cpp | 40 makeCartesianProductBenchmark<PushHeap, AllValueTypes, AllOrders>(Quantities); in main()
|