kpriv/freebsd-ports
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

- Update to 4.0.3

Browse source
This commit is contained in:
TAKATSU Tomonari 2020-07-31 11:11:31 +00:00
parent 7f51856bd3
commit 7a245877a2
Notes: svn2git 2021-03-31 03:12:20 +00:00 
svn path=/head/; revision=543852
3 changed files with 9 additions and 27 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
devel/R-cran-bit/Makefile
View file

@ -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

6
devel/R-cran-bit/distinfo
View file

@ -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

25
devel/R-cran-bit/pkg-descr
View file

@ -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/