Skip to content

Commit

Permalink
Release 0.12.1 (#81)
Browse files Browse the repository at this point in the history
* chore: bump version refs to `0.12.1

* refactor: simplify logic for the n > 2` branch in `sequences.KSRMTree.search`
  • Loading branch information
sr-murthy authored May 14, 2024
1 parent bdc32cf commit eb9031d
Show file tree
Hide file tree
Showing 4 changed files with 4 additions and 8 deletions.
2 changes: 1 addition & 1 deletion CITATION.cff
Original file line number Diff line number Diff line change
Expand Up @@ -24,6 +24,6 @@ keywords:
- real numbers

license: MPL-2.0
version: 0.12.0
version: 0.12.1
date-released: 2024-05-14

2 changes: 1 addition & 1 deletion docs/sources/contributing.rst
Original file line number Diff line number Diff line change
Expand Up @@ -139,7 +139,7 @@ The CI/CD pipelines are defined in the `CI YML <.github/workflows/ci.yml>`_, and
Versioning and Releases
=======================

The `PyPI package <https://pypi.org/project/continuedfractions/>`_ is currently at version ``0.12.0`` - the goal is to use `semantic versioning <https://semver.org/>`_ consistently for all future releases, but some earlier releases do not comply with strict semantic versioning.
The `PyPI package <https://pypi.org/project/continuedfractions/>`_ is currently at version ``0.12.1`` - the goal is to use `semantic versioning <https://semver.org/>`_ consistently for all future releases, but some earlier releases do not comply with strict semantic versioning.

There is currently no dedicated pipeline for releases - both `GitHub releases <https://github.com/sr-murthy/continuedfractions/releases>`_ and `PyPI packages <https://pypi.org/project/continuedfractions>`_ are published manually, but both have the same version tag.

Expand Down
6 changes: 1 addition & 5 deletions src/continuedfractions/sequences.py
Original file line number Diff line number Diff line change
Expand Up @@ -809,12 +809,8 @@ def search(self, n: int, /) -> Generator[KSRMNode, None, None]:
elif n > 1:
yield from self.search_root(n - 1, self.roots[0])

if n > 2 and n % 2 == 0:
yield from self.search_root(n - 1, self.roots[1])
elif n > 2 and n % 2 == 1:
yield from self.search_root(n - 1, self.roots[1])

if n > 2:
yield from self.search_root(n - 1, self.roots[1])
yield from tuple(product([n], coprime_integers(n)))


Expand Down
2 changes: 1 addition & 1 deletion src/continuedfractions/version.py
Original file line number Diff line number Diff line change
@@ -1 +1 @@
__version__ = "0.12.0"
__version__ = "0.12.1"

0 comments on commit eb9031d

Please sign in to comment.