lzma 9.22-2.1build1 source package in Ubuntu
Changelog
lzma (9.22-2.1build1) focal; urgency=medium * No-change rebuild for libgcc-s1 package name change. -- Matthias Klose <email address hidden> Sun, 22 Mar 2020 16:48:42 +0100
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Focal
- Original maintainer:
- Mohammed Adnène Trojette
- Architectures:
- any all
- Section:
- utils
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Focal | release | universe | utils |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
lzma_9.22.orig.tar.gz | 627.3 KiB | 0fa2ec459701e403b72662cf920d252466910161fa2077dd0f6d7c078002da19 |
lzma_9.22-2.1build1.debian.tar.xz | 15.5 KiB | b7ab6c3ada3d6d63bc59bf6a3124c1973c774a840b45a79440a7023ed600da13 |
lzma_9.22-2.1build1.dsc | 2.0 KiB | 65b8302860f96f0a997ff6ec7dd2a69aab26899ec097b7b1ee6819553f0424e6 |
Available diffs
- diff from 9.22-2.1 (in Debian) to 9.22-2.1build1 (313 bytes)
Binary packages built by this source
- lzma: No summary available for lzma in ubuntu hirsute.
No description available for lzma in ubuntu hirsute.
- lzma-alone: No summary available for lzma-alone in ubuntu hirsute.
No description available for lzma-alone in ubuntu hirsute.
- lzma-alone-dbgsym: debug symbols for lzma-alone
- lzma-dbgsym: No summary available for lzma-dbgsym in ubuntu groovy.
No description available for lzma-dbgsym in ubuntu groovy.
- lzma-dev: Compression and decompression in the LZMA format - development files
The Lempel-Ziv-Markov chain Algorithm is a compression method based on
the famous LZ77 algorithm, and was first introduced by 7-Zip for use in
7z archives.
.
Its main characteristics are a very high compression ratio, with high RAM
usage, and fast decompression, with low RAM usage. These properties make
it well suited to embedded uses, such as for ROM (firmware) compression.
.
This package contains the headers and libraries of lzma. It is
experimental and will be replaced by the library as soon as it is
available.