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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/***************************************************************************
bbox.cc - Bounding boxes
-------------------
begin : Sun Jun 11 2000
copyright : (C) 2000 by Erik Schnetter
email : schnetter@astro.psu.edu
$Header: /home/eschnett/C/carpet/Carpet/Carpet/CarpetLib/src/bbox.cc,v 1.6 2001/03/27 22:26:31 eschnett Exp $
***************************************************************************/
/***************************************************************************
* *
* 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. *
* *
***************************************************************************/
#include <assert.h>
#include <iostream>
#include "defs.hh"
#include "vect.hh"
#if !defined(TMPL_IMPLICIT) || !defined(BBOX_HH)
# include "bbox.hh"
#endif
using namespace std;
// Constructors
template<class T, int D>
bbox<T,D>::bbox (): _lower(1), _upper(0), _stride(1) { }
template<class T, int D>
bbox<T,D>::bbox (const bbox& b)
: _lower(b._lower), _upper(b._upper), _stride(b._stride)
{ }
template<class T, int D>
bbox<T,D>& bbox<T,D>::operator= (const bbox& b) {
_lower=b._lower; _upper=b._upper; _stride=b._stride;
return *this;
}
template<class T, int D>
bbox<T,D>::bbox (const vect<T,D>& lower, const vect<T,D>& upper,
const vect<T,D>& stride)
: _lower(lower), _upper(upper), _stride(stride)
{
assert (all(stride>=1));
assert (all((upper-lower)%stride==0));
}
// Accessors
template<class T, int D>
T bbox<T,D>::size () const {
if (empty()) return 0;
return prod(shape());
}
template<class T, int D>
T bbox<T,D>::num_points () const {
if (empty()) return 0;
return prod((shape()+stride()-1)/stride());
}
// Queries
template<class T, int D>
bool bbox<T,D>::contains (const vect<T,D>& x) const {
return all(x>=lower() && x<=upper());
}
// Operators
template<class T, int D>
bool bbox<T,D>::operator== (const bbox& b) const {
if (empty() && b.empty()) return true;
assert (all(stride()==b.stride()));
return all(lower()==b.lower() && upper()==b.upper());
}
template<class T, int D>
bool bbox<T,D>::operator!= (const bbox& b) const {
return ! (*this == b);
}
template<class T, int D>
bool bbox<T,D>::operator< (const bbox& b) const {
// An arbitraty order: empty boxes come first, then sorted by lower
// bound, then by upper bound, then by coarseness
if (b.empty()) return false;
if (empty()) return true;
for (int d=D-1; d>=0; --d) {
if (lower()[d] < b.lower()[d]) return true;
if (lower()[d] > b.lower()[d]) return false;
}
for (int d=D-1; d>=0; --d) {
if (upper()[d] < b.upper()[d]) return true;
if (upper()[d] > b.upper()[d]) return false;
}
for (int d=D-1; d>=0; --d) {
if (stride()[d] > b.stride()[d]) return true;
if (stride()[d] < b.stride()[d]) return false;
}
return false;
}
template<class T, int D>
bool bbox<T,D>::operator> (const bbox& b) const {
return b < *this;
}
template<class T, int D>
bool bbox<T,D>::operator<= (const bbox& b) const {
return ! (b > *this);
}
template<class T, int D>
bool bbox<T,D>::operator>= (const bbox& b) const {
return b <= *this;
}
// Intersection
template<class T, int D>
bbox<T,D> bbox<T,D>::operator& (const bbox& b) const {
assert (all(stride()==b.stride()));
vect<T,D> lo = max(lower(),b.lower());
vect<T,D> up = min(upper(),b.upper());
return bbox(lo,up,stride());
}
// Containment
template<class T, int D>
bool bbox<T,D>::is_contained_in (const bbox& b) const {
// no alignment check
return all(lower()>=b.lower() && upper()<=b.upper());
}
// Alignment check
template<class T, int D>
bool bbox<T,D>::is_aligned_with (const bbox& b) const {
return all(stride()==b.stride() && (lower()-b.lower()) % stride() == 0);
}
// Expand the bbox a little by multiples of the stride
template<class T, int D>
bbox<T,D> bbox<T,D>::expand (const vect<T,D>& lo, const vect<T,D>& hi) const {
const vect<T,D> str = stride();
const vect<T,D> lb = lower() - lo * str;
const vect<T,D> ub = upper() + hi * str;
return bbox(lb,ub,str);
}
// Find the smallest b-compatible box around *this
template<class T, int D>
bbox<T,D> bbox<T,D>::expanded_for (const bbox& b) const {
const vect<T,D> str = b.stride();
const vect<T,D> loff = ((lower() - b.lower()) % str + str) % str;
const vect<T,D> uoff = ((upper() - b.lower()) % str + str) % str;
const vect<T,D> lo = lower() - loff; // go outwards
const vect<T,D> up = upper() + (str - uoff) % str;
return bbox(lo,up,str);
}
// Find the largest b-compatible box inside *this
template<class T, int D>
bbox<T,D> bbox<T,D>::contracted_for (const bbox& b) const {
const vect<T,D> str = b.stride();
const vect<T,D> loff = ((lower() - b.lower()) % str + str) % str;
const vect<T,D> uoff = ((upper() - b.lower()) % str + str) % str;
const vect<T,D> lo = lower() + (str - loff) % str; // go inwards
const vect<T,D> up = upper() - uoff;
return bbox(lo,up,str);
}
// Smallest bbox containing both boxes
template<class T, int D>
bbox<T,D> bbox<T,D>::expanded_containing (const bbox& b) const {
if (empty()) return b;
if (b.empty()) return *this;
assert (is_aligned_with(b));
const vect<T,D> lo = min(lower(), b.lower());
const vect<T,D> up = max(upper(), b.upper());
const vect<T,D> str = min(stride(), b.stride());
return bbox(lo,up,str);
}
// Iterators
template<class T, int D>
bbox<T,D>::iterator::iterator (const bbox& box, const vect<T,D>& pos)
: box(box), pos(pos) {
if (box.empty()) this->pos=box.upper()+box.stride();
}
template<class T, int D>
bool bbox<T,D>::iterator::operator!= (const iterator& i) const {
return any(pos!=i.pos);
}
template<class T, int D>
bbox<T,D>::iterator& bbox<T,D>::iterator::operator++ () {
for (int d=0; d<D; ++d) {
pos[d]+=box.stride()[d];
if (pos[d]<=box.upper()[d]) return *this;
pos[d]=box.lower()[d];
}
pos=box.end().pos;
return *this;
}
template<class T, int D>
bbox<T,D>::iterator bbox<T,D>::begin () const {
return iterator(*this, lower());
}
template<class T, int D>
bbox<T,D>::iterator bbox<T,D>::end () const {
return iterator(*this, upper()+stride());
}
// Output
template<class T,int D>
void bbox<T,D>::output (ostream& os) const {
os << "(" << lower() << ":" << upper() << ":" << stride() << ")";
}
#if defined(TMPL_EXPLICIT)
template class bbox<int,1>;
template class bbox<int,2>;
template class bbox<int,3>;
#endif
|
