A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/ranges/../algorithm/ranges/max_element.html below:

std::ranges::max_element - cppreference.com

Call signature

(1) (since C++20) (2) (since C++20)

1) Finds the greatest element in the range [firstlast).

The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is:

[edit] Parameters first, last - the iterator-sentinel pair defining the range of elements to examine r - the range to examine comp - comparison to apply to the projected elements proj - projection to apply to the elements [edit] Return value

Iterator to the greatest element in the range [firstlast). If several elements in the range are equivalent to the greatest element, returns the iterator to the first such element. Returns the iterator that compares equal to last if the range is empty (i.e. if first == last).

[edit] Complexity

Exactly max(N - 1, 0) comparisons, where N = ranges::distance(first, last).

[edit] Possible implementation
struct max_element_fn
{
    template<std::forward_iterator I, std::sentinel_for<I> S, class Proj = std::identity,
             std::indirect_strict_weak_order<std::projected<I, Proj>> Comp = ranges::less>
    constexpr I operator()(I first, S last, Comp comp = {}, Proj proj = {}) const
    {
        if (first == last)
            return last;
 
        auto largest = first;
        while (++first != last)
            if (std::invoke(comp, std::invoke(proj, *largest), std::invoke(proj, *first)))
                largest = first;
        return largest;
    }
 
    template<ranges::forward_range R, class Proj = std::identity,
             std::indirect_strict_weak_order<
                 std::projected<ranges::iterator_t<R>, Proj>> Comp = ranges::less>
    constexpr ranges::borrowed_iterator_t<R>
        operator()(R&& r, Comp comp = {}, Proj proj = {}) const
    {
        return (*this)(ranges::begin(r), ranges::end(r), std::ref(comp), std::ref(proj));
    }
};
 
inline constexpr max_element_fn max_element;
[edit] Example
#include <algorithm>
#include <cmath>
#include <iostream>
 
int main()
{
    namespace ranges = std::ranges;
 
    const auto v = {3, 1, -14, 1, 5, 9, -14, 9};
 
    auto result = ranges::max_element(v.begin(), v.end());
    std::cout << "Max element at pos " << ranges::distance(v.begin(), result) << '\n';
 
    auto abs_compare = [](int a, int b) { return std::abs(a) < std::abs(b); };
    result = ranges::max_element(v, abs_compare);
    std::cout << "Absolute max element at pos "
              << ranges::distance(v.begin(), result) << '\n';
}

Output:

Max element at pos 5
Absolute max element at pos 2
[edit] See also

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4