1278
|
1 /* |
|
2 |
7017
|
3 Copyright (C) 1995, 1996, 1997, 2002, 2003, 2004, 2005, 2006, 2007 |
|
4 John W. Eaton |
1278
|
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 |
7016
|
10 Free Software Foundation; either version 3 of the License, or (at your |
|
11 option) any later version. |
1278
|
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 |
7016
|
19 along with Octave; see the file COPYING. If not, see |
|
20 <http://www.gnu.org/licenses/>. |
1278
|
21 |
|
22 */ |
|
23 |
|
24 #ifdef HAVE_CONFIG_H |
|
25 #include <config.h> |
|
26 #endif |
|
27 |
3932
|
28 #include "error.h" |
1755
|
29 #include "str-vec.h" |
|
30 |
1278
|
31 #include "oct-map.h" |
|
32 #include "utils.h" |
|
33 |
6959
|
34 Octave_map::Octave_map (const dim_vector& dv, const Cell& key_vals) |
5880
|
35 : map (), key_list (), dimensions (dv) |
|
36 { |
|
37 Cell c (dv); |
|
38 |
6959
|
39 if (key_vals.is_cellstr ()) |
5880
|
40 { |
6959
|
41 for (octave_idx_type i = 0; i < key_vals.numel (); i++) |
6946
|
42 { |
6959
|
43 std::string k = key_vals(i).string_value (); |
6946
|
44 map[k] = c; |
|
45 key_list.push_back (k); |
|
46 } |
5880
|
47 } |
6946
|
48 else |
|
49 error ("Octave_map: expecting keys to be cellstr"); |
5880
|
50 } |
|
51 |
7046
|
52 Octave_map |
|
53 Octave_map::squeeze (void) const |
|
54 { |
|
55 Octave_map retval (dims ().squeeze ()); |
|
56 |
|
57 for (const_iterator pa = begin (); pa != end (); pa++) |
|
58 { |
|
59 Cell tmp = contents (pa).squeeze (); |
|
60 |
|
61 if (error_state) |
|
62 break; |
|
63 |
|
64 retval.assign (key (pa), tmp); |
|
65 } |
|
66 |
|
67 return retval; |
|
68 } |
|
69 |
|
70 Octave_map |
|
71 Octave_map::permute (const Array<int>& vec, bool inv) const |
|
72 { |
|
73 Octave_map retval (dims ()); |
|
74 |
|
75 for (const_iterator pa = begin (); pa != end (); pa++) |
|
76 { |
|
77 Cell tmp = contents (pa).permute (vec, inv); |
|
78 |
|
79 if (error_state) |
|
80 break; |
|
81 |
|
82 retval.assign (key (pa), tmp); |
|
83 } |
|
84 |
|
85 return retval; |
|
86 } |
|
87 |
5328
|
88 Cell& |
|
89 Octave_map::contents (const std::string& k) |
|
90 { |
5880
|
91 maybe_add_to_key_list (k); |
|
92 |
5328
|
93 return map[k]; |
|
94 } |
|
95 |
4513
|
96 Cell |
4675
|
97 Octave_map::contents (const std::string& k) const |
4197
|
98 { |
4587
|
99 const_iterator p = seek (k); |
4197
|
100 |
4513
|
101 return p != end () ? p->second : Cell (); |
4197
|
102 } |
|
103 |
5156
|
104 int |
|
105 Octave_map::intfield (const std::string& k, int def_val) const |
|
106 { |
|
107 int retval = def_val; |
|
108 |
|
109 Cell c = contents (k); |
|
110 |
|
111 if (! c.is_empty ()) |
|
112 retval = c(0).int_value (); |
|
113 |
|
114 return retval; |
|
115 } |
|
116 |
|
117 std::string |
|
118 Octave_map::stringfield (const std::string& k, |
|
119 const std::string& def_val) const |
|
120 { |
|
121 std::string retval = def_val; |
|
122 |
|
123 Cell c = contents (k); |
|
124 |
|
125 if (! c.is_empty ()) |
|
126 retval = c(0).string_value (); |
|
127 |
|
128 return retval; |
|
129 } |
|
130 |
1755
|
131 string_vector |
3933
|
132 Octave_map::keys (void) const |
1278
|
133 { |
6639
|
134 assert (nfields () == key_list.size ()); |
5881
|
135 |
5880
|
136 return string_vector (key_list); |
1278
|
137 } |
|
138 |
4567
|
139 Octave_map |
5571
|
140 Octave_map::transpose (void) const |
|
141 { |
|
142 assert (ndims () == 2); |
5593
|
143 |
5571
|
144 dim_vector dv = dims (); |
|
145 |
5593
|
146 octave_idx_type nr = dv(0); |
|
147 octave_idx_type nc = dv(1); |
|
148 |
|
149 dim_vector new_dims (nc, nr); |
|
150 |
|
151 Octave_map retval (new_dims); |
5571
|
152 |
|
153 for (const_iterator p = begin (); p != end (); p++) |
|
154 retval.assign (key(p), Cell (contents(p).transpose ())); |
|
155 |
|
156 return retval; |
|
157 } |
|
158 |
|
159 Octave_map |
4567
|
160 Octave_map::reshape (const dim_vector& new_dims) const |
|
161 { |
|
162 Octave_map retval; |
|
163 |
|
164 if (new_dims != dims ()) |
|
165 { |
|
166 for (const_iterator p = begin (); p != end (); p++) |
4675
|
167 retval.assign (key(p), contents(p).reshape (new_dims)); |
4567
|
168 |
4936
|
169 retval.dimensions = new_dims; |
4567
|
170 } |
4936
|
171 else |
|
172 retval = *this; |
4567
|
173 |
|
174 return retval; |
|
175 } |
|
176 |
5781
|
177 void |
|
178 Octave_map::resize (const dim_vector& dv, bool fill) |
4936
|
179 { |
|
180 if (dv != dims ()) |
|
181 { |
6639
|
182 if (nfields () == 0) |
6609
|
183 dimensions = dv; |
|
184 else |
4936
|
185 { |
6609
|
186 for (const_iterator p = begin (); p != end (); p++) |
|
187 { |
|
188 Cell tmp = contents(p); |
5781
|
189 |
6609
|
190 if (fill) |
|
191 tmp.resize(dv, Cell::resize_fill_value ()); |
|
192 else |
|
193 tmp.resize(dv); |
5781
|
194 |
6609
|
195 dimensions = dv; |
5781
|
196 |
6609
|
197 assign (key(p), tmp); |
|
198 } |
4936
|
199 } |
|
200 } |
|
201 } |
|
202 |
4915
|
203 Octave_map |
5275
|
204 Octave_map::concat (const Octave_map& rb, const Array<octave_idx_type>& ra_idx) |
4806
|
205 { |
4937
|
206 Octave_map retval; |
4936
|
207 |
6639
|
208 if (nfields () == rb.nfields ()) |
4936
|
209 { |
5881
|
210 for (const_iterator pa = begin (); pa != end (); pa++) |
4936
|
211 { |
5881
|
212 const_iterator pb = rb.seek (key(pa)); |
4937
|
213 |
5003
|
214 if (pb == rb.end ()) |
4937
|
215 { |
|
216 error ("field name mismatch in structure concatenation"); |
|
217 break; |
|
218 } |
4936
|
219 |
5073
|
220 retval.assign (key(pa), |
|
221 contents(pa).insert (rb.contents(pb), ra_idx)); |
4937
|
222 } |
4936
|
223 } |
4937
|
224 else |
|
225 error ("field name mismatch in structure concatenation"); |
|
226 |
4915
|
227 return retval; |
4806
|
228 } |
|
229 |
6609
|
230 static bool |
|
231 keys_ok (const Octave_map& a, const Octave_map& b, string_vector& keys) |
4197
|
232 { |
6609
|
233 bool retval = false; |
|
234 |
|
235 keys = string_vector (); |
4197
|
236 |
6639
|
237 if (a.nfields () == 0) |
6609
|
238 { |
|
239 keys = b.keys (); |
|
240 retval = true; |
|
241 } |
|
242 else |
|
243 { |
|
244 string_vector a_keys = a.keys().qsort (); |
|
245 string_vector b_keys = b.keys().qsort (); |
4197
|
246 |
6609
|
247 octave_idx_type a_len = a_keys.length (); |
|
248 octave_idx_type b_len = b_keys.length (); |
|
249 |
|
250 if (a_len == b_len) |
4197
|
251 { |
6609
|
252 for (octave_idx_type i = 0; i < a_len; i++) |
|
253 { |
|
254 if (a_keys[i] != b_keys[i]) |
|
255 goto done; |
|
256 } |
4197
|
257 |
6609
|
258 keys = a_keys; |
|
259 retval = true; |
|
260 } |
4197
|
261 } |
6609
|
262 |
|
263 done: |
4197
|
264 return retval; |
|
265 } |
|
266 |
|
267 Octave_map& |
5592
|
268 Octave_map::maybe_delete_elements (const octave_value_list& idx) |
|
269 { |
|
270 string_vector t_keys = keys(); |
|
271 octave_idx_type len = t_keys.length (); |
|
272 |
|
273 if (len > 0) |
|
274 { |
|
275 for (octave_idx_type i = 0; i < len; i++) |
|
276 { |
|
277 std::string k = t_keys[i]; |
|
278 |
5881
|
279 map[k] = contents(k).assign (idx, Cell()); |
5592
|
280 |
|
281 if (error_state) |
|
282 break; |
|
283 } |
|
284 |
|
285 if (!error_state) |
|
286 dimensions = contents(t_keys[0]).dims(); |
|
287 } |
|
288 |
|
289 return *this; |
|
290 } |
|
291 |
|
292 Octave_map& |
4513
|
293 Octave_map::assign (const octave_value_list& idx, const Octave_map& rhs) |
4197
|
294 { |
6609
|
295 string_vector t_keys; |
4197
|
296 |
6609
|
297 if (keys_ok (*this, rhs, t_keys)) |
4197
|
298 { |
5275
|
299 octave_idx_type len = t_keys.length (); |
4197
|
300 |
6609
|
301 if (len == 0) |
4197
|
302 { |
6609
|
303 Cell tmp_lhs (dims ()); |
|
304 Cell tmp_rhs (rhs.dims ()); |
|
305 |
|
306 tmp_lhs.assign (idx, tmp_rhs, Matrix ()); |
4197
|
307 |
6609
|
308 if (! error_state) |
|
309 resize (tmp_lhs.dims ()); |
|
310 else |
|
311 error ("size mismatch in structure assignment"); |
|
312 } |
|
313 else |
|
314 { |
|
315 for (octave_idx_type i = 0; i < len; i++) |
|
316 { |
|
317 std::string k = t_keys[i]; |
4197
|
318 |
6609
|
319 Cell t_rhs = rhs.contents (k); |
|
320 |
|
321 assign (idx, k, t_rhs); |
4197
|
322 |
6609
|
323 if (error_state) |
|
324 break; |
|
325 } |
4197
|
326 } |
|
327 } |
|
328 else |
|
329 error ("field name mismatch in structure assignment"); |
|
330 |
|
331 return *this; |
|
332 } |
|
333 |
4561
|
334 static dim_vector |
|
335 common_size (const dim_vector& a, const dim_vector& b) |
|
336 { |
|
337 dim_vector retval; |
|
338 |
5275
|
339 octave_idx_type a_len = a.length (); |
|
340 octave_idx_type b_len = b.length (); |
4561
|
341 |
5275
|
342 octave_idx_type new_len = std::max (a_len, b_len); |
|
343 octave_idx_type min_len = std::min (a_len, b_len); |
4561
|
344 |
|
345 retval.resize (new_len); |
|
346 |
5275
|
347 for (octave_idx_type i = 0; i < min_len; i++) |
4561
|
348 retval(i) = std::max (a(i), b(i)); |
|
349 |
|
350 if (a_len < b_len) |
|
351 { |
5275
|
352 for (octave_idx_type i = min_len; i < b_len; i++) |
4561
|
353 retval(i) = b(i); |
|
354 } |
|
355 else if (a_len > b_len) |
|
356 { |
5275
|
357 for (octave_idx_type i = min_len; i < a_len; i++) |
4561
|
358 retval(i) = a(i); |
|
359 } |
|
360 |
|
361 return retval; |
|
362 } |
|
363 |
3932
|
364 Octave_map& |
4587
|
365 Octave_map::assign (const octave_value_list& idx, const std::string& k, |
4513
|
366 const Cell& rhs) |
3932
|
367 { |
5881
|
368 Cell tmp; |
|
369 |
|
370 if (contains (k)) |
|
371 tmp = map[k]; |
3932
|
372 |
4216
|
373 octave_value fill_value = Matrix (); |
|
374 |
|
375 tmp.assign (idx, rhs, fill_value); |
3932
|
376 |
|
377 if (! error_state) |
|
378 { |
4561
|
379 dim_vector rhs_dims = tmp.dims (); |
3943
|
380 |
4561
|
381 dim_vector curr_dims = dims (); |
|
382 |
|
383 dim_vector new_dims = common_size (rhs_dims, curr_dims); |
3932
|
384 |
4561
|
385 if (new_dims != rhs_dims) |
3932
|
386 { |
4625
|
387 tmp.resize (new_dims, fill_value); |
3943
|
388 } |
5329
|
389 |
|
390 if (new_dims != curr_dims) |
3943
|
391 { |
4219
|
392 for (iterator p = begin (); p != end (); p++) |
5328
|
393 contents(p).resize (new_dims, fill_value); |
4561
|
394 } |
3932
|
395 |
4561
|
396 dimensions = new_dims; |
3932
|
397 |
5880
|
398 maybe_add_to_key_list (k); |
|
399 |
4587
|
400 map[k] = tmp; |
3932
|
401 } |
|
402 |
|
403 return *this; |
|
404 } |
|
405 |
3933
|
406 Octave_map& |
4675
|
407 Octave_map::assign (const std::string& k, const octave_value& rhs) |
|
408 { |
6639
|
409 if (nfields () == 0) |
4675
|
410 { |
5880
|
411 maybe_add_to_key_list (k); |
|
412 |
4675
|
413 map[k] = Cell (rhs); |
|
414 |
|
415 dimensions = dim_vector (1, 1); |
|
416 } |
|
417 else |
|
418 { |
|
419 dim_vector dv = dims (); |
|
420 |
|
421 if (dv.all_ones ()) |
5880
|
422 { |
|
423 maybe_add_to_key_list (k); |
|
424 |
|
425 map[k] = Cell (rhs); |
|
426 } |
4675
|
427 else |
|
428 error ("invalid structure assignment"); |
|
429 } |
|
430 |
|
431 return *this; |
|
432 } |
|
433 |
|
434 Octave_map& |
4587
|
435 Octave_map::assign (const std::string& k, const Cell& rhs) |
3933
|
436 { |
6639
|
437 if (nfields () == 0) |
4563
|
438 { |
5880
|
439 maybe_add_to_key_list (k); |
|
440 |
4587
|
441 map[k] = rhs; |
4563
|
442 |
4730
|
443 dimensions = rhs.dims (); |
4563
|
444 } |
3933
|
445 else |
|
446 { |
4562
|
447 if (dims () == rhs.dims ()) |
5880
|
448 { |
|
449 maybe_add_to_key_list (k); |
|
450 |
|
451 map[k] = rhs; |
|
452 } |
3933
|
453 else |
|
454 error ("invalid structure assignment"); |
|
455 } |
|
456 |
|
457 return *this; |
|
458 } |
|
459 |
|
460 Octave_map |
7046
|
461 Octave_map::index (const octave_value_list& idx, bool resize_ok) const |
3933
|
462 { |
|
463 Octave_map retval; |
|
464 |
5435
|
465 if (idx.length () > 0) |
3933
|
466 { |
7046
|
467 for (const_iterator p = begin (); p != end (); p++) |
5435
|
468 { |
7046
|
469 Cell tmp = contents(p).index (idx, resize_ok); |
3933
|
470 |
5435
|
471 if (error_state) |
|
472 break; |
3933
|
473 |
5435
|
474 retval.assign (key(p), tmp); |
|
475 } |
3933
|
476 } |
5435
|
477 else |
5539
|
478 retval = *this; |
3933
|
479 |
5539
|
480 return retval; |
3933
|
481 } |
|
482 |
7046
|
483 Octave_map |
|
484 Octave_map::index (idx_vector& i, int resize_ok, const octave_value& rfv) const |
|
485 { |
|
486 Octave_map retval (dims ()); |
|
487 |
|
488 for (const_iterator p = begin (); p != end (); p++) |
|
489 { |
|
490 Cell tmp = contents (p).index (i, resize_ok, rfv); |
|
491 |
|
492 if (error_state) |
|
493 break; |
|
494 |
|
495 retval.assign (key (p), tmp); |
|
496 } |
|
497 |
|
498 return retval; |
|
499 } |
|
500 |
|
501 Octave_map |
|
502 Octave_map::index (idx_vector& i, idx_vector& j, int resize_ok, |
|
503 const octave_value& rfv) const |
|
504 { |
|
505 Octave_map retval (dims ()); |
|
506 |
|
507 for (const_iterator p = begin (); p != end (); p++) |
|
508 { |
|
509 Cell tmp = contents (p).index (i, j, resize_ok, rfv); |
|
510 |
|
511 if (error_state) |
|
512 break; |
|
513 |
|
514 retval.assign (key (p), tmp); |
|
515 } |
|
516 |
|
517 return retval; |
|
518 } |
|
519 |
|
520 Octave_map |
|
521 Octave_map::index (Array<idx_vector>& ra_idx, int resize_ok, |
|
522 const octave_value& rfv) const |
|
523 { |
|
524 Octave_map retval (dims ()); |
|
525 |
|
526 for (const_iterator p = begin (); p != end (); p++) |
|
527 { |
|
528 Cell tmp = contents (p).index (ra_idx, resize_ok, rfv); |
|
529 |
|
530 if (error_state) |
|
531 break; |
|
532 |
|
533 retval.assign (key (p), tmp); |
|
534 } |
|
535 |
|
536 return retval; |
|
537 } |
|
538 |
1278
|
539 /* |
|
540 ;;; Local Variables: *** |
|
541 ;;; mode: C++ *** |
|
542 ;;; End: *** |
|
543 */ |