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

Advanced Unordered Associative Container Usage

While our journey with ordered associative containers has provided us with the prowess of relationship mapping and the power of ordering, it is time to venture into a domain that prioritizes speed over sorted behavior: unordered associative containers. As their name suggests, these containers do not guarantee any specific order of their elements, but they make up for it with potentially faster access times.

In the world of computing, there are always trade-offs. Unordered associative containers might relinquish the beauty of order, but in many scenarios, they make up for it with speed, especially when hashing operates at its best. Whether you’re developing a high-frequency trading system, a caching mechanism, or a real-time multiplayer game backend, understanding when to harness the power of unordered associated containers can make a difference.

This chapter provides references for the following containers:

  • std::unordered_set...