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
|
function C = reduce (arg1, arg2, arg3, arg4, arg5)
%GRB.REDUCE reduce a matrix to a scalar.
%
% c = GrB.reduce (monoid, A)
% c = GrB.reduce (monoid, A, desc)
% c = GrB.reduce (cin, accum, monoid, A)
% c = GrB.reduce (cin, accum, monoid, A, desc)
%
% GrB.reduce reduces a matrix to a scalar, using the given monoid:
%
% Monoids for real non-logical types: '+', '*', 'max', 'min', 'any'
% For logical: '|', '&', 'xor', 'eq', 'any'
% For complex types: '+', '*', 'any'
% For integer types: 'bitor', 'bitand', 'bitxor', 'bitxnor'
%
% See 'help GrB.monoidinfo' for more details on the available monoids.
%
% The monoid and A arguments are required. All others are optional. The
% op is applied to all entries of the matrix A to reduce them to a single
% scalar result.
%
% accum: an optional binary operator (see 'help GrB.binopinfo').
%
% cin: an optional input scalar into which the result can be accumulated
% with c = accum (cin, result).
%
% See also GrB.vreduce, GrB/sum, GrB/prod, GrB/max, GrB/min.
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
if (isobject (arg1))
arg1 = arg1.opaque ;
end
if (isobject (arg2))
arg2 = arg2.opaque ;
end
if (nargin > 2 && isobject (arg3))
arg3 = arg3.opaque ;
end
if (nargin > 3 && isobject (arg4))
arg4 = arg4.opaque ;
end
switch (nargin)
case 2
[C, k] = gbreduce (arg1, arg2) ;
case 3
[C, k] = gbreduce (arg1, arg2, arg3) ;
case 4
[C, k] = gbreduce (arg1, arg2, arg3, arg4) ;
case 5
[C, k] = gbreduce (arg1, arg2, arg3, arg4, arg5) ;
end
if (k == 0)
C = GrB (C) ;
end
|
