Re: List Container Strawman 1.4

[Hyman Rosen <hyrosen@mail.com>]

Ted Dennison wrote:

> Actually, I was thinking along the lines of an Containers.Lists.Fixed

 > package that works with arrays.

I think this kind of thing is where C++'s iterators and algorithms
approach shows its superiority. Why should a List have any notion
of other data structures to which its elements can be copied?

In the STL, creating or copying one structure from another can be
done just using the std::copy algorithm, a pair of iterators giving
the source range, and a target iterator which receives the copies.
If you want to copy to a fixed-size array, the target iterator can
simply be a pointer to the first element. If you are creating a more
complicated target (such as another list, or a vector), then it is
the iterator that holds the semantics of where the data goes, for
example std::inserter or std::back_inserter.