| /external/cronet/tot/third_party/libc++/src/test/benchmarks/algorithms/ |
| D | sort.bench.cpp | 17 struct Sort { struct
18 size_t Quantity;
20 void run(benchmark::State& state) const { in run()
26 bool skip() const { return Order() == ::Order::Heap; } in skip()
28 …) const { return "BM_Sort" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity); }; in name()
|
| D | ranges_sort.bench.cpp | 17 struct Sort { struct
18 size_t Quantity;
20 void run(benchmark::State& state) const { in run()
26 bool skip() const { return Order() == ::Order::Heap; } in skip()
28 std::string name() const { in name()
|
| /external/cronet/stable/third_party/libc++/src/test/benchmarks/algorithms/ |
| D | sort.bench.cpp | 17 struct Sort { struct
18 size_t Quantity;
20 void run(benchmark::State& state) const { in run()
26 bool skip() const { return Order() == ::Order::Heap; } in skip()
28 …) const { return "BM_Sort" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity); }; in name()
|
| D | ranges_sort.bench.cpp | 17 struct Sort { struct
18 size_t Quantity;
20 void run(benchmark::State& state) const { in run()
26 bool skip() const { return Order() == ::Order::Heap; } in skip()
28 std::string name() const { in name()
|
| /external/libcxx/benchmarks/ |
| D | algorithms.bench.cpp | 131 struct Sort { struct
132 size_t Quantity;
134 void run(benchmark::State& state) const { in run()
140 bool skip() const { return Order() == ::Order::Heap; } in skip()
142 std::string name() const { in name()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | Z3Solver.cpp | 71 Z3_sort Sort; member in __anon9badfbde0111::Z3Sort
291 SMTSortRef newSortRef(const SMTSort &Sort) { in newSortRef()
726 const SMTSortRef Sort = getBitvectorSort(BitWidth); in mkBitvector() local
733 SMTSortRef Sort = in mkFloat() local
743 SMTExprRef mkSymbol(const char *Name, SMTSortRef Sort) override { in mkSymbol()
768 bool toAPFloat(const SMTSortRef &Sort, const SMTExprRef &AST, in toAPFloat()
789 bool toAPSInt(const SMTSortRef &Sort, const SMTExprRef &AST, in toAPSInt()
837 SMTSortRef Sort = getSort(Assign); in getInterpretation() local
851 SMTSortRef Sort = getSort(Assign); in getInterpretation() local
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Support/ |
| D | Z3Solver.cpp | 74 Z3_sort Sort; member in __anon02fc93e40111::Z3Sort
294 SMTSortRef newSortRef(const SMTSort &Sort) { in newSortRef()
751 SMTSortRef Sort = in mkFloat() local
761 SMTExprRef mkSymbol(const char *Name, SMTSortRef Sort) override { in mkSymbol()
786 bool toAPFloat(const SMTSortRef &Sort, const SMTExprRef &AST, in toAPFloat()
807 bool toAPSInt(const SMTSortRef &Sort, const SMTExprRef &AST, in toAPSInt()
855 SMTSortRef Sort = getSort(Assign); in getInterpretation() local
869 SMTSortRef Sort = getSort(Assign); in getInterpretation() local
|
| /external/cronet/tot/net/base/ |
| D | url_search_params.cc | 35 void UrlSearchParams::Sort() { in Sort() function in net::UrlSearchParams
|
| /external/cronet/stable/net/base/ |
| D | url_search_params.cc | 35 void UrlSearchParams::Sort() { in Sort() function in net::UrlSearchParams
|
| /external/cronet/tot/net/dns/ |
| D | address_sorter_unittest.cc | 47 TEST(AddressSorterTest, Sort) { in TEST() argument
|
| D | address_sorter_win.cc | 43 void Sort(const std::vector<IPEndPoint>& endpoints, in Sort() function in net::__anone5c01ef60111::AddressSorterWin
|
| /external/cronet/stable/net/dns/ |
| D | address_sorter_unittest.cc | 47 TEST(AddressSorterTest, Sort) { in TEST() argument
|
| D | address_sorter_win.cc | 43 void Sort(const std::vector<IPEndPoint>& endpoints, in Sort() function in net::__anonf9a160da0111::AddressSorterWin
|
| /external/angle/third_party/spirv-tools/src/test/fuzz/ |
| D | comparator_deep_blocks_first_test.cpp | 107 TEST(ComparatorDeepBlocksFirstTest, Sort) { in TEST() argument
|
| /external/deqp-deps/SPIRV-Tools/test/fuzz/ |
| D | comparator_deep_blocks_first_test.cpp | 107 TEST(ComparatorDeepBlocksFirstTest, Sort) { in TEST() argument
|
| /external/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | comparator_deep_blocks_first_test.cpp | 107 TEST(ComparatorDeepBlocksFirstTest, Sort) { in TEST() argument
|
| /external/skia/tests/ |
| D | SortTest.cpp | 38 DEF_TEST(Sort, reporter) { in DEF_TEST() argument
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/XRay/ |
| D | Trace.cpp | 377 Expected<Trace> llvm::xray::loadTraceFile(StringRef Filename, bool Sort) { in loadTraceFile()
415 Expected<Trace> llvm::xray::loadTrace(const DataExtractor &DE, bool Sort) { in loadTrace()
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/XRay/ |
| D | Trace.cpp | 378 Expected<Trace> llvm::xray::loadTraceFile(StringRef Filename, bool Sort) { in loadTraceFile()
417 Expected<Trace> llvm::xray::loadTrace(const DataExtractor &DE, bool Sort) { in loadTrace()
|
| /external/cronet/tot/third_party/protobuf/src/google/protobuf/ |
| D | dynamic_message.h | 147 static std::vector<const Message*> Sort(const Message& message, int map_size, in Sort() function
|
| /external/cronet/stable/third_party/protobuf/src/google/protobuf/ |
| D | dynamic_message.h | 147 static std::vector<const Message*> Sort(const Message& message, int map_size, in Sort() function
|
| /external/protobuf/src/google/protobuf/ |
| D | dynamic_message.h | 147 static std::vector<const Message*> Sort(const Message& message, int map_size, in Sort() function
|
| /external/perfetto/src/trace_redaction/ |
| D | process_thread_timeline.cc | 43 void ProcessThreadTimeline::Sort() { in Sort() function in perfetto::trace_redaction::ProcessThreadTimeline
|
| /external/lzma/CPP/Common/ |
| D | MyVector.h | 401 void Sort(int (*compare)(const T*, const T*, void *), void *param) in Sort() function
713 void Sort(int (*compare)(void *const *, void *const *, void *), void *param) in Sort() function
719 void Sort() { _v.Sort(CompareObjectItems, NULL); } in Sort() function
|
| /external/perfetto/src/trace_processor/sorter/ |
| D | trace_sorter.cc | 88 void TraceSorter::Queue::Sort(TraceTokenBuffer& buffer, bool use_slow_sorting) { in Sort() function in perfetto::trace_processor::TraceSorter::Queue
|