@furongjun1999/dsh-memory 0.5.1 → 0.6.1

package/md_cg/bench6_arms.py

@@ -177,7 +177,7 @@ class LingshuAdapter(Adapter):
         """桶健康度自检（routing.bucket_health）：取证条件路由是否有区分力。"""
         from md_cg import routing
         counts = {}
-        for e in self.cg.index["nodes"].values():
+        for e in list(self.cg.index["nodes"].values()):
             b = e.get("bucket") or "<none>"
             counts[b] = counts.get(b, 0) + 1
         return routing.bucket_health(counts)

package/md_cg/bench_p0.py

@@ -86,7 +86,7 @@ def main():
 # 生效条件：给定 q 时遍历 cg.index["nodes"] 逐个读取 ROOT/e["path"]，内容含 q 子串（q 为空串时任何可读内容都命中）即收集其 path，读取抛 OSError 的条目被跳过，返回 hits 列表。
     def brute_force(q):
         hits = []
-        for e in cg.index["nodes"].values():
+        for e in list(cg.index["nodes"].values()):
             try:
                 with open(os.path.join(ROOT, e["path"]), encoding="utf-8") as f:
                     if q in f.read():

package/md_cg/branches.py

@@ -62,7 +62,7 @@ def _audit(cg, op: str, **meta) -> None:
 # 生效条件：调用 _iter_branch_nodes(cg, branch_id) 时，返回 cg.index 的 "nodes" 字典（假值则视为空字典）中所有 v.get("branch_id") 等于 str(branch_id or "").strip().lower() 的 (k, v) 列表。
 def _iter_branch_nodes(cg, branch_id: str):
     bid = str(branch_id or "").strip().lower()
-    return [(k, v) for k, v in (cg.index.get("nodes") or {}).items()
+    return [(k, v) for k, v in list((cg.index.get("nodes") or {}).items())
             if v.get("branch_id") == bid]
 
 
@@ -288,7 +288,7 @@ def discard(cg, branch_id, summary: str) -> dict:
 def list_branches(cg) -> dict:
     """按 branch_id 聚合现存分支（节点清单 + 溯源主支）。"""
     groups = {}
-    for nid, e in (cg.index.get("nodes") or {}).items():
+    for nid, e in list((cg.index.get("nodes") or {}).items()):
         bid = e.get("branch_id")
         if not bid:
             continue