Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/min"

From cppreference.com
< cpp‎ | algorithm
m (Text replace - "===Equivalent function===" to "===Possible implementation===")
(Wording update.)
 
(34 intermediate revisions by 15 users not shown)
Line 1: Line 1:
 
{{cpp/title|min}}
 
{{cpp/title|min}}
−
{{cpp/algorithm/sidebar}}
+
{{cpp/algorithm/navbar}}
−
{{ddcl list begin}}
+
{{dcl begin}}
−
{{ddcl list header | algorithm}}
+
{{dcl header|algorithm}}
−
{{ddcl list item | num=1 |
+
{{dcla|num=1|notes={{mark constexpr since c++14}}|
−
template< class T >  
+
template< class T >
 
const T& min( const T& a, const T& b );
 
const T& min( const T& a, const T& b );
 
}}
 
}}
−
{{ddcl list item | num=2 |
+
{{dcla|num=2|notes={{mark constexpr since c++14}}|
 
template< class T, class Compare >
 
template< class T, class Compare >
 
const T& min( const T& a, const T& b, Compare comp );
 
const T& min( const T& a, const T& b, Compare comp );
 
}}
 
}}
−
{{ddcl list item | num=3 | notes={{mark since c++11}} |
+
{{dcla|num=3|notes={{mark constexpr since c++14}}|since=c++11|
 
template< class T >
 
template< class T >
−
T min( std::initializer_list<T> ilist);
+
T min( std::initializer_list<T> ilist );
 
}}
 
}}
−
{{ddcl list item | num=4 | notes={{mark since c++11}} |
+
{{dcla|num=4|notes={{mark constexpr since c++14}}|since=c++11|
 
template< class T, class Compare >
 
template< class T, class Compare >
 
T min( std::initializer_list<T> ilist, Compare comp );
 
T min( std::initializer_list<T> ilist, Compare comp );
 
}}
 
}}
−
{{ddcl list end}}
+
{{dcl end}}
  
−
1-2) Returns the smaller of the two values.  
+
Returns the smaller of the given values.
  
−
3-4) Returns the smallest of the values in initializer list {{tt|ilist}}.
+
@1,2@ Returns the smaller of {{c|a}} and {{c|b}}.
 +
:@1@ Uses {{c/core|operator<}} to compare the values.
 +
:@@ If {{tt|T}} is not {{named req|LessThanComparable}}, the behavior is undefined.
 +
:@2@ Use the comparison function {{c|comp}} to compare the values.
  
−
The (1,3) versions use {{cpp|operator<}} to compare the values, the (2,4) versions use the given comparison function {{tt|comp}}.
+
@3,4@ Returns the smallest of the values in initializer list {{c|ilist}}.
 +
@@ If {{c|ilist.size()}} is zero, or {{tt|T}} is not {{named req|CopyConstructible}}, the behavior is undefined.
 +
:@3@ Uses {{c/core|operator<}} to compare the values.
 +
:@@ If {{tt|T}} is not {{named req|LessThanComparable}}, the behavior is undefined.
 +
:@4@ Use the comparison function {{c|comp}} to compare the values.
  
 
===Parameters===
 
===Parameters===
−
{{param list begin}}
+
{{par begin}}
−
{{param list item | a, b | the values to compare}}
+
{{par|a, b|the values to compare}}
−
{{param list item | ilist | initializer list with the values to compare}}
+
{{par|ilist|initializer list with the values to compare}}
−
{{param list cmp | cmp | t1=T | if {{tt|a}} is ''less'' than {{tt|b}}}}  
+
{{par cmp|cmp|t1=T|{{c|a}} is ''less'' than {{c|b}}}}
−
{{param list end}}
+
{{par end}}
  
 
===Return value===
 
===Return value===
−
1-2) The smaller of {{tt|a}} and {{tt|b}}. If the values are equivalent, returns {{tt|a}}.
+
@1,2@ The smaller of {{c|a}} and {{c|b}}. If the values are equivalent, returns {{c|a}}.
  
−
3-4) The smallest value in {{tt|ilist}}. If several values are equivalent to the smallest, returns the leftmost such value.
+
@3,4@ The smallest value in {{c|ilist}}. If several values are equivalent to the smallest, returns the leftmost such value.
  
 
===Complexity===
 
===Complexity===
−
1-2) Constant
+
@1@ Exactly one comparison using {{c/core|operator<}}.
  
