k3pattern 0.1.4__tar.gz → 0.1.5__tar.gz

{k3pattern-0.1.4/k3pattern.egg-info → k3pattern-0.1.5}/PKG-INFO

@@ -1,22 +1,21 @@
 Metadata-Version: 2.4
 Name: k3pattern
-Version: 0.1.4
+Version: 0.1.5
 Summary: Find common prefix of strings, tuples, and nested structures
 Author-email: Zhang Yanpo <drdr.xp@gmail.com>
-License: MIT
+License-Expression: MIT
 Project-URL: Homepage, https://github.com/pykit3/k3pattern
 Project-URL: Documentation, https://k3pattern.readthedocs.io
 Keywords: prefix,common-prefix,string,pattern
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Developers
 Classifier: Topic :: Software Development :: Libraries
-Classifier: License :: OSI Approved :: MIT License
 Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
-Requires-Python: >=3.9
+Classifier: Programming Language :: Python :: 3.13
+Requires-Python: >=3.10
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Provides-Extra: dev
@@ -59,14 +58,13 @@ pip install k3pattern
 # Synopsis
 
 ```python
-
 import k3pattern
 
-k3pattern.common_prefix('abc', 'abd')                   # 'ab'
-k3pattern.common_prefix((1, 2, 'abc'), (1, 2, 'abd'))   # (1, 2, 'ab')
-k3pattern.common_prefix((1, 2, 'abc'), (1, 2, 'xyz'))   # (1, 2); empty prefix of 'abc' and 'xyz' is removed
-k3pattern.common_prefix((1, 2, (5, 6)), (1, 2, (5, 7))) # (1, 2, (5,) )
-k3pattern.common_prefix('abc', 'abd', 'abe')            # 'ab'; common prefix of more than two
+k3pattern.common_prefix("abc", "abd")  # 'ab'
+k3pattern.common_prefix((1, 2, "abc"), (1, 2, "abd"))  # (1, 2, 'ab')
+k3pattern.common_prefix((1, 2, "abc"), (1, 2, "xyz"))  # (1, 2); empty prefix of 'abc' and 'xyz' is removed
+k3pattern.common_prefix((1, 2, (5, 6)), (1, 2, (5, 7)))  # (1, 2, (5,) )
+k3pattern.common_prefix("abc", "abd", "abe")  # 'ab'; common prefix of more than two
 ```
 
 #   Author

{k3pattern-0.1.4 → k3pattern-0.1.5}/README.md

@@ -23,14 +23,13 @@ pip install k3pattern
 # Synopsis
 
 ```python
-
 import k3pattern
 
-k3pattern.common_prefix('abc', 'abd')                   # 'ab'
-k3pattern.common_prefix((1, 2, 'abc'), (1, 2, 'abd'))   # (1, 2, 'ab')
-k3pattern.common_prefix((1, 2, 'abc'), (1, 2, 'xyz'))   # (1, 2); empty prefix of 'abc' and 'xyz' is removed
-k3pattern.common_prefix((1, 2, (5, 6)), (1, 2, (5, 7))) # (1, 2, (5,) )
-k3pattern.common_prefix('abc', 'abd', 'abe')            # 'ab'; common prefix of more than two
+k3pattern.common_prefix("abc", "abd")  # 'ab'
+k3pattern.common_prefix((1, 2, "abc"), (1, 2, "abd"))  # (1, 2, 'ab')
+k3pattern.common_prefix((1, 2, "abc"), (1, 2, "xyz"))  # (1, 2); empty prefix of 'abc' and 'xyz' is removed
+k3pattern.common_prefix((1, 2, (5, 6)), (1, 2, (5, 7)))  # (1, 2, (5,) )
+k3pattern.common_prefix("abc", "abd", "abe")  # 'ab'; common prefix of more than two
 ```
 
 #   Author

{k3pattern-0.1.4 → k3pattern-0.1.5}/__init__.py

@@ -11,7 +11,6 @@ from .strutil import (
     common_prefix,
 )
 
-
 __all__ = [
     "common_prefix",
 ]

{k3pattern-0.1.4 → k3pattern-0.1.5/k3pattern.egg-info}/PKG-INFO

@@ -1,22 +1,21 @@
 Metadata-Version: 2.4
 Name: k3pattern
-Version: 0.1.4
+Version: 0.1.5
 Summary: Find common prefix of strings, tuples, and nested structures
 Author-email: Zhang Yanpo <drdr.xp@gmail.com>
-License: MIT
+License-Expression: MIT
 Project-URL: Homepage, https://github.com/pykit3/k3pattern
 Project-URL: Documentation, https://k3pattern.readthedocs.io
 Keywords: prefix,common-prefix,string,pattern
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Developers
 Classifier: Topic :: Software Development :: Libraries
-Classifier: License :: OSI Approved :: MIT License
 Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
