Ubuntu
r-cran-bit package

r-cran-bit 1.1-12-2 source package in Ubuntu

Changelog

r-cran-bit (1.1-12-2) unstable; urgency=medium

  * Moved packaging from SVN to Git
  * Testsuite: autopkgtest-pkg-r
  * Standards-Version: 4.1.1

 -- Andreas Tille <email address hidden>  Wed, 29 Nov 2017 15:32:38 +0100

Upload details

Uploaded by:
Debian Med
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release universe misc

Downloads

File Size SHA-256 Checksum
r-cran-bit_1.1-12-2.dsc 2.0 KiB 5e2040259a37655c9e8db45ee1268332fd75f62b6a1b70b4e2d5aa161093b2b1
r-cran-bit_1.1-12.orig.tar.gz 52.5 KiB ce281c87fb7602bf1a599e72f3e25f9ff7a13e390c124a4506087f69ad79d128
r-cran-bit_1.1-12-2.debian.tar.xz 1.9 KiB 99999168c36229c3f2c997cc5d5897b778a4b465d3371fe3966d7fb9e00b2cee

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: No summary available for r-cran-bit-dbgsym in ubuntu cosmic.

No description available for r-cran-bit-dbgsym in ubuntu cosmic.