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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
function test108
%TEST108 test boolean monoids
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
% only well-defined if op is associative
ops = {
% 10 operators where x,y,z are all the same class
% 'first', % z = x
% 'second', % z = y
'min', % z = min(x,y)
'max', % z = max(x,y)
'plus', % z = x + y
'minus', % z = x - y
'rminus', % z = y - z
'times', % z = x * y
% 'div', % z = x / y
% 'rdiv', % z = y / x
% 6 comparators where x,y,z are all the same class
'iseq', % z = (x == y)
'isne', % z = (x != y)
% 'isgt', % z = (x > y)
% 'islt', % z = (x < y)
% 'isge', % z = (x >= y)
% 'isle', % z = (x <= y)
% 3 boolean operators where x,y,z are all the same class
'or', % z = x || y
'and', % z = x && y
'xor' % z = x != y
%----------------------------
% 6 comparators where x,y are all the same class, z is logical
'eq', % z = (x == y)
'ne', % z = (x != y)
% 'gt', % z = (x > y)
% 'lt', % z = (x < y)
% 'ge', % z = (x >= y)
% 'le', % z = (x <= y)
} ;
rng ('default') ;
for d = 0:10
clear A
m = 4 ;
n = 4 ;
% d = 0.8 ;
A.matrix = spones (sprand (m, n, d/10)) ;
A.class = 'logical' ;
nz = nnz (A.matrix) ;
e = rand (nz, 1) ;
if (d == 3)
A.values = true (nz,1) ;
elseif (d == 4)
A.values = false (nz,1) ;
else
A.values = (e > 0.5) ;
end
X = A.values ;
n = length (X) ;
% fprintf ('\n============================================== %d: %d\n', d, nz) ;
nops = length (ops) ;
Results = nan (nops, 2, 2, 2) ;
for k = 1:length (ops)
op = ops {k} ;
% fprintf ('\n============================== %s\n', op) ;
for first = 0:1
for last = 0:1
A.values (1) = first ;
A.values (end) = last ;
X = A.values ;
for id = 0:1
% no terminal
identity = logical (id) ;
result = GB_mex_reduce_bool (A, op, identity) ;
% now compute with built-in methods
% known identity values
z = identity ;
% 8 operators where x,y,z are all the same class
if (isequal (op, 'first')) z = identity ; end
if (isequal (op, 'second')) z = identity ; end
if (isequal (op, 'min')) z = true ; end % and
if (isequal (op, 'max')) z = false ; end % or
if (isequal (op, 'plus')) z = false ; end % or
if (isequal (op, 'minus')) z = false ; end % xor
if (isequal (op, 'rminus')) z = false ; end % xor
if (isequal (op, 'times')) z = true ; end % and
if (isequal (op, 'div')) z = identity ; end % first
if (isequal (op, 'rdiv')) z = identity ; end % second
% 6 comparators where x,y,z are all the same class
if (isequal (op, 'iseq')) z = true ; end % eq
if (isequal (op, 'isne')) z = false ; end % xor
if (isequal (op, 'isgt')) z = identity ; end % gt
if (isequal (op, 'islt')) z = identity ; end % lt
if (isequal (op, 'isge')) z = identity ; end % ge
if (isequal (op, 'isle')) z = identity ; end % le
% 3 boolean operators where x,y,z are all the same class
if (isequal (op, 'or')) z = false ; end
if (isequal (op, 'and')) z = true ; end
if (isequal (op, 'xor')) z = false ; end
%----------------------------
% 6 comparators where x,y are all the same class, z is logical
if (isequal (op, 'eq')) z = true ; end
if (isequal (op, 'ne')) z = false ; end % xor
if (isequal (op, 'gt')) z = identity ; end
if (isequal (op, 'lt')) z = identity ; end
if (isequal (op, 'ge')) z = identity ; end
if (isequal (op, 'le')) z = identity ; end
for i = 1:n
x = z ;
y = X (i) ;
% 8 operators where x,y,z are all the same class
if (isequal (op, 'first')) z = x ; end
if (isequal (op, 'second')) z = y ; end
if (isequal (op, 'min')) z = min(x,y) ; end
if (isequal (op, 'max')) z = max(x,y) ; end
if (isequal (op, 'plus')) z = or (x,y) ; end
if (isequal (op, 'minus')) z = xor(x,y) ; end
if (isequal (op, 'rminus')) z = xor(x,y) ; end
if (isequal (op, 'times')) z = x * y ; end
if (isequal (op, 'div')) z = x ; end % boolean division == first
if (isequal (op, 'rdiv')) z = y ; end % boolean division == second
% 6 comparators where x,y,z are all the same class
if (isequal (op, 'iseq')) z = (x == y) ; end
if (isequal (op, 'isne')) z = (x ~= y) ; end
if (isequal (op, 'isgt')) z = (x > y) ; end
if (isequal (op, 'islt')) z = (x < y) ; end
if (isequal (op, 'isge')) z = (x >= y) ; end
if (isequal (op, 'isle')) z = (x <= y) ; end
% 3 boolean operators where x,y,z are all the same class
if (isequal (op, 'or')) z = x || y ; end
if (isequal (op, 'and')) z = x && y ; end
if (isequal (op, 'xor')) z = xor(x,y) ; end
%----------------------------
% 6 comparators where x,y are all the same class, z is logical
if (isequal (op, 'eq')) z = (x == y) ; end
if (isequal (op, 'ne')) z = (x ~= y) ; end
if (isequal (op, 'gt')) z = (x > y) ; end
if (isequal (op, 'lt')) z = (x < y) ; end
if (isequal (op, 'ge')) z = (x >= y) ; end
if (isequal (op, 'le')) z = (x <= y) ; end
end
assert (z == result) ;
Results (k, 1+ first, 1+ last, 1+ id) = result ;
end
end
end
end
% fprintf ('\n=================================================== summary:\n') ;
%{
for k = 1:length (ops)
op = ops {k} ;
fprintf ('\n============================== %s\n', op) ;
for first = 0:1
for last = 0:1
A.values (1) = first ;
A.values (end) = last ;
for id = 0:1
% no terminal
result = Results (k, 1+ first, 1+ last, 1+ id) ;
fprintf ('first: %d last: %d id: %d op: %6s result: %d\n', first, last, id, op, result) ;
end
end
end
end
%}
end
fprintf ('\ntest108: all tests passed\n') ;
|
