| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| H A D | ranges.sort.pass.cpp | 63 auto sorted = input; in test_one() local
64 auto b = Iter(sorted.data()); in test_one()
65 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
68 assert(sorted == expected); in test_one()
69 assert(base(last) == sorted.data() + sorted.size()); in test_one()
73 auto sorted = input; in test_one() local
74 auto b = Iter(sorted.data()); in test_one()
75 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
79 assert(sorted == expected); in test_one()
80 assert(base(last) == sorted.data() + sorted.size()); in test_one()
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | ranges_sort_heap.pass.cpp | 64 constexpr void verify_sorted(const std::array<T, N>& sorted, Iter last, std::array<T, N> expected) { in verify_sorted()
65 assert(sorted == expected); in verify_sorted()
66 assert(std::to_address(base(last)) == sorted.data() + sorted.size()); in verify_sorted()
67 assert(std::is_sorted(sorted.begin(), sorted.end()));
75 auto sorted = input; in test_one()
76 auto b = Iter(sorted.data()); in test_one()
77 auto e = Sent(Iter(sorted.data() + sorted in test_one()
62 verify_sorted(const std::array<T,N> & sorted,Iter last,std::array<T,N> expected) verify_sorted() argument
73 auto sorted = input; test_one() local
82 auto sorted = input; test_one() local
[all...] |
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| H A D | ranges.stable.sort.pass.cpp | 62 auto sorted = input; in test_one() local
63 auto b = Iter(sorted.data()); in test_one()
64 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
67 assert(sorted == expected); in test_one()
68 assert(base(last) == sorted.data() + sorted.size()); in test_one()
72 auto sorted = input; in test_one() local
73 auto b = Iter(sorted.data()); in test_one()
74 auto e = Sent(Iter(sorted.data() + sorted.size())); in test_one()
78 assert(sorted == expected); in test_one()
79 assert(base(last) == sorted.data() + sorted.size()); in test_one()
|
| /llvm-project/mlir/lib/Transforms/ |
| H A D | OpStats.cpp | 64 SmallVector<StringRef, 64> sorted(opCount.keys()); in printSummary()
65 llvm::sort(sorted); in printSummary()
76 for (const auto &key : sorted) { in printSummary()
82 for (const auto &key : sorted) { in printSummary()
100 SmallVector<StringRef, 64> sorted(opCount.keys()); in printSummaryInJSON()
101 llvm::sort(sorted); in printSummaryInJSON()
105 for (unsigned i = 0, e = sorted.size(); i != e; ++i) { in printSummaryInJSON()
106 const auto &key = sorted[i]; in printSummaryInJSON()
63 SmallVector<StringRef, 64> sorted(opCount.keys()); printSummary() local
99 SmallVector<StringRef, 64> sorted(opCount.keys()); printSummaryInJSON() local
|
| /llvm-project/lld/COFF/ |
| H A D | CallGraphSort.cpp | 156 std::vector<int> sorted(clusters.size()); in run() local
160 std::iota(sorted.begin(), sorted.end(), 0); in run()
161 llvm::stable_sort(sorted, [&](int a, int b) { in run()
165 for (int l : sorted) { in run()
190 sorted.clear(); in run()
193 sorted.push_back(i); in run()
194 llvm::stable_sort(sorted, [&](int a, int b) { in run()
199 // Sections will be sorted by increasing order. Absent sections will have in run()
202 for (int leader : sorted) { in run()
[all...] |
| /llvm-project/lldb/test/Shell/SymbolFile/Breakpad/ |
| H A D | symtab-sorted-by-size.test | 1 # RUN: yaml2obj %S/Inputs/basic-elf.yaml -o %T/symtab-sorted-by-size.out
2 # RUN: %lldb %T/symtab-sorted-by-size.out -o "target symbols add -s symtab-sorted-by-size.out %S/In…
5 # CHECK: num_symbols = 4 (sorted by size):
11 image dump symtab -s size symtab-sorted-by-size.out
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | ranges_partial_sort.pass.cpp | 65 constexpr void test_one(std::array<int, N> input, std::size_t mid_index, std::array<int, N> sorted)… in test_one() argument
74 sorted.begin(), sorted.begin() + mid_index)); in test_one()
86 … assert(std::ranges::equal(begin, begin + mid_index, sorted.begin(), sorted.begin() + mid_index)); in test_one()
93 auto sorted = input; in test_all_subsequences() local
94 std::sort(sorted.begin(), sorted.end()); in test_all_subsequences()
97 test_one<Iter, Sent, N>(input, n, sorted); in test_all_subsequences()
|
| /llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 195 std::vector<int> sorted(clusters.size()); in run()
199 std::iota(sorted.begin(), sorted.end(), 0); in run()
200 llvm::stable_sort(sorted, [&](int a, int b) { in run()
204 for (int l : sorted) { in run()
229 sorted.clear(); in run()
232 sorted.push_back(i); in run()
233 llvm::stable_sort(sorted, [&](int a, int b) { in run()
239 for (int leader : sorted) { in run()
258 for (int leader : sorted) in run()
194 std::vector<int> sorted(clusters.size()); run() local
[all...] |
| /llvm-project/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/lld/MachO/ |
| H A D | SectionPriorities.cpp | 160 // Cluster indices sorted by density. in run()
161 std::vector<int> sorted(clusters.size()); in run()
166 std::iota(sorted.begin(), sorted.end(), 0); in run()
168 llvm::stable_sort(sorted, [&](int a, int b) { in run()
172 for (int l : sorted) { in run()
197 sorted.clear(); in run()
200 sorted.push_back(i); in run()
201 llvm::stable_sort(sorted, [&](int a, int b) { in run()
207 // Sections will be sorted b in run()
163 std::vector<int> sorted(clusters.size()); run() local
[all...] |
| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_test_cpp.cc | 128 isl::id_list sorted(ctx, 3); in test_foreach_scc() local
141 }, [&sorted] (isl::id_list scc) { in test_foreach_scc()
143 sorted = sorted.concat(scc); in test_foreach_scc()
145 assert(sorted.size() == 3); in test_foreach_scc()
146 assert(sorted.at(0).name() == "b"); in test_foreach_scc()
147 assert(sorted.at(1).name() == "c"); in test_foreach_scc()
148 assert(sorted.at(2).name() == "a"); in test_foreach_scc()
|
| H A D | isl_scheduler_scc.c | 73 int *sorted; member
158 free(scc_graph->sorted); in isl_scc_graph_free()
542 scc_graph->sorted = isl_alloc_array(ctx, int, n); in isl_scc_graph_alloc()
548 !scc_graph->size || !scc_graph->pos || !scc_graph->sorted || in isl_scc_graph_alloc()
994 int *sorted = scc_graph->sorted; in isl_scc_graph_sort_components() local
1017 sorted[pos[component[first + i]]++] = first + i; in isl_scc_graph_sort_components()
1037 int *sorted = scc_graph->sorted; in extract_components() local
1048 &sorted[sum], n, filters); in extract_components()
1077 int *sorted = scc_graph->sorted; in detect_components() local
1090 return recurse(scc_graph, &sorted[first], n, node); in detect_components()
[all …]
|
| H A D | isl_test_python.py | 238 sorted = [isl.id_list(3)]
254 sorted[0] = sorted[0].concat(scc)
257 assert sorted[0].size() == 3
258 assert sorted[0].at(0).name() == "b"
259 assert sorted[0].at(1).name() == "c"
260 assert sorted[0].at(2).name() == "a"
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| H A D | ranges_partial_sort_copy.pass.cpp | 124 … std::array<int, N> input, std::size_t input_size, size_t output_size, std::array<int, N> sorted) { in test_one() argument
149 std::ranges::subrange(sorted.begin(), sorted.begin() + result_size))); in test_one()
165 std::ranges::subrange(sorted.begin(), sorted.begin() + result_size))); in test_one()
172 auto sorted = input; in test_all_subsequences() local
173 std::sort(sorted.begin(), sorted.end()); in test_all_subsequences()
177 test_one<Iter, Sent, OutIter, OutSent>(input, N, out_size, sorted); in test_all_subsequences()
|
| /llvm-project/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/llvm/utils/ |
| H A D | sort_includes.py | 80 local_headers = sorted(set(local_headers))
81 subproject_headers = sorted(set(subproject_headers))
82 llvm_headers = sorted(set(llvm_headers))
83 system_headers = sorted(set(system_headers))
|
| H A D | update_mca_test_checks.py | 136 for prefix in sorted(lresult):
162 for prefix in sorted(lresult):
182 common_to_all = sorted(common_to_all)[0]
354 s = sorted(list(s))
367 block_infos[block_num][block_text] = sorted(list(current_set))
496 for block_text in sorted(block_infos[block_num]):
512 for prefix in sorted(output_blocks):
517 raise Error("unused prefixes: {}".format(sorted(unused_prefixes)))
|
| /llvm-project/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/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/ |
| H A D | ranges_nth_element.pass.cpp | 86 auto sorted = partially_sorted; in verify_nth() local
87 std::ranges::sort(sorted); in verify_nth()
90 assert(sorted[nth_index] == *nth); in verify_nth()
130 auto sorted = input; in test_all_cases() local
131 std::sort(sorted.begin(), sorted.end()); in test_all_cases()
134 test_one<Iter, Sent, N>(input, n, sorted[n]); in test_all_cases()
|
| /llvm-project/llvm/utils/mlgo-utils/tests/corpus/ |
| H A D | extract_ir_test.py | 212 for index, obj in enumerate(sorted(objs, key=lambda x: x._obj_relative_path)):
238 for i, o in enumerate(sorted(obj, key=lambda x: x._obj_relative_path)):
264 for i, o in enumerate(sorted(obj, key=lambda x: x._obj_relative_path)):
298 for i, o in enumerate(sorted(obj, key=lambda x: x._obj_relative_path)):
|
| /llvm-project/libcxx/utils/libcxx/ |
| H A D | header_information.py | |
| /llvm-project/third-party/benchmark/tools/gbench/ |
| H A D | util.py | 158 benchmarks = sorted(
164 benchmarks = sorted(
170 benchmarks = sorted(
176 benchmarks = sorted(
|
| /llvm-project/llvm/utils/gn/build/ |
| H A D | sync_source_lists_from_cmake.py | 121 by_rev(sorted(cmake_cpp - gn_cpp), "add")
122 by_rev(sorted(gn_cpp - cmake_cpp), "remove")
125 for rev in sorted(changes_by_rev):
128 for gn_file, data in sorted(changes_by_rev[rev].items()):
|
| /llvm-project/llvm/test/tools/llvm-symbolizer/ |
| H A D | split-dwarf-dwp-invalid.test | 10 a second time (the first time works fine, the second fails the sorted search
11 because of a null entry that can't be sorted/compared)
14 offset-sorted list, so a null entry in that list makes it impossible to sort
|
| /llvm-project/lldb/scripts/ |
| H A D | analyze-project-deps.py | 219 sorted = [] variable
221 sorted.append((node, incoming_counts[node], outgoing_counts[node]))
222 sorted.sort(key=lambda x: x[1] + x[2])
223 for node, inc, outg in sorted:
|