−
3-4) Linear in {{tt|ilist.size()}}
+
@2@ Exactly one application of the comparison function {{c|comp}}.
 +
 
 +
@3,4@ Given {{mathjax-or|\(\scriptsize N\)|N}} as {{c|ilist.size()}}:
 +
:@3@ Exactly {{mathjax-or|\(\scriptsize N-1\)|N-1}} comparisons using {{c/core|operator<}}.
 +
:@4@ Exactly {{mathjax-or|\(\scriptsize N-1\)|N-1}} applications of the comparison function {{c|comp}}.
  
 
===Possible implementation===
 
===Possible implementation===
−
{{eq fun cpp
+
{{eq impl
−
| 1=
+
|title1=min (1)|ver1=1|1=
−
template<class T>  
+
template<class T>
−
const T& max(const T& a, const T& b)
+
const T& min(const T& a, const T& b)
 
{
 
{
−
     return (a < b) ? a : b;
+
     return (b < a) ? b : a;
 
}
 
}
−
| 2=
+
|title2=min (2)|ver2=2|2=
−
template<class T, class Compare>  
+
template<class T, class Compare>
−
const T& max(const T& a, const T& b, Compare comp)
+
const T& min(const T& a, const T& b, Compare comp)
 
{
 
{
−
     return (comp(a, b)) ? a : b;
+
     return (comp(b, a)) ? b : a;
 
}
 
}
−
| 3=
+
|title3=min (3)|ver3=3|3=
 
template<class T>
 
template<class T>
−
T min( std::initializer_list<T> ilist)
+
T min(std::initializer_list<T> ilist)
 
{
 
{
 
     return *std::min_element(ilist.begin(), ilist.end());
 
     return *std::min_element(ilist.begin(), ilist.end());
 
}
 
}
−
| 4=
+
|title4=min (4)|ver4=4|4=
 
template<class T, class Compare>
 
template<class T, class Compare>
 
T min(std::initializer_list<T> ilist, Compare comp)
 
T min(std::initializer_list<T> ilist, Compare comp)
Line 71: Line 82:
 
}
 
}
 
}}
 
}}
 +
 +
===Notes===
 +
{{cpp/algorithm/minmax danger note|min}}
  
 
===Example===
 
===Example===
−
{{example cpp
+
{{example
−
|
+
|code=
−
| code=
+
 
#include <algorithm>
 
#include <algorithm>
 
#include <iostream>
 
#include <iostream>
−
+
#include <string_view>
 +
 
 
int main()
 
int main()
 
{
 
{
−
     std::cout << "smaller of 1 and 9999: " << std::min(1, 9999) << '\n';
+
     std::cout << "smaller of 10 and 010 is " << std::min(10, 010) << '\n'
−
    std::cout << "smaller of 'a' and 'b': " << std::min('a', 'b') << '\n';
+
              << "smaller of 'd' and 'b' is '" << std::min('d', 'b') << "'\n"
−
    std::cout << "smaller of 3.5 and 2.5: " << std::min(3.5, 2.5) << '\n';
+
              << "shortest of \"foo\", \"bar\", and \"hello\" is \""
 +
              << std::min({"foo", "bar", "hello"},
 +
                          [](const std::string_view s1, const std::string_view s2)
 +
                          {
 +
                              return s1.size() < s2.size();
 +
                          }) << "\"\n";
 
}
 
}
−
| output=
+
|output=
−
smaller of 1 and 9999: 1
+
smaller of 10 and 010 is 8
−
smaller of 'a' and 'b': a
+
smaller of 'd' and 'b' is 'b'
−
smaller of 3.5 and 2.5: 2.5
+
shortest of "foo", "bar", and "hello" is "foo"
 
}}
 
}}
  
−
{{todo}}
+
===Defect reports===
 +
{{dr list begin}}
 +
{{dr list item|wg=lwg|dr=281|std=C++98|before={{tt|T}} was required to be {{named req|CopyConstructible}} for overloads {{v|1,2}}|after=not required}}
 +
{{dr list end}}
  
 
===See also===
 
