2 // Copyright 2005-2009 Daniel James.
3 // Distributed under the Boost Software License, Version 1.0. (See accompanying
4 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6 // Based on Peter Dimov's proposal
7 // http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf
10 // This implements the extensions to the standard.
11 // It's undocumented, so you shouldn't use it....
13 #if !defined(BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP)
14 #define BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP
16 #include <boost/functional/hash/hash.hpp>
17 #include <boost/detail/container_fwd.hpp>
18 #include <boost/utility/enable_if.hpp>
19 #include <boost/static_assert.hpp>
20 #include <boost/preprocessor/repetition/repeat_from_to.hpp>
21 #include <boost/preprocessor/repetition/enum_params.hpp>
23 #if !defined(BOOST_NO_CXX11_HDR_ARRAY)
27 #if !defined(BOOST_NO_CXX11_HDR_TUPLE)
31 #if !defined(BOOST_NO_CXX11_HDR_MEMORY)
35 #if defined(_MSC_VER) && (_MSC_VER >= 1020)
39 #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
40 #include <boost/type_traits/is_array.hpp>
43 #if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
44 #include <boost/type_traits/is_const.hpp>
49 template <class A, class B>
50 std::size_t hash_value(std::pair<A, B> const&);
51 template <class T, class A>
52 std::size_t hash_value(std::vector<T, A> const&);
53 template <class T, class A>
54 std::size_t hash_value(std::list<T, A> const& v);
55 template <class T, class A>
56 std::size_t hash_value(std::deque<T, A> const& v);
57 template <class K, class C, class A>
58 std::size_t hash_value(std::set<K, C, A> const& v);
59 template <class K, class C, class A>
60 std::size_t hash_value(std::multiset<K, C, A> const& v);
61 template <class K, class T, class C, class A>
62 std::size_t hash_value(std::map<K, T, C, A> const& v);
63 template <class K, class T, class C, class A>
64 std::size_t hash_value(std::multimap<K, T, C, A> const& v);
67 std::size_t hash_value(std::complex<T> const&);
69 template <class A, class B>
70 std::size_t hash_value(std::pair<A, B> const& v)
73 boost::hash_combine(seed, v.first);
74 boost::hash_combine(seed, v.second);
78 template <class T, class A>
79 std::size_t hash_value(std::vector<T, A> const& v)
81 return boost::hash_range(v.begin(), v.end());
84 template <class T, class A>
85 std::size_t hash_value(std::list<T, A> const& v)
87 return boost::hash_range(v.begin(), v.end());
90 template <class T, class A>
91 std::size_t hash_value(std::deque<T, A> const& v)
93 return boost::hash_range(v.begin(), v.end());
96 template <class K, class C, class A>
97 std::size_t hash_value(std::set<K, C, A> const& v)
99 return boost::hash_range(v.begin(), v.end());
102 template <class K, class C, class A>
103 std::size_t hash_value(std::multiset<K, C, A> const& v)
105 return boost::hash_range(v.begin(), v.end());
108 template <class K, class T, class C, class A>
109 std::size_t hash_value(std::map<K, T, C, A> const& v)
111 return boost::hash_range(v.begin(), v.end());
114 template <class K, class T, class C, class A>
115 std::size_t hash_value(std::multimap<K, T, C, A> const& v)
117 return boost::hash_range(v.begin(), v.end());
121 std::size_t hash_value(std::complex<T> const& v)
123 boost::hash<T> hasher;
124 std::size_t seed = hasher(v.imag());
125 seed ^= hasher(v.real()) + (seed<<6) + (seed>>2);
129 #if !defined(BOOST_NO_CXX11_HDR_ARRAY)
130 template <class T, std::size_t N>
131 std::size_t hash_value(std::array<T, N> const& v)
133 return boost::hash_range(v.begin(), v.end());
137 #if !defined(BOOST_NO_CXX11_HDR_TUPLE)
138 namespace hash_detail {
139 template <std::size_t I, typename T>
140 inline typename boost::enable_if_c<(I == std::tuple_size<T>::value),
142 hash_combine_tuple(std::size_t&, T const&)
146 template <std::size_t I, typename T>
147 inline typename boost::enable_if_c<(I < std::tuple_size<T>::value),
149 hash_combine_tuple(std::size_t& seed, T const& v)
151 boost::hash_combine(seed, std::get<I>(v));
152 boost::hash_detail::hash_combine_tuple<I + 1>(seed, v);
155 template <typename T>
156 inline std::size_t hash_tuple(T const& v)
158 std::size_t seed = 0;
159 boost::hash_detail::hash_combine_tuple<0>(seed, v);
164 #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
165 template <typename... T>
166 inline std::size_t hash_value(std::tuple<T...> const& v)
168 return boost::hash_detail::hash_tuple(v);
172 inline std::size_t hash_value(std::tuple<> const& v)
174 return boost::hash_detail::hash_tuple(v);
177 # define BOOST_HASH_TUPLE_F(z, n, _) \
179 BOOST_PP_ENUM_PARAMS_Z(z, n, typename A) \
181 inline std::size_t hash_value(std::tuple< \
182 BOOST_PP_ENUM_PARAMS_Z(z, n, A) \
185 return boost::hash_detail::hash_tuple(v); \
188 BOOST_PP_REPEAT_FROM_TO(1, 11, BOOST_HASH_TUPLE_F, _)
189 # undef BOOST_HASH_TUPLE_F
194 #if !defined(BOOST_NO_CXX11_SMART_PTR)
195 template <typename T>
196 inline std::size_t hash_value(std::shared_ptr<T> const& x) {
197 return boost::hash_value(x.get());
200 template <typename T, typename Deleter>
201 inline std::size_t hash_value(std::unique_ptr<T, Deleter> const& x) {
202 return boost::hash_value(x.get());
210 // On compilers without function template ordering, this deals with arrays.
212 #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
213 namespace hash_detail
215 template <bool IsArray>
216 struct call_hash_impl
221 static std::size_t call(T const& v)
223 using namespace boost;
224 return hash_value(v);
230 struct call_hash_impl<true>
232 template <class Array>
235 #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
236 static std::size_t call(Array const& v)
238 static std::size_t call(Array& v)
241 const int size = sizeof(v) / sizeof(*v);
242 return boost::hash_range(v, v + size);
249 : public call_hash_impl<boost::is_array<T>::value>
250 ::BOOST_NESTED_TEMPLATE inner<T>
254 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
261 #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
263 template <class T> struct hash
264 : std::unary_function<T, std::size_t>
266 #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
267 std::size_t operator()(T const& val) const
269 return hash_value(val);
272 std::size_t operator()(T const& val) const
274 return hash_detail::call_hash<T>::call(val);
279 #if BOOST_WORKAROUND(__DMC__, <= 0x848)
280 template <class T, unsigned int n> struct hash<T[n]>
281 : std::unary_function<T[n], std::size_t>
283 std::size_t operator()(const T* val) const
285 return boost::hash_range(val, val+n);
290 #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
292 // On compilers without partial specialization, boost::hash<T>
293 // has already been declared to deal with pointers, so just
294 // need to supply the non-pointer version of hash_impl.
296 namespace hash_detail
298 template <bool IsPointer>
301 #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
304 struct hash_impl<false>
308 : std::unary_function<T, std::size_t>
310 #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
311 std::size_t operator()(T const& val) const
313 return hash_value(val);
316 std::size_t operator()(T const& val) const
318 return hash_detail::call_hash<T>::call(val);
324 #else // Visual C++ 6.5
326 // Visual C++ 6.5 has problems with nested member functions and
327 // applying const to const types in templates. So we get this:
329 template <bool IsConst>
330 struct hash_impl_msvc
334 : public std::unary_function<T, std::size_t>
336 std::size_t operator()(T const& val) const
338 return hash_detail::call_hash<T const>::call(val);
341 std::size_t operator()(T& val) const
343 return hash_detail::call_hash<T>::call(val);
349 struct hash_impl_msvc<true>
353 : public std::unary_function<T, std::size_t>
355 std::size_t operator()(T& val) const
357 return hash_detail::call_hash<T>::call(val);
363 struct hash_impl_msvc2
364 : public hash_impl_msvc<boost::is_const<T>::value>
365 ::BOOST_NESTED_TEMPLATE inner<T> {};
368 struct hash_impl<false>
371 struct inner : public hash_impl_msvc2<T> {};
374 #endif // Visual C++ 6.5
376 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION