“STL Algorithms in Action "
summary
Demonstrates use of the C++ Standard Library algorithms (STL algorithms) by showing common and unexpected ways to apply them in real code; covers seeing algorithms used in their typical contexts and then repurposing them to perform surprising tricks. Uses concrete C++ STL algorithm facilities throughout to illustrate how pervasive and powerful they can be for writing cleaner, more maintainable code.
AI-written summary · about
chapters (23)
- 0:00Intro
- 1:12What are algorithms?
- 1:43What are STL algorithms?
- 3:19What is a raw loop anyway?
- 5:44Classes of STL algorithms
- 12:16accumulate
- 12:43for each example Generate a single hash for all strings in a vector
- 14:25transform example Generate hash for each string in a vector
- 16:52all of example
- 19:41another for each example
- 22:24adjacent_find
- 22:42adjacent find example
- 25:20remove if (with erase) Scott Meyers, "Effective STL,"items 9 and 32
- 28:47sort and stable sort
- 33:03partial sort example visual
- 34:42Know your sorta-sorts, cont.
- 35:34partition example
- 36:35partition copy example
- 37:01Mixing up partitions!
- 44:03partial_sort vs. nth_element + sort
- 49:01rotate
- 57:12gather gather multiple elements around a point Sean Parent, C++ Seasoning
- 59:37Coming soon to a compiler near you! Parallel algorithms
related talks
01h 00mSTL Algorithms - why you should use them, and how to write your own
54m105 STL Algorithms in Less Than an Hour
32mC++ Standard Library "Little Things”
01h 02mWriting Standard Library Compliant Data Structures and Algorithms
07mAlgorithm Mnemonics: Increase your Productivity with STL Algorithms
54m"std::accumulate: Exploring an Algorithmic Empire"
01h 40mDesign Patterns: Examples in C++
59mC++ Code Smells