|
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 |
|
|
90 Octave_map::reshape (const dim_vector& new_dims) const |
|
|
91 { |
|
|
92 Octave_map retval; |
|
|
93 |
|
|
94 if (new_dims != dims ()) |
|
|
95 { |
|
|
96 for (const_iterator p = begin (); p != end (); p++) |
|
4675
|
97 retval.assign (key(p), contents(p).reshape (new_dims)); |
|
4567
|
98 |
|
4936
|
99 retval.dimensions = new_dims; |
|
4567
|
100 } |
|
4936
|
101 else |
|
|
102 retval = *this; |
|
4567
|
103 |
|
|
104 return retval; |
|
|
105 } |
|
|
106 |
|
5275
|
107 octave_idx_type |
|
4561
|
108 Octave_map::numel (void) const |
|
3932
|
109 { |
|
5275
|
110 octave_idx_type retval; |
|
4561
|
111 |
|
|
112 if (empty ()) |
|
|
113 retval = 0; |
|
|
114 else |
|
3932
|
115 { |
|
4561
|
116 Cell tmp = contents (begin ()); |
|
|
117 retval = tmp.numel (); |
|
3932
|
118 } |
|
4121
|
119 |
|
4561
|
120 return retval; |
|
3932
|
121 } |
|
|
122 |
|
4936
|
123 Octave_map |
|
|
124 Octave_map::resize (const dim_vector& dv) const |
|
|
125 { |
|
|
126 Octave_map retval; |
|
|
127 |
|
|
128 if (dv != dims ()) |
|
|
129 { |
|
|
130 for (const_iterator p = begin (); p != end (); p++) |
|
|
131 { |
|
|
132 Cell tmp = contents(p); |
|
|
133 tmp.resize(dv); |
|
|
134 retval.assign (key(p), tmp); |
|
|
135 } |
|
|
136 |
|
|
137 retval.dimensions = dv; |
|
|
138 } |
|
|
139 else |
|
|
140 retval = *this; |
|
|
141 |
|
|
142 |
|
|
143 return retval; |
|
|
144 } |
|
|
145 |
|
4915
|
146 Octave_map |
|
5275
|
147 Octave_map::concat (const Octave_map& rb, const Array<octave_idx_type>& ra_idx) |
|
4806
|
148 { |
|
4937
|
149 Octave_map retval; |
|
4936
|
150 |
|
5073
|
151 if (length() == rb.length()) |
|
4936
|
152 { |
|
5073
|
153 for (Octave_map::const_iterator pa = begin (); pa != end (); pa++) |
|
4936
|
154 { |
|
5073
|
155 Octave_map::const_iterator pb = rb.seek (key(pa)); |
|
4937
|
156 |
|
5003
|
157 if (pb == rb.end ()) |
|
4937
|
158 { |
|
|
159 error ("field name mismatch in structure concatenation"); |
|
|
160 break; |
|
|
161 } |
|
4936
|
162 |
|
5073
|
163 retval.assign (key(pa), |
|
|
164 contents(pa).insert (rb.contents(pb), ra_idx)); |
|
4937
|
165 } |
|
4936
|
166 } |
|
4937
|
167 else |
|
|
168 error ("field name mismatch in structure concatenation"); |
|
|
169 |
|
4915
|
170 return retval; |
|
4806
|
171 } |
|
|
172 |
|
4197
|
173 static string_vector |
|
|
174 equiv_keys (const Octave_map& a, const Octave_map& b) |
|
|
175 { |
|
|
176 string_vector retval; |
|
|
177 |
|
|
178 string_vector a_keys = a.keys().qsort (); |
|
|
179 string_vector b_keys = b.keys().qsort (); |
|
|
180 |
|
5275
|
181 octave_idx_type a_len = a_keys.length (); |
|
|
182 octave_idx_type b_len = b_keys.length (); |
|
4197
|
183 |
|
|
184 if (a_len == b_len) |
|
|
185 { |
|
5275
|
186 for (octave_idx_type i = 0; i < a_len; i++) |
|
4197
|
187 { |
|
|
188 if (a_keys[i] != b_keys[i]) |
|
|
189 return retval; |
|
|
190 } |
|
|
191 |
|
|
192 retval = a_keys; |
|
|
193 } |
|
|
194 |
|
|
195 return retval; |
|
|
196 } |
|
|
197 |
|
|
198 Octave_map& |
|
4513
|
199 Octave_map::assign (const octave_value_list& idx, const Octave_map& rhs) |
|
4197
|
200 { |
|
|
201 string_vector t_keys = empty () ? rhs.keys () : equiv_keys (*this, rhs); |
|
|
202 |
|
|
203 if (! t_keys.empty ()) |
|
|
204 { |
|
5275
|
205 octave_idx_type len = t_keys.length (); |
|
4197
|
206 |
|
5275
|
207 for (octave_idx_type i = 0; i < len; i++) |
|
4197
|
208 { |
|
4587
|
209 std::string k = t_keys[i]; |
|
4197
|
210 |
|
4675
|
211 Cell t_rhs = rhs.contents (k); |
|
4197
|
212 |
|
4587
|
213 assign (idx, k, t_rhs); |
|
4197
|
214 |
|
|
215 if (error_state) |
|
|
216 break; |
|
|
217 } |
|
|
218 } |
|
|
219 else |
|
|
220 error ("field name mismatch in structure assignment"); |
|
|
221 |
|
|
222 return *this; |
|
|
223 } |
|
|
224 |
|
4561
|
225 static dim_vector |
|
|
226 common_size (const dim_vector& a, const dim_vector& b) |
|
|
227 { |
|
|
228 dim_vector retval; |
|
|
229 |
|
5275
|
230 octave_idx_type a_len = a.length (); |
|
|
231 octave_idx_type b_len = b.length (); |
|
4561
|
232 |
|
5275
|
233 octave_idx_type new_len = std::max (a_len, b_len); |
|
|
234 octave_idx_type min_len = std::min (a_len, b_len); |
|
4561
|
235 |
|
|
236 retval.resize (new_len); |
|
|
237 |
|
5275
|
238 for (octave_idx_type i = 0; i < min_len; i++) |
|
4561
|
239 retval(i) = std::max (a(i), b(i)); |
|
|
240 |
|
|
241 if (a_len < b_len) |
|
|
242 { |
|
5275
|
243 for (octave_idx_type i = min_len; i < b_len; i++) |
|
4561
|
244 retval(i) = b(i); |
|
|
245 } |
|
|
246 else if (a_len > b_len) |
|
|
247 { |
|
5275
|
248 for (octave_idx_type i = min_len; i < a_len; i++) |
|
4561
|
249 retval(i) = a(i); |
|
|
250 } |
|
|
251 |
|
|
252 return retval; |
|
|
253 } |
|
|
254 |
|
3932
|
255 Octave_map& |
|
4587
|
256 Octave_map::assign (const octave_value_list& idx, const std::string& k, |
|
4513
|
257 const Cell& rhs) |
|
3932
|
258 { |
|
4587
|
259 Cell tmp = map[k]; |
|
3932
|
260 |
|
4216
|
261 octave_value fill_value = Matrix (); |
|
|
262 |
|
|
263 tmp.assign (idx, rhs, fill_value); |
|
3932
|
264 |
|
|
265 if (! error_state) |
|
|
266 { |
|
4561
|
267 dim_vector rhs_dims = tmp.dims (); |
|
3943
|
268 |
|
4561
|
269 dim_vector curr_dims = dims (); |
|
|
270 |
|
|
271 dim_vector new_dims = common_size (rhs_dims, curr_dims); |
|
3932
|
272 |
|
4561
|
273 if (new_dims != rhs_dims) |
|
3932
|
274 { |
|
4625
|
275 tmp.resize (new_dims, fill_value); |
|
3943
|
276 } |
|
5329
|
277 |
|
|
278 if (new_dims != curr_dims) |
|
3943
|
279 { |
|
4219
|
280 for (iterator p = begin (); p != end (); p++) |
|
5328
|
281 contents(p).resize (new_dims, fill_value); |
|
4561
|
282 } |
|
3932
|
283 |
|
4561
|
284 dimensions = new_dims; |
|
3932
|
285 |
|
4587
|
286 map[k] = tmp; |
|
3932
|
287 } |
|
|
288 |
|
|
289 return *this; |
|
|
290 } |
|
|
291 |
|
3933
|
292 Octave_map& |
|
4675
|
293 Octave_map::assign (const std::string& k, const octave_value& rhs) |
|
|
294 { |
|
|
295 if (empty ()) |
|
|
296 { |
|
|
297 map[k] = Cell (rhs); |
|
|
298 |
|
|
299 dimensions = dim_vector (1, 1); |
|
|
300 } |
|
|
301 else |
|
|
302 { |
|
|
303 dim_vector dv = dims (); |
|
|
304 |
|
|
305 if (dv.all_ones ()) |
|
|
306 map[k] = Cell (rhs); |
|
|
307 else |
|
|
308 error ("invalid structure assignment"); |
|
|
309 } |
|
|
310 |
|
|
311 return *this; |
|
|
312 } |
|
|
313 |
|
|
314 Octave_map& |
|
4587
|
315 Octave_map::assign (const std::string& k, const Cell& rhs) |
|
3933
|
316 { |
|
4219
|
317 if (empty ()) |
|
4563
|
318 { |
|
4587
|
319 map[k] = rhs; |
|
4563
|
320 |
|
4730
|
321 dimensions = rhs.dims (); |
|
4563
|
322 } |
|
3933
|
323 else |
|
|
324 { |
|
4562
|
325 if (dims () == rhs.dims ()) |
|
4587
|
326 map[k] = rhs; |
|
3933
|
327 else |
|
|
328 error ("invalid structure assignment"); |
|
|
329 } |
|
|
330 |
|
|
331 return *this; |
|
|
332 } |
|
|
333 |
|
|
334 Octave_map |
|
4513
|
335 Octave_map::index (const octave_value_list& idx) |
|
3933
|
336 { |
|
|
337 Octave_map retval; |
|
|
338 |
|
5435
|
339 if (idx.length () > 0) |
|
3933
|
340 { |
|
5435
|
341 for (iterator p = begin (); p != end (); p++) |
|
|
342 { |
|
|
343 Cell tmp = contents(p).index (idx); |
|
3933
|
344 |
|
5435
|
345 if (error_state) |
|
|
346 break; |
|
3933
|
347 |
|
5435
|
348 retval.assign (key(p), tmp); |
|
|
349 } |
|
3933
|
350 } |
|
5435
|
351 else |
|
5539
|
352 retval = *this; |
|
3933
|
353 |
|
5539
|
354 return retval; |
|
3933
|
355 } |
|
|
356 |
|
1278
|
357 /* |
|
|
358 ;;; Local Variables: *** |
|
|
359 ;;; mode: C++ *** |
|
|
360 ;;; End: *** |
|
|
361 */ |