===See also===
−
{{dcl list begin}}
+
{{dsc begin}}
−
{{dcl list template | cpp/algorithm/dcl list max}}
+
{{dsc inc|cpp/algorithm/dsc max}}
−
{{dcl list template | cpp/algorithm/dcl list minmax}}
+
{{dsc inc|cpp/algorithm/dsc minmax}}
−
{{dcl list template | cpp/algorithm/dcl list min_element}}
+
{{dsc inc|cpp/algorithm/dsc min_element}}
−
{{dcl list end}}
+
{{dsc inc|cpp/algorithm/dsc clamp}}
 +
{{dsc inc|cpp/algorithm/ranges/dsc min}}
 +
{{dsc end}}
 +
 
 +
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}

Latest revision as of 01:13, 9 April 2024

 
C++
 
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)
(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
min
(C++11)
(C++17)
Lexicographical comparison operations
(C++20)
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
 
Defined in header <algorithm>
template< class T >
const T& min( const T& a, const T& b );
 (1) (constexpr since C++14)
template< class T, class Compare >
const T& min( const T& a, const T& b, Compare comp );
 (2) (constexpr since C++14)
template< class T >
T min( std::initializer_list<T> ilist );
 (3) (since C++11)
(constexpr since C++14)
template< class T, class Compare >
T min( std::initializer_list<T> ilist, Compare comp );
 (4) (since C++11)
(constexpr since C++14)

Returns the smaller of the given values.

1,2) Returns the smaller of a and b.
1) Uses operator< to compare the values.
If T is not LessThanComparable, the behavior is undefined.
2) Use the comparison function comp to compare the values.
3,4) Returns the smallest of the values in initializer list ilist.
If ilist.size() is zero, or T is not CopyConstructible, the behavior is undefined.
3) Uses operator< to compare the values.
If T is not LessThanComparable, the behavior is undefined.
4) Use the comparison function comp to compare the values.

Contents

[edit] Parameters

a, b - the values to compare
ilist - initializer list with the values to compare
cmp - comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if a is less than b.

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 have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)).
The types Type1 and Type2 must be such that an object of type T can be implicitly converted to both of them.

[edit] Return value

1,2) The smaller of a and b. If the values are equivalent, returns a.
3,4) The smallest value in ilist. If several values are equivalent to the smallest, returns the leftmost such value.

[edit] Complexity

1) Exactly one comparison using operator<.
2) Exactly one application of the comparison function comp.
3,4) Given N as ilist.size():
3) Exactly N-1 comparisons using operator<.
4) Exactly N-1 applications of the comparison function comp.

[edit] Possible implementation

min (1) 
template<class T>
const T& min(const T& a, const T& b)
{
    return (b < a) ? b : a;
}
min (2) 
template<class T, class Compare>
const T& min(const T& a, const T& b, Compare comp)
{
    return (comp(b, a)) ? b : a;
}
min (3) 
template<class T>
T min(std::initializer_list<T> ilist)
{
    return *std::min_element(ilist.begin(), ilist.end());
}
min (4) 
template<class T, class Compare>
T min(std::initializer_list<T> ilist, Compare comp)
{
    return *std::min_element(ilist.begin(), ilist.end(), comp);
}

[edit] Notes

Capturing the result of std::min by reference produces a dangling reference if one of the parameters is a temporary and that parameter is returned: 

int n = -1;
const int& r = std::min(n + 2, n * 2); // r is dangling

[edit] Example

Run this code
#include <algorithm>
#include <iostream>
#include <string_view>
 
int main()
{
    std::cout << "smaller of 10 and 010 is " << std::min(10, 010) << '\n'
              << "smaller of 'd' and 'b' is '" << std::min('d', 'b') << "'\n"
              << "shortest of \"foo\", \"bar\", and \"hello\" is \""
              << std::min({"foo", "bar", "hello"},
                          [](const std::string_view s1, const std::string_view s2)
                          {
                              return s1.size() < s2.size();
                          }) << "\"\n";
}

Output: 

smaller of 10 and 010 is 8
smaller of 'd' and 'b' is 'b'
shortest of "foo", "bar", and "hello" is "foo"

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR Applied to Behavior as published Correct behavior
LWG 281 C++98 T was required to be CopyConstructible for overloads (1,2) not required

[edit] See also

 returns the greater of the given values
(function template) [edit]
(C++11)
 returns the smaller and larger of two elements
(function template) [edit]
returns the smallest element in a range
(function template) [edit]
(C++17)
 clamps a value between a pair of boundary values
(function template) [edit]
(C++20)
 returns the smaller of the given values
(niebloid)[edit]
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/algorithm/min&oldid=170732"