| Port variant | std |
| Summary | Compute a Cyclist's Eddington Number |
| BROKEN | |
| Package version | 4.2.0 |
| Homepage | https://github.com/pegeler/eddington2 |
| Keywords | cran |
| Maintainer | CRAN Automaton |
| License | Not yet specified |
| Other variants | There are no other variants. |
| Ravenports | Buildsheet | History |
| Ravensource | Port Directory | History |
| Last modified | 18 AUG 2024, 15:27:58 UTC |
| Port created | 17 FEB 2021, 22:22:18 UTC |
| single | eddington: Compute a Cyclist's Eddington Number Compute a cyclist's Eddington number, including efficiently computing cumulative E over a vector. A cyclist's Eddington number <https://en.wikipedia.org/wiki/Arthur_Eddington#Eddington_number_for_cycling> is the maximum number satisfying the condition such that a cyclist has ridden E miles or greater on E distinct days. The algorithm in this package is an improvement over the conventional approach because both summary statistics and cumulative statistics can be computed in linear time, since it does not require initial sorting of the data. These functions may also be used for computing h-indices for authors, a metric described by Hirsch (2005) <doi:10.1073/pnas.0507655102>. Both are specific applications of computing the side length of a Durfee square <https://en.wikipedia.org/wiki/Durfee_square>. |
| Build (only) |
gmake:primary:std R:primary:std icu:dev:std |
| Build and Runtime |
R-Rcpp:single:std R-R6:single:std R-xml2:single:std |
| Runtime (only) |
R:primary:std R:nls:std |
| main | mirror://CRAN/src/contrib https://loki.dragonflybsd.org/cranfiles/ |
| No other ports depend on this one. |