2012-09-20 13:19:35 +00:00
|
|
|
# Template file for 'libguess'
|
|
|
|
pkgname=libguess
|
|
|
|
version=1.1
|
2013-04-13 08:15:49 +00:00
|
|
|
revision=2
|
2012-09-20 13:19:35 +00:00
|
|
|
build_style=gnu-configure
|
2013-04-13 08:15:49 +00:00
|
|
|
hostmakedepends="pkg-config"
|
|
|
|
makedepends="libmowgli-devel"
|
2012-09-20 13:19:35 +00:00
|
|
|
short_desc="High-speed character set detection library"
|
|
|
|
maintainer="davehome <davehome@redthumb.info.tm>"
|
|
|
|
homepage="http://www.atheme.org/project/libguess"
|
|
|
|
license="custom"
|
|
|
|
distfiles="http://distfiles.atheme.org/${pkgname}-${version}.tar.gz"
|
|
|
|
checksum=e3c9ad3102c9447c591131674135795fb012e073d92e887a2b05c9bbbcbe913f
|
|
|
|
long_desc="
|
|
|
|
High-speed character set detection library.
|
|
|
|
|
|
|
|
libguess employs discrete-finite automata to deduce the character set of the
|
|
|
|
input buffer. The advantage of this is that all character sets can be checked
|
|
|
|
in parallel, and quickly. Right now, libguess passes a byte to each DFA on the
|
|
|
|
same pass, meaning that the winning character set can be deduced as
|
|
|
|
efficiently as possible.
|
|
|
|
|
|
|
|
libguess is fully reentrant, using only local stack memory for DFA operations."
|
|
|
|
|
|
|
|
pre_configure() {
|
|
|
|
sed -i 's/libmowgli >= 0.9.50/libmowgli-2/g' configure
|
|
|
|
}
|
|
|
|
|
|
|
|
post_install() {
|
|
|
|
vinstall COPYING 644 usr/share/licenses/${pkgname}
|
|
|
|
}
|
2013-04-13 08:15:49 +00:00
|
|
|
|
|
|
|
libguess-devel_package() {
|
|
|
|
depends="libmowgli-devel libguess>=${version}"
|
|
|
|
short_desc+=" -- development files"
|
|
|
|
pkg_install() {
|
|
|
|
vmove usr/include
|
|
|
|
vmove usr/lib/pkgconfig
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
libguess_package() {
|
|
|
|
pkg_install() {
|
|
|
|
vmove usr
|
|
|
|
}
|
|
|
|
}
|