| 1 |
commit: 0302bfc9017653c5e69e067e0d54507f6a46c5ab |
| 2 |
Author: David Seifert <soap <AT> gentoo <DOT> org> |
| 3 |
AuthorDate: Mon Jan 24 09:32:16 2022 +0000 |
| 4 |
Commit: David Seifert <soap <AT> gentoo <DOT> org> |
| 5 |
CommitDate: Mon Jan 24 09:32:16 2022 +0000 |
| 6 |
URL: https://gitweb.gentoo.org/repo/gentoo.git/commit/?id=0302bfc9 |
| 7 |
|
| 8 |
sci-mathematics/minisat: reformat metadata.xml |
| 9 |
|
| 10 |
Signed-off-by: David Seifert <soap <AT> gentoo.org> |
| 11 |
|
| 12 |
sci-mathematics/minisat/metadata.xml | 47 ++++++++++++++++++------------------ |
| 13 |
1 file changed, 23 insertions(+), 24 deletions(-) |
| 14 |
|
| 15 |
diff --git a/sci-mathematics/minisat/metadata.xml b/sci-mathematics/minisat/metadata.xml |
| 16 |
index 812aa0c09202..68f253bc3c2d 100644 |
| 17 |
--- a/sci-mathematics/minisat/metadata.xml |
| 18 |
+++ b/sci-mathematics/minisat/metadata.xml |
| 19 |
@@ -1,28 +1,27 @@ |
| 20 |
<?xml version="1.0" encoding="UTF-8"?> |
| 21 |
<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd"> |
| 22 |
- |
| 23 |
<pkgmetadata> |
| 24 |
- <maintainer type="project"> |
| 25 |
- <email>sci@g.o</email> |
| 26 |
- <name>Gentoo Science Project</name> |
| 27 |
- </maintainer> |
| 28 |
- <longdescription> |
| 29 |
- MiniSat is a minimalistic, open-source SAT solver, developed to help |
| 30 |
- researchers and developers alike to get started on SAT. It is released |
| 31 |
- under the MIT licence, and is currently used in a number of projects. |
| 32 |
- MiniSat is small and well-documented, and possibly also well-designed, |
| 33 |
- making it an ideal starting point for adapting SAT based techniques to |
| 34 |
- domain specific problems. |
| 35 |
- Winning all the industrial categories of the SAT 2005 competition, MiniSat |
| 36 |
- is a good starting point both for future research in SAT, and for |
| 37 |
- applications using SAT. |
| 38 |
- MiniSat supports incremental SAT and has mechanisms for adding non-clausal |
| 39 |
- constraints. By virtue of being easy to modify, it is a good choice for |
| 40 |
- integrating as a backend to another tool, such as a model checker or a more |
| 41 |
- generic constraint solver. |
| 42 |
- </longdescription> |
| 43 |
- <upstream> |
| 44 |
- <remote-id type="github">niklasso/minisat</remote-id> |
| 45 |
- <remote-id type="github">stp/minisat</remote-id> |
| 46 |
- </upstream> |
| 47 |
+ <maintainer type="project"> |
| 48 |
+ <email>sci@g.o</email> |
| 49 |
+ <name>Gentoo Science Project</name> |
| 50 |
+ </maintainer> |
| 51 |
+ <longdescription> |
| 52 |
+ MiniSat is a minimalistic, open-source SAT solver, developed to help |
| 53 |
+ researchers and developers alike to get started on SAT. It is released |
| 54 |
+ under the MIT licence, and is currently used in a number of projects. |
| 55 |
+ MiniSat is small and well-documented, and possibly also well-designed, |
| 56 |
+ making it an ideal starting point for adapting SAT based techniques to |
| 57 |
+ domain specific problems. |
| 58 |
+ Winning all the industrial categories of the SAT 2005 competition, MiniSat |
| 59 |
+ is a good starting point both for future research in SAT, and for |
| 60 |
+ applications using SAT. |
| 61 |
+ MiniSat supports incremental SAT and has mechanisms for adding non-clausal |
| 62 |
+ constraints. By virtue of being easy to modify, it is a good choice for |
| 63 |
+ integrating as a backend to another tool, such as a model checker or a more |
| 64 |
+ generic constraint solver. |
| 65 |
+ </longdescription> |
| 66 |
+ <upstream> |
| 67 |
+ <remote-id type="github">niklasso/minisat</remote-id> |
| 68 |
+ <remote-id type="github">stp/minisat</remote-id> |
| 69 |
+ </upstream> |
| 70 |
</pkgmetadata> |
Archives