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
|
function gbtest23
%GBTEST23 test min and max
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
rng ('default') ;
for trial = 1:10
fprintf ('.') ;
for m = 1:5
for n = 1:5
MA = sprand (m, n, 0.5) ;
S = -(sprand (m, n, 0.5) > 0.5) ;
MA = MA .* S ;
MB = sprand (m, n, 0.5) ;
S = -(sprand (m, n, 0.5) > 0.5) ;
MB = MB .* S ;
GA = GrB (MA) ;
GB = GrB (MB) ;
c1 = max (MA) ;
c2 = max (GA) ;
assert (gbtest_eq (c1, c2)) ;
c1 = min (MA) ;
c2 = min (GA) ;
assert (gbtest_eq (c1, c2)) ;
C1 = max (MA,MB) ;
C2 = max (MA,GB) ;
C3 = max (GA,MB) ;
C4 = max (GA,GB) ;
assert (gbtest_eq (C1, C2)) ;
assert (gbtest_eq (C1, C3)) ;
assert (gbtest_eq (C1, C4)) ;
C1 = min (MA,MB) ;
C2 = min (MA,GB) ;
C3 = min (GA,MB) ;
C4 = min (GA,GB) ;
assert (gbtest_eq (C1, C2)) ;
assert (gbtest_eq (C1, C3)) ;
assert (gbtest_eq (C1, C4)) ;
% c1 = max (MA, [ ], 'all') ;
c1 = max (max (MA)) ;
c2 = max (GA, [ ], 'all') ;
assert (gbtest_eq (c1, c2)) ;
% c1 = min (MA, [ ], 'all') ;
c1 = min (min (MA)) ;
c2 = min (GA, [ ], 'all') ;
assert (gbtest_eq (c1, c2)) ;
C1 = max (MA, [ ], 1) ;
C2 = max (GA, [ ], 1) ;
assert (gbtest_eq (C1, C2)) ;
C1 = min (MA, [ ], 1) ;
C2 = min (GA, [ ], 1) ;
assert (gbtest_eq (C1, C2)) ;
C1 = max (MA, [ ], 2) ;
C2 = max (GA, [ ], 2) ;
assert (gbtest_eq (C1, C2)) ;
C1 = min (MA, [ ], 2) ;
C2 = min (GA, [ ], 2) ;
assert (gbtest_eq (C1, C2)) ;
end
end
end
fprintf ('\ngbtest23: all tests passed\n') ;
|
