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]
82 lines
2.0 KiB
C++
82 lines
2.0 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 <string>
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/invariants.hpp"
|
|
#include "../helpers/strong.hpp"
|
|
|
|
#include <iostream>
|
|
|
|
test::seed_t seed(3298597);
|
|
|
|
template <class T>
|
|
struct rehash_test_base : public test::exception_base
|
|
{
|
|
test::random_values<T> values;
|
|
unsigned int n;
|
|
rehash_test_base(unsigned int count = 100, unsigned int n = 0) : values(count), n(n) {}
|
|
|
|
typedef T data_type;
|
|
typedef test::strong<T> strong_type;
|
|
|
|
data_type init() const {
|
|
T x(values.begin(), values.end(), n);
|
|
return x;
|
|
}
|
|
|
|
void check(T const& x, strong_type const& strong) const {
|
|
std::string scope(test::scope);
|
|
|
|
if(scope.find("hash::operator()") == std::string::npos &&
|
|
scope.find("equal_to::operator()") == std::string::npos &&
|
|
scope != "operator==(object, object)")
|
|
strong.test(x);
|
|
|
|
test::check_equivalent_keys(x);
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct rehash_test0 : rehash_test_base<T>
|
|
{
|
|
rehash_test0() : rehash_test_base<T>(0) {}
|
|
void run(T& x) const { x.rehash(0); }
|
|
};
|
|
|
|
template <class T>
|
|
struct rehash_test1 : rehash_test_base<T>
|
|
{
|
|
rehash_test1() : rehash_test_base<T>(0) {}
|
|
void run(T& x) const { x.rehash(200); }
|
|
};
|
|
|
|
template <class T>
|
|
struct rehash_test2 : rehash_test_base<T>
|
|
{
|
|
rehash_test2() : rehash_test_base<T>(0, 200) {}
|
|
void run(T& x) const { x.rehash(0); }
|
|
};
|
|
|
|
template <class T>
|
|
struct rehash_test3 : rehash_test_base<T>
|
|
{
|
|
rehash_test3() : rehash_test_base<T>(10, 0) {}
|
|
void run(T& x) const { x.rehash(200); }
|
|
};
|
|
|
|
template <class T>
|
|
struct rehash_test4 : rehash_test_base<T>
|
|
{
|
|
rehash_test4() : rehash_test_base<T>(10, 200) {}
|
|
void run(T& x) const { x.rehash(0); }
|
|
};
|
|
|
|
RUN_EXCEPTION_TESTS(
|
|
(rehash_test0)(rehash_test1)(rehash_test2)(rehash_test3)(rehash_test4),
|
|
CONTAINER_SEQ)
|
|
|