| 1 |
commit: b2839c47bc933a0ee3a06b823e27dcc9b9c1c592 |
| 2 |
Author: Sam James <sam <AT> gentoo <DOT> org> |
| 3 |
AuthorDate: Mon Aug 8 04:35:15 2022 +0000 |
| 4 |
Commit: Sam James <sam <AT> gentoo <DOT> org> |
| 5 |
CommitDate: Mon Aug 8 06:08:41 2022 +0000 |
| 6 |
URL: https://gitweb.gentoo.org/repo/gentoo.git/commit/?id=b2839c47 |
| 7 |
|
| 8 |
dev-cpp/muParserX: update maintainers |
| 9 |
|
| 10 |
Signed-off-by: Sam James <sam <AT> gentoo.org> |
| 11 |
|
| 12 |
dev-cpp/muParserX/metadata.xml | 34 +++++++++++++++++++--------------- |
| 13 |
1 file changed, 19 insertions(+), 15 deletions(-) |
| 14 |
|
| 15 |
diff --git a/dev-cpp/muParserX/metadata.xml b/dev-cpp/muParserX/metadata.xml |
| 16 |
index f9242a1fe47a..e7ba537d792e 100644 |
| 17 |
--- a/dev-cpp/muParserX/metadata.xml |
| 18 |
+++ b/dev-cpp/muParserX/metadata.xml |
| 19 |
@@ -1,19 +1,23 @@ |
| 20 |
<?xml version="1.0" encoding="UTF-8"?> |
| 21 |
<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd"> |
| 22 |
<pkgmetadata> |
| 23 |
- <!-- comaintainers-welcomed --> |
| 24 |
- <maintainer type="person" proxied="yes"> |
| 25 |
- <email>gaboroszkar@××××××××××.com</email> |
| 26 |
- <name>Gábor Oszkár Dénes</name> |
| 27 |
- </maintainer> |
| 28 |
- <maintainer type="project" proxied="proxy"> |
| 29 |
- <email>proxy-maint@g.o</email> |
| 30 |
- <name>Proxy Maintainers</name> |
| 31 |
- </maintainer> |
| 32 |
- <longdescription> |
| 33 |
- The evaluation of a mathematical expression is a standard task required in many applications. It can be solved by either using a standard math expression parser such as muparser or by embedding a scripting language such as Lua. There are however some limitations: Although muparser is pretty fast it will only work with scalar values and although Lua is very flexible it does neither support binary operators for arrays nor complex numbers. So if you need a math expression parser with support for arrays, matrices and strings muparserx may be able to help you. |
| 34 |
- </longdescription> |
| 35 |
- <upstream> |
| 36 |
- <remote-id type="github">beltoforion/muparserx</remote-id> |
| 37 |
- </upstream> |
| 38 |
+ <!-- comaintainers-welcomed --> |
| 39 |
+ <maintainer type="person" proxied="yes"> |
| 40 |
+ <email>gaboroszkar@××××××××××.com</email> |
| 41 |
+ <name>Gábor Oszkár Dénes</name> |
| 42 |
+ </maintainer> |
| 43 |
+ <maintainer type="project"> |
| 44 |
+ <email>sci@g.o</email> |
| 45 |
+ <name>Gentoo Science Project</name> |
| 46 |
+ </maintainer> |
| 47 |
+ <maintainer type="project" proxied="proxy"> |
| 48 |
+ <email>proxy-maint@g.o</email> |
| 49 |
+ <name>Proxy Maintainers</name> |
| 50 |
+ </maintainer> |
| 51 |
+ <longdescription> |
| 52 |
+ The evaluation of a mathematical expression is a standard task required in many applications. It can be solved by either using a standard math expression parser such as muparser or by embedding a scripting language such as Lua. There are however some limitations: Although muparser is pretty fast it will only work with scalar values and although Lua is very flexible it does neither support binary operators for arrays nor complex numbers. So if you need a math expression parser with support for arrays, matrices and strings muparserx may be able to help you. |
| 53 |
+ </longdescription> |
| 54 |
+ <upstream> |
| 55 |
+ <remote-id type="github">beltoforion/muparserx</remote-id> |
| 56 |
+ </upstream> |
| 57 |
</pkgmetadata> |
Archives