Mercurial > octave
view liboctave/array/Sparse.h @ 21244:1473547f50f5
include octave-config.h in public header files
* mk-opts.pl, mkbuiltins, mk-ops.awk, sparse-mk-ops.awk:
Emit "#include octave-config.h" statement for generated header files.
* build-env.h, builtins.h, Cell.h, base-text-renderer.h,
c-file-ptr-stream.h, cdisplay.h, comment-list.h, data.h, debug.h,
defaults.in.h, defun-dld.h, defun-int.h, defun.h, dirfns.h, display.h,
dynamic-ld.h, error.h, errwarn.h, event-queue.h, file-io.h,
ft-text-renderer.h, gl-render.h, gl2ps-print.h, graphics.in.h,
gripes.h, help.h, hook-fcn.h, input.h, jit-ir.h, jit-typeinfo.h,
jit-util.h, load-path.h, load-save.h, ls-ascii-helper.h, ls-hdf5.h,
ls-mat-ascii.h, ls-mat4.h, ls-mat5.h, ls-oct-binary.h, ls-oct-text.h,
ls-utils.h, mex.h, mexproto.h, mxarray.in.h, oct-errno.h, oct-fstrm.h,
oct-handle.h, oct-hdf5-types.h, oct-hdf5.h, oct-hist.h, oct-iostrm.h,
oct-lvalue.h, oct-map.h, oct-obj.h, oct-opengl.h, oct-prcstrm.h,
oct-procbuf.h, oct-stdstrm.h, oct-stream.h, oct-strstrm.h, oct.h,
octave-default-image.h, octave-link.h, octave-preserve-stream-state.h,
pager.h, pr-output.h, procstream.h, profiler.h, pt-jit.h,
sighandlers.h, siglist.h, sparse-xdiv.h, sparse-xpow.h, symtab.h,
sysdep.h, text-renderer.h, toplev.h, txt-eng.h, utils.h, variables.h,
workspace-element.h, xdiv.h, xnorm.h, xpow.h, zfstream.h, oct-qhull.h,
ov-base-diag.h, ov-base-int.h, ov-base-mat.h, ov-base-scalar.h,
ov-base-sparse.h, ov-base.h, ov-bool-mat.h, ov-bool-sparse.h,
ov-bool.h, ov-builtin.h, ov-cell.h, ov-ch-mat.h, ov-class.h,
ov-classdef.h, ov-colon.h, ov-complex.h, ov-cs-list.h, ov-cx-diag.h,
ov-cx-mat.h, ov-cx-sparse.h, ov-dld-fcn.h, ov-fcn-handle.h,
ov-fcn-inline.h, ov-fcn.h, ov-float.h, ov-flt-complex.h,
ov-flt-cx-diag.h, ov-flt-cx-mat.h, ov-flt-re-diag.h, ov-flt-re-mat.h,
ov-int-traits.h, ov-int16.h, ov-int32.h, ov-int64.h, ov-int8.h,
ov-intx.h, ov-java.h, ov-lazy-idx.h, ov-mex-fcn.h, ov-null-mat.h,
ov-oncleanup.h, ov-perm.h, ov-range.h, ov-re-diag.h, ov-re-mat.h,
ov-re-sparse.h, ov-scalar.h, ov-str-mat.h, ov-struct.h,
ov-type-conv.h, ov-typeinfo.h, ov-uint16.h, ov-uint32.h, ov-uint64.h,
ov-uint8.h, ov-usr-fcn.h, ov.h, ovl.h, octave.h, op-int.h, ops.h,
options-usage.h, lex.h, parse.h, pt-all.h, pt-arg-list.h,
pt-array-list.h, pt-assign.h, pt-binop.h, pt-bp.h, pt-cbinop.h,
pt-cell.h, pt-check.h, pt-classdef.h, pt-cmd.h, pt-colon.h,
pt-const.h, pt-decl.h, pt-eval.h, pt-except.h, pt-exp.h,
pt-fcn-handle.h, pt-funcall.h, pt-id.h, pt-idx.h, pt-jump.h,
pt-loop.h, pt-mat.h, pt-misc.h, pt-pr-code.h, pt-select.h, pt-stmt.h,
pt-unop.h, pt-walk.h, pt.h, token.h, version.in.h, Array-util.h,
Array.h, CColVector.h, CDiagMatrix.h, CMatrix.h, CNDArray.h,
CRowVector.h, CSparse.h, DiagArray2.h, MArray.h, MDiagArray2.h,
MSparse.h, Matrix.h, MatrixType.h, PermMatrix.h, Range.h, Sparse.h,
boolMatrix.h, boolNDArray.h, boolSparse.h, chMatrix.h, chNDArray.h,
dColVector.h, dDiagMatrix.h, dMatrix.h, dNDArray.h, dRowVector.h,
dSparse.h, dim-vector.h, fCColVector.h, fCDiagMatrix.h, fCMatrix.h,
fCNDArray.h, fCRowVector.h, fColVector.h, fDiagMatrix.h, fMatrix.h,
fNDArray.h, fRowVector.h, idx-vector.h, int16NDArray.h,
int32NDArray.h, int64NDArray.h, int8NDArray.h, intNDArray.h,
uint16NDArray.h, uint32NDArray.h, uint64NDArray.h, uint8NDArray.h,
f77-fcn.h, lo-error.h, quit.h, CmplxAEPBAL.h, CmplxCHOL.h,
CmplxGEPBAL.h, CmplxHESS.h, CmplxLU.h, CmplxQR.h, CmplxQRP.h,
CmplxSCHUR.h, CmplxSVD.h, CollocWt.h, DAE.h, DAEFunc.h, DAERT.h,
DAERTFunc.h, DASPK.h, DASRT.h, DASSL.h, DET.h, EIG.h, LSODE.h, ODE.h,
ODEFunc.h, ODES.h, ODESFunc.h, Quad.h, base-aepbal.h, base-dae.h,
base-de.h, base-lu.h, base-min.h, base-qr.h, bsxfun-decl.h, bsxfun.h,
dbleAEPBAL.h, dbleCHOL.h, dbleGEPBAL.h, dbleHESS.h, dbleLU.h,
dbleQR.h, dbleQRP.h, dbleSCHUR.h, dbleSVD.h, eigs-base.h,
fCmplxAEPBAL.h, fCmplxCHOL.h, fCmplxGEPBAL.h, fCmplxHESS.h,
fCmplxLU.h, fCmplxQR.h, fCmplxQRP.h, fCmplxSCHUR.h, fCmplxSVD.h,
fEIG.h, floatAEPBAL.h, floatCHOL.h, floatGEPBAL.h, floatHESS.h,
floatLU.h, floatQR.h, floatQRP.h, floatSCHUR.h, floatSVD.h,
lo-mappers.h, lo-specfun.h, oct-convn.h, oct-fftw.h, oct-norm.h,
oct-rand.h, oct-spparms.h, randgamma.h, randmtzig.h, randpoisson.h,
sparse-chol.h, sparse-dmsolve.h, sparse-lu.h, sparse-qr.h,
Sparse-diag-op-defs.h, Sparse-op-decls.h, Sparse-op-defs.h,
Sparse-perm-op-defs.h, mx-base.h, mx-defs.h, mx-ext.h, mx-op-decl.h,
mx-op-defs.h, dir-ops.h, file-ops.h, file-stat.h, lo-sysdep.h,
mach-info.h, oct-env.h, oct-group.h, oct-openmp.h, oct-passwd.h,
oct-syscalls.h, oct-time.h, oct-uname.h, pathlen.h, sysdir.h,
syswait.h, action-container.h, base-list.h, byte-swap.h,
caseless-str.h, cmd-edit.h, cmd-hist.h, data-conv.h, functor.h,
glob-match.h, lo-array-errwarn.h, lo-array-gripes.h, lo-cutils.h,
lo-ieee.h, lo-macros.h, lo-math.h, lo-regexp.h, lo-traits.h,
lo-utils.h, oct-alloc.h, oct-base64.h, oct-binmap.h, oct-cmplx.h,
oct-glob.h, oct-inttypes.h, oct-locbuf.h, oct-mutex.h, oct-refcount.h,
oct-rl-edit.h, oct-rl-hist.h, oct-shlib.h, oct-sort.h, oct-sparse.h,
pathsearch.h, singleton-cleanup.h, sparse-sort.h, sparse-util.h,
statdefs.h, str-vec.h, sun-utils.h, unwind-prot.h, url-transfer.h:
Include octave-config.h.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Wed, 10 Feb 2016 14:25:53 -0500 |
parents | a83e7a384ee0 |
children | ae4d7dfea337 |
line wrap: on
line source
// Template sparse classes /* Copyright (C) 2004-2015 David Bateman Copyright (C) 1998-2004 Andy Adler Copyright (C) 2010 VZLU Prague This file is part of Octave. Octave is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Octave is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Octave; see the file COPYING. If not, see <http://www.gnu.org/licenses/>. */ #if ! defined (octave_Sparse_h) #define octave_Sparse_h 1 #include "octave-config.h" #include <cassert> #include <cstddef> #include <iosfwd> #include <algorithm> #include "Array.h" #include "dim-vector.h" #include "lo-error.h" #include "lo-utils.h" #include "oct-sort.h" class idx_vector; class PermMatrix; // Two dimensional sparse class. Handles the reference counting for // all the derived classes. template <typename T> class Sparse { public: typedef T element_type; protected: //-------------------------------------------------------------------- // The real representation of all Sparse arrays. //-------------------------------------------------------------------- class OCTAVE_API SparseRep { public: T *d; octave_idx_type *r; octave_idx_type *c; octave_idx_type nzmx; octave_idx_type nrows; octave_idx_type ncols; octave_refcount<int> count; SparseRep (void) : d (0), r (0), c (new octave_idx_type [1]), nzmx (0), nrows (0), ncols (0), count (1) { c[0] = 0; } SparseRep (octave_idx_type n) : d (0), r (0), c (new octave_idx_type [n+1]), nzmx (0), nrows (n), ncols (n), count (1) { for (octave_idx_type i = 0; i < n + 1; i++) c[i] = 0; } SparseRep (octave_idx_type nr, octave_idx_type nc, octave_idx_type nz = 0) : d (nz > 0 ? new T [nz] : 0), r (nz > 0 ? new octave_idx_type [nz] : 0), c (new octave_idx_type [nc+1]), nzmx (nz), nrows (nr), ncols (nc), count (1) { for (octave_idx_type i = 0; i < nc + 1; i++) c[i] = 0; } SparseRep (const SparseRep& a) : d (new T [a.nzmx]), r (new octave_idx_type [a.nzmx]), c (new octave_idx_type [a.ncols + 1]), nzmx (a.nzmx), nrows (a.nrows), ncols (a.ncols), count (1) { octave_idx_type nz = a.nnz (); std::copy (a.d, a.d + nz, d); std::copy (a.r, a.r + nz, r); std::copy (a.c, a.c + ncols + 1, c); } ~SparseRep (void) { delete [] d; delete [] r; delete [] c; } octave_idx_type length (void) const { return nzmx; } octave_idx_type nnz (void) const { return c[ncols]; } T& elem (octave_idx_type _r, octave_idx_type _c); T celem (octave_idx_type _r, octave_idx_type _c) const; T& data (octave_idx_type i) { return d[i]; } T cdata (octave_idx_type i) const { return d[i]; } octave_idx_type& ridx (octave_idx_type i) { return r[i]; } octave_idx_type cridx (octave_idx_type i) const { return r[i]; } octave_idx_type& cidx (octave_idx_type i) { return c[i]; } octave_idx_type ccidx (octave_idx_type i) const { return c[i]; } void maybe_compress (bool remove_zeros); void change_length (octave_idx_type nz); bool indices_ok (void) const; private: // No assignment! SparseRep& operator = (const SparseRep& a); }; //-------------------------------------------------------------------- void make_unique (void) { if (rep->count > 1) { SparseRep *r = new SparseRep (*rep); if (--rep->count == 0) delete rep; rep = r; } } public: // !!! WARNING !!! -- these should be protected, not public. You // should not access these data members directly! typename Sparse<T>::SparseRep *rep; dim_vector dimensions; private: typename Sparse<T>::SparseRep *nil_rep (void) const { static typename Sparse<T>::SparseRep nr; return &nr; } public: Sparse (void) : rep (nil_rep ()), dimensions (dim_vector(0,0)) { rep->count++; } explicit Sparse (octave_idx_type n) : rep (new typename Sparse<T>::SparseRep (n)), dimensions (dim_vector (n, n)) { } explicit Sparse (octave_idx_type nr, octave_idx_type nc) : rep (new typename Sparse<T>::SparseRep (nr, nc)), dimensions (dim_vector (nr, nc)) { } explicit Sparse (octave_idx_type nr, octave_idx_type nc, T val); Sparse (const dim_vector& dv, octave_idx_type nz) : rep (new typename Sparse<T>::SparseRep (dv(0), dv(1), nz)), dimensions (dv) { } Sparse (octave_idx_type nr, octave_idx_type nc, octave_idx_type nz) : rep (new typename Sparse<T>::SparseRep (nr, nc, nz)), dimensions (dim_vector (nr, nc)) { } // Both SparseMatrix and SparseBoolMatrix need this ctor, and this // is their only common ancestor. explicit Sparse (const PermMatrix& a); // Type conversion case. Preserves capacity (). template <typename U> Sparse (const Sparse<U>& a) : rep (new typename Sparse<T>::SparseRep (a.rep->nrows, a.rep->ncols, a.rep->nzmx)), dimensions (a.dimensions) { octave_idx_type nz = a.nnz (); std::copy (a.rep->d, a.rep->d + nz, rep->d); std::copy (a.rep->r, a.rep->r + nz, rep->r); std::copy (a.rep->c, a.rep->c + rep->ncols + 1, rep->c); } // No type conversion case. Sparse (const Sparse<T>& a) : rep (a.rep), dimensions (a.dimensions) { rep->count++; } public: Sparse (const dim_vector& dv); Sparse (const Sparse<T>& a, const dim_vector& dv); Sparse (const Array<T>& a, const idx_vector& r, const idx_vector& c, octave_idx_type nr = -1, octave_idx_type nc = -1, bool sum_terms = true, octave_idx_type nzm = -1); // Sparsify a normal matrix Sparse (const Array<T>& a); virtual ~Sparse (void); Sparse<T>& operator = (const Sparse<T>& a); //! Amount of storage for nonzero elements. //! This may differ from the actual number of elements, see nnz(). octave_idx_type nzmax (void) const { return rep->length (); } //! Amount of storage for nonzero elements. //! Synonymous with nzmax(). OCTAVE_DEPRECATED ("use 'nzmax' instead") octave_idx_type capacity (void) const { return nzmax (); } //! Actual number of nonzero terms. octave_idx_type nnz (void) const { return rep->nnz (); } // Querying the number of elements (incl. zeros) may overflow the index type, // so don't do it unless you really need it. octave_idx_type numel (void) const { return dimensions.safe_numel (); } OCTAVE_DEPRECATED ("use 'nzmax' instead") octave_idx_type nelem (void) const { return nzmax (); } OCTAVE_DEPRECATED ("use 'numel' instead") octave_idx_type length (void) const { return numel (); } octave_idx_type dim1 (void) const { return dimensions(0); } octave_idx_type dim2 (void) const { return dimensions(1); } octave_idx_type rows (void) const { return dim1 (); } octave_idx_type cols (void) const { return dim2 (); } octave_idx_type columns (void) const { return dim2 (); } octave_idx_type get_row_index (octave_idx_type k) { return ridx (k); } octave_idx_type get_col_index (octave_idx_type k) { octave_idx_type ret = 0; while (cidx (ret+1) < k) ret++; return ret; } size_t byte_size (void) const { return (static_cast<size_t>(cols () + 1) * sizeof (octave_idx_type) + static_cast<size_t> (nzmax ()) * (sizeof (T) + sizeof (octave_idx_type))); } dim_vector dims (void) const { return dimensions; } Sparse<T> squeeze (void) const { return *this; } octave_idx_type compute_index (const Array<octave_idx_type>& ra_idx) const; OCTAVE_NORETURN T range_error (const char *fcn, octave_idx_type n) const; OCTAVE_NORETURN T& range_error (const char *fcn, octave_idx_type n); OCTAVE_NORETURN T range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const; OCTAVE_NORETURN T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j); OCTAVE_NORETURN T range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const; OCTAVE_NORETURN T& range_error (const char *fcn, const Array<octave_idx_type>& ra_idx); // No checking, even for multiple references, ever. T& xelem (octave_idx_type n) { octave_idx_type i = n % rows (); octave_idx_type j = n / rows (); return xelem (i, j); } T xelem (octave_idx_type n) const { octave_idx_type i = n % rows (); octave_idx_type j = n / rows (); return xelem (i, j); } T& xelem (octave_idx_type i, octave_idx_type j) { return rep->elem (i, j); } T xelem (octave_idx_type i, octave_idx_type j) const { return rep->celem (i, j); } T& xelem (const Array<octave_idx_type>& ra_idx) { return xelem (compute_index (ra_idx)); } T xelem (const Array<octave_idx_type>& ra_idx) const { return xelem (compute_index (ra_idx)); } // FIXME: would be nice to fix this so that we don't // unnecessarily force a copy, but that is not so easy, and I see no // clean way to do it. T& checkelem (octave_idx_type n) { if (n < 0 || n >= numel ()) return range_error ("T& Sparse<T>::checkelem", n); else { make_unique (); return xelem (n); } } T& checkelem (octave_idx_type i, octave_idx_type j) { if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) return range_error ("T& Sparse<T>::checkelem", i, j); else { make_unique (); return xelem (i, j); } } T& checkelem (const Array<octave_idx_type>& ra_idx) { octave_idx_type i = compute_index (ra_idx); if (i < 0) return range_error ("T& Sparse<T>::checkelem", ra_idx); else return elem (i); } T& elem (octave_idx_type n) { make_unique (); return xelem (n); } T& elem (octave_idx_type i, octave_idx_type j) { make_unique (); return xelem (i, j); } T& elem (const Array<octave_idx_type>& ra_idx) { return Sparse<T>::elem (compute_index (ra_idx)); } #if defined (OCTAVE_ENABLE_BOUNDS_CHECK) T& operator () (octave_idx_type n) { return checkelem (n); } T& operator () (octave_idx_type i, octave_idx_type j) { return checkelem (i, j); } T& operator () (const Array<octave_idx_type>& ra_idx) { return checkelem (ra_idx); } #else T& operator () (octave_idx_type n) { return elem (n); } T& operator () (octave_idx_type i, octave_idx_type j) { return elem (i, j); } T& operator () (const Array<octave_idx_type>& ra_idx) { return elem (ra_idx); } #endif T checkelem (octave_idx_type n) const { if (n < 0 || n >= numel ()) return range_error ("T Sparse<T>::checkelem", n); else return xelem (n); } T checkelem (octave_idx_type i, octave_idx_type j) const { if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) return range_error ("T Sparse<T>::checkelem", i, j); else return xelem (i, j); } T checkelem (const Array<octave_idx_type>& ra_idx) const { octave_idx_type i = compute_index (ra_idx); if (i < 0) return range_error ("T Sparse<T>::checkelem", ra_idx); else return Sparse<T>::elem (i); } T elem (octave_idx_type n) const { return xelem (n); } T elem (octave_idx_type i, octave_idx_type j) const { return xelem (i, j); } T elem (const Array<octave_idx_type>& ra_idx) const { return Sparse<T>::elem (compute_index (ra_idx)); } #if defined (OCTAVE_ENABLE_BOUNDS_CHECK) T operator () (octave_idx_type n) const { return checkelem (n); } T operator () (octave_idx_type i, octave_idx_type j) const { return checkelem (i, j); } T operator () (const Array<octave_idx_type>& ra_idx) const { return checkelem (ra_idx); } #else T operator () (octave_idx_type n) const { return elem (n); } T operator () (octave_idx_type i, octave_idx_type j) const { return elem (i, j); } T operator () (const Array<octave_idx_type>& ra_idx) const { return elem (ra_idx); } #endif Sparse<T> maybe_compress (bool remove_zeros = false) { if (remove_zeros) make_unique (); // Needs to unshare because elements are removed. rep->maybe_compress (remove_zeros); return (*this); } Sparse<T> reshape (const dim_vector& new_dims) const; Sparse<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const; Sparse<T> ipermute (const Array<octave_idx_type>& vec) const { return permute (vec, true); } void resize1 (octave_idx_type n); void resize (octave_idx_type r, octave_idx_type c); void resize (const dim_vector& dv); void change_capacity (octave_idx_type nz) { if (nz < nnz ()) make_unique (); // Unshare now because elements will be truncated. rep->change_length (nz); } Sparse<T>& insert (const Sparse<T>& a, octave_idx_type r, octave_idx_type c); Sparse<T>& insert (const Sparse<T>& a, const Array<octave_idx_type>& idx); bool is_square (void) const { return (dim1 () == dim2 ()); } bool is_empty (void) const { return (rows () < 1 && cols () < 1); } Sparse<T> transpose (void) const; T* data (void) { make_unique (); return rep->d; } T& data (octave_idx_type i) { make_unique (); return rep->data (i); } T* xdata (void) { return rep->d; } T& xdata (octave_idx_type i) { return rep->data (i); } T data (octave_idx_type i) const { return rep->data (i); } // FIXME: shouldn't this be returning const T*? T* data (void) const { return rep->d; } octave_idx_type* ridx (void) { make_unique (); return rep->r; } octave_idx_type& ridx (octave_idx_type i) { make_unique (); return rep->ridx (i); } octave_idx_type* xridx (void) { return rep->r; } octave_idx_type& xridx (octave_idx_type i) { return rep->ridx (i); } octave_idx_type ridx (octave_idx_type i) const { return rep->cridx (i); } // FIXME: shouldn't this be returning const octave_idx_type*? octave_idx_type* ridx (void) const { return rep->r; } octave_idx_type* cidx (void) { make_unique (); return rep->c; } octave_idx_type& cidx (octave_idx_type i) { make_unique (); return rep->cidx (i); } octave_idx_type* xcidx (void) { return rep->c; } octave_idx_type& xcidx (octave_idx_type i) { return rep->cidx (i); } octave_idx_type cidx (octave_idx_type i) const { return rep->ccidx (i); } // FIXME: shouldn't this be returning const octave_idx_type*? octave_idx_type* cidx (void) const { return rep->c; } octave_idx_type ndims (void) const { return dimensions.length (); } void delete_elements (const idx_vector& i); void delete_elements (int dim, const idx_vector& i); void delete_elements (const idx_vector& i, const idx_vector& j); Sparse<T> index (const idx_vector& i, bool resize_ok = false) const; Sparse<T> index (const idx_vector& i, const idx_vector& j, bool resize_ok = false) const; void assign (const idx_vector& i, const Sparse<T>& rhs); void assign (const idx_vector& i, const idx_vector& j, const Sparse<T>& rhs); void print_info (std::ostream& os, const std::string& prefix) const; // Unsafe. These functions exist to support the MEX interface. // You should not use them anywhere else. void *mex_get_data (void) const { return const_cast<T *> (data ()); } octave_idx_type *mex_get_ir (void) const { return const_cast<octave_idx_type *> (ridx ()); } octave_idx_type *mex_get_jc (void) const { return const_cast<octave_idx_type *> (cidx ()); } Sparse<T> sort (octave_idx_type dim = 0, sortmode mode = ASCENDING) const; Sparse<T> sort (Array<octave_idx_type> &sidx, octave_idx_type dim = 0, sortmode mode = ASCENDING) const; Sparse<T> diag (octave_idx_type k = 0) const; // dim = -1 and dim = -2 are special; see Array<T>::cat description. static Sparse<T> cat (int dim, octave_idx_type n, const Sparse<T> *sparse_list); Array<T> array_value (void) const; // Generic any/all test functionality with arbitrary predicate. template <typename F, bool zero> bool test (F fcn) const { return any_all_test<F, T, zero> (fcn, data (), nnz ()); } // Simpler calls. template <typename F> bool test_any (F fcn) const { return test<F, false> (fcn); } template <typename F> bool test_all (F fcn) const { return test<F, true> (fcn); } // Overloads for function references. bool test_any (bool (&fcn) (T)) const { return test<bool (&) (T), false> (fcn); } bool test_any (bool (&fcn) (const T&)) const { return test<bool (&) (const T&), false> (fcn); } bool test_all (bool (&fcn) (T)) const { return test<bool (&) (T), true> (fcn); } bool test_all (bool (&fcn) (const T&)) const { return test<bool (&) (const T&), true> (fcn); } template <typename U, typename F> Sparse<U> map (F fcn) const { Sparse<U> result; U f_zero = fcn (0.); if (f_zero != 0.) { octave_idx_type nr = rows (); octave_idx_type nc = cols (); result = Sparse<U> (nr, nc, f_zero); for (octave_idx_type j = 0; j < nc; j++) for (octave_idx_type i = cidx (j); i < cidx (j+1); i++) { octave_quit (); /* Use data instead of elem for better performance. */ result.data (ridx (i) + j * nr) = fcn (data (i)); } result.maybe_compress (true); } else { octave_idx_type nz = nnz (); octave_idx_type nr = rows (); octave_idx_type nc = cols (); result = Sparse<U> (nr, nc, nz); octave_idx_type ii = 0; result.cidx (ii) = 0; for (octave_idx_type j = 0; j < nc; j++) { for (octave_idx_type i = cidx (j); i < cidx (j+1); i++) { U val = fcn (data (i)); if (val != 0.0) { result.data (ii) = val; result.ridx (ii++) = ridx (i); } octave_quit (); } result.cidx (j+1) = ii; } result.maybe_compress (false); } return result; } // Overloads for function references. template <typename U> Sparse<U> map (U (&fcn) (T)) const { return map<U, U (&) (T)> (fcn); } template <typename U> Sparse<U> map (U (&fcn) (const T&)) const { return map<U, U (&) (const T&)> (fcn); } bool indices_ok (void) const { return rep->indices_ok (); } }; template <typename T> std::istream& read_sparse_matrix (std::istream& is, Sparse<T>& a, T (*read_fcn) (std::istream&)) { octave_idx_type nr = a.rows (); octave_idx_type nc = a.cols (); octave_idx_type nz = a.nzmax (); if (nr > 0 && nc > 0) { octave_idx_type itmp; octave_idx_type jtmp; octave_idx_type iold = 0; octave_idx_type jold = 0; octave_idx_type ii = 0; T tmp; a.cidx (0) = 0; for (octave_idx_type i = 0; i < nz; i++) { itmp = 0; jtmp = 0; is >> itmp; itmp--; is >> jtmp; jtmp--; if (itmp < 0 || itmp >= nr) { is.setstate (std::ios::failbit); (*current_liboctave_error_handler) ("invalid sparse matrix: row index = %d out of range", itmp + 1); } if (jtmp < 0 || jtmp >= nc) { is.setstate (std::ios::failbit); (*current_liboctave_error_handler) ("invalid sparse matrix: column index = %d out of range", jtmp + 1); } if (jtmp < jold) { is.setstate (std::ios::failbit); (*current_liboctave_error_handler) ("invalid sparse matrix: " "column indices must appear in ascending order"); } else if (jtmp > jold) { for (octave_idx_type j = jold; j < jtmp; j++) a.cidx (j+1) = ii; } else if (itmp < iold) { is.setstate (std::ios::failbit); (*current_liboctave_error_handler) ("invalid sparse matrix: " "row indices must appear in ascending order in each column"); } iold = itmp; jold = jtmp; tmp = read_fcn (is); if (! is) return is; // Problem, return is in error state a.data (ii) = tmp; a.ridx (ii++) = itmp; } for (octave_idx_type j = jold; j < nc; j++) a.cidx (j+1) = ii; } return is; } #endif