| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/ |
| H A D | ranges.copy_backward.pass.cpp | 33 concept HasCopyBackwardIt = requires(In in, Sent sent, Out out) { std::ranges::copy_backward(in, se… 46 concept HasCopyBackwardR = requires(Range range, Out out) { std::ranges::copy_backward(range, out);… 66 …std::ranges::copy_backward(In(in.data()), Sent(In(in.data() + in.size())), Out(out.data() + out.si… in test_iterators() 76 std::ranges::copy_backward(range, Out(out.data() + out.size())); in test_iterators() 96 auto ret = std::ranges::copy_backward(range, Out(out.data())); in test_iterators() 136 std::ranges::copy_backward(std::array {1, 2, 3, 4}, out.data() + out.size()); in test() 145 std::ranges::copy_backward(std::views::all(in), out.data() + out.size()); in test() 165 auto ret = std::ranges::copy_backward(in.begin(), in.end(), out.end()); in test() 173 auto ret = std::ranges::copy_backward(in, out.end()); in test() 198 auto ret = std::ranges::copy_backward(in, out.end()); in test() [all …]
|
| H A D | copy_backward.pass.cpp | 33 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); in test_copy_backward()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.special/ |
| H A D | copy_backward.pass.cpp | 55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); in testN() 57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); in testN() 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); in testN() 61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); in testN() 63 assert(std::copy_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin()); in testN() 65 assert(std::copy_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin()); in testN()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
| H A D | contiguous_trivial_optimization.pass.cpp | 42 std::copy_backward(ia, ia+4, ib+4); in test_trivial_moveassign_but_no_trivial_copyassign() 48 std::copy_backward(std::make_move_iterator(ia), std::make_move_iterator(ia+4), ib+4); in test_trivial_moveassign_but_no_trivial_copyassign() 83 std::copy_backward(std::make_move_iterator(ia), std::make_move_iterator(ia+4), ib+4); in test_trivial_copyassign_but_no_trivial_moveassign() 89 std::copy_backward(ia, ia+4, ib+4); in test_trivial_copyassign_but_no_trivial_moveassign()
|
| /llvm-project-15.0.7/clang/include/clang/AST/ |
| H A D | ASTVector.h | 230 std::copy_backward(I, this->end()-1, this->end()); in insert() 265 std::copy_backward(I, OldEnd-NumToInsert, OldEnd); in insert() 315 std::copy_backward(I, OldEnd-NumToInsert, OldEnd); in insert()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | ranges_copy_backward.h | 58 inline constexpr auto copy_backward = __copy_backward::__fn{};
|
| H A D | copy_backward.h | 55 copy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, _BidirectionalIterat… in copy_backward() function
|
| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | bstring.cpp | 59 std::copy_backward(v.begin(), v.end(), buf + n); in testStdCopyBackwardInvalidatesBuffer()
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | deque | 164 #include <__algorithm/copy_backward.h> 249 copy_backward(_RAIter __f, 257 copy_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f, 264 copy_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f, 512 copy_backward(_RAIter __f, 678 // copy_backward 683 copy_backward(_RAIter __f, 703 _VSTD::copy_backward(__m, __l, __re); 731 __r = _VSTD::copy_backward(__lb, __le, __r); 759 __r = _VSTD::copy_backward(__lb, __le, __r); [all …]
|
| H A D | __bit_reference | 563 // copy_backward 701 copy_backward(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_it… 725 return _VSTD::copy_backward(__first, __last, __result); 959 … _VSTD::copy_backward(__b.begin(), __b.end(), _VSTD::copy_backward(__first, __middle, __last)); 1310 friend __bit_iterator<_Dp, false> copy_backward(__bit_iterator<_Dp, _IC> __first,
|
| H A D | vector | 3019 _VSTD::copy_backward(__position, __old_end, end()); 3028 _VSTD::copy_backward(__position, cend(), __v.end()); 3045 _VSTD::copy_backward(__position, __old_end, end()); 3054 _VSTD::copy_backward(__position, cend(), __v.end()); 3122 _VSTD::copy_backward(__position, __old_end, end()); 3131 _VSTD::copy_backward(__position, cend(), __v.end());
|
| H A D | CMakeLists.txt | 10 __algorithm/copy_backward.h
|
| H A D | algorithm | 257 …ranges::copy_backward(I1 first, S1 last, I2 result); // since C++… 262 …ranges::copy_backward(R&& r, I result); // since C++… 1218 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1724 #include <__algorithm/copy_backward.h>
|
| H A D | module.modulemap.in | 252 module copy_backward { private header "__algorithm/copy_backward.h" }
|
| H A D | bitset | 849 …_VSTD::copy_backward(base::__make_iter(0), base::__make_iter(_Size - __pos), base::__make_iter(_Si…
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 113 test(std::ranges::copy_backward, in, out_end); in run_tests()
|
| H A D | robust_against_adl.compile.pass.cpp | 63 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 135 dangling_1st<copy_backward_result<dangling, int*>>(std::ranges::copy_backward, in, output.end()); in test_all()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 100 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
|
| H A D | robust_against_proxy_iterators_lifetime_bugs.pass.cpp | 705 test(simple_in, [&](I b, I e) { std::copy_backward(b, e, out + N); }); in test()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 91 (void) std::copy_backward(it, it, it); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 69 static_assert(test(std::ranges::copy_backward, a, a));
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | LiveIntervals.cpp | 1369 std::copy_backward(NewIdxIn, OldIdxIn, OldIdxOut); in handleMoveUp() 1405 std::copy_backward(NewIdxOut, OldIdxOut, std::next(OldIdxOut)); in handleMoveUp() 1430 std::copy_backward(NewIdxOut, OldIdxOut, std::next(OldIdxOut)); in handleMoveUp()
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | RangesAlgorithms.csv | 42 Write,copy_backward,Nikolas Klauser,`D122982 <https://llvm.org/D122982>`_,✅
|
| /llvm-project-15.0.7/llvm/utils/gn/secondary/libcxx/include/ |
| H A D | BUILD.gn | 79 "__algorithm/copy_backward.h",
|