From: Aleksey Gurtovoy (alexy_at_[hidden])
Date: 2001-11-26 13:47:41
David Abrahams wrote:
> Except, please remember that repeated push_backs on a type_list can be
> horribly inefficient (at compile-time).
I remember, Dave :).
> It would be good to have an
> algorithm framework based on this:
> template <class Sequence, class FwdFunction, class
> BackwardFunction, class
> Initial> two_way_accumulate...
> Think of it as mpl::accumulate which calls FwdFunction on the
> way in to the recursion and BackwardFunction on the way out.
> Then we could implement transform in terms of push_front.
It makes a perfect sense for me. I guess it just needs to be done, finally
:). Of course, there are some issues of how this integrates with the already
existing stuff.. I'll try to do it, analyze the results, and report them
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk