| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | ranges_unique.h | 49 auto __ret = std::__unique<_RangeAlgPolicy>( local 61 auto __ret = std::__unique<_RangeAlgPolicy>( local
|
| H A D | ranges_equal_range.h | 48 auto __ret = std::__equal_range<_RangeAlgPolicy>( local 60 auto __ret = std::__equal_range<_RangeAlgPolicy>( local
|
| H A D | ranges_find_end.h | 48 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( local 73 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( local
|
| H A D | ranges_set_union.h | 64 auto __ret = std::__set_union( local 98 auto __ret = std::__set_union( local
|
| H A D | ranges_set_symmetric_difference.h | 61 auto __ret = std::__set_symmetric_difference( local 95 auto __ret = std::__set_symmetric_difference( local
|
| H A D | ranges_set_difference.h | 62 auto __ret = std::__set_difference( local 83 auto __ret = std::__set_difference( local
|
| H A D | ranges_minmax_element.h | 47 auto __ret = std::__minmax_element_impl(std::move(__first), std::move(__last), __comp, __proj); local 56 auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj); local
|
| H A D | ranges_set_intersection.h | 62 auto __ret = std::__set_intersection<_RangeAlgPolicy>( local 96 auto __ret = std::__set_intersection<_RangeAlgPolicy>( local
|
| H A D | ranges_copy.h | 42 auto __ret = std::__copy(std::move(__first), std::move(__last), std::move(__result)); in operator() local 50 auto __ret = std::__copy(ranges::begin(__r), ranges::end(__r), std::move(__result)); in operator() local
|
| H A D | ranges_copy_backward.h | 43 …auto __ret = std::__copy_backward<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::mov… in operator() local 51 …auto __ret = std::__copy_backward<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move… in operator() local
|
| H A D | ranges_reverse.h | 42 auto __ret = __end; in operator() local 51 auto __ret = __end; in operator() local
|
| H A D | ranges_binary_search.h | 38 auto __ret = std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj); local 48 auto __ret = std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj); local
|
| H A D | ranges_search_n.h | 55 auto __ret = __search_n_random_access_impl<_RangeAlgPolicy>(__first, __last, in __ranges_search_n_impl() local 65 auto __ret = std::__search_n_forward_impl<_RangeAlgPolicy>(__first, __last, in __ranges_search_n_impl() local
|
| H A D | ranges_unique_copy.h | 75 auto __ret = std::__unique_copy<_RangeAlgPolicy>( local 94 auto __ret = std::__unique_copy<_RangeAlgPolicy>( local
|
| H A D | ranges_search.h | 59 auto __ret = std::__search_random_access_impl<_RangeAlgPolicy>( in __ranges_search_impl() local 66 auto __ret = in __ranges_search_impl() local
|
| H A D | copy_backward.h | 35 auto __ret = std::__copy( in __copy_backward() local 48 …auto __ret = ranges::copy(std::move(__reverse_range), std::make_reverse_iterator(__resul… in __copy_backward() local
|
| H A D | ranges_reverse_copy.h | 51 auto __ret = ranges::copy(std::__reverse_range(__range), std::move(__result)); in operator() local
|
| H A D | ranges_swap_ranges.h | 43 auto __ret = std::__swap_ranges<_RangeAlgPolicy>( in operator() local
|
| H A D | ranges_rotate.h | 40 auto __ret = std::__rotate<_RangeAlgPolicy>( in __rotate_fn_impl() local
|
| H A D | ranges_move.h | 42 …auto __ret = std::__move<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__resul… in __move_impl() local
|
| H A D | ranges_copy_n.h | 54 auto __ret = std::__copy(__first, __first + __n, __result); in __go() local
|
| H A D | ranges_move_backward.h | 44 auto __ret = ranges::move(std::make_reverse_iterator(__last_iter), in __move_backward_impl() local
|
| H A D | shift_right.h | 55 _ForwardIterator __ret = __first; in shift_right() local
|
| H A D | minmax.h | 52 auto __ret = std::__minmax_element_impl(__t.begin(), __t.end(), __comp, __proj); in minmax() local
|
| /llvm-project-15.0.7/libcxx/include/__chrono/ |
| H A D | hh_mm_ss.h | 39 uint64_t __ret = 1; in __pow10() local
|