id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
3972,Broken support for unordered sets and multisets in adjacency_list graphs,Thomas Claveirole <thomas@…>,Jeremiah Willcock,"Hello,

The support for adjacency_list graphs using unordered sets and
multisets is currently broken.  I will attach a patch that solves this issues in this report.

Basically, several compounds are missing and there is a bug in
edge_range().  Here is a detailed description of the issue:

* Container traits

container_traits, container_category, and iterator_stability
specializations and overrides are missing for unordered_multiset
and unordered_multimap, in pending/container_traits.hpp.


* parallel_edge_traits

parallel_edge_traits specializations are missing for
hash_multisetS and hash_multimapS, in graph/adjacency_list.hpp.

* edge_range

edge_range() uses std::equal_range() on the node's out edge list.
std::equal_range() expects its input to be ordered in ascending
order.  This precondition fails when using an unordered set or
multiset for storing the edges.

As a solution, the proposed patch uses std::equal_range() by
default, except on associative containers, for which it uses the
container's equal_range() method (the equal_range() method is
a requirement of associative containers).

Regards,
Thomas Claveirole",Bugs,closed,Boost 1.43.0,graph,Boost Development Trunk,Problem,fixed,graph adjacency_list unordered unordered_set unordered_multiset,i@…