Re: [boost] [graph][1.33.1] STLport 5 compile problems.

From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-10-14 10:41:57

On Oct 14, 2005, at 9:57 AM, Rene Rivera wrote:

> Rene Rivera wrote:
>> Ping? Anyone?
>
> I guess no one maintains Boost.Graph, how sad :-(

*grumble, grumble*

> Anyway this change makes graph and python pass all tests with
> MinGW+STLport5:
>
> Index: adjacency_list.hpp
> ===================================================================
> RCS file: /cvsroot/boost/boost/boost/graph/detail/adjacency_list.hpp,v
> retrieving revision 1.136
> diff -u -r1.136 adjacency_list.hpp
> --- adjacency_list.hpp	12 Jul 2005 03:10:28 -0000	1.136
> +++ adjacency_list.hpp	13 Oct 2005 05:53:55 -0000
> @@ -13,6 +13,7 @@
>
>   #include <map> // for vertex_map in copy_impl
>   #include <boost/config.hpp>
> +#include <boost/detail/workaround.hpp>
>   #include <boost/operators.hpp>
>   #include <boost/property_map.hpp>
>   #include <boost/pending/integer_range.hpp>
> @@ -2669,12 +2670,16 @@
>   #if !defined(BOOST_NO_HASH) &&
> !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
>   namespace BOOST_STD_EXTENSION_NAMESPACE {
>
> +  #if BOOST_WORKAROUND( _STLPORT_VERSION, >= 0x500 )
> +  // STLport 5 already defines a hash<void*> specialization.
> +  #else
>     template <>
>     struct hash< void* > // Need this when vertex_descriptor=void*
>     {
>       std::size_t
>       operator()(void* v) const { return (std::size_t)v; }
>     };
> +  #endif
>
>     template <typename V>
>     struct hash< boost::detail::stored_edge<V> >
> ===================================================================
>
> Doug, OK to commit?

Yep, looks good. Thanks!

        Doug