[Python-modules-commits] r29906 - in packages/toposort/tags (3 files)

[dktrkranz at users.alioth.debian.org]

    Date: Friday, July 25, 2014 @ 07:02:11
  Author: dktrkranz
Revision: 29906

[svn-buildpackage] Tagging toposort 1.1-1

Added:
  packages/toposort/tags/1.1-1/
  packages/toposort/tags/1.1-1/debian/control
    (from rev 29904, packages/toposort/trunk/debian/control)
Deleted:
  packages/toposort/tags/1.1-1/debian/control

Deleted: packages/toposort/tags/1.1-1/debian/control
===================================================================
--- packages/toposort/trunk/debian/control	2014-07-25 06:58:34 UTC (rev 29902)
+++ packages/toposort/tags/1.1-1/debian/control	2014-07-25 07:02:11 UTC (rev 29906)
@@ -1,39 +0,0 @@
-Source: toposort
-Section: python
-Priority: optional
-Maintainer: Luca Falavigna <dktrkranz at debian.org>
-Build-Depends: debhelper (>= 9),
-               dh-python,
-               python-all (>= 2.6.6-3~),
-               python-setuptools,
-               python3-all,
-               python3-setuptools
-Homepage: https://bitbucket.org/ericvsmith/toposort
-Standards-Version: 3.9.5
-X-Python-Versions: >= 2.7
-X-Python3-Versions: >= 3.2
-Vcs-Svn: svn://anonscm.debian.org/python-modules/packages/toposort/trunk/
-Vcs-Browser: http://anonscm.debian.org/viewsvn/python-modules/packages/toposort/trunk/
-XS-Testsuite: autopkgtest
-
-Package: python-toposort
-Architecture: all
-Depends: ${python:Depends}, ${misc:Depends}
-Description: topological sort algorithm - Python 2 module
- In computer science, a topological sort (sometimes abbreviated
- topsort or toposort) or topological ordering of a directed graph is a
- linear ordering of its vertices such that for every directed edge uv
- from vertex u to vertex v, u comes before v in the ordering.
- .
- This package provides this algorithm for Python.
-
-Package: python3-toposort
-Architecture: all
-Depends: ${python3:Depends}, ${misc:Depends}
-Description: topological sort algorithm - Python 3 module
- In computer science, a topological sort (sometimes abbreviated
- topsort or toposort) or topological ordering of a directed graph is a
- linear ordering of its vertices such that for every directed edge uv
- from vertex u to vertex v, u comes before v in the ordering.
- .
- This package provides this algorithm for Python 3.

Copied: packages/toposort/tags/1.1-1/debian/control (from rev 29904, packages/toposort/trunk/debian/control)
===================================================================
--- packages/toposort/tags/1.1-1/debian/control	                        (rev 0)
+++ packages/toposort/tags/1.1-1/debian/control	2014-07-25 07:02:11 UTC (rev 29906)
@@ -0,0 +1,40 @@
+Source: toposort
+Section: python
+Priority: optional
+Maintainer: Luca Falavigna <dktrkranz at debian.org>
+Uploaders: Debian Python Modules Team <python-modules-team at lists.alioth.debian.org>
+Build-Depends: debhelper (>= 9),
+               dh-python,
+               python-all (>= 2.6.6-3~),
+               python-setuptools,
+               python3-all,
+               python3-setuptools
+Homepage: https://bitbucket.org/ericvsmith/toposort
+Standards-Version: 3.9.5
+X-Python-Versions: >= 2.7
+X-Python3-Versions: >= 3.2
+Vcs-Svn: svn://anonscm.debian.org/python-modules/packages/toposort/trunk/
+Vcs-Browser: http://anonscm.debian.org/viewsvn/python-modules/packages/toposort/trunk/
+XS-Testsuite: autopkgtest
+
+Package: python-toposort
+Architecture: all
+Depends: ${python:Depends}, ${misc:Depends}
+Description: topological sort algorithm - Python 2 module
+ In computer science, a topological sort (sometimes abbreviated
+ topsort or toposort) or topological ordering of a directed graph is a
+ linear ordering of its vertices such that for every directed edge uv
+ from vertex u to vertex v, u comes before v in the ordering.
+ .
+ This package provides this algorithm for Python.
+
+Package: python3-toposort
+Architecture: all
+Depends: ${python3:Depends}, ${misc:Depends}
+Description: topological sort algorithm - Python 3 module
+ In computer science, a topological sort (sometimes abbreviated
+ topsort or toposort) or topological ordering of a directed graph is a
+ linear ordering of its vertices such that for every directed edge uv
+ from vertex u to vertex v, u comes before v in the ordering.
+ .
+ This package provides this algorithm for Python 3.