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>.
Version: 4.2.0 Depends: R (≥ 4.2.0) Imports: Rcpp, R6, methods, xml2 LinkingTo: Rcpp Suggests: testthat, knitr, rmarkdown, stats, dplyr Published: 2024-08-16 DOI: 10.32614/CRAN.package.eddington 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 SystemRequirements: C++17 Materials: README, NEWS CRAN checks: eddington results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=eddington to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4