Movatterモバイル変換

[0]ホーム
URL:

cppreference.com
Namespaces
Variants
    Actions

      std::minmax_element

      From cppreference.com
      <cpp‎ |algorithm
       
       
      Algorithm library
      Constrained algorithms and algorithms on ranges(C++20)
      Constrained algorithms, e.g.ranges::copy,ranges::sort, ...
      Execution policies(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)
      minmax_element
      (C++11)

      Lexicographical comparison operations
      Permutation operations
      C library
      Numeric operations
      Operations on uninitialized memory
       
      Defined in header<algorithm>
      template<class ForwardIt>

      std::pair<ForwardIt, ForwardIt>

          minmax_element( ForwardIt first, ForwardIt last);
      		 (1)(since C++11)
      (constexpr since C++17)
      template<class ExecutionPolicy,class ForwardIt>

      std::pair<ForwardIt, ForwardIt>
          minmax_element( ExecutionPolicy&& policy,

                          ForwardIt first, ForwardIt last);
      		 (2)(since C++17)
      template<class ForwardIt,class Compare>

      std::pair<ForwardIt, ForwardIt>

          minmax_element( ForwardIt first, ForwardIt last, Compare comp);
      		 (3)(since C++11)
      (constexpr since C++17)
      template<class ExecutionPolicy,class ForwardIt,class Compare>

      std::pair<ForwardIt, ForwardIt>
          minmax_element( ExecutionPolicy&& policy,

                          ForwardIt first, ForwardIt last, Compare comp);
      		 (4)(since C++17)

      Finds the smallest and greatest element in the range[first, last).

      1) Elements are compared usingoperator<(until C++20)std::less{}(since C++20).
      3) Elements are compared using the comparison functioncomp.
      2,4) Same as(1,3), but executed according topolicy.
      These overloads participate in overload resolution only if all following conditions are satisfied:

      std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> istrue.

      		(until C++20)

      std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> istrue.

      		(since C++20)

      Contents

      [edit]Parameters

      first, last - the pair of iterators defining therange of elements to examine
      policy - theexecution policy to use
      cmp - comparison function object (i.e. an object that satisfies the requirements ofCompare) which returnstrue if the first argument isless than the second.

      The signature of the comparison function should be equivalent to the following:

      bool cmp(const Type1& a,const Type2& b);

      While the signature does not need to haveconst&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const)Type1 andType2 regardless ofvalue category (thus,Type1& is not allowed, nor isType1 unless forType1 a move is equivalent to a copy(since C++11)).
      The typesType1 andType2 must be such that an object of typeForwardIt can be dereferenced and then implicitly converted to both of them.

      Type requirements
      -
      ForwardIt must meet the requirements ofLegacyForwardIterator.

      [edit]Return value

      a pair consisting of an iterator to the smallest element as the first element and an iterator to the greatest element as the second. Returnsstd::make_pair(first, first) if the range is empty. If several elements are equivalent to the smallest element, the iterator to the first such element is returned. If several elements are equivalent to the largest element, the iterator to the last such element is returned.

      [edit]Complexity

      Given\(\scriptsize N\)N asstd::distance(first, last):

      1,2) At most\(\scriptsize \max(\left\lfloor \frac{3}{2}(N-1) \right\rfloor, 0)\)max(⌊
      3
      2
      (N-1)⌋,0)       comparisons usingoperator<(until C++20)std::less{}(since C++20).
      3,4) At most\(\scriptsize \max(\left\lfloor \frac{3}{2}(N-1) \right\rfloor, 0)\)max(⌊
      3
      2
      (N-1)⌋,0)       applications of the comparison functioncomp.

      [edit]Exceptions

      The overloads with a template parameter namedExecutionPolicy report errors as follows:

      • If execution of a function invoked as part of the algorithm throws an exception andExecutionPolicy is one of thestandard policies,std::terminate is called. For any otherExecutionPolicy, the behavior is implementation-defined.
      • If the algorithm fails to allocate memory,std::bad_alloc is thrown.

      [edit]Possible implementation

      minmax_element
      template<class ForwardIt>std::pair<ForwardIt, ForwardIt>    minmax_element(ForwardIt first, ForwardIt last){using value_type=typenamestd::iterator_traits<ForwardIt>::value_type;return std::minmax_element(first, last,std::less<value_type>());}
      minmax_element
      template<class ForwardIt,class Compare>std::pair<ForwardIt, ForwardIt>    minmax_element(ForwardIt first, ForwardIt last, Compare comp){auto min= first, max= first; if(first== last||++first== last)return{min, max}; if(comp(*first,*min))        min= first;else        max= first; while(++first!= last){auto i= first;if(++first== last){if(comp(*i,*min))                min= i;elseif(!(comp(*i,*max)))                max= i;break;}else{if(comp(*first,*i)){if(comp(*first,*min))                    min= first;if(!(comp(*i,*max)))                    max= i;}else{if(comp(*i,*min))                    min= i;if(!(comp(*first,*max)))                    max= first;}}}return{min, max};}

      [edit]Notes

      This algorithm is different fromstd::make_pair(std::min_element(),std::max_element()), not only in efficiency, but also in that this algorithm finds thelast biggest element whilestd::max_element finds thefirst biggest element.

      [edit]Example

      Run this code
      #include <algorithm>#include <iostream> int main(){constauto v={3,9,1,4,2,5,9};constauto[min, max]= std::minmax_element(begin(v), end(v)); std::cout<<"min = "<<*min<<", max = "<<*max<<'\n';}

      Output:

      min = 1, max = 9

      [edit]See also

      returns the smallest element in a range
      (function template)[edit]
      returns the largest element in a range
      (function template)[edit]
      returns the smallest and the largest elements in a range
      (algorithm function object)[edit]
      Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/algorithm/minmax_element&oldid=180327"
      [8]ページ先頭
      ©2009-2025 Movatter.jp