CRAN Package Check Results for Package IrregLong

Last updated on 2024-07-12 03:55:37 CEST.

Flavor Version Tinstall Tcheck Ttotal Status Flags
r-devel-linux-x86_64-debian-clang 0.3.4 10.03 114.92 124.95 NOTE
r-devel-linux-x86_64-debian-gcc 0.3.4 10.22 86.22 96.44 NOTE
r-devel-linux-x86_64-fedora-clang 0.3.4 161.23 NOTE
r-devel-linux-x86_64-fedora-gcc 0.3.4 165.25 NOTE
r-devel-windows-x86_64 0.3.4 11.00 98.00 109.00 NOTE
r-patched-linux-x86_64 0.3.4 7.82 111.28 119.10 NOTE
r-release-linux-x86_64 0.3.4 7.54 109.64 117.18 NOTE
r-release-macos-arm64 0.3.4 51.00 NOTE
r-release-macos-x86_64 0.3.4 72.00 NOTE
r-release-windows-x86_64 0.3.4 10.00 97.00 107.00 NOTE
r-oldrel-macos-arm64 0.3.4 59.00 OK
r-oldrel-macos-x86_64 0.3.4 100.00 OK
r-oldrel-windows-x86_64 0.3.4 14.00 117.00 131.00 OK

Check Details

Version: 0.3.4
Check: Rd files
Result: NOTE checkRd: (-1) extent.of.irregularity.Rd:59: Lost braces; missing escapes or markup? 59 | This function provides plots and a numerical summary of the extent of irregularity in visit times. For any given set of cutpoints, it computes the proportion of individuals with 0, 1 and >1 observation(s) in each bin, then takes the mean over bins. The sizes of the bins are varied and these proportions are plotted against bin size. In addition, then mean proportion of individuals with >1 visit per bin is plotted vs. the mean proportion of individuals with 0 visits per bin, and the area under the curve is calculated (AUC). An AUC of 0 represents perfect repeated measures while a Poisson Process has an AUC of 0. If cutpoints are not supplied, they are computed as follows: (a) for studies with protocolized visit times, the left- and right-hand cutpoints are positioned at the protocolized time minus (or plus, for right-hand cutpoints) (1,...,ncutpts)/ncutpts times the gap to the previous (or next, respectively) protocolized visit time; (b) for studies with no protocolized visit times, cutpoints are calculated by finding, for each j in {1,...,ncutpts} the largest times for which the cumulative hazard is less than j divided by the cumulative hazard evaluated at the maximum time of interest. This corresponds to choosing cutpoints such that the expected number of visits per bin is roughly equal within each set. | ^ 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