fix broken matching_blocks conversion

rapidfuzz · Jul 23, 2022 · aa4711f · aa4711f
1 parent d252234
commit aa4711f
Show file tree

Hide file tree

Showing 4 changed files with 9 additions and 5 deletions.
diff --git a/HISTORY.md b/HISTORY.md
@@ -1,5 +1,9 @@
 ## Changelog
 
+### v0.20.1
+#### Fixed
+- fix broken matching_blocks conversion
+
 ### v0.20.0
 #### Changed
 - use `matching_blocks`/`apply`/`remove_subsequence`/`inverse` implementation from RapidFuzz

diff --git a/docs/conf.py b/docs/conf.py
@@ -22,7 +22,7 @@
 author = 'Max Bachmann'
 
 # The full version, including alpha/beta/rc tags
-release = '0.20.0'
+release = '0.20.1'
 
 # -- General configuration ---------------------------------------------------
 

diff --git a/setup.py b/setup.py
@@ -5,7 +5,7 @@
 
 setup(
     name="Levenshtein",
-    version="0.20.0",
+    version="0.20.1",
     url="https://github.com/maxbachmann/Levenshtein",
     author="Max Bachmann",
     install_requires=["rapidfuzz >= 2.3.0, < 3.0.0"],

diff --git a/src/Levenshtein/__init__.py b/src/Levenshtein/__init__.py
@@ -16,7 +16,7 @@
 
 __author__: str = "Max Bachmann"
 __license__: str = "GPL"
-__version__: str = "0.20.0"
+__version__: str = "0.20.1"
 
 from rapidfuzz.distance.Levenshtein import distance
 from rapidfuzz.distance.Indel import normalized_similarity as ratio
@@ -161,9 +161,9 @@ def matching_blocks(edit_operations, source_string, destination_string):
     len2 = destination_string if isinstance(destination_string, int) else len(destination_string)
 
     if len(edit_operations[0]) == 3:
-        return _Editops(edit_operations, len1, len2).as_matching_blocks().as_list()
+        return _Editops(edit_operations, len1, len2).as_matching_blocks()
 
-    return _Opcodes(edit_operations, len1, len2).as_matching_blocks().as_list()
+    return _Opcodes(edit_operations, len1, len2).as_matching_blocks()
 
 
 def apply_edit(edit_operations, source_string, destination_string):