Home
last modified time | relevance | path

Searched refs:stable_sort (Results 1 – 25 of 195) sorted by relevance

12345678

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/
H A Dranges.stable.sort.pass.cpp68 std::same_as<Iter> decltype(auto) last = std::ranges::stable_sort(b, e); in test_one()
79 std::same_as<Iter> decltype(auto) last = std::ranges::stable_sort(range); in test_one()
152 auto last = std::ranges::stable_sort(in.begin(), in.end()); in test()
159 auto last = std::ranges::stable_sort(in); in test()
182 auto last = std::ranges::stable_sort(in.begin(), in.end(), std::greater{}); in test()
189 auto last = std::ranges::stable_sort(in, std::greater{}); in test()
203 auto last = std::ranges::stable_sort(in.begin(), in.end(), {}, &A::a); in test()
210 auto last = std::ranges::stable_sort(in, {}, &A::a); in test()
229 auto last = std::ranges::stable_sort(in.begin(), in.end(), &S::comparator, &S::projection); in test()
236 auto last = std::ranges::stable_sort(in, &S::comparator, &S::projection); in test()
[all …]
H A Dstable_sort.pass.cpp40 std::stable_sort(save, save+len); in test_sort_helper()
96 std::stable_sort(array, array+N); in test_larger_sorts()
100 std::stable_sort(array, array+N); in test_larger_sorts()
103 std::stable_sort(array, array+N); in test_larger_sorts()
107 std::stable_sort(array, array+N); in test_larger_sorts()
111 std::stable_sort(array, array+N); in test_larger_sorts()
116 std::stable_sort(array, array+N); in test_larger_sorts()
139 std::stable_sort(&d, &d); in main()
H A Dstable_sort_comp.pass.cpp65 std::stable_sort(v.begin(), v.end(), first_only()); in test()
78 std::stable_sort(v.begin(), v.end(), indirect_less()); in main()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Drobust_against_adl_on_new.pass.cpp30 std::stable_sort(a, a+4); in main()
31 std::stable_sort(a, a+4, std::less<A>()); in main()
/llvm-project-15.0.7/pstl/
H A DREADME.md25 `sort`, `stable_partition`, `stable_sort`, `unique`.
29 …ement`, `min_element`, `minmax_element`, `partial_sort`, `partial_sort_copy`, `sort`, `stable_sort`
33 …rt`, `partial_sort_copy`, `partition_copy`, `remove`, `remove_if`, `rotate`, `sort`, `stable_sort`,
/llvm-project-15.0.7/clang/test/Analysis/
H A Dptr-sort.cpp18 std::stable_sort(V1.begin(), V1.end()); // no-warning in PointerSorting()
30 …std::stable_sort(V2.begin(), V2.end()); // expected-warning {{Sorting pointer-like elements can re… in PointerSorting()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/
H A Dsort.pass.cpp171 std::stable_sort(expected_first + 1, expected_last - 1, compare); in operator ()()
176 stable_sort(exec, tmp_first + 1, tmp_last - 1, compare); in operator ()()
223 stable_sort(exec, iter, iter, non_const(std::less<T>())); in operator ()()
/llvm-project-15.0.7/llvm/tools/llvm-cov/
H A DSourceCoverageView.cpp199 llvm::stable_sort(ExpansionSubViews); in print()
200 llvm::stable_sort(InstantiationSubViews); in print()
201 llvm::stable_sort(BranchSubViews); in print()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dstable_sort.h232 void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in stable_sort() function
238 void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { in stable_sort() function
239 …std::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty… in stable_sort()
H A Dranges_stable_sort.h71 inline constexpr auto stable_sort = __stable_sort::__fn{};
/llvm-project-15.0.7/libcxx/benchmarks/algorithms/
H A Dranges_stable_sort.bench.cpp21 [](auto& Copy) { std::ranges::stable_sort(Copy); }); in run()
H A Dstable_sort.bench.cpp21 [](auto& Copy) { std::stable_sort(Copy.begin(), Copy.end()); }); in run()
/llvm-project-15.0.7/lld/MachO/
H A DOutputSegment.cpp146 llvm::stable_sort(sections, compareByOrder<OutputSection *>(sectionOrder)); in sortOutputSections()
157 llvm::stable_sort(outputSegments, in sortOutputSegments()
H A DSectionPriorities.cpp170 llvm::stable_sort(sorted, [&](int a, int b) { in run()
203 llvm::stable_sort(sorted, [&](int a, int b) { in run()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DSplitFunctions.cpp264 stable_sort(NewLayout, [&](BinaryBasicBlock *A, BinaryBasicBlock *B) { in splitFunction()
275 std::stable_sort(FirstLP, NewLayout.end(), in splitFunction()
372 stable_sort(NewLayout, [&](BinaryBasicBlock *A, BinaryBasicBlock *B) { in createEHTrampolines()
H A DReorderFunctions.cpp299 llvm::stable_sort(SortedFunctions, [&](const BinaryFunction *A, in runOnFunctions()
416 llvm::stable_sort(SortedFunctions, in runOnFunctions()
/llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/
H A Dstable_sort.pass.cpp24 std::stable_sort(working.begin(), working.end(), ByteWithPayload::key_less()); in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/lld/COFF/
H A DCallGraphSort.cpp159 llvm::stable_sort(sorted, [&](int a, int b) { in run()
192 llvm::stable_sort(sorted, [&](int a, int b) { in run()
H A DLLDMapFile.cpp67 std::stable_sort(v.begin(), v.end(), [](DefinedRegular *a, DefinedRegular *b) { in getSectionSyms()
/llvm-project-15.0.7/lld/ELF/
H A DCallGraphSort.cpp188 llvm::stable_sort(sorted, [&](int a, int b) { in run()
221 llvm::stable_sort(sorted, [&](int a, int b) { in run()
H A DRelocations.h210 llvm::stable_sort(storage, cmp); in sortRels()
/llvm-project-15.0.7/clang/lib/Index/
H A DFileIndexRecord.cpp22 llvm::stable_sort(Decls, in getDeclOccurrencesSortedByOffset()
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonShuffler.cpp327 llvm::stable_sort(*ShuffledPacket, HexagonInstr::lessCVI); in ValidResourceUsage()
630 llvm::stable_sort(PacketResult, HexagonInstr::lessCore); in tryAuction()
682 std::stable_sort(ISJ, Packet.end()); in shuffle()
/llvm-project-15.0.7/llvm/tools/llvm-reduce/deltas/
H A DReduceOperandsSkip.cpp183 llvm::stable_sort(Candidates, IsMoreReduced); in opportunities()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCtorUtils.cpp129 stable_sort(CtorsByPriority, [&](size_t LHS, size_t RHS) { in optimizeGlobalCtorsList()

12345678