File: test284.m

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, trixie
  • size: 254,920 kB
  • sloc: ansic: 1,134,743; cpp: 46,133; makefile: 4,875; fortran: 2,087; java: 1,826; sh: 996; ruby: 725; python: 495; asm: 371; sed: 166; awk: 44
file content (129 lines) | stat: -rw-r--r-- 4,909 bytes parent folder | download | duplicates (2)
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
function test284
%TEST284 test GrB_mxm using indexop-based semirings

% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0

fprintf ('\ntest284: GrB_mxm with indexop-based semirings\n') ;

rng ('default') ;

n = 10 ;
A = GB_spec_random (n, n, 0.3, 100, 'double') ;
B = GB_spec_random (n, n, 0.3, 100, 'double') ;
D = speye (n) ;

% all variations:
adds = {'min', 'max', 'plus', 'times' } ;
mults = {'firsti', 'firsti1', 'firstj', 'firstj1', ...
         'secondi', 'secondi1', 'secondj', 'secondj1' } ;

% just a few:
adds = {'min', 'plus' } ;
mults = {'firsti1', 'secondi1', 'secondj' } ;

for A_is_csc = 0:1
    A.is_csc = A_is_csc ;

    for B_is_csc = 0:1
        B.is_csc = A_is_csc ;

        for C_is_csc = 0:1

            for A_sparsity = [1 2 4]
                if (A_sparsity == 0)
                    A.is_hyper = 0 ;
                    A.is_bitmap = 0 ;
                    A.sparsity = 2 ;    % sparse
                elseif (A_sparsity == 1)
                    A.is_hyper = 1 ;
                    A.is_bitmap = 0 ;
                    A.sparsity = 1 ;    % hypersparse
                else
                    A.is_hyper = 0 ;
                    A.is_bitmap = 1 ;
                    A.sparsity = 4 ;    % bitmap
                end

                for B_sparsity = [1 2 4]
                    if (B_sparsity == 0)
                        B.is_hyper = 0 ;
                        B.is_bitmap = 0 ;
                        B.sparsity = 2 ;    % sparse
                    elseif (B_sparsity == 1)
                        B.is_hyper = 1 ;
                        B.is_bitmap = 0 ;
                        B.sparsity = 1 ;    % hypersparse
                    else
                        B.is_hyper = 0 ;
                        B.is_bitmap = 1 ;
                        B.sparsity = 4 ;    % bitmap
                    end

                    for at = 0:1
                        for bt = 0:1
                            for method = [0 7081 7083 7084 7085]
                                % C = A*B, A'*B, A*B', or A'*B'
                                for k1 = 1:length (adds)
                                    add = adds {k1} ;
                                    for k2 = 1:length (mults)
                                        mult = mults {k2} ;
%                                       fprintf ('\n(%s,%s,%d,%d):\n', ...
%                                           add, mult, at, bt) ;
                                        C1 = GB_mex_AxB_idx (A, B, at, bt, ...
                                            method, C_is_csc, 1, add, mult) ;
                                        C2 = GB_mex_AxB_idx (A, B, at, bt, ...
                                            method, C_is_csc, 0, add, mult) ;
                                        GB_spec_compare (C1, C2) ;
                                    end
                                end
                            end
                            fprintf ('.') ;
                        end
                    end

                    for at = 0:1
                        % C = A*D, A'*D
                        for k1 = 1:length (adds)
                            add = adds {k1} ;
                            for k2 = 1:length (mults)
                                mult = mults {k2} ;
%                               fprintf ('\n(%s,%s,%d): D*B\n', ...
%                                   add, mult, at) ;
                                C1 = GB_mex_AxB_idx (A, D, at, 0, ...
                                    0, C_is_csc, 1, add, mult) ;
                                C2 = GB_mex_AxB_idx (A, D, at, 0, ...
                                    0, C_is_csc, 0, add, mult) ;
                                GB_spec_compare (C1, C2) ;
                            end
                        end
                    end
                    fprintf ('.') ;

                    for bt = 0:1
                        % C = D*B, D*B'
                        for k1 = 1:length (adds)
                            add = adds {k1} ;
                            for k2 = 1:length (mults)
                                mult = mults {k2} ;
%                               fprintf ('\n(%s,%s,%d): D*B\n', ...
%                                   add, mult, bt) ;
                                C1 = GB_mex_AxB_idx (D, B, 0, bt, ...
                                    0, C_is_csc, 1, add, mult) ;
                                C2 = GB_mex_AxB_idx (D, B, 0, bt, ...
                                    0, C_is_csc, 0, add, mult) ;
                                GB_spec_compare (C1, C2) ;
%                               fprintf ('.') ;
                            end
                        end
                    end
                    fprintf ('.') ;

                end
            end
        end
    end
end

fprintf ('\ntest284: all tests passed\n') ;