|
523
|
1 // data.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993, 1994 John W. Eaton |
|
|
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 |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 /* |
|
|
25 |
|
|
26 The function builtin_pwd adapted from a similar function from GNU |
|
|
27 Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free |
|
|
28 Software Foundation, Inc. |
|
|
29 |
|
|
30 */ |
|
|
31 |
|
|
32 #ifdef HAVE_CONFIG_H |
|
|
33 #include "config.h" |
|
|
34 #endif |
|
|
35 |
|
|
36 #include "tree-const.h" |
|
|
37 #include "user-prefs.h" |
|
565
|
38 #include "help.h" |
|
523
|
39 #include "utils.h" |
|
|
40 #include "error.h" |
|
|
41 #include "defun.h" |
|
|
42 |
|
|
43 #ifndef MIN |
|
|
44 #define MIN(a,b) ((a) < (b) ? (a) : (b)) |
|
|
45 #endif |
|
|
46 |
|
|
47 DEFUN ("all", Fall, Sall, 2, 1, |
|
|
48 "all (X): are all elements of X nonzero?") |
|
|
49 { |
|
|
50 Octave_object retval; |
|
|
51 |
|
|
52 int nargin = args.length (); |
|
|
53 |
|
|
54 if (nargin != 2) |
|
|
55 print_usage ("all"); |
|
|
56 else if (nargin > 0 && args(1).is_defined ()) |
|
|
57 retval = args(1).all (); |
|
|
58 |
|
|
59 return retval; |
|
|
60 } |
|
|
61 |
|
|
62 DEFUN ("any", Fany, Sany, 2, 1, |
|
|
63 "any (X): are any elements of X nonzero?") |
|
|
64 { |
|
|
65 Octave_object retval; |
|
|
66 |
|
|
67 int nargin = args.length (); |
|
|
68 |
|
|
69 if (nargin != 2) |
|
|
70 print_usage ("any"); |
|
|
71 else if (nargin > 0 && args(1).is_defined ()) |
|
|
72 retval = args(1).any (); |
|
|
73 |
|
|
74 return retval; |
|
|
75 } |
|
|
76 |
|
|
77 DEFUN ("cumprod", Fcumprod, Scumprod, 2, 1, |
|
|
78 "cumprod (X): cumulative products") |
|
|
79 { |
|
|
80 Octave_object retval; |
|
|
81 |
|
|
82 int nargin = args.length (); |
|
|
83 |
|
|
84 if (nargin != 2) |
|
|
85 print_usage ("cumprod"); |
|
|
86 else if (nargin > 0 && args(1).is_defined ()) |
|
|
87 retval = args(1).cumprod (); |
|
|
88 |
|
|
89 return retval; |
|
|
90 } |
|
|
91 |
|
|
92 DEFUN ("cumsum", Fcumsum, Scumsum, 2, 1, |
|
|
93 "cumsum (X): cumulative sums") |
|
|
94 { |
|
|
95 Octave_object retval; |
|
|
96 |
|
|
97 int nargin = args.length (); |
|
|
98 |
|
|
99 if (nargin != 2) |
|
|
100 print_usage ("cumsum"); |
|
|
101 else if (nargin > 0 && args(1).is_defined ()) |
|
|
102 retval = args(1).cumsum (); |
|
|
103 |
|
|
104 return retval; |
|
|
105 } |
|
|
106 |
|
|
107 DEFUN ("diag", Fdiag, Sdiag, 3, 1, |
|
|
108 "diag (X [,k]): form/extract diagonals") |
|
|
109 { |
|
|
110 Octave_object retval; |
|
|
111 |
|
|
112 int nargin = args.length (); |
|
|
113 |
|
|
114 if (nargin == 2) |
|
|
115 retval = args(1).diag (); |
|
|
116 else if (nargin == 3) |
|
|
117 retval = args(1).diag (args(2)); |
|
|
118 else |
|
|
119 print_usage ("diag"); |
|
|
120 |
|
|
121 return retval; |
|
|
122 } |
|
|
123 |
|
|
124 DEFUN ("isstr", Fisstr, Sisstr, 2, 1, |
|
|
125 "isstr (X): return 1 if X is a string, 0 otherwise") |
|
|
126 { |
|
|
127 Octave_object retval; |
|
|
128 |
|
|
129 int nargin = args.length (); |
|
|
130 |
|
|
131 if (nargin != 2) |
|
|
132 print_usage ("isstr"); |
|
|
133 else |
|
|
134 { |
|
|
135 if (nargin > 0 && args(1).is_defined ()) |
|
620
|
136 retval = (double) args(1).is_string (); |
|
523
|
137 } |
|
|
138 |
|
|
139 return retval; |
|
|
140 } |
|
|
141 |
|
|
142 DEFUN ("prod", Fprod, Sprod, 2, 1, |
|
|
143 "prod (X): products") |
|
|
144 { |
|
|
145 Octave_object retval; |
|
|
146 |
|
|
147 int nargin = args.length (); |
|
|
148 |
|
|
149 if (nargin != 2) |
|
|
150 print_usage ("prod"); |
|
|
151 else if (nargin > 0 && args(1).is_defined ()) |
|
|
152 retval = args(1).prod (); |
|
|
153 |
|
|
154 return retval; |
|
|
155 } |
|
|
156 |
|
|
157 DEFUN ("setstr", Fsetstr, Ssetstr, 2, 1, |
|
|
158 "setstr (V): convert a vector to a string") |
|
|
159 { |
|
|
160 Octave_object retval; |
|
|
161 |
|
|
162 int nargin = args.length (); |
|
|
163 |
|
|
164 if (nargin == 2) |
|
|
165 retval = args(1).convert_to_str (); |
|
|
166 else |
|
|
167 print_usage ("setstr"); |
|
|
168 |
|
|
169 return retval; |
|
|
170 } |
|
|
171 |
|
|
172 DEFUN ("size", Fsize, Ssize, 2, 1, |
|
|
173 "[m, n] = size (x): return rows and columns of X") |
|
|
174 { |
|
|
175 Octave_object retval; |
|
|
176 |
|
|
177 int nargin = args.length (); |
|
|
178 |
|
|
179 if (nargin != 2) |
|
|
180 print_usage ("size"); |
|
|
181 else |
|
|
182 { |
|
|
183 if (nargin > 0 && args(1).is_defined ()) |
|
|
184 { |
|
|
185 int nr = args(1).rows (); |
|
|
186 int nc = args(1).columns (); |
|
|
187 if (nargout == 0 || nargout == 1) |
|
|
188 { |
|
|
189 Matrix m (1, 2); |
|
|
190 m.elem (0, 0) = nr; |
|
|
191 m.elem (0, 1) = nc; |
|
|
192 retval = m; |
|
|
193 } |
|
|
194 else if (nargout == 2) |
|
|
195 { |
|
|
196 retval(1) = (double) nc; |
|
|
197 retval(0) = (double) nr; |
|
|
198 } |
|
|
199 else |
|
|
200 print_usage ("size"); |
|
|
201 } |
|
|
202 } |
|
|
203 |
|
|
204 return retval; |
|
|
205 } |
|
|
206 |
|
|
207 DEFUN ("sum", Fsum, Ssum, 2, 1, |
|
|
208 "sum (X): sum of elements") |
|
|
209 { |
|
|
210 Octave_object retval; |
|
|
211 |
|
|
212 int nargin = args.length (); |
|
|
213 |
|
|
214 if (nargin != 2) |
|
|
215 print_usage ("sum"); |
|
|
216 else |
|
|
217 { |
|
|
218 if (nargin > 0 && args(1).is_defined ()) |
|
|
219 retval = args(1).sum (); |
|
|
220 } |
|
|
221 |
|
|
222 return retval; |
|
|
223 } |
|
|
224 |
|
|
225 DEFUN ("sumsq", Fsumsq, Ssumsq, 2, 1, |
|
|
226 "sumsq (X): sum of squares of elements") |
|
|
227 { |
|
|
228 Octave_object retval; |
|
|
229 |
|
|
230 int nargin = args.length (); |
|
|
231 |
|
|
232 if (nargin != 2) |
|
|
233 print_usage ("sumsq"); |
|
|
234 else if (nargin > 0 && args(1).is_defined ()) |
|
|
235 retval = args(1).sumsq (); |
|
|
236 |
|
|
237 return retval; |
|
|
238 } |
|
|
239 |
|
|
240 static void |
|
|
241 check_dimensions (int& nr, int& nc, const char *warnfor) |
|
|
242 { |
|
|
243 if (nr < 0 || nc < 0) |
|
|
244 { |
|
|
245 if (user_pref.treat_neg_dim_as_zero) |
|
597
|
246 { |
|
|
247 nr = (nr < 0) ? 0 : nr; |
|
|
248 nc = (nc < 0) ? 0 : nc; |
|
|
249 } |
|
523
|
250 else |
|
|
251 error ("%s: can't create a matrix with negative dimensions", |
|
|
252 warnfor); |
|
|
253 } |
|
|
254 } |
|
|
255 |
|
|
256 static void |
|
|
257 get_dimensions (const tree_constant& a, const char *warn_for, |
|
|
258 int& nr, int& nc) |
|
|
259 { |
|
634
|
260 if (a.is_scalar_type ()) |
|
523
|
261 { |
|
634
|
262 double tmp = a.double_value (); |
|
523
|
263 nr = nc = NINT (tmp); |
|
|
264 } |
|
|
265 else |
|
|
266 { |
|
634
|
267 nr = a.rows (); |
|
|
268 nc = a.columns (); |
|
523
|
269 |
|
|
270 if ((nr == 1 && nc == 2) || (nr == 2 && nc == 1)) |
|
|
271 { |
|
634
|
272 ColumnVector v = a.vector_value (); |
|
523
|
273 |
|
633
|
274 if (error_state) |
|
|
275 return; |
|
|
276 |
|
523
|
277 nr = NINT (v.elem (0)); |
|
|
278 nc = NINT (v.elem (1)); |
|
|
279 } |
|
|
280 else |
|
|
281 warning ("%s (A): use %s (size (A)) instead", warn_for, warn_for); |
|
|
282 } |
|
|
283 |
|
|
284 check_dimensions (nr, nc, warn_for); // May set error_state. |
|
|
285 } |
|
|
286 |
|
|
287 static void |
|
|
288 get_dimensions (const tree_constant& a, const tree_constant& b, |
|
|
289 const char *warn_for, int& nr, int& nc) |
|
|
290 { |
|
634
|
291 nr = NINT (a.double_value ()); |
|
|
292 nc = NINT (b.double_value ()); |
|
523
|
293 |
|
634
|
294 if (error_state) |
|
|
295 error ("%s: expecting two scalar arguments", warn_for); |
|
523
|
296 else |
|
634
|
297 check_dimensions (nr, nc, warn_for); // May set error_state. |
|
523
|
298 } |
|
|
299 |
|
|
300 static tree_constant |
|
|
301 fill_matrix (const tree_constant& a, double val, const char *warn_for) |
|
|
302 { |
|
|
303 int nr, nc; |
|
|
304 get_dimensions (a, warn_for, nr, nc); |
|
|
305 |
|
|
306 if (error_state) |
|
|
307 return tree_constant (); |
|
|
308 |
|
|
309 Matrix m (nr, nc, val); |
|
|
310 |
|
|
311 return m; |
|
|
312 } |
|
|
313 |
|
|
314 static tree_constant |
|
|
315 fill_matrix (const tree_constant& a, const tree_constant& b, |
|
|
316 double val, const char *warn_for) |
|
|
317 { |
|
|
318 int nr, nc; |
|
|
319 get_dimensions (a, b, warn_for, nr, nc); // May set error_state. |
|
|
320 |
|
|
321 if (error_state) |
|
|
322 return tree_constant (); |
|
|
323 |
|
|
324 Matrix m (nr, nc, val); |
|
|
325 |
|
|
326 return m; |
|
|
327 } |
|
|
328 |
|
|
329 DEFUN ("ones", Fones, Sones, 3, 1, |
|
|
330 "ones (N), ones (N, M), ones (X): create a matrix of all ones") |
|
|
331 { |
|
|
332 Octave_object retval; |
|
|
333 |
|
|
334 int nargin = args.length (); |
|
|
335 |
|
|
336 switch (nargin) |
|
|
337 { |
|
610
|
338 case 1: |
|
|
339 retval = 1.0; |
|
|
340 break; |
|
523
|
341 case 2: |
|
|
342 retval = fill_matrix (args(1), 1.0, "ones"); |
|
|
343 break; |
|
|
344 case 3: |
|
|
345 retval = fill_matrix (args(1), args(2), 1.0, "ones"); |
|
|
346 break; |
|
|
347 default: |
|
|
348 print_usage ("ones"); |
|
|
349 break; |
|
|
350 } |
|
|
351 |
|
|
352 return retval; |
|
|
353 } |
|
|
354 |
|
|
355 DEFUN ("zeros", Fzeros, Szeros, 3, 1, |
|
|
356 "zeros (N), zeros (N, M), zeros (X): create a matrix of all zeros") |
|
|
357 { |
|
|
358 Octave_object retval; |
|
|
359 |
|
|
360 int nargin = args.length (); |
|
|
361 |
|
|
362 switch (nargin) |
|
|
363 { |
|
610
|
364 case 1: |
|
|
365 retval = 0.0; |
|
|
366 break; |
|
523
|
367 case 2: |
|
|
368 retval = fill_matrix (args(1), 0.0, "zeros"); |
|
|
369 break; |
|
|
370 case 3: |
|
|
371 retval = fill_matrix (args(1), args(2), 0.0, "zeros"); |
|
|
372 break; |
|
|
373 default: |
|
|
374 print_usage ("zeros"); |
|
|
375 break; |
|
|
376 } |
|
|
377 |
|
|
378 return retval; |
|
|
379 } |
|
|
380 |
|
|
381 static tree_constant |
|
|
382 identity_matrix (const tree_constant& a) |
|
|
383 { |
|
|
384 int nr, nc; |
|
|
385 get_dimensions (a, "eye", nr, nc); // May set error_state. |
|
|
386 |
|
|
387 if (error_state) |
|
|
388 return tree_constant (); |
|
|
389 |
|
|
390 Matrix m (nr, nc, 0.0); |
|
|
391 |
|
|
392 if (nr > 0 && nc > 0) |
|
|
393 { |
|
|
394 int n = MIN (nr, nc); |
|
|
395 for (int i = 0; i < n; i++) |
|
|
396 m.elem (i, i) = 1.0; |
|
|
397 } |
|
|
398 |
|
|
399 return m; |
|
|
400 } |
|
|
401 |
|
|
402 static tree_constant |
|
|
403 identity_matrix (const tree_constant& a, const tree_constant& b) |
|
|
404 { |
|
|
405 int nr, nc; |
|
|
406 get_dimensions (a, b, "eye", nr, nc); // May set error_state. |
|
|
407 |
|
|
408 if (error_state) |
|
|
409 return tree_constant (); |
|
|
410 |
|
|
411 Matrix m (nr, nc, 0.0); |
|
|
412 |
|
|
413 if (nr > 0 && nc > 0) |
|
|
414 { |
|
|
415 int n = MIN (nr, nc); |
|
|
416 for (int i = 0; i < n; i++) |
|
|
417 m.elem (i, i) = 1.0; |
|
|
418 } |
|
|
419 |
|
|
420 return m; |
|
|
421 } |
|
|
422 |
|
|
423 DEFUN ("eye", Feye, Seye, 3, 1, |
|
|
424 "eye (N), eye (N, M), eye (X): create an identity matrix") |
|
|
425 { |
|
|
426 Octave_object retval; |
|
|
427 |
|
|
428 int nargin = args.length (); |
|
|
429 |
|
|
430 switch (nargin) |
|
|
431 { |
|
610
|
432 case 1: |
|
|
433 retval = 1.0; |
|
|
434 break; |
|
523
|
435 case 2: |
|
|
436 retval = identity_matrix (args(1)); |
|
|
437 break; |
|
|
438 case 3: |
|
|
439 retval = identity_matrix (args(1), args(2)); |
|
|
440 break; |
|
|
441 default: |
|
|
442 print_usage ("eye"); |
|
|
443 break; |
|
|
444 } |
|
|
445 |
|
|
446 return retval; |
|
|
447 } |
|
|
448 |
|
|
449 /* |
|
|
450 ;;; Local Variables: *** |
|
|
451 ;;; mode: C++ *** |
|
|
452 ;;; page-delimiter: "^/\\*" *** |
|
|
453 ;;; End: *** |
|
|
454 */ |
