Delete app.py

app.py

@@ -1,157 +0,0 @@
-import json, os, re, gradio as gr
-
-# ================= 配置 =================
-PROJECT_NAME = "家族亲戚关系网查询系统"
-DATA_FILE = "family_data.jsonl"
-PHOTO_ROOT = "photos"
-ARCHIVE_ROOT = "archives"
-
-CUSTOM_CSS = """
-footer {display: none !important;}
-.gradio-container {max-width: 100% !important; background: #fdf5e6;}
-#title-md { text-align: center; color: #8b0000; font-family: "Microsoft YaHei", sans-serif; }
-.output-box { border: 2px solid #8b0000 !important; border-radius: 8px !important; }
-"""
-
-def load_db():
-    db = {}
-    if not os.path.exists(DATA_FILE): return db
-    with open(DATA_FILE, "r", encoding="utf-8") as f:
-        for line in f:
-            try:
-                item = json.loads(line.strip())
-                if "n" in item: db[item["n"].strip()] = item
-            except: continue
-    return db
-
-# ================= 称谓推演引擎 =================
-
-def get_relation_label(a, b, db):
-    """判断 A 是 B 的什么（单步关系）"""
-    rec_b = db.get(b, {})
-    if rec_b.get("f") == a: return "父亲"
-    if rec_b.get("m") == a: return "母亲"
-    if a in rec_b.get("sp", []): return "配偶"
-    # 反向找子女
-    rec_a = db.get(a, {})
-    if rec_a.get("f") == b or rec_a.get("m") == b: return "子女"
-    return "关联"
-
-def fmt_n(name, db):
-    if name not in db: return name
-    info = db[name].get("info", "")
-    alive = " (已故)" if re.search(r'\d{4}.*卒|\d{4}-\d{4}', str(info)) else ""
-    return f"{name}{alive} [{info}]"
-
-# ================= 核心功能函数 =================
-
-def ui_infer(name, mode):
-    db = load_db(); name = name.strip()
-    if name not in db: return "❌ 找不到起点"
-    res = f"🔍 【{name}】的{mode}推演：\n" + "="*30 + "\n"
-    
-    # 1. 晚辈递归（子孙满堂）
-    if mode == "晚辈":
-        def get_desc(root, d):
-            kids = [n for n, dat in db.items() if dat.get("f")==root or dat.get("m")==root]
-            out = ""
-            for k in sorted(kids, key=lambda x: str(db[x].get("info"))):
-                prefix = "  " * d + ("┗━ " if d>0 else "")
-                label = {1:"子/女", 2:"孙", 3:"曾孙", 4:"玄孙"}.get(d, "后代")
-                out += f"{prefix}第{d}代({label}): {fmt_n(k, db)}\n"
-                out += get_desc(k, d+1)
-            return out
-        return res + (get_desc(name, 1) or "暂无记录")
-
-    # 2. 堂表亲精细推演
-    me = db.get(name)
-    f, m = me.get("f"), me.get("m")
-    
-    if mode == "堂兄妹":
-        if not f or f not in db: return res + "父亲记录缺失"
-        f_sibs = [n for n, d in db.items() if (d.get("f")==db[f].get("f") or d.get("m")==db[f].get("m")) and n!=f and d.get("s")=="男"]
-        content = ""
-        for fs in f_sibs:
-            kids = [n for n, d in db.items() if d.get("f")==fs or d.get("m")==fs]
-            for k in kids: content += f" - {fmt_n(k, db)} (伯叔{fs}之子)\n"
-        return res + (content or "未找到堂亲")
-
-    if mode == "表兄妹":
-        # 父亲的姐妹的孩子 + 母亲的兄弟姐妹的孩子
-        content = ""
-        # 姑表
-        if f and f in db:
-            f_sibs_f = [n for n, d in db.items() if (d.get("f")==db[f].get("f") or d.get("m")==db[f].get("m")) and n!=f and d.get("s")=="女"]
-            for fs in f_sibs_f:
-                kids = [n for n, d in db.items() if d.get("f")==fs or d.get("m")==fs]
-                for k in kids: content += f" - {fmt_n(k, db)} (姑母{fs}之子)\n"
-        # 舅表/姨表
-        if m and m in db:
-            m_sibs = [n for n, d in db.items() if (d.get("f")==db[m].get("f") or d.get("m")==db[m].get("m")) and n!=m]
-            for ms in m_sibs:
-                kids = [n for n, d in db.items() if d.get("f")==ms or d.get("m")==ms]
-                for k in kids: content += f" - {fmt_n(k, db)} ({'舅' if db[ms].get('s')=='男' else '姨'}{ms}之子)\n"
-        return res + (content or "未找到表亲")
-
-    return res + "逻辑开发中..."
-
-def ui_rel_query(name1, name2):
-    db = load_db()
-    n1, n2 = name1.strip(), name2.strip()
-    if n1 not in db or n2 not in db: return "❌ 姓名不全"
-    
-    # 广度优先搜寻路径
-    queue = [(n1, [])]
-    visited = {n1}
-    while queue:
-        curr, path = queue.pop(0)
-        if curr == n2:
-            # 构建带称谓的链条
-            full_path = ""
-            for i in range(len(path)):
-                prev = n1 if i==0 else path[i-1]
-                rel = get_relation_label(prev, path[i], db)
-                full_path += f"{prev} → ({rel}) → "
-            full_path += n2
-            return f"🏁 找到关系链：\n{full_path}\n\n💡 提示：该链条基于血缘与配偶逻辑自动推演。"
-
-        # 寻找邻居：父、母、配、子
-        rec = db[curr]
-        nb = []
-        if rec.get("f"): nb.append(rec["f"])
-        if rec.get("m"): nb.append(rec["m"])
-        for s in rec.get("sp", []): nb.append(s)
-        children = [n for n, d in db.items() if d.get("f")==curr or d.get("m")==curr]
-        nb += children
-
-        for n in nb:
-            if n and n not in visited and n in db:
-                visited.add(n)
-                queue.append((n, path + [n]))
-    return "未找到直接或间接关联。"
-
-# ================= 界面构建 =================
-with gr.Blocks(title=PROJECT_NAME, css=CUSTOM_CSS) as demo:
-    gr.Markdown(f"### 🏮 {PROJECT_NAME}", elem_id="title-md")
-    
-    with gr.Row():
-        curr_n = gr.Textbox(label="操作人姓名", value="冯宗德", scale=2)
-        
-    with gr.Tabs():
-        with gr.Tab("🧬 族网推演"):
-            with gr.Row():
-                mode = gr.Radio(["亲兄妹", "堂兄妹", "表兄妹", "前辈", "晚辈"], label="选择维度", value="晚辈")
-                run_btn = gr.Button("开始推演", variant="primary")
-            out_infer = gr.Textbox(label="推演结论 (自动递归深度后代)", lines=15, elem_classes="output-box")
-            run_btn.click(ui_infer, [curr_n, mode], out_infer)
-
-        with gr.Tab("🔍 关系查询"):
-            with gr.Row():
-                tar1 = gr.Textbox(label="起点 (如:冯宗德)")
-                tar2 = gr.Textbox(label="终点 (如:某某某)")
-            q_btn = gr.Button("分析亲属链条", variant="primary")
-            out_q = gr.Textbox(label="分析结论", lines=8, elem_classes="output-box")
-            q_btn.click(ui_rel_query, [tar1, tar2], out_q)
-
-if __name__ == "__main__":
-    demo.launch()