|
5178
|
1 ## Copyright (C) 2000 Paul Kienzle |
|
|
2 ## |
|
5181
|
3 ## This file is part of Octave. |
|
5178
|
4 ## |
|
5181
|
5 ## Octave is free software; you can redistribute it and/or modify it |
|
|
6 ## under the terms of the GNU General Public License as published by |
|
|
7 ## the Free Software Foundation; either version 2, or (at your option) |
|
|
8 ## any later version. |
|
|
9 ## |
|
|
10 ## Octave is distributed in the hope that it will be useful, but |
|
|
11 ## WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
12 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
|
|
13 ## General Public License for more details. |
|
5178
|
14 ## |
|
|
15 ## You should have received a copy of the GNU General Public License |
|
5181
|
16 ## along with Octave; see the file COPYING. If not, write to the Free |
|
5307
|
17 ## Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
18 ## 02110-1301, USA. |
|
5178
|
19 |
|
|
20 ## -*- texinfo -*- |
|
5182
|
21 ## @deftypefn {Function File} {} ismember (@var{A}, @var{S}) |
|
5178
|
22 ## Return a matrix the same shape as @var{A} which has 1 if |
|
|
23 ## @code{A(i,j)} is in @var{S} or 0 if it isn't. |
|
5642
|
24 ## @seealso{unique, union, intersection, setxor, setdiff} |
|
5178
|
25 ## @end deftypefn |
|
|
26 |
|
5181
|
27 ## Author: Paul Kienzle |
|
|
28 ## Adapted-by: jwe |
|
|
29 |
|
|
30 function c = ismember (a, S) |
|
|
31 |
|
|
32 if (nargin != 2) |
|
6046
|
33 print_usage (); |
|
5178
|
34 endif |
|
|
35 |
|
5181
|
36 [ra, ca] = size (a); |
|
|
37 if (isempty (a) || isempty (S)) |
|
|
38 c = zeros (ra, ca); |
|
5178
|
39 else |
|
5205
|
40 if (iscell (a) && ! iscell (S)) |
|
|
41 tmp{1} = S; |
|
|
42 S = tmp; |
|
|
43 endif |
|
|
44 if (! iscell (a) && iscell (S)) |
|
|
45 tmp{1} = a; |
|
|
46 a = tmp; |
|
|
47 endif |
|
5181
|
48 S = unique (S(:)); |
|
|
49 lt = length (S); |
|
|
50 if (lt == 1) |
|
5205
|
51 if (iscell (a) || iscell (S)) |
|
|
52 c = cellfun ("length", a) == cellfun ("length", S); |
|
|
53 idx = find (c); |
|
|
54 c(idx) = all (char (a(idx)) == repmat (char (S), length (idx), 1), 2); |
|
|
55 else |
|
|
56 c = (a == S); |
|
|
57 endif |
|
|
58 elseif (prod (size (a)) == 1) |
|
|
59 if (iscell (a) || iscell (S)) |
|
|
60 c = cellfun ("length", a) == cellfun ("length", S); |
|
|
61 idx = find (c); |
|
|
62 c(idx) = all (repmat (char (a), length (idx), 1) == char (S(idx)), 2); |
|
|
63 c = any(c); |
|
|
64 else |
|
|
65 c = any (a == S); |
|
|
66 endif |
|
5178
|
67 else |
|
5181
|
68 ## Magic: the following code determines for each a, the index i |
|
5178
|
69 ## such that S(i)<= a < S(i+1). It does this by sorting the a |
|
|
70 ## into S and remembering the source index where each element came |
|
|
71 ## from. Since all the a's originally came after all the S's, if |
|
|
72 ## the source index is less than the length of S, then the element |
|
|
73 ## came from S. We can then do a cumulative sum on the indices to |
|
|
74 ## figure out which element of S each a comes after. |
|
|
75 ## E.g., S=[2 4 6], a=[1 2 3 4 5 6 7] |
|
|
76 ## unsorted [S a] = [ 2 4 6 1 2 3 4 5 6 7 ] |
|
|
77 ## sorted [ S a ] = [ 1 2 2 3 4 4 5 6 6 7 ] |
|
|
78 ## source index p = [ 4 1 5 6 2 7 8 3 9 10 ] |
|
|
79 ## boolean p<=l(S) = [ 0 1 0 0 1 0 0 1 0 0 ] |
|
|
80 ## cumsum(p<=l(S)) = [ 0 1 1 1 2 2 2 3 3 3 ] |
|
|
81 ## Note that this leaves a(1) coming after S(0) which doesn't |
|
|
82 ## exist. So arbitrarily, we will dump all elements less than |
|
|
83 ## S(1) into the interval after S(1). We do this by dropping S(1) |
|
|
84 ## from the sort! E.g., S=[2 4 6], a=[1 2 3 4 5 6 7] |
|
|
85 ## unsorted [S(2:3) a] =[4 6 1 2 3 4 5 6 7 ] |
|
|
86 ## sorted [S(2:3) a] = [ 1 2 3 4 4 5 6 6 7 ] |
|
|
87 ## source index p = [ 3 4 5 1 6 7 2 8 9 ] |
|
|
88 ## boolean p<=l(S)-1 = [ 0 0 0 1 0 0 1 0 0 ] |
|
|
89 ## cumsum(p<=l(S)-1) = [ 0 0 0 1 1 1 2 2 2 ] |
|
|
90 ## Now we can use Octave's lvalue indexing to "invert" the sort, |
|
|
91 ## and assign all these indices back to the appropriate A and S, |
|
|
92 ## giving S_idx = [ -- 1 2], a_idx = [ 0 0 0 1 1 2 2 ]. Add 1 to |
|
|
93 ## a_idx, and we know which interval S(i) contains a. It is |
|
|
94 ## easy to now check membership by comparing S(a_idx) == a. This |
|
|
95 ## magic works because S starts out sorted, and because sort |
|
|
96 ## preserves the relative order of identical elements. |
|
5181
|
97 [v, p] = sort ([S(2:lt); a(:)]); |
|
5178
|
98 idx(p) = cumsum (p <= lt-1) + 1; |
|
5181
|
99 idx = idx(lt:lt+ra*ca-1); |
|
5205
|
100 if (iscell (a) || iscell (S)) |
|
|
101 c = (cellfun ("length", a) |
|
|
102 == reshape (cellfun ("length", S(idx)), size (a))); |
|
|
103 idx2 = find (c); |
|
|
104 c(idx2) = all (char (a(idx2)) == char (S(idx)(idx2)), 2); |
|
|
105 else |
|
|
106 c = (a == reshape (S (idx), size (a))); |
|
|
107 endif |
|
5178
|
108 endif |
|
|
109 endif |
|
5181
|
110 |
|
5178
|
111 endfunction |
|
5435
|
112 |
