From: Joel de Guzman (joel_at_[hidden])
Date: 2006-09-26 21:26:57
Joel de Guzman wrote:
> David Abrahams wrote:
>> Joel de Guzman <joel_at_[hidden]> writes:
>>> Ok, as promised. Support for classic boost::tuple has been added.
>>> Now yer ole boost tuples are full fusion citizens. Now boost::tuple
>>> can do for_each, transform, fold, find, assign/convert to other
>>> fusion sequences, etc.
>>> Now there are 3 adapted sequences:
>>> 1) std::pair
>> This one is going to cause me issues. I'm writing a unified library
>> to operate on static and dynamic sequences. Here's the
>> issue: is
>> a dynamic sequence that goes from the first pointer to the 2nd (as in
>> Boost.Range), or a static sequence with 2 elements (a la Fusion)?
> Both? I think, in as much as boost::array<int> is a dynamic
> sequence that STL algorithms can operate on, and at the same
> time, is also a static sequence fusion algorithms can handle,
> the same should be true for mono-sequences like pair<int*,int*>.
Oh and BTW, such a unified library is a *cool* idea! It will
finally complete the landscape from fully static (MPL) to
fully dynamic (STL).
-- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net