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

Index

As this ebook edition doesn't have fixed pagination, the page numbers below are hyperlinked for reference only, based on the printed edition of this book.

A

advanced numeric operations 271-273

best practices 276, 277

algorithms

for counting and finding 240-246

allocator 60

for container performance 67

B

basic exception safety 355, 356

program invariants 356, 357

resource integrity 357

STL, harnessing 357, 358

basic numeric operations 265

adjacent elements, interacting with std::adjacent_difference 268, 269

best practices 276, 277

elements, summing with std::accumulate 267, 268

inner products, with std::inner_product 270, 271

sequences, generating with std::iota 266, 267

bidirectional iterators 30, 31

binary search 77, 274

versus linear search 79, 80

C

comparators 85

effective comparators, crafting 86

comparison 246-250

compatibility

essential requirements 308-312

concepts...