# Buildsheet autogenerated by ravenadm tool -- Do not edit.

NAMEBASE=		R-eddington
VERSION=		4.2.0
KEYWORDS=		cran
VARIANTS=		std
SDESC[std]=		Compute a Cyclist's Eddington Number
HOMEPAGE=		https://github.com/pegeler/eddington2
CONTACT=		CRAN_Automaton[cran@ironwolf.systems]

DOWNLOAD_GROUPS=	main
SITES[main]=		CRAN/src/contrib
			https://loki.dragonflybsd.org/cranfiles/
DISTFILE[1]=		eddington_4.2.0.tar.gz:main
DIST_SUBDIR=		CRAN
DF_INDEX=		1
SPKGS[std]=		single

OPTIONS_AVAILABLE=	none
OPTIONS_STANDARD=	none

BUILDRUN_DEPENDS=	R-Rcpp:single:std
			R-R6:single:std
			R-xml2:single:std

USES=			cran gmake

DISTNAME=		eddington

GENERATED=		yes

INSTALL_REQ_TOOLCHAIN=	yes

[FILE:1122:descriptions/desc.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 &lt;<a
href="https://en.wikipedia.org/wiki/Arthur_Eddington#Eddington_number_for_cycling"
target="_top">https://en.wikipedia.org/wiki/Arthur_Eddington#Eddington_number_for_cycling</a>&gt;
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) &lt;<a href="https://doi.org/10.1073%2Fpnas.0507655102"
target="_top">doi:10.1073/pnas.0507655102</a>&gt;. Both are specific
applications of computing the side length of a Durfee square &lt;<a
href="https://en.wikipedia.org/wiki/Durfee_square"
target="_top">https://en.wikipedia.org/wiki/Durfee_square</a>&gt;.


[FILE:106:distinfo]
efa8a1f456470c16f1111841e3614fcbe5215c55cda73b84051534b9cdae295b        80393 CRAN/eddington_4.2.0.tar.gz