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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
// Copyright Aleksey Gurtovoy 2000-2004
// Copyright David Abrahams 2003-2004
//
// 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)
//
// See http://www.boost.org/libs/mpl for documentation.
// $Id$
// $Date$
// $Revision$
#include <boost/mpl/copy.hpp>
#include <boost/mpl/vector/vector20_c.hpp>
#include <boost/mpl/vector/vector0.hpp>
#include <boost/mpl/range_c.hpp>
#include <boost/mpl/front_inserter.hpp>
#include <boost/mpl/size.hpp>
#include <boost/mpl/equal.hpp>
#include <boost/mpl/less.hpp>
#include <boost/mpl/begin_end_fwd.hpp>
#include <boost/mpl/size_fwd.hpp>
#include <boost/mpl/empty_fwd.hpp>
#include <boost/mpl/front_fwd.hpp>
#include <boost/mpl/insert_fwd.hpp>
#include <boost/mpl/insert_range_fwd.hpp>
#include <boost/mpl/erase_fwd.hpp>
#include <boost/mpl/clear_fwd.hpp>
#include <boost/mpl/push_back_fwd.hpp>
#include <boost/mpl/pop_back_fwd.hpp>
#include <boost/mpl/back_fwd.hpp>
#include <boost/mpl/aux_/test.hpp>
MPL_TEST_CASE()
{
typedef vector10_c<int,9,8,7,6,5,4,3,2,1,0> answer;
typedef copy<
range_c<int,0,10>
, mpl::front_inserter< vector0<> >
>::type result;
MPL_ASSERT_RELATION( size<result>::value, ==, 10 );
MPL_ASSERT(( equal< result,answer > ));
}
MPL_TEST_CASE()
{
typedef vector10_c<int,10,11,12,13,14,15,16,17,18,19> numbers;
typedef reverse_copy<
range_c<int,0,10>
, mpl::front_inserter<numbers>
>::type result;
MPL_ASSERT_RELATION( size<result>::value, ==, 20 );
MPL_ASSERT(( equal< result,range_c<int,0,20> > ));
}
struct push_back_only_tag {};
template< typename Seq >
struct push_back_only
{
typedef push_back_only_tag tag;
typedef Seq seq;
};
namespace boost { namespace mpl {
template<>
struct begin_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: begin< typename Seq::seq >
{
};
};
template<>
struct end_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: end< typename Seq::seq >
{
};
};
template<>
struct size_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: size< typename Seq::seq >
{
};
};
template<>
struct empty_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: empty< typename Seq::seq >
{
};
};
template<>
struct front_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: front< typename Seq::seq >
{
};
};
template<>
struct insert_impl< ::push_back_only_tag >
{
template< typename Seq, typename Pos, typename X > struct apply
{
typedef ::push_back_only<
typename insert< typename Seq::seq, Pos, X >::type
> type;
};
};
template<>
struct insert_range_impl< ::push_back_only_tag >
{
template< typename Seq, typename Pos, typename X > struct apply
{
typedef ::push_back_only<
typename insert_range< typename Seq::seq, Pos, X >::type
> type;
};
};
template<>
struct erase_impl< ::push_back_only_tag >
{
template< typename Seq, typename Iter1, typename Iter2 > struct apply
{
typedef ::push_back_only<
typename erase< typename Seq::seq, Iter1, Iter2 >::type
> type;
};
};
template<>
struct clear_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
{
typedef ::push_back_only<
typename clear< typename Seq::seq >::type
> type;
};
};
template<>
struct push_back_impl< ::push_back_only_tag >
{
template< typename Seq, typename X > struct apply
{
typedef ::push_back_only<
typename push_back< typename Seq::seq, X >::type
> type;
};
};
template<>
struct pop_back_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
{
typedef ::push_back_only<
typename pop_back< typename Seq::seq >::type
> type;
};
};
template<>
struct back_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: back< typename Seq::seq >
{
};
};
template<>
struct has_push_back_impl< ::push_back_only_tag >
{
template< typename Seq > struct apply
: less< size<Seq>,int_<10> >
{
};
};
}}
MPL_TEST_CASE()
{
typedef vector10_c<int,0,1,2,3,4,5,6,7,8,9> numbers;
typedef copy< push_back_only< numbers > >::type result;
MPL_ASSERT((equal< numbers, result >));
}
|
