pd-code-reverse-component 0.1.0__tar.gz → 0.1.1__tar.gz

pd_code_reverse_component-0.1.1/PKG-INFO

@@ -0,0 +1,65 @@
+Metadata-Version: 2.4
+Name: pd-code-reverse-component
+Version: 0.1.1
+Summary: reverse all arc number in one certain component for a 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-reverse-component
+
+Reverse the orientation encoding of one selected PD-code component.
+
+## Installation
+
+```bash
+pip install pd-code-reverse-component
+```
+
+## Usage example
+
+```python
+from pd_code_reverse_component import reverse_component
+
+pd = [[2, 3, 1, 4], [4, 1, 3, 2]]
+reversed_pd = reverse_component(pd, 1)
+print(reversed_pd)
+```
+
+## Algorithm
+
+The selected label identifies its component cycle through predecessor/successor maps. The cycle is placed in canonical order and mapped to its reverse order. Every occurrence of a component label is replaced through that bijection; labels belonging to other components remain unchanged. The operation returns a deep copy and leaves the input untouched.
+
+## 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_reverse_component-0.1.1/README.md

@@ -0,0 +1,44 @@
+# pd-code-reverse-component
+
+Reverse the orientation encoding of one selected PD-code component.
+
+## Installation
+
+```bash
+pip install pd-code-reverse-component
+```
+
+## Usage example
+
+```python
+from pd_code_reverse_component import reverse_component
+
+pd = [[2, 3, 1, 4], [4, 1, 3, 2]]
+reversed_pd = reverse_component(pd, 1)
+print(reversed_pd)
+```
+
+## Algorithm
+
+The selected label identifies its component cycle through predecessor/successor maps. The cycle is placed in canonical order and mapped to its reverse order. Every occurrence of a component label is replaced through that bijection; labels belonging to other components remain unchanged. The operation returns a deep copy and leaves the input untouched.
+
+## 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_reverse_component-0.1.0 → pd_code_reverse_component-0.1.1}/pd_code_reverse_component/main.py

