• using R version 4.5.0 beta (2025-03-29 r88069)
  • using platform: aarch64-apple-darwin20
  • R was compiled by     Apple clang version 14.0.0 (clang-1400.0.29.202)     GNU Fortran (GCC) 14.2.0
  • running under: macOS Ventura 13.4
  • using session charset: UTF-8
  • checking for file ‘asht/DESCRIPTION’ ... OK
  • checking extension type ... Package
  • this is package ‘asht’ version ‘1.0.1’
  • checking package namespace information ... OK
  • checking package dependencies ... OK
  • checking if this is a source package ... OK
  • checking if there is a namespace ... OK
  • checking for executable files ... OK
  • checking for hidden files and directories ... OK
  • checking for portable file names ... OK
  • checking for sufficient/correct file permissions ... OK
  • checking whether package ‘asht’ can be installed ... [5s/6s] OK See the install log for details.
  • checking installed package size ... OK
  • checking package directory ... OK
  • checking DESCRIPTION meta-information ... OK
  • checking top-level files ... OK
  • checking for left-over files ... OK
  • checking index information ... OK
  • checking package subdirectories ... OK
  • checking code files for non-ASCII characters ... OK
  • checking R files for syntax errors ... OK
  • checking whether the package can be loaded ... [1s/1s] OK
  • checking whether the package can be loaded with stated dependencies ... [1s/1s] OK
  • checking whether the package can be unloaded cleanly ... [1s/2s] OK
  • checking whether the namespace can be loaded with stated dependencies ... [1s/1s] OK
  • checking whether the namespace can be unloaded cleanly ... [1s/1s] OK
  • checking loading without being on the library search path ... [1s/1s] OK
  • checking dependencies in R code ... OK
  • checking S3 generic/method consistency ... OK
  • checking replacement functions ... OK
  • checking foreign function calls ... OK
  • checking R code for possible problems ... [4s/5s] OK
  • checking Rd files ... [0s/0s] NOTE checkRd: (-1) signTest.Rd:29: Lost braces     29 | code{stat="ud"} gives 0, and \code{stat="cpp"} gives 0.5).        | ^ checkRd: (-1) simulateSS.Rd:46: Lost braces; missing escapes or markup?     46 | and the total number of batches, $b_{tot}$.        | ^ checkRd: (-1) simulateSS.Rd:48: Lost braces; missing escapes or markup?     48 | Then we use a normal approximation to estimate the target sample size, say $N_{norm}$. In step 2, we replicate $m$ data sets with sample size $N_2 = N_{norm}$        | ^ checkRd: (-1) simulateSS.Rd:48: Lost braces; missing escapes or markup?     48 | Then we use a normal approximation to estimate the target sample size, say $N_{norm}$. In step 2, we replicate $m$ data sets with sample size $N_2 = N_{norm}$        | ^ checkRd: (-1) simulateSS.Rd:49: Lost braces; missing escapes or markup?     49 | to get the associated proportion of rejections, say $P_2$. We repeat 2 more batches with $N_3=N_{norm}/2$ and $N_4=2 N_{norm}$,        | ^ checkRd: (-1) simulateSS.Rd:49: Lost braces; missing escapes or markup?     49 | to get the associated proportion of rejections, say $P_2$. We repeat 2 more batches with $N_3=N_{norm}/2$ and $N_4=2 N_{norm}$,        | ^ checkRd: (-1) simulateSS.Rd:51: Lost braces; missing escapes or markup?     51 | the sample size at the target power, $N_{target}$. We use that estimate of $N_{target}$ for our sample size for the next        | ^ checkRd: (-1) simulateSS.Rd:51: Lost braces; missing escapes or markup?     51 | the sample size at the target power, $N_{target}$. We use that estimate of $N_{target}$ for our sample size for the next        | ^ checkRd: (-1) simulateSS.Rd:53: Lost braces; missing escapes or markup?     53 | Wu (1985, see Section 3). Step 4 is iterative, for the $i$th batch we repeat the isotonic regression, except now with $N_i$ estimated from the first $(i-1)$ observation pairs. We repeat step 4 until either the number of batches is $b_{tot}$,        | ^ checkRd: (-1) simulateSS.Rd:56: Lost braces; missing escapes or markup?     56 | current sample size estimate, otherwise add 1. Continue with that up-and-down-like method until we reach the number of batches equal to $b_{tot}$. The up-and-down-like method was added because sometimes the algorithm would get stuck in too large of a sample size estimate.        | ^
  • checking Rd metadata ... OK
  • checking Rd cross-references ... OK
  • checking for missing documentation entries ... OK
  • checking for code/documentation mismatches ... OK
  • checking Rd \usage sections ... OK
  • checking Rd contents ... OK
  • checking for unstated dependencies in examples ... OK
  • checking contents of ‘data’ directory ... OK
  • checking data for non-ASCII characters ... [0s/0s] OK
  • checking data for ASCII and uncompressed saves ... OK
  • checking examples ... [3s/3s] OK
  • checking PDF version of manual ... [5s/5s] OK
  • DONE Status: 1 NOTE
  • using check arguments '--no-clean-on-error '