mirror of
https://github.com/boostorg/unordered.git
synced 2025-05-10 07:34:00 +00:00
61004d385e
https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r42975 | danieljames | 2008-01-26 00:29:32 +0000 (Sat, 26 Jan 2008) | 1 line Typedef some types before using them, to make life easier for Borland. ........ r43116 | danieljames | 2008-02-05 20:47:44 +0000 (Tue, 05 Feb 2008) | 1 line Some compilers and libraries combinations have problems with deques of non-assingable types. Using a list instead. ........ [SVN r43118]
82 lines
2.3 KiB
C++
82 lines
2.3 KiB
C++
|
|
// Copyright 2006-2007 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/invariants.hpp"
|
|
|
|
test::seed_t seed(12847);
|
|
|
|
template <class T>
|
|
struct self_assign_base : public test::exception_base
|
|
{
|
|
test::random_values<T> values;
|
|
self_assign_base(int count = 0) : values(count) {}
|
|
|
|
typedef T data_type;
|
|
T init() const { return T(values.begin(), values.end()); }
|
|
void run(T& x) const { x = x; }
|
|
void check(T const& x) const { test::check_equivalent_keys(x); }
|
|
};
|
|
|
|
template <class T>
|
|
struct self_assign_test1 : self_assign_base<T> {};
|
|
|
|
template <class T>
|
|
struct self_assign_test2 : self_assign_base<T>
|
|
{
|
|
self_assign_test2() : self_assign_base<T>(100) {}
|
|
};
|
|
|
|
template <class T>
|
|
struct assign_base : public test::exception_base
|
|
{
|
|
const test::random_values<T> x_values, y_values;
|
|
const T x,y;
|
|
|
|
typedef BOOST_DEDUCED_TYPENAME T::hasher hasher;
|
|
typedef BOOST_DEDUCED_TYPENAME T::key_equal key_equal;
|
|
typedef BOOST_DEDUCED_TYPENAME T::allocator_type allocator_type;
|
|
|
|
assign_base(unsigned int count1, unsigned int count2, int tag1, int tag2)
|
|
: x_values(count1), y_values(count2),
|
|
x(x_values.begin(), x_values.end(), 0, hasher(tag1), key_equal(tag1), allocator_type(tag1)),
|
|
y(y_values.begin(), y_values.end(), 0, hasher(tag2), key_equal(tag2), allocator_type(tag2)) {}
|
|
|
|
typedef T data_type;
|
|
T init() const { return T(x); }
|
|
void run(T& x1) const { x1 = y; }
|
|
void check(T const& x1) const { test::check_equivalent_keys(x1); }
|
|
};
|
|
|
|
template <class T>
|
|
struct assign_test1 : assign_base<T>
|
|
{
|
|
assign_test1() : assign_base<T>(0, 0, 0, 0) {}
|
|
};
|
|
|
|
template <class T>
|
|
struct assign_test2 : assign_base<T>
|
|
{
|
|
assign_test2() : assign_base<T>(60, 0, 0, 0) {}
|
|
};
|
|
|
|
template <class T>
|
|
struct assign_test3 : assign_base<T>
|
|
{
|
|
assign_test3() : assign_base<T>(0, 60, 0, 0) {}
|
|
};
|
|
|
|
template <class T>
|
|
struct assign_test4 : assign_base<T>
|
|
{
|
|
assign_test4() : assign_base<T>(10, 10, 1, 2) {}
|
|
};
|
|
|
|
RUN_EXCEPTION_TESTS(
|
|
(self_assign_test1)(self_assign_test2)
|
|
(assign_test1)(assign_test2)(assign_test3)(assign_test4),
|
|
CONTAINER_SEQ)
|