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

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

#ifndef BOOST_MPL_PAIR_VIEW_HPP_INCLUDED
#define BOOST_MPL_PAIR_VIEW_HPP_INCLUDED

// Copyright David Abrahams 2003-2004
// 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/begin_end.hpp>
#include <boost/mpl/iterator_category.hpp>
#include <boost/mpl/advance.hpp>
#include <boost/mpl/distance.hpp>
#include <boost/mpl/next_prior.hpp>
#include <boost/mpl/deref.hpp>
#include <boost/mpl/min_max.hpp>
#include <boost/mpl/pair.hpp>
#include <boost/mpl/iterator_tags.hpp>
#include <boost/mpl/aux_/config/ctps.hpp>
#include <boost/mpl/aux_/na_spec.hpp>

namespace boost { namespace mpl {

namespace aux {
struct pair_iter_tag;

#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)

template< typename Iter1, typename Iter2, typename Category >
struct pair_iter;

template< typename Category > struct prior_pair_iter
{
    template< typename Iter1, typename Iter2 > struct apply
    {
        typedef typename mpl::prior<Iter1>::type i1_;
        typedef typename mpl::prior<Iter2>::type i2_;
        typedef pair_iter<i1_,i2_,Category> type;
    };
};

template<> struct prior_pair_iter<forward_iterator_tag>
{
    template< typename Iter1, typename Iter2 > struct apply
    {
        typedef pair_iter<Iter1,Iter2,forward_iterator_tag> type;
    };
};

#endif
}

template< 
      typename Iter1
    , typename Iter2
    , typename Category
    >
struct pair_iter
{
    typedef aux::pair_iter_tag tag;
    typedef Category category;
    typedef Iter1 first;
    typedef Iter2 second;
    
#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
    typedef pair< 
          typename deref<Iter1>::type
        , typename deref<Iter2>::type
        > type;

typedef typename mpl::next<Iter1>::type i1_;
    typedef typename mpl::next<Iter2>::type i2_;
    typedef pair_iter<i1_,i2_,Category> next;
    
    typedef apply_wrap2< aux::prior_pair_iter<Category>,Iter1,Iter2 >::type prior;
#endif
};

#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)

template< typename Iter1, typename Iter2, typename C >
struct deref< pair_iter<Iter1,Iter2,C> >
{
    typedef pair< 
          typename deref<Iter1>::type
        , typename deref<Iter2>::type
        > type;
};

template< typename Iter1, typename Iter2, typename C >
struct next< pair_iter<Iter1,Iter2,C> >
{
    typedef typename mpl::next<Iter1>::type i1_;
    typedef typename mpl::next<Iter2>::type i2_;
    typedef pair_iter<i1_,i2_,C> type;
};

template< typename Iter1, typename Iter2, typename C >
struct prior< pair_iter<Iter1,Iter2,C> >
{
    typedef typename mpl::prior<Iter1>::type i1_;
    typedef typename mpl::prior<Iter2>::type i2_;
    typedef pair_iter<i1_,i2_,C> type;
};

#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

template<> struct advance_impl<aux::pair_iter_tag>
{
    template< typename Iter, typename D > struct apply
    {
        typedef typename mpl::advance< typename Iter::first,D >::type i1_;
        typedef typename mpl::advance< typename Iter::second,D >::type i2_;
        typedef pair_iter<i1_,i2_,typename Iter::category> type;
    };
};

template<> struct distance_impl<aux::pair_iter_tag>
{
    template< typename Iter1, typename Iter2 > struct apply
    {
        // agurt, 10/nov/04: MSVC 6.5 ICE-s on forwarding
        typedef typename mpl::distance<
              typename first<Iter1>::type
            , typename first<Iter2>::type
            >::type type;
    };
};

template<
      typename BOOST_MPL_AUX_NA_PARAM(Sequence1)
    , typename BOOST_MPL_AUX_NA_PARAM(Sequence2)
    >
struct pair_view
{
    typedef nested_begin_end_tag tag;

typedef typename begin<Sequence1>::type iter1_;
    typedef typename begin<Sequence2>::type iter2_;
    typedef typename min<
          typename iterator_category<iter1_>::type
        , typename iterator_category<iter2_>::type
        >::type category_;
    
    typedef pair_iter<iter1_,iter2_,category_> begin;
    
    typedef pair_iter<
          typename end<Sequence1>::type
        , typename end<Sequence2>::type
        , category_
        > end;
};

BOOST_MPL_AUX_NA_SPEC(2, pair_view)

}}

#endif // BOOST_MPL_PAIR_VIEW_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]