>But paths do have such an ordering. It's a lexicographic compare on >the conceptual underlying vector they contain. In other words > > x.m_name < y.m_name > >Unfortunately, that vector isn't available to clients of path so you >have to use x.string() < y.string(), which is only a poor substitute >for the actual vector.
The hope is that the ability to iterate over the elements of the implied vector would serve as well as an actual vector. Thus the begin() and end() members. The assumption was that in the rare cases where an actual std::vector was needed, it would be easy enough to copy from begin(),end().
Off the top of my head, I'd think path::iterator would be sufficient for std::lexicographic_compare(), or is that not what you had in mind?
--Beman
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
