Mercurial > jwe > octave
view libinterp/octave-value/ov-base-mat.cc @ 21100:e39e05d90788
Switch gripe_XXX to either err_XXX or warn_XXX naming scheme.
* libinterp/corefcn/errwarn.h, libinterp/corefcn/errwarn.cc: New header and .cc
file with common errors and warnings for libinterp.
* libinterp/corefcn/module.mk: Add errwarn.h, errwarn.cc to build system.
* liboctave/util/lo-array-errwarn.h, liboctave/util/lo-array-errwarn.cc: New
header and .cc file with common errors and warnings for liboctave.
* liboctave/util/module.mk: Add lo-array-errwarn.h, lo-array-errwarn.cc to
build system.
* lo-array-gripes.h: #include "lo-array-errwarn.h" for access to class
index_exception. Remove const char *error_id_XXX prototypes.
* lo-array-gripes.cc: Remove const char *error_id_XXX initializations.
Remove index_exception method definitions.
* Cell.cc, __pchip_deriv__.cc, __qp__.cc, balance.cc, betainc.cc, cellfun.cc,
daspk.cc, dasrt.cc, dassl.cc, data.cc, debug.cc, defaults.cc, det.cc,
dirfns.cc, eig.cc, fft.cc, fft2.cc, fftn.cc, find.cc, gammainc.cc, gcd.cc,
getgrent.cc, getpwent.cc, graphics.in.h, help.cc, hess.cc, hex2num.cc,
input.cc, inv.cc, jit-typeinfo.cc, load-save.cc, lookup.cc, ls-hdf5.cc,
ls-mat-ascii.cc, ls-mat4.cc, ls-mat5.cc, ls-oct-binary.cc, ls-oct-text.cc,
lsode.cc, lu.cc, luinc.cc, max.cc, mgorth.cc, oct-hist.cc, oct-procbuf.cc,
oct-stream.cc, oct.h, pager.cc, pinv.cc, pr-output.cc, quad.cc, qz.cc, rand.cc,
rcond.cc, regexp.cc, schur.cc, sparse-xdiv.cc, sparse-xpow.cc, sparse.cc,
spparms.cc, sqrtm.cc, str2double.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc,
sylvester.cc, syscalls.cc, typecast.cc, utils.cc, variables.cc, xdiv.cc,
xnorm.cc, xpow.cc, __eigs__.cc, __glpk__.cc, __magick_read__.cc,
__osmesa_print__.cc, audiodevinfo.cc, audioread.cc, chol.cc, dmperm.cc,
fftw.cc, qr.cc, symbfact.cc, symrcm.cc, ov-base-diag.cc, ov-base-int.cc,
ov-base-mat.cc, ov-base-scalar.cc, ov-base-sparse.cc, ov-base.cc,
ov-bool-mat.cc, ov-bool-sparse.cc, ov-bool.cc, ov-builtin.cc, ov-cell.cc,
ov-ch-mat.cc, ov-class.cc, ov-complex.cc, ov-complex.h, ov-cs-list.cc,
ov-cx-diag.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-fcn-handle.cc,
ov-fcn-inline.cc, ov-float.cc, ov-float.h, ov-flt-complex.cc, ov-flt-complex.h,
ov-flt-cx-diag.cc, ov-flt-cx-mat.cc, ov-flt-re-mat.cc, ov-int16.cc,
ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-intx.h, ov-mex-fcn.cc, ov-perm.cc,
ov-range.cc, ov-re-mat.cc, ov-re-sparse.cc, ov-scalar.cc, ov-scalar.h,
ov-str-mat.cc, ov-struct.cc, ov-type-conv.h, ov-uint16.cc, ov-uint32.cc,
ov-uint64.cc, ov-uint8.cc, ov-usr-fcn.cc, ov.cc, op-b-b.cc, op-b-bm.cc,
op-b-sbm.cc, op-bm-b.cc, op-bm-bm.cc, op-bm-sbm.cc, op-cdm-cdm.cc, op-cell.cc,
op-chm.cc, op-class.cc, op-cm-cm.cc, op-cm-cs.cc, op-cm-m.cc, op-cm-s.cc,
op-cm-scm.cc, op-cm-sm.cc, op-cs-cm.cc, op-cs-cs.cc, op-cs-m.cc, op-cs-s.cc,
op-cs-scm.cc, op-cs-sm.cc, op-dm-dm.cc, op-dm-scm.cc, op-dm-sm.cc,
op-dms-template.cc, op-double-conv.cc, op-fcdm-fcdm.cc, op-fcdm-fdm.cc,
op-fcm-fcm.cc, op-fcm-fcs.cc, op-fcm-fm.cc, op-fcm-fs.cc, op-fcn.cc,
op-fcs-fcm.cc, op-fcs-fcs.cc, op-fcs-fm.cc, op-fcs-fs.cc, op-fdm-fdm.cc,
op-float-conv.cc, op-fm-fcm.cc, op-fm-fcs.cc, op-fm-fm.cc, op-fm-fs.cc,
op-fs-fcm.cc, op-fs-fcs.cc, op-fs-fm.cc, op-fs-fs.cc, op-i16-i16.cc,
op-i32-i32.cc, op-i64-i64.cc, op-i8-i8.cc, op-int-concat.cc, op-int-conv.cc,
op-int.h, op-m-cm.cc, op-m-cs.cc, op-m-m.cc, op-m-s.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-cm.cc,
op-s-cs.cc, op-s-m.cc, op-s-s.cc, op-s-scm.cc, op-s-sm.cc, op-sbm-b.cc,
op-sbm-bm.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-m.cc, op-str-s.cc, op-str-str.cc,
op-struct.cc, op-ui16-ui16.cc, op-ui32-ui32.cc, op-ui64-ui64.cc, op-ui8-ui8.cc,
ops.h, lex.ll, pt-assign.cc, pt-eval.cc, pt-idx.cc, pt-loop.cc, pt-mat.cc,
pt-stmt.cc, Array-util.cc, Array-util.h, Array.cc, CColVector.cc,
CDiagMatrix.cc, CMatrix.cc, CNDArray.cc, CRowVector.cc, CSparse.cc,
DiagArray2.cc, MDiagArray2.cc, MSparse.cc, PermMatrix.cc, Range.cc, Sparse.cc,
dColVector.cc, dDiagMatrix.cc, dMatrix.cc, dNDArray.cc, dRowVector.cc,
dSparse.cc, fCColVector.cc, fCDiagMatrix.cc, fCMatrix.cc, fCNDArray.cc,
fCRowVector.cc, fColVector.cc, fDiagMatrix.cc, fMatrix.cc, fNDArray.cc,
fRowVector.cc, idx-vector.cc, CmplxGEPBAL.cc, dbleGEPBAL.cc, fCmplxGEPBAL.cc,
floatGEPBAL.cc, Sparse-diag-op-defs.h, Sparse-op-defs.h, Sparse-perm-op-defs.h,
mx-inlines.cc, mx-op-defs.h, oct-binmap.h:
Replace 'include "gripes.h"' with 'include "errwarn.h". Change all gripe_XXX
to err_XXX or warn_XXX or errwarn_XXX.
author | Rik <rik@octave.org> |
---|---|
date | Mon, 18 Jan 2016 18:28:06 -0800 |
parents | a5b500efca9f |
children | 3ac9f47fb04b |
line wrap: on
line source
/* Copyright (C) 1996-2015 John W. Eaton Copyright (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 "Array-util.h" #include "Cell.h" #include "ovl.h" #include "oct-map.h" #include "ov-base.h" #include "ov-base-mat.h" #include "ov-base-scalar.h" #include "pr-output.h" template <class MT> octave_value octave_base_matrix<MT>::subsref (const std::string& type, const std::list<octave_value_list>& idx) { octave_value retval; switch (type[0]) { case '(': retval = do_index_op (idx.front ()); break; case '{': case '.': { std::string nm = type_name (); error ("%s cannot be indexed with %c", nm.c_str (), type[0]); } break; default: panic_impossible (); } return retval.next_subsref (type, idx); } template <class MT> octave_value octave_base_matrix<MT>::subsasgn (const std::string& type, const std::list<octave_value_list>& idx, const octave_value& rhs) { octave_value retval; switch (type[0]) { case '(': { if (type.length () == 1) retval = numeric_assign (type, idx, rhs); else if (is_empty ()) { // Allow conversion of empty matrix to some other type in // cases like // // x = []; x(i).f = rhs if (type[1] != '.') error ("invalid assignment expression"); octave_value tmp = octave_value::empty_conv (type, rhs); retval = tmp.subsasgn (type, idx, rhs); } else { std::string nm = type_name (); error ("in indexed assignment of %s, last lhs index must be ()", nm.c_str ()); } } break; case '{': case '.': { if (! is_empty ()) { std::string nm = type_name (); error ("%s cannot be indexed with %c", nm.c_str (), type[0]); } octave_value tmp = octave_value::empty_conv (type, rhs); retval = tmp.subsasgn (type, idx, rhs); } break; default: panic_impossible (); } return retval; } template <class MT> octave_value octave_base_matrix<MT>::do_index_op (const octave_value_list& idx, bool resize_ok) { octave_value retval; octave_idx_type n_idx = idx.length (); int nd = matrix.ndims (); const MT& cmatrix = matrix; // If we catch an indexing error in index_vector, we flag an error in // index k. Ensure it is the right value befor each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; try { switch (n_idx) { case 0: retval = matrix; break; case 1: { idx_vector i = idx (0).index_vector (); // optimize single scalar index. if (! resize_ok && i.is_scalar ()) retval = cmatrix.checkelem (i(0)); else retval = MT (matrix.index (i, resize_ok)); } break; case 2: { idx_vector i = idx (0).index_vector (); k=1; idx_vector j = idx (1).index_vector (); // optimize two scalar indices. if (! resize_ok && i.is_scalar () && j.is_scalar ()) retval = cmatrix.checkelem (i(0), j(0)); else retval = MT (matrix.index (i, j, resize_ok)); } break; default: { Array<idx_vector> idx_vec (dim_vector (n_idx, 1)); bool scalar_opt = n_idx == nd && ! resize_ok; const dim_vector dv = matrix.dims (); for (k = 0; k < n_idx; k++) { idx_vec(k) = idx(k).index_vector (); scalar_opt = (scalar_opt && idx_vec(k).is_scalar ()); } if (scalar_opt) retval = cmatrix.checkelem (conv_to_int_array (idx_vec)); else retval = MT (matrix.index (idx_vec, resize_ok)); } break; } } catch (index_exception& e) { // Rethrow to allow more info to be reported later. e.set_pos_if_unset (n_idx, k+1); throw; } return retval; } template <class MT> void octave_base_matrix<MT>::assign (const octave_value_list& idx, const MT& rhs) { octave_idx_type n_idx = idx.length (); // If we catch an indexing error in index_vector, we flag an error in // index k. Ensure it is the right value befor each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; try { switch (n_idx) { case 0: panic_impossible (); break; case 1: { idx_vector i = idx (0).index_vector (); matrix.assign (i, rhs); } break; case 2: { idx_vector i = idx (0).index_vector (); k = 1; idx_vector j = idx (1).index_vector (); matrix.assign (i, j, rhs); } break; default: { Array<idx_vector> idx_vec (dim_vector (n_idx, 1)); for (k = 0; k < n_idx; k++) idx_vec(k) = idx(k).index_vector (); matrix.assign (idx_vec, rhs); } break; } } catch (const index_exception& e) { err_invalid_index (e.idx (), n_idx, k+1); } // Clear cache. clear_cached_info (); } template <class MT> MatrixType octave_base_matrix<MT>::matrix_type (const MatrixType& _typ) const { delete typ; typ = new MatrixType (_typ); return *typ; } template <class MT> void octave_base_matrix<MT>::assign (const octave_value_list& idx, typename MT::element_type rhs) { octave_idx_type n_idx = idx.length (); int nd = matrix.ndims (); MT mrhs (dim_vector (1, 1), rhs); // If we catch an indexing error in index_vector, we flag an error in // index k. Ensure it is the right value befor each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; try { switch (n_idx) { case 0: panic_impossible (); break; case 1: { idx_vector i = idx (0).index_vector (); // optimize single scalar index. if (i.is_scalar () && i(0) < matrix.numel ()) matrix(i(0)) = rhs; else matrix.assign (i, mrhs); } break; case 2: { idx_vector i = idx (0).index_vector (); k = 1; idx_vector j = idx (1).index_vector (); // optimize two scalar indices. if (i.is_scalar () && j.is_scalar () && nd == 2 && i(0) < matrix.rows () && j(0) < matrix.columns ()) matrix(i(0), j(0)) = rhs; else matrix.assign (i, j, mrhs); } break; default: { Array<idx_vector> idx_vec (dim_vector (n_idx, 1)); bool scalar_opt = n_idx == nd; const dim_vector dv = matrix.dims ().redim (n_idx); for (k = 0; k < n_idx; k++) { idx_vec(k) = idx(k).index_vector (); scalar_opt = (scalar_opt && idx_vec(k).is_scalar () && idx_vec(k)(0) < dv(k)); } if (scalar_opt) { // optimize all scalar indices. Don't construct // an index array, but rather calc a scalar index directly. octave_idx_type n = 1; octave_idx_type j = 0; for (octave_idx_type i = 0; i < n_idx; i++) { j += idx_vec(i)(0) * n; n *= dv (i); } matrix(j) = rhs; } else matrix.assign (idx_vec, mrhs); } break; } } catch (const index_exception& e) { err_invalid_index (e.idx (), n_idx, k+1); } // Clear cache. clear_cached_info (); } template <class MT> void octave_base_matrix<MT>::delete_elements (const octave_value_list& idx) { octave_idx_type len = idx.length (); Array<idx_vector> ra_idx (dim_vector (len, 1)); for (octave_idx_type i = 0; i < len; i++) ra_idx(i) = idx(i).index_vector (); matrix.delete_elements (ra_idx); // Clear cache. clear_cached_info (); } template <class MT> octave_value octave_base_matrix<MT>::resize (const dim_vector& dv, bool fill) const { MT retval (matrix); if (fill) retval.resize (dv, 0); else retval.resize (dv); return retval; } template <class MT> bool octave_base_matrix<MT>::is_true (void) const { bool retval = false; dim_vector dv = matrix.dims (); int nel = dv.numel (); if (nel > 0) { MT t1 (matrix.reshape (dim_vector (nel, 1))); if (t1.any_element_is_nan ()) err_nan_to_logical_conversion (); else { boolNDArray t2 = t1.all (); retval = t2(0); } } return retval; } template <class MT> bool octave_base_matrix<MT>::print_as_scalar (void) const { dim_vector dv = dims (); return (dv.all_ones () || dv.any_zero ()); } template <class MT> void octave_base_matrix<MT>::print (std::ostream& os, bool pr_as_read_syntax) { print_raw (os, pr_as_read_syntax); newline (os); } template <class MT> void octave_base_matrix<MT>::print_info (std::ostream& os, const std::string& prefix) const { matrix.print_info (os, prefix); } template <class MT> void octave_base_matrix<MT>::short_disp (std::ostream& os) const { if (matrix.is_empty ()) os << "[]"; else if (matrix.ndims () == 2) { // FIXME: should this be configurable? octave_idx_type max_elts = 10; octave_idx_type elts = 0; octave_idx_type nel = matrix.numel (); octave_idx_type nr = matrix.rows (); octave_idx_type nc = matrix.columns (); os << "["; for (octave_idx_type i = 0; i < nr; i++) { for (octave_idx_type j = 0; j < nc; j++) { std::ostringstream buf; octave_print_internal (buf, matrix(j*nr+i)); std::string tmp = buf.str (); size_t pos = tmp.find_first_not_of (" "); if (pos != std::string::npos) os << tmp.substr (pos); else if (! tmp.empty ()) os << tmp[0]; if (++elts >= max_elts) goto done; if (j < nc - 1) os << ", "; } if (i < nr - 1 && elts < max_elts) os << "; "; } done: if (nel <= max_elts) os << "]"; } else os << "..."; } template <class MT> octave_value octave_base_matrix<MT>::fast_elem_extract (octave_idx_type n) const { if (n < matrix.numel ()) return matrix(n); else return octave_value (); } template <class MT> bool octave_base_matrix<MT>::fast_elem_insert (octave_idx_type n, const octave_value& x) { if (n < matrix.numel ()) { // Don't use builtin_type () here to avoid an extra VM call. typedef typename MT::element_type ET; const builtin_type_t btyp = class_to_btyp<ET>::btyp; if (btyp == btyp_unknown) // Dead branch? return false; // Set up the pointer to the proper place. void *here = reinterpret_cast<void *> (&matrix(n)); // Ask x to store there if it can. return x.get_rep ().fast_elem_insert_self (here, btyp); } else return false; }