Book Image

Modern C++ Programming Cookbook - Second Edition

By : Marius Bancila
5 (1)
Book Image

Modern C++ Programming Cookbook - Second Edition

5 (1)
By: Marius Bancila

Overview of this book

C++ has come a long way to be one of the most widely used general-purpose languages that is fast, efficient, and high-performance at its core. The updated second edition of Modern C++ Programming Cookbook addresses the latest features of C++20, such as modules, concepts, coroutines, and the many additions to the standard library, including ranges and text formatting. The book is organized in the form of practical recipes covering a wide range of problems faced by modern developers. The book also delves into the details of all the core concepts in modern C++ programming, such as functions and classes, iterators and algorithms, streams and the file system, threading and concurrency, smart pointers and move semantics, and many others. It goes into the performance aspects of programming in depth, teaching developers how to write fast and lean code with the help of best practices. Furthermore, the book explores useful patterns and delves into the implementation of many idioms, including pimpl, named parameter, and attorney-client, teaching techniques such as avoiding repetition with the factory pattern. There is also a chapter dedicated to unit testing, where you are introduced to three of the most widely used libraries for C++: Boost.Test, Google Test, and Catch2. By the end of the book, you will be able to effectively leverage the features and techniques of C++11/14/17/20 programming to enhance the performance, scalability, and efficiency of your applications.
Table of Contents (16 chapters)
Other Books You May Enjoy

Standard Library Containers, Algorithms, and Iterators

The C++ standard library has evolved a lot with C++11, C++14, C++17, and now C++20. However, at its core initially sat three main pillars: containers, algorithms, and iterators. They are all implemented as general-purpose classes or function templates. In this chapter, we'll look at how these can be employed together for achieving various goals.

We will cover the following recipes in this chapter:

  • Using vector as a default container
  • Using bitset for fixed-size sequences of bits
  • Using vector<bool> for variable-size sequences of bits
  • Using the bit manipulation utilities
  • Finding elements in a range
  • Sorting a range
  • Initializing a range
  • Using set operations on a range
  • Using iterators to insert new elements into a container
  • Writing your own random-access iterator
  • Container access with non-member functions

We'll begin this chapter by exploring...