forked from boostorg/unordered
6f45d36d97
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And several minor internal changes. Mostly minor internal details. Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line Use the new 'boost:' links for the hash, unordered and quickbook documentation. ........ r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines Don't copy images for the standalone hash and unordered documentation, was only really required before the libraries were integrated into boost. ........ r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line Fix the hash dirname. ........ r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler. ........ r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line Move some of the data structure classes out of hash table data. ........ r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line Add missing return for operator=. ........ r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines Make the sort stable. Doesn't really matter, but it might as well be. ........ r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line Detab. ........ r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines Move hash_fwd into the hash subdirectory. I should have done this in the last release. But now all of the hash implementation is in the hash subdirectory. ........ r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines Remove deprecated headers. Fixes #2412. ........ r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line Update copyright dates in hash and unordered. ........ [SVN r51729]
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_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 <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_CHECK(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
|