r-cran-bit 1.1-15.1-1 source package in Ubuntu
Changelog
r-cran-bit (1.1-15.1-1) unstable; urgency=medium * New upstream version * debhelper-compat 12 * Standards-Version: 4.4.1 -- Andreas Tille <email address hidden> Wed, 15 Jan 2020 11:34:03 +0100
Upload details
- Uploaded by:
- Debian R Packages Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian R Packages Maintainers
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
r-cran-bit_1.1-15.1-1.dsc | 2.0 KiB | 95a2a5b75162389236e002a00da7f7f001966e628cd998b81b96f0999d0f30db |
r-cran-bit_1.1-15.1.orig.tar.gz | 55.6 KiB | 289fdcbadaac2dbb80cb447c316362f8165ef995d590a8e2e23ed94ca50a6578 |
r-cran-bit_1.1-15.1-1.debian.tar.xz | 2.0 KiB | 8ba15bdd63ae7c30de70e02be1c1fa0bf29dc551c313c6b238a92f0b3507ca8c |
Available diffs
No changes file available.
Binary packages built by this source
- r-cran-bit: GNU R class for vectors of 1-bit booleans
This GNU R package provides bitmapped vectors of booleans (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 one 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).
- r-cran-bit-dbgsym: debug symbols for r-cran-bit