summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGlenn Johnson <glenn-johnson@uiowa.edu>2021-01-15 03:45:52 -0600
committerGitHub <noreply@github.com>2021-01-15 10:45:52 +0100
commit3d3761f8f0962c1b489dafda5d836954f1ccfbb8 (patch)
tree9b83685175143404ffb7e557d079824173635707
parent0024c8df0836182e0acf208a738ba5014fbead20 (diff)
downloadspack-3d3761f8f0962c1b489dafda5d836954f1ccfbb8.tar.gz
spack-3d3761f8f0962c1b489dafda5d836954f1ccfbb8.tar.bz2
spack-3d3761f8f0962c1b489dafda5d836954f1ccfbb8.tar.xz
spack-3d3761f8f0962c1b489dafda5d836954f1ccfbb8.zip
add version 4.0.4 to r-bit (#20818)
-rw-r--r--var/spack/repos/builtin/packages/r-bit/package.py8
1 files changed, 7 insertions, 1 deletions
diff --git a/var/spack/repos/builtin/packages/r-bit/package.py b/var/spack/repos/builtin/packages/r-bit/package.py
index 2fe5ca543b..572f3b4c0b 100644
--- a/var/spack/repos/builtin/packages/r-bit/package.py
+++ b/var/spack/repos/builtin/packages/r-bit/package.py
@@ -7,12 +7,18 @@ from spack import *
class RBit(RPackage):
- """ A class for vectors of 1-bit booleans."""
+ """Classes and Methods for Fast Memory-Efficient Boolean Selections
+
+ Provided are classes for boolean and skewed boolean vectors, fast boolean
+ methods, fast unique and non-unique integer sorting, fast set operations on
+ sorted and unsorted sets of integers, and foundations for ff (range index,
+ compression, chunked processing)."""
homepage = "https://cloud.r-project.org/package=bit"
url = "https://cloud.r-project.org/src/contrib/bit_1.1-12.tar.gz"
list_url = "https://cloud.r-project.org/src/contrib/Archive/bit"
+ version('4.0.4', sha256='e404841fbe4ebefe4ecd4392effe673a8c9fa05f97952c4ce6e2f6159bd2f168')
version('1.1-14', sha256='5cbaace1fb643a665a6ca69b90f7a6d624270de82420ca7a44f306753fcef254')
version('1.1-12', sha256='ce281c87fb7602bf1a599e72f3e25f9ff7a13e390c124a4506087f69ad79d128')