Mercurial > octave-nkf
view liboctave/dim-vector.cc @ 14846:460a3c6d8bf1
maint: Use Octave coding convention for cuddled parenthis in function calls with empty argument lists.
Example: func() => func ()
* dynamic.txi, func.txi, oop.txi, var.txi, embedded.cc, fortdemo.cc,
funcdemo.cc, paramdemo.cc, stringdemo.cc, unwinddemo.cc, Array.cc, Array.h,
CColVector.cc, CDiagMatrix.h, CMatrix.cc, CNDArray.cc, CRowVector.cc,
CSparse.cc, CmplxGEPBAL.cc, EIG.cc, MSparse.cc, MatrixType.cc,
Sparse-op-defs.h, Sparse-perm-op-defs.h, Sparse.cc, Sparse.h,
SparseCmplxCHOL.cc, SparseCmplxCHOL.h, SparseCmplxLU.cc, SparseCmplxQR.cc,
SparseCmplxQR.h, SparseQR.cc, SparseQR.h, SparsedbleCHOL.cc, SparsedbleCHOL.h,
SparsedbleLU.cc, SparsedbleLU.h, base-lu.cc, cmd-hist.cc, dColVector.cc,
dDiagMatrix.h, dMatrix.cc, dNDArray.cc, dRowVector.cc, dSparse.cc, dbleCHOL.cc,
dbleGEPBAL.cc, dim-vector.cc, eigs-base.cc, f2c-main.c, fCColVector.cc,
fCDiagMatrix.h, fCMatrix.cc, fCNDArray.cc, fCRowVector.cc, fCmplxGEPBAL.cc,
fColVector.cc, fDiagMatrix.h, fEIG.cc, fMatrix.cc, fNDArray.cc, fRowVector.cc,
file-ops.cc, file-stat.cc, floatCHOL.cc, floatGEPBAL.cc, idx-vector.h,
lo-specfun.cc, lo-sysdep.cc, mx-inlines.cc, oct-binmap.h, oct-convn.cc,
oct-md5.cc, oct-mem.h, oct-rand.cc, oct-syscalls.cc, randgamma.c, randmtzig.c,
sparse-base-chol.cc, sparse-base-chol.h, sparse-base-lu.cc, sparse-dmsolve.cc,
tempname.c, curl.m, divergence.m, randi.m, dlmwrite.m, edit.m, getappdata.m,
what.m, getarchdir.m, install.m, installed_packages.m, repackage.m,
unload_packages.m, colorbar.m, figure.m, isosurface.m, legend.m, loglog.m,
plot.m, plot3.m, plotyy.m, polar.m, __errplot__.m, __ghostscript__.m,
__marching_cube__.m, __plt__.m, __scatter__.m, semilogx.m, semilogy.m,
trimesh.m, trisurf.m, demo.m, test.m, datetick.m, __delaunayn__.cc,
__dsearchn__.cc, __fltk_uigetfile__.cc, __glpk__.cc, __init_fltk__.cc,
__lin_interpn__.cc, __magick_read__.cc, __pchip_deriv__.cc, balance.cc,
bsxfun.cc, ccolamd.cc, cellfun.cc, chol.cc, daspk.cc, dasrt.cc, dassl.cc,
dmperm.cc, eig.cc, eigs.cc, fftw.cc, filter.cc, find.cc, kron.cc, lookup.cc,
lsode.cc, matrix_type.cc, md5sum.cc, mgorth.cc, qr.cc, quad.cc, rand.cc,
regexp.cc, symbfact.cc, tril.cc, urlwrite.cc, op-bm-bm.cc, op-cdm-cdm.cc,
op-cell.cc, op-chm.cc, op-cm-cm.cc, op-cm-scm.cc, op-cm-sm.cc, op-cs-scm.cc,
op-cs-sm.cc, op-dm-dm.cc, op-dm-scm.cc, op-dm-sm.cc, op-fcdm-fcdm.cc,
op-fcm-fcm.cc, op-fdm-fdm.cc, op-fm-fm.cc, op-int.h, op-m-m.cc, op-m-scm.cc,
op-m-sm.cc, op-pm-pm.cc, op-pm-scm.cc, op-pm-sm.cc, op-range.cc, op-s-scm.cc,
op-s-sm.cc, op-sbm-sbm.cc, op-scm-cm.cc, op-scm-cs.cc, op-scm-m.cc,
op-scm-s.cc, op-scm-scm.cc, op-scm-sm.cc, op-sm-cm.cc, op-sm-cs.cc, op-sm-m.cc,
op-sm-s.cc, op-sm-scm.cc, op-sm-sm.cc, op-str-str.cc, op-struct.cc, bitfcns.cc,
data.cc, debug.cc, dynamic-ld.cc, error.cc, gl-render.cc, graphics.cc,
graphics.in.h, load-path.cc, ls-hdf5.cc, ls-mat5.cc, ls-mat5.h,
ls-oct-ascii.cc, ls-oct-ascii.h, mex.cc, mk-errno-list, oct-map.cc, oct-obj.h,
oct-parse.yy, octave-config.in.cc, ov-base-int.cc, ov-base-mat.cc, ov-base.cc,
ov-bool-mat.cc, ov-bool-sparse.cc, ov-bool.cc, ov-cell.cc, ov-class.cc,
ov-class.h, ov-cx-mat.cc, ov-cx-sparse.cc, ov-fcn-handle.cc, ov-flt-cx-mat.cc,
ov-flt-re-mat.cc, ov-intx.h, ov-range.h, ov-re-mat.cc, ov-re-sparse.cc,
ov-str-mat.cc, ov-struct.cc, ov-usr-fcn.h, ov.h, pr-output.cc, pt-id.cc,
pt-id.h, pt-mat.cc, pt-select.cc, sparse.cc, symtab.cc, symtab.h, syscalls.cc,
toplev.cc, txt-eng-ft.cc, variables.cc, zfstream.cc, zfstream.h, Dork.m,
getStash.m, myStash.m, Gork.m, Pork.m, myStash.m, getStash.m, myStash.m,
getStash.m, myStash.m, fntests.m: Use Octave coding convention for
cuddled parenthis in function calls with empty argument lists.
author | Rik <octave@nomad.inbox5.com> |
---|---|
date | Sun, 08 Jul 2012 11:28:50 -0700 |
parents | edf9ca8a92a8 |
children | 3d8ace26c5b4 |
line wrap: on
line source
/* Copyright (C) 2003-2012 John W. Eaton Copyirght (C) 2009, 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/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <iostream> #include "dim-vector.h" // The maximum allowed value for a dimension extent. This will normally be a tiny bit // off the maximum value of octave_idx_type. // Currently 1 is subtracted to allow safe conversion of any 2D Array into Sparse, // but this offset may change in the future. octave_idx_type dim_vector::dim_max (void) { return std::numeric_limits<octave_idx_type>::max () - 1; } void dim_vector::chop_all_singletons (void) { make_unique (); int j = 0; int l = ndims (); for (int i = 0; i < l; i++) { if (rep[i] != 1) rep[j++] = rep[i]; } if (j == 1) rep[1] = 1; ndims () = j > 2 ? j : 2; } std::string dim_vector::str (char sep) const { std::ostringstream buf; for (int i = 0; i < length (); i++) { buf << elem (i); if (i < length () - 1) buf << sep; } std::string retval = buf.str (); return retval; } int dim_vector::num_ones (void) const { int retval = 0; for (int i = 0; i < length (); i++) if (elem (i) == 1) retval++; return retval; } octave_idx_type dim_vector::safe_numel (void) const { octave_idx_type idx_max = dim_max (); octave_idx_type n = 1; int n_dims = length (); for (int i = 0; i < n_dims; i++) { n *= rep[i]; if (rep[i] != 0) idx_max /= rep[i]; if (idx_max <= 0) throw std::bad_alloc (); } return n; } dim_vector dim_vector::squeeze (void) const { dim_vector new_dims = *this; bool dims_changed = 1; int k = 0; for (int i = 0; i < length (); i++) { if (elem (i) == 1) dims_changed = true; else new_dims(k++) = elem (i); } if (dims_changed) { if (k == 0) new_dims = dim_vector (1, 1); else if (k == 1) { // There is one non-singleton dimension, so we need // to decide the correct orientation. if (elem (0) == 1) { // The original dimension vector had a leading // singleton dimension. octave_idx_type tmp = new_dims(0); new_dims.resize (2); new_dims(0) = 1; new_dims(1) = tmp; } else { // The first element of the original dimension vector // was not a singleton dimension. new_dims.resize (2); new_dims(1) = 1; } } else new_dims.resize(k); } return new_dims; } // This is the rule for cat(). cat(dim, A, B) works if one // of the following holds, in this order: // // 1. size(A, k) == size(B, k) for all k != dim. // In this case, size (C, dim) = size (A, dim) + size (B, dim) and // other sizes remain intact. // // 2. A is 0x0, in which case B is the result // 3. B is 0x0, in which case A is the result bool dim_vector::concat (const dim_vector& dvb, int dim) { int orig_nd = ndims (), ndb = dvb.ndims (); int new_nd = dim < ndb ? ndb : dim + 1; if (new_nd > orig_nd) resize (new_nd, 1); else new_nd = orig_nd; make_unique (); bool match = true; for (int i = 0; i < ndb; i++) { if (i != dim && rep[i] != dvb(i)) { match = false; break; } } for (int i = ndb; i < new_nd; i++) { if (i != dim && rep[i] != 1) { match = false; break; } } if (match) rep[dim] += (dim < ndb ? dvb(dim) : 1); else { // Dimensions don't match. The only allowed fix is // to omit 0x0. if (ndb == 2 && dvb(0) == 0 && dvb(1) == 0) match = true; else if (orig_nd == 2 && rep[0] == 0 && rep[1] == 0) { *this = dvb; match = true; } } chop_trailing_singletons (); return match; } // Rules for horzcat/vertcat are yet looser. // two arrays A, B can be concatenated // horizontally (dim = 2) or vertically (dim = 1) if one of the // following holds, in this order: // // 1. cat(dim, A, B) works // // 2. A, B are 2D and one of them is an empty vector, in which // case the result is the other one except if both of them // are empty vectors, in which case the result is 0x0. bool dim_vector::hvcat (const dim_vector& dvb, int dim) { if (concat (dvb, dim)) return true; else if (length () == 2 && dvb.length () == 2) { bool e2dv = rep[0] + rep[1] == 1; bool e2dvb = dvb(0) + dvb(1) == 1; if (e2dvb) { if (e2dv) *this = dim_vector (); return true; } else if (e2dv) { *this = dvb; return true; } } return false; } dim_vector dim_vector::redim (int n) const { int n_dims = length (); if (n_dims == n) return *this; else if (n_dims < n) { dim_vector retval = alloc (n); for (int i = 0; i < n_dims; i++) retval.rep[i] = rep[i]; for (int i = n_dims; i < n; i++) retval.rep[i] = 1; return retval; } else { if (n < 1) n = 1; dim_vector retval = alloc (n); retval.rep[1] = 1; for (int i = 0; i < n-1; i++) retval.rep[i] = rep[i]; int k = rep[n-1]; for (int i = n; i < n_dims; i++) k *= rep[i]; retval.rep[n-1] = k; return retval; } }