PATH:
opt
/
cpanel
/
ea-ruby27
/
src
/
passenger-release-6.1.2
/
src
/
cxx_supportlib
/
vendor-modified
/
boost
/
mpl
#if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_QUOTE_HPP_INCLUDED #define BOOST_MPL_QUOTE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // 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$ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include <boost/mpl/void.hpp> # include <boost/mpl/aux_/has_type.hpp> #endif #include <boost/mpl/aux_/config/bcc.hpp> #include <boost/mpl/aux_/config/ttp.hpp> #if defined(BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS) \ && !defined(BOOST_MPL_CFG_BCC590_WORKAROUNDS) # define BOOST_MPL_CFG_NO_QUOTE_TEMPLATE #endif #if !defined(BOOST_MPL_CFG_NO_IMPLICIT_METAFUNCTIONS) \ && defined(BOOST_MPL_CFG_NO_HAS_XXX) # define BOOST_MPL_CFG_NO_IMPLICIT_METAFUNCTIONS #endif #include <boost/mpl/aux_/config/use_preprocessed.hpp> #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER quote.hpp # include <boost/mpl/aux_/include_preprocessed.hpp> #else # include <boost/mpl/limits/arity.hpp> # include <boost/mpl/aux_/preprocessor/params.hpp> # include <boost/mpl/aux_/config/ctps.hpp> # include <boost/mpl/aux_/config/workaround.hpp> # include <boost/preprocessor/iterate.hpp> # include <boost/preprocessor/cat.hpp> #if !defined(BOOST_MPL_CFG_NO_QUOTE_TEMPLATE) namespace boost { namespace mpl { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename T, bool has_type_ > struct quote_impl // GCC has a problem with metafunction forwarding when T is a // specialization of a template called 'type'. # if BOOST_WORKAROUND(__GNUC__, BOOST_TESTED_AT(4)) \ && BOOST_WORKAROUND(__GNUC_MINOR__, BOOST_TESTED_AT(0)) \ && BOOST_WORKAROUND(__GNUC_PATCHLEVEL__, BOOST_TESTED_AT(2)) { typedef typename T::type type; }; # else : T { }; # endif template< typename T > struct quote_impl<T,false> { typedef T type; }; #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template< bool > struct quote_impl { template< typename T > struct result_ : T { }; }; template<> struct quote_impl<false> { template< typename T > struct result_ { typedef T type; }; }; #endif #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(1, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, <boost/mpl/quote.hpp>)) #include BOOST_PP_ITERATE() }} #endif // BOOST_MPL_CFG_NO_QUOTE_TEMPLATE #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_QUOTE_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) template< template< BOOST_MPL_PP_PARAMS(i_, typename P) > class F , typename Tag = void_ > struct BOOST_PP_CAT(quote,i_) { template< BOOST_MPL_PP_PARAMS(i_, typename U) > struct apply #if defined(BOOST_MPL_CFG_BCC590_WORKAROUNDS) { typedef typename quote_impl< F< BOOST_MPL_PP_PARAMS(i_, U) > , aux::has_type< F< BOOST_MPL_PP_PARAMS(i_, U) > >::value >::type type; }; #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) : quote_impl< F< BOOST_MPL_PP_PARAMS(i_, U) > , aux::has_type< F< BOOST_MPL_PP_PARAMS(i_, U) > >::value > { }; #else : quote_impl< aux::has_type< F< BOOST_MPL_PP_PARAMS(i_, U) > >::value > ::template result_< F< BOOST_MPL_PP_PARAMS(i_, U) > > { }; #endif }; #undef i_ #endif // BOOST_PP_IS_ITERATING
[+]
..
[-] 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]