// Copyright 2006-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) #include #include #include "../helpers/test.hpp" #include #include "../helpers/random_values.hpp" #if defined(BOOST_MSVC) #pragma warning(push) #pragma warning(disable:4127) // conditional expression is constant #endif namespace load_factor_tests { test::seed_t seed(783656); template void set_load_factor_tests(X* = 0) { X x; BOOST_CHECK(x.max_load_factor() == 1.0); BOOST_CHECK(x.load_factor() == 0); // A valid implementation could fail these tests, but I think they're // reasonable. x.max_load_factor(2.0); BOOST_CHECK(x.max_load_factor() == 2.0); x.max_load_factor(0.5); BOOST_CHECK(x.max_load_factor() == 0.5); } template void insert_test(X*, float mlf) { X x; x.max_load_factor(mlf); float b = x.max_load_factor(); test::random_values values(1000); for(BOOST_DEDUCED_TYPENAME test::random_values::const_iterator it = values.begin(), end = values.end(); it != end; ++it) { BOOST_DEDUCED_TYPENAME X::size_type old_size = x.size(), old_bucket_count = x.bucket_count(); x.insert(*it); if(old_size + 1 < b * old_bucket_count) BOOST_CHECK(x.bucket_count() == old_bucket_count); } } template void load_factor_insert_tests(X* ptr = 0) { insert_test(ptr, 1.0f); insert_test(ptr, 0.1f); insert_test(ptr, 100.0f); insert_test(ptr, (std::numeric_limits::min)()); if(std::numeric_limits::has_infinity) insert_test(ptr, std::numeric_limits::infinity()); } boost::unordered_set* int_set_ptr; boost::unordered_multiset* int_multiset_ptr; boost::unordered_map* int_map_ptr; boost::unordered_multimap* int_multimap_ptr; UNORDERED_TEST(set_load_factor_tests, ((int_set_ptr)(int_multiset_ptr)(int_map_ptr)(int_multimap_ptr)) ) UNORDERED_TEST(load_factor_insert_tests, ((int_set_ptr)(int_multiset_ptr)(int_map_ptr)(int_multimap_ptr)) ) } RUN_TESTS() #if defined(BOOST_MSVC) #pragma warning(pop) #pragma warning(disable:4127) // conditional expression is constant #endif