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
|
## Copyright (C) 2008-2013 Jaroslav Hajek
## Copyright (C) 2000, 2006-2007 Paul Kienzle
##
## 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
## <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @deftypefn {Function File} {} setxor (@var{a}, @var{b})
## @deftypefnx {Function File} {} setxor (@var{a}, @var{b}, "rows")
## @deftypefnx {Function File} {[@var{c}, @var{ia}, @var{ib}] =} setxor (@var{a}, @var{b})
##
## Return the elements exclusive to @var{a} or @var{b}, sorted in ascending
## order. If @var{a} and @var{b} are both column vectors return a column
## vector, otherwise return a row vector.
## @var{a}, @var{b} may be cell arrays of string(s).
##
## With three output arguments, return index vectors @var{ia} and @var{ib}
## such that @code{a(ia)} and @code{b(ib)} are disjoint sets whose union
## is @var{c}.
##
## @seealso{unique, union, intersect, setdiff, ismember}
## @end deftypefn
function [c, ia, ib] = setxor (a, b, varargin)
if (nargin < 2 || nargin > 3)
print_usage ();
endif
[a, b] = validargs ("setxor", a, b, varargin{:});
## Form A and B into sets.
if (nargout > 1)
[a, ia] = unique (a, varargin{:});
[b, ib] = unique (b, varargin{:});
else
a = unique (a, varargin{:});
b = unique (b, varargin{:});
endif
if (isempty (a))
c = b;
elseif (isempty (b))
c = a;
else
## Reject duplicates.
if (nargin > 2)
na = rows (a); nb = rows (b);
[c, i] = sortrows ([a; b]);
n = rows (c);
idx = find (all (c(1:n-1, :) == c(2:n, :), 2));
if (! isempty (idx))
c([idx, idx+1],:) = [];
i([idx, idx+1],:) = [];
endif
else
na = numel (a); nb = numel (b);
[c, i] = sort ([a(:); b(:)]);
n = length (c);
if (iscell (c))
idx = find (strcmp (c(1:n-1), c(2:n)));
else
idx = find (c(1:n-1) == c(2:n));
endif
if (! isempty (idx))
c([idx, idx+1]) = [];
i([idx, idx+1]) = [];
endif
if (rows (a) == 1 || rows (b) == 1)
c = c.';
endif
endif
endif
if (nargout > 1)
ia = ia(i(i <= na));
ib = ib(i(i > na) - na);
endif
endfunction
%!assert (setxor ([1,2,3],[2,3,4]),[1,4])
%!assert (setxor ({'a'}, {'a', 'b'}), {'b'})
%!test
%! a = [3, 1, 4, 1, 5]; b = [1, 2, 3, 4];
%! [c, ia, ib] = setxor (a, b.');
%! assert (c, [2, 5]);
%! assert (c, sort ([a(ia), b(ib)]));
%!test
%! a = [1 2; 4 5; 1 3]; b = [1 1; 1 2; 4 5; 2 10];
%! [c, ia, ib] = setxor (a, b, "rows");
%! assert (c, [1 1; 1 3; 2 10]);
%! assert (c, sortrows ([a(ia,:); b(ib,:)]));
|
