CRAN Package Check Results for Package ACSWR

Last updated on 2024-12-22 06:49:48 CET.

Flavor	Version	Tinstall	Tcheck	Ttotal	Status	Flags
r-devel-linux-x86_64-debian-clang	1.0	3.43	46.94	50.37	NOTE
r-devel-linux-x86_64-debian-gcc	1.0	2.23	35.35	37.58	NOTE
r-devel-linux-x86_64-fedora-clang	1.0			81.89	NOTE
r-devel-linux-x86_64-fedora-gcc	1.0			78.31	NOTE
r-devel-windows-x86_64	1.0	8.00	103.00	111.00	NOTE
r-patched-linux-x86_64	1.0	3.78	45.25	49.03	NOTE
r-release-linux-x86_64	1.0	3.11	46.15	49.26	NOTE
r-release-macos-arm64	1.0			30.00	NOTE
r-release-macos-x86_64	1.0			47.00	NOTE
r-release-windows-x86_64	1.0	5.00	110.00	115.00	NOTE
r-oldrel-macos-arm64	1.0			30.00	OK
r-oldrel-macos-x86_64	1.0			43.00	OK
r-oldrel-windows-x86_64	1.0	5.00	94.00	99.00	OK

Check Details

Version: 1.0
Check: Rd files
Result: NOTE checkRd: (-1) Ehrenfest.Rd:19: Lost braces 19 | In this experiment there are i balls in Urn I, and remaining 2n-i balls in Urn II. Then at any instance, the probability of selecting a ball from Urn I and placing it in Urn II is i/2n, and the other way of placing a ball from Urn II to Urn I is (2n-i)/2n. At each instant we let the number i of balls in the Urn I to be the state of the system. Thus, the state space is S = { 0, 1, 2, \ldots, 2n }. Then we can pass from state i only to either of the states i-1 or i+1. | ^ checkRd: (-1) Ehrenfest.Rd:20: Lost braces 20 | Here, S = {0, 1, \ldots, 2n}. | ^ 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