williamr@2
|
1 |
|
williamr@2
|
2 |
#ifndef BOOST_MPL_PAIR_VIEW_HPP_INCLUDED
|
williamr@2
|
3 |
#define BOOST_MPL_PAIR_VIEW_HPP_INCLUDED
|
williamr@2
|
4 |
|
williamr@2
|
5 |
// Copyright David Abrahams 2003-2004
|
williamr@2
|
6 |
// Copyright Aleksey Gurtovoy 2004
|
williamr@2
|
7 |
//
|
williamr@2
|
8 |
// Distributed under the Boost Software License, Version 1.0.
|
williamr@2
|
9 |
// (See accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
10 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
11 |
//
|
williamr@2
|
12 |
// See http://www.boost.org/libs/mpl for documentation.
|
williamr@2
|
13 |
|
williamr@2
|
14 |
// $Source: /cvsroot/boost/boost/boost/mpl/pair_view.hpp,v $
|
williamr@2
|
15 |
// $Date: 2004/11/28 01:56:21 $
|
williamr@2
|
16 |
// $Revision: 1.5 $
|
williamr@2
|
17 |
|
williamr@2
|
18 |
#include <boost/mpl/begin_end.hpp>
|
williamr@2
|
19 |
#include <boost/mpl/iterator_category.hpp>
|
williamr@2
|
20 |
#include <boost/mpl/advance.hpp>
|
williamr@2
|
21 |
#include <boost/mpl/distance.hpp>
|
williamr@2
|
22 |
#include <boost/mpl/next_prior.hpp>
|
williamr@2
|
23 |
#include <boost/mpl/deref.hpp>
|
williamr@2
|
24 |
#include <boost/mpl/min_max.hpp>
|
williamr@2
|
25 |
#include <boost/mpl/pair.hpp>
|
williamr@2
|
26 |
#include <boost/mpl/iterator_tags.hpp>
|
williamr@2
|
27 |
#include <boost/mpl/aux_/config/ctps.hpp>
|
williamr@2
|
28 |
#include <boost/mpl/aux_/na_spec.hpp>
|
williamr@2
|
29 |
|
williamr@2
|
30 |
namespace boost { namespace mpl {
|
williamr@2
|
31 |
|
williamr@2
|
32 |
namespace aux {
|
williamr@2
|
33 |
struct pair_iter_tag;
|
williamr@2
|
34 |
|
williamr@2
|
35 |
#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
|
williamr@2
|
36 |
|
williamr@2
|
37 |
template< typename Iter1, typename Iter2, typename Category >
|
williamr@2
|
38 |
struct pair_iter;
|
williamr@2
|
39 |
|
williamr@2
|
40 |
template< typename Category > struct prior_pair_iter
|
williamr@2
|
41 |
{
|
williamr@2
|
42 |
template< typename Iter1, typename Iter2 > struct apply
|
williamr@2
|
43 |
{
|
williamr@2
|
44 |
typedef typename mpl::prior<Iter1>::type i1_;
|
williamr@2
|
45 |
typedef typename mpl::prior<Iter2>::type i2_;
|
williamr@2
|
46 |
typedef pair_iter<i1_,i2_,Category> type;
|
williamr@2
|
47 |
};
|
williamr@2
|
48 |
};
|
williamr@2
|
49 |
|
williamr@2
|
50 |
template<> struct prior_pair_iter<forward_iterator_tag>
|
williamr@2
|
51 |
{
|
williamr@2
|
52 |
template< typename Iter1, typename Iter2 > struct apply
|
williamr@2
|
53 |
{
|
williamr@2
|
54 |
typedef pair_iter<Iter1,Iter2,forward_iterator_tag> type;
|
williamr@2
|
55 |
};
|
williamr@2
|
56 |
};
|
williamr@2
|
57 |
|
williamr@2
|
58 |
#endif
|
williamr@2
|
59 |
}
|
williamr@2
|
60 |
|
williamr@2
|
61 |
template<
|
williamr@2
|
62 |
typename Iter1
|
williamr@2
|
63 |
, typename Iter2
|
williamr@2
|
64 |
, typename Category
|
williamr@2
|
65 |
>
|
williamr@2
|
66 |
struct pair_iter
|
williamr@2
|
67 |
{
|
williamr@2
|
68 |
typedef aux::pair_iter_tag tag;
|
williamr@2
|
69 |
typedef Category category;
|
williamr@2
|
70 |
typedef Iter1 first;
|
williamr@2
|
71 |
typedef Iter2 second;
|
williamr@2
|
72 |
|
williamr@2
|
73 |
#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
|
williamr@2
|
74 |
typedef pair<
|
williamr@2
|
75 |
typename deref<Iter1>::type
|
williamr@2
|
76 |
, typename deref<Iter2>::type
|
williamr@2
|
77 |
> type;
|
williamr@2
|
78 |
|
williamr@2
|
79 |
typedef typename mpl::next<Iter1>::type i1_;
|
williamr@2
|
80 |
typedef typename mpl::next<Iter2>::type i2_;
|
williamr@2
|
81 |
typedef pair_iter<i1_,i2_,Category> next;
|
williamr@2
|
82 |
|
williamr@2
|
83 |
typedef apply_wrap2< aux::prior_pair_iter<Category>,Iter1,Iter2 >::type prior;
|
williamr@2
|
84 |
#endif
|
williamr@2
|
85 |
};
|
williamr@2
|
86 |
|
williamr@2
|
87 |
|
williamr@2
|
88 |
#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
|
williamr@2
|
89 |
|
williamr@2
|
90 |
template< typename Iter1, typename Iter2, typename C >
|
williamr@2
|
91 |
struct deref< pair_iter<Iter1,Iter2,C> >
|
williamr@2
|
92 |
{
|
williamr@2
|
93 |
typedef pair<
|
williamr@2
|
94 |
typename deref<Iter1>::type
|
williamr@2
|
95 |
, typename deref<Iter2>::type
|
williamr@2
|
96 |
> type;
|
williamr@2
|
97 |
};
|
williamr@2
|
98 |
|
williamr@2
|
99 |
template< typename Iter1, typename Iter2, typename C >
|
williamr@2
|
100 |
struct next< pair_iter<Iter1,Iter2,C> >
|
williamr@2
|
101 |
{
|
williamr@2
|
102 |
typedef typename mpl::next<Iter1>::type i1_;
|
williamr@2
|
103 |
typedef typename mpl::next<Iter2>::type i2_;
|
williamr@2
|
104 |
typedef pair_iter<i1_,i2_,C> type;
|
williamr@2
|
105 |
};
|
williamr@2
|
106 |
|
williamr@2
|
107 |
template< typename Iter1, typename Iter2, typename C >
|
williamr@2
|
108 |
struct prior< pair_iter<Iter1,Iter2,C> >
|
williamr@2
|
109 |
{
|
williamr@2
|
110 |
typedef typename mpl::prior<Iter1>::type i1_;
|
williamr@2
|
111 |
typedef typename mpl::prior<Iter2>::type i2_;
|
williamr@2
|
112 |
typedef pair_iter<i1_,i2_,C> type;
|
williamr@2
|
113 |
};
|
williamr@2
|
114 |
|
williamr@2
|
115 |
#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
williamr@2
|
116 |
|
williamr@2
|
117 |
|
williamr@2
|
118 |
template<> struct advance_impl<aux::pair_iter_tag>
|
williamr@2
|
119 |
{
|
williamr@2
|
120 |
template< typename Iter, typename D > struct apply
|
williamr@2
|
121 |
{
|
williamr@2
|
122 |
typedef typename mpl::advance< typename Iter::first,D >::type i1_;
|
williamr@2
|
123 |
typedef typename mpl::advance< typename Iter::second,D >::type i2_;
|
williamr@2
|
124 |
typedef pair_iter<i1_,i2_,typename Iter::category> type;
|
williamr@2
|
125 |
};
|
williamr@2
|
126 |
};
|
williamr@2
|
127 |
|
williamr@2
|
128 |
template<> struct distance_impl<aux::pair_iter_tag>
|
williamr@2
|
129 |
{
|
williamr@2
|
130 |
template< typename Iter1, typename Iter2 > struct apply
|
williamr@2
|
131 |
{
|
williamr@2
|
132 |
// agurt, 10/nov/04: MSVC 6.5 ICE-s on forwarding
|
williamr@2
|
133 |
typedef typename mpl::distance<
|
williamr@2
|
134 |
typename first<Iter1>::type
|
williamr@2
|
135 |
, typename first<Iter2>::type
|
williamr@2
|
136 |
>::type type;
|
williamr@2
|
137 |
};
|
williamr@2
|
138 |
};
|
williamr@2
|
139 |
|
williamr@2
|
140 |
|
williamr@2
|
141 |
template<
|
williamr@2
|
142 |
typename BOOST_MPL_AUX_NA_PARAM(Sequence1)
|
williamr@2
|
143 |
, typename BOOST_MPL_AUX_NA_PARAM(Sequence2)
|
williamr@2
|
144 |
>
|
williamr@2
|
145 |
struct pair_view
|
williamr@2
|
146 |
{
|
williamr@2
|
147 |
typedef nested_begin_end_tag tag;
|
williamr@2
|
148 |
|
williamr@2
|
149 |
typedef typename begin<Sequence1>::type iter1_;
|
williamr@2
|
150 |
typedef typename begin<Sequence2>::type iter2_;
|
williamr@2
|
151 |
typedef typename min<
|
williamr@2
|
152 |
typename iterator_category<iter1_>::type
|
williamr@2
|
153 |
, typename iterator_category<iter2_>::type
|
williamr@2
|
154 |
>::type category_;
|
williamr@2
|
155 |
|
williamr@2
|
156 |
typedef pair_iter<iter1_,iter2_,category_> begin;
|
williamr@2
|
157 |
|
williamr@2
|
158 |
typedef pair_iter<
|
williamr@2
|
159 |
typename end<Sequence1>::type
|
williamr@2
|
160 |
, typename end<Sequence2>::type
|
williamr@2
|
161 |
, category_
|
williamr@2
|
162 |
> end;
|
williamr@2
|
163 |
};
|
williamr@2
|
164 |
|
williamr@2
|
165 |
BOOST_MPL_AUX_NA_SPEC(2, pair_view)
|
williamr@2
|
166 |
|
williamr@2
|
167 |
}}
|
williamr@2
|
168 |
|
williamr@2
|
169 |
#endif // BOOST_MPL_PAIR_VIEW_HPP_INCLUDED
|