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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
function gbtest22
%GBTEST22 test reduce to scalar
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
rng ('default') ;
desc.kind = 'sparse' ;
A = magic (3) ;
types = gbtest_types ;
for k = 1:length (types)
type = types {k} ;
if (isequal (type, 'logical'))
c = false ;
c = GrB.reduce (c, '|', '|', gbtest_cast (A, 'logical')) ; %#ok<*NASGU>
else
% c = ones (1, 1, type) ;
is_double_complex = isequal (type, 'double complex') ;
is_single_complex = isequal (type, 'single complex') ;
if (is_double_complex)
c = complex (ones (1, 1)) ;
elseif (is_single_complex)
c = complex (ones (1, 1, 'single')) ;
else
c = ones (1, 1, type) ;
end
c = GrB.reduce (c, '+', '+', gbtest_cast (A, type)) ;
assert (c == sum (sum (A)) + 1) ;
end
end
for trial = 1:10
fprintf ('.') ;
for m = 0:5
for n = 0:5
A = 100 * sprand (m, n, 0.5) ;
G = GrB (A) ;
[i, j, x] = find (A) ; %#ok<*ASGLU>
% c1 = sum (A, 'all') ;
c1 = sum (sum (A)) ;
c2 = GrB.reduce ('+', A) ;
c3 = sum (G, 'all') ;
c4 = GrB.reduce ('+', A, desc) ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
assert (norm (c1-c3,1) <= 1e-12 * norm (c1,1)) ;
assert (norm (c1-c4,1) <= 1e-12 * norm (c1,1)) ;
assert (isequal (class (c4), 'double')) ;
% c1 = pi + sum (A, 'all') ;
c1 = pi + sum (sum (A)) ;
c2 = GrB.reduce (pi, '+', '+', A) ;
c3 = pi + sum (G, 'all') ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
assert (norm (c1-c3,1) <= 1e-12 * norm (c1,1)) ;
% c1 = prod (x, 'all') ;
if (isempty (x))
c1 = sparse (0) ;
else
c1 = prod (x) ;
end
c2 = GrB.reduce ('*', A) ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
% c1 = prod (A, 'all') ;
if (nnz (A) == 0)
c1 = sparse (0) ;
else
c1 = prod (prod (A)) ;
end
c2 = prod (G, 'all') ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
% c1 = pi + prod (x, 'all') ;
if (nnz (A) == 0)
c1 = pi ;
else
c1 = pi + prod (x) ;
end
c2 = GrB.reduce (pi, '+', '*', A) ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
% c1 = max (A, [ ], 'all') ;
c1 = max (max (A)) ;
c2 = GrB.reduce ('max', A) ;
if (nnz (A) < m*n)
c2 = max (full (c2), 0) ;
end
c3 = max (G, [ ], 'all') ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
assert (norm (c1-c3,1) <= 1e-12 * norm (c1,1)) ;
% c1 = min (A, [ ], 'all') ;
c1 = min (min (A)) ;
c2 = GrB.reduce ('min', A) ;
if (nnz (A) < m*n)
c2 = min (full (c2), 0) ;
end
c3 = min (G, [ ], 'all') ;
assert (norm (c1-c2,1) <= 1e-12 * norm (c1,1)) ;
assert (norm (c1-c3,1) <= 1e-12 * norm (c1,1)) ;
B = logical (A) ;
G = GrB (B) ;
% c1 = any (A, 'all') ;
c1 = any (any (A)) ;
c2 = GrB.reduce ('|.logical', A) ;
c3 = any (G, 'all') ;
assert (c1 == logical (c2)) ;
assert (c1 == logical (c3)) ;
% c1 = all (A, 'all') ;
if (isempty (A))
c1 = sparse (false) ;
else
c1 = all (all (A)) ;
end
c3 = all (G, 'all') ;
assert (c1 == logical (c3)) ;
[i, j, x] = find (A) ;
% c1 = all (x, 'all') ;
if (isempty (x))
c1 = 0 ;
else
c1 = all (x) ;
end
c2 = GrB.reduce ('&.logical', A) ;
assert (c1 == logical (c2)) ;
end
end
end
fprintf ('\ngbtest22: all tests passed\n') ;
|
