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
|
#' Resolve one or more futures synchronously
#'
#' This function provides an efficient mechanism for waiting for multiple
#' futures in a container (e.g. list or environment) to be resolved while in
#' the meanwhile retrieving values of already resolved futures.
#'
#' @param x a list, an environment, or a list environment holding futures
#' that should be resolved. May also be a single \link{Future}.
#'
#' @param idxs (optional) integer or logical index specifying the subset of
#' elements to check.
#'
#' @param value If TRUE, the values are retrieved, otherwise not.
#'
#' @param recursive A non-negative number specifying how deep of a recursion
#' should be done. If TRUE, an infinite recursion is used. If FALSE or zero,
#' no recursion is performed.
#'
#' @param sleep Number of seconds to wait before checking if futures have been
#' resolved since last time.
#'
#' @param progress If TRUE textual progress summary is outputted. If a
#' function, the it is called as \code{progress(done, total)} every time a
#' future is resolved.
#'
#' @param \dots Not used
#'
#' @return Returns \code{x} (regardless of subsetting or not).
#'
#' @details
#' This function is resolves synchronously, i.e. it blocks until \code{x} and
#' any containing futures are resolved.
#'
#' @seealso To resolve a future \emph{variable}, first retrieve its
#' \link{Future} object using \code{\link{futureOf}()}, e.g.
#' \code{resolve(futureOf(x))}.
#'
#' @export
resolve <- function(x, idxs = NULL, value = FALSE, recursive = 0, sleep = 1.0, progress = getOption("future.progress", FALSE), ...) UseMethod("resolve")
#' @export
resolve.default <- function(x, ...) x
#' @export
resolve.Future <- function(x, idxs = NULL, value = FALSE, recursive = 0, sleep = 0.1, progress = getOption("future.progress", FALSE), ...) {
if (is.logical(recursive)) {
if (recursive) recursive <- getOption("future.resolve.recursive", 99)
}
recursive <- as.numeric(recursive)
## Nothing to do?
if (recursive < 0) return(x)
## Lazy future that is not yet launched?
if (x$state == 'created') x <- run(x)
## Poll for the Future to finish
while (!resolved(x)) {
Sys.sleep(sleep)
}
msg <- sprintf("A %s was resolved", class(x)[1])
if (value) {
## Allow for errors
msg <- tryCatch({
result <- x$result
if (is.null(result)) {
result <- result(x)
v <- result$value
msg <- sprintf("%s and its value was collected", msg)
## Recursively resolve the value?
if (!is.atomic(v)) {
v <- resolve(v, value = TRUE, recursive = recursive - 1, sleep = sleep, progress = FALSE, ...)
msg <- sprintf("%s (and resolved itself)", msg)
}
msg
} else {
sprintf("%s and its value was already collected", msg)
}
}, error = function(ex) {
sprintf("%s but failed to collect its value", msg)
})
} else {
msg <- sprintf("%s (value was not collected)", msg)
}
mdebug(msg)
x
} ## resolve() for Future
#' @export
resolve.list <- function(x, idxs = NULL, value = FALSE, recursive = 0, sleep = 0.1, progress = getOption("future.progress", FALSE), ...) {
if (is.logical(recursive)) {
if (recursive) recursive <- getOption("future.resolve.recursive", 99)
}
recursive <- as.numeric(recursive)
## Nothing to do?
if (recursive < 0) return(x)
nx <- .length(x)
## Nothing to do?
if (nx == 0) return(x)
x0 <- x
hasProgress <- ((is.logical(progress) && progress) || is.function(progress))
## Setup default progress function?
if (hasProgress && !is.function(progress)) {
progress <- function(done, total) {
msg <- sprintf("Progress: %.0f%% (%d/%d)", 100 * done / total, done, total)
if (done < total) {
bs <- paste(rep("\b", times = nchar(msg)), collapse = "")
message(paste(msg, bs, sep = ""), appendLF = FALSE)
} else {
message(msg)
}
} ## progress()
}
## Subset?
if (!is.null(idxs)) {
## Nothing to do?
if (length(idxs) == 0) return(x)
## Multi-dimensional indices?
if (is.matrix(idxs)) {
idxs <- whichIndex(idxs, dim = dim(x), dimnames = dimnames(x))
}
idxs <- unique(idxs)
if (is.numeric(idxs)) {
idxs <- as.numeric(idxs)
if (any(idxs < 1 | idxs > nx)) {
stop(sprintf("Indices out of range [1,%d]: %s", nx, hpaste(idxs)))
}
} else {
names <- names(x)
if (is.null(names)) {
stop("Named subsetting not possible. Elements are not named.")
}
idxs <- as.character(idxs)
unknown <- idxs[!is.element(idxs, names)]
if (length(unknown) > 0) {
stop("Unknown elements: ", hpaste(sQuote(unknown)))
}
}
x <- x[idxs]
nx <- .length(x)
}
debug <- getOption("future.debug", FALSE)
if (debug) {
mdebug("resolve() on list ...")
mdebug(" recursive: %s", recursive)
}
## NOTE: Everything is considered non-resolved by default
## Total number of values to resolve
total <- nx
remaining <- seq_len(nx)
if (hasProgress) {
done0 <- done <- 0
progress(done, total)
}
if (debug) {
mdebug(" length: %d", nx)
mdebug(" elements: %s", hpaste(sQuote(names(x))))
}
## Resolve all elements
while (length(remaining) > 0) {
for (ii in remaining) {
obj <- x[[ii]]
if (!is.atomic(obj)) {
## If an unresolved future, move on to the next object
## so that future can be resolved in the asynchronously
if (inherits(obj, "Future")) {
## Lazy future that is not yet launched?
if (obj$state == 'created') obj <- run(obj)
if (!resolved(obj)) next
}
## In all other cases, try to resolve
resolve(obj, value = value, recursive = recursive - 1, sleep = sleep, progress = FALSE, ...)
}
## Assume resolved at this point
remaining <- setdiff(remaining, ii)
if (debug) mdebug(" length: %d (resolved future %s)", length(remaining), ii)
stop_if_not(!anyNA(remaining))
if (hasProgress) {
done <- total - length(remaining)
progress(done, total)
}
} # for (ii ...)
## Wait a bit before checking again
if (length(remaining) > 0) Sys.sleep(sleep)
} # while (...)
if (hasProgress && done != done0) progress(done, total)
if (debug) mdebug("resolve() on list ... DONE")
x0
} ## resolve() for list
#' @export
resolve.environment <- function(x, idxs = NULL, value = FALSE, recursive = 0, sleep = 0.1, progress = FALSE, ...) {
if (is.logical(recursive)) {
if (recursive) recursive <- getOption("future.resolve.recursive", 99)
}
recursive <- as.numeric(recursive)
## Nothing to do?
if (recursive < 0) return(x)
nx <- .length(x)
## Nothing to do?
if (nx == 0) return(x)
## Subset?
if (is.null(idxs)) {
## names(x) is only supported in R (>= 3.2.0)
idxs <- ls(envir = x, all.names = TRUE)
} else {
## Nothing to do?
if (length(idxs) == 0) return(x)
## names(x) is only supported in R (>= 3.2.0)
names <- ls(envir = x, all.names = TRUE)
## Sanity check (because nx == 0 returns early above)
stop_if_not(length(names) > 0)
idxs <- unique(idxs)
idxs <- as.character(idxs)
unknown <- idxs[!is.element(idxs, names)]
if (length(unknown) > 0) {
stop("Unknown elements: ", hpaste(sQuote(unknown)))
}
}
## Nothing to do?
nx <- length(idxs)
if (nx == 0) return(x)
debug <- getOption("future.debug", FALSE)
if (debug) {
mdebug("resolve() on environment ...")
mdebug(" recursive: %s", recursive)
}
## Coerce future promises into Future objects
x0 <- x
x <- futures(x)
nx <- .length(x)
idxs <- ls(envir = x, all.names = TRUE)
stop_if_not(length(idxs) == nx)
## Everything is considered non-resolved by default
remaining <- idxs
if (debug) mdebug(" elements: [%d] %s", nx, hpaste(sQuote(idxs)))
## Resolve all elements
while (length(remaining) > 0) {
for (ii in remaining) {
obj <- x[[ii]]
if (!is.atomic(obj)) {
## If an unresolved future, move on to the next object
## so that future can be resolved in the asynchronously
if (inherits(obj, "Future")) {
## Lazy future that is not yet launched?
if (obj$state == 'created') obj <- run(obj)
if (!resolved(obj)) next
}
## In all other cases, try to resolve
resolve(obj, value = value, recursive = recursive-1, sleep = sleep, progress = FALSE, ...)
}
## Assume resolved at this point
remaining <- setdiff(remaining, ii)
if (debug) mdebug(" length: %d (resolved future %s)", length(remaining), ii)
stop_if_not(!anyNA(remaining))
} # for (ii ...)
## Wait a bit before checking again
if (length(remaining) > 0) Sys.sleep(sleep)
} # while (...)
if (debug) mdebug("resolve() on environment ... DONE")
x0
} ## resolve() for environment
#' @export
resolve.listenv <- function(x, idxs = NULL, value = FALSE, recursive = 0, sleep = 0.1, progress = FALSE, ...) {
if (is.logical(recursive)) {
if (recursive) recursive <- getOption("future.resolve.recursive", 99)
}
recursive <- as.numeric(recursive)
## Nothing to do?
if (recursive < 0) return(x)
## NOTE: Contrary to other implementations that use .length(x), we here
## do need to use generic length() that dispatches on class.
nx <- length(x)
## Nothing to do?
if (nx == 0) return(x)
## Subset?
if (is.null(idxs)) {
idxs <- seq_along(x)
} else {
## Nothing to do?
if (length(idxs) == 0) return(x)
## Multi-dimensional indices?
if (is.matrix(idxs)) {
idxs <- whichIndex(idxs, dim = dim(x), dimnames = dimnames(x))
}
idxs <- unique(idxs)
if (is.numeric(idxs)) {
if (any(idxs < 1 | idxs > nx)) {
stop(sprintf("Indices out of range [1,%d]: %s", nx, hpaste(idxs)))
}
} else {
names <- names(x)
## Sanity check (because nx == 0 returns early above)
stop_if_not(length(names) > 0)
idxs <- as.character(idxs)
unknown <- idxs[!is.element(idxs, names)]
if (length(unknown) > 0) {
stop("Unknown elements: ", hpaste(sQuote(unknown)))
}
}
}
## Nothing to do?
nx <- length(idxs)
if (nx == 0) return(x)
debug <- getOption("future.debug", FALSE)
if (debug) {
mdebug("resolve() on list environment ...")
mdebug(" recursive: %s", recursive)
}
## Coerce future promises into Future objects
x0 <- x
x <- futures(x)
nx <- length(x)
## Everything is considered non-resolved by default
remaining <- seq_len(nx)
if (debug) {
mdebug(" length: %d", nx)
mdebug(" elements: %s", hpaste(sQuote(names(x))))
}
## Resolve all elements
while (length(remaining) > 0) {
for (ii in remaining) {
obj <- x[[ii]]
if (!is.atomic(obj)) {
## If an unresolved future, move on to the next object
## so that future can be resolved in the asynchronously
if (inherits(obj, "Future")) {
## Lazy future that is not yet launched?
if (obj$state == 'created') obj <- run(obj)
if (!resolved(obj)) next
}
## In all other cases, try to resolve
resolve(obj, value = value, recursive = recursive-1, sleep = sleep, progress = FALSE, ...)
}
## Assume resolved at this point
remaining <- setdiff(remaining, ii)
if (debug) mdebug(" length: %d (resolved future %s)", length(remaining), ii)
stop_if_not(!anyNA(remaining))
} # for (ii ...)
## Wait a bit before checking again
if (length(remaining) > 0) Sys.sleep(sleep)
} # while (...)
if (debug) mdebug("resolve() on list environment ... DONE")
x0
} ## resolve() for list environment
|