File: test136.m

package info (click to toggle)
suitesparse-graphblas 7.4.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 67,112 kB
  • sloc: ansic: 1,072,243; cpp: 8,081; sh: 512; makefile: 506; asm: 369; python: 125; awk: 10
file content (108 lines) | stat: -rw-r--r-- 2,609 bytes parent folder | download | duplicates (3)
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
function test136
%TEST136 GxB_subassign, method 08, 09, 11

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

fprintf ('test136: GxB_subassign, special cases\n') ;

rng ('default') ;

m = 1000 ;
n = 5 ;
am = 500 ;
an = n ;

C = sprand (m, n, 0.1) ;
I = randperm (m, am) ;

M = spones (sprand (am, an, 0.1)) ;
A = sprand (am, an, 0.1) ;
I0 = uint64 (I) - 1 ;

M (:,1) = 0 ;
M (1:2,1) = 1 ;
A (:,1) = sprand (am, 1, 0.8)  ;

A (:,2) = 0 ;
A (1:2,2) = 1 ;
M (:,2) = spones (sprand (am, 1, 0.8))  ;

% Method 08: C(I,J)<M> += A
C2 = GB_mex_subassign  (C, M, 'plus', A, I0, [ ], [ ]) ;
C1 = GB_spec_subassign (C, M, 'plus', A, I , [ ], [ ], false) ;
GB_spec_compare (C1, C2) ;

% create a Mask with explicit zero entries
[i j x] = find (M) ;
nz = length (x) ;
p = randperm (nz, floor(nz/2)) ;
x (p) = 0 ;
i = uint64 (i-1) ;
j = uint64 (j-1) ;
Mask = GB_mex_Matrix_build (i,j,x,am,an,[]) ;
Mask = Mask.matrix ;

% Method 09: C(I,J)<M,repl> = scalar
scalar = sparse (pi) ;
desc.outp = 'replace' ;
C2 = GB_mex_subassign  (C, Mask, [ ], scalar, I0, [ ], desc) ;
C1 = GB_spec_subassign (C, Mask, [ ], scalar, I , [ ], desc, true) ;
GB_spec_compare (C1, C2) ;

% Method 11: C(I,J)<M,repl> += scalar
scalar = sparse (pi) ;
desc.outp = 'replace' ;
C2 = GB_mex_subassign  (C, Mask, 'plus', scalar, I0, [ ], desc) ;
C1 = GB_spec_subassign (C, Mask, 'plus', scalar, I , [ ], desc, true) ;
GB_spec_compare (C1, C2) ;

% repeat method 02, subassignment with zombies:
% subref triggers case 4 with zombies
% no pending tuples
clear desc
d = [ ] ;
m = 3 ;
n = 8 ;
C = sparse (rand (m,n)) ;
C = tril (C,-1) + triu (C,1) ;

Work (1).A = sparse (m,2) ;
Work (1).I = [ ] ;
Work (1).J = [1 2] ;
Work (1).desc = d ;
Work (2).A = sparse (m,2) ;
Work (2).I = [ ] ;
Work (2).J = [2 3] ;
Work (2).desc = d ;
Work (3).A = sparse (m,2) ;
Work (3).I = [ ] ;
Work (3).J = [4 8] ;
Work (3).desc = d ;

Work2 (1).A = sparse (m,2) ;
Work2 (1).I = [ ] ;
Work2 (1).J = uint64 ([1 2]) - 1 ;
Work2 (1).desc = d ;
Work2 (2).A = sparse (m,2) ;
Work2 (2).I = [ ] ;
Work2 (2).J = uint64 ([2 3])  - 1;
Work2 (2).desc = d ;
Work2 (3).A = sparse (m,2) ;
Work2 (3).I = [ ] ;
Work2 (3).J = uint64 ([4 8]) - 1 ;
Work2 (3).desc = d ;

C1 = C ;
for k = 1:length (Work)
    C1 = GB_spec_subassign (C1, [ ], [ ], ...
        Work (k).A, Work (k).I, Work (k).J, Work (k).desc, false) ;
end

C2 = GB_mex_subassign (C, Work2) ;  % WORK_ASSIGN
GB_spec_compare (C1, C2) ;

C2 = GB_mex_subassign (C, Work2, [2 2]) ;   % WORK_ASSIGN
GB_spec_compare (C1, C2) ;

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