[med-svn] [r-cran-bit] 02/07: Upload to new

[Andreas Tille]

This is an automated email from the git hooks/post-receive script.

tille pushed a commit to branch master
in repository r-cran-bit.

commit f7a67022a4bbb40247316cef19a4817c08c86b81
Author: Andreas Tille <tille at debian.org>
Date:   Fri Aug 25 22:15:42 2017 +0000

    Upload to new
---
 debian/changelog |  6 +++---
 debian/control   | 34 ++++++++++++++++++----------------
 2 files changed, 21 insertions(+), 19 deletions(-)

diff --git a/debian/changelog b/debian/changelog
index 462d238..90e88c7 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -1,5 +1,5 @@
-r-cran-bit (1.1-12-1) UNRELEASED; urgency=medium
+r-cran-bit (1.1-12-1) unstable; urgency=medium
 
-  * Initial release (closes: #xxxxxx)
+  * Initial release (closes: #873270)
 
- -- Andreas Tille <tille at debian.org>  Fri, 25 Aug 2017 23:29:01 +0200
+ -- Andreas Tille <tille at debian.org>  Sat, 26 Aug 2017 00:08:51 +0200
diff --git a/debian/control b/debian/control
index 8f09a85..1c7ba87 100644
--- a/debian/control
+++ b/debian/control
@@ -20,22 +20,24 @@ Recommends: ${R:Recommends}
 Suggests: ${R:Suggests}
 Description: 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
+ 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).
+ 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).

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-med/r-cran-bit.git