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