CHAPTER 8
The STL Algorithms
The STL provides a set of algorithms that can be used along with the containers that it also supplies. These algorithms all work with iterators. An iterator is an abstraction mechanism that allows traversal behavior on many different STL collections. This chapter covers iterators and some of different algorithms along with their uses.
Recipe 8-1. Using an iterator to Define a Sequence within a Container
Problem
You have a STL container and would like to mark a sequence within that container that begins and ends at certain points.
Solution
The STL provides iterators that work with all containers and can be used to denote ...
Get C++ Recipes: A Problem-Solution Approach now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
