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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
|
// Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
// Copyright (C) 2010 - Scilab Enterprises - Adeline CARNIS
//
// This file must be used under the terms of the CeCILL.
// This source file is licensed as described in the file COPYING, which
// you should have received as part of this distribution. The terms
// are also available at
// http://www.cecill.info/licences/Licence_CeCILL_V2.1-en.txt
function [m, k] = %sp_max(varargin)
[lhs, rhs] = argn(0);
elements = varargin;
error_list = %f;
// If the first argument is a list, it retrieves the number of sparse
// matrices in list
if type(varargin(1)) == 15 then
if rhs <> 1 then
error(msprintf(_("%s: Wrong size of input argument: %d expected.\n"), "%sp_max", 1))
end
rhs = length(varargin(1));
elements = varargin(1);
error_list = %t;
// If the second argument of list is not a sparse -> ERROR
if rhs == 2 & type(elements(2)) <> 5 then
error(msprintf(_("%s: Wrong type for input argument #%d: A sparse matrix expected.\n"), "%sp_max", 1))
end
end
select rhs
// If rhs = 1, the first input argument must be a sparse
case 1
A1 = elements(1);
// Check if A is a sparse
if type(A1)<> 5 then
error(msprintf(_("%s: Wrong type for input argument #%d: A sparse matrix expected.\n"), "%sp_max", 1))
end
// Retrieves entries of sparse matrix
[ij, v, mn]= spget(A1);
if lhs == 1 then
if v == [] then
m = 0;
else
m = max(v);
end
else
if v == [] then
m = 0;
k = [1 1];
else
[m, i] = max(v);
if mn(1) == 1 then
k = ij(i,2);
else
if mn(2) == 1 then
k = ij(i,1);
else
k = [ij(i,1) ij(i,2)];
end
end
end
end
// If A1 contains negative values and the length of v is less then mn(1)
// * mn(2), A1 contains one or several zeros
// So, max = 0
if m < 0 & length(v)<> mn(1)*mn(2) then
m = 0;
if lhs == 2 then
k = 0;
if mn(1) == 1 then
for i = 1:length(v)
if and(ij(:,2) <> i) then
k = i;
break;
end
end
else
if mn(2) == 1 then
for i = 1:length(v)
if and(ij(:,1) <> i) then
k = i;
break;
end
end
else
// thanks to ij, find the position of zero value
// But ij contains only the indices of non zero values
// So check on first column the values 1:mn(1)
// if posi is less than mn(2) then there is zero value
cpt = 0;
for i = 1:mn(1)
posi = length(find(ij(:,1)==i));
if posi <> mn(2) then
for j = 1:mn(2)
// it is the last index of line where m = 0
if mn(2)*(i-1)+j == mn(2)*i then
k = [i, j];
break;
else
pos = find(ij(mn(2)*(i-1)+j,2) == j);
if pos == [] & k == 0 then
k = [i,j];
break;
end
end
end
if k <> 0 then
break;
end
end
end
end
end
end
end
// If rhs = 2, the second input argument can be a character or a sparse
// matrix
case 2
if lhs == 2 then
error(msprintf(_("%s: Wrong number of output argument: %d expected.\n"), "%sp_max", 1));
end
A1 = elements(1);
// Check if A is a sparse
if type(A1) <> 5 then
error(msprintf(_("%s: Wrong type for input argument #%d: A sparse matrix expected.\n"), "%sp_max", 1));
end
select type(elements(2))
// If the second argument is a string
case 10
opts = elements(2);
// Opts can be : 'c' 'r' or 'm'
ind = find(opts == ["c","r","m"]);
if (ind == []) then
error(msprintf(_("%s: Wrong value for input argument #%d: [''r'' ''c'' ''m''] expected.\n"),"%sp_max",2));
end
[ij, v, mn] = spget(A1);
// If mn(1) = 1, A1 is a row vector
if mn(1) == 1 then
// max(A1, 'r') = A1(1,:) because A1 is a row vector
if opts == "r" then
m = A1;
// max(A1, 'c') or max(A1, 'm') = max(A1)
else
m = max(v', opts);
if m < 0 & length(v)<> mn(1)*mn(2) then
m = 0;
end
end
end
// If mn(2) = 1, A1 is a column vector
if mn(2) == 1 then
if opts == "c" then
m = A1;
else
m = max(v, opts);
end
if m < 0 & length(v)<> mn(1)*mn(2) then
m = 0;
end
end
// Return a sparse vector containing the max in terms of 'c', 'r' or 'm'
if mn(1) <> 1 & mn(2) <> 1 then
// If opts = 'c', the result is returned in column vector
if opts == "c" then
m = spzeros(mn(1),1);
for i = 1:mn(1)
pos = length(find(ij(:,1)==i));
if pos <> mn(2) then
m(i) = 0;
else
m(i) = max(A1(i,:));
end
end
// If opts = 'r' or 'm', the result is returned in row vector
else
m = spzeros(1,mn(2));
for i = 1:mn(2)
pos = length(find(ij(:,2)==i));
if pos <> mn(1) then
m(i) = 0;
else
m(i) = max(A1(:,i));
end
end
end
end
case 5
// If the second argument is a sparse
A2 = elements(2);
[m1, n1] = size(A1);
[m2, n2] = size(A2);
// Check the size of A2
if (m1 <> m2 | n1 <> n2) then
error(msprintf(_("%s: Wrong size of input argument #%d: Same size as input argument #%d expected.\n"), "%sp_max", 2, 1));
end
// Retrieve the indices of non-zeros
ij1 = spget(A1);
ij2 = spget(A2);
// A1 and A2 contain non zeros -> full
if size(ij1,"r") == m1*n1 & size(ij2,"r") == m2*n2 then
[m,k] = max(full(A1), full(A2));
m = sparse(m);
k = sparse(k);
else
m = A1;
pos = find(m < A2);
m(pos) = A2(pos);
end
else
error(msprintf(_("%s: Wrong type for input argument #%d: A sparse matrix or a character expected.\n"), "%sp_max", 2));
end
// Case : max(A1,A2,A3,..,An) or max(list(A1,A2,A3,..,An))
else
if lhs == 2 then
error(msprintf(_("%s: Wrong number of output argument: %d expected.\n"), "%sp_max", 1));
end
// m is the first matrix
m = elements(1);
// Loop on the number of input arguments
for i = 2:rhs
An = elements(i);
// Check if An is a sparse
if type(An) <> 5 then
if error_list then
error(msprintf(_("%s: Wrong type for input argument #%d (List element: %d): A sparse matrix expected.\n"), "%sp_max", 1, i))
else
error(msprintf(_("%s: Wrong type for input argument #%d: A sparse matrix expected.\n"), "%sp_max", i))
end
end
[m1, n1] = size(m);
[m2, n2] = size(An);
// Check size
if (m1 <> m2 | n1 <> n2) then
if error_list then
error(msprintf(_("%s: Wrong size of input argument #%d (List element: %d): Same size as input argument #%d expected.\n"), "%sp_max", 1, i, 1))
else
error(msprintf(_("%s: Wrong size of input argument #%d: Same size as input argument #%d expected.\n"), "%sp_max", i, 1))
end
end
ij1 = spget(m);
ij2 = spget(An);
if size(ij1,"r") == m1*n1 & size(ij2,"r") == m2*n2 then
[m,k] = max(full(m), full(An));
m = sparse(m);
k = sparse(k);
else
pos = find(m < An);
m(pos) = An(pos);
end
end
end
endfunction
|
