Ubuntu
r-cran-bit package

r-cran-bit 4.5.0.1-1 source package in Ubuntu

Changelog

r-cran-bit (4.5.0.1-1) unstable; urgency=medium

  * Team upload.
  * New upstream version
  * Standards-Version: 4.7.0 (routine-update)
  * Add dh-make-R templates for autopkgtests.
  * Set upstream metadata fields: Bug-Database, Bug-Submit, Repository-Browse.

 -- Charles Plessy <email address hidden>  Fri, 31 Jan 2025 08:56:47 +0900

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 Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
r-cran-bit_4.5.0.1-1.dsc 2.1 KiB 733d3aa892b88b8125a018e05d17591b40404bc687859481b0f8d824a5413e6f
r-cran-bit_4.5.0.1.orig.tar.xz 737.0 KiB 596bd39bf57bca32073b874c9687484ccb1a9a7bec9fdb38a5561e368b455aa3
r-cran-bit_4.5.0.1-1.debian.tar.xz 3.0 KiB 2b0b24997ced9088da1503c45b1a639359615ce492b5bb0a7fa98705a58f7dc1

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