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
|
## Copyright (C) 1994-2013 John W. Eaton
## Copyright (C) 2008-2009 Jaroslav Hajek
##
## 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} {} union (@var{a}, @var{b})
## @deftypefnx {Function File} {} union (@var{a}, @var{b}, "rows")
## @deftypefnx {Function File} {[@var{c}, @var{ia}, @var{ib}] =} union (@var{a}, @var{b})
##
## Return the set of elements that are in either of the sets @var{a} and
## @var{b}. @var{a}, @var{b} may be cell arrays of strings.
## For example:
##
## @example
## @group
## union ([1, 2, 4], [2, 3, 5])
## @result{} [1, 2, 3, 4, 5]
## @end group
## @end example
##
## If the optional third input argument is the string @qcode{"rows"} then
## each row of the matrices @var{a} and @var{b} will be considered as a
## single set element. For example:
##
## @example
## @group
## union ([1, 2; 2, 3], [1, 2; 3, 4], "rows")
## @result{} 1 2
## 2 3
## 3 4
## @end group
## @end example
##
## The optional outputs @var{ia} and @var{ib} are index vectors such that
## @code{a(ia)} and @code{b(ib)} are disjoint sets whose union is @var{c}.
##
## @seealso{intersect, setdiff, unique}
## @end deftypefn
## Author: jwe
function [y, ia, ib] = union (a, b, varargin)
if (nargin < 2 || nargin > 3)
print_usage ();
endif
[a, b] = validargs ("union", a, b, varargin{:});
if (nargin == 2)
y = [a(:); b(:)];
na = numel (a); nb = numel (b);
if (rows (a) == 1 || rows (b) == 1)
y = y.';
endif
else
y = [a; b];
na = rows (a); nb = rows (b);
endif
if (nargout == 1)
y = unique (y, varargin{:});
else
[y, i] = unique (y, varargin{:});
ia = i(i <= na);
ib = i(i > na) - na;
endif
endfunction
%!assert (union ([1, 2, 4], [2, 3, 5]), [1, 2, 3, 4, 5]);
%!assert (union ([1; 2; 4], [2, 3, 5]), [1, 2, 3, 4, 5]);
%!assert (union ([1, 2, 3], [5; 7; 9]), [1, 2, 3, 5, 7, 9]);
%!test
%! a = [3, 1, 4, 1, 5]; b = [1, 2, 3, 4];
%! [y, ia, ib] = union (a, b.');
%! assert (y, [1, 2, 3, 4, 5]);
%! assert (y, sort ([a(ia), b(ib)]));
%!error union (1)
%!error union (1, 2, 3)
|
