This is the algorithm in full:

template <class InputIterator1, class InputIterator2, class BinaryOperation>
BinaryOperation transform_each (InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, BinaryOperation binary_op) {
 while (first1 != last1) {
  binary_op(*first1, *first2);
  ++first1;
  ++first2;
  }
 return binary_op;
 }


Fraser.

---
[ comp.std.c++ is moderated.  To submit articles, try just posting with ]
[ your news-reader.  If that fails, use mailto:std-c++@ncar.ucar.edu    ]
[              --- Please see the FAQ before posting. ---               ]
[ FAQ: http://www.jamesd.demon.co.uk/csc/faq.html                       ]