Last updated on 2025-07-23 11:50:18 CEST.
| Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
|---|---|---|---|---|---|---|
| r-devel-linux-x86_64-debian-clang | 1.2.0 | 31.17 | 63.37 | 94.54 | NOTE | |
| r-devel-linux-x86_64-debian-gcc | 1.2.0 | 19.86 | 46.95 | 66.81 | NOTE | |
| r-devel-linux-x86_64-fedora-clang | 1.2.0 | 156.31 | NOTE | |||
| r-devel-linux-x86_64-fedora-gcc | 1.2.0 | 143.89 | NOTE | |||
| r-devel-windows-x86_64 | 1.2.0 | 34.00 | 98.00 | 132.00 | NOTE | |
| r-patched-linux-x86_64 | 1.2.0 | 28.47 | 60.20 | 88.67 | NOTE | |
| r-release-linux-x86_64 | 1.2.0 | 27.86 | 59.93 | 87.79 | NOTE | |
| r-release-macos-arm64 | 1.2.0 | 44.00 | NOTE | |||
| r-release-macos-x86_64 | 1.2.0 | 82.00 | NOTE | |||
| r-release-windows-x86_64 | 1.2.0 | 33.00 | 98.00 | 131.00 | NOTE | |
| r-oldrel-macos-arm64 | 1.2.0 | 42.00 | NOTE | |||
| r-oldrel-macos-x86_64 | 1.2.0 | 62.00 | NOTE | |||
| r-oldrel-windows-x86_64 | 1.2.0 | 40.00 | 119.00 | 159.00 | NOTE |
Version: 1.2.0
Check: CRAN incoming feasibility
Result: NOTE
Maintainer: ‘Alireza S. Mahani <alireza.s.mahani@gmail.com>’
No Authors@R field in DESCRIPTION.
Please add one, modifying
Authors@R: c(person(given = c("Mansour", "T.A."),
family = "Sharabiani",
role = "aut"),
person(given = c("Alireza", "S."),
family = "Mahani",
role = c("aut", "cre"),
email = "alireza.s.mahani@gmail.com"))
as necessary.
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc
Version: 1.2.0
Check: Rd files
Result: NOTE
checkRd: (-1) cfc.tbasis.Rd:23: Lost braces
23 | Assuming one-dimensional \code{p1} and \code{p2} for clarity, the algorithm calculates cumulative incidence function for cuase 1 using a recursive formula: \code{ci1[n+1] = ci1[n] + dci1[n]}, where \code{dci1[n] = 0.5*(p2[n] + p2[n+1])*(p1[n] - p1[n+1])}. The increment in cumulative incidence function for cause 2 is similarly calculated, \code{dci2[n] = 0.5*(p1[n] + p1[n+1])*(p2[n] - p2[n+1])}. These equations guarantee that \code{dci1[n] + dci2[n] = p1[n]*p2[n] - p1[n+1]*p2[n+1]}. Event-free probability is simply calculated as code{efp[n] = p1[n]*p2[n]}. Taken together, this numerical integration ensures that \code{efp[n+1] - efp[n] + dci1[n] + dci2[n] = 0}.
| ^
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