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 in E 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>.

Version: 2.1.1
Depends: R (≥ 3.4.0)
Imports: Rcpp
LinkingTo: Rcpp
Suggests: testthat, knitr, rmarkdown, dplyr
Published: 2020-03-24
Author: Paul Egeler [aut, cre], Tashi Reigle [ctb]
Maintainer: Paul Egeler <paulegeler at gmail.com>
BugReports: https://github.com/pegeler/eddington2/issues
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
URL: https://github.com/pegeler/eddington2
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: eddington results

Downloads:

Reference manual: eddington.pdf
Vignettes: eddington
Package source: eddington_2.1.1.tar.gz
Windows binaries: r-prerelease: eddington_2.1.1.zip, r-release: eddington_2.1.1.zip, r-oldrel: eddington_2.1.1.zip
macOS binaries: r-prerelease: eddington_2.1.1.tgz, r-release: eddington_2.1.1.tgz, r-oldrel: not available

Linking:

Please use the canonical form https://CRAN.R-project.org/package=eddington to link to this page.