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

Changelog

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

  * New upstream version
  * Standards-Version: 4.6.1 (routine-update)
  * Reorder sequence of d/control fields by cme (routine-update)

 -- Andreas Tille <email address hidden>  Mon, 21 Nov 2022 11:26:41 +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 Pocket Published Component Section
Oracular release universe misc
Noble release universe misc
Mantic release universe misc
Lunar release universe misc

Downloads

File Size SHA-256 Checksum
r-cran-bit_4.0.5-1.dsc 2.0 KiB dd9a894c590ae6eeb76c52cc192597455c469ea9ebffb12cfcfa0b61d7fdad91
r-cran-bit_4.0.5.orig.tar.xz 718.4 KiB 0f38578c4ae37cb87a5d8cdd6b1d9e3a48f9973363a534a94d68363d5113ac1f
r-cran-bit_4.0.5-1.debian.tar.xz 2.5 KiB 5e7de56387a02c14bc708844d64ee02274472e5467ae388cbfdbd1862e210f53

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