2009-11-14 18:33:43 +01:00
|
|
|
# Template file for 'ppl'
|
|
|
|
|
pkgname=ppl
|
2012-07-01 15:55:22 +02:00
|
|
|
version=1.0
|
|
|
|
|
revision=1
|
|
|
|
|
subpackages="ppl-devel"
|
2011-10-24 14:14:47 +02:00
|
|
|
build_style=gnu-configure
|
2012-07-01 15:55:22 +02:00
|
|
|
configure_args="--enable-interfaces=c,cxx"
|
2012-05-23 18:26:56 +02:00
|
|
|
makedepends="gmp-devel"
|
2009-11-14 18:33:43 +01:00
|
|
|
short_desc="The Parma Polyhedra Library"
|
2012-07-01 15:55:22 +02:00
|
|
|
homepage="http://bugseng.com/products/ppl"
|
|
|
|
|
license="GPL-3"
|
2009-11-14 18:33:43 +01:00
|
|
|
maintainer="Juan RP <xtraeme@gmail.com>"
|
2012-07-01 15:55:22 +02:00
|
|
|
distfiles="http://bugseng.com/products/ppl/download/ftp/releases/${version}/ppl-${version}.tar.gz"
|
|
|
|
|
checksum=fd346687482ad51c1e98eb260bd61dd5a35a0cff5f580404380c88b0089a71b4
|
2009-11-14 18:33:43 +01:00
|
|
|
long_desc="
|
|
|
|
|
The Parma Polyhedra Library (PPL) provides numerical abstractions especially
|
|
|
|
|
targeted at applications in the field of analysis and verification of complex
|
|
|
|
|
systems. These abstractions include convex polyhedra, defined as the
|
|
|
|
|
intersection of a finite number of (open or closed) halfspaces, each
|
|
|
|
|
described by a linear inequality (strict or non-strict) with rational
|
|
|
|
|
coefficients; some special classes of polyhedra shapes that offer interesting
|
|
|
|
|
complexity/precision tradeoffs; and grids which represent regularly spaced
|
|
|
|
|
points that satisfy a set of linear congruence relations. The library also
|
|
|
|
|
supports finite powersets and products of (any kind of) polyhedra and grids
|
|
|
|
|
and a mixed integer linear programming problem solver using an
|
|
|
|
|
exact-arithmetic version of the simplex algorithm."
|
|
|
|
|
|
2012-02-10 15:55:08 +01:00
|
|
|
post_install() {
|
|
|
|
|
rm -rf ${DESTDIR}/usr/share/doc
|
|
|
|
|
}
|
