find_tree_node.py 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510
  1. """
  2. 查找树节点 Tool - 人设树节点查询
  3. 功能:
  4. 1. 获取人设树的常量节点(全局常量、局部常量)
  5. 2. 获取符合条件概率阈值的节点(按条件概率排序返回 topN)
  6. """
  7. import json
  8. import sys
  9. from pathlib import Path
  10. from typing import Any, Optional
  11. # 保证直接运行或作为包加载时都能解析 utils / tools(IDE 可跳转)
  12. _root = Path(__file__).resolve().parent.parent
  13. if str(_root) not in sys.path:
  14. sys.path.insert(0, str(_root))
  15. from utils.conditional_ratio_calc import ( # noqa: E402
  16. build_node_post_index,
  17. calc_node_conditional_ratio,
  18. )
  19. from tools.point_match import match_derivation_to_post_points # noqa: E402
  20. try:
  21. from agent.tools import tool, ToolResult, ToolContext
  22. except ImportError:
  23. def tool(*args, **kwargs):
  24. return lambda f: f
  25. ToolResult = None # 仅用 main() 测核心逻辑时可无 agent
  26. ToolContext = None
  27. # 相对本文件:tools -> overall_derivation,input / output 在 overall_derivation 下
  28. _BASE_INPUT = Path(__file__).resolve().parent.parent / "input"
  29. _BASE_OUTPUT = Path(__file__).resolve().parent.parent / "output"
  30. def _dimension_analysis_log_dir(account_name: str, post_id: str, log_id: str) -> Path:
  31. """推导日志目录:output/{account_name}/推导日志/{post_id}/{log_id}/"""
  32. return _BASE_OUTPUT / account_name / "推导日志" / post_id / log_id
  33. def _load_derived_dim_tree_node_names(
  34. account_name: str, post_id: str, log_id: str, round: int
  35. ) -> list[str]:
  36. """
  37. 读取当前轮次对应的维度分析 JSON(优先 {round}_维度分析.json,不存在则 {round-1}_维度分析.json),
  38. 返回 derived_dims 中每项的 tree_node_name(已推导出的维度节点,人设树中层次较高)。
  39. 无可用文件时返回空列表。
  40. """
  41. if not log_id or not str(log_id).strip():
  42. return []
  43. log_dir = _dimension_analysis_log_dir(account_name, post_id, str(log_id).strip())
  44. for r in (round, round - 1):
  45. if r < 1:
  46. continue
  47. path = log_dir / f"{r}_维度分析.json"
  48. if not path.is_file():
  49. continue
  50. try:
  51. with open(path, "r", encoding="utf-8") as f:
  52. data = json.load(f)
  53. except Exception:
  54. continue
  55. dims = data.get("derived_dims") or []
  56. names: list[str] = []
  57. for d in dims:
  58. if isinstance(d, dict):
  59. tn = d.get("tree_node_name")
  60. if tn is not None and str(tn).strip():
  61. names.append(str(tn).strip())
  62. return names
  63. return []
  64. def _descendant_names_under_tree_nodes(
  65. account_name: str, anchor_node_names: list[str]
  66. ) -> tuple[set[str], dict[str, str]]:
  67. """
  68. 在每个人设维度树根上 DFS,收集所有锚点(derived_dims.tree_node_name)之下的**全部后代**(不含锚点自身)。
  69. 同时记录「所属维度」:对路径上每个后代节点,取从维度根到该节点路径上**最深的**那个锚点
  70. (与原先沿父链向上找最近 derived_dim 一致;多个锚点呈祖孙时取更深者)。
  71. Returns:
  72. (allowed 节点名集合, 节点名 -> 所属已推导维度树节点名)
  73. """
  74. if not anchor_node_names:
  75. return set(), {}
  76. S = set(anchor_node_names)
  77. allowed: set[str] = set()
  78. dim_map: dict[str, str] = {}
  79. for dim_root_name, root in _load_trees(account_name):
  80. def dfs(node_name: str, node_dict: dict, parent_deepest_s: Optional[str]) -> None:
  81. d_self = node_name if node_name in S else parent_deepest_s
  82. for cname, cnode in (node_dict.get("children") or {}).items():
  83. if not isinstance(cnode, dict):
  84. continue
  85. if cname not in S and d_self is not None:
  86. allowed.add(cname)
  87. dim_map[cname] = d_self
  88. dfs(cname, cnode, d_self)
  89. dfs(dim_root_name, root, None)
  90. return allowed, dim_map
  91. def _tree_dir(account_name: str) -> Path:
  92. """人设树目录:../input/{account_name}/原始数据/tree/"""
  93. return _BASE_INPUT / account_name / "原始数据" / "tree"
  94. def _load_trees(account_name: str) -> list[tuple[str, dict]]:
  95. """加载该账号下所有维度的人设树。返回 [(维度名, 根节点 dict), ...]。"""
  96. td = _tree_dir(account_name)
  97. if not td.is_dir():
  98. return []
  99. result = []
  100. for p in td.glob("*.json"):
  101. try:
  102. with open(p, "r", encoding="utf-8") as f:
  103. data = json.load(f)
  104. for dim_name, root in data.items():
  105. if isinstance(root, dict):
  106. result.append((dim_name, root))
  107. break
  108. except Exception:
  109. continue
  110. return result
  111. def _iter_all_nodes(account_name: str):
  112. """遍历该账号下所有人设树节点,产出 (节点名称, 父节点名称, 节点 dict)。"""
  113. for dim_name, root in _load_trees(account_name):
  114. def walk(parent_name: str, node_dict: dict):
  115. for name, child in (node_dict.get("children") or {}).items():
  116. if not isinstance(child, dict):
  117. continue
  118. yield (name, parent_name, child)
  119. yield from walk(name, child)
  120. yield from walk(dim_name, root)
  121. # ---------------------------------------------------------------------------
  122. # 1. 获取人设树常量节点
  123. # ---------------------------------------------------------------------------
  124. def get_constant_nodes(account_name: str) -> list[dict[str, Any]]:
  125. """
  126. 获取人设树的常量节点。
  127. - 全局常量:_is_constant=True
  128. - 局部常量:_is_local_constant=True 且 _is_constant=False
  129. 返回列表项:节点名称、概率(_ratio)、常量类型。
  130. """
  131. result = []
  132. for node_name, _parent, node in _iter_all_nodes(account_name):
  133. is_const = node.get("_is_constant") is True
  134. is_local = node.get("_is_local_constant") is True
  135. if is_const:
  136. const_type = "全局常量"
  137. elif is_local and not is_const:
  138. const_type = "局部常量"
  139. else:
  140. continue
  141. ratio = node.get("_ratio")
  142. result.append({
  143. "节点名称": node_name,
  144. "概率": ratio,
  145. "常量类型": const_type,
  146. })
  147. result.sort(key=lambda x: (x["概率"] is None, -(x["概率"] or 0)))
  148. return result
  149. # ---------------------------------------------------------------------------
  150. # 2. 获取符合条件概率阈值的节点
  151. # ---------------------------------------------------------------------------
  152. def get_nodes_by_conditional_ratio(
  153. account_name: str,
  154. derived_list: list[tuple[str, str]],
  155. threshold: float,
  156. top_n: int,
  157. allowed_node_names: Optional[set[str]] = None,
  158. node_belonging_dim: Optional[dict[str, str]] = None,
  159. ) -> list[dict[str, Any]]:
  160. """
  161. 获取人设树中条件概率 >= threshold 的节点,按条件概率降序,返回前 top_n 个。
  162. derived_list: 已推导列表,每项 (已推导的选题点, 推导来源人设树节点);为空时使用节点自身的 _ratio 作为条件概率。
  163. allowed_node_names: 若给定,仅保留节点名称在该集合内的结果。
  164. node_belonging_dim: 与 allowed 同步生成(见 _descendant_names_under_tree_nodes),节点名 -> 所属已推导维度;不传则所属维度均为「—」。
  165. 返回列表项:节点名称、条件概率、父节点名称、所属维度。
  166. """
  167. base_dir = _BASE_INPUT
  168. node_to_parent: dict[str, str] = {}
  169. if derived_list:
  170. for n, p, _ in _iter_all_nodes(account_name):
  171. node_to_parent[n] = p
  172. def dim_for(node_name: str) -> str:
  173. if not node_belonging_dim:
  174. return "—"
  175. return node_belonging_dim.get(node_name) or "—"
  176. scored: list[tuple[str, float, str, str]] = []
  177. if not derived_list:
  178. for node_name, parent_name, node in _iter_all_nodes(account_name):
  179. if allowed_node_names is not None and node_name not in allowed_node_names:
  180. continue
  181. ratio = node.get("_ratio")
  182. if ratio is None:
  183. ratio = 0.0
  184. else:
  185. ratio = float(ratio)
  186. if ratio >= threshold:
  187. scored.append((node_name, ratio, parent_name, dim_for(node_name)))
  188. else:
  189. node_post_index = build_node_post_index(account_name, base_dir)
  190. for node_name, parent_name in node_to_parent.items():
  191. if allowed_node_names is not None and node_name not in allowed_node_names:
  192. continue
  193. ratio = calc_node_conditional_ratio(
  194. account_name,
  195. derived_list,
  196. node_name,
  197. base_dir=base_dir,
  198. node_post_index=node_post_index,
  199. target_ratio=threshold,
  200. )
  201. if ratio >= threshold:
  202. scored.append((node_name, ratio, parent_name, dim_for(node_name)))
  203. scored.sort(key=lambda x: x[1], reverse=True)
  204. top = scored[:top_n]
  205. return [
  206. {
  207. "节点名称": name,
  208. "条件概率": ratio,
  209. "父节点名称": parent,
  210. "所属维度": dim,
  211. }
  212. for name, ratio, parent, dim in top
  213. ]
  214. def _parse_derived_list(derived_items: list[dict[str, str]]) -> list[tuple[str, str]]:
  215. """将 agent 传入的 [{"topic": "x", "source_node": "y"}, ...] 转为 DerivedItem 列表。"""
  216. out = []
  217. for item in derived_items:
  218. if isinstance(item, dict):
  219. topic = item.get("topic") or item.get("已推导的选题点")
  220. source = item.get("source_node") or item.get("推导来源人设树节点")
  221. if topic is not None and source is not None:
  222. out.append((str(topic).strip(), str(source).strip()))
  223. elif isinstance(item, (list, tuple)) and len(item) >= 2:
  224. out.append((str(item[0]).strip(), str(item[1]).strip()))
  225. return out
  226. # ---------------------------------------------------------------------------
  227. # Agent Tools(参考 glob_tool 封装)
  228. # ---------------------------------------------------------------------------
  229. @tool()
  230. async def find_tree_constant_nodes(
  231. account_name: str,
  232. post_id: str,
  233. ) -> ToolResult:
  234. """
  235. 获取人设树中的常量节点列表(全局常量与局部常量),并检查每个节点与帖子选题点的匹配情况。
  236. Args:
  237. account_name : 账号名,用于定位该账号的人设树数据。
  238. post_id : 帖子ID,用于加载帖子选题点并与各常量节点做匹配判断。
  239. Returns:
  240. ToolResult:
  241. - title: 结果标题。
  242. - output: 可读的节点列表文本(每行:节点名称、概率、常量类型、帖子匹配情况)。
  243. - 出错时 error 为错误信息。
  244. """
  245. tree_dir = _tree_dir(account_name)
  246. if not tree_dir.is_dir():
  247. return ToolResult(
  248. title="人设树目录不存在",
  249. output=f"目录不存在: {tree_dir}",
  250. error="Directory not found",
  251. )
  252. try:
  253. items = get_constant_nodes(account_name)
  254. # 批量匹配所有节点与帖子选题点
  255. if items and post_id:
  256. node_names = [x["节点名称"] for x in items]
  257. matched_results = await match_derivation_to_post_points(node_names, account_name, post_id)
  258. node_match_map: dict[str, list] = {}
  259. for m in matched_results:
  260. node_match_map.setdefault(m["推导选题点"], []).append({
  261. "帖子选题点": m["帖子选题点"],
  262. "匹配分数": m["匹配分数"],
  263. })
  264. for item in items:
  265. matches = node_match_map.get(item["节点名称"], [])
  266. item["帖子选题点匹配"] = matches if matches else "无"
  267. if not items:
  268. output = "未找到常量节点"
  269. else:
  270. lines = []
  271. for x in items:
  272. match_info = x.get("帖子选题点匹配", "无")
  273. if isinstance(match_info, list):
  274. match_str = "、".join(f"{m['帖子选题点']}({m['匹配分数']})" for m in match_info)
  275. else:
  276. match_str = str(match_info)
  277. lines.append(f"- {x['节点名称']}\t概率={x['概率']}\t{x['常量类型']}\t帖子选题点匹配={match_str}")
  278. output = "\n".join(lines)
  279. return ToolResult(
  280. title=f"常量节点 ({account_name})",
  281. output=output,
  282. metadata={"account_name": account_name, "count": len(items)},
  283. )
  284. except Exception as e:
  285. return ToolResult(
  286. title="获取常量节点失败",
  287. output=str(e),
  288. error=str(e),
  289. )
  290. @tool()
  291. async def find_tree_nodes_by_conditional_ratio(
  292. account_name: str,
  293. post_id: str,
  294. derived_items: list[dict[str, str]],
  295. conditional_ratio_threshold: float,
  296. top_n: int = 100,
  297. round: int = 1,
  298. log_id: str = "",
  299. ) -> ToolResult:
  300. """
  301. 按条件概率阈值从人设树筛选节点,返回最多 top_n 条(按条件概率降序),并检查每个节点与帖子选题点的匹配情况。
  302. Args:
  303. account_name : 账号名,用于定位该账号的人设树数据。
  304. post_id : 帖子ID,用于加载帖子选题点并与各节点做匹配判断。
  305. derived_items : 已推导选题点列表,可为空。非空时每项为字典,需含 topic(或「已推导的选题点」)与 source_node(或「推导来源人设树节点」)
  306. conditional_ratio_threshold : 条件概率阈值,仅返回条件概率 >= 该值的节点。
  307. top_n : 返回条数上限。
  308. round : 推导轮次。
  309. log_id : 推导日志ID
  310. Returns:
  311. ToolResult:
  312. - title: 结果标题。
  313. - output: 可读的节点列表文本(每行:节点名称、条件概率、父节点、所属维度、帖子匹配情况)。
  314. - 出错时 error 为错误信息。
  315. """
  316. tree_dir = _tree_dir(account_name)
  317. if not tree_dir.is_dir():
  318. return ToolResult(
  319. title="人设树目录不存在",
  320. output=f"目录不存在: {tree_dir}",
  321. error="Directory not found",
  322. )
  323. try:
  324. derived_list = _parse_derived_list(derived_items or [])
  325. allowed: Optional[set[str]] = None
  326. node_belonging_dim: dict[str, str] = {}
  327. dim_source = ""
  328. derived_dim_names: list[str] = []
  329. if log_id and str(log_id).strip():
  330. derived_dim_names = _load_derived_dim_tree_node_names(
  331. account_name, post_id, str(log_id).strip(), int(round)
  332. )
  333. if derived_dim_names:
  334. allowed, node_belonging_dim = _descendant_names_under_tree_nodes(
  335. account_name, derived_dim_names
  336. )
  337. # 记录实际用到的维度分析文件(与读取逻辑一致)
  338. log_dir = _dimension_analysis_log_dir(account_name, post_id, str(log_id).strip())
  339. for r in (int(round), int(round) - 1):
  340. if r >= 1 and (log_dir / f"{r}_维度分析.json").is_file():
  341. dim_source = f"{r}_维度分析.json (derived_dims -> 全部后代)"
  342. break
  343. else:
  344. dim_source = "未读到 derived_dims(无对应维度分析文件或为空),未收窄"
  345. items = get_nodes_by_conditional_ratio(
  346. account_name,
  347. derived_list,
  348. conditional_ratio_threshold,
  349. top_n,
  350. allowed_node_names=allowed,
  351. node_belonging_dim=node_belonging_dim if node_belonging_dim else None,
  352. )
  353. # 批量匹配所有节点与帖子选题点
  354. if items and post_id:
  355. node_names = [x["节点名称"] for x in items]
  356. matched_results = await match_derivation_to_post_points(node_names, account_name, post_id)
  357. node_match_map: dict[str, list] = {}
  358. for m in matched_results:
  359. node_match_map.setdefault(m["推导选题点"], []).append({
  360. "帖子选题点": m["帖子选题点"],
  361. "匹配分数": m["匹配分数"],
  362. })
  363. for item in items:
  364. matches = node_match_map.get(item["节点名称"], [])
  365. item["帖子选题点匹配"] = matches if matches else "无"
  366. # [临时] 仅保留有帖子选题点匹配的记录(过滤掉「无」),方便后续删除
  367. items = [x for x in items if isinstance(x.get("帖子选题点匹配"), list)]
  368. if not items:
  369. output = f"未找到条件概率 >= {conditional_ratio_threshold} 的节点"
  370. else:
  371. lines = []
  372. for x in items:
  373. match_info = x.get("帖子选题点匹配", "无")
  374. if isinstance(match_info, list):
  375. match_str = "、".join(f"{m['帖子选题点']}({m['匹配分数']})" for m in match_info)
  376. else:
  377. match_str = str(match_info)
  378. dim_label = x.get("所属维度", "—")
  379. lines.append(
  380. f"- {x['节点名称']}\t条件概率={x['条件概率']}\t所属维度={dim_label}\t帖子选题点匹配={match_str}"
  381. )
  382. output = "\n".join(lines)
  383. return ToolResult(
  384. title=f"条件概率节点 ({account_name}, 阈值={conditional_ratio_threshold})",
  385. output=output,
  386. metadata={
  387. "account_name": account_name,
  388. "threshold": conditional_ratio_threshold,
  389. "top_n": top_n,
  390. "count": len(items),
  391. "round": int(round),
  392. "log_id": str(log_id).strip() if log_id else "",
  393. "dimension_filter": {
  394. "derived_dim_nodes": derived_dim_names,
  395. "allowed_descendant_count": len(allowed) if allowed is not None else None,
  396. "source": dim_source or ("未提供 log_id,未按维度收窄" if not (log_id and str(log_id).strip()) else ""),
  397. },
  398. },
  399. )
  400. except Exception as e:
  401. return ToolResult(
  402. title="按条件概率查询节点失败",
  403. output=str(e),
  404. error=str(e),
  405. )
  406. def main() -> None:
  407. """本地测试:用家有大志账号测常量节点与条件概率节点,有 agent 时再跑一遍 tool 接口。"""
  408. import asyncio
  409. account_name = "家有大志"
  410. post_id = "68fb6a5c000000000302e5de"
  411. # derived_items = [
  412. # {"topic": "分享", "source_node": "分享"},
  413. # {"topic": "叙事结构", "source_node": "叙事结构"},
  414. # ]
  415. derived_items = [{"topic":"分享","source_node":"分享"},{"topic":"叙事结构","source_node":"叙事编排"},{"topic":"幽默化标题","source_node":"幽默化标题"},{"source_node":"叙事结构","topic":"叙事结构"},{"topic":"夸张堆叠","source_node":"夸张转化"},{"topic":"居家生活场景","source_node":"生活场景"},{"topic":"图片文字","source_node":"图片文字"},{"source_node":"补充说明式","topic":"补充说明式"},{"topic":"标题","source_node":"标题"},{"topic":"递进式","source_node":"递进式"}]
  416. conditional_ratio_threshold = 0.2
  417. top_n = 2000
  418. # # 1)常量节点(核心函数,无匹配)
  419. # constant_nodes = get_constant_nodes(account_name)
  420. # print(f"账号: {account_name} — 常量节点共 {len(constant_nodes)} 个(前 50 个):")
  421. # for x in constant_nodes[:50]:
  422. # print(f" - {x['节点名称']}\t概率={x['概率']}\t{x['常量类型']}")
  423. # print()
  424. #
  425. # # 2)条件概率节点(核心函数)
  426. # derived_list = _parse_derived_list(derived_items)
  427. # ratio_nodes = get_nodes_by_conditional_ratio(
  428. # account_name, derived_list, conditional_ratio_threshold, top_n
  429. # )
  430. # print(f"条件概率节点 阈值={conditional_ratio_threshold}, top_n={top_n}, 共 {len(ratio_nodes)} 个:")
  431. # for x in ratio_nodes:
  432. # print(f" - {x['节点名称']}\t条件概率={x['条件概率']}\t父节点={x['父节点名称']}")
  433. # print()
  434. # 3)有 agent 时通过 tool 接口再跑一遍(含帖子选题点匹配)
  435. if ToolResult is not None:
  436. async def run_tools():
  437. # r1 = await find_tree_constant_nodes(account_name, post_id=post_id)
  438. # print("--- find_tree_constant_nodes ---")
  439. # print(r1.output[:2000] + "..." if len(r1.output) > 2000 else r1.output)
  440. r2 = await find_tree_nodes_by_conditional_ratio(
  441. account_name,
  442. post_id=post_id,
  443. derived_items=derived_items,
  444. conditional_ratio_threshold=conditional_ratio_threshold,
  445. top_n=top_n,
  446. round=6,
  447. log_id="20260318172724",
  448. )
  449. print("\n--- find_tree_nodes_by_conditional_ratio ---")
  450. print(r2.output)
  451. asyncio.run(run_tools())
  452. if __name__ == "__main__":
  453. main()