Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying C++20 STL Cookbook
  • Table Of Contents Toc
  • Feedback & Rating feedback
C++20 STL Cookbook

C++20 STL Cookbook

By : Bill Weinman
4.5 (10)
Buy this Book
close
close
C++20 STL Cookbook

C++20 STL Cookbook

4.5 (10)
By: Bill Weinman
Buy this Book

Overview of this book

Fast, efficient, and flexible, the C++ programming language has come a long way and is used in every area of the industry to solve many problems. The latest version C++20 will see programmers change the way they code as it brings a whole array of features enabling the quick deployment of applications. This book will get you up and running with using the STL in the best way possible. Beginning with new language features in C++20, this book will help you understand the language's mechanics and library features and offer insights into how they work. Unlike other books, the C++20 STL 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, while working on real-world recipes. This book is a reference guide for using the C++ STL with its latest capabilities and exploring the cutting-edge features in functional programming and lambda expressions. By the end of the book C++20 book, you'll be able to leverage the latest C++ features and save time and effort while solving tasks elegantly using the STL.
Table of Contents (13 chapters)
close
close
close
Preface
Icon
About this book
Icon
Who this book is for
Icon
What this book covers
Icon
Conventions used
Icon
Sections
Icon
Get in touch
Icon
Share Your Thoughts
1
Chaper 1: New C++20 Features
Icon
Chaper 1: New C++20 Features
Icon
Technical requirements
Icon
Format text with the new format library
Icon
Use compile-time vectors and strings with constexpr
Icon
Safely compare integers of different types
Icon
Use the "spaceship" operator <=> for three-way comparisons
Icon
Easily find feature test macros with the header
Icon
Create safer templates with concepts and constraints
Icon
Avoid re-compiling template libraries with modules
Icon
Create views into containers with ranges
Lock Free Chapter
2
Chapter 2: General STL Features
Icon
Chapter 2: General STL Features
Icon
Technical requirements
Icon
Use the new span class to make your C-arrays safer
Icon
Use structured binding to return multiple values
Icon
Initialize variables within if and switch statements
Icon
Use template argument deduction for simplicity and clarity
Icon
Use if constexpr to simplify compile-time decisions
3
Chapter 3: STL Containers
Icon
Chapter 3: STL Containers
Icon
A quick overview of the STL container types
Icon
Technical requirements
Icon
Use uniform erasure functions to delete items from a container
Icon
Delete items from an unsorted vector in constant time
Icon
Access vector elements directly and safely
Icon
Keep vector elements sorted
Icon
Efficiently insert elements into a map
Icon
Efficiently modify the keys of map items
Icon
Use unordered_map with custom keys
Icon
Use set to sort and filter user input
Icon
A simple RPN calculator with deque
Icon
A word frequency counter with map
Icon
Find long sentences with a vector of vectors
Icon
A ToDo list using multimap
4
Chapter 4: Compatible Iterators
Icon
Chapter 4: Compatible Iterators
Icon
Iterators are fundamental
Icon
Technical requirements
Icon
Create an iterable range
Icon
Make your iterators compatible with STL iterator traits
Icon
Use iterator adapters to fill STL containers
Icon
Create a generator as iterators
Icon
Use reverse iterator adapters to iterate backward
Icon
Iterate objects of unknown length with a sentinel
Icon
Build a zip iterator adapter
Icon
Create a random-access iterator
5
Chapter 5: Lambda Expressions
Icon
Chapter 5: Lambda Expressions
Icon
Lambda expressions
Icon
Technical requirements
Icon
Use lambdas for scoped reusable code
Icon
Use lambdas as predicates with the algorithm library
Icon
Use std::function as a polymorphic wrapper
Icon
Concatenate lambdas with recursion
Icon
Combine predicates with logical conjunction
Icon
Call multiple lambdas with the same input
Icon
Use mapped lambdas for a jump table
6
Chapter 6: STL Algorithms
Icon
Chapter 6: STL Algorithms
Icon
Technical requirements
Icon
Copy from one iterator to another
Icon
Join container elements into a string
Icon
Sort containers with std::sort
Icon
Modify containers with std::transform
Icon
Find items in a container
Icon
Limit the values of a container to a range with std::clamp
Icon
Sample data sets with std::sample
Icon
Generate permutations of data sequences
Icon
Merge sorted containers
7
Chapter 7: Strings, Streams, and Formatting
Icon
Chapter 7: Strings, Streams, and Formatting
Icon
String formatting
Icon
Technical requirements
Icon
Use string_view as a lightweight string object
Icon
Concatenate strings
Icon
Transform strings
Icon
Format text with C++20's format library
Icon
Trim whitespace from strings
Icon
Read strings from user input
Icon
Count words in a file
Icon
Initialize complex structures from file input
Icon
Customize a string class with char_traits
Icon
Parse strings with Regular Expressions
8
Chapter 8: Utility Classes
Icon
Chapter 8: Utility Classes
Icon
Technical requirements
Icon
Manage optional values with std::optional
Icon
Use std::any for type safety
Icon
Store different types with std::variant
Icon
Time events with std::chrono
Icon
Use fold expressions for variadic tuples
Icon
Manage allocated memory with std::unique_ptr
Icon
Share objects with std::shared_ptr
Icon
Use weak pointers with shared objects
Icon
Share members of a managed object
Icon
Compare random number engines
Icon
Compare random number distribution generators
9
Chapter 9: Concurrency and Parallelism
Icon
Chapter 9: Concurrency and Parallelism
Icon
Technical requirements
Icon
Sleep for a specific amount of time
Icon
Use std::thread for concurrency
Icon
Use std::async for concurrency
Icon
Run STL algorithms in parallel with execution policies
Icon
Share data safely with mutex and locks
Icon
Share flags and values with std::atomic
Icon
Initialize threads with std::call_once
Icon
Use std::condition_variable to resolve the producer-consumer problem
Icon
Implement multiple producers and consumers
10
Chapter 10: Using the File System
Icon
Chapter 10: Using the File System
Icon
Technical requirements
Icon
Specialize std::formatter for the path class
Icon
Use manipulation functions with path
Icon
List files in a directory
Icon
Search directories and files with a grep utility
Icon
Rename files with regex and directory_iterator
Icon
Create a disk usage counter
11
Chapter 11: A Few More Ideas
chevron up
Icon
Chapter 11: A Few More Ideas
Icon
Technical requirement
Icon
Create a trie class for search suggestions
Icon
Calculate the error sum of two vectors
Icon
Build your own algorithm: split
Icon
Leverage existing algorithms: gather
Icon
Remove consecutive whitespace
Icon
Convert numbers to words
Icon
Why subscribe?
12
Other Books You May Enjoy
Icon
Other Books You May Enjoy
Icon
Packt is searching for authors like you
Icon
Share Your Thoughts

Leverage existing algorithms: gather

gather() is an example of an algorithm that leverages existing algorithms.

The gather() algorithm takes a pair of container iterators and moves the elements that satisfy a predicate toward a pivot position within the sequence, returning a pair of iterators that contains the elements that satisfy the predicate.

For example, we could use a gather algorithm to sort all the even numbers to the mid-point of a vector:

vector<int> vint{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
gather(vint.begin(), vint.end(), mid(vint), is_even);
for(const auto& el : vint) cout << el;

Our output is:

1302468579

Notice that the even numbers are all in the middle of the output.

In this recipe, we will implement a gather algorithm using standard STL algorithms.

How to do it…

Our gather algorithm uses the std::stable_partition() algorithm to move items before the pivot iterator and again to move items past the pivot.

  • We put the...
Visually different images
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
C++20 STL Cookbook
End of Section 11
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options
font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon