Satyam Shekhar skrev:
Another thought about this project - the paper by Matthew Austern about segmented iterators mentions 'segmentedness' of an iterator as orthogonal to it's traversal or reference category. Now one way to approach the task of creating segmented iterators for Devector is to use the Boost.Iterator library's iterator_facade/iterator_adaptor. But would it be worthwhile to modify Boost.Iterator itself and define new concepts using segmentedness as another orthogonal category, and then modify iterator_facade to support it? One of the factors influencing this would obviously be whether segmented iterators are going to be used widely in the future for other containers. (hash tables etc)
Well, one of the major obstacles with segmented iterators is that no standard algorithms support them. I guess it would be yet another GSOC project to implement this for boost.range ex etc. -Thorsten