|
5164
|
1 // Template sparse array class |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 2004 David Bateman |
|
|
5 Copyright (C) 1998-2004 Andy Adler |
|
|
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 |
|
5307
|
18 along with this program; see the file COPYING. If not, write to the |
|
|
19 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
|
|
20 Boston, MA 02110-1301, USA. |
|
5164
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
|
28 #include <cassert> |
|
|
29 #include <climits> |
|
|
30 |
|
|
31 #include <iostream> |
|
5765
|
32 #include <sstream> |
|
5164
|
33 #include <vector> |
|
|
34 |
|
|
35 #include "Array.h" |
|
|
36 #include "Array-util.h" |
|
|
37 #include "Range.h" |
|
|
38 #include "idx-vector.h" |
|
|
39 #include "lo-error.h" |
|
|
40 #include "quit.h" |
|
|
41 |
|
|
42 #include "Sparse.h" |
|
|
43 #include "sparse-sort.h" |
|
|
44 #include "oct-spparms.h" |
|
|
45 |
|
|
46 template <class T> |
|
|
47 T& |
|
5275
|
48 Sparse<T>::SparseRep::elem (octave_idx_type _r, octave_idx_type _c) |
|
5164
|
49 { |
|
5275
|
50 octave_idx_type i; |
|
5164
|
51 |
|
5604
|
52 if (nzmx > 0) |
|
5164
|
53 { |
|
|
54 for (i = c[_c]; i < c[_c + 1]; i++) |
|
|
55 if (r[i] == _r) |
|
|
56 return d[i]; |
|
|
57 else if (r[i] > _r) |
|
|
58 break; |
|
|
59 |
|
|
60 // Ok, If we've gotten here, we're in trouble.. Have to create a |
|
|
61 // new element in the sparse array. This' gonna be slow!!! |
|
5869
|
62 if (c[ncols] == nzmx) |
|
5164
|
63 { |
|
|
64 (*current_liboctave_error_handler) |
|
5275
|
65 ("Sparse::SparseRep::elem (octave_idx_type, octave_idx_type): sparse matrix filled"); |
|
5164
|
66 return *d; |
|
|
67 } |
|
|
68 |
|
5275
|
69 octave_idx_type to_move = c[ncols] - i; |
|
5164
|
70 if (to_move != 0) |
|
|
71 { |
|
5275
|
72 for (octave_idx_type j = c[ncols]; j > i; j--) |
|
5164
|
73 { |
|
|
74 d[j] = d[j-1]; |
|
|
75 r[j] = r[j-1]; |
|
|
76 } |
|
|
77 } |
|
|
78 |
|
5275
|
79 for (octave_idx_type j = _c + 1; j < ncols + 1; j++) |
|
5164
|
80 c[j] = c[j] + 1; |
|
|
81 |
|
|
82 d[i] = 0.; |
|
|
83 r[i] = _r; |
|
|
84 |
|
|
85 return d[i]; |
|
|
86 } |
|
|
87 else |
|
|
88 { |
|
|
89 (*current_liboctave_error_handler) |
|
5275
|
90 ("Sparse::SparseRep::elem (octave_idx_type, octave_idx_type): sparse matrix filled"); |
|
5164
|
91 return *d; |
|
|
92 } |
|
|
93 } |
|
|
94 |
|
|
95 template <class T> |
|
|
96 T |
|
5275
|
97 Sparse<T>::SparseRep::celem (octave_idx_type _r, octave_idx_type _c) const |
|
5164
|
98 { |
|
5604
|
99 if (nzmx > 0) |
|
5275
|
100 for (octave_idx_type i = c[_c]; i < c[_c + 1]; i++) |
|
5164
|
101 if (r[i] == _r) |
|
|
102 return d[i]; |
|
|
103 return T (); |
|
|
104 } |
|
|
105 |
|
|
106 template <class T> |
|
|
107 void |
|
|
108 Sparse<T>::SparseRep::maybe_compress (bool remove_zeros) |
|
|
109 { |
|
5604
|
110 octave_idx_type ndel = nzmx - c[ncols]; |
|
5275
|
111 octave_idx_type nzero = 0; |
|
5164
|
112 |
|
|
113 if (remove_zeros) |
|
5604
|
114 for (octave_idx_type i = 0; i < nzmx - ndel; i++) |
|
5164
|
115 if (d[i] == T ()) |
|
|
116 nzero++; |
|
|
117 |
|
|
118 if (!ndel && !nzero) |
|
|
119 return; |
|
|
120 |
|
|
121 if (!nzero) |
|
|
122 { |
|
5604
|
123 octave_idx_type new_nzmx = nzmx - ndel; |
|
|
124 |
|
|
125 T *new_data = new T [new_nzmx]; |
|
|
126 for (octave_idx_type i = 0; i < new_nzmx; i++) |
|
5164
|
127 new_data[i] = d[i]; |
|
|
128 delete [] d; |
|
|
129 d = new_data; |
|
|
130 |
|
5604
|
131 octave_idx_type *new_ridx = new octave_idx_type [new_nzmx]; |
|
|
132 for (octave_idx_type i = 0; i < new_nzmx; i++) |
|
5164
|
133 new_ridx[i] = r[i]; |
|
|
134 delete [] r; |
|
|
135 r = new_ridx; |
|
|
136 } |
|
|
137 else |
|
|
138 { |
|
5604
|
139 octave_idx_type new_nzmx = nzmx - ndel - nzero; |
|
|
140 |
|
|
141 T *new_data = new T [new_nzmx]; |
|
|
142 octave_idx_type *new_ridx = new octave_idx_type [new_nzmx]; |
|
5275
|
143 |
|
|
144 octave_idx_type ii = 0; |
|
|
145 octave_idx_type ic = 0; |
|
|
146 for (octave_idx_type j = 0; j < ncols; j++) |
|
5164
|
147 { |
|
5275
|
148 for (octave_idx_type k = ic; k < c[j+1]; k++) |
|
5164
|
149 if (d[k] != T ()) |
|
|
150 { |
|
|
151 new_data [ii] = d[k]; |
|
|
152 new_ridx [ii++] = r[k]; |
|
|
153 } |
|
|
154 ic = c[j+1]; |
|
|
155 c[j+1] = ii; |
|
|
156 } |
|
|
157 |
|
|
158 delete [] d; |
|
|
159 d = new_data; |
|
|
160 |
|
|
161 delete [] r; |
|
|
162 r = new_ridx; |
|
|
163 } |
|
|
164 |
|
5604
|
165 nzmx -= ndel + nzero; |
|
5164
|
166 } |
|
|
167 |
|
|
168 template <class T> |
|
|
169 void |
|
5275
|
170 Sparse<T>::SparseRep::change_length (octave_idx_type nz) |
|
5164
|
171 { |
|
5604
|
172 if (nz != nzmx) |
|
5164
|
173 { |
|
5604
|
174 octave_idx_type min_nzmx = (nz < nzmx ? nz : nzmx); |
|
5275
|
175 |
|
|
176 octave_idx_type * new_ridx = new octave_idx_type [nz]; |
|
5604
|
177 for (octave_idx_type i = 0; i < min_nzmx; i++) |
|
5164
|
178 new_ridx[i] = r[i]; |
|
|
179 |
|
|
180 delete [] r; |
|
|
181 r = new_ridx; |
|
|
182 |
|
|
183 T * new_data = new T [nz]; |
|
5604
|
184 for (octave_idx_type i = 0; i < min_nzmx; i++) |
|
5164
|
185 new_data[i] = d[i]; |
|
|
186 |
|
|
187 delete [] d; |
|
|
188 d = new_data; |
|
|
189 |
|
5604
|
190 if (nz < nzmx) |
|
5275
|
191 for (octave_idx_type i = 0; i <= ncols; i++) |
|
5164
|
192 if (c[i] > nz) |
|
|
193 c[i] = nz; |
|
|
194 |
|
5604
|
195 nzmx = nz; |
|
5164
|
196 } |
|
|
197 } |
|
|
198 |
|
|
199 template <class T> |
|
|
200 template <class U> |
|
|
201 Sparse<T>::Sparse (const Sparse<U>& a) |
|
|
202 : dimensions (a.dimensions), idx (0), idx_count (0) |
|
|
203 { |
|
5681
|
204 if (a.nnz () == 0) |
|
5164
|
205 rep = new typename Sparse<T>::SparseRep (rows (), cols()); |
|
|
206 else |
|
|
207 { |
|
5681
|
208 rep = new typename Sparse<T>::SparseRep (rows (), cols (), a.nnz ()); |
|
5164
|
209 |
|
5681
|
210 octave_idx_type nz = a.nnz (); |
|
5275
|
211 octave_idx_type nc = cols (); |
|
|
212 for (octave_idx_type i = 0; i < nz; i++) |
|
5164
|
213 { |
|
|
214 xdata (i) = T (a.data (i)); |
|
|
215 xridx (i) = a.ridx (i); |
|
|
216 } |
|
5275
|
217 for (octave_idx_type i = 0; i < nc + 1; i++) |
|
5164
|
218 xcidx (i) = a.cidx (i); |
|
|
219 } |
|
|
220 } |
|
|
221 |
|
|
222 template <class T> |
|
5275
|
223 Sparse<T>::Sparse (octave_idx_type nr, octave_idx_type nc, T val) |
|
5630
|
224 : dimensions (dim_vector (nr, nc)), idx (0), idx_count (0) |
|
5164
|
225 { |
|
5630
|
226 if (val != T ()) |
|
5164
|
227 { |
|
5630
|
228 rep = new typename Sparse<T>::SparseRep (nr, nc, nr*nc); |
|
|
229 |
|
|
230 octave_idx_type ii = 0; |
|
|
231 xcidx (0) = 0; |
|
|
232 for (octave_idx_type j = 0; j < nc; j++) |
|
5164
|
233 { |
|
5630
|
234 for (octave_idx_type i = 0; i < nr; i++) |
|
|
235 { |
|
|
236 xdata (ii) = val; |
|
|
237 xridx (ii++) = i; |
|
|
238 } |
|
|
239 xcidx (j+1) = ii; |
|
|
240 } |
|
|
241 } |
|
|
242 else |
|
|
243 { |
|
|
244 rep = new typename Sparse<T>::SparseRep (nr, nc, 0); |
|
|
245 for (octave_idx_type j = 0; j < nc+1; j++) |
|
|
246 xcidx(j) = 0; |
|
5164
|
247 } |
|
|
248 } |
|
|
249 |
|
|
250 template <class T> |
|
|
251 Sparse<T>::Sparse (const dim_vector& dv) |
|
|
252 : dimensions (dv), idx (0), idx_count (0) |
|
|
253 { |
|
|
254 if (dv.length() != 2) |
|
|
255 (*current_liboctave_error_handler) |
|
|
256 ("Sparse::Sparse (const dim_vector&): dimension mismatch"); |
|
|
257 else |
|
|
258 rep = new typename Sparse<T>::SparseRep (dv(0), dv(1)); |
|
|
259 } |
|
|
260 |
|
|
261 template <class T> |
|
|
262 Sparse<T>::Sparse (const Sparse<T>& a, const dim_vector& dv) |
|
|
263 : dimensions (dv), idx (0), idx_count (0) |
|
|
264 { |
|
|
265 |
|
|
266 // Work in unsigned long long to avoid overflow issues with numel |
|
|
267 unsigned long long a_nel = static_cast<unsigned long long>(a.rows ()) * |
|
|
268 static_cast<unsigned long long>(a.cols ()); |
|
|
269 unsigned long long dv_nel = static_cast<unsigned long long>(dv (0)) * |
|
|
270 static_cast<unsigned long long>(dv (1)); |
|
|
271 |
|
|
272 if (a_nel != dv_nel) |
|
|
273 (*current_liboctave_error_handler) |
|
|
274 ("Sparse::Sparse (const Sparse&, const dim_vector&): dimension mismatch"); |
|
|
275 else |
|
|
276 { |
|
|
277 dim_vector old_dims = a.dims(); |
|
5681
|
278 octave_idx_type new_nzmx = a.nnz (); |
|
5275
|
279 octave_idx_type new_nr = dv (0); |
|
|
280 octave_idx_type new_nc = dv (1); |
|
|
281 octave_idx_type old_nr = old_dims (0); |
|
|
282 octave_idx_type old_nc = old_dims (1); |
|
5164
|
283 |
|
5604
|
284 rep = new typename Sparse<T>::SparseRep (new_nr, new_nc, new_nzmx); |
|
5164
|
285 |
|
5275
|
286 octave_idx_type kk = 0; |
|
5164
|
287 xcidx(0) = 0; |
|
5275
|
288 for (octave_idx_type i = 0; i < old_nc; i++) |
|
|
289 for (octave_idx_type j = a.cidx(i); j < a.cidx(i+1); j++) |
|
5164
|
290 { |
|
5275
|
291 octave_idx_type tmp = i * old_nr + a.ridx(j); |
|
|
292 octave_idx_type ii = tmp % new_nr; |
|
|
293 octave_idx_type jj = (tmp - ii) / new_nr; |
|
|
294 for (octave_idx_type k = kk; k < jj; k++) |
|
5164
|
295 xcidx(k+1) = j; |
|
|
296 kk = jj; |
|
|
297 xdata(j) = a.data(j); |
|
|
298 xridx(j) = ii; |
|
|
299 } |
|
5275
|
300 for (octave_idx_type k = kk; k < new_nc; k++) |
|
5604
|
301 xcidx(k+1) = new_nzmx; |
|
5164
|
302 } |
|
|
303 } |
|
|
304 |
|
|
305 template <class T> |
|
5275
|
306 Sparse<T>::Sparse (const Array<T>& a, const Array<octave_idx_type>& r, |
|
|
307 const Array<octave_idx_type>& c, octave_idx_type nr, |
|
|
308 octave_idx_type nc, bool sum_terms) |
|
5164
|
309 : dimensions (dim_vector (nr, nc)), idx (0), idx_count (0) |
|
|
310 { |
|
5275
|
311 octave_idx_type a_len = a.length (); |
|
|
312 octave_idx_type r_len = r.length (); |
|
|
313 octave_idx_type c_len = c.length (); |
|
5164
|
314 bool ri_scalar = (r_len == 1); |
|
|
315 bool ci_scalar = (c_len == 1); |
|
|
316 bool cf_scalar = (a_len == 1); |
|
|
317 |
|
|
318 if ((a_len != r_len && !cf_scalar && !ri_scalar) || |
|
|
319 (a_len != c_len && !cf_scalar && !ci_scalar) || |
|
|
320 (r_len != c_len && !ri_scalar && !ci_scalar) || nr < 0 || nc < 0) |
|
|
321 { |
|
|
322 (*current_liboctave_error_handler) |
|
5275
|
323 ("Sparse::Sparse (const Array<T>&, const Array<octave_idx_type>&, ...): dimension mismatch"); |
|
5164
|
324 rep = nil_rep (); |
|
|
325 dimensions = dim_vector (0, 0); |
|
|
326 } |
|
|
327 else |
|
|
328 { |
|
5604
|
329 octave_idx_type max_nzmx = (r_len > c_len ? r_len : c_len); |
|
|
330 |
|
|
331 OCTAVE_LOCAL_BUFFER (octave_sparse_sort_idxl *, sidx, max_nzmx); |
|
|
332 OCTAVE_LOCAL_BUFFER (octave_sparse_sort_idxl, sidxX, max_nzmx); |
|
|
333 |
|
|
334 for (octave_idx_type i = 0; i < max_nzmx; i++) |
|
5164
|
335 sidx[i] = &sidxX[i]; |
|
|
336 |
|
5604
|
337 octave_idx_type actual_nzmx = 0; |
|
5164
|
338 OCTAVE_QUIT; |
|
5604
|
339 for (octave_idx_type i = 0; i < max_nzmx; i++) |
|
5164
|
340 { |
|
5275
|
341 octave_idx_type rowidx = (ri_scalar ? r(0) : r(i)); |
|
|
342 octave_idx_type colidx = (ci_scalar ? c(0) : c(i)); |
|
5164
|
343 if (rowidx < nr && rowidx >= 0 && |
|
|
344 colidx < nc && colidx >= 0 ) |
|
|
345 { |
|
|
346 if ( a (cf_scalar ? 0 : i ) != T ()) |
|
|
347 { |
|
5604
|
348 sidx[actual_nzmx]->r = rowidx; |
|
|
349 sidx[actual_nzmx]->c = colidx; |
|
|
350 sidx[actual_nzmx]->idx = i; |
|
|
351 actual_nzmx++; |
|
5164
|
352 } |
|
|
353 } |
|
|
354 else |
|
|
355 { |
|
|
356 (*current_liboctave_error_handler) |
|
|
357 ("Sparse::Sparse : index (%d,%d) out of range", |
|
|
358 rowidx + 1, colidx + 1); |
|
|
359 rep = nil_rep (); |
|
|
360 dimensions = dim_vector (0, 0); |
|
|
361 return; |
|
|
362 } |
|
|
363 } |
|
|
364 |
|
5604
|
365 if (actual_nzmx == 0) |
|
5164
|
366 rep = new typename Sparse<T>::SparseRep (nr, nc); |
|
|
367 else |
|
|
368 { |
|
|
369 OCTAVE_QUIT; |
|
|
370 octave_sort<octave_sparse_sort_idxl *> |
|
|
371 sort (octave_sparse_sidxl_comp); |
|
|
372 |
|
5604
|
373 sort.sort (sidx, actual_nzmx); |
|
5164
|
374 OCTAVE_QUIT; |
|
|
375 |
|
|
376 // Now count the unique non-zero values |
|
5604
|
377 octave_idx_type real_nzmx = 1; |
|
|
378 for (octave_idx_type i = 1; i < actual_nzmx; i++) |
|
5164
|
379 if (sidx[i-1]->r != sidx[i]->r || sidx[i-1]->c != sidx[i]->c) |
|
5604
|
380 real_nzmx++; |
|
|
381 |
|
|
382 rep = new typename Sparse<T>::SparseRep (nr, nc, real_nzmx); |
|
5164
|
383 |
|
5275
|
384 octave_idx_type cx = 0; |
|
|
385 octave_idx_type prev_rval = -1; |
|
|
386 octave_idx_type prev_cval = -1; |
|
|
387 octave_idx_type ii = -1; |
|
5164
|
388 xcidx (0) = 0; |
|
5604
|
389 for (octave_idx_type i = 0; i < actual_nzmx; i++) |
|
5164
|
390 { |
|
|
391 OCTAVE_QUIT; |
|
5275
|
392 octave_idx_type iidx = sidx[i]->idx; |
|
|
393 octave_idx_type rval = sidx[i]->r; |
|
|
394 octave_idx_type cval = sidx[i]->c; |
|
5164
|
395 |
|
|
396 if (prev_cval < cval || (prev_rval < rval && prev_cval == cval)) |
|
|
397 { |
|
5275
|
398 octave_idx_type ci = static_cast<octave_idx_type> (c (ci_scalar ? 0 : iidx)); |
|
5164
|
399 ii++; |
|
|
400 while (cx < ci) |
|
|
401 xcidx (++cx) = ii; |
|
|
402 xdata(ii) = a (cf_scalar ? 0 : iidx); |
|
5275
|
403 xridx(ii) = static_cast<octave_idx_type> (r (ri_scalar ? 0 : iidx)); |
|
5164
|
404 } |
|
|
405 else |
|
|
406 { |
|
|
407 if (sum_terms) |
|
|
408 xdata(ii) += a (cf_scalar ? 0 : iidx); |
|
|
409 else |
|
|
410 xdata(ii) = a (cf_scalar ? 0 : iidx); |
|
|
411 } |
|
|
412 prev_rval = rval; |
|
|
413 prev_cval = cval; |
|
|
414 } |
|
|
415 |
|
|
416 while (cx < nc) |
|
|
417 xcidx (++cx) = ii + 1; |
|
|
418 } |
|
|
419 } |
|
|
420 } |
|
|
421 |
|
|
422 template <class T> |
|
|
423 Sparse<T>::Sparse (const Array<T>& a, const Array<double>& r, |
|
5275
|
424 const Array<double>& c, octave_idx_type nr, |
|
|
425 octave_idx_type nc, bool sum_terms) |
|
5164
|
426 : dimensions (dim_vector (nr, nc)), idx (0), idx_count (0) |
|
|
427 { |
|
5275
|
428 octave_idx_type a_len = a.length (); |
|
|
429 octave_idx_type r_len = r.length (); |
|
|
430 octave_idx_type c_len = c.length (); |
|
5164
|
431 bool ri_scalar = (r_len == 1); |
|
|
432 bool ci_scalar = (c_len == 1); |
|
|
433 bool cf_scalar = (a_len == 1); |
|
|
434 |
|
|
435 if ((a_len != r_len && !cf_scalar && !ri_scalar) || |
|
|
436 (a_len != c_len && !cf_scalar && !ci_scalar) || |
|
|
437 (r_len != c_len && !ri_scalar && !ci_scalar) || nr < 0 || nc < 0) |
|
|
438 { |
|
|
439 (*current_liboctave_error_handler) |
|
|
440 ("Sparse::Sparse (const Array<T>&, const Array<double>&, ...): dimension mismatch"); |
|
|
441 rep = nil_rep (); |
|
|
442 dimensions = dim_vector (0, 0); |
|
|
443 } |
|
|
444 else |
|
|
445 { |
|
5604
|
446 octave_idx_type max_nzmx = (r_len > c_len ? r_len : c_len); |
|
5164
|
447 |
|
5604
|
448 OCTAVE_LOCAL_BUFFER (octave_sparse_sort_idxl *, sidx, max_nzmx); |
|
|
449 OCTAVE_LOCAL_BUFFER (octave_sparse_sort_idxl, sidxX, max_nzmx); |
|
|
450 |
|
|
451 for (octave_idx_type i = 0; i < max_nzmx; i++) |
|
5164
|
452 sidx[i] = &sidxX[i]; |
|
|
453 |
|
5604
|
454 octave_idx_type actual_nzmx = 0; |
|
5164
|
455 OCTAVE_QUIT; |
|
|
456 |
|
5604
|
457 for (octave_idx_type i = 0; i < max_nzmx; i++) |
|
5164
|
458 { |
|
5275
|
459 octave_idx_type rowidx = static_cast<octave_idx_type> (ri_scalar ? r(0) : r(i)); |
|
|
460 octave_idx_type colidx = static_cast<octave_idx_type> (ci_scalar ? c(0) : c(i)); |
|
5164
|
461 if (rowidx < nr && rowidx >= 0 && |
|
|
462 colidx < nc && colidx >= 0 ) |
|
|
463 { |
|
|
464 if ( a (cf_scalar ? 0 : i ) != T ()) |
|
|
465 { |
|
5604
|
466 sidx[actual_nzmx]->r = rowidx; |
|
|
467 sidx[actual_nzmx]->c = colidx; |
|
|
468 sidx[actual_nzmx]->idx = i; |
|
|
469 actual_nzmx++; |
|
5164
|
470 } |
|
|
471 } |
|
|
472 else |
|
|
473 { |
|
|
474 (*current_liboctave_error_handler) |
|
|
475 ("Sparse::Sparse : index (%d,%d) out of range", |
|
|
476 rowidx + 1, colidx + 1); |
|
|
477 rep = nil_rep (); |
|
|
478 dimensions = dim_vector (0, 0); |
|
|
479 return; |
|
|
480 } |
|
|
481 } |
|
|
482 |
|
5604
|
483 if (actual_nzmx == 0) |
|
5164
|
484 rep = new typename Sparse<T>::SparseRep (nr, nc); |
|
|
485 else |
|
|
486 { |
|
|
487 OCTAVE_QUIT; |
|
|
488 octave_sort<octave_sparse_sort_idxl *> |
|
|
489 sort (octave_sparse_sidxl_comp); |
|
|
490 |
|
5604
|
491 sort.sort (sidx, actual_nzmx); |
|
5164
|
492 OCTAVE_QUIT; |
|
|
493 |
|
|
494 // Now count the unique non-zero values |
|
5604
|
495 octave_idx_type real_nzmx = 1; |
|
|
496 for (octave_idx_type i = 1; i < actual_nzmx; i++) |
|
5164
|
497 if (sidx[i-1]->r != sidx[i]->r || sidx[i-1]->c != sidx[i]->c) |
|
5604
|
498 real_nzmx++; |
|
|
499 |
|
|
500 rep = new typename Sparse<T>::SparseRep (nr, nc, real_nzmx); |
|
5164
|
501 |
|
5275
|
502 octave_idx_type cx = 0; |
|
|
503 octave_idx_type prev_rval = -1; |
|
|
504 octave_idx_type prev_cval = -1; |
|
|
505 octave_idx_type ii = -1; |
|
5164
|
506 xcidx (0) = 0; |
|
5604
|
507 for (octave_idx_type i = 0; i < actual_nzmx; i++) |
|
5164
|
508 { |
|
|
509 OCTAVE_QUIT; |
|
5275
|
510 octave_idx_type iidx = sidx[i]->idx; |
|
|
511 octave_idx_type rval = sidx[i]->r; |
|
|
512 octave_idx_type cval = sidx[i]->c; |
|
5164
|
513 |
|
|
514 if (prev_cval < cval || (prev_rval < rval && prev_cval == cval)) |
|
|
515 { |
|
5275
|
516 octave_idx_type ci = static_cast<octave_idx_type> (c (ci_scalar ? 0 : iidx)); |
|
5164
|
517 ii++; |
|
|
518 |
|
|
519 while (cx < ci) |
|
|
520 xcidx (++cx) = ii; |
|
|
521 xdata(ii) = a (cf_scalar ? 0 : iidx); |
|
5275
|
522 xridx(ii) = static_cast<octave_idx_type> (r (ri_scalar ? 0 : iidx)); |
|
5164
|
523 } |
|
|
524 else |
|
|
525 { |
|
|
526 if (sum_terms) |
|
|
527 xdata(ii) += a (cf_scalar ? 0 : iidx); |
|
|
528 else |
|
|
529 xdata(ii) = a (cf_scalar ? 0 : iidx); |
|
|
530 } |
|
|
531 prev_rval = rval; |
|
|
532 prev_cval = cval; |
|
|
533 } |
|
|
534 |
|
|
535 while (cx < nc) |
|
|
536 xcidx (++cx) = ii + 1; |
|
|
537 } |
|
|
538 } |
|
|
539 } |
|
|
540 |
|
|
541 template <class T> |
|
|
542 Sparse<T>::Sparse (const Array2<T>& a) |
|
|
543 : dimensions (a.dims ()), idx (0), idx_count (0) |
|
|
544 { |
|
5275
|
545 octave_idx_type nr = rows (); |
|
|
546 octave_idx_type nc = cols (); |
|
|
547 octave_idx_type len = a.length (); |
|
5604
|
548 octave_idx_type new_nzmx = 0; |
|
5164
|
549 |
|
|
550 // First count the number of non-zero terms |
|
5275
|
551 for (octave_idx_type i = 0; i < len; i++) |
|
5164
|
552 if (a(i) != T ()) |
|
5604
|
553 new_nzmx++; |
|
|
554 |
|
|
555 rep = new typename Sparse<T>::SparseRep (nr, nc, new_nzmx); |
|
5164
|
556 |
|
5275
|
557 octave_idx_type ii = 0; |
|
5164
|
558 xcidx(0) = 0; |
|
5275
|
559 for (octave_idx_type j = 0; j < nc; j++) |
|
5164
|
560 { |
|
5275
|
561 for (octave_idx_type i = 0; i < nr; i++) |
|
5164
|
562 if (a.elem (i,j) != T ()) |
|
|
563 { |
|
|
564 xdata(ii) = a.elem (i,j); |
|
|
565 xridx(ii++) = i; |
|
|
566 } |
|
|
567 xcidx(j+1) = ii; |
|
|
568 } |
|
|
569 } |
|
|
570 |
|
|
571 template <class T> |
|
|
572 Sparse<T>::Sparse (const Array<T>& a) |
|
|
573 : dimensions (a.dims ()), idx (0), idx_count (0) |
|
|
574 { |
|
|
575 if (dimensions.length () > 2) |
|
|
576 (*current_liboctave_error_handler) |
|
|
577 ("Sparse::Sparse (const Array<T>&): dimension mismatch"); |
|
|
578 else |
|
|
579 { |
|
5275
|
580 octave_idx_type nr = rows (); |
|
|
581 octave_idx_type nc = cols (); |
|
|
582 octave_idx_type len = a.length (); |
|
5604
|
583 octave_idx_type new_nzmx = 0; |
|
5164
|
584 |
|
|
585 // First count the number of non-zero terms |
|
5275
|
586 for (octave_idx_type i = 0; i < len; i++) |
|
5164
|
587 if (a(i) != T ()) |
|
5604
|
588 new_nzmx++; |
|
|
589 |
|
|
590 rep = new typename Sparse<T>::SparseRep (nr, nc, new_nzmx); |
|
5164
|
591 |
|
5275
|
592 octave_idx_type ii = 0; |
|
5164
|
593 xcidx(0) = 0; |
|
5275
|
594 for (octave_idx_type j = 0; j < nc; j++) |
|
5164
|
595 { |
|
5275
|
596 for (octave_idx_type i = 0; i < nr; i++) |
|
5164
|
597 if (a.elem (i,j) != T ()) |
|
|
598 { |
|
|
599 xdata(ii) = a.elem (i,j); |
|
|
600 xridx(ii++) = i; |
|
|
601 } |
|
|
602 xcidx(j+1) = ii; |
|
|
603 } |
|
|
604 } |
|
|
605 } |
|
|
606 |
|
|
607 template <class T> |
|
|
608 Sparse<T>::~Sparse (void) |
|
|
609 { |
|
|
610 if (--rep->count <= 0) |
|
|
611 delete rep; |
|
|
612 |
|
|
613 delete [] idx; |
|
|
614 } |
|
|
615 |
|
|
616 template <class T> |
|
5275
|
617 octave_idx_type |
|
|
618 Sparse<T>::compute_index (const Array<octave_idx_type>& ra_idx) const |
|
5164
|
619 { |
|
5275
|
620 octave_idx_type retval = -1; |
|
|
621 |
|
|
622 octave_idx_type n = dimensions.length (); |
|
5164
|
623 |
|
|
624 if (n > 0 && n == ra_idx.length ()) |
|
|
625 { |
|
|
626 retval = ra_idx(--n); |
|
|
627 |
|
|
628 while (--n >= 0) |
|
|
629 { |
|
|
630 retval *= dimensions(n); |
|
|
631 retval += ra_idx(n); |
|
|
632 } |
|
|
633 } |
|
|
634 else |
|
|
635 (*current_liboctave_error_handler) |
|
|
636 ("Sparse<T>::compute_index: invalid ra_idxing operation"); |
|
|
637 |
|
|
638 return retval; |
|
|
639 } |
|
|
640 |
|
|
641 template <class T> |
|
|
642 T |
|
5275
|
643 Sparse<T>::range_error (const char *fcn, octave_idx_type n) const |
|
5164
|
644 { |
|
|
645 (*current_liboctave_error_handler) ("%s (%d): range error", fcn, n); |
|
|
646 return T (); |
|
|
647 } |
|
|
648 |
|
|
649 template <class T> |
|
|
650 T& |
|
5275
|
651 Sparse<T>::range_error (const char *fcn, octave_idx_type n) |
|
5164
|
652 { |
|
|
653 (*current_liboctave_error_handler) ("%s (%d): range error", fcn, n); |
|
|
654 static T foo; |
|
|
655 return foo; |
|
|
656 } |
|
|
657 |
|
|
658 template <class T> |
|
|
659 T |
|
5275
|
660 Sparse<T>::range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const |
|
5164
|
661 { |
|
|
662 (*current_liboctave_error_handler) |
|
|
663 ("%s (%d, %d): range error", fcn, i, j); |
|
|
664 return T (); |
|
|
665 } |
|
|
666 |
|
|
667 template <class T> |
|
|
668 T& |
|
5275
|
669 Sparse<T>::range_error (const char *fcn, octave_idx_type i, octave_idx_type j) |
|
5164
|
670 { |
|
|
671 (*current_liboctave_error_handler) |
|
|
672 ("%s (%d, %d): range error", fcn, i, j); |
|
|
673 static T foo; |
|
|
674 return foo; |
|
|
675 } |
|
|
676 |
|
|
677 template <class T> |
|
|
678 T |
|
5275
|
679 Sparse<T>::range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const |
|
5164
|
680 { |
|
5765
|
681 std::ostringstream buf; |
|
5164
|
682 |
|
|
683 buf << fcn << " ("; |
|
|
684 |
|
5275
|
685 octave_idx_type n = ra_idx.length (); |
|
5164
|
686 |
|
|
687 if (n > 0) |
|
|
688 buf << ra_idx(0); |
|
|
689 |
|
5275
|
690 for (octave_idx_type i = 1; i < n; i++) |
|
5164
|
691 buf << ", " << ra_idx(i); |
|
|
692 |
|
|
693 buf << "): range error"; |
|
5765
|
694 |
|
|
695 std::string buf_str = buf.str (); |
|
|
696 |
|
|
697 (*current_liboctave_error_handler) (buf_str.c_str ()); |
|
5164
|
698 |
|
|
699 return T (); |
|
|
700 } |
|
|
701 |
|
|
702 template <class T> |
|
|
703 T& |
|
5275
|
704 Sparse<T>::range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) |
|
5164
|
705 { |
|
5765
|
706 std::ostringstream buf; |
|
5164
|
707 |
|
|
708 buf << fcn << " ("; |
|
|
709 |
|
5275
|
710 octave_idx_type n = ra_idx.length (); |
|
5164
|
711 |
|
|
712 if (n > 0) |
|
|
713 buf << ra_idx(0); |
|
|
714 |
|
5275
|
715 for (octave_idx_type i = 1; i < n; i++) |
|
5164
|
716 buf << ", " << ra_idx(i); |
|
|
717 |
|
|
718 buf << "): range error"; |
|
|
719 |
|
5765
|
720 std::string buf_str = buf.str (); |
|
|
721 |
|
|
722 (*current_liboctave_error_handler) (buf_str.c_str ()); |
|
5164
|
723 |
|
|
724 static T foo; |
|
|
725 return foo; |
|
|
726 } |
|
|
727 |
|
|
728 template <class T> |
|
|
729 Sparse<T> |
|
|
730 Sparse<T>::reshape (const dim_vector& new_dims) const |
|
|
731 { |
|
|
732 Sparse<T> retval; |
|
|
733 |
|
|
734 if (dimensions != new_dims) |
|
|
735 { |
|
|
736 if (dimensions.numel () == new_dims.numel ()) |
|
|
737 { |
|
5681
|
738 octave_idx_type new_nnz = nnz (); |
|
5275
|
739 octave_idx_type new_nr = new_dims (0); |
|
|
740 octave_idx_type new_nc = new_dims (1); |
|
|
741 octave_idx_type old_nr = rows (); |
|
|
742 octave_idx_type old_nc = cols (); |
|
5681
|
743 retval = Sparse<T> (new_nr, new_nc, new_nnz); |
|
5164
|
744 |
|
5275
|
745 octave_idx_type kk = 0; |
|
5164
|
746 retval.xcidx(0) = 0; |
|
5275
|
747 for (octave_idx_type i = 0; i < old_nc; i++) |
|
|
748 for (octave_idx_type j = cidx(i); j < cidx(i+1); j++) |
|
5164
|
749 { |
|
5275
|
750 octave_idx_type tmp = i * old_nr + ridx(j); |
|
|
751 octave_idx_type ii = tmp % new_nr; |
|
|
752 octave_idx_type jj = (tmp - ii) / new_nr; |
|
|
753 for (octave_idx_type k = kk; k < jj; k++) |
|
5164
|
754 retval.xcidx(k+1) = j; |
|
|
755 kk = jj; |
|
|
756 retval.xdata(j) = data(j); |
|
|
757 retval.xridx(j) = ii; |
|
|
758 } |
|
5275
|
759 for (octave_idx_type k = kk; k < new_nc; k++) |
|
5681
|
760 retval.xcidx(k+1) = new_nnz; |
|
5164
|
761 } |
|
|
762 else |
|
|
763 (*current_liboctave_error_handler) ("reshape: size mismatch"); |
|
|
764 } |
|
|
765 else |
|
|
766 retval = *this; |
|
|
767 |
|
|
768 return retval; |
|
|
769 } |
|
|
770 |
|
|
771 template <class T> |
|
|
772 Sparse<T> |
|
5275
|
773 Sparse<T>::permute (const Array<octave_idx_type>& perm_vec, bool) const |
|
5164
|
774 { |
|
|
775 dim_vector dv = dims (); |
|
|
776 dim_vector dv_new; |
|
|
777 |
|
5275
|
778 octave_idx_type nd = dv.length (); |
|
5164
|
779 |
|
|
780 dv_new.resize (nd); |
|
|
781 |
|
|
782 // Need this array to check for identical elements in permutation array. |
|
|
783 Array<bool> checked (nd, false); |
|
|
784 |
|
|
785 // Find dimension vector of permuted array. |
|
5275
|
786 for (octave_idx_type i = 0; i < nd; i++) |
|
5164
|
787 { |
|
5275
|
788 octave_idx_type perm_el = perm_vec.elem (i); |
|
5164
|
789 |
|
|
790 if (perm_el > dv.length () || perm_el < 1) |
|
|
791 { |
|
|
792 (*current_liboctave_error_handler) |
|
|
793 ("permutation vector contains an invalid element"); |
|
|
794 |
|
|
795 return Sparse<T> (); |
|
|
796 } |
|
|
797 |
|
|
798 if (checked.elem(perm_el - 1)) |
|
|
799 { |
|
|
800 (*current_liboctave_error_handler) |
|
|
801 ("PERM cannot contain identical elements"); |
|
|
802 |
|
|
803 return Sparse<T> (); |
|
|
804 } |
|
|
805 else |
|
|
806 checked.elem(perm_el - 1) = true; |
|
|
807 |
|
|
808 dv_new (i) = dv (perm_el - 1); |
|
|
809 } |
|
|
810 |
|
|
811 if (dv_new == dv) |
|
|
812 return *this; |
|
|
813 else |
|
|
814 return transpose (); |
|
|
815 } |
|
|
816 |
|
|
817 template <class T> |
|
|
818 void |
|
|
819 Sparse<T>::resize_no_fill (const dim_vector& dv) |
|
|
820 { |
|
5275
|
821 octave_idx_type n = dv.length (); |
|
5164
|
822 |
|
|
823 if (n != 2) |
|
|
824 { |
|
|
825 (*current_liboctave_error_handler) ("sparse array must be 2-D"); |
|
|
826 return; |
|
|
827 } |
|
|
828 |
|
|
829 resize_no_fill (dv(0), dv(1)); |
|
|
830 } |
|
|
831 |
|
|
832 template <class T> |
|
|
833 void |
|
5275
|
834 Sparse<T>::resize_no_fill (octave_idx_type r, octave_idx_type c) |
|
5164
|
835 { |
|
|
836 if (r < 0 || c < 0) |
|
|
837 { |
|
|
838 (*current_liboctave_error_handler) |
|
|
839 ("can't resize to negative dimension"); |
|
|
840 return; |
|
|
841 } |
|
|
842 |
|
|
843 if (ndims () == 0) |
|
|
844 dimensions = dim_vector (0, 0); |
|
|
845 |
|
|
846 if (r == dim1 () && c == dim2 ()) |
|
|
847 return; |
|
|
848 |
|
5731
|
849 typename Sparse<T>::SparseRep *old_rep = rep; |
|
|
850 |
|
5275
|
851 octave_idx_type nc = cols (); |
|
|
852 octave_idx_type nr = rows (); |
|
5164
|
853 |
|
5681
|
854 if (nnz () == 0 || r == 0 || c == 0) |
|
5164
|
855 // Special case of redimensioning to/from a sparse matrix with |
|
|
856 // no elements |
|
|
857 rep = new typename Sparse<T>::SparseRep (r, c); |
|
|
858 else |
|
|
859 { |
|
5275
|
860 octave_idx_type n = 0; |
|
5164
|
861 Sparse<T> tmpval; |
|
|
862 if (r >= nr) |
|
|
863 { |
|
|
864 if (c > nc) |
|
5731
|
865 n = xcidx(nc); |
|
5164
|
866 else |
|
5731
|
867 n = xcidx(c); |
|
5164
|
868 |
|
|
869 tmpval = Sparse<T> (r, c, n); |
|
|
870 |
|
|
871 if (c > nc) |
|
|
872 { |
|
5275
|
873 for (octave_idx_type i = 0; i < nc; i++) |
|
5731
|
874 tmpval.cidx(i) = xcidx(i); |
|
5275
|
875 for (octave_idx_type i = nc+2; i < c; i++) |
|
5164
|
876 tmpval.cidx(i) = tmpval.cidx(i-1); |
|
|
877 } |
|
|
878 else if (c <= nc) |
|
5275
|
879 for (octave_idx_type i = 0; i < c; i++) |
|
5731
|
880 tmpval.cidx(i) = xcidx(i); |
|
5164
|
881 |
|
5275
|
882 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
883 { |
|
5731
|
884 tmpval.data(i) = xdata(i); |
|
|
885 tmpval.ridx(i) = xridx(i); |
|
5164
|
886 } |
|
|
887 } |
|
|
888 else |
|
|
889 { |
|
|
890 // Count how many non zero terms before we do anything |
|
5275
|
891 for (octave_idx_type i = 0; i < c; i++) |
|
5731
|
892 for (octave_idx_type j = xcidx(i); j < xcidx(i+1); j++) |
|
|
893 if (xridx(j) < r) |
|
5164
|
894 n++; |
|
|
895 |
|
|
896 if (n) |
|
|
897 { |
|
|
898 // Now that we know the size we can do something |
|
|
899 tmpval = Sparse<T> (r, c, n); |
|
|
900 |
|
|
901 tmpval.cidx(0); |
|
5275
|
902 for (octave_idx_type i = 0, ii = 0; i < c; i++) |
|
5164
|
903 { |
|
5731
|
904 for (octave_idx_type j = xcidx(i); j < xcidx(i+1); j++) |
|
|
905 if (xridx(j) < r) |
|
5164
|
906 { |
|
5731
|
907 tmpval.data(ii) = xdata(j); |
|
|
908 tmpval.ridx(ii++) = xridx(j); |
|
5164
|
909 } |
|
|
910 tmpval.cidx(i+1) = ii; |
|
|
911 } |
|
|
912 } |
|
|
913 else |
|
|
914 tmpval = Sparse<T> (r, c); |
|
|
915 } |
|
|
916 |
|
|
917 rep = tmpval.rep; |
|
|
918 rep->count++; |
|
|
919 } |
|
|
920 |
|
|
921 dimensions = dim_vector (r, c); |
|
|
922 |
|
|
923 if (--old_rep->count <= 0) |
|
|
924 delete old_rep; |
|
|
925 } |
|
|
926 |
|
|
927 template <class T> |
|
|
928 Sparse<T>& |
|
5275
|
929 Sparse<T>::insert (const Sparse<T>& a, octave_idx_type r, octave_idx_type c) |
|
5164
|
930 { |
|
5275
|
931 octave_idx_type a_rows = a.rows (); |
|
|
932 octave_idx_type a_cols = a.cols (); |
|
|
933 octave_idx_type nr = rows (); |
|
|
934 octave_idx_type nc = cols (); |
|
5164
|
935 |
|
|
936 if (r < 0 || r + a_rows > rows () || c < 0 || c + a_cols > cols ()) |
|
|
937 { |
|
|
938 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
939 return *this; |
|
|
940 } |
|
|
941 |
|
|
942 // First count the number of elements in the final array |
|
5681
|
943 octave_idx_type nel = cidx(c) + a.nnz (); |
|
5164
|
944 |
|
|
945 if (c + a_cols < nc) |
|
|
946 nel += cidx(nc) - cidx(c + a_cols); |
|
|
947 |
|
5275
|
948 for (octave_idx_type i = c; i < c + a_cols; i++) |
|
|
949 for (octave_idx_type j = cidx(i); j < cidx(i+1); j++) |
|
5164
|
950 if (ridx(j) < r || ridx(j) >= r + a_rows) |
|
|
951 nel++; |
|
|
952 |
|
|
953 Sparse<T> tmp (*this); |
|
|
954 --rep->count; |
|
|
955 rep = new typename Sparse<T>::SparseRep (nr, nc, nel); |
|
|
956 |
|
5275
|
957 for (octave_idx_type i = 0; i < tmp.cidx(c); i++) |
|
5164
|
958 { |
|
|
959 data(i) = tmp.data(i); |
|
|
960 ridx(i) = tmp.ridx(i); |
|
|
961 } |
|
5275
|
962 for (octave_idx_type i = 0; i < c + 1; i++) |
|
5164
|
963 cidx(i) = tmp.cidx(i); |
|
|
964 |
|
5275
|
965 octave_idx_type ii = cidx(c); |
|
|
966 |
|
|
967 for (octave_idx_type i = c; i < c + a_cols; i++) |
|
5164
|
968 { |
|
|
969 OCTAVE_QUIT; |
|
|
970 |
|
5275
|
971 for (octave_idx_type j = tmp.cidx(i); j < tmp.cidx(i+1); j++) |
|
5164
|
972 if (tmp.ridx(j) < r) |
|
|
973 { |
|
|
974 data(ii) = tmp.data(j); |
|
|
975 ridx(ii++) = tmp.ridx(j); |
|
|
976 } |
|
|
977 |
|
|
978 OCTAVE_QUIT; |
|
|
979 |
|
5275
|
980 for (octave_idx_type j = a.cidx(i-c); j < a.cidx(i-c+1); j++) |
|
5164
|
981 { |
|
|
982 data(ii) = a.data(j); |
|
|
983 ridx(ii++) = r + a.ridx(j); |
|
|
984 } |
|
|
985 |
|
|
986 OCTAVE_QUIT; |
|
|
987 |
|
5275
|
988 for (octave_idx_type j = tmp.cidx(i); j < tmp.cidx(i+1); j++) |
|
5164
|
989 if (tmp.ridx(j) >= r + a_rows) |
|
|
990 { |
|
|
991 data(ii) = tmp.data(j); |
|
|
992 ridx(ii++) = tmp.ridx(j); |
|
|
993 } |
|
|
994 |
|
|
995 cidx(i+1) = ii; |
|
|
996 } |
|
|
997 |
|
5275
|
998 for (octave_idx_type i = c + a_cols; i < nc; i++) |
|
5164
|
999 { |
|
5275
|
1000 for (octave_idx_type j = tmp.cidx(i); j < tmp.cidx(i+1); j++) |
|
5164
|
1001 { |
|
|
1002 data(ii) = tmp.data(j); |
|
|
1003 ridx(ii++) = tmp.ridx(j); |
|
|
1004 } |
|
|
1005 cidx(i+1) = ii; |
|
|
1006 } |
|
|
1007 |
|
|
1008 return *this; |
|
|
1009 } |
|
|
1010 |
|
|
1011 template <class T> |
|
|
1012 Sparse<T>& |
|
5275
|
1013 Sparse<T>::insert (const Sparse<T>& a, const Array<octave_idx_type>& ra_idx) |
|
5164
|
1014 { |
|
|
1015 |
|
|
1016 if (ra_idx.length () != 2) |
|
|
1017 { |
|
|
1018 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
1019 return *this; |
|
|
1020 } |
|
|
1021 |
|
|
1022 return insert (a, ra_idx (0), ra_idx (1)); |
|
|
1023 } |
|
|
1024 |
|
|
1025 template <class T> |
|
|
1026 Sparse<T> |
|
|
1027 Sparse<T>::transpose (void) const |
|
|
1028 { |
|
|
1029 assert (ndims () == 2); |
|
|
1030 |
|
5275
|
1031 octave_idx_type nr = rows (); |
|
|
1032 octave_idx_type nc = cols (); |
|
5648
|
1033 octave_idx_type nz = nnz (); |
|
5164
|
1034 Sparse<T> retval (nc, nr, nz); |
|
|
1035 |
|
5648
|
1036 OCTAVE_LOCAL_BUFFER (octave_idx_type, w, nr + 1); |
|
|
1037 for (octave_idx_type i = 0; i < nr; i++) |
|
|
1038 w[i] = 0; |
|
|
1039 for (octave_idx_type i = 0; i < nz; i++) |
|
|
1040 w[ridx(i)]++; |
|
|
1041 nz = 0; |
|
|
1042 for (octave_idx_type i = 0; i < nr; i++) |
|
5164
|
1043 { |
|
5648
|
1044 retval.xcidx(i) = nz; |
|
|
1045 nz += w[i]; |
|
|
1046 w[i] = retval.xcidx(i); |
|
5164
|
1047 } |
|
5648
|
1048 retval.xcidx(nr) = nz; |
|
|
1049 w[nr] = nz; |
|
|
1050 |
|
|
1051 for (octave_idx_type j = 0; j < nc; j++) |
|
|
1052 for (octave_idx_type k = cidx(j); k < cidx(j+1); k++) |
|
|
1053 { |
|
|
1054 octave_idx_type q = w [ridx(k)]++; |
|
|
1055 retval.xridx (q) = j; |
|
|
1056 retval.xdata (q) = data (k); |
|
|
1057 } |
|
5164
|
1058 |
|
|
1059 return retval; |
|
|
1060 } |
|
|
1061 |
|
|
1062 template <class T> |
|
|
1063 void |
|
|
1064 Sparse<T>::clear_index (void) |
|
|
1065 { |
|
|
1066 delete [] idx; |
|
|
1067 idx = 0; |
|
|
1068 idx_count = 0; |
|
|
1069 } |
|
|
1070 |
|
|
1071 template <class T> |
|
|
1072 void |
|
|
1073 Sparse<T>::set_index (const idx_vector& idx_arg) |
|
|
1074 { |
|
5275
|
1075 octave_idx_type nd = ndims (); |
|
5164
|
1076 |
|
|
1077 if (! idx && nd > 0) |
|
|
1078 idx = new idx_vector [nd]; |
|
|
1079 |
|
|
1080 if (idx_count < nd) |
|
|
1081 { |
|
|
1082 idx[idx_count++] = idx_arg; |
|
|
1083 } |
|
|
1084 else |
|
|
1085 { |
|
|
1086 idx_vector *new_idx = new idx_vector [idx_count+1]; |
|
|
1087 |
|
5275
|
1088 for (octave_idx_type i = 0; i < idx_count; i++) |
|
5164
|
1089 new_idx[i] = idx[i]; |
|
|
1090 |
|
|
1091 new_idx[idx_count++] = idx_arg; |
|
|
1092 |
|
|
1093 delete [] idx; |
|
|
1094 |
|
|
1095 idx = new_idx; |
|
|
1096 } |
|
|
1097 } |
|
|
1098 |
|
|
1099 template <class T> |
|
|
1100 void |
|
|
1101 Sparse<T>::maybe_delete_elements (idx_vector& idx_arg) |
|
|
1102 { |
|
5275
|
1103 octave_idx_type nr = dim1 (); |
|
|
1104 octave_idx_type nc = dim2 (); |
|
5164
|
1105 |
|
|
1106 if (nr == 0 && nc == 0) |
|
|
1107 return; |
|
|
1108 |
|
5275
|
1109 octave_idx_type n; |
|
5164
|
1110 if (nr == 1) |
|
|
1111 n = nc; |
|
|
1112 else if (nc == 1) |
|
|
1113 n = nr; |
|
|
1114 else |
|
|
1115 { |
|
|
1116 // Reshape to row vector for Matlab compatibility. |
|
|
1117 |
|
|
1118 n = nr * nc; |
|
|
1119 nr = 1; |
|
|
1120 nc = n; |
|
|
1121 } |
|
|
1122 |
|
|
1123 if (idx_arg.is_colon_equiv (n, 1)) |
|
|
1124 { |
|
|
1125 // Either A(:) = [] or A(idx) = [] with idx enumerating all |
|
|
1126 // elements, so we delete all elements and return [](0x0). To |
|
|
1127 // preserve the orientation of the vector, you have to use |
|
|
1128 // A(idx,:) = [] (delete rows) or A(:,idx) (delete columns). |
|
|
1129 |
|
|
1130 resize_no_fill (0, 0); |
|
|
1131 return; |
|
|
1132 } |
|
|
1133 |
|
|
1134 idx_arg.sort (true); |
|
|
1135 |
|
5275
|
1136 octave_idx_type num_to_delete = idx_arg.length (n); |
|
5164
|
1137 |
|
|
1138 if (num_to_delete != 0) |
|
|
1139 { |
|
5275
|
1140 octave_idx_type new_n = n; |
|
5681
|
1141 octave_idx_type new_nnz = nnz (); |
|
5275
|
1142 |
|
|
1143 octave_idx_type iidx = 0; |
|
5164
|
1144 |
|
|
1145 const Sparse<T> tmp (*this); |
|
|
1146 |
|
5275
|
1147 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1148 { |
|
|
1149 OCTAVE_QUIT; |
|
|
1150 |
|
|
1151 if (i == idx_arg.elem (iidx)) |
|
|
1152 { |
|
|
1153 iidx++; |
|
|
1154 new_n--; |
|
|
1155 |
|
|
1156 if (tmp.elem (i) != T ()) |
|
5681
|
1157 new_nnz--; |
|
5164
|
1158 |
|
|
1159 if (iidx == num_to_delete) |
|
|
1160 break; |
|
|
1161 } |
|
|
1162 } |
|
|
1163 |
|
|
1164 if (new_n > 0) |
|
|
1165 { |
|
|
1166 rep->count--; |
|
|
1167 |
|
|
1168 if (nr == 1) |
|
5681
|
1169 rep = new typename Sparse<T>::SparseRep (1, new_n, new_nnz); |
|
5164
|
1170 else |
|
5681
|
1171 rep = new typename Sparse<T>::SparseRep (new_n, 1, new_nnz); |
|
5164
|
1172 |
|
5275
|
1173 octave_idx_type ii = 0; |
|
|
1174 octave_idx_type jj = 0; |
|
5164
|
1175 iidx = 0; |
|
5275
|
1176 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1177 { |
|
|
1178 OCTAVE_QUIT; |
|
|
1179 |
|
|
1180 if (iidx < num_to_delete && i == idx_arg.elem (iidx)) |
|
|
1181 iidx++; |
|
|
1182 else |
|
|
1183 { |
|
|
1184 T el = tmp.elem (i); |
|
|
1185 if (el != T ()) |
|
|
1186 { |
|
|
1187 data(ii) = el; |
|
|
1188 ridx(ii++) = jj; |
|
|
1189 } |
|
|
1190 jj++; |
|
|
1191 } |
|
|
1192 } |
|
|
1193 |
|
|
1194 dimensions.resize (2); |
|
|
1195 |
|
|
1196 if (nr == 1) |
|
|
1197 { |
|
|
1198 ii = 0; |
|
|
1199 cidx(0) = 0; |
|
5275
|
1200 for (octave_idx_type i = 0; i < new_n; i++) |
|
5164
|
1201 { |
|
|
1202 OCTAVE_QUIT; |
|
|
1203 if (ridx(ii) == i) |
|
|
1204 ridx(ii++) = 0; |
|
|
1205 cidx(i+1) = ii; |
|
|
1206 } |
|
|
1207 |
|
|
1208 dimensions(0) = 1; |
|
|
1209 dimensions(1) = new_n; |
|
|
1210 } |
|
|
1211 else |
|
|
1212 { |
|
|
1213 cidx(0) = 0; |
|
5681
|
1214 cidx(1) = new_nnz; |
|
5164
|
1215 dimensions(0) = new_n; |
|
|
1216 dimensions(1) = 1; |
|
|
1217 } |
|
|
1218 } |
|
|
1219 else |
|
|
1220 (*current_liboctave_error_handler) |
|
|
1221 ("A(idx) = []: index out of range"); |
|
|
1222 } |
|
|
1223 } |
|
|
1224 |
|
|
1225 template <class T> |
|
|
1226 void |
|
|
1227 Sparse<T>::maybe_delete_elements (idx_vector& idx_i, idx_vector& idx_j) |
|
|
1228 { |
|
|
1229 assert (ndims () == 2); |
|
|
1230 |
|
5275
|
1231 octave_idx_type nr = dim1 (); |
|
|
1232 octave_idx_type nc = dim2 (); |
|
5164
|
1233 |
|
|
1234 if (nr == 0 && nc == 0) |
|
|
1235 return; |
|
|
1236 |
|
|
1237 if (idx_i.is_colon ()) |
|
|
1238 { |
|
|
1239 if (idx_j.is_colon ()) |
|
|
1240 { |
|
|
1241 // A(:,:) -- We are deleting columns and rows, so the result |
|
|
1242 // is [](0x0). |
|
|
1243 |
|
|
1244 resize_no_fill (0, 0); |
|
|
1245 return; |
|
|
1246 } |
|
|
1247 |
|
|
1248 if (idx_j.is_colon_equiv (nc, 1)) |
|
|
1249 { |
|
|
1250 // A(:,j) -- We are deleting columns by enumerating them, |
|
|
1251 // If we enumerate all of them, we should have zero columns |
|
|
1252 // with the same number of rows that we started with. |
|
|
1253 |
|
|
1254 resize_no_fill (nr, 0); |
|
|
1255 return; |
|
|
1256 } |
|
|
1257 } |
|
|
1258 |
|
|
1259 if (idx_j.is_colon () && idx_i.is_colon_equiv (nr, 1)) |
|
|
1260 { |
|
|
1261 // A(i,:) -- We are deleting rows by enumerating them. If we |
|
|
1262 // enumerate all of them, we should have zero rows with the |
|
|
1263 // same number of columns that we started with. |
|
|
1264 |
|
|
1265 resize_no_fill (0, nc); |
|
|
1266 return; |
|
|
1267 } |
|
|
1268 |
|
|
1269 if (idx_i.is_colon_equiv (nr, 1)) |
|
|
1270 { |
|
|
1271 if (idx_j.is_colon_equiv (nc, 1)) |
|
|
1272 resize_no_fill (0, 0); |
|
|
1273 else |
|
|
1274 { |
|
|
1275 idx_j.sort (true); |
|
|
1276 |
|
5275
|
1277 octave_idx_type num_to_delete = idx_j.length (nc); |
|
5164
|
1278 |
|
|
1279 if (num_to_delete != 0) |
|
|
1280 { |
|
|
1281 if (nr == 1 && num_to_delete == nc) |
|
|
1282 resize_no_fill (0, 0); |
|
|
1283 else |
|
|
1284 { |
|
5275
|
1285 octave_idx_type new_nc = nc; |
|
5681
|
1286 octave_idx_type new_nnz = nnz (); |
|
5275
|
1287 |
|
|
1288 octave_idx_type iidx = 0; |
|
|
1289 |
|
|
1290 for (octave_idx_type j = 0; j < nc; j++) |
|
5164
|
1291 { |
|
|
1292 OCTAVE_QUIT; |
|
|
1293 |
|
|
1294 if (j == idx_j.elem (iidx)) |
|
|
1295 { |
|
|
1296 iidx++; |
|
|
1297 new_nc--; |
|
|
1298 |
|
5681
|
1299 new_nnz -= cidx(j+1) - cidx(j); |
|
5164
|
1300 |
|
|
1301 if (iidx == num_to_delete) |
|
|
1302 break; |
|
|
1303 } |
|
|
1304 } |
|
|
1305 |
|
|
1306 if (new_nc > 0) |
|
|
1307 { |
|
|
1308 const Sparse<T> tmp (*this); |
|
|
1309 --rep->count; |
|
|
1310 rep = new typename Sparse<T>::SparseRep (nr, new_nc, |
|
5681
|
1311 new_nnz); |
|
5275
|
1312 octave_idx_type ii = 0; |
|
|
1313 octave_idx_type jj = 0; |
|
5164
|
1314 iidx = 0; |
|
|
1315 cidx(0) = 0; |
|
5275
|
1316 for (octave_idx_type j = 0; j < nc; j++) |
|
5164
|
1317 { |
|
|
1318 OCTAVE_QUIT; |
|
|
1319 |
|
|
1320 if (iidx < num_to_delete && j == idx_j.elem (iidx)) |
|
|
1321 iidx++; |
|
|
1322 else |
|
|
1323 { |
|
5275
|
1324 for (octave_idx_type i = tmp.cidx(j); |
|
5164
|
1325 i < tmp.cidx(j+1); i++) |
|
|
1326 { |
|
|
1327 data(jj) = tmp.data(i); |
|
|
1328 ridx(jj++) = tmp.ridx(i); |
|
|
1329 } |
|
|
1330 cidx(++ii) = jj; |
|
|
1331 } |
|
|
1332 } |
|
|
1333 |
|
|
1334 dimensions.resize (2); |
|
|
1335 dimensions(1) = new_nc; |
|
|
1336 } |
|
|
1337 else |
|
|
1338 (*current_liboctave_error_handler) |
|
|
1339 ("A(idx) = []: index out of range"); |
|
|
1340 } |
|
|
1341 } |
|
|
1342 } |
|
|
1343 } |
|
|
1344 else if (idx_j.is_colon_equiv (nc, 1)) |
|
|
1345 { |
|
|
1346 if (idx_i.is_colon_equiv (nr, 1)) |
|
|
1347 resize_no_fill (0, 0); |
|
|
1348 else |
|
|
1349 { |
|
|
1350 idx_i.sort (true); |
|
|
1351 |
|
5275
|
1352 octave_idx_type num_to_delete = idx_i.length (nr); |
|
5164
|
1353 |
|
|
1354 if (num_to_delete != 0) |
|
|
1355 { |
|
|
1356 if (nc == 1 && num_to_delete == nr) |
|
|
1357 resize_no_fill (0, 0); |
|
|
1358 else |
|
|
1359 { |
|
5275
|
1360 octave_idx_type new_nr = nr; |
|
5681
|
1361 octave_idx_type new_nnz = nnz (); |
|
5275
|
1362 |
|
|
1363 octave_idx_type iidx = 0; |
|
|
1364 |
|
|
1365 for (octave_idx_type i = 0; i < nr; i++) |
|
5164
|
1366 { |
|
|
1367 OCTAVE_QUIT; |
|
|
1368 |
|
|
1369 if (i == idx_i.elem (iidx)) |
|
|
1370 { |
|
|
1371 iidx++; |
|
|
1372 new_nr--; |
|
|
1373 |
|
5681
|
1374 for (octave_idx_type j = 0; j < nnz (); j++) |
|
5164
|
1375 if (ridx(j) == i) |
|
5681
|
1376 new_nnz--; |
|
5164
|
1377 |
|
|
1378 if (iidx == num_to_delete) |
|
|
1379 break; |
|
|
1380 } |
|
|
1381 } |
|
|
1382 |
|
|
1383 if (new_nr > 0) |
|
|
1384 { |
|
|
1385 const Sparse<T> tmp (*this); |
|
|
1386 --rep->count; |
|
|
1387 rep = new typename Sparse<T>::SparseRep (new_nr, nc, |
|
5681
|
1388 new_nnz); |
|
5164
|
1389 |
|
5275
|
1390 octave_idx_type jj = 0; |
|
5164
|
1391 cidx(0) = 0; |
|
5275
|
1392 for (octave_idx_type i = 0; i < nc; i++) |
|
5164
|
1393 { |
|
|
1394 iidx = 0; |
|
5275
|
1395 for (octave_idx_type j = tmp.cidx(i); j < tmp.cidx(i+1); j++) |
|
5164
|
1396 { |
|
|
1397 OCTAVE_QUIT; |
|
|
1398 |
|
5275
|
1399 octave_idx_type ri = tmp.ridx(j); |
|
5164
|
1400 |
|
|
1401 while (iidx < num_to_delete && |
|
|
1402 ri > idx_i.elem (iidx)) |
|
|
1403 { |
|
|
1404 iidx++; |
|
|
1405 } |
|
|
1406 |
|
|
1407 if (iidx == num_to_delete || |
|
|
1408 ri != idx_i.elem(iidx)) |
|
|
1409 { |
|
|
1410 data(jj) = tmp.data(j); |
|
|
1411 ridx(jj++) = ri - iidx; |
|
|
1412 } |
|
|
1413 } |
|
|
1414 cidx(i+1) = jj; |
|
|
1415 } |
|
|
1416 |
|
|
1417 dimensions.resize (2); |
|
|
1418 dimensions(0) = new_nr; |
|
|
1419 } |
|
|
1420 else |
|
|
1421 (*current_liboctave_error_handler) |
|
|
1422 ("A(idx) = []: index out of range"); |
|
|
1423 } |
|
|
1424 } |
|
|
1425 } |
|
|
1426 } |
|
|
1427 } |
|
|
1428 |
|
|
1429 template <class T> |
|
|
1430 void |
|
|
1431 Sparse<T>::maybe_delete_elements (Array<idx_vector>& ra_idx) |
|
|
1432 { |
|
|
1433 if (ra_idx.length () == 1) |
|
|
1434 maybe_delete_elements (ra_idx(0)); |
|
|
1435 else if (ra_idx.length () == 2) |
|
|
1436 maybe_delete_elements (ra_idx(0), ra_idx(1)); |
|
|
1437 else |
|
|
1438 (*current_liboctave_error_handler) |
|
|
1439 ("range error for maybe_delete_elements"); |
|
|
1440 } |
|
|
1441 |
|
|
1442 template <class T> |
|
|
1443 Sparse<T> |
|
|
1444 Sparse<T>::value (void) |
|
|
1445 { |
|
|
1446 Sparse<T> retval; |
|
|
1447 |
|
|
1448 int n_idx = index_count (); |
|
|
1449 |
|
|
1450 if (n_idx == 2) |
|
|
1451 { |
|
|
1452 idx_vector *tmp = get_idx (); |
|
|
1453 |
|
|
1454 idx_vector idx_i = tmp[0]; |
|
|
1455 idx_vector idx_j = tmp[1]; |
|
|
1456 |
|
|
1457 retval = index (idx_i, idx_j); |
|
|
1458 } |
|
|
1459 else if (n_idx == 1) |
|
|
1460 { |
|
|
1461 retval = index (idx[0]); |
|
|
1462 } |
|
|
1463 else |
|
|
1464 (*current_liboctave_error_handler) |
|
|
1465 ("Sparse<T>::value: invalid number of indices specified"); |
|
|
1466 |
|
|
1467 clear_index (); |
|
|
1468 |
|
|
1469 return retval; |
|
|
1470 } |
|
|
1471 |
|
|
1472 template <class T> |
|
|
1473 Sparse<T> |
|
|
1474 Sparse<T>::index (idx_vector& idx_arg, int resize_ok) const |
|
|
1475 { |
|
|
1476 Sparse<T> retval; |
|
|
1477 |
|
|
1478 assert (ndims () == 2); |
|
|
1479 |
|
5275
|
1480 octave_idx_type nr = dim1 (); |
|
|
1481 octave_idx_type nc = dim2 (); |
|
5681
|
1482 octave_idx_type nz = nnz (); |
|
5275
|
1483 |
|
|
1484 octave_idx_type orig_len = nr * nc; |
|
5164
|
1485 |
|
|
1486 dim_vector idx_orig_dims = idx_arg.orig_dimensions (); |
|
|
1487 |
|
5275
|
1488 octave_idx_type idx_orig_rows = idx_arg.orig_rows (); |
|
|
1489 octave_idx_type idx_orig_columns = idx_arg.orig_columns (); |
|
5164
|
1490 |
|
|
1491 if (idx_orig_dims.length () > 2) |
|
|
1492 (*current_liboctave_error_handler) |
|
|
1493 ("Sparse<T>::index: Can not index Sparse<T> with an N-D Array"); |
|
|
1494 else if (idx_arg.is_colon ()) |
|
|
1495 { |
|
|
1496 // Fast magic colon processing. |
|
|
1497 retval = Sparse<T> (nr * nc, 1, nz); |
|
|
1498 |
|
5275
|
1499 for (octave_idx_type i = 0; i < nc; i++) |
|
|
1500 for (octave_idx_type j = cidx(i); j < cidx(i+1); j++) |
|
5164
|
1501 { |
|
|
1502 OCTAVE_QUIT; |
|
|
1503 retval.xdata(j) = data(j); |
|
|
1504 retval.xridx(j) = ridx(j) + i * nr; |
|
|
1505 } |
|
|
1506 retval.xcidx(0) = 0; |
|
|
1507 retval.xcidx(1) = nz; |
|
|
1508 } |
|
|
1509 else if (nr == 1 && nc == 1) |
|
|
1510 { |
|
|
1511 // You have to be pretty sick to get to this bit of code, |
|
|
1512 // since you have a scalar stored as a sparse matrix, and |
|
|
1513 // then want to make a dense matrix with sparse |
|
|
1514 // representation. Ok, we'll do it, but you deserve what |
|
|
1515 // you get!! |
|
5275
|
1516 octave_idx_type n = idx_arg.freeze (length (), "sparse vector", resize_ok); |
|
5164
|
1517 if (n == 0) |
|
|
1518 if (idx_arg.one_zero_only ()) |
|
|
1519 retval = Sparse<T> (dim_vector (0, 0)); |
|
|
1520 else |
|
|
1521 retval = Sparse<T> (dim_vector (0, 1)); |
|
|
1522 else if (nz < 1) |
|
|
1523 if (n >= idx_orig_dims.numel ()) |
|
|
1524 retval = Sparse<T> (idx_orig_dims); |
|
|
1525 else |
|
|
1526 retval = Sparse<T> (dim_vector (n, 1)); |
|
|
1527 else if (n >= idx_orig_dims.numel ()) |
|
|
1528 { |
|
|
1529 T el = elem (0); |
|
5275
|
1530 octave_idx_type new_nr = idx_orig_rows; |
|
|
1531 octave_idx_type new_nc = idx_orig_columns; |
|
|
1532 for (octave_idx_type i = 2; i < idx_orig_dims.length (); i++) |
|
5164
|
1533 new_nc *= idx_orig_dims (i); |
|
|
1534 |
|
|
1535 retval = Sparse<T> (new_nr, new_nc, idx_arg.ones_count ()); |
|
|
1536 |
|
5275
|
1537 octave_idx_type ic = 0; |
|
|
1538 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1539 { |
|
|
1540 if (i % new_nr == 0) |
|
|
1541 retval.xcidx(i % new_nr) = ic; |
|
|
1542 |
|
5275
|
1543 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1544 if (ii == 0) |
|
|
1545 { |
|
|
1546 OCTAVE_QUIT; |
|
|
1547 retval.xdata(ic) = el; |
|
|
1548 retval.xridx(ic++) = i % new_nr; |
|
|
1549 } |
|
|
1550 } |
|
|
1551 retval.xcidx (new_nc) = ic; |
|
|
1552 } |
|
|
1553 else |
|
|
1554 { |
|
|
1555 T el = elem (0); |
|
|
1556 retval = Sparse<T> (n, 1, nz); |
|
|
1557 |
|
5275
|
1558 for (octave_idx_type i = 0; i < nz; i++) |
|
5164
|
1559 { |
|
|
1560 OCTAVE_QUIT; |
|
|
1561 retval.xdata(i) = el; |
|
|
1562 retval.xridx(i) = i; |
|
|
1563 } |
|
|
1564 retval.xcidx(0) = 0; |
|
|
1565 retval.xcidx(1) = n; |
|
|
1566 } |
|
|
1567 } |
|
|
1568 else if (nr == 1 || nc == 1) |
|
|
1569 { |
|
|
1570 // If indexing a vector with a matrix, return value has same |
|
|
1571 // shape as the index. Otherwise, it has same orientation as |
|
|
1572 // indexed object. |
|
5275
|
1573 octave_idx_type len = length (); |
|
|
1574 octave_idx_type n = idx_arg.freeze (len, "sparse vector", resize_ok); |
|
5164
|
1575 |
|
|
1576 if (n == 0) |
|
|
1577 if (nr == 1) |
|
|
1578 retval = Sparse<T> (dim_vector (1, 0)); |
|
|
1579 else |
|
|
1580 retval = Sparse<T> (dim_vector (0, 1)); |
|
|
1581 else if (nz < 1) |
|
|
1582 if ((n != 0 && idx_arg.one_zero_only ()) |
|
|
1583 || idx_orig_rows == 1 || idx_orig_columns == 1) |
|
|
1584 retval = Sparse<T> ((nr == 1 ? 1 : n), (nr == 1 ? n : 1)); |
|
|
1585 else |
|
|
1586 retval = Sparse<T> (idx_orig_dims); |
|
|
1587 else |
|
|
1588 { |
|
|
1589 |
|
5604
|
1590 octave_idx_type new_nzmx = 0; |
|
5164
|
1591 if (nr == 1) |
|
5275
|
1592 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1593 { |
|
|
1594 OCTAVE_QUIT; |
|
|
1595 |
|
5275
|
1596 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1597 if (ii < len) |
|
|
1598 if (cidx(ii) != cidx(ii+1)) |
|
5604
|
1599 new_nzmx++; |
|
5164
|
1600 } |
|
|
1601 else |
|
5275
|
1602 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1603 { |
|
5275
|
1604 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1605 if (ii < len) |
|
5275
|
1606 for (octave_idx_type j = 0; j < nz; j++) |
|
5164
|
1607 { |
|
|
1608 OCTAVE_QUIT; |
|
|
1609 |
|
|
1610 if (ridx(j) == ii) |
|
5604
|
1611 new_nzmx++; |
|
5164
|
1612 if (ridx(j) >= ii) |
|
|
1613 break; |
|
|
1614 } |
|
|
1615 } |
|
|
1616 |
|
|
1617 if (idx_arg.one_zero_only () || idx_orig_rows == 1 || |
|
|
1618 idx_orig_columns == 1) |
|
|
1619 { |
|
|
1620 if (nr == 1) |
|
|
1621 { |
|
5604
|
1622 retval = Sparse<T> (1, n, new_nzmx); |
|
5275
|
1623 octave_idx_type jj = 0; |
|
5164
|
1624 retval.xcidx(0) = 0; |
|
5275
|
1625 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1626 { |
|
|
1627 OCTAVE_QUIT; |
|
|
1628 |
|
5275
|
1629 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1630 if (ii < len) |
|
|
1631 if (cidx(ii) != cidx(ii+1)) |
|
|
1632 { |
|
|
1633 retval.xdata(jj) = data(cidx(ii)); |
|
|
1634 retval.xridx(jj++) = 0; |
|
|
1635 } |
|
|
1636 retval.xcidx(i+1) = jj; |
|
|
1637 } |
|
|
1638 } |
|
|
1639 else |
|
|
1640 { |
|
5604
|
1641 retval = Sparse<T> (n, 1, new_nzmx); |
|
5164
|
1642 retval.xcidx(0) = 0; |
|
5604
|
1643 retval.xcidx(1) = new_nzmx; |
|
5275
|
1644 octave_idx_type jj = 0; |
|
|
1645 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1646 { |
|
5275
|
1647 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1648 if (ii < len) |
|
5275
|
1649 for (octave_idx_type j = 0; j < nz; j++) |
|
5164
|
1650 { |
|
|
1651 OCTAVE_QUIT; |
|
|
1652 |
|
|
1653 if (ridx(j) == ii) |
|
|
1654 { |
|
|
1655 retval.xdata(jj) = data(j); |
|
|
1656 retval.xridx(jj++) = i; |
|
|
1657 } |
|
|
1658 if (ridx(j) >= ii) |
|
|
1659 break; |
|
|
1660 } |
|
|
1661 } |
|
|
1662 } |
|
|
1663 } |
|
|
1664 else |
|
|
1665 { |
|
5275
|
1666 octave_idx_type new_nr; |
|
|
1667 octave_idx_type new_nc; |
|
5164
|
1668 if (n >= idx_orig_dims.numel ()) |
|
|
1669 { |
|
|
1670 new_nr = idx_orig_rows; |
|
|
1671 new_nc = idx_orig_columns; |
|
|
1672 } |
|
|
1673 else |
|
|
1674 { |
|
|
1675 new_nr = n; |
|
|
1676 new_nc = 1; |
|
|
1677 } |
|
|
1678 |
|
5604
|
1679 retval = Sparse<T> (new_nr, new_nc, new_nzmx); |
|
5164
|
1680 |
|
|
1681 if (nr == 1) |
|
|
1682 { |
|
5275
|
1683 octave_idx_type jj = 0; |
|
5164
|
1684 retval.xcidx(0) = 0; |
|
5275
|
1685 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1686 { |
|
|
1687 OCTAVE_QUIT; |
|
|
1688 |
|
5275
|
1689 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1690 if (ii < len) |
|
|
1691 if (cidx(ii) != cidx(ii+1)) |
|
|
1692 { |
|
|
1693 retval.xdata(jj) = data(cidx(ii)); |
|
|
1694 retval.xridx(jj++) = 0; |
|
|
1695 } |
|
|
1696 retval.xcidx(i/new_nr+1) = jj; |
|
|
1697 } |
|
|
1698 } |
|
|
1699 else |
|
|
1700 { |
|
5275
|
1701 octave_idx_type jj = 0; |
|
5164
|
1702 retval.xcidx(0) = 0; |
|
5275
|
1703 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1704 { |
|
5275
|
1705 octave_idx_type ii = idx_arg.elem (i); |
|
5164
|
1706 if (ii < len) |
|
5275
|
1707 for (octave_idx_type j = 0; j < nz; j++) |
|
5164
|
1708 { |
|
|
1709 OCTAVE_QUIT; |
|
|
1710 |
|
|
1711 if (ridx(j) == ii) |
|
|
1712 { |
|
|
1713 retval.xdata(jj) = data(j); |
|
|
1714 retval.xridx(jj++) = i; |
|
|
1715 } |
|
|
1716 if (ridx(j) >= ii) |
|
|
1717 break; |
|
|
1718 } |
|
|
1719 retval.xcidx(i/new_nr+1) = jj; |
|
|
1720 } |
|
|
1721 } |
|
|
1722 } |
|
|
1723 } |
|
|
1724 } |
|
|
1725 else |
|
|
1726 { |
|
5781
|
1727 if (! (idx_arg.one_zero_only () |
|
|
1728 && idx_orig_rows == nr |
|
|
1729 && idx_orig_columns == nc)) |
|
|
1730 (*current_liboctave_warning_with_id_handler) |
|
|
1731 ("Octave:fortran-indexing", "single index used for sparse matrix"); |
|
5164
|
1732 |
|
|
1733 // This code is only for indexing matrices. The vector |
|
|
1734 // cases are handled above. |
|
|
1735 |
|
|
1736 idx_arg.freeze (nr * nc, "matrix", resize_ok); |
|
|
1737 |
|
|
1738 if (idx_arg) |
|
|
1739 { |
|
5275
|
1740 octave_idx_type result_nr = idx_orig_rows; |
|
|
1741 octave_idx_type result_nc = idx_orig_columns; |
|
5164
|
1742 |
|
|
1743 if (idx_arg.one_zero_only ()) |
|
|
1744 { |
|
|
1745 result_nr = idx_arg.ones_count (); |
|
|
1746 result_nc = (result_nr > 0 ? 1 : 0); |
|
|
1747 } |
|
|
1748 |
|
|
1749 if (nz < 1) |
|
|
1750 retval = Sparse<T> (result_nr, result_nc); |
|
|
1751 else |
|
|
1752 { |
|
|
1753 // Count number of non-zero elements |
|
5604
|
1754 octave_idx_type new_nzmx = 0; |
|
5275
|
1755 octave_idx_type kk = 0; |
|
|
1756 for (octave_idx_type j = 0; j < result_nc; j++) |
|
5164
|
1757 { |
|
5275
|
1758 for (octave_idx_type i = 0; i < result_nr; i++) |
|
5164
|
1759 { |
|
|
1760 OCTAVE_QUIT; |
|
|
1761 |
|
5275
|
1762 octave_idx_type ii = idx_arg.elem (kk++); |
|
5164
|
1763 if (ii < orig_len) |
|
|
1764 { |
|
5275
|
1765 octave_idx_type fr = ii % nr; |
|
|
1766 octave_idx_type fc = (ii - fr) / nr; |
|
|
1767 for (octave_idx_type k = cidx(fc); k < cidx(fc+1); k++) |
|
5164
|
1768 { |
|
|
1769 if (ridx(k) == fr) |
|
5604
|
1770 new_nzmx++; |
|
5164
|
1771 if (ridx(k) >= fr) |
|
|
1772 break; |
|
|
1773 } |
|
|
1774 } |
|
|
1775 } |
|
|
1776 } |
|
|
1777 |
|
5604
|
1778 retval = Sparse<T> (result_nr, result_nc, new_nzmx); |
|
5164
|
1779 |
|
|
1780 kk = 0; |
|
5275
|
1781 octave_idx_type jj = 0; |
|
5164
|
1782 retval.xcidx(0) = 0; |
|
5275
|
1783 for (octave_idx_type j = 0; j < result_nc; j++) |
|
5164
|
1784 { |
|
5275
|
1785 for (octave_idx_type i = 0; i < result_nr; i++) |
|
5164
|
1786 { |
|
|
1787 OCTAVE_QUIT; |
|
|
1788 |
|
5275
|
1789 octave_idx_type ii = idx_arg.elem (kk++); |
|
5164
|
1790 if (ii < orig_len) |
|
|
1791 { |
|
5275
|
1792 octave_idx_type fr = ii % nr; |
|
|
1793 octave_idx_type fc = (ii - fr) / nr; |
|
|
1794 for (octave_idx_type k = cidx(fc); k < cidx(fc+1); k++) |
|
5164
|
1795 { |
|
|
1796 if (ridx(k) == fr) |
|
|
1797 { |
|
|
1798 retval.xdata(jj) = data(k); |
|
|
1799 retval.xridx(jj++) = i; |
|
|
1800 } |
|
|
1801 if (ridx(k) >= fr) |
|
|
1802 break; |
|
|
1803 } |
|
|
1804 } |
|
|
1805 } |
|
|
1806 retval.xcidx(j+1) = jj; |
|
|
1807 } |
|
|
1808 } |
|
|
1809 // idx_vector::freeze() printed an error message for us. |
|
|
1810 } |
|
|
1811 } |
|
|
1812 |
|
|
1813 return retval; |
|
|
1814 } |
|
|
1815 |
|
|
1816 template <class T> |
|
|
1817 Sparse<T> |
|
|
1818 Sparse<T>::index (idx_vector& idx_i, idx_vector& idx_j, int resize_ok) const |
|
|
1819 { |
|
|
1820 Sparse<T> retval; |
|
|
1821 |
|
|
1822 assert (ndims () == 2); |
|
|
1823 |
|
5275
|
1824 octave_idx_type nr = dim1 (); |
|
|
1825 octave_idx_type nc = dim2 (); |
|
|
1826 |
|
|
1827 octave_idx_type n = idx_i.freeze (nr, "row", resize_ok); |
|
|
1828 octave_idx_type m = idx_j.freeze (nc, "column", resize_ok); |
|
5164
|
1829 |
|
|
1830 if (idx_i && idx_j) |
|
|
1831 { |
|
|
1832 if (idx_i.orig_empty () || idx_j.orig_empty () || n == 0 || m == 0) |
|
|
1833 { |
|
|
1834 retval.resize_no_fill (n, m); |
|
|
1835 } |
|
5681
|
1836 else |
|
5164
|
1837 { |
|
5681
|
1838 int idx_i_colon = idx_i.is_colon_equiv (nr); |
|
|
1839 int idx_j_colon = idx_j.is_colon_equiv (nc); |
|
|
1840 |
|
|
1841 if (idx_i_colon && idx_j_colon) |
|
|
1842 { |
|
|
1843 retval = *this; |
|
|
1844 } |
|
|
1845 else |
|
5164
|
1846 { |
|
5681
|
1847 // Identify if the indices have any repeated values |
|
|
1848 bool permutation = true; |
|
|
1849 |
|
|
1850 OCTAVE_LOCAL_BUFFER (octave_idx_type, itmp, |
|
|
1851 (nr > nc ? nr : nc)); |
|
|
1852 octave_sort<octave_idx_type> sort; |
|
|
1853 |
|
|
1854 if (n > nr || m > nc) |
|
|
1855 permutation = false; |
|
|
1856 |
|
|
1857 if (permutation && ! idx_i_colon) |
|
|
1858 { |
|
|
1859 // Can't use something like |
|
|
1860 // idx_vector tmp_idx = idx_i; |
|
|
1861 // tmp_idx.sort (true); |
|
|
1862 // if (tmp_idx.length(nr) != n) |
|
|
1863 // permutation = false; |
|
|
1864 // here as there is no make_unique function |
|
|
1865 // for idx_vector type. |
|
|
1866 for (octave_idx_type i = 0; i < n; i++) |
|
|
1867 itmp [i] = idx_i.elem (i); |
|
|
1868 sort.sort (itmp, n); |
|
|
1869 for (octave_idx_type i = 1; i < n; i++) |
|
|
1870 if (itmp[i-1] == itmp[i]) |
|
|
1871 { |
|
|
1872 permutation = false; |
|
|
1873 break; |
|
|
1874 } |
|
|
1875 } |
|
|
1876 if (permutation && ! idx_j_colon) |
|
|
1877 { |
|
|
1878 for (octave_idx_type i = 0; i < m; i++) |
|
|
1879 itmp [i] = idx_j.elem (i); |
|
|
1880 sort.sort (itmp, m); |
|
|
1881 for (octave_idx_type i = 1; i < m; i++) |
|
|
1882 if (itmp[i-1] == itmp[i]) |
|
|
1883 { |
|
|
1884 permutation = false; |
|
|
1885 break; |
|
|
1886 } |
|
|
1887 } |
|
|
1888 |
|
|
1889 if (permutation) |
|
5164
|
1890 { |
|
5681
|
1891 // Special case permutation like indexing for speed |
|
|
1892 retval = Sparse<T> (n, m, nnz ()); |
|
|
1893 octave_idx_type *ri = retval.xridx (); |
|
|
1894 |
|
5766
|
1895 std::vector<T> X (n); |
|
5681
|
1896 for (octave_idx_type i = 0; i < nr; i++) |
|
|
1897 itmp [i] = -1; |
|
|
1898 for (octave_idx_type i = 0; i < n; i++) |
|
|
1899 itmp[idx_i.elem(i)] = i; |
|
|
1900 |
|
|
1901 octave_idx_type kk = 0; |
|
|
1902 retval.xcidx(0) = 0; |
|
|
1903 for (octave_idx_type j = 0; j < m; j++) |
|
|
1904 { |
|
|
1905 octave_idx_type jj = idx_j.elem (j); |
|
|
1906 for (octave_idx_type i = cidx(jj); i < cidx(jj+1); i++) |
|
|
1907 { |
|
|
1908 octave_idx_type ii = itmp [ridx(i)]; |
|
|
1909 if (ii >= 0) |
|
|
1910 { |
|
|
1911 X [ii] = data (i); |
|
|
1912 retval.xridx (kk++) = ii; |
|
|
1913 } |
|
|
1914 } |
|
|
1915 sort.sort (ri + retval.xcidx (j), kk - retval.xcidx (j)); |
|
|
1916 for (octave_idx_type p = retval.xcidx (j); p < kk; p++) |
|
|
1917 retval.xdata (p) = X [retval.xridx (p)]; |
|
|
1918 retval.xcidx(j+1) = kk; |
|
|
1919 } |
|
|
1920 retval.maybe_compress (); |
|
|
1921 } |
|
|
1922 else |
|
|
1923 { |
|
|
1924 // First count the number of non-zero elements |
|
|
1925 octave_idx_type new_nzmx = 0; |
|
|
1926 for (octave_idx_type j = 0; j < m; j++) |
|
5164
|
1927 { |
|
5681
|
1928 octave_idx_type jj = idx_j.elem (j); |
|
|
1929 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
1930 { |
|
5681
|
1931 OCTAVE_QUIT; |
|
|
1932 |
|
|
1933 octave_idx_type ii = idx_i.elem (i); |
|
|
1934 if (ii < nr && jj < nc) |
|
|
1935 { |
|
|
1936 for (octave_idx_type k = cidx(jj); k < cidx(jj+1); k++) |
|
|
1937 { |
|
|
1938 if (ridx(k) == ii) |
|
|
1939 new_nzmx++; |
|
|
1940 if (ridx(k) >= ii) |
|
|
1941 break; |
|
|
1942 } |
|
|
1943 } |
|
5164
|
1944 } |
|
|
1945 } |
|
5681
|
1946 |
|
|
1947 retval = Sparse<T> (n, m, new_nzmx); |
|
|
1948 |
|
|
1949 octave_idx_type kk = 0; |
|
|
1950 retval.xcidx(0) = 0; |
|
|
1951 for (octave_idx_type j = 0; j < m; j++) |
|
|
1952 { |
|
|
1953 octave_idx_type jj = idx_j.elem (j); |
|
|
1954 for (octave_idx_type i = 0; i < n; i++) |
|
|
1955 { |
|
|
1956 OCTAVE_QUIT; |
|
|
1957 |
|
|
1958 octave_idx_type ii = idx_i.elem (i); |
|
|
1959 if (ii < nr && jj < nc) |
|
|
1960 { |
|
|
1961 for (octave_idx_type k = cidx(jj); k < cidx(jj+1); k++) |
|
|
1962 { |
|
|
1963 if (ridx(k) == ii) |
|
|
1964 { |
|
|
1965 retval.xdata(kk) = data(k); |
|
|
1966 retval.xridx(kk++) = i; |
|
|
1967 } |
|
|
1968 if (ridx(k) >= ii) |
|
|
1969 break; |
|
|
1970 } |
|
|
1971 } |
|
|
1972 } |
|
|
1973 retval.xcidx(j+1) = kk; |
|
|
1974 } |
|
5164
|
1975 } |
|
|
1976 } |
|
|
1977 } |
|
|
1978 } |
|
|
1979 // idx_vector::freeze() printed an error message for us. |
|
|
1980 |
|
|
1981 return retval; |
|
|
1982 } |
|
|
1983 |
|
|
1984 template <class T> |
|
|
1985 Sparse<T> |
|
|
1986 Sparse<T>::index (Array<idx_vector>& ra_idx, int resize_ok) const |
|
|
1987 { |
|
|
1988 |
|
|
1989 if (ra_idx.length () != 2) |
|
|
1990 { |
|
|
1991 (*current_liboctave_error_handler) ("range error for index"); |
|
|
1992 return *this; |
|
|
1993 } |
|
|
1994 |
|
|
1995 return index (ra_idx (0), ra_idx (1), resize_ok); |
|
|
1996 } |
|
|
1997 |
|
5775
|
1998 // FIXME |
|
5164
|
1999 // Unfortunately numel can overflow for very large but very sparse matrices. |
|
|
2000 // For now just flag an error when this happens. |
|
|
2001 template <class LT, class RT> |
|
|
2002 int |
|
|
2003 assign1 (Sparse<LT>& lhs, const Sparse<RT>& rhs) |
|
|
2004 { |
|
|
2005 int retval = 1; |
|
|
2006 |
|
|
2007 idx_vector *idx_tmp = lhs.get_idx (); |
|
|
2008 |
|
|
2009 idx_vector lhs_idx = idx_tmp[0]; |
|
|
2010 |
|
5275
|
2011 octave_idx_type lhs_len = lhs.numel (); |
|
|
2012 octave_idx_type rhs_len = rhs.numel (); |
|
5164
|
2013 |
|
5828
|
2014 uint64_t long_lhs_len = |
|
|
2015 static_cast<uint64_t> (lhs.rows ()) * |
|
|
2016 static_cast<uint64_t> (lhs.cols ()); |
|
|
2017 |
|
|
2018 uint64_t long_rhs_len = |
|
|
2019 static_cast<uint64_t> (rhs.rows ()) * |
|
|
2020 static_cast<uint64_t> (rhs.cols ()); |
|
|
2021 |
|
|
2022 if (long_rhs_len != static_cast<uint64_t>(rhs_len) || |
|
|
2023 long_lhs_len != static_cast<uint64_t>(lhs_len)) |
|
5164
|
2024 { |
|
|
2025 (*current_liboctave_error_handler) |
|
|
2026 ("A(I) = X: Matrix dimensions too large to ensure correct\n", |
|
|
2027 "operation. This is an limitation that should be removed\n", |
|
|
2028 "in the future."); |
|
|
2029 |
|
|
2030 lhs.clear_index (); |
|
|
2031 return 0; |
|
|
2032 } |
|
|
2033 |
|
5275
|
2034 octave_idx_type nr = lhs.rows (); |
|
|
2035 octave_idx_type nc = lhs.cols (); |
|
5681
|
2036 octave_idx_type nz = lhs.nnz (); |
|
5275
|
2037 |
|
5781
|
2038 octave_idx_type n = lhs_idx.freeze (lhs_len, "vector", true); |
|
5164
|
2039 |
|
|
2040 if (n != 0) |
|
|
2041 { |
|
5275
|
2042 octave_idx_type max_idx = lhs_idx.max () + 1; |
|
5164
|
2043 max_idx = max_idx < lhs_len ? lhs_len : max_idx; |
|
|
2044 |
|
|
2045 // Take a constant copy of lhs. This means that elem won't |
|
|
2046 // create missing elements. |
|
|
2047 const Sparse<LT> c_lhs (lhs); |
|
|
2048 |
|
|
2049 if (rhs_len == n) |
|
|
2050 { |
|
5681
|
2051 octave_idx_type new_nzmx = lhs.nnz (); |
|
5164
|
2052 |
|
5603
|
2053 OCTAVE_LOCAL_BUFFER (octave_idx_type, rhs_idx, n); |
|
|
2054 if (! lhs_idx.is_colon ()) |
|
|
2055 { |
|
|
2056 // Ok here we have to be careful with the indexing, |
|
|
2057 // to treat cases like "a([3,2,1]) = b", and still |
|
|
2058 // handle the need for strict sorting of the sparse |
|
|
2059 // elements. |
|
|
2060 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort *, sidx, n); |
|
|
2061 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort, sidxX, n); |
|
|
2062 |
|
|
2063 for (octave_idx_type i = 0; i < n; i++) |
|
|
2064 { |
|
|
2065 sidx[i] = &sidxX[i]; |
|
|
2066 sidx[i]->i = lhs_idx.elem(i); |
|
|
2067 sidx[i]->idx = i; |
|
|
2068 } |
|
|
2069 |
|
|
2070 OCTAVE_QUIT; |
|
|
2071 octave_sort<octave_idx_vector_sort *> |
|
|
2072 sort (octave_idx_vector_comp); |
|
|
2073 |
|
|
2074 sort.sort (sidx, n); |
|
|
2075 |
|
|
2076 intNDArray<octave_idx_type> new_idx (dim_vector (n,1)); |
|
|
2077 |
|
|
2078 for (octave_idx_type i = 0; i < n; i++) |
|
|
2079 { |
|
|
2080 new_idx.xelem(i) = sidx[i]->i + 1; |
|
|
2081 rhs_idx[i] = sidx[i]->idx; |
|
|
2082 } |
|
|
2083 |
|
|
2084 lhs_idx = idx_vector (new_idx); |
|
|
2085 } |
|
|
2086 else |
|
|
2087 for (octave_idx_type i = 0; i < n; i++) |
|
|
2088 rhs_idx[i] = i; |
|
|
2089 |
|
5164
|
2090 // First count the number of non-zero elements |
|
5275
|
2091 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
2092 { |
|
|
2093 OCTAVE_QUIT; |
|
|
2094 |
|
5275
|
2095 octave_idx_type ii = lhs_idx.elem (i); |
|
5164
|
2096 if (ii < lhs_len && c_lhs.elem(ii) != LT ()) |
|
5604
|
2097 new_nzmx--; |
|
5603
|
2098 if (rhs.elem(rhs_idx[i]) != RT ()) |
|
5604
|
2099 new_nzmx++; |
|
5164
|
2100 } |
|
|
2101 |
|
|
2102 if (nr > 1) |
|
|
2103 { |
|
5604
|
2104 Sparse<LT> tmp (max_idx, 1, new_nzmx); |
|
5164
|
2105 tmp.cidx(0) = 0; |
|
5681
|
2106 tmp.cidx(1) = new_nzmx; |
|
5164
|
2107 |
|
5275
|
2108 octave_idx_type i = 0; |
|
|
2109 octave_idx_type ii = 0; |
|
5164
|
2110 if (i < nz) |
|
|
2111 ii = c_lhs.ridx(i); |
|
|
2112 |
|
5275
|
2113 octave_idx_type j = 0; |
|
|
2114 octave_idx_type jj = lhs_idx.elem(j); |
|
|
2115 |
|
|
2116 octave_idx_type kk = 0; |
|
5164
|
2117 |
|
|
2118 while (j < n || i < nz) |
|
|
2119 { |
|
|
2120 if (j == n || (i < nz && ii < jj)) |
|
|
2121 { |
|
|
2122 tmp.xdata (kk) = c_lhs.data (i); |
|
|
2123 tmp.xridx (kk++) = ii; |
|
|
2124 if (++i < nz) |
|
|
2125 ii = c_lhs.ridx(i); |
|
|
2126 } |
|
|
2127 else |
|
|
2128 { |
|
5603
|
2129 RT rtmp = rhs.elem (rhs_idx[j]); |
|
5164
|
2130 if (rtmp != RT ()) |
|
|
2131 { |
|
|
2132 tmp.xdata (kk) = rtmp; |
|
|
2133 tmp.xridx (kk++) = jj; |
|
|
2134 } |
|
|
2135 |
|
|
2136 if (ii == jj && i < nz) |
|
|
2137 if (++i < nz) |
|
|
2138 ii = c_lhs.ridx(i); |
|
|
2139 if (++j < n) |
|
|
2140 jj = lhs_idx.elem(j); |
|
|
2141 } |
|
|
2142 } |
|
|
2143 |
|
|
2144 lhs = tmp; |
|
|
2145 } |
|
|
2146 else |
|
|
2147 { |
|
5604
|
2148 Sparse<LT> tmp (1, max_idx, new_nzmx); |
|
5164
|
2149 |
|
5275
|
2150 octave_idx_type i = 0; |
|
|
2151 octave_idx_type ii = 0; |
|
5164
|
2152 while (ii < nc && c_lhs.cidx(ii+1) <= i) |
|
|
2153 ii++; |
|
|
2154 |
|
5275
|
2155 octave_idx_type j = 0; |
|
|
2156 octave_idx_type jj = lhs_idx.elem(j); |
|
|
2157 |
|
|
2158 octave_idx_type kk = 0; |
|
|
2159 octave_idx_type ic = 0; |
|
5164
|
2160 |
|
|
2161 while (j < n || i < nz) |
|
|
2162 { |
|
|
2163 if (j == n || (i < nz && ii < jj)) |
|
|
2164 { |
|
|
2165 while (ic <= ii) |
|
|
2166 tmp.xcidx (ic++) = kk; |
|
|
2167 tmp.xdata (kk) = c_lhs.data (i); |
|
5603
|
2168 tmp.xridx (kk++) = 0; |
|
5164
|
2169 i++; |
|
|
2170 while (ii < nc && c_lhs.cidx(ii+1) <= i) |
|
|
2171 ii++; |
|
|
2172 } |
|
|
2173 else |
|
|
2174 { |
|
|
2175 while (ic <= jj) |
|
|
2176 tmp.xcidx (ic++) = kk; |
|
|
2177 |
|
5603
|
2178 RT rtmp = rhs.elem (rhs_idx[j]); |
|
5164
|
2179 if (rtmp != RT ()) |
|
5603
|
2180 { |
|
|
2181 tmp.xdata (kk) = rtmp; |
|
|
2182 tmp.xridx (kk++) = 0; |
|
|
2183 } |
|
5164
|
2184 if (ii == jj) |
|
|
2185 { |
|
|
2186 i++; |
|
|
2187 while (ii < nc && c_lhs.cidx(ii+1) <= i) |
|
|
2188 ii++; |
|
|
2189 } |
|
|
2190 j++; |
|
|
2191 if (j < n) |
|
|
2192 jj = lhs_idx.elem(j); |
|
|
2193 } |
|
|
2194 } |
|
|
2195 |
|
5275
|
2196 for (octave_idx_type iidx = ic; iidx < max_idx+1; iidx++) |
|
5164
|
2197 tmp.xcidx(iidx) = kk; |
|
|
2198 |
|
|
2199 lhs = tmp; |
|
|
2200 } |
|
|
2201 } |
|
|
2202 else if (rhs_len == 1) |
|
|
2203 { |
|
5681
|
2204 octave_idx_type new_nzmx = lhs.nnz (); |
|
5164
|
2205 RT scalar = rhs.elem (0); |
|
|
2206 bool scalar_non_zero = (scalar != RT ()); |
|
5603
|
2207 lhs_idx.sort (true); |
|
5164
|
2208 |
|
|
2209 // First count the number of non-zero elements |
|
|
2210 if (scalar != RT ()) |
|
5604
|
2211 new_nzmx += n; |
|
5275
|
2212 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
2213 { |
|
|
2214 OCTAVE_QUIT; |
|
|
2215 |
|
5275
|
2216 octave_idx_type ii = lhs_idx.elem (i); |
|
5164
|
2217 if (ii < lhs_len && c_lhs.elem(ii) != LT ()) |
|
5604
|
2218 new_nzmx--; |
|
5164
|
2219 } |
|
|
2220 |
|
|
2221 if (nr > 1) |
|
|
2222 { |
|
5604
|
2223 Sparse<LT> tmp (max_idx, 1, new_nzmx); |
|
5164
|
2224 tmp.cidx(0) = 0; |
|
5681
|
2225 tmp.cidx(1) = new_nzmx; |
|
5164
|
2226 |
|
5275
|
2227 octave_idx_type i = 0; |
|
|
2228 octave_idx_type ii = 0; |
|
5164
|
2229 if (i < nz) |
|
|
2230 ii = c_lhs.ridx(i); |
|
|
2231 |
|
5275
|
2232 octave_idx_type j = 0; |
|
|
2233 octave_idx_type jj = lhs_idx.elem(j); |
|
|
2234 |
|
|
2235 octave_idx_type kk = 0; |
|
5164
|
2236 |
|
|
2237 while (j < n || i < nz) |
|
|
2238 { |
|
|
2239 if (j == n || (i < nz && ii < jj)) |
|
|
2240 { |
|
|
2241 tmp.xdata (kk) = c_lhs.data (i); |
|
|
2242 tmp.xridx (kk++) = ii; |
|
|
2243 if (++i < nz) |
|
|
2244 ii = c_lhs.ridx(i); |
|
|
2245 } |
|
|
2246 else |
|
|
2247 { |
|
|
2248 if (scalar_non_zero) |
|
|
2249 { |
|
|
2250 tmp.xdata (kk) = scalar; |
|
|
2251 tmp.xridx (kk++) = jj; |
|
|
2252 } |
|
|
2253 |
|
|
2254 if (ii == jj && i < nz) |
|
|
2255 if (++i < nz) |
|
|
2256 ii = c_lhs.ridx(i); |
|
|
2257 if (++j < n) |
|
|
2258 jj = lhs_idx.elem(j); |
|
|
2259 } |
|
|
2260 } |
|
|
2261 |
|
|
2262 lhs = tmp; |
|
|
2263 } |
|
|
2264 else |
|
|
2265 { |
|
5604
|
2266 Sparse<LT> tmp (1, max_idx, new_nzmx); |
|
5164
|
2267 |
|
5275
|
2268 octave_idx_type i = 0; |
|
|
2269 octave_idx_type ii = 0; |
|
5164
|
2270 while (ii < nc && c_lhs.cidx(ii+1) <= i) |
|
|
2271 ii++; |
|
|
2272 |
|
5275
|
2273 octave_idx_type j = 0; |
|
|
2274 octave_idx_type jj = lhs_idx.elem(j); |
|
|
2275 |
|
|
2276 octave_idx_type kk = 0; |
|
|
2277 octave_idx_type ic = 0; |
|
5164
|
2278 |
|
|
2279 while (j < n || i < nz) |
|
|
2280 { |
|
|
2281 if (j == n || (i < nz && ii < jj)) |
|
|
2282 { |
|
|
2283 while (ic <= ii) |
|
|
2284 tmp.xcidx (ic++) = kk; |
|
|
2285 tmp.xdata (kk) = c_lhs.data (i); |
|
|
2286 i++; |
|
|
2287 while (ii < nc && c_lhs.cidx(ii+1) <= i) |
|
|
2288 ii++; |
|
|
2289 } |
|
|
2290 else |
|
|
2291 { |
|
|
2292 while (ic <= jj) |
|
|
2293 tmp.xcidx (ic++) = kk; |
|
|
2294 if (scalar_non_zero) |
|
|
2295 tmp.xdata (kk) = scalar; |
|
|
2296 if (ii == jj) |
|
|
2297 { |
|
|
2298 i++; |
|
|
2299 while (ii < nc && c_lhs.cidx(ii+1) <= i) |
|
|
2300 ii++; |
|
|
2301 } |
|
|
2302 j++; |
|
|
2303 if (j < n) |
|
|
2304 jj = lhs_idx.elem(j); |
|
|
2305 } |
|
|
2306 tmp.xridx (kk++) = 0; |
|
|
2307 } |
|
|
2308 |
|
5275
|
2309 for (octave_idx_type iidx = ic; iidx < max_idx+1; iidx++) |
|
5164
|
2310 tmp.xcidx(iidx) = kk; |
|
|
2311 |
|
|
2312 lhs = tmp; |
|
|
2313 } |
|
|
2314 } |
|
|
2315 else |
|
|
2316 { |
|
|
2317 (*current_liboctave_error_handler) |
|
|
2318 ("A(I) = X: X must be a scalar or a vector with same length as I"); |
|
|
2319 |
|
|
2320 retval = 0; |
|
|
2321 } |
|
|
2322 } |
|
|
2323 else if (lhs_idx.is_colon ()) |
|
|
2324 { |
|
|
2325 if (lhs_len == 0) |
|
|
2326 { |
|
|
2327 |
|
5681
|
2328 octave_idx_type new_nzmx = rhs.nnz (); |
|
5604
|
2329 Sparse<LT> tmp (1, rhs_len, new_nzmx); |
|
5164
|
2330 |
|
5275
|
2331 octave_idx_type ii = 0; |
|
|
2332 octave_idx_type jj = 0; |
|
|
2333 for (octave_idx_type i = 0; i < rhs.cols(); i++) |
|
|
2334 for (octave_idx_type j = rhs.cidx(i); j < rhs.cidx(i+1); j++) |
|
5164
|
2335 { |
|
|
2336 OCTAVE_QUIT; |
|
5275
|
2337 for (octave_idx_type k = jj; k <= i * rhs.rows() + rhs.ridx(j); k++) |
|
5164
|
2338 tmp.cidx(jj++) = ii; |
|
|
2339 |
|
|
2340 tmp.data(ii) = rhs.data(j); |
|
|
2341 tmp.ridx(ii++) = 0; |
|
|
2342 } |
|
|
2343 |
|
5275
|
2344 for (octave_idx_type i = jj; i < rhs_len + 1; i++) |
|
5164
|
2345 tmp.cidx(i) = ii; |
|
|
2346 |
|
|
2347 lhs = tmp; |
|
|
2348 } |
|
|
2349 else |
|
|
2350 (*current_liboctave_error_handler) |
|
|
2351 ("A(:) = X: A must be the same size as X"); |
|
|
2352 } |
|
|
2353 else if (! (rhs_len == 1 || rhs_len == 0)) |
|
|
2354 { |
|
|
2355 (*current_liboctave_error_handler) |
|
|
2356 ("A([]) = X: X must also be an empty matrix or a scalar"); |
|
|
2357 |
|
|
2358 retval = 0; |
|
|
2359 } |
|
|
2360 |
|
|
2361 lhs.clear_index (); |
|
|
2362 |
|
|
2363 return retval; |
|
|
2364 } |
|
|
2365 |
|
|
2366 template <class LT, class RT> |
|
|
2367 int |
|
|
2368 assign (Sparse<LT>& lhs, const Sparse<RT>& rhs) |
|
|
2369 { |
|
|
2370 int retval = 1; |
|
|
2371 |
|
|
2372 int n_idx = lhs.index_count (); |
|
|
2373 |
|
5275
|
2374 octave_idx_type lhs_nr = lhs.rows (); |
|
|
2375 octave_idx_type lhs_nc = lhs.cols (); |
|
5681
|
2376 octave_idx_type lhs_nz = lhs.nnz (); |
|
5275
|
2377 |
|
|
2378 octave_idx_type rhs_nr = rhs.rows (); |
|
|
2379 octave_idx_type rhs_nc = rhs.cols (); |
|
5164
|
2380 |
|
|
2381 idx_vector *tmp = lhs.get_idx (); |
|
|
2382 |
|
|
2383 idx_vector idx_i; |
|
|
2384 idx_vector idx_j; |
|
|
2385 |
|
|
2386 if (n_idx > 2) |
|
|
2387 { |
|
|
2388 (*current_liboctave_error_handler) |
|
|
2389 ("A(I, J) = X: can only have 1 or 2 indexes for sparse matrices"); |
|
|
2390 return 0; |
|
|
2391 } |
|
|
2392 |
|
|
2393 if (n_idx > 1) |
|
|
2394 idx_j = tmp[1]; |
|
|
2395 |
|
|
2396 if (n_idx > 0) |
|
|
2397 idx_i = tmp[0]; |
|
|
2398 |
|
|
2399 if (n_idx == 2) |
|
|
2400 { |
|
5781
|
2401 octave_idx_type n = idx_i.freeze (lhs_nr, "row", true); |
|
|
2402 octave_idx_type m = idx_j.freeze (lhs_nc, "column", true); |
|
5164
|
2403 |
|
|
2404 int idx_i_is_colon = idx_i.is_colon (); |
|
|
2405 int idx_j_is_colon = idx_j.is_colon (); |
|
|
2406 |
|
|
2407 if (idx_i_is_colon) |
|
|
2408 n = lhs_nr > 0 ? lhs_nr : rhs_nr; |
|
|
2409 |
|
|
2410 if (idx_j_is_colon) |
|
|
2411 m = lhs_nc > 0 ? lhs_nc : rhs_nc; |
|
|
2412 |
|
|
2413 if (idx_i && idx_j) |
|
|
2414 { |
|
|
2415 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2416 { |
|
|
2417 lhs.maybe_delete_elements (idx_i, idx_j); |
|
|
2418 } |
|
|
2419 else |
|
|
2420 { |
|
|
2421 if (rhs_nr == 1 && rhs_nc == 1 && n >= 0 && m >= 0) |
|
|
2422 { |
|
|
2423 // No need to do anything if either of the indices |
|
|
2424 // are empty. |
|
|
2425 |
|
|
2426 if (n > 0 && m > 0) |
|
|
2427 { |
|
5603
|
2428 idx_i.sort (true); |
|
|
2429 idx_j.sort (true); |
|
|
2430 |
|
5275
|
2431 octave_idx_type max_row_idx = idx_i_is_colon ? rhs_nr : |
|
5164
|
2432 idx_i.max () + 1; |
|
5275
|
2433 octave_idx_type max_col_idx = idx_j_is_colon ? rhs_nc : |
|
5164
|
2434 idx_j.max () + 1; |
|
5603
|
2435 octave_idx_type new_nr = max_row_idx > lhs_nr ? |
|
|
2436 max_row_idx : lhs_nr; |
|
|
2437 octave_idx_type new_nc = max_col_idx > lhs_nc ? |
|
|
2438 max_col_idx : lhs_nc; |
|
5164
|
2439 RT scalar = rhs.elem (0, 0); |
|
|
2440 |
|
|
2441 // Count the number of non-zero terms |
|
5681
|
2442 octave_idx_type new_nzmx = lhs.nnz (); |
|
5275
|
2443 for (octave_idx_type j = 0; j < m; j++) |
|
5164
|
2444 { |
|
5275
|
2445 octave_idx_type jj = idx_j.elem (j); |
|
5164
|
2446 if (jj < lhs_nc) |
|
|
2447 { |
|
5275
|
2448 for (octave_idx_type i = 0; i < n; i++) |
|
5164
|
2449 { |
|
|
2450 OCTAVE_QUIT; |
|
|
2451 |
|
5275
|
2452 octave_idx_type ii = idx_i.elem (i); |
|
5164
|
2453 |
|
|
2454 if (ii < lhs_nr) |
|
|
2455 { |
|
5275
|
2456 for (octave_idx_type k = lhs.cidx(jj); |
|
5164
|
2457 k < lhs.cidx(jj+1); k++) |
|
|
2458 { |
|
|
2459 if (lhs.ridx(k) == ii) |
|
5604
|
2460 new_nzmx--; |
|
5164
|
2461 if (lhs.ridx(k) >= ii) |
|
|
2462 break; |
|
|
2463 } |
|
|
2464 } |
|
|
2465 } |
|
|
2466 } |
|
|
2467 } |
|
|
2468 |
|
|
2469 if (scalar != RT()) |
|
5604
|
2470 new_nzmx += m * n; |
|
|
2471 |
|
|
2472 Sparse<LT> stmp (new_nr, new_nc, new_nzmx); |
|
5164
|
2473 |
|
5275
|
2474 octave_idx_type jji = 0; |
|
|
2475 octave_idx_type jj = idx_j.elem (jji); |
|
|
2476 octave_idx_type kk = 0; |
|
5164
|
2477 stmp.cidx(0) = 0; |
|
5275
|
2478 for (octave_idx_type j = 0; j < new_nc; j++) |
|
5164
|
2479 { |
|
|
2480 if (jji < m && jj == j) |
|
|
2481 { |
|
5275
|
2482 octave_idx_type iii = 0; |
|
|
2483 octave_idx_type ii = idx_i.elem (iii); |
|
5760
|
2484 octave_idx_type ppp = 0; |
|
|
2485 octave_idx_type ppi = lhs.cidx(j+1) - |
|
|
2486 lhs.cidx(j); |
|
|
2487 octave_idx_type pp = (ppp < ppi ? |
|
|
2488 lhs.ridx(lhs.cidx(j)+ppp) : |
|
|
2489 new_nr); |
|
|
2490 while (ppp < ppi || iii < n) |
|
5164
|
2491 { |
|
5760
|
2492 if (iii < n && ii <= pp) |
|
5164
|
2493 { |
|
|
2494 if (scalar != RT ()) |
|
|
2495 { |
|
|
2496 stmp.data(kk) = scalar; |
|
5760
|
2497 stmp.ridx(kk++) = ii; |
|
5164
|
2498 } |
|
5760
|
2499 if (ii == pp) |
|
|
2500 pp = (++ppp < ppi ? lhs.ridx(lhs.cidx(j)+ppp) : new_nr); |
|
5164
|
2501 if (++iii < n) |
|
|
2502 ii = idx_i.elem(iii); |
|
|
2503 } |
|
5760
|
2504 else |
|
5164
|
2505 { |
|
5760
|
2506 stmp.data(kk) = |
|
|
2507 lhs.data(lhs.cidx(j)+ppp); |
|
|
2508 stmp.ridx(kk++) = pp; |
|
|
2509 pp = (++ppp < ppi ? lhs.ridx(lhs.cidx(j)+ppp) : new_nr); |
|
5164
|
2510 } |
|
|
2511 } |
|
|
2512 if (++jji < m) |
|
|
2513 jj = idx_j.elem(jji); |
|
|
2514 } |
|
|
2515 else if (j < lhs.cols()) |
|
|
2516 { |
|
5275
|
2517 for (octave_idx_type i = lhs.cidx(j); |
|
5164
|
2518 i < lhs.cidx(j+1); i++) |
|
|
2519 { |
|
|
2520 stmp.data(kk) = lhs.data(i); |
|
|
2521 stmp.ridx(kk++) = lhs.ridx(i); |
|
|
2522 } |
|
|
2523 } |
|
|
2524 stmp.cidx(j+1) = kk; |
|
|
2525 } |
|
|
2526 |
|
|
2527 lhs = stmp; |
|
|
2528 } |
|
|
2529 } |
|
|
2530 else if (n == rhs_nr && m == rhs_nc) |
|
|
2531 { |
|
|
2532 if (n > 0 && m > 0) |
|
|
2533 { |
|
5275
|
2534 octave_idx_type max_row_idx = idx_i_is_colon ? rhs_nr : |
|
5164
|
2535 idx_i.max () + 1; |
|
5275
|
2536 octave_idx_type max_col_idx = idx_j_is_colon ? rhs_nc : |
|
5164
|
2537 idx_j.max () + 1; |
|
5603
|
2538 octave_idx_type new_nr = max_row_idx > lhs_nr ? |
|
|
2539 max_row_idx : lhs_nr; |
|
|
2540 octave_idx_type new_nc = max_col_idx > lhs_nc ? |
|
|
2541 max_col_idx : lhs_nc; |
|
|
2542 |
|
|
2543 OCTAVE_LOCAL_BUFFER (octave_idx_type, rhs_idx_i, n); |
|
|
2544 if (! idx_i.is_colon ()) |
|
|
2545 { |
|
|
2546 // Ok here we have to be careful with the indexing, |
|
|
2547 // to treat cases like "a([3,2,1],:) = b", and still |
|
|
2548 // handle the need for strict sorting of the sparse |
|
|
2549 // elements. |
|
|
2550 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort *, |
|
|
2551 sidx, n); |
|
|
2552 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort, |
|
|
2553 sidxX, n); |
|
|
2554 |
|
|
2555 for (octave_idx_type i = 0; i < n; i++) |
|
|
2556 { |
|
|
2557 sidx[i] = &sidxX[i]; |
|
|
2558 sidx[i]->i = idx_i.elem(i); |
|
|
2559 sidx[i]->idx = i; |
|
|
2560 } |
|
|
2561 |
|
|
2562 OCTAVE_QUIT; |
|
|
2563 octave_sort<octave_idx_vector_sort *> |
|
|
2564 sort (octave_idx_vector_comp); |
|
|
2565 |
|
|
2566 sort.sort (sidx, n); |
|
|
2567 |
|
|
2568 intNDArray<octave_idx_type> new_idx (dim_vector (n,1)); |
|
|
2569 |
|
|
2570 for (octave_idx_type i = 0; i < n; i++) |
|
|
2571 { |
|
|
2572 new_idx.xelem(i) = sidx[i]->i + 1; |
|
|
2573 rhs_idx_i[i] = sidx[i]->idx; |
|
|
2574 } |
|
|
2575 |
|
|
2576 idx_i = idx_vector (new_idx); |
|
|
2577 } |
|
|
2578 else |
|
|
2579 for (octave_idx_type i = 0; i < n; i++) |
|
|
2580 rhs_idx_i[i] = i; |
|
|
2581 |
|
|
2582 OCTAVE_LOCAL_BUFFER (octave_idx_type, rhs_idx_j, m); |
|
|
2583 if (! idx_j.is_colon ()) |
|
|
2584 { |
|
|
2585 // Ok here we have to be careful with the indexing, |
|
|
2586 // to treat cases like "a([3,2,1],:) = b", and still |
|
|
2587 // handle the need for strict sorting of the sparse |
|
|
2588 // elements. |
|
|
2589 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort *, |
|
|
2590 sidx, m); |
|
|
2591 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort, |
|
|
2592 sidxX, m); |
|
|
2593 |
|
|
2594 for (octave_idx_type i = 0; i < m; i++) |
|
|
2595 { |
|
|
2596 sidx[i] = &sidxX[i]; |
|
|
2597 sidx[i]->i = idx_j.elem(i); |
|
|
2598 sidx[i]->idx = i; |
|
|
2599 } |
|
|
2600 |
|
|
2601 OCTAVE_QUIT; |
|
|
2602 octave_sort<octave_idx_vector_sort *> |
|
|
2603 sort (octave_idx_vector_comp); |
|
|
2604 |
|
|
2605 sort.sort (sidx, m); |
|
|
2606 |
|
|
2607 intNDArray<octave_idx_type> new_idx (dim_vector (m,1)); |
|
|
2608 |
|
|
2609 for (octave_idx_type i = 0; i < m; i++) |
|
|
2610 { |
|
|
2611 new_idx.xelem(i) = sidx[i]->i + 1; |
|
|
2612 rhs_idx_j[i] = sidx[i]->idx; |
|
|
2613 } |
|
|
2614 |
|
|
2615 idx_j = idx_vector (new_idx); |
|
|
2616 } |
|
|
2617 else |
|
|
2618 for (octave_idx_type i = 0; i < m; i++) |
|
|
2619 rhs_idx_j[i] = i; |
|
5164
|
2620 |
|
5760
|
2621 // Maximum number of non-zero elements |
|
|
2622 octave_idx_type new_nzmx = lhs.nnz() + rhs.nnz(); |
|
5164
|
2623 |
|
5604
|
2624 Sparse<LT> stmp (new_nr, new_nc, new_nzmx); |
|
5164
|
2625 |
|
5275
|
2626 octave_idx_type jji = 0; |
|
|
2627 octave_idx_type jj = idx_j.elem (jji); |
|
|
2628 octave_idx_type kk = 0; |
|
5164
|
2629 stmp.cidx(0) = 0; |
|
5275
|
2630 for (octave_idx_type j = 0; j < new_nc; j++) |
|
5164
|
2631 { |
|
|
2632 if (jji < m && jj == j) |
|
|
2633 { |
|
5275
|
2634 octave_idx_type iii = 0; |
|
|
2635 octave_idx_type ii = idx_i.elem (iii); |
|
5760
|
2636 octave_idx_type ppp = 0; |
|
|
2637 octave_idx_type ppi = lhs.cidx(j+1) - |
|
|
2638 lhs.cidx(j); |
|
|
2639 octave_idx_type pp = (ppp < ppi ? |
|
|
2640 lhs.ridx(lhs.cidx(j)+ppp) : |
|
|
2641 new_nr); |
|
|
2642 while (ppp < ppi || iii < n) |
|
5164
|
2643 { |
|
5760
|
2644 if (iii < n && ii <= pp) |
|
5164
|
2645 { |
|
5603
|
2646 RT rtmp = rhs.elem (rhs_idx_i[iii], |
|
|
2647 rhs_idx_j[jji]); |
|
5164
|
2648 if (rtmp != RT ()) |
|
|
2649 { |
|
|
2650 stmp.data(kk) = rtmp; |
|
5760
|
2651 stmp.ridx(kk++) = ii; |
|
5164
|
2652 } |
|
5760
|
2653 if (ii == pp) |
|
|
2654 pp = (++ppp < ppi ? lhs.ridx(lhs.cidx(j)+ppp) : new_nr); |
|
5164
|
2655 if (++iii < n) |
|
|
2656 ii = idx_i.elem(iii); |
|
|
2657 } |
|
5760
|
2658 else |
|
5164
|
2659 { |
|
5760
|
2660 stmp.data(kk) = |
|
|
2661 lhs.data(lhs.cidx(j)+ppp); |
|
|
2662 stmp.ridx(kk++) = pp; |
|
|
2663 pp = (++ppp < ppi ? lhs.ridx(lhs.cidx(j)+ppp) : new_nr); |
|
5164
|
2664 } |
|
|
2665 } |
|
|
2666 if (++jji < m) |
|
|
2667 jj = idx_j.elem(jji); |
|
|
2668 } |
|
|
2669 else if (j < lhs.cols()) |
|
|
2670 { |
|
5275
|
2671 for (octave_idx_type i = lhs.cidx(j); |
|
5164
|
2672 i < lhs.cidx(j+1); i++) |
|
|
2673 { |
|
|
2674 stmp.data(kk) = lhs.data(i); |
|
|
2675 stmp.ridx(kk++) = lhs.ridx(i); |
|
|
2676 } |
|
|
2677 } |
|
|
2678 stmp.cidx(j+1) = kk; |
|
|
2679 } |
|
|
2680 |
|
5760
|
2681 stmp.maybe_compress(); |
|
5164
|
2682 lhs = stmp; |
|
|
2683 } |
|
|
2684 } |
|
|
2685 else if (n == 0 && m == 0) |
|
|
2686 { |
|
|
2687 if (! ((rhs_nr == 1 && rhs_nc == 1) |
|
|
2688 || (rhs_nr == 0 || rhs_nc == 0))) |
|
|
2689 { |
|
|
2690 (*current_liboctave_error_handler) |
|
|
2691 ("A([], []) = X: X must be an empty matrix or a scalar"); |
|
|
2692 |
|
|
2693 retval = 0; |
|
|
2694 } |
|
|
2695 } |
|
|
2696 else |
|
|
2697 { |
|
|
2698 (*current_liboctave_error_handler) |
|
|
2699 ("A(I, J) = X: X must be a scalar or the number of elements in I must"); |
|
|
2700 (*current_liboctave_error_handler) |
|
|
2701 ("match the number of rows in X and the number of elements in J must"); |
|
|
2702 (*current_liboctave_error_handler) |
|
|
2703 ("match the number of columns in X"); |
|
|
2704 |
|
|
2705 retval = 0; |
|
|
2706 } |
|
|
2707 } |
|
|
2708 } |
|
|
2709 // idx_vector::freeze() printed an error message for us. |
|
|
2710 } |
|
|
2711 else if (n_idx == 1) |
|
|
2712 { |
|
|
2713 int lhs_is_empty = lhs_nr == 0 || lhs_nc == 0; |
|
|
2714 |
|
|
2715 if (lhs_is_empty || (lhs_nr == 1 && lhs_nc == 1)) |
|
|
2716 { |
|
5275
|
2717 octave_idx_type lhs_len = lhs.length (); |
|
|
2718 |
|
5781
|
2719 octave_idx_type n = idx_i.freeze (lhs_len, 0, true); |
|
5164
|
2720 |
|
|
2721 if (idx_i) |
|
|
2722 { |
|
|
2723 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2724 { |
|
|
2725 if (n != 0 && (lhs_nr != 0 || lhs_nc != 0)) |
|
|
2726 lhs.maybe_delete_elements (idx_i); |
|
|
2727 } |
|
|
2728 else |
|
|
2729 { |
|
5781
|
2730 if (lhs_is_empty |
|
|
2731 && idx_i.is_colon () |
|
|
2732 && ! (rhs_nr == 1 || rhs_nc == 1)) |
|
5164
|
2733 { |
|
5781
|
2734 (*current_liboctave_warning_with_id_handler) |
|
|
2735 ("Octave:fortran-indexing", |
|
|
2736 "A(:) = X: X is not a vector or scalar"); |
|
|
2737 } |
|
|
2738 else |
|
|
2739 { |
|
|
2740 octave_idx_type idx_nr = idx_i.orig_rows (); |
|
|
2741 octave_idx_type idx_nc = idx_i.orig_columns (); |
|
|
2742 |
|
|
2743 if (! (rhs_nr == idx_nr && rhs_nc == idx_nc)) |
|
|
2744 (*current_liboctave_warning_with_id_handler) |
|
|
2745 ("Octave:fortran-indexing", |
|
|
2746 "A(I) = X: X does not have same shape as I"); |
|
5164
|
2747 } |
|
|
2748 |
|
5760
|
2749 if (! assign1 (lhs, rhs)) |
|
5164
|
2750 retval = 0; |
|
|
2751 } |
|
|
2752 } |
|
|
2753 // idx_vector::freeze() printed an error message for us. |
|
|
2754 } |
|
|
2755 else if (lhs_nr == 1) |
|
|
2756 { |
|
5781
|
2757 idx_i.freeze (lhs_nc, "vector", true); |
|
5164
|
2758 |
|
|
2759 if (idx_i) |
|
|
2760 { |
|
|
2761 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2762 lhs.maybe_delete_elements (idx_i); |
|
5760
|
2763 else if (! assign1 (lhs, rhs)) |
|
5164
|
2764 retval = 0; |
|
|
2765 } |
|
|
2766 // idx_vector::freeze() printed an error message for us. |
|
|
2767 } |
|
|
2768 else if (lhs_nc == 1) |
|
|
2769 { |
|
5781
|
2770 idx_i.freeze (lhs_nr, "vector", true); |
|
5164
|
2771 |
|
|
2772 if (idx_i) |
|
|
2773 { |
|
|
2774 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2775 lhs.maybe_delete_elements (idx_i); |
|
5760
|
2776 else if (! assign1 (lhs, rhs)) |
|
5164
|
2777 retval = 0; |
|
|
2778 } |
|
|
2779 // idx_vector::freeze() printed an error message for us. |
|
|
2780 } |
|
|
2781 else |
|
|
2782 { |
|
5781
|
2783 if (! (idx_i.is_colon () |
|
|
2784 || (idx_i.one_zero_only () |
|
|
2785 && idx_i.orig_rows () == lhs_nr |
|
|
2786 && idx_i.orig_columns () == lhs_nc))) |
|
|
2787 (*current_liboctave_warning_with_id_handler) |
|
|
2788 ("Octave:fortran-indexing", "single index used for matrix"); |
|
5164
|
2789 |
|
5275
|
2790 octave_idx_type lhs_len = lhs.length (); |
|
|
2791 |
|
|
2792 octave_idx_type len = idx_i.freeze (lhs_nr * lhs_nc, "matrix"); |
|
5164
|
2793 |
|
|
2794 if (idx_i) |
|
|
2795 { |
|
|
2796 // Take a constant copy of lhs. This means that elem won't |
|
|
2797 // create missing elements. |
|
|
2798 const Sparse<LT> c_lhs (lhs); |
|
|
2799 |
|
|
2800 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2801 lhs.maybe_delete_elements (idx_i); |
|
|
2802 else if (len == 0) |
|
|
2803 { |
|
|
2804 if (! ((rhs_nr == 1 && rhs_nc == 1) |
|
|
2805 || (rhs_nr == 0 || rhs_nc == 0))) |
|
|
2806 (*current_liboctave_error_handler) |
|
|
2807 ("A([]) = X: X must be an empty matrix or scalar"); |
|
|
2808 } |
|
|
2809 else if (len == rhs_nr * rhs_nc) |
|
|
2810 { |
|
5604
|
2811 octave_idx_type new_nzmx = lhs_nz; |
|
5603
|
2812 OCTAVE_LOCAL_BUFFER (octave_idx_type, rhs_idx, len); |
|
|
2813 |
|
|
2814 if (! idx_i.is_colon ()) |
|
|
2815 { |
|
|
2816 // Ok here we have to be careful with the indexing, to |
|
|
2817 // treat cases like "a([3,2,1]) = b", and still handle |
|
|
2818 // the need for strict sorting of the sparse elements. |
|
|
2819 |
|
|
2820 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort *, sidx, |
|
|
2821 len); |
|
|
2822 OCTAVE_LOCAL_BUFFER (octave_idx_vector_sort, sidxX, |
|
|
2823 len); |
|
|
2824 |
|
|
2825 for (octave_idx_type i = 0; i < len; i++) |
|
|
2826 { |
|
|
2827 sidx[i] = &sidxX[i]; |
|
|
2828 sidx[i]->i = idx_i.elem(i); |
|
|
2829 sidx[i]->idx = i; |
|
|
2830 } |
|
|
2831 |
|
|
2832 OCTAVE_QUIT; |
|
|
2833 octave_sort<octave_idx_vector_sort *> |
|
|
2834 sort (octave_idx_vector_comp); |
|
|
2835 |
|
|
2836 sort.sort (sidx, len); |
|
|
2837 |
|
|
2838 intNDArray<octave_idx_type> new_idx (dim_vector (len,1)); |
|
|
2839 |
|
|
2840 for (octave_idx_type i = 0; i < len; i++) |
|
|
2841 { |
|
|
2842 new_idx.xelem(i) = sidx[i]->i + 1; |
|
|
2843 rhs_idx[i] = sidx[i]->idx; |
|
|
2844 } |
|
|
2845 |
|
|
2846 idx_i = idx_vector (new_idx); |
|
|
2847 } |
|
|
2848 else |
|
|
2849 for (octave_idx_type i = 0; i < len; i++) |
|
|
2850 rhs_idx[i] = i; |
|
5164
|
2851 |
|
|
2852 // First count the number of non-zero elements |
|
5275
|
2853 for (octave_idx_type i = 0; i < len; i++) |
|
5164
|
2854 { |
|
|
2855 OCTAVE_QUIT; |
|
|
2856 |
|
5275
|
2857 octave_idx_type ii = idx_i.elem (i); |
|
5164
|
2858 if (ii < lhs_len && c_lhs.elem(ii) != LT ()) |
|
5604
|
2859 new_nzmx--; |
|
5603
|
2860 if (rhs.elem(rhs_idx[i]) != RT ()) |
|
5604
|
2861 new_nzmx++; |
|
5164
|
2862 } |
|
|
2863 |
|
5604
|
2864 Sparse<LT> stmp (lhs_nr, lhs_nc, new_nzmx); |
|
5164
|
2865 |
|
5275
|
2866 octave_idx_type i = 0; |
|
|
2867 octave_idx_type ii = 0; |
|
|
2868 octave_idx_type ic = 0; |
|
5164
|
2869 if (i < lhs_nz) |
|
|
2870 { |
|
|
2871 while (ic < lhs_nc && i >= c_lhs.cidx(ic+1)) |
|
|
2872 ic++; |
|
|
2873 ii = ic * lhs_nr + c_lhs.ridx(i); |
|
|
2874 } |
|
|
2875 |
|
5275
|
2876 octave_idx_type j = 0; |
|
|
2877 octave_idx_type jj = idx_i.elem (j); |
|
|
2878 octave_idx_type jr = jj % lhs_nr; |
|
|
2879 octave_idx_type jc = (jj - jr) / lhs_nr; |
|
|
2880 |
|
|
2881 octave_idx_type kk = 0; |
|
|
2882 octave_idx_type kc = 0; |
|
5164
|
2883 |
|
|
2884 while (j < len || i < lhs_nz) |
|
|
2885 { |
|
|
2886 if (j == len || (i < lhs_nz && ii < jj)) |
|
|
2887 { |
|
|
2888 while (kc <= ic) |
|
|
2889 stmp.xcidx (kc++) = kk; |
|
|
2890 stmp.xdata (kk) = c_lhs.data (i); |
|
|
2891 stmp.xridx (kk++) = c_lhs.ridx (i); |
|
|
2892 i++; |
|
|
2893 while (ic < lhs_nc && i >= c_lhs.cidx(ic+1)) |
|
|
2894 ic++; |
|
|
2895 if (i < lhs_nz) |
|
|
2896 ii = ic * lhs_nr + c_lhs.ridx(i); |
|
|
2897 } |
|
|
2898 else |
|
|
2899 { |
|
|
2900 while (kc <= jc) |
|
|
2901 stmp.xcidx (kc++) = kk; |
|
5603
|
2902 RT rtmp = rhs.elem (rhs_idx[j]); |
|
5164
|
2903 if (rtmp != RT ()) |
|
|
2904 { |
|
|
2905 stmp.xdata (kk) = rtmp; |
|
|
2906 stmp.xridx (kk++) = jr; |
|
|
2907 } |
|
|
2908 if (ii == jj) |
|
|
2909 { |
|
|
2910 i++; |
|
|
2911 while (ic < lhs_nc && i >= c_lhs.cidx(ic+1)) |
|
|
2912 ic++; |
|
|
2913 if (i < lhs_nz) |
|
|
2914 ii = ic * lhs_nr + c_lhs.ridx(i); |
|
|
2915 } |
|
|
2916 j++; |
|
|
2917 if (j < len) |
|
|
2918 { |
|
|
2919 jj = idx_i.elem (j); |
|
|
2920 jr = jj % lhs_nr; |
|
|
2921 jc = (jj - jr) / lhs_nr; |
|
|
2922 } |
|
|
2923 } |
|
|
2924 } |
|
|
2925 |
|
5275
|
2926 for (octave_idx_type iidx = kc; iidx < lhs_nc+1; iidx++) |
|
5603
|
2927 stmp.xcidx(iidx) = kk; |
|
5164
|
2928 |
|
|
2929 lhs = stmp; |
|
|
2930 } |
|
|
2931 else if (rhs_nr == 1 && rhs_nc == 1) |
|
|
2932 { |
|
|
2933 RT scalar = rhs.elem (0, 0); |
|
5604
|
2934 octave_idx_type new_nzmx = lhs_nz; |
|
5603
|
2935 idx_i.sort (true); |
|
5164
|
2936 |
|
|
2937 // First count the number of non-zero elements |
|
|
2938 if (scalar != RT ()) |
|
5604
|
2939 new_nzmx += len; |
|
5275
|
2940 for (octave_idx_type i = 0; i < len; i++) |
|
5164
|
2941 { |
|
|
2942 OCTAVE_QUIT; |
|
5275
|
2943 octave_idx_type ii = idx_i.elem (i); |
|
5164
|
2944 if (ii < lhs_len && c_lhs.elem(ii) != LT ()) |
|
5604
|
2945 new_nzmx--; |
|
5164
|
2946 } |
|
|
2947 |
|
5604
|
2948 Sparse<LT> stmp (lhs_nr, lhs_nc, new_nzmx); |
|
5164
|
2949 |
|
5275
|
2950 octave_idx_type i = 0; |
|
|
2951 octave_idx_type ii = 0; |
|
|
2952 octave_idx_type ic = 0; |
|
5164
|
2953 if (i < lhs_nz) |
|
|
2954 { |
|
|
2955 while (ic < lhs_nc && i >= c_lhs.cidx(ic+1)) |
|
|
2956 ic++; |
|
|
2957 ii = ic * lhs_nr + c_lhs.ridx(i); |
|
|
2958 } |
|
|
2959 |
|
5275
|
2960 octave_idx_type j = 0; |
|
|
2961 octave_idx_type jj = idx_i.elem (j); |
|
|
2962 octave_idx_type jr = jj % lhs_nr; |
|
|
2963 octave_idx_type jc = (jj - jr) / lhs_nr; |
|
|
2964 |
|
|
2965 octave_idx_type kk = 0; |
|
|
2966 octave_idx_type kc = 0; |
|
5164
|
2967 |
|
|
2968 while (j < len || i < lhs_nz) |
|
|
2969 { |
|
|
2970 if (j == len || (i < lhs_nz && ii < jj)) |
|
|
2971 { |
|
|
2972 while (kc <= ic) |
|
|
2973 stmp.xcidx (kc++) = kk; |
|
|
2974 stmp.xdata (kk) = c_lhs.data (i); |
|
|
2975 stmp.xridx (kk++) = c_lhs.ridx (i); |
|
|
2976 i++; |
|
|
2977 while (ic < lhs_nc && i >= c_lhs.cidx(ic+1)) |
|
|
2978 ic++; |
|
|
2979 if (i < lhs_nz) |
|
|
2980 ii = ic * lhs_nr + c_lhs.ridx(i); |
|
|
2981 } |
|
|
2982 else |
|
|
2983 { |
|
|
2984 while (kc <= jc) |
|
|
2985 stmp.xcidx (kc++) = kk; |
|
|
2986 if (scalar != RT ()) |
|
|
2987 { |
|
|
2988 stmp.xdata (kk) = scalar; |
|
|
2989 stmp.xridx (kk++) = jr; |
|
|
2990 } |
|
|
2991 if (ii == jj) |
|
|
2992 { |
|
|
2993 i++; |
|
|
2994 while (ic < lhs_nc && i >= c_lhs.cidx(ic+1)) |
|
|
2995 ic++; |
|
|
2996 if (i < lhs_nz) |
|
|
2997 ii = ic * lhs_nr + c_lhs.ridx(i); |
|
|
2998 } |
|
|
2999 j++; |
|
|
3000 if (j < len) |
|
|
3001 { |
|
|
3002 jj = idx_i.elem (j); |
|
|
3003 jr = jj % lhs_nr; |
|
|
3004 jc = (jj - jr) / lhs_nr; |
|
|
3005 } |
|
|
3006 } |
|
|
3007 } |
|
|
3008 |
|
5275
|
3009 for (octave_idx_type iidx = kc; iidx < lhs_nc+1; iidx++) |
|
5164
|
3010 stmp.xcidx(iidx) = kk; |
|
|
3011 |
|
|
3012 lhs = stmp; |
|
|
3013 } |
|
|
3014 else |
|
|
3015 { |
|
|
3016 (*current_liboctave_error_handler) |
|
|
3017 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
|
|
3018 |
|
|
3019 retval = 0; |
|
|
3020 } |
|
|
3021 } |
|
|
3022 // idx_vector::freeze() printed an error message for us. |
|
|
3023 } |
|
|
3024 } |
|
|
3025 else |
|
|
3026 { |
|
|
3027 (*current_liboctave_error_handler) |
|
|
3028 ("invalid number of indices for matrix expression"); |
|
|
3029 |
|
|
3030 retval = 0; |
|
|
3031 } |
|
|
3032 |
|
|
3033 lhs.clear_index (); |
|
|
3034 |
|
|
3035 return retval; |
|
|
3036 } |
|
|
3037 |
|
|
3038 template <class T> |
|
|
3039 void |
|
|
3040 Sparse<T>::print_info (std::ostream& os, const std::string& prefix) const |
|
|
3041 { |
|
|
3042 os << prefix << "rep address: " << rep << "\n" |
|
5604
|
3043 << prefix << "rep->nzmx: " << rep->nzmx << "\n" |
|
5164
|
3044 << prefix << "rep->nrows: " << rep->nrows << "\n" |
|
|
3045 << prefix << "rep->ncols: " << rep->ncols << "\n" |
|
|
3046 << prefix << "rep->data: " << static_cast<void *> (rep->d) << "\n" |
|
|
3047 << prefix << "rep->ridx: " << static_cast<void *> (rep->r) << "\n" |
|
|
3048 << prefix << "rep->cidx: " << static_cast<void *> (rep->c) << "\n" |
|
|
3049 << prefix << "rep->count: " << rep->count << "\n"; |
|
|
3050 } |
|
|
3051 |
|
|
3052 /* |
|
|
3053 ;;; Local Variables: *** |
|
|
3054 ;;; mode: C++ *** |
|
|
3055 ;;; End: *** |
|
|
3056 */ |
