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::find, std::find_if, std::find_if_not
std::find, std::find_if, std::find_if_not
InputIt find_if( InputIt first, InputIt last,
constexpr InputIt find_if( InputIt first, InputIt last,
ForwardIt find_if( ExecutionPolicy&& policy, ForwardIt first, ForwardIt last,
InputIt find_if_not( InputIt first, InputIt last,
(C++20 å)
constexpr InputIt find_if_not( InputIt first, InputIt last,
ForwardIt find_if_not( ExecutionPolicy&& policy, ForwardIt first, ForwardIt last,
è¿åèå´ [first, last) 䏿»¡è¶³ç¹å®å¤å«æ åçé¦ä¸ªå
ç´ ï¼
find æç´¢çäº value çå
ç´ ãfind_if æç´¢è°è¯ p 对å
¶è¿å true çå
ç´ ãfind_if_not æç´¢è°è¯ q 对å
¶è¿å false çå
ç´ ãpolicy æ§è¡ãè¿äºéè½½ä»
è¥ std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> 为 true æåä¸éè½½å³è®®ãåæ°
| first, last | - | è¦æ£éªçå ç´ èå´ |
| value | - | è¦ä¸å ç´ æ¯è¾çå¼ |
| policy | - | æç¨çæ§è¡çç¥ãç»èè§æ§è¡çç¥ã |
| p | - | è¥ä¸ºè¦æ±çå
ç´ åè¿å âtrue çä¸å
è°è¯ã 对æ¯ä¸ªï¼å¯ä¸º const çï¼ |
| q | - | è¥ä¸ºè¦æ±çå
ç´ åè¿å âfalse çä¸å
è°è¯ã 对æ¯ä¸ªï¼å¯ä¸º const çï¼ |
| ç±»åè¦æ± | ||
-InputIt å¿
须满足éçè¾å
¥è¿ä»£å¨ (LegacyInputIterator) çè¦æ±ã
| ||
-ForwardIt å¿
须满足éçååè¿ä»£å¨ (LegacyForwardIterator) çè¦æ±ã
| ||
-UnaryPredicate å¿
须满足è°è¯ (Predicate) çè¦æ±ã
| ||
è¿åå¼
æåé¦ä¸ªæ»¡è¶³æ¡ä»¶çè¿ä»£å¨ï¼æè¥æ¾ä¸å°è¿ç§å
ç´ å为 last ã
å¤æåº¦
è³å¤åºç¨ last - first 次è°è¯ã
å¼å¸¸
æ¥æå为 ExecutionPolicy çæ¨¡æ¿å½¢åçéè½½æä¸åæ¹å¼æ¥åé误ï¼
- è¥ä½ä¸ºç®æ³ä¸é¨åè°ç¨ç彿°çæ§è¡æåºå¼å¸¸ï¼ä¸
ExecutionPolicy为æ åçç¥ä¹ä¸ï¼åè°ç¨ std::terminate ã对äºä»»ä½å ¶ä»ExecutionPolicyï¼è¡ä¸ºæ¯å®ç°å®ä¹çã - è¥ç®æ³æ æ³åé å åï¼åæåº std::bad_alloc ã
å¯è½çå®ç°
| çæ¬ä¸ |
|---|
template<class InputIt, class T> InputIt find(InputIt first, InputIt last, const T& value) { for (; first != last; ++first) { if (*first == value) { return first; } } return last; } |
| çæ¬äº |
template<class InputIt, class UnaryPredicate> InputIt find_if(InputIt first, InputIt last, UnaryPredicate p) { for (; first != last; ++first) { if (p(*first)) { return first; } } return last; } |
| çæ¬ä¸ |
template<class InputIt, class UnaryPredicate> InputIt find_if_not(InputIt first, InputIt last, UnaryPredicate q) { for (; first != last; ++first) { if (!q(*first)) { return first; } } return last; } |
注æ
è¥ä½ 没æ C++11 ï¼å std::find_if_not ççä»·çæ¬æ¯ä»¥ååçè°è¯ä½¿ç¨ std::find_if ã
template<class InputIt, class UnaryPredicate> InputIt find_if_not(InputIt first, InputIt last, UnaryPredicate q) { return std::find_if(first, last, std::not1(q)); } |
示ä¾
ä¸å示ä¾å¨ int ç vector ä¸å¯»æ¾æ´æ°ã
#include <iostream> #include <algorithm> #include <vector> #include <iterator> Â int main() { int n1 = 3; int n2 = 5; Â std::vector<int> v{0, 1, 2, 3, 4}; Â auto result1 = std::find(std::begin(v), std::end(v), n1); auto result2 = std::find(std::begin(v), std::end(v), n2); Â if (result1 != std::end(v)) { std::cout << "v contains: " << n1 << '\n'; } else { std::cout << "v does not contain: " << n1 << '\n'; } Â if (result2 != std::end(v)) { std::cout << "v contains: " << n2 << '\n'; } else { std::cout << "v does not contain: " << n2 << '\n'; } }
è¾åºï¼
v contains: 3 v does not contain: 5
åé
| æ¥æ¾é¦å¯¹ç¸é»çç¸åï¼ææ»¡è¶³ç»å®è°è¯çï¼å
ç´ (彿°æ¨¡æ¿) | |
| å¨ç¹å®èå´ä¸å¯»æ¾æååºç°çå
ç´ åºå (彿°æ¨¡æ¿) | |
| æç´¢å
ç´ éåä¸çä»»æå
ç´ (彿°æ¨¡æ¿) | |
| 寻æ¾ä¸¤ä¸ªèå´åºç°ä¸åçé¦ä¸ªä½ç½® (彿°æ¨¡æ¿) | |
| æç´¢ä¸ä¸ªå
ç´ èå´ (彿°æ¨¡æ¿) |