forked from boostorg/unordered
452 lines
14 KiB
C++
452 lines
14 KiB
C++
|
|
// Copyright 2006-2010 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)
|
|
|
|
// clang-format off
|
|
#include "../helpers/prefix.hpp"
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
#include "../helpers/postfix.hpp"
|
|
// clang-format on
|
|
|
|
#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"
|
|
|
|
namespace constructor_tests {
|
|
|
|
test::seed_t initialize_seed(356730);
|
|
|
|
template <class T>
|
|
void constructor_tests1(T*, test::random_generator generator)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME T::hasher hf;
|
|
BOOST_DEDUCED_TYPENAME T::key_equal eq;
|
|
BOOST_DEDUCED_TYPENAME T::allocator_type al;
|
|
|
|
UNORDERED_SUB_TEST("Construct 1")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 2")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 3")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 4")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 5")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 6")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 7")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 8")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 9")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 10")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 11")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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)
|
|
{
|
|
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);
|
|
|
|
UNORDERED_SUB_TEST("Construct 1")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 2")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 3")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 4")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 5")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 6")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 7")
|
|
{
|
|
test::check_instances check_;
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 8 - from input iterator")
|
|
{
|
|
test::check_instances check_;
|
|
test::random_values<T> v(100, generator);
|
|
BOOST_DEDUCED_TYPENAME test::random_values<T>::const_iterator v_begin =
|
|
v.begin(),
|
|
v_end =
|
|
v.end();
|
|
T x(test::input_iterator(v_begin), test::input_iterator(v_end), 0, hf1,
|
|
eq1);
|
|
BOOST_DEDUCED_TYPENAME T::const_iterator x_begin = x.begin(),
|
|
x_end = x.end();
|
|
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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 8.5 - from copy iterator")
|
|
{
|
|
test::check_instances check_;
|
|
test::random_values<T> v(100, generator);
|
|
T x(test::copy_iterator(v.begin()), test::copy_iterator(v.end()), 0, hf1,
|
|
eq1);
|
|
T y(test::copy_iterator(x.begin()), test::copy_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);
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Construct 9")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
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);
|
|
}
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
std::initializer_list<BOOST_DEDUCED_TYPENAME T::value_type> list;
|
|
|
|
UNORDERED_SUB_TEST("Initializer list construct 1")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
T x(list);
|
|
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));
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Initializer list construct 2")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
T x(list, 1000);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 1000);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Initializer list construct 3")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
T x(list, 10, hf1);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 10);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Initializer list construct 4")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
T x(list, 10, hf1, eq1);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 10);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq1));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al));
|
|
}
|
|
|
|
UNORDERED_SUB_TEST("Initializer list construct 5")
|
|
{
|
|
test::check_instances check_;
|
|
|
|
T x(list, 10, hf1, eq1, al1);
|
|
BOOST_TEST(x.empty());
|
|
BOOST_TEST(x.bucket_count() >= 10);
|
|
BOOST_TEST(test::equivalent(x.hash_function(), hf1));
|
|
BOOST_TEST(test::equivalent(x.key_eq(), eq1));
|
|
BOOST_TEST(test::equivalent(x.get_allocator(), al1));
|
|
}
|
|
#endif
|
|
}
|
|
|
|
template <class T>
|
|
void map_constructor_test(T*, test::random_generator const& generator)
|
|
{
|
|
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_map<test::object, test::object, test::hash, test::equal_to,
|
|
std::allocator<test::object> >* test_map_std_alloc;
|
|
|
|
boost::unordered_set<test::object, test::hash, test::equal_to,
|
|
test::allocator1<test::object> >* test_set;
|
|
boost::unordered_multiset<test::object, test::hash, test::equal_to,
|
|
test::allocator2<test::object> >* test_multiset;
|
|
boost::unordered_map<test::object, test::object, test::hash, test::equal_to,
|
|
test::allocator2<test::object> >* test_map;
|
|
boost::unordered_multimap<test::object, test::object, test::hash,
|
|
test::equal_to, test::allocator1<test::object> >* test_multimap;
|
|
|
|
using test::default_generator;
|
|
using test::generate_collisions;
|
|
using test::limited_range;
|
|
|
|
UNORDERED_TEST(constructor_tests1,
|
|
((test_map_std_alloc)(test_set)(test_multiset)(test_map)(test_multimap))(
|
|
(default_generator)(generate_collisions)(limited_range)))
|
|
|
|
UNORDERED_TEST(constructor_tests2,
|
|
((test_set)(test_multiset)(test_map)(test_multimap))(
|
|
(default_generator)(generate_collisions)(limited_range)))
|
|
|
|
UNORDERED_TEST(map_constructor_test,
|
|
((test_map_std_alloc)(test_map)(test_multimap))(
|
|
(default_generator)(generate_collisions)(limited_range)))
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
|
|
UNORDERED_AUTO_TEST(test_default_initializer_list)
|
|
{
|
|
std::initializer_list<int> init;
|
|
boost::unordered_set<int> x1 = init;
|
|
BOOST_TEST(x1.empty());
|
|
}
|
|
|
|
#endif
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
|
|
UNORDERED_AUTO_TEST(test_initializer_list)
|
|
{
|
|
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_QUIET()
|