@@ -1,62 +1,62 @@
-import pd_code_sanity
-import pd_code_pre_nxt
-import json
-
-# 沿着 nxt 边走出一个 loop
-def get_loop(nxt:dict, begin_val) -> list:
-    loop = [begin_val]
-    while True:
-        loop.append(nxt[loop[-1]])
-        if loop[-1] == loop[0]: # 如果第一个元素已经重复出现
-            loop.pop()
-            break
-    return loop
-
-# 翻转 val 所在的连通分支的所有编号
-def reverse_component(pd_code:list[list], val):
-
-    # 先备份
-    pd_code = json.loads(json.dumps(pd_code))
-
-    # 必须是合法 pd_code
-    if not pd_code_sanity.sanity(pd_code):
-        raise TypeError()
-    
-    # 没有出现过这个值，因此不能翻转
-    if val not in set([
-        term
-        for crossing in pd_code
-        for term in crossing
-    ]):
-        return pd_code
-    
-    # 计算前驱后继
-    pre, nxt = pd_code_pre_nxt.get_pre_nxt(pd_code)
-
-    # 先找到当前循环的最小元素
-    min_val = min(get_loop(nxt, val))
-    loop = get_loop(nxt, min_val) # 这样可以得到递增序列
-    rev_loop = loop[::-1]         # 翻转的 list
-
-    # 把出现过的值映射成大小相反的值
-    num_map = {
-        loop[i]: rev_loop[i]
-        for i in range(len(loop))
-    }
-
-    # 编写针对一个对象的映射函数
-    def map_one_data(term):
-        if num_map.get(term) is None:
-            return term
-        else:
-            return num_map[term]
-
-    # 重新编码
-    return [
-        [map_one_data(term) for term in crossing]
-        for crossing in pd_code
-    ]
-
-if __name__ == "__main__":
-    pd_code = [[8,11,9,12],[12,9,13,10],[10,13,11,14],[7,14,8,1],[4,1,5,2],[2,5,3,6],[6,3,7,4]]
-    print(reverse_component(pd_code, 1))
+import pd_code_sanity
+import pd_code_pre_nxt
+import json
+
+# 沿着 nxt 边走出一个 loop
+def get_loop(nxt:dict, begin_val) -> list:
+    loop = [begin_val]
+    while True:
+        loop.append(nxt[loop[-1]])
+        if loop[-1] == loop[0]: # 如果第一个元素已经重复出现
+            loop.pop()
+            break
+    return loop
+
+# 翻转 val 所在的连通分支的所有编号
+def reverse_component(pd_code:list[list], val):
+
+    # 先备份
+    pd_code = json.loads(json.dumps(pd_code))
+
+    # 必须是合法 pd_code
+    if not pd_code_sanity.sanity(pd_code):
+        raise TypeError()
+    
+    # 没有出现过这个值，因此不能翻转
+    if val not in set([
+        term
+        for crossing in pd_code
+        for term in crossing
+    ]):
+        return pd_code
+    
+    # 计算前驱后继
+    pre, nxt = pd_code_pre_nxt.get_pre_nxt(pd_code)
+
+    # 先找到当前循环的最小元素
+    min_val = min(get_loop(nxt, val))
+    loop = get_loop(nxt, min_val) # 这样可以得到递增序列
+    rev_loop = loop[::-1]         # 翻转的 list
+
+    # 把出现过的值映射成大小相反的值
+    num_map = {
+        loop[i]: rev_loop[i]
+        for i in range(len(loop))
+    }
+
+    # 编写针对一个对象的映射函数
+    def map_one_data(term):
+        if num_map.get(term) is None:
+            return term
+        else:
+            return num_map[term]
+
+    # 重新编码
+    return [
+        [map_one_data(term) for term in crossing]
+        for crossing in pd_code
+    ]
+
+if __name__ == "__main__":
+    pd_code = [[8,11,9,12],[12,9,13,10],[10,13,11,14],[7,14,8,1],[4,1,5,2],[2,5,3,6],[6,3,7,4]]
+    print(reverse_component(pd_code, 1))

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

@@ -1,19 +1,19 @@
-[project]
-name = "pd-code-reverse-component"
-version = "0.1.0"
-description = "reverse all arc number in one certain component for a link pd_code."
-authors = [
-    {name = "GGN_2015",email = "neko@jlulug.org"}
-]
-license = {text = "MIT"}
-readme = "README.md"
-requires-python = ">=3.10"
-dependencies = [
+[project]
+name = "pd-code-reverse-component"
+version = "0.1.1"
+description = "reverse all arc number in one certain component for a link pd_code."
+authors = [
+    {name = "GGN_2015",email = "neko@jlulug.org"}
+]
+license = {text = "MIT"}
+readme = "README.md"
+requires-python = ">=3.10"
+dependencies = [
     "pd-code-sanity>=0.1.0",
     "pd-code-pre-nxt>=0.1.0"
-]
-
-
-[build-system]
-requires = ["poetry-core>=2.0.0,<3.0.0"]
-build-backend = "poetry.core.masonry.api"
+]
+
+
+[build-system]
+requires = ["poetry-core>=2.0.0,<3.0.0"]
+build-backend = "poetry.core.masonry.api"

pd_code_reverse_component-0.1.0/PKG-INFO

@@ -1,44 +0,0 @@
-Metadata-Version: 2.4
-Name: pd-code-reverse-component
-Version: 0.1.0
-Summary: reverse all arc number in one certain component for a 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-reverse-component
-
-Reverse the orientation of one component of a PD code.
-
-## Installation
-
-```bash
-pip install pd-code-reverse-component
-```
-
-## Quick start
-
-`from pd_code_reverse_component import reverse_component`.
-
-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_reverse_component-0.1.0/README.md

@@ -1,23 +0,0 @@
-# pd-code-reverse-component
-
-Reverse the orientation of one component of a PD code.
-
-## Installation
-
-```bash
-pip install pd-code-reverse-component
-```
-
-## Quick start
-
-`from pd_code_reverse_component import reverse_component`.
-
-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`.