Mercurial > octave
view liboctave/array/idx-vector.cc @ 31605:e88a07dec498 stable
maint: Use macros to begin/end C++ namespaces.
* oct-conf-post-public.in.h: Define two macros (OCTAVE_BEGIN_NAMESPACE,
OCTAVE_END_NAMESPACE) that can be used to start/end a namespace.
* mk-opts.pl, build-env.h, build-env.in.cc, __betainc__.cc, __contourc__.cc,
__dsearchn__.cc, __eigs__.cc, __expint__.cc, __ftp__.cc, __gammainc__.cc,
__ichol__.cc, __ilu__.cc, __isprimelarge__.cc, __lin_interpn__.cc,
__magick_read__.cc, __pchip_deriv__.cc, __qp__.cc, amd.cc, auto-shlib.cc,
auto-shlib.h, balance.cc, base-text-renderer.cc, base-text-renderer.h,
besselj.cc, bitfcns.cc, bsxfun.cc, c-file-ptr-stream.cc, c-file-ptr-stream.h,
call-stack.cc, call-stack.h, ccolamd.cc, cellfun.cc, chol.cc, colamd.cc,
colloc.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc, data.h, debug.cc,
defaults.cc, defaults.h, defun-int.h, defun.cc, det.cc, dirfns.cc, display.cc,
display.h, dlmread.cc, dmperm.cc, dot.cc, dynamic-ld.cc, dynamic-ld.h, eig.cc,
ellipj.cc, environment.cc, environment.h, error.cc, error.h, errwarn.h,
event-manager.cc, event-manager.h, event-queue.cc, event-queue.h, fcn-info.cc,
fcn-info.h, fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc, find.cc,
ft-text-renderer.cc, ft-text-renderer.h, gcd.cc, getgrent.cc, getpwent.cc,
getrusage.cc, givens.cc, gl-render.cc, gl-render.h, gl2ps-print.cc,
gl2ps-print.h, graphics-toolkit.cc, graphics-toolkit.h, graphics.cc,
graphics.in.h, gsvd.cc, gtk-manager.cc, gtk-manager.h, hash.cc, help.cc,
help.h, hess.cc, hex2num.cc, hook-fcn.cc, hook-fcn.h, input.cc, input.h,
interpreter-private.cc, interpreter-private.h, interpreter.cc, interpreter.h,
inv.cc, jsondecode.cc, jsonencode.cc, kron.cc, latex-text-renderer.cc,
latex-text-renderer.h, load-path.cc, load-path.h, load-save.cc, load-save.h,
lookup.cc, ls-ascii-helper.cc, ls-ascii-helper.h, ls-oct-text.cc, ls-utils.cc,
ls-utils.h, lsode.cc, lu.cc, mappers.cc, matrix_type.cc, max.cc, mex-private.h,
mex.cc, mgorth.cc, nproc.cc, oct-fstrm.cc, oct-fstrm.h, oct-hdf5-types.cc,
oct-hdf5-types.h, oct-hist.cc, oct-hist.h, oct-iostrm.cc, oct-iostrm.h,
oct-opengl.h, oct-prcstrm.cc, oct-prcstrm.h, oct-procbuf.cc, oct-procbuf.h,
oct-process.cc, oct-process.h, oct-stdstrm.h, oct-stream.cc, oct-stream.h,
oct-strstrm.cc, oct-strstrm.h, oct-tex-lexer.in.ll, oct-tex-parser.yy,
ordqz.cc, ordschur.cc, pager.cc, pager.h, pinv.cc, pow2.cc, pr-flt-fmt.cc,
pr-output.cc, procstream.cc, procstream.h, psi.cc, qr.cc, quad.cc, quadcc.cc,
qz.cc, rand.cc, rcond.cc, regexp.cc, schur.cc, settings.cc, settings.h,
sighandlers.cc, sighandlers.h, sparse-xdiv.cc, sparse-xdiv.h, sparse-xpow.cc,
sparse-xpow.h, sparse.cc, spparms.cc, sqrtm.cc, stack-frame.cc, stack-frame.h,
stream-euler.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc, sylvester.cc,
symbfact.cc, syminfo.cc, syminfo.h, symrcm.cc, symrec.cc, symrec.h,
symscope.cc, symscope.h, symtab.cc, symtab.h, syscalls.cc, sysdep.cc, sysdep.h,
text-engine.cc, text-engine.h, text-renderer.cc, text-renderer.h, time.cc,
toplev.cc, tril.cc, tsearch.cc, typecast.cc, url-handle-manager.cc,
url-handle-manager.h, urlwrite.cc, utils.cc, utils.h, variables.cc,
variables.h, xdiv.cc, xdiv.h, xnorm.cc, xnorm.h, xpow.cc, xpow.h,
__delaunayn__.cc, __fltk_uigetfile__.cc, __glpk__.cc, __init_fltk__.cc,
__init_gnuplot__.cc, __ode15__.cc, __voronoi__.cc, audiodevinfo.cc,
audioread.cc, convhulln.cc, fftw.cc, gzip.cc, mk-build-env-features.sh,
mk-builtins.pl, cdef-class.cc, cdef-class.h, cdef-fwd.h, cdef-manager.cc,
cdef-manager.h, cdef-method.cc, cdef-method.h, cdef-object.cc, cdef-object.h,
cdef-package.cc, cdef-package.h, cdef-property.cc, cdef-property.h,
cdef-utils.cc, cdef-utils.h, ov-base.cc, ov-base.h, ov-bool-mat.cc,
ov-builtin.h, ov-cell.cc, ov-class.cc, ov-class.h, ov-classdef.cc,
ov-classdef.h, ov-complex.cc, ov-fcn-handle.cc, ov-fcn-handle.h, ov-fcn.h,
ov-java.cc, ov-java.h, ov-mex-fcn.h, ov-null-mat.cc, ov-oncleanup.cc,
ov-struct.cc, ov-typeinfo.cc, ov-typeinfo.h, ov-usr-fcn.cc, ov-usr-fcn.h,
ov.cc, ov.h, octave.cc, octave.h, mk-ops.sh, 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-fcdm-fcdm.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-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-m-cm.cc, op-m-cs.cc, op-m-m.cc, op-m-s.cc,
op-m-scm.cc, op-m-sm.cc, op-mi.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, ops.h,
anon-fcn-validator.cc, anon-fcn-validator.h, bp-table.cc, bp-table.h,
comment-list.cc, comment-list.h, filepos.h, lex.h, lex.ll, oct-lvalue.cc,
oct-lvalue.h, oct-parse.yy, parse.h, profiler.cc, profiler.h,
pt-anon-scopes.cc, pt-anon-scopes.h, pt-arg-list.cc, pt-arg-list.h,
pt-args-block.cc, pt-args-block.h, pt-array-list.cc, pt-array-list.h,
pt-assign.cc, pt-assign.h, pt-binop.cc, pt-binop.h, pt-bp.cc, pt-bp.h,
pt-cbinop.cc, pt-cbinop.h, pt-cell.cc, pt-cell.h, pt-check.cc, pt-check.h,
pt-classdef.cc, pt-classdef.h, pt-cmd.h, pt-colon.cc, pt-colon.h, pt-const.cc,
pt-const.h, pt-decl.cc, pt-decl.h, pt-eval.cc, pt-eval.h, pt-except.cc,
pt-except.h, pt-exp.cc, pt-exp.h, pt-fcn-handle.cc, pt-fcn-handle.h, pt-id.cc,
pt-id.h, pt-idx.cc, pt-idx.h, pt-jump.h, pt-loop.cc, pt-loop.h, pt-mat.cc,
pt-mat.h, pt-misc.cc, pt-misc.h, pt-pr-code.cc, pt-pr-code.h, pt-select.cc,
pt-select.h, pt-spmd.cc, pt-spmd.h, pt-stmt.cc, pt-stmt.h, pt-tm-const.cc,
pt-tm-const.h, pt-unop.cc, pt-unop.h, pt-vm-eval.cc, pt-walk.cc, pt-walk.h,
pt.cc, pt.h, token.cc, token.h, Range.cc, Range.h, idx-vector.cc, idx-vector.h,
range-fwd.h, CollocWt.cc, CollocWt.h, aepbalance.cc, aepbalance.h, chol.cc,
chol.h, gepbalance.cc, gepbalance.h, gsvd.cc, gsvd.h, hess.cc, hess.h,
lo-mappers.cc, lo-mappers.h, lo-specfun.cc, lo-specfun.h, lu.cc, lu.h,
oct-convn.cc, oct-convn.h, oct-fftw.cc, oct-fftw.h, oct-norm.cc, oct-norm.h,
oct-rand.cc, oct-rand.h, oct-spparms.cc, oct-spparms.h, qr.cc, qr.h, qrp.cc,
qrp.h, randgamma.cc, randgamma.h, randmtzig.cc, randmtzig.h, randpoisson.cc,
randpoisson.h, schur.cc, schur.h, sparse-chol.cc, sparse-chol.h, sparse-lu.cc,
sparse-lu.h, sparse-qr.cc, sparse-qr.h, svd.cc, svd.h, child-list.cc,
child-list.h, dir-ops.cc, dir-ops.h, file-ops.cc, file-ops.h, file-stat.cc,
file-stat.h, lo-sysdep.cc, lo-sysdep.h, lo-sysinfo.cc, lo-sysinfo.h,
mach-info.cc, mach-info.h, oct-env.cc, oct-env.h, oct-group.cc, oct-group.h,
oct-password.cc, oct-password.h, oct-syscalls.cc, oct-syscalls.h, oct-time.cc,
oct-time.h, oct-uname.cc, oct-uname.h, action-container.cc, action-container.h,
base-list.h, cmd-edit.cc, cmd-edit.h, cmd-hist.cc, cmd-hist.h, f77-fcn.h,
file-info.cc, file-info.h, lo-array-errwarn.cc, lo-array-errwarn.h, lo-hash.cc,
lo-hash.h, lo-ieee.h, lo-regexp.cc, lo-regexp.h, lo-utils.cc, lo-utils.h,
oct-base64.cc, oct-base64.h, oct-glob.cc, oct-glob.h, oct-inttypes.h,
oct-mutex.cc, oct-mutex.h, oct-refcount.h, oct-shlib.cc, oct-shlib.h,
oct-sparse.cc, oct-sparse.h, oct-string.h, octave-preserve-stream-state.h,
pathsearch.cc, pathsearch.h, quit.cc, quit.h, unwind-prot.cc, unwind-prot.h,
url-transfer.cc, url-transfer.h : Use new macros to begin/end C++ namespaces.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 01 Dec 2022 14:23:45 -0800 |
parents | a81fad5c9fef |
children | aac27ad79be6 |
line wrap: on
line source
//////////////////////////////////////////////////////////////////////// // // Copyright (C) 1993-2022 The Octave Project Developers // // See the file COPYRIGHT.md in the top-level directory of this // distribution or <https://octave.org/copyright/>. // // 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 // <https://www.gnu.org/licenses/>. // //////////////////////////////////////////////////////////////////////// #if defined (HAVE_CONFIG_H) # include "config.h" #endif #include <cinttypes> #include <cstdlib> #include <ostream> #include "idx-vector.h" #include "Array.h" #include "Array-util.h" #include "Sparse.h" #include "Range.h" #include "oct-locbuf.h" #include "lo-error.h" #include "lo-mappers.h" OCTAVE_BEGIN_NAMESPACE(octave) OCTAVE_NORETURN static void err_invalid_range (void) { (*current_liboctave_error_handler) ("invalid range used as index"); } OCTAVE_NORETURN static void err_index_out_of_range (void) { (*current_liboctave_error_handler) ("internal error: idx_vector index out of range"); } idx_vector::idx_vector_rep * idx_vector::nil_rep (void) { static idx_vector_rep ivr; return &ivr; } Array<octave_idx_type> idx_vector::idx_base_rep::as_array (void) { (*current_liboctave_error_handler) ("internal error: as_array not allowed for this index class"); // Never actually executed, but required to silence compiler warning return Array<octave_idx_type> (); } idx_vector::idx_colon_rep::idx_colon_rep (char c) : idx_base_rep () { if (c != ':') (*current_liboctave_error_handler) ("internal error: invalid character converted to idx_vector; must be ':'"); } octave_idx_type idx_vector::idx_colon_rep::checkelem (octave_idx_type i) const { if (i < 0) err_index_out_of_range (); return i; } idx_vector::idx_base_rep * idx_vector::idx_colon_rep::sort_idx (Array<octave_idx_type>&) { (*current_liboctave_error_handler) ("internal error: idx_colon_rep::sort_idx"); } std::ostream& idx_vector::idx_colon_rep::print (std::ostream& os) const { return os << ':'; } idx_vector::idx_range_rep::idx_range_rep (octave_idx_type start, octave_idx_type limit, octave_idx_type step) : idx_base_rep (), m_start(start), // Round length away from zero to catch incomplete intervals m_len (step ? std::max ((limit - start + step - (step > 0 ? 1 : -1)) / step, static_cast<octave_idx_type> (0)) : -1), m_step (step) { if (m_len < 0) err_invalid_range (); if (m_start < 0) err_invalid_index (m_start); if (m_step < 0 && m_start + (m_len-1)*m_step < 0) err_invalid_index (m_start + (m_len-1)*m_step); } idx_vector::idx_range_rep::idx_range_rep (const range<double>& r) : idx_base_rep (), m_start (0), m_len (r.numel ()), m_step (1) { if (m_len < 0) err_invalid_range (); if (m_len > 0) { if (r.all_elements_are_ints ()) { m_start = static_cast<octave_idx_type> (r.base ()) - 1; m_step = static_cast<octave_idx_type> (r.increment ()); if (m_start < 0) err_invalid_index (m_start); if (m_step < 0 && m_start + (m_len - 1)*m_step < 0) err_invalid_index (m_start + (m_len - 1)*m_step); } else { // find first non-integer, then gripe about it double b = r.base (); double inc = r.increment (); err_invalid_index (b != std::trunc (b) ? b : b + inc); } } } octave_idx_type idx_vector::idx_range_rep::checkelem (octave_idx_type i) const { if (i < 0 || i >= m_len) err_index_out_of_range (); return m_start + i*m_step; } idx_vector::idx_base_rep * idx_vector::idx_range_rep::sort_uniq_clone (bool) { if (m_step < 0) return new idx_range_rep (m_start + (m_len - 1)*m_step, m_len, -m_step, DIRECT); else { m_count++; return this; } } idx_vector::idx_base_rep * idx_vector::idx_range_rep::sort_idx (Array<octave_idx_type>& idx) { if (m_step < 0 && m_len > 0) { idx.clear (1, m_len); for (octave_idx_type i = 0; i < m_len; i++) idx.xelem (i) = m_len - 1 - i; return new idx_range_rep (m_start + (m_len - 1)*m_step, m_len, -m_step, DIRECT); } else { idx.clear (1, m_len); for (octave_idx_type i = 0; i < m_len; i++) idx.xelem (i) = i; m_count++; return this; } } std::ostream& idx_vector::idx_range_rep::print (std::ostream& os) const { os << m_start << ':' << m_step << ':' << m_start + m_len*m_step; return os; } range<double> idx_vector::idx_range_rep::unconvert (void) const { return range<double>::make_n_element_range (static_cast<double> (m_start+1), static_cast<double> (m_step), m_len); } Array<octave_idx_type> idx_vector::idx_range_rep::as_array (void) { Array<octave_idx_type> retval (dim_vector (1, m_len)); for (octave_idx_type i = 0; i < m_len; i++) retval.xelem (i) = m_start + i*m_step; return retval; } inline octave_idx_type convert_index (octave_idx_type i, octave_idx_type& ext) { if (i <= 0) err_invalid_index (i-1); if (ext < i) ext = i; return i - 1; } inline octave_idx_type convert_index (double x, octave_idx_type& ext) { octave_idx_type i = static_cast<octave_idx_type> (x); if (static_cast<double> (i) != x) err_invalid_index (x-1); return convert_index (i, ext); } inline octave_idx_type convert_index (float x, octave_idx_type& ext) { return convert_index (static_cast<double> (x), ext); } template <typename T> inline octave_idx_type convert_index (octave_int<T> x, octave_idx_type& ext) { octave_idx_type i = octave_int<octave_idx_type> (x).value (); return convert_index (i, ext); } template <typename T> idx_vector::idx_scalar_rep::idx_scalar_rep (T x) : idx_base_rep (), m_data (0) { octave_idx_type dummy = 0; m_data = convert_index (x, dummy); } idx_vector::idx_scalar_rep::idx_scalar_rep (octave_idx_type i) : idx_base_rep (), m_data (i) { if (m_data < 0) err_invalid_index (m_data); } octave_idx_type idx_vector::idx_scalar_rep::checkelem (octave_idx_type i) const { if (i != 0) err_index_out_of_range (); return m_data; } idx_vector::idx_base_rep * idx_vector::idx_scalar_rep::sort_idx (Array<octave_idx_type>& idx) { idx.clear (1, 1); idx.fill (0); m_count++; return this; } std::ostream& idx_vector::idx_scalar_rep::print (std::ostream& os) const { return os << m_data; } double idx_vector::idx_scalar_rep::unconvert (void) const { return m_data + 1; } Array<octave_idx_type> idx_vector::idx_scalar_rep::as_array (void) { return Array<octave_idx_type> (dim_vector (1, 1), m_data); } template <typename T> idx_vector::idx_vector_rep::idx_vector_rep (const Array<T>& nda) : idx_base_rep (), m_data (nullptr), m_len (nda.numel ()), m_ext (0), m_aowner (nullptr), m_orig_dims (nda.dims ()) { if (m_len != 0) { std::unique_ptr<octave_idx_type []> d (new octave_idx_type [m_len]); for (octave_idx_type i = 0; i < m_len; i++) d[i] = convert_index (nda.xelem (i), m_ext); m_data = d.release (); } } // Note that this makes a shallow copy of the index array. idx_vector::idx_vector_rep::idx_vector_rep (const Array<octave_idx_type>& inda) : idx_base_rep (), m_data (inda.data ()), m_len (inda.numel ()), m_ext (0), m_aowner (new Array<octave_idx_type> (inda)), m_orig_dims (inda.dims ()) { if (m_len != 0) { octave_idx_type max = -1; for (octave_idx_type i = 0; i < m_len; i++) { octave_idx_type k = inda.xelem (i); if (k < 0) err_invalid_index (k); else if (k > max) max = k; } m_ext = max + 1; } } idx_vector::idx_vector_rep::idx_vector_rep (const Array<octave_idx_type>& inda, octave_idx_type ext, direct) : idx_base_rep (), m_data (inda.data ()), m_len (inda.numel ()), m_ext (ext), m_aowner (new Array<octave_idx_type> (inda)), m_orig_dims (inda.dims ()) { // No checking. if (m_ext < 0) { octave_idx_type max = -1; for (octave_idx_type i = 0; i < m_len; i++) if (m_data[i] > max) max = m_data[i]; m_ext = max + 1; } } idx_vector::idx_vector_rep::idx_vector_rep (bool b) : idx_base_rep (), m_data (nullptr), m_len (b ? 1 : 0), m_ext (0), m_aowner (nullptr), m_orig_dims (m_len, m_len) { if (m_len != 0) { octave_idx_type *d = new octave_idx_type [1]; d[0] = 0; m_data = d; m_ext = 1; } } idx_vector::idx_vector_rep::idx_vector_rep (const Array<bool>& bnda, octave_idx_type nnz) : idx_base_rep (), m_data (nullptr), m_len (nnz), m_ext (0), m_aowner (nullptr), m_orig_dims () { if (nnz < 0) m_len = bnda.nnz (); const dim_vector dv = bnda.dims (); m_orig_dims = dv.make_nd_vector (m_len); if (m_len != 0) { octave_idx_type *d = new octave_idx_type [m_len]; octave_idx_type ntot = bnda.numel (); octave_idx_type k = 0; for (octave_idx_type i = 0; i < ntot; i++) if (bnda.xelem (i)) d[k++] = i; m_data = d; m_ext = d[k-1] + 1; } } idx_vector::idx_vector_rep::idx_vector_rep (const Sparse<bool>& bnda) : idx_base_rep (), m_data (nullptr), m_len (bnda.nnz ()), m_ext (0), m_aowner (nullptr), m_orig_dims () { const dim_vector dv = bnda.dims (); m_orig_dims = dv.make_nd_vector (m_len); if (m_len != 0) { octave_idx_type *d = new octave_idx_type [m_len]; octave_idx_type k = 0; octave_idx_type nc = bnda.cols (); octave_idx_type nr = bnda.rows (); for (octave_idx_type j = 0; j < nc; j++) for (octave_idx_type i = bnda.cidx (j); i < bnda.cidx (j+1); i++) if (bnda.data (i)) d[k++] = j * nr + bnda.ridx (i); m_data = d; m_ext = d[k-1] + 1; } } idx_vector::idx_vector_rep::~idx_vector_rep (void) { if (m_aowner) delete m_aowner; else delete [] m_data; } octave_idx_type idx_vector::idx_vector_rep::checkelem (octave_idx_type n) const { if (n < 0 || n >= m_len) err_invalid_index (n); return xelem (n); } idx_vector::idx_base_rep * idx_vector::idx_vector_rep::sort_uniq_clone (bool uniq) { if (m_len == 0) { m_count++; return this; } // This is wrapped in unique_ptr so that we don't leak on out-of-memory. std::unique_ptr<idx_vector_rep> new_rep (new idx_vector_rep (nullptr, m_len, m_ext, m_orig_dims, DIRECT)); if (m_ext > m_len*math::log2 (1.0 + m_len)) { // Use standard sort via octave_sort. octave_idx_type *new_data = new octave_idx_type [m_len]; new_rep->m_data = new_data; std::copy_n (m_data, m_len, new_data); octave_sort<octave_idx_type> lsort; lsort.set_compare (ASCENDING); lsort.sort (new_data, m_len); if (uniq) { octave_idx_type new_len = std::unique (new_data, new_data + m_len) - new_data; new_rep->m_len = new_len; if (new_rep->m_orig_dims.ndims () == 2 && new_rep->m_orig_dims(0) == 1) new_rep->m_orig_dims = dim_vector (1, new_len); else new_rep->m_orig_dims = dim_vector (new_len, 1); } } else if (uniq) { // Use two-pass bucket sort (only a mask array needed). OCTAVE_LOCAL_BUFFER_INIT (bool, has, m_ext, false); for (octave_idx_type i = 0; i < m_len; i++) has[m_data[i]] = true; octave_idx_type new_len = 0; for (octave_idx_type i = 0; i < m_ext; i++) new_len += has[i]; new_rep->m_len = new_len; if (new_rep->m_orig_dims.ndims () == 2 && new_rep->m_orig_dims(0) == 1) new_rep->m_orig_dims = dim_vector (1, new_len); else new_rep->m_orig_dims = dim_vector (new_len, 1); octave_idx_type *new_data = new octave_idx_type [new_len]; new_rep->m_data = new_data; for (octave_idx_type i = 0, j = 0; i < m_ext; i++) if (has[i]) new_data[j++] = i; } else { // Use two-pass bucket sort. OCTAVE_LOCAL_BUFFER_INIT (octave_idx_type, cnt, m_ext, 0); for (octave_idx_type i = 0; i < m_len; i++) cnt[m_data[i]]++; octave_idx_type *new_data = new octave_idx_type [m_len]; new_rep->m_data = new_data; for (octave_idx_type i = 0, j = 0; i < m_ext; i++) { for (octave_idx_type k = 0; k < cnt[i]; k++) new_data[j++] = i; } } return new_rep.release (); } idx_vector::idx_base_rep * idx_vector::idx_vector_rep::sort_idx (Array<octave_idx_type>& idx) { // This is wrapped in unique_ptr so that we don't leak on out-of-memory. std::unique_ptr<idx_vector_rep> new_rep (new idx_vector_rep (nullptr, m_len, m_ext, m_orig_dims, DIRECT)); if (m_ext > m_len*math::log2 (1.0 + m_len)) { // Use standard sort via octave_sort. idx.clear (m_orig_dims); octave_idx_type *idx_data = idx.fortran_vec (); for (octave_idx_type i = 0; i < m_len; i++) idx_data[i] = i; octave_idx_type *new_data = new octave_idx_type [m_len]; new_rep->m_data = new_data; std::copy_n (m_data, m_len, new_data); octave_sort<octave_idx_type> lsort; lsort.set_compare (ASCENDING); lsort.sort (new_data, idx_data, m_len); } else { // Use two-pass bucket sort. OCTAVE_LOCAL_BUFFER_INIT (octave_idx_type, cnt, m_ext, 0); for (octave_idx_type i = 0; i < m_len; i++) cnt[m_data[i]]++; idx.clear (m_orig_dims); octave_idx_type *idx_data = idx.fortran_vec (); octave_idx_type *new_data = new octave_idx_type [m_len]; new_rep->m_data = new_data; for (octave_idx_type i = 0, k = 0; i < m_ext; i++) { octave_idx_type j = cnt[i]; cnt[i] = k; k += j; } for (octave_idx_type i = 0; i < m_len; i++) { octave_idx_type j = m_data[i]; octave_idx_type k = cnt[j]++; new_data[k] = j; idx_data[k] = i; } } return new_rep.release (); } std::ostream& idx_vector::idx_vector_rep::print (std::ostream& os) const { os << '['; for (octave_idx_type i = 0; i < m_len - 1; i++) os << m_data[i] << ',' << ' '; if (m_len > 0) os << m_data[m_len-1]; os << ']'; return os; } Array<double> idx_vector::idx_vector_rep::unconvert (void) const { Array<double> retval (m_orig_dims); for (octave_idx_type i = 0; i < m_len; i++) retval.xelem (i) = m_data[i] + 1; return retval; } Array<octave_idx_type> idx_vector::idx_vector_rep::as_array (void) { if (m_aowner) return *m_aowner; else { Array<octave_idx_type> retval (m_orig_dims); if (m_data) { std::memcpy (retval.fortran_vec (), m_data, m_len*sizeof (octave_idx_type)); // Delete the old copy and share the m_data instead to save memory. delete [] m_data; } m_data = retval.fortran_vec (); m_aowner = new Array<octave_idx_type> (retval); return retval; } } idx_vector::idx_mask_rep::idx_mask_rep (bool b) : idx_base_rep (), m_data (nullptr), m_len (b ? 1 : 0), m_ext (0), m_lsti (-1), m_lste (-1), m_aowner (nullptr), m_orig_dims (m_len, m_len) { if (m_len != 0) { bool *d = new bool [1]; d[0] = true; m_data = d; m_ext = 1; } } idx_vector::idx_mask_rep::idx_mask_rep (const Array<bool>& bnda, octave_idx_type nnz) : idx_base_rep (), m_data (nullptr), m_len (nnz), m_ext (bnda.numel ()), m_lsti (-1), m_lste (-1), m_aowner (nullptr), m_orig_dims () { if (nnz < 0) m_len = bnda.nnz (); // We truncate the extent as much as possible. For Matlab // compatibility, but maybe it's not a bad idea anyway. while (m_ext > 0 && ! bnda(m_ext-1)) m_ext--; const dim_vector dv = bnda.dims (); m_orig_dims = dv.make_nd_vector (m_len); m_aowner = new Array<bool> (bnda); m_data = bnda.data (); } idx_vector::idx_mask_rep::~idx_mask_rep (void) { if (m_aowner) delete m_aowner; else delete [] m_data; } octave_idx_type idx_vector::idx_mask_rep::xelem (octave_idx_type n) const { if (n == m_lsti + 1) { m_lsti = n; while (! m_data[++m_lste]) ; } else { m_lsti = n++; m_lste = -1; while (n > 0) if (m_data[++m_lste]) --n; } return m_lste; } octave_idx_type idx_vector::idx_mask_rep::checkelem (octave_idx_type n) const { if (n < 0 || n >= m_len) err_invalid_index (n); return xelem (n); } std::ostream& idx_vector::idx_mask_rep::print (std::ostream& os) const { os << '['; for (octave_idx_type i = 0; i < m_ext - 1; i++) os << m_data[i] << ',' << ' '; if (m_ext > 0) os << m_data[m_ext-1]; os << ']'; return os; } Array<bool> idx_vector::idx_mask_rep::unconvert (void) const { if (m_aowner) return *m_aowner; else { Array<bool> retval (dim_vector (m_ext, 1)); for (octave_idx_type i = 0; i < m_ext; i++) retval.xelem (i) = m_data[i]; return retval; } } Array<octave_idx_type> idx_vector::idx_mask_rep::as_array (void) { if (m_aowner) return m_aowner->find ().reshape (m_orig_dims); else { Array<bool> retval (m_orig_dims); for (octave_idx_type i = 0, j = 0; i < m_ext; i++) if (m_data[i]) retval.xelem (j++) = i; return retval; } } idx_vector::idx_base_rep * idx_vector::idx_mask_rep::sort_idx (Array<octave_idx_type>& idx) { idx.clear (m_len, 1); for (octave_idx_type i = 0; i < m_len; i++) idx.xelem (i) = i; m_count++; return this; } const idx_vector idx_vector::colon (new idx_vector::idx_colon_rep ()); idx_vector::idx_vector (const Array<bool>& bnda) : m_rep (nullptr) { // Convert only if it means saving at least half the memory. static const int factor = (2 * sizeof (octave_idx_type)); octave_idx_type nnz = bnda.nnz (); if (nnz <= bnda.numel () / factor) m_rep = new idx_vector_rep (bnda, nnz); else m_rep = new idx_mask_rep (bnda, nnz); } bool idx_vector::maybe_reduce (octave_idx_type n, const idx_vector& j, octave_idx_type nj) { bool reduced = false; // Empty index always reduces. if (m_rep->length (n) == 0) { *this = idx_vector (); return true; } // Possibly skip singleton dims. if (n == 1 && m_rep->is_colon_equiv (n)) { *this = j; return true; } if (nj == 1 && j.is_colon_equiv (nj)) return true; switch (j.idx_class ()) { case class_colon: switch (m_rep->idx_class ()) { case class_colon: // (:,:) reduces to (:) reduced = true; break; case class_scalar: { // (i,:) reduces to a range. idx_scalar_rep *r = dynamic_cast<idx_scalar_rep *> (m_rep); octave_idx_type k = r->get_data (); *this = new idx_range_rep (k, nj, n, DIRECT); reduced = true; } break; case class_range: { // (i:k:end,:) reduces to a range if i <= k and k divides n. idx_range_rep *r = dynamic_cast<idx_range_rep *> (m_rep); octave_idx_type s = r->get_start (); octave_idx_type l = r->length (n); octave_idx_type t = r->get_step (); if (l*t == n) { *this = new idx_range_rep (s, l * nj, t, DIRECT); reduced = true; } } break; default: break; } break; case class_range: switch (m_rep->idx_class ()) { case class_colon: { // (:,i:j) reduces to a range (the m_step must be 1) idx_range_rep *rj = dynamic_cast<idx_range_rep *> (j.m_rep); if (rj->get_step () == 1) { octave_idx_type sj = rj->get_start (); octave_idx_type lj = rj->length (nj); *this = new idx_range_rep (sj * n, lj * n, 1, DIRECT); reduced = true; } } break; case class_scalar: { // (k,i:d:j) reduces to a range. idx_scalar_rep *r = dynamic_cast<idx_scalar_rep *> (m_rep); idx_range_rep *rj = dynamic_cast<idx_range_rep *> (j.m_rep); octave_idx_type k = r->get_data (); octave_idx_type sj = rj->get_start (); octave_idx_type lj = rj->length (nj); octave_idx_type tj = rj->get_step (); *this = new idx_range_rep (n * sj + k, lj, n * tj, DIRECT); reduced = true; } break; case class_range: { // (i:k:end,p:q) reduces to a range if i <= k and k divides n. // (ones (1, m), ones (1, n)) reduces to (ones (1, m*n)) idx_range_rep *r = dynamic_cast<idx_range_rep *> (m_rep); octave_idx_type s = r->get_start (); octave_idx_type l = r->length (n); octave_idx_type t = r->get_step (); idx_range_rep *rj = dynamic_cast<idx_range_rep *> (j.m_rep); octave_idx_type sj = rj->get_start (); octave_idx_type lj = rj->length (nj); octave_idx_type tj = rj->get_step (); if ((l*t == n && tj == 1) || (t == 0 && tj == 0)) { *this = new idx_range_rep (s + n * sj, l * lj, t, DIRECT); reduced = true; } } break; default: break; } break; case class_scalar: switch (m_rep->idx_class ()) { case class_scalar: { // (i,j) reduces to a single index. idx_scalar_rep *r = dynamic_cast<idx_scalar_rep *> (m_rep); idx_scalar_rep *rj = dynamic_cast<idx_scalar_rep *> (j.m_rep); octave_idx_type k = r->get_data () + n * rj->get_data (); *this = new idx_scalar_rep (k, DIRECT); reduced = true; } break; case class_range: { // (i:d:j,k) reduces to a range. idx_range_rep *r = dynamic_cast<idx_range_rep *> (m_rep); idx_scalar_rep *rj = dynamic_cast<idx_scalar_rep *> (j.m_rep); octave_idx_type s = r->get_start (); octave_idx_type l = r->length (nj); octave_idx_type t = r->get_step (); octave_idx_type k = rj->get_data (); *this = new idx_range_rep (n * k + s, l, t, DIRECT); reduced = true; } break; case class_colon: { // (:,k) reduces to a range. idx_scalar_rep *rj = dynamic_cast<idx_scalar_rep *> (j.m_rep); octave_idx_type k = rj->get_data (); *this = new idx_range_rep (n * k, n, 1, DIRECT); reduced = true; } break; default: break; } break; default: break; } return reduced; } bool idx_vector::is_cont_range (octave_idx_type n, octave_idx_type& l, octave_idx_type& u) const { bool res = false; switch (m_rep->idx_class ()) { case class_colon: l = 0; u = n; res = true; break; case class_range: { idx_range_rep *r = dynamic_cast<idx_range_rep *> (m_rep); if (r->get_step () == 1) { l = r->get_start (); u = l + r->length (n); res = true; } } break; case class_scalar: { idx_scalar_rep *r = dynamic_cast<idx_scalar_rep *> (m_rep); l = r->get_data (); u = l + 1; res = true; } break; case class_mask: { idx_mask_rep *r = dynamic_cast<idx_mask_rep *> (m_rep); octave_idx_type m_ext = r->extent (0); octave_idx_type m_len = r->length (0); if (m_ext == m_len) { l = 0; u = m_len; res = true; } } default: break; } return res; } octave_idx_type idx_vector::increment (void) const { octave_idx_type retval = 0; switch (m_rep->idx_class ()) { case class_colon: retval = 1; break; case class_range: retval = dynamic_cast<idx_range_rep *> (m_rep) -> get_step (); break; case class_vector: case class_mask: { if (length (0) > 1) retval = elem (1) - elem (0); } break; default: break; } return retval; } const octave_idx_type * idx_vector::raw (void) { if (m_rep->idx_class () != class_vector) *this = idx_vector (as_array (), extent (0)); idx_vector_rep *r = dynamic_cast<idx_vector_rep *> (m_rep); assert (r != nullptr); return r->get_data (); } void idx_vector::copy_data (octave_idx_type *m_data) const { octave_idx_type m_len = m_rep->length (0); switch (m_rep->idx_class ()) { case class_colon: (*current_liboctave_error_handler) ("colon not allowed"); break; case class_range: { idx_range_rep *r = dynamic_cast<idx_range_rep *> (m_rep); octave_idx_type m_start = r->get_start (); octave_idx_type m_step = r->get_step (); octave_idx_type i, j; if (m_step == 1) for (i = m_start, j = m_start + m_len; i < j; i++) *m_data++ = i; else if (m_step == -1) for (i = m_start, j = m_start - m_len; i > j; i--) *m_data++ = i; else for (i = 0, j = m_start; i < m_len; i++, j += m_step) *m_data++ = j; } break; case class_scalar: { idx_scalar_rep *r = dynamic_cast<idx_scalar_rep *> (m_rep); *m_data = r->get_data (); } break; case class_vector: { idx_vector_rep *r = dynamic_cast<idx_vector_rep *> (m_rep); const octave_idx_type *rdata = r->get_data (); std::copy_n (rdata, m_len, m_data); } break; case class_mask: { idx_mask_rep *r = dynamic_cast<idx_mask_rep *> (m_rep); const bool *mask = r->get_data (); octave_idx_type m_ext = r->extent (0); for (octave_idx_type i = 0, j = 0; i < m_ext; i++) if (mask[i]) m_data[j++] = i; } break; default: assert (false); break; } } idx_vector idx_vector::complement (octave_idx_type n) const { idx_vector retval; if (extent (n) > n) (*current_liboctave_error_handler) ("internal error: out of range complement index requested"); if (idx_class () == class_mask) { idx_mask_rep *r = dynamic_cast<idx_mask_rep *> (m_rep); octave_idx_type nz = r->length (0); octave_idx_type m_ext = r->extent (0); Array<bool> mask (dim_vector (n, 1)); const bool *m_data = r->get_data (); bool *ndata = mask.fortran_vec (); for (octave_idx_type i = 0; i < m_ext; i++) ndata[i] = ! m_data[i]; std::fill_n (ndata + m_ext, n - m_ext, true); retval = new idx_mask_rep (mask, n - nz); } else { Array<bool> mask (dim_vector (n, 1), true); fill (false, length (n), mask.fortran_vec ()); retval = idx_vector (mask); } return retval; } bool idx_vector::is_permutation (octave_idx_type n) const { bool retval = false; if (is_colon_equiv (n)) retval = true; else if (length(n) == n && extent(n) == n) { OCTAVE_LOCAL_BUFFER_INIT (bool, left, n, true); retval = true; for (octave_idx_type i = 0, m_len = length (); i < m_len; i++) { octave_idx_type k = xelem (i); if (left[k]) left[k] = false; else { retval = false; break; } } } return retval; } idx_vector idx_vector::inverse_permutation (octave_idx_type n) const { assert (n == length (n)); idx_vector retval; switch (idx_class ()) { case class_range: { if (increment () == -1) retval = sorted (); else retval = *this; break; } case class_vector: { idx_vector_rep *r = dynamic_cast<idx_vector_rep *> (m_rep); const octave_idx_type *ri = r->get_data (); Array<octave_idx_type> idx (orig_dimensions ()); for (octave_idx_type i = 0; i < n; i++) idx.xelem (ri[i]) = i; retval = new idx_vector_rep (idx, r->extent (0), DIRECT); break; } default: retval = *this; break; } return retval; } idx_vector idx_vector::unmask (void) const { if (idx_class () == class_mask) { idx_mask_rep *r = dynamic_cast<idx_mask_rep *> (m_rep); const bool *m_data = r->get_data (); octave_idx_type m_ext = r->extent (0); octave_idx_type m_len = r->length (0); octave_idx_type *idata = new octave_idx_type [m_len]; for (octave_idx_type i = 0, j = 0; i < m_ext; i++) if (m_data[i]) idata[j++] = i; m_ext = (m_len > 0 ? idata[m_len - 1] + 1 : 0); return new idx_vector_rep (idata, m_len, m_ext, r->orig_dimensions (), DIRECT); } else return *this; } void idx_vector::unconvert (idx_class_type& iclass, double& scalar, range<double>& range, Array<double>& array, Array<bool>& mask) const { iclass = idx_class (); switch (iclass) { case class_colon: break; case class_range: { idx_range_rep *r = dynamic_cast<idx_range_rep *> (m_rep); range = r->unconvert (); } break; case class_scalar: { idx_scalar_rep *r = dynamic_cast<idx_scalar_rep *> (m_rep); scalar = r->unconvert (); } break; case class_vector: { idx_vector_rep *r = dynamic_cast<idx_vector_rep *> (m_rep); array = r->unconvert (); } break; case class_mask: { idx_mask_rep *r = dynamic_cast<idx_mask_rep *> (m_rep); mask = r->unconvert (); } break; default: assert (false); break; } } Array<octave_idx_type> idx_vector::as_array (void) const { return m_rep->as_array (); } bool idx_vector::isvector (void) const { return idx_class () != class_vector || orig_dimensions ().isvector (); } octave_idx_type idx_vector::freeze (octave_idx_type z_len, const char *, bool resize_ok) { if (! resize_ok && extent (z_len) > z_len) (*current_liboctave_error_handler) ("invalid matrix index = %" OCTAVE_IDX_TYPE_FORMAT, extent (z_len)); return length (z_len); } octave_idx_type idx_vector::ones_count () const { octave_idx_type n = 0; if (is_colon ()) n = 1; else { for (octave_idx_type i = 0; i < length (1); i++) if (xelem (i) == 0) n++; } return n; } // Instantiate the octave_int constructors we want. #define INSTANTIATE_SCALAR_VECTOR_REP_CONST(T) \ template OCTAVE_API idx_vector::idx_scalar_rep::idx_scalar_rep (T); \ template OCTAVE_API idx_vector::idx_vector_rep::idx_vector_rep (const Array<T>&); INSTANTIATE_SCALAR_VECTOR_REP_CONST (float) INSTANTIATE_SCALAR_VECTOR_REP_CONST (double) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_int8) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_int16) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_int32) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_int64) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_uint8) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_uint16) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_uint32) INSTANTIATE_SCALAR_VECTOR_REP_CONST (octave_uint64) OCTAVE_END_NAMESPACE(octave) /* %!error id=Octave:index-out-of-bounds 1(find ([1,1] != 0)) %!assert ((1:3)(find ([1,0,1] != 0)), [1,3]) */