57 template <class _AlgPolicy, class _Compare, class _InputIterator1, class _Sent1,
67             std::__move<_AlgPolicy>(__first1, __last1, __result);  in __half_inplace_merge()
73             *__result = _IterOps<_AlgPolicy>::__iter_move(__first2);  in __half_inplace_merge()
78             *__result = _IterOps<_AlgPolicy>::__iter_move(__first1);  in __half_inplace_merge()
85 template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
101             ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i));  in __buffered_inplace_merge()
102         std::__half_inplace_merge<_AlgPolicy>(__buff, __p, __middle, __last, __first, __comp);  in __buffered_inplace_merge()
108             ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i));  in __buffered_inplace_merge()
112         std::__half_inplace_merge<_AlgPolicy>(_Rv(__p), _Rv(__buff),  in __buffered_inplace_merge()
118 template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
128     using _Ops = _IterOps<_AlgPolicy>;  in __inplace_merge()
137             return std::__buffered_inplace_merge<_AlgPolicy>  in __inplace_merge()
165 …        __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity());  in __inplace_merge()
187         __middle = std::__rotate<_AlgPolicy>(__m1, __middle, __m2).first;  in __inplace_merge()
192             std::__inplace_merge<_AlgPolicy>(  in __inplace_merge()
201             std::__inplace_merge<_AlgPolicy>(  in __inplace_merge()
211 template <class _AlgPolicy, class _BidirectionalIterator, class _Compare>
219     difference_type __len1 = _IterOps<_AlgPolicy>::distance(__first, __middle);  in __inplace_merge()
220     difference_type __len2 = _IterOps<_AlgPolicy>::distance(__middle, __last);  in __inplace_merge()
227     return std::__inplace_merge<_AlgPolicy>(  in __inplace_merge()