Using iterator adapters to fill generic data structures
In a lot of situations, we want to fill any container with masses of data, but the data source and the container have no common interface. In such a situation, we would need to write our own hand-crafted algorithms that just deal with the question of how to shove data from the source to the sink. Usually, this distracts us from our actual work of solving a specific problem.
Tasks where we simply transport data between conceptually different data structures can be implemented with a one-liner code, thanks to another abstraction provided by the STL: iterator adapters. This section demonstrates the use of some of them in order to give a feeling how useful they are.
How to do it...
In this section, we use some iterator wrappers just for the sake of showing that they exist and how they can help us in everyday programming tasks.
- We need to include some headers first:
#include <iostream>
#include <string>
#include...
