|
1741
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
1741
|
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 |
|
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
|
27 #ifdef HAVE_CONFIG_H |
|
|
28 #include <config.h> |
|
|
29 #endif |
|
|
30 |
|
3503
|
31 #include <iostream> |
|
|
32 #include <strstream> |
|
1741
|
33 |
|
2172
|
34 #include "defun.h" |
|
1741
|
35 #include "error.h" |
|
|
36 #include "oct-obj.h" |
|
2982
|
37 #include "pt-arg-list.h" |
|
1741
|
38 #include "pt-exp.h" |
|
|
39 #include "pt-mat.h" |
|
2124
|
40 #include "pt-walk.h" |
|
2201
|
41 #include "utils.h" |
|
2371
|
42 #include "ov.h" |
|
|
43 #include "variables.h" |
|
1741
|
44 |
|
2172
|
45 // Are empty elements in a matrix list ok? For example, is the empty |
|
|
46 // matrix in an expression like `[[], 1]' ok? A positive value means |
|
|
47 // yes. A negative value means yes, but print a warning message. |
|
|
48 // Zero means it should be considered an error. |
|
|
49 static int Vempty_list_elements_ok; |
|
|
50 |
|
3110
|
51 // Should `[97, 98, 99, "123"]' be a string? |
|
|
52 static bool Vimplicit_num_to_str_ok; |
|
|
53 |
|
2254
|
54 // The character to fill with when creating string arrays. |
|
|
55 static char Vstring_fill_char; |
|
|
56 |
|
1741
|
57 // General matrices. This list type is much more work to handle than |
|
|
58 // constant matrices, but it allows us to construct matrices from |
|
|
59 // other matrices, variables, and functions. |
|
|
60 |
|
1827
|
61 // But first, some internal classes that make our job much easier. |
|
1741
|
62 |
|
1827
|
63 class |
|
|
64 tm_row_const |
|
1741
|
65 { |
|
1827
|
66 private: |
|
|
67 |
|
|
68 class |
|
2086
|
69 tm_row_const_rep : public SLList<octave_value> |
|
1827
|
70 { |
|
|
71 public: |
|
|
72 |
|
|
73 tm_row_const_rep (void) |
|
2086
|
74 : SLList<octave_value> (), count (1), nr (0), nc (0), |
|
3110
|
75 all_str (false), some_str (false), is_cmplx (false), |
|
|
76 all_mt (true), ok (false) { } |
|
1827
|
77 |
|
2971
|
78 tm_row_const_rep (const tree_argument_list& row) |
|
2086
|
79 : SLList<octave_value> (), count (1), nr (0), nc (0), |
|
3110
|
80 all_str (false), some_str (false), is_cmplx (false), |
|
|
81 all_mt (true), ok (false) |
|
|
82 { init (row); } |
|
1827
|
83 |
|
|
84 ~tm_row_const_rep (void) { } |
|
|
85 |
|
|
86 int count; |
|
|
87 |
|
|
88 int nr; |
|
|
89 int nc; |
|
1741
|
90 |
|
1827
|
91 bool all_str; |
|
3110
|
92 bool some_str; |
|
1827
|
93 bool is_cmplx; |
|
2602
|
94 bool all_mt; |
|
1827
|
95 |
|
|
96 bool ok; |
|
|
97 |
|
2971
|
98 void init (const tree_argument_list&); |
|
1827
|
99 |
|
|
100 private: |
|
|
101 |
|
|
102 tm_row_const_rep (const tm_row_const_rep&); |
|
|
103 |
|
2971
|
104 tm_row_const_rep& operator = (const tm_row_const_rep&); |
|
2419
|
105 |
|
3661
|
106 void eval_error (const char *msg, int l, int c, |
|
|
107 int x = -1, int y = -1) const; |
|
2419
|
108 |
|
|
109 void eval_warning (const char *msg, int l, int c) const; |
|
1827
|
110 }; |
|
|
111 |
|
|
112 public: |
|
|
113 |
|
2990
|
114 tm_row_const (void) |
|
|
115 : rep (0) { } |
|
1827
|
116 |
|
2971
|
117 tm_row_const (const tree_argument_list& row) |
|
|
118 : rep (new tm_row_const_rep (row)) { } |
|
1827
|
119 |
|
2990
|
120 tm_row_const (const tm_row_const& x) |
|
|
121 : rep (x.rep) |
|
|
122 { |
|
|
123 if (rep) |
|
|
124 rep->count++; |
|
|
125 } |
|
1827
|
126 |
|
|
127 tm_row_const& operator = (const tm_row_const& x) |
|
2990
|
128 { |
|
|
129 if (this != &x && rep != x.rep) |
|
|
130 { |
|
|
131 if (rep && --rep->count == 0) |
|
|
132 delete rep; |
|
1741
|
133 |
|
2990
|
134 rep = x.rep; |
|
1827
|
135 |
|
2990
|
136 if (rep) |
|
|
137 rep->count++; |
|
|
138 } |
|
1741
|
139 |
|
2990
|
140 return *this; |
|
|
141 } |
|
1827
|
142 |
|
|
143 ~tm_row_const (void) |
|
2990
|
144 { |
|
|
145 if (rep && --rep->count == 0) |
|
|
146 delete rep; |
|
|
147 } |
|
1741
|
148 |
|
1827
|
149 int rows (void) { return rep->nr; } |
|
|
150 int cols (void) { return rep->nc; } |
|
|
151 |
|
2868
|
152 bool all_strings_p (void) const { return rep->all_str; } |
|
3110
|
153 bool some_strings_p (void) const { return rep->some_str; } |
|
2868
|
154 bool complex_p (void) const { return rep->is_cmplx; } |
|
|
155 bool all_empty_p (void) const { return rep->all_mt; } |
|
1827
|
156 |
|
2086
|
157 octave_value& operator () (Pix p) { return rep->operator () (p); } |
|
1827
|
158 |
|
2086
|
159 const octave_value& operator () (Pix p) const |
|
1827
|
160 { return rep->operator () (p); } |
|
|
161 |
|
|
162 Pix first (void) const { return rep->first (); } |
|
|
163 void next (Pix& p) const { rep->next (p); } |
|
|
164 |
|
3145
|
165 operator bool () const { return (rep && rep->ok); } |
|
1827
|
166 |
|
|
167 private: |
|
|
168 |
|
|
169 tm_row_const_rep *rep; |
|
|
170 }; |
|
|
171 |
|
|
172 void |
|
2971
|
173 tm_row_const::tm_row_const_rep::init (const tree_argument_list& row) |
|
1827
|
174 { |
|
|
175 all_str = true; |
|
|
176 |
|
|
177 bool first_elem = true; |
|
|
178 |
|
2971
|
179 for (Pix p = row.first (); p != 0; row.next (p)) |
|
1827
|
180 { |
|
2971
|
181 tree_expression *elt = row (p); |
|
1827
|
182 |
|
2971
|
183 octave_value tmp = elt->rvalue (); |
|
1827
|
184 |
|
|
185 if (error_state || tmp.is_undefined ()) |
|
|
186 break; |
|
|
187 else |
|
|
188 { |
|
|
189 int this_elt_nr = tmp.rows (); |
|
|
190 int this_elt_nc = tmp.columns (); |
|
|
191 |
|
|
192 if (this_elt_nr == 0 || this_elt_nc == 0) |
|
|
193 { |
|
2172
|
194 if (Vempty_list_elements_ok < 0) |
|
2419
|
195 eval_warning ("empty matrix found in matrix list", |
|
|
196 elt->line (), elt->column ()); |
|
2172
|
197 else if (Vempty_list_elements_ok == 0) |
|
1827
|
198 { |
|
2419
|
199 eval_error ("empty matrix found in matrix list", |
|
|
200 elt->line (), elt->column ()); |
|
1827
|
201 break; |
|
|
202 } |
|
|
203 } |
|
|
204 else |
|
|
205 { |
|
2602
|
206 all_mt = false; |
|
|
207 |
|
1827
|
208 if (first_elem) |
|
|
209 { |
|
|
210 first_elem = false; |
|
|
211 |
|
|
212 nr = this_elt_nr; |
|
|
213 } |
|
|
214 else if (this_elt_nr != nr) |
|
|
215 { |
|
2419
|
216 eval_error ("number of rows must match", |
|
3661
|
217 elt->line (), elt->column (), this_elt_nr, nr); |
|
1827
|
218 break; |
|
|
219 } |
|
|
220 |
|
|
221 nc += this_elt_nc; |
|
|
222 |
|
|
223 append (tmp); |
|
|
224 } |
|
|
225 |
|
|
226 if (all_str && ! tmp.is_string ()) |
|
|
227 all_str = false; |
|
|
228 |
|
3110
|
229 if (! some_str && tmp.is_string ()) |
|
|
230 some_str = true; |
|
|
231 |
|
1827
|
232 if (! is_cmplx && tmp.is_complex_type ()) |
|
|
233 is_cmplx = true; |
|
|
234 } |
|
|
235 } |
|
|
236 |
|
|
237 ok = ! error_state; |
|
1741
|
238 } |
|
|
239 |
|
2419
|
240 void |
|
|
241 tm_row_const::tm_row_const_rep::eval_error (const char *msg, int l, |
|
3661
|
242 int c, int x, int y) const |
|
2419
|
243 { |
|
|
244 if (l == -1 && c == -1) |
|
3661
|
245 { |
|
|
246 if (x == -1 || y == -1) |
|
|
247 ::error ("%s", msg); |
|
|
248 else |
|
|
249 ::error ("%s (%d != %d)", msg, x, y); |
|
|
250 } |
|
2419
|
251 else |
|
3661
|
252 { |
|
|
253 if (x == -1 || y == -1) |
|
|
254 ::error ("%s near line %d, column %d", msg, l, c); |
|
|
255 else |
|
|
256 ::error ("%s (%d != %d) near line %d, column %d", msg, x, y, l, c); |
|
|
257 } |
|
2419
|
258 } |
|
|
259 |
|
|
260 void |
|
|
261 tm_row_const::tm_row_const_rep::eval_warning (const char *msg, int l, |
|
|
262 int c) const |
|
|
263 { |
|
|
264 if (l == -1 && c == -1) |
|
|
265 ::warning ("%s", msg); |
|
|
266 else |
|
|
267 ::warning ("%s near line %d, column %d", msg, l, c); |
|
|
268 } |
|
|
269 |
|
2580
|
270 #include "SLList.h" |
|
|
271 #include "SLList.cc" |
|
|
272 |
|
1827
|
273 template class SLNode<tm_row_const>; |
|
|
274 template class SLList<tm_row_const>; |
|
|
275 |
|
|
276 class |
|
|
277 tm_const : public SLList<tm_row_const> |
|
|
278 { |
|
|
279 public: |
|
|
280 |
|
|
281 tm_const (const tree_matrix& tm) |
|
3110
|
282 : SLList<tm_row_const> (), nr (0), nc (0), |
|
|
283 all_str (false), some_str (false), is_cmplx (false), |
|
|
284 all_mt (true), ok (false) |
|
1827
|
285 { init (tm); } |
|
|
286 |
|
|
287 ~tm_const (void) { } |
|
|
288 |
|
|
289 int rows (void) const { return nr; } |
|
|
290 int cols (void) const { return nc; } |
|
|
291 |
|
2868
|
292 bool all_strings_p (void) const { return all_str; } |
|
3110
|
293 bool some_strings_p (void) const { return some_str; } |
|
2868
|
294 bool complex_p (void) const { return is_cmplx; } |
|
|
295 bool all_empty_p (void) const { return all_mt; } |
|
1827
|
296 |
|
3145
|
297 operator bool () const { return ok; } |
|
1827
|
298 |
|
|
299 private: |
|
|
300 |
|
|
301 int nr; |
|
|
302 int nc; |
|
|
303 |
|
|
304 bool all_str; |
|
3110
|
305 bool some_str; |
|
1827
|
306 bool is_cmplx; |
|
2602
|
307 bool all_mt; |
|
1827
|
308 |
|
|
309 bool ok; |
|
|
310 |
|
|
311 tm_const (void); |
|
|
312 |
|
|
313 tm_const (const tm_const&); |
|
|
314 |
|
|
315 tm_const& operator = (const tm_const&); |
|
|
316 |
|
|
317 void init (const tree_matrix& tm); |
|
|
318 }; |
|
|
319 |
|
|
320 void |
|
|
321 tm_const::init (const tree_matrix& tm) |
|
1741
|
322 { |
|
1827
|
323 all_str = true; |
|
|
324 |
|
|
325 bool first_elem = true; |
|
|
326 |
|
|
327 // Just eval and figure out if what we have is complex or all |
|
|
328 // strings. We can't check columns until we know that this is a |
|
|
329 // numeric matrix -- collections of strings can have elements of |
|
|
330 // different lengths. |
|
|
331 |
|
|
332 for (Pix p = tm.first (); p != 0; tm.next (p)) |
|
|
333 { |
|
2971
|
334 tree_argument_list *elt = tm (p); |
|
1827
|
335 |
|
|
336 tm_row_const tmp (*elt); |
|
|
337 |
|
|
338 if (tmp) |
|
|
339 { |
|
2868
|
340 if (all_str && ! tmp.all_strings_p ()) |
|
1827
|
341 all_str = false; |
|
|
342 |
|
3110
|
343 if (! some_str && tmp.some_strings_p ()) |
|
|
344 some_str = true; |
|
|
345 |
|
2868
|
346 if (! is_cmplx && tmp.complex_p ()) |
|
1827
|
347 is_cmplx = true; |
|
|
348 |
|
2868
|
349 if (all_mt && ! tmp.all_empty_p ()) |
|
2602
|
350 all_mt = false; |
|
|
351 |
|
1827
|
352 append (tmp); |
|
|
353 } |
|
|
354 else |
|
|
355 break; |
|
|
356 } |
|
|
357 |
|
|
358 if (! error_state) |
|
|
359 { |
|
|
360 for (Pix p = first (); p != 0; next (p)) |
|
|
361 { |
|
|
362 tm_row_const elt = this->operator () (p); |
|
|
363 |
|
|
364 int this_elt_nr = elt.rows (); |
|
|
365 int this_elt_nc = elt.cols (); |
|
|
366 |
|
|
367 if (this_elt_nr == 0 || this_elt_nc == 0) |
|
|
368 { |
|
2172
|
369 if (Vempty_list_elements_ok < 0) |
|
1827
|
370 warning ("empty matrix found in matrix list"); |
|
2172
|
371 else if (Vempty_list_elements_ok == 0) |
|
1827
|
372 { |
|
|
373 ::error ("empty matrix found in matrix list"); |
|
|
374 break; |
|
|
375 } |
|
|
376 } |
|
|
377 else |
|
|
378 { |
|
2602
|
379 all_mt = false; |
|
|
380 |
|
1827
|
381 if (first_elem) |
|
|
382 { |
|
|
383 first_elem = false; |
|
|
384 |
|
|
385 nc = this_elt_nc; |
|
|
386 } |
|
|
387 else if (all_str) |
|
|
388 { |
|
|
389 if (this_elt_nc > nc) |
|
|
390 nc = this_elt_nc; |
|
|
391 } |
|
|
392 else if (this_elt_nc != nc) |
|
|
393 { |
|
3661
|
394 ::error ("number of columns must match (%d != %d)", |
|
|
395 this_elt_nc, nc); |
|
1827
|
396 break; |
|
|
397 } |
|
|
398 |
|
|
399 nr += this_elt_nr; |
|
|
400 } |
|
|
401 } |
|
|
402 } |
|
|
403 |
|
|
404 ok = ! error_state; |
|
1741
|
405 } |
|
|
406 |
|
2990
|
407 tree_matrix::~tree_matrix (void) |
|
|
408 { |
|
|
409 while (! empty ()) |
|
|
410 { |
|
|
411 tree_argument_list *t = remove_front (); |
|
|
412 delete t; |
|
|
413 } |
|
|
414 } |
|
|
415 |
|
1827
|
416 bool |
|
2529
|
417 tree_matrix::all_elements_are_constant (void) const |
|
1827
|
418 { |
|
|
419 for (Pix p = first (); p != 0; next (p)) |
|
|
420 { |
|
2971
|
421 tree_argument_list *elt = this->operator () (p); |
|
1827
|
422 |
|
2529
|
423 if (! elt->all_elements_are_constant ()) |
|
1827
|
424 return false; |
|
|
425 } |
|
|
426 |
|
|
427 return true; |
|
|
428 } |
|
|
429 |
|
|
430 // Just about as ugly as it gets. |
|
1741
|
431 // Less ugly than before, anyway. |
|
1827
|
432 // Looking better all the time. |
|
1741
|
433 |
|
2971
|
434 octave_value_list |
|
|
435 tree_matrix::rvalue (int nargout) |
|
|
436 { |
|
|
437 octave_value_list retval; |
|
|
438 |
|
|
439 if (nargout > 1) |
|
|
440 error ("invalid number of output arguments for matrix list"); |
|
|
441 else |
|
|
442 retval = rvalue (); |
|
|
443 |
|
|
444 return retval; |
|
|
445 } |
|
|
446 |
|
2086
|
447 octave_value |
|
2971
|
448 tree_matrix::rvalue (void) |
|
1741
|
449 { |
|
2086
|
450 octave_value retval; |
|
1741
|
451 |
|
1827
|
452 tm_const tmp (*this); |
|
1741
|
453 |
|
2868
|
454 bool all_strings_p = false; |
|
3110
|
455 bool some_strings_p = false; |
|
2868
|
456 bool all_empty_p = false; |
|
2602
|
457 |
|
3110
|
458 bool frc_str_conv = false; |
|
|
459 |
|
1827
|
460 if (tmp) |
|
|
461 { |
|
|
462 int nr = tmp.rows (); |
|
|
463 int nc = tmp.cols (); |
|
1741
|
464 |
|
1827
|
465 Matrix m; |
|
|
466 ComplexMatrix cm; |
|
|
467 charMatrix chm; |
|
1741
|
468 |
|
1827
|
469 // Now, extract the values from the individual elements and |
|
|
470 // insert them in the result matrix. |
|
1741
|
471 |
|
2868
|
472 bool found_complex = tmp.complex_p (); |
|
1741
|
473 |
|
2868
|
474 all_strings_p = tmp.all_strings_p (); |
|
3110
|
475 some_strings_p = tmp.some_strings_p (); |
|
2868
|
476 all_empty_p = tmp.all_empty_p (); |
|
2602
|
477 |
|
3110
|
478 frc_str_conv = Vimplicit_num_to_str_ok && some_strings_p; |
|
|
479 |
|
2868
|
480 if (all_strings_p) |
|
2254
|
481 chm.resize (nr, nc, Vstring_fill_char); |
|
1827
|
482 else if (found_complex) |
|
|
483 cm.resize (nr, nc, 0.0); |
|
|
484 else |
|
|
485 m.resize (nr, nc, 0.0); |
|
1741
|
486 |
|
1827
|
487 int put_row = 0; |
|
1741
|
488 |
|
1827
|
489 for (Pix p = tmp.first (); p != 0; tmp.next (p)) |
|
|
490 { |
|
|
491 int put_col = 0; |
|
1741
|
492 |
|
1827
|
493 tm_row_const row = tmp (p); |
|
1741
|
494 |
|
1827
|
495 for (Pix q = row.first (); q != 0; row.next (q)) |
|
|
496 { |
|
2086
|
497 octave_value elt = row (q); |
|
1741
|
498 |
|
1827
|
499 if (found_complex) |
|
|
500 { |
|
|
501 if (elt.is_real_scalar ()) |
|
|
502 cm (put_row, put_col) = elt.double_value (); |
|
|
503 else if (elt.is_real_matrix () || elt.is_range ()) |
|
|
504 cm.insert (elt.matrix_value (), put_row, put_col); |
|
|
505 else if (elt.is_complex_scalar ()) |
|
|
506 cm (put_row, put_col) = elt.complex_value (); |
|
|
507 else |
|
|
508 { |
|
|
509 ComplexMatrix cm_elt = elt.complex_matrix_value (); |
|
1741
|
510 |
|
1827
|
511 if (error_state) |
|
|
512 goto done; |
|
1741
|
513 |
|
1827
|
514 cm.insert (cm_elt, put_row, put_col); |
|
|
515 } |
|
|
516 } |
|
|
517 else |
|
|
518 { |
|
|
519 if (elt.is_real_scalar ()) |
|
|
520 m (put_row, put_col) = elt.double_value (); |
|
2868
|
521 else if (elt.is_string () && all_strings_p) |
|
1827
|
522 { |
|
2495
|
523 charMatrix chm_elt = elt.char_matrix_value (); |
|
1741
|
524 |
|
1827
|
525 if (error_state) |
|
|
526 goto done; |
|
1741
|
527 |
|
1827
|
528 chm.insert (chm_elt, put_row, put_col); |
|
|
529 } |
|
|
530 else |
|
|
531 { |
|
3110
|
532 Matrix m_elt = elt.matrix_value (frc_str_conv); |
|
1827
|
533 |
|
|
534 if (error_state) |
|
|
535 goto done; |
|
1741
|
536 |
|
1827
|
537 m.insert (m_elt, put_row, put_col); |
|
|
538 } |
|
|
539 } |
|
|
540 |
|
2868
|
541 if (all_strings_p && chm.rows () > 0 && chm.cols () > 0) |
|
2086
|
542 retval = octave_value (chm, true); |
|
1827
|
543 else if (found_complex) |
|
|
544 retval = cm; |
|
|
545 else |
|
|
546 retval = m; |
|
|
547 |
|
|
548 put_col += elt.columns (); |
|
1741
|
549 } |
|
|
550 |
|
1827
|
551 put_row += row.rows (); |
|
1741
|
552 } |
|
|
553 } |
|
|
554 |
|
1827
|
555 done: |
|
1741
|
556 |
|
3110
|
557 if (! error_state) |
|
2602
|
558 { |
|
3110
|
559 if (retval.is_undefined () && all_empty_p) |
|
|
560 { |
|
|
561 if (all_strings_p) |
|
|
562 retval = ""; |
|
|
563 else |
|
|
564 retval = Matrix (); |
|
|
565 } |
|
|
566 else if (frc_str_conv && ! retval.is_string ()) |
|
|
567 retval = retval.convert_to_str (); |
|
2602
|
568 } |
|
|
569 |
|
1741
|
570 return retval; |
|
|
571 } |
|
|
572 |
|
|
573 void |
|
2124
|
574 tree_matrix::accept (tree_walker& tw) |
|
1741
|
575 { |
|
2124
|
576 tw.visit_matrix (*this); |
|
1741
|
577 } |
|
|
578 |
|
2172
|
579 static int |
|
|
580 empty_list_elements_ok (void) |
|
|
581 { |
|
|
582 Vempty_list_elements_ok = check_preference ("empty_list_elements_ok"); |
|
|
583 |
|
|
584 return 0; |
|
|
585 } |
|
|
586 |
|
2254
|
587 static int |
|
3110
|
588 implicit_num_to_str_ok (void) |
|
|
589 { |
|
|
590 Vimplicit_num_to_str_ok = check_preference ("implicit_num_to_str_ok"); |
|
|
591 |
|
|
592 return 0; |
|
|
593 } |
|
|
594 |
|
|
595 static int |
|
2254
|
596 string_fill_char (void) |
|
|
597 { |
|
|
598 int status = 0; |
|
|
599 |
|
3523
|
600 std::string s = builtin_string_variable ("string_fill_char"); |
|
2254
|
601 |
|
|
602 switch (s.length ()) |
|
|
603 { |
|
|
604 case 1: |
|
|
605 Vstring_fill_char = s[0]; |
|
|
606 break; |
|
|
607 |
|
|
608 case 0: |
|
|
609 Vstring_fill_char = '\0'; |
|
|
610 break; |
|
|
611 |
|
|
612 default: |
|
|
613 warning ("string_fill_char must be a single character"); |
|
|
614 status = -1; |
|
|
615 break; |
|
|
616 } |
|
|
617 |
|
|
618 return status; |
|
|
619 } |
|
|
620 |
|
2172
|
621 void |
|
|
622 symbols_of_pt_mat (void) |
|
|
623 { |
|
3258
|
624 DEFVAR (empty_list_elements_ok, "warn", empty_list_elements_ok, |
|
3321
|
625 "-*- texinfo -*-\n\ |
|
|
626 @defvr {Built-in Variable} empty_list_elements_ok\n\ |
|
|
627 This variable controls whether Octave ignores empty matrices in a matrix\n\ |
|
|
628 list.\n\ |
|
|
629 \n\ |
|
|
630 For example, if the value of @code{empty_list_elements_ok} is\n\ |
|
|
631 nonzero, Octave will ignore the empty matrices in the expression\n\ |
|
|
632 \n\ |
|
|
633 @example\n\ |
|
|
634 a = [1, [], 3, [], 5]\n\ |
|
|
635 @end example\n\ |
|
|
636 \n\ |
|
|
637 @noindent\n\ |
|
|
638 and the variable @code{a} will be assigned the value @code{[ 1, 3, 5 ]}.\n\ |
|
|
639 \n\ |
|
|
640 The default value is @code{\"warn\"}.\n\ |
|
3333
|
641 @end defvr"); |
|
|
642 |
|
3258
|
643 DEFVAR (implicit_num_to_str_ok, 0.0, implicit_num_to_str_ok, |
|
3361
|
644 "-*- texinfo -*-\n\ |
|
|
645 @defvr {Built-in Variable} implicit_num_to_str_ok\n\ |
|
|
646 If the value of @code{implicit_num_to_str_ok} is nonzero, implicit\n\ |
|
|
647 conversions of numbers to their ASCII character equivalents are\n\ |
|
|
648 allowed when strings are constructed using a mixture of strings and\n\ |
|
|
649 numbers in matrix notation. Otherwise, an error message is printed and\n\ |
|
|
650 control is returned to the top level. The default value is 0. For\n\ |
|
|
651 example,\n\ |
|
|
652 \n\ |
|
|
653 @example\n\ |
|
|
654 @group\n\ |
|
|
655 [ \"f\", 111, 111 ]\n\ |
|
|
656 @result{} \"foo\"\n\ |
|
3363
|
657 @end group\n\ |
|
3361
|
658 @end example\n\ |
|
3363
|
659 @end defvr"); |
|
3110
|
660 |
|
3258
|
661 DEFVAR (string_fill_char, " ", string_fill_char, |
|
3361
|
662 "-*- texinfo -*-\n\ |
|
|
663 @defvr {Built-in Variable} string_fill_char\n\ |
|
|
664 The value of this variable is used to pad all strings in a string matrix\n\ |
|
|
665 to the same length. It should be a single character. The default value\n\ |
|
|
666 is @code{\" \"} (a single space). For example,\n\ |
|
|
667 \n\ |
|
|
668 @example\n\ |
|
|
669 @group\n\ |
|
|
670 string_fill_char = \"X\";\n\ |
|
|
671 [ \"these\"; \"are\"; \"strings\" ]\n\ |
|
|
672 @result{} \"theseXX\"\n\ |
|
|
673 \"areXXXX\"\n\ |
|
|
674 \"strings\"\n\ |
|
|
675 @end group\n\ |
|
|
676 @end example\n\ |
|
3363
|
677 @end defvr"); |
|
2172
|
678 } |
|
|
679 |
|
1741
|
680 /* |
|
|
681 ;;; Local Variables: *** |
|
|
682 ;;; mode: C++ *** |
|
|
683 ;;; End: *** |
|
|
684 */ |
