|
5164
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 2004 David Bateman |
|
|
4 Copyright (C) 1998-2004 Andy Adler |
|
|
5 |
|
|
6 Octave is free software; you can redistribute it and/or modify it |
|
|
7 under the terms of the GNU General Public License as published by the |
|
|
8 Free Software Foundation; either version 2, or (at your option) any |
|
|
9 later version. |
|
|
10 |
|
|
11 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
14 for more details. |
|
|
15 |
|
|
16 You should have received a copy of the GNU General Public License |
|
5307
|
17 along with this program; see the file COPYING. If not, write to the |
|
|
18 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
|
|
19 Boston, MA 02110-1301, USA. |
|
5164
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #ifdef HAVE_CONFIG_H |
|
|
24 #include <config.h> |
|
|
25 #endif |
|
|
26 |
|
|
27 #include "quit.h" |
|
|
28 #include "lo-error.h" |
|
|
29 #include "MArray2.h" |
|
|
30 #include "Array-util.h" |
|
|
31 |
|
|
32 #include "MSparse.h" |
|
|
33 #include "MSparse-defs.h" |
|
|
34 |
|
|
35 // sparse array with math ops. |
|
|
36 |
|
|
37 // Element by element MSparse by MSparse ops. |
|
|
38 |
|
|
39 template <class T> |
|
|
40 MSparse<T>& |
|
|
41 operator += (MSparse<T>& a, const MSparse<T>& b) |
|
|
42 { |
|
|
43 MSparse<T> r; |
|
|
44 |
|
5275
|
45 octave_idx_type a_nr = a.rows (); |
|
|
46 octave_idx_type a_nc = a.cols (); |
|
5164
|
47 |
|
5275
|
48 octave_idx_type b_nr = b.rows (); |
|
|
49 octave_idx_type b_nc = b.cols (); |
|
5164
|
50 |
|
|
51 if (a_nr != b_nr || a_nc != b_nc) |
|
|
52 gripe_nonconformant ("operator +=" , a_nr, a_nc, b_nr, b_nc); |
|
|
53 else |
|
|
54 { |
|
5681
|
55 r = MSparse<T> (a_nr, a_nc, (a.nnz () + b.nnz ())); |
|
5164
|
56 |
|
5275
|
57 octave_idx_type jx = 0; |
|
|
58 for (octave_idx_type i = 0 ; i < a_nc ; i++) |
|
5164
|
59 { |
|
5275
|
60 octave_idx_type ja = a.cidx(i); |
|
|
61 octave_idx_type ja_max = a.cidx(i+1); |
|
5164
|
62 bool ja_lt_max= ja < ja_max; |
|
|
63 |
|
5275
|
64 octave_idx_type jb = b.cidx(i); |
|
|
65 octave_idx_type jb_max = b.cidx(i+1); |
|
5164
|
66 bool jb_lt_max = jb < jb_max; |
|
|
67 |
|
|
68 while (ja_lt_max || jb_lt_max ) |
|
|
69 { |
|
|
70 OCTAVE_QUIT; |
|
|
71 if ((! jb_lt_max) || |
|
|
72 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) |
|
|
73 { |
|
|
74 r.ridx(jx) = a.ridx(ja); |
|
|
75 r.data(jx) = a.data(ja) + 0.; |
|
|
76 jx++; |
|
|
77 ja++; |
|
|
78 ja_lt_max= ja < ja_max; |
|
|
79 } |
|
|
80 else if (( !ja_lt_max ) || |
|
|
81 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) |
|
|
82 { |
|
|
83 r.ridx(jx) = b.ridx(jb); |
|
|
84 r.data(jx) = 0. + b.data(jb); |
|
|
85 jx++; |
|
|
86 jb++; |
|
|
87 jb_lt_max= jb < jb_max; |
|
|
88 } |
|
|
89 else |
|
|
90 { |
|
|
91 if ((a.data(ja) + b.data(jb)) != 0.) |
|
|
92 { |
|
|
93 r.data(jx) = a.data(ja) + b.data(jb); |
|
|
94 r.ridx(jx) = a.ridx(ja); |
|
|
95 jx++; |
|
|
96 } |
|
|
97 ja++; |
|
|
98 ja_lt_max= ja < ja_max; |
|
|
99 jb++; |
|
|
100 jb_lt_max= jb < jb_max; |
|
|
101 } |
|
|
102 } |
|
|
103 r.cidx(i+1) = jx; |
|
|
104 } |
|
|
105 |
|
|
106 a = r.maybe_compress (); |
|
|
107 } |
|
|
108 |
|
|
109 return a; |
|
|
110 } |
|
|
111 |
|
|
112 template <class T> |
|
|
113 MSparse<T>& |
|
|
114 operator -= (MSparse<T>& a, const MSparse<T>& b) |
|
|
115 { |
|
|
116 MSparse<T> r; |
|
|
117 |
|
5275
|
118 octave_idx_type a_nr = a.rows (); |
|
|
119 octave_idx_type a_nc = a.cols (); |
|
5164
|
120 |
|
5275
|
121 octave_idx_type b_nr = b.rows (); |
|
|
122 octave_idx_type b_nc = b.cols (); |
|
5164
|
123 |
|
|
124 if (a_nr != b_nr || a_nc != b_nc) |
|
|
125 gripe_nonconformant ("operator -=" , a_nr, a_nc, b_nr, b_nc); |
|
|
126 else |
|
|
127 { |
|
5681
|
128 r = MSparse<T> (a_nr, a_nc, (a.nnz () + b.nnz ())); |
|
5164
|
129 |
|
5275
|
130 octave_idx_type jx = 0; |
|
|
131 for (octave_idx_type i = 0 ; i < a_nc ; i++) |
|
5164
|
132 { |
|
5275
|
133 octave_idx_type ja = a.cidx(i); |
|
|
134 octave_idx_type ja_max = a.cidx(i+1); |
|
5164
|
135 bool ja_lt_max= ja < ja_max; |
|
|
136 |
|
5275
|
137 octave_idx_type jb = b.cidx(i); |
|
|
138 octave_idx_type jb_max = b.cidx(i+1); |
|
5164
|
139 bool jb_lt_max = jb < jb_max; |
|
|
140 |
|
|
141 while (ja_lt_max || jb_lt_max ) |
|
|
142 { |
|
|
143 OCTAVE_QUIT; |
|
|
144 if ((! jb_lt_max) || |
|
|
145 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) |
|
|
146 { |
|
|
147 r.ridx(jx) = a.ridx(ja); |
|
|
148 r.data(jx) = a.data(ja) - 0.; |
|
|
149 jx++; |
|
|
150 ja++; |
|
|
151 ja_lt_max= ja < ja_max; |
|
|
152 } |
|
|
153 else if (( !ja_lt_max ) || |
|
|
154 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) |
|
|
155 { |
|
|
156 r.ridx(jx) = b.ridx(jb); |
|
|
157 r.data(jx) = 0. - b.data(jb); |
|
|
158 jx++; |
|
|
159 jb++; |
|
|
160 jb_lt_max= jb < jb_max; |
|
|
161 } |
|
|
162 else |
|
|
163 { |
|
|
164 if ((a.data(ja) - b.data(jb)) != 0.) |
|
|
165 { |
|
|
166 r.data(jx) = a.data(ja) - b.data(jb); |
|
|
167 r.ridx(jx) = a.ridx(ja); |
|
|
168 jx++; |
|
|
169 } |
|
|
170 ja++; |
|
|
171 ja_lt_max= ja < ja_max; |
|
|
172 jb++; |
|
|
173 jb_lt_max= jb < jb_max; |
|
|
174 } |
|
|
175 } |
|
|
176 r.cidx(i+1) = jx; |
|
|
177 } |
|
|
178 |
|
|
179 a = r.maybe_compress (); |
|
|
180 } |
|
|
181 |
|
|
182 return a; |
|
|
183 } |
|
|
184 |
|
|
185 // Element by element MSparse by scalar ops. |
|
|
186 |
|
|
187 #define SPARSE_A2S_OP_1(OP) \ |
|
|
188 template <class T> \ |
|
|
189 MArray2<T> \ |
|
|
190 operator OP (const MSparse<T>& a, const T& s) \ |
|
|
191 { \ |
|
5275
|
192 octave_idx_type nr = a.rows (); \ |
|
|
193 octave_idx_type nc = a.cols (); \ |
|
5164
|
194 \ |
|
|
195 MArray2<T> r (nr, nc, (0.0 OP s)); \ |
|
|
196 \ |
|
5275
|
197 for (octave_idx_type j = 0; j < nc; j++) \ |
|
|
198 for (octave_idx_type i = a.cidx(j); i < a.cidx(j+1); i++) \ |
|
5164
|
199 r.elem (a.ridx (i), j) = a.data (i) OP s; \ |
|
|
200 return r; \ |
|
|
201 } |
|
|
202 |
|
|
203 #define SPARSE_A2S_OP_2(OP) \ |
|
|
204 template <class T> \ |
|
|
205 MSparse<T> \ |
|
|
206 operator OP (const MSparse<T>& a, const T& s) \ |
|
|
207 { \ |
|
5275
|
208 octave_idx_type nr = a.rows (); \ |
|
|
209 octave_idx_type nc = a.cols (); \ |
|
5681
|
210 octave_idx_type nz = a.nnz (); \ |
|
5164
|
211 \ |
|
|
212 MSparse<T> r (nr, nc, nz); \ |
|
|
213 \ |
|
5275
|
214 for (octave_idx_type i = 0; i < nz; i++) \ |
|
5164
|
215 { \ |
|
|
216 r.data(i) = a.data(i) OP s; \ |
|
|
217 r.ridx(i) = a.ridx(i); \ |
|
|
218 } \ |
|
5275
|
219 for (octave_idx_type i = 0; i < nc + 1; i++) \ |
|
5164
|
220 r.cidx(i) = a.cidx(i); \ |
|
|
221 r.maybe_compress (true); \ |
|
|
222 return r; \ |
|
|
223 } |
|
|
224 |
|
|
225 |
|
|
226 SPARSE_A2S_OP_1 (+) |
|
|
227 SPARSE_A2S_OP_1 (-) |
|
|
228 SPARSE_A2S_OP_2 (*) |
|
|
229 SPARSE_A2S_OP_2 (/) |
|
|
230 |
|
|
231 // Element by element scalar by MSparse ops. |
|
|
232 |
|
|
233 #define SPARSE_SA2_OP_1(OP) \ |
|
|
234 template <class T> \ |
|
|
235 MArray2<T> \ |
|
|
236 operator OP (const T& s, const MSparse<T>& a) \ |
|
|
237 { \ |
|
5275
|
238 octave_idx_type nr = a.rows (); \ |
|
|
239 octave_idx_type nc = a.cols (); \ |
|
5164
|
240 \ |
|
|
241 MArray2<T> r (nr, nc, (s OP 0.0)); \ |
|
|
242 \ |
|
5275
|
243 for (octave_idx_type j = 0; j < nc; j++) \ |
|
|
244 for (octave_idx_type i = a.cidx(j); i < a.cidx(j+1); i++) \ |
|
5164
|
245 r.elem (a.ridx (i), j) = s OP a.data (i); \ |
|
|
246 return r; \ |
|
|
247 } |
|
|
248 |
|
|
249 #define SPARSE_SA2_OP_2(OP) \ |
|
|
250 template <class T> \ |
|
|
251 MSparse<T> \ |
|
|
252 operator OP (const T& s, const MSparse<T>& a) \ |
|
|
253 { \ |
|
5275
|
254 octave_idx_type nr = a.rows (); \ |
|
|
255 octave_idx_type nc = a.cols (); \ |
|
5681
|
256 octave_idx_type nz = a.nnz (); \ |
|
5164
|
257 \ |
|
|
258 MSparse<T> r (nr, nc, nz); \ |
|
|
259 \ |
|
5275
|
260 for (octave_idx_type i = 0; i < nz; i++) \ |
|
5164
|
261 { \ |
|
|
262 r.data(i) = s OP a.data(i); \ |
|
|
263 r.ridx(i) = a.ridx(i); \ |
|
|
264 } \ |
|
5275
|
265 for (octave_idx_type i = 0; i < nc + 1; i++) \ |
|
5164
|
266 r.cidx(i) = a.cidx(i); \ |
|
|
267 r.maybe_compress (true); \ |
|
|
268 return r; \ |
|
|
269 } |
|
|
270 |
|
|
271 SPARSE_SA2_OP_1 (+) |
|
|
272 SPARSE_SA2_OP_1 (-) |
|
|
273 SPARSE_SA2_OP_2 (*) |
|
|
274 SPARSE_SA2_OP_2 (/) |
|
|
275 |
|
|
276 // Element by element MSparse by MSparse ops. |
|
|
277 |
|
|
278 #define SPARSE_A2A2_OP(OP) \ |
|
|
279 template <class T> \ |
|
|
280 MSparse<T> \ |
|
|
281 operator OP (const MSparse<T>& a, const MSparse<T>& b) \ |
|
|
282 { \ |
|
|
283 MSparse<T> r; \ |
|
|
284 \ |
|
5275
|
285 octave_idx_type a_nr = a.rows (); \ |
|
|
286 octave_idx_type a_nc = a.cols (); \ |
|
5164
|
287 \ |
|
5275
|
288 octave_idx_type b_nr = b.rows (); \ |
|
|
289 octave_idx_type b_nc = b.cols (); \ |
|
5164
|
290 \ |
|
6221
|
291 if (a_nr == 1 && a_nc == 1) \ |
|
|
292 { \ |
|
|
293 if (a.elem(0,0) == 0.) \ |
|
|
294 r = MSparse<T> (b); \ |
|
|
295 else \ |
|
|
296 { \ |
|
|
297 r = MSparse<T> (b_nr, b_nc, a.data(0) OP 0.); \ |
|
|
298 \ |
|
|
299 for (octave_idx_type j = 0 ; j < b_nc ; j++) \ |
|
|
300 { \ |
|
|
301 OCTAVE_QUIT; \ |
|
|
302 octave_idx_type idxj = j * b_nr; \ |
|
|
303 for (octave_idx_type i = b.cidx(j) ; i < b.cidx(j+1) ; i++) \ |
|
|
304 { \ |
|
|
305 OCTAVE_QUIT; \ |
|
|
306 r.data(idxj + b.ridx(i)) = a.data(0) OP b.data(i); \ |
|
|
307 } \ |
|
|
308 } \ |
|
|
309 r.maybe_compress (); \ |
|
|
310 } \ |
|
|
311 } \ |
|
|
312 else if (b_nr == 1 && b_nc == 1) \ |
|
|
313 { \ |
|
|
314 if (b.elem(0,0) == 0.) \ |
|
|
315 r = MSparse<T> (a); \ |
|
|
316 else \ |
|
|
317 { \ |
|
|
318 r = MSparse<T> (a_nr, a_nc, 0. OP b.data(0)); \ |
|
|
319 \ |
|
|
320 for (octave_idx_type j = 0 ; j < a_nc ; j++) \ |
|
|
321 { \ |
|
|
322 OCTAVE_QUIT; \ |
|
|
323 octave_idx_type idxj = j * a_nr; \ |
|
|
324 for (octave_idx_type i = a.cidx(j) ; i < a.cidx(j+1) ; i++) \ |
|
|
325 { \ |
|
|
326 OCTAVE_QUIT; \ |
|
|
327 r.data(idxj + a.ridx(i)) = a.data(i) OP b.data(0); \ |
|
|
328 } \ |
|
|
329 } \ |
|
|
330 r.maybe_compress (); \ |
|
|
331 } \ |
|
|
332 } \ |
|
|
333 else if (a_nr != b_nr || a_nc != b_nc) \ |
|
5164
|
334 gripe_nonconformant ("operator " # OP, a_nr, a_nc, b_nr, b_nc); \ |
|
|
335 else \ |
|
|
336 { \ |
|
5681
|
337 r = MSparse<T> (a_nr, a_nc, (a.nnz () + b.nnz ())); \ |
|
5164
|
338 \ |
|
5275
|
339 octave_idx_type jx = 0; \ |
|
5164
|
340 r.cidx (0) = 0; \ |
|
5275
|
341 for (octave_idx_type i = 0 ; i < a_nc ; i++) \ |
|
5164
|
342 { \ |
|
5275
|
343 octave_idx_type ja = a.cidx(i); \ |
|
|
344 octave_idx_type ja_max = a.cidx(i+1); \ |
|
5164
|
345 bool ja_lt_max= ja < ja_max; \ |
|
|
346 \ |
|
5275
|
347 octave_idx_type jb = b.cidx(i); \ |
|
|
348 octave_idx_type jb_max = b.cidx(i+1); \ |
|
5164
|
349 bool jb_lt_max = jb < jb_max; \ |
|
|
350 \ |
|
|
351 while (ja_lt_max || jb_lt_max ) \ |
|
|
352 { \ |
|
|
353 OCTAVE_QUIT; \ |
|
|
354 if ((! jb_lt_max) || \ |
|
|
355 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) \ |
|
|
356 { \ |
|
|
357 r.ridx(jx) = a.ridx(ja); \ |
|
|
358 r.data(jx) = a.data(ja) OP 0.; \ |
|
|
359 jx++; \ |
|
|
360 ja++; \ |
|
|
361 ja_lt_max= ja < ja_max; \ |
|
|
362 } \ |
|
|
363 else if (( !ja_lt_max ) || \ |
|
|
364 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) \ |
|
|
365 { \ |
|
|
366 r.ridx(jx) = b.ridx(jb); \ |
|
|
367 r.data(jx) = 0. OP b.data(jb); \ |
|
|
368 jx++; \ |
|
|
369 jb++; \ |
|
|
370 jb_lt_max= jb < jb_max; \ |
|
|
371 } \ |
|
|
372 else \ |
|
|
373 { \ |
|
|
374 if ((a.data(ja) OP b.data(jb)) != 0.) \ |
|
|
375 { \ |
|
|
376 r.data(jx) = a.data(ja) OP b.data(jb); \ |
|
|
377 r.ridx(jx) = a.ridx(ja); \ |
|
|
378 jx++; \ |
|
|
379 } \ |
|
|
380 ja++; \ |
|
|
381 ja_lt_max= ja < ja_max; \ |
|
|
382 jb++; \ |
|
|
383 jb_lt_max= jb < jb_max; \ |
|
|
384 } \ |
|
|
385 } \ |
|
|
386 r.cidx(i+1) = jx; \ |
|
|
387 } \ |
|
|
388 \ |
|
|
389 r.maybe_compress (); \ |
|
|
390 } \ |
|
|
391 \ |
|
|
392 return r; \ |
|
|
393 } |
|
|
394 |
|
|
395 #define SPARSE_A2A2_FCN_1(FCN, OP) \ |
|
|
396 template <class T> \ |
|
|
397 MSparse<T> \ |
|
|
398 FCN (const MSparse<T>& a, const MSparse<T>& b) \ |
|
|
399 { \ |
|
|
400 MSparse<T> r; \ |
|
|
401 \ |
|
5275
|
402 octave_idx_type a_nr = a.rows (); \ |
|
|
403 octave_idx_type a_nc = a.cols (); \ |
|
5164
|
404 \ |
|
5275
|
405 octave_idx_type b_nr = b.rows (); \ |
|
|
406 octave_idx_type b_nc = b.cols (); \ |
|
5164
|
407 \ |
|
6221
|
408 if (a_nr == 1 && a_nc == 1) \ |
|
|
409 { \ |
|
|
410 if (a.elem(0,0) == 0.) \ |
|
|
411 r = MSparse<T> (b_nr, b_nc); \ |
|
|
412 else \ |
|
|
413 { \ |
|
|
414 r = MSparse<T> (b); \ |
|
|
415 octave_idx_type b_nnz = b.nnz(); \ |
|
|
416 \ |
|
|
417 for (octave_idx_type i = 0 ; i < b_nnz ; i++) \ |
|
|
418 { \ |
|
|
419 OCTAVE_QUIT; \ |
|
|
420 r.data (i) = a.data(0) OP r.data(i); \ |
|
|
421 } \ |
|
|
422 r.maybe_compress (); \ |
|
|
423 } \ |
|
|
424 } \ |
|
|
425 else if (b_nr == 1 && b_nc == 1) \ |
|
|
426 { \ |
|
|
427 if (b.elem(0,0) == 0.) \ |
|
|
428 r = MSparse<T> (a_nr, a_nc); \ |
|
|
429 else \ |
|
|
430 { \ |
|
|
431 r = MSparse<T> (a); \ |
|
|
432 octave_idx_type a_nnz = a.nnz(); \ |
|
|
433 \ |
|
|
434 for (octave_idx_type i = 0 ; i < a_nnz ; i++) \ |
|
|
435 { \ |
|
|
436 OCTAVE_QUIT; \ |
|
|
437 r.data (i) = r.data(i) OP b.data(0); \ |
|
|
438 } \ |
|
|
439 r.maybe_compress (); \ |
|
|
440 } \ |
|
|
441 } \ |
|
|
442 else if (a_nr != b_nr || a_nc != b_nc) \ |
|
5164
|
443 gripe_nonconformant (#FCN, a_nr, a_nc, b_nr, b_nc); \ |
|
|
444 else \ |
|
|
445 { \ |
|
5681
|
446 r = MSparse<T> (a_nr, a_nc, (a.nnz () > b.nnz () ? a.nnz () : b.nnz ())); \ |
|
5164
|
447 \ |
|
5275
|
448 octave_idx_type jx = 0; \ |
|
5164
|
449 r.cidx (0) = 0; \ |
|
5275
|
450 for (octave_idx_type i = 0 ; i < a_nc ; i++) \ |
|
5164
|
451 { \ |
|
5275
|
452 octave_idx_type ja = a.cidx(i); \ |
|
|
453 octave_idx_type ja_max = a.cidx(i+1); \ |
|
5164
|
454 bool ja_lt_max= ja < ja_max; \ |
|
|
455 \ |
|
5275
|
456 octave_idx_type jb = b.cidx(i); \ |
|
|
457 octave_idx_type jb_max = b.cidx(i+1); \ |
|
5164
|
458 bool jb_lt_max = jb < jb_max; \ |
|
|
459 \ |
|
|
460 while (ja_lt_max || jb_lt_max ) \ |
|
|
461 { \ |
|
|
462 OCTAVE_QUIT; \ |
|
|
463 if ((! jb_lt_max) || \ |
|
|
464 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) \ |
|
|
465 { \ |
|
|
466 ja++; ja_lt_max= ja < ja_max; \ |
|
|
467 } \ |
|
|
468 else if (( !ja_lt_max ) || \ |
|
|
469 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) \ |
|
|
470 { \ |
|
|
471 jb++; jb_lt_max= jb < jb_max; \ |
|
|
472 } \ |
|
|
473 else \ |
|
|
474 { \ |
|
|
475 if ((a.data(ja) OP b.data(jb)) != 0.) \ |
|
|
476 { \ |
|
|
477 r.data(jx) = a.data(ja) OP b.data(jb); \ |
|
|
478 r.ridx(jx) = a.ridx(ja); \ |
|
|
479 jx++; \ |
|
|
480 } \ |
|
|
481 ja++; ja_lt_max= ja < ja_max; \ |
|
|
482 jb++; jb_lt_max= jb < jb_max; \ |
|
|
483 } \ |
|
|
484 } \ |
|
|
485 r.cidx(i+1) = jx; \ |
|
|
486 } \ |
|
|
487 \ |
|
|
488 r.maybe_compress (); \ |
|
|
489 } \ |
|
|
490 \ |
|
|
491 return r; \ |
|
|
492 } |
|
|
493 |
|
|
494 #define SPARSE_A2A2_FCN_2(FCN, OP) \ |
|
|
495 template <class T> \ |
|
|
496 MSparse<T> \ |
|
|
497 FCN (const MSparse<T>& a, const MSparse<T>& b) \ |
|
|
498 { \ |
|
|
499 MSparse<T> r; \ |
|
|
500 T Zero = T (); \ |
|
|
501 \ |
|
5275
|
502 octave_idx_type a_nr = a.rows (); \ |
|
|
503 octave_idx_type a_nc = a.cols (); \ |
|
5164
|
504 \ |
|
5275
|
505 octave_idx_type b_nr = b.rows (); \ |
|
|
506 octave_idx_type b_nc = b.cols (); \ |
|
5164
|
507 \ |
|
6221
|
508 if (a_nr == 1 && a_nc == 1) \ |
|
|
509 { \ |
|
|
510 T val = a.elem (0,0); \ |
|
|
511 T fill = val OP T(); \ |
|
|
512 if (fill == T()) \ |
|
|
513 { \ |
|
|
514 octave_idx_type b_nnz = b.nnz(); \ |
|
|
515 r = MSparse<T> (b); \ |
|
|
516 for (octave_idx_type i = 0 ; i < b_nnz ; i++) \ |
|
|
517 r.data (i) = val OP r.data(i); \ |
|
|
518 r.maybe_compress (); \ |
|
|
519 } \ |
|
|
520 else \ |
|
|
521 { \ |
|
|
522 r = MSparse<T> (b_nr, b_nc, fill); \ |
|
|
523 for (octave_idx_type j = 0 ; j < b_nc ; j++) \ |
|
|
524 { \ |
|
|
525 OCTAVE_QUIT; \ |
|
|
526 octave_idx_type idxj = j * b_nr; \ |
|
|
527 for (octave_idx_type i = b.cidx(j) ; i < b.cidx(j+1) ; i++) \ |
|
|
528 { \ |
|
|
529 OCTAVE_QUIT; \ |
|
|
530 r.data(idxj + b.ridx(i)) = val OP b.data(i); \ |
|
|
531 } \ |
|
|
532 } \ |
|
|
533 r.maybe_compress (); \ |
|
|
534 } \ |
|
|
535 } \ |
|
|
536 else if (b_nr == 1 && b_nc == 1) \ |
|
|
537 { \ |
|
|
538 T val = b.elem (0,0); \ |
|
|
539 T fill = T() OP val; \ |
|
|
540 if (fill == T()) \ |
|
|
541 { \ |
|
|
542 octave_idx_type a_nnz = a.nnz(); \ |
|
|
543 r = MSparse<T> (a); \ |
|
|
544 for (octave_idx_type i = 0 ; i < a_nnz ; i++) \ |
|
|
545 r.data (i) = r.data(i) OP val; \ |
|
|
546 r.maybe_compress (); \ |
|
|
547 } \ |
|
|
548 else \ |
|
|
549 { \ |
|
|
550 r = MSparse<T> (a_nr, a_nc, fill); \ |
|
|
551 for (octave_idx_type j = 0 ; j < a_nc ; j++) \ |
|
|
552 { \ |
|
|
553 OCTAVE_QUIT; \ |
|
|
554 octave_idx_type idxj = j * a_nr; \ |
|
|
555 for (octave_idx_type i = a.cidx(j) ; i < a.cidx(j+1) ; i++) \ |
|
|
556 { \ |
|
|
557 OCTAVE_QUIT; \ |
|
|
558 r.data(idxj + a.ridx(i)) = a.data(i) OP val; \ |
|
|
559 } \ |
|
|
560 } \ |
|
|
561 r.maybe_compress (); \ |
|
|
562 } \ |
|
|
563 } \ |
|
|
564 else if (a_nr != b_nr || a_nc != b_nc) \ |
|
5164
|
565 gripe_nonconformant (#FCN, a_nr, a_nc, b_nr, b_nc); \ |
|
|
566 else \ |
|
|
567 { \ |
|
|
568 r = MSparse<T>( a_nr, a_nc, (Zero OP Zero)); \ |
|
|
569 \ |
|
5275
|
570 for (octave_idx_type i = 0 ; i < a_nc ; i++) \ |
|
5164
|
571 { \ |
|
5275
|
572 octave_idx_type ja = a.cidx(i); \ |
|
|
573 octave_idx_type ja_max = a.cidx(i+1); \ |
|
5164
|
574 bool ja_lt_max= ja < ja_max; \ |
|
|
575 \ |
|
5275
|
576 octave_idx_type jb = b.cidx(i); \ |
|
|
577 octave_idx_type jb_max = b.cidx(i+1); \ |
|
5164
|
578 bool jb_lt_max = jb < jb_max; \ |
|
|
579 \ |
|
|
580 while (ja_lt_max || jb_lt_max ) \ |
|
|
581 { \ |
|
|
582 OCTAVE_QUIT; \ |
|
|
583 if ((! jb_lt_max) || \ |
|
|
584 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) \ |
|
|
585 { \ |
|
|
586 r.elem (a.ridx(ja),i) = a.data(ja) OP Zero; \ |
|
|
587 ja++; ja_lt_max= ja < ja_max; \ |
|
|
588 } \ |
|
|
589 else if (( !ja_lt_max ) || \ |
|
|
590 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) \ |
|
|
591 { \ |
|
|
592 r.elem (b.ridx(jb),i) = Zero OP b.data(jb); \ |
|
|
593 jb++; jb_lt_max= jb < jb_max; \ |
|
|
594 } \ |
|
|
595 else \ |
|
|
596 { \ |
|
|
597 r.elem (a.ridx(ja),i) = a.data(ja) OP b.data(jb); \ |
|
|
598 ja++; ja_lt_max= ja < ja_max; \ |
|
|
599 jb++; jb_lt_max= jb < jb_max; \ |
|
|
600 } \ |
|
|
601 } \ |
|
|
602 } \ |
|
|
603 \ |
|
|
604 r.maybe_compress (true); \ |
|
|
605 } \ |
|
|
606 \ |
|
|
607 return r; \ |
|
|
608 } |
|
|
609 |
|
|
610 SPARSE_A2A2_OP (+) |
|
|
611 SPARSE_A2A2_OP (-) |
|
|
612 SPARSE_A2A2_FCN_1 (product, *) |
|
|
613 SPARSE_A2A2_FCN_2 (quotient, /) |
|
|
614 |
|
|
615 // Unary MSparse ops. |
|
|
616 |
|
|
617 template <class T> |
|
|
618 MSparse<T> |
|
|
619 operator + (const MSparse<T>& a) |
|
|
620 { |
|
|
621 return a; |
|
|
622 } |
|
|
623 |
|
|
624 template <class T> |
|
|
625 MSparse<T> |
|
|
626 operator - (const MSparse<T>& a) |
|
|
627 { |
|
|
628 MSparse<T> retval (a); |
|
5681
|
629 octave_idx_type nz = a.nnz (); |
|
5275
|
630 for (octave_idx_type i = 0; i < nz; i++) |
|
5164
|
631 retval.data(i) = - retval.data(i); |
|
|
632 return retval; |
|
|
633 } |
|
|
634 |
|
|
635 /* |
|
|
636 ;;; Local Variables: *** |
|
|
637 ;;; mode: C++ *** |
|
|
638 ;;; End: *** |
|
|
639 */ |
