1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2009-2021 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 "Array-util.h"
#include "oct-locbuf.h"
#include "quit.h"
#include "defun.h"
#include "error.h"
#include "errwarn.h"
#include "ovl.h"
static dim_vector
get_dim_vector (const octave_value& val, const char *name)
{
RowVector dimsv = val.row_vector_value (false, true);
dim_vector dv;
octave_idx_type n = dimsv.numel ();
if (n < 1)
error ("%s: dimension vector DIMS must not be empty", name);
dv.resize (std::max (n, static_cast<octave_idx_type> (2)));
dv(1) = 1;
for (octave_idx_type i = 0; i < n; i++)
{
octave_idx_type ii = dimsv(i);
if (ii == dimsv(i) && ii >= 0)
dv(i) = ii;
else
error ("%s: dimension vector DIMS must contain integers", name);
}
return dv;
}
DEFUN (sub2ind, args, ,
doc: /* -*- texinfo -*-
@deftypefn {} {@var{ind} =} sub2ind (@var{dims}, @var{i}, @var{j})
@deftypefnx {} {@var{ind} =} sub2ind (@var{dims}, @var{s1}, @var{s2}, @dots{}, @var{sN})
Convert subscripts to linear indices.
The input @var{dims} is a dimension vector where each element is the size of
the array in the respective dimension (@pxref{XREFsize,,size}). The remaining
inputs are scalars or vectors of subscripts to be converted.
The output vector @var{ind} contains the converted linear indices.
Background: Array elements can be specified either by a linear index which
starts at 1 and runs through the number of elements in the array, or they may
be specified with subscripts for the row, column, page, etc. The functions
@code{ind2sub} and @code{sub2ind} interconvert between the two forms.
The linear index traverses dimension 1 (rows), then dimension 2 (columns), then
dimension 3 (pages), etc.@: until it has numbered all of the elements.
Consider the following 3-by-3 matrices:
@example
@group
[(1,1), (1,2), (1,3)] [1, 4, 7]
[(2,1), (2,2), (2,3)] ==> [2, 5, 8]
[(3,1), (3,2), (3,3)] [3, 6, 9]
@end group
@end example
@noindent
The left matrix contains the subscript tuples for each matrix element. The
right matrix shows the linear indices for the same matrix.
The following example shows how to convert the two-dimensional indices
@code{(2,1)} and @code{(2,3)} of a 3-by-3 matrix to linear indices with a
single call to @code{sub2ind}.
@example
@group
s1 = [2, 2];
s2 = [1, 3];
ind = sub2ind ([3, 3], s1, s2)
@result{} ind = 2 8
@end group
@end example
@seealso{ind2sub, size}
@end deftypefn */)
{
int nargin = args.length ();
if (nargin < 2)
print_usage ();
dim_vector dv = get_dim_vector (args(0), "sub2ind");
Array<idx_vector> idxa (dim_vector (nargin-1, 1));
for (int j = 0; j < nargin - 1; j++)
{
if (! args(j+1).isnumeric ())
error ("sub2ind: subscripts must be numeric");
try
{
idxa(j) = args(j+1).index_vector ();
if (j > 0 && args(j+1).dims () != args(1).dims ())
error ("sub2ind: all subscripts must be of the same size");
}
catch (octave::index_exception& e)
{
e.set_pos_if_unset (nargin-1, j+1);
e.set_var ();
std::string msg = e.message ();
error_with_id (e.err_id (), "%s", msg.c_str ());
}
}
return ovl (sub2ind (dv, idxa));
}
/*
## Test evaluation
%!test
%! s1 = [ 1 1 1 1 ; 2 2 2 2 ];
%! s2 = [ 1 1 2 2 ; 1 1 2 2 ];
%! s3 = [ 1 2 1 2 ; 1 2 1 2 ];
%! in = [ 1 101 11 111 ; 2 102 12 112 ];
%! assert (sub2ind ([10 10 10], s1, s2, s3), in);
# Test low index
%!assert (sub2ind ([10 10 10], 1, 1, 1), 1)
%!error <index \(0,_,_\)> sub2ind ([10 10 10], 0, 1, 1)
%!error <index \(_,0,_\)> sub2ind ([10 10 10], 1, 0, 1)
%!error <index \(_,_,0\)> sub2ind ([10 10 10], 1, 1, 0)
# Test high index
%!assert (sub2ind ([10 10 10], 10, 10, 10), 1000)
%!error <index \(11,_,_\): out of bound 10> sub2ind ([10 10 10], 11, 10, 10)
%!error <index \(_,11,_\): out of bound 10> sub2ind ([10 10 10], 10, 11, 10)
%!error <index \(_,_,11\): out of bound 10> sub2ind ([10 10 10], 10, 10, 11)
# Test high index in the trailing dimensions
%!assert (sub2ind ([10, 1], 2, 1, 1), 2)
%!error <index \(_,2,_\): out of bound 1> sub2ind ([10, 1], 1, 2, 1)
%!error <index \(_,_,2\): out of bound 1> sub2ind ([10, 1], 1, 1, 2)
%!assert (sub2ind ([10 10], 2, 2, 1), 12)
%!error <index \(_,_,2\): out of bound 1> sub2ind ([10 10], 2, 1, 2)
%!error <index \(_,_,2\): out of bound 1> sub2ind ([10 10], 1, 2, 2)
# Test handling of empty arguments
%!assert (sub2ind ([10 10], zeros (0,0), zeros (0,0)), zeros (0,0))
%!assert (sub2ind ([10 10], zeros (2,0), zeros (2,0)), zeros (2,0))
%!assert (sub2ind ([10 10], zeros (0,2), zeros (0,2)), zeros (0,2))
%!error <all subscripts .* same size> sub2ind ([10 10 10], zeros (0,2), zeros (2,0))
# Test handling of arguments of different size
%!error <all subscripts .* same size> sub2ind ([10 10], ones (1,2), ones (1,3))
%!error <all subscripts .* same size> sub2ind ([10 10], ones (1,2), ones (2,1))
## Test input validation
%!error <dimension vector> sub2ind ([10 10.5], 1, 1)
%!error <index \(1.5,_\)> sub2ind ([10 10], 1.5, 1)
%!error <index \(_,1.5\)> sub2ind ([10 10], 1, 1.5)
*/
DEFUN (ind2sub, args, nargout,
doc: /* -*- texinfo -*-
@deftypefn {} {[@var{s1}, @var{s2}, @dots{}, @var{sN}] =} ind2sub (@var{dims}, @var{ind})
Convert linear indices to subscripts.
The input @var{dims} is a dimension vector where each element is the size of
the array in the respective dimension (@pxref{XREFsize,,size}). The second
input @var{ind} contains linear indies to be converted.
The outputs @var{s1}, @dots{}, @var{sN} contain the converted subscripts.
Background: Array elements can be specified either by a linear index which
starts at 1 and runs through the number of elements in the array, or they may
be specified with subscripts for the row, column, page, etc. The functions
@code{ind2sub} and @code{sub2ind} interconvert between the two forms.
The linear index traverses dimension 1 (rows), then dimension 2 (columns), then
dimension 3 (pages), etc.@: until it has numbered all of the elements.
Consider the following 3-by-3 matrices:
@example
@group
[1, 4, 7] [(1,1), (1,2), (1,3)]
[2, 5, 8] ==> [(2,1), (2,2), (2,3)]
[3, 6, 9] [(3,1), (3,2), (3,3)]
@end group
@end example
@noindent
The left matrix contains the linear indices for each matrix element. The right
matrix shows the subscript tuples for the same matrix.
The following example shows how to convert the two-dimensional indices
@code{(2,1)} and @code{(2,3)} of a 3-by-3 matrix to linear indices with a
single call to @code{sub2ind}.
The following example shows how to convert the linear indices @code{2} and
@code{8} in a 3-by-3 matrix into subscripts.
@example
@group
ind = [2, 8];
[r, c] = ind2sub ([3, 3], ind)
@result{} r = 2 2
@result{} c = 1 3
@end group
@end example
If the number of output subscripts exceeds the number of dimensions, the
exceeded dimensions are set to @code{1}. On the other hand, if fewer
subscripts than dimensions are provided, the exceeding dimensions are merged
into the final requested dimension. For clarity, consider the following
examples:
@example
@group
ind = [2, 8];
dims = [3, 3];
## same as dims = [3, 3, 1]
[r, c, s] = ind2sub (dims, ind)
@result{} r = 2 2
@result{} c = 1 3
@result{} s = 1 1
## same as dims = [9]
r = ind2sub (dims, ind)
@result{} r = 2 8
@end group
@end example
@seealso{ind2sub, size}
@end deftypefn */)
{
if (args.length () != 2)
print_usage ();
octave_value_list retval;
// Redimension to provided number of subscripts.
dim_vector dv = get_dim_vector (args(0), "ind2sub").redim (nargout);
try
{
retval = Array<octave_value> (ind2sub (dv, args(1).index_vector ()));
}
catch (const octave::index_exception& e)
{
error ("ind2sub: invalid index %s", e.what ());
}
return retval;
}
/*
## Examples
%!test
%! [r, c] = ind2sub ([3, 3], [2, 8]);
%! assert (r, [2, 2]);
%! assert (c, [1, 3]);
%!test
%! [r, c, s] = ind2sub ([3, 3], [2, 8]);
%! assert (r, [2, 2]);
%! assert (c, [1, 3]);
%! assert (s, [1, 1]);
%! [r, c, s] = ind2sub ([3, 3, 1], [2, 8]);
%! assert (r, [2, 2]);
%! assert (c, [1, 3]);
%! assert (s, [1, 1]);
%!test
%! r = ind2sub ([3, 3], [2, 8]);
%! assert (r, [2, 8]);
%! r = ind2sub (9, [2, 8]);
%! assert (r, [2, 8]);
## 3-dimensional test
%!test
%! [r, c, s] = ind2sub ([2, 2, 2], 1:8);
%! assert (r, [1, 2, 1, 2, 1, 2, 1, 2]);
%! assert (c, [1, 1, 2, 2, 1, 1, 2, 2]);
%! assert (s, [1, 1, 1, 1, 2, 2, 2, 2]);
%! [r, c] = ind2sub ([2, 2, 2], 1:8);
%! assert (r, [1, 2, 1, 2, 1, 2, 1, 2]);
%! assert (c, [1, 1, 2, 2, 3, 3, 4, 4]);
%! r = ind2sub ([2, 2, 2], 1:8);
%! assert (r, 1:8);
%!error <DIMS must contain integers> ind2sub ([2, -2], 3);
%!error <index out of range> ind2sub ([2, 2, 2], 1:9);
%!error <invalid index> ind2sub ([2, 2, 2], -1:8);
*/
|