williamr@2
|
1 |
|
williamr@2
|
2 |
#ifndef BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED
|
williamr@2
|
3 |
#define BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED
|
williamr@2
|
4 |
|
williamr@2
|
5 |
// Copyright Aleksey Gurtovoy 2003-2004
|
williamr@2
|
6 |
// Copyright Eric Friedman 2003
|
williamr@2
|
7 |
//
|
williamr@2
|
8 |
// Distributed under the Boost Software License, Version 1.0.
|
williamr@2
|
9 |
// (See accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
10 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
11 |
//
|
williamr@2
|
12 |
// See http://www.boost.org/libs/mpl for documentation.
|
williamr@2
|
13 |
|
williamr@2
|
14 |
// $Source: /cvsroot/boost/boost/boost/mpl/iter_fold_if.hpp,v $
|
williamr@2
|
15 |
// $Date: 2004/09/02 15:40:41 $
|
williamr@2
|
16 |
// $Revision: 1.7 $
|
williamr@2
|
17 |
|
williamr@2
|
18 |
#include <boost/mpl/begin_end.hpp>
|
williamr@2
|
19 |
#include <boost/mpl/logical.hpp>
|
williamr@2
|
20 |
#include <boost/mpl/always.hpp>
|
williamr@2
|
21 |
#include <boost/mpl/eval_if.hpp>
|
williamr@2
|
22 |
#include <boost/mpl/if.hpp>
|
williamr@2
|
23 |
#include <boost/mpl/pair.hpp>
|
williamr@2
|
24 |
#include <boost/mpl/apply.hpp>
|
williamr@2
|
25 |
#include <boost/mpl/aux_/iter_fold_if_impl.hpp>
|
williamr@2
|
26 |
#include <boost/mpl/aux_/na_spec.hpp>
|
williamr@2
|
27 |
#include <boost/mpl/aux_/lambda_support.hpp>
|
williamr@2
|
28 |
#include <boost/mpl/aux_/config/forwarding.hpp>
|
williamr@2
|
29 |
#include <boost/mpl/aux_/config/workaround.hpp>
|
williamr@2
|
30 |
|
williamr@2
|
31 |
#include <boost/type_traits/is_same.hpp>
|
williamr@2
|
32 |
|
williamr@2
|
33 |
namespace boost { namespace mpl {
|
williamr@2
|
34 |
|
williamr@2
|
35 |
namespace aux {
|
williamr@2
|
36 |
|
williamr@2
|
37 |
template< typename Predicate, typename LastIterator >
|
williamr@2
|
38 |
struct iter_fold_if_pred
|
williamr@2
|
39 |
{
|
williamr@2
|
40 |
template< typename State, typename Iterator > struct apply
|
williamr@2
|
41 |
#if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING)
|
williamr@2
|
42 |
: and_<
|
williamr@2
|
43 |
not_< is_same<Iterator,LastIterator> >
|
williamr@2
|
44 |
, apply1<Predicate,Iterator>
|
williamr@2
|
45 |
>
|
williamr@2
|
46 |
{
|
williamr@2
|
47 |
#else
|
williamr@2
|
48 |
{
|
williamr@2
|
49 |
typedef and_<
|
williamr@2
|
50 |
not_< is_same<Iterator,LastIterator> >
|
williamr@2
|
51 |
, apply1<Predicate,Iterator>
|
williamr@2
|
52 |
> type;
|
williamr@2
|
53 |
#endif
|
williamr@2
|
54 |
};
|
williamr@2
|
55 |
};
|
williamr@2
|
56 |
|
williamr@2
|
57 |
} // namespace aux
|
williamr@2
|
58 |
|
williamr@2
|
59 |
template<
|
williamr@2
|
60 |
typename BOOST_MPL_AUX_NA_PARAM(Sequence)
|
williamr@2
|
61 |
, typename BOOST_MPL_AUX_NA_PARAM(State)
|
williamr@2
|
62 |
, typename BOOST_MPL_AUX_NA_PARAM(ForwardOp)
|
williamr@2
|
63 |
, typename BOOST_MPL_AUX_NA_PARAM(ForwardPredicate)
|
williamr@2
|
64 |
, typename BOOST_MPL_AUX_NA_PARAM(BackwardOp)
|
williamr@2
|
65 |
, typename BOOST_MPL_AUX_NA_PARAM(BackwardPredicate)
|
williamr@2
|
66 |
>
|
williamr@2
|
67 |
struct iter_fold_if
|
williamr@2
|
68 |
{
|
williamr@2
|
69 |
|
williamr@2
|
70 |
typedef typename begin<Sequence>::type first_;
|
williamr@2
|
71 |
typedef typename end<Sequence>::type last_;
|
williamr@2
|
72 |
|
williamr@2
|
73 |
typedef typename eval_if<
|
williamr@2
|
74 |
is_na<BackwardPredicate>
|
williamr@2
|
75 |
, if_< is_na<BackwardOp>, always<false_>, always<true_> >
|
williamr@2
|
76 |
, identity<BackwardPredicate>
|
williamr@2
|
77 |
>::type backward_pred_;
|
williamr@2
|
78 |
|
williamr@2
|
79 |
// cwpro8 doesn't like 'cut-off' type here (use typedef instead)
|
williamr@2
|
80 |
#if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) && !BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600))
|
williamr@2
|
81 |
struct result_ :
|
williamr@2
|
82 |
#else
|
williamr@2
|
83 |
typedef
|
williamr@2
|
84 |
#endif
|
williamr@2
|
85 |
aux::iter_fold_if_impl<
|
williamr@2
|
86 |
first_
|
williamr@2
|
87 |
, State
|
williamr@2
|
88 |
, ForwardOp
|
williamr@2
|
89 |
, protect< aux::iter_fold_if_pred< ForwardPredicate,last_ > >
|
williamr@2
|
90 |
, BackwardOp
|
williamr@2
|
91 |
, backward_pred_
|
williamr@2
|
92 |
>
|
williamr@2
|
93 |
#if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) && !BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600))
|
williamr@2
|
94 |
{ };
|
williamr@2
|
95 |
#else
|
williamr@2
|
96 |
result_;
|
williamr@2
|
97 |
#endif
|
williamr@2
|
98 |
|
williamr@2
|
99 |
public:
|
williamr@2
|
100 |
|
williamr@2
|
101 |
typedef pair<
|
williamr@2
|
102 |
typename result_::state
|
williamr@2
|
103 |
, typename result_::iterator
|
williamr@2
|
104 |
> type;
|
williamr@2
|
105 |
|
williamr@2
|
106 |
BOOST_MPL_AUX_LAMBDA_SUPPORT(
|
williamr@2
|
107 |
6
|
williamr@2
|
108 |
, iter_fold_if
|
williamr@2
|
109 |
, (Sequence,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate)
|
williamr@2
|
110 |
)
|
williamr@2
|
111 |
};
|
williamr@2
|
112 |
|
williamr@2
|
113 |
BOOST_MPL_AUX_NA_SPEC(6, iter_fold_if)
|
williamr@2
|
114 |
|
williamr@2
|
115 |
}}
|
williamr@2
|
116 |
|
williamr@2
|
117 |
#endif // BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED
|