// Copyright 2006 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 #include #include "../helpers/random_values.hpp" template void load_factor_tests(X* = 0) { X x; BOOST_TEST(x.max_load_factor() == 1.0); BOOST_TEST(x.load_factor() == 0); // A valid implementation could fail these tests, but I think they're // reasonable. x.max_load_factor(2.0); BOOST_TEST(x.max_load_factor() == 2.0); x.max_load_factor(0.5); BOOST_TEST(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(typename test::random_values::const_iterator it = values.begin(), end = values.end(); it != end; ++it) { 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_TEST(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()); } int main() { load_factor_tests((boost::unordered_set*) 0); load_factor_tests((boost::unordered_multiset*) 0); load_factor_tests((boost::unordered_map*) 0); load_factor_tests((boost::unordered_multimap*) 0); load_factor_insert_tests((boost::unordered_set*) 0); load_factor_insert_tests((boost::unordered_multiset*) 0); load_factor_insert_tests((boost::unordered_map*) 0); load_factor_insert_tests((boost::unordered_multimap*) 0); return boost::report_errors(); }