Mercurial > octave
annotate liboctave/Sparse.h @ 9829:8fd88cc36fa4
fix loading sparse matrices
| author | Jaroslav Hajek <highegg@gmail.com> |
|---|---|
| date | Wed, 18 Nov 2009 13:34:58 +0100 |
| parents | f80c566bc751 |
| children | 829e69ec3110 |
| rev | line source |
|---|---|
| 5164 | 1 // Template sparse classes |
| 2 /* | |
| 3 | |
| 8920 | 4 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 David Bateman |
| 7016 | 5 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004 Andy Adler |
| 6 | |
| 7 This file is part of Octave. | |
| 5164 | 8 |
| 9 Octave is free software; you can redistribute it and/or modify it | |
| 10 under the terms of the GNU General Public License as published by the | |
| 7016 | 11 Free Software Foundation; either version 3 of the License, or (at your |
| 12 option) any later version. | |
| 5164 | 13 |
| 14 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 15 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 17 for more details. | |
| 18 | |
| 19 You should have received a copy of the GNU General Public License | |
| 7016 | 20 along with Octave; see the file COPYING. If not, see |
| 21 <http://www.gnu.org/licenses/>. | |
| 5164 | 22 |
| 23 */ | |
| 24 | |
| 25 #if !defined (octave_Sparse_h) | |
| 26 #define octave_Sparse_h 1 | |
| 27 | |
| 28 #include <cassert> | |
| 29 #include <cstddef> | |
| 30 | |
|
8950
d865363208d6
include <iosfwd> instead of <iostream> in header files
John W. Eaton <jwe@octave.org>
parents:
8920
diff
changeset
|
31 #include <iosfwd> |
| 5164 | 32 |
| 33 #include "Array.h" | |
| 34 #include "Array2.h" | |
| 35 #include "dim-vector.h" | |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
36 #include "lo-error.h" |
| 5164 | 37 #include "lo-utils.h" |
| 38 | |
| 7433 | 39 #include "oct-sort.h" |
| 40 | |
| 5164 | 41 class idx_vector; |
| 42 | |
| 43 // Two dimensional sparse class. Handles the reference counting for | |
| 44 // all the derived classes. | |
| 45 | |
| 46 template <class T> | |
| 47 class | |
| 48 Sparse | |
| 49 { | |
|
8181
1ebcb9872ced
fix sparse-matrix bool/cmp op instantiation problem
John W. Eaton <jwe@octave.org>
parents:
7717
diff
changeset
|
50 public: |
|
1ebcb9872ced
fix sparse-matrix bool/cmp op instantiation problem
John W. Eaton <jwe@octave.org>
parents:
7717
diff
changeset
|
51 |
|
8918
f5408862892f
Consistently use element_type in the array classes.
Jason Riedy <jason@acm.org>
parents:
8181
diff
changeset
|
52 typedef T element_type; |
|
8181
1ebcb9872ced
fix sparse-matrix bool/cmp op instantiation problem
John W. Eaton <jwe@octave.org>
parents:
7717
diff
changeset
|
53 |
| 5164 | 54 protected: |
| 55 //-------------------------------------------------------------------- | |
| 56 // The real representation of all Sparse arrays. | |
| 57 //-------------------------------------------------------------------- | |
| 58 | |
| 6108 | 59 class OCTAVE_API SparseRep |
| 5164 | 60 { |
| 61 public: | |
| 62 | |
| 63 T *d; | |
| 5275 | 64 octave_idx_type *r; |
| 65 octave_idx_type *c; | |
| 5604 | 66 octave_idx_type nzmx; |
| 5275 | 67 octave_idx_type nrows; |
| 68 octave_idx_type ncols; | |
| 5164 | 69 int count; |
| 70 | |
| 5604 | 71 SparseRep (void) : d (0), r (0), c (new octave_idx_type [1]), nzmx (0), nrows (0), |
| 5164 | 72 ncols (0), count (1) { c[0] = 0; } |
| 73 | |
| 5604 | 74 SparseRep (octave_idx_type n) : d (0), r (0), c (new octave_idx_type [n+1]), nzmx (0), nrows (n), |
| 5164 | 75 ncols (n), count (1) |
| 76 { | |
| 5275 | 77 for (octave_idx_type i = 0; i < n + 1; i++) |
| 5164 | 78 c[i] = 0; |
| 79 } | |
| 80 | |
| 5604 | 81 SparseRep (octave_idx_type nr, octave_idx_type nc) : d (0), r (0), c (new octave_idx_type [nc+1]), nzmx (0), |
| 5164 | 82 nrows (nr), ncols (nc), count (1) |
| 83 { | |
| 5275 | 84 for (octave_idx_type i = 0; i < nc + 1; i++) |
| 5164 | 85 c[i] = 0; |
| 86 } | |
| 87 | |
| 5275 | 88 SparseRep (octave_idx_type nr, octave_idx_type nc, octave_idx_type nz) : d (new T [nz]), |
| 5604 | 89 r (new octave_idx_type [nz]), c (new octave_idx_type [nc+1]), nzmx (nz), nrows (nr), |
| 5164 | 90 ncols (nc), count (1) |
| 91 { | |
| 5275 | 92 for (octave_idx_type i = 0; i < nc + 1; i++) |
| 5164 | 93 c[i] = 0; |
| 94 } | |
| 95 | |
| 96 SparseRep (const SparseRep& a) | |
| 5604 | 97 : d (new T [a.nzmx]), r (new octave_idx_type [a.nzmx]), c (new octave_idx_type [a.ncols + 1]), |
| 98 nzmx (a.nzmx), nrows (a.nrows), ncols (a.ncols), count (1) | |
| 5164 | 99 { |
| 5604 | 100 for (octave_idx_type i = 0; i < nzmx; i++) |
| 5164 | 101 { |
| 102 d[i] = a.d[i]; | |
| 103 r[i] = a.r[i]; | |
| 104 } | |
| 5275 | 105 for (octave_idx_type i = 0; i < ncols + 1; i++) |
| 5164 | 106 c[i] = a.c[i]; |
| 107 } | |
| 108 | |
| 109 ~SparseRep (void) { delete [] d; delete [] r; delete [] c; } | |
| 110 | |
| 5604 | 111 octave_idx_type length (void) const { return nzmx; } |
| 5164 | 112 |
| 5604 | 113 octave_idx_type nnz (void) const { return c [ncols]; } |
| 5164 | 114 |
| 5275 | 115 T& elem (octave_idx_type _r, octave_idx_type _c); |
| 5164 | 116 |
| 5275 | 117 T celem (octave_idx_type _r, octave_idx_type _c) const; |
| 5164 | 118 |
| 5275 | 119 T& data (octave_idx_type i) { return d[i]; } |
| 5164 | 120 |
| 5275 | 121 T cdata (octave_idx_type i) const { return d[i]; } |
| 5164 | 122 |
| 5275 | 123 octave_idx_type& ridx (octave_idx_type i) { return r[i]; } |
| 5164 | 124 |
| 5275 | 125 octave_idx_type cridx (octave_idx_type i) const { return r[i]; } |
| 5164 | 126 |
| 5275 | 127 octave_idx_type& cidx (octave_idx_type i) { return c[i]; } |
| 5164 | 128 |
| 5275 | 129 octave_idx_type ccidx (octave_idx_type i) const { return c[i]; } |
| 5164 | 130 |
| 131 void maybe_compress (bool remove_zeros); | |
| 132 | |
| 5275 | 133 void change_length (octave_idx_type nz); |
| 5164 | 134 |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
135 bool indices_ok (void) const; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
136 |
| 5164 | 137 private: |
| 138 | |
| 139 // No assignment! | |
| 140 | |
| 141 SparseRep& operator = (const SparseRep& a); | |
| 142 }; | |
| 143 | |
| 144 //-------------------------------------------------------------------- | |
| 145 | |
| 146 void make_unique (void) | |
| 147 { | |
| 148 if (rep->count > 1) | |
| 149 { | |
| 150 --rep->count; | |
| 151 rep = new SparseRep (*rep); | |
| 152 } | |
| 153 } | |
| 154 | |
| 155 public: | |
| 156 | |
| 157 // !!! WARNING !!! -- these should be protected, not public. You | |
| 158 // should not access these data members directly! | |
| 159 | |
| 160 typename Sparse<T>::SparseRep *rep; | |
| 161 | |
| 162 dim_vector dimensions; | |
| 163 | |
| 164 protected: | |
| 165 idx_vector *idx; | |
| 5275 | 166 octave_idx_type idx_count; |
| 5164 | 167 |
| 168 private: | |
| 169 | |
| 170 typename Sparse<T>::SparseRep *nil_rep (void) const | |
| 171 { | |
| 172 static typename Sparse<T>::SparseRep *nr | |
| 173 = new typename Sparse<T>::SparseRep (); | |
| 174 | |
| 175 nr->count++; | |
| 176 | |
| 177 return nr; | |
| 178 } | |
| 179 | |
| 180 public: | |
| 181 | |
| 182 Sparse (void) | |
| 183 : rep (nil_rep ()), dimensions (dim_vector(0,0)), | |
| 184 idx (0), idx_count (0) { } | |
| 185 | |
| 5275 | 186 explicit Sparse (octave_idx_type n) |
| 5164 | 187 : rep (new typename Sparse<T>::SparseRep (n)), |
| 188 dimensions (dim_vector (n, n)), idx (0), idx_count (0) { } | |
| 189 | |
| 5275 | 190 explicit Sparse (octave_idx_type nr, octave_idx_type nc) |
| 5164 | 191 : rep (new typename Sparse<T>::SparseRep (nr, nc)), |
| 192 dimensions (dim_vector (nr, nc)), idx (0), idx_count (0) { } | |
| 193 | |
| 5275 | 194 explicit Sparse (octave_idx_type nr, octave_idx_type nc, T val); |
| 5164 | 195 |
| 5275 | 196 Sparse (const dim_vector& dv, octave_idx_type nz) |
| 5164 | 197 : rep (new typename Sparse<T>::SparseRep (dv(0), dv(1), nz)), |
| 198 dimensions (dv), idx (0), idx_count (0) { } | |
| 199 | |
| 5275 | 200 Sparse (octave_idx_type nr, octave_idx_type nc, octave_idx_type nz) |
| 5164 | 201 : rep (new typename Sparse<T>::SparseRep (nr, nc, nz)), |
| 202 dimensions (dim_vector (nr, nc)), idx (0), idx_count (0) { } | |
| 203 | |
| 204 // Type conversion case. | |
| 205 template <class U> Sparse (const Sparse<U>& a); | |
| 206 | |
| 207 // No type conversion case. | |
| 208 Sparse (const Sparse<T>& a) | |
| 209 : rep (a.rep), dimensions (a.dimensions), idx (0), idx_count (0) | |
| 210 { | |
| 211 rep->count++; | |
| 212 } | |
| 213 | |
| 214 public: | |
| 215 | |
| 216 Sparse (const dim_vector& dv); | |
| 217 | |
| 218 Sparse (const Sparse<T>& a, const dim_vector& dv); | |
| 219 | |
| 5275 | 220 Sparse (const Array<T>& a, const Array<octave_idx_type>& r, const Array<octave_idx_type>& c, |
| 221 octave_idx_type nr, octave_idx_type nc, bool sum_terms); | |
| 5164 | 222 |
| 223 Sparse (const Array<T>& a, const Array<double>& r, const Array<double>& c, | |
| 5275 | 224 octave_idx_type nr, octave_idx_type nc, bool sum_terms); |
| 5164 | 225 |
| 226 // Sparsify a normal matrix | |
| 227 Sparse (const Array2<T>& a); | |
| 228 Sparse (const Array<T>& a); | |
| 229 | |
| 230 virtual ~Sparse (void); | |
| 231 | |
|
7717
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
232 Sparse<T>& operator = (const Sparse<T>& a); |
| 5164 | 233 |
| 5604 | 234 // Note that nzmax and capacity are the amount of storage for |
| 235 // non-zero elements, while nnz is the actual number of non-zero | |
| 236 // terms. | |
| 237 octave_idx_type nzmax (void) const { return rep->length (); } | |
| 238 octave_idx_type capacity (void) const { return nzmax (); } | |
| 239 octave_idx_type nnz (void) const { return rep->nnz (); } | |
| 5164 | 240 |
| 241 // Paranoid number of elements test for case of dims = (-1,-1) | |
| 5275 | 242 octave_idx_type numel (void) const |
| 5164 | 243 { |
| 244 if (dim1() < 0 || dim2() < 0) | |
| 245 return 0; | |
| 246 else | |
| 247 return dimensions.numel (); | |
| 248 } | |
| 249 | |
| 5275 | 250 octave_idx_type nelem (void) const { return capacity (); } |
| 251 octave_idx_type length (void) const { return numel (); } | |
| 5164 | 252 |
| 5275 | 253 octave_idx_type dim1 (void) const { return dimensions(0); } |
| 254 octave_idx_type dim2 (void) const { return dimensions(1); } | |
| 5164 | 255 |
| 5275 | 256 octave_idx_type rows (void) const { return dim1 (); } |
| 257 octave_idx_type cols (void) const { return dim2 (); } | |
| 258 octave_idx_type columns (void) const { return dim2 (); } | |
| 5164 | 259 |
| 5275 | 260 octave_idx_type get_row_index (octave_idx_type k) { return ridx (k); } |
| 261 octave_idx_type get_col_index (octave_idx_type k) | |
| 5164 | 262 { |
| 5275 | 263 octave_idx_type ret = 0; |
| 5164 | 264 while (cidx(ret+1) < k) |
| 265 ret++; | |
| 266 return ret; | |
| 267 } | |
| 5275 | 268 size_t byte_size (void) const { return (cols () + 1) * sizeof (octave_idx_type) + |
| 269 capacity () * (sizeof (T) + sizeof (octave_idx_type)); } | |
| 5164 | 270 |
| 271 dim_vector dims (void) const { return dimensions; } | |
| 272 | |
| 273 Sparse<T> squeeze (void) const { return *this; } | |
| 274 | |
| 5275 | 275 octave_idx_type compute_index (const Array<octave_idx_type>& ra_idx) const; |
| 5164 | 276 |
| 5275 | 277 T range_error (const char *fcn, octave_idx_type n) const; |
| 278 T& range_error (const char *fcn, octave_idx_type n); | |
| 5164 | 279 |
| 5275 | 280 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const; |
| 281 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j); | |
| 5164 | 282 |
| 5275 | 283 T range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const; |
| 284 T& range_error (const char *fcn, const Array<octave_idx_type>& ra_idx); | |
| 5164 | 285 |
| 286 // No checking, even for multiple references, ever. | |
| 287 | |
| 5275 | 288 T& xelem (octave_idx_type n) |
| 5164 | 289 { |
| 5275 | 290 octave_idx_type i = n % rows (), j = n / rows(); |
| 5164 | 291 return xelem (i, j); |
| 292 } | |
| 293 | |
| 5275 | 294 T xelem (octave_idx_type n) const |
| 5164 | 295 { |
| 5275 | 296 octave_idx_type i = n % rows (), j = n / rows(); |
| 5164 | 297 return xelem (i, j); |
| 298 } | |
| 299 | |
| 5275 | 300 T& xelem (octave_idx_type i, octave_idx_type j) { return rep->elem (i, j); } |
| 301 T xelem (octave_idx_type i, octave_idx_type j) const { return rep->celem (i, j); } | |
| 5164 | 302 |
| 5275 | 303 T& xelem (const Array<octave_idx_type>& ra_idx) |
| 5164 | 304 { return xelem (compute_index (ra_idx)); } |
| 305 | |
| 5275 | 306 T xelem (const Array<octave_idx_type>& ra_idx) const |
| 5164 | 307 { return xelem (compute_index (ra_idx)); } |
| 308 | |
| 5775 | 309 // FIXME -- would be nice to fix this so that we don't |
| 5164 | 310 // unnecessarily force a copy, but that is not so easy, and I see no |
| 311 // clean way to do it. | |
| 312 | |
| 5275 | 313 T& checkelem (octave_idx_type n) |
| 5164 | 314 { |
| 315 if (n < 0 || n >= numel ()) | |
| 316 return range_error ("T& Sparse<T>::checkelem", n); | |
| 317 else | |
| 318 { | |
| 319 make_unique (); | |
| 320 return xelem (n); | |
| 321 } | |
| 322 } | |
| 323 | |
| 5275 | 324 T& checkelem (octave_idx_type i, octave_idx_type j) |
| 5164 | 325 { |
| 326 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
| 327 return range_error ("T& Sparse<T>::checkelem", i, j); | |
| 328 else | |
| 329 { | |
| 330 make_unique (); | |
| 331 return xelem (i, j); | |
| 332 } | |
| 333 } | |
| 334 | |
| 5275 | 335 T& checkelem (const Array<octave_idx_type>& ra_idx) |
| 5164 | 336 { |
| 5275 | 337 octave_idx_type i = compute_index (ra_idx); |
| 5164 | 338 |
| 339 if (i < 0) | |
| 340 return range_error ("T& Sparse<T>::checkelem", ra_idx); | |
| 341 else | |
| 342 return elem (i); | |
| 343 } | |
| 344 | |
| 5275 | 345 T& elem (octave_idx_type n) |
| 5164 | 346 { |
| 347 make_unique (); | |
| 348 return xelem (n); | |
| 349 } | |
| 350 | |
| 5275 | 351 T& elem (octave_idx_type i, octave_idx_type j) |
| 5164 | 352 { |
| 353 make_unique (); | |
| 354 return xelem (i, j); | |
| 355 } | |
| 356 | |
| 5275 | 357 T& elem (const Array<octave_idx_type>& ra_idx) |
| 5164 | 358 { return Sparse<T>::elem (compute_index (ra_idx)); } |
| 359 | |
| 360 #if defined (BOUNDS_CHECKING) | |
| 5275 | 361 T& operator () (octave_idx_type n) { return checkelem (n); } |
| 362 T& operator () (octave_idx_type i, octave_idx_type j) { return checkelem (i, j); } | |
| 363 T& operator () (const Array<octave_idx_type>& ra_idx) { return checkelem (ra_idx); } | |
| 5164 | 364 #else |
| 5275 | 365 T& operator () (octave_idx_type n) { return elem (n); } |
| 366 T& operator () (octave_idx_type i, octave_idx_type j) { return elem (i, j); } | |
| 367 T& operator () (const Array<octave_idx_type>& ra_idx) { return elem (ra_idx); } | |
| 5164 | 368 #endif |
| 369 | |
| 5275 | 370 T checkelem (octave_idx_type n) const |
| 5164 | 371 { |
| 372 if (n < 0 || n >= numel ()) | |
| 373 return range_error ("T Sparse<T>::checkelem", n); | |
| 374 else | |
| 375 return xelem (n); | |
| 376 } | |
| 377 | |
| 5275 | 378 T checkelem (octave_idx_type i, octave_idx_type j) const |
| 5164 | 379 { |
| 380 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
| 381 return range_error ("T Sparse<T>::checkelem", i, j); | |
| 382 else | |
| 383 return xelem (i, j); | |
| 384 } | |
| 385 | |
| 5275 | 386 T checkelem (const Array<octave_idx_type>& ra_idx) const |
| 5164 | 387 { |
| 5275 | 388 octave_idx_type i = compute_index (ra_idx); |
| 5164 | 389 |
| 390 if (i < 0) | |
| 391 return range_error ("T Sparse<T>::checkelem", ra_idx); | |
| 392 else | |
| 393 return Sparse<T>::elem (i); | |
| 394 } | |
| 395 | |
| 5275 | 396 T elem (octave_idx_type n) const { return xelem (n); } |
| 5164 | 397 |
| 5275 | 398 T elem (octave_idx_type i, octave_idx_type j) const { return xelem (i, j); } |
| 5164 | 399 |
| 5275 | 400 T elem (const Array<octave_idx_type>& ra_idx) const |
| 5164 | 401 { return Sparse<T>::elem (compute_index (ra_idx)); } |
| 402 | |
| 403 #if defined (BOUNDS_CHECKING) | |
| 5275 | 404 T operator () (octave_idx_type n) const { return checkelem (n); } |
| 405 T operator () (octave_idx_type i, octave_idx_type j) const { return checkelem (i, j); } | |
| 406 T operator () (const Array<octave_idx_type>& ra_idx) const { return checkelem (ra_idx); } | |
| 5164 | 407 #else |
| 5275 | 408 T operator () (octave_idx_type n) const { return elem (n); } |
| 409 T operator () (octave_idx_type i, octave_idx_type j) const { return elem (i, j); } | |
| 410 T operator () (const Array<octave_idx_type>& ra_idx) const { return elem (ra_idx); } | |
| 5164 | 411 #endif |
| 412 | |
| 413 Sparse<T> maybe_compress (bool remove_zeros = false) | |
| 414 { rep->maybe_compress (remove_zeros); return (*this); } | |
| 415 | |
| 416 Sparse<T> reshape (const dim_vector& new_dims) const; | |
| 417 | |
| 418 // !!! WARNING !!! -- the following resize_no_fill functions are | |
| 419 // public because template friends don't work properly with versions | |
| 420 // of gcc earlier than 3.3. You should use these functions only in | |
| 421 // classes that are derived from Sparse<T>. | |
| 422 | |
| 423 // protected: | |
| 424 | |
| 5275 | 425 void resize_no_fill (octave_idx_type r, octave_idx_type c); |
| 5164 | 426 |
| 427 void resize_no_fill (const dim_vector& dv); | |
| 428 | |
| 429 public: | |
| 5275 | 430 Sparse<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const; |
| 5164 | 431 |
| 5275 | 432 Sparse<T> ipermute (const Array<octave_idx_type>& vec) const |
| 5164 | 433 { return permute (vec, true); } |
| 434 | |
| 5275 | 435 void resize (octave_idx_type r, octave_idx_type c) { resize_no_fill (r, c); } |
| 5164 | 436 |
| 437 void resize (const dim_vector& dv) { resize_no_fill (dv); } | |
| 438 | |
| 5275 | 439 void change_capacity (octave_idx_type nz) { rep->change_length (nz); } |
| 5164 | 440 |
| 5275 | 441 Sparse<T>& insert (const Sparse<T>& a, octave_idx_type r, octave_idx_type c); |
| 442 Sparse<T>& insert (const Sparse<T>& a, const Array<octave_idx_type>& idx); | |
| 5164 | 443 |
| 444 bool is_square (void) const { return (dim1 () == dim2 ()); } | |
| 445 | |
| 446 bool is_empty (void) const { return (rows () < 1 && cols () < 1); } | |
| 447 | |
| 448 Sparse<T> transpose (void) const; | |
| 449 | |
| 450 T* data (void) { make_unique (); return rep->d; } | |
| 5275 | 451 T& data (octave_idx_type i) { make_unique (); return rep->data (i); } |
| 5164 | 452 T* xdata (void) { return rep->d; } |
| 5275 | 453 T& xdata (octave_idx_type i) { return rep->data (i); } |
| 5164 | 454 |
| 5275 | 455 T data (octave_idx_type i) const { return rep->data (i); } |
| 5900 | 456 // FIXME -- shouldn't this be returning const T*? |
| 5164 | 457 T* data (void) const { return rep->d; } |
| 458 | |
| 5275 | 459 octave_idx_type* ridx (void) { make_unique (); return rep->r; } |
| 460 octave_idx_type& ridx (octave_idx_type i) { make_unique (); return rep->ridx (i); } | |
| 461 octave_idx_type* xridx (void) { return rep->r; } | |
| 462 octave_idx_type& xridx (octave_idx_type i) { return rep->ridx (i); } | |
| 5164 | 463 |
| 5275 | 464 octave_idx_type ridx (octave_idx_type i) const { return rep->cridx (i); } |
| 5900 | 465 // FIXME -- shouldn't this be returning const octave_idx_type*? |
| 5275 | 466 octave_idx_type* ridx (void) const { return rep->r; } |
| 5164 | 467 |
| 5275 | 468 octave_idx_type* cidx (void) { make_unique (); return rep->c; } |
| 469 octave_idx_type& cidx (octave_idx_type i) { make_unique (); return rep->cidx (i); } | |
| 470 octave_idx_type* xcidx (void) { return rep->c; } | |
| 471 octave_idx_type& xcidx (octave_idx_type i) { return rep->cidx (i); } | |
| 5164 | 472 |
| 5275 | 473 octave_idx_type cidx (octave_idx_type i) const { return rep->ccidx (i); } |
| 5900 | 474 // FIXME -- shouldn't this be returning const octave_idx_type*? |
| 5275 | 475 octave_idx_type* cidx (void) const { return rep->c; } |
| 5164 | 476 |
| 5275 | 477 octave_idx_type ndims (void) const { return dimensions.length (); } |
| 5164 | 478 |
| 479 void clear_index (void); | |
| 480 | |
| 481 void set_index (const idx_vector& i); | |
| 482 | |
| 5275 | 483 octave_idx_type index_count (void) const { return idx_count; } |
| 5164 | 484 |
| 485 idx_vector *get_idx (void) const { return idx; } | |
| 486 | |
| 487 void maybe_delete_elements (idx_vector& i); | |
| 488 | |
| 489 void maybe_delete_elements (idx_vector& i, idx_vector& j); | |
| 490 | |
| 491 void maybe_delete_elements (Array<idx_vector>& ra_idx); | |
| 492 | |
| 493 Sparse<T> value (void); | |
| 494 | |
| 495 Sparse<T> index (idx_vector& i, int resize_ok = 0) const; | |
| 496 | |
| 497 Sparse<T> index (idx_vector& i, idx_vector& j, int resize_ok = 0) const; | |
| 498 | |
| 499 Sparse<T> index (Array<idx_vector>& ra_idx, int resize_ok = 0) const; | |
| 500 | |
| 501 void print_info (std::ostream& os, const std::string& prefix) const; | |
| 502 | |
| 5900 | 503 // Unsafe. These functions exist to support the MEX interface. |
| 504 // You should not use them anywhere else. | |
| 505 void *mex_get_data (void) const { return const_cast<T *> (data ()); } | |
| 506 | |
| 507 octave_idx_type *mex_get_ir (void) const { return const_cast<octave_idx_type *> (ridx ()); } | |
| 508 | |
| 509 octave_idx_type *mex_get_jc (void) const { return const_cast<octave_idx_type *> (cidx ()); } | |
| 7433 | 510 |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7433
diff
changeset
|
511 Sparse<T> sort (octave_idx_type dim = 0, sortmode mode = ASCENDING) const; |
| 7433 | 512 Sparse<T> sort (Array<octave_idx_type> &sidx, octave_idx_type dim = 0, |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7433
diff
changeset
|
513 sortmode mode = ASCENDING) const; |
|
7602
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
514 |
|
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7602
diff
changeset
|
515 Sparse<T> diag (octave_idx_type k = 0) const; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7602
diff
changeset
|
516 |
|
7602
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
517 template <class U, class F> |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
518 Sparse<U> |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
519 map (F fcn) const |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
520 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
521 Sparse<U> result; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
522 U f_zero = fcn (0.); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
523 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
524 if (f_zero != 0.) |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
525 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
526 octave_idx_type nr = rows (); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
527 octave_idx_type nc = cols (); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
528 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
529 result = Sparse<U> (nr, nc, f_zero); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
530 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
531 for (octave_idx_type j = 0; j < nc; j++) |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
532 for (octave_idx_type i = cidx(j); i < cidx (j+1); i++) |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
533 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
534 OCTAVE_QUIT; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
535 /* Use data instead of elem for better performance. */ |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
536 result.data (ridx (i) + j * nr) = fcn (data(i)); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
537 } |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
538 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
539 result.maybe_compress (true); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
540 } |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
541 else |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
542 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
543 octave_idx_type nz = nnz (); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
544 octave_idx_type nr = rows (); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
545 octave_idx_type nc = cols (); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
546 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
547 result = Sparse<U> (nr, nc, nz); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
548 octave_idx_type ii = 0; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
549 result.cidx (ii) = 0; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
550 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
551 for (octave_idx_type j = 0; j < nc; j++) |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
552 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
553 for (octave_idx_type i = cidx(j); i < cidx (j+1); i++) |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
554 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
555 U val = fcn (data (i)); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
556 if (val != 0.0) |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
557 { |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
558 result.data (ii) = val; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
559 result.ridx (ii++) = ridx (i); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
560 } |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
561 OCTAVE_QUIT; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
562 } |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
563 result.cidx (j+1) = ii; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
564 } |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
565 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
566 result.maybe_compress (false); |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
567 } |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
568 |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
569 return result; |
|
7bfaa9611558
Rewrite sparse mappers in terms of a functor template function
David Bateman <dbateman@free.fr>
parents:
7470
diff
changeset
|
570 } |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
571 |
|
9812
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
572 // Overloads for function references. |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
573 template <class U> |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
574 Sparse<U> |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
575 map (U (&fcn) (T)) const |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
576 { return map<U, U (&) (T)> (fcn); } |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
577 |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
578 template <class U> |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
579 Sparse<U> |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
580 map (U (&fcn) (const T&)) const |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
581 { return map<U, U (&) (const T&)> (fcn); } |
|
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9469
diff
changeset
|
582 |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
583 bool indices_ok (void) const { return rep->indices_ok (); } |
| 5164 | 584 }; |
| 585 | |
| 586 // NOTE: these functions should be friends of the Sparse<T> class and | |
| 587 // Sparse<T>::dimensions should be protected, not public, but we can't | |
| 588 // do that because of bugs in gcc prior to 3.3. | |
| 589 | |
| 590 template <class LT, class RT> | |
| 591 /* friend */ int | |
| 592 assign (Sparse<LT>& lhs, const Sparse<RT>& rhs); | |
| 593 | |
| 594 template <class LT, class RT> | |
| 595 /* friend */ int | |
| 596 assign1 (Sparse<LT>& lhs, const Sparse<RT>& rhs); | |
| 597 | |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
598 template<typename T> |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
599 std::istream& |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
600 read_sparse_matrix (std::istream& is, Sparse<T>& a, |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
601 T (*read_fcn) (std::istream&)) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
602 { |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
603 octave_idx_type nr = a.rows (); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
604 octave_idx_type nc = a.cols (); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
605 octave_idx_type nz = a.nzmax (); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
606 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
607 if (nr > 0 && nc > 0) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
608 { |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
609 octave_idx_type itmp; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
610 octave_idx_type jtmp; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
611 octave_idx_type iold = 0; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
612 octave_idx_type jold = 0; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
613 octave_idx_type ii = 0; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
614 T tmp; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
615 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
616 a.cidx (0) = 0; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
617 for (octave_idx_type i = 0; i < nz; i++) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
618 { |
|
9829
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
619 itmp = 0; jtmp = 0; |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
620 is >> itmp; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
621 itmp--; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
622 |
|
9829
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
623 is >> jtmp; |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
624 jtmp--; |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
625 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
626 if (itmp < 0 || itmp >= nr) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
627 { |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
628 (*current_liboctave_error_handler) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
629 ("invalid sparse matrix: row index = %d out of range", |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
630 itmp + 1); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
631 is.setstate (std::ios::failbit); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
632 goto done; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
633 } |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
634 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
635 if (jtmp < 0 || jtmp >= nc) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
636 { |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
637 (*current_liboctave_error_handler) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
638 ("invalid sparse matrix: column index = %d out of range", |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
639 jtmp + 1); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
640 is.setstate (std::ios::failbit); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
641 goto done; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
642 } |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
643 |
|
9829
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
644 if (jtmp < jold) |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
645 { |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
646 (*current_liboctave_error_handler) |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
647 ("invalid sparse matrix: column indices must appear in ascending order"); |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
648 is.setstate (std::ios::failbit); |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
649 goto done; |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
650 } |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
651 else if (jtmp > jold) |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
652 { |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
653 for (octave_idx_type j = jold; j < jtmp; j++) |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
654 a.cidx(j+1) = ii; |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
655 } |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
656 else if (itmp < iold) |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
657 { |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
658 (*current_liboctave_error_handler) |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
659 ("invalid sparse matrix: row indices must appear in ascending order in each column"); |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
660 is.setstate (std::ios::failbit); |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
661 goto done; |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
662 } |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
663 |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
664 iold = itmp; |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
665 jold = jtmp; |
|
8fd88cc36fa4
fix loading sparse matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
666 |
|
9469
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
667 tmp = read_fcn (is); |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
668 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
669 if (is) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
670 { |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
671 a.data (ii) = tmp; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
672 a.ridx (ii++) = itmp; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
673 } |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
674 else |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
675 goto done; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
676 } |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
677 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
678 for (octave_idx_type j = jold; j < nc; j++) |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
679 a.cidx(j+1) = ii; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
680 } |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
681 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
682 done: |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
683 |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
684 return is; |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
685 } |
|
c6edba80dfae
sanity checks for loading sparse matrices
John W. Eaton <jwe@octave.org>
parents:
8950
diff
changeset
|
686 |
| 6708 | 687 #define INSTANTIATE_SPARSE_ASSIGN(LT, RT, API) \ |
| 688 template API int assign (Sparse<LT>&, const Sparse<RT>&); \ | |
| 689 template API int assign1 (Sparse<LT>&, const Sparse<RT>&); | |
| 5164 | 690 |
| 6708 | 691 #define INSTANTIATE_SPARSE(T, API) \ |
| 692 template class API Sparse<T>; | |
| 5164 | 693 |
| 6708 | 694 #define INSTANTIATE_SPARSE_AND_ASSIGN(T, API) \ |
| 695 INSTANTIATE_SPARSE (T, API); \ | |
| 696 INSTANTIATE_SPARSE_ASSIGN (T, T, API) | |
| 5164 | 697 |
| 698 #endif | |
| 699 | |
| 700 /* | |
| 701 ;;; Local Variables: *** | |
| 702 ;;; mode: C++ *** | |
| 703 ;;; End: *** | |
| 704 */ |