@r-universe/webr 2023.6.11 → 2023.6.21

package/dist/vfs/usr/lib/R/tests/PCRE.R

@@ -0,0 +1,123 @@
+.ptime <- proc.time()
+
+unname(extSoftVersion()["PCRE"])
+
+### tests of recursion in PCRE matching
+### Based on PR16757
+
+## This is expected to throw a warning at some point if PCRE uses a stack,
+## depending on the system and stack size.
+## Typical stack 8-10M, some people use 40M.
+
+## PCRE2 >= 10.30 never uses recursion: earlier versions (including
+## PCRE1) can be compiled not to use a stack.
+
+unname(pcre_config()["stack"])
+
+if(pcre_config()["stack"]) {
+    op <- options(warn = 1)
+    for (n in c(seq(5000L, 10000L, 1000L), 20000L, 50000L, 100000L)) {
+        print(n)
+        x <- paste0(rep("a", n), collapse="")
+        print(grepl("(a|b)+", x, perl = TRUE))
+    }
+    options(op)
+}
+
+### tests of PCRE's JIT.
+if(!pcre_config()["JIT"]) {
+    message("The rest of these tests are pointless without JIT support")
+    q("no")
+}
+
+## Test from example(grep)
+
+txt2 <- c("The", "licenses", "for", "most", "software", "are",
+          "designed", "to", "take", "away", "your", "freedom",
+          "to", "share", "and", "change", "it.",
+          "", "By", "contrast,", "the", "GNU", "General", "Public", "License",
+          "is", "intended", "to", "guarantee", "your", "freedom", "to",
+          "share", "and", "change", "free", "software", "--",
+          "to", "make", "sure", "the", "software", "is",
+          "free", "for", "all", "its", "users")
+grep("[gu]", txt2, perl = TRUE)
+
+st <- function(expr) sum(system.time(expr)[1:2])
+
+st(for(i in 1:1e4) grep("[gu]", txt2, perl = TRUE))
+options(PCRE_use_JIT = TRUE)
+st(for(i in 1:1e4) grep("[gu]", txt2, perl = TRUE))
+
+
+## and for more inputs
+txt3 <- rep(txt2, 10)
+options(PCRE_use_JIT = FALSE)
+st(for(i in 1:1e3) grep("[gu]", txt3, perl = TRUE))
+options(PCRE_use_JIT = TRUE)
+st(for(i in 1:1e3) grep("[gu]", txt3, perl = TRUE))
+
+
+## An example where JIT really paid off with PCRE1 (e.g. 10x)
+pat <- "([^[:alpha:]]|a|b)+"
+long_string <- paste0(rep("a", 1023), collapse="")
+N <- 10
+options(PCRE_use_JIT = FALSE)
+st(for(i in 1:1e3) grep(pat, rep(long_string, N), perl = TRUE))
+options(PCRE_use_JIT = TRUE)
+st(for(i in 1:1e3) grep(pat, rep(long_string, N), perl = TRUE))
+
+
+## This needed to test 50 strings to see much gain from study
+txt <- rep("a test of capitalizing", 50)
+options(PCRE_use_JIT = FALSE)
+st(for(i in 1:1e4) gsub("(\\w)(\\w*)", "\\U\\1\\L\\2", txt, perl = TRUE))
+options(PCRE_use_JIT = TRUE)
+st(for(i in 1:1e4) gsub("(\\w)(\\w*)", "\\U\\1\\L\\2", txt, perl = TRUE))
+
+if(grepl("^10", extSoftVersion()["PCRE"])) {
+    cat("Time elapsed: ", proc.time() - .ptime,"\n")
+    q()
+}
+
+### previous test suite for PCRE1
+## here JIT is slightly slower
+options(PCRE_study = FALSE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e4) grep("[gu]", txt2, perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e4) grep("[gu]", txt2, perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = TRUE)
+st(for(i in 1:1e4) grep("[gu]", txt2, perl = TRUE))
+
+
+## and for more inputs, study starts to pay off
+txt3 <- rep(txt2, 10)
+options(PCRE_study = FALSE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e3) grep("[gu]", txt3, perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e3) grep("[gu]", txt3, perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = TRUE)
+st(for(i in 1:1e3) grep("[gu]", txt3, perl = TRUE))
+
+
+## An example where JIT really paid off (e.g. 10x)
+pat <- "([^[:alpha:]]|a|b)+"
+long_string <- paste0(rep("a", 1023), collapse="")
+N <- 10
+options(PCRE_study = FALSE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e3) grep(pat, rep(long_string, N), perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e3) grep(pat, rep(long_string, N), perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = TRUE)
+st(for(i in 1:1e3) grep(pat, rep(long_string, N), perl = TRUE))
+
+
+## This needs to test 50 strings to see much gain from study
+txt <- rep("a test of capitalizing", 50)
+options(PCRE_study = FALSE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e4) gsub("(\\w)(\\w*)", "\\U\\1\\L\\2", txt, perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = FALSE)
+st(for(i in 1:1e4) gsub("(\\w)(\\w*)", "\\U\\1\\L\\2", txt, perl = TRUE))
+options(PCRE_study = TRUE, PCRE_use_JIT = TRUE)
+st(for(i in 1:1e4) gsub("(\\w)(\\w*)", "\\U\\1\\L\\2", txt, perl = TRUE))
+
+cat("Time elapsed: ", proc.time() - .ptime,"\n")

