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
|
function C = subsref (A, S)
%SUBSREF C = A(I,J) or C = A(I); extract submatrix.
% C = A(I,J) extracts the A(I,J) submatrix of the GraphBLAS matrix A.
% With a single index, C = A(I) extracts a subvector C of a vector A.
% For linear indexing of a 2D matrix, only C=A(:) is currently supported.
% C = A(I) is not yet supported if A is a 2D matrix.
%
% x = A (M) for a logical matrix M constructs an nnz(M)-by-1 vector x, for
% built-in-style logical indexing. A or M may be built-in sparse or full
% matrices, or GraphBLAS matrices, in any combination. M must be either a
% built-in logical matrix (sparse or full), or a GraphBLAS logical matrix;
% that is, GrB.type (M) must be 'logical'.
%
% GraphBLAS can construct huge sparse matrices, but they cannot always be
% indexed with A(lo:hi,lo:hi), because of a limitation of the built-in
% colon notation. A colon expression is expanded into an explicit vector,
% but this can be too big. Instead of the colon notation start:inc:fini,
% use a cell array with three integers, {start, inc, fini}.
%
% Example:
%
% n = 1e14 ;
% H = GrB (n, n) % a huge empty matrix
% I = [1 1e9 1e12 1e14] ;
% M = magic (4)
% H (I,I) = M
% J = {1, 1e13} ; % represents 1:1e13 colon notation
% C = H (J, J) % this is very fast
% E = H (1:1e13, 1:1e13) % but this is not possible
%
% See also GrB/subsasgn, GrB/subsindex, GrB.subassign, GrB.assign,
% GrB.extract.
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
% FUTURE: add all forms of linear indexing.
if (isobject (A))
A = A.opaque ;
end
[m, n] = gbsize (A) ;
if (length (S) > 1)
error ('GrB:error', 'nested indexing not supported') ;
end
if (~isequal (S.type, '()'))
error ('GrB:error', 'index type %s not supported', S.type) ;
end
ndims = length (S.subs) ;
if (ndims == 1)
% C = A(M) if M is logical, or C=A(I) otherwise
S = S.subs {1} ;
if (isobject (S))
S = S.opaque ;
end
if (isequal (gbtype (S), 'logical'))
% C = A (M) for logical indexing
C = GrB (gblogextract (A, S)) ;
else
% C = A (I)
[I, whole] = gb_index (S) ;
if (m == 1 || n == 1)
% C = A (I) for a vector A
if (m > 1)
C = gbextract (A, I, { }) ;
else
C = gbextract (A, { }, I) ;
end
[cm, ~] = gbsize (C) ;
if (whole && cm == 1)
C = gbtrans (C) ;
end
C = GrB (C) ;
else
% C = A (I) for a matrix A
if (whole)
% C = A (:), whole matrix case
[~, mn] = gb_2d_to_1d (0, 0, m, n) ;
C = GrB (gbreshape (A, mn, 1, 'by column')) ;
else
% C = A (I), general case not yet supported
error ('GrB:error', ...
'Except for C=A(:), linear indexing not yet supported') ;
end
end
end
elseif (ndims == 2)
% C = A (I,J)
C = GrB (gbextract (A, gb_index (S.subs {1}), gb_index (S.subs {2}))) ;
else
% sparse N-dimensional arrays for N > 2 will not be supported
error ('GrB:error', '%dD indexing not supported', ndims) ;
end
|
