2006-03-19 22:24:06 +00:00
|
|
|
|
2009-03-09 20:56:23 +00:00
|
|
|
// Copyright 2006-2009 Daniel James.
|
2006-07-01 22:31:26 +00:00
|
|
|
// 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)
|
2006-03-19 22:24:06 +00:00
|
|
|
|
|
|
|
// This test creates the containers with members that meet their minimum
|
|
|
|
// requirements. Makes sure everything compiles and is defined correctly.
|
|
|
|
|
2017-02-19 13:05:17 +00:00
|
|
|
// clang-format off
|
2009-11-26 23:15:30 +00:00
|
|
|
#include "../helpers/prefix.hpp"
|
2006-03-19 22:24:06 +00:00
|
|
|
#include <boost/unordered_set.hpp>
|
2012-04-08 15:29:15 +00:00
|
|
|
#include "../helpers/postfix.hpp"
|
2017-02-19 13:05:17 +00:00
|
|
|
// clang-format on
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
#include "../helpers/test.hpp"
|
2006-03-19 22:24:06 +00:00
|
|
|
#include "../objects/minimal.hpp"
|
|
|
|
#include "./compile_tests.hpp"
|
|
|
|
|
2008-06-15 17:03:37 +00:00
|
|
|
// Explicit instantiation to catch compile-time errors
|
2011-09-02 08:28:52 +00:00
|
|
|
|
2017-02-27 03:59:02 +00:00
|
|
|
#define INSTANTIATE(type) \
|
2017-06-11 20:55:59 +01:00
|
|
|
template class boost::unordered::detail::instantiate_##type
|
2017-02-27 03:59:02 +00:00
|
|
|
|
|
|
|
INSTANTIATE(set)<int, boost::hash<int>, std::equal_to<int>,
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::allocator<int> >;
|
2017-02-27 03:59:02 +00:00
|
|
|
INSTANTIATE(multiset)<int const, boost::hash<int>, std::equal_to<int>,
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::allocator<int> >;
|
2011-09-02 08:28:52 +00:00
|
|
|
|
2017-02-27 03:59:02 +00:00
|
|
|
INSTANTIATE(set)<test::minimal::assignable const,
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::hash<test::minimal::assignable>,
|
|
|
|
test::minimal::equal_to<test::minimal::assignable>,
|
|
|
|
test::minimal::allocator<int> >;
|
2017-02-27 03:59:02 +00:00
|
|
|
INSTANTIATE(multiset)<test::minimal::assignable,
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::hash<test::minimal::assignable>,
|
|
|
|
test::minimal::equal_to<test::minimal::assignable>,
|
|
|
|
test::minimal::allocator<int> >;
|
2008-06-15 17:03:37 +00:00
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
UNORDERED_AUTO_TEST(test0)
|
2006-03-19 22:24:06 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::constructor_param x;
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::assignable assignable(x);
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_set.\n";
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<int> int_set;
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<int, boost::hash<int>, std::equal_to<int>,
|
|
|
|
test::minimal::cxx11_allocator<int> >
|
|
|
|
int_set2;
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<test::minimal::assignable,
|
|
|
|
test::minimal::hash<test::minimal::assignable>,
|
|
|
|
test::minimal::equal_to<test::minimal::assignable>,
|
|
|
|
test::minimal::allocator<test::minimal::assignable> >
|
|
|
|
set;
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
container_test(int_set, 0);
|
|
|
|
container_test(int_set2, 0);
|
|
|
|
container_test(set, assignable);
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_multiset.\n";
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<int> int_multiset;
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<int, boost::hash<int>, std::equal_to<int>,
|
|
|
|
test::minimal::cxx11_allocator<int> >
|
|
|
|
int_multiset2;
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<test::minimal::assignable,
|
|
|
|
test::minimal::hash<test::minimal::assignable>,
|
|
|
|
test::minimal::equal_to<test::minimal::assignable>,
|
|
|
|
test::minimal::allocator<test::minimal::assignable> >
|
|
|
|
multiset;
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
container_test(int_multiset, 0);
|
|
|
|
container_test(int_multiset2, 0);
|
|
|
|
container_test(multiset, assignable);
|
2008-01-06 17:13:15 +00:00
|
|
|
}
|
|
|
|
|
2017-02-19 13:05:17 +00:00
|
|
|
UNORDERED_AUTO_TEST(equality_tests)
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
typedef test::minimal::copy_constructible_equality_comparable value_type;
|
|
|
|
|
|
|
|
boost::unordered_set<int> int_set;
|
|
|
|
|
|
|
|
boost::unordered_set<int, boost::hash<int>, std::equal_to<int>,
|
|
|
|
test::minimal::cxx11_allocator<int> >
|
|
|
|
int_set2;
|
|
|
|
|
|
|
|
boost::unordered_set<test::minimal::copy_constructible_equality_comparable,
|
|
|
|
test::minimal::hash<test::minimal::copy_constructible_equality_comparable>,
|
|
|
|
test::minimal::equal_to<
|
2017-10-05 10:54:22 +01:00
|
|
|
test::minimal::copy_constructible_equality_comparable>,
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::allocator<value_type> >
|
|
|
|
set;
|
|
|
|
|
|
|
|
equality_test(int_set);
|
|
|
|
equality_test(int_set2);
|
|
|
|
equality_test(set);
|
|
|
|
|
|
|
|
boost::unordered_multiset<int> int_multiset;
|
|
|
|
|
|
|
|
boost::unordered_multiset<int, boost::hash<int>, std::equal_to<int>,
|
|
|
|
test::minimal::cxx11_allocator<int> >
|
|
|
|
int_multiset2;
|
|
|
|
|
|
|
|
boost::unordered_multiset<
|
|
|
|
test::minimal::copy_constructible_equality_comparable,
|
|
|
|
test::minimal::hash<test::minimal::copy_constructible_equality_comparable>,
|
|
|
|
test::minimal::equal_to<
|
|
|
|
test::minimal::copy_constructible_equality_comparable>,
|
|
|
|
test::minimal::allocator<value_type> >
|
|
|
|
multiset;
|
|
|
|
|
|
|
|
equality_test(int_multiset);
|
|
|
|
equality_test(int_multiset2);
|
|
|
|
equality_test(multiset);
|
Merge in support for equality operators for the unordered containers and
hopefully better cross-platform support.
Merged revisions 44778-44835,44837-44918 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/trunk
........
r44778 | danieljames | 2008-04-26 17:15:44 +0100 (Sat, 26 Apr 2008) | 2 lines
Remove a trailing comma.
........
r44779 | danieljames | 2008-04-26 17:23:51 +0100 (Sat, 26 Apr 2008) | 1 line
Merge in support for equality operators.
........
r44780 | danieljames | 2008-04-26 17:28:44 +0100 (Sat, 26 Apr 2008) | 1 line
Use my own list container to avoid working around STL container bugs.
........
r44833 | danieljames | 2008-04-28 08:03:43 +0100 (Mon, 28 Apr 2008) | 1 line
Better equality tests.
........
r44834 | danieljames | 2008-04-28 08:04:03 +0100 (Mon, 28 Apr 2008) | 1 line
Remove a superfluous check.
........
r44835 | danieljames | 2008-04-28 08:04:21 +0100 (Mon, 28 Apr 2008) | 1 line
Add equality reference documentation.
........
r44916 | danieljames | 2008-04-30 08:16:52 +0100 (Wed, 30 Apr 2008) | 1 line
New version of list.hpp
........
r44917 | danieljames | 2008-04-30 08:18:31 +0100 (Wed, 30 Apr 2008) | 1 line
Support compilers without ADL in the compile tests.
........
r44918 | danieljames | 2008-04-30 08:25:20 +0100 (Wed, 30 Apr 2008) | 7 lines
Change the typedef of buffered functions as it was confusing MSVC 6.5
get_allocator wasn't compiling when the allocator workaround is used because it
couldn't cast from the wrapped allocator to an allocator of another type. So
use value_alloc_ when it's available (it's only unavailable on compilers with
C++0x support, which don't require the workaround).
........
[SVN r44919]
2008-04-30 07:57:04 +00:00
|
|
|
}
|
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
UNORDERED_AUTO_TEST(test1)
|
2008-01-06 17:13:15 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::hash<int> hash;
|
|
|
|
std::equal_to<int> equal_to;
|
|
|
|
int value = 0;
|
2008-01-06 17:13:15 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_set." << std::endl;
|
2008-01-06 17:13:15 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<int> set;
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<int, boost::hash<int>, std::equal_to<int>,
|
|
|
|
test::minimal::cxx11_allocator<int> >
|
|
|
|
set2;
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
unordered_unique_test(set, value);
|
|
|
|
unordered_set_test(set, value);
|
|
|
|
unordered_copyable_test(set, value, value, hash, equal_to);
|
2008-01-06 17:13:15 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
unordered_unique_test(set2, value);
|
|
|
|
unordered_set_test(set2, value);
|
|
|
|
unordered_copyable_test(set2, value, value, hash, equal_to);
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_multiset." << std::endl;
|
2008-01-06 17:13:15 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<int> multiset;
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<int, boost::hash<int>, std::equal_to<int>,
|
|
|
|
test::minimal::cxx11_allocator<int> >
|
|
|
|
multiset2;
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
unordered_equivalent_test(multiset, value);
|
|
|
|
unordered_set_test(multiset, value);
|
|
|
|
unordered_copyable_test(multiset, value, value, hash, equal_to);
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
unordered_equivalent_test(multiset2, value);
|
|
|
|
unordered_set_test(multiset2, value);
|
|
|
|
unordered_copyable_test(multiset2, value, value, hash, equal_to);
|
2008-01-06 17:13:15 +00:00
|
|
|
}
|
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
UNORDERED_AUTO_TEST(test2)
|
2008-01-06 17:13:15 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::constructor_param x;
|
|
|
|
|
|
|
|
test::minimal::assignable assignable(x);
|
|
|
|
test::minimal::copy_constructible copy_constructible(x);
|
|
|
|
test::minimal::hash<test::minimal::assignable> hash(x);
|
|
|
|
test::minimal::equal_to<test::minimal::assignable> equal_to(x);
|
|
|
|
|
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_set.\n";
|
|
|
|
|
|
|
|
boost::unordered_set<test::minimal::assignable,
|
|
|
|
test::minimal::hash<test::minimal::assignable>,
|
|
|
|
test::minimal::equal_to<test::minimal::assignable>,
|
|
|
|
test::minimal::allocator<test::minimal::assignable> >
|
|
|
|
set;
|
|
|
|
|
|
|
|
unordered_unique_test(set, assignable);
|
|
|
|
unordered_set_test(set, assignable);
|
|
|
|
unordered_copyable_test(set, assignable, assignable, hash, equal_to);
|
|
|
|
unordered_set_member_test(set, assignable);
|
|
|
|
|
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_multiset.\n";
|
|
|
|
|
|
|
|
boost::unordered_multiset<test::minimal::assignable,
|
|
|
|
test::minimal::hash<test::minimal::assignable>,
|
|
|
|
test::minimal::equal_to<test::minimal::assignable>,
|
|
|
|
test::minimal::allocator<test::minimal::assignable> >
|
|
|
|
multiset;
|
|
|
|
|
|
|
|
unordered_equivalent_test(multiset, assignable);
|
|
|
|
unordered_set_test(multiset, assignable);
|
|
|
|
unordered_copyable_test(multiset, assignable, assignable, hash, equal_to);
|
|
|
|
unordered_set_member_test(multiset, assignable);
|
2011-08-16 22:17:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
UNORDERED_AUTO_TEST(movable1_tests)
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::constructor_param x;
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::movable1 movable1(x);
|
|
|
|
test::minimal::hash<test::minimal::movable1> hash(x);
|
|
|
|
test::minimal::equal_to<test::minimal::movable1> equal_to(x);
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_set.\n";
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<test::minimal::movable1,
|
|
|
|
test::minimal::hash<test::minimal::movable1>,
|
|
|
|
test::minimal::equal_to<test::minimal::movable1>,
|
|
|
|
test::minimal::allocator<test::minimal::movable1> >
|
|
|
|
set;
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// unordered_unique_test(set, movable1);
|
|
|
|
unordered_set_test(set, movable1);
|
|
|
|
unordered_movable_test(set, movable1, movable1, hash, equal_to);
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_multiset.\n";
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<test::minimal::movable1,
|
|
|
|
test::minimal::hash<test::minimal::movable1>,
|
|
|
|
test::minimal::equal_to<test::minimal::movable1>,
|
|
|
|
test::minimal::allocator<test::minimal::movable1> >
|
|
|
|
multiset;
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// unordered_equivalent_test(multiset, movable1);
|
|
|
|
unordered_set_test(multiset, movable1);
|
|
|
|
unordered_movable_test(multiset, movable1, movable1, hash, equal_to);
|
2011-08-16 22:17:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
UNORDERED_AUTO_TEST(movable2_tests)
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::constructor_param x;
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::movable2 movable2(x);
|
|
|
|
test::minimal::hash<test::minimal::movable2> hash(x);
|
|
|
|
test::minimal::equal_to<test::minimal::movable2> equal_to(x);
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_set.\n";
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<test::minimal::movable2,
|
|
|
|
test::minimal::hash<test::minimal::movable2>,
|
|
|
|
test::minimal::equal_to<test::minimal::movable2>,
|
|
|
|
test::minimal::allocator<test::minimal::movable2> >
|
|
|
|
set;
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// unordered_unique_test(set, movable2);
|
|
|
|
unordered_set_test(set, movable2);
|
|
|
|
unordered_movable_test(set, movable2, movable2, hash, equal_to);
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_multiset.\n";
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<test::minimal::movable2,
|
|
|
|
test::minimal::hash<test::minimal::movable2>,
|
|
|
|
test::minimal::equal_to<test::minimal::movable2>,
|
|
|
|
test::minimal::allocator<test::minimal::movable2> >
|
|
|
|
multiset;
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// unordered_equivalent_test(multiset, movable2);
|
|
|
|
unordered_set_test(multiset, movable2);
|
|
|
|
unordered_movable_test(multiset, movable2, movable2, hash, equal_to);
|
2008-01-06 17:13:15 +00:00
|
|
|
}
|
|
|
|
|
2011-08-16 18:08:23 +00:00
|
|
|
UNORDERED_AUTO_TEST(destructible_tests)
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::constructor_param x;
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
test::minimal::destructible destructible(x);
|
|
|
|
test::minimal::hash<test::minimal::destructible> hash(x);
|
|
|
|
test::minimal::equal_to<test::minimal::destructible> equal_to(x);
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_set.\n";
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<test::minimal::destructible,
|
|
|
|
test::minimal::hash<test::minimal::destructible>,
|
|
|
|
test::minimal::equal_to<test::minimal::destructible> >
|
|
|
|
set;
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
unordered_destructible_test(set);
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << "Test unordered_multiset.\n";
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<test::minimal::destructible,
|
|
|
|
test::minimal::hash<test::minimal::destructible>,
|
|
|
|
test::minimal::equal_to<test::minimal::destructible> >
|
|
|
|
multiset;
|
2011-08-16 18:08:23 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
unordered_destructible_test(multiset);
|
2011-08-16 18:08:23 +00:00
|
|
|
}
|
|
|
|
|
2017-04-20 22:59:00 +01:00
|
|
|
// Test for ambiguity when using key convertible from iterator
|
|
|
|
// See LWG2059
|
|
|
|
|
|
|
|
struct lwg2059_key
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
int value;
|
2017-04-20 22:59:00 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <typename T> lwg2059_key(T v) : value(v) {}
|
2017-04-20 22:59:00 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
std::size_t hash_value(lwg2059_key x)
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
return static_cast<std::size_t>(x.value);
|
2017-04-20 22:59:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(lwg2059_key x, lwg2059_key y) { return x.value == y.value; }
|
|
|
|
|
|
|
|
UNORDERED_AUTO_TEST(lwg2059)
|
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
{
|
|
|
|
boost::unordered_set<lwg2059_key> x;
|
|
|
|
x.emplace(lwg2059_key(10));
|
|
|
|
x.erase(x.begin());
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
boost::unordered_multiset<lwg2059_key> x;
|
|
|
|
x.emplace(lwg2059_key(10));
|
|
|
|
x.erase(x.begin());
|
|
|
|
}
|
2017-04-20 22:59:00 +01:00
|
|
|
}
|
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
RUN_TESTS()
|