SCM

SCM Repository

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

Diff of /pkg/tests/indexing.R

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1315, Mon Jul 10 16:08:05 2006 UTC revision 2113, Mon Feb 18 08:27:41 2008 UTC
# Line 1  Line 1 
1  #### For both 'Extract' ("[") and 'Replace' ("[<-") Method testing  ## For both 'Extract' ("[") and 'Replace' ("[<-") Method testing
2    
3  library(Matrix)  library(Matrix)
4    
5  source(system.file("test-tools.R", package = "Matrix"))# identical3() etc  source(system.file("test-tools.R", package = "Matrix"))# identical3() etc
6    
7    options(verbose = TRUE)# to show message()s
8    
9  ### Dense Matrices  ### Dense Matrices
10    
11  m <- Matrix(1:28, nrow = 7)  m <- Matrix(1:28 +0, nrow = 7)
12  validObject(m) ; m@x <- as.double(m@x) ; validObject(m)  validObject(m)
13  stopifnot(identical(m, m[]),  stopifnot(identical(m, m[]),
14            identical(m[2, 3],  16), # simple number            identical(m[2, 3],  16), # simple number
15            identical(m[2, 3:4], c(16,23))) # simple numeric of length 2            identical(m[2, 3:4], c(16,23))) # simple numeric of length 2
16    
17  m[2, 3:4, drop=FALSE] # sub matrix of class 'dgeMatrix'  m[2, 3:4, drop=FALSE] # sub matrix of class 'dgeMatrix'
18  m[-(4:7), 3:4]        # dito; the upper right corner of 'm'  m[-(4:7), 3:4]        # ditto; the upper right corner of 'm'
19    
20  ## rows or columns only:  ## rows or columns only:
21  m[1,]     # first row, as simple numeric vector  m[1,]     # first row, as simple numeric vector
22  m[,2]     # 2nd column  m[,2]     # 2nd column
23  m[,1:2]   # sub matrix of first two columns  m[,1:2]   # sub matrix of first two columns
24  m[-(1:6),, drop=FALSE] # not the first 6 rows, i.e. only the 7th  m[-(1:6),, drop=FALSE] # not the first 6 rows, i.e. only the 7th
25    m[integer(0),] #-> 0 x 4 Matrix
26    m[2:4, numeric(0)] #-> 3 x 0 Matrix
27    
28  ## logical indexing  ## logical indexing
29  stopifnot(identical(m[2,3], m[(1:nrow(m)) == 2, (1:ncol(m)) == 3]),  stopifnot(identical(m[2,3], m[(1:nrow(m)) == 2, (1:ncol(m)) == 3]),
# Line 42  Line 46 
46  m[, 1] <- -1  m[, 1] <- -1
47  m[1:3,]  m[1:3,]
48    
49    m. <- as.matrix(m)
50    
51    ## m[ cbind(i,j) ] indexing:
52    ij <- cbind(1:6, 2:3)
53    stopifnot(identical(m[ij], m.[ij]))
54    
55    ## testing operations on logical Matrices rather more than indexing:
56  g10 <- m [ m > 10 ]  g10 <- m [ m > 10 ]
57  stopifnot(18 == length(g10))  stopifnot(18 == length(g10))
 if(paste(R.version$major, R.version$minor, sep=".") >= "2.3")  
     ## Buglet in R(<= 2.2.1)'s possibleExtends()  
58      stopifnot(10 == length(m[ m <= 10 ]))      stopifnot(10 == length(m[ m <= 10 ]))
59    sel <- (20 <  m) & (m <  150)
60    sel.<- (20 <  m.)& (m.<  150)
61    nsel <-(20 >= m) | (m >= 150)
62    (ssel <- as(sel, "sparseMatrix"))
63    stopifnot(is(sel, "lMatrix"), is(ssel, "lsparseMatrix"),
64              identical3(as.mat(sel.), as.mat(sel), as.mat(ssel)),
65              identical3(!sel, !ssel, nsel), # !<sparse> is typically dense
66              identical3(m[ sel],  m[ ssel], as.matrix(m)[as.matrix( ssel)]),
67              identical3(m[!sel],  m[!ssel], as.matrix(m)[as.matrix(!ssel)])
68              )
69    
70    ## more sparse Matrices --------------------------------------
 ### Sparse Matrices --------------------------------------  
71    
72  m <- 1:800  m <- 1:800
73  set.seed(101) ; m[sample(800, 600)] <- 0  set.seed(101) ; m[sample(800, 600)] <- 0
# Line 65  Line 83 
83  mC[1:2,]  mC[1:2,]
84  mC[7,  drop = FALSE]  mC[7,  drop = FALSE]
85  assert.EQ.mat(mC[1:2,], mm[1:2,])  assert.EQ.mat(mC[1:2,], mm[1:2,])
86  stopifnot(all.equal(mC[,3],   mm[,3]))  
87    ## *repeated* (aka 'duplicated') indices - did not work at all ...
88    i <- rep(8:10,2)
89    j <- c(2:4, 4:3)
90    assert.EQ.mat(mC[i,], mm[i,])
91    assert.EQ.mat(mC[,j], mm[,j])
92    assert.EQ.mat(mC[i, 2:1], mm[i, 2:1])
93    assert.EQ.mat(mC[c(4,1,2:1), j], mm[c(4,1,2:1), j])
94    assert.EQ.mat(mC[i,j], mm[i,j])
95    set.seed(7)
96    for(n in 1:50) {
97        i <- sample(sample(nrow(mC), 7), 20, replace = TRUE)
98        j <- sample(sample(ncol(mC), 6), 17, replace = TRUE)
99        assert.EQ.mat(mC[i,j], mm[i,j])
100    }
101    
102    ##---- Symmetric indexing of symmetric Matrix ----------
103    m. <- mC; m.[, c(2, 7:12)] <- 0
104    validObject(S <- crossprod(add.simpleDimnames(m.) %% 100))
105    ss <- as(S, "matrix")
106    T <- as(S, "TsparseMatrix")
107    ## non-repeated indices:
108    i <- c(7:5, 2:4);assert.EQ.mat(T[i,i], ss[i,i])
109    N <- nrow(T)
110    set.seed(11)
111    for(n in 1:50) {
112        i <- sample(N, max(2, sample(N,1)), replace = FALSE)
113        validObject(Tii <- T[i,i])
114        stopifnot(is(Tii, "dsTMatrix"), # remained symmetric Tsparse
115                  identical(t(Tii), t(T)[i,i]))
116        assert.EQ.mat(Tii, ss[i,i])
117    }
118    
119    ## repeated ones ``the challenge'' (to do smartly):
120    j <- c(4, 4, 9, 12, 9, 4, 17, 3, 18, 4, 12, 18, 4, 9)
121    assert.EQ.mat(T[j,j], ss[j,j])
122    ## and another two sets  (a, A) &  (a., A.) :
123    a <- matrix(0, 6,6)
124    a[upper.tri(a)] <- (utr <- c(2, 0,-1, 0,0,5, 7,0,0,0, 0,0,-2,0,8))
125    ta <- t(a); ta[upper.tri(a)] <- utr; a <- t(ta)
126    diag(a) <- c(0,3,0,4,6,0)
127    A <- as(Matrix(a), "TsparseMatrix")
128    A. <- A
129    diag(A.) <- 10 * (1:6)
130    a. <- as(A., "matrix")
131    ## More testing {this was not working for a long time..}
132    set.seed(1)
133    for(n in 1:100) {
134        i <- sample(1:nrow(A), 3+2*rpois(1, lam=3), replace=TRUE)
135        Aii  <- A[i,i]
136        A.ii <- A.[i,i]
137        stopifnot(class(Aii) == class(A),
138                  class(A.ii) == class(A.))
139        assert.EQ.mat(Aii , a [i,i])
140        assert.EQ.mat(A.ii, a.[i,i])
141        assert.EQ.mat(T[i,i], ss[i,i])
142    }
143    
144    
145    stopifnot(all.equal(mC[,3], mm[,3]),
146              identical(mC[ij], mm[ij]))
147  assert.EQ.mat(mC[7, , drop=FALSE], mm[7, , drop=FALSE])  assert.EQ.mat(mC[7, , drop=FALSE], mm[7, , drop=FALSE])
148    
149  stopifnot(identical(mC[7,  drop = FALSE],  stopifnot(dim(mC[numeric(0), ]) == c(0,20), # used to give warnings
150              dim(mC[, integer(0)]) == c(40,0),
151              identical(mC[, integer(0)], mC[, FALSE]),
152              identical(mC[7,  drop = FALSE],
153                      mC[7,, drop = FALSE]))                      mC[7,, drop = FALSE]))
154  validObject(print(mT[,c(2,4)]))  validObject(print(mT[,c(2,4)]))
155  stopifnot(all.equal(mT[2,], mm[2,]),  stopifnot(all.equal(mT[2,], mm[2,]),
# Line 82  Line 163 
163            identical3(mm[3,], mC[3,], mT[3,]),            identical3(mm[3,], mC[3,], mT[3,]),
164            identical3(mT[2,3], mC[2,3], 0),            identical3(mT[2,3], mC[2,3], 0),
165            identical(mT[], mT),            identical(mT[], mT),
166            ## TODO: identical4() with  m[c(3,7), 2:4] - fail because of 'dimnames'            identical4(       mm[c(3,7), 2:4],  as.mat( m[c(3,7), 2:4]),
167            identical3(as(mC[c(3,7), 2:4],"matrix"), mm[c(3,7), 2:4],                       as.mat(mT[c(3,7), 2:4]), as.mat(mC[c(3,7), 2:4]))
168                       as(mT[c(3,7), 2:4],"matrix")))            )
169    
170    x.x <- crossprod(mC)
171    stopifnot(class(x.x) == "dsCMatrix",
172              class(x.x. <- round(x.x / 10000)) == "dsCMatrix",
173              identical(x.x[cbind(2:6, 2:6)],
174                        diag(x.x [2:6, 2:6])))
175    head(x.x.) # Note the *non*-structural 0's printed as "0"
176    tail(x.x., -3) # all but the first three lines
177    
178    lx.x <- as(x.x, "lsCMatrix") # FALSE only for "structural" 0
179    (l10 <- lx.x[1:10, 1:10])# "lsC"
180    (l3 <-  lx.x[1:3, ])
181    m.x <- as(x.x, "matrix")
182    stopifnot(class(l10) == "lsCMatrix", # symmetric indexing -> symmetric !
183              identical(as.mat(lx.x), m.x != 0),
184              identical(as.logical(lx.x), as.logical(m.x)),
185              identical(as.mat(l10), m.x[1:10, 1:10] != 0),
186              identical(as.mat(l3 ), m.x[1:3, ] != 0)
187              )
188    
189    ##-- Sub*assignment* with repeated / duplicated index:
190    A <- Matrix(0,4,3) ; A[c(1,2,1), 2] <- 1 ; A
191    B <- A;              B[c(1,2,1), 2] <- 1:3; B; B. <- B
192    B.[3,] <- rbind(4:2)
193    diag(B.) <- 10 * diag(B.)
194    C <- B.; C[,2] <- C[,2];  C[1,] <- C[1,]; C[2:3,2:1] <- C[2:3,2:1]
195    stopifnot(identical(unname(as.matrix(A)),
196                        local({a <- matrix(0,4,3); a[c(1,2,1), 2] <-  1 ; a})),
197              identical(unname(as.matrix(B)),
198                        local({a <- matrix(0,4,3); a[c(1,2,1), 2] <- 1:3; a})),
199              identical(C, drop0(B.)))
200    
201    
202    ## used to fail
203    n <- 5 ## or much larger
204    sm <- new("dsTMatrix", i=as.integer(1),j=as.integer(1),
205              Dim=as.integer(c(n,n)), x = 1)
206    (cm <- as(sm, "CsparseMatrix"))
207    sm[2,]
208    stopifnot(sm[2,] == c(0:1, rep.int(0,ncol(sm)-2)),
209              sm[2,] == cm[2,],
210              sm[,3] == sm[3,],
211              all(sm[,-(1:3)] == t(sm[-(1:3),])), # all(<lge.>)
212              all(sm[,-(1:3)] == 0)
213              )
214    
215    ### Diagonal -- Sparse:
216    m0 <- Diagonal(5)
217    (m1 <- as(m0, "sparseMatrix"))  # dtTMatrix
218    (m2 <- as(m0, "CsparseMatrix")) # dtCMatrix (with an irrelevant warning)
219    m1g <- as(m1, "generalMatrix")
220    stopifnot(is(m1g, "dgTMatrix"))
221    assert.EQ.mat(m2[1:3,],    diag(5)[1:3,])
222    assert.EQ.mat(m2[,c(4,1)], diag(5)[,c(4,1)])
223    stopifnot(identical(m2[1:3,], as(m1[1:3,], "CsparseMatrix")),
224              identical(Matrix:::uniqTsparse(m1[, c(4,2)]),
225                        Matrix:::uniqTsparse(as(m2[, c(4,2)], "TsparseMatrix")))
226              )## failed in 0.9975-11
227    
228    M <- m0; M[1,] <- 0
229    stopifnot(identical(M, Diagonal(x=c(0, rep(1,4)))))
230    M <- m0; M[,3] <- 3 ; M ; stopifnot(is(M, "sparseMatrix"), M[,3] == 3)
231    validObject(M)
232    M <- m0; M[1:3, 3] <- 0 ;M
233    T <- m0; T[1:3, 3] <- 10
234    stopifnot(identical(M, Diagonal(x=c(1,1, 0, 1,1))),
235              is(T, "triangularMatrix"), identical(T[,3], c(10,10,10,0,0)))
236    
237    M <- m1; M[1,] <- 0 ; M ; assert.EQ.mat(M, diag(c(0,rep(1,4))), tol=0)
238    M <- m1; M[,3] <- 3 ; stopifnot(is(M,"sparseMatrix"), M[,3] == 3)
239    validObject(M)
240    M <- m1; M[1:3, 3] <- 0 ;M
241    assert.EQ.mat(M, diag(c(1,1, 0, 1,1)), tol=0)
242    T <- m1; T[1:3, 3] <- 10; validObject(T)
243    stopifnot(is(T, "dtTMatrix"), identical(T[,3], c(10,10,10,0,0)))
244    
245    M <- m2; M[1,] <- 0 ; M ; assert.EQ.mat(M, diag(c(0,rep(1,4))), tol=0)
246    M <- m2; M[,3] <- 3 ; stopifnot(is(M,"sparseMatrix"), M[,3] == 3)
247    validObject(M)
248    M <- m2; M[1:3, 3] <- 0 ;M
249    assert.EQ.mat(M, diag(c(1,1, 0, 1,1)), tol=0)
250    T <- m2; T[1:3, 3] <- 10; validObject(T)
251    stopifnot(is(T, "dtCMatrix"), identical(T[,3], c(10,10,10,0,0)))
252    
253    
254    ## "Vector indices" -------------------
255    D <- Diagonal(6)
256    M <- as(D,"dgeMatrix")
257    m <- as(D,"matrix")
258    s <- as(D,"TsparseMatrix")
259    S <- as(s,"CsparseMatrix")
260    i <- c(3,1,6); v <- c(10,15,20)
261    ## (logical,value) which both are recycled:
262    L <- c(TRUE, rep(FALSE,8)) ; z <- c(50,99)
263    
264    ## vector subassignment, both with integer & logical
265    ## these now work correctly {though not very efficiently; hence warnings}
266    m[i] <- v # the role model: only first column is affected
267    M[i] <- v; assert.EQ.mat(M,m) # dge
268    D[i] <- v; assert.EQ.mat(D,m) # ddi -> dtT -> dgT
269    s[i] <- v; assert.EQ.mat(s,m) # dtT -> dgT
270    S[i] <- v; assert.EQ.mat(S,m); S # dtC -> dtT -> dgT -> dgC
271    ## logical
272    m[L] <- z
273    M[L] <- z; assert.EQ.mat(M,m)
274    D[L] <- z; assert.EQ.mat(D,m)
275    s[L] <- z; assert.EQ.mat(s,m)
276    S[L] <- z; assert.EQ.mat(S,m) ; S
277    
278    ## indexing [i]  vs  [i,] --- now ok
279    stopifnot(identical4(m[i], M[i], D[i], s[i]), identical(s[i],S[i]))
280    stopifnot(identical4(m[L], M[L], D[L], s[L]), identical(s[L],S[L]))
281    assert.EQ.mat(D[i,], m[i,])
282    assert.EQ.mat(M[i,], m[i,])
283    assert.EQ.mat(s[i,], m[i,])
284    assert.EQ.mat(S[i,], m[i,])
285    
286    assert.EQ.mat(D[,i], m[,i])
287    assert.EQ.mat(M[,i], m[,i])
288    assert.EQ.mat(s[,i], m[,i])
289    assert.EQ.mat(S[,i], m[,i])
290    
291    
292  ## --- negative indices ----------  ## --- negative indices ----------
293  mc <- mC[1:5, 1:7]  mc <- mC[1:5, 1:7]
# Line 140  Line 343 
343  mc[1,4] <- -99 ; stopifnot(mc[1,4] == -99)  mc[1,4] <- -99 ; stopifnot(mc[1,4] == -99)
344  mc[1:2,4:3] <- 4:1; stopifnot(as.matrix(mc[1:2,4:3]) == 4:1)  mc[1:2,4:3] <- 4:1; stopifnot(as.matrix(mc[1:2,4:3]) == 4:1)
345    
 ## Debugging:  R bug --   debug(Matrix:::replCmat)  has no effect  
   
346  mc[-1, 3] <- -2:1 # 0 should not be entered; 'value' recycled  mc[-1, 3] <- -2:1 # 0 should not be entered; 'value' recycled
347  mt[-1, 3] <- -2:1  mt[-1, 3] <- -2:1
348  stopifnot(mc@x != 0, mt@x != 0,  stopifnot(mc@x != 0, mt@x != 0,
349            mc[-1,3] == -2:1, mt[-1,3] == -2:1) ##--> BUG -- fixed            mc[-1,3] == -2:1, mt[-1,3] == -2:1) ## failed earlier
350  ## source("~/R/Pkgs/Matrix/R/Tsparse.R")  
351  ## Matrix_expand_pointers <- Matrix:::Matrix_expand_pointers  mc0 <- mc
352  ## -> open ../R/dgCMatrix.R  --> replCmat  .. now eval-line by line ..  mt0 <- as(mc0, "TsparseMatrix")
353    m0  <- as(mc0, "matrix")
354  ev <- 1:5 %% 2 == 0  set.seed(1)
355  mc[ev, 3] <- 0:1  for(i in 1:50) {
356  ##FIXME stopifnot(mc[ev, 3] == 0:1) ##-> BUG  {very peculiar; the 2nd time it works ...}      mc <- mc0; mt <- mt0 ; m <- m0
357  validObject(mc)      ev <- 1:5 %% 2 == round(runif(1))# 0 or 1
358  mc # now shows a non-structural zeros      j <- sample(ncol(mc), 1 + round(runif(1)))
359        nv <- rpois(sum(ev) * length(j), lambda = 1)
360        mc[ev, j] <- nv
361         m[ev, j] <- nv
362        mt[ev, j] <- nv
363        if(i %% 10 == 1) print(mc[ev,j, drop = FALSE])
364        stopifnot(as.vector(mc[ev, j]) == nv, ## failed earlier...
365                  as.vector(mt[ev, j]) == nv)
366        validObject(mc) ; assert.EQ.mat(mc, m)
367        validObject(mt) ; assert.EQ.mat(mt, m)
368    }
369    
370    mc # no longer has non-structural zeros
371  mc[ii, jj] <- 1:6  mc[ii, jj] <- 1:6
372  mc[c(2,5), c(3,5)] <- 3.2  mc[c(2,5), c(3,5)] <- 3.2
373  validObject(mc)  validObject(mc)
374  (m. <- mc)  m. <- mc
375  ## FIXME: mc[4,] <- 0 # -> error -- another Bug  mc[4,] <- 0
376    mc
377    
378    S <- as(Diagonal(5),"sparseMatrix")
379    H <- Hilbert(9)
380    Hc <- as(round(H, 3), "dsCMatrix")# a sparse matrix with no 0 ...
381    (trH <- tril(Hc[1:5, 1:5]))
382    stopifnot(is(trH, "triangularMatrix"), trH@uplo == "L",
383              is(S, "triangularMatrix"))
384    
385    ## triangular assignment
386    ## the slick (but inefficient in case of sparse!) way to assign sub-diagonals:
387    ## equivalent to tmp <- `diag<-`(S[,-1], -2:1); S[,-1] <- tmp
388    ## which dispatches to (x="TsparseMatrix", i="missing",j="index", value="replValue")
389    diag(S[,-1]) <- -2:1 # used to give a wrong warning
390    S <- as(S,"triangularMatrix")
391    assert.EQ.mat(S, local({s <- diag(5); diag(s[,-1]) <- -2:1; s}))
392    
393    trH[c(1:2,4), c(2:3,5)] <- 0 # gave an *error* upto Jan.2008
394    trH[ lower.tri(trH) ] <- 0   # ditto, because of callNextMethod()
395    
396    m <- Matrix(0+1:28, nrow = 4)
397    m[-3,c(2,4:5,7)] <- m[ 3, 1:4] <- m[1:3, 6] <- 0
398    mT <- as(m, "dgTMatrix")
399    stopifnot(identical(mT[lower.tri(mT)],
400                        m [lower.tri(m) ]))
401    lM <- upper.tri(mT, diag=TRUE)
402    mT[lM] <- 0
403     m[lM] <- 0
404    assert.EQ.mat(mT, as(m,"matrix"))
405    mT[lM] <- -1:0
406     m[lM] <- -1:0
407    assert.EQ.mat(mT, as(m,"matrix"))
408    (mT <- drop0(mT))
409    
410    i <- c(1:2, 4, 6:7); j <- c(2:4,6)
411    H[i,j] <- 0
412    (H. <- round(as(H, "sparseMatrix"), 3)[ , 2:7])
413    Hc. <- Hc
414    Hc.[i,j] <- 0 ## now "works", but setting "non-structural" 0s
415    stopifnot(as.matrix(Hc.[i,j]) == 0)
416    Hc.[, 1:6]
417    
418    ## an example that failed for a long time
419    sy3 <- new("dsyMatrix", Dim = as.integer(c(2, 2)), x = c(14, -1, 2, -7))
420    validObject(dm <- kronecker(Diagonal(2), sy3))# now sparse with new kronecker
421    dm <- Matrix(as.matrix(dm))# -> "dsyMatrix"
422    (s2 <- as(dm, "sparseMatrix"))
423    validObject(st <- as(s2, "TsparseMatrix"))
424    stopifnot(is(s2, "symmetricMatrix"),
425              is(st, "symmetricMatrix"))
426    validObject(s.32  <- st[1:3,1:2]) ## 3 x 2 - and *not* dsTMatrix
427    validObject(s2.32 <- s2[1:3,1:2])
428    I <- c(1,4:3)
429    stopifnot(is(s2.32, "generalMatrix"),
430              is(s.32,  "generalMatrix"),
431              identical(as.mat(s.32), as.mat(s2.32)),
432              identical3(dm[1:3,-1], asD(s2[1:3,-1]), asD(st[1:3,-1])),
433              identical4(2, dm[4,3], s2[4,3], st[4,3]),
434              identical3(diag(dm), diag(s2), diag(st)),
435              is((cI <- s2[I,I]), "dsCMatrix"),
436              is((tI <- st[I,I]), "dsTMatrix"),
437              identical4(as.mat(dm)[I,I], as.mat(dm[I,I]), as.mat(tI), as.mat(cI))
438              )
439    
440    ## now sub-assign  and check for consistency
441    ## symmetric subassign should keep symmetry
442    st[I,I] <- 0; validObject(st); stopifnot(is(st,"symmetricMatrix"))
443    s2[I,I] <- 0; validObject(s2); stopifnot(is(s2,"symmetricMatrix"))
444    ##
445    m <- as.mat(st)
446     m[2:1,2:1] <- 4:1
447    st[2:1,2:1] <- 4:1
448    s2[2:1,2:1] <- 4:1
449    stopifnot(identical(m, as.mat(st)),
450              1:4 == as.vector(s2[1:2,1:2]),
451              identical(m, as.mat(s2)))
452    
453    ## now a slightly different situation for 's2' (had bug)
454    s2 <- as(dm, "sparseMatrix")
455    s2[I,I] <- 0; diag(s2)[2:3] <- -(1:2)
456    stopifnot(is(s2,"symmetricMatrix"), diag(s2) == c(0:-2,0))
457    t2 <- as(s2, "TsparseMatrix")
458    m <- as.mat(s2)
459    s2[2:1,2:1] <- 4:1
460    t2[2:1,2:1] <- 4:1
461     m[2:1,2:1] <- 4:1
462    assert.EQ.mat(t2, m)
463    assert.EQ.mat(s2, m)
464    ## and the same (for a different s2 !)
465    s2[2:1,2:1] <- 4:1
466    t2[2:1,2:1] <- 4:1
467    assert.EQ.mat(t2, m)# ok
468    assert.EQ.mat(s2, m)# failed in 0.9975-8
469    
470    
471    ## m[cbind(i,j)] <- value:
472    m.[ cbind(3:5, 1:3) ] <- 1:3
473    stopifnot(m.[3,1] == 1, m.[4,2] == 2)
474    x.x[ cbind(2:6, 2:6)] <- 12:16
475    validObject(x.x)
476    stopifnot(class(x.x) == "dsCMatrix",
477              12:16 == as.mat(x.x)[cbind(2:6, 2:6)])
478    (ne1 <- (mc - m.) != 0)
479    stopifnot(identical(ne1, 0 != abs(mc - m.)))
480    (ge <- m. >= mc) # contains "=" -> result is dense
481    ne. <- mc != m.  # was wrong (+ warning)
482    stopifnot(identical(!(m. < mc), m. >= mc),
483              identical(m. < mc, as(!ge, "sparseMatrix")),
484              identical(ne., drop0(ne1)))
485    
486    (M3 <- Matrix(upper.tri(matrix(, 3, 3)))) # ltC; indexing used to fail
487    T3 <- as(M3, "TsparseMatrix")
488    stopifnot(identical(drop(M3), M3),
489              identical4(drop(M3[,2, drop = FALSE]), M3[,2, drop = TRUE],
490                         drop(T3[,2, drop = FALSE]), T3[,2, drop = TRUE]),
491              is(T3, "triangularMatrix"),
492              !is(T3[,2, drop=FALSE], "triangularMatrix")
493              )
494    
495    M <- Diagonal(4); M[1,2] <- 2
496    M. <- as(M, "CsparseMatrix")
497    (R <- as(M., "RsparseMatrix"))
498    stopifnot(is(M, "triangularMatrix"),
499              is(M.,"triangularMatrix"),
500              is(R, "triangularMatrix"))
501    stopifnot(dim(M[2:3, FALSE]) == c(2,0),
502              dim(R[2:3, FALSE]) == c(2,0),
503              identical(M [2:3,TRUE], M [2:3,]),
504              identical(M.[2:3,TRUE], M.[2:3,]),
505              identical(R [2:3,TRUE], R [2:3,]),
506              dim(R[FALSE, FALSE]) == c(0,0))
507    
508  cat('Time elapsed: ', proc.time(),'\n') # for ``statistical reasons''  cat('Time elapsed: ', proc.time(),'\n') # for ``statistical reasons''

Legend:
Removed from v.1315  
changed lines
  Added in v.2113

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