feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

If the containers have equality comparisons, they'll also need 'hash_value'. Untested and undocumented, as before.

Browse Source 
[SVN r42108]
This commit is contained in:
Daniel James
2007-12-16 18:20:25 +00:00
parent c918da0249
commit 3002a898a0
6 changed files with 146 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
include/boost/unordered_set.hpp
+11 -1
View File
@@ -16,8 +16,8 @@
#include <functional>
#include <memory>
#include <boost/unordered/detail/hash_table.hpp>
#include <boost/functional/hash.hpp>
#include <boost/unordered/detail/hash_table.hpp>
namespace boost
{
@@ -305,6 +305,11 @@ namespace boost
{
return !m1.base.equals(m2.base);
}
friend std::size_t hash_value(unordered_set const& m)
{
return m.base.hash_value();
}
}; // class template unordered_set
template <class T, class H, class P, class A>
@@ -597,6 +602,11 @@ namespace boost
{
return !m1.base.equals(m2.base);
}
friend std::size_t hash_value(unordered_multiset const& m)
{
return m.base.hash_value();
}
}; // class template unordered_multiset
template <class T, class H, class P, class A>