Mercurial > octave
view libinterp/dldfcn/dmperm.cc @ 21211:2cf8bc5c7017
use "#if defined (HAVE_FOO)" instead of "#if HAVE_FOO" for feature tests
* configure.ac (HAVE_HDF5_INT2FLOAT_CONVERSIONS): AC_DEFINE here.
* ls-hdf5.cc (HAVE_HDF5_INT2FLOAT_CONVERSION): Delete definition.
* ls-hdf5.cc, ls-hdf5.h, ccolamd.cc, dmperm.cc, ov-base-int.cc,
ov-bool-mat.cc, ov-bool-sparse.cc, ov-bool.cc, ov-cell.cc,
ov-class.cc, ov-complex.cc, ov-cx-mat.cc, ov-cx-sparse.cc,
ov-fcn-handle.cc, ov-fcn-inline.cc, ov-float.cc, ov-flt-complex.cc,
ov-flt-cx-mat.cc, ov-flt-re-mat.cc, ov-java.cc, ov-range.cc,
ov-re-mat.cc, ov-re-sparse.cc, ov-scalar.cc, ov-str-mat.cc,
ov-struct.cc, pt-eval.cc:
Use #if defined (HAVE_FOO) instead of #if HAVE_FOO.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Sat, 06 Feb 2016 08:48:47 -0500 |
parents | fcac5dbbf9ed |
children | a83e7a384ee0 |
line wrap: on
line source
/* Copyright (C) 2005-2015 David Bateman Copyright (C) 1998-2005 Andy Adler 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/>. */ #ifdef HAVE_CONFIG_H # include <config.h> #endif #include "defun-dld.h" #include "error.h" #include "errwarn.h" #include "ovl.h" #include "utils.h" #include "oct-sparse.h" #include "ov-re-sparse.h" #include "ov-cx-sparse.h" #include "sparse-qr.h" #if defined (ENABLE_64) # define CXSPARSE_NAME(name) cs_dl ## name #else # define CXSPARSE_NAME(name) cs_di ## name #endif static RowVector put_int (octave_idx_type *p, octave_idx_type n) { RowVector ret (n); for (octave_idx_type i = 0; i < n; i++) ret.xelem (i) = p[i] + 1; return ret; } #if defined (HAVE_CXSPARSE) static octave_value_list dmperm_internal (bool rank, const octave_value arg, int nargout) { octave_value_list retval; octave_idx_type nr = arg.rows (); octave_idx_type nc = arg.columns (); SparseMatrix m; SparseComplexMatrix cm; CXSPARSE_NAME () csm; csm.m = nr; csm.n = nc; csm.x = 0; csm.nz = -1; if (arg.is_real_type ()) { m = arg.sparse_matrix_value (); csm.nzmax = m.nnz (); csm.p = m.xcidx (); csm.i = m.xridx (); } else { cm = arg.sparse_complex_matrix_value (); csm.nzmax = cm.nnz (); csm.p = cm.xcidx (); csm.i = cm.xridx (); } if (nargout <= 1 || rank) { octave_idx_type *jmatch = CXSPARSE_NAME (_maxtrans) (&csm, 0); if (rank) { octave_idx_type r = 0; for (octave_idx_type i = 0; i < nc; i++) if (jmatch[nr+i] >= 0) r++; retval(0) = static_cast<double>(r); } else retval(0) = put_int (jmatch + nr, nc); CXSPARSE_NAME (_free) (jmatch); } else { CXSPARSE_NAME (d) *dm = CXSPARSE_NAME(_dmperm) (&csm, 0); //retval(5) = put_int (dm->rr, 5); //retval(4) = put_int (dm->cc, 5); retval = ovl (put_int (dm->p, nr), put_int (dm->q, nc), put_int (dm->r, dm->nb+1), put_int (dm->s, dm->nb+1)); CXSPARSE_NAME (_dfree) (dm); } return retval; } #endif DEFUN_DLD (dmperm, args, nargout, "-*- texinfo -*-\n\ @deftypefn {} {@var{p} =} dmperm (@var{S})\n\ @deftypefnx {} {[@var{p}, @var{q}, @var{r}, @var{S}] =} dmperm (@var{S})\n\ \n\ @cindex @nospell{Dulmage-Mendelsohn} decomposition\n\ Perform a @nospell{Dulmage-Mendelsohn} permutation of the sparse matrix\n\ @var{S}.\n\ \n\ With a single output argument @code{dmperm} performs the row permutations\n\ @var{p} such that @code{@var{S}(@var{p},:)} has no zero elements on the\n\ diagonal.\n\ \n\ Called with two or more output arguments, returns the row and column\n\ permutations, such that @code{@var{S}(@var{p}, @var{q})} is in block\n\ triangular form. The values of @var{r} and @var{S} define the boundaries\n\ of the blocks. If @var{S} is square then @code{@var{r} == @var{S}}.\n\ \n\ The method used is described in: @nospell{A. Pothen & C.-J. Fan.}\n\ @cite{Computing the Block Triangular Form of a Sparse Matrix}.\n\ ACM Trans. Math. Software, 16(4):303-324, 1990.\n\ @seealso{colamd, ccolamd}\n\ @end deftypefn") { #if defined (HAVE_CXSPARSE) if (args.length () != 1) print_usage (); return ovl (dmperm_internal (false, args(0), nargout)); #else err_disabled_feature ("dmperm", "CXSparse"); #endif } /* %!testif HAVE_CXSPARSE %! n = 20; %! a = speye (n,n); %! a = a(randperm (n),:); %! assert (a(dmperm (a),:), speye (n)); %!testif HAVE_CXSPARSE %! n = 20; %! d = 0.2; %! a = tril (sprandn (n,n,d), -1) + speye (n,n); %! a = a(randperm (n), randperm (n)); %! [p,q,r,s] = dmperm (a); %! assert (tril (a(p,q), -1), sparse (n, n)); */ DEFUN_DLD (sprank, args, nargout, "-*- texinfo -*-\n\ @deftypefn {} {@var{p} =} sprank (@var{S})\n\ @cindex structural rank\n\ \n\ Calculate the structural rank of the sparse matrix @var{S}.\n\ \n\ Note that only the structure of the matrix is used in this calculation based\n\ on a @nospell{Dulmage-Mendelsohn} permutation to block triangular form. As\n\ such the numerical rank of the matrix @var{S} is bounded by\n\ @code{sprank (@var{S}) >= rank (@var{S})}. Ignoring floating point errors\n\ @code{sprank (@var{S}) == rank (@var{S})}.\n\ @seealso{dmperm}\n\ @end deftypefn") { #if defined (HAVE_CXSPARSE) if (args.length () != 1) print_usage (); return ovl (dmperm_internal (true, args(0), nargout)); #else err_disabled_feature ("sprank", "CXSparse"); #endif } /* %!testif HAVE_CXSPARSE %! assert (sprank (speye (20)), 20) %!testif HAVE_CXSPARSE %! assert (sprank ([1,0,2,0;2,0,4,0]), 2) %!error sprank (1,2) */