/llvm-project/libcxx/include/__algorithm/ |
H A D | ranges_contains_subrange.h | 80 return __ret.empty() == false; local 59 auto __ret = ranges::search( global() local
|
H A D | ranges_unique.h | 52 return {std::move(__ret.first), std::move(__ret.second)}; local 63 return {std::move(__ret.first), std::move(__ret.second)}; local
|
H A D | ranges_find_end.h | 56 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( global() local 77 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( global() local
|
H A D | ranges_equal_range.h | 61 return {std::move(__ret.first), std::move(__ret.second)}; local 51 auto __ret = std::__equal_range<_RangeAlgPolicy>(std::move(__first), std::move(__last), __value, __comp, __proj); global() local
|
H A D | ranges_copy.h | 46 auto __ret = std::__copy<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)); operator() local 54 auto __ret = std::__copy<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result)); operator() local
|
H A D | ranges_minmax_element.h | 51 return {__ret.first, __ret.second}; local 60 return {__ret.first, __ret.second}; local
|
H A D | ranges_set_intersection.h | 64 auto __ret = std::__set_intersection<_RangeAlgPolicy>( global() local 90 auto __ret = std::__set_intersection<_RangeAlgPolicy>( global() local
|
H A D | ranges_set_difference.h | 66 auto __ret = std::__set_difference<_RangeAlgPolicy>( global() local 85 auto __ret = std::__set_difference<_RangeAlgPolicy>( global() local
|
H A D | ranges_set_union.h | 67 auto __ret = std::__set_union<_RangeAlgPolicy>( global() local 91 auto __ret = std::__set_union<_RangeAlgPolicy>( global() local
|
H A D | ranges_copy_backward.h | 44 return {std::move(__ret.first), std::move(__ret.second)}; in operator() local 52 return {std::move(__ret.first), std::move(__ret.second)}; in operator() local
|
H A D | ranges_set_symmetric_difference.h | 64 auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>( global() local 90 auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>( global() local
|
H A D | ranges_binary_search.h | 44 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret)); local 56 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret)); local
|
H A D | ranges_reverse.h | 40 auto __ret = __end; operator() local 49 auto __ret = __end; operator() local
|
H A D | ranges_search_n.h | 64 return {std::move(__ret.first), std::move(__ret.second)}; in __ranges_search_n_impl() local 58 auto __ret = std::__search_n_random_access_impl<_RangeAlgPolicy>( __ranges_search_n_impl() local
|
H A D | ranges_unique_copy.h | 78 auto __ret = std::__unique_copy<_RangeAlgPolicy>( global() local 97 auto __ret = std::__unique_copy<_RangeAlgPolicy>( global() local
|
H A D | ranges_search.h | 60 auto __ret = std::__search_random_access_impl<_RangeAlgPolicy>( __ranges_search_impl() local 67 auto __ret = __ranges_search_impl() local
|
H A D | ranges_swap_ranges.h | 45 auto __ret = std::__swap_ranges<_RangeAlgPolicy>( operator() local
|
H A D | ranges_reverse_copy.h | 53 return {ranges::next(ranges::begin(__range), ranges::end(__range)), std::move(__ret.out)}; in operator() local
|
H A D | ranges_rotate.h | 41 auto __ret = std::__rotate<_RangeAlgPolicy>(std::move(__first), std::move(__middle), std::move(__last)); __rotate_fn_impl() local
|
H A D | ranges_copy_n.h | 57 auto __ret = std::__copy(__first, __first + __n, __result); in __go() local
|
H A D | ranges_move_backward.h | 45 return {std::move(__ret.first), std::move(__ret.second)}; in __move_backward_impl() local
|
H A D | ranges_move.h | 43 return {std::move(__ret.first), std::move(__ret.second)}; in __move_impl() local
|
H A D | shift_right.h | 56 _ForwardIterator __ret = __first; in shift_right() local
|
H A D | minmax.h | 45 auto __ret = std::__minmax_element_impl(__t.begin(), __t.end(), __comp, __proj); in minmax() local
|
/llvm-project/libcxx/include/__atomic/ |
H A D | cxx_atomic_impl.h |
|