C++ STL algorithm - std::mismatch | Modern Cpp Series Ep. 144

Показать описание

►Lesson Description: In this lesson we discuss the mismatch algorithm which reports back the first pair of mismatches. When comparing two sequences, if they are not the same size, then their is some undefined behavior, so we'll right a little helper function to deal with that. This is a nice example of how the algorithm building blocks can help us write safer code and code that is more resilient.

►Please like and subscribe to help the channel!

Mike Shah

Рекомендации по теме

Комментарии

If two vectors match, aren't .fist and .second both == .end() of the corresponding vectors? If it is so, line 15 is problematic (deref of .end())! It prints zeros for matching vectors -- that is suspicious. What would you function do if it were given two empty vectors?
Thank you.

rudalert

Thanks professor for the video, well I will try to use this mismatch function in user defined data structure, I guess I have to use custom comparator

monty

At the 8:30 mark in the video, on line 10 due to an "out of range vector invalidation", this code will work in Visual Studio 2022 as: auto result1 = std::mismatch(v1.begin(), v2.end() - 1, v2.begin());

MrTNVolsFan

Also on line 19. Notice the -1 added at the end of v1.end(). Hope this helps with out-of-range invalidation iterators errors in vector data structures!

MrTNVolsFan

9:11 is UB; you're dereferencing the end iterator.

masheroz

C++ STL algorithm - std::mismatch | Modern Cpp Series Ep. 144

C++ STL algorithm - std::mismatch | Modern Cpp Series Ep. 144

c++ stl algorithms part 2 | mismatch, set operations, marge, swap, binary_search

C++ STL algorithm - comparison with std::equal | Modern Cpp Series Ep. 145

Modern C++ : STL Algorithms with examples - E3

C++ STL Algorithms: Overview and Non-Mutating Algorithms (Part 1)

C++ STL Non-Mutating Algorithms (Part 2)

C++ STL algorithm - std::copy | Modern Cpp Series Ep. 149

C++ STD Gems [find/search/reverse iterators]

STL stacks example (bracket matching)

CppCon 2017: Dietmar Kühl “C++17 Parallel Algorithms”

Arrays are Evil, std::array Container is better, STL copy function, & osteam_iterators

C++ STL Algorithms Cheat Sheet (and Pairs, Lambda Expressions, and Iterators)

How Is set_difference Implemented In C++?

C++ STL algorithm - search (find, find_if, search, adjacent_find) | Modern Cpp Series Ep. 143

C++ STL Non-Mutating Algorithms (Part 4)

C++ STL Mutating Algorithms (Part 2)

C++ STL Non-Mutating Algorithms (Part 1)

[MUC++] Ben Deane - 'The Construction and Use of C++ Algorithms' (Virtual)

Set Operations - Algorithms from the C++ standard library

Generics in C++ 10 - Templates Class default parameters | Modern Cpp Series Ep. 81

C/C++ Validate cin inputs for range and type mismatch - loop until input is good

Richard Kaiser - C++17 Polymorphic Memory Resources and STL Containers for Embedded Applications

CppCon 2014: Stephan Lavavej 'STL Features And Implementation Techniques'

STL std::string_view and when to use it versus std::string | Modern Cpp Series Ep. 113