// put this in "your library" instead of the macro (modified very slightly // from the SGI docs):#include <algorithm>template <typename T>struct counter {  typedef T result_type;  result_type n;  public:  counter(result_type start = result_type()) : n(start) {}  result_type operator()() { return n++; }};// Now you can do this, without any of the usual problems with macros:std::generate(placementlist.begin(), placementlist.end(), counter<bool*>(mine));// Notice that I actually store pointers to positions of the mine array,// rather than integers. This helps with the second step...// (Also notice that for example if the map were stored in a std::list - a// horrible idea, but you can imagine a similar task where a std::list is the// appropriate storage and we have to randomly distribute values within it -// then we could generate() a vector of list::iterators with no problem, since// list::iterators support that post-increment.)

// put this in "your library":template <typename Iterator, typename Value>class assign_at : public unary_function<void, Iterator> {  Value v;  public:  assign_at(const Value& v) : v(v) {}  void operator()(Iterator iterator) { *iterator = v; }};// Now you can use std::for_each to replace this particular kind of for-loop:std::for_each(placementlist.begin(), placementlist.end(), assign_at(true));