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
|
function gbtest90
%GBTEST90 test GrB.reduce
%
% c = GrB.reduce (monoid, A)
% c = GrB.reduce (monoid, A, desc)
% c = GrB.reduce (c, accum, monoid, A)
% c = GrB.reduce (c, accum, monoid, A, desc)
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
rng ('default')
C = GrB (pi) ;
accum = '*' ;
monoid = '+' ;
A = GrB.random (9, 9, 0.5) ;
desc = struct ;
c = double (C) ;
a = double (A) ;
%----------------------------------------------------------------------
% c = GrB.reduce (monoid, A)
%----------------------------------------------------------------------
% 1 matrix: A
% 1 string: monoid
C2 = sum (A, 'all') ;
% works in R2019b; fails in R2018a:
% c2 = sum (a, 'all') ;
% works in R2018a:
c2 = sum (a (:)) ;
assert (isequal (c2, C2)) ;
C1 = GrB.reduce (monoid, A) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (A, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (monoid, a) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (a, monoid) ; assert (isequal (C1, C2)) ;
%----------------------------------------------------------------------
% c = GrB.reduce (monoid, A, desc)
%----------------------------------------------------------------------
% 1 matrix: A
% 1 string: monoid
C2 = sum (A, 'all') ;
c2 = sum (a (:)) ;
assert (isequal (c2, C2)) ;
C1 = GrB.reduce (monoid, A, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (A, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (monoid, a, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (a, monoid, desc) ; assert (isequal (C1, C2)) ;
%----------------------------------------------------------------------
% c = GrB.reduce (c, accum, monoid, A)
%----------------------------------------------------------------------
% 2 matrices: c, A
% 2 strings: accum, monoid
C2 = C * sum (A, 'all') ;
c2 = c * sum (a (:)) ;
assert (isequal (c2, C2)) ;
C1 = GrB.reduce (C, accum, monoid, A) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (C, accum, A, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (C, A, accum, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, C, monoid, A) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, C, A, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, monoid, C, A) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (c, accum, monoid, a) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (c, accum, a, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (c, a, accum, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, c, monoid, a) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, c, a, monoid) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, monoid, c, a) ; assert (isequal (C1, C2)) ;
%----------------------------------------------------------------------
% c = GrB.reduce (c, accum, monoid, A, desc)
%----------------------------------------------------------------------
% 2 matrices: c, A
% 2 strings: accum, monoid
C2 = C * sum (A, 'all') ;
c2 = c * sum (a (:)) ;
assert (isequal (c2, C2)) ;
C1 = GrB.reduce (C, accum, monoid, A, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (C, accum, A, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (C, A, accum, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, C, monoid, A, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, C, A, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, monoid, C, A, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (c, accum, monoid, a, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (c, accum, a, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (c, a, accum, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, c, monoid, a, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, c, a, monoid, desc) ; assert (isequal (C1, C2)) ;
C1 = GrB.reduce (accum, monoid, c, a, desc) ; assert (isequal (C1, C2)) ;
fprintf ('gbtest90: all tests passed\n') ;
|