Last updated on 2026-08-03 09:50:19 CEST.
| Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
|---|---|---|---|---|---|---|
| r-devel-linux-x86_64-debian-clang | 1.4 | 2.35 | 28.66 | 31.01 | NOTE | |
| r-devel-linux-x86_64-debian-gcc | 1.4 | 1.62 | 22.70 | 24.32 | NOTE | |
| r-devel-linux-x86_64-fedora-clang | 1.4 | 46.55 | NOTE | |||
| r-devel-linux-x86_64-fedora-gcc | 1.4 | 21.61 | NOTE | |||
| r-devel-windows-x86_64 | 1.4 | 4.00 | 52.00 | 56.00 | NOTE | |
| r-patched-linux-x86_64 | 1.4 | 2.29 | 26.67 | 28.96 | NOTE | |
| r-release-linux-x86_64 | 1.4 | 2.45 | 26.80 | 29.25 | NOTE | |
| r-release-macos-arm64 | 1.4 | 1.00 | 10.00 | 11.00 | NOTE | |
| r-release-macos-x86_64 | 1.4 | 2.00 | 36.00 | 38.00 | NOTE | |
| r-release-windows-x86_64 | 1.4 | 3.00 | 54.00 | 57.00 | NOTE | |
| r-oldrel-macos-arm64 | 1.4 | NOTE | ||||
| r-oldrel-macos-x86_64 | 1.4 | 2.00 | 30.00 | 32.00 | NOTE | |
| r-oldrel-windows-x86_64 | 1.4 | 4.00 | 56.00 | 60.00 | NOTE |
Version: 1.4
Check: CRAN incoming feasibility
Result: NOTE
Maintainer: ‘Przemyslaw Biecek <przemyslaw.biecek@gmail.com>’
No Authors@R field in DESCRIPTION.
Please add one, modifying
Authors@R: c(person(given = "Przemyslaw",
family = "Biecek",
role = c("aut", "cre"),
email = "przemyslaw.biecek@gmail.com",
comment = "R code"),
person(given = "Teresa",
family = "Ledwina",
role = "aut",
comment = "support,\n descriptions"))
as necessary.
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc
Version: 1.4
Check: R code for possible problems
Result: NOTE
Found calls to structure() using deprecated special names:
ddst/R/ddst.exp.test.R (.Dim: 20)
ddst/R/ddst.extr.test.R (.Dim: 41)
ddst/R/ddst.norm.test.R (.Dim: 40)
ddst/R/zzz.R (.Dim: 1, .Dimnames: 1)
'.Dim' should be changed to 'dim'.
'.Dimnames' should be changed to 'dimnames'.
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-gcc, r-devel-windows-x86_64
Version: 1.4
Check: Rd files
Result: NOTE
checkRd: (-1) ddst-package.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$W_k=[1/sqrt(n) sum_{i=1}^n l(Z_i)]I^{-1}[1/sqrt(n) sum_{i=1}^n l(Z_i)]'$},
| ^
checkRd: (-1) ddst-package.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$W_k=[1/sqrt(n) sum_{i=1}^n l(Z_i)]I^{-1}[1/sqrt(n) sum_{i=1}^n l(Z_i)]'$},
| ^
checkRd: (-1) ddst-package.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$W_k=[1/sqrt(n) sum_{i=1}^n l(Z_i)]I^{-1}[1/sqrt(n) sum_{i=1}^n l(Z_i)]'$},
| ^
checkRd: (-1) ddst-package.Rd:31: Lost braces; missing escapes or markup?
31 | where \emph{$l(Z_i)$}, i=1,...,n, is \emph{k}-dimensional (row) score vector, the symbol \emph{'} denotes transposition while \emph{$I=Cov_{theta_0}[l(Z_1)]'[l(Z_1)]$}. Following Neyman's idea of modelling underlying distributions one gets \emph{$l(Z_i)=(phi_1(F(Z_i)),...,phi_k(F(Z_i)))$} and \emph{I} being the identity matrix, where \emph{$phi_j$}'s, j >= 1, are zero mean orthonormal functions on [0,1], while \emph{F} is the completely specified null distribution function.
| ^
checkRd: (-1) ddst-package.Rd:35: Lost braces; missing escapes or markup?
35 | \emph{$W_k^{*}(tilde gamma)=[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)][I^*(tilde gamma)]^{-1}[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)]'$},
| ^
checkRd: (-1) ddst-package.Rd:35: Lost braces; missing escapes or markup?
35 | \emph{$W_k^{*}(tilde gamma)=[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)][I^*(tilde gamma)]^{-1}[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)]'$},
| ^
checkRd: (-1) ddst-package.Rd:35: Lost braces; missing escapes or markup?
35 | \emph{$W_k^{*}(tilde gamma)=[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)][I^*(tilde gamma)]^{-1}[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)]'$},
| ^
checkRd: (-1) ddst-package.Rd:35: Lost braces; missing escapes or markup?
35 | \emph{$W_k^{*}(tilde gamma)=[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)][I^*(tilde gamma)]^{-1}[1/sqrt(n) sum_{i=1}^n l^*(Z_i;tilde gamma)]'$},
| ^
checkRd: (-1) ddst-package.Rd:36: Lost braces; missing escapes or markup?
36 | where \emph{$tilde gamma$} is an appropriate estimator of \emph{$gamma$} while \emph{$I^*(gamma)=Cov_{theta_0}[l^*(Z_1;gamma)]'[l^*(Z_1;gamma)]$}. More details can be found in Janic and Ledwina (2008), Kallenberg and Ledwina (1997 a,b) as well as Inglot and Ledwina (2006 a,b).
| ^
checkRd: (-1) ddst-package.Rd:40: Lost braces
40 | \emph{$T = min{1 <= k <= d: W_k-pi(k,n,c) >= W_j-pi(j,n,c), j=1,...,d}$}
| ^
checkRd: (-1) ddst-package.Rd:45: Lost braces
45 | $T^* = min{1 <= k <= d: W_k^*(tilde gamma)-pi^*(k,n,c) >= W_j^*(tilde gamma)-pi^*(j,n,c), j=1,...,d}$}.
| ^
checkRd: (-1) ddst-package.Rd:49: Lost braces
49 | \emph{$pi(j,n,c)={jlog n, if max{1 <= k <= d}|Y_k| <= sqrt(c log(n)), 2j, if max{1 <= k <= d}|Y_k|>sqrt(c log(n)). }$}
| ^
checkRd: (-1) ddst-package.Rd:49: Lost braces
49 | \emph{$pi(j,n,c)={jlog n, if max{1 <= k <= d}|Y_k| <= sqrt(c log(n)), 2j, if max{1 <= k <= d}|Y_k|>sqrt(c log(n)). }$}
| ^
checkRd: (-1) ddst-package.Rd:49: Lost braces
49 | \emph{$pi(j,n,c)={jlog n, if max{1 <= k <= d}|Y_k| <= sqrt(c log(n)), 2j, if max{1 <= k <= d}|Y_k|>sqrt(c log(n)). }$}
| ^
checkRd: (-1) ddst-package.Rd:54: Lost braces
54 | $pi^*(j,n,c)={jlog n, if max{1 <= k <= d}|Y_k^*| <= sqrt(c log(n)),2j if max(1 <= k <= d)|Y_k^*| > sqrt(c log(n))}$}.
| ^
checkRd: (-1) ddst-package.Rd:54: Lost braces
54 | $pi^*(j,n,c)={jlog n, if max{1 <= k <= d}|Y_k^*| <= sqrt(c log(n)),2j if max(1 <= k <= d)|Y_k^*| > sqrt(c log(n))}$}.
| ^
checkRd: (-1) ddst-package.Rd:58: Lost braces; missing escapes or markup?
58 | \emph{$(Y_1,...,Y_k)=[1/sqrt(n) sum_{i=1}^n l(Z_i)]I^{-1/2}$}
| ^
checkRd: (-1) ddst-package.Rd:58: Lost braces; missing escapes or markup?
58 | \emph{$(Y_1,...,Y_k)=[1/sqrt(n) sum_{i=1}^n l(Z_i)]I^{-1/2}$}
| ^
checkRd: (-1) ddst-package.Rd:62: Lost braces; missing escapes or markup?
62 | \emph{$(Y_1^*,...,Y_k^*)=[1/sqrt(n) sum_{i=1}^n l^*(Z_i; tilde gamma)][I^*(tilde gamma)]^{-1/2}$}.
| ^
checkRd: (-1) ddst-package.Rd:62: Lost braces; missing escapes or markup?
62 | \emph{$(Y_1^*,...,Y_k^*)=[1/sqrt(n) sum_{i=1}^n l^*(Z_i; tilde gamma)][I^*(tilde gamma)]^{-1/2}$}.
| ^
checkRd: (-1) ddst-package.Rd:65: Lost braces; missing escapes or markup?
65 | and \emph{$W_{T^*} = W_{T^*}(tilde gamma)$}, respectively. For details see Inglot and Ledwina (2006 a,b,c).
| ^
checkRd: (-1) ddst-package.Rd:65: Lost braces; missing escapes or markup?
65 | and \emph{$W_{T^*} = W_{T^*}(tilde gamma)$}, respectively. For details see Inglot and Ledwina (2006 a,b,c).
| ^
checkRd: (-1) ddst-package.Rd:67: Lost braces; missing escapes or markup?
67 | The choice of \emph{c} in \emph{T} and \emph{$T^*$} is decisive to finite sample behaviour of the selection rules and pertaining statistics \emph{$W_T$} and \emph{$W_{T^*}(tilde gamma)$}. In particular, under large \emph{c}'s the rules behave similarly as Schwarz's (1978) BIC while for \emph{c=0} they mimic Akaike's (1973) AIC. For moderate sample sizes, values \emph{c in (2,2.5)} guarantee, under `smooth' departures, only slightly smaller power as in case BIC were used and simultaneously give much higher power than BIC under multimodal alternatives. In genral, large \emph{c's} are recommended if changes in location, scale, skewness and kurtosis are in principle aimed to be detected. For evidence and discussion see Inglot and Ledwina (2006 c).
| ^
checkRd: (-1) ddst-package.Rd:69: Lost braces; missing escapes or markup?
69 | It \emph{c>0} then the limiting null distribution of \emph{$W_T$} and \emph{$W_{T^*}(tilde gamma)$} is central chi-squared with one degree of freedom. In our implementation, for given \emph{n}, both critical values and \emph{p}-values are computed by MC method.
| ^
checkRd: (-1) ddst-package.Rd:71: Lost braces; missing escapes or markup?
71 | Empirical distributions of \emph{T} and \emph{$T^*$} as well as \emph{$W_T$} and \emph{$W_{T^*}(tilde gamma)$} are not essentially influenced by the choice of reasonably large \emph{d}'s, provided that sample size is at least moderate.
| ^
checkRd: (-1) ddst.exp.test.Rd:27: Lost braces; missing escapes or markup?
27 | Modelling alternatives similarly as in Kallenberg and Ledwina (1997 a,b), e.g., and estimating \emph{$gamma$} by \emph{$tilde gamma= 1/n sum_{i=1}^n Z_i$} yields the efficient score
| ^
checkRd: (-1) ddst.exp.test.Rd:30: Lost braces; missing escapes or markup?
30 | The matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and computed in a numerical way in case of cosine basis. In the implementation the default value of \emph{c} in \emph{$T^*$} is set to be 100.
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:29: Lost braces; missing escapes or markup?
29 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=-1/n sum_{i=1}^n Z_i + varepsilon G$}, where \emph{$varepsilon approx 0.577216 $} is the Euler constant and \emph{$ G = tilde gamma_2 = [n(n-1) ln2]^{-1}sum_{1<= j < i <= n}(Z_{n:i}^o - Z_{n:j}^o) $} while \emph{$Z_{n:1}^o <= ... <= Z_{n:n}^o$}
| ^
checkRd: (-1) ddst.extr.test.Rd:33: Lost braces; missing escapes or markup?
33 | The related matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and numerical methods for cosine functions. In the implementation the default value of \emph{c} in \emph{$T^*$} was fixed to be 100. Hence, \emph{$T^*$} is Schwarz-type model selection rule. The resulting data driven test statistic for extreme value distribution is \emph{$W_{T^*}=W_{T^*}(tilde gamma)$}.
| ^
checkRd: (-1) ddst.extr.test.Rd:33: Lost braces; missing escapes or markup?
33 | The related matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and numerical methods for cosine functions. In the implementation the default value of \emph{c} in \emph{$T^*$} was fixed to be 100. Hence, \emph{$T^*$} is Schwarz-type model selection rule. The resulting data driven test statistic for extreme value distribution is \emph{$W_{T^*}=W_{T^*}(tilde gamma)$}.
| ^
checkRd: (-1) ddst.extr.test.Rd:33: Lost braces; missing escapes or markup?
33 | The related matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and numerical methods for cosine functions. In the implementation the default value of \emph{c} in \emph{$T^*$} was fixed to be 100. Hence, \emph{$T^*$} is Schwarz-type model selection rule. The resulting data driven test statistic for extreme value distribution is \emph{$W_{T^*}=W_{T^*}(tilde gamma)$}.
| ^
checkRd: (-1) ddst.norm.test.Rd:30: Lost braces; missing escapes or markup?
30 | \emph{$gamma=(gamma_1,gamma_2)$} is estimated by \emph{$tilde gamma=(tilde gamma_1,tilde gamma_2)$}, where \emph{$tilde gamma_1=1/n sum_{i=1}^n Z_i$} and
| ^
checkRd: (-1) ddst.norm.test.Rd:31: Lost braces; missing escapes or markup?
31 | \emph{$tilde gamma_2 = 1/(n-1) sum_{i=1}^{n-1}(Z_{n:i+1}-Z_{n:i})(H_{i+1}-H_i)$},
| ^
checkRd: (-1) ddst.norm.test.Rd:31: Lost braces; missing escapes or markup?
31 | \emph{$tilde gamma_2 = 1/(n-1) sum_{i=1}^{n-1}(Z_{n:i+1}-Z_{n:i})(H_{i+1}-H_i)$},
| ^
checkRd: (-1) ddst.norm.test.Rd:31: Lost braces; missing escapes or markup?
31 | \emph{$tilde gamma_2 = 1/(n-1) sum_{i=1}^{n-1}(Z_{n:i+1}-Z_{n:i})(H_{i+1}-H_i)$},
| ^
checkRd: (-1) ddst.norm.test.Rd:31: Lost braces; missing escapes or markup?
31 | \emph{$tilde gamma_2 = 1/(n-1) sum_{i=1}^{n-1}(Z_{n:i+1}-Z_{n:i})(H_{i+1}-H_i)$},
| ^
checkRd: (-1) ddst.norm.test.Rd:31: Lost braces; missing escapes or markup?
31 | \emph{$tilde gamma_2 = 1/(n-1) sum_{i=1}^{n-1}(Z_{n:i+1}-Z_{n:i})(H_{i+1}-H_i)$},
| ^
checkRd: (-1) ddst.norm.test.Rd:32: Lost braces; missing escapes or markup?
32 | while \emph{$Z_{n:1}<= ... <= Z_{n:n}$} are ordered values of \emph{$Z_1, ..., Z_n$} and \emph{$H_i= phi^{-1}((i-3/8)(n+1/4))$}, cf. Chen and Shapiro (1995).
| ^
checkRd: (-1) ddst.norm.test.Rd:32: Lost braces; missing escapes or markup?
32 | while \emph{$Z_{n:1}<= ... <= Z_{n:n}$} are ordered values of \emph{$Z_1, ..., Z_n$} and \emph{$H_i= phi^{-1}((i-3/8)(n+1/4))$}, cf. Chen and Shapiro (1995).
| ^
checkRd: (-1) ddst.norm.test.Rd:32: Lost braces; missing escapes or markup?
32 | while \emph{$Z_{n:1}<= ... <= Z_{n:n}$} are ordered values of \emph{$Z_1, ..., Z_n$} and \emph{$H_i= phi^{-1}((i-3/8)(n+1/4))$}, cf. Chen and Shapiro (1995).
| ^
checkRd: (-1) ddst.norm.test.Rd:35: Lost braces; missing escapes or markup?
35 | The pertaining matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and is computed in a numerical way in case of cosine basis. In the implementation of \emph{$T^*$} the default value of \emph{c} is set to be 100. Therefore, in practice, \emph{$T^*$} is Schwarz-type criterion. See Inglot and Ledwina (2006) as well as Janic and Ledwina (2008) for comments. The resulting data driven test statistic for normality is \emph{$W_{T^*}=W_{T^*}(tilde gamma)$}.
| ^
checkRd: (-1) ddst.norm.test.Rd:35: Lost braces; missing escapes or markup?
35 | The pertaining matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and is computed in a numerical way in case of cosine basis. In the implementation of \emph{$T^*$} the default value of \emph{c} is set to be 100. Therefore, in practice, \emph{$T^*$} is Schwarz-type criterion. See Inglot and Ledwina (2006) as well as Janic and Ledwina (2008) for comments. The resulting data driven test statistic for normality is \emph{$W_{T^*}=W_{T^*}(tilde gamma)$}.
| ^
checkRd: (-1) ddst.norm.test.Rd:35: Lost braces; missing escapes or markup?
35 | The pertaining matrix \emph{$[I^*(tilde gamma)]^{-1}$} does not depend on \emph{$tilde gamma$} and is calculated for succeding dimensions \emph{k} using some recurrent relations for Legendre's polynomials and is computed in a numerical way in case of cosine basis. In the implementation of \emph{$T^*$} the default value of \emph{c} is set to be 100. Therefore, in practice, \emph{$T^*$} is Schwarz-type criterion. See Inglot and Ledwina (2006) as well as Janic and Ledwina (2008) for comments. The resulting data driven test statistic for normality is \emph{$W_{T^*}=W_{T^*}(tilde gamma)$}.
| ^
checkRd: (-1) ddst.uniform.test.Rd:25: Lost braces; missing escapes or markup?
25 | $W_k=[1/sqrt(n) sum_{j=1}^k sum_{i=1}^n phi_j(Z_i)]^2$},
| ^
checkRd: (-1) ddst.uniform.test.Rd:25: Lost braces; missing escapes or markup?
25 | $W_k=[1/sqrt(n) sum_{j=1}^k sum_{i=1}^n phi_j(Z_i)]^2$},
| ^
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-devel-windows-x86_64, r-patched-linux-x86_64, r-release-linux-x86_64, r-release-macos-arm64, r-release-macos-x86_64, r-release-windows-x86_64, r-oldrel-macos-arm64, r-oldrel-macos-x86_64, r-oldrel-windows-x86_64
Version: 1.4
Check: for new files in some other directories
Result: NOTE
Found the following files/directories:
‘~/tmp/scratch/Rtmp0BIRQV’ ‘~/tmp/scratch/Rtmp0XcHGu’
‘~/tmp/scratch/Rtmp1vt5rO’ ‘~/tmp/scratch/Rtmp2Y1XAq’
‘~/tmp/scratch/Rtmp3KOsRl’ ‘~/tmp/scratch/Rtmp3TyNsy’
‘~/tmp/scratch/Rtmp3yZBPT’ ‘~/tmp/scratch/Rtmp4Nsccz’
‘~/tmp/scratch/Rtmp6KbaIO’ ‘~/tmp/scratch/Rtmp7ZaIVj’
‘~/tmp/scratch/Rtmp7ntrO9’ ‘~/tmp/scratch/Rtmp8PNxey’
‘~/tmp/scratch/Rtmp8oTOws’ ‘~/tmp/scratch/Rtmp8wEUfT’
‘~/tmp/scratch/RtmpALkGAy’ ‘~/tmp/scratch/RtmpAr8SWn’
‘~/tmp/scratch/RtmpC532Xh’ ‘~/tmp/scratch/RtmpC74U1J’
‘~/tmp/scratch/RtmpCLDazT’ ‘~/tmp/scratch/RtmpCUWpb8’
‘~/tmp/scratch/RtmpCyUgfE’ ‘~/tmp/scratch/RtmpDHe3fi’
‘~/tmp/scratch/RtmpDd22ol’ ‘~/tmp/scratch/RtmpEgTjy9’
‘~/tmp/scratch/RtmpFChFUr’ ‘~/tmp/scratch/RtmpFQ9FeM’
‘~/tmp/scratch/RtmpG0iIy5’ ‘~/tmp/scratch/RtmpG6YtUi’
‘~/tmp/scratch/RtmpGadcdr’ ‘~/tmp/scratch/RtmpHf1rJa’
‘~/tmp/scratch/RtmpIbyEA3’ ‘~/tmp/scratch/RtmpIu5iJR’
‘~/tmp/scratch/RtmpLEB5Zr’ ‘~/tmp/scratch/RtmpM5ReSm’
‘~/tmp/scratch/RtmpMMEbTY’ ‘~/tmp/scratch/RtmpMcrEre’
‘~/tmp/scratch/RtmpMpz4Eg’ ‘~/tmp/scratch/RtmpNIfO8r’
‘~/tmp/scratch/RtmpNPFPnj’ ‘~/tmp/scratch/RtmpNTWszQ’
‘~/tmp/scratch/RtmpPXrt3O’ ‘~/tmp/scratch/RtmpQF6pgI’
‘~/tmp/scratch/RtmpRlb1TO’ ‘~/tmp/scratch/RtmpSjVNgc’
‘~/tmp/scratch/RtmpSl6eX7’ ‘~/tmp/scratch/RtmpTwqlcb’
‘~/tmp/scratch/RtmpUBat5B’ ‘~/tmp/scratch/RtmpUO6LBX’
‘~/tmp/scratch/RtmpVSn44W’ ‘~/tmp/scratch/RtmpWhgtGy’
‘~/tmp/scratch/RtmpWjVT7R’ ‘~/tmp/scratch/RtmpXvrfz4’
‘~/tmp/scratch/RtmpXxRu7R’ ‘~/tmp/scratch/RtmpYwU4Yw’
‘~/tmp/scratch/RtmpZKLcLH’ ‘~/tmp/scratch/RtmpZsj7lh’
‘~/tmp/scratch/RtmpaI1kaA’ ‘~/tmp/scratch/RtmpaSspLu’
‘~/tmp/scratch/RtmpamwJbe’ ‘~/tmp/scratch/Rtmpb3AXh6’
‘~/tmp/scratch/Rtmpb8nAy2’ ‘~/tmp/scratch/Rtmpb98v5t’
‘~/tmp/scratch/RtmpbFg3rF’ ‘~/tmp/scratch/Rtmpbm5pHa’
‘~/tmp/scratch/RtmpcW4BjE’ ‘~/tmp/scratch/Rtmpcvfxff’
‘~/tmp/scratch/Rtmpd7WKA1’ ‘~/tmp/scratch/Rtmpe94Fbh’
‘~/tmp/scratch/RtmpeBRdrH’ ‘~/tmp/scratch/RtmpeEG95d’
‘~/tmp/scratch/Rtmpex4Ln5’ ‘~/tmp/scratch/Rtmpf7BUE4’
‘~/tmp/scratch/Rtmpg6wwBC’ ‘~/tmp/scratch/Rtmpg6x2GQ’
‘~/tmp/scratch/RtmpgVzWoR’ ‘~/tmp/scratch/RtmphSXph0’
‘~/tmp/scratch/RtmphwWIs7’ ‘~/tmp/scratch/Rtmpi50XN5’
‘~/tmp/scratch/RtmpjPQLGF’ ‘~/tmp/scratch/RtmpjpKZ2i’
‘~/tmp/scratch/Rtmpk5n3al’ ‘~/tmp/scratch/RtmpkS3mA1’
‘~/tmp/scratch/Rtmpkd95d1’ ‘~/tmp/scratch/RtmpkyYaWa’
‘~/tmp/scratch/Rtmpo8HsCZ’ ‘~/tmp/scratch/RtmpoBqjLk’
‘~/tmp/scratch/RtmpoR8KER’ ‘~/tmp/scratch/RtmppH0bju’
‘~/tmp/scratch/RtmppHvuXT’ ‘~/tmp/scratch/RtmppLbHCS’
‘~/tmp/scratch/Rtmpq61Pqh’ ‘~/tmp/scratch/RtmpqV1U8K’
‘~/tmp/scratch/Rtmpr4oS76’ ‘~/tmp/scratch/Rtmpr8NMxM’
‘~/tmp/scratch/RtmpsWLnjY’ ‘~/tmp/scratch/Rtmpsuzqxt’
‘~/tmp/scratch/RtmptdaRet’ ‘~/tmp/scratch/RtmpuC3d9I’
‘~/tmp/scratch/RtmpuVvMsP’ ‘~/tmp/scratch/RtmpvMkl2v’
‘~/tmp/scratch/RtmpwgMzYd’ ‘~/tmp/scratch/RtmpxgpRKz’
‘~/tmp/scratch/RtmpxmUb35’ ‘~/tmp/scratch/RtmpyiQT47’
‘~/tmp/scratch/Rtmpzctf1q’ ‘~/tmp/scratch/RtmpzjjXwE’
‘~/tmp/scratch/quarto-session8b886dccc8eb91ca’
‘~/tmp/scratch/xvfb-run.1OudOk’ ‘~/tmp/scratch/xvfb-run.40jaWJ’
‘~/tmp/scratch/xvfb-run.7peUhj’ ‘~/tmp/scratch/xvfb-run.B9rhfN’
‘~/tmp/scratch/xvfb-run.BAiU2k’ ‘~/tmp/scratch/xvfb-run.CqZ13F’
‘~/tmp/scratch/xvfb-run.FaJZjG’ ‘~/tmp/scratch/xvfb-run.GibFO7’
‘~/tmp/scratch/xvfb-run.Gk4HQN’ ‘~/tmp/scratch/xvfb-run.HerxZ5’
‘~/tmp/scratch/xvfb-run.IJnewR’ ‘~/tmp/scratch/xvfb-run.IPewr1’
‘~/tmp/scratch/xvfb-run.NL6gYr’ ‘~/tmp/scratch/xvfb-run.ODl3Re’
‘~/tmp/scratch/xvfb-run.RBiFk2’ ‘~/tmp/scratch/xvfb-run.WyDYfR’
‘~/tmp/scratch/xvfb-run.Y8dRyM’ ‘~/tmp/scratch/xvfb-run.YB5UtF’
‘~/tmp/scratch/xvfb-run.ZF7Luh’ ‘~/tmp/scratch/xvfb-run.dnVVrD’
‘~/tmp/scratch/xvfb-run.g7WsgD’ ‘~/tmp/scratch/xvfb-run.kyvIwZ’
‘~/tmp/scratch/xvfb-run.l4r4JN’ ‘~/tmp/scratch/xvfb-run.p4Ts6j’
‘~/tmp/scratch/xvfb-run.pWsc8L’ ‘~/tmp/scratch/xvfb-run.tApF5E’
‘~/tmp/scratch/xvfb-run.ucMROd’ ‘~/tmp/scratch/xvfb-run.zEsAjJ’
Flavor: r-devel-linux-x86_64-debian-gcc