DKChan
5f9d8e7b77
- CLAUDE.md 硬性红线新增「文件头零工作日志」；code-conventions.md 新增 §1.4.1（含反面案例） - 全仓 .gd 文件头注清偿：删除全部带日期条目、批次叙事段与迁移退役叙述，保留并改写为 现在时的职责、接口契约、GDD 锚内容（main.gd 头注 42→31 行、save_manager.gd 49→45 行） - 纯注释改动零行为变更，按用户令免测试免冒烟
144 lines
8.7 KiB
GDScript
144 lines
8.7 KiB
GDScript
# VERTICAL SLICE - NOT FOR PRODUCTION
|
||
# 数据配置 MetaTreeTable schema（设计权威
|
||
# design/gdd/systems/跨局循环/天赋树.md v0.8）。
|
||
# 结构：12 节点 = 脊柱 2（生命淬炼/命中淬炼——一线一节点 cap4：一个内容一个
|
||
# 节点、等级在节点内）+ 锻造脉 2（锻造工坊钥匙 free 无前置 + 彩蛋地脉共鸣——彩蛋含在此 2 内）
|
||
# + 钥石脉 2（秘宝匣/刷新升级）+ 同调脉 6（同调位 1/2/3 + Fork 3 双态节点）。
|
||
# 行字段：node_id / display_name / vein ∈ VEINS（spine=主干脊柱；forge=锻造脉；keystone=钥石脉内容
|
||
# 解锁；attune=同调脉）/ kind ∈ KINDS（stat=数值线/rule=全局规则/unlock=内容解锁/socket=同调位/
|
||
# fork=一节点双态开关/easter=彩蛋觉醒）/ currency ∈ {keystone, free}（树全钥石单币；free=工作间钥匙与彩蛋）/ price [0,9999] / cap [1,9]（等级上限；unlock/socket/fork/
|
||
# easter 恒 1）/ requires Array[node_id]（点亮前置——前置节点 tree_level>=1 即满足）/
|
||
# requires_level Dictionary{node_id: n}（等级阈值前置机制位：前置节点等级 ≥ n 才可购；现役 12 行
|
||
# 零配置=机制位空转零行为影响，配置归表行随需填；键悬空/阈值 <1 加载即拒）/
|
||
# effects Dictionary（stat 线 flat：max_hp/hit；rule 键封闭 RULE_KEYS）。
|
||
# Fork 一节点双态：fork_group ∈ FORK_GROUPS 每组恰一节点；
|
||
# 行持 effects_a/effects_b 双效果键（A/B 只放规则面——键 ⊆ RULE_KEYS）+ name_a/name_b 双态呈现名；
|
||
# 购买解锁默认 A 态、营地零币切换（tree_toggle_fork），效果按激活态（save.fork_sides）取值。
|
||
# 行门槛：脊柱节点第 N 级可购需全树已购总等级 ≥ SPINE_ROW_GATE×(N−1)（总等级口径
|
||
# =tree_nodes 全部节点等级之和，免费点亮与 Fork 解锁计入）。
|
||
# 🔴 层级纪律（需求卡片红线 2）：局外树只放全局规则件——effects 禁流派标签（archetype 键出域=加载
|
||
# 致命）；规则改写型特性只走局内随机渠道，永不入树。
|
||
# 彩蛋 ≤3（schema 校验）；觉醒判定=MetaProgression._check_easter_egg 特化（生命/命中两线拉满+同调位
|
||
# 全解锁），不依赖 requires 点亮形态。
|
||
# 数值全 provisional（契约 7）；两侧「不同强非强弱」MC 验差 <~3pp（V19）。
|
||
class_name MetaTreeTable
|
||
extends Resource
|
||
|
||
@export var rows: Array[Variant] = [] # Array[Dictionary] 键 node_id
|
||
|
||
const VEINS := ["spine", "forge", "keystone", "attune"]
|
||
const KINDS := ["stat", "rule", "unlock", "socket", "fork", "easter"]
|
||
const CURRENCIES := ["keystone", "free"] # 树全钥石单币（2026-10-07 用户裁甲——原 gp 枚举值退役，字段保留为呈现元数据）
|
||
const STAT_KEYS := ["atk", "max_hp", "hit", "armor_class"]
|
||
## 规则键封闭词表（零裸 flat 同族护栏——effects.rule 键出域=加载致命；六键=三组 Fork 双态真实接线，
|
||
## 迭代 21 T1 扩签：posture 两键现役沿袭，sense/economy 四键随危险直觉/财富之道两组建效面新增）
|
||
const RULE_KEYS := ["posture_first_strike", "posture_bulwark", "sense_sharp", "sense_guard", "economy_hoard", "economy_spend"]
|
||
const KEY_WHITELIST := ["node_id", "display_name", "vein", "kind", "currency", "price", "cap",
|
||
"requires", "requires_level", "effects", "effects_a", "effects_b", "name_a", "name_b", "fork_group", "note"]
|
||
## 脊柱行门槛（一线一节点：节点第 N 级可购需全树总等级 ≥ GATE×(N−1)——「投入点数累计解锁深度」）
|
||
const SPINE_ROW_GATE := 4
|
||
|
||
## Fork 双态组词表（每组恰一节点——互斥由单态承载；营地零币切换承载面；
|
||
## fg_mastery 克制专精整组砍除——2026-10-11 裁，类型表达归锻造工坊）
|
||
const FORK_GROUPS := ["fg_posture", "fg_sense", "fg_economy"]
|
||
|
||
|
||
func validate() -> Array:
|
||
var errs: Array[Variant] = []
|
||
if rows.is_empty():
|
||
return errs # 空表合法态（建表先行——内容随换代批落）
|
||
var seen := {}
|
||
var fork_seen := {}
|
||
for row in rows:
|
||
var nid: String = row.get("node_id", "")
|
||
if nid == "":
|
||
errs.append({"category": "domain", "message": "node_id 空"})
|
||
continue
|
||
if seen.has(nid):
|
||
errs.append({"category": "dup_key", "message": "node_id 重复: %s" % nid})
|
||
continue
|
||
seen[nid] = true
|
||
if String(row.get("display_name", "")) == "":
|
||
errs.append({"category": "domain", "message": "%s display_name 空" % nid})
|
||
if not VEINS.has(String(row.get("vein", ""))):
|
||
errs.append({"category": "enum", "message": "%s vein 出域" % nid})
|
||
var kind := String(row.get("kind", ""))
|
||
if not KINDS.has(kind):
|
||
errs.append({"category": "enum", "message": "%s kind 出域" % nid})
|
||
if not CURRENCIES.has(String(row.get("currency", ""))):
|
||
errs.append({"category": "enum", "message": "%s currency 出域" % nid})
|
||
for k in row.keys():
|
||
if not KEY_WHITELIST.has(String(k)):
|
||
errs.append({"category": "zero_flat", "message": "%s 行键出白名单: %s" % [nid, String(k)]})
|
||
var cap := int(row.get("cap", 1))
|
||
if cap < 1 or cap > 9:
|
||
errs.append({"category": "domain", "message": "%s cap 越域 [1,9]: %d" % [nid, cap]})
|
||
if kind in ["unlock", "socket", "fork", "easter"] and cap != 1:
|
||
errs.append({"category": "cross_field", "message": "%s %s 行 cap 恒 1" % [nid, kind]})
|
||
var price := int(row.get("price", 0))
|
||
if price < 0 or price > 9999:
|
||
errs.append({"category": "domain", "message": "%s price 越域 [0,9999]: %d" % [nid, price]})
|
||
var fx: Dictionary[Variant, Variant] = row.get("effects", {}) as Dictionary
|
||
for ek in fx.keys():
|
||
if not (STAT_KEYS.has(String(ek)) or RULE_KEYS.has(String(ek))):
|
||
errs.append({"category": "zero_flat", "message": "%s effects 键出域（stat 线/rule 词表封闭）: %s" % [nid, String(ek)]})
|
||
# 🔴 层级纪律：局外树禁规则改写型特性（archetype 键出域=加载致命）
|
||
if fx.has("archetype"):
|
||
errs.append({"category": "load_bearing", "message": "%s effects 含 archetype（🔴 层级纪律——特性禁入局外树）" % nid})
|
||
# Fork 一节点双态结构：fork 行必带 fork_group（每组恰一节点）；主 effects 须空，效果只放
|
||
# a/b 双键且键 ⊆ RULE_KEYS（A/B 只放规则面——层级纪律）
|
||
if kind == "fork":
|
||
var fg := String(row.get("fork_group", ""))
|
||
if not FORK_GROUPS.has(fg):
|
||
errs.append({"category": "enum", "message": "%s fork_group 出域" % nid})
|
||
if fork_seen.has(fg):
|
||
errs.append({"category": "dup_key", "message": "%s fork 组重复（一组恰一节点）: %s" % [nid, fg]})
|
||
fork_seen[fg] = true
|
||
if not fx.is_empty():
|
||
errs.append({"category": "cross_field", "message": "%s fork 行主 effects 须空（效果只放 a/b 双键）" % nid})
|
||
for skey in ["effects_a", "effects_b"]:
|
||
var sd: Dictionary[Variant, Variant] = row.get(skey, {}) as Dictionary
|
||
if sd.is_empty():
|
||
errs.append({"category": "domain", "message": "%s %s 缺失或空（双态节点须双侧效果）" % [nid, skey]})
|
||
for k in sd.keys():
|
||
if not RULE_KEYS.has(String(k)):
|
||
errs.append({"category": "zero_flat", "message": "%s %s 键出域（A/B 只放规则面）: %s" % [nid, skey, String(k)]})
|
||
# requires 悬空引用
|
||
for row in rows:
|
||
for req in (row.get("requires", []) as Array):
|
||
if not seen.has(String(req)):
|
||
errs.append({"category": "dangling", "message": "%s requires 悬空: %s" % [String(row.get("node_id", "")), String(req)]})
|
||
# requires_level 等级阈值前置（R1 机制位——键须为在册节点、阈值整数 ≥1；类型错即拒）
|
||
for row in rows:
|
||
var nid2: String = String(row.get("node_id", ""))
|
||
var rl_v: Variant = row.get("requires_level", {})
|
||
if rl_v is Dictionary:
|
||
for req_id in (rl_v as Dictionary).keys():
|
||
if not seen.has(String(req_id)):
|
||
errs.append({"category": "dangling", "message": "%s requires_level 悬空: %s" % [nid2, String(req_id)]})
|
||
if int(rl_v[req_id]) < 1:
|
||
errs.append({"category": "domain", "message": "%s requires_level 阈值须 ≥1: %s=%d" % [nid2, String(req_id), int(rl_v[req_id])]})
|
||
elif row.has("requires_level"):
|
||
errs.append({"category": "domain", "message": "%s requires_level 须为 Dictionary {node_id: n}" % nid2})
|
||
# 彩蛋 ≤3
|
||
var easter := 0
|
||
for row in rows:
|
||
if String(row.get("kind", "")) == "easter":
|
||
easter += 1
|
||
if easter > 3:
|
||
errs.append({"category": "load_bearing", "message": "彩蛋节点 %d > 3（上限 3）" % easter})
|
||
return errs
|
||
|
||
|
||
func row_by_id(node_id: String) -> Dictionary:
|
||
for row in rows:
|
||
if String(row.get("node_id", "")) == node_id:
|
||
return row
|
||
return {}
|
||
|
||
|
||
## 行门槛（一线一节点：脊柱节点第 N 级可购需全树总等级 ≥ GATE×(N−1)；原 row-gating 行号主语
|
||
## 随层行退役平移到节点等级轴）
|
||
func level_gate(level: int) -> int:
|
||
return SPINE_ROW_GATE * maxi(0, level - 1)
|