Nothing
##' Fast approximation
##'
##' @title Fast approximation
##' @param time Original ordered time points
##' @param new.time New time points
##' @param equal If TRUE a list is returned with additional element
##' @param type Type of matching, nearest index, nearest greater than or equal (right), number of elements smaller than y
##' otherwise the closest value above new.time is returned.
##' @param sorted Set to true if new.time is already sorted
##' @param ... Optional additional arguments
##' @author Klaus K. Holst
##' @examples
##' id <- c(1,1,2,2,7,7,10,10)
##' fast.approx(unique(id),id)
##'
##' t <- 0:6
##' n <- c(-1,0,0.1,0.9,1,1.1,1.2,6,6.5)
##' fast.approx(t,n,type="left")
##' @export
fast.approx <- function(time,new.time,equal=FALSE,type=c("nearest","right","left"),sorted=FALSE,...) {
if (!sorted) {
ord <- order(new.time,decreasing=FALSE)
new.time <- new.time[ord]
}
if (is.unsorted(time)) warnings("'time' will be sorted")
type <- agrep(type[1],c("nearest","right","left"))-1
arglist <- list("FastApprox",
time=sort(time),
newtime=new.time,
equal=equal,
type=type,
PACKAGE="mets")
res <- do.call(".Call",arglist)
if (!sorted) {
oord <- order(ord)
if (!equal) return(res[oord])
return(lapply(res,function(x) x[oord]))
}
return(res)
}
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.