|
1
|
1 // g-builtins.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993 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 __GNUG__ |
|
|
33 #pragma implementation |
|
|
34 #endif |
|
|
35 |
|
|
36 #include <sys/types.h> |
|
|
37 #ifdef HAVE_UNISTD_H |
|
|
38 #include <unistd.h> |
|
|
39 #endif |
|
|
40 #include <strstream.h> |
|
|
41 #include <iostream.h> |
|
|
42 #include <fstream.h> |
|
|
43 #include <stdio.h> |
|
|
44 #include <sys/wait.h> |
|
|
45 #include <sys/param.h> |
|
|
46 #include <signal.h> |
|
|
47 #include <math.h> |
|
|
48 |
|
35
|
49 #include "f-balance.h" |
|
9
|
50 #include "f-colloc.h" |
|
|
51 #include "f-dassl.h" |
|
|
52 #include "f-det.h" |
|
|
53 #include "f-eig.h" |
|
51
|
54 #include "f-expm.h" |
|
9
|
55 #include "f-fft.h" |
|
|
56 #include "f-fsolve.h" |
|
|
57 #include "f-fsqp.h" |
|
35
|
58 #include "f-givens.h" |
|
9
|
59 #include "f-hess.h" |
|
|
60 #include "f-ifft.h" |
|
|
61 #include "f-inv.h" |
|
|
62 #include "f-lpsolve.h" |
|
|
63 #include "f-lsode.h" |
|
|
64 #include "f-lu.h" |
|
|
65 #include "f-npsol.h" |
|
|
66 #include "f-qpsol.h" |
|
|
67 #include "f-qr.h" |
|
|
68 #include "f-quad.h" |
|
46
|
69 #include "f-qzval.h" |
|
9
|
70 #include "f-rand.h" |
|
|
71 #include "f-schur.h" |
|
|
72 #include "f-svd.h" |
|
38
|
73 #include "f-syl.h" |
|
9
|
74 |
|
1
|
75 #include "procstream.h" |
|
|
76 #include "error.h" |
|
|
77 #include "variables.h" |
|
|
78 #include "builtins.h" |
|
|
79 #include "g-builtins.h" |
|
|
80 #include "user-prefs.h" |
|
|
81 #include "utils.h" |
|
|
82 #include "tree.h" |
|
9
|
83 #include "tree-const.h" |
|
1
|
84 #include "input.h" |
|
|
85 #include "pager.h" |
|
|
86 #include "octave.h" |
|
|
87 #include "version.h" |
|
|
88 #include "file-io.h" |
|
|
89 |
|
|
90 extern "C" |
|
|
91 { |
|
|
92 #include <readline/readline.h> |
|
|
93 } |
|
|
94 |
|
|
95 #ifndef MAXPATHLEN |
|
|
96 #define MAXPATHLEN 1024 |
|
|
97 #endif |
|
|
98 |
|
|
99 #ifdef WITH_DLD |
|
|
100 #include "dynamic-ld.h" |
|
|
101 #define Q_STR(name) #name |
|
|
102 #define DLD_FCN(name) Q_STR (builtin_##name##_2) |
|
|
103 #define DLD_OBJ(name) Q_STR (tc-##name##.o) |
|
|
104 #define DLD_BUILTIN(args,n_in,n_out,name,code) \ |
|
|
105 return octave_dld_tc2_and_go (args, n_in, n_out, Q_STR (name), \ |
|
|
106 DLD_FCN (name), DLD_OBJ (name)); |
|
|
107 |
|
|
108 #else |
|
|
109 #define DLD_BUILTIN(name,args,n_in,n_out,code) code |
|
|
110 #endif |
|
|
111 |
|
|
112 // Non-zero means that pwd always give verbatim directory, regardless |
|
|
113 // of symbolic link following. |
|
|
114 static int verbatim_pwd = 1; |
|
|
115 |
|
|
116 // Signal handler return type. |
|
|
117 #ifndef RETSIGTYPE |
|
|
118 #define RETSIGTYPE void |
|
|
119 #endif |
|
|
120 #ifndef BADSIG |
|
|
121 #define BADSIG (RETSIGTYPE (*)())-1 |
|
|
122 #endif |
|
|
123 |
|
|
124 typedef RETSIGTYPE sig_handler (...); |
|
|
125 |
|
|
126 /* |
|
|
127 * Are all elements of a constant nonzero? |
|
|
128 */ |
|
|
129 tree_constant * |
|
|
130 builtin_all (tree_constant *args, int nargin, int nargout) |
|
|
131 { |
|
|
132 tree_constant *retval = NULL_TREE_CONST; |
|
|
133 if (nargin != 2) |
|
|
134 usage ("all (M)"); |
|
|
135 else |
|
|
136 { |
|
|
137 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
138 { |
|
|
139 retval = new tree_constant [2]; |
|
|
140 retval[0] = args[1].all (); |
|
|
141 } |
|
|
142 } |
|
|
143 return retval; |
|
|
144 } |
|
|
145 |
|
|
146 /* |
|
|
147 * Are any elements of a constant nonzero? |
|
|
148 */ |
|
|
149 tree_constant * |
|
|
150 builtin_any (tree_constant *args, int nargin, int nargout) |
|
|
151 { |
|
|
152 tree_constant *retval = NULL_TREE_CONST; |
|
|
153 if (nargin != 2) |
|
|
154 usage ("any (M)"); |
|
|
155 else |
|
|
156 { |
|
|
157 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
158 { |
|
|
159 retval = new tree_constant [2]; |
|
|
160 retval[0] = args[1].any (); |
|
|
161 } |
|
|
162 } |
|
|
163 return retval; |
|
|
164 } |
|
|
165 |
|
|
166 /* |
|
18
|
167 * Balancing for eigenvalue problems |
|
|
168 */ |
|
|
169 tree_constant * |
|
|
170 builtin_balance (tree_constant *args, int nargin, int nargout) |
|
|
171 { |
|
|
172 tree_constant *retval = NULL_TREE_CONST; |
|
|
173 if (nargin <= 1 || nargin > 4 || nargout < 1 || nargout > 4) |
|
30
|
174 usage ("[{dd,} aa] = balance (a, {opt}) or \n\ |
|
|
175 [{cc, dd,} aa, bb] = balance (a, b {,opt}), opt = 'P' or 'S'"); |
|
18
|
176 else |
|
|
177 { |
|
|
178 DLD_BUILTIN (args, nargin, nargout, balance, |
|
|
179 retval = balance (args, nargin, nargout)); |
|
|
180 } |
|
|
181 return retval; |
|
|
182 } |
|
|
183 |
|
|
184 /* |
|
1
|
185 * Clear the screen? |
|
|
186 */ |
|
|
187 tree_constant * |
|
|
188 builtin_clc (tree_constant *args, int nargin, int nargout) |
|
|
189 { |
|
|
190 rl_beg_of_line (); |
|
|
191 rl_kill_line (1); |
|
|
192 rl_clear_screen (); |
|
|
193 return NULL_TREE_CONST; |
|
|
194 } |
|
|
195 |
|
|
196 /* |
|
|
197 * Time in a vector. |
|
|
198 */ |
|
|
199 tree_constant * |
|
|
200 builtin_clock (tree_constant *args, int nargin, int nargout) |
|
|
201 { |
|
|
202 tree_constant *retval = NULL_TREE_CONST; |
|
|
203 |
|
|
204 time_t now; |
|
|
205 struct tm *tm; |
|
|
206 |
|
|
207 time (&now); |
|
|
208 tm = localtime (&now); |
|
|
209 |
|
|
210 Matrix m (1, 6); |
|
|
211 m.elem (0, 0) = tm->tm_year + 1900; |
|
|
212 m.elem (0, 1) = tm->tm_mon + 1; |
|
|
213 m.elem (0, 2) = tm->tm_mday; |
|
|
214 m.elem (0, 3) = tm->tm_hour; |
|
|
215 m.elem (0, 4) = tm->tm_min; |
|
|
216 m.elem (0, 5) = tm->tm_sec; |
|
|
217 |
|
|
218 retval = new tree_constant [2]; |
|
|
219 retval[0] = tree_constant (m); |
|
|
220 |
|
|
221 return retval; |
|
|
222 } |
|
|
223 |
|
|
224 /* |
|
|
225 * Close the stream to the plotter. |
|
|
226 */ |
|
|
227 tree_constant * |
|
|
228 builtin_closeplot (tree_constant *args, int nargin, int nargout) |
|
|
229 { |
|
|
230 tree_constant *retval = NULL_TREE_CONST; |
|
|
231 close_plot_stream (); |
|
|
232 return retval; |
|
|
233 } |
|
|
234 |
|
|
235 /* |
|
|
236 * Collocation roots and weights. |
|
|
237 */ |
|
|
238 tree_constant * |
|
|
239 builtin_colloc (tree_constant *args, int nargin, int nargout) |
|
|
240 { |
|
|
241 tree_constant *retval = NULL_TREE_CONST; |
|
|
242 |
|
|
243 if (nargin < 2 || nargin > 4) |
|
|
244 usage ("[r, A, B, q] = colloc (n [, \"left\"] [, \"right\"])"); |
|
|
245 else |
|
|
246 DLD_BUILTIN (args, nargin, nargout, colloc, |
|
|
247 retval = collocation_weights (args, nargin);) |
|
|
248 |
|
|
249 return retval; |
|
|
250 } |
|
|
251 |
|
|
252 /* |
|
|
253 * Cumulative sums and products. |
|
|
254 */ |
|
|
255 tree_constant * |
|
|
256 builtin_cumprod (tree_constant *args, int nargin, int nargout) |
|
|
257 { |
|
|
258 tree_constant *retval = NULL_TREE_CONST; |
|
|
259 if (nargin != 2) |
|
|
260 usage ("cumprod (M)"); |
|
|
261 else |
|
|
262 { |
|
|
263 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
264 { |
|
|
265 retval = new tree_constant [2]; |
|
|
266 retval[0] = args[1].cumprod (); |
|
|
267 } |
|
|
268 } |
|
|
269 return retval; |
|
|
270 } |
|
|
271 |
|
|
272 tree_constant * |
|
|
273 builtin_cumsum (tree_constant *args, int nargin, int nargout) |
|
|
274 { |
|
|
275 tree_constant *retval = NULL_TREE_CONST; |
|
|
276 if (nargin != 2) |
|
|
277 usage ("cumsum (M)"); |
|
|
278 else |
|
|
279 { |
|
|
280 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
281 { |
|
|
282 retval = new tree_constant [2]; |
|
|
283 retval[0] = args[1].cumsum (); |
|
|
284 } |
|
|
285 } |
|
|
286 return retval; |
|
|
287 } |
|
|
288 |
|
|
289 /* |
|
|
290 * DAEs. |
|
|
291 */ |
|
|
292 static void |
|
|
293 dassl_usage (void) |
|
|
294 { |
|
|
295 usage ("dassl (\"function_name\", x_0, xdot_0, t_out\n\ |
|
|
296 dassl (\"function_name\", x_0, xdot_0, t_out, t_crit)\n\ |
|
|
297 \n\ |
|
|
298 The first argument is the name of the function to call to\n\ |
|
|
299 compute the vector of residuals. It must have the form\n\ |
|
|
300 \n\ |
|
|
301 res = f (x, xdot, t)\n\ |
|
|
302 \n\ |
|
|
303 where x, xdot, and res are vectors, and t is a scalar."); |
|
|
304 } |
|
|
305 |
|
|
306 tree_constant * |
|
|
307 builtin_dassl (tree_constant *args, int nargin, int nargout) |
|
|
308 { |
|
|
309 tree_constant *retval = new tree_constant [2]; |
|
|
310 |
|
|
311 if ((nargin == 5 || nargin == 6) && nargout > 0) |
|
|
312 DLD_BUILTIN (args, nargin, nargout, dassl, |
|
|
313 retval = dassl (args, nargin, nargout);) |
|
|
314 else |
|
|
315 dassl_usage (); |
|
|
316 |
|
|
317 return retval; |
|
|
318 } |
|
|
319 |
|
|
320 /* |
|
|
321 * Time in a string. |
|
|
322 */ |
|
|
323 tree_constant * |
|
|
324 builtin_date (tree_constant *args, int nargin, int nargout) |
|
|
325 { |
|
|
326 tree_constant *retval = NULL_TREE_CONST; |
|
|
327 |
|
|
328 time_t now; |
|
|
329 struct tm *tm; |
|
|
330 |
|
|
331 time (&now); |
|
|
332 tm = localtime (&now); |
|
|
333 char date[32]; |
|
|
334 int len = strftime (date, 31, "%d-%b-%y", tm); |
|
|
335 if (len > 0) |
|
|
336 { |
|
|
337 retval = new tree_constant [2]; |
|
|
338 retval[0] = tree_constant (date); |
|
|
339 } |
|
|
340 |
|
|
341 return retval; |
|
|
342 } |
|
|
343 |
|
|
344 /* |
|
|
345 * Determinant of a matrix. |
|
|
346 */ |
|
|
347 tree_constant * |
|
|
348 builtin_det (tree_constant *args, int nargin, int nargout) |
|
|
349 { |
|
|
350 tree_constant *retval = NULL_TREE_CONST; |
|
|
351 |
|
|
352 if (nargin == 2) |
|
|
353 DLD_BUILTIN (args, nargin, nargout, det, |
|
|
354 { |
|
|
355 retval = new tree_constant [2]; |
|
|
356 retval[0] = determinant (args[1]); |
|
|
357 }) |
|
|
358 else |
|
|
359 usage ("det (a)"); |
|
|
360 |
|
|
361 return retval; |
|
|
362 } |
|
|
363 |
|
|
364 /* |
|
|
365 * Diagonal elements of a matrix. |
|
|
366 */ |
|
|
367 tree_constant * |
|
|
368 builtin_diag (tree_constant *args, int nargin, int nargout) |
|
|
369 { |
|
|
370 tree_constant *retval = NULL_TREE_CONST; |
|
|
371 |
|
|
372 if (nargin == 2) |
|
|
373 { |
|
|
374 retval = new tree_constant [2]; |
|
|
375 retval[0] = args[1].diag (); |
|
|
376 } |
|
|
377 else if (nargin == 3) |
|
|
378 { |
|
|
379 retval = new tree_constant [2]; |
|
|
380 retval[0] = args[1].diag (args[2]); |
|
|
381 } |
|
|
382 else |
|
|
383 usage ("diag (X [, k])"); |
|
|
384 |
|
|
385 return retval; |
|
|
386 } |
|
|
387 |
|
|
388 /* |
|
|
389 * Display value without trimmings. |
|
|
390 */ |
|
|
391 tree_constant * |
|
|
392 builtin_disp (tree_constant *args, int nargin, int nargout) |
|
|
393 { |
|
|
394 tree_constant *retval = NULL_TREE_CONST; |
|
|
395 |
|
|
396 if (nargin == 2) |
|
|
397 args[1].eval (1); |
|
|
398 else |
|
|
399 usage ("disp (X)"); |
|
|
400 |
|
|
401 return retval; |
|
|
402 } |
|
|
403 |
|
|
404 /* |
|
|
405 * Compute eigenvalues and eigenvectors. |
|
|
406 */ |
|
|
407 tree_constant * |
|
|
408 builtin_eig (tree_constant *args, int nargin, int nargout) |
|
|
409 { |
|
|
410 tree_constant *retval = NULL_TREE_CONST; |
|
|
411 |
|
|
412 if (nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
413 DLD_BUILTIN (args, nargin, nargout, eig, |
|
|
414 retval = eig (args, nargin, nargout);) |
|
|
415 else |
|
|
416 usage ("lambda = eig (A)\n\ |
|
|
417 [v, d] = eig (A); d == diag (lambda)"); |
|
|
418 |
|
|
419 return retval; |
|
|
420 } |
|
|
421 |
|
|
422 /* |
|
|
423 * Print error message and jump to top level. |
|
|
424 */ |
|
|
425 tree_constant * |
|
|
426 builtin_error (tree_constant *args, int nargin, int nargout) |
|
|
427 { |
|
|
428 tree_constant *retval = NULL_TREE_CONST; |
|
|
429 |
|
|
430 if (nargin == 2 && args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
431 args[1].print_if_string (cerr, 1); |
|
|
432 else |
|
|
433 message ((char *) NULL, "unspecified error, jumping to top level..."); |
|
|
434 |
|
|
435 jump_to_top_level (); |
|
|
436 |
|
|
437 return retval; |
|
|
438 } |
|
|
439 |
|
|
440 /* |
|
|
441 * Evaluate text argument as octave source. |
|
|
442 */ |
|
|
443 tree_constant * |
|
|
444 builtin_eval (tree_constant *args, int nargin, int nargout) |
|
|
445 { |
|
|
446 tree_constant *retval = NULL_TREE_CONST; |
|
|
447 if (nargin == 2) |
|
|
448 { |
|
|
449 int parse_status = 0; |
|
|
450 retval = new tree_constant [2]; |
|
|
451 retval[0] = eval_string (args[1], parse_status); |
|
|
452 } |
|
|
453 else |
|
|
454 usage ("eval (\"string\")"); |
|
|
455 return retval; |
|
|
456 } |
|
|
457 |
|
|
458 /* |
|
|
459 * Check if variable or file exists. |
|
|
460 */ |
|
|
461 tree_constant * |
|
|
462 builtin_exist (tree_constant *args, int nargin, int nargout) |
|
|
463 { |
|
|
464 tree_constant *retval = NULL_TREE_CONST; |
|
|
465 if (nargin == 2 && args[1].is_string_type ()) |
|
|
466 { |
|
|
467 int status = identifier_exists (args[1].string_value ()); |
|
|
468 retval = new tree_constant [2]; |
|
|
469 retval[0] = tree_constant ((double) status); |
|
|
470 } |
|
|
471 else |
|
|
472 usage ("exist (\"string\")"); |
|
|
473 return retval; |
|
|
474 } |
|
|
475 |
|
|
476 /* |
|
|
477 * Matrix exponential. |
|
|
478 */ |
|
|
479 tree_constant * |
|
|
480 builtin_expm (tree_constant *args, int nargin, int nargout) |
|
|
481 { |
|
|
482 tree_constant *retval = NULL_TREE_CONST; |
|
|
483 |
|
|
484 if (nargin == 2) |
|
51
|
485 DLD_BUILTIN (args, nargin, nargout, matrix_exp, |
|
|
486 { |
|
|
487 retval = new tree_constant [2]; |
|
|
488 retval[0] = matrix_exp (args[1]); |
|
|
489 }) |
|
1
|
490 else |
|
|
491 usage ("expm (A)"); |
|
|
492 |
|
|
493 return retval; |
|
|
494 } |
|
|
495 |
|
|
496 /* |
|
|
497 * Identity matrix. |
|
|
498 */ |
|
|
499 tree_constant * |
|
|
500 builtin_eye (tree_constant *args, int nargin, int nargout) |
|
|
501 { |
|
|
502 tree_constant *retval = NULL_TREE_CONST; |
|
|
503 |
|
|
504 switch (nargin) |
|
|
505 { |
|
|
506 case 2: |
|
|
507 retval = new tree_constant [2]; |
|
|
508 retval[0] = identity_matrix (args[1]); |
|
|
509 break; |
|
|
510 case 3: |
|
|
511 retval = new tree_constant [2]; |
|
|
512 retval[0] = identity_matrix (args[1], args[2]); |
|
|
513 break; |
|
|
514 default: |
|
|
515 usage ("eye (n)\n eye (A)\n eye (n, m)"); |
|
|
516 break; |
|
|
517 } |
|
|
518 return retval; |
|
|
519 } |
|
|
520 |
|
|
521 |
|
|
522 /* |
|
|
523 * Closing a file |
|
|
524 */ |
|
|
525 tree_constant * |
|
|
526 builtin_fclose (tree_constant *args, int nargin, int nargout) |
|
|
527 { |
|
|
528 tree_constant *retval = NULL_TREE_CONST; |
|
|
529 if (nargin != 2) |
|
|
530 usage ("success = fclose (\"filename\" or filenum)"); |
|
|
531 else |
|
|
532 retval = fclose_internal (args); |
|
|
533 return retval; |
|
|
534 } |
|
|
535 |
|
|
536 /* |
|
|
537 * Evaluate first argument as a function. |
|
|
538 */ |
|
|
539 tree_constant * |
|
|
540 builtin_feval (tree_constant *args, int nargin, int nargout) |
|
|
541 { |
|
|
542 tree_constant *retval = NULL_TREE_CONST; |
|
|
543 if (nargin > 1) |
|
|
544 retval = feval (args, nargin, nargout); |
|
|
545 else |
|
|
546 usage ("feval (\"function_name\" [, ...])"); |
|
|
547 return retval; |
|
|
548 } |
|
|
549 |
|
|
550 /* |
|
|
551 * Flushing output to a file |
|
|
552 */ |
|
|
553 tree_constant * |
|
|
554 builtin_fflush (tree_constant *args, int nargin, int nargout) |
|
|
555 { |
|
|
556 tree_constant *retval = NULL_TREE_CONST; |
|
|
557 if (nargin != 2) |
|
|
558 usage ("success = fflush (\"filename\" or filenum)"); |
|
|
559 else |
|
|
560 retval = fflush_internal (args); |
|
|
561 return retval; |
|
|
562 } |
|
|
563 |
|
|
564 /* |
|
|
565 * Fast Fourier Transform |
|
|
566 */ |
|
|
567 tree_constant * |
|
|
568 builtin_fft (tree_constant *args, int nargin, int nargout) |
|
|
569 { |
|
|
570 tree_constant *retval = NULL_TREE_CONST; |
|
|
571 |
|
|
572 if (nargin == 2) |
|
|
573 DLD_BUILTIN (args, nargin, nargout, fft, |
|
|
574 { |
|
|
575 retval = new tree_constant [2]; |
|
|
576 retval[0] = fft (args[1]); |
|
|
577 }) |
|
|
578 else |
|
|
579 usage ("fft (a)"); |
|
|
580 |
|
|
581 return retval; |
|
|
582 } |
|
|
583 |
|
|
584 /* |
|
|
585 * get a string from a file |
|
|
586 */ |
|
|
587 tree_constant * |
|
|
588 builtin_fgets (tree_constant *args, int nargin, int nargout) |
|
|
589 { |
|
|
590 tree_constant *retval = NULL_TREE_CONST; |
|
|
591 if (nargin != 3 && nargout < 3) |
|
|
592 usage ("string = fgets (\"filename\" or filenum, length)"); |
|
|
593 else |
|
|
594 retval = fgets_internal (args, nargout); |
|
|
595 return retval; |
|
|
596 } |
|
|
597 |
|
|
598 /* |
|
|
599 * Find nonzero elements. This should probably only work if |
|
|
600 * do_fortran_indexing is true... |
|
|
601 */ |
|
|
602 tree_constant * |
|
|
603 builtin_find (tree_constant *args, int nargin, int nargout) |
|
|
604 { |
|
|
605 tree_constant *retval = NULL_TREE_CONST; |
|
|
606 if (nargin == 2) |
|
|
607 { |
|
|
608 retval = new tree_constant [2]; |
|
|
609 retval[0] = find_nonzero_elem_idx (args[1]); |
|
|
610 } |
|
|
611 else |
|
|
612 usage ("find (x)"); |
|
|
613 return retval; |
|
|
614 } |
|
|
615 |
|
|
616 /* |
|
|
617 * Don\'t really count floating point operations. |
|
|
618 */ |
|
|
619 tree_constant * |
|
|
620 builtin_flops (tree_constant *args, int nargin, int nargout) |
|
|
621 { |
|
|
622 tree_constant *retval = NULL_TREE_CONST; |
|
|
623 if (nargin > 2) |
|
|
624 usage ("flops\n flops (0)"); |
|
|
625 |
|
|
626 warning ("flops always returns zero"); |
|
|
627 retval = new tree_constant [2]; |
|
|
628 retval[0] = tree_constant (0.0); |
|
|
629 return retval; |
|
|
630 } |
|
|
631 |
|
|
632 /* |
|
|
633 * Opening a file. |
|
|
634 */ |
|
|
635 tree_constant * |
|
|
636 builtin_fopen (tree_constant *args, int nargin, int nargout) |
|
|
637 { |
|
|
638 tree_constant *retval = NULL_TREE_CONST; |
|
|
639 if (nargin != 3) |
|
|
640 { |
|
|
641 usage ("filenum = fopen (\"file\", \"mode\")\n\n\ |
|
|
642 Legal values for mode include:\n\n\ |
|
|
643 r : open text file for reading\n\ |
|
|
644 w : open text file for writing; discard previous contents if any\n\ |
|
|
645 a : append; open or create text file for writing at end of file\n\ |
|
|
646 r+ : open text file for update (i.e., reading and writing)\n\ |
|
|
647 w+ : create text file for update; discard previous contents if any\n\ |
|
|
648 a+ : append; open or create text file for update, writing at end\n\n\ |
|
|
649 Update mode permits reading from and writing to the same file.\n"); |
|
|
650 } |
|
|
651 else |
|
|
652 retval = fopen_internal (args); |
|
|
653 return retval; |
|
|
654 } |
|
|
655 |
|
|
656 /* |
|
|
657 * Formatted printing to a file. |
|
|
658 */ |
|
|
659 tree_constant * |
|
|
660 builtin_fprintf (tree_constant *args, int nargin, int nargout) |
|
|
661 { |
|
|
662 tree_constant *retval = NULL_TREE_CONST; |
|
|
663 if (nargin < 3) |
|
|
664 usage ("fprintf (\"filename\" or filenum, \"fmt\" [, ...])"); |
|
|
665 else |
|
|
666 retval = do_printf ("fprintf", args, nargin, nargout); |
|
|
667 return retval; |
|
|
668 } |
|
|
669 |
|
|
670 /* |
|
|
671 * rewind a file |
|
|
672 */ |
|
|
673 tree_constant * |
|
|
674 builtin_frewind (tree_constant *args, int nargin, int nargout) |
|
|
675 { |
|
|
676 tree_constant *retval = NULL_TREE_CONST; |
|
|
677 if (nargin != 2) |
|
|
678 usage ("success = frewind (\"filename\" or filenum)"); |
|
|
679 else |
|
|
680 retval = frewind_internal (args); |
|
|
681 return retval; |
|
|
682 } |
|
|
683 |
|
|
684 /* |
|
|
685 * report on open files |
|
|
686 */ |
|
|
687 tree_constant * |
|
|
688 builtin_freport (tree_constant *args, int nargin, int nargout) |
|
|
689 { |
|
|
690 tree_constant *retval = NULL_TREE_CONST; |
|
|
691 if (nargin > 1) |
|
|
692 warning ("replot: ignoring extra arguments"); |
|
|
693 retval = freport_internal (); |
|
|
694 return retval; |
|
|
695 } |
|
|
696 |
|
|
697 /* |
|
|
698 * Formatted reading from a file. |
|
|
699 */ |
|
|
700 tree_constant * |
|
|
701 builtin_fscanf (tree_constant *args, int nargin, int nargout) |
|
|
702 { |
|
|
703 tree_constant *retval = NULL_TREE_CONST; |
|
|
704 if (nargin != 2 && nargin != 3) |
|
|
705 usage ("[...] = fscanf (\"file\", \"fmt\")"); |
|
|
706 else |
|
|
707 retval = do_scanf ("fscanf", args, nargin, nargout); |
|
|
708 return retval; |
|
|
709 } |
|
|
710 |
|
|
711 /* |
|
|
712 * seek a point in a file for reading and/or writing |
|
|
713 */ |
|
|
714 tree_constant * |
|
|
715 builtin_fseek (tree_constant *args, int nargin, int nargout) |
|
|
716 { |
|
|
717 tree_constant *retval = NULL_TREE_CONST; |
|
|
718 if (nargin != 3 && nargin != 4) |
|
|
719 usage ("success = fseek (\"filename\" or filenum, offset [,origin])"); |
|
|
720 else |
|
|
721 retval = fseek_internal (args, nargin); |
|
|
722 return retval; |
|
|
723 } |
|
|
724 |
|
|
725 /* |
|
|
726 * Nonlinear algebraic equations. |
|
|
727 */ |
|
|
728 static void |
|
|
729 fsolve_usage (void) |
|
|
730 { |
|
|
731 // usage ("[x, status, path] = fsolve (\"f\", x0 [, opts] [, par] [, \"jac\"] [, scale])"); |
|
|
732 |
|
|
733 usage ("[x, info] = fsolve (\"f\", x0)"); |
|
|
734 } |
|
|
735 |
|
|
736 tree_constant * |
|
|
737 builtin_fsolve (tree_constant *args, int nargin, int nargout) |
|
|
738 { |
|
|
739 tree_constant *retval = NULL_TREE_CONST; |
|
|
740 |
|
|
741 if (nargin >= 3 && nargin <= 7 && nargout >= 1 && nargout <= 3) |
|
|
742 DLD_BUILTIN (args, nargin, nargout, fsolve, |
|
|
743 retval = fsolve (args, nargin, nargout);) |
|
|
744 else |
|
|
745 fsolve_usage (); |
|
|
746 |
|
|
747 return retval; |
|
|
748 } |
|
|
749 |
|
|
750 /* |
|
|
751 * NLPs. |
|
|
752 */ |
|
|
753 static void |
|
|
754 fsqp_usage (void) |
|
|
755 { |
|
|
756 #if defined (FSQP_MISSING) |
|
|
757 message ("fsqp", "this function requires FSQP, which is not freely\n\ |
|
|
758 redistributable. For more information, read the file\n\ |
|
|
759 libcruft/fsqp/README.MISSING in the source distribution."); |
|
|
760 #else |
|
|
761 usage ("[x, phi] = fsqp (x, \"phi\" [, lb, ub] [, lb, A, ub] [, lb, \"g\", ub])\n\n\ |
|
|
762 Groups of arguments surrounded in `[]' are optional, but\n\ |
|
|
763 must appear in the same relative order shown above."); |
|
|
764 #endif |
|
|
765 } |
|
|
766 |
|
|
767 tree_constant * |
|
|
768 builtin_fsqp (tree_constant *args, int nargin, int nargout) |
|
|
769 { |
|
|
770 tree_constant *retval = NULL_TREE_CONST; |
|
|
771 |
|
|
772 #if defined (FSQP_MISSING) |
|
|
773 fsqp_usage (); |
|
|
774 #else |
|
|
775 if ((nargin == 3 || nargin == 5 || nargin == 6 || nargin == 8 |
|
|
776 || nargin == 9 || nargin == 11) |
|
|
777 && (nargout >= 1 && nargout <= 3)) |
|
|
778 DLD_BUILTIN (args, nargin, nargout, fsqp, |
|
|
779 retval = fsqp (args, nargin, nargout);) |
|
|
780 else |
|
|
781 fsqp_usage (); |
|
|
782 #endif |
|
|
783 |
|
|
784 return retval; |
|
|
785 } |
|
|
786 |
|
|
787 /* |
|
|
788 * tell current position of file |
|
|
789 */ |
|
|
790 tree_constant * |
|
|
791 builtin_ftell (tree_constant *args, int nargin, int nargout) |
|
|
792 { |
|
|
793 tree_constant *retval = NULL_TREE_CONST; |
|
|
794 if (nargin != 2) |
|
|
795 usage ("position = ftell (\"filename\" or filenumber)"); |
|
|
796 else |
|
|
797 retval = ftell_internal (args); |
|
|
798 return retval; |
|
|
799 } |
|
|
800 |
|
|
801 /* |
|
|
802 * Get the value of an environment variable. |
|
|
803 */ |
|
|
804 tree_constant * |
|
|
805 builtin_getenv (tree_constant *args, int nargin, int nargout) |
|
|
806 { |
|
|
807 tree_constant *retval = NULL_TREE_CONST; |
|
|
808 if (nargin == 2 && args[1].is_string_type ()) |
|
|
809 { |
|
|
810 retval = new tree_constant [2]; |
|
|
811 char *value = getenv (args[1].string_value ()); |
|
|
812 if (value != (char *) NULL) |
|
|
813 retval[0] = tree_constant (value); |
|
|
814 else |
|
|
815 retval[0] = tree_constant (""); |
|
|
816 } |
|
|
817 else |
|
|
818 usage ("getenv (\"string\")"); |
|
|
819 return retval; |
|
|
820 } |
|
|
821 |
|
|
822 /* |
|
|
823 * Inverse Fast Fourier Transform |
|
|
824 */ |
|
|
825 tree_constant * |
|
|
826 builtin_ifft (tree_constant *args, int nargin, int nargout) |
|
|
827 { |
|
|
828 tree_constant *retval = NULL_TREE_CONST; |
|
|
829 |
|
|
830 if (nargin == 2) |
|
|
831 DLD_BUILTIN (args, nargin, nargout, ifft, |
|
|
832 { |
|
|
833 retval = new tree_constant [2]; |
|
|
834 retval[0] = ifft (args[1]); |
|
|
835 }) |
|
|
836 else |
|
|
837 usage ("ifft (a)"); |
|
|
838 |
|
|
839 return retval; |
|
|
840 } |
|
|
841 |
|
|
842 /* |
|
|
843 * Inverse of a square matrix. |
|
|
844 */ |
|
|
845 tree_constant * |
|
|
846 builtin_inv (tree_constant *args, int nargin, int nargout) |
|
|
847 { |
|
|
848 tree_constant *retval = NULL_TREE_CONST; |
|
|
849 |
|
|
850 if (nargin == 2) |
|
|
851 DLD_BUILTIN (args, nargin, nargout, inv, |
|
|
852 { |
|
|
853 retval = new tree_constant [2]; |
|
|
854 retval[0] = inverse (args[1]); |
|
|
855 }) |
|
|
856 else |
|
|
857 usage ("inv (A)"); |
|
|
858 |
|
|
859 return retval; |
|
|
860 } |
|
|
861 |
|
|
862 /* |
|
|
863 * Prompt user for input. |
|
|
864 */ |
|
|
865 tree_constant * |
|
|
866 builtin_input (tree_constant *args, int nargin, int nargout) |
|
|
867 { |
|
|
868 tree_constant *retval = NULL_TREE_CONST; |
|
|
869 |
|
|
870 if (nargin == 2 || nargin == 3) |
|
|
871 { |
|
|
872 retval = new tree_constant [2]; |
|
|
873 retval[0] = get_user_input (args, nargin, nargout); |
|
|
874 } |
|
|
875 else |
|
|
876 usage ("input (\"prompt\" [, \"s\"])"); |
|
|
877 |
|
|
878 return retval; |
|
|
879 } |
|
|
880 |
|
|
881 /* |
|
|
882 * Is the argument a string? |
|
|
883 */ |
|
|
884 tree_constant * |
|
|
885 builtin_isstr (tree_constant *args, int nargin, int nargout) |
|
|
886 { |
|
|
887 tree_constant *retval = NULL_TREE_CONST; |
|
|
888 if (nargin != 2) |
|
|
889 usage ("isstr (value)"); |
|
|
890 else |
|
|
891 { |
|
|
892 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
893 { |
|
|
894 retval = new tree_constant [2]; |
|
|
895 retval[0] = args[1].isstr (); |
|
|
896 } |
|
|
897 } |
|
|
898 return retval; |
|
|
899 } |
|
|
900 |
|
|
901 /* |
|
|
902 * Maybe help in debugging. |
|
|
903 */ |
|
|
904 tree_constant * |
|
|
905 builtin_keyboard (tree_constant *args, int nargin, int nargout) |
|
|
906 { |
|
|
907 tree_constant *retval = NULL_TREE_CONST; |
|
|
908 |
|
|
909 if (nargin == 1 || nargin == 2) |
|
|
910 { |
|
|
911 retval = new tree_constant [2]; |
|
|
912 retval[0] = get_user_input (args, nargin, nargout, 1); |
|
|
913 } |
|
|
914 else |
|
|
915 usage ("keyboard (\"prompt\")"); |
|
|
916 |
|
|
917 return retval; |
|
|
918 } |
|
|
919 |
|
|
920 /* |
|
|
921 * Matrix logarithm. |
|
|
922 */ |
|
|
923 tree_constant * |
|
|
924 builtin_logm (tree_constant *args, int nargin, int nargout) |
|
|
925 { |
|
|
926 tree_constant *retval = NULL_TREE_CONST; |
|
|
927 |
|
|
928 if (nargin == 2) |
|
|
929 retval = matrix_log (args[1]); |
|
|
930 else |
|
|
931 usage ("logm (A)"); |
|
|
932 |
|
|
933 return retval; |
|
|
934 } |
|
|
935 |
|
|
936 /* |
|
|
937 * LPs. |
|
|
938 */ |
|
|
939 static void |
|
|
940 lpsolve_usage (void) |
|
|
941 { |
|
|
942 usage ("[x, obj, info] = lpsolve (XXX FIXME XXX)"); |
|
|
943 } |
|
|
944 |
|
|
945 tree_constant * |
|
|
946 builtin_lpsolve (tree_constant *args, int nargin, int nargout) |
|
|
947 { |
|
|
948 tree_constant *retval = NULL_TREE_CONST; |
|
|
949 |
|
|
950 // Force a bad value of inform, and empty matrices for x and phi. |
|
|
951 retval = new tree_constant [4]; |
|
|
952 Matrix m; |
|
|
953 retval[0] = tree_constant (m); |
|
|
954 retval[1] = tree_constant (m); |
|
|
955 retval[2] = tree_constant (-1.0); |
|
|
956 |
|
|
957 if (nargin == 0) |
|
|
958 DLD_BUILTIN (args, nargin, nargout, lpsolve, |
|
|
959 retval = lpsolve (args, nargin, nargout);) |
|
|
960 else |
|
|
961 lpsolve_usage (); |
|
|
962 |
|
|
963 return retval; |
|
|
964 } |
|
|
965 |
|
|
966 /* |
|
|
967 * ODEs. |
|
|
968 */ |
|
|
969 static void |
|
|
970 lsode_usage (void) |
|
|
971 { |
|
|
972 usage ("lsode (\"function_name\", x0, t_out\n\ |
|
|
973 lsode (\"function_name\", x0, t_out, t_crit)\n\ |
|
|
974 \n\ |
|
|
975 The first argument is the name of the function to call to\n\ |
|
|
976 compute the vector of right hand sides. It must have the form\n\ |
|
|
977 \n\ |
|
|
978 xdot = f (x, t)\n\ |
|
|
979 \n\ |
|
|
980 where xdot and x are vectors and t is a scalar."); |
|
|
981 } |
|
|
982 |
|
|
983 tree_constant * |
|
|
984 builtin_lsode (tree_constant *args, int nargin, int nargout) |
|
|
985 { |
|
|
986 tree_constant *retval = NULL_TREE_CONST; |
|
|
987 |
|
|
988 if ((nargin == 4 || nargin == 5) && nargout == 1) |
|
|
989 DLD_BUILTIN (args, nargin, nargout, lsode, |
|
|
990 retval = lsode (args, nargin, nargout);) |
|
|
991 else |
|
|
992 lsode_usage (); |
|
|
993 |
|
|
994 return retval; |
|
|
995 } |
|
|
996 |
|
|
997 /* |
|
|
998 * LU factorization. |
|
|
999 */ |
|
|
1000 tree_constant * |
|
|
1001 builtin_lu (tree_constant *args, int nargin, int nargout) |
|
|
1002 { |
|
|
1003 tree_constant *retval = NULL_TREE_CONST; |
|
|
1004 |
|
|
1005 if (nargin == 2 && nargout < 4) |
|
|
1006 DLD_BUILTIN (args, nargin, nargout, lu, |
|
|
1007 retval = lu (args[1], nargout);) |
|
|
1008 else |
|
|
1009 usage ("[L, U, P] = lu (A)"); |
|
|
1010 |
|
|
1011 return retval; |
|
|
1012 } |
|
|
1013 |
|
|
1014 /* |
|
|
1015 * Max values. |
|
|
1016 */ |
|
|
1017 tree_constant * |
|
|
1018 builtin_max (tree_constant *args, int nargin, int nargout) |
|
|
1019 { |
|
|
1020 tree_constant *retval = NULL_TREE_CONST; |
|
|
1021 |
|
|
1022 if ((nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
1023 || (nargin == 3 && nargout == 1)) |
|
|
1024 retval = column_max (args, nargin, nargout); |
|
|
1025 else |
|
|
1026 usage ("[X, I] = max (A)\n X = max (A)\n X = max (A, B)"); |
|
|
1027 |
|
|
1028 return retval; |
|
|
1029 } |
|
|
1030 |
|
|
1031 /* |
|
|
1032 * Min values. |
|
|
1033 */ |
|
|
1034 tree_constant * |
|
|
1035 builtin_min (tree_constant *args, int nargin, int nargout) |
|
|
1036 { |
|
|
1037 tree_constant *retval = NULL_TREE_CONST; |
|
|
1038 |
|
|
1039 if ((nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
1040 || (nargin == 3 && nargout == 1)) |
|
|
1041 retval = column_min (args, nargin, nargout); |
|
|
1042 else |
|
|
1043 usage ("[X, I] = min (A)\n X = min (A)\n X = min (A, B)"); |
|
|
1044 |
|
|
1045 return retval; |
|
|
1046 } |
|
|
1047 |
|
|
1048 /* |
|
|
1049 * NLPs. |
|
|
1050 */ |
|
|
1051 static void |
|
|
1052 npsol_usage (void) |
|
|
1053 { |
|
|
1054 #if defined (NPSOL_MISSING) |
|
|
1055 message ("npsol", "this function requires NPSOL, which is not freely\n\ |
|
|
1056 redistributable. For more information, read the file\n\ |
|
|
1057 libcruft/npsol/README.MISSING in the source distribution."); |
|
|
1058 #else |
|
|
1059 usage ("\n\n\ |
|
|
1060 [x, obj, info, lambda] = npsol (x, \"phi\" [, lb, ub] [, lb, A, ub] [, lb, \"g\", ub])\n\n\ |
|
|
1061 Groups of arguments surrounded in `[]' are optional, but\n\ |
|
|
1062 must appear in the same relative order shown above.\n\ |
|
|
1063 \n\ |
|
|
1064 The second argument is a string containing the name of the objective\n\ |
|
|
1065 function to call. The objective function must be of the form\n\ |
|
|
1066 \n\ |
|
|
1067 y = phi (x)\n\ |
|
|
1068 \n\ |
|
|
1069 where x is a vector and y is a scalar."); |
|
|
1070 #endif |
|
|
1071 } |
|
|
1072 |
|
|
1073 tree_constant * |
|
|
1074 builtin_npsol (tree_constant *args, int nargin, int nargout) |
|
|
1075 { |
|
|
1076 tree_constant *retval = NULL_TREE_CONST; |
|
|
1077 |
|
|
1078 #if defined (NPSOL_MISSING) |
|
|
1079 // Force a bad value of inform, and empty matrices for x, phi, and lambda. |
|
|
1080 retval = new tree_constant [4]; |
|
|
1081 Matrix m; |
|
|
1082 retval[0] = tree_constant (m); |
|
|
1083 retval[1] = tree_constant (m); |
|
|
1084 retval[2] = tree_constant (-1.0); |
|
|
1085 retval[3] = tree_constant (m); |
|
|
1086 npsol_usage (); |
|
|
1087 #else |
|
|
1088 if ((nargin == 3 || nargin == 5 || nargin == 6 || nargin == 8 |
|
|
1089 || nargin == 9 || nargin == 11) |
|
|
1090 && (nargout >= 1 && nargout <= 4)) |
|
|
1091 DLD_BUILTIN (args, nargin, nargout, npsol, |
|
|
1092 retval = npsol (args, nargin, nargout);) |
|
|
1093 else |
|
|
1094 npsol_usage (); |
|
|
1095 #endif |
|
|
1096 |
|
|
1097 return retval; |
|
|
1098 } |
|
|
1099 |
|
|
1100 /* |
|
|
1101 * A matrix of ones. |
|
|
1102 */ |
|
|
1103 tree_constant * |
|
|
1104 builtin_ones (tree_constant *args, int nargin, int nargout) |
|
|
1105 { |
|
|
1106 tree_constant *retval = NULL_TREE_CONST; |
|
|
1107 |
|
|
1108 switch (nargin) |
|
|
1109 { |
|
|
1110 case 2: |
|
|
1111 retval = new tree_constant [2]; |
|
|
1112 retval[0] = fill_matrix (args[1], 1.0, "ones"); |
|
|
1113 break; |
|
|
1114 case 3: |
|
|
1115 retval = new tree_constant [2]; |
|
|
1116 retval[0] = fill_matrix (args[1], args[2], 1.0, "ones"); |
|
|
1117 break; |
|
|
1118 default: |
|
|
1119 usage ("ones (n)\n ones (A)\n ones (n, m)"); |
|
|
1120 break; |
|
|
1121 } |
|
|
1122 return retval; |
|
|
1123 } |
|
|
1124 |
|
|
1125 /* |
|
|
1126 * You guessed it. |
|
|
1127 */ |
|
|
1128 tree_constant * |
|
|
1129 builtin_pause (tree_constant *args, int nargin, int nargout) |
|
|
1130 { |
|
|
1131 if (! (nargin == 1 || nargin == 2)) |
|
|
1132 { |
|
|
1133 usage ("pause ([delay])"); |
|
|
1134 return NULL_TREE_CONST; |
|
|
1135 } |
|
|
1136 |
|
|
1137 if (interactive) |
|
|
1138 { |
|
|
1139 if (nargin == 2) |
|
|
1140 sleep (NINT (args[1].double_value ())); |
|
|
1141 else if (kbhit () == EOF) |
|
|
1142 clean_up_and_exit (0); |
|
|
1143 } |
|
|
1144 return NULL_TREE_CONST; |
|
|
1145 } |
|
|
1146 |
|
|
1147 /* |
|
|
1148 * Delete turds from /tmp. |
|
|
1149 */ |
|
|
1150 tree_constant * |
|
|
1151 builtin_purge_tmp_files (tree_constant *, int, int) |
|
|
1152 { |
|
|
1153 cleanup_tmp_files (); |
|
|
1154 return NULL_TREE_CONST; |
|
|
1155 } |
|
|
1156 |
|
|
1157 /* |
|
|
1158 * Formatted printing. |
|
|
1159 */ |
|
|
1160 tree_constant * |
|
|
1161 builtin_printf (tree_constant *args, int nargin, int nargout) |
|
|
1162 { |
|
|
1163 tree_constant *retval = NULL_TREE_CONST; |
|
|
1164 if (nargin < 2) |
|
|
1165 usage ("printf (\"fmt\" [, ...])"); |
|
|
1166 else |
|
|
1167 retval = do_printf ("printf", args, nargin, nargout); |
|
|
1168 return retval; |
|
|
1169 } |
|
|
1170 |
|
|
1171 /* |
|
|
1172 * Product. |
|
|
1173 */ |
|
|
1174 tree_constant * |
|
|
1175 builtin_prod (tree_constant *args, int nargin, int nargout) |
|
|
1176 { |
|
|
1177 tree_constant *retval = NULL_TREE_CONST; |
|
|
1178 if (nargin != 2) |
|
|
1179 usage ("prod (M)"); |
|
|
1180 else |
|
|
1181 { |
|
|
1182 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1183 { |
|
|
1184 retval = new tree_constant [2]; |
|
|
1185 retval[0] = args[1].prod (); |
|
|
1186 } |
|
|
1187 } |
|
|
1188 return retval; |
|
|
1189 } |
|
|
1190 |
|
|
1191 /* |
|
|
1192 * Print name of current working directory. |
|
|
1193 */ |
|
|
1194 tree_constant * |
|
|
1195 builtin_pwd (tree_constant *args, int nargin, int nargout) |
|
|
1196 { |
|
|
1197 tree_constant *retval = NULL_TREE_CONST; |
|
|
1198 char *directory; |
|
|
1199 |
|
|
1200 if (verbatim_pwd) |
|
|
1201 { |
|
|
1202 char *buffer = new char [MAXPATHLEN]; |
|
|
1203 directory = getcwd (buffer, MAXPATHLEN); |
|
|
1204 |
|
|
1205 if (!directory) |
|
|
1206 { |
|
|
1207 message ("pwd", "can't find working directory!"); |
|
|
1208 delete buffer; |
|
|
1209 } |
|
|
1210 } |
|
|
1211 else |
|
|
1212 { |
|
|
1213 directory = get_working_directory ("pwd"); |
|
|
1214 } |
|
|
1215 |
|
|
1216 if (directory) |
|
|
1217 { |
|
|
1218 char *s = strconcat (directory, "\n"); |
|
|
1219 retval = new tree_constant [2]; |
|
|
1220 retval[0] = tree_constant (s); |
|
|
1221 delete [] s; |
|
|
1222 } |
|
|
1223 return retval; |
|
|
1224 } |
|
|
1225 |
|
|
1226 /* |
|
|
1227 * QPs. |
|
|
1228 */ |
|
|
1229 static void |
|
|
1230 qpsol_usage (void) |
|
|
1231 { |
|
|
1232 #if defined (QPSOL_MISSING) |
|
|
1233 message ("qpsol", "this function requires QPSOL, which is not freely\n\ |
|
|
1234 redistributable. For more information, read the file\n\ |
|
|
1235 libcruft/qpsol/README.MISSING in the source distribution."); |
|
|
1236 #else |
|
|
1237 usage ("[x, obj, info, lambda] = qpsol (x, H, c [, lb, ub] [, lb, A, ub])\n\ |
|
|
1238 \n\ |
|
|
1239 Groups of arguments surrounded in `[]' are optional, but\n\ |
|
|
1240 must appear in the same relative order shown above."); |
|
|
1241 #endif |
|
|
1242 } |
|
|
1243 |
|
|
1244 tree_constant * |
|
|
1245 builtin_qpsol (tree_constant *args, int nargin, int nargout) |
|
|
1246 { |
|
|
1247 tree_constant *retval = NULL_TREE_CONST; |
|
|
1248 |
|
|
1249 #if defined (QPSOL_MISSING) |
|
|
1250 // Force a bad value of inform, and empty matrices for x, phi, and lambda. |
|
|
1251 retval = new tree_constant [5]; |
|
|
1252 Matrix m; |
|
|
1253 retval[0] = tree_constant (m); |
|
|
1254 retval[1] = tree_constant (m); |
|
|
1255 retval[2] = tree_constant (-1.0); |
|
|
1256 retval[3] = tree_constant (m); |
|
|
1257 qpsol_usage (); |
|
|
1258 #else |
|
|
1259 if ((nargin == 4 || nargin == 6 || nargin == 7 || nargin == 9) |
|
|
1260 && (nargout >= 1 && nargout <= 4)) |
|
|
1261 DLD_BUILTIN (args, nargin, nargout, qpsol, |
|
|
1262 retval = qpsol (args, nargin, nargout);) |
|
|
1263 else |
|
|
1264 qpsol_usage (); |
|
|
1265 #endif |
|
|
1266 |
|
|
1267 return retval; |
|
|
1268 } |
|
|
1269 |
|
|
1270 /* |
|
|
1271 * QR factorization. |
|
|
1272 */ |
|
|
1273 tree_constant * |
|
|
1274 builtin_qr (tree_constant *args, int nargin, int nargout) |
|
|
1275 { |
|
|
1276 tree_constant *retval = NULL_TREE_CONST; |
|
|
1277 |
|
|
1278 if (nargin == 2 && nargout < 3) |
|
|
1279 DLD_BUILTIN (args, nargin, nargout, qr, |
|
|
1280 retval = qr (args[1], nargout);) |
|
|
1281 else |
|
|
1282 usage ("[Q, R] = qr (A)"); |
|
|
1283 |
|
|
1284 return retval; |
|
|
1285 } |
|
|
1286 |
|
|
1287 /* |
|
45
|
1288 * generalized eigenvalues via qz |
|
|
1289 */ |
|
|
1290 tree_constant * |
|
|
1291 builtin_qzval (tree_constant *args, int nargin, int nargout) |
|
|
1292 { |
|
|
1293 tree_constant *retval = NULL_TREE_CONST; |
|
|
1294 |
|
|
1295 if (nargin == 3 && nargout < 2) |
|
|
1296 DLD_BUILTIN (args, nargin, nargout, qzvalue, |
|
|
1297 retval = qzvalue (args, nargin, nargout);) |
|
|
1298 else |
|
|
1299 usage ("x = qzval (A,B): compute generalized eigenvalues of \n\ |
|
|
1300 the matrix pencil (A - lambda B). A and B must be real matrices.\n"); |
|
|
1301 |
|
|
1302 return retval; |
|
|
1303 } |
|
|
1304 |
|
|
1305 /* |
|
1
|
1306 * Random numbers. |
|
|
1307 */ |
|
|
1308 tree_constant * |
|
|
1309 builtin_quad (tree_constant *args, int nargin, int nargout) |
|
|
1310 { |
|
|
1311 tree_constant *retval = NULL_TREE_CONST; |
|
|
1312 |
|
|
1313 if ((nargin > 3 && nargin < 7) && (nargout > 0 && nargout < 5)) |
|
|
1314 DLD_BUILTIN (args, nargin, nargout, quad, |
|
|
1315 retval = do_quad (args, nargin, nargout);) |
|
|
1316 else |
|
|
1317 usage ("[v, ier, nfun, err] = quad (\"f\", a, b)\n\ |
|
|
1318 = quad (\"f\", a, b, tol)\n\ |
|
|
1319 = quad (\"f\", a, b, tol, sing)"); |
|
|
1320 |
|
|
1321 return retval; |
|
|
1322 } |
|
|
1323 |
|
|
1324 /* |
|
|
1325 * I'm outta here. |
|
|
1326 */ |
|
|
1327 tree_constant * |
|
|
1328 builtin_quit (tree_constant *args, int nargin, int nargout) |
|
|
1329 { |
|
|
1330 quitting_gracefully = 1; |
|
|
1331 clean_up_and_exit (0); |
|
|
1332 return NULL_TREE_CONST; |
|
|
1333 } |
|
|
1334 |
|
|
1335 /* |
|
|
1336 * Random numbers. |
|
|
1337 */ |
|
|
1338 tree_constant * |
|
|
1339 builtin_rand (tree_constant *args, int nargin, int nargout) |
|
|
1340 { |
|
|
1341 tree_constant *retval = NULL_TREE_CONST; |
|
|
1342 |
|
|
1343 if ((nargin > 0 && nargin < 4) && nargout == 1) |
|
|
1344 DLD_BUILTIN (args, nargin, nargout, rand, |
|
|
1345 retval = rand_internal (args, nargin, nargout);) |
|
|
1346 else |
|
|
1347 usage ("rand -- generate a random value\n\ |
|
|
1348 rand (n) -- generate N x N matrix\n\ |
|
|
1349 rand (A) -- generate matrix the size of A\n\ |
|
|
1350 rand (n, m) -- generate N x M matrix\n\ |
|
|
1351 rand (\"dist\") -- get current distribution\n\ |
|
|
1352 rand (\"distribution\") -- set distribution\n\ |
|
|
1353 rand (\"seed\") -- get current seed\n\ |
|
|
1354 rand (\"seed\", n) -- set seed"); |
|
|
1355 |
|
|
1356 return retval; |
|
|
1357 } |
|
|
1358 |
|
|
1359 /* |
|
|
1360 * Replot current plot. |
|
|
1361 */ |
|
|
1362 tree_constant * |
|
|
1363 builtin_replot (tree_constant *args, int nargin, int nargout) |
|
|
1364 { |
|
|
1365 tree_constant *retval = NULL_TREE_CONST; |
|
|
1366 |
|
|
1367 if (nargin > 1) |
|
|
1368 warning ("replot: ignoring extra arguments"); |
|
|
1369 |
|
|
1370 send_to_plot_stream ("replot\n"); |
|
|
1371 |
|
|
1372 return retval; |
|
|
1373 } |
|
|
1374 |
|
|
1375 /* |
|
|
1376 * Formatted reading. |
|
|
1377 */ |
|
|
1378 tree_constant * |
|
|
1379 builtin_scanf (tree_constant *args, int nargin, int nargout) |
|
|
1380 { |
|
|
1381 tree_constant *retval = NULL_TREE_CONST; |
|
|
1382 if (nargin != 2) |
|
|
1383 usage ("[...] = scanf (\"fmt\")"); |
|
|
1384 else |
|
|
1385 retval = do_scanf ("scanf", args, nargin, nargout); |
|
|
1386 return retval; |
|
|
1387 } |
|
|
1388 |
|
|
1389 /* |
|
|
1390 * Convert a vector to a string. |
|
|
1391 */ |
|
|
1392 tree_constant * |
|
|
1393 builtin_setstr (tree_constant *args, int nargin, int nargout) |
|
|
1394 { |
|
|
1395 tree_constant *retval = NULL_TREE_CONST; |
|
|
1396 |
|
|
1397 if (nargin == 2) |
|
|
1398 { |
|
|
1399 retval = new tree_constant [2]; |
|
|
1400 retval[0] = args[1].convert_to_str (); |
|
|
1401 } |
|
|
1402 else |
|
|
1403 usage ("setstr (v)"); |
|
|
1404 |
|
|
1405 return retval; |
|
|
1406 } |
|
|
1407 |
|
|
1408 /* |
|
|
1409 * Execute a shell command. |
|
|
1410 */ |
|
|
1411 tree_constant * |
|
|
1412 builtin_shell_command (tree_constant *args, int nargin, int nargout) |
|
|
1413 { |
|
|
1414 tree_constant *retval = NULL_TREE_CONST; |
|
|
1415 |
|
|
1416 if (nargin == 2 || nargin == 3) |
|
|
1417 { |
|
|
1418 if (args[1].is_string_type ()) |
|
|
1419 { |
|
|
1420 iprocstream cmd (args[1].string_value ()); |
|
|
1421 char ch; |
|
|
1422 ostrstream output_buf; |
|
|
1423 while (cmd.get (ch)) |
|
|
1424 output_buf.put (ch); |
|
|
1425 |
|
|
1426 output_buf << ends; |
|
|
1427 if (nargin == 2) |
|
|
1428 { |
|
|
1429 maybe_page_output (output_buf); |
|
|
1430 } |
|
|
1431 else |
|
|
1432 { |
|
|
1433 retval = new tree_constant [2]; |
|
|
1434 retval[0] = tree_constant (output_buf.str ()); |
|
|
1435 } |
|
|
1436 } |
|
|
1437 else |
|
|
1438 error ("shell_cmd: first argument must be a string"); |
|
|
1439 } |
|
|
1440 else |
|
|
1441 usage ("shell_cmd (string [, return_output])"); |
|
|
1442 |
|
|
1443 return retval; |
|
|
1444 } |
|
|
1445 |
|
|
1446 /* |
|
|
1447 * Report rows and columns. |
|
|
1448 */ |
|
|
1449 tree_constant * |
|
|
1450 builtin_size (tree_constant *args, int nargin, int nargout) |
|
|
1451 { |
|
|
1452 tree_constant *retval = NULL_TREE_CONST; |
|
|
1453 |
|
|
1454 if (nargin != 2) |
|
|
1455 usage ("size (x)"); |
|
|
1456 else |
|
|
1457 { |
|
|
1458 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1459 { |
|
|
1460 int nr = args[1].rows (); |
|
|
1461 int nc = args[1].columns (); |
|
|
1462 if (nargout == 1) |
|
|
1463 { |
|
|
1464 Matrix m (1, 2); |
|
|
1465 m.elem (0, 0) = nr; |
|
|
1466 m.elem (0, 1) = nc; |
|
|
1467 retval = new tree_constant [2]; |
|
|
1468 retval[0] = tree_constant (m); |
|
|
1469 } |
|
|
1470 else if (nargout == 2) |
|
|
1471 { |
|
|
1472 retval = new tree_constant [3]; |
|
|
1473 retval[0] = tree_constant ((double) nr); |
|
|
1474 retval[1] = tree_constant ((double) nc); |
|
|
1475 } |
|
|
1476 else |
|
|
1477 usage ("[n, m] = size (A)\n size (A)"); |
|
|
1478 } |
|
|
1479 } |
|
|
1480 return retval; |
|
|
1481 } |
|
|
1482 |
|
|
1483 /* |
|
|
1484 * Sort columns. |
|
|
1485 */ |
|
|
1486 tree_constant * |
|
|
1487 builtin_sort (tree_constant *args, int nargin, int nargout) |
|
|
1488 { |
|
|
1489 tree_constant *retval = NULL_TREE_CONST; |
|
|
1490 |
|
|
1491 if (nargin == 2) |
|
|
1492 retval = sort (args, nargin, nargout); |
|
|
1493 else |
|
|
1494 usage ("[s, i] = sort (x)"); |
|
|
1495 |
|
|
1496 return retval; |
|
|
1497 } |
|
|
1498 |
|
|
1499 /* |
|
|
1500 * Formatted printing to a string. |
|
|
1501 */ |
|
|
1502 tree_constant * |
|
|
1503 builtin_sprintf (tree_constant *args, int nargin, int nargout) |
|
|
1504 { |
|
|
1505 tree_constant *retval = NULL_TREE_CONST; |
|
|
1506 if (nargin < 2) |
|
|
1507 usage ("string = sprintf (\"fmt\" [, ...])"); |
|
|
1508 else |
|
|
1509 retval = do_printf ("sprintf", args, nargin, nargout); |
|
|
1510 return retval; |
|
|
1511 } |
|
|
1512 |
|
|
1513 /* |
|
|
1514 * Matrix sqrt. |
|
|
1515 */ |
|
|
1516 tree_constant * |
|
|
1517 builtin_sqrtm (tree_constant *args, int nargin, int nargout) |
|
|
1518 { |
|
|
1519 tree_constant *retval = NULL_TREE_CONST; |
|
|
1520 |
|
|
1521 if (nargin == 2) |
|
|
1522 retval = matrix_sqrt (args[1]); |
|
|
1523 else |
|
|
1524 usage ("sqrtm (A)"); |
|
|
1525 |
|
|
1526 return retval; |
|
|
1527 } |
|
|
1528 |
|
|
1529 /* |
|
|
1530 * Formatted reading from a string. |
|
|
1531 */ |
|
|
1532 tree_constant * |
|
|
1533 builtin_sscanf (tree_constant *args, int nargin, int nargout) |
|
|
1534 { |
|
|
1535 tree_constant *retval = NULL_TREE_CONST; |
|
|
1536 if (nargin != 3) |
|
|
1537 usage ("[...] = sscanf (string, \"fmt\")"); |
|
|
1538 else |
|
|
1539 retval = do_scanf ("sscanf", args, nargin, nargout); |
|
|
1540 return retval; |
|
|
1541 } |
|
|
1542 |
|
|
1543 /* |
|
|
1544 * Sum. |
|
|
1545 */ |
|
|
1546 tree_constant * |
|
|
1547 builtin_sum (tree_constant *args, int nargin, int nargout) |
|
|
1548 { |
|
|
1549 tree_constant *retval = NULL_TREE_CONST; |
|
|
1550 if (nargin != 2) |
|
|
1551 usage ("sum (M)"); |
|
|
1552 else |
|
|
1553 { |
|
|
1554 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1555 { |
|
|
1556 retval = new tree_constant [2]; |
|
|
1557 retval[0] = args[1].sum (); |
|
|
1558 } |
|
|
1559 } |
|
|
1560 return retval; |
|
|
1561 } |
|
|
1562 |
|
|
1563 /* |
|
|
1564 * Sum of squares. |
|
|
1565 */ |
|
|
1566 tree_constant * |
|
|
1567 builtin_sumsq (tree_constant *args, int nargin, int nargout) |
|
|
1568 { |
|
|
1569 tree_constant *retval = NULL_TREE_CONST; |
|
|
1570 if (nargin != 2) |
|
|
1571 usage ("sumsq (M)"); |
|
|
1572 else |
|
|
1573 { |
|
|
1574 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1575 { |
|
|
1576 retval = new tree_constant [2]; |
|
|
1577 retval[0] = args[1].sumsq (); |
|
|
1578 } |
|
|
1579 } |
|
|
1580 return retval; |
|
|
1581 } |
|
|
1582 |
|
|
1583 /* |
|
|
1584 * Singluar value decomposition. |
|
|
1585 */ |
|
|
1586 tree_constant * |
|
|
1587 builtin_svd (tree_constant *args, int nargin, int nargout) |
|
|
1588 { |
|
|
1589 tree_constant *retval = NULL_TREE_CONST; |
|
|
1590 |
|
|
1591 if (nargin == 2 && (nargout == 1 || nargout == 3)) |
|
|
1592 DLD_BUILTIN (args, nargin, nargout, svd, |
|
|
1593 retval = svd (args, nargin, nargout);) |
|
|
1594 else |
|
|
1595 usage ("[U, S, V] = svd (A)\n S = svd (A)"); |
|
|
1596 |
|
|
1597 return retval; |
|
|
1598 } |
|
|
1599 |
|
|
1600 /* |
|
38
|
1601 * Sylvester equation solver. |
|
|
1602 */ |
|
|
1603 tree_constant * |
|
|
1604 builtin_syl (tree_constant *args, int nargin, int nargout) |
|
|
1605 { |
|
|
1606 tree_constant *retval = NULL_TREE_CONST; |
|
|
1607 |
|
|
1608 if ((nargin == 4) && (nargout == 1)) |
|
|
1609 DLD_BUILTIN (args, nargin, nargout, syl, |
|
|
1610 retval = syl (args, nargin, nargout);) |
|
|
1611 else |
|
|
1612 usage ("X = syl (A,B,C)"); |
|
|
1613 |
|
|
1614 return retval; |
|
|
1615 } |
|
|
1616 |
|
|
1617 /* |
|
1
|
1618 * Schur Decomposition |
|
|
1619 */ |
|
|
1620 tree_constant * |
|
|
1621 builtin_schur (tree_constant *args, int nargin, int nargout) |
|
|
1622 { |
|
|
1623 tree_constant *retval = NULL_TREE_CONST; |
|
|
1624 |
|
|
1625 if ((nargin == 3 || nargin == 2) && (nargout == 1 || nargout == 2)) |
|
|
1626 DLD_BUILTIN (args, nargin, nargout, hess, |
|
|
1627 retval = schur (args, nargin, nargout);) |
|
|
1628 else |
|
|
1629 usage ("[U, S] = schur (A)\n\ |
|
|
1630 S = schur (A)\n\n\ |
|
|
1631 or, for ordered Schur:\n\n\ |
|
|
1632 [U, S] = schur (A, \"A, D, or U\")\n\ |
|
|
1633 S = schur (A, \"A, D, or U\")\n\ |
|
|
1634 where:\n\n\ |
|
|
1635 A = continuous time poles\n\ |
|
|
1636 D = discrete time poles\n\ |
|
|
1637 U = unordered schur (default)"); |
|
|
1638 |
|
|
1639 return retval; |
|
|
1640 } |
|
|
1641 |
|
|
1642 /* |
|
30
|
1643 * Givens rotation |
|
|
1644 */ |
|
|
1645 tree_constant * |
|
|
1646 builtin_givens (tree_constant *args, int nargin, int nargout) |
|
|
1647 { |
|
|
1648 tree_constant *retval = NULL_TREE_CONST; |
|
|
1649 |
|
|
1650 if (nargin == 3 && (nargout == 1 || nargout == 2 )) |
|
|
1651 retval = givens (args, nargin, nargout); |
|
|
1652 else |
|
|
1653 usage ("[c, s] = givens (x,y)\n G = givens (x,y)"); |
|
|
1654 |
|
|
1655 return retval; |
|
|
1656 } |
|
|
1657 |
|
|
1658 /* |
|
|
1659 * Hessenberg Decomposition |
|
1
|
1660 */ |
|
|
1661 tree_constant * |
|
|
1662 builtin_hess (tree_constant *args, int nargin, int nargout) |
|
|
1663 { |
|
|
1664 tree_constant *retval = NULL_TREE_CONST; |
|
|
1665 |
|
|
1666 if (nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
1667 DLD_BUILTIN (args, nargin, nargout, hess, |
|
|
1668 retval = hess (args, nargin, nargout);) |
|
|
1669 else |
|
|
1670 usage ("[P, H] = hess (A)\n H = hess (A)"); |
|
|
1671 |
|
|
1672 return retval; |
|
|
1673 } |
|
|
1674 |
|
|
1675 /* |
|
|
1676 * Copying information. |
|
|
1677 */ |
|
|
1678 tree_constant * |
|
|
1679 builtin_warranty (tree_constant *args, int nargin, int nargout) |
|
|
1680 { |
|
|
1681 ostrstream output_buf; |
|
|
1682 output_buf << "\n Octave, version " << version_string |
|
|
1683 << ". Copyright (C) 1992, 1993, John W. Eaton\n" |
|
|
1684 << "\n\ |
|
|
1685 This program is free software; you can redistribute it and/or modify\n\ |
|
|
1686 it under the terms of the GNU General Public License as published by\n\ |
|
|
1687 the Free Software Foundation; either version 2 of the License, or\n\ |
|
|
1688 (at your option) any later version.\n\n\ |
|
|
1689 This program is distributed in the hope that it will be useful,\n\ |
|
|
1690 but WITHOUT ANY WARRANTY; without even the implied warranty of\n\ |
|
|
1691 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\ |
|
|
1692 GNU General Public License for more details.\n\n\ |
|
|
1693 You should have received a copy of the GNU General Public License\n\ |
|
|
1694 along with this program. If not, write to the Free Software\n\ |
|
|
1695 Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.\n\n"; |
|
|
1696 |
|
|
1697 output_buf << ends; |
|
|
1698 maybe_page_output (output_buf); |
|
|
1699 |
|
|
1700 return NULL_TREE_CONST; |
|
|
1701 } |
|
|
1702 |
|
|
1703 /* |
|
|
1704 * A matrix of zeros. |
|
|
1705 */ |
|
|
1706 tree_constant * |
|
|
1707 builtin_zeros (tree_constant *args, int nargin, int nargout) |
|
|
1708 { |
|
|
1709 tree_constant *retval = NULL_TREE_CONST; |
|
|
1710 |
|
|
1711 switch (nargin) |
|
|
1712 { |
|
|
1713 case 2: |
|
|
1714 retval = new tree_constant [2]; |
|
|
1715 retval[0] = fill_matrix (args[1], 0.0, "zeros"); |
|
|
1716 break; |
|
|
1717 case 3: |
|
|
1718 retval = new tree_constant [2]; |
|
|
1719 retval[0] = fill_matrix (args[1], args[2], 0.0, "zeros"); |
|
|
1720 break; |
|
|
1721 default: |
|
|
1722 usage ("zeros (n)\n zeros (A)\n zeros (n, m)"); |
|
|
1723 break; |
|
|
1724 } |
|
|
1725 return retval; |
|
|
1726 } |
|
|
1727 |
|
|
1728 /* |
|
|
1729 ;;; Local Variables: *** |
|
|
1730 ;;; mode: C++ *** |
|
|
1731 ;;; page-delimiter: "^/\\*" *** |
|
|
1732 ;;; End: *** |
|
|
1733 */ |
