Mercurial > octave
view liboctave/array/PermMatrix.cc @ 21202:f7121e111991
maint: indent #ifdef blocks in liboctave and src directories.
* Array-C.cc, Array-b.cc, Array-ch.cc, Array-d.cc, Array-f.cc, Array-fC.cc,
Array-i.cc, Array-idx-vec.cc, Array-s.cc, Array-str.cc, Array-util.cc,
Array-voidp.cc, Array.cc, CColVector.cc, CDiagMatrix.cc, CMatrix.cc,
CNDArray.cc, CRowVector.cc, CSparse.cc, CSparse.h, DiagArray2.cc, MArray-C.cc,
MArray-d.cc, MArray-f.cc, MArray-fC.cc, MArray-i.cc, MArray-s.cc, MArray.cc,
MDiagArray2.cc, MSparse-C.cc, MSparse-d.cc, MSparse.h, MatrixType.cc,
PermMatrix.cc, Range.cc, Sparse-C.cc, Sparse-b.cc, Sparse-d.cc, Sparse.cc,
boolMatrix.cc, boolNDArray.cc, boolSparse.cc, chMatrix.cc, chNDArray.cc,
dColVector.cc, dDiagMatrix.cc, dMatrix.cc, dNDArray.cc, dRowVector.cc,
dSparse.cc, dSparse.h, dim-vector.cc, fCColVector.cc, fCDiagMatrix.cc,
fCMatrix.cc, fCNDArray.cc, fCRowVector.cc, fColVector.cc, fDiagMatrix.cc,
fMatrix.cc, fNDArray.cc, fRowVector.cc, idx-vector.cc, int16NDArray.cc,
int32NDArray.cc, int64NDArray.cc, int8NDArray.cc, intNDArray.cc,
uint16NDArray.cc, uint32NDArray.cc, uint64NDArray.cc, uint8NDArray.cc,
blaswrap.c, cquit.c, f77-extern.cc, f77-fcn.c, f77-fcn.h, lo-error.c, quit.cc,
quit.h, CmplxAEPBAL.cc, CmplxCHOL.cc, CmplxGEPBAL.cc, CmplxHESS.cc, CmplxLU.cc,
CmplxQR.cc, CmplxQRP.cc, CmplxSCHUR.cc, CmplxSVD.cc, CollocWt.cc, DASPK.cc,
DASRT.cc, DASSL.cc, EIG.cc, LSODE.cc, ODES.cc, Quad.cc, base-lu.cc, base-qr.cc,
dbleAEPBAL.cc, dbleCHOL.cc, dbleGEPBAL.cc, dbleHESS.cc, dbleLU.cc, dbleQR.cc,
dbleQRP.cc, dbleSCHUR.cc, dbleSVD.cc, eigs-base.cc, fCmplxAEPBAL.cc,
fCmplxCHOL.cc, fCmplxGEPBAL.cc, fCmplxHESS.cc, fCmplxLU.cc, fCmplxQR.cc,
fCmplxQRP.cc, fCmplxSCHUR.cc, fCmplxSVD.cc, fEIG.cc, floatAEPBAL.cc,
floatCHOL.cc, floatGEPBAL.cc, floatHESS.cc, floatLU.cc, floatQR.cc,
floatQRP.cc, floatSCHUR.cc, floatSVD.cc, lo-mappers.cc, lo-specfun.cc,
oct-convn.cc, oct-fftw.cc, oct-fftw.h, oct-norm.cc, oct-rand.cc,
oct-spparms.cc, randgamma.c, randmtzig.c, randpoisson.c, sparse-chol.cc,
sparse-dmsolve.cc, sparse-lu.cc, sparse-qr.cc, mx-defs.h, dir-ops.cc,
file-ops.cc, file-stat.cc, lo-sysdep.cc, mach-info.cc, oct-env.cc,
oct-group.cc, oct-openmp.h, oct-passwd.cc, oct-syscalls.cc, oct-time.cc,
oct-uname.cc, pathlen.h, sysdir.h, syswait.h, cmd-edit.cc, cmd-hist.cc,
data-conv.cc, f2c-main.c, glob-match.cc, lo-array-errwarn.cc,
lo-array-gripes.cc, lo-cutils.c, lo-cutils.h, lo-ieee.cc, lo-math.h,
lo-regexp.cc, lo-utils.cc, oct-base64.cc, oct-glob.cc, oct-inttypes.cc,
oct-inttypes.h, oct-locbuf.cc, oct-mutex.cc, oct-refcount.h, oct-rl-edit.c,
oct-rl-hist.c, oct-shlib.cc, oct-sort.cc, pathsearch.cc, singleton-cleanup.cc,
sparse-sort.cc, sparse-util.cc, statdefs.h, str-vec.cc, unwind-prot.cc,
url-transfer.cc, display-available.h, main-cli.cc, main-gui.cc, main.in.cc,
mkoctfile.in.cc, octave-config.in.cc, shared-fcns.h:
indent #ifdef blocks in liboctave and src directories.
author | Rik <rik@octave.org> |
---|---|
date | Sat, 06 Feb 2016 06:40:13 -0800 |
parents | 7cac4e7458f2 |
children | 40de9f8f23a6 |
line wrap: on
line source
/* Copyright (C) 2008-2015 Jaroslav Hajek 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 "PermMatrix.h" #include "idx-vector.h" #include "Array-util.h" #include "oct-locbuf.h" OCTAVE_NORETURN static void err_invalid_permutation (void) { (*current_liboctave_error_handler) ("PermMatrix: invalid permutation vector"); } void PermMatrix::setup (const Array<octave_idx_type>& p, bool colp, bool check) { if (check) { if (! idx_vector (p).is_permutation (p.numel ())) err_invalid_permutation (); } if (! colp) *this = this->transpose (); } PermMatrix::PermMatrix (const Array<octave_idx_type>& p) : Array<octave_idx_type> (p) { setup (p, false, true); } PermMatrix::PermMatrix (const Array<octave_idx_type>& p, bool colp, bool check) : Array<octave_idx_type> (p) { setup (p, colp, check); } void PermMatrix::setup (const idx_vector& idx, bool colp, octave_idx_type n) { octave_idx_type len = idx.length (n); if (! idx.is_permutation (len)) err_invalid_permutation (); Array<octave_idx_type> idxa (dim_vector (len, 1)); for (octave_idx_type i = 0; i < len; i++) idxa(i) = idx(i); Array<octave_idx_type>::operator = (idxa); if (! colp) *this = this->transpose (); } PermMatrix::PermMatrix (const idx_vector& idx) : Array<octave_idx_type> () { setup (idx, false, 0); } PermMatrix::PermMatrix (const idx_vector& idx, bool colp, octave_idx_type n) : Array<octave_idx_type> () { setup (idx, colp, n); } PermMatrix::PermMatrix (octave_idx_type n) : Array<octave_idx_type> (dim_vector (n, 1)) { for (octave_idx_type i = 0; i < n; i++) xelem (i) = i; } octave_idx_type PermMatrix::checkelem (octave_idx_type i, octave_idx_type j) const { octave_idx_type len = Array<octave_idx_type>::numel (); if (i < 0 || j < 0 || i > len || j > len) (*current_liboctave_error_handler) ("index out of range"); return elem (i, j); } PermMatrix PermMatrix::transpose (void) const { octave_idx_type len = Array<octave_idx_type>::numel (); PermMatrix retval (len); for (octave_idx_type i = 0; i < len; ++i) retval.xelem (xelem (i)) = i; return retval; } PermMatrix PermMatrix::inverse (void) const { return transpose (); } octave_idx_type PermMatrix::determinant (void) const { // Determine the sign of a permutation in linear time. // Is this widely known? octave_idx_type len = perm_length (); const octave_idx_type *pa = data (); OCTAVE_LOCAL_BUFFER (octave_idx_type, p, len); OCTAVE_LOCAL_BUFFER (octave_idx_type, q, len); for (octave_idx_type i = 0; i < len; i++) { p[i] = pa[i]; q[p[i]] = i; } bool neg = false; for (octave_idx_type i = 0; i < len; i++) { octave_idx_type j = p[i]; octave_idx_type k = q[i]; if (j != i) { p[k] = p[i]; q[j] = q[i]; neg = ! neg; } } return neg ? -1 : 1; } PermMatrix PermMatrix::power(octave_idx_type m) const { if (m < 0) return inverse ().pos_power (-m); else if (m > 0) return pos_power (m); else return PermMatrix (rows ()); } PermMatrix PermMatrix::pos_power (octave_idx_type m) const { octave_idx_type n = rows (); const octave_idx_type *p = data (); Array<octave_idx_type> res_pvec (dim_vector (n, 1), -1); octave_idx_type *q = res_pvec.fortran_vec (); for (octave_idx_type ics = 0; ics < n; ics++) { if (q[ics] > 0) continue; // go forward m steps or until a cycle is found. octave_idx_type ic, j; for (j = 1, ic = p[ics]; j != m && ic != ics; j++, ic = p[ic]) ; if (ic == ics) { // reduce power. octave_idx_type mm = m % j; // go forward mm steps. for (j = 0, ic = ics; j != mm; j++, ic = p[ic]) ; } // now ic = p^m[ics]. Loop through the whole cycle. octave_idx_type jcs = ics; do { q[jcs] = ic; jcs = p[jcs]; ic = p[ic]; } while (jcs != ics); } return PermMatrix (res_pvec, true, false); } PermMatrix PermMatrix::eye (octave_idx_type n) { return PermMatrix (n); } PermMatrix operator *(const PermMatrix& a, const PermMatrix& b) { PermMatrix r; const Array<octave_idx_type> ia = a.col_perm_vec (); const Array<octave_idx_type> ib = b.col_perm_vec (); octave_idx_type n = a.columns (); if (n != b.rows ()) err_nonconformant ("operator *", n, n, b.rows (), b.rows ()); r = PermMatrix (ia.index (idx_vector (ib)), true, false); return r; }