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