Book Image

Data Structures and Algorithms with the C++ STL

By : John Farrier
5 (2)
Book Image

Data Structures and Algorithms with the C++ STL

5 (2)
By: John Farrier

Overview of this book

While the Standard Template Library (STL) offers a rich set of tools for data structures and algorithms, navigating its intricacies can be daunting for intermediate C++ developers without expert guidance. This book offers a thorough exploration of the STL’s components, covering fundamental data structures, advanced algorithms, and concurrency features. Starting with an in-depth analysis of the std::vector, this book highlights its pivotal role in the STL, progressing toward building your proficiency in utilizing vectors, managing memory, and leveraging iterators. The book then advances to STL’s data structures, including sequence containers, associative containers, and unordered containers, simplifying the concepts of container adaptors and views to enhance your knowledge of modern STL programming. Shifting the focus to STL algorithms, you’ll get to grips with sorting, searching, and transformations and develop the skills to implement and modify algorithms with best practices. Advanced sections cover extending the STL with custom types and algorithms, as well as concurrency features, exception safety, and parallel algorithms. By the end of this book, you’ll have transformed into a proficient STL practitioner ready to tackle real-world challenges and build efficient and scalable C++ applications.
Table of Contents (30 chapters)
Free Chapter
1
Part 1: Mastering std::vector
7
Part 2: Understanding STL Data Structures
13
Part 3: Mastering STL Algorithms
19
Part 4: Creating STL-Compatible Types and Algorithms
23
Part 5: STL Data Structures and Algorithms: Under the Hood

Coroutines

The integration of coroutines into C++20 ushers in a new paradigm for asynchronous programming that’s more readable and intuitive. By allowing functions to be suspended and resumed, coroutines offer an alternative to the callback-heavy style often seen in asynchronous C++ code. While transformative in its own right, this evolution also provides fresh, innovative ways to interact with the venerable STL. Examining the interaction of coroutines with STL algorithms and data structures reveals how they simplify asynchronous operations.

Understanding coroutines – a refresher

A coroutine is a generalization of a function. While a traditional function runs to completion and then returns, a coroutine can be paused at specific points, returning control to the caller and then later resuming from where it left off. Three primary keywords are vital to understanding coroutines in C++: co_await, co_return, and co_yield:

  • co_await: Suspends the current coroutine...