/// \file // Range v3 library // // Copyright Eric Niebler 2014-present // // 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) // // Project home: https://github.com/ericniebler/range-v3 // #ifndef RANGES_V3_ALGORITHM_MIN_ELEMENT_HPP #define RANGES_V3_ALGORITHM_MIN_ELEMENT_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include namespace ranges { /// \addtogroup group-algorithms /// @{ RANGES_FUNC_BEGIN(min_element) /// \brief function template \c min_element template(typename I, typename S, typename C = less, typename P = identity)( requires forward_iterator AND sentinel_for AND indirect_strict_weak_order>) constexpr I RANGES_FUNC(min_element)(I first, S last, C pred = C{}, P proj = P{}) { if(first != last) for(auto tmp = next(first); tmp != last; ++tmp) if(invoke(pred, invoke(proj, *tmp), invoke(proj, *first))) first = tmp; return first; } /// \overload template(typename Rng, typename C = less, typename P = identity)( requires forward_range AND indirect_strict_weak_order, P>>) constexpr borrowed_iterator_t // RANGES_FUNC(min_element)(Rng && rng, C pred = C{}, P proj = P{}) // { return (*this)(begin(rng), end(rng), std::move(pred), std::move(proj)); } RANGES_FUNC_END(min_element) namespace cpp20 { using ranges::min_element; } /// @} } // namespace ranges #include #endif