-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathc_slice_iter.h
executable file
·191 lines (141 loc) · 4.26 KB
/
c_slice_iter.h
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
189
190
191
#ifndef CSLICE_ITER_H
#define CSLICE_ITER_H
#include <iostream>
#include <valarray>
#include <complex>
#include "allinclude.h"
using namespace std;
/*!
* @class csliceIter provides the functionality of matrix acces in the form [i][j]
* Idea B. Stroustrup
* const version of sliceIter - see slice_iter for documentation
*
*/
// forward declarations to allow friend declarations:
template<class T> class csliceIter;
template <class T> ostream& operator << (ostream& os, const csliceIter<T>& );
template<class T> bool operator == ( const csliceIter<T>&, const csliceIter<T>& );
template<class T> bool operator != ( const csliceIter<T>&, const csliceIter<T>& );
template<class T> bool operator < ( const csliceIter<T>&, const csliceIter<T>& );
template<class T> long int operator - ( const csliceIter<T>&, const csliceIter<T>& );
template<class T> long int operator + ( const csliceIter<T>&, const csliceIter<T>& );
template<class T> csliceIter<T> operator + ( const csliceIter<T>&, const size_t& );
template<class T> csliceIter<T> operator - ( const csliceIter<T>&, const size_t& );
#ifdef QDEBUG_H
template <class T> QDebug operator << (QDebug dbg, const sliceIter<T>& );
#endif
template<class T>
class csliceIter
{
valarray<T>* v;
slice s;
size_t curr; // index of current element
const T& ref ( size_t i ) const
{
return ( *v ) [s.start() + i*s.stride() ];
}
public:
csliceIter ( valarray<T>* vv, slice ss ) : v ( vv ), s ( ss ), curr ( 0 ) {}
csliceIter end() const
{
csliceIter t = *this;
t.curr = s.size(); // index of one plus last element
return t;
}
size_t size() const
{
return s.size();
}
csliceIter begin()
{
csliceIter t = *this;
t.curr = 0;
return t;
}
csliceIter& operator ++ ()
{
curr++;
return *this;
}
csliceIter operator ++ ( int )
{
csliceIter t = *this;
curr++;
return t;
}
friend csliceIter operator + ( const csliceIter<T>& p, const size_t& st )
{
csliceIter t = p;
t.curr += st;
return t;
}
friend csliceIter operator - ( const csliceIter<T>& p, const size_t& st )
{
csliceIter t = p;
t.curr -= st;
return t;
}
const T& operator [] ( size_t i ) const
{
return ref ( i );
}
/*
const T& operator ()(size_t i) const {
return ref(i);
}
*/
const T& operator * () const
{
return ref ( curr );
}
friend bool operator == <> ( const csliceIter& p, const csliceIter& q );
friend bool operator != <> ( const csliceIter& p, const csliceIter& q );
friend bool operator < <> ( const csliceIter& p, const csliceIter& q );
friend long int operator - <> ( const csliceIter& p, const csliceIter& q );
friend long int operator + <> ( const csliceIter& p, const csliceIter& q );
friend ostream& operator << <>(ostream& os, const csliceIter& si);
#ifdef QDEBUG_H
friend QDebug operator << <>(QDebug dbg, const sliceIter<T>& si);
#endif
};
template <class T> ostream& operator << (ostream& os, const csliceIter<T>& si) {
size_t i = 0;
while (i < si.size()) os << si.ref(i++) << " ";
return os;
}
template<class T>
bool operator == ( const csliceIter<T>& p, const csliceIter<T>& q )
{
return p.curr == q.curr
&& p.s.stride() == q.s.stride()
&& p.s.start() == q.s.start();
}
template<class T>
bool operator != ( const csliceIter<T>& p, const csliceIter<T>& q )
{
return ! ( p == q );
}
template<class T>
bool operator< ( const csliceIter<T>& p, const csliceIter<T>& q )
{
return p.curr < q.curr
&& p.s.stride() == q.s.stride()
&& p.s.start() == q.s.start();
}
template<class T> long int operator - ( const csliceIter<T>& p, const csliceIter<T>& q )
{
return p.curr - q.curr;
}
template<class T> long int operator + ( const csliceIter<T>& p, const csliceIter<T>& q )
{
return p.curr + q.curr;
}
//****************************** USING QT ****************************
#ifdef QDEBUG_H
template <class T> QDebug operator << (QDebug dbg, const csliceIter<T>& si) {
size_t i = 0;
while (i < si.size()) dbg.nospace() << si.ref(i++) << " ";
return dbg.space();
};
#endif
#endif