jcgruenhage/void-packages
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

grep: update to 2.13.

Browse source
This commit is contained in:
Juan RP 2012-07-05 08:51:17 +02:00
parent 441d01f15c
commit 45ea20093e
1 changed files with 5 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
srcpkgs/grep/template
View file

@ -1,19 +1,18 @@
# Template build file for 'grep'. # Template build file for 'grep'.
pkgname=grep pkgname=grep
version=2.12 version=2.13
homepage="http://www.gnu.org/software/grep/" revision=1
distfiles="http://ftp.gnu.org/gnu/grep/$pkgname-$version.tar.xz"
build_style=gnu-configure build_style=gnu-configure
makedepends="pcre-devel" makedepends="pcre-devel"
revision=1
short_desc="The GNU grep utility" short_desc="The GNU grep utility"
maintainer="Juan RP <xtraeme@gmail.com>" maintainer="Juan RP <xtraeme@gmail.com>"
license="GPL-3" license="GPL-3"
checksum=4dce0a4fb83ddd0120df51e00b52fa760f2ed8675d4d4c0b0ae642ba692ead64 homepage="http://www.gnu.org/software/grep/"
distfiles="http://ftp.gnu.org/gnu/grep/$pkgname-$version.tar.xz"
checksum=461718cbd3f471cfd4c167aa7c31be72d9c18760b88186b5e0d1ab8345022dd0
long_desc=" long_desc="
GNU grep is based on a fast lazy-state deterministic matcher (about twice GNU grep is based on a fast lazy-state deterministic matcher (about twice
as fast as stock Unix egrep) hybridized with a Boyer-Moore-Gosper search for as fast as stock Unix egrep) hybridized with a Boyer-Moore-Gosper search for
a fixed string that eliminates impossible text from being considered by the a fixed string that eliminates impossible text from being considered by the
full regexp matcher without necessarily having to look at every character. full regexp matcher without necessarily having to look at every character.
The result is typically many times faster than Unix grep or egrep." The result is typically many times faster than Unix grep or egrep."