Files
boost_unordered/test/unordered/load_factor_tests.cpp
T

116 lines
3.5 KiB
C++
Raw Normal View History

// Copyright 2006-2009 Daniel James.
2022-10-24 11:31:25 -07:00
// Copyright 2022 Christian Mazakas.
// 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 "../helpers/unordered.hpp"
2008-03-24 17:03:15 +00:00
#include "../helpers/test.hpp"
#include <boost/limits.hpp>
#include "../helpers/random_values.hpp"
#if defined(BOOST_MSVC)
#pragma warning(push)
2017-02-19 13:05:17 +00:00
#pragma warning(disable : 4127) // conditional expression is constant
#endif
2017-02-19 13:05:17 +00:00
namespace load_factor_tests {
2008-03-24 17:03:15 +00:00
test::seed_t initialize_seed(783656);
2007-12-06 11:42:28 +00:00
template <class X> void set_load_factor_tests(X*)
{
X x;
2022-10-07 10:56:47 -07:00
#ifdef BOOST_UNORDERED_FOA_TESTS
BOOST_TEST(x.max_load_factor() == boost::unordered::detail::foa::mlf);
BOOST_TEST(x.load_factor() == 0);
2022-10-07 10:56:47 -07:00
// 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() == boost::unordered::detail::foa::mlf);
x.max_load_factor(0.5);
BOOST_TEST(x.max_load_factor() == boost::unordered::detail::foa::mlf);
#else
2009-05-27 17:44:09 +00:00
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.
2017-02-19 13:05:17 +00:00
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);
2022-10-07 10:56:47 -07:00
#endif
}
template <class X>
void insert_test(X*, float mlf, test::random_generator generator)
{
X x;
x.max_load_factor(mlf);
float b = x.max_load_factor();
test::random_values<X> values(1000, generator);
2018-01-27 09:39:59 +00:00
for (typename test::random_values<X>::const_iterator it = values.begin(),
end = values.end();
2017-02-19 13:05:17 +00:00
it != end; ++it) {
2018-01-27 09:39:59 +00:00
typename X::size_type old_size = x.size(),
old_bucket_count = x.bucket_count();
x.insert(*it);
if (static_cast<double>(old_size + 1) <=
b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count);
}
}
template <class X>
void load_factor_insert_tests(X* ptr, test::random_generator generator)
{
2012-09-05 23:33:22 +00:00
insert_test(ptr, 1.0f, generator);
insert_test(ptr, 0.1f, generator);
insert_test(ptr, 100.0f, generator);
2017-02-19 13:05:17 +00:00
insert_test(ptr, (std::numeric_limits<float>::min)(), generator);
2017-02-19 13:05:17 +00:00
if (std::numeric_limits<float>::has_infinity)
insert_test(ptr, std::numeric_limits<float>::infinity(), generator);
}
2022-10-07 10:56:47 -07:00
using test::default_generator;
using test::generate_collisions;
using test::limited_range;
#ifdef BOOST_UNORDERED_FOA_TESTS
boost::unordered_flat_set<int>* int_set_ptr;
boost::unordered_flat_map<int, int>* int_map_ptr;
UNORDERED_TEST(set_load_factor_tests, ((int_set_ptr)(int_map_ptr)))
UNORDERED_TEST(load_factor_insert_tests,
((int_set_ptr)(int_map_ptr))(
(default_generator)(generate_collisions)(limited_range)))
#else
boost::unordered_set<int>* int_set_ptr;
boost::unordered_multiset<int>* int_multiset_ptr;
boost::unordered_map<int, int>* int_map_ptr;
boost::unordered_multimap<int, int>* int_multimap_ptr;
UNORDERED_TEST(set_load_factor_tests,
2017-02-19 13:05:17 +00:00
((int_set_ptr)(int_multiset_ptr)(int_map_ptr)(int_multimap_ptr)))
2008-03-24 17:03:15 +00:00
UNORDERED_TEST(load_factor_insert_tests,
2017-02-19 13:05:17 +00:00
((int_set_ptr)(int_multiset_ptr)(int_map_ptr)(int_multimap_ptr))(
2017-10-05 10:54:22 +01:00
(default_generator)(generate_collisions)(limited_range)))
2022-10-07 10:56:47 -07:00
#endif
}
2008-03-24 17:03:15 +00:00
RUN_TESTS()
#if defined(BOOST_MSVC)
#pragma warning(pop)
2017-02-19 13:05:17 +00:00
#pragma warning(disable : 4127) // conditional expression is constant
#endif