-
Notifications
You must be signed in to change notification settings - Fork 0
/
binning.F90
341 lines (261 loc) · 11.8 KB
/
binning.F90
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
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
module binning
! This module does binning
! It must be passed ALLOCATABLE arrays
! Binning occurs along the array axes which ARE preserved
! i.e. pass an array of shape (-31:32) and binning happens over
! the range -31:32 (roughly)
implicit none
interface square_binning
module procedure d_square_binning
module procedure d_square_binning1D
module procedure d_square_binning2D
module procedure d_square_binning3D
end interface square_binning
interface triangle_binning
module procedure d_triangle_binning
module procedure d_triangle_binning1D
module procedure d_triangle_binning2D
module procedure d_triangle_binning3D
end interface triangle_binning
contains
subroutine d_square_binning(x, y, Nbins, counts, bin_avg, bin_centres)
double precision, allocatable, intent(in) :: x(:)
double precision, allocatable, intent(in) :: y(:)
integer, intent(in) :: Nbins
integer, intent(out) :: counts(0:Nbins)
double precision, intent(out) :: bin_avg(0:Nbins)
double precision, intent(out) :: bin_centres(0:Nbins)
integer :: i, bin_slot
integer :: Ndata
Ndata = size(x)
counts = 0
bin_avg = 0.d0
bin_centres = 0.d0
do i=1,Ndata
bin_slot = floor(x(i))
counts(bin_slot) = counts(bin_slot) + 1
bin_avg(bin_slot) = bin_avg(bin_slot) + y(i)
bin_centres(bin_slot) = bin_centres(bin_slot) + x(i)
end do
where (counts /= 0)
bin_avg = bin_avg / dble(counts)
bin_centres = bin_centres / dble(counts)
end where
return
end subroutine d_square_binning
subroutine d_square_binning1D(y, Nbins, counts, bin_avg, bin_centres)
double precision, allocatable, intent(in) :: y(:)
integer, intent(in) :: Nbins
integer, intent(out) :: counts(0:Nbins)
double precision, intent(out) :: bin_avg(0:Nbins)
double precision, intent(out) :: bin_centres(0:Nbins)
integer :: i, bin_slot
integer :: ylbound(1), yubound(1)
ylbound = lbound(y)
yubound = ubound(y)
counts = 0
bin_avg = 0.d0
bin_centres = 0.d0
do i=ylbound(1),yubound(1)
bin_slot = abs(i)
counts(bin_slot) = counts(bin_slot) + 1
bin_avg(bin_slot) = bin_avg(bin_slot) + y(i)
bin_centres(bin_slot) = bin_centres(bin_slot) + dble(bin_slot)
end do
where (counts /= 0)
bin_avg = bin_avg / dble(counts)
bin_centres = bin_centres / dble(counts)
end where
return
end subroutine d_square_binning1D
subroutine d_square_binning2D(y, Nbins, counts, bin_avg, bin_centres)
double precision, allocatable, intent(in) :: y(:,:)
integer, intent(in) :: Nbins
integer, intent(out) :: counts(0:Nbins)
double precision, intent(out) :: bin_avg(0:Nbins)
double precision, intent(out) :: bin_centres(0:Nbins)
integer :: i, j, bin_slot
integer :: ylbound(2), yubound(2)
double precision :: x, jsqd
ylbound = lbound(y)
yubound = ubound(y)
counts = 0
bin_avg = 0.d0
bin_centres = 0.d0
do j=ylbound(2),yubound(2)
jsqd = dble(j**2)
do i=ylbound(1),yubound(1)
x = sqrt(dble(i**2) + jsqd)
bin_slot = floor(x)
counts(bin_slot) = counts(bin_slot) + 1
bin_avg(bin_slot) = bin_avg(bin_slot) + y(i,j)
bin_centres(bin_slot) = bin_centres(bin_slot) + x
end do
end do
where (counts /= 0)
bin_avg = bin_avg / dble(counts)
bin_centres = bin_centres / dble(counts)
end where
return
end subroutine d_square_binning2D
subroutine d_square_binning3D(y, Nbins, counts, bin_avg, bin_centres)
double precision, allocatable, intent(in) :: y(:,:,:)
integer, intent(in) :: Nbins
integer, intent(out) :: counts(0:Nbins)
double precision, intent(out) :: bin_avg(0:Nbins)
double precision, intent(out) :: bin_centres(0:Nbins)
integer :: i, j, k, bin_slot
integer :: ylbound(3), yubound(3)
double precision :: x, jsqd, ksqd
ylbound = lbound(y)
yubound = ubound(y)
counts = 0
bin_avg = 0.d0
bin_centres = 0.d0
do k=ylbound(3),yubound(3)
ksqd = dble(k**2)
do j=ylbound(2),yubound(2)
jsqd = dble(j**2)
do i=ylbound(1),yubound(1)
x = sqrt(dble(i**2) + jsqd + ksqd)
bin_slot = floor(x)
counts(bin_slot) = counts(bin_slot) + 1
bin_avg(bin_slot) = bin_avg(bin_slot) + y(i,j,k)
bin_centres(bin_slot) = bin_centres(bin_slot) + x
end do
end do
end do
where (counts /= 0)
bin_avg = bin_avg / dble(counts)
bin_centres = bin_centres / dble(counts)
end where
return
end subroutine d_square_binning3D
subroutine d_triangle_binning(x, y, Nbins, bin_avg)
double precision, allocatable, intent(in) :: x(:)
double precision, allocatable, intent(in) :: y(:)
integer, intent(in) :: Nbins
double precision, intent(out) :: bin_avg(0:Nbins)
integer :: i, lower_bin, upper_bin
integer :: Ndata
double precision :: count_frac(0:Nbins)
double precision :: lower_bin_frac, upper_bin_frac
Ndata = size(x)
count_frac = 0.d0
bin_avg = 0.d0
do i=1,Ndata
lower_bin = floor(x(i))
upper_bin = lower_bin + 1
lower_bin_frac = upper_bin - x(i)
upper_bin_frac = 1.d0 - lower_bin_frac
count_frac(lower_bin) = count_frac(lower_bin) + lower_bin_frac
count_frac(upper_bin) = count_frac(upper_bin) + upper_bin_frac
bin_avg(lower_bin) = bin_avg(lower_bin) + y(i) * lower_bin_frac
bin_avg(upper_bin) = bin_avg(upper_bin) + y(i) * upper_bin_frac
end do
where (count_frac > tiny(count_frac))
bin_avg = bin_avg / count_frac
end where
return
end subroutine d_triangle_binning
subroutine d_triangle_binning1D(y, Nbins, bin_avg)
double precision, allocatable, intent(in) :: y(:)
integer, intent(in) :: Nbins
double precision, intent(out) :: bin_avg(0:Nbins)
integer :: i, lower_bin, upper_bin
integer :: ylbound(1), yubound(1)
double precision :: count_frac(0:Nbins)
double precision :: lower_bin_frac, upper_bin_frac
ylbound = lbound(y)
yubound = ubound(y)
count_frac = 0.d0
bin_avg = 0.d0
do i=ylbound(1),yubound(1)
lower_bin = abs(i)
upper_bin = lower_bin + 1
lower_bin_frac = 1.d0
upper_bin_frac = 0.d0
count_frac(lower_bin) = count_frac(lower_bin) + lower_bin_frac
count_frac(upper_bin) = count_frac(upper_bin) + upper_bin_frac
bin_avg(lower_bin) = bin_avg(lower_bin) + y(i) * lower_bin_frac
bin_avg(upper_bin) = bin_avg(upper_bin) + y(i) * upper_bin_frac
end do
where (count_frac > tiny(count_frac))
bin_avg = bin_avg / count_frac
end where
return
end subroutine d_triangle_binning1D
subroutine d_triangle_binning2D(y, Nbins, bin_avg)
double precision, allocatable, intent(in) :: y(:,:)
integer, intent(in) :: Nbins
double precision, intent(out) :: bin_avg(0:Nbins)
integer :: i, j, lower_bin, upper_bin
integer :: ylbound(2), yubound(2)
double precision :: count_frac(0:Nbins)
double precision :: x, jsqd
double precision :: lower_bin_frac, upper_bin_frac
ylbound = lbound(y)
yubound = ubound(y)
count_frac = 0.d0
bin_avg = 0.d0
do j=ylbound(2),yubound(2)
jsqd = dble(j**2)
do i=ylbound(1),yubound(1)
x = sqrt(dble(i**2) + jsqd)
lower_bin = floor(x)
upper_bin = lower_bin + 1
lower_bin_frac = upper_bin - x
upper_bin_frac = 1.d0 - lower_bin_frac
count_frac(lower_bin) = count_frac(lower_bin) + lower_bin_frac
count_frac(upper_bin) = count_frac(upper_bin) + upper_bin_frac
bin_avg(lower_bin) = bin_avg(lower_bin) + &
y(i,j) * lower_bin_frac
bin_avg(upper_bin) = bin_avg(upper_bin) + &
y(i,j) * upper_bin_frac
end do
end do
where (count_frac > tiny(count_frac))
bin_avg = bin_avg / count_frac
end where
return
end subroutine d_triangle_binning2D
subroutine d_triangle_binning3D(y, Nbins, bin_avg)
double precision, allocatable, intent(in) :: y(:,:,:)
integer, intent(in) :: Nbins
double precision, intent(out) :: bin_avg(0:Nbins)
integer :: i, j, k, lower_bin, upper_bin
integer :: ylbound(3), yubound(3)
double precision :: count_frac(0:Nbins)
double precision :: x, jsqd, ksqd
double precision :: lower_bin_frac, upper_bin_frac
ylbound = lbound(y)
yubound = ubound(y)
count_frac = 0.d0
bin_avg = 0.d0
do k=ylbound(3),yubound(3)
ksqd = dble(k**2)
do j=ylbound(2),yubound(2)
jsqd = dble(j**2)
do i=ylbound(1),yubound(1)
x = sqrt(dble(i**2) + jsqd + ksqd)
lower_bin = floor(x)
upper_bin = lower_bin + 1
lower_bin_frac = upper_bin - x
upper_bin_frac = 1.d0 - lower_bin_frac
count_frac(lower_bin) = count_frac(lower_bin) + &
lower_bin_frac
count_frac(upper_bin) = count_frac(upper_bin) + &
upper_bin_frac
bin_avg(lower_bin) = bin_avg(lower_bin) + &
y(i,j,k) * lower_bin_frac
bin_avg(upper_bin) = bin_avg(upper_bin) + &
y(i,j,k) * upper_bin_frac
end do
end do
end do
where (count_frac > tiny(count_frac))
bin_avg = bin_avg / count_frac
end where
return
end subroutine d_triangle_binning3D
end module binning