aboutsummaryrefslogtreecommitdiff
path: root/dev-ml
diff options
context:
space:
mode:
authorS├ębastien Fabbro <bicatali@gentoo.org>2013-06-18 10:11:54 -0700
committerS├ębastien Fabbro <bicatali@gentoo.org>2013-06-18 10:11:54 -0700
commit94a47aba8632bc468ef26c88c57fd81b63e5f609 (patch)
treecb6e17ab4b71db646a9aa1fc5dcef391a4b63a9b /dev-ml
parentsci-physics/openmx upgraded to 3.7.3 with some openMP and MPI C/F90 juggling,... (diff)
downloadsci-94a47aba8632bc468ef26c88c57fd81b63e5f609.tar.gz
sci-94a47aba8632bc468ef26c88c57fd81b63e5f609.tar.bz2
sci-94a47aba8632bc468ef26c88c57fd81b63e5f609.zip
big fixes of metadata and package sub-herd re-distribution
Diffstat (limited to 'dev-ml')
-rw-r--r--dev-ml/mlgmpidl/metadata.xml23
-rw-r--r--dev-ml/ocamlgraph/metadata.xml47
-rw-r--r--dev-ml/zarith/metadata.xml20
3 files changed, 36 insertions, 54 deletions
diff --git a/dev-ml/mlgmpidl/metadata.xml b/dev-ml/mlgmpidl/metadata.xml
index c6107f8e5..a3fac8132 100644
--- a/dev-ml/mlgmpidl/metadata.xml
+++ b/dev-ml/mlgmpidl/metadata.xml
@@ -1,17 +1,14 @@
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
- <herd>sci</herd>
- <longdescription>
- MLGMPIDL is a package offering an interface to the GMP and MPFR
- libraries for OCaml version 3.07 or higher. The interface offers access
- to almost all the functions of the library, and is decomposed into 7
- submodules.
- </longdescription>
- <maintainer>
- <email>sci@gentoo.org</email>
- </maintainer>
- <use>
- <flag name="mpfr">add support for mpfr, the library for multiple-precision floating-point computations with exact rounding</flag>
- </use>
+<herd>sci-mathematics</herd>
+<longdescription>
+ MLGMPIDL is a package offering an interface to the GMP and MPFR
+ libraries for OCaml version 3.07 or higher. The interface offers access
+ to almost all the functions of the library, and is decomposed into 7
+ submodules.
+</longdescription>
+<use>
+ <flag name="mpfr">Add support for <pkg>dev-libs/mpfr</pkg></flag>
+</use>
</pkgmetadata>
diff --git a/dev-ml/ocamlgraph/metadata.xml b/dev-ml/ocamlgraph/metadata.xml
index 763c1cd36..87fc10d58 100644
--- a/dev-ml/ocamlgraph/metadata.xml
+++ b/dev-ml/ocamlgraph/metadata.xml
@@ -1,32 +1,23 @@
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
- <herd>sci</herd>
- <longdescription>
- It provides an easy-to-use graph data structure together with several
- operations and algorithms over graphs, in Graph.Pack. It is a reasonably
- efficient imperative data structure for directed graphs with vertices
- and edges labeled with integers. Several other graph implementations
- are proposed for those not satisfied with the one above. Some are
- persistent (imutable) and other imperative (mutable). Some are directed
- and other are not. Some have labels for vertices, or labels for edges,
- or both. Some have abstract types for vertices. etc. These
- implementations are written as functors: you give the types of vertices
- labels, edge labels, etc. and you get the data structure as a result.
- it also provides several classic operations and algorithms over graphs.
- They are also written as functors i.e. independently of the data
- structure for graphs. One consequence is that you can define your own
- data structure for graphs and yet re-use all the algorithms from this
- library: you only need to provide a few operations such as iterating
- over all vertices, over the successors of a vertex, etc.
- </longdescription>
- <maintainer>
- <email>sci@gentoo.org</email>
- </maintainer>
- <use>
- <flag name="doc">?doc?</flag>
- <flag name="examples">?examples?</flag>
- <flag name="gtk">?gtk?</flag>
- <flag name="ocamlopt">?ocamlopt?</flag>
- </use>
+<herd>sci-mathematics</herd>
+<longdescription>
+ It provides an easy-to-use graph data structure together with several
+ operations and algorithms over graphs, in Graph.Pack. It is a reasonably
+ efficient imperative data structure for directed graphs with vertices
+ and edges labeled with integers. Several other graph implementations
+ are proposed for those not satisfied with the one above. Some are
+ persistent (imutable) and other imperative (mutable). Some are directed
+ and other are not. Some have labels for vertices, or labels for edges,
+ or both. Some have abstract types for vertices. etc. These
+ implementations are written as functors: you give the types of vertices
+ labels, edge labels, etc. and you get the data structure as a result.
+ it also provides several classic operations and algorithms over graphs.
+ They are also written as functors i.e. independently of the data
+ structure for graphs. One consequence is that you can define your own
+ data structure for graphs and yet re-use all the algorithms from this
+ library: you only need to provide a few operations such as iterating
+ over all vertices, over the successors of a vertex, etc.
+</longdescription>
</pkgmetadata>
diff --git a/dev-ml/zarith/metadata.xml b/dev-ml/zarith/metadata.xml
index e75004328..1ff321877 100644
--- a/dev-ml/zarith/metadata.xml
+++ b/dev-ml/zarith/metadata.xml
@@ -1,17 +1,11 @@
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
- <herd>sci</herd>
- <longdescription>
- The Zarith library implements arithmetic and logical operations over
- arbitrary-precision integers. It uses GMP to efficiently implement
- arithmetic over big integers. Small integers are represented as Caml
- unboxed integers, for speed and space economy.
- </longdescription>
- <maintainer>
- <email>sci@gentoo.org</email>
- </maintainer>
- <use>
- <flag name="ocamlopt">?ocamlopt?</flag>
- </use>
+<herd>sci-mathematics</herd>
+<longdescription>
+ The Zarith library implements arithmetic and logical operations over
+ arbitrary-precision integers. It uses GMP to efficiently implement
+ arithmetic over big integers. Small integers are represented as Caml
+ unboxed integers, for speed and space economy.
+</longdescription>
</pkgmetadata>