This is not an introductory series on C++. As such, it is expected that viewers already possess a working knowledge of the C++ language.
In part 1, Stephan T. Lavavej introduces STL and then demonstrates many of its core features (iterators, algorithms, and data structures).
The Standard Template Library, or STL, is a C++ library of container classes, algorithms, and iterators. STL provides many fundamental algorithms and data structures. The STL is a general purpose library: its components are heavily parameterized such that almost every component in the STL is a template.
In part 3, Stephan focuses on shared_ptr and unique_ptr. You’ll also learn a bit about exception safety and, of course, get another challenging homework assignment.
In part 4, Stephan explains his solution to writing a solver for the Nurikabe puzzle using the STL (of course…). You’ll be introduced to some new concepts as well as use some of the things you’ve already learned.
In part 5, Stephan digs into the gory details of the member functions employed by his Nurikabe puzzle solver.
In part 6, Stephan guides us into the logical and beautiful world of algorithms.
In part 7, Stephan continues to dig into STL algorithms, specifically insert iterators, sorting and related functions.
In part 8, Stephan guides us on a journey into the dense forest of Regular Expressions.
In part 9, Stephan introduces us to rvalue references, a C++0x language feature, which enables two different things: move semantics and perfect forwarding.
In part 10, the final chapter in this magnificent introductory series covering the STL, Stephan introduces us to meta programming and type traits.