|
523
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
523
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
523
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #ifdef HAVE_CONFIG_H |
|
1192
|
24 #include <config.h> |
|
523
|
25 #endif |
|
|
26 |
|
2184
|
27 #include <cfloat> |
|
|
28 #include <cmath> |
|
|
29 |
|
1728
|
30 #include <string> |
|
|
31 |
|
2184
|
32 #include "lo-ieee.h" |
|
1755
|
33 #include "str-vec.h" |
|
|
34 |
|
1352
|
35 #include "defun.h" |
|
|
36 #include "error.h" |
|
|
37 #include "gripes.h" |
|
|
38 #include "oct-map.h" |
|
2366
|
39 #include "ov.h" |
|
|
40 #include "variables.h" |
|
1742
|
41 #include "oct-obj.h" |
|
523
|
42 #include "utils.h" |
|
|
43 |
|
|
44 #ifndef MIN |
|
|
45 #define MIN(a,b) ((a) < (b) ? (a) : (b)) |
|
|
46 #endif |
|
|
47 |
|
767
|
48 #ifndef ABS |
|
|
49 #define ABS(x) (((x) < 0) ? (-x) : (x)) |
|
|
50 #endif |
|
|
51 |
|
2188
|
52 // Should expressions like ones (-1, 5) result in an empty matrix or |
|
|
53 // an error? A positive value means yes. A negative value means |
|
|
54 // yes, but print a warning message. Zero means it should be |
|
|
55 // considered an error. |
|
|
56 static int Vtreat_neg_dim_as_zero; |
|
|
57 |
|
1957
|
58 DEFUN (all, args, , |
|
523
|
59 "all (X): are all elements of X nonzero?") |
|
|
60 { |
|
2086
|
61 octave_value_list retval; |
|
523
|
62 |
|
|
63 int nargin = args.length (); |
|
|
64 |
|
712
|
65 if (nargin == 1 && args(0).is_defined ()) |
|
|
66 retval = args(0).all (); |
|
|
67 else |
|
523
|
68 print_usage ("all"); |
|
|
69 |
|
|
70 return retval; |
|
|
71 } |
|
|
72 |
|
1957
|
73 DEFUN (any, args, , |
|
523
|
74 "any (X): are any elements of X nonzero?") |
|
|
75 { |
|
2086
|
76 octave_value_list retval; |
|
523
|
77 |
|
|
78 int nargin = args.length (); |
|
|
79 |
|
712
|
80 if (nargin == 1 && args(0).is_defined ()) |
|
|
81 retval = args(0).any (); |
|
|
82 else |
|
523
|
83 print_usage ("any"); |
|
|
84 |
|
|
85 return retval; |
|
|
86 } |
|
|
87 |
|
649
|
88 // These mapping functions may also be useful in other places, eh? |
|
|
89 |
|
|
90 typedef double (*d_dd_fcn) (double, double); |
|
|
91 |
|
|
92 static Matrix |
|
2672
|
93 map_d_m (d_dd_fcn f, double x, const Matrix& y) |
|
649
|
94 { |
|
|
95 int nr = y.rows (); |
|
|
96 int nc = y.columns (); |
|
|
97 |
|
|
98 Matrix retval (nr, nc); |
|
|
99 |
|
|
100 for (int j = 0; j < nc; j++) |
|
|
101 for (int i = 0; i < nr; i++) |
|
2305
|
102 retval (i, j) = f (x, y (i, j)); |
|
649
|
103 |
|
|
104 return retval; |
|
|
105 } |
|
|
106 |
|
|
107 static Matrix |
|
2672
|
108 map_m_d (d_dd_fcn f, const Matrix& x, double y) |
|
649
|
109 { |
|
|
110 int nr = x.rows (); |
|
|
111 int nc = x.columns (); |
|
|
112 |
|
|
113 Matrix retval (nr, nc); |
|
|
114 |
|
|
115 for (int j = 0; j < nc; j++) |
|
|
116 for (int i = 0; i < nr; i++) |
|
2305
|
117 retval (i, j) = f (x (i, j), y); |
|
649
|
118 |
|
|
119 return retval; |
|
|
120 } |
|
|
121 |
|
|
122 static Matrix |
|
2672
|
123 map_m_m (d_dd_fcn f, const Matrix& x, const Matrix& y) |
|
649
|
124 { |
|
|
125 int x_nr = x.rows (); |
|
|
126 int x_nc = x.columns (); |
|
|
127 |
|
|
128 int y_nr = y.rows (); |
|
|
129 int y_nc = y.columns (); |
|
|
130 |
|
719
|
131 assert (x_nr == y_nr && x_nc == y_nc); |
|
649
|
132 |
|
|
133 Matrix retval (x_nr, x_nc); |
|
|
134 |
|
|
135 for (int j = 0; j < x_nc; j++) |
|
|
136 for (int i = 0; i < x_nr; i++) |
|
2305
|
137 retval (i, j) = f (x (i, j), y (i, j)); |
|
649
|
138 |
|
|
139 return retval; |
|
|
140 } |
|
|
141 |
|
1957
|
142 DEFUN (atan2, args, , |
|
649
|
143 "atan2 (Y, X): atan (Y / X) in range -pi to pi") |
|
|
144 { |
|
2086
|
145 octave_value_list retval; |
|
649
|
146 |
|
712
|
147 int nargin = args.length (); |
|
|
148 |
|
|
149 if (nargin == 2 && args(0).is_defined () && args(1).is_defined ()) |
|
649
|
150 { |
|
2086
|
151 octave_value arg_y = args(0); |
|
|
152 octave_value arg_x = args(1); |
|
649
|
153 |
|
|
154 int y_nr = arg_y.rows (); |
|
|
155 int y_nc = arg_y.columns (); |
|
|
156 |
|
|
157 int x_nr = arg_x.rows (); |
|
|
158 int x_nc = arg_x.columns (); |
|
|
159 |
|
|
160 int arg_y_empty = empty_arg ("atan2", y_nr, y_nc); |
|
|
161 int arg_x_empty = empty_arg ("atan2", x_nr, x_nc); |
|
|
162 |
|
719
|
163 if (arg_y_empty > 0 && arg_x_empty > 0) |
|
|
164 return Matrix (); |
|
|
165 else if (arg_y_empty || arg_x_empty) |
|
649
|
166 return retval; |
|
|
167 |
|
|
168 int y_is_scalar = (y_nr == 1 && y_nc == 1); |
|
|
169 int x_is_scalar = (x_nr == 1 && x_nc == 1); |
|
|
170 |
|
|
171 if (y_is_scalar && x_is_scalar) |
|
|
172 { |
|
|
173 double y = arg_y.double_value (); |
|
|
174 |
|
|
175 if (! error_state) |
|
|
176 { |
|
|
177 double x = arg_x.double_value (); |
|
|
178 |
|
|
179 if (! error_state) |
|
|
180 retval = atan2 (y, x); |
|
|
181 } |
|
|
182 } |
|
|
183 else if (y_is_scalar) |
|
|
184 { |
|
|
185 double y = arg_y.double_value (); |
|
|
186 |
|
|
187 if (! error_state) |
|
|
188 { |
|
|
189 Matrix x = arg_x.matrix_value (); |
|
|
190 |
|
|
191 if (! error_state) |
|
2672
|
192 retval = map_d_m (atan2, y, x); |
|
649
|
193 } |
|
|
194 } |
|
|
195 else if (x_is_scalar) |
|
|
196 { |
|
|
197 Matrix y = arg_y.matrix_value (); |
|
|
198 |
|
|
199 if (! error_state) |
|
|
200 { |
|
|
201 double x = arg_x.double_value (); |
|
|
202 |
|
|
203 if (! error_state) |
|
2672
|
204 retval = map_m_d (atan2, y, x); |
|
649
|
205 } |
|
|
206 } |
|
|
207 else if (y_nr == x_nr && y_nc == x_nc) |
|
|
208 { |
|
|
209 Matrix y = arg_y.matrix_value (); |
|
|
210 |
|
|
211 if (! error_state) |
|
|
212 { |
|
|
213 Matrix x = arg_x.matrix_value (); |
|
|
214 |
|
|
215 if (! error_state) |
|
2672
|
216 retval = map_m_m (atan2, y, x); |
|
649
|
217 } |
|
|
218 } |
|
|
219 else |
|
|
220 error ("atan2: nonconformant matrices"); |
|
|
221 } |
|
712
|
222 else |
|
|
223 print_usage ("atan2"); |
|
649
|
224 |
|
|
225 return retval; |
|
|
226 } |
|
|
227 |
|
1957
|
228 DEFUN (cumprod, args, , |
|
523
|
229 "cumprod (X): cumulative products") |
|
|
230 { |
|
2086
|
231 octave_value_list retval; |
|
523
|
232 |
|
|
233 int nargin = args.length (); |
|
|
234 |
|
760
|
235 if (nargin == 1) |
|
|
236 { |
|
2086
|
237 octave_value arg = args(0); |
|
760
|
238 |
|
|
239 if (arg.is_real_type ()) |
|
|
240 { |
|
|
241 Matrix tmp = arg.matrix_value (); |
|
|
242 |
|
|
243 if (! error_state) |
|
|
244 retval(0) = tmp.cumprod (); |
|
|
245 } |
|
|
246 else if (arg.is_complex_type ()) |
|
|
247 { |
|
|
248 ComplexMatrix tmp = arg.complex_matrix_value (); |
|
|
249 |
|
|
250 if (! error_state) |
|
|
251 retval(0) = tmp.cumprod (); |
|
|
252 } |
|
|
253 else |
|
|
254 { |
|
|
255 gripe_wrong_type_arg ("cumprod", arg); |
|
|
256 return retval; |
|
|
257 } |
|
|
258 } |
|
712
|
259 else |
|
523
|
260 print_usage ("cumprod"); |
|
|
261 |
|
|
262 return retval; |
|
|
263 } |
|
|
264 |
|
1957
|
265 DEFUN (cumsum, args, , |
|
523
|
266 "cumsum (X): cumulative sums") |
|
|
267 { |
|
2086
|
268 octave_value_list retval; |
|
523
|
269 |
|
|
270 int nargin = args.length (); |
|
|
271 |
|
760
|
272 if (nargin == 1) |
|
|
273 { |
|
2086
|
274 octave_value arg = args(0); |
|
760
|
275 |
|
|
276 if (arg.is_real_type ()) |
|
|
277 { |
|
|
278 Matrix tmp = arg.matrix_value (); |
|
|
279 |
|
|
280 if (! error_state) |
|
|
281 retval(0) = tmp.cumsum (); |
|
|
282 } |
|
|
283 else if (arg.is_complex_type ()) |
|
|
284 { |
|
|
285 ComplexMatrix tmp = arg.complex_matrix_value (); |
|
|
286 |
|
|
287 if (! error_state) |
|
|
288 retval(0) = tmp.cumsum (); |
|
|
289 } |
|
|
290 else |
|
|
291 { |
|
|
292 gripe_wrong_type_arg ("cumsum", arg); |
|
|
293 return retval; |
|
|
294 } |
|
|
295 } |
|
712
|
296 else |
|
523
|
297 print_usage ("cumsum"); |
|
|
298 |
|
|
299 return retval; |
|
|
300 } |
|
|
301 |
|
2086
|
302 static octave_value |
|
767
|
303 make_diag (const Matrix& v, int k) |
|
|
304 { |
|
|
305 int nr = v.rows (); |
|
|
306 int nc = v.columns (); |
|
|
307 assert (nc == 1 || nr == 1); |
|
|
308 |
|
2086
|
309 octave_value retval; |
|
767
|
310 |
|
|
311 int roff = 0; |
|
|
312 int coff = 0; |
|
|
313 if (k > 0) |
|
|
314 { |
|
|
315 roff = 0; |
|
|
316 coff = k; |
|
|
317 } |
|
|
318 else if (k < 0) |
|
|
319 { |
|
|
320 roff = -k; |
|
|
321 coff = 0; |
|
|
322 } |
|
|
323 |
|
|
324 if (nr == 1) |
|
|
325 { |
|
|
326 int n = nc + ABS (k); |
|
|
327 Matrix m (n, n, 0.0); |
|
|
328 for (int i = 0; i < nc; i++) |
|
2305
|
329 m (i+roff, i+coff) = v (0, i); |
|
2086
|
330 retval = octave_value (m); |
|
767
|
331 } |
|
|
332 else |
|
|
333 { |
|
|
334 int n = nr + ABS (k); |
|
|
335 Matrix m (n, n, 0.0); |
|
|
336 for (int i = 0; i < nr; i++) |
|
2305
|
337 m (i+roff, i+coff) = v (i, 0); |
|
2086
|
338 retval = octave_value (m); |
|
767
|
339 } |
|
|
340 |
|
|
341 return retval; |
|
|
342 } |
|
|
343 |
|
2086
|
344 static octave_value |
|
767
|
345 make_diag (const ComplexMatrix& v, int k) |
|
|
346 { |
|
|
347 int nr = v.rows (); |
|
|
348 int nc = v.columns (); |
|
|
349 assert (nc == 1 || nr == 1); |
|
|
350 |
|
2086
|
351 octave_value retval; |
|
767
|
352 |
|
|
353 int roff = 0; |
|
|
354 int coff = 0; |
|
|
355 if (k > 0) |
|
|
356 { |
|
|
357 roff = 0; |
|
|
358 coff = k; |
|
|
359 } |
|
|
360 else if (k < 0) |
|
|
361 { |
|
|
362 roff = -k; |
|
|
363 coff = 0; |
|
|
364 } |
|
|
365 |
|
|
366 if (nr == 1) |
|
|
367 { |
|
|
368 int n = nc + ABS (k); |
|
|
369 ComplexMatrix m (n, n, 0.0); |
|
|
370 for (int i = 0; i < nc; i++) |
|
2305
|
371 m (i+roff, i+coff) = v (0, i); |
|
2086
|
372 retval = octave_value (m); |
|
767
|
373 } |
|
|
374 else |
|
|
375 { |
|
|
376 int n = nr + ABS (k); |
|
|
377 ComplexMatrix m (n, n, 0.0); |
|
|
378 for (int i = 0; i < nr; i++) |
|
2305
|
379 m (i+roff, i+coff) = v (i, 0); |
|
2086
|
380 retval = octave_value (m); |
|
767
|
381 } |
|
|
382 |
|
|
383 return retval; |
|
|
384 } |
|
|
385 |
|
2086
|
386 static octave_value |
|
|
387 make_diag (const octave_value& arg) |
|
767
|
388 { |
|
2086
|
389 octave_value retval; |
|
767
|
390 |
|
|
391 if (arg.is_real_type ()) |
|
|
392 { |
|
|
393 Matrix m = arg.matrix_value (); |
|
|
394 |
|
|
395 if (! error_state) |
|
|
396 { |
|
|
397 int nr = m.rows (); |
|
|
398 int nc = m.columns (); |
|
|
399 |
|
|
400 if (nr == 0 || nc == 0) |
|
|
401 retval = Matrix (); |
|
|
402 else if (nr == 1 || nc == 1) |
|
|
403 retval = make_diag (m, 0); |
|
|
404 else |
|
|
405 { |
|
|
406 ColumnVector v = m.diag (); |
|
|
407 if (v.capacity () > 0) |
|
|
408 retval = v; |
|
|
409 } |
|
|
410 } |
|
|
411 else |
|
|
412 gripe_wrong_type_arg ("diag", arg); |
|
|
413 } |
|
|
414 else if (arg.is_complex_type ()) |
|
|
415 { |
|
|
416 ComplexMatrix cm = arg.complex_matrix_value (); |
|
|
417 |
|
|
418 if (! error_state) |
|
|
419 { |
|
|
420 int nr = cm.rows (); |
|
|
421 int nc = cm.columns (); |
|
|
422 |
|
|
423 if (nr == 0 || nc == 0) |
|
|
424 retval = Matrix (); |
|
|
425 else if (nr == 1 || nc == 1) |
|
|
426 retval = make_diag (cm, 0); |
|
|
427 else |
|
|
428 { |
|
|
429 ComplexColumnVector v = cm.diag (); |
|
|
430 if (v.capacity () > 0) |
|
|
431 retval = v; |
|
|
432 } |
|
|
433 } |
|
|
434 else |
|
|
435 gripe_wrong_type_arg ("diag", arg); |
|
|
436 } |
|
|
437 else |
|
|
438 gripe_wrong_type_arg ("diag", arg); |
|
|
439 |
|
|
440 return retval; |
|
|
441 } |
|
|
442 |
|
2086
|
443 static octave_value |
|
|
444 make_diag (const octave_value& a, const octave_value& b) |
|
767
|
445 { |
|
2086
|
446 octave_value retval; |
|
767
|
447 |
|
3202
|
448 int k = b.nint_value (); |
|
767
|
449 |
|
|
450 if (error_state) |
|
|
451 { |
|
|
452 error ("diag: invalid second argument"); |
|
|
453 return retval; |
|
|
454 } |
|
|
455 |
|
|
456 int n = ABS (k) + 1; |
|
|
457 |
|
|
458 if (a.is_real_type ()) |
|
|
459 { |
|
|
460 if (a.is_scalar_type ()) |
|
|
461 { |
|
|
462 double d = a.double_value (); |
|
|
463 |
|
|
464 if (k == 0) |
|
|
465 retval = d; |
|
|
466 else if (k > 0) |
|
|
467 { |
|
|
468 Matrix m (n, n, 0.0); |
|
2305
|
469 m (0, k) = d; |
|
767
|
470 retval = m; |
|
|
471 } |
|
|
472 else if (k < 0) |
|
|
473 { |
|
|
474 Matrix m (n, n, 0.0); |
|
2305
|
475 m (-k, 0) = d; |
|
767
|
476 retval = m; |
|
|
477 } |
|
|
478 } |
|
|
479 else if (a.is_matrix_type ()) |
|
|
480 { |
|
|
481 Matrix m = a.matrix_value (); |
|
|
482 |
|
|
483 int nr = m.rows (); |
|
|
484 int nc = m.columns (); |
|
|
485 |
|
|
486 if (nr == 0 || nc == 0) |
|
|
487 retval = Matrix (); |
|
|
488 else if (nr == 1 || nc == 1) |
|
|
489 retval = make_diag (m, k); |
|
|
490 else |
|
|
491 { |
|
|
492 ColumnVector d = m.diag (k); |
|
|
493 retval = d; |
|
|
494 } |
|
|
495 } |
|
|
496 else |
|
|
497 gripe_wrong_type_arg ("diag", a); |
|
|
498 } |
|
|
499 else if (a.is_complex_type ()) |
|
|
500 { |
|
|
501 if (a.is_scalar_type ()) |
|
|
502 { |
|
|
503 Complex c = a.complex_value (); |
|
|
504 |
|
|
505 if (k == 0) |
|
|
506 retval = c; |
|
|
507 else if (k > 0) |
|
|
508 { |
|
|
509 ComplexMatrix m (n, n, 0.0); |
|
2305
|
510 m (0, k) = c; |
|
767
|
511 retval = m; |
|
|
512 } |
|
|
513 else if (k < 0) |
|
|
514 { |
|
|
515 ComplexMatrix m (n, n, 0.0); |
|
2305
|
516 m (-k, 0) = c; |
|
767
|
517 retval = m; |
|
|
518 } |
|
|
519 } |
|
|
520 else if (a.is_matrix_type ()) |
|
|
521 { |
|
|
522 ComplexMatrix cm = a.complex_matrix_value (); |
|
|
523 |
|
|
524 int nr = cm.rows (); |
|
|
525 int nc = cm.columns (); |
|
|
526 |
|
|
527 if (nr == 0 || nc == 0) |
|
|
528 retval = Matrix (); |
|
|
529 else if (nr == 1 || nc == 1) |
|
|
530 retval = make_diag (cm, k); |
|
|
531 else |
|
|
532 { |
|
|
533 ComplexColumnVector d = cm.diag (k); |
|
|
534 retval = d; |
|
|
535 } |
|
|
536 } |
|
|
537 else |
|
|
538 gripe_wrong_type_arg ("diag", a); |
|
|
539 } |
|
|
540 else |
|
|
541 gripe_wrong_type_arg ("diag", a); |
|
|
542 |
|
|
543 return retval; |
|
|
544 } |
|
|
545 |
|
1957
|
546 DEFUN (diag, args, , |
|
523
|
547 "diag (X [,k]): form/extract diagonals") |
|
|
548 { |
|
2086
|
549 octave_value_list retval; |
|
523
|
550 |
|
|
551 int nargin = args.length (); |
|
|
552 |
|
712
|
553 if (nargin == 1 && args(0).is_defined ()) |
|
767
|
554 retval = make_diag (args(0)); |
|
712
|
555 else if (nargin == 2 && args(0).is_defined () && args(1).is_defined ()) |
|
767
|
556 retval = make_diag (args(0), args(1)); |
|
523
|
557 else |
|
|
558 print_usage ("diag"); |
|
|
559 |
|
|
560 return retval; |
|
|
561 } |
|
|
562 |
|
1957
|
563 DEFUN (prod, args, , |
|
523
|
564 "prod (X): products") |
|
|
565 { |
|
2086
|
566 octave_value_list retval; |
|
523
|
567 |
|
|
568 int nargin = args.length (); |
|
|
569 |
|
760
|
570 if (nargin == 1) |
|
|
571 { |
|
2086
|
572 octave_value arg = args(0); |
|
760
|
573 |
|
|
574 if (arg.is_real_type ()) |
|
|
575 { |
|
|
576 Matrix tmp = arg.matrix_value (); |
|
|
577 |
|
|
578 if (! error_state) |
|
|
579 retval(0) = tmp.prod (); |
|
|
580 } |
|
|
581 else if (arg.is_complex_type ()) |
|
|
582 { |
|
|
583 ComplexMatrix tmp = arg.complex_matrix_value (); |
|
|
584 |
|
|
585 if (! error_state) |
|
|
586 retval(0) = tmp.prod (); |
|
|
587 } |
|
|
588 else |
|
|
589 { |
|
|
590 gripe_wrong_type_arg ("prod", arg); |
|
|
591 return retval; |
|
|
592 } |
|
|
593 } |
|
712
|
594 else |
|
523
|
595 print_usage ("prod"); |
|
|
596 |
|
|
597 return retval; |
|
|
598 } |
|
|
599 |
|
3195
|
600 DEFUN (length, args, , |
|
|
601 "length (x): return the `length' of the object X\n\ |
|
|
602 \n\ |
|
|
603 For matrix objects, the length is the number of rows or columns,\n\ |
|
|
604 whichever is greater (this odd definition is used for compatibility\n\ |
|
|
605 with Matlab).\n\ |
|
|
606 \n\ |
|
|
607 See also: size, rows, columns, is_scalar, is_vector, is_matrix") |
|
|
608 { |
|
|
609 octave_value retval; |
|
|
610 |
|
|
611 if (args.length () == 1) |
|
|
612 { |
|
|
613 int len = args(0).length (); |
|
|
614 |
|
|
615 if (! error_state) |
|
|
616 retval = static_cast<double> (len); |
|
|
617 } |
|
|
618 else |
|
|
619 print_usage ("length"); |
|
|
620 |
|
|
621 return retval; |
|
|
622 } |
|
|
623 |
|
1957
|
624 DEFUN (size, args, nargout, |
|
1032
|
625 "[m, n] = size (x): return rows and columns of X\n\ |
|
1031
|
626 \n\ |
|
|
627 d = size (x): return number of rows and columns of x as a row vector\n\ |
|
|
628 \n\ |
|
|
629 m = size (x, 1): return number of rows in x\n\ |
|
|
630 m = size (x, 2): return number of columns in x") |
|
523
|
631 { |
|
2086
|
632 octave_value_list retval; |
|
523
|
633 |
|
|
634 int nargin = args.length (); |
|
|
635 |
|
1031
|
636 if (nargin == 1 && nargout < 3) |
|
523
|
637 { |
|
712
|
638 int nr = args(0).rows (); |
|
|
639 int nc = args(0).columns (); |
|
1031
|
640 |
|
712
|
641 if (nargout == 0 || nargout == 1) |
|
523
|
642 { |
|
712
|
643 Matrix m (1, 2); |
|
2305
|
644 m (0, 0) = nr; |
|
|
645 m (0, 1) = nc; |
|
712
|
646 retval = m; |
|
523
|
647 } |
|
712
|
648 else if (nargout == 2) |
|
|
649 { |
|
2800
|
650 retval(1) = static_cast<double> (nc); |
|
|
651 retval(0) = static_cast<double> (nr); |
|
712
|
652 } |
|
1031
|
653 } |
|
|
654 else if (nargin == 2 && nargout < 2) |
|
|
655 { |
|
3202
|
656 int nd = args(1).nint_value (); |
|
1031
|
657 |
|
|
658 if (error_state) |
|
|
659 error ("size: expecting scalar as second argument"); |
|
712
|
660 else |
|
1031
|
661 { |
|
|
662 if (nd == 1) |
|
2800
|
663 retval(0) = static_cast<double> (args(0).rows ()); |
|
1031
|
664 else if (nd == 2) |
|
2800
|
665 retval(0) = static_cast<double> (args(0).columns ()); |
|
1031
|
666 else |
|
|
667 error ("size: invalid second argument -- expecting 1 or 2"); |
|
|
668 } |
|
523
|
669 } |
|
712
|
670 else |
|
|
671 print_usage ("size"); |
|
523
|
672 |
|
|
673 return retval; |
|
|
674 } |
|
|
675 |
|
1957
|
676 DEFUN (sum, args, , |
|
523
|
677 "sum (X): sum of elements") |
|
|
678 { |
|
2086
|
679 octave_value_list retval; |
|
523
|
680 |
|
|
681 int nargin = args.length (); |
|
|
682 |
|
760
|
683 if (nargin == 1) |
|
|
684 { |
|
2086
|
685 octave_value arg = args(0); |
|
760
|
686 |
|
|
687 if (arg.is_real_type ()) |
|
|
688 { |
|
|
689 Matrix tmp = arg.matrix_value (); |
|
|
690 |
|
|
691 if (! error_state) |
|
|
692 retval(0) = tmp.sum (); |
|
|
693 } |
|
|
694 else if (arg.is_complex_type ()) |
|
|
695 { |
|
|
696 ComplexMatrix tmp = arg.complex_matrix_value (); |
|
|
697 |
|
|
698 if (! error_state) |
|
|
699 retval(0) = tmp.sum (); |
|
|
700 } |
|
|
701 else |
|
|
702 { |
|
|
703 gripe_wrong_type_arg ("sum", arg); |
|
|
704 return retval; |
|
|
705 } |
|
|
706 } |
|
523
|
707 else |
|
712
|
708 print_usage ("sum"); |
|
523
|
709 |
|
|
710 return retval; |
|
|
711 } |
|
|
712 |
|
1957
|
713 DEFUN (sumsq, args, , |
|
3095
|
714 "sumsq (X): sum of squares of elements.\n\ |
|
|
715 \n\ |
|
|
716 This function is equivalent to computing\n\ |
|
|
717 \n\ |
|
|
718 sum (X .* conj (X))\n\ |
|
|
719 \n\ |
|
|
720 but it uses less memory and avoids calling conj if X is real.") |
|
523
|
721 { |
|
2086
|
722 octave_value_list retval; |
|
523
|
723 |
|
|
724 int nargin = args.length (); |
|
|
725 |
|
760
|
726 if (nargin == 1) |
|
|
727 { |
|
2086
|
728 octave_value arg = args(0); |
|
760
|
729 |
|
|
730 if (arg.is_real_type ()) |
|
|
731 { |
|
|
732 Matrix tmp = arg.matrix_value (); |
|
|
733 |
|
|
734 if (! error_state) |
|
|
735 retval(0) = tmp.sumsq (); |
|
|
736 } |
|
|
737 else if (arg.is_complex_type ()) |
|
|
738 { |
|
|
739 ComplexMatrix tmp = arg.complex_matrix_value (); |
|
|
740 |
|
|
741 if (! error_state) |
|
|
742 retval(0) = tmp.sumsq (); |
|
|
743 } |
|
|
744 else |
|
|
745 { |
|
|
746 gripe_wrong_type_arg ("sumsq", arg); |
|
|
747 return retval; |
|
|
748 } |
|
|
749 } |
|
712
|
750 else |
|
523
|
751 print_usage ("sumsq"); |
|
|
752 |
|
|
753 return retval; |
|
|
754 } |
|
|
755 |
|
3209
|
756 DEFUN (is_bool, args, , |
|
|
757 "is_bool (x): return nonzero if x is a boolean object") |
|
|
758 { |
|
|
759 octave_value retval; |
|
|
760 |
|
|
761 if (args.length () == 1) |
|
3258
|
762 retval = args(0).is_bool_type (); |
|
3209
|
763 else |
|
|
764 print_usage ("is_bool"); |
|
|
765 |
|
|
766 return retval; |
|
|
767 } |
|
|
768 |
|
|
769 DEFALIAS (islogical, is_bool); |
|
|
770 |
|
3186
|
771 DEFUN (is_complex, args, , |
|
3258
|
772 "is_complex (x): return nonzero if x is a complex-valued numeric object") |
|
3186
|
773 { |
|
|
774 octave_value retval; |
|
|
775 |
|
|
776 if (args.length () == 1) |
|
3258
|
777 retval = args(0).is_complex_type (); |
|
3186
|
778 else |
|
|
779 print_usage ("is_complex"); |
|
|
780 |
|
|
781 return retval; |
|
|
782 } |
|
|
783 |
|
3258
|
784 DEFUN (isreal, args, , |
|
|
785 "isreal (x): return nonzero if x is a real-valued numeric object") |
|
|
786 { |
|
|
787 octave_value retval; |
|
|
788 |
|
|
789 if (args.length () == 1) |
|
|
790 retval = args(0).is_real_type (); |
|
|
791 else |
|
|
792 print_usage ("isreal"); |
|
|
793 |
|
|
794 return retval; |
|
|
795 } |
|
|
796 |
|
3202
|
797 DEFUN (isempty, args, , |
|
3215
|
798 "isempty (x): return nonzero if x is an empty matrix, string, or list") |
|
3202
|
799 { |
|
|
800 double retval = 0.0; |
|
|
801 |
|
|
802 if (args.length () == 1) |
|
|
803 { |
|
|
804 octave_value arg = args(0); |
|
|
805 |
|
|
806 if (arg.is_matrix_type ()) |
|
|
807 retval = static_cast<double> (arg.rows () == 0 || arg.columns () == 0); |
|
3215
|
808 else if (arg.is_list () || arg.is_string ()) |
|
3202
|
809 retval = static_cast<double> (arg.length () == 0); |
|
|
810 } |
|
|
811 else |
|
|
812 print_usage ("isempty"); |
|
|
813 |
|
|
814 return retval; |
|
|
815 } |
|
|
816 |
|
3206
|
817 DEFUN (isnumeric, args, , |
|
|
818 "isnumeric (x): return nonzero if x is a numeric object") |
|
|
819 { |
|
|
820 octave_value retval; |
|
|
821 |
|
|
822 if (args.length () == 1) |
|
3258
|
823 retval = args(0).is_numeric_type (); |
|
3206
|
824 else |
|
3238
|
825 print_usage ("isnumeric"); |
|
3206
|
826 |
|
|
827 return retval; |
|
|
828 } |
|
|
829 |
|
3204
|
830 DEFUN (is_list, args, , |
|
|
831 "is_list (x): return nonzero if x is a list") |
|
|
832 { |
|
|
833 octave_value retval; |
|
|
834 |
|
|
835 if (args.length () == 1) |
|
3258
|
836 retval = args(0).is_list (); |
|
3204
|
837 else |
|
|
838 print_usage ("is_list"); |
|
|
839 |
|
|
840 return retval; |
|
|
841 } |
|
|
842 |
|
3202
|
843 DEFUN (is_matrix, args, , |
|
|
844 "is_matrix (x): return nonzero if x can be considered a matrix") |
|
|
845 { |
|
|
846 double retval = 0.0; |
|
|
847 |
|
|
848 if (args.length () == 1) |
|
|
849 { |
|
|
850 octave_value arg = args(0); |
|
|
851 |
|
3212
|
852 if (arg.is_scalar_type () || arg.is_range ()) |
|
3202
|
853 retval = 1.0; |
|
|
854 else if (arg.is_matrix_type ()) |
|
|
855 retval = static_cast<double> (arg.rows () >= 1 && arg.columns () >= 1); |
|
|
856 } |
|
|
857 else |
|
|
858 print_usage ("is_matrix"); |
|
|
859 |
|
|
860 return retval; |
|
|
861 } |
|
|
862 |
|
1957
|
863 DEFUN (is_struct, args, , |
|
939
|
864 "is_struct (x): return nonzero if x is a structure") |
|
|
865 { |
|
3186
|
866 octave_value retval; |
|
939
|
867 |
|
3186
|
868 if (args.length () == 1) |
|
3258
|
869 retval = args(0).is_map (); |
|
939
|
870 else |
|
|
871 print_usage ("is_struct"); |
|
|
872 |
|
|
873 return retval; |
|
|
874 } |
|
|
875 |
|
1957
|
876 DEFUN (struct_elements, args, , |
|
1402
|
877 "struct_elements (S)\n\ |
|
|
878 \n\ |
|
|
879 Return a list of the names of the elements of the structure S.") |
|
|
880 { |
|
2086
|
881 octave_value_list retval; |
|
1402
|
882 |
|
|
883 int nargin = args.length (); |
|
|
884 |
|
|
885 if (nargin == 1) |
|
|
886 { |
|
|
887 if (args (0).is_map ()) |
|
|
888 { |
|
|
889 Octave_map m = args(0).map_value (); |
|
1755
|
890 retval(0) = m.make_name_list (); |
|
1402
|
891 } |
|
|
892 else |
|
|
893 gripe_wrong_type_arg ("struct_elements", args (0)); |
|
|
894 } |
|
|
895 else |
|
|
896 print_usage ("struct_elements"); |
|
|
897 |
|
|
898 return retval; |
|
|
899 } |
|
|
900 |
|
1957
|
901 DEFUN (struct_contains, args, , |
|
1216
|
902 "struct_contains (S, NAME)\n\ |
|
|
903 \n\ |
|
2420
|
904 Return nonzero if S is a structure with element NAME.\n\ |
|
|
905 S must be a structure and NAME must be a string.") |
|
1216
|
906 { |
|
2086
|
907 octave_value_list retval; |
|
1216
|
908 |
|
|
909 int nargin = args.length (); |
|
|
910 |
|
|
911 if (nargin == 2) |
|
|
912 { |
|
|
913 retval = 0.0; |
|
2420
|
914 |
|
2963
|
915 // XXX FIXME XXX -- should this work for all types that can do |
|
|
916 // structure reference operations? |
|
|
917 |
|
1277
|
918 if (args(0).is_map () && args(1).is_string ()) |
|
1216
|
919 { |
|
1755
|
920 string s = args(1).string_value (); |
|
2963
|
921 octave_value tmp = args(0).do_struct_elt_index_op (s, true); |
|
2800
|
922 retval = static_cast<double> (tmp.is_defined ()); |
|
1216
|
923 } |
|
2420
|
924 else |
|
|
925 print_usage ("struct_contains"); |
|
1216
|
926 } |
|
|
927 else |
|
|
928 print_usage ("struct_contains"); |
|
|
929 |
|
|
930 return retval; |
|
|
931 } |
|
|
932 |
|
523
|
933 static void |
|
|
934 check_dimensions (int& nr, int& nc, const char *warnfor) |
|
|
935 { |
|
|
936 if (nr < 0 || nc < 0) |
|
|
937 { |
|
2188
|
938 if (Vtreat_neg_dim_as_zero) |
|
597
|
939 { |
|
|
940 nr = (nr < 0) ? 0 : nr; |
|
|
941 nc = (nc < 0) ? 0 : nc; |
|
1129
|
942 |
|
2188
|
943 if (Vtreat_neg_dim_as_zero < 0) |
|
1129
|
944 warning ("%s: converting negative dimension to zero", |
|
|
945 warnfor); |
|
597
|
946 } |
|
523
|
947 else |
|
|
948 error ("%s: can't create a matrix with negative dimensions", |
|
|
949 warnfor); |
|
|
950 } |
|
|
951 } |
|
|
952 |
|
|
953 static void |
|
2086
|
954 get_dimensions (const octave_value& a, const char *warn_for, |
|
523
|
955 int& nr, int& nc) |
|
|
956 { |
|
634
|
957 if (a.is_scalar_type ()) |
|
523
|
958 { |
|
3202
|
959 nr = nc = a.nint_value (); |
|
523
|
960 } |
|
|
961 else |
|
|
962 { |
|
634
|
963 nr = a.rows (); |
|
|
964 nc = a.columns (); |
|
523
|
965 |
|
|
966 if ((nr == 1 && nc == 2) || (nr == 2 && nc == 1)) |
|
|
967 { |
|
634
|
968 ColumnVector v = a.vector_value (); |
|
523
|
969 |
|
633
|
970 if (error_state) |
|
|
971 return; |
|
|
972 |
|
2305
|
973 nr = NINT (v (0)); |
|
|
974 nc = NINT (v (1)); |
|
523
|
975 } |
|
|
976 else |
|
|
977 warning ("%s (A): use %s (size (A)) instead", warn_for, warn_for); |
|
|
978 } |
|
|
979 |
|
|
980 check_dimensions (nr, nc, warn_for); // May set error_state. |
|
|
981 } |
|
|
982 |
|
|
983 static void |
|
2086
|
984 get_dimensions (const octave_value& a, const octave_value& b, |
|
523
|
985 const char *warn_for, int& nr, int& nc) |
|
|
986 { |
|
3202
|
987 nr = a.is_empty () ? 0 : a.nint_value (); |
|
|
988 nc = b.is_empty () ? 0 : b.nint_value (); |
|
523
|
989 |
|
634
|
990 if (error_state) |
|
|
991 error ("%s: expecting two scalar arguments", warn_for); |
|
523
|
992 else |
|
634
|
993 check_dimensions (nr, nc, warn_for); // May set error_state. |
|
523
|
994 } |
|
|
995 |
|
2086
|
996 static octave_value |
|
|
997 fill_matrix (const octave_value& a, double val, const char *warn_for) |
|
523
|
998 { |
|
|
999 int nr, nc; |
|
|
1000 get_dimensions (a, warn_for, nr, nc); |
|
|
1001 |
|
|
1002 if (error_state) |
|
2086
|
1003 return octave_value (); |
|
523
|
1004 |
|
|
1005 Matrix m (nr, nc, val); |
|
|
1006 |
|
|
1007 return m; |
|
|
1008 } |
|
|
1009 |
|
2086
|
1010 static octave_value |
|
|
1011 fill_matrix (const octave_value& a, const octave_value& b, |
|
523
|
1012 double val, const char *warn_for) |
|
|
1013 { |
|
|
1014 int nr, nc; |
|
|
1015 get_dimensions (a, b, warn_for, nr, nc); // May set error_state. |
|
|
1016 |
|
|
1017 if (error_state) |
|
2086
|
1018 return octave_value (); |
|
523
|
1019 |
|
|
1020 Matrix m (nr, nc, val); |
|
|
1021 |
|
|
1022 return m; |
|
|
1023 } |
|
|
1024 |
|
1957
|
1025 DEFUN (ones, args, , |
|
523
|
1026 "ones (N), ones (N, M), ones (X): create a matrix of all ones") |
|
|
1027 { |
|
2086
|
1028 octave_value_list retval; |
|
523
|
1029 |
|
|
1030 int nargin = args.length (); |
|
|
1031 |
|
|
1032 switch (nargin) |
|
|
1033 { |
|
712
|
1034 case 0: |
|
|
1035 retval = 1.0; |
|
|
1036 break; |
|
777
|
1037 |
|
610
|
1038 case 1: |
|
712
|
1039 retval = fill_matrix (args(0), 1.0, "ones"); |
|
610
|
1040 break; |
|
777
|
1041 |
|
523
|
1042 case 2: |
|
712
|
1043 retval = fill_matrix (args(0), args(1), 1.0, "ones"); |
|
523
|
1044 break; |
|
777
|
1045 |
|
523
|
1046 default: |
|
|
1047 print_usage ("ones"); |
|
|
1048 break; |
|
|
1049 } |
|
|
1050 |
|
|
1051 return retval; |
|
|
1052 } |
|
|
1053 |
|
1957
|
1054 DEFUN (zeros, args, , |
|
523
|
1055 "zeros (N), zeros (N, M), zeros (X): create a matrix of all zeros") |
|
|
1056 { |
|
2086
|
1057 octave_value_list retval; |
|
523
|
1058 |
|
|
1059 int nargin = args.length (); |
|
|
1060 |
|
|
1061 switch (nargin) |
|
|
1062 { |
|
712
|
1063 case 0: |
|
|
1064 retval = 0.0; |
|
|
1065 break; |
|
777
|
1066 |
|
610
|
1067 case 1: |
|
712
|
1068 retval = fill_matrix (args(0), 0.0, "zeros"); |
|
610
|
1069 break; |
|
777
|
1070 |
|
523
|
1071 case 2: |
|
712
|
1072 retval = fill_matrix (args(0), args(1), 0.0, "zeros"); |
|
523
|
1073 break; |
|
777
|
1074 |
|
523
|
1075 default: |
|
|
1076 print_usage ("zeros"); |
|
|
1077 break; |
|
|
1078 } |
|
|
1079 |
|
|
1080 return retval; |
|
|
1081 } |
|
|
1082 |
|
2086
|
1083 static octave_value |
|
|
1084 identity_matrix (const octave_value& a) |
|
523
|
1085 { |
|
|
1086 int nr, nc; |
|
|
1087 get_dimensions (a, "eye", nr, nc); // May set error_state. |
|
|
1088 |
|
|
1089 if (error_state) |
|
2086
|
1090 return octave_value (); |
|
523
|
1091 |
|
|
1092 Matrix m (nr, nc, 0.0); |
|
|
1093 |
|
|
1094 if (nr > 0 && nc > 0) |
|
|
1095 { |
|
|
1096 int n = MIN (nr, nc); |
|
|
1097 for (int i = 0; i < n; i++) |
|
2305
|
1098 m (i, i) = 1.0; |
|
523
|
1099 } |
|
|
1100 |
|
|
1101 return m; |
|
|
1102 } |
|
|
1103 |
|
2086
|
1104 static octave_value |
|
|
1105 identity_matrix (const octave_value& a, const octave_value& b) |
|
523
|
1106 { |
|
|
1107 int nr, nc; |
|
|
1108 get_dimensions (a, b, "eye", nr, nc); // May set error_state. |
|
|
1109 |
|
|
1110 if (error_state) |
|
2086
|
1111 return octave_value (); |
|
523
|
1112 |
|
|
1113 Matrix m (nr, nc, 0.0); |
|
|
1114 |
|
|
1115 if (nr > 0 && nc > 0) |
|
|
1116 { |
|
|
1117 int n = MIN (nr, nc); |
|
|
1118 for (int i = 0; i < n; i++) |
|
2305
|
1119 m (i, i) = 1.0; |
|
523
|
1120 } |
|
|
1121 |
|
|
1122 return m; |
|
|
1123 } |
|
|
1124 |
|
1957
|
1125 DEFUN (eye, args, , |
|
523
|
1126 "eye (N), eye (N, M), eye (X): create an identity matrix") |
|
|
1127 { |
|
2086
|
1128 octave_value_list retval; |
|
523
|
1129 |
|
|
1130 int nargin = args.length (); |
|
|
1131 |
|
|
1132 switch (nargin) |
|
|
1133 { |
|
712
|
1134 case 0: |
|
|
1135 retval = 1.0; |
|
|
1136 break; |
|
777
|
1137 |
|
610
|
1138 case 1: |
|
712
|
1139 retval = identity_matrix (args(0)); |
|
610
|
1140 break; |
|
777
|
1141 |
|
523
|
1142 case 2: |
|
712
|
1143 retval = identity_matrix (args(0), args(1)); |
|
523
|
1144 break; |
|
777
|
1145 |
|
523
|
1146 default: |
|
|
1147 print_usage ("eye"); |
|
|
1148 break; |
|
|
1149 } |
|
|
1150 |
|
|
1151 return retval; |
|
|
1152 } |
|
|
1153 |
|
1957
|
1154 DEFUN (linspace, args, , |
|
1100
|
1155 "usage: linspace (x1, x2, n)\n\ |
|
|
1156 \n\ |
|
|
1157 Return a vector of n equally spaced points between x1 and x2\n\ |
|
|
1158 inclusive.\n\ |
|
|
1159 \n\ |
|
|
1160 If the final argument is omitted, n = 100 is assumed.\n\ |
|
|
1161 \n\ |
|
|
1162 All three arguments must be scalars.\n\ |
|
|
1163 \n\ |
|
|
1164 See also: logspace") |
|
|
1165 { |
|
2086
|
1166 octave_value_list retval; |
|
1100
|
1167 |
|
|
1168 int nargin = args.length (); |
|
|
1169 |
|
|
1170 int npoints = 100; |
|
|
1171 |
|
1940
|
1172 if (nargin != 2 && nargin != 3) |
|
|
1173 { |
|
|
1174 print_usage ("linspace"); |
|
|
1175 return retval; |
|
|
1176 } |
|
|
1177 |
|
1100
|
1178 if (nargin == 3) |
|
3202
|
1179 npoints = args(2).nint_value (); |
|
1100
|
1180 |
|
|
1181 if (! error_state) |
|
|
1182 { |
|
|
1183 if (npoints > 1) |
|
|
1184 { |
|
2086
|
1185 octave_value arg_1 = args(0); |
|
|
1186 octave_value arg_2 = args(1); |
|
1100
|
1187 |
|
|
1188 if (arg_1.is_complex_type () || arg_2.is_complex_type ()) |
|
|
1189 { |
|
|
1190 Complex x1 = arg_1.complex_value (); |
|
|
1191 Complex x2 = arg_2.complex_value (); |
|
|
1192 |
|
|
1193 if (! error_state) |
|
|
1194 { |
|
|
1195 ComplexRowVector rv = linspace (x1, x2, npoints); |
|
|
1196 |
|
|
1197 if (! error_state) |
|
2086
|
1198 retval (0) = octave_value (rv, 0); |
|
1100
|
1199 } |
|
|
1200 } |
|
|
1201 else |
|
|
1202 { |
|
|
1203 double x1 = arg_1.double_value (); |
|
|
1204 double x2 = arg_2.double_value (); |
|
|
1205 |
|
|
1206 if (! error_state) |
|
|
1207 { |
|
|
1208 RowVector rv = linspace (x1, x2, npoints); |
|
|
1209 |
|
|
1210 if (! error_state) |
|
2086
|
1211 retval (0) = octave_value (rv, 0); |
|
1100
|
1212 } |
|
|
1213 } |
|
|
1214 } |
|
|
1215 else |
|
|
1216 error ("linspace: npoints must be greater than 2"); |
|
|
1217 } |
|
|
1218 |
|
|
1219 return retval; |
|
|
1220 } |
|
|
1221 |
|
2188
|
1222 static int |
|
|
1223 treat_neg_dim_as_zero (void) |
|
|
1224 { |
|
|
1225 Vtreat_neg_dim_as_zero = check_preference ("treat_neg_dim_as_zero"); |
|
|
1226 |
|
|
1227 return 0; |
|
|
1228 } |
|
|
1229 |
|
2184
|
1230 void |
|
|
1231 symbols_of_data (void) |
|
|
1232 { |
|
3141
|
1233 DEFCONST (I, Complex (0.0, 1.0), |
|
2184
|
1234 "sqrt (-1)"); |
|
|
1235 |
|
3141
|
1236 DEFCONST (Inf, octave_Inf, |
|
2184
|
1237 "infinity"); |
|
|
1238 |
|
3141
|
1239 DEFCONST (J, Complex (0.0, 1.0), |
|
2184
|
1240 "sqrt (-1)"); |
|
|
1241 |
|
3141
|
1242 DEFCONST (NaN, octave_NaN, |
|
2184
|
1243 "not a number"); |
|
|
1244 |
|
|
1245 #if defined (M_E) |
|
|
1246 double e_val = M_E; |
|
|
1247 #else |
|
|
1248 double e_val = exp (1.0); |
|
|
1249 #endif |
|
|
1250 |
|
3141
|
1251 DEFCONST (e, e_val, |
|
2184
|
1252 "exp (1)"); |
|
|
1253 |
|
3141
|
1254 DEFCONST (eps, DBL_EPSILON, |
|
2184
|
1255 "machine precision"); |
|
|
1256 |
|
3258
|
1257 DEFCONST (false, false, |
|
|
1258 "logical false value"); |
|
|
1259 |
|
3141
|
1260 DEFCONST (i, Complex (0.0, 1.0), |
|
2184
|
1261 "sqrt (-1)"); |
|
|
1262 |
|
3141
|
1263 DEFCONST (inf, octave_Inf, |
|
2184
|
1264 "infinity"); |
|
|
1265 |
|
3141
|
1266 DEFCONST (j, Complex (0.0, 1.0), |
|
2184
|
1267 "sqrt (-1)"); |
|
|
1268 |
|
3141
|
1269 DEFCONST (nan, octave_NaN, |
|
2184
|
1270 "not a number"); |
|
|
1271 |
|
|
1272 #if defined (M_PI) |
|
|
1273 double pi_val = M_PI; |
|
|
1274 #else |
|
|
1275 double pi_val = 4.0 * atan (1.0); |
|
|
1276 #endif |
|
|
1277 |
|
3141
|
1278 DEFCONST (pi, pi_val, |
|
2184
|
1279 "ratio of the circumference of a circle to its diameter"); |
|
|
1280 |
|
3141
|
1281 DEFCONST (realmax, DBL_MAX, |
|
2184
|
1282 "realmax (): return largest representable floating point number"); |
|
|
1283 |
|
3141
|
1284 DEFCONST (realmin, DBL_MIN, |
|
2184
|
1285 "realmin (): return smallest representable floating point number"); |
|
2188
|
1286 |
|
3258
|
1287 DEFVAR (treat_neg_dim_as_zero, 0.0, treat_neg_dim_as_zero, |
|
2188
|
1288 "convert negative dimensions to zero"); |
|
3258
|
1289 |
|
|
1290 DEFCONST (true, true, |
|
|
1291 "logical true value"); |
|
2184
|
1292 } |
|
|
1293 |
|
523
|
1294 /* |
|
|
1295 ;;; Local Variables: *** |
|
|
1296 ;;; mode: C++ *** |
|
|
1297 ;;; End: *** |
|
|
1298 */ |
