Modern C++: Efficient and Scalable Application Development

55. Zip algorithm

This problem is relatively similar to the previous one, although there are two input ranges instead of just one. The result is again a range of std::pair. However, the two input ranges may hold elements of different types. Again, the implementation shown here contains two overloads:

• A general-purpose function with iterators as arguments. A begin and end iterator for each input range define its bounds, and an output iterator defines the position in the output range where the result must be written.
• A function that takes two std::vector arguments, one that holds elements of type T and one that holds elements of type U and returns an std::vector<std::pair<T, U>>. This overload simply calls the previous one:

template <typename ...