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
192
193
194
195
196
197
198
199
200
201
202
203
204
|
// -*- C++ -*-
/***************************************************************************
* blitz/range.h Declaration of the Range class
*
* $Id: range.h 1414 2005-11-01 22:04:59Z cookedm $
*
* Copyright (C) 1997-2001 Todd Veldhuizen <tveldhui@oonumerics.org>
*
* This code was relicensed under the modified BSD license for use in SciPy
* by Todd Veldhuizen (see LICENSE.txt in the weave directory).
*
*
* Suggestions: blitz-dev@oonumerics.org
* Bugs: blitz-bugs@oonumerics.org
*
* For more information, please see the Blitz++ Home Page:
* http://oonumerics.org/blitz/
*
***************************************************************************/
#ifndef BZ_RANGE_H
#define BZ_RANGE_H
#ifndef BZ_BLITZ_H
#include <blitz/blitz.h>
#endif
#ifndef BZ_VECEXPRWRAP_H
#include <blitz/vecexprwrap.h> // _bz_VecExpr wrapper
#endif
#include <blitz/wrap-climits.h> // for INT_MIN
BZ_NAMESPACE(blitz)
// Examples:
// Vector<double> x(7);
// Range::all() [0,1,2,3,4,5,6]
// Range(3,5) [3,4,5]
// Range(3,Range::toEnd) [3,4,5,6]
// Range(Range::fromStart,3) [0,1,2,3]
// Range(1,5,2); [1,3,5]
enum { fromStart = INT_MIN, toEnd = INT_MIN };
// Class Range
class Range {
public:
// This declaration not yet supported by all compilers
// const int fromStart = INT_MIN;
// const int toEnd = INT_MIN;
typedef int T_numtype;
enum { fromStart = INT_MIN, toEnd = INT_MIN };
Range()
{
first_ = fromStart;
last_ = toEnd;
stride_ = 1;
}
// Range(Range r): allow default copy constructor to be used
#ifdef BZ_MANUAL_VECEXPR_COPY_CONSTRUCTOR
Range(const Range& r)
{
first_ = r.first_;
last_ = r.last_;
stride_ = r.stride_;
}
#endif
explicit Range(int slicePosition)
{
first_ = slicePosition;
last_ = slicePosition;
stride_ = 1;
}
Range(int first, int last, int stride=1)
: first_(first), last_(last), stride_(stride)
{
BZPRECHECK((first == fromStart) || (last == toEnd) ||
(first < last) && (stride > 0) ||
(first > last) && (stride < 0) ||
(first == last), (*this) << " is an invalid range.");
BZPRECHECK((last-first) % stride == 0,
(*this) << ": the stride must evenly divide the range");
}
int first(int lowRange = 0) const
{
if (first_ == fromStart)
return lowRange;
return first_;
}
int last(int highRange = 0) const
{
if (last_ == toEnd)
return highRange;
return last_;
}
unsigned length(int =0) const
{
BZPRECONDITION(first_ != fromStart);
BZPRECONDITION(last_ != toEnd);
BZPRECONDITION((last_ - first_) % stride_ == 0);
return (last_ - first_) / stride_ + 1;
}
int stride() const
{ return stride_; }
bool isAscendingContiguous() const
{
return ((first_ < last_) && (stride_ == 1) || (first_ == last_));
}
void setRange(int first, int last, int stride=1)
{
BZPRECONDITION((first < last) && (stride > 0) ||
(first > last) && (stride < 0) ||
(first == last));
BZPRECONDITION((last-first) % stride == 0);
first_ = first;
last_ = last;
stride_ = stride;
}
static Range all()
{ return Range(fromStart,toEnd,1); }
bool isUnitStride() const
{ return stride_ == 1; }
// Operators
Range operator-(int shift) const
{
BZPRECONDITION(first_ != fromStart);
BZPRECONDITION(last_ != toEnd);
return Range(first_ - shift, last_ - shift, stride_);
}
Range operator+(int shift) const
{
BZPRECONDITION(first_ != fromStart);
BZPRECONDITION(last_ != toEnd);
return Range(first_ + shift, last_ + shift, stride_);
}
int operator[](unsigned i) const
{
return first_ + i * stride_;
}
int operator()(unsigned i) const
{
return first_ + i * stride_;
}
friend inline ostream& operator<<(ostream& os, const Range& range)
{
os << "Range(" << range.first() << "," << range.last() << ","
<< range.stride() << ")";
return os;
}
/////////////////////////////////////////////
// Library-internal member functions
// These are undocumented and may change or
// disappear in future releases.
/////////////////////////////////////////////
static const int
_bz_staticLengthCount = 0,
_bz_dynamicLengthCount = 0,
_bz_staticLength = 0;
bool _bz_hasFastAccess() const
{ return stride_ == 1; }
T_numtype _bz_fastAccess(unsigned i) const
{ return first_ + i; }
unsigned _bz_suggestLength() const
{
return length();
}
_bz_VecExpr<Range> _bz_asVecExpr() const
{ return _bz_VecExpr<Range>(*this); }
private:
int first_, last_, stride_;
};
BZ_NAMESPACE_END
#endif // BZ_RANGE_H
|
