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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
//
// 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 "test_data.hpp"
#include <boost/ptr_container/ptr_array.hpp>
#include <boost/utility.hpp>
#include <boost/array.hpp>
#include <algorithm>
#include <iostream>
#include <cstddef>
#include <string>
using namespace std;
using namespace boost;
template< class Node, size_t N >
class n_ary_tree : boost::noncopyable
{
typedef n_ary_tree<Node,N> this_type;
typedef ptr_array<this_type,N> tree_t;
tree_t tree;
Node data;
public:
n_ary_tree() { }
n_ary_tree( const Node& r ) : data(r) { }
public: // modifers
void set_data( const Node& r ) { data = r; }
template< size_t idx >
void set_child( this_type* r ) { tree. BOOST_NESTED_TEMPLATE replace<idx>(r); }
public: // accessors
void print( std::ostream&, std::string indent = " " );
template< size_t idx >
this_type& child() { return tree. BOOST_NESTED_TEMPLATE at<idx>(); }
template< size_t idx >
const this_type& child() const { return tree. BOOST_NESTED_TEMPLATE at<idx>(); }
};
template< class Node, size_t N >
void n_ary_tree<Node,N>::print( std::ostream& out, std::string indent )
{
out << indent << data << "\n";
indent += " ";
for( size_t i = 0; i != N; ++i )
if( !tree.is_null(i) )
tree[i].print( out, indent + " " );
}
template< class C, class B, class T >
void test_array_interface();
void test_array()
{
typedef n_ary_tree<std::string,2> binary_tree;
binary_tree tree;
tree.set_data( "root" );
tree.set_child<0>( new binary_tree( "left subtree" ) );
tree.set_child<1>( new binary_tree( "right subtree" ) );
binary_tree& left = tree.child<0>();
left.set_child<0>( new binary_tree( "left left subtree" ) );
left.set_child<1>( new binary_tree( "left right subtree" ) );
binary_tree& right = tree.child<1>();
right.set_child<0>( new binary_tree( "right left subtree" ) );
right.set_child<1>( new binary_tree( "right right subtree" ) );
tree.print( std::cout );
test_array_interface<ptr_array<Base,10>,Base,Derived_class>();
test_array_interface<ptr_array<nullable<Base>,10>,Base,Derived_class>();
test_array_interface<ptr_array<Value,10>,Value,Value>();
test_array_interface<ptr_array<nullable<Value>,10>,Value,Value>();
ptr_array<int,10> vec;
BOOST_CHECK_THROW( vec.at(10), bad_ptr_container_operation );
BOOST_CHECK_THROW( (vec.replace(10u, new int(0))), bad_ptr_container_operation );
BOOST_CHECK_THROW( (vec.replace(10u, std::auto_ptr<int>(new int(0)))), bad_ptr_container_operation );
BOOST_CHECK_THROW( (vec.replace(0u, 0)), bad_ptr_container_operation );
}
template< class C, class B, class T >
void test_array_interface()
{
C c;
c.replace( 0, new T );
c.replace( 1, new B );
c.replace( 9, new T );
c.replace( 0, std::auto_ptr<T>( new T ) );
const C c2( c.clone() );
BOOST_DEDUCED_TYPENAME C::iterator i = c.begin();
BOOST_DEDUCED_TYPENAME C::const_iterator ci = c2.begin();
BOOST_DEDUCED_TYPENAME C::iterator i2 = c.end();
BOOST_DEDUCED_TYPENAME C::const_iterator ci2 = c2.begin();
BOOST_DEDUCED_TYPENAME C::reverse_iterator ri = c.rbegin();
BOOST_DEDUCED_TYPENAME C::const_reverse_iterator cri = c2.rbegin();
BOOST_DEDUCED_TYPENAME C::reverse_iterator rv2 = c.rend();
BOOST_DEDUCED_TYPENAME C::const_reverse_iterator cvr2 = c2.rend();
BOOST_MESSAGE( "finished iterator test" );
BOOST_CHECK_EQUAL( c.empty(), false );
BOOST_CHECK_EQUAL( c.size(), c.max_size() );
BOOST_MESSAGE( "finished capacity test" );
BOOST_CHECK_EQUAL( c.is_null(0), false );
BOOST_CHECK_EQUAL( c.is_null(1), false );
BOOST_CHECK_EQUAL( c.is_null(2), true );
c.front();
c.back();
c2.front();
c2.back();
C c3;
c.swap( c3 );
C c4;
swap(c4,c3);
c3.swap(c4);
BOOST_CHECK_EQUAL( c.is_null(0), true );
BOOST_CHECK_EQUAL( c3.is_null(0), false );
c.replace( 5, new T );
BOOST_CHECK_EQUAL( c.is_null(5), false );
c = c3.release();
for( size_t i = 0; i < c3.size(); ++i )
BOOST_CHECK_EQUAL( c3.is_null(i), true );
BOOST_MESSAGE( "finished element access test" );
}
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_array ) );
return test;
}
|