-Requires-Python: >=3.9
+Classifier: Programming Language :: Python :: 3.13
+Requires-Python: >=3.10
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Provides-Extra: dev
@@ -59,14 +58,13 @@ pip install k3pattern
 # Synopsis
 
 ```python
-
 import k3pattern
 
-k3pattern.common_prefix('abc', 'abd')                   # 'ab'
-k3pattern.common_prefix((1, 2, 'abc'), (1, 2, 'abd'))   # (1, 2, 'ab')
-k3pattern.common_prefix((1, 2, 'abc'), (1, 2, 'xyz'))   # (1, 2); empty prefix of 'abc' and 'xyz' is removed
-k3pattern.common_prefix((1, 2, (5, 6)), (1, 2, (5, 7))) # (1, 2, (5,) )
-k3pattern.common_prefix('abc', 'abd', 'abe')            # 'ab'; common prefix of more than two
+k3pattern.common_prefix("abc", "abd")  # 'ab'
+k3pattern.common_prefix((1, 2, "abc"), (1, 2, "abd"))  # (1, 2, 'ab')
+k3pattern.common_prefix((1, 2, "abc"), (1, 2, "xyz"))  # (1, 2); empty prefix of 'abc' and 'xyz' is removed
+k3pattern.common_prefix((1, 2, (5, 6)), (1, 2, (5, 7)))  # (1, 2, (5,) )
+k3pattern.common_prefix("abc", "abd", "abe")  # 'ab'; common prefix of more than two
 ```
 
 #   Author

{k3pattern-0.1.4 → k3pattern-0.1.5}/pyproject.toml

@@ -1,14 +1,14 @@
 [build-system]
-requires = ["setuptools>=61.0"]
+requires = ["setuptools>=77.0"]
 build-backend = "setuptools.build_meta"
 
 [project]
 name = "k3pattern"
-version = "0.1.4"
+version = "0.1.5"
 description = "Find common prefix of strings, tuples, and nested structures"
 readme = "README.md"
-license = {text = "MIT"}
-requires-python = ">=3.9"
+license = "MIT"
+requires-python = ">=3.10"
 authors = [
     { name = "Zhang Yanpo", email = "drdr.xp@gmail.com" }
 ]
@@ -17,12 +17,11 @@ classifiers = [
     "Development Status :: 4 - Beta",
     "Intended Audience :: Developers",
     "Topic :: Software Development :: Libraries",
-    "License :: OSI Approved :: MIT License",
     "Programming Language :: Python :: 3",
-    "Programming Language :: Python :: 3.9",
     "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
 ]
 dependencies = []
 

{k3pattern-0.1.4 → k3pattern-0.1.5}/test/test_k3pattern.py

@@ -1,7 +1,9 @@
 import os
+import random
 import unittest
 
 import k3ut
+
 import k3pattern
 
 dd = k3ut.dd
@@ -9,6 +11,25 @@ dd = k3ut.dd
 this_base = os.path.dirname(__file__)
 
 
+def _rand_str(rnd):
+    return "".join(rnd.choice("ab") for _ in range(rnd.randint(0, 3)))
+
+
+def _vary(rnd, base):
+    # Cut the tail or change values, but keep the element type at each position.
+    rst = []
+    for elt in base:
+        if rnd.random() < 0.15:
+            break
+        if rnd.random() < 0.7:
+            rst.append(elt)
+        elif isinstance(elt, str):
+            rst.append(_rand_str(rnd))
+        else:
+            rst.append(_vary(rnd, elt))
+    return tuple(rst)
+
+
 class TestK3pattern(unittest.TestCase):
     def test_common_prefix_invalid_arg(self):
         cases = (
@@ -240,3 +261,55 @@ class TestK3pattern(unittest.TestCase):
             dd("rst: ", rst)
 
             self.assertEqual(expected, rst)
+
+    def test_common_prefix_nested_type_mismatch(self):
+        cases = (
+            (("x", ("a", 1)), ("x", ("a", "b"))),
+            ((1, (2, ("a", 3))), (1, (2, ("a", "b")))),
+            (("x", ("a", [1])), ("x", ("a", (1,)))),
+            ([1, [2, "a"]], [1, [2, 3]]),
+        )
+
+        for a, b in cases:
+            dd("wrong nested type: ", repr(a), " ", repr(b))
+            self.assertRaises(TypeError, k3pattern.common_prefix, a, b)
+
+    def test_common_prefix_random_tuples_of_str(self):
+        # Reference model: the common elements, then the common prefix of the
+        # first differing str elements if it is not empty.
+        rnd = random.Random(0)
+
+        for _ in range(1000):
+            base = tuple(_rand_str(rnd) for _ in range(4))
+            inputs = [_vary(rnd, base) for _ in range(rnd.randint(1, 4))]
+
+            flat = os.path.commonprefix(inputs)
+            k = len(flat)
+            expected = flat
+            if all(k < len(x) for x in inputs):
+                tail = os.path.commonprefix([x[k] for x in inputs])
+                if tail:
+                    expected = flat + (tail,)
+
+            rst = k3pattern.common_prefix(*inputs)
+            self.assertEqual(expected, rst, inputs)
+
+            rst = k3pattern.common_prefix(*inputs, recursive=False)
+            self.assertEqual(flat, rst, inputs)
+
+    def test_common_prefix_random_nested(self):
+        # The result is a common prefix of every input, whatever the input order.
+        rnd = random.Random(0)
+
+        for _ in range(1000):
+            base = tuple(_rand_str(rnd) if rnd.random() < 0.5 else (_rand_str(rnd), _rand_str(rnd)) for _ in range(4))
+            inputs = [_vary(rnd, base) for _ in range(rnd.randint(1, 4))]
+            rst = k3pattern.common_prefix(*inputs)
+
+            rnd.shuffle(inputs)
+            shuffled_rst = k3pattern.common_prefix(*inputs)
+            self.assertEqual(rst, shuffled_rst, inputs)
+
+            for x in inputs:
+                prefix_of_x = k3pattern.common_prefix(rst, x)
+                self.assertEqual(rst, prefix_of_x, (rst, x))