The C++ Standard Library: Fourth Edition includes C++23

With the current C++23 standard, C++ has many libraries to offer. My book's key idea is to give you concise the necessary information for all C++ standard libraries. "The C++ Standard Library" provides a detailed overview of the C++ Standard Library, including C++23. The Goal The C++ Standard Library aims to provide you with a concise reference of the C++ standard library in about 350 pages. This book assumes that you are familiar with C++. If so, you will get the most benefit from this book. If C++ is new to you, you should start with a textbook about core C++. Once you have mastered a textbook about the core language, you can make your next big step by reading my book. C++23 improved the big four of C++20: extended ranges functionality, the coroutine generator std::generator, and a modularized C++ standard library. The Standard Template Library (STL) consists of three components from a bird’s-eye view. Those are containers, algorithms that run on the containers, and iterators that connect both of them. The containers have only minimal requirements for their elements. This abstraction of generic programming enables you to combine algorithms and containers uniquely. The C++ Standard Library has a rich collection of containers. We have sequence and associative containers. Associative containers can be classified as ordered or unordered associative containers This book also has more than 100 running code examples for the code snippets I present. Therefore, you can combine theory with practice and get the most out of it. Table of Contents Reader Testimonials English Edition German Edition Introduction Purpose of this Book Index Conventions Source Examples Source Code Value versus Object Acknowledgments Further Information Cippi About Me The Standard Library The History Overview Use of Libraries Utilities Useful Functions Adaptors for Functions Pairs Tuples Reference Wrappers Smart Pointers Type Traits Time Library std::any, std::optional, and std::variant std::expected Interface of All Containers Create and delete Size Access Assign and Swap Compare Erasure Sequence Containers Arrays Vectors Deques Lists Forward Lists Associative Containers Overview Ordered Associative Containers Unordered Associative Containers Container Adaptors Linear Containers Associative Containers Views Contiguous Access Multidimensional Access Iterators Categories Iterator Creation Useful Functions Adaptors Callable Units Functions Function Objects Lambda Functions Algorithms Conventions Iterators are the Glue Sequential, Parallel, or Parallel Execution with Vectorisation for_each Non-Modifying Algorithms Modifying Algorithms Partition Sort Binary Search Merge Operations Heaps Min and Max Permutations Numeric Unitialized Memory Ranges Range View Range Adaptors Direct on the Containers Function Composition Lazy Evaluation std Algorithms versus std::ranges Algorithms Numeric Random Numbers Numeric Functions Inherited from C Mathematical Constants Strings Create and Delete Conversion Between C++ and C Strings Size versus Capacity Comparison String Concatenation Element Access Input and Output Search Check for a substring Modifying Operations Numeric Conversions String Views Create and Initialise Non-modifying operations Modifying operations Regular Expressions Character Types Regular Expression Objects The Search Result match_results Match Search Replace Format Repeated Search Input and Output Streams Hierarchy Input and Output Functions Streams User-defined Data Types Formatting Library Formatting Functions Syntax Format specification User-defined formatter Filesystem Classes Non-member functions File types Multithreading Memory Model Atomic Data Types Threads Stop Token Shared Variables Thread Local Data Condition Variables Semaphores Coordination Types Tasks Coroutines Awaitables An Infinite Data Stream with co_yield Index