4508
|
1 /* |
|
2 |
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
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 |
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
20 |
|
21 */ |
|
22 |
|
23 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
24 #pragma implementation |
|
25 #endif |
|
26 |
|
27 #ifdef HAVE_CONFIG_H |
|
28 #include <config.h> |
|
29 #endif |
|
30 |
|
31 #include "MArrayN.h" |
4669
|
32 #include "Array-util.h" |
4508
|
33 #include "ArrayN-idx.h" |
|
34 #include "lo-error.h" |
|
35 |
|
36 #include "MArray-defs.h" |
|
37 |
4513
|
38 // N-dimensional array with math ops. |
4508
|
39 |
|
40 // Element by element MArrayN by scalar ops. |
|
41 |
|
42 template <class T> |
|
43 MArrayN<T>& |
|
44 operator += (MArrayN<T>& a, const T& s) |
|
45 { |
4646
|
46 DO_VS_OP2 (T, a, +=, s) |
4508
|
47 return a; |
|
48 } |
|
49 |
|
50 template <class T> |
|
51 MArrayN<T>& |
|
52 operator -= (MArrayN<T>& a, const T& s) |
|
53 { |
4646
|
54 DO_VS_OP2 (T, a, -=, s) |
4508
|
55 return a; |
|
56 } |
|
57 |
4543
|
58 // Element by element MArrayN by MArrayN ops. |
|
59 |
|
60 template <class T> |
|
61 MArrayN<T>& |
|
62 operator += (MArrayN<T>& a, const MArrayN<T>& b) |
|
63 { |
|
64 int l = a.length (); |
4645
|
65 |
4543
|
66 if (l > 0) |
|
67 { |
4645
|
68 dim_vector a_dims = a.dims (); |
|
69 dim_vector b_dims = b.dims (); |
|
70 |
|
71 if (a_dims != b_dims) |
|
72 gripe_nonconformant ("operator +=", a_dims, b_dims); |
4543
|
73 else |
4646
|
74 DO_VV_OP2 (T, a, +=, b); |
4543
|
75 } |
4645
|
76 |
4543
|
77 return a; |
|
78 } |
|
79 |
|
80 template <class T> |
|
81 MArrayN<T>& |
|
82 operator -= (MArrayN<T>& a, const MArrayN<T>& b) |
|
83 { |
|
84 int l = a.length (); |
4645
|
85 |
4543
|
86 if (l > 0) |
|
87 { |
4645
|
88 dim_vector a_dims = a.dims (); |
|
89 dim_vector b_dims = b.dims (); |
|
90 |
|
91 if (a_dims != b_dims) |
|
92 gripe_nonconformant ("operator -=", a_dims, b_dims); |
4543
|
93 else |
4646
|
94 DO_VV_OP2 (T, a, -=, b); |
4543
|
95 } |
|
96 return a; |
|
97 } |
|
98 |
|
99 // Element by element MArrayN by scalar ops. |
|
100 |
4508
|
101 #define MARRAYN_NDS_OP(OP) \ |
|
102 template <class T> \ |
|
103 MArrayN<T> \ |
|
104 operator OP (const MArrayN<T>& a, const T& s) \ |
|
105 { \ |
|
106 MArrayN<T> result (a.dims ()); \ |
|
107 T *r = result.fortran_vec (); \ |
|
108 int l = a.length (); \ |
|
109 const T *v = a.data (); \ |
|
110 DO_VS_OP (r, l, v, OP, s); \ |
|
111 return result; \ |
|
112 } |
|
113 |
|
114 MARRAYN_NDS_OP (+) |
|
115 MARRAYN_NDS_OP (-) |
|
116 MARRAYN_NDS_OP (*) |
|
117 MARRAYN_NDS_OP (/) |
|
118 |
|
119 // Element by element MArrayN by scalar ops. |
|
120 |
|
121 #define MARRAYN_SND_OP(OP) \ |
|
122 template <class T> \ |
|
123 MArrayN<T> \ |
|
124 operator OP (const T& s, const MArrayN<T>& a) \ |
|
125 { \ |
|
126 MArrayN<T> result (a.dims ()); \ |
|
127 T *r = result.fortran_vec (); \ |
|
128 int l = a.length (); \ |
|
129 const T *v = a.data (); \ |
|
130 DO_SV_OP (r, l, s, OP, v); \ |
|
131 return result; \ |
|
132 } |
|
133 |
|
134 MARRAYN_SND_OP (+) |
|
135 MARRAYN_SND_OP (-) |
|
136 MARRAYN_SND_OP (*) |
|
137 MARRAYN_SND_OP (/) |
|
138 |
|
139 #define MARRAY_NDND_OP(FCN, OP) \ |
|
140 template <class T> \ |
|
141 MArrayN<T> \ |
|
142 FCN (const MArrayN<T>& a, const MArrayN<T>& b) \ |
|
143 { \ |
4513
|
144 dim_vector a_dims = a.dims (); \ |
|
145 dim_vector b_dims = b.dims (); \ |
4508
|
146 int dims_ok = 1; \ |
|
147 int any_dims_zero = 0; \ |
|
148 if (a_dims.length () != b_dims.length ()) \ |
|
149 dims_ok = 0; \ |
|
150 else \ |
|
151 { \ |
|
152 for (int i = 0; i < a_dims.length (); i++) \ |
|
153 { \ |
|
154 if (a_dims (i) != b_dims (i)) \ |
|
155 { dims_ok = 0; break; } \ |
|
156 if (a_dims (i) == 0) \ |
|
157 any_dims_zero = 1; \ |
|
158 } \ |
|
159 } \ |
|
160 if (!dims_ok) \ |
|
161 { \ |
|
162 gripe_nonconformant (#FCN, a_dims, b_dims); \ |
|
163 return MArrayN<T> (); \ |
|
164 } \ |
|
165 if (any_dims_zero) \ |
|
166 return MArrayN<T> (a_dims); \ |
|
167 int l = a.length (); \ |
|
168 MArrayN<T> result (a_dims); \ |
|
169 T* r = result.fortran_vec (); \ |
|
170 const T *x = a.data (); \ |
|
171 const T *y = b.data (); \ |
|
172 DO_VV_OP (r, l, x, OP, y); \ |
|
173 return result; \ |
|
174 } |
|
175 |
|
176 MARRAY_NDND_OP (operator +, +) |
|
177 MARRAY_NDND_OP (operator -, -) |
4543
|
178 MARRAY_NDND_OP (product, *) |
|
179 MARRAY_NDND_OP (quotient, /) |
4508
|
180 |
|
181 template <class T> |
|
182 MArrayN<T> |
|
183 operator + (const MArrayN<T>& a) |
|
184 { |
|
185 return a; |
|
186 } |
|
187 |
|
188 template <class T> |
|
189 MArrayN<T> |
|
190 operator - (const MArrayN<T>& a) |
|
191 { |
|
192 int l = a.length (); |
|
193 MArrayN<T> result (a.dims ()); |
|
194 T *r = result.fortran_vec (); |
|
195 const T *x = a.data (); |
|
196 NEG_V (r, l, x); |
|
197 return result; |
|
198 } |
|
199 |
|
200 /* |
|
201 ;;; Local Variables: *** |
|
202 ;;; mode: C++ *** |
|
203 ;;; End: *** |
|
204 */ |