// Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // Based on Peter Dimov's proposal // http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf // issue 6.18. #if !defined(BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP) #define BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif namespace boost { #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) namespace hash_detail { template struct call_hash_impl { template struct inner { static std::size_t call(T const& v) { using namespace boost; return hash_value(v); } }; }; template <> struct call_hash_impl { template struct inner { #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) static std::size_t call(Array const& v) #else static std::size_t call(Array& v) #endif { const int size = sizeof(v) / sizeof(*v); return boost::hash_range(v, v + size); } }; }; template struct call_hash : public call_hash_impl::value> ::BOOST_NESTED_TEMPLATE inner { }; } #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct hash : std::unary_function { #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) std::size_t operator()(T const& val) const { return hash_value(val); } #else std::size_t operator()(T const& val) const { return hash_detail::call_hash::call(val); } #endif }; #if BOOST_WORKAROUND(__DMC__, <= 0x848) template struct hash : std::unary_function { std::size_t operator()(const T* val) const { return boost::hash_range(val, val+n); } }; #endif #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // On compilers without partial specialization, boost::hash // has already been declared to deal with pointers, so just // need to supply the non-pointer version. namespace hash_detail { template struct hash_impl; #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) template <> struct hash_impl { template struct inner : std::unary_function { #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) std::size_t operator()(T const& val) const { return hash_value(val); } #else std::size_t operator()(T const& val) const { return hash_detail::call_hash::call(val); } #endif }; }; #else // Visual C++ 6.5 // There's probably a more elegant way to Visual C++ 6.5 to work // but I don't know what it is. template struct hash_impl_msvc { template struct inner : public std::unary_function { std::size_t operator()(T const& val) const { return hash_detail::call_hash::call(val); } std::size_t operator()(T& val) const { return hash_detail::call_hash::call(val); } }; }; template <> struct hash_impl_msvc { template struct inner : public std::unary_function { std::size_t operator()(T& val) const { return hash_detail::call_hash::call(val); } }; }; template struct hash_impl_msvc2 : public hash_impl_msvc::value> ::BOOST_NESTED_TEMPLATE inner {}; template <> struct hash_impl { template struct inner : public hash_impl_msvc2 {}; }; #endif // Visual C++ 6.5 } #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } #endif