CRAN Package Check Results for Package FunWithNumbers

Last updated on 2023-12-04 20:09:58 CET.

Flavor Version Tinstall Tcheck Ttotal Status Flags
r-devel-linux-x86_64-debian-clang 1.1.1 4.22 44.11 48.33 NOTE
r-devel-linux-x86_64-debian-gcc 1.1.1 3.89 33.79 37.68 NOTE
r-devel-linux-x86_64-fedora-clang 1.1.1 61.12 OK
r-devel-linux-x86_64-fedora-gcc 1.1.1 59.15 OK
r-devel-windows-x86_64 1.1.1 4.00 53.00 57.00 OK
r-patched-linux-x86_64 1.1.1 4.14 43.00 47.14 OK
r-release-linux-x86_64 1.1.1 4.23 44.29 48.52 OK
r-release-macos-arm64 1.1.1 24.00 OK
r-release-macos-x86_64 1.1.1 47.00 OK
r-release-windows-x86_64 1.1.1 6.00 57.00 63.00 OK
r-oldrel-macos-arm64 1.1.1 24.00 OK
r-oldrel-macos-x86_64 1.1.1 34.00 OK
r-oldrel-windows-x86_64 1.1.1 7.00 61.00 68.00 OK

Check Details

Version: 1.1.1
Check: Rd files
Result: NOTE checkRd: (-1) bpp.Rd:31: Lost braces 31 | The BPP algorithm calculates the sum{K=0,k, 1/(b^K) * FracSum} , where FracSum is defined by the sum(M=1,m, A[M]/(m*K + M)^s) . This means that the number of elements of \code{A} must equal \code{m}. Zero values are legal and are used to reject fractions not wanted in the inner sum. | ^ Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc