Searched refs:move_backward (Results 1 – 9 of 9) sorted by relevance
| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| D | move_backward.pass.cpp | 55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); in testN()
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); in testN()
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); in testN()
61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); in testN()
63 assert(std::move_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin()); in testN()
65 assert(std::move_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin()); in testN()
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
| D | move_backward.pass.cpp | 35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); in test()
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); in test1()
|
| /external/llvm/include/llvm/ADT/ |
| D | SmallVector.h | 202 static It2 move_backward(It1 I, It1 E, It2 Dest) { in move_backward() function
296 static It2 move_backward(It1 I, It1 E, It2 Dest) { in move_backward() function
505 this->move_backward(I, this->end()-1, this->end()); in insert()
534 this->move_backward(I, this->end()-1, this->end()); in insert()
575 this->move_backward(I, OldEnd-NumToInsert, OldEnd); in insert()
629 this->move_backward(I, OldEnd-NumToInsert, OldEnd); in insert()
|
| /external/libcxx/include/ |
| D | deque | 245 move_backward(_RAIter __f,
253 move_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f,
260 move_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f,
501 move_backward(_RAIter __f,
510 move_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f,
518 move_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f,
781 // move_backward
786 move_backward(_RAIter __f,
806 _VSTD::move_backward(__m, __l, __re);
816 move_backward(__deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __f,
[all …]
|
| D | __split_buffer | 471 __begin_ = _VSTD::move_backward(__begin_, __end_, __end_ + __d);
502 __begin_ = _VSTD::move_backward(__begin_, __end_, __end_ + __d);
|
| D | __bit_reference | 701 // move_backward
706 move_backward(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_it…
|
| D | iterator | 1104 template <class _B1, class _B2> _B2 _LIBCPP_INLINE_VISIBILITY move_backward(_B1, _B1, _B2);
1291 template <class _B1, class _B2> friend _B2 move_backward(_B1, _B1, _B2);
|
| D | algorithm | 1916 // move_backward
1950 move_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last,
2388 _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last);
|
| D | vector | 1707 _VSTD::move_backward(__from_s, __from_s + __n, __old_last);
|