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

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

#ifndef BOOST_MPL_AUX_SINGLE_ELEMENT_ITER_HPP_INCLUDED
#define BOOST_MPL_AUX_SINGLE_ELEMENT_ITER_HPP_INCLUDED

// Copyright Aleksey Gurtovoy 2000-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/iterator_tags.hpp>
#include <boost/mpl/advance_fwd.hpp>
#include <boost/mpl/distance_fwd.hpp>
#include <boost/mpl/next_prior.hpp>
#include <boost/mpl/deref.hpp>
#include <boost/mpl/int.hpp>
#include <boost/mpl/aux_/nttp_decl.hpp>
#include <boost/mpl/aux_/value_wknd.hpp>
#include <boost/mpl/aux_/config/ctps.hpp>

namespace boost { namespace mpl {

#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)

namespace aux {

template< typename T, BOOST_MPL_AUX_NTTP_DECL(int, is_last_) >
struct sel_iter;

template< typename T >
struct sel_iter<T,0>
{
    typedef random_access_iterator_tag category;
    typedef sel_iter<T,1> next;
    typedef T type;
};

template< typename T >
struct sel_iter<T,1>
{
    typedef random_access_iterator_tag category;
    typedef sel_iter<T,0> prior;
};

} // namespace aux

template< typename T, BOOST_MPL_AUX_NTTP_DECL(int, is_last_), typename Distance >
struct advance< aux::sel_iter<T,is_last_>,Distance>
{
    typedef aux::sel_iter<
          T
        , ( is_last_ + BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Distance) )
        > type;
};

template< 
      typename T
    , BOOST_MPL_AUX_NTTP_DECL(int, l1)
    , BOOST_MPL_AUX_NTTP_DECL(int, l2) 
    >
struct distance< aux::sel_iter<T,l1>, aux::sel_iter<T,l2> >
    : int_<( l2 - l1 )>
{
};

#else

namespace aux {

struct sel_iter_tag;

template< typename T, BOOST_MPL_AUX_NTTP_DECL(int, is_last_) >
struct sel_iter
{
    enum { pos_ = is_last_ };
    typedef aux::sel_iter_tag tag;
    typedef random_access_iterator_tag category;

typedef sel_iter<T,(is_last_ + 1)> next;
    typedef sel_iter<T,(is_last_ - 1)> prior;
    typedef T type;
};

} // namespace aux

template<> struct advance_impl<aux::sel_iter_tag>
{
    template< typename Iterator, typename N > struct apply
    {
        enum { pos_ = Iterator::pos_, n_ = N::value };
        typedef aux::sel_iter<
              typename Iterator::type
            , (pos_ + n_)
            > type;
    };
};

template<> struct distance_impl<aux::sel_iter_tag>
{
    template< typename Iter1, typename Iter2 > struct apply
    {
        enum { pos1_ = Iter1::pos_, pos2_ = Iter2::pos_ };
        typedef int_<( pos2_ - pos1_ )> type;
        BOOST_STATIC_CONSTANT(int, value = ( pos2_ - pos1_ ));
    };
};

#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

}}

#endif // BOOST_MPL_AUX_SINGLE_ELEMENT_ITER_HPP_INCLUDED

[-] pop_back_impl.hpp [edit]
[-] logical_op.hpp [edit]
[+] preprocessed
[-] shift_op.hpp [edit]
[-] erase_impl.hpp [edit]
[-] iter_fold_if_impl.hpp [edit]
[+] preprocessor
[-] pop_front_impl.hpp [edit]
[-] contains_impl.hpp [edit]
[-] lambda_no_ctps.hpp [edit]
[-] has_type.hpp [edit]
[-] template_arity_fwd.hpp [edit]
[-] basic_bind.hpp [edit]
[-] msvc_never_true.hpp [edit]
[-] iter_apply.hpp [edit]
[-] numeric_op.hpp [edit]
[-] push_back_impl.hpp [edit]
[-] fold_pred.hpp [edit]
[-] adl_barrier.hpp [edit]
[-] push_front_impl.hpp [edit]
[+] test
[-] fold_impl_body.hpp [edit]
[-] joint_iter.hpp [edit]
[-] size_impl.hpp [edit]
[-] traits_lambda_spec.hpp [edit]
[-] advance_backward.hpp [edit]
[-] transform_iter.hpp [edit]
[-] has_size.hpp [edit]
[-] na.hpp [edit]
[+] config
[-] has_tag.hpp [edit]
[-] apply_1st.hpp [edit]
[-] iter_fold_impl.hpp [edit]
[-] has_rebind.hpp [edit]
[-] na_assert.hpp [edit]
[-] nested_type_wknd.hpp [edit]
[-] iter_push_front.hpp [edit]
[-] begin_end_impl.hpp [edit]
[-] empty_impl.hpp [edit]
[-] ptr_to_ref.hpp [edit]
[-] static_cast.hpp [edit]
[-] single_element_iter.hpp [edit]
[-] count_impl.hpp [edit]
[-] front_impl.hpp [edit]
[-] reverse_iter_fold_impl.hpp [edit]
[-] at_impl.hpp [edit]
[+] ..
[-] lambda_support.hpp [edit]
[-] has_apply.hpp [edit]
[-] arithmetic_op.hpp [edit]
[-] insert_impl.hpp [edit]
[-] advance_forward.hpp [edit]
[-] O1_size_impl.hpp [edit]
[-] reverse_fold_impl.hpp [edit]
[-] arg_typedef.hpp [edit]
[-] na_spec.hpp [edit]
[-] filter_iter.hpp [edit]
[-] arity_spec.hpp [edit]
[-] count_args.hpp [edit]
[-] include_preprocessed.hpp [edit]
[-] fold_impl.hpp [edit]
[-] is_msvc_eti_arg.hpp [edit]
[-] na_fwd.hpp [edit]
[-] msvc_is_class.hpp [edit]
[-] find_if_pred.hpp [edit]
[-] unwrap.hpp [edit]
[-] order_impl.hpp [edit]
[-] fold_op.hpp [edit]
[-] common_name_wknd.hpp [edit]
[-] sequence_wrapper.hpp [edit]
[-] value_wknd.hpp [edit]
[-] template_arity.hpp [edit]
[-] full_lambda.hpp [edit]
[-] largest_int.hpp [edit]
[-] test.hpp [edit]
[-] msvc_eti_base.hpp [edit]
[-] numeric_cast_utils.hpp [edit]
[-] has_key_impl.hpp [edit]
[-] integral_wrapper.hpp [edit]
[-] clear_impl.hpp [edit]
[-] lambda_arity_param.hpp [edit]
[+] range_c
[-] inserter_algorithm.hpp [edit]
[-] arity.hpp [edit]
[-] reverse_fold_impl_body.hpp [edit]
[-] erase_key_impl.hpp [edit]
[-] lambda_spec.hpp [edit]
[-] sort_impl.hpp [edit]
[-] has_begin.hpp [edit]
[-] msvc_dtw.hpp [edit]
[-] comparison_op.hpp [edit]
[-] insert_range_impl.hpp [edit]
[-] overload_names.hpp [edit]
[-] partition_op.hpp [edit]
[-] msvc_type.hpp [edit]
[-] nttp_decl.hpp [edit]
[-] type_wrapper.hpp [edit]
[-] back_impl.hpp [edit]
[-] yes_no.hpp [edit]