diff options
| -rw-r--r-- | devel/R-cran-bit/Makefile | 5 | ||||
| -rw-r--r-- | devel/R-cran-bit/distinfo | 6 | ||||
| -rw-r--r-- | devel/R-cran-bit/pkg-descr | 25 |
3 files changed, 9 insertions, 27 deletions
diff --git a/devel/R-cran-bit/Makefile b/devel/R-cran-bit/Makefile index 5da0c36101d9..3216d9f9c46f 100644 --- a/devel/R-cran-bit/Makefile +++ b/devel/R-cran-bit/Makefile @@ -2,15 +2,14 @@ # $FreeBSD$ PORTNAME= bit -DISTVERSION= 1.1-15.2 -PORTREVISION= 1 +DISTVERSION= 4.0.3 CATEGORIES= devel DISTNAME= ${PORTNAME}_${DISTVERSION} MAINTAINER= tota@FreeBSD.org COMMENT= Class for vectors of 1-bit booleans -LICENSE= GPLv2 +LICENSE= GPLv2+ USES= cran:auto-plist,compiles diff --git a/devel/R-cran-bit/distinfo b/devel/R-cran-bit/distinfo index 2fe011130e40..c6d85b6d9d14 100644 --- a/devel/R-cran-bit/distinfo +++ b/devel/R-cran-bit/distinfo @@ -1,3 +1,3 @@ -TIMESTAMP = 1581413439 -SHA256 (bit_1.1-15.2.tar.gz) = 0b83e78385293d6cdc0189a07fcc3f9f9db286c8c4af3288467f5257e79cb28b -SIZE (bit_1.1-15.2.tar.gz) = 56964 +TIMESTAMP = 1596193005 +SHA256 (bit_4.0.3.tar.gz) = 6a680e2f8020496da8c7637480ce8afabc3072c98cfdd2c35c4ec7c5c6b66349 +SIZE (bit_4.0.3.tar.gz) = 279205 diff --git a/devel/R-cran-bit/pkg-descr b/devel/R-cran-bit/pkg-descr index 98b326219f39..b3960d295302 100644 --- a/devel/R-cran-bit/pkg-descr +++ b/devel/R-cran-bit/pkg-descr @@ -1,23 +1,6 @@ -True boolean datatype (no NAs), coercion from and to logicals, -integers and integer subscripts; fast boolean operators and fast -summary statistics. With 'bit' vectors you can store true binary -booleans {FALSE,TRUE} at the expense of 1 bit only, on a 32 bit -architecture this means factor 32 less RAM and ~ factor 32 more -speed on boolean operations. Due to overhead of R calls, actual -speed gain depends on the size of the vector: expect gains for -vectors of size > 10000 elements. Even for one-time boolean operations -it can pay-off to convert to bit, the pay-off is obvious, when such -components are used more than once. Reading from and writing to bit -is approximately as fast as accessing standard logicals - mostly -due to R's time for memory allocation. The package allows to work -with pre-allocated memory for return values by calling .Call() -directly: when evaluating the speed of C-access with pre-allocated -vector memory, coping from bit to logical requires only 70% of the -time for copying from logical to logical; and copying from logical -to bit comes at a performance penalty of 150%. the package now -contains further classes for representing logical selections: -'bitwhich' for very skewed selections and 'ri' for selecting ranges -of values for chunked processing. All three index classes can be -used for subsetting 'ff' objects (ff-2.1-0 and higher). +Provided are classes for boolean and skewed boolean vectors, fast +boolean methods, fast unique and non-unique integer sorting, fast +set operations on sorted and unsorted sets of integers, and foundations +for ff (range index, compression, chunked processing). WWW: https://cran.r-project.org/web/packages/bit/ |