2 // Copyright Aleksey Gurtovoy 2000-2004
\r
4 // Distributed under the Boost Software License, Version 1.0.
\r
5 // (See accompanying file LICENSE_1_0.txt or copy at
\r
6 // http://www.boost.org/LICENSE_1_0.txt)
\r
9 // Preprocessed version of "boost/mpl/aux_/reverse_iter_fold_impl.hpp" header
\r
10 // -- DO NOT modify by hand!
\r
12 namespace boost { namespace mpl { namespace aux {
\r
14 /// forward declaration
\r
21 , typename BackwardOp
\r
22 , typename ForwardOp
\r
24 struct reverse_iter_fold_impl;
\r
30 , typename BackwardOp
\r
31 , typename ForwardOp
\r
33 struct reverse_iter_fold_impl< 0,First,Last,State,BackwardOp,ForwardOp >
\r
35 typedef First iter0;
\r
36 typedef State fwd_state0;
\r
37 typedef fwd_state0 bkwd_state0;
\r
38 typedef bkwd_state0 state;
\r
39 typedef iter0 iterator;
\r
46 , typename BackwardOp
\r
47 , typename ForwardOp
\r
49 struct reverse_iter_fold_impl< 1,First,Last,State,BackwardOp,ForwardOp >
\r
51 typedef First iter0;
\r
52 typedef State fwd_state0;
\r
53 typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1;
\r
54 typedef typename mpl::next<iter0>::type iter1;
\r
57 typedef fwd_state1 bkwd_state1;
\r
58 typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0;
\r
59 typedef bkwd_state0 state;
\r
60 typedef iter1 iterator;
\r
67 , typename BackwardOp
\r
68 , typename ForwardOp
\r
70 struct reverse_iter_fold_impl< 2,First,Last,State,BackwardOp,ForwardOp >
\r
72 typedef First iter0;
\r
73 typedef State fwd_state0;
\r
74 typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1;
\r
75 typedef typename mpl::next<iter0>::type iter1;
\r
76 typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2;
\r
77 typedef typename mpl::next<iter1>::type iter2;
\r
80 typedef fwd_state2 bkwd_state2;
\r
81 typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1;
\r
82 typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0;
\r
85 typedef bkwd_state0 state;
\r
86 typedef iter2 iterator;
\r
93 , typename BackwardOp
\r
94 , typename ForwardOp
\r
96 struct reverse_iter_fold_impl< 3,First,Last,State,BackwardOp,ForwardOp >
\r
98 typedef First iter0;
\r
99 typedef State fwd_state0;
\r
100 typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1;
\r
101 typedef typename mpl::next<iter0>::type iter1;
\r
102 typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2;
\r
103 typedef typename mpl::next<iter1>::type iter2;
\r
104 typedef typename apply2< ForwardOp,fwd_state2,iter2 >::type fwd_state3;
\r
105 typedef typename mpl::next<iter2>::type iter3;
\r
108 typedef fwd_state3 bkwd_state3;
\r
109 typedef typename apply2< BackwardOp,bkwd_state3,iter2 >::type bkwd_state2;
\r
110 typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1;
\r
111 typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0;
\r
114 typedef bkwd_state0 state;
\r
115 typedef iter3 iterator;
\r
122 , typename BackwardOp
\r
123 , typename ForwardOp
\r
125 struct reverse_iter_fold_impl< 4,First,Last,State,BackwardOp,ForwardOp >
\r
127 typedef First iter0;
\r
128 typedef State fwd_state0;
\r
129 typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1;
\r
130 typedef typename mpl::next<iter0>::type iter1;
\r
131 typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2;
\r
132 typedef typename mpl::next<iter1>::type iter2;
\r
133 typedef typename apply2< ForwardOp,fwd_state2,iter2 >::type fwd_state3;
\r
134 typedef typename mpl::next<iter2>::type iter3;
\r
135 typedef typename apply2< ForwardOp,fwd_state3,iter3 >::type fwd_state4;
\r
136 typedef typename mpl::next<iter3>::type iter4;
\r
139 typedef fwd_state4 bkwd_state4;
\r
140 typedef typename apply2< BackwardOp,bkwd_state4,iter3 >::type bkwd_state3;
\r
141 typedef typename apply2< BackwardOp,bkwd_state3,iter2 >::type bkwd_state2;
\r
142 typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1;
\r
143 typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0;
\r
146 typedef bkwd_state0 state;
\r
147 typedef iter4 iterator;
\r
155 , typename BackwardOp
\r
156 , typename ForwardOp
\r
158 struct reverse_iter_fold_impl
\r
160 typedef First iter0;
\r
161 typedef State fwd_state0;
\r
162 typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1;
\r
163 typedef typename mpl::next<iter0>::type iter1;
\r
164 typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2;
\r
165 typedef typename mpl::next<iter1>::type iter2;
\r
166 typedef typename apply2< ForwardOp,fwd_state2,iter2 >::type fwd_state3;
\r
167 typedef typename mpl::next<iter2>::type iter3;
\r
168 typedef typename apply2< ForwardOp,fwd_state3,iter3 >::type fwd_state4;
\r
169 typedef typename mpl::next<iter3>::type iter4;
\r
172 typedef reverse_iter_fold_impl<
\r
173 ( (N - 4) < 0 ? 0 : N - 4 )
\r
181 typedef typename nested_chunk::state bkwd_state4;
\r
182 typedef typename apply2< BackwardOp,bkwd_state4,iter3 >::type bkwd_state3;
\r
183 typedef typename apply2< BackwardOp,bkwd_state3,iter2 >::type bkwd_state2;
\r
184 typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1;
\r
185 typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0;
\r
188 typedef bkwd_state0 state;
\r
189 typedef typename nested_chunk::iterator iterator;
\r
196 , typename BackwardOp
\r
197 , typename ForwardOp
\r
199 struct reverse_iter_fold_impl< -1,First,Last,State,BackwardOp,ForwardOp >
\r
201 typedef reverse_iter_fold_impl<
\r
203 , typename mpl::next<First>::type
\r
205 , typename apply2< ForwardOp,State,First >::type
\r
210 typedef typename apply2<
\r
212 , typename nested_step::state
\r
216 typedef typename nested_step::iterator iterator;
\r
222 , typename BackwardOp
\r
223 , typename ForwardOp
\r
225 struct reverse_iter_fold_impl< -1,Last,Last,State,BackwardOp,ForwardOp >
\r
227 typedef State state;
\r
228 typedef Last iterator;
\r