CRAN/E | eddington

eddington

Compute a Cyclist's Eddington Number

Installation

About

Compute a cyclist's Eddington number, including efficiently computing cumulative E over a vector. A cyclist's Eddington number 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 .

github.com/pegeler/eddington2
System requirements C++17
Bug report File report

Key Metrics

Version 4.1.3
R ≥ 4.2.0
Published 2024-01-14 114 days ago
Needs compilation? yes
License GPL-2
License GPL-3
CRAN checks eddington results

Downloads

Yesterday 3 0%
Last 7 days 49 -54%
Last 30 days 230 +5%
Last 90 days 672 -50%
Last 365 days 3.055 +17%

Maintainer

Maintainer

Paul Egeler

paulegeler@gmail.com

Authors

Paul Egeler

aut / cre

Tashi Reigle

ctb

Material

README
NEWS
Reference manual
Package source

Vignettes

eddington

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

eddington archive

Depends

R ≥ 4.2.0

Imports

Rcpp
R6
methods
stats
XML

Suggests

testthat
knitr
rmarkdown
dplyr

LinkingTo

Rcpp