1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
//
// Boost.Pointer Container
//
// Copyright Thorsten Ottosen 2003-2005. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/ptr_container/
//
#include <boost/test/unit_test.hpp>
#include "associative_test_data.hpp"
#include <boost/ptr_container/ptr_unordered_set.hpp>
template< class SetDerived, class SetBase, class T >
void test_transfer()
{
SetBase to;
SetDerived from;
from.insert( new T );
from.insert( new T );
transfer_test( from, to );
}
template< class BaseContainer, class DerivedContainer, class Derived >
void test_copy()
{
DerivedContainer derived;
derived.insert( new Derived );
derived.insert( new Derived );
BaseContainer base( derived );
BOOST_CHECK_EQUAL( derived.size(), base.size() );
base.clear();
base = derived;
BOOST_CHECK_EQUAL( derived.size(), base.size() );
base = base;
}
template< class Cont, class T >
void test_unordered_interface()
{
Cont c;
T* t = new T;
c.insert( t );
typename Cont::local_iterator i = c.begin( 0 );
typename Cont::const_local_iterator ci = i;
ci = c.cbegin( 0 );
i = c.end( 0 );
ci = c.cend( 0 );
typename Cont::size_type s = c.bucket_count();
s = c.max_bucket_count();
s = c.bucket_size( 0 );
s = c.bucket( *t );
float f = c.load_factor();
f = c.max_load_factor();
c.max_load_factor(f);
c.rehash(1000);
}
template< class PtrSet >
void test_erase()
{
PtrSet s;
typedef typename PtrSet::key_type T;
T t;
s.insert ( new T );
T* t2 = t.clone();
s.insert ( t2 );
s.insert ( new T );
BOOST_CHECK_EQUAL( s.size(), 3u );
BOOST_CHECK_EQUAL( hash_value(t), hash_value(*t2) );
BOOST_CHECK_EQUAL( t, *t2 );
typename PtrSet::iterator i = s.find( t );
BOOST_CHECK( i != s.end() );
unsigned n = s.erase( t );
BOOST_CHECK( n > 0 );
}
void test_set()
{
srand( 0 );
ptr_set_test< ptr_unordered_set<Base>, Base, Derived_class, false >();
ptr_set_test< ptr_unordered_set<Value>, Value, Value, false >();
ptr_set_test< ptr_unordered_multiset<Base>, Base, Derived_class, false >();
ptr_set_test< ptr_unordered_multiset<Value>, Value, Value, false >();
test_copy< ptr_unordered_set<Base>, ptr_unordered_set<Derived_class>,
Derived_class>();
test_copy< ptr_unordered_multiset<Base>, ptr_unordered_multiset<Derived_class>,
Derived_class>();
test_transfer< ptr_unordered_set<Derived_class>, ptr_unordered_set<Base>, Derived_class>();
test_transfer< ptr_unordered_multiset<Derived_class>, ptr_unordered_multiset<Base>, Derived_class>();
ptr_unordered_set<int> set;
BOOST_CHECK_THROW( set.insert( 0 ), bad_ptr_container_operation );
set.insert( new int(0) );
set.insert( std::auto_ptr<int>( new int(1) ) );
BOOST_CHECK_THROW( (set.replace(set.begin(), 0 )), bad_ptr_container_operation );
BOOST_CHECK_THROW( (set.replace(set.begin(), std::auto_ptr<int>(0) )), bad_ptr_container_operation );
test_unordered_interface< ptr_unordered_set<Base>, Derived_class >();
test_unordered_interface< ptr_unordered_multiset<Base>, Derived_class >();
test_erase< ptr_unordered_set<Base> >();
test_erase< ptr_unordered_multiset<Base> >();
}
using boost::unit_test::test_suite;
test_suite* init_unit_test_suite( int argc, char* argv[] )
{
test_suite* test = BOOST_TEST_SUITE( "Pointer Container Test Suite" );
test->add( BOOST_TEST_CASE( &test_set ) );
return test;
}
|
