Data Structures and Algorithms with the C++ STL
By :
Data Structures and Algorithms with the C++ STL
By:
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)
Preface
Chapter 1: The Basics of std::vector
Chapter 2: Mastering Iterators with std::vector
Chapter 3: Mastering Memory and Allocators with std::vector
Chapter 4: Mastering Algorithms with std::vector
Chapter 5: Making a Case for std::vector
Part 2: Understanding STL Data Structures
Chapter 6: Advanced Sequence Container Usage
Chapter 7: Advanced Ordered Associative Container Usage
Chapter 8: Advanced Unordered Associative Container Usage
Chapter 9: Advanced Container Adaptor Usage
Chapter 10: Advanced Container View Usage
Part 3: Mastering STL Algorithms
Chapter 11: Fundamental Algorithms and Searching
Chapter 12: Manipulation and Transformation
Chapter 13: Numeric and Range -Based Operations
Chapter 14: Permutations, Partitions, and Heaps
Chapter 15: STL with Ranges
Part 4: Creating STL-Compatible Types and Algorithms
Chapter 16: Creating STL-Types Containers
Chapter 17: Creating STL -Compatible Algorithms
Chapter 18: Type Traits and Policies
Part 5: STL Data Structures and Algorithms: Under the Hood
Chapter 19: Exception Safety
Chapter 20: Thread Safety and Concurrency with the STL
Chapter 21: STL Interaction with Concepts and Coroutines
Chapter 22: Parallel Algorithms with the STL
Index
Customer Reviews