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]
138 lines
3.1 KiB
C++
138 lines
3.1 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 "./containers.hpp"
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/input_iterator.hpp"
|
|
|
|
test::seed_t seed(91274);
|
|
|
|
struct objects
|
|
{
|
|
test::exception::object obj;
|
|
test::exception::hash hash;
|
|
test::exception::equal_to equal_to;
|
|
test::exception::allocator<test::exception::object> allocator;
|
|
};
|
|
|
|
template <class T>
|
|
struct construct_test1 : public objects, test::exception_base
|
|
{
|
|
void run() const {
|
|
T x;
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct construct_test2 : public objects, test::exception_base
|
|
{
|
|
void run() const {
|
|
T x(300);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct construct_test3 : public objects, test::exception_base
|
|
{
|
|
void run() const {
|
|
T x(0, hash);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct construct_test4 : public objects, test::exception_base
|
|
{
|
|
void run() const {
|
|
T x(0, hash, equal_to);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct construct_test5 : public objects, test::exception_base
|
|
{
|
|
void run() const {
|
|
T x(50, hash, equal_to, allocator);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct construct_test6 : public objects, test::exception_base
|
|
{
|
|
void run() const {
|
|
T x(allocator);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct range : public test::exception_base
|
|
{
|
|
test::random_values<T> values;
|
|
|
|
range() : values(5) {}
|
|
range(unsigned int count) : values(count) {}
|
|
};
|
|
|
|
template <class T>
|
|
struct range_construct_test1 : public range<T>, objects
|
|
{
|
|
void run() const {
|
|
T x(this->values.begin(), this->values.end());
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct range_construct_test2 : public range<T>, objects
|
|
{
|
|
void run() const {
|
|
T x(this->values.begin(), this->values.end(), 0);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct range_construct_test3 : public range<T>, objects
|
|
{
|
|
void run() const {
|
|
T x(this->values.begin(), this->values.end(), 0, hash);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct range_construct_test4 : public range<T>, objects
|
|
{
|
|
void run() const {
|
|
T x(this->values.begin(), this->values.end(), 100, hash, equal_to);
|
|
}
|
|
};
|
|
|
|
// Need to run at least one test with a fairly large number
|
|
// of objects in case it triggers a rehash.
|
|
template <class T>
|
|
struct range_construct_test5 : public range<T>, objects
|
|
{
|
|
range_construct_test5() : range<T>(60) {}
|
|
|
|
void run() const {
|
|
T x(this->values.begin(), this->values.end(), 0, hash, equal_to, allocator);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct input_range_construct_test : public range<T>, objects
|
|
{
|
|
input_range_construct_test() : range<T>(60) {}
|
|
|
|
void run() const {
|
|
T x(test::input_iterator(this->values.begin()),
|
|
test::input_iterator(this->values.end()),
|
|
0, hash, equal_to, allocator);
|
|
}
|
|
};
|
|
|
|
RUN_EXCEPTION_TESTS(
|
|
(construct_test1)(construct_test2)(construct_test3)(construct_test4)(construct_test5)(construct_test6)
|
|
(range_construct_test1)(range_construct_test2)(range_construct_test3)(range_construct_test4)(range_construct_test5)
|
|
(input_range_construct_test),
|
|
CONTAINER_SEQ)
|