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
|
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.
include "../icombine.h"
$for (sird)
# IC_MM -- Reject a specified number of high and low pixels
procedure ic_mm$t (d, m, n, npts)
pointer d[ARB] # Data pointers
pointer m[ARB] # Image ID pointers
int n[npts] # Number of good pixels
int npts # Number of output points per line
int n1, ncombine, npairs, nlow, nhigh, np
int i, i1, j, jmax, jmin
pointer k, kmax, kmin
PIXEL d1, d2, dmin, dmax
include "../icombine.com"
begin
if (dflag == D_NONE)
return
if (dflag == D_ALL) {
n1 = n[1]
nlow = flow * n1 + 0.001
nhigh = fhigh * n1 + 0.001
ncombine = n1 - nlow - nhigh
npairs = min (nlow, nhigh)
nlow = nlow - npairs
nhigh = nhigh - npairs
}
do i = 1, npts {
i1 = i - 1
n1 = n[i]
if (dflag == D_MIX) {
nlow = flow * n1 + 0.001
nhigh = fhigh * n1 + 0.001
ncombine = max (ncombine, n1 - nlow - nhigh)
npairs = min (nlow, nhigh)
nlow = nlow - npairs
nhigh = nhigh - npairs
}
# Reject the npairs low and high points.
do np = 1, npairs {
k = d[1] + i1
$if (datatype == x)
d1 = abs (Mem$t[k])
$else
d1 = Mem$t[k]
$endif
dmax = d1; dmin = d1; jmax = 1; jmin = 1; kmax = k; kmin = k
do j = 2, n1 {
d2 = d1
k = d[j] + i1
$if (datatype == x)
d1 = abs (Mem$t[k])
$else
d1 = Mem$t[k]
$endif
if (d1 > dmax) {
dmax = d1; jmax = j; kmax = k
} else if (d1 < dmin) {
dmin = d1; jmin = j; kmin = k
}
}
j = n1 - 1
if (keepids) {
if (jmax < j) {
if (jmin != j) {
Mem$t[kmax] = d2
k = Memi[m[jmax]+i1]
Memi[m[jmax]+i1] = Memi[m[j]+i1]
Memi[m[j]+i1] = k
} else {
Mem$t[kmax] = d1
k = Memi[m[jmax]+i1]
Memi[m[jmax]+i1] = Memi[m[n1]+i1]
Memi[m[n1]+i1] = k
}
}
if (jmin < j) {
if (jmax != n1) {
Mem$t[kmin] = d1
k = Memi[m[jmin]+i1]
Memi[m[jmin]+i1] = Memi[m[n1]+i1]
Memi[m[n1]+i1] = k
} else {
Mem$t[kmin] = d2
k = Memi[m[jmin]+i1]
Memi[m[jmin]+i1] = Memi[m[j]+i1]
Memi[m[j]+i1] = k
}
}
} else {
if (jmax < j) {
if (jmin != j)
Mem$t[kmax] = d2
else
Mem$t[kmax] = d1
}
if (jmin < j) {
if (jmax != n1)
Mem$t[kmin] = d1
else
Mem$t[kmin] = d2
}
}
n1 = n1 - 2
}
# Reject the excess low points.
do np = 1, nlow {
k = d[1] + i1
$if (datatype == x)
d1 = abs (Mem$t[k])
$else
d1 = Mem$t[k]
$endif
dmin = d1; jmin = 1; kmin = k
do j = 2, n1 {
k = d[j] + i1
$if (datatype == x)
d1 = abs (Mem$t[k])
$else
d1 = Mem$t[k]
$endif
if (d1 < dmin) {
dmin = d1; jmin = j; kmin = k
}
}
if (keepids) {
if (jmin < n1) {
Mem$t[kmin] = d1
k = Memi[m[jmin]+i1]
Memi[m[jmin]+i1] = Memi[m[n1]+i1]
Memi[m[n1]+i1] = k
}
} else {
if (jmin < n1)
Mem$t[kmin] = d1
}
n1 = n1 - 1
}
# Reject the excess high points.
do np = 1, nhigh {
k = d[1] + i1
$if (datatype == x)
d1 = abs (Mem$t[k])
$else
d1 = Mem$t[k]
$endif
dmax = d1; jmax = 1; kmax = k
do j = 2, n1 {
k = d[j] + i1
$if (datatype == x)
d1 = abs (Mem$t[k])
$else
d1 = Mem$t[k]
$endif
if (d1 > dmax) {
dmax = d1; jmax = j; kmax = k
}
}
if (keepids) {
if (jmax < n1) {
Mem$t[kmax] = d1
k = Memi[m[jmax]+i1]
Memi[m[jmax]+i1] = Memi[m[n1]+i1]
Memi[m[n1]+i1] = k
}
} else {
if (jmax < n1)
Mem$t[kmax] = d1
}
n1 = n1 - 1
}
n[i] = n1
}
if (dflag == D_ALL && npairs + nlow + nhigh > 0)
dflag = D_MIX
end
$endfor
|
