|
2928
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
5307
|
19 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
20 02110-1301, USA. |
|
2928
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
4153
|
28 #include "quit.h" |
|
|
29 |
|
2928
|
30 #include "defun-dld.h" |
|
|
31 #include "error.h" |
|
|
32 #include "gripes.h" |
|
|
33 #include "oct-obj.h" |
|
|
34 |
|
6002
|
35 // Find at most N_TO_FIND nonzero elements in NDA. Search forward if |
|
|
36 // DIRECTION is 1, backward if it is -1. NARGOUT is the number of |
|
|
37 // output arguments. If N_TO_FIND is -1, find all nonzero elements. |
|
4678
|
38 |
|
|
39 template <typename T> |
|
|
40 octave_value_list |
|
6002
|
41 find_nonzero_elem_idx (const T& nda, int nargout, octave_idx_type n_to_find, |
|
|
42 int direction) |
|
4678
|
43 { |
|
6002
|
44 octave_value_list retval ((nargout == 0 ? 1 : nargout), Matrix ()); |
|
4678
|
45 |
|
5275
|
46 octave_idx_type count = 0; |
|
4678
|
47 |
|
5275
|
48 octave_idx_type nel = nda.nelem (); |
|
4678
|
49 |
|
6002
|
50 // Set the starting element to the correct value based on the |
|
|
51 // direction to search. |
|
|
52 octave_idx_type k = 0; |
|
|
53 if (direction == -1) |
|
|
54 k = nel - 1; |
|
|
55 |
|
|
56 // Search in the default range. |
|
|
57 octave_idx_type start_el = -1; |
|
|
58 octave_idx_type end_el = -1; |
|
|
59 |
|
|
60 // Search for the number of elements to return. |
|
|
61 while (k < nel && k > -1 && n_to_find != count) |
|
4678
|
62 { |
|
|
63 OCTAVE_QUIT; |
|
|
64 |
|
6002
|
65 if (nda(k) != 0.0) |
|
|
66 { |
|
|
67 end_el = k; |
|
|
68 if (start_el == -1) |
|
|
69 start_el = k; |
|
|
70 count++; |
|
|
71 } |
|
|
72 k = k + direction; |
|
4678
|
73 } |
|
|
74 |
|
6002
|
75 // Reverse the range if we're looking backward. |
|
|
76 if (direction == -1) |
|
|
77 { |
|
|
78 octave_idx_type tmp_el = start_el; |
|
|
79 start_el = end_el; |
|
|
80 end_el = tmp_el; |
|
|
81 } |
|
|
82 // Fix an off by one error. |
|
|
83 end_el++; |
|
|
84 |
|
4826
|
85 // If the original argument was a row vector, force a row vector of |
|
5130
|
86 // the overall indices to be returned. But see below for scalar |
|
|
87 // case... |
|
4678
|
88 |
|
5275
|
89 octave_idx_type result_nr = count; |
|
|
90 octave_idx_type result_nc = 1; |
|
4678
|
91 |
|
5130
|
92 bool scalar_arg = false; |
|
|
93 |
|
4826
|
94 if (nda.ndims () == 2 && nda.rows () == 1) |
|
|
95 { |
|
|
96 result_nr = 1; |
|
|
97 result_nc = count; |
|
5130
|
98 |
|
|
99 scalar_arg = (nda.columns () == 1); |
|
4826
|
100 } |
|
3418
|
101 |
|
4826
|
102 Matrix idx (result_nr, result_nc); |
|
4678
|
103 |
|
4826
|
104 Matrix i_idx (result_nr, result_nc); |
|
|
105 Matrix j_idx (result_nr, result_nc); |
|
4678
|
106 |
|
4826
|
107 T val (dim_vector (result_nr, result_nc)); |
|
|
108 |
|
|
109 if (count > 0) |
|
4678
|
110 { |
|
4826
|
111 count = 0; |
|
|
112 |
|
5275
|
113 octave_idx_type nr = nda.rows (); |
|
4678
|
114 |
|
5275
|
115 octave_idx_type i = 0; |
|
|
116 octave_idx_type j = 0; |
|
4826
|
117 |
|
6002
|
118 // Search for elements to return. Only search the region where |
|
|
119 // there are elements to be found using the count that we want |
|
|
120 // to find. |
|
6005
|
121 |
|
|
122 // For compatibility, all N-d arrays are handled as if they are |
|
|
123 // 2-d, with the number of columns equal to "prod (dims (2:end))". |
|
|
124 |
|
6002
|
125 for (k = start_el; k < end_el; k++) |
|
4678
|
126 { |
|
4826
|
127 OCTAVE_QUIT; |
|
4678
|
128 |
|
4826
|
129 if (nda(k) != 0.0) |
|
|
130 { |
|
|
131 idx(count) = k + 1; |
|
4678
|
132 |
|
6005
|
133 octave_idx_type xr = k % nr; |
|
|
134 i_idx(count) = xr + 1; |
|
|
135 j_idx(count) = (k - xr) / nr + 1; |
|
4678
|
136 |
|
4826
|
137 val(count) = nda(k); |
|
|
138 |
|
|
139 count++; |
|
|
140 } |
|
4678
|
141 |
|
4826
|
142 i++; |
|
4678
|
143 } |
|
|
144 } |
|
5130
|
145 else if (scalar_arg) |
|
5131
|
146 { |
|
|
147 idx.resize (0, 0); |
|
|
148 |
|
|
149 i_idx.resize (0, 0); |
|
|
150 j_idx.resize (0, 0); |
|
|
151 |
|
|
152 val.resize (dim_vector (0, 0)); |
|
|
153 } |
|
2928
|
154 |
|
|
155 switch (nargout) |
|
|
156 { |
|
|
157 case 0: |
|
|
158 case 1: |
|
4826
|
159 retval(0) = idx; |
|
2928
|
160 break; |
|
|
161 |
|
|
162 case 3: |
|
|
163 retval(2) = val; |
|
|
164 // Fall through! |
|
|
165 |
|
|
166 case 2: |
|
3418
|
167 retval(1) = j_idx; |
|
|
168 retval(0) = i_idx; |
|
2928
|
169 break; |
|
|
170 |
|
|
171 default: |
|
|
172 panic_impossible (); |
|
|
173 break; |
|
|
174 } |
|
|
175 |
|
|
176 return retval; |
|
|
177 } |
|
|
178 |
|
6002
|
179 template octave_value_list find_nonzero_elem_idx (const NDArray&, int, |
|
|
180 octave_idx_type, int); |
|
2928
|
181 |
|
6002
|
182 template octave_value_list find_nonzero_elem_idx (const ComplexNDArray&, int, |
|
|
183 octave_idx_type, int); |
|
2928
|
184 |
|
|
185 DEFUN_DLD (find, args, nargout, |
|
3369
|
186 "-*- texinfo -*-\n\ |
|
|
187 @deftypefn {Loadable Function} {} find (@var{x})\n\ |
|
6002
|
188 @deftypefnx {Loadable Function} {} find (@var{x}, @var{n})\n\ |
|
|
189 @deftypefnx {Loadable Function} {} find (@var{x}, @var{n}, @var{direction})\n\ |
|
3369
|
190 Return a vector of indices of nonzero elements of a matrix. To obtain a\n\ |
|
|
191 single index for each matrix element, Octave pretends that the columns\n\ |
|
|
192 of a matrix form one long vector (like Fortran arrays are stored). For\n\ |
|
|
193 example,\n\ |
|
|
194 \n\ |
|
|
195 @example\n\ |
|
|
196 @group\n\ |
|
|
197 find (eye (2))\n\ |
|
|
198 @result{} [ 1; 4 ]\n\ |
|
|
199 @end group\n\ |
|
|
200 @end example\n\ |
|
|
201 \n\ |
|
|
202 If two outputs are requested, @code{find} returns the row and column\n\ |
|
|
203 indices of nonzero elements of a matrix. For example,\n\ |
|
|
204 \n\ |
|
|
205 @example\n\ |
|
|
206 @group\n\ |
|
|
207 [i, j] = find (2 * eye (2))\n\ |
|
|
208 @result{} i = [ 1; 2 ]\n\ |
|
|
209 @result{} j = [ 1; 2 ]\n\ |
|
|
210 @end group\n\ |
|
|
211 @end example\n\ |
|
|
212 \n\ |
|
|
213 If three outputs are requested, @code{find} also returns a vector\n\ |
|
|
214 containing the nonzero values. For example,\n\ |
|
|
215 \n\ |
|
|
216 @example\n\ |
|
|
217 @group\n\ |
|
|
218 [i, j, v] = find (3 * eye (2))\n\ |
|
|
219 @result{} i = [ 1; 2 ]\n\ |
|
|
220 @result{} j = [ 1; 2 ]\n\ |
|
|
221 @result{} v = [ 3; 3 ]\n\ |
|
|
222 @end group\n\ |
|
|
223 @end example\n\ |
|
6002
|
224 \n\ |
|
|
225 If two inputs are given, @var{n} indicates the number of elements to\n\ |
|
|
226 find from the beginning of the matrix or vector.\n\ |
|
|
227 \n\ |
|
|
228 If three inputs are given, @var{direction} should be one of \"first\" or\n\ |
|
|
229 \"last\" indicating that it should start counting found elements from the\n\ |
|
|
230 first or last element.\n\ |
|
3369
|
231 @end deftypefn") |
|
2928
|
232 { |
|
|
233 octave_value_list retval; |
|
|
234 |
|
|
235 int nargin = args.length (); |
|
|
236 |
|
6002
|
237 if (nargin > 3 || nargin < 1) |
|
2928
|
238 { |
|
5823
|
239 print_usage (); |
|
2928
|
240 return retval; |
|
|
241 } |
|
|
242 |
|
6002
|
243 // Setup the default options. |
|
|
244 octave_idx_type n_to_find = -1; |
|
|
245 if (nargin > 1) |
|
|
246 { |
|
|
247 n_to_find = args(1).int_value (); |
|
|
248 if (error_state) |
|
|
249 { |
|
|
250 error ("find: expecting second argument to be an integer"); |
|
|
251 return retval; |
|
|
252 } |
|
|
253 } |
|
|
254 |
|
|
255 // Direction to do the searching (1 == forward, -1 == reverse). |
|
|
256 int direction = 1; |
|
|
257 if (nargin > 2) |
|
|
258 { |
|
|
259 direction = 0; |
|
|
260 |
|
|
261 std::string s_arg = args(2).string_value (); |
|
|
262 |
|
|
263 if (! error_state) |
|
|
264 { |
|
|
265 if (s_arg == "first") |
|
|
266 direction = 1; |
|
|
267 else if (s_arg == "last") |
|
|
268 direction = -1; |
|
|
269 } |
|
|
270 |
|
|
271 if (direction == 0) |
|
|
272 { |
|
|
273 error ("find: expecting third argument to be \"first\" or \"last\""); |
|
|
274 return retval; |
|
|
275 } |
|
|
276 } |
|
|
277 |
|
2928
|
278 octave_value arg = args(0); |
|
|
279 |
|
|
280 if (arg.is_real_type ()) |
|
|
281 { |
|
4678
|
282 NDArray nda = arg.array_value (); |
|
2928
|
283 |
|
|
284 if (! error_state) |
|
6002
|
285 retval = find_nonzero_elem_idx (nda, nargout, n_to_find, direction); |
|
2928
|
286 } |
|
|
287 else if (arg.is_complex_type ()) |
|
|
288 { |
|
4678
|
289 ComplexNDArray cnda = arg.complex_array_value (); |
|
2928
|
290 |
|
|
291 if (! error_state) |
|
6002
|
292 retval = find_nonzero_elem_idx (cnda, nargout, n_to_find, direction); |
|
2928
|
293 } |
|
5107
|
294 else if (arg.is_string ()) |
|
|
295 { |
|
|
296 charNDArray cnda = arg.char_array_value (); |
|
|
297 |
|
|
298 if (! error_state) |
|
6002
|
299 retval = find_nonzero_elem_idx (cnda, nargout, n_to_find, direction); |
|
5107
|
300 } |
|
2928
|
301 else |
|
|
302 { |
|
|
303 gripe_wrong_type_arg ("find", arg); |
|
|
304 } |
|
|
305 |
|
|
306 return retval; |
|
|
307 } |
|
|
308 |
|
|
309 /* |
|
|
310 ;;; Local Variables: *** |
|
|
311 ;;; mode: C++ *** |
|
|
312 ;;; End: *** |
|
|
313 */ |
