Mercurial > octave-libtiff
view liboctave/array/Array-util.cc @ 21301:40de9f8f23a6
Use '#include "config.h"' rather than <config.h>.
* mk-octave-config-h.sh, mk-opts.pl, Backend.cc, BaseControl.cc,
ButtonControl.cc, Canvas.cc, CheckBoxControl.cc, Container.cc, ContextMenu.cc,
EditControl.cc, Figure.cc, FigureWindow.cc, GLCanvas.cc, KeyMap.cc,
ListBoxControl.cc, Logger.cc, Menu.cc, MouseModeActionGroup.cc, Object.cc,
ObjectFactory.cc, ObjectProxy.cc, Panel.cc, PopupMenuControl.cc,
PushButtonControl.cc, PushTool.cc, QtHandlesUtils.cc, RadioButtonControl.cc,
SliderControl.cc, TextControl.cc, TextEdit.cc, ToggleButtonControl.cc,
ToggleTool.cc, ToolBar.cc, ToolBarButton.cc, __init_qt__.cc,
annotation-dialog.cc, gl-select.cc, module.mk, kpty.cpp, color-picker.cc,
dialog.cc, documentation-dock-widget.cc, files-dock-widget.cc,
find-files-dialog.cc, find-files-model.cc, history-dock-widget.cc,
file-editor-tab.cc, file-editor-tab.h, file-editor.cc, find-dialog.cc,
marker.cc, octave-qscintilla.cc, octave-txt-lexer.cc, main-window.cc,
octave-cmd.cc, octave-dock-widget.cc, octave-gui.cc, octave-interpreter.cc,
octave-qt-link.cc, parser.cc, webinfo.cc, resource-manager.cc,
settings-dialog.cc, shortcut-manager.cc, terminal-dock-widget.cc,
thread-manager.cc, welcome-wizard.cc, workspace-model.cc, workspace-view.cc,
build-env-features.sh, build-env.in.cc, Cell.cc, __contourc__.cc,
__dispatch__.cc, __dsearchn__.cc, __ichol__.cc, __ilu__.cc, __lin_interpn__.cc,
__pchip_deriv__.cc, __qp__.cc, balance.cc, besselj.cc, betainc.cc, bitfcns.cc,
bsxfun.cc, c-file-ptr-stream.cc, cdisplay.c, cellfun.cc, coct-hdf5-types.c,
colloc.cc, comment-list.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc,
debug.cc, defaults.cc, defun.cc, det.cc, dirfns.cc, display.cc, dlmread.cc,
dot.cc, dynamic-ld.cc, eig.cc, ellipj.cc, error.cc, errwarn.cc, event-queue.cc,
fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc, find.cc, ft-text-renderer.cc,
gammainc.cc, gcd.cc, getgrent.cc, getpwent.cc, getrusage.cc, givens.cc,
gl-render.cc, gl2ps-print.cc, graphics.cc, gripes.cc, hash.cc, help.cc,
hess.cc, hex2num.cc, hook-fcn.cc, input.cc, inv.cc, jit-ir.cc, jit-typeinfo.cc,
jit-util.cc, kron.cc, load-path.cc, load-save.cc, lookup.cc,
ls-ascii-helper.cc, ls-hdf5.cc, ls-mat-ascii.cc, ls-mat4.cc, ls-mat5.cc,
ls-oct-binary.cc, ls-oct-text.cc, ls-utils.cc, lsode.cc, lu.cc, luinc.cc,
mappers.cc, matrix_type.cc, max.cc, mex.cc, mgorth.cc, nproc.cc,
oct-errno.in.cc, oct-fstrm.cc, oct-hdf5-types.cc, oct-hist.cc, oct-iostrm.cc,
oct-lvalue.cc, oct-map.cc, oct-prcstrm.cc, oct-procbuf.cc, oct-stream.cc,
oct-strstrm.cc, oct-tex-lexer.in.ll, oct-tex-parser.in.yy, octave-link.cc,
ordschur.cc, pager.cc, pinv.cc, pr-output.cc, procstream.cc, profiler.cc,
psi.cc, pt-jit.cc, quad.cc, quadcc.cc, qz.cc, rand.cc, rcond.cc, regexp.cc,
schur.cc, sighandlers.cc, siglist.c, sparse-xdiv.cc, sparse-xpow.cc, sparse.cc,
spparms.cc, sqrtm.cc, str2double.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc,
sylvester.cc, symtab.cc, syscalls.cc, sysdep.cc, text-renderer.cc, time.cc,
toplev.cc, tril.cc, tsearch.cc, txt-eng.cc, typecast.cc, urlwrite.cc, utils.cc,
variables.cc, xdiv.cc, xgl2ps.c, xnorm.cc, xpow.cc, zfstream.cc,
__delaunayn__.cc, __eigs__.cc, __fltk_uigetfile__.cc, __glpk__.cc,
__init_fltk__.cc, __init_gnuplot__.cc, __magick_read__.cc, __osmesa_print__.cc,
__voronoi__.cc, amd.cc, audiodevinfo.cc, audioread.cc, ccolamd.cc, chol.cc,
colamd.cc, convhulln.cc, dmperm.cc, fftw.cc, qr.cc, symbfact.cc, symrcm.cc,
mkbuiltins, mkops, 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-classdef.cc, ov-colon.cc, ov-complex.cc, ov-cs-list.cc,
ov-cx-diag.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-dld-fcn.cc, ov-fcn-handle.cc,
ov-fcn-inline.cc, ov-fcn.cc, ov-float.cc, ov-flt-complex.cc, ov-flt-cx-diag.cc,
ov-flt-cx-mat.cc, ov-flt-re-diag.cc, ov-flt-re-mat.cc, ov-int16.cc,
ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-java.cc, ov-lazy-idx.cc,
ov-mex-fcn.cc, ov-null-mat.cc, ov-oncleanup.cc, ov-perm.cc, ov-range.cc,
ov-re-diag.cc, ov-re-mat.cc, ov-re-sparse.cc, ov-scalar.cc, ov-str-mat.cc,
ov-struct.cc, ov-typeinfo.cc, ov-uint16.cc, ov-uint32.cc, ov-uint64.cc,
ov-uint8.cc, ov-usr-fcn.cc, ov.cc, ovl.cc, octave.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-dm-template.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-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-pm-template.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, lex.ll, oct-parse.in.yy,
pt-arg-list.cc, pt-array-list.cc, pt-assign.cc, pt-binop.cc, pt-bp.cc,
pt-cbinop.cc, pt-cell.cc, pt-check.cc, pt-classdef.cc, pt-cmd.cc, pt-colon.cc,
pt-const.cc, pt-decl.cc, pt-eval.cc, pt-except.cc, pt-exp.cc, pt-fcn-handle.cc,
pt-funcall.cc, pt-id.cc, pt-idx.cc, pt-jump.cc, pt-loop.cc, pt-mat.cc,
pt-misc.cc, pt-pr-code.cc, pt-select.cc, pt-stmt.cc, pt-unop.cc, pt.cc,
token.cc, Array-jit.cc, Array-os.cc, Array-sym.cc, Array-tc.cc, version.cc,
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, 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, 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,
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, lo-error.c, quit.cc, CollocWt.cc, DASPK.cc, DASRT.cc,
DASSL.cc, EIG.cc, LSODE.cc, ODES.cc, Quad.cc, aepbalance.cc, chol.cc,
eigs-base.cc, fEIG.cc, gepbalance.cc, hess.cc, lo-mappers.cc, lo-specfun.cc,
lu.cc, oct-convn.cc, oct-fftw.cc, oct-norm.cc, oct-rand.cc, oct-spparms.cc,
qr.cc, qrp.cc, randgamma.c, randmtzig.c, randpoisson.c, schur.cc,
sparse-chol.cc, sparse-dmsolve.cc, sparse-lu.cc, sparse-qr.cc, svd.cc,
mk-ops.awk, dir-ops.cc, file-ops.cc, file-stat.cc, lo-sysdep.cc, mach-info.cc,
oct-env.cc, oct-group.cc, oct-passwd.cc, oct-syscalls.cc, oct-time.cc,
oct-uname.cc, cmd-edit.cc, cmd-hist.cc, data-conv.cc, f2c-main.c,
glob-match.cc, kpse.cc, lo-array-errwarn.cc, lo-array-gripes.cc, lo-cutils.c,
lo-ieee.cc, lo-regexp.cc, lo-utils.cc, oct-base64.cc, oct-glob.cc,
oct-inttypes.cc, oct-locbuf.cc, oct-mutex.cc, 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, str-vec.cc, unwind-prot.cc, url-transfer.cc,
display-available.c, main-cli.cc, main-gui.cc, main.in.cc, mkoctfile.in.cc,
octave-config.in.cc:
Use '#include "config.h"' rather than <config.h>.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 18 Feb 2016 13:34:50 -0800 |
parents | f7121e111991 |
children | bbf3814049e2 |
line wrap: on
line source
/* Copyright (C) 2003-2015 John W. Eaton Copyright (C) 2009 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 "Array-util.h" #include "dim-vector.h" #include "lo-error.h" #include "oct-locbuf.h" bool index_in_bounds (const Array<octave_idx_type>& ra_idx, const dim_vector& dimensions) { bool retval = true; int n = ra_idx.numel (); if (n == dimensions.length ()) { for (int i = 0; i < n; i++) { if (ra_idx(i) < 0 || ra_idx(i) >= dimensions(i)) { retval = false; break; } } } else retval = false; return retval; } void increment_index (Array<octave_idx_type>& ra_idx, const dim_vector& dimensions, int start_dimension) { ra_idx(start_dimension)++; int n = ra_idx.numel () - 1; int nda = dimensions.length (); for (int i = start_dimension; i < n; i++) { if (ra_idx(i) < (i < nda ? dimensions(i) : 1)) break; else { ra_idx(i) = 0; ra_idx(i+1)++; } } } octave_idx_type get_scalar_idx (Array<octave_idx_type>& idx, dim_vector& dims) { octave_idx_type retval (-1); int n = idx.numel (); if (n > 0) { retval = idx(--n); while (--n >= 0) { retval *= dims(n); retval += idx(n); } } return retval; } octave_idx_type num_ones (const Array<octave_idx_type>& ra_idx) { octave_idx_type retval = 0; for (octave_idx_type i = 0; i < ra_idx.numel (); i++) { if (ra_idx(i) == 1) retval++; } return retval; } bool is_scalar (const dim_vector& dim) { bool retval = true; int n = dim.length (); if (n == 0) { retval = false; } else { for (int i = 0; i < n; i++) { if (dim(i) != 1) { retval = false; break; } } } return retval; } bool is_vector (const dim_vector& dim) { int m = 0; int n = dim.length (); if (n == 0) m = 2; else { for (int i = 0; i < n; i++) if (dim(i) > 1) m++; else if (dim(i) < 1) m += 2; } return (m < 2); } bool any_ones (const Array<octave_idx_type>& arr) { bool retval = false; for (octave_idx_type i = 0; i < arr.numel (); i++) { if (arr (i) == 1) { retval = true; break; } } return retval; } octave_idx_type compute_index (octave_idx_type n, const dim_vector& dims) { if (n < 0) err_invalid_index (n, 1, 1); if (n >= dims.numel ()) err_index_out_of_range (1, 1, n+1, dims.numel (), dims); return n; } octave_idx_type compute_index (octave_idx_type i, octave_idx_type j, const dim_vector& dims) { if (i < 0) err_invalid_index (i, 2, 1); if (j < 0) err_invalid_index (j, 2, 2); if (i >= dims(0)) err_index_out_of_range (2, 1, i+1, dims(0), dims); if (j >= dims.numel (1)) err_index_out_of_range (2, 2, j+1, dims.numel (1), dims); return j*dims(0) + i; } octave_idx_type compute_index (octave_idx_type i, octave_idx_type j, octave_idx_type k, const dim_vector& dims) { if (i < 0) err_invalid_index (i, 3, 1); if (j < 0) err_invalid_index (j, 3, 2); if (k < 0) err_invalid_index (k, 3, 3); if (i >= dims(0)) err_index_out_of_range (3, 1, i+1, dims(0), dims); if (j >= dims(1)) err_index_out_of_range (3, 2, j+1, dims(1), dims); if (k >= dims.numel (2)) err_index_out_of_range (3, 3, k+1, dims.numel (2), dims); return (k*dims(1) + j)*dims(0) + i; } octave_idx_type compute_index (const Array<octave_idx_type>& ra_idx, const dim_vector& dims) { int nd = ra_idx.numel (); const dim_vector dv = dims.redim (nd); for (int d = 0; d < nd; d++) { if (ra_idx(d) < 0) err_invalid_index (ra_idx(d), nd, d+1); if (ra_idx(d) >= dv(d)) err_index_out_of_range (nd, d+1, ra_idx(d)+1, dv(d), dims); } return dv.compute_index (ra_idx.data ()); } Array<octave_idx_type> conv_to_int_array (const Array<idx_vector>& a) { Array<octave_idx_type> retval (a.dims ()); for (octave_idx_type i = 0; i < a.numel (); i++) retval(i) = a(i).elem (0); return retval; } Array<idx_vector> conv_to_array (const idx_vector *tmp, const octave_idx_type len) { Array<idx_vector> retval (dim_vector (len, 1)); for (octave_idx_type i = 0; i < len; i++) retval(i) = tmp[i]; return retval; } dim_vector freeze (Array<idx_vector>& ra_idx, const dim_vector& dimensions, int resize_ok) { dim_vector retval; int n = ra_idx.numel (); assert (n == dimensions.length ()); retval.resize (n); static const char *tag[3] = { "row", "column", 0 }; for (int i = 0; i < n; i++) retval(i) = ra_idx(i).freeze (dimensions(i), tag[i < 2 ? i : 3], resize_ok); return retval; } bool vector_equivalent (const dim_vector& dv) { int n = dv.length (); bool found_first = false; for (int i = 0; i < n; i++) { if (dv(i) != 1) { if (! found_first) found_first = true; else return false; } } return true; } bool all_ok (const Array<idx_vector>& ra_idx) { bool retval = true; octave_idx_type n = ra_idx.numel (); for (octave_idx_type i = 0; i < n; i++) { if (! ra_idx(i)) { retval = false; break; } } return retval; } bool any_orig_empty (const Array<idx_vector>& ra_idx) { bool retval = false; octave_idx_type n = ra_idx.numel (); for (octave_idx_type i = 0; i < n; i++) { if (ra_idx(i).orig_empty ()) { retval = true; break; } } return retval; } bool all_colon_equiv (const Array<idx_vector>& ra_idx, const dim_vector& frozen_lengths) { bool retval = true; octave_idx_type idx_n = ra_idx.numel (); int n = frozen_lengths.length (); assert (idx_n == n); for (octave_idx_type i = 0; i < n; i++) { if (! ra_idx(i).is_colon_equiv (frozen_lengths(i))) { retval = false; break; } } return retval; } bool all_ones (const Array<octave_idx_type>& arr) { bool retval = true; for (octave_idx_type i = 0; i < arr.numel (); i++) { if (arr(i) != 1) { retval = false; break; } } return retval; } Array<octave_idx_type> get_elt_idx (const Array<idx_vector>& ra_idx, const Array<octave_idx_type>& result_idx) { octave_idx_type n = ra_idx.numel (); Array<octave_idx_type> retval (dim_vector (n, 1)); for (octave_idx_type i = 0; i < n; i++) retval(i) = ra_idx(i).elem (result_idx(i)); return retval; } Array<octave_idx_type> get_ra_idx (octave_idx_type idx, const dim_vector& dims) { Array<octave_idx_type> retval; int n_dims = dims.length (); retval.resize (dim_vector (n_dims, 1)); for (int i = 0; i < n_dims; i++) retval(i) = 0; assert (idx > 0 || idx < dims.numel ()); for (octave_idx_type i = 0; i < idx; i++) increment_index (retval, dims); // FIXME: the solution using increment_index is not efficient. #if 0 octave_idx_type var = 1; for (int i = 0; i < n_dims; i++) { std::cout << "idx: " << idx << ", var: " << var << ", dims(" << i << "): " << dims(i) <<"\n"; retval(i) = ((int)floor(((idx) / (double)var))) % dims(i); idx -= var * retval(i); var = dims(i); } #endif return retval; } dim_vector zero_dims_inquire (const Array<idx_vector>& ia, const dim_vector& rhdv) { int ial = ia.numel (); int rhdvl = rhdv.length (); dim_vector rdv = dim_vector::alloc (ial); bool *scalar = new bool [ial]; bool *colon = new bool [ial]; // Mark scalars and colons, count non-scalar indices. int nonsc = 0; bool all_colons = true; for (int i = 0; i < ial; i++) { // FIXME: should we check for length() instead? scalar[i] = ia(i).is_scalar (); colon[i] = ia(i).is_colon (); if (! scalar[i]) nonsc++; if (! colon[i]) rdv(i) = ia(i).extent (0); all_colons = all_colons && colon[i]; } // If the number of nonscalar indices matches the dimensionality of // RHS, we try an exact match, inquiring even singleton dimensions. if (all_colons) { rdv = rhdv; rdv.resize (ial, 1); } else if (nonsc == rhdvl) { for (int i = 0, j = 0; i < ial; i++) { if (scalar[i]) continue; if (colon[i]) rdv(i) = rhdv(j); j++; } } else { dim_vector rhdv0 = rhdv; rhdv0.chop_all_singletons (); int rhdv0l = rhdv0.length (); for (int i = 0, j = 0; i < ial; i++) { if (scalar[i]) continue; if (colon[i]) rdv(i) = (j < rhdv0l) ? rhdv0(j++) : 1; } } delete [] scalar; delete [] colon; return rdv; } dim_vector zero_dims_inquire (const idx_vector& i, const idx_vector& j, const dim_vector& rhdv) { bool icol = i.is_colon (); bool jcol = j.is_colon (); dim_vector rdv; if (icol && jcol && rhdv.length () == 2) { rdv(0) = rhdv(0); rdv(1) = rhdv(1); } else if (rhdv.length () == 2 && ! i.is_scalar () && ! j.is_scalar ()) { rdv(0) = icol ? rhdv(0) : i.extent (0); rdv(1) = jcol ? rhdv(1) : j.extent (0); } else { dim_vector rhdv0 = rhdv; rhdv0.chop_all_singletons (); int k = 0; rdv(0) = i.extent (0); if (icol) rdv(0) = rhdv0(k++); else if (! i.is_scalar ()) k++; rdv(1) = j.extent (0); if (jcol) rdv(1) = rhdv0(k++); else if (! j.is_scalar ()) k++; } return rdv; } // A helper class. struct sub2ind_helper { octave_idx_type *ind, n; sub2ind_helper (octave_idx_type *_ind, octave_idx_type _n) : ind(_ind), n(_n) { } void operator ()(octave_idx_type k) { (*ind++ *= n) += k; } }; idx_vector sub2ind (const dim_vector& dv, const Array<idx_vector>& idxa) { idx_vector retval; octave_idx_type len = idxa.numel (); if (len == 0) (*current_liboctave_error_handler) ("sub2ind: needs at least 2 indices"); const dim_vector dvx = dv.redim (len); bool all_ranges = true; octave_idx_type clen = -1; for (octave_idx_type i = 0; i < len; i++) { try { idx_vector idx = idxa(i); octave_idx_type n = dvx(i); all_ranges = all_ranges && idx.is_range (); if (clen < 0) clen = idx.length (n); else if (clen != idx.length (n)) (*current_liboctave_error_handler) ("sub2ind: lengths of indices must match"); if (idx.extent (n) > n) err_index_out_of_range (len, i+1, idx.extent (n), n); } catch (index_exception& e) { e.set_pos_if_unset (len, i+1); e.set_var (); std::string msg = e.message (); (*current_liboctave_error_with_id_handler) (e.err_id (), msg.c_str ()); } } // idxa known to be valid. Shouldn't need to catch index_exception below here. if (len == 1) retval = idxa(0); else if (clen == 1) { // All scalars case - the result is a scalar. octave_idx_type idx = idxa(len-1)(0); for (octave_idx_type i = len - 2; i >= 0; i--) idx = dvx(i) * idx + idxa(i)(0); retval = idx_vector (idx); } else if (all_ranges && clen != 0) { // All ranges case - the result is a range. octave_idx_type start = 0; octave_idx_type step = 0; for (octave_idx_type i = len - 1; i >= 0; i--) { octave_idx_type xstart = idxa(i)(0); octave_idx_type xstep = idxa(i)(1) - xstart; start = dvx(i) * start + xstart; step = dvx(i) * step + xstep; } retval = idx_vector::make_range (start, step, clen); } else { Array<octave_idx_type> idx (idxa(0).orig_dimensions ()); octave_idx_type *idx_vec = idx.fortran_vec (); for (octave_idx_type i = len - 1; i >= 0; i--) { if (i < len - 1) idxa(i).loop (clen, sub2ind_helper (idx_vec, dvx(i))); else idxa(i).copy_data (idx_vec); } retval = idx_vector (idx); } return retval; } Array<idx_vector> ind2sub (const dim_vector& dv, const idx_vector& idx) { octave_idx_type len = idx.length (0); octave_idx_type n = dv.length (); Array<idx_vector> retval (dim_vector (n, 1)); octave_idx_type numel = dv.numel (); if (idx.extent (numel) > numel) (*current_liboctave_error_handler) ("ind2sub: index out of range"); if (idx.is_scalar ()) { octave_idx_type k = idx(0); for (octave_idx_type j = 0; j < n; j++) { retval(j) = k % dv(j); k /= dv(j); } } else { OCTAVE_LOCAL_BUFFER (Array<octave_idx_type>, rdata, n); dim_vector odv = idx.orig_dimensions (); for (octave_idx_type j = 0; j < n; j++) rdata[j] = Array<octave_idx_type> (odv); for (octave_idx_type i = 0; i < len; i++) { octave_idx_type k = idx(i); for (octave_idx_type j = 0; j < n; j++) { rdata[j](i) = k % dv(j); k /= dv(j); } } for (octave_idx_type j = 0; j < n; j++) retval(j) = rdata[j]; } return retval; } int permute_vector_compare (const void *a, const void *b) { const permute_vector *pva = static_cast<const permute_vector *> (a); const permute_vector *pvb = static_cast<const permute_vector *> (b); return pva->pidx > pvb->pidx; }