
How to use hash_setS in adjacent_list? If I define BOOST_HAS_HASH the compiler will generate "error C2977: 'stdext::hash_set' : too many template arguments". This is caused by using "BOOST_STD_EXTENSION_NAMESPACE::hash_set<Key,Eq,Hash,Alloc>" in definition of "template <class Key, class Eq, class Hash, class Alloc> struct container_traits< BOOST_STD_EXTENSION_NAMESPACE::hash_set<Key,Eq,Hash,Alloc> > { typedef set_tag category; typedef stable_tag iterator_stability; // is this right? };" Class hash_set is defined in STL as follows: template<class _Kty, class _Tr = hash_compare<_Kty, _STD less<_Kty> >, class _Alloc = _STD allocator<_Kty> > class hash_set : public _Hash<_Hset_traits<_Kty, _Tr, _Alloc, false> > {...}; which has only 3 params. I'm using VS2008 Regards liquid

How to use hash_setS in adjacent_list? If I define BOOST_HAS_HASH the compiler will generate "error C2977: 'stdext::hash_set' : too many template arguments".
Unfortunately, MS and SGI/GCC disagree on the definition of ext/hash_set. The SGI implementation takes 4 parameters, MS appears to take 3. Eventually, I plan to migrated to tr1::unordered_set, so this shouldn't be a problem. Andrew Sutton andrew.n.sutton@gmail.com
participants (2)
-
Andrew Sutton
-
liquid