package/dist/vfs/usr/lib/R/tests/README

@@ -0,0 +1,117 @@
+There is a hierarchy of check targets:
+
+     make check
+
+for all builders.  It should not need a working latex installation.
+If this works one can be reasonably happy R is working
+and do `make install' (or the equivalent).
+
+    make check-devel
+
+for people changing the code: this runs things like the demos and
+no-segfault which might be broken by code changes, and checks on the
+documentation (effectively R CMD check on each of the base packages).
+It should not need recommended packages installed.
+
+    make check-all
+
+runs all the checks, those in check-devel plus tests of the recommended
+packages.
+
+Note that for complete testing you will need a number of other
+packages installed and available, so if you have a CRAN installation,
+set R_LIBS (perhaps in ~/.R/check.Renviron) to include it before
+running these tests.  For example, some of the tests on 'nlme' depend
+on 'Hmisc', and there are a number of cross references from help pages
+to CRAN packages.
+
+If a check fails there will almost always be a .Rout.fail file with
+the problematic output, so looking at the tail of that file should
+help pinpoint the problem.
+
+The \donttest sections of the examples can be run by
+
+     make check TEST_DONTTEST=TRUE
+
+(but expect some differences from the reference output).  This requires
+functional Tcl/Tk, e.g. for X11-based versions DISPLAY must be set to
+a usable X server.
+
+
+	---------- Historical Information -----------
+
+In this directory, various tests on R are run automatically.
+This is the recommended way to check if R has been built successfully on
+your architecture.
+
+	make check
+
+does
+
+	make test-Examples
+
+runs all the examples from the help files (*.Rd) of all core packages
+(base, ctest, ..., ts) -- which can take quite long (a few minutes,
+depending on your environment).
+
+	make test-Specific
+
+The "fast" part of the tests is `test-Specific' which runs the *.R
+files in this (./tests) directory (tolerantly) compares the result
+*.Rout file with the prespecified *.Rout.save (if that exists).
+
+	make test-Reg
+
+runs regression tests, that is tests that ensure that things which have been
+changed (perhaps as a result of bug reports) stay fixed.
+
+	make test-Internet
+	make test-Internet2
+
+runs tests which need access to the Internet and/or sockets and so may
+not run on every machine.  You will see some differences in the
+output, but no test should fail if you do have sockets and Internet
+access.  test-Internet2 is part of 'make check-devel' and checks less
+commonly-used options.
+
+
+Further tests are run by the target `make check-devel', including
+
+
+	make test-Demo
+
+runs all the demos in packages base and stats (but not tcltk), except
+demo(lm.glm) which is run by example(demo) and so not run again.
+
+
+	make test-Random
+
+runs a series of tests on the distribution of random variates generated
+by the rxxxx() functions.  The test is a large deviation bound on the
+Kolmogorov statistic, so also provides a test of the cumulative distribution
+functions pxxxx().  Because rare events do happen, this test suite
+will be failed in about 1 in 50 runs.
+
+
+	make test-Segfault
+
+runs a test abusing all the functions in the base packages via
+no-segfault.R, and that can be quite slow (a minute or more).
+
+
+A target not run by anything else is
+
+	make test-System
+
+which checks options in system[2]() calls.
+
+
+A rarely-used target is
+
+	make test-Gct
+
+runs a subset of the specific tests with gctorture turned on.  This is slow,
+taking an hour or two.
+
+
+Martin Maechler for the R Core Team.

package/dist/vfs/usr/lib/R/tests/any-all.R

@@ -0,0 +1,93 @@
+basic_tests <- list(
+     list(input=c(TRUE, FALSE), any=TRUE, all=FALSE),
+     list(input=c(FALSE, TRUE), any=TRUE, all=FALSE),
+
+     list(input=c(TRUE, TRUE), any=TRUE, all=TRUE),
+     list(input=c(FALSE, FALSE), any=FALSE, all=FALSE),
+
+     list(input=c(NA, FALSE), any=NA, all=FALSE, any.na.rm=FALSE),
+     list(input=c(FALSE, NA), any=NA, all=FALSE, any.na.rm=FALSE),
+
+     list(input=c(NA, TRUE), any=TRUE, all=NA, all.na.rm=TRUE),
+     list(input=c(TRUE, NA), any=TRUE, all=NA, all.na.rm=TRUE),
+
+     list(input=logical(0), any=FALSE, all=TRUE),
+
+     list(input=NA, any=NA, all=NA, any.na.rm=FALSE, any.na.rm=TRUE),
+
+     list(input=c(TRUE, NA, FALSE), any=TRUE, any.na.rm=TRUE,
+          all=FALSE, all.na.rm=FALSE)
+     )
+
+## any, all accept '...' for input.
+list_input_tests <-
+    list(
+         list(input=list(TRUE, TRUE), all=TRUE, any=TRUE),
+         list(input=list(FALSE, FALSE), all=FALSE, any=FALSE),
+         list(input=list(TRUE, FALSE), all=FALSE, any=TRUE),
+         list(input=list(FALSE, TRUE), all=FALSE, any=TRUE),
+
+         list(input=list(FALSE, NA),
+              all=FALSE, all.na.rm=FALSE, any=NA, any.na.rm=FALSE),
+         list(input=list(NA, FALSE),
+              all=FALSE, all.na.rm=FALSE, any=NA, any.na.rm=FALSE),
+
+         list(input=list(TRUE, NA),
+              all=NA, all.na.rm=TRUE, any=TRUE, any.na.rm=TRUE),
+         list(input=list(NA, TRUE),
+              all=NA, all.na.rm=TRUE, any=TRUE, any.na.rm=TRUE),
+
+         list(input=list(NA, NA),
+              any=NA, any.na.rm=FALSE, all=NA, all.na.rm=TRUE),
+
+         list(input=list(rep(TRUE, 2), rep(TRUE, 10)),
+              all=TRUE, any=TRUE),
+
+         list(input=list(rep(TRUE, 2), c(TRUE, NA)),
+              all=NA, all.na.rm=TRUE, any=TRUE),
+
+         list(input=list(rep(TRUE, 2), c(TRUE, FALSE)),
+              all=FALSE, any=TRUE),
+
+         list(input=list(c(TRUE, FALSE), c(TRUE, NA)),
+              all=FALSE, all.na.rm=FALSE, any=TRUE, any.na.rm=TRUE)
+         )
+
+
+
+do_tests <- function(L)
+{
+    run <- function(f, input, na.rm = FALSE)
+    {
+        if (is.list(input))
+            do.call(f, c(input, list(na.rm = na.rm)))
+        else f(input, na.rm = na.rm)
+    }
+
+    do_check <- function(case, f)
+    {
+        fun <- deparse(substitute(f))
+        if (!identical(case[[fun]], run(f, case$input))) {
+            cat("input: "); dput(case$input)
+            stop(fun, " returned ", run(f, case$input),
+                 " wanted ", case[[fun]], call. = FALSE)
+        }
+        narm <- paste(fun, ".na.rm", sep = "")
+        if (!is.null(case[[narm]])) {
+            if (!identical(case[[narm]],
+                           run(f, case$input, na.rm = TRUE))) {
+                cat("input: "); dput(case$input)
+                stop(narm, " returned ", run(f, case$input, na.rm = TRUE),
+                     " wanted ", case[[narm]], call. = FALSE)
+            }
+        }
+    }
+    lab <- deparse(substitute(L))
+    for (case in L) {
+        do_check(case, any)
+        do_check(case, all)
+    }
+}
+
+do_tests(basic_tests)
+do_tests(list_input_tests)

package/dist/vfs/usr/lib/R/tests/any-all.Rout.save

@@ -0,0 +1,111 @@
+
+R Under development (unstable) (2022-03-19 r81942) -- "Unsuffered Consequences"
+Copyright (C) 2022 The R Foundation for Statistical Computing
+Platform: x86_64-pc-linux-gnu (64-bit)
+
+R is free software and comes with ABSOLUTELY NO WARRANTY.
+You are welcome to redistribute it under certain conditions.
+Type 'license()' or 'licence()' for distribution details.
+
+R is a collaborative project with many contributors.
+Type 'contributors()' for more information and
+'citation()' on how to cite R or R packages in publications.
+
+Type 'demo()' for some demos, 'help()' for on-line help, or
+'help.start()' for an HTML browser interface to help.
+Type 'q()' to quit R.
+
+> basic_tests <- list(
++      list(input=c(TRUE, FALSE), any=TRUE, all=FALSE),
++      list(input=c(FALSE, TRUE), any=TRUE, all=FALSE),
++ 
++      list(input=c(TRUE, TRUE), any=TRUE, all=TRUE),
++      list(input=c(FALSE, FALSE), any=FALSE, all=FALSE),
++ 
++      list(input=c(NA, FALSE), any=NA, all=FALSE, any.na.rm=FALSE),
++      list(input=c(FALSE, NA), any=NA, all=FALSE, any.na.rm=FALSE),
++ 
++      list(input=c(NA, TRUE), any=TRUE, all=NA, all.na.rm=TRUE),
++      list(input=c(TRUE, NA), any=TRUE, all=NA, all.na.rm=TRUE),
++ 
++      list(input=logical(0), any=FALSE, all=TRUE),
++ 
++      list(input=NA, any=NA, all=NA, any.na.rm=FALSE, any.na.rm=TRUE),
++ 
++      list(input=c(TRUE, NA, FALSE), any=TRUE, any.na.rm=TRUE,
++           all=FALSE, all.na.rm=FALSE)
++      )
+> 
+> ## any, all accept '...' for input.
+> list_input_tests <-
++     list(
++          list(input=list(TRUE, TRUE), all=TRUE, any=TRUE),
++          list(input=list(FALSE, FALSE), all=FALSE, any=FALSE),
++          list(input=list(TRUE, FALSE), all=FALSE, any=TRUE),
++          list(input=list(FALSE, TRUE), all=FALSE, any=TRUE),
++ 
++          list(input=list(FALSE, NA),
++               all=FALSE, all.na.rm=FALSE, any=NA, any.na.rm=FALSE),
++          list(input=list(NA, FALSE),
++               all=FALSE, all.na.rm=FALSE, any=NA, any.na.rm=FALSE),
++ 
++          list(input=list(TRUE, NA),
++               all=NA, all.na.rm=TRUE, any=TRUE, any.na.rm=TRUE),
++          list(input=list(NA, TRUE),
++               all=NA, all.na.rm=TRUE, any=TRUE, any.na.rm=TRUE),
++ 
++          list(input=list(NA, NA),
++               any=NA, any.na.rm=FALSE, all=NA, all.na.rm=TRUE),
++ 
++          list(input=list(rep(TRUE, 2), rep(TRUE, 10)),
++               all=TRUE, any=TRUE),
++ 
++          list(input=list(rep(TRUE, 2), c(TRUE, NA)),
++               all=NA, all.na.rm=TRUE, any=TRUE),
++ 
++          list(input=list(rep(TRUE, 2), c(TRUE, FALSE)),
++               all=FALSE, any=TRUE),
++ 
++          list(input=list(c(TRUE, FALSE), c(TRUE, NA)),
++               all=FALSE, all.na.rm=FALSE, any=TRUE, any.na.rm=TRUE)
++          )
+> 
+> 
+> 
+> do_tests <- function(L)
++ {
++     run <- function(f, input, na.rm = FALSE)
++     {
++         if (is.list(input))
++             do.call(f, c(input, list(na.rm = na.rm)))
++         else f(input, na.rm = na.rm)
++     }
++ 
++     do_check <- function(case, f)
++     {
++         fun <- deparse(substitute(f))
++         if (!identical(case[[fun]], run(f, case$input))) {
++             cat("input: "); dput(case$input)
++             stop(fun, " returned ", run(f, case$input),
++                  " wanted ", case[[fun]], call. = FALSE)
++         }
++         narm <- paste(fun, ".na.rm", sep = "")
++         if (!is.null(case[[narm]])) {
++             if (!identical(case[[narm]],
++                            run(f, case$input, na.rm = TRUE))) {
++                 cat("input: "); dput(case$input)
++                 stop(narm, " returned ", run(f, case$input, na.rm = TRUE),
++                      " wanted ", case[[narm]], call. = FALSE)
++             }
++         }
++     }
++     lab <- deparse(substitute(L))
++     for (case in L) {
++         do_check(case, any)
++         do_check(case, all)
++     }
++ }
+> 
+> do_tests(basic_tests)
+> do_tests(list_input_tests)
+> 

package/dist/vfs/usr/lib/R/tests/arith-true.R

@@ -0,0 +1,220 @@
+####=== Numerical / Arithmetic Tests
+####--- ALL tests here should return  TRUE !
+###
+### '##P': These lines don't give TRUE but relevant ``Print output''
+
+### --> d-p-q-r-tests.R & d-p-q-r-tst-2.R  for distribution things
+
+.proctime00 <- proc.time()
+opt.conformance <- 0
+Meps <- .Machine $ double.eps
+
+## this uses random inputs, so set the seed
+set.seed(1)
+
+options(rErr.eps = 1e-30)
+rErr <- function(approx, true, eps = .Options$rErr.eps)
+{
+    if(is.null(eps)) { eps <- 1e-30; options(rErr.eps = eps) }
+    ifelse(Mod(true) >= eps,
+	   1 - approx / true, # relative error
+	   true - approx)     # absolute error (e.g. when true=0)
+}
+
+abs(1- .Machine$double.xmin * 10^(-.Machine$double.min.exp*log10(2)))/Meps < 1e3
+##P (1- .Machine$double.xmin * 10^(-.Machine$double.min.exp*log10(2)))/Meps
+if(opt.conformance)#fails at least on SGI/IRIX 6.5
+abs(1- .Machine$double.xmax * 10^(-.Machine$double.max.exp*log10(2)))/Meps < 1e3
+
+## More IEEE  Infinity/NaN checks
+i1 <- pi / 0
+i1 == (i2 <- 1:1 / 0:0)
+is.infinite( i1) & is.infinite( i2) &   i1 > 12   &   i2 > 12
+is.infinite(-i1) & is.infinite(-i2) & (-i1) < -12 & (-i2) < -12
+
+is.nan(n1 <- 0 / 0)
+is.nan( - n1)
+
+i1 ==  i1 + i1
+i1 ==  i1 * i1
+is.nan(i1 - i1)
+is.nan(i1 / i1)
+
+1/0 == Inf & 0 ^ -1 == Inf
+1/Inf == 0 & Inf ^ -1 == 0
+
+iNA <- as.integer(NA)
+!is.na(Inf) & !is.nan(Inf) &   is.infinite(Inf) & !is.finite(Inf)
+!is.na(-Inf)& !is.nan(-Inf)&   is.infinite(-Inf)& !is.finite(-Inf)
+ is.na(NA)  & !is.nan(NA)  &  !is.infinite(NA)  & !is.finite(NA)
+ is.na(NaN) &  is.nan(NaN) &  !is.infinite(NaN) & !is.finite(NaN)
+ is.na(iNA) & !is.nan(iNA) &  !is.infinite(iNA) & !is.finite(iNA)
+
+## These are "double"s:
+all(!is.nan(c(1.,NA)))
+all(c(FALSE,TRUE,FALSE) == is.nan(c   (1.,NaN,NA)))
+## lists are no longer allowed
+## all(c(FALSE,TRUE,FALSE) == is.nan(list(1.,NaN,NA)))
+
+
+##  log() and "pow()" -- POSIX is not specific enough..
+log(0) == -Inf
+is.nan(log(-1))# TRUE and warning
+
+rp <- c(1:2,Inf); rn <- rev(- rp)
+r <- c(rn, 0, rp, NA, NaN)
+all(r^0 == 1)
+ir <- suppressWarnings(as.integer(r))
+all(ir^0  == 1)
+all(ir^0L == 1)# not in R <= 2.15.0
+all( 1^r  == 1)# not in R 0.64
+all(1L^r  == 1)
+all(1L^ir == 1)# not in R <= 2.15.0
+all((rn ^ -3) == -((-rn) ^ -3))
+#
+all(c(1.1,2,Inf) ^ Inf == Inf)
+all(c(1.1,2,Inf) ^ -Inf == 0)
+.9 ^ Inf == 0
+.9 ^ -Inf == Inf
+## Wasn't ok in 0.64:
+all(is.nan(rn ^ .5))# in some C's : (-Inf) ^ .5 gives Inf, instead of NaN
+
+
+## Real Trig.:
+cos(0) == 1
+sin(3*pi/2) == cos(pi)
+x <- rnorm(99)
+all( sin(-x) == - sin(x))
+all( cos(-x) == cos(x))
+
+x <- 1:99/100
+all(abs(1 - x / asin(sin(x))) <= 2*Meps)# "== 2*" for HP-UX
+all(abs(1 - x / atan(tan(x))) <  2*Meps)
+
+## Sun has asin(.) = acos(.) = 0 for these:
+##	is.nan(acos(1.1)) && is.nan(asin(-2)) [!]
+
+## gamma()
+abs(gamma(1/2)^2 - pi) < 4* Meps
+r <- rlnorm(5000) # NB random, and next has failed for some seed
+all(abs(rErr(gamma(r+1), r*gamma(r))) < 500 * Meps)
+## more accurate for integers n <= 50 since R 1.8.0	Sol8: perfect
+n <-   20; all(		 gamma(1:n) == cumprod(c(1,1:(n-1))))# Lnx: up too n=28
+n <-   50; all(abs(rErr( gamma(1:n), cumprod(c(1,1:(n-1))))) < 20*Meps)#Lnx: f=2
+n <-  120; all(abs(rErr( gamma(1:n), cumprod(c(1,1:(n-1))))) < 1000*Meps)
+n <- 10000;all(abs(rErr(lgamma(1:n),cumsum(log(c(1,1:(n-1)))))) < 100*Meps)
+
+n <-   10; all(		 gamma(1:n) == cumprod(c(1,1:(n-1))))
+n <-   20; all(abs(rErr( gamma(1:n), cumprod(c(1,1:(n-1))))) < 100*Meps)
+n <-  120; all(abs(rErr( gamma(1:n), cumprod(c(1,1:(n-1))))) < 1000*Meps)
+n <- 10000;all(abs(rErr(lgamma(1:n),cumsum(log(c(1,1:(n-1)))))) < 100*Meps)
+
+all(is.nan(gamma(0:-47))) # + warn.
+
+## choose() {and lchoose}:
+n51 <- c(196793068630200, 229591913401900, 247959266474052)
+abs(c(n51, rev(n51))- choose(51, 23:28)) <= 2
+all(choose(0:4,2) == c(0,0,1,3,6))
+## 3 to 8 units off and two NaN's in 1.8.1
+
+## psi[gamma](x) and derivatives:
+## psi == digamma:
+gEuler <- 0.577215664901532860606512# = Euler's gamma
+abs(digamma(1) + gEuler) <   32*Meps # i386 Lx: = 2.5*Meps
+all.equal(digamma(1) - digamma(1/2), log(4), tolerance = 32*Meps)# Linux: < 1*Meps!
+n <- 1:12
+all.equal(digamma(n),
+         - gEuler + c(0, cumsum(1/n)[-length(n)]),tolerance = 32*Meps)#i386 Lx: 1.3 Meps
+all.equal(digamma(n + 1/2),
+          - gEuler - log(4) + 2*cumsum(1/(2*n-1)),tolerance = 32*Meps)#i386 Lx: 1.8 Meps
+## higher psigamma:
+all.equal(psigamma(1, deriv=c(1,3,5)),
+          pi^(2*(1:3)) * c(1/6, 1/15, 8/63), tolerance = 32*Meps)
+x <- c(-100,-3:2, -99.9, -7.7, seq(-3,3, length=61), 5.1, 77)
+## Intel icc showed a < 1ulp difference in the second.
+stopifnot(all.equal( digamma(x), psigamma(x,0), tolerance = 2*Meps),
+          all.equal(trigamma(x), psigamma(x,1), tolerance = 2*Meps))# TRUE (+ NaN warnings)
+## very large x:
+x <- 1e30 ^ (1:10)
+a.relE <- function(appr, true) abs(1 - appr/true)
+stopifnot(a.relE(digamma(x),   log(x)) < 1e-13,
+          a.relE(trigamma(x),     1/x) < 1e-13)
+x <- sqrt(x[2:6]); stopifnot(a.relE(psigamma(x,2), - 1/x^2) < 1e-13)
+x <- 10^(10*(2:6));stopifnot(a.relE(psigamma(x,5), +24/x^5) < 1e-13)
+
+## fft():
+ok <- TRUE
+##test EXTENSIVELY:	for(N in 1:100) {
+    cat(".")
+    for(n in c(1:30, 1000:1050)) {
+	x <- rnorm(n)
+	er <- Mod(rErr(fft(fft(x), inverse = TRUE)/n, x*(1+0i)))
+	n.ok <- all(er < 1e-8) & quantile(er, 0.95, names=FALSE) < 10000*Meps
+	if(!n.ok) cat("\nn=",n,": quantile(rErr, c(.95,1)) =",
+		      formatC(quantile(er, prob= c(.95,1))),"\n")
+	ok <- ok & n.ok
+    }
+    cat("\n")
+##test EXTENSIVELY:	}
+ok
+
+## var():
+for(n in 2:10)
+    print(all.equal(n*(n-1)*var(diag(n)),
+		    matrix(c(rep(c(n-1,rep(-1,n)),n-1), n-1), nr=n, nc=n),
+		    tolerance = 20*Meps)) # use tolerance = 0 to see rel.error
+
+## pmin() & pmax() -- "attributes" !
+v1 <- c(a=2)
+m1 <- cbind(  2:4,3)
+m2 <- cbind(a=2:4,2)
+
+all( pmax(v1, 1:3) == pmax(1:3, v1) & pmax(1:3, v1) == c(2,2,3))
+all( pmin(v1, 1:3) == pmin(1:3, v1) & pmin(1:3, v1) == c(1,2,2))
+
+oo <- options(warn = -1)# These four lines each would give 3-4 warnings :
+ all( pmax(m1, 1:7) == pmax(1:7, m1) & pmax(1:7, m1) == c(2:4,4:7))
+ all( pmin(m1, 1:7) == pmin(1:7, m1) & pmin(1:7, m1) == c(1:3,3,3,3,2))
+ all( pmax(m2, 1:7) == pmax(1:7, m2) & pmax(1:7, m2) == pmax(1:7, m1))
+ all( pmin(m2, 1:7) == pmin(1:7, m2) & pmin(1:7, m2) == c(1:3,2,2,2,2))
+options(oo)
+
+## pretty()
+stopifnot(pretty(1:15)	    == seq(0,16, by=2),
+	  pretty(1:15, h=2) == seq(0,15, by=5),
+	  pretty(1)	    == 0:1,
+	  pretty(pi)	    == c(2,4),
+	  pretty(pi, n=6)   == 2:4,
+	  pretty(pi, n=10)  == 2:5,
+	  pretty(pi, shr=.1)== c(3, 3.5))
+
+## gave infinite loop [R 0.64; Solaris], seealso PR#390 :
+all(pretty((1-1e-5)*c(1,1+3*Meps), 7) == seq(0,1,len=3))
+
+n <- 1000
+x12 <- matrix(NA, 2,n); x12[,1] <- c(2.8,3) # Bug PR#673
+for(j in 1:2) x12[j, -1] <- round(rnorm(n-1), dig = rpois(n-1, lam=3.5) - 2)
+for(i in 1:n) {
+    lp <- length(p <- pretty(x <- sort(x12[,i])))
+    stopifnot(p[1] <= x[1] & x[2] <= p[lp],
+              all(x==0) || all.equal(p, rev(-pretty(-x)), tolerance = 10*Meps))
+}
+
+## PR#741:
+pi != (pi0 <- pi + 2*.Machine$double.eps)
+is.na(match(c(1,pi,pi0), pi)[3])
+
+## PR#749:
+all(is.na(c(NA && TRUE, TRUE  && NA, NA && NA,
+            NA || FALSE,FALSE || NA, NA || NA)))
+
+all((c(NA || TRUE,  TRUE || NA,
+    !c(NA && FALSE,FALSE && NA))))
+
+
+## not sure what the point of this is: it gives mean(numeric(0)), that is NaN
+(z <- mean(rep(NA_real_, 2), trim = .1, na.rm = TRUE))
+is.na(z)
+
+## Last Line:
+cat('Time elapsed: ', proc.time() - .proctime00,'\n')