|
5205
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 2005 Mohamed Kamoun |
|
|
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. |
|
5205
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
|
28 #include <string> |
|
5988
|
29 #include <vector> |
|
|
30 #include <list> |
|
5205
|
31 |
|
|
32 #include "lo-mappers.h" |
|
|
33 |
|
|
34 #include "Cell.h" |
|
5988
|
35 #include "oct-map.h" |
|
5205
|
36 #include "defun-dld.h" |
|
|
37 #include "parse.h" |
|
|
38 #include "variables.h" |
|
5451
|
39 #include "ov-colon.h" |
|
5988
|
40 #include "unwind-prot.h" |
|
5205
|
41 |
|
5988
|
42 extern octave_value_list |
|
|
43 Flasterr (const octave_value_list& args_name, int nargout_name); |
|
|
44 |
|
|
45 DEFUN_DLD (cellfun, args, nargout, |
|
5205
|
46 " -*- texinfo -*-\n\ |
|
6854
|
47 @deftypefn {Loadable Function} {} cellfun (@var{name}, @var{c})\n\ |
|
|
48 @deftypefnx {Loadable Function} {} cellfun (\"size\", @var{c}, @var{k})\n\ |
|
|
49 @deftypefnx {Loadable Function} {} cellfun (\"isclass\", @var{c}, @var{class})\n\ |
|
|
50 @deftypefnx {Loadable Function} {} cellfun (@var{func}, @var{c})\n\ |
|
|
51 @deftypefnx {Loadable Function} {} cellfun (@var{func}, @var{c}, @var{d})\n\ |
|
|
52 @deftypefnx {Loadable Function} {[@var{a}, @var{b}] =} cellfun (@dots{})\n\ |
|
|
53 @deftypefnx {Loadable Function} {} cellfun (@dots{}, 'ErrorHandler', @var{errfunc})\n\ |
|
|
54 @deftypefnx {Loadable Function} {} cellfun (@dots{}, 'UniformOutput', @var{val})\n\ |
|
5205
|
55 \n\ |
|
|
56 Evaluate the function named @var{name} on the elements of the cell array\n\ |
|
5543
|
57 @var{c}. Elements in @var{c} are passed on to the named function\n\ |
|
5205
|
58 individually. The function @var{name} can be one of the functions\n\ |
|
|
59 \n\ |
|
|
60 @table @code\n\ |
|
|
61 @item isempty\n\ |
|
5543
|
62 Return 1 for empty elements.\n\ |
|
5205
|
63 @item islogical\n\ |
|
|
64 Return 1 for logical elements.\n\ |
|
|
65 @item isreal\n\ |
|
|
66 Return 1 for real elements.\n\ |
|
|
67 @item length\n\ |
|
|
68 Return a vector of the lengths of cell elements.\n\ |
|
5543
|
69 @item ndims\n\ |
|
5205
|
70 Return the number of dimensions of each element.\n\ |
|
|
71 @item prodofsize\n\ |
|
|
72 Return the product of dimensions of each element.\n\ |
|
|
73 @item size\n\ |
|
|
74 Return the size along the @var{k}-th dimension.\n\ |
|
|
75 @item isclass\n\ |
|
|
76 Return 1 for elements of @var{class}.\n\ |
|
|
77 @end table\n\ |
|
|
78 \n\ |
|
|
79 Additionally, @code{cellfun} accepts an arbitrary function @var{func}\n\ |
|
|
80 in the form of an inline function, function handle, or the name of a\n\ |
|
5988
|
81 function (in a character string). In the case of a character string\n\ |
|
|
82 argument, the function must accept a single argument named @var{x}, and\n\ |
|
|
83 it must return a string value. The function can take one or more arguments,\n\ |
|
|
84 with the inputs args given by @var{c}, @var{d}, etc. Equally the function\n\ |
|
|
85 can return one or more output arguments. For example\n\ |
|
5205
|
86 \n\ |
|
|
87 @example\n\ |
|
|
88 @group\n\ |
|
5988
|
89 cellfun (@@atan2, @{1, 0@}, @{0, 1@})\n\ |
|
|
90 @result{}ans = [1.57080 0.00000]\n\ |
|
|
91 @end group\n\ |
|
|
92 @end example\n\ |
|
|
93 \n\ |
|
|
94 Note that the default output argument is an array of the same size as the\n\ |
|
|
95 input arguments.\n\ |
|
|
96 \n\ |
|
|
97 If the param 'UniformOutput' is set to true (the default), then the function\n\ |
|
|
98 must return either a single element which will be concatenated into the\n\ |
|
|
99 return value. If 'UniformOutput is false, the outputs are concatenated in\n\ |
|
|
100 a cell array. For example\n\ |
|
|
101 \n\ |
|
|
102 @example\n\ |
|
|
103 @group\n\ |
|
6623
|
104 cellfun (\"tolower(x)\", @{\"Foo\", \"Bar\", \"FooBar\"@},\n\ |
|
|
105 \"UniformOutput\",false)\n\ |
|
5205
|
106 @result{} ans = @{\"foo\", \"bar\", \"foobar\"@}\n\ |
|
|
107 @end group\n\ |
|
|
108 @end example\n\ |
|
5988
|
109 \n\ |
|
|
110 Given the parameter 'ErrorHandler', then @var{errfunc} defines a function to\n\ |
|
|
111 call in case @var{func} generates an error. The form of the function is\n\ |
|
|
112 \n\ |
|
|
113 @example\n\ |
|
|
114 function [@dots{}] = errfunc (@var{s}, @dots{})\n\ |
|
|
115 @end example\n\ |
|
|
116 \n\ |
|
|
117 where there is an additional input argument to @var{errfunc} relative to\n\ |
|
|
118 @var{func}, given by @var{s}. This is a structure with the elements\n\ |
|
|
119 'identifier', 'message' and 'index', giving respectively the error\n\ |
|
|
120 identifier, the error message, and the index into the input arguments\n\ |
|
|
121 of the element that caused the error. For example\n\ |
|
|
122 \n\ |
|
|
123 @example\n\ |
|
|
124 @group\n\ |
|
|
125 function y = foo (s, x), y = NaN; endfunction\n\ |
|
|
126 cellfun (@@factorial, @{-1,2@},'ErrorHandler',@@foo)\n\ |
|
|
127 @result{} ans = [NaN 2]\n\ |
|
|
128 @end group\n\ |
|
|
129 @end example\n\ |
|
|
130 \n\ |
|
5642
|
131 @seealso{isempty, islogical, isreal, length, ndims, numel, size, isclass}\n\ |
|
|
132 @end deftypefn") |
|
5205
|
133 { |
|
5988
|
134 octave_value_list retval; |
|
5205
|
135 std::string name = "function"; |
|
|
136 octave_function *func = 0; |
|
|
137 int nargin = args.length (); |
|
5988
|
138 nargout = (nargout < 1 ? 1 : nargout); |
|
5205
|
139 |
|
|
140 if (nargin < 2) |
|
|
141 { |
|
|
142 error ("cellfun: you must supply at least 2 arguments"); |
|
5823
|
143 print_usage (); |
|
5205
|
144 return retval; |
|
|
145 } |
|
|
146 |
|
|
147 if (args(0).is_function_handle () || args(0).is_inline_function ()) |
|
|
148 { |
|
|
149 func = args(0).function_value (); |
|
|
150 |
|
|
151 if (error_state) |
|
|
152 return retval; |
|
|
153 } |
|
|
154 else if (args(0).is_string ()) |
|
|
155 name = args(0).string_value (); |
|
|
156 else |
|
|
157 { |
|
5543
|
158 error ("cellfun: first argument must be a string or function handle"); |
|
5205
|
159 return retval; |
|
|
160 } |
|
|
161 |
|
|
162 if (! args(1).is_cell ()) |
|
|
163 { |
|
5543
|
164 error ("cellfun: second argument must be a cell array"); |
|
5205
|
165 |
|
|
166 return retval; |
|
|
167 } |
|
|
168 |
|
|
169 Cell f_args = args(1).cell_value (); |
|
|
170 |
|
5988
|
171 octave_idx_type k = f_args.numel (); |
|
5205
|
172 |
|
|
173 if (name == "isempty") |
|
|
174 { |
|
|
175 boolNDArray result (f_args.dims ()); |
|
5988
|
176 for (octave_idx_type count = 0; count < k ; count++) |
|
5543
|
177 result(count) = f_args.elem(count).is_empty (); |
|
5988
|
178 retval(0) = result; |
|
5205
|
179 } |
|
|
180 else if (name == "islogical") |
|
|
181 { |
|
|
182 boolNDArray result (f_args.dims ()); |
|
5988
|
183 for (octave_idx_type count= 0; count < k ; count++) |
|
5205
|
184 result(count) = f_args.elem(count).is_bool_type (); |
|
5988
|
185 retval(0) = result; |
|
5205
|
186 } |
|
|
187 else if (name == "isreal") |
|
|
188 { |
|
|
189 boolNDArray result (f_args.dims ()); |
|
5988
|
190 for (octave_idx_type count= 0; count < k ; count++) |
|
5205
|
191 result(count) = f_args.elem(count).is_real_type (); |
|
5988
|
192 retval(0) = result; |
|
5205
|
193 } |
|
|
194 else if (name == "length") |
|
|
195 { |
|
|
196 NDArray result (f_args.dims ()); |
|
5988
|
197 for (octave_idx_type count= 0; count < k ; count++) |
|
5544
|
198 result(count) = static_cast<double> (f_args.elem(count).length ()); |
|
5988
|
199 retval(0) = result; |
|
5205
|
200 } |
|
|
201 else if (name == "ndims") |
|
|
202 { |
|
|
203 NDArray result (f_args.dims ()); |
|
5988
|
204 for (octave_idx_type count = 0; count < k ; count++) |
|
5544
|
205 result(count) = static_cast<double> (f_args.elem(count).ndims ()); |
|
5988
|
206 retval(0) = result; |
|
5205
|
207 } |
|
|
208 else if (name == "prodofsize") |
|
|
209 { |
|
|
210 NDArray result (f_args.dims ()); |
|
5988
|
211 for (octave_idx_type count = 0; count < k ; count++) |
|
5544
|
212 result(count) = static_cast<double> (f_args.elem(count).numel ()); |
|
5988
|
213 retval(0) = result; |
|
5205
|
214 } |
|
|
215 else if (name == "size") |
|
|
216 { |
|
|
217 if (nargin == 3) |
|
|
218 { |
|
|
219 int d = args(2).nint_value () - 1; |
|
|
220 |
|
|
221 if (d < 0) |
|
|
222 error ("cellfun: third argument must be a postive integer"); |
|
|
223 |
|
6484
|
224 if (! error_state) |
|
5205
|
225 { |
|
|
226 NDArray result (f_args.dims ()); |
|
5988
|
227 for (octave_idx_type count = 0; count < k ; count++) |
|
5205
|
228 { |
|
|
229 dim_vector dv = f_args.elem(count).dims (); |
|
|
230 if (d < dv.length ()) |
|
5544
|
231 result(count) = static_cast<double> (dv(d)); |
|
5205
|
232 else |
|
|
233 result(count) = 1.0; |
|
|
234 } |
|
5988
|
235 retval(0) = result; |
|
5205
|
236 } |
|
|
237 } |
|
|
238 else |
|
5543
|
239 error ("not enough arguments for `size'"); |
|
5205
|
240 } |
|
|
241 else if (name == "isclass") |
|
|
242 { |
|
|
243 if (nargin == 3) |
|
|
244 { |
|
|
245 std::string class_name = args(2).string_value(); |
|
|
246 boolNDArray result (f_args.dims ()); |
|
5988
|
247 for (octave_idx_type count = 0; count < k ; count++) |
|
5205
|
248 result(count) = (f_args.elem(count).class_name() == class_name); |
|
|
249 |
|
5988
|
250 retval(0) = result; |
|
5205
|
251 } |
|
|
252 else |
|
5543
|
253 error ("not enough arguments for `isclass'"); |
|
5205
|
254 } |
|
|
255 else |
|
|
256 { |
|
5988
|
257 unwind_protect::begin_frame ("Fcellfun"); |
|
|
258 unwind_protect_int (buffer_error_messages); |
|
|
259 |
|
5205
|
260 std::string fcn_name; |
|
|
261 |
|
|
262 if (! func) |
|
|
263 { |
|
|
264 fcn_name = unique_symbol_name ("__cellfun_fcn_"); |
|
|
265 std::string fname = "function y = "; |
|
|
266 fname.append (fcn_name); |
|
|
267 fname.append ("(x) y = "); |
|
|
268 func = extract_function (args(0), "cellfun", fcn_name, fname, |
|
|
269 "; endfunction"); |
|
|
270 } |
|
|
271 |
|
|
272 if (! func) |
|
|
273 error ("unknown function"); |
|
|
274 else |
|
|
275 { |
|
5988
|
276 octave_value_list idx; |
|
|
277 octave_value_list inputlist; |
|
6484
|
278 bool uniform_output = true; |
|
|
279 bool have_error_handler = false; |
|
5988
|
280 std::string err_name; |
|
6484
|
281 octave_function *error_handler = 0; |
|
5988
|
282 int offset = 1; |
|
|
283 int i = 1; |
|
|
284 OCTAVE_LOCAL_BUFFER (Cell, inputs, nargin); |
|
5205
|
285 |
|
5988
|
286 while (i < nargin) |
|
5205
|
287 { |
|
5988
|
288 if (args(i).is_string()) |
|
|
289 { |
|
|
290 std::string arg = args(i++).string_value(); |
|
|
291 if (i == nargin) |
|
|
292 { |
|
|
293 error ("cellfun: parameter value is missing"); |
|
|
294 goto cellfun_err; |
|
|
295 } |
|
|
296 |
|
|
297 std::transform (arg.begin (), arg.end (), |
|
|
298 arg.begin (), tolower); |
|
|
299 |
|
|
300 if (arg == "uniformoutput") |
|
6484
|
301 uniform_output = args(i++).bool_value(); |
|
5988
|
302 else if (arg == "errorhandler") |
|
|
303 { |
|
|
304 if (args(i).is_function_handle () || |
|
|
305 args(i).is_inline_function ()) |
|
|
306 { |
|
6484
|
307 error_handler = args(i).function_value (); |
|
5205
|
308 |
|
5988
|
309 if (error_state) |
|
|
310 goto cellfun_err; |
|
|
311 } |
|
|
312 else if (args(i).is_string ()) |
|
|
313 { |
|
|
314 err_name = unique_symbol_name ("__cellfun_fcn_"); |
|
|
315 std::string fname = "function y = "; |
|
|
316 fname.append (fcn_name); |
|
|
317 fname.append ("(x) y = "); |
|
6484
|
318 error_handler = extract_function (args(i), "cellfun", |
|
|
319 err_name, fname, |
|
|
320 "; endfunction"); |
|
5988
|
321 } |
|
|
322 |
|
6484
|
323 if (! error_handler) |
|
5988
|
324 goto cellfun_err; |
|
|
325 |
|
6484
|
326 have_error_handler = true; |
|
5988
|
327 i++; |
|
|
328 } |
|
|
329 else |
|
|
330 { |
|
|
331 error ("cellfun: unrecognized parameter %s", |
|
|
332 arg.c_str()); |
|
|
333 goto cellfun_err; |
|
|
334 } |
|
|
335 offset += 2; |
|
|
336 } |
|
|
337 else |
|
|
338 { |
|
|
339 inputs[i-offset] = args(i).cell_value (); |
|
|
340 if (f_args.dims() != inputs[i-offset].dims()) |
|
|
341 { |
|
|
342 error ("cellfun: Dimension mismatch"); |
|
|
343 goto cellfun_err; |
|
|
344 |
|
|
345 } |
|
|
346 i++; |
|
|
347 } |
|
5205
|
348 } |
|
|
349 |
|
5988
|
350 inputlist.resize(nargin-offset); |
|
|
351 |
|
6484
|
352 if (have_error_handler) |
|
5988
|
353 buffer_error_messages++; |
|
|
354 |
|
6484
|
355 if (uniform_output) |
|
5988
|
356 { |
|
|
357 retval.resize(nargout); |
|
|
358 |
|
|
359 for (octave_idx_type count = 0; count < k ; count++) |
|
|
360 { |
|
5989
|
361 for (int j = 0; j < nargin-offset; j++) |
|
|
362 inputlist(j) = inputs[j](count); |
|
5988
|
363 |
|
|
364 octave_value_list tmp = feval (func, inputlist, nargout); |
|
|
365 |
|
6484
|
366 if (error_state && have_error_handler) |
|
5988
|
367 { |
|
|
368 octave_value_list errtmp = |
|
|
369 Flasterr (octave_value_list (), 2); |
|
|
370 |
|
|
371 Octave_map msg; |
|
|
372 msg.assign ("identifier", errtmp(1)); |
|
|
373 msg.assign ("message", errtmp(0)); |
|
|
374 msg.assign ("index", octave_value(double (count))); |
|
|
375 octave_value_list errlist = inputlist; |
|
|
376 errlist.prepend (msg); |
|
|
377 buffer_error_messages--; |
|
|
378 error_state = 0; |
|
6484
|
379 tmp = feval (error_handler, errlist, nargout); |
|
5988
|
380 buffer_error_messages++; |
|
|
381 |
|
|
382 if (error_state) |
|
|
383 goto cellfun_err; |
|
|
384 } |
|
|
385 |
|
|
386 if (tmp.length() < nargout) |
|
|
387 { |
|
|
388 error ("cellfun: too many output arguments"); |
|
|
389 goto cellfun_err; |
|
|
390 } |
|
|
391 |
|
|
392 if (error_state) |
|
|
393 break; |
|
|
394 |
|
|
395 if (count == 0) |
|
|
396 { |
|
5989
|
397 for (int j = 0; j < nargout; j++) |
|
5988
|
398 { |
|
|
399 octave_value val; |
|
5989
|
400 val = tmp(j); |
|
5988
|
401 |
|
|
402 if (error_state) |
|
|
403 goto cellfun_err; |
|
|
404 |
|
6422
|
405 retval(j) = val.resize(f_args.dims()); |
|
5988
|
406 } |
|
|
407 } |
|
|
408 else |
|
|
409 { |
|
|
410 idx(0) = octave_value (static_cast<double>(count+1)); |
|
5989
|
411 for (int j = 0; j < nargout; j++) |
|
|
412 { |
|
|
413 // FIXME -- need an easier way to express |
|
|
414 // this test. |
|
|
415 octave_value val = tmp(j); |
|
|
416 |
|
|
417 if (val.ndims () == 2 |
|
|
418 && val.rows () == 1 && val.columns () == 1) |
|
|
419 retval(j) = |
|
|
420 retval(j).subsasgn ("(", |
|
|
421 std::list<octave_value_list> |
|
|
422 (1, idx(0)), val); |
|
|
423 else |
|
|
424 error ("cellfun: expecting all values to be scalars for UniformOutput = true"); |
|
|
425 } |
|
5988
|
426 } |
|
|
427 |
|
|
428 if (error_state) |
|
|
429 break; |
|
|
430 } |
|
|
431 } |
|
|
432 else |
|
|
433 { |
|
|
434 OCTAVE_LOCAL_BUFFER (Cell, results, nargout); |
|
5989
|
435 for (int j = 0; j < nargout; j++) |
|
|
436 results[j].resize(f_args.dims()); |
|
5988
|
437 |
|
|
438 for (octave_idx_type count = 0; count < k ; count++) |
|
|
439 { |
|
5989
|
440 for (int j = 0; j < nargin-offset; j++) |
|
|
441 inputlist(j) = inputs[j](count); |
|
5988
|
442 |
|
|
443 octave_value_list tmp = feval (func, inputlist, nargout); |
|
|
444 |
|
6484
|
445 if (error_state && have_error_handler) |
|
5988
|
446 { |
|
|
447 octave_value_list errtmp = |
|
|
448 Flasterr (octave_value_list (), 2); |
|
|
449 |
|
|
450 Octave_map msg; |
|
|
451 msg.assign ("identifier", errtmp(1)); |
|
|
452 msg.assign ("message", errtmp(0)); |
|
|
453 msg.assign ("index", octave_value(double (count))); |
|
|
454 octave_value_list errlist = inputlist; |
|
|
455 errlist.prepend (msg); |
|
|
456 buffer_error_messages--; |
|
|
457 error_state = 0; |
|
6484
|
458 tmp = feval (error_handler, errlist, nargout); |
|
5988
|
459 buffer_error_messages++; |
|
|
460 |
|
|
461 if (error_state) |
|
|
462 goto cellfun_err; |
|
|
463 } |
|
|
464 |
|
|
465 if (tmp.length() < nargout) |
|
|
466 { |
|
|
467 error ("cellfun: too many output arguments"); |
|
|
468 goto cellfun_err; |
|
|
469 } |
|
|
470 |
|
|
471 if (error_state) |
|
|
472 break; |
|
|
473 |
|
|
474 |
|
5989
|
475 for (int j = 0; j < nargout; j++) |
|
|
476 results[j](count) = tmp(j); |
|
5988
|
477 } |
|
|
478 |
|
|
479 retval.resize(nargout); |
|
5989
|
480 for (int j = 0; j < nargout; j++) |
|
|
481 retval(j) = results[j]; |
|
5988
|
482 } |
|
|
483 |
|
|
484 cellfun_err: |
|
|
485 if (error_state) |
|
|
486 retval = octave_value_list(); |
|
5205
|
487 |
|
|
488 if (! fcn_name.empty ()) |
|
|
489 clear_function (fcn_name); |
|
5988
|
490 |
|
|
491 if (! err_name.empty ()) |
|
|
492 clear_function (err_name); |
|
5205
|
493 } |
|
5988
|
494 |
|
|
495 unwind_protect::run_frame ("Fcellfun"); |
|
5205
|
496 } |
|
|
497 |
|
|
498 return retval; |
|
|
499 } |
|
|
500 |
|
5988
|
501 /* |
|
|
502 |
|
|
503 %!error(cellfun(1)) |
|
|
504 %!error(cellfun('isclass',1)) |
|
|
505 %!error(cellfun('size',1)) |
|
|
506 %!error(cellfun(@sin,{[]},'BadParam',false)) |
|
|
507 %!error(cellfun(@sin,{[]},'UniformOuput')) |
|
|
508 %!error(cellfun(@sin,{[]},'ErrorHandler')) |
|
|
509 %!assert(cellfun(@sin,{0,1}),sin([0,1])) |
|
|
510 %!assert(cellfun(inline('sin(x)'),{0,1}),sin([0,1])) |
|
|
511 %!assert(cellfun('sin',{0,1}),sin([0,1])) |
|
|
512 %!assert(cellfun('isempty',{1,[]}),[false,true]) |
|
|
513 %!assert(cellfun('islogical',{false,pi}),[true,false]) |
|
|
514 %!assert(cellfun('isreal',{1i,1}),[false,true]) |
|
|
515 %!assert(cellfun('length',{zeros(2,2),1}),[2,1]) |
|
|
516 %!assert(cellfun('prodofsize',{zeros(2,2),1}),[4,1]) |
|
|
517 %!assert(cellfun('ndims',{zeros([2,2,2]),1}),[3,2]) |
|
|
518 %!assert(cellfun('isclass',{zeros([2,2,2]),'test'},'double'),[true,false]) |
|
|
519 %!assert(cellfun('size',{zeros([1,2,3]),1},1),[1,1]) |
|
|
520 %!assert(cellfun('size',{zeros([1,2,3]),1},2),[2,1]) |
|
|
521 %!assert(cellfun('size',{zeros([1,2,3]),1},3),[3,1]) |
|
|
522 %!assert(cellfun(@atan2,{1,1},{1,2}),[atan2(1,1),atan2(1,2)]) |
|
|
523 %!assert(cellfun(@atan2,{1,1},{1,2},'UniformOutput',false),{atan2(1,1),atan2(1,2)}) |
|
6422
|
524 %!assert(cellfun(@sin,{1,2;3,4}),sin([1,2;3,4])) |
|
|
525 %!assert(cellfun(@atan2,{1,1;1,1},{1,2;1,2}),atan2([1,1;1,1],[1,2;1,2])) |
|
5988
|
526 %!error(cellfun(@factorial,{-1,3})) |
|
|
527 %!assert(cellfun(@factorial,{-1,3},'ErrorHandler',@(x,y) NaN),[NaN,6]) |
|
|
528 %!test |
|
6704
|
529 %! [a,b,c]=cellfun(@fileparts,{fullfile("a","b","c.d"),fullfile("e","f","g.h")},'UniformOutput',false); |
|
|
530 %! assert(a,{fullfile("a","b"),fullfile("e","f")}) |
|
5988
|
531 %! assert(b,{'c','g'}) |
|
|
532 %! assert(c,{'.d','.h'}) |
|
|
533 |
|
|
534 */ |
|
|
535 |
|
5451
|
536 DEFUN_DLD (num2cell, args, , |
|
|
537 "-*- texinfo -*-\n\ |
|
|
538 @deftypefn {Loadable Function} {@var{c} =} num2cell (@var{m})\n\ |
|
|
539 @deftypefnx {Loadable Function} {@var{c} =} num2cell (@var{m}, @var{d})\n\ |
|
|
540 Convert to matrix @var{m} into a cell array. If @var{d} is defined the\n\ |
|
|
541 value @var{c} is of dimension 1 in this dimension and the elements of\n\ |
|
|
542 @var{m} are placed in slices in @var{c}.\n\ |
|
5642
|
543 @seealso{mat2cell}\n\ |
|
|
544 @end deftypefn") |
|
5451
|
545 { |
|
|
546 int nargin = args.length(); |
|
|
547 octave_value retval; |
|
|
548 |
|
|
549 if (nargin < 1 || nargin > 2) |
|
5823
|
550 print_usage (); |
|
5451
|
551 else |
|
|
552 { |
|
|
553 dim_vector dv = args(0).dims (); |
|
|
554 Array<int> sings; |
|
|
555 |
|
|
556 if (nargin == 2) |
|
|
557 { |
|
|
558 ColumnVector dsings = ColumnVector (args(1).vector_value |
|
|
559 (false, true)); |
|
|
560 sings.resize (dsings.length()); |
|
|
561 |
|
|
562 if (!error_state) |
|
5988
|
563 for (octave_idx_type i = 0; i < dsings.length(); i++) |
|
5451
|
564 if (dsings(i) > dv.length() || dsings(i) < 1 || |
|
|
565 D_NINT(dsings(i)) != dsings(i)) |
|
|
566 { |
|
|
567 error ("invalid dimension specified"); |
|
|
568 break; |
|
|
569 } |
|
|
570 else |
|
|
571 sings(i) = NINT(dsings(i)) - 1; |
|
|
572 } |
|
|
573 |
|
|
574 if (! error_state) |
|
|
575 { |
|
|
576 Array<bool> idx_colon (dv.length()); |
|
|
577 dim_vector new_dv (dv); |
|
|
578 octave_value_list lst (new_dv.length(), octave_value()); |
|
|
579 |
|
|
580 for (int i = 0; i < dv.length(); i++) |
|
|
581 { |
|
|
582 idx_colon(i) = false; |
|
|
583 for (int j = 0; j < sings.length(); j++) |
|
|
584 { |
|
|
585 if (sings(j) == i) |
|
|
586 { |
|
|
587 new_dv(i) = 1; |
|
|
588 idx_colon(i) = true; |
|
|
589 lst(i) = octave_value (octave_value::magic_colon_t); |
|
|
590 break; |
|
|
591 } |
|
|
592 } |
|
|
593 } |
|
|
594 |
|
|
595 Cell ret (new_dv); |
|
|
596 octave_idx_type nel = new_dv.numel(); |
|
|
597 octave_idx_type ntot = 1; |
|
|
598 |
|
|
599 for (int j = 0; j < new_dv.length()-1; j++) |
|
|
600 ntot *= new_dv(j); |
|
|
601 |
|
|
602 for (octave_idx_type i = 0; i < nel; i++) |
|
|
603 { |
|
|
604 octave_idx_type n = ntot; |
|
|
605 octave_idx_type ii = i; |
|
|
606 for (int j = new_dv.length() - 1; j >= 0 ; j--) |
|
|
607 { |
|
|
608 if (! idx_colon(j)) |
|
|
609 lst (j) = ii/n + 1; |
|
|
610 ii = ii % n; |
|
|
611 if (j != 0) |
|
|
612 n /= new_dv(j-1); |
|
|
613 } |
|
|
614 ret(i) = args(0).do_index_op(lst, 0); |
|
|
615 } |
|
|
616 |
|
|
617 retval = ret; |
|
|
618 } |
|
|
619 } |
|
|
620 |
|
|
621 return retval; |
|
|
622 } |
|
|
623 |
|
5988
|
624 /* |
|
|
625 |
|
|
626 %!assert(num2cell([1,2;3,4]),{1,2;3,4}) |
|
|
627 %!assert(num2cell([1,2;3,4],1),{[1;3],[2;4]}) |
|
|
628 %!assert(num2cell([1,2;3,4],2),{[1,2];[3,4]}) |
|
|
629 |
|
|
630 */ |
|
|
631 |
|
5784
|
632 DEFUN_DLD (mat2cell, args, , |
|
|
633 "-*- texinfo -*-\n\ |
|
|
634 @deftypefn {Loadable Function} {@var{b} =} mat2cell (@var{a}, @var{m}, @var{n})\n\ |
|
|
635 @deftypefnx {Loadable Function} {@var{b} =} mat2cell (@var{a}, @var{d1}, @var{d2}, @dots{})\n\ |
|
|
636 @deftypefnx {Loadable Function} {@var{b} =} mat2cell (@var{a}, @var{r})\n\ |
|
|
637 Converts the matrix @var{a} to a cell array If @var{a} is 2-D, then\n\ |
|
|
638 it is required that @code{sum (@var{m}) == size (@var{a}, 1)} and\n\ |
|
|
639 @code{sum (@var{n}) == size (@var{a}, 2)}. Similarly, if @var{a} is\n\ |
|
|
640 a multi-dimensional and the number of dimensional arguments is equal\n\ |
|
|
641 to the dimensions of @var{a}, then it is required that @code{sum (@var{di})\n\ |
|
|
642 == size (@var{a}, i)}.\n\ |
|
|
643 \n\ |
|
|
644 Given a single dimensional argument @var{r}, the other dimensional\n\ |
|
|
645 arguments are assumed to equal @code{size (@var{a},@var{i})}.\n\ |
|
|
646 \n\ |
|
|
647 An example of the use of mat2cell is\n\ |
|
|
648 \n\ |
|
|
649 @example\n\ |
|
|
650 @group\n\ |
|
|
651 mat2cell (reshape(1:16,4,4),[3,1],[3,1])\n\ |
|
|
652 @result{} @{\n\ |
|
|
653 [1,1] =\n\ |
|
|
654 \n\ |
|
|
655 1 5 9\n\ |
|
|
656 2 6 10\n\ |
|
|
657 3 7 11\n\ |
|
|
658 \n\ |
|
|
659 [2,1] =\n\ |
|
|
660 \n\ |
|
|
661 4 8 12\n\ |
|
|
662 \n\ |
|
|
663 [1,2] =\n\ |
|
|
664 \n\ |
|
|
665 13\n\ |
|
|
666 14\n\ |
|
|
667 15\n\ |
|
|
668 \n\ |
|
|
669 [2,2] = 16\n\ |
|
|
670 @}\n\ |
|
|
671 @end group\n\ |
|
|
672 @end example\n\ |
|
5829
|
673 @seealso{num2cell, cell2mat}\n\ |
|
5784
|
674 @end deftypefn") |
|
|
675 { |
|
|
676 int nargin = args.length(); |
|
|
677 octave_value retval; |
|
|
678 |
|
|
679 if (nargin < 2) |
|
|
680 usage ("mat2cell"); |
|
|
681 else |
|
|
682 { |
|
|
683 dim_vector dv = args(0).dims(); |
|
|
684 dim_vector new_dv; |
|
|
685 new_dv.resize(dv.length()); |
|
|
686 |
|
|
687 if (nargin > 2) |
|
|
688 { |
|
|
689 octave_idx_type nmax = -1; |
|
|
690 |
|
|
691 if (nargin - 1 != dv.length()) |
|
|
692 error ("mat2cell: Incorrect number of dimensions"); |
|
|
693 else |
|
|
694 { |
|
|
695 for (octave_idx_type j = 0; j < dv.length(); j++) |
|
|
696 { |
|
|
697 ColumnVector d = ColumnVector (args(j+1).vector_value |
|
|
698 (false, true)); |
|
|
699 |
|
|
700 if (d.length() < 1) |
|
|
701 { |
|
|
702 error ("mat2cell: dimension can not be empty"); |
|
|
703 break; |
|
|
704 } |
|
|
705 else |
|
|
706 { |
|
|
707 if (nmax < d.length()) |
|
|
708 nmax = d.length(); |
|
|
709 |
|
|
710 for (octave_idx_type i = 1; i < d.length(); i++) |
|
|
711 { |
|
|
712 OCTAVE_QUIT; |
|
|
713 |
|
|
714 if (d(i) >= 0) |
|
|
715 d(i) += d(i-1); |
|
|
716 else |
|
|
717 { |
|
|
718 error ("mat2cell: invalid dimensional argument"); |
|
|
719 break; |
|
|
720 } |
|
|
721 } |
|
|
722 |
|
|
723 if (d(0) < 0) |
|
|
724 error ("mat2cell: invalid dimensional argument"); |
|
|
725 |
|
|
726 if (d(d.length() - 1) != dv(j)) |
|
|
727 error ("mat2cell: inconsistent dimensions"); |
|
|
728 |
|
|
729 if (error_state) |
|
|
730 break; |
|
|
731 |
|
|
732 new_dv(j) = d.length(); |
|
|
733 } |
|
|
734 } |
|
|
735 } |
|
|
736 |
|
|
737 if (! error_state) |
|
|
738 { |
|
|
739 // Construct a matrix with the index values |
|
|
740 Matrix dimargs(nmax, new_dv.length()); |
|
|
741 for (octave_idx_type j = 0; j < new_dv.length(); j++) |
|
|
742 { |
|
|
743 OCTAVE_QUIT; |
|
|
744 |
|
|
745 ColumnVector d = ColumnVector (args(j+1).vector_value |
|
|
746 (false, true)); |
|
|
747 |
|
|
748 dimargs(0,j) = d(0); |
|
|
749 for (octave_idx_type i = 1; i < d.length(); i++) |
|
|
750 dimargs(i,j) = dimargs(i-1,j) + d(i); |
|
|
751 } |
|
|
752 |
|
|
753 |
|
|
754 octave_value_list lst (new_dv.length(), octave_value()); |
|
|
755 Cell ret (new_dv); |
|
|
756 octave_idx_type nel = new_dv.numel(); |
|
|
757 octave_idx_type ntot = 1; |
|
|
758 |
|
|
759 for (int j = 0; j < new_dv.length()-1; j++) |
|
|
760 ntot *= new_dv(j); |
|
|
761 |
|
|
762 for (octave_idx_type i = 0; i < nel; i++) |
|
|
763 { |
|
|
764 octave_idx_type n = ntot; |
|
|
765 octave_idx_type ii = i; |
|
|
766 for (octave_idx_type j = new_dv.length() - 1; j >= 0; j--) |
|
|
767 { |
|
|
768 OCTAVE_QUIT; |
|
|
769 |
|
|
770 octave_idx_type idx = ii / n; |
|
|
771 lst (j) = Range((idx == 0 ? 1. : dimargs(idx-1,j)+1.), |
|
|
772 dimargs(idx,j)); |
|
|
773 ii = ii % n; |
|
|
774 if (j != 0) |
|
|
775 n /= new_dv(j-1); |
|
|
776 } |
|
|
777 ret(i) = args(0).do_index_op(lst, 0); |
|
|
778 if (error_state) |
|
|
779 break; |
|
|
780 } |
|
|
781 |
|
|
782 if (!error_state) |
|
|
783 retval = ret; |
|
|
784 } |
|
|
785 } |
|
|
786 else |
|
|
787 { |
|
|
788 ColumnVector d = ColumnVector (args(1).vector_value |
|
|
789 (false, true)); |
|
|
790 |
|
|
791 double sumd = 0.; |
|
|
792 for (octave_idx_type i = 0; i < d.length(); i++) |
|
|
793 { |
|
|
794 OCTAVE_QUIT; |
|
|
795 |
|
|
796 if (d(i) >= 0) |
|
|
797 sumd += d(i); |
|
|
798 else |
|
|
799 { |
|
|
800 error ("mat2cell: invalid dimensional argument"); |
|
|
801 break; |
|
|
802 } |
|
|
803 } |
|
|
804 |
|
|
805 if (sumd != dv(0)) |
|
|
806 error ("mat2cell: inconsistent dimensions"); |
|
|
807 |
|
|
808 new_dv(0) = d.length(); |
|
|
809 for (octave_idx_type i = 1; i < dv.length(); i++) |
|
|
810 new_dv(i) = 1; |
|
|
811 |
|
|
812 if (! error_state) |
|
|
813 { |
|
|
814 octave_value_list lst (new_dv.length(), octave_value()); |
|
|
815 Cell ret (new_dv); |
|
|
816 |
|
|
817 for (octave_idx_type i = 1; i < new_dv.length(); i++) |
|
|
818 lst (i) = Range (1., static_cast<double>(dv(i))); |
|
|
819 |
|
|
820 double idx = 0.; |
|
|
821 for (octave_idx_type i = 0; i < new_dv(0); i++) |
|
|
822 { |
|
|
823 OCTAVE_QUIT; |
|
|
824 |
|
|
825 lst(0) = Range(idx + 1., idx + d(i)); |
|
|
826 ret(i) = args(0).do_index_op(lst, 0); |
|
|
827 idx += d(i); |
|
|
828 if (error_state) |
|
|
829 break; |
|
|
830 } |
|
|
831 |
|
|
832 if (!error_state) |
|
|
833 retval = ret; |
|
|
834 } |
|
|
835 } |
|
|
836 } |
|
|
837 |
|
|
838 return retval; |
|
|
839 } |
|
|
840 |
|
|
841 /* |
|
|
842 |
|
|
843 %!test |
|
|
844 %! x = reshape(1:20,5,4); |
|
|
845 %! c = mat2cell(x,[3,2],[3,1]); |
|
|
846 %! assert(c,{[1,6,11;2,7,12;3,8,13],[16;17;18];[4,9,14;5,10,15],[19;20]}) |
|
|
847 |
|
|
848 %!test |
|
|
849 %! x = 'abcdefghij'; |
|
|
850 %! c = mat2cell(x,1,[0,4,2,0,4,0]); |
|
|
851 %! empty1by0str = resize('',1,0); |
|
|
852 %! assert(c,{empty1by0str,'abcd','ef',empty1by0str,'ghij',empty1by0str}) |
|
|
853 |
|
|
854 */ |
|
|
855 |
|
5205
|
856 /* |
|
|
857 ;;; Local Variables: *** |
|
|
858 ;;; mode: C++ *** |
|
|
859 ;;; End: *** |
|
|
860 */ |
