Ubuntu
bitshuffle package

bitshuffle 0.3.5-3build1 source package in Ubuntu

Changelog

bitshuffle (0.3.5-3build1) focal; urgency=medium

  * No-change rebuild to drop python3.7.

 -- Matthias Klose <email address hidden>  Tue, 18 Feb 2020 10:18:47 +0100

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Focal
Original maintainer:
Thorsten Alteholz
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release universe misc

Downloads

File Size SHA-256 Checksum
bitshuffle_0.3.5.orig.tar.gz 109.7 KiB c3f4461d8013e3d9db0d58defec77b143164652de505a1fba3df088eaa19be2f
bitshuffle_0.3.5-3build1.debian.tar.xz 5.0 KiB df436340212fdb0ab7caae19b9b57ef7d4ecdf58573b51d0c831e6126893b09a
bitshuffle_0.3.5-3build1.dsc 2.0 KiB a86fa35fcd6189e696fcdcd8ea90e5ba1462f297df2e670d93c9871169e63f12

View changes file

Binary packages built by this source

bitshuffle: filter for improving compression of typed binary data

 Bitshuffle is an algorithm that rearranges typed, binary data for
 improving compression, as well as a python/C package that implements
 this algorithm within the Numpy framework.
 .
 The library can be used along side HDF5 to compress and decompress
 datasets and is integrated through the dynamically loaded filters
 framework. Bitshuffle is HDF5 filter number 32008.
 .
 Algorithmically, Bitshuffle is closely related to HDF5's Shuffle
 filter except it operates at the bit level instead of the byte level.
 Arranging a typed data array in to a matrix with the elements as the
 rows and the bits within the elements as the columns, Bitshuffle
 "transposes" the matrix, such that all the least-significant-bits
 are in a row, etc. This transpose is performed within blocks of
 data roughly 8kB long.
 .
 This does not in itself compress data, only rearranges it for more
 efficient compression. To perform the actual compression you will
 need a compression library. Bitshuffle has been designed to be well
 matched Marc Lehmann's LZF as well as LZ4. Note that because
 Bitshuffle modifies the data at the bit level, sophisticated entropy
 reducing compression libraries such as GZIP and BZIP are unlikely to
 achieve significantly better compression than simpler and faster
 duplicate-string-elimination algorithms such as LZF and LZ4.
 Bitshuffle thus includes routines (and HDF5 filter options) to apply
 LZ4 compression to each block after shuffling.
 .
 The Bitshuffle algorithm relies on neighbouring elements of a dataset
 being highly correlated to improve data compression. Any correlations
 that span at least 24 elements of the dataset may be exploited to
 improve compression.

bitshuffle-dbgsym: No summary available for bitshuffle-dbgsym in ubuntu groovy.

No description available for bitshuffle-dbgsym in ubuntu groovy.