id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
7035,"pair<iterator, iterator>, tie, and Boost.Range co-operate poorly",philipp.moeller@…,Jeremiah Willcock,"Boost.Graph returns ''std::pair<iterator, iterator>'' for all
ranges. This works nicely with the common:

{{{#!cpp
  iterator begin, end;
  for(tie(begin, end) = vertices(graph); begin != end; ++begin) {}
}}}

or Boost.Range algorithms.

When adapting new graphs it is often more convenient to return an
''iterator_range'' and work with it, but this doesn't support the
''tie' idiom anymore and breaks a lot of code in Boost.Graph.

Unifying this would be a nice-to-have feature.

I see two options for this: Either at support for ''tie'' to Range or
transition Graph towards Range algorithms. The first seems much easier
to do, but is also a less clean solution because it somewhat muddies
Range conceptually.

On the other hand it is not clear to me how much Range is going to
change with standardization and what version, if any, will end up in
the next standard.
",Feature Requests,closed,To Be Determined,graph,Boost 1.49.0,Problem,wontfix,,