1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/*
Author: Shane Neph & Scott Kuehn
Date: Tue Aug 28 09:36:24 PDT 2007
*/
//
// BEDOPS
// Copyright (C) 2011-2022 Shane Neph, Scott Kuehn and Alex Reynolds
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
#ifndef PAIRED_ITERATOR_WRAP_HPP
#define PAIRED_ITERATOR_WRAP_HPP
#include <cstddef>
#include <iterator>
#include <utility>
namespace Ext {
namespace details {
template <class Iter>
struct number_iter; // undefined, including input/output_iterator_tag
template <>
struct number_iter<std::forward_iterator_tag> {
enum { value = 2 };
};
template <>
struct number_iter<std::bidirectional_iterator_tag> {
enum { value = 3 };
};
template <>
struct number_iter<std::random_access_iterator_tag> {
enum { value = 4 };
};
template <int I>
struct get_category; // undefined
template <>
struct get_category< number_iter<std::forward_iterator_tag>::value > {
typedef std::forward_iterator_tag iterator_category;
};
template <>
struct get_category< number_iter<std::bidirectional_iterator_tag>::value > {
typedef std::bidirectional_iterator_tag iterator_category;
};
template <>
struct get_category< number_iter<std::random_access_iterator_tag>::value > {
typedef std::random_access_iterator_tag iterator_category;
};
template <typename IterCat1, typename IterCat2>
struct lesser_category {
enum { value = (number_iter<IterCat1>::value <= number_iter<IterCat2>::value) ?
number_iter<IterCat1>::value :
number_iter<IterCat2>::value };
typedef typename get_category<value>::iterator_category iterator_category;
};
template <typename IterCat1, typename IterCat2>
struct greater_category {
enum { value = (number_iter<IterCat1>::value >= number_iter<IterCat2>::value) ?
number_iter<IterCat1>::value :
number_iter<IterCat2>::value };
typedef typename get_category<value>::iterator_category iterator_category;
};
} // details
//=================
// paired_iterator
//=================
template <typename IterType1, typename IterType2>
struct paired_iterator {
typedef typename details::lesser_category<typename IterType1::iterator_category,
typename IterType2::iterator_category>::iterator_category iterator_category;
typedef std::pair<IterType1, IterType2> value_type;
typedef std::ptrdiff_t difference_type;
typedef value_type* pointer;
typedef value_type& reference;
paired_iterator(IterType1 iter1, IterType2 iter2)
: piter_(iter1, iter2)
{ /* */ }
paired_iterator(const std::pair<IterType1, IterType2>& p)
: piter_(p.first, p.second)
{ /* */ }
paired_iterator()
: piter_()
{ /* */ }
reference operator*() { return piter_; }
pointer operator->() { return &(operator*()); }
paired_iterator& operator++() {
++piter_.first, ++piter_.second;
return(*this);
}
paired_iterator operator++(int) {
paired_iterator p = *this;
++piter_.first, ++piter_.second;
return(p);
}
IterType1 iter1() const {
return(piter_.first);
}
IterType2 iter2() const {
return(piter_.second);
}
IterType1 iter1() {
return(piter_.first);
}
IterType2 iter2() {
return(piter_.second);
}
template <typename I1, typename I2>
friend bool operator==(const paired_iterator<I1, I2>& a, const paired_iterator<I1, I2>& b) {
return(a.piter_.first == b.piter_.first && a.piter_.second == b.piter_.second);
}
template <typename I1, typename I2>
friend bool operator!=(const paired_iterator<I1, I2>& a, const paired_iterator<I1, I2>& b) {
return(!(a == b));
}
private:
std::pair<IterType1, IterType2> piter_;
};
} // namespace Ext
#endif // PAIRED_ITERATOR_WRAP_HPP
|
