forked from boostorg/unordered
ae09b0dd24
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]
90 lines
2.4 KiB
C++
90 lines
2.4 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 <boost/limits.hpp>
|
|
#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 <class X>
|
|
void set_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 <class X>
|
|
void insert_test(X*, float mlf, test::random_generator generator = test::default_generator)
|
|
{
|
|
X x;
|
|
x.max_load_factor(mlf);
|
|
float b = x.max_load_factor();
|
|
|
|
test::random_values<X> values(1000, generator);
|
|
|
|
for(BOOST_DEDUCED_TYPENAME test::random_values<X>::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_TEST(x.bucket_count() == old_bucket_count);
|
|
}
|
|
}
|
|
|
|
template <class X>
|
|
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<float>::min)());
|
|
|
|
if(std::numeric_limits<float>::has_infinity)
|
|
insert_test(ptr, std::numeric_limits<float>::infinity());
|
|
}
|
|
|
|
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,
|
|
((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
|