From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 1888) id 756073959C64; Thu, 8 Apr 2021 21:12:12 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 756073959C64 MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset="utf-8" From: Patrick Palka To: gcc-cvs@gcc.gnu.org, libstdc++-cvs@gcc.gnu.org Subject: [gcc r11-8070] libstdc++: Simplify copy-pasted algorithms in X-Act-Checkin: gcc X-Git-Author: Patrick Palka X-Git-Refname: refs/heads/master X-Git-Oldrev: c7fe68f3652ceefaf297611d1e64c8d9da43ad93 X-Git-Newrev: c1ce418af29bc1796bfe82a5aa97639eccc30cb7 Message-Id: <20210408211212.756073959C64@sourceware.org> Date: Thu, 8 Apr 2021 21:12:12 +0000 (GMT) X-BeenThere: libstdc++-cvs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Libstdc++-cvs mailing list List-Unsubscribe: , List-Archive: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 08 Apr 2021 21:12:12 -0000 https://gcc.gnu.org/g:c1ce418af29bc1796bfe82a5aa97639eccc30cb7 commit r11-8070-gc1ce418af29bc1796bfe82a5aa97639eccc30cb7 Author: Patrick Palka Date: Thu Apr 8 16:45:25 2021 -0400 libstdc++: Simplify copy-pasted algorithms in The header currently copies some simple algorithms from , which was originally done in order to avoid a circular dependency with the header. This is no longer an issue since the latter header now includes instead of all of . This means we could now just include and remove the copied algorithms, but that'd increase the size of by ~10%. And we can't use the corresponding STL-style algorithms here because they assume input iterators are copyable. So this patch instead simplifies these copied algorithms, removing their constraints and unused parameters, and keeps them around. In a subsequent patch we're going to copy (a simplified version of) ranges::find into as well. libstdc++-v3/ChangeLog: * include/std/ranges (__detail::find_if): Simplify. (__detail::find_if_not): Likewise. (__detail::min): Remove. (__detail::mismatch): Simplify. (take_view::size): Use std::min instead of __detail::min. Diff: --- libstdc++-v3/include/std/ranges | 59 ++++++++++++----------------------------- 1 file changed, 17 insertions(+), 42 deletions(-) diff --git a/libstdc++-v3/include/std/ranges b/libstdc++-v3/include/std/ranges index cfcbcaba065..9077271e4e6 100644 --- a/libstdc++-v3/include/std/ranges +++ b/libstdc++-v3/include/std/ranges @@ -978,65 +978,40 @@ namespace views::__adaptor using all_t = decltype(all(std::declval<_Range>())); } // namespace views - // XXX: the following algos are copied from ranges_algo.h to avoid a circular - // dependency with that header. + // The following simple algos are transcribed from ranges_algo.h to avoid + // having to include that entire header. namespace __detail { - template _Sent, - typename _Proj = identity, - indirect_unary_predicate> _Pred> + template constexpr _Iter - find_if(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) + find_if(_Iter __first, _Sent __last, _Pred __pred) { while (__first != __last - && !(bool)std::__invoke(__pred, std::__invoke(__proj, *__first))) + && !(bool)std::__invoke(__pred, *__first)) ++__first; return __first; } - template _Sent, - typename _Proj = identity, - indirect_unary_predicate> _Pred> + template constexpr _Iter - find_if_not(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) + find_if_not(_Iter __first, _Sent __last, _Pred __pred) { while (__first != __last - && (bool)std::__invoke(__pred, std::__invoke(__proj, *__first))) + && (bool)std::__invoke(__pred, *__first)) ++__first; return __first; } - template> - _Comp = ranges::less> - constexpr const _Tp& - min(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) - { - if (std::__invoke(std::move(__comp), - std::__invoke(__proj, __b), - std::__invoke(__proj, __a))) - return __b; - else - return __a; - } - - template _Sent1, - input_iterator _Iter2, sentinel_for<_Iter2> _Sent2, - typename _Pred = ranges::equal_to, - typename _Proj1 = identity, typename _Proj2 = identity> - requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> + template constexpr pair<_Iter1, _Iter2> - mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, - _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) + mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2) { while (__first1 != __last1 && __first2 != __last2 - && (bool)std::__invoke(__pred, - std::__invoke(__proj1, *__first1), - std::__invoke(__proj2, *__first2))) - { - ++__first1; - ++__first2; - } + && (bool)ranges::equal_to{}(*__first1, *__first2)) + { + ++__first1; + ++__first2; + } return { std::move(__first1), std::move(__first2) }; } } // namespace __detail @@ -1847,14 +1822,14 @@ namespace views::__adaptor size() requires sized_range<_Vp> { auto __n = ranges::size(_M_base); - return __detail::min(__n, static_cast(_M_count)); + return std::min(__n, static_cast(_M_count)); } constexpr auto size() const requires sized_range { auto __n = ranges::size(_M_base); - return __detail::min(__n, static_cast(_M_count)); + return std::min(__n, static_cast(_M_count)); } };