C++ åèæå
- C++11
- C++14
- C++17
- C++20
- C++ ç¼è¯å¨æ¯ææ åµè¡¨
- ç¬ç«ä¸å®¿ä¸»å®ç°
- C++ è¯è¨
- C++ å ³é®è¯
- é¢å¤çå¨
- C++ æ ååºå¤´æä»¶
- å ·åè¦æ±
- åè½ç¹æ§æµè¯ (C++20)
- å·¥å ·åº
- ç±»åæ¯æï¼åºæ¬ç±»åãRTTIãç±»åç¹æ§ï¼
- æ¦å¿µåº (C++20)
- é误å¤ç
- 卿å å管ç
- æ¥æåæ¶é´å·¥å ·
- å符串åº
- 容å¨åº
- è¿ä»£å¨åº
- èå´åº (C++20)
- ç®æ³åº
- std::execution::sequenced_policy, std::execution::parallel_policy, std::execution::parallel_unsequenced_policy, std::execution::unsequenced_policy
- æå¶çº¦ç®æ³ (C++20 èµ·)
- std::is_execution_policy
- std::execution::seq, std::execution::par, std::execution::par_unseq, std::execution::unseq
- std::all_of, std::any_of, std::none_of
- std::for_each_n
- std::sort
- std::reduce
- std::inclusive_scan
- std::exclusive_scan
- std::random_shuffle, std::shuffle
- std::clamp
- std::equal
- std::is_permutation
- std::mismatch
- std::swap
- std::search
- std::transform
- std::for_each
- std::make_heap
- std::count, std::count_if
- std::adjacent_find
- std::find, std::find_if, std::find_if_not
- std::find_end
- std::find_first_of
- std::search_n
- std::lexicographical_compare
- std::lexicographical_compare_three_way
- std::copy, std::copy_if
- std::copy_n
- std::copy_backward
- std::move
- std::move_backward
- std::shift_left, std::shift_right
- std::fill
- std::fill_n
- std::generate
- std::generate_n
- std::iter_swap
- std::swap_ranges
- std::sample
- std::remove, std::remove_if
- std::replace, std::replace_if
- std::reverse
- std::rotate
- std::unique
- std::remove_copy, std::remove_copy_if
- std::replace_copy, std::replace_copy_if
- std::reverse_copy
- std::rotate_copy
- std::unique_copy
- std::is_partitioned
- std::partition_point
- std::partition
- std::partition_copy
- std::stable_partition
- std::is_sorted
- std::is_sorted_until
- std::stable_sort
- std::partial_sort
- std::partial_sort_copy
- std::nth_element
- std::lower_bound
- std::upper_bound
- std::binary_search
- std::equal_range
- std::merge
- std::inplace_merge
- std::set_difference
- std::set_intersection
- std::set_symmetric_difference
- std::set_union
- std::includes
- std::is_heap
- std::is_heap_until
- std::sort_heap
- std::push_heap
- std::pop_heap
- std::max
- std::max_element
- std::min
- std::min_element
- std::minmax
- std::minmax_element
- std::next_permutation
- std::prev_permutation
- std::iota
- std::inner_product
- std::adjacent_difference
- std::accumulate
- std::transform_reduce
- std::partial_sum
- std::transform_inclusive_scan
- std::transform_exclusive_scan
- std::qsort
- std::bsearch
- 注é
- æ°å¼åº
- è¾å ¥/è¾åºåº
- æä»¶ç³»ç»åº
- æ¬å°ååº
- æ£å表达å¼åº
- ååæä½åº
- çº¿ç¨æ¯æåº
- å®éªæ§ C++ ç¹æ§
- æç¨çèµæº
- ç´¢å¼
- std 符å·ç´¢å¼
- åç¨æ¯æ (C++20)
- C++ å ³é®è¯
ä½ç½®ï¼é¦é¡µ > C++ åèæå >ç®æ³åº > std::max
std::max
| å®ä¹äºå¤´æä»¶ <algorithm>
|
||
| (1) | ||
| template< class T > const T& max( const T& a, const T& b ); |
(C++14 å) | |
| template< class T > constexpr const T& max( const T& a, const T& b ); |
(C++14 èµ·) | |
| (2) | ||
| template< class T, class Compare > const T& max( const T& a, const T& b, Compare comp ); |
(C++14 å) | |
| template< class T, class Compare > constexpr const T& max( const T& a, const T& b, Compare comp ); |
(C++14 èµ·) | |
| (3) | ||
| template< class T > T max( std::initializer_list<T> ilist ); |
(C++11 èµ·) (C++14 å) |
|
| template< class T > constexpr T max( std::initializer_list<T> ilist ); |
(C++14 èµ·) | |
| (4) | ||
| template< class T, class Compare > T max( std::initializer_list<T> ilist, Compare comp ); |
(C++11 èµ·) (C++14 å) |
|
| template< class T, class Compare > constexpr T max( std::initializer_list<T> ilist, Compare comp ); |
(C++14 èµ·) | |
è¿åç»å®å¼ä¸çè¾å¤§è ã
a ä¸ b çè¾å¤§è
ãilist ä¸å¼çæå¤§è
ã(1,3) çæ¬ç¨ operator< æ¯è¾å
ç´ ï¼ (2,4) çæ¬ç¨ç»å®çæ¯è¾å½æ° comp ã
åæ°
| a, b | - | è¦æ¯è¾çå¼ |
| ilist | - | æ¥æè¦æ¯è¾çå¼ç initializer_list |
| cmp | - | æ¯è¾å½æ°å¯¹è±¡ï¼å³æ»¡è¶³æ¯è¾ (Compare) è¦æ±ç对象ï¼ï¼è¥è¥ a å°äº b ï¼åè¿å âtrue ãæ¯è¾å½æ°çç¾ååºçä»·äºå¦ä¸ï¼  bool cmp(const Type1 &a, const Type2 &b); è½ç¶ç¾åä¸å¿
æ const & ï¼å½æ°ä¹ä¸è½ä¿®æ¹ä¼ éç»å®ç对象ï¼èä¸å¿
é¡»æ¥åï¼å¯ä¸º const çï¼ç±»å |
| ç±»åè¦æ± | ||
- 为使ç¨éè½½ (1,3) ï¼ T å¿
须满足å¯å°äºæ¯è¾ (LessThanComparable) çè¦æ±ã
| ||
- 为使ç¨éè½½ (3,4) ï¼ T å¿
须满足å¯å¤å¶æé (CopyConstructible) çè¦æ±ã
| ||
è¿åå¼
a ä¸ b çè¾å¤§è
ãè¥å®ä»¬çä»·ï¼åè¿å a ãilist ä¸çæå¤§å¼ãè¥ææ°ä¸ªçä»·äºæå¤§è
çå¼ï¼åè¿åæå·¦ä¾§çè¿ç§å¼ãå¤æåº¦
ilist.size() - 1 次æ¯è¾å¯è½çå®ç°
| çæ¬ä¸ |
|---|
template<class T> const T& max(const T& a, const T& b) { return (a < b) ? b : a; } |
| çæ¬äº |
template<class T, class Compare> const T& max(const T& a, const T& b, Compare comp) { return (comp(a, b)) ? b : a; } |
| çæ¬ä¸ |
template< class T > T max( std::initializer_list<T> ilist) { return *std::max_element(ilist.begin(), ilist.end()); } |
| çæ¬å |
template< class T, class Compare > T max( std::initializer_list<T> ilist, Compare comp ) { return *std::max_element(ilist.begin(), ilist.end(), comp); } |
注æ
è¥åæ°ä¹ä¸æ¯å³å¼ï¼ä¸è¿åè¯¥åæ°ï¼å以å¼ç¨æè· std::max çç»æä¼äº§çä¸ä¸ªæ¬åå¼ç¨ï¼
int n = 1; const int& r = std::max(n-1, n+1); // r 为æ¬å
示ä¾
#include <algorithm> #include <iostream> #include <string> Â int main() { std::cout << "larger of 1 and 9999: " << std::max(1, 9999) << '\n' << "larger of 'a', and 'b': " << std::max('a', 'b') << '\n' << "longest of \"foo\", \"bar\", and \"hello\": " << std::max( { "foo", "bar", "hello" }, [](const std::string& s1, const std::string& s2) { return s1.size() < s2.size(); }) << '\n'; }
è¾åºï¼
larger of 1 and 9999: 9999 larger of 'a', and 'b': b longest of "foo", "bar", and "hello": hello
åé
| è¿ååç»å®å¼ä¸çè¾å°è
(彿°æ¨¡æ¿) | |
| (C++11) |
è¿å两个å
ç´ çè¾å°åè¾å¤§è
(彿°æ¨¡æ¿) |
| è¿åèå´å
çæå¤§å
ç´ (彿°æ¨¡æ¿) | |
| (C++17) |
å¨ä¸å¯¹è¾¹çå¼é´å¤¹é¼ä¸ä¸ªå¼ (彿°æ¨¡æ¿) |