Searched refs:__result_first (Results 1 - 4 of 4) sorted by relevance
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | stl_algo.h | 1684 _RandomAccessIterator __result_first, 1693 if (__result_first == __result_last) 1695 _RandomAccessIterator __result_real_last = __result_first; 1703 std::__make_heap(__result_first, __result_real_last, __comp); 1706 if (__comp(__first, __result_first)) 1707 std::__adjust_heap(__result_first, _DistanceType(0), 1709 - __result_first), 1713 std::__sort_heap(__result_first, __result_real_last, __comp); 1722 * @param __result_first A random-access iterator. 1727 * to the range beginning at @p __result_first, wher 1683 __partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument 1738 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) argument 1789 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument [all...] |
H A D | ranges_algo.h | 666 auto __result_first = ranges::end(__rresult).base(); local 671 return {__result_first, __result_last}; 2132 _Iter2 __result_first, _Sent2 __result_last, 2136 if (__result_first == __result_last) 2141 return {std::move(__lasti), std::move(__result_first)}; 2144 auto __result_real_last = __result_first; 2152 ranges::make_heap(__result_first, __result_real_last, __comp, __proj2); 2156 std::__invoke(__proj2, *__result_first))) 2158 ranges::pop_heap(__result_first, __result_real_last, 2161 ranges::push_heap(__result_first, __result_real_las 2131 operator ()(_Iter1 __first, _Sent1 __last, _Iter2 __result_first, _Sent2 __result_last, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | stl_algo.h | 1643 _RandomAccessIterator __result_first, 1652 if (__result_first == __result_last) 1654 _RandomAccessIterator __result_real_last = __result_first; 1662 std::__make_heap(__result_first, __result_real_last, __comp); 1665 if (__comp(__first, __result_first)) 1666 std::__adjust_heap(__result_first, _DistanceType(0), 1668 - __result_first), 1672 std::__sort_heap(__result_first, __result_real_last, __comp); 1683 * @param __result_first A random-access iterator. 1688 * `[__first, __last)` to the range beginning at `__result_first`, wher 1642 __partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument 1699 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) argument 1750 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument [all...] |
H A D | ranges_algo.h | 456 auto __result_first = ranges::end(__rresult).base(); local 461 return {__result_first, __result_last}; 1923 _Iter2 __result_first, _Sent2 __result_last, 1927 if (__result_first == __result_last) 1932 return {std::move(__lasti), std::move(__result_first)}; 1935 auto __result_real_last = __result_first; 1943 ranges::make_heap(__result_first, __result_real_last, __comp, __proj2); 1947 std::__invoke(__proj2, *__result_first))) 1949 ranges::pop_heap(__result_first, __result_real_last, 1952 ranges::push_heap(__result_first, __result_real_las 1922 operator ()(_Iter1 __first, _Sent1 __last, _Iter2 __result_first, _Sent2 __result_last, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument [all...] |
Completed in 209 milliseconds