| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | ranges_sort_heap.pass.cpp | 64 assert(sorted == expected); in verify_sorted()
65 assert(base(last) == sorted.data() + sorted.size()); in verify_sorted()
66 assert(std::is_sorted(sorted.begin(), sorted.end())); in verify_sorted()
74 auto sorted = input; in test_one() local
75 auto b = Iter(sorted.data()); in test_one()
76 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
79 verify_sorted(sorted, last, expected); in test_one()
83 auto sorted = input; in test_one() local
84 auto b = Iter(sorted.data()); in test_one()
85 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| H A D | ranges.sort.pass.cpp | 65 auto sorted = input; in test_one() local
66 auto b = Iter(sorted.data()); in test_one()
67 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
70 assert(sorted == expected); in test_one()
71 assert(base(last) == sorted.data() + sorted.size()); in test_one()
75 auto sorted = input; in test_one() local
76 auto b = Iter(sorted.data()); in test_one()
77 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
81 assert(sorted == expected); in test_one()
82 assert(base(last) == sorted.data() + sorted.size()); in test_one()
|
| /llvm-project-15.0.7/mlir/lib/Transforms/ |
| H A D | OpStats.cpp | 58 SmallVector<StringRef, 64> sorted(opCount.keys()); in printSummary() local
59 llvm::sort(sorted); in printSummary()
71 for (const auto &key : sorted) { in printSummary()
77 for (const auto &key : sorted) { in printSummary()
95 SmallVector<StringRef, 64> sorted(opCount.keys()); in printSummaryInJSON() local
96 llvm::sort(sorted); in printSummaryInJSON()
100 for (unsigned i = 0, e = sorted.size(); i != e; ++i) { in printSummaryInJSON()
101 const auto &key = sorted[i]; in printSummaryInJSON()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| H A D | ranges.stable.sort.pass.cpp | 64 auto sorted = input; in test_one() local
65 auto b = Iter(sorted.data()); in test_one()
66 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
69 assert(sorted == expected); in test_one()
70 assert(base(last) == sorted.data() + sorted.size()); in test_one()
74 auto sorted = input; in test_one() local
75 auto b = Iter(sorted.data()); in test_one()
76 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
80 assert(sorted == expected); in test_one()
81 assert(base(last) == sorted.data() + sorted.size()); in test_one()
|
| /llvm-project-15.0.7/lld/COFF/ |
| H A D | CallGraphSort.cpp | 154 std::vector<int> sorted(clusters.size()); in run() local
158 std::iota(sorted.begin(), sorted.end(), 0); in run()
159 llvm::stable_sort(sorted, [&](int a, int b) { in run()
163 for (int l : sorted) { in run()
188 sorted.clear(); in run()
191 sorted.push_back(i); in run()
192 llvm::stable_sort(sorted, [&](int a, int b) { in run()
200 for (int leader : sorted) { in run()
217 for (int leader : sorted) in run()
|
| /llvm-project-15.0.7/lld/ELF/ |
| H A D | CallGraphSort.cpp | 183 std::vector<int> sorted(clusters.size()); in run() local
187 std::iota(sorted.begin(), sorted.end(), 0); in run()
188 llvm::stable_sort(sorted, [&](int a, int b) { in run()
192 for (int l : sorted) { in run()
217 sorted.clear(); in run()
220 sorted.push_back(i); in run()
221 llvm::stable_sort(sorted, [&](int a, int b) { in run()
227 for (int leader : sorted) { in run()
245 for (int leader : sorted) in run()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | ranges_partial_sort.pass.cpp | 67 constexpr void test_one(std::array<int, N> input, size_t mid_index, std::array<int, N> sorted) { in test_one() argument
76 sorted.begin(), sorted.begin() + mid_index)); in test_one()
88 … assert(std::ranges::equal(begin, begin + mid_index, sorted.begin(), sorted.begin() + mid_index)); in test_one()
95 auto sorted = input; in test_all_subsequences() local
96 std::sort(sorted.begin(), sorted.end()); in test_all_subsequences()
99 test_one<Iter, Sent, N>(input, n, sorted); in test_all_subsequences()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/ |
| H A D | partial_sort_copy.pass.cpp | 35 std::vector<std::uint8_t> sorted(data + 1, data + size); in LLVMFuzzerTestOneInput() local
36 std::sort(sorted.begin(), sorted.end()); in LLVMFuzzerTestOneInput()
37 if (!std::equal(results.begin(), results.end(), sorted.begin())) in LLVMFuzzerTestOneInput()
|
| /llvm-project-15.0.7/lld/MachO/ |
| H A D | SectionPriorities.cpp | 163 std::vector<int> sorted(clusters.size()); in run() local
168 std::iota(sorted.begin(), sorted.end(), 0); in run()
170 llvm::stable_sort(sorted, [&](int a, int b) { in run()
174 for (int l : sorted) { in run()
199 sorted.clear(); in run()
202 sorted.push_back(i); in run()
203 llvm::stable_sort(sorted, [&](int a, int b) { in run()
214 for (int leader : sorted) { in run()
231 for (int leader : sorted) in run()
|
| /llvm-project-15.0.7/llvm/include/llvm/TextAPI/ |
| H A D | Architecture.def | 14 /// X86 architectures sorted by cpu type and sub type id.
22 /// ARM architectures sorted by cpu sub type id.
36 /// ARM64 architectures sorted by cpu sub type id.
43 /// ARM64_32 architectures sorted by cpu sub type id
|
| /llvm-project-15.0.7/llvm/utils/ |
| H A D | sort_includes.py | 72 local_headers = sorted(set(local_headers))
73 subproject_headers = sorted(set(subproject_headers))
74 llvm_headers = sorted(set(llvm_headers))
75 system_headers = sorted(set(system_headers))
|
| H A D | update_mca_test_checks.py | 155 for prefix in sorted(lresult):
178 for prefix in sorted(lresult):
199 common_to_all = sorted(common_to_all)[0]
366 s = sorted(list(s))
376 block_infos[block_num][block_text] = sorted(list(current_set))
493 for block_text in sorted(block_infos[block_num]):
507 for prefix in sorted(output_blocks):
512 raise Error('unused prefixes: {}'.format(sorted(unused_prefixes)))
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| H A D | ranges_partial_sort_copy.pass.cpp | 125 std::array<int, N> input, size_t input_size, size_t output_size, std::array<int, N> sorted) { in test_one() argument
150 std::ranges::subrange(sorted.begin(), sorted.begin() + result_size))); in test_one()
166 std::ranges::subrange(sorted.begin(), sorted.begin() + result_size))); in test_one()
173 auto sorted = input; in test_all_subsequences() local
174 std::sort(sorted.begin(), sorted.end()); in test_all_subsequences()
178 test_one<Iter, Sent, OutIter, OutSent>(input, N, out_size, sorted); in test_all_subsequences()
|
| /llvm-project-15.0.7/lldb/source/Utility/ |
| H A D | Timer.cpp | 139 std::vector<Stats> sorted; in DumpCategoryTimes() local
146 sorted.push_back(stats); in DumpCategoryTimes()
149 if (sorted.empty()) in DumpCategoryTimes()
153 llvm::sort(sorted, CategoryMapIteratorSortCriterion); in DumpCategoryTimes()
155 for (const auto &stats : sorted) in DumpCategoryTimes()
|
| /llvm-project-15.0.7/third-party/benchmark/tools/gbench/ |
| H A D | util.py | 127 benchmarks = sorted(
129 benchmarks = sorted(
131 benchmarks = sorted(
133 benchmarks = sorted(
|
| /llvm-project-15.0.7/libcxx/utils/ |
| H A D | generate_header_tests.py | 124 …toplevel_headers = sorted(str(p.relative_to(include)) for p in include.glob('[a-z]*') if is_he…
125 …experimental_headers = sorted(str(p.relative_to(include)) for p in include.glob('experimental/[a-z…
126 …extended_headers = sorted(str(p.relative_to(include)) for p in include.glob('ext/[a-z]*') if i…
128 …private_headers = sorted(str(p.relative_to(include)) for p in include.rglob('*') if is_header…
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/ |
| H A D | ranges_nth_element.pass.cpp | 88 auto sorted = partially_sorted; in verify_nth() local
89 std::ranges::sort(sorted); in verify_nth()
92 assert(sorted[nth_index] == *nth); in verify_nth()
132 auto sorted = input; in test_all_cases() local
133 std::sort(sorted.begin(), sorted.end()); in test_all_cases()
136 test_one<Iter, Sent, N>(input, n, sorted[n]); in test_all_cases()
|
| /llvm-project-15.0.7/llvm/utils/gn/build/ |
| H A D | sync_source_lists_from_cmake.py | 104 by_rev(sorted(cmake_cpp - gn_cpp), 'add')
105 by_rev(sorted(gn_cpp - cmake_cpp), 'remove')
108 for rev in sorted(changes_by_rev):
111 for gn_file, data in sorted(changes_by_rev[rev].items()):
|
| /llvm-project-15.0.7/cmake/Modules/ |
| H A D | SortSubset.cmake | 11 # A subset of the elements in `full_list`. Those elements will be sorted
15 # A variable to store the resulting sorted sub-list in.
|
| /llvm-project-15.0.7/lldb/scripts/ |
| H A D | analyze-project-deps.py | 201 sorted = [] variable
203 sorted.append((node, incoming_counts[node], outgoing_counts[node]))
204 sorted.sort(key = lambda x: x[1]+x[2])
205 for (node, inc, outg) in sorted:
|
| /llvm-project-15.0.7/llvm/tools/opt-viewer/ |
| H A D | opt-stats.py | 71 for (passname, count) in sorted(bypass.items(), key=operator.itemgetter(1),
76 for (name, count) in sorted(byname.items(), key=operator.itemgetter(1),
|
| /llvm-project-15.0.7/flang/lib/Parser/ |
| H A D | message.cpp | 362 std::vector<const Message *> sorted; in Emit() local
364 sorted.push_back(&msg); in Emit()
366 std::stable_sort(sorted.begin(), sorted.end(), in Emit()
369 for (const Message *msg : sorted) { in Emit()
|
| /llvm-project-15.0.7/llvm/utils/lit/lit/ |
| H A D | display.py | 142 items = sorted(test.result.metrics.items())
149 items = sorted(test.result.microResults.items())
155 sorted_metrics = sorted(micro_test.metrics.items())
|
| /llvm-project-15.0.7/lld/test/ELF/ |
| H A D | mips-dynsym-sort.s | 35 # The symbols in the DynamicSymbols section are sorted in compliance with
37 # v1 and v3 are sorted according to their order in the GOT.
|
| /llvm-project-15.0.7/lld/test/MachO/tools/ |
| H A D | validate-unwind-info.py | 67 for symbol in sorted(object_encodings_map):
91 sorted(encoding_frequency_map,
|