Script 'mail_helper' called by obssrc
Hello community,

here is the log from the commit of package python-patiencediff for 
openSUSE:Factory checked in at 2022-10-14 15:41:22
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/python-patiencediff (Old)
 and      /work/SRC/openSUSE:Factory/.python-patiencediff.new.2275 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "python-patiencediff"

Fri Oct 14 15:41:22 2022 rev:4 rq:1010371 version:0.2.3

Changes:
--------
--- /work/SRC/openSUSE:Factory/python-patiencediff/python-patiencediff.changes  
2022-07-19 17:18:57.060333775 +0200
+++ 
/work/SRC/openSUSE:Factory/.python-patiencediff.new.2275/python-patiencediff.changes
        2022-10-14 15:42:05.415873411 +0200
@@ -1,0 +2,6 @@
+Wed Oct 12 13:57:47 UTC 2022 - Yogalakshmi Arunachalam <[email protected]>
+
+- Update to version 0.2.3 
+  * No Upstream changelog 
+
+-------------------------------------------------------------------

Old:
----
  patiencediff-0.2.2.tar.gz

New:
----
  patiencediff-0.2.3.tar.gz

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Other differences:
------------------
++++++ python-patiencediff.spec ++++++
--- /var/tmp/diff_new_pack.PNReor/_old  2022-10-14 15:42:05.863874158 +0200
+++ /var/tmp/diff_new_pack.PNReor/_new  2022-10-14 15:42:05.867874165 +0200
@@ -18,7 +18,7 @@
 
 %{?!python_module:%define python_module() python-%{**} python3-%{**}}
 Name:           python-patiencediff
-Version:        0.2.2
+Version:        0.2.3
 Release:        0
 Summary:        Python implementation of the patiencediff algorithm
 License:        GPL-2.0-or-later

++++++ patiencediff-0.2.2.tar.gz -> patiencediff-0.2.3.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' 
old/patiencediff-0.2.2/.github/workflows/pythonpackage.yml 
new/patiencediff-0.2.3/.github/workflows/pythonpackage.yml
--- old/patiencediff-0.2.2/.github/workflows/pythonpackage.yml  2021-03-26 
01:19:51.000000000 +0100
+++ new/patiencediff-0.2.3/.github/workflows/pythonpackage.yml  2022-09-07 
15:35:45.000000000 +0200
@@ -9,7 +9,7 @@
     strategy:
       matrix:
         os: [ubuntu-latest, macos-latest, windows-latest]
-        python-version: [2.7, 3.5, 3.6, 3.7, 3.8, pypy3]
+        python-version: [3.6, 3.7, 3.8, 3.9, '3.10']
       fail-fast: false
 
     steps:
@@ -20,18 +20,15 @@
         python-version: ${{ matrix.python-version }}
     - name: Install dependencies
       run: |
-        python -m pip install --upgrade pip
+        python -m pip install --upgrade pip mypy
         pip install -U pip flake8 setuptools
     - name: Style checks
-      run: |
-        python -m flake8
+      run: python -m flake8
+    - name: Typing checks
+      run: python -m mypy patiencediff
     - name: Build
-      run: |
-        python setup.py build_ext -i
-      # Building C extensions doesn't work for Python 2.7 on Windows.
-      if: "!(matrix.os == 'windows-latest' && matrix.python-version == '2.7')"
+      run: python setup.py build_ext -i
     - name: Test suite run
-      run: |
-        python -m unittest patiencediff.test_patiencediff
+      run: python -m unittest patiencediff.test_patiencediff
       env:
         PYTHONHASHSEED: random
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' 
old/patiencediff-0.2.2/.github/workflows/pythonpublish.yml 
new/patiencediff-0.2.3/.github/workflows/pythonpublish.yml
--- old/patiencediff-0.2.2/.github/workflows/pythonpublish.yml  2021-03-26 
01:19:51.000000000 +0100
+++ new/patiencediff-0.2.3/.github/workflows/pythonpublish.yml  2022-09-07 
15:35:45.000000000 +0200
@@ -12,14 +12,11 @@
     strategy:
       matrix:
         os: [macos-latest, windows-latest]
-        python-version: ['3.5', '3.6', '3.7', '3.8']
+        python-version: ['3.6', '3.7', '3.8', '3.9', '3.10']
         include:
           - os: ubuntu-latest
             python-version: '3.x'
           # path encoding
