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]
305 lines
10 KiB
C++
305 lines
10 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_CHECK(x.empty());
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 2\n";
|
|
{
|
|
T x(100, hf);
|
|
BOOST_CHECK(x.empty());
|
|
BOOST_CHECK(x.bucket_count() >= 100);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 3\n";
|
|
{
|
|
T x(2000);
|
|
BOOST_CHECK(x.empty());
|
|
BOOST_CHECK(x.bucket_count() >= 2000);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 4\n";
|
|
{
|
|
T x;
|
|
BOOST_CHECK(x.empty());
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.bucket_count() >= 10000);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.bucket_count() >= 10000);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.bucket_count() >= 100);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.empty());
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.bucket_count() >= 10000);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.empty());
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(x.bucket_count() >= 10000);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq1));
|
|
BOOST_CHECK(test::equivalent(x.get_allocator(), al));
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
|
|
std::cerr<<"Construct 2\n";
|
|
{
|
|
T x(100, hf1);
|
|
BOOST_CHECK(x.empty());
|
|
BOOST_CHECK(x.bucket_count() >= 100);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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_CHECK(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq1));
|
|
BOOST_CHECK(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_CHECK(x.bucket_count() >= 1000);
|
|
BOOST_CHECK(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_CHECK(test::equivalent(x.key_eq(), eq));
|
|
BOOST_CHECK(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, 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_INITIALIZER_LISTS)
|
|
|
|
UNORDERED_AUTO_TEST(test_initializer_list) {
|
|
std::cerr<<"Initializer List Tests\n";
|
|
boost::unordered_set<int> x1 = { 2, 10, 45, -5 };
|
|
BOOST_CHECK(x1.find(10) != x1.end());
|
|
BOOST_CHECK(x1.find(46) == x1.end());
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|