forked from boostorg/unordered
Daniel James
6aa582a90e
https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r43840 | danieljames | 2008-03-24 17:25:07 +0000 (Mon, 24 Mar 2008) | 1 line Fix a g++ warning. ........ r43844 | danieljames | 2008-03-24 17:56:28 +0000 (Mon, 24 Mar 2008) | 1 line It's a new-ish year. ........ r43885 | danieljames | 2008-03-27 20:36:10 +0000 (Thu, 27 Mar 2008) | 1 line The release script doesn't need to copy images and css - because that's now done in the jamfiles. Also tweak the shell script a tad bit. ........ r43890 | danieljames | 2008-03-27 23:01:40 +0000 (Thu, 27 Mar 2008) | 1 line Starting to add a docbook bibliography. ........ r43894 | danieljames | 2008-03-27 23:24:18 +0000 (Thu, 27 Mar 2008) | 1 line Redeclare 'data' in iterator_base to help compilers which have trouble with accessing the nested typedef. ........ [SVN r43895]
90 lines
2.3 KiB
C++
90 lines
2.3 KiB
C++
|
|
// 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 <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 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)
|
|
{
|
|
X x;
|
|
x.max_load_factor(mlf);
|
|
float b = x.max_load_factor();
|
|
|
|
test::random_values<X> values(1000);
|
|
|
|
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(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
|