mirror of
https://github.com/boostorg/unordered.git
synced 2025-11-06 18:51:39 +01:00
6f45d36d97
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And several minor internal changes. Mostly minor internal details. Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line Use the new 'boost:' links for the hash, unordered and quickbook documentation. ........ r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines Don't copy images for the standalone hash and unordered documentation, was only really required before the libraries were integrated into boost. ........ r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line Fix the hash dirname. ........ r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler. ........ r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line Move some of the data structure classes out of hash table data. ........ r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line Add missing return for operator=. ........ r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines Make the sort stable. Doesn't really matter, but it might as well be. ........ r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line Detab. ........ r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines Move hash_fwd into the hash subdirectory. I should have done this in the last release. But now all of the hash implementation is in the hash subdirectory. ........ r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines Remove deprecated headers. Fixes #2412. ........ r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line Update copyright dates in hash and unordered. ........ [SVN r51729]
95 lines
2.8 KiB
C++
95 lines
2.8 KiB
C++
|
|
// 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)
|
|
|
|
#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);
|
|
}
|
|
};
|
|
|
|
// This won't be a problem as I'm only using a single compile unit
|
|
// in each test (this is actually require by the minimal test
|
|
// framework).
|
|
//
|
|
// boostinspect:nounnamed
|
|
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
|