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