← Back
Editing: find_end.hpp
// Copyright Neil Groves 2009. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ALGORITHM_FIND_END_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_FIND_END_HPP_INCLUDED #include <boost/concept_check.hpp> #include <boost/range/begin.hpp> #include <boost/range/end.hpp> #include <boost/range/concepts.hpp> #include <boost/range/detail/range_return.hpp> #include <algorithm> namespace boost { namespace range { /// \brief template function find_end /// /// range-based version of the find_end std algorithm /// /// \pre ForwardRange1 is a model of the ForwardRangeConcept /// \pre ForwardRange2 is a model of the ForwardRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template< class ForwardRange1, class ForwardRange2 > inline BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 >::type >::type find_end(ForwardRange1 & rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return std::find_end(boost::begin(rng1),boost::end(rng1), boost::begin(rng2),boost::end(rng2)); } /// \overload template< class ForwardRange1, class ForwardRange2 > inline BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type find_end(const ForwardRange1 & rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return std::find_end(boost::begin(rng1),boost::end(rng1), boost::begin(rng2),boost::end(rng2)); } /// \overload template< class ForwardRange1, class ForwardRange2, class BinaryPredicate > inline BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange1>::type >::type find_end(ForwardRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return std::find_end(boost::begin(rng1),boost::end(rng1), boost::begin(rng2),boost::end(rng2),pred); } /// \overload template< class ForwardRange1, class ForwardRange2, class BinaryPredicate > inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return std::find_end(boost::begin(rng1),boost::end(rng1), boost::begin(rng2),boost::end(rng2),pred); } /// \overload template< range_return_value re, class ForwardRange1, class ForwardRange2 > inline BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type >::type find_end(ForwardRange1& rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return range_return<ForwardRange1,re>:: pack(std::find_end(boost::begin(rng1), boost::end(rng1), boost::begin(rng2), boost::end(rng2)), rng1); } /// \overload template< range_return_value re, class ForwardRange1, class ForwardRange2 > inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type find_end(const ForwardRange1& rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return range_return<const ForwardRange1,re>:: pack(std::find_end(boost::begin(rng1), boost::end(rng1), boost::begin(rng2), boost::end(rng2)), rng1); } /// \overload template< range_return_value re, class ForwardRange1, class ForwardRange2, class BinaryPredicate > inline BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type >::type find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return range_return<ForwardRange1,re>:: pack(std::find_end(boost::begin(rng1), boost::end(rng1), boost::begin(rng2), boost::end(rng2), pred), rng1); } /// \overload template< range_return_value re, class ForwardRange1, class ForwardRange2, class BinaryPredicate > inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> )); BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> )); return range_return<const ForwardRange1,re>:: pack(std::find_end(boost::begin(rng1), boost::end(rng1), boost::begin(rng2), boost::end(rng2), pred), rng1); } } // namespace range using range::find_end; } // namespace boost #endif // include guard
Save File
Cancel