gentoo-mirror/gentoo
1
0
Fork 0
mirror of https://github.com/gentoo-mirror/gentoo.git synced 2026-01-04 01:37:34 -08:00
Code Issues Projects Releases Wiki Activity

dev-python/python-constraint: update maintainers

Browse Source 
Signed-off-by: Sam James <sam@gentoo.org>
This commit is contained in:
Sam James 2022-08-08 05:31:47 +01:00
parent 3d0989df38
commit 23e8b6b161
No known key found for this signature in database
GPG Key ID: 738409F520DF9190
1 changed files with 20 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
dev-python/python-constraint/metadata.xml
View File

@ -1,20 +1,24 @@
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
<!-- comaintainers-welcomed -->
<maintainer type="person" proxied="yes">
<email>gaboroszkar@protonmail.com</email>
<name>Gábor Oszkár Dénes</name>
</maintainer>
<maintainer type="project" proxied="proxy">
<email>proxy-maint@gentoo.org</email>
<name>Proxy Maintainers</name>
</maintainer>
<longdescription>
The Python constraint module offers solvers for Constraint Satisfaction Problems (CSPs) over finite domains in simple and pure Python. CSP is class of problems which may be represented in terms of variables (a, b, ...), domains (a in [1, 2, 3], ...), and constraints (a &lt; b, ...).
</longdescription>
<upstream>
<remote-id type="github">python-constraint/python-constraint</remote-id>
<remote-id type="pypi">python-constraint</remote-id>
</upstream>
<!-- comaintainers-welcomed -->
<maintainer type="person" proxied="yes">
<email>gaboroszkar@protonmail.com</email>
<name>Gábor Oszkár Dénes</name>
</maintainer>
<maintainer type="project">
<email>sci@gentoo.org</email>
<name>Gentoo Science Project</name>
</maintainer>
<maintainer type="project" proxied="proxy">
<email>proxy-maint@gentoo.org</email>
<name>Proxy Maintainers</name>
</maintainer>
<longdescription>
The Python constraint module offers solvers for Constraint Satisfaction Problems (CSPs) over finite domains in simple and pure Python. CSP is class of problems which may be represented in terms of variables (a, b, ...), domains (a in [1, 2, 3], ...), and constraints (a &lt; b, ...).
</longdescription>
<upstream>
<remote-id type="github">python-constraint/python-constraint</remote-id>
<remote-id type="pypi">python-constraint</remote-id>
</upstream>
</pkgmetadata>