SCM

SCM Repository

[matrix] Annotation of /pkg/tests/indexing.R
ViewVC logotype

Annotation of /pkg/tests/indexing.R

Parent Directory Parent Directory | Revision Log Revision Log


Revision 2098 - (view) (download)

1 : maechler 1710 ## For both 'Extract' ("[") and 'Replace' ("[<-") Method testing
2 : maechler 687
3 :     library(Matrix)
4 :    
5 : maechler 907 source(system.file("test-tools.R", package = "Matrix"))# identical3() etc
6 : maechler 687
7 : maechler 873 ### Dense Matrices
8 :    
9 : maechler 1673 m <- Matrix(1:28 +0, nrow = 7)
10 :     validObject(m)
11 : maechler 873 stopifnot(identical(m, m[]),
12 :     identical(m[2, 3], 16), # simple number
13 :     identical(m[2, 3:4], c(16,23))) # simple numeric of length 2
14 : maechler 687
15 : maechler 873 m[2, 3:4, drop=FALSE] # sub matrix of class 'dgeMatrix'
16 :     m[-(4:7), 3:4] # dito; the upper right corner of 'm'
17 : maechler 687
18 : maechler 873 ## rows or columns only:
19 :     m[1,] # first row, as simple numeric vector
20 :     m[,2] # 2nd column
21 :     m[,1:2] # sub matrix of first two columns
22 :     m[-(1:6),, drop=FALSE] # not the first 6 rows, i.e. only the 7th
23 : maechler 1331 m[integer(0),] #-> 0 x 4 Matrix
24 :     m[2:4, numeric(0)] #-> 3 x 0 Matrix
25 : maechler 687
26 : maechler 873 ## logical indexing
27 :     stopifnot(identical(m[2,3], m[(1:nrow(m)) == 2, (1:ncol(m)) == 3]),
28 :     identical(m[2,], m[(1:nrow(m)) == 2, ]),
29 :     identical(m[,3:4], m[, (1:4) >= 3]))
30 :    
31 : maechler 886 ## dimnames indexing:
32 :     mn <- m
33 :     dimnames(mn) <- list(paste("r",letters[1:nrow(mn)],sep=""),
34 :     LETTERS[1:ncol(mn)])
35 :     mn["rd", "D"]
36 : maechler 1226 stopifnot(identical(mn["rc", "D"], mn[3,4]), mn[3,4] == 24,
37 :     identical(mn[, "A"], mn[,1]), mn[,1] == 1:7,
38 : maechler 886 identical(mn[c("re", "rb"), "B"], mn[c(5,2), 2])
39 :     )
40 : maechler 873
41 : maechler 886 mo <- m
42 :     m[2,3] <- 100
43 :     m[1:2, 4] <- 200
44 :     m[, 1] <- -1
45 :     m[1:3,]
46 :    
47 : maechler 1673 m. <- as.matrix(m)
48 :    
49 :     ## m[ cbind(i,j) ] indexing:
50 :     ij <- cbind(1:6, 2:3)
51 :     stopifnot(identical(m[ij], m.[ij]))
52 :    
53 : maechler 1599 ## testing operations on logical Matrices rather more than indexing:
54 : maechler 1226 g10 <- m [ m > 10 ]
55 :     stopifnot(18 == length(g10))
56 : maechler 1362 stopifnot(10 == length(m[ m <= 10 ]))
57 : maechler 1599 sel <- (20 < m) & (m < 150)
58 : maechler 1655 sel.<- (20 < m.)& (m.< 150)
59 : maechler 1599 nsel <-(20 >= m) | (m >= 150)
60 : maechler 1575 (ssel <- as(sel, "sparseMatrix"))
61 :     stopifnot(is(sel, "lMatrix"), is(ssel, "lsparseMatrix"),
62 : maechler 1655 identical3(as.mat(sel.), as.mat(sel), as.mat(ssel)),
63 :     identical3(!sel, !ssel, nsel), # !<sparse> is typically dense
64 : maechler 1599 identical3(m[ sel], m[ ssel], as.matrix(m)[as.matrix( ssel)]),
65 :     identical3(m[!sel], m[!ssel], as.matrix(m)[as.matrix(!ssel)])
66 : maechler 1575 )
67 : maechler 873
68 : maechler 1575 ## more sparse Matrices --------------------------------------
69 : maechler 873
70 : maechler 687 m <- 1:800
71 :     set.seed(101) ; m[sample(800, 600)] <- 0
72 :     m <- Matrix(m, nrow = 40)
73 :     mm <- as(m, "matrix")
74 :     dimnames(mm) <- NULL ## << workaround: as(<sparse>, "matrix") has NULL dimnames
75 :     str(mC <- as(m, "dgCMatrix"))
76 :     str(mT <- as(m, "dgTMatrix"))
77 :     stopifnot(identical(mT, as(mC, "dgTMatrix")),
78 :     identical(mC, as(mT, "dgCMatrix")))
79 :    
80 :     mC[,1]
81 :     mC[1:2,]
82 : maechler 925 mC[7, drop = FALSE]
83 : maechler 1226 assert.EQ.mat(mC[1:2,], mm[1:2,])
84 : maechler 1799
85 : maechler 1833 ## *repeated* (aka 'duplicated') indices - did not work at all ...
86 : maechler 1799 i <- rep(8:10,2)
87 :     j <- c(2:4, 4:3)
88 :     assert.EQ.mat(mC[i,], mm[i,])
89 :     assert.EQ.mat(mC[,j], mm[,j])
90 : maechler 1829 assert.EQ.mat(mC[i, 2:1], mm[i, 2:1])
91 : maechler 1833 assert.EQ.mat(mC[c(4,1,2:1), j], mm[c(4,1,2:1), j])
92 : maechler 1829 assert.EQ.mat(mC[i,j], mm[i,j])
93 :     set.seed(7)
94 :     for(n in 1:50) {
95 :     i <- sample(sample(nrow(mC), 7), 20, replace = TRUE)
96 :     j <- sample(sample(ncol(mC), 6), 17, replace = TRUE)
97 :     assert.EQ.mat(mC[i,j], mm[i,j])
98 :     }
99 : maechler 1834
100 :     ##---- Symmetric indexing of symmetric Matrix ----------
101 : maechler 1835 m. <- mC; m.[, c(2, 7:12)] <- 0
102 : maechler 1833 validObject(S <- crossprod(add.simpleDimnames(m.) %% 100))
103 : maechler 1829 ss <- as(S, "matrix")
104 :     T <- as(S, "TsparseMatrix")
105 : maechler 1833 ## non-repeated indices:
106 : maechler 1829 i <- c(7:5, 2:4);assert.EQ.mat(T[i,i], ss[i,i])
107 : maechler 1833 N <- nrow(T)
108 :     set.seed(11)
109 :     for(n in 1:50) {
110 :     i <- sample(N, max(2, sample(N,1)), replace = FALSE)
111 :     validObject(Tii <- T[i,i])
112 :     stopifnot(is(Tii, "dsTMatrix"), # remained symmetric Tsparse
113 :     identical(t(Tii), t(T)[i,i]))
114 :     assert.EQ.mat(Tii, ss[i,i])
115 :     }
116 :    
117 : maechler 1834 ## repeated ones ``the challenge'' (to do smartly):
118 : maechler 1833 j <- c(4, 4, 9, 12, 9, 4, 17, 3, 18, 4, 12, 18, 4, 9)
119 : maechler 1829 assert.EQ.mat(T[j,j], ss[j,j])
120 : maechler 1834 ## and another two sets (a, A) & (a., A.) :
121 :     a <- matrix(0, 6,6)
122 :     a[upper.tri(a)] <- (utr <- c(2, 0,-1, 0,0,5, 7,0,0,0, 0,0,-2,0,8))
123 :     ta <- t(a); ta[upper.tri(a)] <- utr; a <- t(ta)
124 :     diag(a) <- c(0,3,0,4,6,0)
125 :     A <- as(Matrix(a), "TsparseMatrix")
126 :     A. <- A
127 :     diag(A.) <- 10 * (1:6)
128 :     a. <- as(A., "matrix")
129 :     ## More testing {this was not working for a long time..}
130 :     set.seed(1)
131 :     for(n in 1:100) {
132 :     i <- sample(1:nrow(A), 3+2*rpois(1, lam=3), replace=TRUE)
133 :     Aii <- A[i,i]
134 :     A.ii <- A.[i,i]
135 :     stopifnot(class(Aii) == class(A),
136 :     class(A.ii) == class(A.))
137 :     assert.EQ.mat(Aii , a [i,i])
138 :     assert.EQ.mat(A.ii, a.[i,i])
139 :     assert.EQ.mat(T[i,i], ss[i,i])
140 :     }
141 : maechler 1799
142 : maechler 1829
143 : maechler 1673 stopifnot(all.equal(mC[,3], mm[,3]),
144 :     identical(mC[ij], mm[ij]))
145 : maechler 1226 assert.EQ.mat(mC[7, , drop=FALSE], mm[7, , drop=FALSE])
146 :    
147 : maechler 1331 stopifnot(dim(mC[numeric(0), ]) == c(0,20), # used to give warnings
148 :     dim(mC[, integer(0)]) == c(40,0),
149 :     identical(mC[, integer(0)], mC[, FALSE]),
150 :     identical(mC[7, drop = FALSE],
151 : maechler 925 mC[7,, drop = FALSE]))
152 : maechler 1269 validObject(print(mT[,c(2,4)]))
153 :     stopifnot(all.equal(mT[2,], mm[2,]),
154 :     ## row or column indexing in combination with t() :
155 :     identical(mT[2,], t(mT)[,2]),
156 :     identical(mT[-2,], t(t(mT)[,-2])),
157 :     identical(mT[c(2,5),], t(t(mT)[,c(2,5)]))
158 :     )
159 : maechler 1226 assert.EQ.mat(mT[4,, drop = FALSE], mm[4,, drop = FALSE])
160 : maechler 687 stopifnot(identical3(mm[,1], mC[,1], mT[,1]),
161 :     identical3(mm[3,], mC[3,], mT[3,]),
162 :     identical3(mT[2,3], mC[2,3], 0),
163 :     identical(mT[], mT),
164 : maechler 1665 identical4( mm[c(3,7), 2:4], as.mat( m[c(3,7), 2:4]),
165 :     as.mat(mT[c(3,7), 2:4]), as.mat(mC[c(3,7), 2:4]))
166 : bates 1367 )
167 : maechler 687
168 : maechler 1331 x.x <- crossprod(mC)
169 :     stopifnot(class(x.x) == "dsCMatrix",
170 : maechler 1673 class(x.x. <- round(x.x / 10000)) == "dsCMatrix",
171 :     identical(x.x[cbind(2:6, 2:6)],
172 :     diag(x.x [2:6, 2:6])))
173 : maechler 1331 head(x.x.) # Note the *non*-structural 0's printed as "0"
174 : maechler 1575 tail(x.x., -3) # all but the first three lines
175 : maechler 1331
176 :     lx.x <- as(x.x, "lsCMatrix") # FALSE only for "structural" 0
177 : maechler 1665 (l10 <- lx.x[1:10, 1:10])# "lsC"
178 :     (l3 <- lx.x[1:3, ])
179 :     m.x <- as(x.x, "matrix")
180 :     stopifnot(class(l10) == "lsCMatrix", # symmetric indexing -> symmetric !
181 :     identical(as.mat(lx.x), m.x != 0),
182 :     identical(as.logical(lx.x), as.logical(m.x)),
183 :     identical(as.mat(l10), m.x[1:10, 1:10] != 0),
184 :     identical(as.mat(l3 ), m.x[1:3, ] != 0)
185 :     )
186 : maechler 1331
187 : maechler 1833 ##-- Sub*assignment* with repeated / duplicated index:
188 :     A <- Matrix(0,4,3) ; A[c(1,2,1), 2] <- 1 ; A
189 : maechler 2062 B <- A; B[c(1,2,1), 2] <- 1:3; B; B. <- B
190 :     B.[3,] <- rbind(4:2)
191 :     diag(B.) <- 10 * diag(B.)
192 :     C <- B.; C[,2] <- C[,2]; C[1,] <- C[1,]; C[2:3,2:1] <- C[2:3,2:1]
193 : maechler 1833 stopifnot(identical(unname(as.matrix(A)),
194 :     local({a <- matrix(0,4,3); a[c(1,2,1), 2] <- 1 ; a})),
195 :     identical(unname(as.matrix(B)),
196 : maechler 2062 local({a <- matrix(0,4,3); a[c(1,2,1), 2] <- 1:3; a})),
197 :     identical(C, drop0(B.)))
198 : maechler 1833
199 :    
200 : maechler 1705 ## used to fail
201 :     n <- 5 ## or much larger
202 :     sm <- new("dsTMatrix", i=as.integer(1),j=as.integer(1),
203 :     Dim=as.integer(c(n,n)), x = 1)
204 :     (cm <- as(sm, "CsparseMatrix"))
205 :     sm[2,]
206 :     stopifnot(sm[2,] == c(0:1, rep.int(0,ncol(sm)-2)),
207 :     sm[2,] == cm[2,],
208 :     sm[,3] == sm[3,],
209 :     all(sm[,-(1:3)] == t(sm[-(1:3),])), # all(<lge.>)
210 :     all(sm[,-(1:3)] == 0)
211 :     )
212 : maechler 1665
213 : maechler 1710 ### Diagonal -- Sparse:
214 :     m0 <- Diagonal(5)
215 :     (m1 <- as(m0, "sparseMatrix")) # dtTMatrix
216 :     (m2 <- as(m0, "CsparseMatrix")) # dtCMatrix (with an irrelevant warning)
217 : maechler 1799 m1g <- as(m1, "generalMatrix")
218 :     stopifnot(is(m1g, "dgTMatrix"))
219 :     assert.EQ.mat(m2[1:3,], diag(5)[1:3,])
220 :     assert.EQ.mat(m2[,c(4,1)], diag(5)[,c(4,1)])
221 :     stopifnot(identical(m2[1:3,], as(m1[1:3,], "CsparseMatrix")),
222 :     identical(Matrix:::uniqTsparse(m1[, c(4,2)]),
223 :     Matrix:::uniqTsparse(as(m2[, c(4,2)], "TsparseMatrix")))
224 :     )## failed in 0.9975-11
225 : maechler 1705
226 : maechler 1710 M <- m0; M[1,] <- 0
227 :     stopifnot(identical(M, Diagonal(x=c(0, rep(1,4)))))
228 :     M <- m0; M[,3] <- 3 ; M ; stopifnot(is(M, "sparseMatrix"), M[,3] == 3)
229 :     validObject(M)
230 :     M <- m0; M[1:3, 3] <- 0 ;M
231 :     T <- m0; T[1:3, 3] <- 10
232 :     stopifnot(identical(M, Diagonal(x=c(1,1, 0, 1,1))),
233 :     is(T, "triangularMatrix"), identical(T[,3], c(10,10,10,0,0)))
234 :    
235 :     M <- m1; M[1,] <- 0 ; M ; assert.EQ.mat(M, diag(c(0,rep(1,4))), tol=0)
236 :     M <- m1; M[,3] <- 3 ; stopifnot(is(M,"sparseMatrix"), M[,3] == 3)
237 :     validObject(M)
238 :     M <- m1; M[1:3, 3] <- 0 ;M
239 :     assert.EQ.mat(M, diag(c(1,1, 0, 1,1)), tol=0)
240 :     T <- m1; T[1:3, 3] <- 10; validObject(T)
241 :     stopifnot(is(T, "dtTMatrix"), identical(T[,3], c(10,10,10,0,0)))
242 :    
243 :     M <- m2; M[1,] <- 0 ; M ; assert.EQ.mat(M, diag(c(0,rep(1,4))), tol=0)
244 :     M <- m2; M[,3] <- 3 ; stopifnot(is(M,"sparseMatrix"), M[,3] == 3)
245 :     validObject(M)
246 :     M <- m2; M[1:3, 3] <- 0 ;M
247 :     assert.EQ.mat(M, diag(c(1,1, 0, 1,1)), tol=0)
248 :     T <- m2; T[1:3, 3] <- 10; validObject(T)
249 :     stopifnot(is(T, "dtCMatrix"), identical(T[,3], c(10,10,10,0,0)))
250 :    
251 :    
252 : maechler 2098 ## "Vector indices" -------------------
253 : maechler 2096 D <- Diagonal(6)
254 : maechler 2098 M <- as(D,"dgeMatrix")
255 : maechler 2096 m <- as(D,"matrix")
256 : maechler 2098 s <- as(D,"TsparseMatrix")
257 :     S <- as(s,"CsparseMatrix")
258 :     i <- c(3,1,6); v <- c(10,15,20)
259 :     ## (logical,value) which both are recycled:
260 :     L <- c(TRUE, rep(FALSE,8)) ; z <- c(50,99)
261 : maechler 2096
262 : maechler 2098 ## vector subassignment, both with integer & logical
263 :     ## these now work correctly {though not very efficiently; hence warnings}
264 :     m[i] <- v # the role model: only first column is affected
265 :     M[i] <- v; assert.EQ.mat(M,m) # dge
266 :     D[i] <- v; assert.EQ.mat(D,m) # ddi -> dtT -> dgT
267 :     s[i] <- v; assert.EQ.mat(s,m) # dtT -> dgT
268 :     S[i] <- v; assert.EQ.mat(S,m); S # dtC -> dtT -> dgT -> dgC
269 :     ## logical
270 :     m[L] <- z
271 :     M[L] <- z; assert.EQ.mat(M,m)
272 :     D[L] <- z; assert.EQ.mat(D,m)
273 :     s[L] <- z; assert.EQ.mat(s,m)
274 :     S[L] <- z; assert.EQ.mat(S,m) ; S
275 : maechler 2096
276 : maechler 2098 ## indexing [i] vs [i,] --- now ok
277 :     stopifnot(identical4(m[i], M[i], D[i], s[i]), identical(s[i],S[i]))
278 :     stopifnot(identical4(m[L], M[L], D[L], s[L]), identical(s[L],S[L]))
279 :     assert.EQ.mat(D[i,], m[i,])
280 :     assert.EQ.mat(M[i,], m[i,])
281 :     assert.EQ.mat(s[i,], m[i,])
282 :     assert.EQ.mat(S[i,], m[i,])
283 : maechler 2096
284 : maechler 2098 assert.EQ.mat(D[,i], m[,i])
285 :     assert.EQ.mat(M[,i], m[,i])
286 :     assert.EQ.mat(s[,i], m[,i])
287 :     assert.EQ.mat(S[,i], m[,i])
288 :    
289 :    
290 : maechler 925 ## --- negative indices ----------
291 :     mc <- mC[1:5, 1:7]
292 :     mt <- mT[1:5, 1:7]
293 :     ## sub matrix
294 : maechler 1226 assert.EQ.mat(mC[1:2, 0:3], mm[1:2, 0:3]) # test 0-index
295 : maechler 925 stopifnot(identical(mc[-(3:5), 0:2], mC[1:2, 0:2]),
296 : maechler 1226 identical(mt[-(3:5), 0:2], mT[1:2, 0:2]),
297 :     identical(mC[2:3, 4], mm[2:3, 4]))
298 :     assert.EQ.mat(mC[1:2,], mm[1:2,])
299 : maechler 925 ## sub vector
300 :     stopifnot(identical4(mc[-(1:4), ], mC[5, 1:7],
301 :     mt[-(1:4), ], mT[5, 1:7]))
302 :     stopifnot(identical4(mc[-(1:4), -(2:4)], mC[5, c(1,5:7)],
303 :     mt[-(1:4), -(2:4)], mT[5, c(1,5:7)]))
304 :    
305 :     ## mixing of negative and positive must give error
306 :     assertError(mT[-1:1,])
307 :    
308 : maechler 1226 ## Sub *Assignment* ---- now works (partially):
309 :     mt0 <- mt
310 :     mt[1, 4] <- -99
311 :     mt[2:3, 1:6] <- 0
312 :     mt
313 :     m2 <- mt+mt
314 :     m2[1,4] <- -200
315 :     m2[c(1,3), c(5:6,2)] <- 1:6
316 :     stopifnot(m2[1,4] == -200,
317 :     as.vector(m2[c(1,3), c(5:6,2)]) == 1:6)
318 :     mt[,3] <- 30
319 :     mt[2:3,] <- 250
320 :     mt[1:5 %% 2 == 1, 3] <- 0
321 :     mt[3:1, 1:7 > 5] <- 0
322 :     mt
323 : maechler 1215
324 : maechler 1226 tt <- as(mt,"matrix")
325 :     ii <- c(0,2,5)
326 :     jj <- c(2:3,5)
327 :     tt[ii, jj] <- 1:6 # 0 is just "dropped"
328 :     mt[ii, jj] <- 1:6
329 :     assert.EQ.mat(mt, tt)
330 : maechler 1215
331 : maechler 1226 mt[1:5, 2:6]
332 :     as((mt0 - mt)[1:5,], "dsparseMatrix")# [1,5] and lines 2:3
333 :    
334 : maechler 1315 mt[c(2,4), ] <- 0; stopifnot(as(mt[c(2,4), ],"matrix") == 0)
335 : maechler 1226 mt[2:3, 4:7] <- 33
336 :     validObject(mt)
337 :     mt
338 :    
339 : maechler 1315 mc[1,4] <- -99 ; stopifnot(mc[1,4] == -99)
340 :     mc[1,4] <- 00 ; stopifnot(mc[1,4] == 00)
341 :     mc[1,4] <- -99 ; stopifnot(mc[1,4] == -99)
342 :     mc[1:2,4:3] <- 4:1; stopifnot(as.matrix(mc[1:2,4:3]) == 4:1)
343 :    
344 : maechler 1226 mc[-1, 3] <- -2:1 # 0 should not be entered; 'value' recycled
345 :     mt[-1, 3] <- -2:1
346 : maechler 1315 stopifnot(mc@x != 0, mt@x != 0,
347 : maechler 1707 mc[-1,3] == -2:1, mt[-1,3] == -2:1) ## failed earlier
348 : maechler 1315
349 : maechler 1707 mc0 <- mc
350 : maechler 1724 mt0 <- as(mc0, "TsparseMatrix")
351 :     m0 <- as(mc0, "matrix")
352 : maechler 1707 set.seed(1)
353 : maechler 1724 for(i in 1:50) {
354 :     mc <- mc0; mt <- mt0 ; m <- m0
355 : maechler 1707 ev <- 1:5 %% 2 == round(runif(1))# 0 or 1
356 :     j <- sample(ncol(mc), 1 + round(runif(1)))
357 :     nv <- rpois(sum(ev) * length(j), lambda = 1)
358 :     mc[ev, j] <- nv
359 : maechler 1724 m[ev, j] <- nv
360 :     mt[ev, j] <- nv
361 :     if(i %% 10 == 1) print(mc[ev,j, drop = FALSE])
362 :     stopifnot(as.vector(mc[ev, j]) == nv, ## failed earlier...
363 :     as.vector(mt[ev, j]) == nv)
364 :     validObject(mc) ; assert.EQ.mat(mc, m)
365 :     validObject(mt) ; assert.EQ.mat(mt, m)
366 : maechler 1707 }
367 :    
368 :     mc # no longer has non-structural zeros
369 : maechler 1226 mc[ii, jj] <- 1:6
370 :     mc[c(2,5), c(3,5)] <- 3.2
371 :     validObject(mc)
372 : maechler 1600 m. <- mc
373 :     mc[4,] <- 0
374 :     mc
375 : maechler 1226
376 : maechler 1331 H <- Hilbert(9)
377 : maechler 1374 Hc <- as(round(H, 3), "dsCMatrix")# a sparse matrix with no 0 ...
378 :     (trH <- tril(Hc[1:5, 1:5]))
379 :     stopifnot(is(trH, "triangularMatrix"), trH@uplo == "L")
380 : maechler 1331
381 : maechler 1374 i <- c(1:2, 4, 6:7); j <- c(2:4,6)
382 :     H[i,j] <- 0
383 : maechler 1331 (H. <- round(as(H, "sparseMatrix"), 3)[ , 2:7])
384 :     Hc. <- Hc
385 : maechler 1374 Hc.[i,j] <- 0 ## now "works", but setting "non-structural" 0s
386 :     stopifnot(as.matrix(Hc.[i,j]) == 0)
387 : maechler 1331 Hc.[, 1:6]
388 :    
389 : maechler 1724 ## an example that failed for a long time
390 : maechler 1673 sy3 <- new("dsyMatrix", Dim = as.integer(c(2, 2)), x = c(14, -1, 2, -7))
391 : maechler 1825 validObject(dm <- kronecker(Diagonal(2), sy3))# now sparse with new kronecker
392 :     dm <- Matrix(as.matrix(dm))# -> "dsyMatrix"
393 : maechler 1673 (s2 <- as(dm, "sparseMatrix"))
394 :     validObject(st <- as(s2, "TsparseMatrix"))
395 : maechler 1725 stopifnot(is(s2, "symmetricMatrix"),
396 :     is(st, "symmetricMatrix"))
397 : maechler 1673 validObject(s.32 <- st[1:3,1:2]) ## 3 x 2 - and *not* dsTMatrix
398 :     validObject(s2.32 <- s2[1:3,1:2])
399 :     I <- c(1,4:3)
400 :     stopifnot(is(s2.32, "generalMatrix"),
401 :     is(s.32, "generalMatrix"),
402 :     identical(as.mat(s.32), as.mat(s2.32)),
403 :     identical3(dm[1:3,-1], asD(s2[1:3,-1]), asD(st[1:3,-1])),
404 :     identical4(2, dm[4,3], s2[4,3], st[4,3]),
405 :     identical3(diag(dm), diag(s2), diag(st)),
406 :     is((cI <- s2[I,I]), "dsCMatrix"),
407 :     is((tI <- st[I,I]), "dsTMatrix"),
408 :     identical4(as.mat(dm)[I,I], as.mat(dm[I,I]), as.mat(tI), as.mat(cI))
409 :     )
410 :    
411 :     ## now sub-assign and check for consistency
412 :     ## symmetric subassign should keep symmetry
413 :     st[I,I] <- 0; validObject(st); stopifnot(is(st,"symmetricMatrix"))
414 :     s2[I,I] <- 0; validObject(s2); stopifnot(is(s2,"symmetricMatrix"))
415 : maechler 1724 ##
416 : maechler 1673 m <- as.mat(st)
417 :     m[2:1,2:1] <- 4:1
418 :     st[2:1,2:1] <- 4:1
419 :     s2[2:1,2:1] <- 4:1
420 :     stopifnot(identical(m, as.mat(st)),
421 :     1:4 == as.vector(s2[1:2,1:2]),
422 :     identical(m, as.mat(s2)))
423 :    
424 : maechler 1724 ## now a slightly different situation for 's2' (had bug)
425 :     s2 <- as(dm, "sparseMatrix")
426 :     s2[I,I] <- 0; diag(s2)[2:3] <- -(1:2)
427 :     stopifnot(is(s2,"symmetricMatrix"), diag(s2) == c(0:-2,0))
428 :     t2 <- as(s2, "TsparseMatrix")
429 :     m <- as.mat(s2)
430 :     s2[2:1,2:1] <- 4:1
431 :     t2[2:1,2:1] <- 4:1
432 :     m[2:1,2:1] <- 4:1
433 :     assert.EQ.mat(t2, m)
434 :     assert.EQ.mat(s2, m)
435 :     ## and the same (for a different s2 !)
436 :     s2[2:1,2:1] <- 4:1
437 :     t2[2:1,2:1] <- 4:1
438 :     assert.EQ.mat(t2, m)# ok
439 :     assert.EQ.mat(s2, m)# failed in 0.9975-8
440 :    
441 :    
442 : maechler 1673 ## m[cbind(i,j)] <- value:
443 :     m.[ cbind(3:5, 1:3) ] <- 1:3
444 :     stopifnot(m.[3,1] == 1, m.[4,2] == 2)
445 :     x.x[ cbind(2:6, 2:6)] <- 12:16
446 :     validObject(x.x)
447 :     stopifnot(class(x.x) == "dsCMatrix",
448 :     12:16 == as.mat(x.x)[cbind(2:6, 2:6)])
449 : maechler 1725 (ne1 <- (mc - m.) != 0)
450 :     stopifnot(identical(ne1, 0 != abs(mc - m.)))
451 :     (ge <- m. >= mc) # contains "=" -> result is dense
452 :     ne. <- mc != m. # was wrong (+ warning)
453 :     stopifnot(identical(!(m. < mc), m. >= mc),
454 :     identical(m. < mc, as(!ge, "sparseMatrix")),
455 :     identical(ne., Matrix:::drop0(ne1)))
456 : maechler 1673
457 : maechler 1751 (M3 <- Matrix(upper.tri(matrix(, 3, 3)))) # ltC; indexing used to fail
458 :     T3 <- as(M3, "TsparseMatrix")
459 :     stopifnot(identical(drop(M3), M3),
460 :     identical4(drop(M3[,2, drop = FALSE]), M3[,2, drop = TRUE],
461 :     drop(T3[,2, drop = FALSE]), T3[,2, drop = TRUE]),
462 :     is(T3, "triangularMatrix"),
463 :     !is(T3[,2, drop=FALSE], "triangularMatrix")
464 :     )
465 : maechler 1725
466 : maechler 1226 cat('Time elapsed: ', proc.time(),'\n') # for ``statistical reasons''

root@r-forge.r-project.org
ViewVC Help
Powered by ViewVC 1.0.0  
Thanks to:
Vienna University of Economics and Business Powered By FusionForge