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
|
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.
# XT_SORT2 -- Sort 2 dimensional vectors by the first component.
procedure xt_sort2 (a1, a2, npts)
real a1[npts], a2[npts] # Arrays to be sorted
int npts # Number of points
int i, j
pointer sp, index, ptr
int xts_compare()
extern xts_compare
begin
call smark (sp)
call salloc (index, npts, TY_INT)
call salloc (ptr, npts, TY_REAL)
do i = 1, npts
Memi[index+i-1] = ptr + i - 1
call amovr (a1, Memr[ptr], npts)
call qsort (Memi[index], npts, xts_compare)
do i = 1, npts {
j = Memi[index+i-1]
a1[i] = Memr[j]
}
call amovr (a2, Memr[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a2[i] = Memr[j]
}
call sfree (sp)
end
# XT_SORT3 -- Sort 3 dimensional vectors by the first component.
procedure xt_sort3 (a1, a2, a3, npts)
real a1[npts], a2[npts], a3[npts] # Arrays to be sorted
int npts # Number of points
int i, j
pointer sp, index, ptr
int xts_compare()
extern xts_compare
begin
call smark (sp)
call salloc (index, npts, TY_INT)
call salloc (ptr, npts, TY_REAL)
do i = 1, npts
Memi[index+i-1] = ptr + i - 1
call amovr (a1, Memr[ptr], npts)
call qsort (Memi[index], npts, xts_compare)
do i = 1, npts {
j = Memi[index+i-1]
a1[i] = Memr[j]
}
call amovr (a2, Memr[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a2[i] = Memr[j]
}
call amovr (a3, Memr[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a3[i] = Memr[j]
}
call sfree (sp)
end
# XT_SORT4 -- Sort 4 dimensional vectors by the first component.
procedure xt_sort4 (a1, a2, a3, a4, npts)
real a1[npts], a2[npts], a3[npts], a4[npts] # Arrays to be sorted
int npts # Number of points
int i, j
pointer sp, index, ptr
int xts_compare()
extern xts_compare
begin
call smark (sp)
call salloc (index, npts, TY_INT)
call salloc (ptr, npts, TY_REAL)
do i = 1, npts
Memi[index+i-1] = ptr + i - 1
call amovr (a1, Memr[ptr], npts)
call qsort (Memi[index], npts, xts_compare)
do i = 1, npts {
j = Memi[index+i-1]
a1[i] = Memr[j]
}
call amovr (a2, Memr[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a2[i] = Memr[j]
}
call amovr (a3, Memr[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a3[i] = Memr[j]
}
call amovr (a4, Memr[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a4[i] = Memr[j]
}
call sfree (sp)
end
# XTS_COMPARE -- Compare two real values in the Memr array.
int procedure xts_compare (i, j)
pointer i, j # Array indices to be compared.
begin
if (Memr[i] < Memr[j])
return (-1)
else if (Memr[i] > Memr[j])
return (1)
else
return (0)
end
# XT_SORT3D -- Sort 3 double precision vectors by the first component.
procedure xt_sort3d (a1, a2, a3, npts)
double a1[npts], a2[npts], a3[npts] # Arrays to be sorted
int npts # Number of points
int i, j
pointer sp, index, ptr
int xts_compared()
extern xts_compared
begin
call smark (sp)
call salloc (index, npts, TY_INT)
call salloc (ptr, npts, TY_DOUBLE)
do i = 1, npts
Memi[index+i-1] = ptr + i - 1
call amovd (a1, Memd[ptr], npts)
call qsort (Memi[index], npts, xts_compared)
do i = 1, npts {
j = Memi[index+i-1]
a1[i] = Memd[j]
}
call amovd (a2, Memd[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a2[i] = Memd[j]
}
call amovd (a3, Memd[ptr], npts)
do i = 1, npts {
j = Memi[index+i-1]
a3[i] = Memd[j]
}
call sfree (sp)
end
# XTS_COMPARED -- Compare two double values in the Memd array.
int procedure xts_compared (i, j)
pointer i, j # Array indices to be compared.
begin
if (Memd[i] < Memd[j])
return (-1)
else if (Memd[i] > Memd[j])
return (1)
else
return (0)
end
|
