pd-code-reverse-component 0.0.1__tar.gz

pd_code_reverse_component-0.0.1/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 TopologicalKnotIndexer
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

pd_code_reverse_component-0.0.1/PKG-INFO

@@ -0,0 +1,38 @@
+Metadata-Version: 2.4
+Name: pd-code-reverse-component
+Version: 0.0.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
+Requires-Dist: pd_code_sanity
+Description-Content-Type: text/markdown
+
+# pd_code_reverse_component
+reverse all arc number in one certain component for a link pd_code.
+
+## Install
+
+```bash
+pip install pd-code-reverse-component
+```
+
+## Usage
+
+```python
+import pd_code_reverse_component
+
+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)) # reverse the component with arc 1
+```
+

pd_code_reverse_component-0.0.1/README.md

@@ -0,0 +1,17 @@
+# pd_code_reverse_component
+reverse all arc number in one certain component for a link pd_code.
+
+## Install
+
+```bash
+pip install pd-code-reverse-component
+```
+
+## Usage
+
+```python
+import pd_code_reverse_component
+
+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)) # reverse the component with arc 1
+```

pd_code_reverse_component-0.0.1/pd_code_reverse_component/main.py

@@ -0,0 +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))

pd_code_reverse_component-0.0.1/pyproject.toml

@@ -0,0 +1,19 @@
+[project]
+name = "pd-code-reverse-component"
+version = "0.0.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",
+    "pd_code_pre_nxt"
+]
+
+
+[build-system]
+requires = ["poetry-core>=2.0.0,<3.0.0"]
+build-backend = "poetry.core.masonry.api"