Skip to content

Commit a56d066

Browse files
committed
New version 2.1.2 linted
1 parent 5bb6bd6 commit a56d066

3 files changed

Lines changed: 4 additions & 4 deletions

File tree

CHANGELOG.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ All notable changes to this project are documented in this file.
55
The format follows [Keep a Changelog](https://keepachangelog.com/en/1.1.0/),
66
and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
77

8-
## [2.1.1] — 2026-04-20
8+
## [2.1.2] — 2026-04-20
99

1010
### Changed
1111
- `grouped(size)` now partitions the ring into `ceil(n / size)` non-overlapping

pyproject.toml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
[project]
22
name = "ring-seq-py"
3-
version = "2.1.1"
3+
version = "2.1.2"
44
authors = [
55
{ name="Mario Càllisto", email="mario.callisto@gmail.com" },
66
]

src/ring_seq/ring_seq.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -558,9 +558,9 @@ def min_rotational_hamming_distance(self, that: Iterable[T]) -> int:
558558
a = self._seq
559559
best = n
560560
for k in range(n):
561-
count = sum(1 for x, y in zip(a[k:], other) if x != y)
561+
count = sum(1 for x, y in zip(a[k:], other, strict=False) if x != y)
562562
if k:
563-
count += sum(1 for x, y in zip(a[:k], other[n - k:]) if x != y)
563+
count += sum(1 for x, y in zip(a[:k], other[n - k :], strict=True) if x != y)
564564
if count < best:
565565
best = count
566566
if best == 0:

0 commit comments

Comments
 (0)