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
|
#ifndef BOOST_MPL_STABLE_PARTITION_HPP_INCLUDED
#define BOOST_MPL_STABLE_PARTITION_HPP_INCLUDED
// Copyright Eric Friedman 2002-2003
// Copyright Aleksey Gurtovoy 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/fold.hpp>
#include <boost/mpl/reverse_fold.hpp>
#include <boost/mpl/protect.hpp>
#include <boost/mpl/aux_/partition_op.hpp>
#include <boost/mpl/aux_/inserter_algorithm.hpp>
#include <boost/mpl/aux_/na.hpp>
namespace boost { namespace mpl {
namespace aux {
template <
typename Sequence
, typename Pred
, typename In
, typename In2
, typename In1 = typename if_na<In,In2>::type
>
struct stable_partition_impl
: fold<
Sequence
, pair< typename In1::state, typename In2::state >
, protect< partition_op<
Pred
, typename In1::operation
, typename In2::operation
> >
>
{
};
template <
typename Sequence
, typename Pred
, typename In
, typename In2
, typename In1 = typename if_na<In,In2>::type
>
struct reverse_stable_partition_impl
: reverse_fold<
Sequence
, pair< typename In1::state, typename In2::state >
, protect< partition_op<
Pred
, typename In1::operation
, typename In2::operation
> >
>
{
};
} // namespace aux
BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(4, stable_partition)
}}
#endif // BOOST_MPL_STABLE_PARTITION_HPP_INCLUDED
|
