Permalink
Browse files

ppl: moving to moonbase-other

  • Loading branch information...
Ratler committed Jan 1, 2013
1 parent b70b292 commit fe63a516011ffd28a7dc2c527623894c9fa08773
Showing with 0 additions and 36 deletions.
  1. +0 −9 devel/ppl/BUILD
  2. +0 −1 devel/ppl/DEPENDS
  3. +0 −26 devel/ppl/DETAILS
View
@@ -1,9 +0,0 @@
-(
-
- export CCACHE_DISABLE=1 &&
-
- OPTS+=" --disable-static" &&
-
- default_build
-
-) > $C_FIFO 2>&1
View
@@ -1 +0,0 @@
-depends gmp
View
@@ -1,26 +0,0 @@
- MODULE=ppl
- VERSION=0.11.2
- SOURCE=$MODULE-$VERSION.tar.bz2
- SOURCE_URL[0]=ftp://ftp.cs.unipr.it/pub/ppl/releases/$VERSION
- SOURCE_URL[1]=http://www.cs.unipr.it/ppl/Download/ftp/releases/$VERSION
- SOURCE_VFY=sha1:915f1d8a7def10e540bf2806babf94dccd15852a
- WEB_SITE=http://www.cs.unipr.it/ppl
- ENTERED=20090426
- UPDATED=20110324
- SHORT="The Parma Polyhedra Library (PPL)"
-
-cat <<EOF
-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. (More details are available on the PPL's
-internal mechanisms.)
-EOF

0 comments on commit fe63a51

Please sign in to comment.