forked from boostorg/unordered
b5db48b6a4
hopefully better cross-platform support. Merged revisions 44778-44835,44837-44918 via svnmerge from https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r44778 | danieljames | 2008-04-26 17:15:44 +0100 (Sat, 26 Apr 2008) | 2 lines Remove a trailing comma. ........ r44779 | danieljames | 2008-04-26 17:23:51 +0100 (Sat, 26 Apr 2008) | 1 line Merge in support for equality operators. ........ r44780 | danieljames | 2008-04-26 17:28:44 +0100 (Sat, 26 Apr 2008) | 1 line Use my own list container to avoid working around STL container bugs. ........ r44833 | danieljames | 2008-04-28 08:03:43 +0100 (Mon, 28 Apr 2008) | 1 line Better equality tests. ........ r44834 | danieljames | 2008-04-28 08:04:03 +0100 (Mon, 28 Apr 2008) | 1 line Remove a superfluous check. ........ r44835 | danieljames | 2008-04-28 08:04:21 +0100 (Mon, 28 Apr 2008) | 1 line Add equality reference documentation. ........ r44916 | danieljames | 2008-04-30 08:16:52 +0100 (Wed, 30 Apr 2008) | 1 line New version of list.hpp ........ r44917 | danieljames | 2008-04-30 08:18:31 +0100 (Wed, 30 Apr 2008) | 1 line Support compilers without ADL in the compile tests. ........ r44918 | danieljames | 2008-04-30 08:25:20 +0100 (Wed, 30 Apr 2008) | 7 lines Change the typedef of buffered functions as it was confusing MSVC 6.5 get_allocator wasn't compiling when the allocator workaround is used because it couldn't cast from the wrapped allocator to an allocator of another type. So use value_alloc_ when it's available (it's only unavailable on compilers with C++0x support, which don't require the workaround). ........ [SVN r44919]
90 lines
2.6 KiB
C++
90 lines
2.6 KiB
C++
|
|
// Copyright 2005-2008 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)
|
|
|
|
#if !defined(BOOST_UNORDERED_TESTS_EQUIVALENT_HEADER)
|
|
#define BOOST_UNORDERED_TESTS_EQUIVALENT_HEADER
|
|
|
|
#include <boost/unordered_map.hpp>
|
|
#include <boost/unordered_set.hpp>
|
|
#include <algorithm>
|
|
#include "./metafunctions.hpp"
|
|
#include "./fwd.hpp"
|
|
#include "./list.hpp"
|
|
|
|
namespace test
|
|
{
|
|
template <class T1, class T2>
|
|
bool equivalent_impl(T1 const& x, T2 const& y, base_type) {
|
|
return x == y;
|
|
}
|
|
|
|
template <class T>
|
|
bool equivalent_impl(boost::hash<T> const&, boost::hash<T> const&, derived_type) {
|
|
return true;
|
|
}
|
|
|
|
template <class T>
|
|
bool equivalent_impl(std::equal_to<T> const&, std::equal_to<T> const&, derived_type) {
|
|
return true;
|
|
}
|
|
|
|
template <class T1, class T2, class T3, class T4>
|
|
bool equivalent_impl(std::pair<T1, T2> const& x1,
|
|
std::pair<T3, T4> const& x2, derived_type) {
|
|
return equivalent_impl(x1.first, x2.first, derived) &&
|
|
equivalent_impl(x1.second, x2.second, derived);
|
|
}
|
|
|
|
struct equivalent_type {
|
|
template <class T1, class T2>
|
|
bool operator()(T1 const& x, T2 const& y) {
|
|
return equivalent_impl(x, y, derived);
|
|
}
|
|
};
|
|
|
|
namespace {
|
|
equivalent_type equivalent;
|
|
}
|
|
|
|
template <class Container>
|
|
class unordered_equivalence_tester
|
|
{
|
|
BOOST_DEDUCED_TYPENAME Container::size_type size_;
|
|
BOOST_DEDUCED_TYPENAME Container::hasher hasher_;
|
|
BOOST_DEDUCED_TYPENAME Container::key_equal key_equal_;
|
|
float max_load_factor_;
|
|
|
|
typedef test::list<BOOST_DEDUCED_TYPENAME Container::value_type>
|
|
value_list;
|
|
value_list values_;
|
|
public:
|
|
unordered_equivalence_tester(Container const &x)
|
|
: size_(x.size()),
|
|
hasher_(x.hash_function()), key_equal_(x.key_eq()),
|
|
max_load_factor_(x.max_load_factor()),
|
|
values_(x.begin(), x.end())
|
|
{
|
|
values_.sort();
|
|
}
|
|
|
|
bool operator()(Container const& x) const
|
|
{
|
|
if(!((size_ == x.size()) &&
|
|
(test::equivalent(hasher_, x.hash_function())) &&
|
|
(test::equivalent(key_equal_, x.key_eq())) &&
|
|
(max_load_factor_ == x.max_load_factor()) &&
|
|
(values_.size() == x.size()))) return false;
|
|
|
|
value_list copy(x.begin(), x.end());
|
|
copy.sort();
|
|
return values_ == copy;
|
|
}
|
|
private:
|
|
unordered_equivalence_tester();
|
|
};
|
|
}
|
|
|
|
#endif
|