Re: [Boost-users] [graph][spirit] Boost.Graph and Boost.Spirit incompatible ?

On Thu, 4 Mar 2010, Maxime van Noppen wrote:

On 03/04/2010 07:56 PM, Jeremiah Willcock wrote:

...

How are you ending up with std::string (or an std::list in the second error message) as an index map? What are you trying to call Dijkstra's algorithm on?

The minimal test case is actually only the two includes and nothing else. No code, nothing. Just includes.

----------------- $ cat inc_test.cc #include #include $ /usr/bin/g++ -c inc_test.cc In file included from /usr/include/boost/graph/properties.hpp:19,

...

from /usr/include/boost/graph/named_function_params.hpp:13, from /usr/include/boost/graph/dijkstra_shortest_paths.hpp:20, from inc_test.cc:1: /usr/include/boost/property_map/property_map.hpp: In instantiation of ‘boost::property_traits >’: /usr/include/boost/graph/two_bit_color_map.hpp:47: instantiated from ‘boost::two_bit_color_map >’ /usr/include/boost/spirit/home/qi/char/char.hpp:206: instantiated from here /usr/include/boost/property_map/property_map.hpp:31: error: no type named ‘key_type’ in ‘struct std::basic_string’ /usr/include/boost/property_map/property_map.hpp:34: error: no type named ‘category’ in ‘struct std::basic_string’ /usr/include/boost/property_map/property_map.hpp: In instantiation of ‘boost::property_traitsboost::spirit::info > >’: /usr/include/boost/graph/two_bit_color_map.hpp:47: instantiated from ‘boost::two_bit_color_mapboost::spirit::info > >’ /usr/include/boost/spirit/home/support/detail/what_function.hpp:35: instantiated from here /usr/include/boost/property_map/property_map.hpp:31: error: no type named ‘key_type’ in ‘class std::listboost::spirit::info >’ /usr/include/boost/property_map/property_map.hpp:34: error: no type named ‘category’ in ‘class std::listboost::spirit::info >’

This is the same issue as variant actually -- the boost::get thing. The info object that is causing trouble in char.hpp contains a variant that it's trying to get a field from. It's too bad that a later library (variant) reused a name from an earlier one (graph), but it's probably too late to do anything about either one. -- Jeremiah Willcock