forked from boostorg/unordered
1e7fe6a2d0
Merged revisions 55470,55877-55878,55901-55902,55921-55922,55990-55992,56009-56010,56329,56346-56349,56362-56363,56374 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r55470 | danieljames | 2009-08-08 19:50:00 +0100 (Sat, 08 Aug 2009) | 1 line Remove empty svn:mergeinfo properties. This should reduce the amount of differences between trunk and release. ........ r55877 | danieljames | 2009-08-30 17:33:42 +0100 (Sun, 30 Aug 2009) | 1 line Remove allocator_constructor since it's never used. ........ r55878 | danieljames | 2009-08-30 17:42:28 +0100 (Sun, 30 Aug 2009) | 6 lines Initial checkin of new version of Boost.Unordered. - More template use, less preprocessor use. - Removed some of the Visual C++ 6 workarounds. - Reduced memory use of the main object. - Split into smaller headers. ........ r55901 | danieljames | 2009-08-31 11:39:25 +0100 (Mon, 31 Aug 2009) | 1 line Detab. ........ r55902 | danieljames | 2009-08-31 11:39:40 +0100 (Mon, 31 Aug 2009) | 1 line Remove unnecessary BOOST_DEDUCED_TYPENAMEs ........ r55921 | danieljames | 2009-08-31 16:33:28 +0100 (Mon, 31 Aug 2009) | 1 line Remove a few unused parameters. ........ r55922 | danieljames | 2009-08-31 16:33:49 +0100 (Mon, 31 Aug 2009) | 1 line Remove 'static' from next_node and node_count. Will hopefully make vacpp happy. ........ r55990 | danieljames | 2009-09-03 08:36:21 +0100 (Thu, 03 Sep 2009) | 1 line Combine hash_structure and hash_table_manager. ........ r55991 | danieljames | 2009-09-03 08:37:14 +0100 (Thu, 03 Sep 2009) | 1 line Remove some old Visual C++ workarounds. ........ r55992 | danieljames | 2009-09-03 08:37:30 +0100 (Thu, 03 Sep 2009) | 1 line Add a small test to see if the tested compilers support out of line template methods. ........ r56009 | danieljames | 2009-09-04 08:02:28 +0100 (Fri, 04 Sep 2009) | 1 line Fix link to n2691. ........ r56010 | danieljames | 2009-09-04 08:03:04 +0100 (Fri, 04 Sep 2009) | 1 line Move size_ and cached_begin_bucket_ into table, rename hash_table_manager hash_buckets. ........ r56329 | danieljames | 2009-09-20 22:55:15 +0100 (Sun, 20 Sep 2009) | 2 lines Since all the compilers support out of line template members use them and lots of other things. ........ r56346 | danieljames | 2009-09-21 22:17:19 +0100 (Mon, 21 Sep 2009) | 1 line Slightly more consistent variable names. In detail 'n' is now always a node pointer. ........ r56347 | danieljames | 2009-09-21 22:17:40 +0100 (Mon, 21 Sep 2009) | 1 line Fix bug where container was reducing the number of buckets. ........ r56348 | danieljames | 2009-09-21 22:18:01 +0100 (Mon, 21 Sep 2009) | 1 line Fix a bug that was causing unnecessary rehahes. ........ r56349 | danieljames | 2009-09-21 22:18:21 +0100 (Mon, 21 Sep 2009) | 1 line Use std::max. ........ r56362 | danieljames | 2009-09-22 23:39:00 +0100 (Tue, 22 Sep 2009) | 1 line Another std::max. ........ r56363 | danieljames | 2009-09-22 23:39:17 +0100 (Tue, 22 Sep 2009) | 1 line Remove the emplace_hint implementation for unique containers as it isn't really used and seems to be causing sun 5.7 problems. ........ r56374 | danieljames | 2009-09-24 21:42:19 +0100 (Thu, 24 Sep 2009) | 1 line Remove temporary test. ........ [SVN r56375]
329 lines
11 KiB
C++
329 lines
11 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 "../objects/test.hpp"
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/tracker.hpp"
|
|
#include "../helpers/equivalent.hpp"
|
|
#include "../helpers/input_iterator.hpp"
|
|
#include "../helpers/invariants.hpp"
|
|
|
|
#include <iostream>
|
|
|
|
namespace constructor_tests {
|
|
|
|
test::seed_t seed(356730);
|
|
|
|
template <class T>
|
|
void constructor_tests1(T*, test::random_generator generator = test::default_generator)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf;
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq;
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al;
|
|
|
|
std::cerr<<"Construct 1\n";
|
|
{
|
|
T x(0, hf, eq);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 2\n";
|
|
{
|
|
T x(100, hf);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 100);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 3\n";
|
|
{
|
|
T x(2000);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 2000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 4\n";
|
|
{
|
|
T x;
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 5\n";
|
|
{
|
|
test::random_values<T> v(1000, generator);
|
|
T x(v.begin(), v.end(), 10000, hf, eq);
|
|
BOOST_TEST(x.bucket_count() >= 10000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 6\n";
|
|
{
|
|
test::random_values<T> v(10, generator);
|
|
T x(v.begin(), v.end(), 10000, hf);
|
|
BOOST_TEST(x.bucket_count() >= 10000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 7\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(v.begin(), v.end(), 100);
|
|
BOOST_TEST(x.bucket_count() >= 100);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 8\n";
|
|
{
|
|
test::random_values<T> v(1, generator);
|
|
T x(v.begin(), v.end());
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 9\n";
|
|
{
|
|
T x(0, hf, eq, al);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 10\n";
|
|
{
|
|
test::random_values<T> v(1000, generator);
|
|
T x(v.begin(), v.end(), 10000, hf, eq, al);
|
|
BOOST_TEST(x.bucket_count() >= 10000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 11\n";
|
|
{
|
|
test::random_values<T> v(1000, generator);
|
|
T x(al);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
}
|
|
|
|
template <class T>
|
|
void constructor_tests2(T*, test::random_generator const& generator = test::default_generator)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf;
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf1(1);
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf2(2);
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq;
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq1(1);
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq2(2);
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al;
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al1(1);
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al2(2);
|
|
|
|
std::cerr<<"Construct 1\n";
|
|
{
|
|
T x(10000, hf1, eq1);
|
|
BOOST_TEST(x.bucket_count() >= 10000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq1));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 2\n";
|
|
{
|
|
T x(100, hf1);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 100);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 3\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(v.begin(), v.end(), 0, hf1, eq1);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq1));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 4\n";
|
|
{
|
|
test::random_values<T> v(5, generator);
|
|
T x(v.begin(), v.end(), 1000, hf1);
|
|
BOOST_TEST(x.bucket_count() >= 1000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
|
|
std::cerr<<"Construct 5\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(v.begin(), v.end(), 0, hf, eq, al1);
|
|
T y(x.begin(), x.end(), 0, hf1, eq1, al2);
|
|
test::check_container(x, v);
|
|
test::check_container(y, x);
|
|
test::check_equivalent_keys(x);
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
std::cerr<<"Construct 6\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(v.begin(), v.end(), 0, hf1, eq1);
|
|
T y(x.begin(), x.end(), 0, hf, eq);
|
|
test::check_container(x, v);
|
|
test::check_container(y, x);
|
|
test::check_equivalent_keys(x);
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
std::cerr<<"Construct 7\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(v.begin(), v.end(), 0, hf1, eq1);
|
|
T y(x.begin(), x.end(), 0, hf2, eq2);
|
|
test::check_container(x, v);
|
|
test::check_container(y, x);
|
|
test::check_equivalent_keys(x);
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
std::cerr<<"Construct 8 - from input iterator\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(test::input_iterator(v.begin()), test::input_iterator(v.end()), 0, hf1, eq1);
|
|
T y(test::input_iterator(x.begin()), test::input_iterator(x.end()), 0, hf2, eq2);
|
|
test::check_container(x, v);
|
|
test::check_container(y, x);
|
|
test::check_equivalent_keys(x);
|
|
test::check_equivalent_keys(y);
|
|
}
|
|
|
|
std::cerr<<"Construct 9\n";
|
|
{
|
|
test::random_values<T> v(100, generator);
|
|
T x(50);
|
|
BOOST_TEST(x.bucket_count() >= 50);
|
|
x.max_load_factor(10);
|
|
BOOST_TEST(x.bucket_count() >= 50);
|
|
x.insert(v.begin(), v.end());
|
|
BOOST_TEST(x.bucket_count() >= 50);
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
}
|
|
|
|
template <class T>
|
|
void map_constructor_test(T* = 0, test::random_generator const& generator = test::default_generator)
|
|
{
|
|
std::cerr<<"map_constructor_test\n";
|
|
|
|
typedef test::list<std::pair<BOOST_DEDUCED_TYPENAME T::key_type, BOOST_DEDUCED_TYPENAME T::mapped_type> > list;
|
|
test::random_values<T> v(1000, generator);
|
|
list l(v.begin(), v.end());
|
|
T x(l.begin(), l.end());
|
|
|
|
test::check_container(x, v);
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
boost::unordered_set<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_set;
|
|
boost::unordered_multiset<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multiset;
|
|
boost::unordered_map<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_map;
|
|
boost::unordered_multimap<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multimap;
|
|
|
|
using test::default_generator;
|
|
using test::generate_collisions;
|
|
|
|
UNORDERED_TEST(constructor_tests1,
|
|
((test_set)(test_multiset)(test_map)(test_multimap))
|
|
((default_generator)(generate_collisions))
|
|
)
|
|
|
|
UNORDERED_TEST(constructor_tests2,
|
|
((test_set)(test_multiset)(test_map)(test_multimap))
|
|
((default_generator)(generate_collisions))
|
|
)
|
|
|
|
UNORDERED_TEST(map_constructor_test,
|
|
((test_map)(test_multimap))
|
|
)
|
|
|
|
#if !defined(BOOST_NO_0X_HDR_INITIALIZER_LIST)
|
|
|
|
UNORDERED_AUTO_TEST(test_default_initializer_list) {
|
|
std::cerr<<"Initializer List Tests\n";
|
|
std::initializer_list<int> init;
|
|
boost::unordered_set<int> x1 = init;
|
|
BOOST_TEST(x1.empty());
|
|
}
|
|
|
|
#endif
|
|
|
|
#if !defined(BOOST_NO_INITIALIZER_LISTS)
|
|
|
|
UNORDERED_AUTO_TEST(test_initializer_list) {
|
|
std::cerr<<"Initializer List Tests\n";
|
|
boost::unordered_set<int> x1 = { 2, 10, 45, -5 };
|
|
BOOST_TEST(x1.find(10) != x1.end());
|
|
BOOST_TEST(x1.find(46) == x1.end());
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|