You're reading from Data Structures and Algorithms with the C++ STL A guide for modern C++ practitioners

Product type Paperback

Published in Feb 2024

Publisher Packt

ISBN-13 9781835468555

Length 458 pages

Edition 1st Edition

Languages

C++

Tools

STL

Concepts

Data Structures and Algorithms

Author (1):

John Farrier

View More author details

Table of Contents (30) Chapters

Preface

1. Part 1: Mastering std::vector FREE CHAPTER

2. Chapter 1: The Basics of std::vector

3. Chapter 2: Mastering Iterators with std::vector

4. Chapter 3: Mastering Memory and Allocators with std::vector

5. Chapter 4: Mastering Algorithms with std::vector

6. Chapter 5: Making a Case for std::vector

7. Part 2: Understanding STL Data Structures

8. Chapter 6: Advanced Sequence Container Usage

9. Chapter 7: Advanced Ordered Associative Container Usage

10. Chapter 8: Advanced Unordered Associative Container Usage

11. Chapter 9: Advanced Container Adaptor Usage

12. Chapter 10: Advanced Container View Usage

13. Part 3: Mastering STL Algorithms

14. Chapter 11: Fundamental Algorithms and Searching

15. Chapter 12: Manipulation and Transformation

16. Chapter 13: Numeric and Range -Based Operations

17. Chapter 14: Permutations, Partitions, and Heaps

18. Chapter 15: STL with Ranges

19. Part 4: Creating STL-Compatible Types and Algorithms

20. Chapter 16: Creating STL-Types Containers

21. Chapter 17: Creating STL -Compatible Algorithms

22. Chapter 18: Type Traits and Policies

23. Part 5: STL Data Structures and Algorithms: Under the Hood

24. Chapter 19: Exception Safety

25. Chapter 20: Thread Safety and Concurrency with the STL

26. Chapter 21: STL Interaction with Concepts and Coroutines

27. Chapter 22: Parallel Algorithms with the STL

28. Index

Why subscribe?

29. Other Books You May Enjoy

STL with Ranges

This chapter discusses the transformative adoption of ranges in C++, marking a paradigm shift from traditional iterators. As an integral facet of modern C++, ranges champion expressive and ergonomic code. Through this chapter, you will grasp the mechanics of utilizing ranges with standard algorithms, achieving cleaner code that’s simultaneously intuitive and powerful. By mastering ranges, C++ developers can harness a more compositional and streamlined approach to algorithm application, setting the stage for more maintainable and efficient code bases.

This chapter will cover the following topics:

Introduction to ranges
Ranges for sorting algorithms
Ranges for searching algorithms
Best practices

The rest of the chapter is locked

You're reading from Data Structures and Algorithms with the C++ STL A guide for modern C++ practitioners

Table of Contents (30) Chapters

STL with Ranges

Authors (1)

Personalised recommendations for you

You're reading from Data Structures and Algorithms with the C++ STL A guide for modern C++ practitioners

Table of Contents (30) Chapters

STL with Ranges

Unlock this book and the full library FREE for 7 days

Authors (1)

Personalised recommendations for you