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::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::ranges::all_of, std::ranges::any_of, std::ranges::none_of
- std::ranges::for_each
- std::ranges::count, std::ranges::count_if
- std::ranges::mismatch, std::ranges::mismatch_result
- std::ranges::find, std::ranges::find_if, std::ranges::find_if_not
- std::ranges::adjacent_find
- 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::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++ åèæå >ç®æ³åº >æå¶çº¦ç®æ³ (C++20 èµ·) > std::ranges::mismatch, std::ranges::mismatch_result
std::ranges::mismatch, std::ranges::mismatch_result
std::input_iterator I2, std::sentinel_for<I2> S2,
class Pred = ranges::equal_to,
class Proj1 = std::identity, class Proj2 = std::identity >
requires std::indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
constexpr ranges::mismatch_result<I1, I2>
mismatch( I1 first1, S1 last1, I2 first2, S2 last2,
class Pred = ranges::equal_to,
class Proj1 = std::identity, class Proj2 = std::identity >
requires std::indirectly_comparable<
ranges::iterator_t<R1>, ranges::iterator_t<R2>, Pred, Proj1, Proj2>
constexpr ranges::mismatch_result<ranges::borrowed_iterator_t<R1>,
ranges::borrowed_iterator_t<R2>>
using mismatch_result = ranges::in_in_result<I1, I2>;
è¿åé¦ä¸ªæå½±åå
ç´ çä¸å¹é
对ï¼å®ä»¬æ¥èªä¸¤ä¸ªèå´ï¼ä¸ä¸ªä»¥ [first1, last1) æ r1 å®ä¹èå¦ä¸ä¸ªä»¥ [first2,last2) æ r2 å®ä¹ã
p æ¯è¾å
ç´ ãr 为æºèå´ï¼å¦å以 ranges::begin(r) 为 first 并以 ranges::end(r) 为 last ãæ¤é¡µé¢ä¸æè¿°çä»¿å½æ°å®ä½æ¯ niebloid ï¼å³ï¼
- è°ç¨å®ä»¬ä¸çä»»ä½ä¸è æ¶ä¸å¯æå®æ¾å¼æ¨¡æ¿å®åã
- å®ä»¬æ ä¸å¯¹å®åä¾èµæ¥æ¾å¯è§ã
- å¨é常æ é宿¥æ¾å¯»æ¾å½æ°è°ç¨è¿ç®ç¬¦å·¦ä¾§çåç§°æ¾å°å®ä»¬ä¹ä¸æ¶ï¼å®ç¦æ¢å®åä¾èµæ¥æ¾ã
å®é ä¸ï¼å®ä»¬è½ä»¥å½æ°å¯¹è±¡ï¼æä»¥æäºç¹æ®ç¼è¯å¨æ©å±å®ç°ã
åæ°
| first1, last1 | - | 代表第ä¸å¾ æ¯è¾å ç´ èå´çè¿ä»£å¨-å¨ä½å¯¹ |
| r1 | - | 第ä¸å¾ æ¯è¾å ç´ èå´ |
| first2, last2 | - | 代表第äºå¾ æ¯è¾å ç´ èå´çè¿ä»£å¨-å¨ä½å¯¹ |
| r2 | - | 第äºå¾ æ¯è¾å ç´ èå´ |
| pred | - | åºç¨å°æå½±åå ç´ çè°è¯ |
| proj1 | - | åºç¨å°ç¬¬ä¸å ç´ èå´çæå½± |
| proj2 | - | åºç¨å°ç¬¬äºå ç´ èå´çæå½± |
è¿åå¼
æ¥ææåé¦äºä¸ªä¸ç¸çå
ç´ çè¿ä»£å¨ç ranges::mismatch_result ã
è¥æ¯è¾æµè¾¾ last1 æ last2 ï¼æ 论ä½è
å
åçï¼é½æªæ¾å°ä¸å¹é
ï¼åå¯¹è±¡ä¿æå°¾è¿ä»£å¨ä¸æ¥èªå¦ä¸èå´ç对åºè¿ä»£å¨ã
å¤æåº¦
è³å¤åºç¨ min(last1 - first1, last2 - first2) 次è°è¯ä¸å¯¹åºçæå½±ã
å¯è½çå®ç°
struct mismatch_fn { template<std::input_iterator I1, std::sentinel_for<I1> S1, std::input_iterator I2, std::sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = std::identity, class Proj2 = std::identity> requires std::indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr std::mismatch_result<I1, I2> operator()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) const { for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) { if (!std::invoke(pred, std::invoke(proj1, *first1), std::invoke(proj2, *first2))) { break; } } return {first1, first2}; } template<ranges::input_range R1, ranges::input_range R2, class Pred = ranges::equal_to, class Proj1 = std::identity, class Proj2 = std::identity > requires std::indirectly_comparable<ranges::iterator_t<R1>, ranges::iterator_t<R2>, Pred, Proj1, Proj2> constexpr ranges::mismatch_result<ranges::borrowed_iterator_t<R1>, ranges::borrowed_iterator_t<R2>> operator()(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) const { return (*this)(ranges::begin(r1), ranges::end(r1), ranges::begin(r2), ranges::end(r2), std::ref(pred), std::ref(proj1), std::ref(proj2)); } }; inline constexpr mismatch_fn mismatch; |
示ä¾
æ¤ç¨åºç¡®å®åæ¶å¨ç»å®å符串çé¦ç«¯ä¸å¨æ«ç«¯éåºæ¾å°çæé¿å串ï¼å¯è½éå ï¼
#include <algorithm> #include <cstddef> #include <iostream> #include <ranges> #include <string_view> constexpr std::string_view mirror_ends(const std::string_view in) { const auto end = std::ranges::mismatch(in, in | std::views::reverse).in1; const std::size_t length = std::ranges::distance(in.begin(), end); return { in.cbegin(), length }; } int main() { std::cout << mirror_ends("abXYZba") << '\n' << mirror_ends("abca") << '\n' << mirror_ends("ABBA") << '\n' << mirror_ends("level") << '\n'; using namespace std::literals::string_view_literals; static_assert("123"sv == mirror_ends("123!@#321")); static_assert("radar"sv == mirror_ends("radar")); }
è¾åºï¼
ab a ABBA level
