ꦫꦣꦺꦤ꧀ꦄꦤ꧀ꦠꦱꦺꦤ

PATH: opt / cpanel / ea-ruby27 / src / passenger-release-6.1.2 / src / cxx_supportlib / vendor-modified / boost / mpl

#ifndef BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED
#define BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED

// Copyright Aleksey Gurtovoy 2003-2004
// Copyright Eric Friedman 2003
//
// 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/begin_end.hpp>
#include <boost/mpl/logical.hpp>
#include <boost/mpl/always.hpp>
#include <boost/mpl/eval_if.hpp>
#include <boost/mpl/if.hpp>
#include <boost/mpl/pair.hpp>
#include <boost/mpl/apply.hpp>
#include <boost/mpl/aux_/iter_fold_if_impl.hpp>
#include <boost/mpl/aux_/na_spec.hpp>
#include <boost/mpl/aux_/lambda_support.hpp>
#include <boost/mpl/aux_/config/forwarding.hpp>
#include <boost/mpl/aux_/config/workaround.hpp>

#include <boost/type_traits/is_same.hpp>

namespace boost { namespace mpl {

namespace aux {

template< typename Predicate, typename LastIterator >
struct iter_fold_if_pred
{
    template< typename State, typename Iterator > struct apply
#if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING)
        : and_<
              not_< is_same<Iterator,LastIterator> >
            , apply1<Predicate,Iterator>
            >
    {
#else
    {
        typedef and_<
              not_< is_same<Iterator,LastIterator> >
            , apply1<Predicate,Iterator>
            > type;
#endif
    };
};

} // namespace aux

template<
      typename BOOST_MPL_AUX_NA_PARAM(Sequence)
    , typename BOOST_MPL_AUX_NA_PARAM(State)
    , typename BOOST_MPL_AUX_NA_PARAM(ForwardOp)
    , typename BOOST_MPL_AUX_NA_PARAM(ForwardPredicate)
    , typename BOOST_MPL_AUX_NA_PARAM(BackwardOp)
    , typename BOOST_MPL_AUX_NA_PARAM(BackwardPredicate)
    >
struct iter_fold_if
{

typedef typename begin<Sequence>::type first_;
    typedef typename end<Sequence>::type last_;

typedef typename eval_if<
          is_na<BackwardPredicate>
        , if_< is_na<BackwardOp>, always<false_>, always<true_> >
        , identity<BackwardPredicate>
        >::type backward_pred_;

// cwpro8 doesn't like 'cut-off' type here (use typedef instead)
#if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) && !BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600))
    struct result_ :
#else
    typedef
#endif
        aux::iter_fold_if_impl<
          first_
        , State
        , ForwardOp
        , protect< aux::iter_fold_if_pred< ForwardPredicate,last_ > >
        , BackwardOp
        , backward_pred_
        >
#if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) && !BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600))
    { };
#else
    result_;
#endif

public:

typedef pair<
          typename result_::state
        , typename result_::iterator
        > type;

BOOST_MPL_AUX_LAMBDA_SUPPORT(
          6
        , iter_fold_if
        , (Sequence,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate)
        )
};

BOOST_MPL_AUX_NA_SPEC(6, iter_fold_if)

}}

#endif // BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED

[+] ..
[-] contains_fwd.hpp [edit]
[-] sort.hpp [edit]
[-] erase_key_fwd.hpp [edit]
[-] end.hpp [edit]
[-] less_equal.hpp [edit]
[-] tag.hpp [edit]
[-] max_element.hpp [edit]
[-] integral_c_tag.hpp [edit]
[-] is_placeholder.hpp [edit]
[-] long_fwd.hpp [edit]
[-] pop_back.hpp [edit]
[-] remove.hpp [edit]
[-] empty.hpp [edit]
[-] order_fwd.hpp [edit]
[-] char_fwd.hpp [edit]
[-] map.hpp [edit]
[-] logical.hpp [edit]
[-] eval_if.hpp [edit]
[-] insert_fwd.hpp [edit]
[-] greater.hpp [edit]
[-] greater_equal.hpp [edit]
[-] push_back.hpp [edit]
[-] find_if.hpp [edit]
[-] minus.hpp [edit]
[-] bitor.hpp [edit]
[-] size_t_fwd.hpp [edit]
[-] not_equal_to.hpp [edit]
[-] vector.hpp [edit]
[-] assert.hpp [edit]
[-] string.hpp [edit]
[+] vector
[-] sizeof.hpp [edit]
[-] at.hpp [edit]
[-] inherit_linearly.hpp [edit]
[-] min_element.hpp [edit]
[-] iterator_category.hpp [edit]
[-] pair_view.hpp [edit]
[-] sequence_tag_fwd.hpp [edit]
[-] distance.hpp [edit]
[-] arithmetic.hpp [edit]
[-] erase.hpp [edit]
[-] alias.hpp [edit]
[-] arg_fwd.hpp [edit]
[-] same_as.hpp [edit]
[-] arg.hpp [edit]
[-] min.hpp [edit]
[-] get_tag.hpp [edit]
[-] bitwise.hpp [edit]
[-] lambda.hpp [edit]
[-] count_fwd.hpp [edit]
[-] equal_to.hpp [edit]
[-] single_view.hpp [edit]
[-] find.hpp [edit]
[-] apply_fwd.hpp [edit]
[-] remove_if.hpp [edit]
[-] sequence_tag.hpp [edit]
[-] value_type_fwd.hpp [edit]
[-] pop_front_fwd.hpp [edit]
[-] contains.hpp [edit]
[-] begin.hpp [edit]
[-] insert_range.hpp [edit]
[-] bool.hpp [edit]
[-] replace.hpp [edit]
[-] if.hpp [edit]
[-] size_fwd.hpp [edit]
[-] bool_fwd.hpp [edit]
[-] reverse_iter_fold.hpp [edit]
[-] has_xxx.hpp [edit]
[-] fold.hpp [edit]
[-] clear.hpp [edit]
[-] long.hpp [edit]
[-] back.hpp [edit]
[+] list
[-] copy.hpp [edit]
[+] multiset
[-] lambda_fwd.hpp [edit]
[-] unpack_args.hpp [edit]
[-] clear_fwd.hpp [edit]
[-] iter_fold.hpp [edit]
[-] index_of.hpp [edit]
[-] order.hpp [edit]
[-] joint_view.hpp [edit]
[-] set.hpp [edit]
[-] count.hpp [edit]
[-] times.hpp [edit]
[-] is_sequence.hpp [edit]
[-] divides.hpp [edit]
[-] key_type.hpp [edit]
[-] pair.hpp [edit]
[-] upper_bound.hpp [edit]
[-] back_inserter.hpp [edit]
[-] range_c.hpp [edit]
[-] placeholders.hpp [edit]
[-] base.hpp [edit]
[-] unique.hpp [edit]
[+] map
[-] reverse.hpp [edit]
[-] front.hpp [edit]
[-] index_if.hpp [edit]
[-] prior.hpp [edit]
[-] stable_partition.hpp [edit]
[-] bitand.hpp [edit]
[+] math
[-] partition.hpp [edit]
[-] numeric_cast.hpp [edit]
[-] has_key.hpp [edit]
[-] iterator_tags.hpp [edit]
[-] vector_c.hpp [edit]
[-] print.hpp [edit]
[-] equal.hpp [edit]
[-] void.hpp [edit]
[-] deref.hpp [edit]
[-] or.hpp [edit]
[-] bind.hpp [edit]
[+] set
[-] quote.hpp [edit]
[-] list.hpp [edit]
[-] apply.hpp [edit]
[-] int_fwd.hpp [edit]
[-] transform_view.hpp [edit]
[-] next.hpp [edit]
[-] pop_back_fwd.hpp [edit]
[-] key_type_fwd.hpp [edit]
[-] has_key_fwd.hpp [edit]
[-] iter_fold_if.hpp [edit]
[-] count_if.hpp [edit]
[-] inherit.hpp [edit]
[-] less.hpp [edit]
[-] max.hpp [edit]
[-] begin_end.hpp [edit]
[-] negate.hpp [edit]
[-] at_fwd.hpp [edit]
[-] transform.hpp [edit]
[-] modulus.hpp [edit]
[-] min_max.hpp [edit]
[-] bitxor.hpp [edit]
[-] size.hpp [edit]
[-] front_inserter.hpp [edit]
[-] empty_fwd.hpp [edit]
[-] deque.hpp [edit]
[-] int.hpp [edit]
[-] next_prior.hpp [edit]
[-] protect.hpp [edit]
[-] always.hpp [edit]
[-] advance.hpp [edit]
[-] comparison.hpp [edit]
[-] copy_if.hpp [edit]
[-] begin_end_fwd.hpp [edit]
[-] inserter.hpp [edit]
[-] iterator_range.hpp [edit]
[-] erase_fwd.hpp [edit]
[-] zip_view.hpp [edit]
[-] bind_fwd.hpp [edit]
[-] value_type.hpp [edit]
[-] empty_base.hpp [edit]
[-] advance_fwd.hpp [edit]
[-] plus.hpp [edit]
[+] limits
[-] set_c.hpp [edit]
[-] char.hpp [edit]
[-] reverse_fold.hpp [edit]
[-] shift_left.hpp [edit]
[-] empty_sequence.hpp [edit]
[-] insert_range_fwd.hpp [edit]
[-] O1_size_fwd.hpp [edit]
[-] push_front_fwd.hpp [edit]
[-] replace_if.hpp [edit]
[-] front_fwd.hpp [edit]
[-] for_each.hpp [edit]
[+] aux_
[-] distance_fwd.hpp [edit]
[-] erase_key.hpp [edit]
[-] size_t.hpp [edit]
[-] accumulate.hpp [edit]
[-] list_c.hpp [edit]
[-] integral_c_fwd.hpp [edit]
[-] apply_wrap.hpp [edit]
[-] identity.hpp [edit]
[-] multiplies.hpp [edit]
[-] insert.hpp [edit]
[-] integral_c.hpp [edit]
[-] and.hpp [edit]
[-] pop_front.hpp [edit]
[-] O1_size.hpp [edit]
[-] not.hpp [edit]
[-] void_fwd.hpp [edit]
[-] switch.hpp [edit]
[-] push_back_fwd.hpp [edit]
[-] as_sequence.hpp [edit]
[-] back_fwd.hpp [edit]
[-] shift_right.hpp [edit]
[-] lower_bound.hpp [edit]
[-] filter_view.hpp [edit]
[-] push_front.hpp [edit]