Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

The Dark Corner of STL in C++: MinMax Algorithms - Lecture

CppCon via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricacies of min-max algorithms in C++ STL through this CppCon 2022 conference talk. Delve into the potential issues when using seemingly simple algorithms like std::min. Examine reference semantics, lifetime issues, const correctness, const_cast usage, and the costs associated with std::initializer_list. Learn about language features that impact these algorithms and discover approaches for addressing ergonomic challenges when implementing functions with similar semantics. Gain insights from speaker Šimon Tóth's 20 years of software engineering experience in this 27-minute presentation aimed at enhancing your understanding of C++ STL's darker corners.

Syllabus

The Dark Corner of STL in Cpp: MinMax Algorithms - Šimon Tóth - CppCon 2022

Taught by

CppCon

Reviews

Start your review of The Dark Corner of STL in C++: MinMax Algorithms - Lecture

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.