|
Boost : |
From: joel de guzman (djowel_at_[hidden])
Date: 2002-04-11 22:47:44
----- Original Message -----
From: "Aleksey Gurtovoy" :
> > However, extra effort must be provided by the MPL author(s) to make
> > writing MPL algorithms as user friendly as possible.
>
> That was one of the goals of the library. Most of custom algorithms (and, in
> fact, most of the algorithms MPL offers out-of-box) can be (and are)
> implemented in terms of what we call "the basic iteration algorithm" -
> 'iter_fold_if' (as you've seen it with 'count_if' example). In other words,
> in most cases you don't have to deal with manual sequence iteration at all
> (unless you want to, of course). You just write the core of the algorithm -
> an operation that should be executed on every step through the sequence, and
> then pass that operation to [iter_]fold[_if] to do the rest of the job for
> you.
This is nice :) It's not as user friendly as I wished but the power I
get should compensate for the learning curve. I certainly look
forward to a user friendly "authoring MPL algorithms" documentation.
Kudos, and more power to MPL. Please accept my comments as
constructive criticism. I wish to use MPL in a project soon so I
figured I wanted to badger you now, rather than later :-)
Regards,
--Joel
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk