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 |
5328
|
52 Cell& |
|
53 Octave_map::contents (const std::string& k) |
|
54 { |
5880
|
55 maybe_add_to_key_list (k); |
|
56 |
5328
|
57 return map[k]; |
|
58 } |
|
59 |
4513
|
60 Cell |
4675
|
61 Octave_map::contents (const std::string& k) const |
4197
|
62 { |
4587
|
63 const_iterator p = seek (k); |
4197
|
64 |
4513
|
65 return p != end () ? p->second : Cell (); |
4197
|
66 } |
|
67 |
5156
|
68 int |
|
69 Octave_map::intfield (const std::string& k, int def_val) const |
|
70 { |
|
71 int retval = def_val; |
|
72 |
|
73 Cell c = contents (k); |
|
74 |
|
75 if (! c.is_empty ()) |
|
76 retval = c(0).int_value (); |
|
77 |
|
78 return retval; |
|
79 } |
|
80 |
|
81 std::string |
|
82 Octave_map::stringfield (const std::string& k, |
|
83 const std::string& def_val) const |
|
84 { |
|
85 std::string retval = def_val; |
|
86 |
|
87 Cell c = contents (k); |
|
88 |
|
89 if (! c.is_empty ()) |
|
90 retval = c(0).string_value (); |
|
91 |
|
92 return retval; |
|
93 } |
|
94 |
1755
|
95 string_vector |
3933
|
96 Octave_map::keys (void) const |
1278
|
97 { |
6639
|
98 assert (nfields () == key_list.size ()); |
5881
|
99 |
5880
|
100 return string_vector (key_list); |
1278
|
101 } |
|
102 |
4567
|
103 Octave_map |
5571
|
104 Octave_map::transpose (void) const |
|
105 { |
|
106 assert (ndims () == 2); |
5593
|
107 |
5571
|
108 dim_vector dv = dims (); |
|
109 |
5593
|
110 octave_idx_type nr = dv(0); |
|
111 octave_idx_type nc = dv(1); |
|
112 |
|
113 dim_vector new_dims (nc, nr); |
|
114 |
|
115 Octave_map retval (new_dims); |
5571
|
116 |
|
117 for (const_iterator p = begin (); p != end (); p++) |
|
118 retval.assign (key(p), Cell (contents(p).transpose ())); |
|
119 |
|
120 return retval; |
|
121 } |
|
122 |
|
123 Octave_map |
4567
|
124 Octave_map::reshape (const dim_vector& new_dims) const |
|
125 { |
|
126 Octave_map retval; |
|
127 |
|
128 if (new_dims != dims ()) |
|
129 { |
|
130 for (const_iterator p = begin (); p != end (); p++) |
4675
|
131 retval.assign (key(p), contents(p).reshape (new_dims)); |
4567
|
132 |
4936
|
133 retval.dimensions = new_dims; |
4567
|
134 } |
4936
|
135 else |
|
136 retval = *this; |
4567
|
137 |
|
138 return retval; |
|
139 } |
|
140 |
5781
|
141 void |
|
142 Octave_map::resize (const dim_vector& dv, bool fill) |
4936
|
143 { |
|
144 if (dv != dims ()) |
|
145 { |
6639
|
146 if (nfields () == 0) |
6609
|
147 dimensions = dv; |
|
148 else |
4936
|
149 { |
6609
|
150 for (const_iterator p = begin (); p != end (); p++) |
|
151 { |
|
152 Cell tmp = contents(p); |
5781
|
153 |
6609
|
154 if (fill) |
|
155 tmp.resize(dv, Cell::resize_fill_value ()); |
|
156 else |
|
157 tmp.resize(dv); |
5781
|
158 |
6609
|
159 dimensions = dv; |
5781
|
160 |
6609
|
161 assign (key(p), tmp); |
|
162 } |
4936
|
163 } |
|
164 } |
|
165 } |
|
166 |
4915
|
167 Octave_map |
5275
|
168 Octave_map::concat (const Octave_map& rb, const Array<octave_idx_type>& ra_idx) |
4806
|
169 { |
4937
|
170 Octave_map retval; |
4936
|
171 |
6639
|
172 if (nfields () == rb.nfields ()) |
4936
|
173 { |
5881
|
174 for (const_iterator pa = begin (); pa != end (); pa++) |
4936
|
175 { |
5881
|
176 const_iterator pb = rb.seek (key(pa)); |
4937
|
177 |
5003
|
178 if (pb == rb.end ()) |
4937
|
179 { |
|
180 error ("field name mismatch in structure concatenation"); |
|
181 break; |
|
182 } |
4936
|
183 |
5073
|
184 retval.assign (key(pa), |
|
185 contents(pa).insert (rb.contents(pb), ra_idx)); |
4937
|
186 } |
4936
|
187 } |
4937
|
188 else |
|
189 error ("field name mismatch in structure concatenation"); |
|
190 |
4915
|
191 return retval; |
4806
|
192 } |
|
193 |
6609
|
194 static bool |
|
195 keys_ok (const Octave_map& a, const Octave_map& b, string_vector& keys) |
4197
|
196 { |
6609
|
197 bool retval = false; |
|
198 |
|
199 keys = string_vector (); |
4197
|
200 |
6639
|
201 if (a.nfields () == 0) |
6609
|
202 { |
|
203 keys = b.keys (); |
|
204 retval = true; |
|
205 } |
|
206 else |
|
207 { |
|
208 string_vector a_keys = a.keys().qsort (); |
|
209 string_vector b_keys = b.keys().qsort (); |
4197
|
210 |
6609
|
211 octave_idx_type a_len = a_keys.length (); |
|
212 octave_idx_type b_len = b_keys.length (); |
|
213 |
|
214 if (a_len == b_len) |
4197
|
215 { |
6609
|
216 for (octave_idx_type i = 0; i < a_len; i++) |
|
217 { |
|
218 if (a_keys[i] != b_keys[i]) |
|
219 goto done; |
|
220 } |
4197
|
221 |
6609
|
222 keys = a_keys; |
|
223 retval = true; |
|
224 } |
4197
|
225 } |
6609
|
226 |
|
227 done: |
4197
|
228 return retval; |
|
229 } |
|
230 |
|
231 Octave_map& |
5592
|
232 Octave_map::maybe_delete_elements (const octave_value_list& idx) |
|
233 { |
|
234 string_vector t_keys = keys(); |
|
235 octave_idx_type len = t_keys.length (); |
|
236 |
|
237 if (len > 0) |
|
238 { |
|
239 for (octave_idx_type i = 0; i < len; i++) |
|
240 { |
|
241 std::string k = t_keys[i]; |
|
242 |
5881
|
243 map[k] = contents(k).assign (idx, Cell()); |
5592
|
244 |
|
245 if (error_state) |
|
246 break; |
|
247 } |
|
248 |
|
249 if (!error_state) |
|
250 dimensions = contents(t_keys[0]).dims(); |
|
251 } |
|
252 |
|
253 return *this; |
|
254 } |
|
255 |
|
256 Octave_map& |
4513
|
257 Octave_map::assign (const octave_value_list& idx, const Octave_map& rhs) |
4197
|
258 { |
6609
|
259 string_vector t_keys; |
4197
|
260 |
6609
|
261 if (keys_ok (*this, rhs, t_keys)) |
4197
|
262 { |
5275
|
263 octave_idx_type len = t_keys.length (); |
4197
|
264 |
6609
|
265 if (len == 0) |
4197
|
266 { |
6609
|
267 Cell tmp_lhs (dims ()); |
|
268 Cell tmp_rhs (rhs.dims ()); |
|
269 |
|
270 tmp_lhs.assign (idx, tmp_rhs, Matrix ()); |
4197
|
271 |
6609
|
272 if (! error_state) |
|
273 resize (tmp_lhs.dims ()); |
|
274 else |
|
275 error ("size mismatch in structure assignment"); |
|
276 } |
|
277 else |
|
278 { |
|
279 for (octave_idx_type i = 0; i < len; i++) |
|
280 { |
|
281 std::string k = t_keys[i]; |
4197
|
282 |
6609
|
283 Cell t_rhs = rhs.contents (k); |
|
284 |
|
285 assign (idx, k, t_rhs); |
4197
|
286 |
6609
|
287 if (error_state) |
|
288 break; |
|
289 } |
4197
|
290 } |
|
291 } |
|
292 else |
|
293 error ("field name mismatch in structure assignment"); |
|
294 |
|
295 return *this; |
|
296 } |
|
297 |
4561
|
298 static dim_vector |
|
299 common_size (const dim_vector& a, const dim_vector& b) |
|
300 { |
|
301 dim_vector retval; |
|
302 |
5275
|
303 octave_idx_type a_len = a.length (); |
|
304 octave_idx_type b_len = b.length (); |
4561
|
305 |
5275
|
306 octave_idx_type new_len = std::max (a_len, b_len); |
|
307 octave_idx_type min_len = std::min (a_len, b_len); |
4561
|
308 |
|
309 retval.resize (new_len); |
|
310 |
5275
|
311 for (octave_idx_type i = 0; i < min_len; i++) |
4561
|
312 retval(i) = std::max (a(i), b(i)); |
|
313 |
|
314 if (a_len < b_len) |
|
315 { |
5275
|
316 for (octave_idx_type i = min_len; i < b_len; i++) |
4561
|
317 retval(i) = b(i); |
|
318 } |
|
319 else if (a_len > b_len) |
|
320 { |
5275
|
321 for (octave_idx_type i = min_len; i < a_len; i++) |
4561
|
322 retval(i) = a(i); |
|
323 } |
|
324 |
|
325 return retval; |
|
326 } |
|
327 |
3932
|
328 Octave_map& |
4587
|
329 Octave_map::assign (const octave_value_list& idx, const std::string& k, |
4513
|
330 const Cell& rhs) |
3932
|
331 { |
5881
|
332 Cell tmp; |
|
333 |
|
334 if (contains (k)) |
|
335 tmp = map[k]; |
3932
|
336 |
4216
|
337 octave_value fill_value = Matrix (); |
|
338 |
|
339 tmp.assign (idx, rhs, fill_value); |
3932
|
340 |
|
341 if (! error_state) |
|
342 { |
4561
|
343 dim_vector rhs_dims = tmp.dims (); |
3943
|
344 |
4561
|
345 dim_vector curr_dims = dims (); |
|
346 |
|
347 dim_vector new_dims = common_size (rhs_dims, curr_dims); |
3932
|
348 |
4561
|
349 if (new_dims != rhs_dims) |
3932
|
350 { |
4625
|
351 tmp.resize (new_dims, fill_value); |
3943
|
352 } |
5329
|
353 |
|
354 if (new_dims != curr_dims) |
3943
|
355 { |
4219
|
356 for (iterator p = begin (); p != end (); p++) |
5328
|
357 contents(p).resize (new_dims, fill_value); |
4561
|
358 } |
3932
|
359 |
4561
|
360 dimensions = new_dims; |
3932
|
361 |
5880
|
362 maybe_add_to_key_list (k); |
|
363 |
4587
|
364 map[k] = tmp; |
3932
|
365 } |
|
366 |
|
367 return *this; |
|
368 } |
|
369 |
3933
|
370 Octave_map& |
4675
|
371 Octave_map::assign (const std::string& k, const octave_value& rhs) |
|
372 { |
6639
|
373 if (nfields () == 0) |
4675
|
374 { |
5880
|
375 maybe_add_to_key_list (k); |
|
376 |
4675
|
377 map[k] = Cell (rhs); |
|
378 |
|
379 dimensions = dim_vector (1, 1); |
|
380 } |
|
381 else |
|
382 { |
|
383 dim_vector dv = dims (); |
|
384 |
|
385 if (dv.all_ones ()) |
5880
|
386 { |
|
387 maybe_add_to_key_list (k); |
|
388 |
|
389 map[k] = Cell (rhs); |
|
390 } |
4675
|
391 else |
|
392 error ("invalid structure assignment"); |
|
393 } |
|
394 |
|
395 return *this; |
|
396 } |
|
397 |
|
398 Octave_map& |
4587
|
399 Octave_map::assign (const std::string& k, const Cell& rhs) |
3933
|
400 { |
6639
|
401 if (nfields () == 0) |
4563
|
402 { |
5880
|
403 maybe_add_to_key_list (k); |
|
404 |
4587
|
405 map[k] = rhs; |
4563
|
406 |
4730
|
407 dimensions = rhs.dims (); |
4563
|
408 } |
3933
|
409 else |
|
410 { |
4562
|
411 if (dims () == rhs.dims ()) |
5880
|
412 { |
|
413 maybe_add_to_key_list (k); |
|
414 |
|
415 map[k] = rhs; |
|
416 } |
3933
|
417 else |
|
418 error ("invalid structure assignment"); |
|
419 } |
|
420 |
|
421 return *this; |
|
422 } |
|
423 |
|
424 Octave_map |
4513
|
425 Octave_map::index (const octave_value_list& idx) |
3933
|
426 { |
|
427 Octave_map retval; |
|
428 |
5435
|
429 if (idx.length () > 0) |
3933
|
430 { |
5435
|
431 for (iterator p = begin (); p != end (); p++) |
|
432 { |
|
433 Cell tmp = contents(p).index (idx); |
3933
|
434 |
5435
|
435 if (error_state) |
|
436 break; |
3933
|
437 |
5435
|
438 retval.assign (key(p), tmp); |
|
439 } |
3933
|
440 } |
5435
|
441 else |
5539
|
442 retval = *this; |
3933
|
443 |
5539
|
444 return retval; |
3933
|
445 } |
|
446 |
1278
|
447 /* |
|
448 ;;; Local Variables: *** |
|
449 ;;; mode: C++ *** |
|
450 ;;; End: *** |
|
451 */ |