Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/ranges/max element"

From cppreference.com
< cpp‎ | algorithm‎ | ranges
m (Return value: fix, per [http://eel.is/c++draft/algorithms#alg.min.max-29].)
m (Return value: fmt)
 
Line 33: Line 33:
  
 
===Return value===
 
===Return value===
Iterator to the greatest element in the range {{range|first|last}}. If several elements in the range are equivalent to the greatest element, returns the iterator to the first such element. Returns {{c|last}} if the range is empty (i.e. if {{c|first}} == {{c|last}}).
+
Iterator to the greatest element in the range {{range|first|last}}. If several elements in the range are equivalent to the greatest element, returns the iterator to the first such element. Returns {{c|last}} if the range is empty (i.e. if {{c|1=first == last}}).
  
 
===Complexity===
 
===Complexity===

Latest revision as of 14:35, 1 February 2024

 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
(C++11)                (C++11)(C++11)

Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
 
Constrained algorithms
All names in this menu belong to namespace std::ranges
Non-modifying sequence operations
Modifying sequence operations
Partitioning operations
Sorting operations
Binary search operations (on sorted ranges)
       
       
Set operations (on sorted ranges)
Heap operations
Minimum/maximum operations
max_element
       
       
Permutation operations
Fold operations
Numeric operations
(C++23)            
Operations on uninitialized storage
Return types
 
Defined in header <algorithm>
Call signature
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

    max_element( I first, S last, Comp comp = {}, Proj proj = {} );
(1) (since C++20)
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>

    max_element( R&& r, Comp comp = {}, Proj proj = {} );
(2) (since C++20)
1) Finds the greatest element in the range [firstlast).
2) Same as (1), but uses r as the source range, as if using ranges::begin(r) as first and ranges::end(r) as last.

The function-like entities described on this page are niebloids, that is:

In practice, they may be implemented as function objects, or with special compiler extensions.

Contents

[edit] Parameters

first, last - iterator-sentinel pair denoting the range 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 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

returns the smallest element in a range
(niebloid)[edit]
returns the smallest and the largest elements in a range
(niebloid)[edit]
returns the greater of the given values
(niebloid)[edit]
returns the largest element in a range
(function template) [edit]