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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/*
Copyright (C) 2000, 2001, 2002 RiskMap srl
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it under the
terms of the QuantLib license. You should have received a copy of the
license along with this program; if not, please email ferdinando@ametrano.net
The license is also available online at http://quantlib.org/html/license.html
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 license for more details.
*/
/*! \file filteringiterator.hpp
\brief Iterator filtering undesired data
\fullpath
ql/Utilities/%filteringiterator.hpp
*/
// $Id: filteringiterator.hpp,v 1.4 2002/01/16 14:40:56 nando Exp $
#ifndef quantlib_filtering_iterator_h
#define quantlib_filtering_iterator_h
#include <iterator>
namespace QuantLib {
namespace Utilities {
template <class IteratorTag>
struct filtering_iterator_tag {
typedef IteratorTag iterator_category;
};
template <>
struct filtering_iterator_tag<std::random_access_iterator_tag> {
typedef std::bidirectional_iterator_tag iterator_category;
};
//! Iterator filtering undesired data
/*! This iterator advances an underlying iterator
returning only those data satisfying a given
condition.
*/
template <class Iterator, class UnaryPredicate>
class filtering_iterator : public QL_ITERATOR<
typename filtering_iterator_tag<
typename QL_ITERATOR_TRAITS<Iterator>::iterator_category
>::iterator_category,
typename QL_ITERATOR_TRAITS<Iterator>::value_type,
typename QL_ITERATOR_TRAITS<Iterator>::difference_type,
typename QL_ITERATOR_TRAITS<Iterator>::pointer,
typename QL_ITERATOR_TRAITS<Iterator>::reference>
{
public:
/* These typedefs are needed even though inherited from QL_ITERATOR
(see 14.6.2.3 of the standard). */
typedef typename QL_ITERATOR_TRAITS<Iterator>::pointer
pointer;
typedef typename QL_ITERATOR_TRAITS<Iterator>::reference
reference;
filtering_iterator(const Iterator&, const UnaryPredicate&,
const Iterator& beforeBegin, const Iterator& end);
//! \name Dereferencing
//@{
reference operator*() const;
pointer operator->() const;
//@}
//! \name Increment and decrement
//@{
filtering_iterator& operator++();
filtering_iterator operator++(int );
filtering_iterator& operator--();
filtering_iterator operator--(int );
//@}
//! \name Comparisons
//@{
bool operator==(const filtering_iterator<Iterator,UnaryPredicate>&);
bool operator!=(const filtering_iterator<Iterator,UnaryPredicate>&);
//@}
private:
UnaryPredicate p_;
Iterator it_;
Iterator beforeBegin_, end_;
};
//! helper function to create filtering iterators
/*! \relates filtering_iterator */
template <class Iterator, class UnaryPredicate>
filtering_iterator<Iterator,UnaryPredicate>
make_filtering_iterator(Iterator it, UnaryPredicate p,
Iterator beforeBegin, Iterator end);
// inline definitions
template<class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>::filtering_iterator(
const Iterator& it, const UnaryPredicate& p,
const Iterator& beforeBegin, const Iterator& end)
: p_(p), it_(it), beforeBegin_(beforeBegin), end_(end) {
while (!p_(*it_) && it_ != end_)
++it_;
}
template<class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>&
filtering_iterator<Iterator,UnaryPredicate>::operator++() {
do
++it_;
while (!p_(*it_) && it_ != end_);
return *this;
}
template<class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>
filtering_iterator<Iterator,UnaryPredicate>::operator++(int ) {
filtering_iterator<Iterator,UnaryPredicate> temp = *this;
do
++it_;
while (!p_(*it_) && it_ != end_);
return temp;
}
template<class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>&
filtering_iterator<Iterator,UnaryPredicate>::operator--() {
do
--it_;
while (!p_(*it_) && it_ != beforeBegin_);
return *this;
}
template<class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>
filtering_iterator<Iterator,UnaryPredicate>::operator--(int ) {
filtering_iterator<Iterator,UnaryPredicate> temp = *this;
do
--it_;
while (!p_(*it_) && it_ != beforeBegin_);
return temp;
}
template<class Iterator, class UnaryPredicate>
inline typename filtering_iterator<Iterator,UnaryPredicate>::reference
filtering_iterator<Iterator,UnaryPredicate>::operator*() const {
return *it_;
}
template<class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>::pointer
filtering_iterator<Iterator,UnaryPredicate>::operator->() const {
return it_.operator->();
}
template<class Iterator, class UnaryPredicate>
inline bool filtering_iterator<Iterator,UnaryPredicate>::operator==(
const filtering_iterator<Iterator,UnaryPredicate>& i) {
return (it_ == i.it_);
}
template<class Iterator, class UnaryPredicate>
inline bool filtering_iterator<Iterator,UnaryPredicate>::operator!=(
const filtering_iterator<Iterator,UnaryPredicate>& i) {
return (it_ != i.it_);
}
template <class Iterator, class UnaryPredicate>
inline filtering_iterator<Iterator,UnaryPredicate>
make_filtering_iterator(Iterator it, UnaryPredicate p,
Iterator beforeBegin, Iterator end) {
return filtering_iterator<Iterator,UnaryPredicate>(
it,p,beforeBegin,end);
}
}
}
#endif
|
