forked from boostorg/unordered
5989e9227c
Merged revisions 43922,43962,43966,43971,43981,43995-43996,44042,44046-44048,44057 via svnmerge from https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r43922 | danieljames | 2008-03-29 14:55:59 +0000 (Sat, 29 Mar 2008) | 1 line Fix some typos in the reference documentation. ........ r43962 | danieljames | 2008-03-31 18:29:59 +0100 (Mon, 31 Mar 2008) | 1 line Add a name variable to the release script, so that I can have different release names in different branches. ........ r43966 | danieljames | 2008-03-31 18:43:16 +0100 (Mon, 31 Mar 2008) | 1 line Fix the image directory for standalone docs. ........ r43971 | danieljames | 2008-03-31 19:17:25 +0100 (Mon, 31 Mar 2008) | 1 line Fix the unordered stylesheet. ........ r43981 | danieljames | 2008-04-01 13:31:26 +0100 (Tue, 01 Apr 2008) | 2 lines Cast the pointer in the Visual C++ 6.5 _Charalloc method. ........ r43995 | danieljames | 2008-04-02 12:50:27 +0100 (Wed, 02 Apr 2008) | 1 line Try using the interprocess containers for testing. Compilation is a bit slower but hopefully I'll run into less cross-platform problems. ........ r43996 | danieljames | 2008-04-02 13:25:49 +0100 (Wed, 02 Apr 2008) | 1 line Revert my experiment with the interprocess containers. It didn't work out. ........ r44042 | danieljames | 2008-04-04 20:38:09 +0100 (Fri, 04 Apr 2008) | 1 line Make hash table data a member of hash table, instead of a base. ........ r44046 | danieljames | 2008-04-05 12:38:05 +0100 (Sat, 05 Apr 2008) | 1 line Remove rvalue_ref from Jamfile.v2 - I didn't mean to check it in. ........ r44047 | danieljames | 2008-04-05 12:39:38 +0100 (Sat, 05 Apr 2008) | 1 line New constructors with allocators. ........ r44048 | danieljames | 2008-04-05 12:58:11 +0100 (Sat, 05 Apr 2008) | 1 line Document the new constructors. ........ r44057 | danieljames | 2008-04-05 17:08:23 +0100 (Sat, 05 Apr 2008) | 1 line Fix some bugs in the exception testing code. ........ [SVN r44417]
296 lines
9.7 KiB
C++
296 lines
9.7 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 "../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);
|
|
}
|
|
}
|
|
|
|
template <class T>
|
|
void map_constructor_test(T* = 0)
|
|
{
|
|
std::cerr<<"map_constructor_test\n";
|
|
|
|
typedef std::list<std::pair<BOOST_DEDUCED_TYPENAME T::key_type, BOOST_DEDUCED_TYPENAME T::mapped_type> > list;
|
|
test::random_values<T> v(1000);
|
|
list l;
|
|
std::copy(v.begin(), v.end(), std::back_inserter(l));
|
|
|
|
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))
|
|
)
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|