|
Boost : |
From: joel de guzman (djowel_at_[hidden])
Date: 2002-04-11 22:28:57
----- Original Message -----
From: "joel de guzman" :
> Simply that I cannot write the simplest MPL algorithm, predicate or
> function without using MPL facilities. Consider this:
>
> template <class IteratorT, class FunctionT>
> FunctionT for_each(IteratorT first, IteratorT last, FunctionT func) {
> for ( ; first != last; ++first)
> func(*first);
> return func;
> }
>
> This is a full fledged STL functor based *solely* on STL concepts.
^^^^^^^^^
Ooops. I meant algorithm.
Regards,
--Joel
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk