Главная
Study mode:
on
1
Introduction
2
Whats an algorithm
3
Ranges
4
Why STL
5
For Each
6
The World
7
Sorting
8
Partitioning
9
Permutations
10
Random Shuffle
11
Runes
12
Queries
13
Query Properties
14
Research
15
Sets
16
Moving
17
Value Modifier
18
Abstract Changes
19
Transform
20
Memory
Description:
Explore the comprehensive world of STL algorithms in this 54-minute conference talk from ACCU 2018. Dive into a detailed overview of all 105 STL algorithms, including those introduced in C++11 and C++17. Gain insights into how these algorithms are grouped, the patterns they form within the STL, and their interrelationships. Learn to leverage this knowledge to create more expressive and robust code. Cover topics such as ranges, sorting, partitioning, permutations, random shuffling, querying, sets, value modification, and memory manipulation. Discover how understanding the big picture of STL algorithms can enhance your C++ programming toolkit and improve your code design.

STL Algorithms in Less Than an Hour

ACCU Conference
Add to list
0:00 / 0:00