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 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426
|
### =========================================================================
### Visualize and simplify a tree of delayed operations
### -------------------------------------------------------------------------
###
### - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
### showtree()
###
### A much more condensed version of str().
###
.node_as_one_line_summary <- function(x, show.node.dim=TRUE)
{
if (is(x, "DelayedOp")) {
ans <- summary(x)
} else {
ans <- sprintf("[seed] %s object", class(x))
}
if (show.node.dim) {
dim_in1string <- paste0(dim(x), collapse="x")
sparse <- if (is_sparse(x)) ", sparse" else ""
ans <- sprintf("%s %s%s: %s", dim_in1string, type(x), sparse, ans)
}
ans
}
### Avoid use of non-ASCII characters in R source code. There must be a much
### better way to do this.
.VBAR <- rawToChar(as.raw(c(0xe2, 0x94, 0x82)))
.TEE <- rawToChar(as.raw(c(0xe2, 0x94, 0x9c)))
.ELBOW <- rawToChar(as.raw(c(0xe2, 0x94, 0x94)))
.HBAR <- rawToChar(as.raw(c(0xe2, 0x94, 0x80)))
### 'last.child' can be NA, TRUE, or FALSE. NA means 'x' is the root of the
### tree.
.rec_showtree <- function(x, indent="", last.child=NA,
prefix="", show.node.dim=TRUE)
{
stopifnot(isSingleString(indent))
stopifnot(is.logical(last.child), length(last.child) == 1L)
if (!is.list(x)) {
## Display summary line.
if (is.na(last.child)) {
## No Tprefix.
Tprefix <- ""
} else {
## 3-char Tprefix
Tprefix <- paste0(if (last.child) .ELBOW else .TEE, .HBAR, " ")
}
x_as1line <- .node_as_one_line_summary(x, show.node.dim=show.node.dim)
cat(indent, Tprefix, prefix, x_as1line, "\n", sep="")
if (!is(x, "DelayedOp"))
return(invisible(NULL))
}
## Display children.
if (!is.na(last.child)) {
## Increase indent by 3 chars.
indent <- paste0(indent,
if (last.child) " " else .VBAR,
strrep(" ", 2 + nchar(prefix)))
}
if (is(x, "DelayedUnaryOp")) {
if (is(x, "DelayedSubassign") && !is.null(dim(x@Rvalue))) {
## 'x@Rvalue' is an array-like object.
.rec_showtree(x@seed, indent, last.child=FALSE,
show.node.dim=show.node.dim)
.rec_showtree(x@Rvalue, indent, last.child=TRUE,
prefix="right value: ", show.node.dim=show.node.dim)
} else {
.rec_showtree(x@seed, indent, last.child=TRUE,
show.node.dim=show.node.dim)
}
} else {
if (is(x, "DelayedNaryOp"))
x <- x@seeds
nchildren <- length(x)
for (i in seq_len(nchildren))
.rec_showtree(x[[i]], indent, last.child=(i==nchildren),
show.node.dim=show.node.dim)
}
}
showtree <- function(x, show.node.dim=TRUE)
{
if (!isTRUEorFALSE(show.node.dim))
stop("'show.node.dim' must be TRUE or FALSE")
.rec_showtree(x, show.node.dim=show.node.dim)
}
setMethod("show", "DelayedOp", function(object) .rec_showtree(object))
### - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
### simplify()
###
.normarg_incremental <- function(incremental)
{
if (!isTRUEorFALSE(incremental))
stop("'incremental' must be TRUE or FALSE")
incremental
}
setGeneric("simplify", signature="x",
function(x, incremental=FALSE) standardGeneric("simplify")
)
setMethod("simplify", "ANY",
function(x, incremental=FALSE)
{
.normarg_incremental(incremental)
x
}
)
setMethod("simplify", "DelayedSubset",
function(x, incremental=FALSE)
{
if (!.normarg_incremental(incremental))
x@seed <- simplify(x@seed)
x1 <- x@seed
if (is_noop(x))
return(x1)
if (is(x1, "DelayedSubset")) {
## ACTION: merge ops + remove if no-op.
x1 <- subset_DelayedSubset(x1, x@index)
if (is_noop(x1))
return(x1@seed)
return(x1)
}
if (is(x1, "DelayedAperm")) {
## ACTION: swap ops.
index2 <- project_index_on_seed(x@index, x1)
x2 <- new_DelayedSubset(x1@seed, index2)
x2 <- simplify(x2, incremental=TRUE)
x1 <- BiocGenerics:::replaceSlots(x1, seed=x2, check=FALSE)
return(x1)
}
if (is(x1, "DelayedUnaryIsoOpStack")) {
## ACTION: swap ops.
x2 <- x
x2@seed <- x1@seed
x2 <- simplify(x2, incremental=TRUE)
x1 <- BiocGenerics:::replaceSlots(x1, seed=x2, check=FALSE)
return(x1)
}
if (is(x1, "DelayedUnaryIsoOpWithArgs")) {
## ACTION: swap ops.
x2 <- x
x2@seed <- x1@seed
x2 <- simplify(x2, incremental=TRUE)
Largs <- subset_args(x1@Largs, x1@Lalong, x@index)
Rargs <- subset_args(x1@Rargs, x1@Ralong, x@index)
x1 <- BiocGenerics:::replaceSlots(x1, seed=x2,
Largs=Largs,
Rargs=Rargs,
check=FALSE)
return(x1)
}
if (is(x1, "DelayedSubassign")) {
## ACTION: swap ops.
x1 <- subset_DelayedSubassign(x1, x@index)
x1@seed <- simplify(x1@seed, incremental=TRUE)
x1@Rvalue <- simplify(x1@Rvalue, incremental=TRUE)
return(x1)
}
if (is(x1, "DelayedDimnames")) {
## ACTION: swap ops.
x2 <- x
x2@seed <- x1@seed
x2 <- simplify(x2, incremental=TRUE)
x1 <- new_DelayedDimnames(x2, dimnames(x))
return(x1)
}
x
}
)
setMethod("simplify", "DelayedAperm",
function(x, incremental=FALSE)
{
if (!.normarg_incremental(incremental))
x@seed <- simplify(x@seed)
x1 <- x@seed
if (is_noop(x))
return(x1)
if (is(x1, "DelayedAperm")) {
## ACTION: merge ops + remove if no-op.
x1@perm <- x1@perm[x@perm]
if (is_noop(x1))
return(x1@seed)
return(simplify(x1, incremental=TRUE))
}
if (is(x1, "DelayedUnaryIsoOpStack")) {
## ACTION: swap ops.
x@seed <- x1@seed
x1@seed <- simplify(x, incremental=TRUE)
return(x1)
}
if (is(x1, "DelayedUnaryIsoOpWithArgs")) {
perm0 <- x@perm[!is.na(x@perm)]
set_Lalong_to_NA <- !(x1@Lalong %in% perm0)
set_Ralong_to_NA <- !(x1@Ralong %in% perm0)
if (all(set_Lalong_to_NA) && all(set_Ralong_to_NA)) {
## ACTION: swap ops.
x1@Lalong[set_Lalong_to_NA] <- NA_integer_
x1@Ralong[set_Ralong_to_NA] <- NA_integer_
x@seed <- x1@seed
x1@seed <- simplify(x, incremental=TRUE)
return(x1)
}
}
if (is(x1, "DelayedDimnames")) {
## ACTION: swap ops.
x2 <- x
x2@seed <- x1@seed
x2 <- simplify(x2, incremental=TRUE)
x1 <- new_DelayedDimnames(x2, dimnames(x))
return(x1)
}
x
}
)
setMethod("simplify", "DelayedUnaryIsoOpStack",
function(x, incremental=FALSE)
{
if (!.normarg_incremental(incremental))
x@seed <- simplify(x@seed)
x1 <- x@seed
if (is(x1, "DelayedUnaryIsoOpStack")) {
## ACTION: merge ops.
x1@OPS <- c(x1@OPS, x@OPS)
return(x1)
}
if (is(x1, "DelayedDimnames")) {
## ACTION: swap ops.
x@seed <- x1@seed
x1@seed <- simplify(x, incremental=TRUE)
return(x1)
}
x
}
)
setMethod("simplify", "DelayedUnaryIsoOpWithArgs",
function(x, incremental=FALSE)
{
if (!.normarg_incremental(incremental))
x@seed <- simplify(x@seed)
x1 <- x@seed
if (is(x1, "DelayedDimnames")) {
## ACTION: swap ops.
x@seed <- x1@seed
x1@seed <- simplify(x, incremental=TRUE)
return(x1)
}
x
}
)
setMethod("simplify", "DelayedSubassign",
function(x, incremental=FALSE)
{
if (!.normarg_incremental(incremental)) {
x@seed <- simplify(x@seed)
x@Rvalue <- simplify(x@Rvalue)
}
x1 <- x@seed
if (is_noop(x))
return(x1)
if (all(x@.nogap) && !is.null(dim(x@Rvalue))) {
## "Full replacement" case with an array-like object on the right.
## 'x' represents a subassignment that replaces all the array
## elements in the left value. This is a degenerate case of
## subassignment where we never need to extract any array element
## from 'x@seed'.
if (all(S4Vectors:::sapply_isNULL(x@Lindex))) {
## "Filling" case (a special case of "Full replacement") with
## an array-like object on the right.
## ACTION: replace DelayedSubassign op with right value.
x1 <- x@Rvalue
} else {
## ACTION: replace DelayedSubassign op with a subset of
## right value.
index <- vector("list", length=length(x@Lindex))
Mindex <- make_Mindex(index, x)
x1 <- new_DelayedSubset(x@Rvalue, Mindex)
x1 <- simplify(x1, incremental=TRUE)
}
## Propagate dimnames of left value.
x <- new_DelayedDimnames(x1, dimnames(x@seed))
x <- simplify(x, incremental=TRUE)
return(x)
}
Rvalue <- x@Rvalue
if (is(Rvalue, "DelayedDimnames")) {
## ACTION: remove DelayedDimnames op from right value.
x@Rvalue <- Rvalue@seed
}
if (is(x1, "DelayedDimnames")) {
## ACTION: swap ops.
x@seed <- x1@seed
x1@seed <- x
return(x1)
}
x
}
)
setMethod("simplify", "DelayedDimnames",
function(x, incremental=FALSE)
{
if (!.normarg_incremental(incremental))
x@seed <- simplify(x@seed)
x1 <- x@seed
if (is_noop(x))
return(x1)
if (is(x1, "DelayedDimnames")) {
## ACTION: merge ops + remove if no-op.
x <- new_DelayedDimnames(x1@seed, dimnames(x))
if (is_noop(x))
return(x@seed)
return(x)
}
x
}
)
### - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
### contentIsPristine()
###
### Return FALSE if the tree contains delayed operations that modify
### the "original array values" (i.e. the values contained in the seeds).
### The value-modifying nodes are:
### - DelayedUnaryIsoOpStack, DelayedUnaryIsoOpWithArgs, and
### DelayedNaryIsoOp nodes;
### - DelayedSubassign nodes that are not no-ops.
contentIsPristine <- function(x)
{
if (!is.list(x)) {
if (!is(x, "DelayedOp"))
return(TRUE)
if (is(x, "DelayedUnaryIsoOpStack") ||
is(x, "DelayedUnaryIsoOpWithArgs") ||
is(x, "DelayedNaryIsoOp"))
return(FALSE)
if (is(x, "DelayedUnaryOp")) {
if (is(x, "DelayedSubassign") && !is_noop(x))
return(FALSE)
x <- list(x@seed)
} else {
x <- x@seeds
}
}
nchildren <- length(x)
for (i in seq_len(nchildren)) {
if (!contentIsPristine(x[[i]]))
return(FALSE)
}
TRUE
}
### - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
### netSubsetAndAperm()
###
### Only supported if nseed() == 1
###
IS_NOT_SUPOORTED_IF_MULTIPLE_SEEDS <- c(
"is not supported on a DelayedArray object with multiple seeds at the ",
"moment. Note that you can check the number of seeds with nseed()."
)
### Remove DelayedUnaryIsoOp nodes from a linear tree.
### Raise an error if the tree is not linear.
.remove_unary_iso_ops <- function(x)
{
if (!is(x, "DelayedOp"))
return(x)
if (is(x, "DelayedNaryOp")) {
## Tree is not linear.
stop(wmsg("netSubsetAndAperm() ",
IS_NOT_SUPOORTED_IF_MULTIPLE_SEEDS))
}
x1 <- .remove_unary_iso_ops(x@seed)
if (is(x, "DelayedUnaryIsoOp")) {
x <- x1
} else {
x@seed <- x1
}
x
}
setGeneric("netSubsetAndAperm", signature="x",
function(x, as.DelayedOp=FALSE) standardGeneric("netSubsetAndAperm")
)
setMethod("netSubsetAndAperm", "ANY",
function(x, as.DelayedOp=FALSE)
{
if (!isTRUEorFALSE(as.DelayedOp))
stop("'as.DelayedOp' must be TRUE or FALSE")
reduced <- simplify(.remove_unary_iso_ops(x))
if (!is(reduced, "DelayedAperm"))
reduced <- new_DelayedAperm(reduced)
x1 <- reduced@seed
if (!is(x1, "DelayedSubset"))
reduced@seed <- new_DelayedSubset(x1)
if (as.DelayedOp)
return(reduced)
ans <- reduced@seed@index
if (!is_noop(reduced))
attr(ans, "dimmap") <- reduced@perm
ans
}
)
|