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
|
//
// Boost.Pointer Container
//
// Copyright Thorsten Ottosen 2008. 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/ptr_container/ptr_inserter.hpp>
#include <boost/ptr_container/indirect_fun.hpp>
#include <boost/ptr_container/ptr_deque.hpp>
#include <boost/ptr_container/ptr_list.hpp>
#include <boost/assign/list_inserter.hpp>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/test/test_tools.hpp>
#include <algorithm>
#include <functional>
#include <string>
template< class T >
struct caster_to
{
typedef T result_type;
T operator()( void* obj ) const
{
return static_cast<T>( obj );
}
};
template< class PtrSequence >
void test_ptr_inserter_helper()
{
using namespace boost;
PtrSequence seq;
const int size = 1000;
for( int i = 0; i != size; ++i )
seq.push_back( i % 3 == 0 ? 0 : new int(i) );
PtrSequence seq2;
//
// @remark: we call .base() to avoid null pointer indirection.
// The clone_inserter will handle the nulls correctly.
//
std::copy( boost::make_transform_iterator( seq.begin().base(), caster_to<int*>() ),
boost::make_transform_iterator( seq.end().base(), caster_to<int*>() ),
ptr_container::ptr_back_inserter( seq2 ) );
std::copy( boost::make_transform_iterator( seq.begin().base(), caster_to<int*>() ),
boost::make_transform_iterator( seq.end().base(), caster_to<int*>() ),
ptr_container::ptr_front_inserter( seq2 ) );
BOOST_CHECK_EQUAL( seq.size()*2, seq2.size() );
PtrSequence seq3;
for( int i = 0; i != size; ++i )
seq3.push_back( new int(i%3) );
//
// @remark: since there are no nulls in this container, it
// is easier to handle.
//
std::copy( seq3.begin(), seq3.end(),
ptr_container::ptr_inserter( seq, seq.end() ) );
BOOST_CHECK_EQUAL( seq.size(), seq2.size() );
}
void test_ptr_inserter()
{
test_ptr_inserter_helper< boost::ptr_list< boost::nullable<int> > >();
test_ptr_inserter_helper< boost::ptr_deque< boost::nullable<int> > >();
}
#include <boost/test/unit_test.hpp>
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_ptr_inserter ) );
return test;
}
|
