Sign In Start Free Trial

Book Overview & Buying
Table Of Contents

C++ STL Cookbook - Second Edition

By : Bill Weinman

C++ STL Cookbook

By: Bill Weinman

Overview of this book

C++ STL Cookbook is a comprehensive guide that provides practical solutions for mastering the latest features of the C++23 Standard Template Library (STL) through hands-on recipes. Beginning with new features in C++23, this book will help you understand the language's updated mechanics and library features, and offer insights into how they work. Unlike other books, this cookbook takes an implementation-specific, problem-solution approach that will help you overcome hurdles quickly. You'll learn core STL concepts, such as containers, algorithms, utility classes, lambda expressions, iterators, and more, through specific real-world recipes. Building on the success of the first edition, this updated guide includes a new chapter dedicated to the latest features introduced in C++23, such as improved modules, refined ranges, and coroutine-based generators. It also covers essential best practices for writing cleaner and more efficient code, including the use of coroutines, structured bindings, and std::span. Whether you're looking to deepen your understanding of the C++ STL or implement the latest features in your projects, this book provides valuable insights, clear and concise explanations and practical solutions to enhance your C++ programming skills.

Preface

About this book

Free benefits with your book

Free Chapter

Chapter 1: Introduction to New C++23 Features

Chapter 1: Introduction to New C++23 Features

Simplify your code with the std module

Format text with the new print() and println() functions

Use synchronous generators

Use mdspan as a multidimensional array

Initialize containers from ranges

Find content in strings and ranges with contains()

Subscribe to Deep Engineering

Chapter 2: Best Practices

Chapter 2: Best Practices

Use braced initialization

Use span to make C-arrays safer

Use structured binding to return multiple values

Initialize variables within if and switch conditionals

Use template argument deduction for simplicity and clarity

Use RAII to preserve memory integrity

Chapter 3: STL Containers

Chapter 3: STL Containers

A quick overview of the STL container types

Use uniform erase functions to delete elements from a container

Delete items from an unsorted vector

Access vector elements safely

Keep vector elements sorted

Efficiently insert elements into a map

Efficiently modify keys in a map

Use unordered_map with custom keys

Sort and filter user input with set

Create a simple RPN calculator with deque

Count word frequency with map

Find long sentences with a vector of vectors

Create an efficient ToDo list using multimap

Subscribe to Deep Engineering

Chapter 4: STL Compatible Iterators

Chapter 4: STL Compatible Iterators

Iterators are fundamental

Create an iterable range

Use traits with your iterators for STL compatibility

Use iterator adaptors to populate STL containers

Iterate backward with a reverse adaptor

Iterate objects of unknown length with a sentinel

Create a generator with iterators

Create a generator with coroutines

Build a zip iterator adaptor

Create a random-access iterator

Chapter 5: Lambda Expressions

Chapter 5: Lambda Expressions

Lambda expressions

Use lambdas for scoped, reusable code

Use lambdas as predicates with algorithms

Create a polymorphic wrapper with std::function

Concatenate lambdas with recursion

Combine predicates with logical conjunction

Pass common parameters to multiple lambdas

Create a simple jump table with mapped lambdas

Subscribe to Deep Engineering

Chapter 6: STL Algorithms

Chapter 6: STL Algorithms

Copy from one iterator to another

Join container elements into a string

Sort containers with std::sort

Modify containers with std::transform

Search containers with std::find

Limit container values with std::clamp

Sample data sets with std::sample

Use ranges for more powerful algorithms

Generate permutations of data sequences

Merge sorted containers

Chapter 7: Strings and Formatting

Chapter 7: Strings and Formatting

Use string_view as a lightweight string object

Format text with the format library

Print strings with std::print and std::println

Concatenate strings

Transform strings

Trim whitespace from strings

Read strings from user input

Count words in a file

Initialize complex structures from file input

Customize a string class with char_traits

Parse strings with regular expressions

Subscribe to Deep Engineering

Chapter 8: Utility Classes

Chapter 8: Utility Classes

Manage optional values with std::optional

Use std::any for type safety

Store different types with std::variant

Time events with std::chrono

Use fold expressions for generic tuples

Manage allocated memory with std::unique_ptr

Share objects with std::shared_ptr

Use weak pointers with shared objects

Share object members with aliased smart pointers

Compare random number engines

Comparison of random number distribution generators

Chapter 9: Concurrency and Parallelism

Chapter 9: Concurrency and Parallelism

Sleep a process for a specific amount of time

Use std::thread for concurrency

Use std::async for concurrency

Run STL algorithms in parallel with execution policies

Use mutex and lock to safely share data

Share flags and values with std::atomic

Initialize threads with std::call_once

Resolve the producer-consumer problem with std::condition_variable

Implement multiple producers and consumers

Suspend and resume execution with coroutines

Use coroutines for a producer-consumer solution

Subscribe to Deep Engineering

Chapter 10: Using the File System

Chapter 10: Using the File System

Specialize std::formatter for the path class

Use manipulation functions with path

List files in a directory

Search directories and files with a grep utility

Rename files with regex and directory_iterator

Create a disk usage counter

Chapter 11: More Practical Ideas

Chapter 11: More Practical Ideas

Create a trie class for search suggestions

Calculate the error sum of two vectors

Build your own algorithm: split

Leverage existing algorithms: gather

Remove consecutive whitespace

Convert numbers to words

Subscribe to Deep Engineering

Chapter 12: C++26 and the Future

Chapter 12: C++26 and the Future

Static reflection

Contracts

Structural pattern matching

Other C++26 improvements

Chapter 13: Unlock Your Exclusive Benefits

Chapter 13: Unlock Your Exclusive Benefits

Unlock this Book's Free Benefits in 3 Easy Steps

Index

Index

Efficiently insert elements into a map

The map class is an associative container that holds key-value pairs, where keys must be unique within the container.

There are a number of ways to populate a map container. Consider a map defined like this:

map<string, string> m;

We can add an element with the [] operator:

m["Miles"] = "Trumpet"

We can use the insert() member function:

m.insert({"Hendrix", "Guitar"});

Here we use template argument deduction to pass a std::pair of values to the m.insert() function.

Or, we can use the emplace() member function:

m.emplace("Krupa", "Drums");

I tend to gravitate toward the emplace() function. Introduced with C++11, emplace() uses perfect forwarding to create the new element in place by forwarding parameters directly to the container's constructor. This is quick, efficient, and easy to code.

Though it's certainly an improvement over...

CONTINUE READING

83

Tech Concepts

36

Programming languages

73

Tech Tools

Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.

Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.

50+ new titles added per month and exclusive early access to books as they are being written.

C++ STL Cookbook

Search

Your notes and bookmarks