Boost logo

Boost :

From: Thorsten Ottosen (nesotto_at_[hidden])
Date: 2003-05-11 12:23:32


"David Abrahams" <dave_at_[hidden]> wrote in message
news:ullxei3hh.fsf_at_boost-consulting.com...
> Alisdair Meredith <alisdair.meredith_at_[hidden]> writes:
>
> > This is clear when we look at algorithms that take a range for input and
> > an output iterator, eg transform. Where I see a range and an iterator,
> > your library tries to see two containers. I'm not entirely convinced
> > this is the way to go.
>
> >From working with the MPL, which does almost everything in terms of
> sequences, I can say it is occasionally inconvenient to come up with
> two sequences for an algorithm like the 2-sequence form of
> transform. If you just have an iterator into the 2nd sequence, it
> may be hard to come up with another one to mark the end. That's
> especially true in the runtime world, where single-pass iterators are
> possible (think istream_iterator).

I guess you wouldn't have to come up with another iterrator, you could just
use a dummy one since
the end is not used.

-Thorsten


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk