Re: [boost] Re: MPL containers and algorithms

From: David Abrahams (dave_at_[hidden])
Date: 2002-08-13 14:12:22

----- Original Message -----
From: "Terje Slettebø" <tslettebo_at_[hidden]>

> It depends on how the sort is implemented, I guess (one isn't present in
the
> library, yet). As you know, C++ MP isn't mutating, so such a sort would
> return a sorted copy of the half of the sequence. Likely stored in the
same
> kind of sequence as the original, to preserve the characteristics of the
> original sequence.

No, and I'm pretty sure this is in part why MPL uses sequences instead of
iterators: the algorithms that produce new sequences generally take an
empty version of the new sequence as an input, and "append" their results
to it.

-----------------------------------------------------------
           David Abrahams * Boost Consulting
dave_at_[hidden] * http://www.boost-consulting.com