Mercurial > octave
view libinterp/corefcn/find.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 | 8b522a359143 |
children | aac27ad79be6 |
line wrap: on
line source
//////////////////////////////////////////////////////////////////////// // // Copyright (C) 1996-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 "quit.h" #include "defun.h" #include "error.h" #include "errwarn.h" #include "ovl.h" OCTAVE_BEGIN_NAMESPACE(octave) // Find at most N_TO_FIND nonzero elements in NDA. Search forward if // DIRECTION is 1, backward if it is -1. NARGOUT is the number of // output arguments. If N_TO_FIND is -1, find all nonzero elements. template <typename T> octave_value_list find_nonzero_elem_idx (const Array<T>& nda, int nargout, octave_idx_type n_to_find, int direction) { octave_value_list retval ((nargout == 0 ? 1 : nargout), Matrix ()); Array<octave_idx_type> idx; if (n_to_find >= 0) idx = nda.find (n_to_find, direction == -1); else idx = nda.find (); // The maximum element is always at the end. octave_idx_type iext = (idx.isempty () ? 0 : idx.xelem (idx.numel () - 1) + 1); switch (nargout) { default: case 3: retval(2) = Array<T> (nda.index (idx_vector (idx))); OCTAVE_FALLTHROUGH; case 2: { Array<octave_idx_type> jdx (idx.dims ()); octave_idx_type n = idx.numel (); octave_idx_type nr = nda.rows (); for (octave_idx_type i = 0; i < n; i++) { jdx.xelem (i) = idx.xelem (i) / nr; idx.xelem (i) %= nr; } iext = -1; retval(1) = idx_vector (jdx, -1); } OCTAVE_FALLTHROUGH; case 1: case 0: retval(0) = idx_vector (idx, iext); break; } return retval; } template <typename T> octave_value_list find_nonzero_elem_idx (const Sparse<T>& v, int nargout, octave_idx_type n_to_find, int direction) { nargout = std::min (nargout, 5); octave_value_list retval ((nargout == 0 ? 1 : nargout), Matrix ()); octave_idx_type nr = v.rows (); octave_idx_type nc = v.cols (); octave_idx_type nz = v.nnz (); // Search in the default range. octave_idx_type start_nc = -1; octave_idx_type end_nc = -1; octave_idx_type count; // Search for the range to search if (n_to_find < 0) { start_nc = 0; end_nc = nc; n_to_find = nz; } else if (direction > 0) { for (octave_idx_type j = 0; j < nc; j++) { octave_quit (); if (v.cidx (j) == 0 && v.cidx (j+1) != 0) start_nc = j; if (v.cidx (j+1) >= n_to_find) { end_nc = j + 1; break; } } } else { for (octave_idx_type j = nc; j > 0; j--) { octave_quit (); if (v.cidx (j) == nz && v.cidx (j-1) != nz) end_nc = j; if (nz - v.cidx (j-1) >= n_to_find) { start_nc = j - 1; break; } } } count = (n_to_find > v.cidx (end_nc) - v.cidx (start_nc) ? v.cidx (end_nc) - v.cidx (start_nc) : n_to_find); octave_idx_type result_nr; octave_idx_type result_nc; // Default case is to return a column vector, however, if the original // argument was a row vector, then force return of a row vector. if (nr == 1) { result_nr = 1; result_nc = count; } else { result_nr = count; result_nc = 1; } Matrix idx (result_nr, result_nc); Matrix i_idx (result_nr, result_nc); Matrix j_idx (result_nr, result_nc); Array<T> val (dim_vector (result_nr, result_nc)); if (count > 0) { // Search for elements to return. Only search the region where there // are elements to be found using the count that we want to find. for (octave_idx_type j = start_nc, cx = 0; j < end_nc; j++) for (octave_idx_type i = v.cidx (j); i < v.cidx (j+1); i++) { octave_quit (); if (direction < 0 && i < nz - count) continue; i_idx(cx) = static_cast<double> (v.ridx (i) + 1); j_idx(cx) = static_cast<double> (j + 1); idx(cx) = j * nr + v.ridx (i) + 1; val(cx) = v.data(i); cx++; if (cx == count) break; } } else { // No items found. Fixup return dimensions for Matlab compatibility. // The behavior to match is documented in Array.cc (Array<T>::find). if ((nr == 0 && nc == 0) || (nr == 1 && nc == 1)) { idx.resize (0, 0); i_idx.resize (0, 0); j_idx.resize (0, 0); val.resize (dim_vector (0, 0)); } } switch (nargout) { case 0: case 1: retval(0) = idx; break; case 5: retval(4) = nc; OCTAVE_FALLTHROUGH; case 4: retval(3) = nr; OCTAVE_FALLTHROUGH; case 3: retval(2) = val; OCTAVE_FALLTHROUGH; case 2: retval(1) = j_idx; retval(0) = i_idx; } return retval; } octave_value_list find_nonzero_elem_idx (const PermMatrix& v, int nargout, octave_idx_type n_to_find, int direction) { // There are far fewer special cases to handle for a PermMatrix. nargout = std::min (nargout, 5); octave_value_list retval ((nargout == 0 ? 1 : nargout), Matrix ()); octave_idx_type nr = v.rows (); octave_idx_type nc = v.cols (); octave_idx_type start_nc, count; // Determine the range to search. if (n_to_find < 0 || n_to_find >= nc) { start_nc = 0; count = nc; } else if (direction > 0) { start_nc = 0; count = n_to_find; } else { start_nc = nc - n_to_find; count = n_to_find; } Matrix idx (count, 1); Matrix i_idx (count, 1); Matrix j_idx (count, 1); // Every value is 1. Array<double> val (dim_vector (count, 1), 1.0); if (count > 0) { const Array<octave_idx_type>& p = v.col_perm_vec (); for (octave_idx_type k = 0; k < count; k++) { octave_quit (); const octave_idx_type j = start_nc + k; const octave_idx_type i = p(j); i_idx(k) = static_cast<double> (1+i); j_idx(k) = static_cast<double> (1+j); idx(k) = j * nc + i + 1; } } else { // FIXME: Is this case even possible? A scalar permutation matrix seems // to devolve to a scalar full matrix, at least from the Octave command // line. Perhaps this function could be called internally from C++ with // such a matrix. // No items found. Fixup return dimensions for Matlab compatibility. // The behavior to match is documented in Array.cc (Array<T>::find). if ((nr == 0 && nc == 0) || (nr == 1 && nc == 1)) { idx.resize (0, 0); i_idx.resize (0, 0); j_idx.resize (0, 0); val.resize (dim_vector (0, 0)); } } switch (nargout) { case 0: case 1: retval(0) = idx; break; case 5: retval(4) = nc; OCTAVE_FALLTHROUGH; case 4: retval(3) = nc; OCTAVE_FALLTHROUGH; case 3: retval(2) = val; OCTAVE_FALLTHROUGH; case 2: retval(1) = j_idx; retval(0) = i_idx; } return retval; } DEFUN (find, args, nargout, doc: /* -*- texinfo -*- @deftypefn {} {@var{idx} =} find (@var{x}) @deftypefnx {} {@var{idx} =} find (@var{x}, @var{n}) @deftypefnx {} {@var{idx} =} find (@var{x}, @var{n}, @var{direction}) @deftypefnx {} {[i, j] =} find (@dots{}) @deftypefnx {} {[i, j, v] =} find (@dots{}) Return a vector of indices of nonzero elements of a matrix, as a row if @var{x} is a row vector or as a column otherwise. To obtain a single index for each matrix element, Octave pretends that the columns of a matrix form one long vector (like Fortran arrays are stored). For example: @example @group find (eye (2)) @result{} [ 1; 4 ] @end group @end example If two inputs are given, @var{n} indicates the maximum number of elements to find from the beginning of the matrix or vector. If three inputs are given, @var{direction} should be one of @qcode{"first"} or @qcode{"last"}, requesting only the first or last @var{n} indices, respectively. However, the indices are always returned in ascending order. If two outputs are requested, @code{find} returns the row and column indices of nonzero elements of a matrix. For example: @example @group [i, j] = find (2 * eye (2)) @result{} i = [ 1; 2 ] @result{} j = [ 1; 2 ] @end group @end example If three outputs are requested, @code{find} also returns a vector containing the nonzero values. For example: @example @group [i, j, v] = find (3 * eye (2)) @result{} i = [ 1; 2 ] @result{} j = [ 1; 2 ] @result{} v = [ 3; 3 ] @end group @end example If @var{x} is a multi-dimensional array of size m x n x p x @dots{}, @var{j} contains the column locations as if @var{x} was flattened into a two-dimensional matrix of size m x (n + p + @dots{}). Note that this function is particularly useful for sparse matrices, as it extracts the nonzero elements as vectors, which can then be used to create the original matrix. For example: @example @group sz = size (a); [i, j, v] = find (a); b = sparse (i, j, v, sz(1), sz(2)); @end group @end example @seealso{nonzeros} @end deftypefn */) { int nargin = args.length (); if (nargin < 1 || nargin > 3) print_usage (); // Setup the default options. octave_idx_type n_to_find = -1; if (nargin > 1) { double val = args(1).xscalar_value ("find: N must be an integer"); if (val < 0 || (! math::isinf (val) && val != math::fix (val))) error ("find: N must be a non-negative integer"); else if (! math::isinf (val)) n_to_find = val; } // Direction to do the searching (1 == forward, -1 == reverse). int direction = 1; if (nargin > 2) { std::string s_arg = args(2).string_value (); if (s_arg == "first") direction = 1; else if (s_arg == "last") direction = -1; else error (R"(find: DIRECTION must be "first" or "last")"); } octave_value_list retval; octave_value arg = args(0); if (arg.islogical ()) { if (arg.issparse ()) { SparseBoolMatrix v = arg.sparse_bool_matrix_value (); retval = find_nonzero_elem_idx (v, nargout, n_to_find, direction); } else if (nargout <= 1 && n_to_find == -1 && direction == 1) { // This case is equivalent to extracting indices from a logical // matrix. Try to reuse the possibly cached index vector. // No need to catch index_exception, since arg is bool. // Out-of-range errors have already set pos, and will be // caught later. octave_value result = arg.index_vector ().unmask (); dim_vector dv = result.dims (); retval(0) = (dv.all_zero () || dv.isvector () ? result : result.reshape (dv.as_column ())); } else { boolNDArray v = arg.bool_array_value (); retval = find_nonzero_elem_idx (v, nargout, n_to_find, direction); } } else if (arg.isinteger ()) { #define DO_INT_BRANCH(INTT) \ else if (arg.is_ ## INTT ## _type ()) \ { \ INTT ## NDArray v = arg.INTT ## _array_value (); \ \ retval = find_nonzero_elem_idx (v, nargout, n_to_find, direction); \ } if (false) ; DO_INT_BRANCH (int8) DO_INT_BRANCH (int16) DO_INT_BRANCH (int32) DO_INT_BRANCH (int64) DO_INT_BRANCH (uint8) DO_INT_BRANCH (uint16) DO_INT_BRANCH (uint32) DO_INT_BRANCH (uint64) else panic_impossible (); } else if (arg.issparse ()) { if (arg.isreal ()) { SparseMatrix v = arg.sparse_matrix_value (); retval = find_nonzero_elem_idx (v, nargout, n_to_find, direction); } else if (arg.iscomplex ()) { SparseComplexMatrix v = arg.sparse_complex_matrix_value (); retval = find_nonzero_elem_idx (v, nargout, n_to_find, direction); } else err_wrong_type_arg ("find", arg); } else if (arg.is_perm_matrix ()) { PermMatrix P = arg.perm_matrix_value (); retval = find_nonzero_elem_idx (P, nargout, n_to_find, direction); } else if (arg.is_string ()) { charNDArray chnda = arg.char_array_value (); retval = find_nonzero_elem_idx (chnda, nargout, n_to_find, direction); } else if (arg.is_single_type ()) { if (arg.isreal ()) { FloatNDArray nda = arg.float_array_value (); retval = find_nonzero_elem_idx (nda, nargout, n_to_find, direction); } else if (arg.iscomplex ()) { FloatComplexNDArray cnda = arg.float_complex_array_value (); retval = find_nonzero_elem_idx (cnda, nargout, n_to_find, direction); } } else if (arg.isreal ()) { NDArray nda = arg.array_value (); retval = find_nonzero_elem_idx (nda, nargout, n_to_find, direction); } else if (arg.iscomplex ()) { ComplexNDArray cnda = arg.complex_array_value (); retval = find_nonzero_elem_idx (cnda, nargout, n_to_find, direction); } else err_wrong_type_arg ("find", arg); return retval; } /* %!assert (find (char ([0, 97])), 2) %!assert (find ([1, 0, 1, 0, 1]), [1, 3, 5]) %!assert (find ([1; 0; 3; 0; 1]), [1; 3; 5]) %!assert (find ([0, 0, 2; 0, 3, 0; -1, 0, 0]), [3; 5; 7]) %!assert <*53603> (find (ones (1,1,2) > 0), [1;2]) %!assert <*53603> (find (ones (1,1,1,3) > 0), [1;2;3]) %!test %! [i, j, v] = find ([0, 0, 2; 0, 3, 0; -1, 0, 0]); %! %! assert (i, [3; 2; 1]); %! assert (j, [1; 2; 3]); %! assert (v, [-1; 3; 2]); %!assert (find (single ([1, 0, 1, 0, 1])), [1, 3, 5]) %!assert (find (single ([1; 0; 3; 0; 1])), [1; 3; 5]) %!assert (find (single ([0, 0, 2; 0, 3, 0; -1, 0, 0])), [3; 5; 7]) %!test %! [i, j, v] = find (single ([0, 0, 2; 0, 3, 0; -1, 0, 0])); %! %! assert (i, [3; 2; 1]); %! assert (j, [1; 2; 3]); %! assert (v, single ([-1; 3; 2])); %!test %! pcol = [5 1 4 3 2]; %! P = eye (5) (:, pcol); %! [i, j, v] = find (P); %! [ifull, jfull, vfull] = find (full (P)); %! assert (i, ifull); %! assert (j, jfull); %! assert (all (v == 1)); %!test %! prow = [5 1 4 3 2]; %! P = eye (5) (prow, :); %! [i, j, v] = find (P); %! [ifull, jfull, vfull] = find (full (P)); %! assert (i, ifull); %! assert (j, jfull); %! assert (all (v == 1)); %!test <*61986> %! P = cat (3, eye(3), eye(3)); %! loc = find (P); %! [i, j, v] = find(P); %! assert (loc, [1, 5, 9, 10, 14, 18]'); %! assert (i, [1, 2, 3, 1, 2, 3]'); %! assert (j, [1, 2, 3, 4, 5, 6]'); %! assert (v, [1, 1, 1, 1, 1, 1]'); %!assert <*53655> (find (false), zeros (0, 0)) %!assert <*53655> (find ([false, false]), zeros (1, 0)) %!assert <*53655> (find ([false; false]), zeros (0, 1)) %!assert <*53655> (find ([false, false; false, false]), zeros (0, 1)) %!assert (find ([2 0 1 0 5 0], 1), 1) %!assert (find ([2 0 1 0 5 0], 2, "last"), [3, 5]) %!assert (find ([2 0 1 0 5 0], Inf), [1, 3, 5]) %!assert (find ([2 0 1 0 5 0], Inf, "last"), [1, 3, 5]) %!error find () */ OCTAVE_END_NAMESPACE(octave)