// 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) // // Copyright 2019 Glen Joseph Fernandes (glenjofe@gmail.com) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ALGORITHM_MAX_ELEMENT_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_MAX_ELEMENT_HPP_INCLUDED #include #include #include #include #include #include namespace boost { namespace range { namespace detail { template inline Iterator max_element(Iterator first, Iterator last, Predicate comp) { if (first == last) { return last; } Iterator result = first; while (++first != last) { if (comp(*result, *first)) { result = first; } } return result; } } // namespace detail /// \brief template function max_element /// /// range-based version of the max_element std algorithm /// /// \pre ForwardRange is a model of the ForwardRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template inline BOOST_DEDUCED_TYPENAME range_iterator::type max_element(ForwardRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return detail::max_element(boost::begin(rng), boost::end(rng), detail::less()); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_iterator::type max_element(const ForwardRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return detail::max_element(boost::begin(rng), boost::end(rng), detail::less()); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_iterator::type max_element(ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return detail::max_element(boost::begin(rng), boost::end(rng), pred); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_iterator::type max_element(const ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return detail::max_element(boost::begin(rng), boost::end(rng), pred); } // range_return overloads /// \overload template inline BOOST_DEDUCED_TYPENAME range_return::type max_element(ForwardRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return range_return::pack( detail::max_element(boost::begin(rng), boost::end(rng), detail::less()), rng); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_return::type max_element(const ForwardRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return range_return::pack( detail::max_element(boost::begin(rng), boost::end(rng), detail::less()), rng); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_return::type max_element(ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return range_return::pack( detail::max_element(boost::begin(rng), boost::end(rng), pred), rng); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_return::type max_element(const ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return range_return::pack( detail::max_element(boost::begin(rng), boost::end(rng), pred), rng); } } // namespace range using range::max_element; } // namespace boost #endif // include guard