pd-code-pre-nxt 0.1.0__tar.gz → 0.1.1__tar.gz

pd_code_pre_nxt-0.1.1/PKG-INFO

@@ -0,0 +1,64 @@
+Metadata-Version: 2.4
+Name: pd-code-pre-nxt
+Version: 0.1.1
+Summary: get `pre` and `next` node for every number in 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-sanity (>=0.1.0)
+Description-Content-Type: text/markdown
+
+# pd-code-pre-nxt
+
+Build deterministic predecessor and successor maps for every PD-code arc label.
+
+## Installation
+
+```bash
+pip install pd-code-pre-nxt
+```
+
+## Usage example
+
+```python
+from pd_code_pre_nxt import get_pre_nxt
+
+pd = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+pre, nxt = get_pre_nxt(pd)
+print(nxt[1], pre[1])
+```
+
+## Algorithm
+
+Opposite crossing slots define the component graph. Each component must be a two-regular cycle, with a special deterministic treatment for two-label cycles. The smallest label is chosen as the cycle start; both traversal directions are compared lexicographically and the canonical one defines `pre` and `nxt`. Numeric suffixes are supported for temporary prefixed labels used during connected sums.
+
+## 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_pre_nxt-0.1.1/README.md

@@ -0,0 +1,44 @@
+# pd-code-pre-nxt
+
+Build deterministic predecessor and successor maps for every PD-code arc label.
+
+## Installation
+
+```bash
+pip install pd-code-pre-nxt
+```
+
+## Usage example
+
+```python
+from pd_code_pre_nxt import get_pre_nxt
+
+pd = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+pre, nxt = get_pre_nxt(pd)
+print(nxt[1], pre[1])
+```
+
+## Algorithm
+
+Opposite crossing slots define the component graph. Each component must be a two-regular cycle, with a special deterministic treatment for two-label cycles. The smallest label is chosen as the cycle start; both traversal directions are compared lexicographically and the canonical one defines `pre` and `nxt`. Numeric suffixes are supported for temporary prefixed labels used during connected sums.
+
+## 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_pre_nxt-0.1.0 → pd_code_pre_nxt-0.1.1}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "pd-code-pre-nxt"
-version = "0.1.0"
+version = "0.1.1"
 description = "get `pre` and `next` node for every number in pd_code."
 authors = [
     {name = "GGN_2015",email = "neko@jlulug.org"}

pd_code_pre_nxt-0.1.0/PKG-INFO

@@ -1,43 +0,0 @@
-Metadata-Version: 2.4
-Name: pd-code-pre-nxt
-Version: 0.1.0
-Summary: get `pre` and `next` node for every number in 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-sanity (>=0.1.0)
-Description-Content-Type: text/markdown
-
-# pd-code-pre-nxt
-
-Build deterministic predecessor and successor maps from PD-code topology.
-
-## Installation
-
-```bash
-pip install pd-code-pre-nxt
-```
-
-## Quick start
-
-`from pd_code_pre_nxt import get_pre_nxt`.
-
-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_pre_nxt-0.1.0/README.md

@@ -1,23 +0,0 @@
-# pd-code-pre-nxt
-
-Build deterministic predecessor and successor maps from PD-code topology.
-
-## Installation
-
-```bash
-pip install pd-code-pre-nxt
-```
-
-## Quick start
-
-`from pd_code_pre_nxt import get_pre_nxt`.
-
-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`.