-
Notifications
You must be signed in to change notification settings - Fork 0
/
find_index.hpp
255 lines (204 loc) · 5.58 KB
/
find_index.hpp
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
/*
This file is part of QSL Squasher.
Copyright (C) 2014-2019 Svetlin Tassev
Harvard-Smithsonian Center for Astrophysics
Braintree High School
QSL Squasher 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 3 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, see <http://www.gnu.org/licenses/>.
*/
VEX_FUNCTION(cl_ushort4, find_index, (double, x)(double, y)(double,z)(cl_double4*, ff)(cl_ushort4*, ff_lookup),
/*
* Finds the index in the B arrays where the point {x,y,z} is located.
*/
DEFS();
double xmin=ff[0].s0;
double xmax=ff[nx-1].s0;
double ymin=ff[0].s1;
double ymax=ff[ny-1].s1;
double zmin=ff[0].s2;
double zmax=ff[nz-1].s2;
// Check for out-of-range values
ushort a=1;
#ifdef PERIODIC_XY
x=fmod(x-ff[0].s0+ff[nx-1].s0-ff[0].s0,ff[nx-1].s0-ff[0].s0)+ff[0].s0;
y=fmod(y-ff[0].s1+ff[ny-1].s1-ff[0].s1,ff[ny-1].s1-ff[0].s1)+ff[0].s1;
#else
#ifndef GLOBAL_MODEL
if (x<=xmin) {
x=xmin+1.e-4;
a=0;
}
if (x>=xmax) {
x=xmax-1.e-4;
a=0;
}
#else
x=fmod((x+M_PI*2.0000001-xmin),(2.*M_PI))+xmin;
#endif
#ifdef GLOBAL_MODEL
if (fabs(y)>1.5706)
a=0;
#endif
if (y<=ymin) {
y=ymin+1.e-4;
#ifndef GLOBAL_MODEL
a=0;
#endif
}
if (y>=ymax) {
y=ymax-1.e-4;
#ifndef GLOBAL_MODEL
a=0;
#endif
}
#endif
if (z<=z_minimum) {
z=z_minimum+1.e-4;
a=0;
}
if (z>=zmax) {
z=zmax-1.e-4;
a=0;
}
ushort i;
ushort j;
ushort k;
//Guess the index by using lookup tables
//i =(x-ff[0].s0)/(ff[1].s0-ff[0].s0)+0.5;
//j =(y-ff[0].s1)/(ff[1].s1-ff[0].s1)+0.5;
//k =(z-ff[0].s2)/(ff[1].s2-ff[0].s2)+0.5;
ushort ix=((x-xmin)/(xmax-xmin))*((double)nmax)+0.5;
ushort iy=((y-ymin)/(ymax-ymin))*((double)nmax)+0.5;
ushort iz=((z-zmin)/(zmax-zmin))*((double)nmax)+0.5;
if (ix>nmax) ix=nmax-1;
if (iy>nmax) iy=nmax-1;
if (iz>nmax) iz=nmax-1;
i=ff_lookup[ix].s0;
j=ff_lookup[iy].s1;
k=ff_lookup[iz].s2;
//Don't want to overshoot:
if (i>nx-2) i=nx-2;
if (j>ny-2) j=ny-2;
if (k>nz-2) k=nz-2;
//Starting with the guess above, find the exact index location
#ifdef GLOBAL_MODEL
while ((i<=nx-1) && (ff[i].s0<x))i++;
#else
while ((i<nx-1) && (ff[i].s0<x))i++;
#endif
while ((j<ny-1) && (ff[j].s1<y))j++;
while ((k<nz-1) && (ff[k].s2<z))k++;
while ((i>=0) && (ff[i].s0>x))i--;
while ((j>=0) && (ff[j].s1>y))j--;
while ((k>=0) && (ff[k].s2>z))k--;
#ifdef GLOBAL_MODEL
if (x>=ff[nx-1].s0) i=nx-1;
#endif
ushort4 ind={i,j,k,a};
return ind;
);
#if CALCULATE!=QSL
VEX_FUNCTION(cl_ushort4, find_indexMid, (double, x)(double, y)(double,z)(cl_double4*, ff)(cl_ushort4*, ff_lookup),
/*
* Finds the index in the B arrays where the point {x,y,z} is located.
*/
DEFS();
double xmin=ff[0].s0;
double xmax=ff[nx-2].s0;
double ymin=ff[0].s1;
double ymax=ff[ny-2].s1;
double zmin=ff[0].s2;
double zmax=ff[nz-2].s2;
// Check for out-of-range values
ushort a=1;
#ifdef PERIODIC_XY
x=fmod(x-ff[0].s0+ff[nx-2].s0-ff[0].s0,ff[nx-2].s0-ff[0].s0)+ff[0].s0;
y=fmod(y-ff[0].s1+ff[ny-2].s1-ff[0].s1,ff[ny-2].s1-ff[0].s1)+ff[0].s1;
#else
#ifndef GLOBAL_MODEL
if (x<=xmin) {
x=xmin+1.e-4;
a=0;
}
if (x>=xmax) {
x=xmax-1.e-4;
a=0;
}
#else
x=fmod((x+M_PI*2.0000001-xmin),(2.*M_PI))+xmin;
#endif
#ifdef GLOBAL_MODEL
if (fabs(y)>1.5706)
a=0;
#endif
if (y<=ymin) {
y=ymin+1.e-4;
#ifndef GLOBAL_MODEL
a=0;
#endif
}
if (y>=ymax) {
y=ymax-1.e-4;
#ifndef GLOBAL_MODEL
a=0;
#endif
}
#endif
if (z<=z_minimum) {
z=z_minimum+1.e-4;
a=0;
}
if (z<=zmin) {
z=zmin+1.e-4;
a=0;
}
if (z>=zmax) {
z=zmax-1.e-4;
a=0;
}
ushort i;
ushort j;
ushort k;
//Guess the index by using lookup tables
//i =(x-ff[0].s0)/(ff[1].s0-ff[0].s0)+0.5;
//j =(y-ff[0].s1)/(ff[1].s1-ff[0].s1)+0.5;
//k =(z-ff[0].s2)/(ff[1].s2-ff[0].s2)+0.5;
ushort ix=((x-xmin)/(xmax-xmin))*((double)nmax)+0.5;
ushort iy=((y-ymin)/(ymax-ymin))*((double)nmax)+0.5;
ushort iz=((z-zmin)/(zmax-zmin))*((double)nmax)+0.5;
if (ix>nmax) ix=nmax-1;
if (iy>nmax) iy=nmax-1;
if (iz>nmax) iz=nmax-1;
i=ff_lookup[ix].s0;
j=ff_lookup[iy].s1;
k=ff_lookup[iz].s2;
//Don't want to overshoot:
if (i>nx-3) i=nx-3;
if (j>ny-3) j=ny-3;
if (k>nz-3) k=nz-3;
//Starting with the guess above, find the exact index location
#ifdef GLOBAL_MODEL
while ((i<=nx-2) && (ff[i].s0<x))i++;
#else
while ((i<nx-2) && (ff[i].s0<x))i++;
#endif
while ((j<ny-2) && (ff[j].s1<y))j++;
while ((k<nz-2) && (ff[k].s2<z))k++;
while ((i>=0) && (ff[i].s0>x))i--;
while ((j>=0) && (ff[j].s1>y))j--;
while ((k>=0) && (ff[k].s2>z))k--;
#ifdef GLOBAL_MODEL
if (x>=ff[nx-2].s0) i=nx-2;
#endif
ushort4 ind={i,j,k,a};
return ind;
);
#endif