pd-code-pre-nxt 0.0.1__tar.gz

pd_code_pre_nxt-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_pre_nxt-0.0.1/PKG-INFO

@@ -0,0 +1,44 @@
+Metadata-Version: 2.4
+Name: pd-code-pre-nxt
+Version: 0.0.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
+Description-Content-Type: text/markdown
+
+# pd_code_pre_nxt
+get `pre` and `next` node for every number in pd_code.
+
+## Install
+
+```bash
+pip install pd-code-pre-nxt
+```
+
+## Usage
+
+```python
+import pd_code_pre_nxt
+
+# link pd_code
+pd_code = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+
+# output number set (ascending order)
+print(pd_code_pre_nxt.get_num_set(pd_code))
+
+# get pre, nxt dict for pd_code
+pre, nxt = pd_code_pre_nxt.get_pre_nxt(pd_code)
+print(pre)
+print(nxt)
+```
+

pd_code_pre_nxt-0.0.1/README.md

@@ -0,0 +1,25 @@
+# pd_code_pre_nxt
+get `pre` and `next` node for every number in pd_code.
+
+## Install
+
+```bash
+pip install pd-code-pre-nxt
+```
+
+## Usage
+
+```python
+import pd_code_pre_nxt
+
+# link pd_code
+pd_code = [[1, 5, 2, 4], [3, 1, 4, 6], [5, 3, 6, 2]]
+
+# output number set (ascending order)
+print(pd_code_pre_nxt.get_num_set(pd_code))
+
+# get pre, nxt dict for pd_code
+pre, nxt = pd_code_pre_nxt.get_pre_nxt(pd_code)
+print(pre)
+print(nxt)
+```

pd_code_pre_nxt-0.0.1/pd_code_pre_nxt/__init__.py

@@ -0,0 +1,6 @@
+from .main import get_pre_nxt, get_num_set
+
+__all__ = [
+    "get_pre_nxt",
+    "get_num_set"
+]

pd_code_pre_nxt-0.0.1/pd_code_pre_nxt/main.py

@@ -0,0 +1,77 @@
+import pd_code_sanity
+
+# 提取原始数值
+# 如果里面有下划线，则去掉下划线转 int
+def get_raw_val(val_in_crs:int|str) -> int:
+    if isinstance(val_in_crs, str):
+        return int(val_in_crs.split("_")[-1])
+    return int(val_in_crs)
+
+def add_edge(pre:dict, nxt:dict, val1, val2):
+    raw_val1 = get_raw_val(val1)
+    raw_val2 = get_raw_val(val2)
+
+    # 记录前后关系
+    pre_val = -1
+    nxt_val = -1
+
+    # 确定前后关系
+    if abs(raw_val1 - raw_val2) == 1:
+        if raw_val1 < raw_val2:
+            pre_val = val1
+            nxt_val = val2
+        else:
+            pre_val = val2
+            nxt_val = val1
+    else:
+        if raw_val1 < raw_val2:
+            pre_val = val2
+            nxt_val = val1
+        else:
+            pre_val = val1
+            nxt_val = val2
+
+    # 设置 dict 值 
+    pre[nxt_val] = pre_val
+    nxt[pre_val] = nxt_val
+
+# 获得 pd_code 中的数值集合
+# 按照字典序从小到大排序
+def get_num_set(pd_code:list[list]):
+    val_set = set()
+    for crossing in pd_code:
+        for term in crossing:
+            if term not in val_set:
+                val_set.add(term)
+    return sorted(list(val_set), key=lambda x:get_raw_val(x))
+
+# 计算 pre 和 nxt
+# 没有 r1 crossing 就不会出现混乱
+def get_pre_nxt(pd_code:list[list]) -> tuple[dict, dict]:
+
+    # 检查类型是否正确
+    if not pd_code_sanity.sanity(pd_code):
+        raise TypeError()
+
+    pre = dict()
+    nxt = dict()
+    for crossing in pd_code:
+        if len(set(crossing)) > 2: # 至少有三个不同的数
+            add_edge(pre, nxt, crossing[0], crossing[2])
+            add_edge(pre, nxt, crossing[1], crossing[3])
+        else:
+            two_values = list(set(crossing)) # 只有两个不同的数
+            if len(two_values) != 2:
+                raise AssertionError()
+            for i in range(2):
+                pre[two_values[i]] = two_values[1-i] # 互为前驱后继
+                nxt[two_values[i]] = two_values[1-i]
+    
+    # 获取数值合集
+    num_set = get_num_set(pd_code)
+    for num in num_set:
+        if pre.get(num) is None:
+            pre[num] = nxt[num]
+        if nxt.get(num) is None:
+            nxt[num] = pre[num]
+    return pre, nxt

pd_code_pre_nxt-0.0.1/pyproject.toml

@@ -0,0 +1,18 @@
+[project]
+name = "pd-code-pre-nxt"
+version = "0.0.1"
+description = "get `pre` and `next` node for every number in pd_code."
+authors = [
+    {name = "GGN_2015",email = "neko@jlulug.org"}
+]
+license = {text = "MIT"}
+readme = "README.md"
+requires-python = ">=3.10"
+dependencies = [
+    
+]
+
+
+[build-system]
+requires = ["poetry-core>=2.0.0,<3.0.0"]
+build-backend = "poetry.core.masonry.api"