Mercurial > octave
annotate src/DLD-FUNCTIONS/bsxfun.cc @ 9743:26abff55f6fe
optimize bsxfun for common built-in operations
| author | Jaroslav Hajek <highegg@gmail.com> |
|---|---|
| date | Tue, 20 Oct 2009 10:47:22 +0200 |
| parents | cf714e75c656 |
| children | 119d97db51f0 |
| rev | line source |
|---|---|
| 6869 | 1 /* |
| 2 | |
| 8920 | 3 Copyright (C) 2007, 2008, 2009 David Bateman |
| 6869 | 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 | |
| 7016 | 9 Free Software Foundation; either version 3 of the License, or (at your |
| 10 option) any later version. | |
| 6869 | 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 | |
| 7016 | 18 along with Octave; see the file COPYING. If not, see |
| 19 <http://www.gnu.org/licenses/>. | |
| 6869 | 20 |
| 21 */ | |
| 22 | |
| 23 #ifdef HAVE_CONFIG_H | |
| 24 #include <config.h> | |
| 25 #endif | |
| 26 | |
| 27 #include <string> | |
| 28 #include <vector> | |
| 29 #include <list> | |
| 30 | |
| 31 #include "lo-mappers.h" | |
| 32 | |
| 33 #include "oct-map.h" | |
| 34 #include "defun-dld.h" | |
| 35 #include "parse.h" | |
| 36 #include "variables.h" | |
| 37 #include "ov-colon.h" | |
| 38 #include "unwind-prot.h" | |
|
9743
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
39 #include "ov-fcn-handle.h" |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
40 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
41 // Optimized bsxfun operations |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
42 enum bsxfun_builtin_op |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
43 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
44 bsxfun_builtin_plus = 0, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
45 bsxfun_builtin_minus, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
46 bsxfun_builtin_times, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
47 bsxfun_builtin_divide, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
48 bsxfun_builtin_max, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
49 bsxfun_builtin_min, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
50 bsxfun_builtin_eq, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
51 bsxfun_builtin_ne, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
52 bsxfun_builtin_lt, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
53 bsxfun_builtin_le, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
54 bsxfun_builtin_gt, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
55 bsxfun_builtin_ge, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
56 bsxfun_builtin_and, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
57 bsxfun_builtin_or, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
58 bsxfun_builtin_unknown, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
59 bsxfun_num_builtin_ops = bsxfun_builtin_unknown |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
60 }; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
61 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
62 const char *bsxfun_builtin_names[] = |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
63 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
64 "plus", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
65 "minus", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
66 "times", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
67 "rdivide", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
68 "max", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
69 "min", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
70 "eq", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
71 "ne", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
72 "lt", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
73 "le", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
74 "gt", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
75 "ge", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
76 "and", |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
77 "or" |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
78 }; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
79 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
80 static bsxfun_builtin_op |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
81 bsxfun_builtin_lookup (const std::string& name) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
82 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
83 for (int i = 0; i < bsxfun_num_builtin_ops; i++) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
84 if (name == bsxfun_builtin_names[i]) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
85 return static_cast<bsxfun_builtin_op> (i); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
86 return bsxfun_builtin_unknown; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
87 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
88 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
89 typedef octave_value (*bsxfun_handler) (const octave_value&, const octave_value&); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
90 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
91 // Static table of handlers. |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
92 bsxfun_handler bsxfun_handler_table[bsxfun_num_builtin_ops][btyp_num_types]; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
93 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
94 template <class NDA, NDA (bsxfun_op) (const NDA&, const NDA&)> |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
95 static octave_value |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
96 bsxfun_forward_op (const octave_value& x, const octave_value& y) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
97 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
98 NDA xa = octave_value_extract<NDA> (x); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
99 NDA ya = octave_value_extract<NDA> (y); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
100 return octave_value (bsxfun_op (xa, ya)); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
101 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
102 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
103 template <class NDA, boolNDArray (bsxfun_rel) (const NDA&, const NDA&)> |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
104 static octave_value |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
105 bsxfun_forward_rel (const octave_value& x, const octave_value& y) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
106 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
107 NDA xa = octave_value_extract<NDA> (x); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
108 NDA ya = octave_value_extract<NDA> (y); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
109 return octave_value (bsxfun_rel (xa, ya)); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
110 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
111 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
112 static void maybe_fill_table (void) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
113 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
114 static bool filled = false; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
115 if (filled) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
116 return; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
117 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
118 #define REGISTER_OP_HANDLER(OP, BTYP, NDA, FUNOP) \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
119 bsxfun_handler_table[OP][BTYP] = bsxfun_forward_op<NDA, FUNOP> |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
120 #define REGISTER_REL_HANDLER(REL, BTYP, NDA, FUNREL) \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
121 bsxfun_handler_table[REL][BTYP] = bsxfun_forward_rel<NDA, FUNREL> |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
122 #define REGISTER_STD_HANDLERS(BTYP, NDA) \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
123 REGISTER_OP_HANDLER (bsxfun_builtin_plus, BTYP, NDA, bsxfun_add); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
124 REGISTER_OP_HANDLER (bsxfun_builtin_minus, BTYP, NDA, bsxfun_sub); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
125 REGISTER_OP_HANDLER (bsxfun_builtin_times, BTYP, NDA, bsxfun_mul); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
126 REGISTER_OP_HANDLER (bsxfun_builtin_divide, BTYP, NDA, bsxfun_div); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
127 REGISTER_OP_HANDLER (bsxfun_builtin_max, BTYP, NDA, bsxfun_max); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
128 REGISTER_OP_HANDLER (bsxfun_builtin_min, BTYP, NDA, bsxfun_min); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
129 REGISTER_REL_HANDLER (bsxfun_builtin_eq, BTYP, NDA, bsxfun_eq); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
130 REGISTER_REL_HANDLER (bsxfun_builtin_ne, BTYP, NDA, bsxfun_ne); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
131 REGISTER_REL_HANDLER (bsxfun_builtin_lt, BTYP, NDA, bsxfun_lt); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
132 REGISTER_REL_HANDLER (bsxfun_builtin_le, BTYP, NDA, bsxfun_le); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
133 REGISTER_REL_HANDLER (bsxfun_builtin_gt, BTYP, NDA, bsxfun_gt); \ |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
134 REGISTER_REL_HANDLER (bsxfun_builtin_ge, BTYP, NDA, bsxfun_ge) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
135 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
136 REGISTER_STD_HANDLERS (btyp_double, NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
137 REGISTER_STD_HANDLERS (btyp_float, FloatNDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
138 REGISTER_STD_HANDLERS (btyp_complex, ComplexNDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
139 REGISTER_STD_HANDLERS (btyp_float_complex, FloatComplexNDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
140 REGISTER_STD_HANDLERS (btyp_int8, int8NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
141 REGISTER_STD_HANDLERS (btyp_int16, int16NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
142 REGISTER_STD_HANDLERS (btyp_int32, int32NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
143 REGISTER_STD_HANDLERS (btyp_int64, int64NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
144 REGISTER_STD_HANDLERS (btyp_uint8, uint8NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
145 REGISTER_STD_HANDLERS (btyp_uint16, uint16NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
146 REGISTER_STD_HANDLERS (btyp_uint32, uint32NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
147 REGISTER_STD_HANDLERS (btyp_uint64, uint64NDArray); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
148 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
149 // For bools, we register and/or. |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
150 REGISTER_OP_HANDLER (bsxfun_builtin_and, btyp_bool, boolNDArray, bsxfun_and); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
151 REGISTER_OP_HANDLER (bsxfun_builtin_or, btyp_bool, boolNDArray, bsxfun_or); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
152 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
153 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
154 static octave_value |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
155 maybe_optimized_builtin (const std::string& name, |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
156 const octave_value& a, const octave_value& b) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
157 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
158 octave_value retval; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
159 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
160 maybe_fill_table (); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
161 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
162 bsxfun_builtin_op op = bsxfun_builtin_lookup (name); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
163 if (op != bsxfun_builtin_unknown) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
164 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
165 builtin_type_t btyp_a = a.builtin_type (), btyp_b = b.builtin_type (); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
166 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
167 // Simplify single/double combinations. |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
168 if (btyp_a == btyp_float && btyp_b == btyp_double) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
169 btyp_b = btyp_float; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
170 else if (btyp_a == btyp_double && btyp_b == btyp_float) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
171 btyp_a = btyp_float; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
172 else if (btyp_a == btyp_float_complex && btyp_b == btyp_complex) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
173 btyp_b = btyp_float_complex; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
174 else if (btyp_a == btyp_complex && btyp_b == btyp_float_complex) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
175 btyp_a = btyp_float_complex; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
176 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
177 if (btyp_a == btyp_b && btyp_a != btyp_unknown) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
178 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
179 bsxfun_handler handler = bsxfun_handler_table[op][btyp_a]; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
180 if (handler) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
181 retval = handler (a, b); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
182 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
183 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
184 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
185 return retval; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
186 } |
| 6869 | 187 |
| 188 static bool | |
| 189 maybe_update_column (octave_value& Ac, const octave_value& A, | |
| 190 const dim_vector& dva, const dim_vector& dvc, | |
| 191 octave_idx_type i, octave_value_list &idx) | |
| 192 { | |
| 193 octave_idx_type nd = dva.length (); | |
| 194 | |
| 195 if (i == 0) | |
| 196 { | |
| 197 idx(0) = octave_value (':'); | |
| 198 for (octave_idx_type j = 1; j < nd; j++) | |
| 199 { | |
| 200 if (dva (j) == 1) | |
| 201 idx (j) = octave_value (1); | |
| 202 else | |
| 203 idx (j) = octave_value ((i % dvc(j)) + 1); | |
| 204 | |
| 205 i = i / dvc (j); | |
| 206 } | |
| 207 | |
| 208 Ac = A; | |
| 209 Ac = Ac.single_subsref ("(", idx); | |
| 210 return true; | |
| 211 } | |
| 212 else | |
| 213 { | |
| 214 bool is_changed = false; | |
| 215 octave_idx_type k = i; | |
| 216 octave_idx_type k1 = i - 1; | |
| 217 for (octave_idx_type j = 1; j < nd; j++) | |
| 218 { | |
| 219 if (dva(j) != 1 && k % dvc (j) != k1 % dvc (j)) | |
| 220 { | |
| 221 idx (j) = octave_value ((k % dvc(j)) + 1); | |
| 222 is_changed = true; | |
| 223 } | |
| 224 | |
| 225 k = k / dvc (j); | |
| 226 k1 = k1 / dvc (j); | |
| 227 } | |
| 228 | |
| 229 if (is_changed) | |
| 230 { | |
| 231 Ac = A; | |
| 232 Ac = Ac.single_subsref ("(", idx); | |
| 233 return true; | |
| 234 } | |
| 235 else | |
| 236 return false; | |
| 237 } | |
| 238 } | |
| 239 | |
| 6959 | 240 #if 0 |
| 241 // FIXME -- this function is not used; is it OK to delete it? | |
| 6869 | 242 static void |
| 243 update_index (octave_value_list& idx, const dim_vector& dv, octave_idx_type i) | |
| 244 { | |
| 245 octave_idx_type nd = dv.length (); | |
| 246 | |
| 247 if (i == 0) | |
| 248 { | |
| 249 for (octave_idx_type j = nd - 1; j > 0; j--) | |
| 250 idx(j) = octave_value (static_cast<double>(1)); | |
| 251 idx(0) = octave_value (':'); | |
| 252 } | |
| 253 else | |
| 254 { | |
| 255 for (octave_idx_type j = 1; j < nd; j++) | |
| 256 { | |
| 257 idx (j) = octave_value (i % dv (j) + 1); | |
| 258 i = i / dv (j); | |
| 259 } | |
| 260 } | |
| 261 } | |
| 6959 | 262 #endif |
| 6869 | 263 |
| 264 static void | |
| 265 update_index (Array<int>& idx, const dim_vector& dv, octave_idx_type i) | |
| 266 { | |
| 267 octave_idx_type nd = dv.length (); | |
| 268 | |
| 269 idx(0) = 0; | |
| 270 for (octave_idx_type j = 1; j < nd; j++) | |
| 271 { | |
| 272 idx (j) = i % dv (j); | |
| 273 i = i / dv (j); | |
| 274 } | |
| 275 } | |
| 276 | |
| 6959 | 277 DEFUN_DLD (bsxfun, args, , |
| 8715 | 278 "-*- texinfo -*-\n\ |
| 7001 | 279 @deftypefn {Loadable Function} {} bsxfun (@var{f}, @var{a}, @var{b})\n\ |
| 6869 | 280 Applies a binary function @var{f} element-wise to two matrix arguments\n\ |
|
9041
853f96e8008f
Cleanup documentation file matrix.texi
Rik <rdrider0-list@yahoo.com>
parents:
8920
diff
changeset
|
281 @var{a} and @var{b}. The function @var{f} must be capable of accepting\n\ |
| 6869 | 282 two column vector arguments of equal length, or one column vector\n\ |
| 283 argument and a scalar.\n\ | |
| 284 \n\ | |
|
9041
853f96e8008f
Cleanup documentation file matrix.texi
Rik <rdrider0-list@yahoo.com>
parents:
8920
diff
changeset
|
285 The dimensions of @var{a} and @var{b} must be equal or singleton. The\n\ |
| 7001 | 286 singleton dimensions of the matrices will be expanded to the same\n\ |
| 6881 | 287 dimensionality as the other matrix.\n\ |
| 6869 | 288 \n\ |
| 289 @seealso{arrayfun, cellfun}\n\ | |
| 290 @end deftypefn") | |
| 291 { | |
| 292 int nargin = args.length (); | |
| 293 octave_value_list retval; | |
| 294 | |
| 295 if (nargin != 3) | |
| 296 print_usage (); | |
| 297 else | |
| 298 { | |
|
9450
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
299 octave_value func = args(0); |
| 6869 | 300 |
|
9450
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
301 if (func.is_string ()) |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
302 { |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
303 std::string name = func.string_value (); |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
304 func = symbol_table::find_function (name); |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
305 if (func.is_undefined ()) |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
306 error ("bsxfun: invalid function name: %s", name.c_str ()); |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
307 } |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
308 else if (! (args(0).is_function_handle () || args(0).is_inline_function ())) |
|
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
309 error ("bsxfun: first argument must be a string or function handle"); |
| 6869 | 310 |
|
9743
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
311 const octave_value A = args (1); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
312 const octave_value B = args (2); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
313 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
314 if (func.is_builtin_function () |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
315 || (func.is_function_handle () |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
316 && ! func.fcn_handle_value ()->is_overloaded () |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
317 && ! A.is_object () && ! B.is_object ())) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
318 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
319 octave_function *fcn_val = func.function_value (); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
320 if (fcn_val) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
321 { |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
322 octave_value tmp = maybe_optimized_builtin (fcn_val->name (), A, B); |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
323 if (tmp.is_defined ()) |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
324 retval(0) = tmp; |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
325 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
326 } |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
327 |
|
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9450
diff
changeset
|
328 if (! error_state && retval.empty ()) |
| 6869 | 329 { |
| 330 dim_vector dva = A.dims (); | |
| 331 octave_idx_type nda = dva.length (); | |
| 332 dim_vector dvb = B.dims (); | |
| 333 octave_idx_type ndb = dvb.length (); | |
| 334 octave_idx_type nd = nda; | |
| 335 | |
| 336 if (nda > ndb) | |
| 337 dvb.resize (nda, 1); | |
| 338 else if (nda < ndb) | |
| 339 { | |
| 340 dva.resize (ndb, 1); | |
| 341 nd = ndb; | |
| 342 } | |
| 343 | |
| 344 for (octave_idx_type i = 0; i < nd; i++) | |
| 345 if (dva (i) != dvb (i) && dva (i) != 1 && dvb (i) != 1) | |
| 346 { | |
| 347 error ("bsxfun: dimensions don't match"); | |
| 348 break; | |
| 349 } | |
| 350 | |
| 351 if (!error_state) | |
| 352 { | |
| 353 // Find the size of the output | |
| 354 dim_vector dvc; | |
| 355 dvc.resize (nd); | |
| 356 | |
| 357 for (octave_idx_type i = 0; i < nd; i++) | |
| 358 dvc (i) = (dva (i) < 1 ? dva (i) : (dvb (i) < 1 ? dvb (i) : | |
| 359 (dva (i) > dvb (i) ? dva (i) : dvb (i)))); | |
| 360 | |
| 361 if (dva == dvb || dva.numel () == 1 || dvb.numel () == 1) | |
| 362 { | |
| 363 octave_value_list inputs; | |
| 364 inputs (0) = A; | |
| 365 inputs (1) = B; | |
|
9450
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
366 retval = func.do_multi_index_op (1, inputs); |
| 6869 | 367 } |
| 368 else if (dvc.numel () < 1) | |
| 369 { | |
| 370 octave_value_list inputs; | |
| 371 inputs (0) = A.resize (dvc); | |
| 372 inputs (1) = B.resize (dvc); | |
|
9450
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
373 retval = func.do_multi_index_op (1, inputs); |
| 6869 | 374 } |
| 375 else | |
| 376 { | |
| 377 octave_idx_type ncount = 1; | |
| 378 for (octave_idx_type i = 1; i < nd; i++) | |
| 379 ncount *= dvc (i); | |
| 380 | |
| 381 #define BSXDEF(T) \ | |
| 382 T result_ ## T; \ | |
| 383 bool have_ ## T = false; | |
| 384 | |
| 385 BSXDEF(NDArray); | |
| 386 BSXDEF(ComplexNDArray); | |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
387 BSXDEF(FloatNDArray); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
388 BSXDEF(FloatComplexNDArray); |
| 6869 | 389 BSXDEF(boolNDArray); |
| 390 BSXDEF(int8NDArray); | |
| 391 BSXDEF(int16NDArray); | |
| 392 BSXDEF(int32NDArray); | |
| 393 BSXDEF(int64NDArray); | |
| 394 BSXDEF(uint8NDArray); | |
| 395 BSXDEF(uint16NDArray); | |
| 396 BSXDEF(uint32NDArray); | |
| 397 BSXDEF(uint64NDArray); | |
| 398 | |
| 399 octave_value Ac ; | |
| 400 octave_value_list idxA; | |
| 401 octave_value Bc; | |
| 402 octave_value_list idxB; | |
| 403 octave_value C; | |
| 404 octave_value_list inputs; | |
| 405 Array<int> ra_idx (dvc.length(), 0); | |
| 406 | |
| 407 | |
| 408 for (octave_idx_type i = 0; i < ncount; i++) | |
| 409 { | |
| 410 if (maybe_update_column (Ac, A, dva, dvc, i, idxA)) | |
| 411 inputs (0) = Ac; | |
| 412 | |
| 413 if (maybe_update_column (Bc, B, dvb, dvc, i, idxB)) | |
| 414 inputs (1) = Bc; | |
| 415 | |
|
9450
cf714e75c656
implement overloaded function handles
Jaroslav Hajek <highegg@gmail.com>
parents:
9041
diff
changeset
|
416 octave_value_list tmp = func.do_multi_index_op (1, inputs); |
| 6869 | 417 |
| 418 if (error_state) | |
| 419 break; | |
| 420 | |
| 421 #define BSXINIT(T, CLS, EXTRACTOR) \ | |
| 422 (result_type == CLS) \ | |
| 423 { \ | |
| 424 have_ ## T = true; \ | |
| 425 result_ ## T = \ | |
| 426 tmp (0). EXTRACTOR ## _array_value (); \ | |
| 427 result_ ## T .resize (dvc); \ | |
| 428 } | |
| 429 | |
| 430 if (i == 0) | |
| 431 { | |
| 432 if (! tmp(0).is_sparse_type ()) | |
| 433 { | |
| 434 std::string result_type = tmp(0).class_name (); | |
| 435 if (result_type == "double") | |
| 436 { | |
| 437 if (tmp(0).is_real_type ()) | |
| 438 { | |
| 439 have_NDArray = true; | |
| 440 result_NDArray = tmp(0).array_value (); | |
| 441 result_NDArray.resize (dvc); | |
| 442 } | |
| 443 else | |
| 444 { | |
| 445 have_ComplexNDArray = true; | |
| 446 result_ComplexNDArray = | |
| 447 tmp(0).complex_array_value (); | |
| 448 result_ComplexNDArray.resize (dvc); | |
| 449 } | |
| 450 } | |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
451 else if (result_type == "single") |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
452 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
453 if (tmp(0).is_real_type ()) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
454 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
455 have_FloatNDArray = true; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
456 result_FloatNDArray = tmp(0).float_array_value (); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
457 result_FloatNDArray.resize (dvc); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
458 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
459 else |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
460 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
461 have_ComplexNDArray = true; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
462 result_ComplexNDArray = |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
463 tmp(0).complex_array_value (); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
464 result_ComplexNDArray.resize (dvc); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
465 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
466 } |
| 6869 | 467 else if BSXINIT(boolNDArray, "logical", bool) |
| 468 else if BSXINIT(int8NDArray, "int8", int8) | |
| 469 else if BSXINIT(int16NDArray, "int16", int16) | |
| 470 else if BSXINIT(int32NDArray, "int32", int32) | |
| 471 else if BSXINIT(int64NDArray, "int64", int64) | |
| 472 else if BSXINIT(uint8NDArray, "uint8", uint8) | |
| 473 else if BSXINIT(uint16NDArray, "uint16", uint16) | |
| 474 else if BSXINIT(uint32NDArray, "uint32", uint32) | |
| 475 else if BSXINIT(uint64NDArray, "uint64", uint64) | |
| 476 else | |
| 477 { | |
| 478 C = tmp (0); | |
| 479 C = C.resize (dvc); | |
| 480 } | |
| 481 } | |
| 482 } | |
| 483 else | |
| 484 { | |
| 485 update_index (ra_idx, dvc, i); | |
| 486 | |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
487 if (have_FloatNDArray || |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
488 have_FloatComplexNDArray) |
| 6869 | 489 { |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
490 if (! tmp(0).is_float_type ()) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
491 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
492 if (have_FloatNDArray) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
493 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
494 have_FloatNDArray = false; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
495 C = result_FloatNDArray; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
496 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
497 else |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
498 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
499 have_FloatComplexNDArray = false; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
500 C = result_FloatComplexNDArray; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
501 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
502 C = do_cat_op (C, tmp(0), ra_idx); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
503 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
504 else if (tmp(0).is_double_type ()) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
505 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
506 if (tmp(0).is_complex_type () && |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
507 have_FloatNDArray) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
508 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
509 result_ComplexNDArray = |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
510 ComplexNDArray (result_FloatNDArray); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
511 result_ComplexNDArray.insert |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
512 (tmp(0).complex_array_value(), ra_idx); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
513 have_FloatComplexNDArray = false; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
514 have_ComplexNDArray = true; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
515 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
516 else |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
517 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
518 result_NDArray = |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
519 NDArray (result_FloatNDArray); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
520 result_NDArray.insert |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
521 (tmp(0).array_value(), ra_idx); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
522 have_FloatNDArray = false; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
523 have_NDArray = true; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
524 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
525 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
526 else if (tmp(0).is_real_type ()) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
527 result_FloatNDArray.insert |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
528 (tmp(0).float_array_value(), ra_idx); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
529 else |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
530 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
531 result_FloatComplexNDArray = |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
532 FloatComplexNDArray (result_FloatNDArray); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
533 result_FloatComplexNDArray.insert |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
534 (tmp(0).float_complex_array_value(), ra_idx); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
535 have_FloatNDArray = false; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
536 have_FloatComplexNDArray = true; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
537 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
538 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
539 else if (have_NDArray) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
540 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
541 if (! tmp(0).is_float_type ()) |
| 6869 | 542 { |
| 543 have_NDArray = false; | |
| 544 C = result_NDArray; | |
| 545 C = do_cat_op (C, tmp(0), ra_idx); | |
| 546 } | |
| 547 else if (tmp(0).is_real_type ()) | |
| 548 result_NDArray.insert (tmp(0).array_value(), | |
| 549 ra_idx); | |
| 550 else | |
| 551 { | |
| 552 result_ComplexNDArray = | |
| 553 ComplexNDArray (result_NDArray); | |
| 554 result_ComplexNDArray.insert | |
| 555 (tmp(0).complex_array_value(), ra_idx); | |
| 556 have_NDArray = false; | |
| 557 have_ComplexNDArray = true; | |
| 558 } | |
| 559 } | |
| 560 | |
| 561 #define BSXLOOP(T, CLS, EXTRACTOR) \ | |
| 562 (have_ ## T) \ | |
| 563 { \ | |
| 564 if (tmp (0).class_name () != CLS) \ | |
| 565 { \ | |
| 566 have_ ## T = false; \ | |
| 567 C = result_ ## T; \ | |
| 568 C = do_cat_op (C, tmp (0), ra_idx); \ | |
| 569 } \ | |
| 570 else \ | |
| 571 result_ ## T .insert \ | |
| 572 (tmp(0). EXTRACTOR ## _array_value (), \ | |
| 573 ra_idx); \ | |
| 574 } | |
| 575 | |
| 576 else if BSXLOOP(ComplexNDArray, "double", complex) | |
| 577 else if BSXLOOP(boolNDArray, "logical", bool) | |
| 578 else if BSXLOOP(int8NDArray, "int8", int8) | |
| 579 else if BSXLOOP(int16NDArray, "int16", int16) | |
| 580 else if BSXLOOP(int32NDArray, "int32", int32) | |
| 581 else if BSXLOOP(int64NDArray, "int64", int64) | |
| 582 else if BSXLOOP(uint8NDArray, "uint8", uint8) | |
| 583 else if BSXLOOP(uint16NDArray, "uint16", uint16) | |
| 584 else if BSXLOOP(uint32NDArray, "uint32", uint32) | |
| 585 else if BSXLOOP(uint64NDArray, "uint64", uint64) | |
| 586 else | |
| 587 C = do_cat_op (C, tmp(0), ra_idx); | |
| 588 } | |
| 589 } | |
| 590 | |
| 591 #define BSXEND(T) \ | |
| 592 (have_ ## T) \ | |
| 593 retval (0) = result_ ## T; | |
| 594 | |
| 595 if BSXEND(NDArray) | |
| 596 else if BSXEND(ComplexNDArray) | |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
597 else if BSXEND(FloatNDArray) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7016
diff
changeset
|
598 else if BSXEND(FloatComplexNDArray) |
| 6869 | 599 else if BSXEND(boolNDArray) |
| 600 else if BSXEND(int8NDArray) | |
| 601 else if BSXEND(int16NDArray) | |
| 602 else if BSXEND(int32NDArray) | |
| 603 else if BSXEND(int64NDArray) | |
| 604 else if BSXEND(uint8NDArray) | |
| 605 else if BSXEND(uint16NDArray) | |
| 606 else if BSXEND(uint32NDArray) | |
| 607 else if BSXEND(uint64NDArray) | |
| 608 else | |
| 609 retval(0) = C; | |
| 610 } | |
| 611 } | |
| 612 } | |
| 613 } | |
| 614 | |
| 615 return retval; | |
| 616 } | |
| 617 | |
| 618 /* | |
| 619 | |
| 620 %!shared a, b, c, f | |
| 621 %! a = randn (4, 4); | |
| 622 %! b = mean (a, 1); | |
| 623 %! c = mean (a, 2); | |
| 624 %! f = @minus; | |
| 625 %!error(bsxfun (f)); | |
| 626 %!error(bsxfun (f, a)); | |
| 627 %!error(bsxfun (a, b)); | |
| 628 %!error(bsxfun (a, b, c)); | |
| 629 %!error(bsxfun (f, a, b, c)); | |
| 630 %!error(bsxfun (f, ones(4, 0), ones(4, 4))) | |
| 631 %!assert(bsxfun (f, ones(4, 0), ones(4, 1)), zeros(4, 0)); | |
| 632 %!assert(bsxfun (f, ones(1, 4), ones(4, 1)), zeros(4, 4)); | |
| 633 %!assert(bsxfun (f, a, b), a - repmat(b, 4, 1)); | |
| 634 %!assert(bsxfun (f, a, c), a - repmat(c, 1, 4)); | |
| 635 %!assert(bsxfun ("minus", ones(1, 4), ones(4, 1)), zeros(4, 4)); | |
| 636 | |
| 637 %!shared a, b, c, f | |
| 638 %! a = randn (4, 4); | |
| 639 %! a(1) *= 1i; | |
| 640 %! b = mean (a, 1); | |
| 641 %! c = mean (a, 2); | |
| 642 %! f = @minus; | |
| 643 %!error(bsxfun (f)); | |
| 644 %!error(bsxfun (f, a)); | |
| 645 %!error(bsxfun (a, b)); | |
| 646 %!error(bsxfun (a, b, c)); | |
| 647 %!error(bsxfun (f, a, b, c)); | |
| 648 %!error(bsxfun (f, ones(4, 0), ones(4, 4))) | |
| 649 %!assert(bsxfun (f, ones(4, 0), ones(4, 1)), zeros(4, 0)); | |
| 650 %!assert(bsxfun (f, ones(1, 4), ones(4, 1)), zeros(4, 4)); | |
| 651 %!assert(bsxfun (f, a, b), a - repmat(b, 4, 1)); | |
| 652 %!assert(bsxfun (f, a, c), a - repmat(c, 1, 4)); | |
| 653 %!assert(bsxfun ("minus", ones(1, 4), ones(4, 1)), zeros(4, 4)); | |
| 654 | |
| 655 %!shared a, b, c, f | |
| 656 %! a = randn (4, 4); | |
| 657 %! a(end) *= 1i; | |
| 658 %! b = mean (a, 1); | |
| 659 %! c = mean (a, 2); | |
| 660 %! f = @minus; | |
| 661 %!error(bsxfun (f)); | |
| 662 %!error(bsxfun (f, a)); | |
| 663 %!error(bsxfun (a, b)); | |
| 664 %!error(bsxfun (a, b, c)); | |
| 665 %!error(bsxfun (f, a, b, c)); | |
| 666 %!error(bsxfun (f, ones(4, 0), ones(4, 4))) | |
| 667 %!assert(bsxfun (f, ones(4, 0), ones(4, 1)), zeros(4, 0)); | |
| 668 %!assert(bsxfun (f, ones(1, 4), ones(4, 1)), zeros(4, 4)); | |
| 669 %!assert(bsxfun (f, a, b), a - repmat(b, 4, 1)); | |
| 670 %!assert(bsxfun (f, a, c), a - repmat(c, 1, 4)); | |
| 671 %!assert(bsxfun ("minus", ones(1, 4), ones(4, 1)), zeros(4, 4)); | |
| 672 | |
| 673 %!shared a, b, c, f | |
| 674 %! a = randn (4, 4); | |
| 675 %! b = a (1, :); | |
| 676 %! c = a (:, 1); | |
| 677 %! f = @(x, y) x == y; | |
| 678 %!error(bsxfun (f)); | |
| 679 %!error(bsxfun (f, a)); | |
| 680 %!error(bsxfun (a, b)); | |
| 681 %!error(bsxfun (a, b, c)); | |
| 682 %!error(bsxfun (f, a, b, c)); | |
| 683 %!error(bsxfun (f, ones(4, 0), ones(4, 4))) | |
| 684 %!assert(bsxfun (f, ones(4, 0), ones(4, 1)), zeros(4, 0, "logical")); | |
| 685 %!assert(bsxfun (f, ones(1, 4), ones(4, 1)), ones(4, 4, "logical")); | |
| 686 %!assert(bsxfun (f, a, b), a == repmat(b, 4, 1)); | |
| 687 %!assert(bsxfun (f, a, c), a == repmat(c, 1, 4)); | |
| 688 | |
| 689 %!shared a, b, c, d, f | |
| 690 %! a = randn (4, 4, 4); | |
| 691 %! b = mean (a, 1); | |
| 692 %! c = mean (a, 2); | |
| 693 %! d = mean (a, 3); | |
| 694 %! f = @minus; | |
| 695 %!error(bsxfun (f, ones([4, 0, 4]), ones([4, 4, 4]))); | |
| 696 %!assert(bsxfun (f, ones([4, 0, 4]), ones([4, 1, 4])), zeros([4, 0, 4])); | |
| 697 %!assert(bsxfun (f, ones([4, 4, 0]), ones([4, 1, 1])), zeros([4, 4, 0])); | |
| 698 %!assert(bsxfun (f, ones([1, 4, 4]), ones([4, 1, 4])), zeros([4, 4, 4])); | |
| 699 %!assert(bsxfun (f, ones([4, 4, 1]), ones([4, 1, 4])), zeros([4, 4, 4])); | |
| 700 %!assert(bsxfun (f, ones([4, 1, 4]), ones([1, 4, 4])), zeros([4, 4, 4])); | |
| 701 %!assert(bsxfun (f, ones([4, 1, 4]), ones([1, 4, 1])), zeros([4, 4, 4])); | |
| 702 %!assert(bsxfun (f, a, b), a - repmat(b, [4, 1, 1])); | |
| 703 %!assert(bsxfun (f, a, c), a - repmat(c, [1, 4, 1])); | |
| 704 %!assert(bsxfun (f, a, d), a - repmat(d, [1, 1, 4])); | |
| 705 %!assert(bsxfun ("minus", ones([4, 0, 4]), ones([4, 1, 4])), zeros([4, 0, 4])); | |
| 706 | |
| 707 %% The below is a very hard case to treat | |
| 708 %!assert(bsxfun (f, ones([4, 1, 4, 1]), ones([1, 4, 1, 4])), zeros([4, 4, 4, 4])); | |
| 709 | |
| 710 */ |