include/__algorithm/move_backward.h

33 __move_backward(_BidirectionalIterator1 __first, _Sentinel __last, _BidirectionalIterator2 __result);
39   operator()(_InIter __first, _Sent __last, _OutIter __result) const {
44       *--__result = _IterOps<_AlgPolicy>::__iter_move(--__last_iter);
47     return std::make_pair(std::move(__original_last_iter), std::move(__result));
52   operator()(_InIter __first, _InIter __last, _OutIter __result) const {
58           std::__move_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__result));
62     __result =
63         std::__move_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__local(__last), std::move(__result))
67       __result =
68           std::__move_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__end(__slast), std::move(__result))
72     __result = std::__move_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__end(__slast), std::move(__result))
74     return std::make_pair(__last, std::move(__result));
83   operator()(_InIter __first, _InIter __last, _OutIter __result) {
87     // When the range contains no elements, __result might not be a valid iterator
89       return std::make_pair(__first, __result);
93     auto __local_last       = _Traits::__local(__result);
94     auto __segment_iterator = _Traits::__segment(__result);
114   operator()(_In* __first, _In* __last, _Out* __result) const {
115     return std::__copy_backward_trivial_impl(__first, __last, __result);
121 __move_backward(_BidirectionalIterator1 __first, _Sentinel __last, _BidirectionalIterator2 __result) {
126       std::move(__first), std::move(__last), std::move(__result));
131 move_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, _BidirectionalIterator2 __result) {
132   return std::__move_backward<_ClassicAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)).second;