/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | next_permutation.h | 35 _BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); 36 _BidirectionalIterator __i = __last_iter; 38 return _Result(std::move(__last_iter), false); 43 _BidirectionalIterator __j = __last_iter; 47 std::__reverse<_AlgPolicy>(__ip1, __last_iter); 48 return _Result(std::move(__last_iter), true); 51 std::__reverse<_AlgPolicy>(__first, __last_iter); 52 return _Result(std::move(__last_iter), false);
|
H A D | prev_permutation.h | 35 _BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); 36 _BidirectionalIterator __i = __last_iter; 38 return _Result(std::move(__last_iter), false); 43 _BidirectionalIterator __j = __last_iter; 47 std::__reverse<_AlgPolicy>(__ip1, __last_iter); 48 return _Result(std::move(__last_iter), true); 51 std::__reverse<_AlgPolicy>(__first, __last_iter); 52 return _Result(std::move(__last_iter), false);
|
H A D | ranges_pop_heap.h | 49 auto __last_iter = ranges::next(__first, __last); local 50 auto __len = __last_iter - __first; 53 std::__pop_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp, __len); local 55 return __last_iter;
|
H A D | ranges_inplace_merge.h | 48 auto __last_iter = ranges::next(__middle, __last); local 50 std::move(__first), std::move(__middle), __last_iter, std::__make_projected(__comp, __proj)); local 51 return __last_iter;
|
H A D | ranges_nth_element.h | 48 auto __last_iter = ranges::next(__first, __last); local 51 std::__nth_element_impl<_RangeAlgPolicy>(std::move(__first), std::move(__nth), __last_iter, __projected_comp); local 53 return __last_iter;
|
H A D | ranges_push_heap.h | 49 auto __last_iter = ranges::next(__first, __last); local 52 std::__push_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp); local 54 return __last_iter;
|
H A D | ranges_make_heap.h | 49 auto __last_iter = ranges::next(__first, __last); local 52 std::__make_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp); local 54 return __last_iter;
|
H A D | ranges_stable_partition.h | 51 auto __last_iter = ranges::next(__first, __last); local 55 std::move(__first), __last_iter, __projected_pred, __iterator_concept<_Iter>()); 57 return {std::move(__result), std::move(__last_iter)};
|
H A D | ranges_stable_sort.h | 47 auto __last_iter = ranges::next(__first, __last); local 50 std::__stable_sort_impl<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp); local 52 return __last_iter;
|
H A D | ranges_sort_heap.h | 49 auto __last_iter = ranges::next(__first, __last); local 52 std::__sort_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp); local 54 return __last_iter;
|
H A D | ranges_sort.h | 48 auto __last_iter = ranges::next(__first, __last); local 51 std::__sort_impl<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp); local 53 return __last_iter;
|
H A D | rotate.h | 175 _Iterator __last_iter = _IterOps<_AlgPolicy>::next(__middle, __last); 178 return _Ret(__last_iter, __last_iter); 180 return _Ret(std::move(__first), std::move(__last_iter)); 183 auto __result = std::__rotate_impl<_AlgPolicy>(std::move(__first), std::move(__middle), __last_iter, _IterCategory()); 185 return _Ret(std::move(__result), std::move(__last_iter));
|
H A D | partial_sort.h | 64 auto __last_iter = local 69 return __last_iter;
|
H A D | ranges_is_heap.h | 43 auto __last_iter = ranges::next(__first, __last); local 46 auto __result = std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
|
H A D | ranges_is_heap_until.h | 44 auto __last_iter = ranges::next(__first, __last); local 47 return std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
|
H A D | copy_backward.h | 40 auto __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); local 41 auto __original_last_iter = __last_iter; 43 while (__first != __last_iter) { 44 *--__result = *--__last_iter;
|
H A D | move_backward.h | 40 auto __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); local 41 auto __original_last_iter = __last_iter; 43 while (__first != __last_iter) { 44 *--__result = _IterOps<_AlgPolicy>::__iter_move(--__last_iter);
|