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 |
5880
|
101 return string_vector (key_list); |
1278
|
102 } |
|
103 |
4567
|
104 Octave_map |
5571
|
105 Octave_map::transpose (void) const |
|
106 { |
|
107 assert (ndims () == 2); |
5593
|
108 |
5571
|
109 dim_vector dv = dims (); |
|
110 |
5593
|
111 octave_idx_type nr = dv(0); |
|
112 octave_idx_type nc = dv(1); |
|
113 |
|
114 dim_vector new_dims (nc, nr); |
|
115 |
|
116 Octave_map retval (new_dims); |
5571
|
117 |
|
118 for (const_iterator p = begin (); p != end (); p++) |
|
119 retval.assign (key(p), Cell (contents(p).transpose ())); |
|
120 |
|
121 return retval; |
|
122 } |
|
123 |
|
124 Octave_map |
4567
|
125 Octave_map::reshape (const dim_vector& new_dims) const |
|
126 { |
|
127 Octave_map retval; |
|
128 |
|
129 if (new_dims != dims ()) |
|
130 { |
|
131 for (const_iterator p = begin (); p != end (); p++) |
4675
|
132 retval.assign (key(p), contents(p).reshape (new_dims)); |
4567
|
133 |
4936
|
134 retval.dimensions = new_dims; |
4567
|
135 } |
4936
|
136 else |
|
137 retval = *this; |
4567
|
138 |
|
139 return retval; |
|
140 } |
|
141 |
5275
|
142 octave_idx_type |
4561
|
143 Octave_map::numel (void) const |
3932
|
144 { |
5275
|
145 octave_idx_type retval; |
4561
|
146 |
|
147 if (empty ()) |
|
148 retval = 0; |
|
149 else |
3932
|
150 { |
4561
|
151 Cell tmp = contents (begin ()); |
|
152 retval = tmp.numel (); |
3932
|
153 } |
4121
|
154 |
4561
|
155 return retval; |
3932
|
156 } |
|
157 |
5781
|
158 void |
|
159 Octave_map::resize (const dim_vector& dv, bool fill) |
4936
|
160 { |
|
161 if (dv != dims ()) |
|
162 { |
|
163 for (const_iterator p = begin (); p != end (); p++) |
|
164 { |
|
165 Cell tmp = contents(p); |
5781
|
166 |
5731
|
167 if (fill) |
|
168 tmp.resize(dv, Cell::resize_fill_value ()); |
|
169 else |
|
170 tmp.resize(dv); |
5781
|
171 |
|
172 dimensions = dv; |
|
173 |
|
174 assign (key(p), tmp); |
4936
|
175 } |
|
176 } |
|
177 } |
|
178 |
4915
|
179 Octave_map |
5275
|
180 Octave_map::concat (const Octave_map& rb, const Array<octave_idx_type>& ra_idx) |
4806
|
181 { |
4937
|
182 Octave_map retval; |
4936
|
183 |
5073
|
184 if (length() == rb.length()) |
4936
|
185 { |
5073
|
186 for (Octave_map::const_iterator pa = begin (); pa != end (); pa++) |
4936
|
187 { |
5073
|
188 Octave_map::const_iterator pb = rb.seek (key(pa)); |
4937
|
189 |
5003
|
190 if (pb == rb.end ()) |
4937
|
191 { |
|
192 error ("field name mismatch in structure concatenation"); |
|
193 break; |
|
194 } |
4936
|
195 |
5073
|
196 retval.assign (key(pa), |
|
197 contents(pa).insert (rb.contents(pb), ra_idx)); |
4937
|
198 } |
4936
|
199 } |
4937
|
200 else |
|
201 error ("field name mismatch in structure concatenation"); |
|
202 |
4915
|
203 return retval; |
4806
|
204 } |
|
205 |
4197
|
206 static string_vector |
|
207 equiv_keys (const Octave_map& a, const Octave_map& b) |
|
208 { |
|
209 string_vector retval; |
|
210 |
|
211 string_vector a_keys = a.keys().qsort (); |
|
212 string_vector b_keys = b.keys().qsort (); |
|
213 |
5275
|
214 octave_idx_type a_len = a_keys.length (); |
|
215 octave_idx_type b_len = b_keys.length (); |
4197
|
216 |
|
217 if (a_len == b_len) |
|
218 { |
5275
|
219 for (octave_idx_type i = 0; i < a_len; i++) |
4197
|
220 { |
|
221 if (a_keys[i] != b_keys[i]) |
|
222 return retval; |
|
223 } |
|
224 |
|
225 retval = a_keys; |
|
226 } |
|
227 |
|
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 |
|
243 map[k] = contents (k).assign (idx, Cell()); |
|
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 { |
|
259 string_vector t_keys = empty () ? rhs.keys () : equiv_keys (*this, rhs); |
|
260 |
|
261 if (! t_keys.empty ()) |
|
262 { |
5275
|
263 octave_idx_type len = t_keys.length (); |
4197
|
264 |
5275
|
265 for (octave_idx_type i = 0; i < len; i++) |
4197
|
266 { |
4587
|
267 std::string k = t_keys[i]; |
4197
|
268 |
4675
|
269 Cell t_rhs = rhs.contents (k); |
4197
|
270 |
4587
|
271 assign (idx, k, t_rhs); |
4197
|
272 |
|
273 if (error_state) |
|
274 break; |
|
275 } |
|
276 } |
|
277 else |
|
278 error ("field name mismatch in structure assignment"); |
|
279 |
|
280 return *this; |
|
281 } |
|
282 |
4561
|
283 static dim_vector |
|
284 common_size (const dim_vector& a, const dim_vector& b) |
|
285 { |
|
286 dim_vector retval; |
|
287 |
5275
|
288 octave_idx_type a_len = a.length (); |
|
289 octave_idx_type b_len = b.length (); |
4561
|
290 |
5275
|
291 octave_idx_type new_len = std::max (a_len, b_len); |
|
292 octave_idx_type min_len = std::min (a_len, b_len); |
4561
|
293 |
|
294 retval.resize (new_len); |
|
295 |
5275
|
296 for (octave_idx_type i = 0; i < min_len; i++) |
4561
|
297 retval(i) = std::max (a(i), b(i)); |
|
298 |
|
299 if (a_len < b_len) |
|
300 { |
5275
|
301 for (octave_idx_type i = min_len; i < b_len; i++) |
4561
|
302 retval(i) = b(i); |
|
303 } |
|
304 else if (a_len > b_len) |
|
305 { |
5275
|
306 for (octave_idx_type i = min_len; i < a_len; i++) |
4561
|
307 retval(i) = a(i); |
|
308 } |
|
309 |
|
310 return retval; |
|
311 } |
|
312 |
3932
|
313 Octave_map& |
4587
|
314 Octave_map::assign (const octave_value_list& idx, const std::string& k, |
4513
|
315 const Cell& rhs) |
3932
|
316 { |
4587
|
317 Cell tmp = map[k]; |
3932
|
318 |
4216
|
319 octave_value fill_value = Matrix (); |
|
320 |
|
321 tmp.assign (idx, rhs, fill_value); |
3932
|
322 |
|
323 if (! error_state) |
|
324 { |
4561
|
325 dim_vector rhs_dims = tmp.dims (); |
3943
|
326 |
4561
|
327 dim_vector curr_dims = dims (); |
|
328 |
|
329 dim_vector new_dims = common_size (rhs_dims, curr_dims); |
3932
|
330 |
4561
|
331 if (new_dims != rhs_dims) |
3932
|
332 { |
4625
|
333 tmp.resize (new_dims, fill_value); |
3943
|
334 } |
5329
|
335 |
|
336 if (new_dims != curr_dims) |
3943
|
337 { |
4219
|
338 for (iterator p = begin (); p != end (); p++) |
5328
|
339 contents(p).resize (new_dims, fill_value); |
4561
|
340 } |
3932
|
341 |
4561
|
342 dimensions = new_dims; |
3932
|
343 |
5880
|
344 maybe_add_to_key_list (k); |
|
345 |
4587
|
346 map[k] = tmp; |
3932
|
347 } |
|
348 |
|
349 return *this; |
|
350 } |
|
351 |
3933
|
352 Octave_map& |
4675
|
353 Octave_map::assign (const std::string& k, const octave_value& rhs) |
|
354 { |
|
355 if (empty ()) |
|
356 { |
5880
|
357 maybe_add_to_key_list (k); |
|
358 |
4675
|
359 map[k] = Cell (rhs); |
|
360 |
|
361 dimensions = dim_vector (1, 1); |
|
362 } |
|
363 else |
|
364 { |
|
365 dim_vector dv = dims (); |
|
366 |
|
367 if (dv.all_ones ()) |
5880
|
368 { |
|
369 maybe_add_to_key_list (k); |
|
370 |
|
371 map[k] = Cell (rhs); |
|
372 } |
4675
|
373 else |
|
374 error ("invalid structure assignment"); |
|
375 } |
|
376 |
|
377 return *this; |
|
378 } |
|
379 |
|
380 Octave_map& |
4587
|
381 Octave_map::assign (const std::string& k, const Cell& rhs) |
3933
|
382 { |
4219
|
383 if (empty ()) |
4563
|
384 { |
5880
|
385 maybe_add_to_key_list (k); |
|
386 |
4587
|
387 map[k] = rhs; |
4563
|
388 |
4730
|
389 dimensions = rhs.dims (); |
4563
|
390 } |
3933
|
391 else |
|
392 { |
4562
|
393 if (dims () == rhs.dims ()) |
5880
|
394 { |
|
395 maybe_add_to_key_list (k); |
|
396 |
|
397 map[k] = rhs; |
|
398 } |
3933
|
399 else |
|
400 error ("invalid structure assignment"); |
|
401 } |
|
402 |
|
403 return *this; |
|
404 } |
|
405 |
|
406 Octave_map |
4513
|
407 Octave_map::index (const octave_value_list& idx) |
3933
|
408 { |
|
409 Octave_map retval; |
|
410 |
5435
|
411 if (idx.length () > 0) |
3933
|
412 { |
5435
|
413 for (iterator p = begin (); p != end (); p++) |
|
414 { |
|
415 Cell tmp = contents(p).index (idx); |
3933
|
416 |
5435
|
417 if (error_state) |
|
418 break; |
3933
|
419 |
5435
|
420 retval.assign (key(p), tmp); |
|
421 } |
3933
|
422 } |
5435
|
423 else |
5539
|
424 retval = *this; |
3933
|
425 |
5539
|
426 return retval; |
3933
|
427 } |
|
428 |
1278
|
429 /* |
|
430 ;;; Local Variables: *** |
|
431 ;;; mode: C++ *** |
|
432 ;;; End: *** |
|
433 */ |