|
515
|
1 // f-sort.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
1009
|
4 Copyright (C) 1994, 1995 John W. Eaton |
|
515
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
515
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
1192
|
25 #include <config.h> |
|
515
|
26 #endif |
|
|
27 |
|
1352
|
28 #include "defun-dld.h" |
|
777
|
29 #include "error.h" |
|
|
30 #include "gripes.h" |
|
544
|
31 #include "help.h" |
|
1352
|
32 #include "tree-const.h" |
|
515
|
33 |
|
1386
|
34 // This is algorithm 5.2.4L from Knuth, Volume 3. |
|
|
35 |
|
|
36 // XXX FIXME XXX -- there is way too much duplicated code here given |
|
|
37 // that the sort algorithms are all the same, and only the type of the |
|
|
38 // data and the comparison changes... |
|
1387
|
39 // |
|
|
40 // Maybe some cpp abuse will make it better. |
|
|
41 |
|
|
42 static Array<int> |
|
|
43 create_index_array (int n) |
|
|
44 { |
|
|
45 Array<int> l (n+1); |
|
|
46 |
|
|
47 l.elem (0) = 1; |
|
|
48 |
|
|
49 for (int i = 1; i < n - 1; i++) |
|
|
50 l.elem (i) = -(i+2); |
|
|
51 |
|
|
52 l.elem (n-1) = 0; |
|
|
53 l.elem (n) = 0; |
|
|
54 l.elem (n+1) = 2; |
|
|
55 |
|
|
56 return l; |
|
|
57 } |
|
|
58 |
|
|
59 #define SORT_INIT_PHASE(n) \ |
|
|
60 int s = 0; \ |
|
|
61 int t = n + 1; \ |
|
|
62 int p = l.elem (s); \ |
|
|
63 int q = l.elem (t); \ |
|
|
64 if (q == 0) \ |
|
|
65 break |
|
|
66 |
|
|
67 #define SORT_COMMON_CODE \ |
|
|
68 p = -p; \ |
|
|
69 q = -q; \ |
|
|
70 if (q == 0) \ |
|
|
71 { \ |
|
|
72 l.elem (s) = (l.elem (s) < 0) \ |
|
|
73 ? ((p < 0) ? p : -p) \ |
|
|
74 : ((p >= 0) ? p : -p); \ |
|
|
75 l.elem (t) = 0; \ |
|
|
76 break; \ |
|
|
77 } \ |
|
|
78 |
|
|
79 #define SORT_REORDER_PHASE_ONE \ |
|
|
80 l.elem (s) = (l.elem (s) < 0) \ |
|
|
81 ? ((q < 0) ? q : -q) \ |
|
|
82 : ((q >= 0) ? q : -q); \ |
|
|
83 s = q; \ |
|
|
84 q = l.elem (q); \ |
|
|
85 if (q <= 0) \ |
|
|
86 { \ |
|
|
87 l.elem (s) = p; \ |
|
|
88 s = t; \ |
|
|
89 do \ |
|
|
90 { \ |
|
|
91 t = p; \ |
|
|
92 p = l.elem (p); \ |
|
|
93 } \ |
|
|
94 while (p > 0); \ |
|
|
95 SORT_COMMON_CODE; \ |
|
|
96 } \ |
|
|
97 |
|
|
98 #define SORT_REORDER_PHASE_TWO \ |
|
|
99 l.elem (s) = (l.elem (s) < 0) \ |
|
|
100 ? ((p < 0) ? p : -p) \ |
|
|
101 : ((p >= 0) ? p : -p); \ |
|
|
102 s = p; \ |
|
|
103 p = l.elem (p); \ |
|
|
104 if (p <= 0) \ |
|
|
105 { \ |
|
|
106 l.elem (s) = q; \ |
|
|
107 s = t; \ |
|
|
108 do \ |
|
|
109 { \ |
|
|
110 t = q; \ |
|
|
111 q = l.elem (q); \ |
|
|
112 } \ |
|
|
113 while (q > 0); \ |
|
|
114 SORT_COMMON_CODE; \ |
|
|
115 } |
|
|
116 |
|
|
117 #define DO_SORT(n, condition) \ |
|
|
118 while (1) \ |
|
|
119 { \ |
|
|
120 SORT_INIT_PHASE(n); \ |
|
|
121 while (1) \ |
|
|
122 { \ |
|
|
123 if (condition) \ |
|
|
124 { \ |
|
|
125 SORT_REORDER_PHASE_ONE; \ |
|
|
126 } \ |
|
|
127 else \ |
|
|
128 { \ |
|
|
129 SORT_REORDER_PHASE_TWO; \ |
|
|
130 } \ |
|
|
131 } \ |
|
|
132 } |
|
|
133 |
|
|
134 #define VECTOR_CREATE_RETURN_VALUES(vs, v) \ |
|
|
135 int k = l.elem (0); \ |
|
|
136 idx.elem (0) = k; \ |
|
|
137 vs.elem (0) = v.elem (k-1); \ |
|
|
138 for (int i = 1; i < n; i++) \ |
|
|
139 { \ |
|
|
140 k = l.elem ((int) idx.elem (i-1)); \ |
|
|
141 idx.elem (i) = k; \ |
|
|
142 vs.elem (i) = v.elem (k-1); \ |
|
|
143 } |
|
|
144 |
|
|
145 #define MATRIX_CREATE_RETURN_VALUES(ms, m) \ |
|
|
146 int k = l.elem (0); \ |
|
|
147 idx.elem (0, j) = k; \ |
|
|
148 ms.elem (0, j) = m.elem (k-1, j); \ |
|
|
149 for (int i = 1; i < nr; i++) \ |
|
|
150 { \ |
|
|
151 k = l.elem ((int) idx.elem (i-1, j)); \ |
|
|
152 idx.elem (i, j) = k; \ |
|
|
153 ms.elem (i, j) = m.elem (k-1, j); \ |
|
|
154 } |
|
1386
|
155 |
|
|
156 static Octave_object |
|
|
157 mx_sort (const Matrix& m) |
|
515
|
158 { |
|
1386
|
159 Octave_object retval; |
|
|
160 |
|
515
|
161 int nr = m.rows (); |
|
|
162 int nc = m.columns (); |
|
1386
|
163 |
|
|
164 Matrix ms (nr, nc); |
|
|
165 Matrix idx (nr, nc); |
|
|
166 |
|
|
167 if (nr > 0 && nc > 0) |
|
|
168 { |
|
|
169 for (int j = 0; j < nc; j++) |
|
|
170 { |
|
1387
|
171 Array<int> l = create_index_array (nr); |
|
515
|
172 |
|
1387
|
173 DO_SORT (nr, (m.elem (p-1, j) > m.elem (q-1, j))); |
|
1386
|
174 |
|
1387
|
175 MATRIX_CREATE_RETURN_VALUES (ms, m); |
|
1386
|
176 } |
|
515
|
177 } |
|
|
178 |
|
1386
|
179 retval (1) = idx; |
|
|
180 retval (0) = ms; |
|
515
|
181 |
|
1386
|
182 return retval; |
|
515
|
183 } |
|
|
184 |
|
1386
|
185 static Octave_object |
|
|
186 mx_sort (const RowVector& v) |
|
515
|
187 { |
|
1386
|
188 Octave_object retval; |
|
|
189 |
|
515
|
190 int n = v.capacity (); |
|
1386
|
191 |
|
|
192 RowVector vs (n); |
|
|
193 RowVector idx (n); |
|
|
194 |
|
|
195 if (n > 0) |
|
|
196 { |
|
1387
|
197 Array<int> l = create_index_array (n); |
|
515
|
198 |
|
1387
|
199 DO_SORT (n, (v.elem (p-1) > v.elem (q-1))); |
|
515
|
200 |
|
1387
|
201 VECTOR_CREATE_RETURN_VALUES (vs, v); |
|
515
|
202 } |
|
|
203 |
|
1386
|
204 retval (1) = tree_constant (idx, 0); |
|
|
205 retval (0) = tree_constant (vs, 0); |
|
515
|
206 |
|
1386
|
207 return retval; |
|
515
|
208 } |
|
|
209 |
|
1386
|
210 static Octave_object |
|
|
211 mx_sort (const ComplexMatrix& cm) |
|
515
|
212 { |
|
1386
|
213 Octave_object retval; |
|
|
214 |
|
|
215 int nr = cm.rows (); |
|
|
216 int nc = cm.columns (); |
|
|
217 |
|
|
218 ComplexMatrix cms (nr, nc); |
|
|
219 Matrix idx (nr, nc); |
|
|
220 |
|
|
221 if (nr > 0 && nc > 0) |
|
|
222 { |
|
|
223 for (int j = 0; j < nc; j++) |
|
|
224 { |
|
1387
|
225 Array<int> l = create_index_array (nr); |
|
1386
|
226 |
|
|
227 int all_elts_real = 1; |
|
|
228 for (int i = 0; i < nr; i++) |
|
1387
|
229 if (imag (cm.elem (i, j)) != 0.0) |
|
1386
|
230 { |
|
|
231 all_elts_real = 0; |
|
|
232 break; |
|
|
233 } |
|
|
234 |
|
1387
|
235 DO_SORT (nr, ((all_elts_real |
|
|
236 && real (cm.elem (p-1, j)) > real (cm.elem (q-1, j))) |
|
|
237 || abs (cm.elem (p-1, j)) > abs (cm.elem (q-1, j)))); |
|
515
|
238 |
|
1387
|
239 MATRIX_CREATE_RETURN_VALUES (cms, cm); |
|
515
|
240 } |
|
1386
|
241 } |
|
|
242 |
|
|
243 retval (1) = idx; |
|
|
244 retval (0) = cms; |
|
|
245 |
|
|
246 return retval; |
|
|
247 } |
|
|
248 |
|
|
249 static Octave_object |
|
|
250 mx_sort (ComplexRowVector& cv) |
|
|
251 { |
|
|
252 Octave_object retval; |
|
|
253 |
|
|
254 int n = cv.capacity (); |
|
|
255 |
|
|
256 ComplexRowVector cvs (n); |
|
|
257 RowVector idx (n); |
|
|
258 |
|
|
259 if (n > 0) |
|
|
260 { |
|
1387
|
261 Array<int> l = create_index_array (n); |
|
1386
|
262 |
|
|
263 int all_elts_real = 1; |
|
|
264 for (int i = 0; i < n; i++) |
|
1387
|
265 if (imag (cv.elem (i)) != 0.0) |
|
1386
|
266 { |
|
|
267 all_elts_real = 0; |
|
|
268 break; |
|
|
269 } |
|
|
270 |
|
1387
|
271 DO_SORT (n, ((all_elts_real |
|
|
272 && real (cv.elem (p-1)) > real (cv.elem (q-1))) |
|
|
273 || abs (cv.elem (p-1)) > abs (cv.elem (q-1)))); |
|
1386
|
274 |
|
1387
|
275 VECTOR_CREATE_RETURN_VALUES (cvs, cv); |
|
1386
|
276 } |
|
|
277 |
|
|
278 retval (1) = tree_constant (idx, 0); |
|
|
279 retval (0) = tree_constant (cvs, 0); |
|
|
280 |
|
|
281 return retval; |
|
515
|
282 } |
|
|
283 |
|
701
|
284 DEFUN_DLD_BUILTIN ("sort", Fsort, Ssort, 2, 2, |
|
519
|
285 "[S, I] = sort (X)\n\ |
|
|
286 \n\ |
|
|
287 sort the columns of X, optionally return sort index") |
|
515
|
288 { |
|
519
|
289 Octave_object retval; |
|
|
290 |
|
|
291 int nargin = args.length (); |
|
515
|
292 |
|
712
|
293 if (nargin != 1) |
|
519
|
294 { |
|
|
295 print_usage ("sort"); |
|
|
296 return retval; |
|
|
297 } |
|
515
|
298 |
|
|
299 int return_idx = nargout > 1; |
|
|
300 if (return_idx) |
|
|
301 retval.resize (2); |
|
|
302 else |
|
|
303 retval.resize (1); |
|
|
304 |
|
712
|
305 tree_constant arg = args(0); |
|
620
|
306 |
|
636
|
307 if (arg.is_real_type ()) |
|
620
|
308 { |
|
636
|
309 Matrix m = arg.matrix_value (); |
|
|
310 |
|
|
311 if (! error_state) |
|
620
|
312 { |
|
636
|
313 if (m.rows () == 1) |
|
|
314 { |
|
|
315 int nc = m.columns (); |
|
|
316 RowVector v (nc); |
|
|
317 for (int i = 0; i < nc; i++) |
|
|
318 v.elem (i) = m.elem (0, i); |
|
515
|
319 |
|
1386
|
320 retval = mx_sort (v); |
|
636
|
321 } |
|
|
322 else |
|
1386
|
323 retval = mx_sort (m); |
|
620
|
324 } |
|
|
325 } |
|
636
|
326 else if (arg.is_complex_type ()) |
|
620
|
327 { |
|
636
|
328 ComplexMatrix cm = arg.complex_matrix_value (); |
|
|
329 |
|
|
330 if (! error_state) |
|
620
|
331 { |
|
636
|
332 if (cm.rows () == 1) |
|
|
333 { |
|
|
334 int nc = cm.columns (); |
|
|
335 ComplexRowVector cv (nc); |
|
|
336 for (int i = 0; i < nc; i++) |
|
|
337 cv.elem (i) = cm.elem (0, i); |
|
515
|
338 |
|
1386
|
339 retval = mx_sort (cv); |
|
636
|
340 } |
|
|
341 else |
|
1386
|
342 retval = mx_sort (cm); |
|
620
|
343 } |
|
|
344 } |
|
|
345 else |
|
1386
|
346 gripe_wrong_type_arg ("sort", arg); |
|
515
|
347 |
|
|
348 return retval; |
|
|
349 } |
|
|
350 |
|
|
351 /* |
|
|
352 ;;; Local Variables: *** |
|
|
353 ;;; mode: C++ *** |
|
|
354 ;;; page-delimiter: "^/\\*" *** |
|
|
355 ;;; End: *** |
|
|
356 */ |
