New package: chroot-bzip2-1.0.6.
This commit is contained in:
parent
672efb428e
commit
ea9947be5a
2 changed files with 42 additions and 0 deletions
1
srcpkgs/chroot-bzip2/chroot-bzip2.rshlibs
Normal file
1
srcpkgs/chroot-bzip2/chroot-bzip2.rshlibs
Normal file
|
@ -0,0 +1 @@
|
|||
libc.so.6
|
41
srcpkgs/chroot-bzip2/template
Normal file
41
srcpkgs/chroot-bzip2/template
Normal file
|
@ -0,0 +1,41 @@
|
|||
# Template build file for 'chroot-bzip2'.
|
||||
pkgname=chroot-bzip2
|
||||
version=1.0.6
|
||||
wrksrc="bzip2-${version}"
|
||||
homepage="http://www.bzip.org"
|
||||
distfiles="http://www.bzip.org/$version/bzip2-$version.tar.gz"
|
||||
short_desc="The bzip2 compression library"
|
||||
license="BSD"
|
||||
maintainer="Juan RP <xtraeme@gmail.com>"
|
||||
checksum=a2848f34fcd5d6cf47def00461fcb528a0484d8edef8208d6d2e2909dc61d9cd
|
||||
long_desc="
|
||||
bzip2 is a freely available, patent free, high-quality data compressor.
|
||||
It typically compresses files to within 10%% to 15%% of the best available
|
||||
techniques, whilst being around twice as fast at compression and six times
|
||||
faster at decompression.
|
||||
|
||||
bzip2 compresses files using the Burrows-Wheeler block-sorting text
|
||||
compression algorithm, and Huffman coding. Compression is generally
|
||||
considerably better than that achieved by more conventional LZ77/LZ78-based
|
||||
compressors, and approaches the performance of the PPM family of statistical
|
||||
compressors.
|
||||
|
||||
The archive file format of bzip2 (.bz2) is incompatible with that of its
|
||||
predecessor, bzip (.bz).
|
||||
|
||||
This package is only meant to be used by xbps-src, don't install it manually."
|
||||
|
||||
bootstrap=yes
|
||||
conflicts="bzip2>=0"
|
||||
|
||||
do_build() {
|
||||
# use our optimization
|
||||
sed -i "s|-O2|${CFLAGS}|g" Makefile
|
||||
make ${makejobs}
|
||||
}
|
||||
|
||||
do_install() {
|
||||
vinstall bzip2 755 usr/bin bzip2
|
||||
ln -sf bzip2 ${DESTDIR}/usr/bin/bunzip2
|
||||
ln -sf bzip2 ${DESTDIR}/usr/bin/bzcat
|
||||
}
|
Loading…
Reference in a new issue