pd-code-connected-sum 0.1.0__tar.gz → 0.1.1__tar.gz

pd_code_connected_sum-0.1.1/PKG-INFO

@@ -0,0 +1,67 @@
+Metadata-Version: 2.4
+Name: pd-code-connected-sum
+Version: 0.1.1
+Summary: make connected sum for link pd_code
+License: MIT
+License-File: LICENSE
+Author: GGN_2015
+Author-email: neko@jlulug.org
+Requires-Python: >=3.10
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Requires-Dist: pd-code-pre-nxt (>=0.1.0)
+Requires-Dist: pd-code-sanity (>=0.1.0)
+Description-Content-Type: text/markdown
+
+# pd-code-connected-sum
+
+Join two selected oriented PD-code components and canonically renumber the result.
+
+## Installation
+
+```bash
+pip install pd-code-connected-sum
+```
+
+## Usage example
+
+```python
+from pd_code_connected_sum import connected_sum
+
+left = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+right = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+result, label_map = connected_sum(left, right, 1, 1)
+print(result)
+print(label_map["a_1"], label_map["b_1"])
+```
+
+## Algorithm
+
+Each input component is converted to a deterministic oriented cycle. The algorithm locates the incidence immediately after each selected arc, offsets the second code to avoid collisions, cuts those two oriented arcs, and glues the endpoints crosswise. It then canonically orders component cycles, assigns contiguous labels, orients every crossing consistently, and returns maps for all original labels. This avoids the incorrect local crossing replacement used by older releases.
+
+## Input conventions
+
+A PD code is represented as a list of four-entry crossings. Arc labels normally occur exactly twice. Public functions validate inputs and return new values rather than mutating caller-owned data unless their API explicitly says otherwise.
+
+## External software
+
+No external software is required.
+
+## Development
+
+Run examples and package checks before release. Python packages require Python 3.10 or newer. Build PyPI artifacts with:
+
+```bash
+poetry check
+poetry build
+```
+
+## License
+
+MIT. See `LICENSE`.
+

pd_code_connected_sum-0.1.1/README.md

@@ -0,0 +1,46 @@
+# pd-code-connected-sum
+
+Join two selected oriented PD-code components and canonically renumber the result.
+
+## Installation
+
+```bash
+pip install pd-code-connected-sum
+```
+
+## Usage example
+
+```python
+from pd_code_connected_sum import connected_sum
+
+left = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+right = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+result, label_map = connected_sum(left, right, 1, 1)
+print(result)
+print(label_map["a_1"], label_map["b_1"])
+```
+
+## Algorithm
+
+Each input component is converted to a deterministic oriented cycle. The algorithm locates the incidence immediately after each selected arc, offsets the second code to avoid collisions, cuts those two oriented arcs, and glues the endpoints crosswise. It then canonically orders component cycles, assigns contiguous labels, orients every crossing consistently, and returns maps for all original labels. This avoids the incorrect local crossing replacement used by older releases.
+
+## Input conventions
+
+A PD code is represented as a list of four-entry crossings. Arc labels normally occur exactly twice. Public functions validate inputs and return new values rather than mutating caller-owned data unless their API explicitly says otherwise.
+
+## External software
+
+No external software is required.
+
+## Development
+
+Run examples and package checks before release. Python packages require Python 3.10 or newer. Build PyPI artifacts with:
+
+```bash
+poetry check
+poetry build
+```
+
+## License
+
+MIT. See `LICENSE`.

{pd_code_connected_sum-0.1.0 → pd_code_connected_sum-0.1.1}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "pd-code-connected-sum"
-version = "0.1.0"
+version = "0.1.1"
 description = "make connected sum for link pd_code"
 authors = [
     {name = "GGN_2015",email = "neko@jlulug.org"}

pd_code_connected_sum-0.1.0/PKG-INFO

@@ -1,44 +0,0 @@
-Metadata-Version: 2.4
-Name: pd-code-connected-sum
-Version: 0.1.0
-Summary: make connected sum for link pd_code
-License: MIT
-License-File: LICENSE
-Author: GGN_2015
-Author-email: neko@jlulug.org
-Requires-Python: >=3.10
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.10
-Classifier: Programming Language :: Python :: 3.11
-Classifier: Programming Language :: Python :: 3.12
-Classifier: Programming Language :: Python :: 3.13
-Classifier: Programming Language :: Python :: 3.14
-Requires-Dist: pd-code-pre-nxt (>=0.1.0)
-Requires-Dist: pd-code-sanity (>=0.1.0)
-Description-Content-Type: text/markdown
-
-# pd-code-connected-sum
-
-Join two oriented PD-code components and canonically renumber the result.
-
-## Installation
-
-```bash
-pip install pd-code-connected-sum
-```
-
-## Quick start
-
-`from pd_code_connected_sum import connected_sum` then `connected_sum(a, b, a_label, b_label)`.
-
-PD codes are lists of four-entry crossings. Each arc label must occur exactly twice. Functions validate their inputs and do not mutate caller-owned PD-code lists unless explicitly documented.
-
-## Development
-
-Use Python 3.10 or newer for Python packages. Build distributions with `poetry build`. Run the package's tests or examples before publishing. C++ projects require a modern standards-compliant compiler.
-
-## License
-
-MIT. See `LICENSE`.
-

pd_code_connected_sum-0.1.0/README.md

@@ -1,23 +0,0 @@
-# pd-code-connected-sum
-
-Join two oriented PD-code components and canonically renumber the result.
-
-## Installation
-
-```bash
-pip install pd-code-connected-sum
-```
-
-## Quick start
-
-`from pd_code_connected_sum import connected_sum` then `connected_sum(a, b, a_label, b_label)`.
-
-PD codes are lists of four-entry crossings. Each arc label must occur exactly twice. Functions validate their inputs and do not mutate caller-owned PD-code lists unless explicitly documented.
-
-## Development
-
-Use Python 3.10 or newer for Python packages. Build distributions with `poetry build`. Run the package's tests or examples before publishing. C++ projects require a modern standards-compliant compiler.
-
-## License
-
-MIT. See `LICENSE`.