
Security News
Deno 2.4 Brings Back deno bundle, Improves Dependency Management and Observability
Deno 2.4 brings back bundling, improves dependency updates and telemetry, and makes the runtime more practical for real-world JavaScript projects.
|repostatus| |ci-status| |coverage| |pyversions| |license|
.. |repostatus| image:: https://www.repostatus.org/badges/latest/active.svg :target: https://www.repostatus.org/#active :alt: Project Status: Active — The project has reached a stable, usable state and is being actively developed.
.. |ci-status| image:: https://github.com/jwodder/permutation/actions/workflows/test.yml/badge.svg :target: https://github.com/jwodder/permutation/actions/workflows/test.yml :alt: CI Status
.. |coverage| image:: https://codecov.io/gh/jwodder/permutation/branch/master/graph/badge.svg :target: https://codecov.io/gh/jwodder/permutation
.. |pyversions| image:: https://img.shields.io/pypi/pyversions/permutation.svg :target: https://pypi.org/project/permutation
.. |license| image:: https://img.shields.io/github/license/jwodder/permutation.svg :target: https://opensource.org/licenses/MIT :alt: MIT License
GitHub <https://github.com/jwodder/permutation>
_
| PyPI <https://pypi.org/project/permutation>
_
| Documentation <https://permutation.readthedocs.io>
_
| Issues <https://github.com/jwodder/permutation/issues>
_
| Changelog <https://github.com/jwodder/permutation/blob/master/CHANGELOG.md>
_
permutation
provides a Permutation
class for representing permutations <https://en.wikipedia.org/wiki/Permutation>
_ of finitely many positive
integers in Python. Supported operations & properties include inverses, (group
theoretic) order, parity, composition/multiplication, cycle decomposition,
cycle notation, word representation, Lehmer codes, and, of course, use as a
callable on integers.
permutation
requires Python 3.8 or higher. Just use pip <https://pip.pypa.io>
_ for Python 3 (You have pip, right?) to install::
python3 -m pip install permutation
from permutation import Permutation p = Permutation(2, 1, 4, 5, 3) p(1) 2 p(3) 4 p(42) 42 p.to_cycles() [(1, 2), (3, 4, 5)] print(p) (1 2)(3 4 5) print(p.inverse()) (1 2)(3 5 4) p.degree 5 p.order 6 p.is_even False p.lehmer(5) 27 q = Permutation.cycle(1,2,3) print(p * q) (2 4 5 3) print(q * p) (1 3 4 5) for p in Permutation.group(3): ... print(p) ... 1 (1 2) (2 3) (1 3 2) (1 2 3) (1 3)
FAQs
Permutations of finitely many positive integers
We found that permutation demonstrated a healthy version release cadence and project activity because the last version was released less than a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Deno 2.4 brings back bundling, improves dependency updates and telemetry, and makes the runtime more practical for real-world JavaScript projects.
Security News
CVEForecast.org uses machine learning to project a record-breaking surge in vulnerability disclosures in 2025.
Security News
Browserslist-rs now uses static data to reduce binary size by over 1MB, improving memory use and performance for Rust-based frontend tools.