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