-        exclude:
-          - os: windows-latest
-            python-version: 3.5
       fail-fast: false
 
     steps:
@@ -45,7 +42,7 @@
     - name: Build and publish (Linux aarch64)
       uses: RalfG/[email protected]_aarch64
       with:
-        python-versions: 'cp36-cp36m cp37-cp37m cp38-cp38 cp39-cp39'
+        python-versions: 'cp36-cp36m cp37-cp37m cp38-cp38 cp39-cp39 
cp310-cp310'
     - name: Build and publish (Linux)
       uses: RalfG/[email protected]
       if: "matrix.os == 'ubuntu-latest'"
@@ -56,7 +53,7 @@
       run: |
         # Only include *manylinux* wheels; the other wheels files are built but
         # rejected by pip.
-        twine upload dist/*manylinux*.whl
+        twine upload dist/*-manylinux*.whl
       if: "matrix.os == 'ubuntu-latest'"
     - name: Publish
       env:
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/MANIFEST.in 
new/patiencediff-0.2.3/MANIFEST.in
--- old/patiencediff-0.2.2/MANIFEST.in  2021-03-26 01:19:51.000000000 +0100
+++ new/patiencediff-0.2.3/MANIFEST.in  2022-09-07 15:35:45.000000000 +0200
@@ -1,2 +1,3 @@
 include AUTHORS
 include README.rst
+include COPYING
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/PKG-INFO 
new/patiencediff-0.2.3/PKG-INFO
--- old/patiencediff-0.2.2/PKG-INFO     2021-03-26 01:19:55.503055000 +0100
+++ new/patiencediff-0.2.3/PKG-INFO     2022-09-07 15:35:48.101333600 +0200
@@ -1,60 +1,67 @@
-Metadata-Version: 1.2
+Metadata-Version: 2.1
 Name: patiencediff
-Version: 0.2.2
-Summary: Python implementation of the patiencediff algorithm.
-Home-page: https://www.breezy-vcs.org/
+Version: 0.2.3
+Summary: Python implementation of the patiencediff algorithm
+Home-page: UNKNOWN
 Maintainer: Breezy Developers
 Maintainer-email: [email protected]
 License: GNU GPLv2 or later
-Description: This package contains the implementation of the ``patiencediff`` 
algorithm, as
-        `first described <https://bramcohen.livejournal.com/73318.html>`_ by 
Bram Cohen.
-        
-        Like Python's ``difflib``, this module provides both a convenience 
``unified_diff``
-        function for the generation of unified diffs of text files
-        as well as a SequenceMatcher that can be used on arbitrary lists.
-        
-        Patiencediff provides a good balance of performance, nice output for 
humans,
-        and implementation simplicity.
-        
-        The code in this package was extracted from the `Bazaar 
<https://www.bazaar-vcs.org/>`_
-        code base.
-        
-        The package comes with two implementations:
-        
-        * A Python implementation (_patiencediff_py.py); this implementation 
only
-          requires a Python interpreter and is the more readable version of 
the two
-        
-        * A C implementation implementation (_patiencediff_c.c); this 
implementation
-          is faster, but requires a C compiler and is less readable
-        
-        Usage
-        =====
-        
-        To invoke patiencediff from the command-line::
-        
-            python -m patiencediff file_a file_b
-        
-        Or from Python:
-        
-             >>> import patiencediff
-             >>> print ''.join(patiencediff.unified_diff(
-             ...      ['a\n', 'b\n', 'b\n', 'c\n'],
-             ...      ['a\n', 'c\n', 'b\n']))
-             --- 
-             +++ 
-             @@ -1,4 +1,3 @@
-              a
-             +c
-              b
-             -b
-             -c
-        
 Platform: UNKNOWN
-Classifier: Development Status :: 4 - Beta
+Classifier: Development Status :: 6 - Mature
 Classifier: License :: OSI Approved :: GNU General Public License v2 or later 
(GPLv2+)
-Classifier: Programming Language :: Python :: 2.7
-Classifier: Programming Language :: Python :: 3.5
 Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Programming Language :: Python :: Implementation :: PyPy
 Classifier: Operating System :: POSIX
+License-File: COPYING
+License-File: AUTHORS
+
+This package contains the implementation of the ``patiencediff`` algorithm, as
+`first described <https://bramcohen.livejournal.com/73318.html>`_ by Bram 
Cohen.
+
+Like Python's ``difflib``, this module provides both a convenience 
``unified_diff``
+function for the generation of unified diffs of text files
+as well as a SequenceMatcher that can be used on arbitrary lists.
+
+Patiencediff provides a good balance of performance, nice output for humans,
+and implementation simplicity.
+
+The code in this package was extracted from the `Bazaar 
<https://www.bazaar-vcs.org/>`_
+code base.
+
+The package comes with two implementations:
+
+* A Python implementation (_patiencediff_py.py); this implementation only
+  requires a Python interpreter and is the more readable version of the two
+
+* A C implementation implementation (_patiencediff_c.c); this implementation
+  is faster, but requires a C compiler and is less readable
+
+Usage
+=====
+
+To invoke patiencediff from the command-line::
+
+    python -m patiencediff file_a file_b
+
+Or from Python:
+
+     >>> import patiencediff
+     >>> print ''.join(patiencediff.unified_diff(
+     ...      ['a\n', 'b\n', 'b\n', 'c\n'],
+     ...      ['a\n', 'c\n', 'b\n']))
+     --- 
+     +++ 
+     @@ -1,4 +1,3 @@
+      a
+     +c
+      b
+     -b
+     -c
+
+
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff/__init__.py 
new/patiencediff-0.2.3/patiencediff/__init__.py
--- old/patiencediff-0.2.2/patiencediff/__init__.py     2021-03-26 
01:19:53.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff/__init__.py     2022-09-07 
15:35:47.000000000 +0200
@@ -14,17 +14,17 @@
 # along with this program; if not, write to the Free Software
 # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 
-from __future__ import absolute_import
-
 import os
 import sys
 import time
 import difflib
 
+from typing import Type
+
 
 __all__ = ['PatienceSequenceMatcher', 'unified_diff', 'unified_diff_files']
 
-__version__ = (0, 2, 2)
+__version__ = (0, 2, 3)
 
 
 # This is a version of unified_diff which only adds a factory parameter
@@ -128,6 +128,9 @@
                         sequencematcher=sequencematcher)
 
 
+PatienceSequenceMatcher: Type[difflib.SequenceMatcher]
+
+
 try:
     from ._patiencediff_c import (
         unique_lcs_c as unique_lcs,
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff/__main__.py 
new/patiencediff-0.2.3/patiencediff/__main__.py
--- old/patiencediff-0.2.2/patiencediff/__main__.py     2021-03-26 
01:19:51.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff/__main__.py     2022-09-07 
15:35:45.000000000 +0200
@@ -14,8 +14,6 @@
 # along with this program; if not, write to the Free Software
 # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 
-from __future__ import absolute_import
-
 import sys
 import difflib
 
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff/_patiencediff_c.pyi 
new/patiencediff-0.2.3/patiencediff/_patiencediff_c.pyi
--- old/patiencediff-0.2.2/patiencediff/_patiencediff_c.pyi     1970-01-01 
01:00:00.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff/_patiencediff_c.pyi     2022-09-07 
15:35:45.000000000 +0200
@@ -0,0 +1,17 @@
+import difflib
+from typing import List, Tuple, Sequence, Any
+
+
+class PatienceSequenceMatcher_c(difflib.SequenceMatcher):
+
+    def get_matching_blocks(self) -> List[difflib.Match]: ...
+
+
+def unique_lcs_c(a: Sequence[Any], b: Sequence[Any]) -> List[Tuple[int, int]]: 
...
+
+
+def recurse_matches_c(
+        a: Sequence[Any], b: Sequence[Any],
+        alo: int, blo: int, ahi: int, bhi: int,
+        answer: List[Tuple[int, int]], maxrecursion: int) -> None: ...
+
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff/_patiencediff_py.py 
new/patiencediff-0.2.3/patiencediff/_patiencediff_py.py
--- old/patiencediff-0.2.2/patiencediff/_patiencediff_py.py     2021-03-26 
01:19:51.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff/_patiencediff_py.py     2022-09-07 
15:35:45.000000000 +0200
@@ -14,7 +14,7 @@
 # along with this program; if not, write to the Free Software
 # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 
-from __future__ import absolute_import
+from typing import List, Tuple, Sequence, Dict, Any, Optional
 
 from bisect import bisect
 import difflib
@@ -26,7 +26,7 @@
         super(MaxRecursionDepth, self).__init__('max recursion depth reached')
 
 
-def unique_lcs_py(a, b):
+def unique_lcs_py(a: Sequence[Any], b: Sequence[Any]) -> List[Tuple[int, int]]:
     """Find the longest common subset for unique lines.
 
     :param a: An indexable object (such as string or list of strings)
@@ -40,9 +40,10 @@
     The longest common subset uses the Patience Sorting algorithm:
     http://en.wikipedia.org/wiki/Patience_sorting
     """
+    line: Any
     # set index[line in a] = position of line in a unless
     # a is a duplicate, in which case it's set to None
-    index = {}
+    index: Dict[Any, Optional[int]] = {}
     for i, line in enumerate(a):
         if line in index:
             index[line] = None
@@ -51,8 +52,8 @@
     # make btoa[i] = position of line i in a, unless
     # that line doesn't occur exactly once in both,
     # in which case it's set to None
-    btoa = [None] * len(b)
-    index2 = {}
+    btoa: List[Optional[int]] = [None] * len(b)
+    index2: Dict[Any, int] = {}
     for pos, line in enumerate(b):
         next = index.get(line)
         if next is not None:
@@ -66,10 +67,10 @@
                 btoa[pos] = next
     # this is the Patience sorting algorithm
     # see http://en.wikipedia.org/wiki/Patience_sorting
-    backpointers = [None] * len(b)
-    stacks = []
-    lasts = []
-    k = 0
+    backpointers: List[Optional[int]] = [None] * len(b)
+    stacks: List[int] = []
+    lasts: List[int] = []
+    k: int = 0
     for bpos, apos in enumerate(btoa):
         if apos is None:
             continue
@@ -95,15 +96,18 @@
     if len(lasts) == 0:
         return []
     result = []
-    k = lasts[-1]
-    while k is not None:
-        result.append((btoa[k], k))
-        k = backpointers[k]
+    m: Optional[int] = lasts[-1]
+    while m is not None:
+        result.append((btoa[m], m))
+        m = backpointers[m]
     result.reverse()
-    return result
+    return result  # type: ignore
 
 
-def recurse_matches_py(a, b, alo, blo, ahi, bhi, answer, maxrecursion):
+def recurse_matches_py(
+        a: Sequence[Any], b: Sequence[Any],
+        alo: int, blo: int, ahi: int, bhi: int,
+        answer: List[Tuple[int, int]], maxrecursion: int) -> None:
     """Find all of the matching text in the lines of a and b.
 
     :param a: A sequence
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff/test_patiencediff.py 
new/patiencediff-0.2.3/patiencediff/test_patiencediff.py
--- old/patiencediff-0.2.2/patiencediff/test_patiencediff.py    2021-03-26 
01:19:51.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff/test_patiencediff.py    2022-09-07 
15:35:45.000000000 +0200
@@ -17,17 +17,12 @@
 import os
 import patiencediff
 import shutil
-import sys
 import tempfile
 import unittest
 
 from . import _patiencediff_py
 
 
-if sys.version_info[0] == 3:
-    unichr = chr
-
-
 class TestPatienceDiffLib(unittest.TestCase):
 
     def setUp(self):
@@ -38,8 +33,8 @@
             _patiencediff_py.PatienceSequenceMatcher_py
 
     def test_diff_unicode_string(self):
-        a = ''.join([unichr(i) for i in range(4000, 4500, 3)])
-        b = ''.join([unichr(i) for i in range(4300, 4800, 2)])
+        a = ''.join([chr(i) for i in range(4000, 4500, 3)])
+        b = ''.join([chr(i) for i in range(4300, 4800, 2)])
         sm = self._PatienceSequenceMatcher(None, a, b)
         mb = sm.get_matching_blocks()
         self.assertEqual(35, len(mb))
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff.egg-info/PKG-INFO 
new/patiencediff-0.2.3/patiencediff.egg-info/PKG-INFO
--- old/patiencediff-0.2.2/patiencediff.egg-info/PKG-INFO       2021-03-26 
01:19:55.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff.egg-info/PKG-INFO       2022-09-07 
15:35:47.000000000 +0200
@@ -1,60 +1,67 @@
-Metadata-Version: 1.2
+Metadata-Version: 2.1
 Name: patiencediff
-Version: 0.2.2
-Summary: Python implementation of the patiencediff algorithm.
-Home-page: https://www.breezy-vcs.org/
+Version: 0.2.3
+Summary: Python implementation of the patiencediff algorithm
+Home-page: UNKNOWN
 Maintainer: Breezy Developers
 Maintainer-email: [email protected]
 License: GNU GPLv2 or later
-Description: This package contains the implementation of the ``patiencediff`` 
algorithm, as
-        `first described <https://bramcohen.livejournal.com/73318.html>`_ by 
Bram Cohen.
-        
-        Like Python's ``difflib``, this module provides both a convenience 
``unified_diff``
-        function for the generation of unified diffs of text files
-        as well as a SequenceMatcher that can be used on arbitrary lists.
-        
-        Patiencediff provides a good balance of performance, nice output for 
humans,
-        and implementation simplicity.
-        
-        The code in this package was extracted from the `Bazaar 
<https://www.bazaar-vcs.org/>`_
-        code base.
-        
-        The package comes with two implementations:
-        
-        * A Python implementation (_patiencediff_py.py); this implementation 
only
-          requires a Python interpreter and is the more readable version of 
the two
-        
-        * A C implementation implementation (_patiencediff_c.c); this 
implementation
-          is faster, but requires a C compiler and is less readable
-        
-        Usage
-        =====
-        
-        To invoke patiencediff from the command-line::
-        
-            python -m patiencediff file_a file_b
-        
-        Or from Python:
-        
-             >>> import patiencediff
-             >>> print ''.join(patiencediff.unified_diff(
-             ...      ['a\n', 'b\n', 'b\n', 'c\n'],
-             ...      ['a\n', 'c\n', 'b\n']))
-             --- 
-             +++ 
-             @@ -1,4 +1,3 @@
-              a
-             +c
-              b
-             -b
-             -c
-        
 Platform: UNKNOWN
-Classifier: Development Status :: 4 - Beta
+Classifier: Development Status :: 6 - Mature
 Classifier: License :: OSI Approved :: GNU General Public License v2 or later 
(GPLv2+)
-Classifier: Programming Language :: Python :: 2.7
-Classifier: Programming Language :: Python :: 3.5
 Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Programming Language :: Python :: Implementation :: PyPy
 Classifier: Operating System :: POSIX
+License-File: COPYING
+License-File: AUTHORS
+
+This package contains the implementation of the ``patiencediff`` algorithm, as
+`first described <https://bramcohen.livejournal.com/73318.html>`_ by Bram 
Cohen.
+
+Like Python's ``difflib``, this module provides both a convenience 
``unified_diff``
+function for the generation of unified diffs of text files
+as well as a SequenceMatcher that can be used on arbitrary lists.
+
+Patiencediff provides a good balance of performance, nice output for humans,
+and implementation simplicity.
+
+The code in this package was extracted from the `Bazaar 
<https://www.bazaar-vcs.org/>`_
+code base.
+
+The package comes with two implementations:
+
+* A Python implementation (_patiencediff_py.py); this implementation only
+  requires a Python interpreter and is the more readable version of the two
+
+* A C implementation implementation (_patiencediff_c.c); this implementation
+  is faster, but requires a C compiler and is less readable
+
+Usage
+=====
+
+To invoke patiencediff from the command-line::
+
+    python -m patiencediff file_a file_b
+
+Or from Python:
+
+     >>> import patiencediff
+     >>> print ''.join(patiencediff.unified_diff(
+     ...      ['a\n', 'b\n', 'b\n', 'c\n'],
+     ...      ['a\n', 'c\n', 'b\n']))
+     --- 
+     +++ 
+     @@ -1,4 +1,3 @@
+      a
+     +c
+      b
+     -b
+     -c
+
+
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/patiencediff.egg-info/SOURCES.txt 
new/patiencediff-0.2.3/patiencediff.egg-info/SOURCES.txt
--- old/patiencediff-0.2.2/patiencediff.egg-info/SOURCES.txt    2021-03-26 
01:19:55.000000000 +0100
+++ new/patiencediff-0.2.3/patiencediff.egg-info/SOURCES.txt    2022-09-07 
15:35:48.000000000 +0200
@@ -6,13 +6,16 @@
 README.rst
 build.cmd
 releaser.conf
+setup.cfg
 setup.py
 .github/workflows/pythonpackage.yml
 .github/workflows/pythonpublish.yml
 patiencediff/__init__.py
 patiencediff/__main__.py
 patiencediff/_patiencediff_c.c
+patiencediff/_patiencediff_c.pyi
 patiencediff/_patiencediff_py.py
+patiencediff/py.typed
 patiencediff/test_patiencediff.py
 patiencediff.egg-info/PKG-INFO
 patiencediff.egg-info/SOURCES.txt
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/releaser.conf 
new/patiencediff-0.2.3/releaser.conf
--- old/patiencediff-0.2.2/releaser.conf        2021-03-26 01:19:51.000000000 
+0100
+++ new/patiencediff-0.2.3/releaser.conf        2022-09-07 15:35:45.000000000 
+0200
@@ -1,13 +1,9 @@
 name: "patiencediff"
 timeout_days: 5
 tag_name: "v$VERSION"
+github_url: "https://github.com/breezy-team/patiencediff";
 verify_command: "python3 setup.py test"
 update_version {
-  path: "setup.py"
-  match: "^      version=\"(.*)\","
-  new_line: "      version=\"$VERSION\","
-}
-update_version {
   path: "patiencediff/__init__.py"
   match: "^__version__ = \((.*)\)$"
   new_line: "__version__ = $TUPLED_VERSION"
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/setup.cfg 
new/patiencediff-0.2.3/setup.cfg
--- old/patiencediff-0.2.2/setup.cfg    2021-03-26 01:19:55.503055000 +0100
+++ new/patiencediff-0.2.3/setup.cfg    2022-09-07 15:35:48.105333600 +0200
@@ -1,3 +1,24 @@
+[metadata]
+description = Python implementation of the patiencediff algorithm
+long-description = file:README.rst
+maintainer = Breezy Developers
+maintainer-email = [email protected]
+license = GNU GPLv2 or later
+homepage = https://www.breezy-vcs.org/
+version = attr:patiencediff.__version__
+classifiers = 
+       Development Status :: 6 - Mature
+       License :: OSI Approved :: GNU General Public License v2 or later 
(GPLv2+)
+       Programming Language :: Python :: 3.6
+       Programming Language :: Python :: 3.7
+       Programming Language :: Python :: 3.8
+       Programming Language :: Python :: 3.9
+       Programming Language :: Python :: 3.10
+       Programming Language :: Python :: 3.11
+       Programming Language :: Python :: Implementation :: CPython
+       Programming Language :: Python :: Implementation :: PyPy
+       Operating System :: POSIX
+
 [egg_info]
 tag_build = 
 tag_date = 0
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/patiencediff-0.2.2/setup.py 
new/patiencediff-0.2.3/setup.py
--- old/patiencediff-0.2.2/setup.py     2021-03-26 01:19:53.000000000 +0100
+++ new/patiencediff-0.2.3/setup.py     2022-09-07 15:35:45.000000000 +0200
@@ -4,9 +4,6 @@
 from setuptools import setup, Extension
 from distutils import core
 
-with open('README.rst', 'r') as f:
-    long_description = f.read()
-
 ext_modules = [
     Extension(
         'patiencediff._patiencediff_c',
@@ -30,25 +27,7 @@
 
 
 setup(name="patiencediff",
-      description="Python implementation of the patiencediff algorithm.",
-      long_description=long_description,
-      version="0.2.2",
-      maintainer="Breezy Developers",
-      maintainer_email="[email protected]",
-      license="GNU GPLv2 or later",
-      url="https://www.breezy-vcs.org/";,
       packages=['patiencediff'],
       test_suite='patiencediff.test_patiencediff',
       distclass=Distribution,
-      classifiers=[
-          'Development Status :: 4 - Beta',
-          'License :: OSI Approved :: '
-          'GNU General Public License v2 or later (GPLv2+)',
-          'Programming Language :: Python :: 2.7',
-          'Programming Language :: Python :: 3.5',
-          'Programming Language :: Python :: 3.6',
-          'Programming Language :: Python :: Implementation :: CPython',
-          'Programming Language :: Python :: Implementation :: PyPy',
-          'Operating System :: POSIX',
-      ],
       ext_modules=ext_modules)

Reply via email to