forked from boostorg/unordered
Merged revisions 53127,53253,53256,53311,53314,53316-53318 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r53127 | danieljames | 2009-05-20 07:43:38 +0100 (Wed, 20 May 2009) | 1 line Better configuration for boost.unordered. ........ r53253 | danieljames | 2009-05-25 20:14:07 +0100 (Mon, 25 May 2009) | 3 lines Add explicit destructors to the unordered containers. Refs #2908. Isn't really needed but it doesn't hurt. ........ r53256 | danieljames | 2009-05-25 20:45:23 +0100 (Mon, 25 May 2009) | 1 line Unordered change log for explicit destructors. ........ r53311 | danieljames | 2009-05-27 18:42:01 +0100 (Wed, 27 May 2009) | 1 line Missing changelog entry. ........ r53314 | danieljames | 2009-05-27 18:44:09 +0100 (Wed, 27 May 2009) | 1 line Use lightweight_test for unordered. ........ r53316 | danieljames | 2009-05-27 19:19:32 +0100 (Wed, 27 May 2009) | 1 line Some workarounds for old versions of Borland. ........ r53317 | danieljames | 2009-05-27 19:32:22 +0100 (Wed, 27 May 2009) | 1 line Fix a change accidentally included in the last commit. ........ r53318 | danieljames | 2009-05-27 19:32:38 +0100 (Wed, 27 May 2009) | 1 line Remove an unused function. ........ [SVN r53465]
140 lines
4.5 KiB
C++
140 lines
4.5 KiB
C++
|
|
// Copyright 2006-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)
|
|
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
#include "../helpers/test.hpp"
|
|
#include "../objects/test.hpp"
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/tracker.hpp"
|
|
#include "../helpers/equivalent.hpp"
|
|
#include "../helpers/invariants.hpp"
|
|
|
|
test::seed_t seed(9063);
|
|
|
|
namespace copy_tests
|
|
{
|
|
|
|
template <class T>
|
|
void copy_construct_tests1(T*, test::random_generator const& generator = test::default_generator)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf;
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq;
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al;
|
|
|
|
{
|
|
T x;
|
|
T y(x);
|
|
BOOST_TEST(y.empty());
|
|
BOOST_TEST(test::equivalent(y.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(y.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(y.get_allocator(), al));
|
|
BOOST_TEST(x.max_load_factor() == y.max_load_factor());
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
{
|
|
test::random_values<T> v(1000, generator);
|
|
|
|
T x(v.begin(), v.end());
|
|
T y(x);
|
|
test::unordered_equivalence_tester<T> equivalent(x);
|
|
equivalent(y);
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
{
|
|
// In this test I drop the original containers max load factor, so it
|
|
// is much lower than the load factor. The hash table is not allowed
|
|
// to rehash, but the destination container should probably allocate
|
|
// enough buckets to decrease the load factor appropriately.
|
|
test::random_values<T> v(1000, generator);
|
|
T x(v.begin(), v.end());
|
|
x.max_load_factor(x.load_factor() / 4);
|
|
T y(x);
|
|
test::unordered_equivalence_tester<T> equivalent(x);
|
|
equivalent(y);
|
|
// This isn't guaranteed:
|
|
BOOST_TEST(y.load_factor() < y.max_load_factor());
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
}
|
|
|
|
template <class T>
|
|
void copy_construct_tests2(T* ptr, test::random_generator const& generator = test::default_generator)
|
|
{
|
|
copy_construct_tests1(ptr);
|
|
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf(1);
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq(1);
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al(1);
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al2(2);
|
|
|
|
{
|
|
T x(10000, hf, eq, al);
|
|
T y(x);
|
|
BOOST_TEST(y.empty());
|
|
BOOST_TEST(test::equivalent(y.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(y.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(y.get_allocator(), al));
|
|
BOOST_TEST(x.max_load_factor() == y.max_load_factor());
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
{
|
|
T x(1000, hf, eq, al);
|
|
T y(x, al2);
|
|
BOOST_TEST(y.empty());
|
|
BOOST_TEST(test::equivalent(y.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(y.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(y.get_allocator(), al2));
|
|
BOOST_TEST(x.max_load_factor() == y.max_load_factor());
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
{
|
|
test::random_values<T> v(1000, generator);
|
|
|
|
T x(v.begin(), v.end(), 0, hf, eq, al);
|
|
T y(x);
|
|
test::unordered_equivalence_tester<T> equivalent(x);
|
|
equivalent(y);
|
|
test::check_equivalent_keys(y);
|
|
BOOST_TEST(test::equivalent(y.get_allocator(), al));
|
|
}
|
|
|
|
{
|
|
test::random_values<T> v(500, generator);
|
|
|
|
T x(v.begin(), v.end(), 0, hf, eq, al);
|
|
T y(x, al2);
|
|
test::unordered_equivalence_tester<T> equivalent(x);
|
|
equivalent(y);
|
|
test::check_equivalent_keys(y);
|
|
BOOST_TEST(test::equivalent(y.get_allocator(), al2));
|
|
}
|
|
}
|
|
|
|
boost::unordered_set<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_set;
|
|
boost::unordered_multiset<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multiset;
|
|
boost::unordered_map<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_map;
|
|
boost::unordered_multimap<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multimap;
|
|
|
|
using test::default_generator;
|
|
using test::generate_collisions;
|
|
|
|
UNORDERED_TEST(copy_construct_tests1,
|
|
((test_set)(test_multiset)(test_map)(test_multimap))
|
|
)
|
|
|
|
UNORDERED_TEST(copy_construct_tests2,
|
|
((test_set)(test_multiset)(test_map)(test_multimap))
|
|
((default_generator)(generate_collisions))
|
|
)
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|