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

std::unordered_multiset

This container is a flexible counterpart to std::unordered_set, allowing multiple occurrences of an element. It amalgamates the speed of hashing with the liberty of non-unique elements.

Purpose and suitability

std::unordered_multiset is a hash table-based container that allows you to store multiple equivalent items in an unordered manner. Its primary attractions are as follows:

  • Quick average-case insertion and lookup times
  • The ability to store multiple items with the same value

It’s particularly suitable in the following scenarios:

  • When the order of elements doesn’t matter
  • When you anticipate having multiple elements with the same value
  • When you want average-case constant time complexity for insertions and lookups

When searching for a container where duplicates are permissible and order isn’t crucial, std::unordered_multiset is a compelling choice.

Ideal use cases

The following are some...