bucket_DC/R-eddington

   1 # Buildsheet autogenerated by ravenadm tool -- Do not edit.
   2
   3 NAMEBASE=               R-eddington
   4 VERSION=                4.1.3
   5 KEYWORDS=               cran
   6 VARIANTS=               standard
   7 SDESC[standard]=        Compute a Cyclist's Eddington Number
   8 HOMEPAGE=               https://github.com/pegeler/eddington2
   9 CONTACT=                CRAN_Automaton[cran@ironwolf.systems]
  10
  11 DOWNLOAD_GROUPS=        main
  12 SITES[main]=            CRAN/src/contrib
  13                         https://loki.dragonflybsd.org/cranfiles/
  14 DISTFILE[1]=            eddington_4.1.3.tar.gz:main
  15 DIST_SUBDIR=            CRAN
  16 DF_INDEX=               1
  17 SPKGS[standard]=        single
  18
  19 OPTIONS_AVAILABLE=      none
  20 OPTIONS_STANDARD=       none
  21
  22 BUILDRUN_DEPENDS=       R-Rcpp:single:standard
  23                         R-R6:single:standard
  24                         R-XML:single:standard
  25
  26 USES=                   cran gmake
  27
  28 DISTNAME=               eddington
  29
  30 GENERATED=              yes
  31
  32 INSTALL_REQ_TOOLCHAIN=  yes
  33
  34 [FILE:1122:descriptions/desc.single]
  35 eddington: Compute a Cyclist's Eddington Number
  36
  37 Compute a cyclist's Eddington number, including efficiently computing
  38 cumulative E over a vector. A cyclist's Eddington number &lt;<a
  39 href="https://en.wikipedia.org/wiki/Arthur_Eddington#Eddington_number_for_cycling"
  40 target="_top">https://en.wikipedia.org/wiki/Arthur_Eddington#Eddington_number_for_cycling</a>&gt;
  41 is the maximum number satisfying the condition such that a cyclist has
  42 ridden E miles or greater on E distinct days. The algorithm in this package
  43 is an improvement over the conventional approach because both summary
  44 statistics and cumulative statistics can be computed in linear time, since
  45 it does not require initial sorting of the data. These functions may also
  46 be used for computing h-indices for authors, a metric described by Hirsch
  47 (2005) &lt;<a href="https://doi.org/10.1073%2Fpnas.0507655102"
  48 target="_top">doi:10.1073/pnas.0507655102</a>&gt;. Both are specific
  49 applications of computing the side length of a Durfee square &lt;<a
  50 href="https://en.wikipedia.org/wiki/Durfee_square"
  51 target="_top">https://en.wikipedia.org/wiki/Durfee_square</a>&gt;.
  52
  53
  54 [FILE:106:distinfo]
  55 4e495c62d32d66f07a92a1015380790cca76003ec4524247e7489d8b70a304c4        79644 CRAN/eddington_4.1.3.tar.gz
  56