dycw-utilities 0.125.9__tar.gz → 0.125.10__tar.gz

{dycw_utilities-0.125.9 → dycw_utilities-0.125.10}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: dycw-utilities
-Version: 0.125.9
+Version: 0.125.10
 Author-email: Derek Wan <d.wan@icloud.com>
 License-File: LICENSE
 Requires-Python: >=3.12
@@ -174,7 +174,7 @@ Requires-Dist: scipy<1.16,>=1.15.3; extra == 'zzz-test-scipy'
 Provides-Extra: zzz-test-sentinel
 Provides-Extra: zzz-test-shelve
 Provides-Extra: zzz-test-slack-sdk
-Requires-Dist: aiohttp<3.12.1,>=3.12.0; extra == 'zzz-test-slack-sdk'
+Requires-Dist: aiohttp<3.12.3,>=3.12.2; extra == 'zzz-test-slack-sdk'
 Requires-Dist: slack-sdk<3.36,>=3.35.0; extra == 'zzz-test-slack-sdk'
 Provides-Extra: zzz-test-socket
 Provides-Extra: zzz-test-sqlalchemy

{dycw_utilities-0.125.9 → dycw_utilities-0.125.10}/pyproject.toml

@@ -8,7 +8,7 @@ requires = ["hatchling"]
 # dependency groups
 [dependency-groups]
 dev = [
-  "aiohttp >= 3.12.0, < 3.12.1",  # for slack
+  "aiohttp >= 3.12.2, < 3.12.3",  # for slack
   "aiosqlite >= 0.21.0, < 0.22",
   "altair >= 5.5.0, < 5.6",
   "asyncpg >= 0.30.0, < 0.31",  # for sqlalchemy async
@@ -93,7 +93,7 @@ dependencies = [
 name = "dycw-utilities"
 readme = "README.md"
 requires-python = ">= 3.12"
-version = "0.125.9"
+version = "0.125.10"
 
 [project.optional-dependencies]
 test = [
@@ -270,7 +270,7 @@ zzz-test-scipy = ["scipy >= 1.15.3, < 1.16"]
 zzz-test-sentinel = []
 zzz-test-shelve = []
 zzz-test-slack-sdk = [
-  "aiohttp >= 3.12.0, < 3.12.1",  # for slack
+  "aiohttp >= 3.12.2, < 3.12.3",  # for slack
   "slack-sdk >= 3.35.0, < 3.36",
 ]
 zzz-test-socket = []
@@ -334,7 +334,7 @@ zzz-test-zoneinfo = [
 # bump-my-version
 [tool.bumpversion]
 allow_dirty = true
-current_version = "0.125.9"
+current_version = "0.125.10"
 
 [[tool.bumpversion.files]]
 filename = "src/utilities/__init__.py"

{dycw_utilities-0.125.9 → dycw_utilities-0.125.10}/src/tests/test_iterables.py

@@ -69,6 +69,9 @@ from utilities.iterables import (
     _ApplyBijectionDuplicateValuesError,
     _CheckUniqueModuloCaseDuplicateLowerCaseStringsError,
     _CheckUniqueModuloCaseDuplicateStringsError,
+    _RangePartitionsNumError,
+    _RangePartitionsStopError,
+    _RangePartitionsTotalError,
     _sort_iterable_cmp_datetimes,
     _sort_iterable_cmp_floats,
     always_iterable,
@@ -114,6 +117,7 @@ from utilities.iterables import (
     one_unique,
     pairwise_tail,
     product_dicts,
+    range_partitions,
     reduce_mappings,
     resolve_include_and_exclude,
     sort_iterable,
@@ -1091,6 +1095,66 @@ class TestProductDicts:
         assert result == expected
 
 
+class TestRangePartitions:
+    @given(
+        case=sampled_from([
+            (1, 0, 1, [0]),
+            (2, 0, 1, [0, 1]),
+            (2, 0, 2, [0]),
+            (2, 1, 2, [1]),
+            (3, 0, 1, [0, 1, 2]),
+            (3, 0, 2, [0, 1]),
+            (3, 1, 2, [2]),
+            (3, 0, 3, [0]),
+            (3, 1, 3, [1]),
+            (3, 2, 3, [2]),
+            (6, 0, 1, [0, 1, 2, 3, 4, 5]),
+            (6, 0, 2, [0, 1, 2]),
+            (6, 1, 2, [3, 4, 5]),
+            (6, 0, 3, [0, 1]),
+            (6, 1, 3, [2, 3]),
+            (6, 2, 3, [4, 5]),
+            (7, 0, 2, [0, 1, 2, 3]),
+            (7, 1, 2, [4, 5, 6]),
+            (7, 0, 3, [0, 1, 2]),
+            (7, 1, 3, [3, 4]),
+            (7, 2, 3, [5, 6]),
+        ])
+    )
+    def test_main(self, *, case: tuple[int, int, int, Sequence[int]]) -> None:
+        stop, num, total, expected = case
+        result = list(range_partitions(stop, num, total))
+        assert result == expected
+
+    def test_error_stop(self) -> None:
+        with raises(_RangePartitionsStopError, match="'stop' must be positive; got 0"):
+            _ = range_partitions(0, 0, 0)
+
+    def test_error_total_too_low(self) -> None:
+        with raises(
+            _RangePartitionsTotalError, match=r"'total' must be in \[1, 1\]; got 0"
+        ):
+            _ = range_partitions(1, 0, 0)
+
+    def test_error_total_too_high(self) -> None:
+        with raises(
+            _RangePartitionsTotalError, match=r"'total' must be in \[1, 1\]; got 2"
+        ):
+            _ = range_partitions(1, 0, 2)
+
+    def test_error_num_too_low(self) -> None:
+        with raises(
+            _RangePartitionsNumError, match=r"'num' must be in \[0, 1\]; got -1"
+        ):
+            _ = range_partitions(2, -1, 2)
+
+    def test_error_num_too_high(self) -> None:
+        with raises(
+            _RangePartitionsNumError, match=r"'num' must be in \[0, 1\]; got 2"
+        ):
+            _ = range_partitions(2, 2, 2)
+
+
 class TestReduceMappings:
     @given(
         mappings=lists(dictionaries(text_ascii(), integers())),

{dycw_utilities-0.125.9 → dycw_utilities-0.125.10}/src/utilities/__init__.py

@@ -1,3 +1,3 @@
 from __future__ import annotations
 
-__version__ = "0.125.9"
+__version__ = "0.125.10"

{dycw_utilities-0.125.9 → dycw_utilities-0.125.10}/src/utilities/iterables.py

@@ -1190,6 +1190,56 @@ def product_dicts(mapping: Mapping[_K, Iterable[_V]], /) -> Iterator[Mapping[_K,
 ##
 
 
+def range_partitions(stop: int, num: int, total: int, /) -> range:
+    """Partition a range."""
+    if stop <= 0:
+        raise _RangePartitionsStopError(stop=stop)
+    if not (1 <= total <= stop):
+        raise _RangePartitionsTotalError(stop=stop, total=total)
+    if not (0 <= num < total):
+        raise _RangePartitionsNumError(num=num, total=total)
+    q, r = divmod(stop, total)
+    start = num * q + min(num, r)
+    end = start + q + (1 if num < r else 0)
+    return range(start, end)
+
+
+@dataclass(kw_only=True, slots=True)
+class RangePartitionsError(Exception): ...
+
+
+@dataclass(kw_only=True, slots=True)
+class _RangePartitionsStopError(RangePartitionsError):
+    stop: int
+
+    @override
+    def __str__(self) -> str:
+        return f"'stop' must be positive; got {self.stop}"
+
+
+@dataclass(kw_only=True, slots=True)
+class _RangePartitionsTotalError(RangePartitionsError):
+    stop: int
+    total: int
+
+    @override
+    def __str__(self) -> str:
+        return f"'total' must be in [1, {self.stop}]; got {self.total}"
+
+
+@dataclass(kw_only=True, slots=True)
+class _RangePartitionsNumError(RangePartitionsError):
+    num: int
+    total: int
+
+    @override
+    def __str__(self) -> str:
+        return f"'num' must be in [0, {self.total - 1}]; got {self.num}"
+
+
+##
+
+
 @overload
 def reduce_mappings(
     func: Callable[[_V, _V], _V], sequence: Iterable[Mapping[_K, _V]], /
@@ -1458,6 +1508,7 @@ __all__ = [
     "OneUniqueEmptyError",
     "OneUniqueError",
     "OneUniqueNonUniqueError",
+    "RangePartitionsError",
     "ResolveIncludeAndExcludeError",
     "SortIterableError",
     "always_iterable",
@@ -1502,6 +1553,7 @@ __all__ = [
     "one_unique",
     "pairwise_tail",
     "product_dicts",
+    "range_partitions",
     "reduce_mappings",
     "resolve_include_and_exclude",
     "sort_iterable",