// 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 #include #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 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_CHECK(y.empty()); BOOST_CHECK(test::equivalent(y.hash_function(), hf)); BOOST_CHECK(test::equivalent(y.key_eq(), eq)); BOOST_CHECK(test::equivalent(y.get_allocator(), al)); BOOST_CHECK(x.max_load_factor() == y.max_load_factor()); test::check_equivalent_keys(y); } { test::random_values v(1000, generator); T x(v.begin(), v.end()); T y(x); test::unordered_equivalence_tester 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 v(1000, generator); T x(v.begin(), v.end()); x.max_load_factor(x.load_factor() / 4); T y(x); test::unordered_equivalence_tester equivalent(x); equivalent(y); // This isn't guaranteed: BOOST_CHECK(y.load_factor() < y.max_load_factor()); test::check_equivalent_keys(y); } } template 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_CHECK(y.empty()); BOOST_CHECK(test::equivalent(y.hash_function(), hf)); BOOST_CHECK(test::equivalent(y.key_eq(), eq)); BOOST_CHECK(test::equivalent(y.get_allocator(), al)); BOOST_CHECK(x.max_load_factor() == y.max_load_factor()); test::check_equivalent_keys(y); } { T x(1000, hf, eq, al); T y(x, al2); BOOST_CHECK(y.empty()); BOOST_CHECK(test::equivalent(y.hash_function(), hf)); BOOST_CHECK(test::equivalent(y.key_eq(), eq)); BOOST_CHECK(test::equivalent(y.get_allocator(), al2)); BOOST_CHECK(x.max_load_factor() == y.max_load_factor()); test::check_equivalent_keys(y); } { test::random_values v(1000, generator); T x(v.begin(), v.end(), 0, hf, eq, al); T y(x); test::unordered_equivalence_tester equivalent(x); equivalent(y); test::check_equivalent_keys(y); BOOST_CHECK(test::equivalent(y.get_allocator(), al)); } { test::random_values v(500, generator); T x(v.begin(), v.end(), 0, hf, eq, al); T y(x, al2); test::unordered_equivalence_tester equivalent(x); equivalent(y); test::check_equivalent_keys(y); BOOST_CHECK(test::equivalent(y.get_allocator(), al2)); } } boost::unordered_set >* test_set; boost::unordered_multiset >* test_multiset; boost::unordered_map >* test_map; boost::unordered_multimap >* 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()