@fgbg/mdocs 0.8.25 → 1.1.1

package/dist/server/documents/graph/lifecycle.js

@@ -0,0 +1,104 @@
+/**
+ * 图谱缓存生命周期：与 document.service 主链路解耦。
+ * 主链路只 schedule；隐藏文件 IO 全在本模块 + graph.service 导出函数。
+ */
+import { getDb } from "../../db/connection.js";
+import { findDocumentById } from "../../db/repositories/document.repo.js";
+import { findCommitById } from "../../db/repositories/commit.repo.js";
+import { readCommitBlob, readDocument } from "../../storage/file-store.js";
+import { extractPlainTextFromLexical } from "../lexical-text.js";
+import { changeRatio, DEFAULT_GRAPH_DIRTY_RATIO, } from "./change-ratio.js";
+import { deleteArticleGraphCache, readArticleGraphFile, readDirGraphFile, readDomainGraphFile, writeArticleGraphFile, writeDirGraphFile, writeDomainGraphFile, } from "../graph-cache-io.js";
+export function scheduleGraphLifecycle(task) {
+    setImmediate(() => {
+        void task().catch((err) => {
+            console.warn("[graph-lifecycle]", err);
+        });
+    });
+}
+/** 从 folderId 自身起标 dirty，再沿 parent_id 向上；最后域图 */
+export async function markAncestorsDirty(params) {
+    let p = params.folderId;
+    const db = getDb();
+    while (p != null) {
+        const file = readDirGraphFile(p);
+        if (file) {
+            file.meta.dirty = true;
+            writeDirGraphFile(p, file);
+        }
+        const row = findDocumentById(db, p);
+        p = row?.parent_id ?? null;
+    }
+    const domainFile = readDomainGraphFile(params.domainId);
+    if (domainFile) {
+        domainFile.meta.dirty = true;
+        writeDomainGraphFile(params.domainId, domainFile);
+    }
+}
+export async function onArticleDeleted(params) {
+    await markAncestorsDirty({
+        domainId: params.domainId,
+        folderId: params.parentId,
+    });
+    deleteArticleGraphCache(params.documentId);
+}
+export async function onArticleMoved(params) {
+    await markAncestorsDirty({
+        domainId: params.domainId,
+        folderId: params.oldParentId,
+    });
+    await markAncestorsDirty({
+        domainId: params.domainId,
+        folderId: params.newParentId,
+    });
+    deleteArticleGraphCache(params.documentId);
+}
+export async function onArticlePublished(params) {
+    const cached = readArticleGraphFile(params.documentId);
+    if (!cached)
+        return;
+    const oldLexical = readLexicalAtCommit(params.documentId, cached.meta.commitId);
+    const newLexical = readCurrentLexical(params.documentId);
+    if (oldLexical == null || newLexical == null)
+        return;
+    const ratio = changeRatio(extractPlainTextFromLexical(oldLexical), extractPlainTextFromLexical(newLexical));
+    if (ratio < DEFAULT_GRAPH_DIRTY_RATIO)
+        return;
+    cached.meta.dirty = true;
+    writeArticleGraphFile(params.documentId, cached);
+    await markAncestorsDirty({
+        domainId: params.domainId,
+        folderId: params.parentId,
+    });
+}
+export async function onFolderDeleted(params) {
+    await markAncestorsDirty({
+        domainId: params.domainId,
+        folderId: params.parentId,
+    });
+}
+function readCurrentLexical(documentId) {
+    const db = getDb();
+    const doc = findDocumentById(db, documentId);
+    if (!doc)
+        return null;
+    try {
+        return readDocument(doc.domain_id, doc.relative_path).content;
+    }
+    catch {
+        return null;
+    }
+}
+function readLexicalAtCommit(documentId, commitId) {
+    const db = getDb();
+    const commit = findCommitById(db, commitId);
+    if (!commit || commit.document_id !== documentId)
+        return null;
+    try {
+        return readCommitBlob(commit.blob_ref);
+    }
+    catch {
+        return null;
+    }
+}
+//# sourceMappingURL=lifecycle.js.map

package/dist/server/documents/graph/lifecycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.js","sourceRoot":"","sources":["../../../../src/server/documents/graph/lifecycle.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,wCAAwC,CAAC;AAC1E,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EACL,WAAW,EACX,yBAAyB,GAC1B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,uBAAuB,EACvB,oBAAoB,EACpB,gBAAgB,EAChB,mBAAmB,EACnB,qBAAqB,EACrB,iBAAiB,EACjB,oBAAoB,GACrB,MAAM,sBAAsB,CAAC;AAE9B,MAAM,UAAU,sBAAsB,CAAC,IAAyB;IAC9D,YAAY,CAAC,GAAG,EAAE;QAChB,KAAK,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;YACxB,OAAO,CAAC,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,iDAAiD;AACjD,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,MAGxC;IACC,IAAI,CAAC,GAAkB,MAAM,CAAC,QAAQ,CAAC;IACvC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YACvB,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpC,CAAC,GAAG,GAAG,EAAE,SAAS,IAAI,IAAI,CAAC;IAC7B,CAAC;IACD,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxD,IAAI,UAAU,EAAE,CAAC;QACf,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAC7B,oBAAoB,CAAC,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,MAItC;IACC,MAAM,kBAAkB,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,QAAQ,EAAE,MAAM,CAAC,QAAQ;KAC1B,CAAC,CAAC;IACH,uBAAuB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,MAKpC;IACC,MAAM,kBAAkB,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,QAAQ,EAAE,MAAM,CAAC,WAAW;KAC7B,CAAC,CAAC;IACH,MAAM,kBAAkB,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,QAAQ,EAAE,MAAM,CAAC,WAAW;KAC7B,CAAC,CAAC;IACH,uBAAuB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,MAIxC;IACC,MAAM,MAAM,GAAG,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACvD,IAAI,CAAC,MAAM;QAAE,OAAO;IAEpB,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChF,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACzD,IAAI,UAAU,IAAI,IAAI,IAAI,UAAU,IAAI,IAAI;QAAE,OAAO;IAErD,MAAM,KAAK,GAAG,WAAW,CACvB,2BAA2B,CAAC,UAAU,CAAC,EACvC,2BAA2B,CAAC,UAAU,CAAC,CACxC,CAAC;IACF,IAAI,KAAK,GAAG,yBAAyB;QAAE,OAAO;IAE9C,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACzB,qBAAqB,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IACjD,MAAM,kBAAkB,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,QAAQ,EAAE,MAAM,CAAC,QAAQ;KAC1B,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,MAGrC;IACC,MAAM,kBAAkB,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,QAAQ,EAAE,MAAM,CAAC,QAAQ;KAC1B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,kBAAkB,CAAC,UAAkB;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,GAAG,GAAG,gBAAgB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAC7C,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC;IAChE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,UAAkB,EAAE,QAAgB;IAC/D,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC5C,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC;IAC9D,IAAI,CAAC;QACH,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/server/documents/graph/llm-chains.js

@@ -0,0 +1,135 @@
+/**
+ * 三条 AI 链路 —— 基于 Tool 方式输出结构化结果。
+ *
+ * 每条链路都有「正常 tool + 降级 tool」，AI 二选一调用。
+ * 外部接口统一返回正常数据（降级时返回空数组，外部不感知降级）。
+ *
+ * 1. extractDocNodes    — 文章 → doc 节点
+ * 2. induceConceptNodes — doc 节点 → concept 节点
+ * 3. generateContains   — 顶层节点 → contains 关系
+ */
+import { runToolExtractionWithFallback } from './graph-agent.js';
+import { extractKnowledgePointsTool, noKnowledgePointsTool, } from './tools/extract-knowledge-points.tool.js';
+import { induceConceptsTool, noConceptsTool, } from './tools/induce-concepts.tool.js';
+import { generateContainsTool, noContainsRelationsTool, } from './tools/generate-contains.tool.js';
+import { conceptRelationsTool, noConceptRelationsTool, } from './tools/concept-relations.tool.js';
+// ========== 链路 1：从文章提取 doc 节点 ==========
+const EXTRACT_DOC_NODES_SYSTEM = `你是一个知识提取专家。你的任务是从给定的 Markdown 文章中提取若干个独立的知识要点。
+
+要求：
+1. 每个知识要点是一个独立的知识点（概念、规则、方法等）
+2. 提取 3-10 个要点，粒度适中，不要太细也不要太粗
+3. 每个要点必须包含 label、description、confidence
+4. 如果是概念定义，可以填写 definition 字段
+5. 如果要点对应文章中的某个小标题，填写 heading 字段
+6. 分析完成后，调用 submitKnowledgePoints 或 submitNoKnowledgePoints 之一提交结果`;
+/**
+ * 从文章 Markdown 中提取 doc 节点。
+ * 内容太少或无法提取时返回空数组。
+ */
+export async function extractDocNodes(markdown, agentConfig) {
+    const result = await runToolExtractionWithFallback(agentConfig, extractKnowledgePointsTool, noKnowledgePointsTool, EXTRACT_DOC_NODES_SYSTEM, `请从以下文章中提取知识要点：
+
+${markdown}`);
+    if (result.ok)
+        return result.data.nodes;
+    return [];
+}
+// ========== 链路 2：从 doc 节点归纳 concept 节点 ==========
+const INDUCE_CONCEPT_SYSTEM = `你是一个知识归纳专家。你的任务是从一组知识节点中归纳出若干上层概念。
+
+要求：
+1. 每个上层概念是对多个相关知识节点的抽象概括
+2. 概念数量约为输入节点数的 1/3 ~ 1/5，宁缺毋滥
+3. 允许多父（一个知识节点可属于多个上层概念）
+4. 合并不了的节点可以不归，不强求全覆盖
+5. 每个概念至少能覆盖 2 个输入节点
+6. 分析完成后，调用 submitInducedConcepts 或 submitNoConcepts 之一提交结果`;
+/**
+ * 从 doc 节点中归纳出 concept 节点。
+ * 节点太少或无法归纳时返回空数组。
+ */
+export async function induceConceptNodes(docNodes, agentConfig) {
+    if (docNodes.length < 2)
+        return [];
+    const nodesList = docNodes
+        .map((n, i) => `${i + 1}. ${n.label}：${n.description}`)
+        .join('\n');
+    const result = await runToolExtractionWithFallback(agentConfig, induceConceptsTool, noConceptsTool, INDUCE_CONCEPT_SYSTEM, `请从以下知识节点中归纳上层概念：
+
+${nodesList}`);
+    if (result.ok)
+        return result.data.concepts;
+    return [];
+}
+// ========== 链路 3：生成 contains 关系 ==========
+const GENERATE_CONTAINS_SYSTEM = `你是一个知识图谱关系专家。你的任务是判断知识节点之间的包含关系。
+
+包含关系定义：
+- A contains B 表示 A 更抽象、更宽泛，B 更具体、是 A 的一部分或子概念
+- concept 类型的节点可以包含 doc 节点，也可以包含更具体的 concept 节点
+- 方向一定是：上层（抽象） → 下层（具体）
+
+要求：
+1. 只输出高置信度的包含关系，宁缺毋滥
+2. fromId 是更抽象节点的 id，toId 是更具体节点的 id
+3. **严格使用输入中给出的 id，不要自己编造**
+4. 分析完成后，调用 submitContainsRelations 或 submitNoContainsRelations 之一提交结果`;
+/**
+ * 为节点生成 contains 关系。
+ * 无法判断时返回空数组。
+ */
+export async function generateContains(nodes, agentConfig) {
+    if (nodes.length < 2)
+        return [];
+    const nodesList = nodes
+        .map((n) => `- id: ${n.id}\n  type: ${n.type}\n  label: ${n.label}\n  description: ${n.description}`)
+        .join('\n\n');
+    const result = await runToolExtractionWithFallback(agentConfig, generateContainsTool, noContainsRelationsTool, GENERATE_CONTAINS_SYSTEM, `请判断以下节点之间的包含关系：
+
+${nodesList}`);
+    if (result.ok) {
+        return result.data.relations.map((r) => ({
+            from: r.fromId,
+            to: r.toId,
+            type: 'contains',
+            confidence: r.confidence,
+        }));
+    }
+    return [];
+}
+// ========== 链路 4：生成 concept 之间的关系 ==========
+const CONCEPT_RELATIONS_SYSTEM = `你是一个知识图谱关系专家。你的任务是分析一组概念，找出它们之间的关系。
+
+关系类型定义：
+- related_to：两个概念相关，但没有明确的包含/依赖关系
+- part_of：A part_of B 表示 A 是 B 的一部分 / 子领域
+- depends_on：A depends_on B 表示 A 依赖于 B（B 是 A 的前提或基础）
+
+要求：
+1. 只输出高置信度的关系，宁缺毋滥
+2. fromId 和 toId 必须是输入中给出的概念 id，不要编造
+3. 关系方向要准确：
+   - part_of：部分 → 整体（小的 → 大的）
+   - depends_on：依赖方 → 被依赖方
+   - related_to：方向不敏感，但也要有意义
+4. 避免重复的关系（互为 related_to 算重复）
+5. 分析完成后，调用 submitConceptRelations 或 submitNoConceptRelations 之一提交结果`;
+/**
+ * 归纳 concept 节点之间的关系。
+ * 节点太少或无法判断时返回空数组。
+ */
+export async function induceConceptRelations(concepts, agentConfig) {
+    if (concepts.length < 2)
+        return [];
+    const conceptsList = concepts
+        .map((n, i) => `${i + 1}. id: ${n.id}\n   label: ${n.label}\n   description: ${n.description}`)
+        .join('\n\n');
+    const result = await runToolExtractionWithFallback(agentConfig, conceptRelationsTool, noConceptRelationsTool, CONCEPT_RELATIONS_SYSTEM, `请分析以下概念之间的关系：
+
+${conceptsList}`);
+    if (result.ok)
+        return result.data.relations;
+    return [];
+}
+//# sourceMappingURL=llm-chains.js.map

package/dist/server/documents/graph/llm-chains.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-chains.js","sourceRoot":"","sources":["../../../../src/server/documents/graph/llm-chains.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,6BAA6B,EAAyB,MAAM,kBAAkB,CAAC;AACxF,OAAO,EACL,0BAA0B,EAC1B,qBAAqB,GACtB,MAAM,0CAA0C,CAAC;AAClD,OAAO,EACL,kBAAkB,EAClB,cAAc,GACf,MAAM,iCAAiC,CAAC;AACzC,OAAO,EACL,oBAAoB,EACpB,uBAAuB,GACxB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,oBAAoB,EACpB,sBAAsB,GACvB,MAAM,mCAAmC,CAAC;AAS3C,0CAA0C;AAE1C,MAAM,wBAAwB,GAAG;;;;;;;;mEAQkC,CAAC;AAEpE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,QAAgB,EAChB,WAA6B;IAE7B,MAAM,MAAM,GAAG,MAAM,6BAA6B,CAChD,WAAW,EACX,0BAA0B,EAC1B,qBAAqB,EACrB,wBAAwB,EACxB;;EAEF,QAAQ,EAAE,CACT,CAAC;IAEF,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACxC,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,mDAAmD;AAEnD,MAAM,qBAAqB,GAAG;;;;;;;;4DAQ8B,CAAC;AAE7D;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,QAAkD,EAClD,WAA6B;IAE7B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,SAAS,GAAG,QAAQ;SACvB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;SACtD,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,MAAM,GAAG,MAAM,6BAA6B,CAChD,WAAW,EACX,kBAAkB,EAClB,cAAc,EACd,qBAAqB,EACrB;;EAEF,SAAS,EAAE,CACV,CAAC;IAEF,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC3C,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,4CAA4C;AAE5C,MAAM,wBAAwB,GAAG;;;;;;;;;;;uEAWsC,CAAC;AAExE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,KAAkB,EAClB,WAA6B;IAE7B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAEhC,MAAM,SAAS,GAAG,KAAK;SACpB,GAAG,CACF,CAAC,CAAC,EAAE,EAAE,CACJ,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,KAAK,oBAAoB,CAAC,CAAC,WAAW,EAAE,CAC3F;SACA,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG,MAAM,6BAA6B,CAChD,WAAW,EACX,oBAAoB,EACpB,uBAAuB,EACvB,wBAAwB,EACxB;;EAEF,SAAS,EAAE,CACV,CAAC;IAEF,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;QACd,OAAO,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvC,IAAI,EAAE,CAAC,CAAC,MAAM;YACd,EAAE,EAAE,CAAC,CAAC,IAAI;YACV,IAAI,EAAE,UAAmB;YACzB,UAAU,EAAE,CAAC,CAAC,UAAU;SACzB,CAAC,CAAC,CAAC;IACN,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,8CAA8C;AAE9C,MAAM,wBAAwB,GAAG;;;;;;;;;;;;;;;qEAeoC,CAAC;AAEtE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,QAA8D,EAC9D,WAA6B;IAE7B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,YAAY,GAAG,QAAQ;SAC1B,GAAG,CACF,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,KAAK,qBAAqB,CAAC,CAAC,WAAW,EAAE,CAC1F;SACA,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG,MAAM,6BAA6B,CAChD,WAAW,EACX,oBAAoB,EACpB,sBAAsB,EACtB,wBAAwB,EACxB;;EAEF,YAAY,EAAE,CACb,CAAC;IAEF,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC5C,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/server/documents/graph/llm-utils.js

@@ -0,0 +1,19 @@
+/**
+ * 从 Agent 输出中提取最外层 JSON 对象。
+ * 支持 ```json 围栏、前后多余文字等情况。
+ */
+export function extractJson(text) {
+    // 先尝试找 fenced code block
+    const fenceMatch = text.match(/```(?:json)?\s*\n([\s\S]*?)\n\s*```/i);
+    if (fenceMatch && fenceMatch[1]) {
+        return fenceMatch[1].trim();
+    }
+    // 再尝试找最外层的 { ... }
+    const firstBrace = text.indexOf('{');
+    const lastBrace = text.lastIndexOf('}');
+    if (firstBrace !== -1 && lastBrace !== -1 && lastBrace > firstBrace) {
+        return text.slice(firstBrace, lastBrace + 1);
+    }
+    return null;
+}
+//# sourceMappingURL=llm-utils.js.map

package/dist/server/documents/graph/llm-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-utils.js","sourceRoot":"","sources":["../../../../src/server/documents/graph/llm-utils.ts"],"names":[],"mappings":"AAOA;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY;IACtC,yBAAyB;IACzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;IACtE,IAAI,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QAChC,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;IACD,mBAAmB;IACnB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,UAAU,KAAK,CAAC,CAAC,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;QACpE,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/server/documents/graph/llm-utils.test.js

@@ -0,0 +1,34 @@
+/**
+ * LLM 工具函数单元测试（JSON 提取部分）。
+ */
+import { describe, expect, test } from 'vitest';
+import { extractJson } from './llm-utils.js';
+describe('extractJson', () => {
+    test('纯 JSON 直接返回', () => {
+        const json = '{"a": 1}';
+        expect(extractJson(json)).toBe(json);
+    });
+    test('带 markdown code fence', () => {
+        const input = '```json\n{"a": 1}\n```';
+        expect(extractJson(input)).toBe('{"a": 1}');
+    });
+    test('带前后多余文字', () => {
+        const input = '好的，这是结果：\n{"a": 1}\n希望对你有帮助。';
+        expect(extractJson(input)).toBe('{"a": 1}');
+    });
+    test('带 fence 和多余文字', () => {
+        const input = '开始\n```\n{"a": 1}\n```\n结束';
+        expect(extractJson(input)).toBe('{"a": 1}');
+    });
+    test('嵌套对象正确取最外层', () => {
+        const input = '{"a": {"b": 1}}';
+        expect(extractJson(input)).toBe(input);
+    });
+    test('没有 JSON 返回 null', () => {
+        expect(extractJson('hello world')).toBeNull();
+    });
+    test('空字符串返回 null', () => {
+        expect(extractJson('')).toBeNull();
+    });
+});
+//# sourceMappingURL=llm-utils.test.js.map

package/dist/server/documents/graph/llm-utils.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-utils.test.js","sourceRoot":"","sources":["../../../../src/server/documents/graph/llm-utils.test.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAI,CAAC,aAAa,EAAE,GAAG,EAAE;QACvB,MAAM,IAAI,GAAG,UAAU,CAAC;QACxB,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,MAAM,KAAK,GAAG,wBAAwB,CAAC;QACvC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE;QACnB,MAAM,KAAK,GAAG,8BAA8B,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE;QACzB,MAAM,KAAK,GAAG,4BAA4B,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE;QACtB,MAAM,KAAK,GAAG,iBAAiB,CAAC;QAChC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC3B,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,aAAa,EAAE,GAAG,EAAE;QACvB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/server/documents/graph/tools/concept-relations.tool.js

@@ -0,0 +1,49 @@
+/**
+ * Tool：提交 concept 节点之间的关系。
+ *
+ * 用在 induceConceptRelations 链路：
+ * AI 分析完所有 concept 节点后调用这个 tool，提交概念之间的关系。
+ */
+import { Type } from '@earendil-works/pi-ai';
+import { z } from 'zod';
+// TypeBox schema（发给 API 用）
+export const conceptRelationsParameters = Type.Object({
+    relations: Type.Array(Type.Object({
+        fromId: Type.String({ description: '起点概念的 id（必须与输入中的 id 完全一致）' }),
+        toId: Type.String({ description: '终点概念的 id（必须与输入中的 id 完全一致）' }),
+        type: Type.Union([
+            Type.Literal('related_to'),
+            Type.Literal('part_of'),
+            Type.Literal('depends_on'),
+        ], { description: '关系类型：related_to（相关）、part_of（属于）、depends_on（依赖）' }),
+        description: Type.Optional(Type.String({ description: '关系的简要说明' })),
+        confidence: Type.Number({ description: '关系的置信度，0-1' }),
+    }), { description: '概念之间的关系列表' }),
+});
+// Zod schema（运行时校验 + 类型推断用）
+export const conceptRelationsSchema = z.object({
+    relations: z.array(z.object({
+        fromId: z.string().min(1),
+        toId: z.string().min(1),
+        type: z.enum(['related_to', 'part_of', 'depends_on']),
+        description: z.string().optional(),
+        confidence: z.number().min(0).max(1),
+    })),
+});
+export const conceptRelationsTool = {
+    name: 'submitConceptRelations',
+    description: '提交概念节点之间的关系列表。分析完所有概念后调用此工具提交结果。',
+    parameters: conceptRelationsParameters,
+    schema: conceptRelationsSchema,
+};
+// ========== 降级 tool ==========
+export const noConceptRelationsParameters = Type.Object({
+    reason: Type.String({ description: '无法生成概念关系的原因' }),
+});
+export const noConceptRelationsTool = {
+    name: 'submitNoConceptRelations',
+    description: '当概念太少或无法判断有效关系时，调用此工具说明原因。',
+    parameters: noConceptRelationsParameters,
+    schema: z.object({ reason: z.string() }),
+};
+//# sourceMappingURL=concept-relations.tool.js.map

package/dist/server/documents/graph/tools/concept-relations.tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"concept-relations.tool.js","sourceRoot":"","sources":["../../../../../src/server/documents/graph/tools/concept-relations.tool.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,IAAI,EAAe,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,2BAA2B;AAC3B,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC,MAAM,CAAC;IACpD,SAAS,EAAE,IAAI,CAAC,KAAK,CACnB,IAAI,CAAC,MAAM,CAAC;QACV,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,2BAA2B,EAAE,CAAC;QACjE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,2BAA2B,EAAE,CAAC;QAC/D,IAAI,EAAE,IAAI,CAAC,KAAK,CACd;YACE,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC;YAC1B,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC;SAC3B,EACD,EAAE,WAAW,EAAE,gDAAgD,EAAE,CAClE;QACD,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC;QACnE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC;KACvD,CAAC,EACF,EAAE,WAAW,EAAE,WAAW,EAAE,CAC7B;CACF,CAAC,CAAC;AAEH,4BAA4B;AAC5B,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,SAAS,EAAE,CAAC,CAAC,KAAK,CAChB,CAAC,CAAC,MAAM,CAAC;QACP,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACrD,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAClC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACrC,CAAC,CACH;CACF,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,oBAAoB,GAAgD;IAC/E,IAAI,EAAE,wBAAwB;IAC9B,WAAW,EACT,kCAAkC;IACpC,UAAU,EAAE,0BAA0B;IACtC,MAAM,EAAE,sBAAsB;CAC/B,CAAC;AAEF,gCAAgC;AAEhC,MAAM,CAAC,MAAM,4BAA4B,GAAG,IAAI,CAAC,MAAM,CAAC;IACtD,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;CACpD,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,sBAAsB,GAAkD;IACnF,IAAI,EAAE,0BAA0B;IAChC,WAAW,EAAE,4BAA4B;IACzC,UAAU,EAAE,4BAA4B;IACxC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;CACzC,CAAC"}

package/dist/server/documents/graph/tools/extract-knowledge-points.tool.js

@@ -0,0 +1,45 @@
+/**
+ * Tool：提交提取到的知识要点。
+ *
+ * 用在 extractDocNodes 链路：
+ * AI 读完文章后调用这个 tool，把提取到的知识要点作为参数提交。
+ */
+import { Type } from '@earendil-works/pi-ai';
+import { z } from 'zod';
+// TypeBox schema（发给 API 用）
+export const extractKnowledgePointsParameters = Type.Object({
+    nodes: Type.Array(Type.Object({
+        label: Type.String({ description: '要点标题，简洁明了' }),
+        definition: Type.Optional(Type.String({ description: '如果是概念定义，填写准确定义' })),
+        description: Type.String({ description: '要点的完整描述' }),
+        confidence: Type.Number({ description: '提取的置信度，0-1' }),
+        heading: Type.Optional(Type.String({ description: '对应文章中的小标题，如果有的话' })),
+    }), { description: '知识要点列表' }),
+});
+// Zod schema（运行时校验 + 类型推断用）
+export const extractKnowledgePointsSchema = z.object({
+    nodes: z.array(z.object({
+        label: z.string().min(1),
+        definition: z.string().optional(),
+        description: z.string().min(1),
+        confidence: z.number().min(0).max(1),
+        heading: z.string().optional(),
+    })),
+});
+export const extractKnowledgePointsTool = {
+    name: 'submitKnowledgePoints',
+    description: '提交从文章中提取的知识要点列表。分析完文章后调用此工具提交结果。',
+    parameters: extractKnowledgePointsParameters,
+    schema: extractKnowledgePointsSchema,
+};
+// ========== 降级 tool ==========
+export const noKnowledgePointsParameters = Type.Object({
+    reason: Type.String({ description: '无法提取知识要点的原因' }),
+});
+export const noKnowledgePointsTool = {
+    name: 'submitNoKnowledgePoints',
+    description: '当文章内容太少或无法提取有效知识要点时，调用此工具说明原因。',
+    parameters: noKnowledgePointsParameters,
+    schema: z.object({ reason: z.string() }),
+};
+//# sourceMappingURL=extract-knowledge-points.tool.js.map

package/dist/server/documents/graph/tools/extract-knowledge-points.tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extract-knowledge-points.tool.js","sourceRoot":"","sources":["../../../../../src/server/documents/graph/tools/extract-knowledge-points.tool.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,IAAI,EAAe,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,2BAA2B;AAC3B,MAAM,CAAC,MAAM,gCAAgC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1D,KAAK,EAAE,IAAI,CAAC,KAAK,CACf,IAAI,CAAC,MAAM,CAAC;QACV,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC;QAChD,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACzE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;QACpD,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC;QACtD,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,iBAAiB,EAAE,CAAC,CAAC;KACxE,CAAC,EACF,EAAE,WAAW,EAAE,QAAQ,EAAE,CAC1B;CACF,CAAC,CAAC;AAEH,4BAA4B;AAC5B,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC,MAAM,CAAC;IACnD,KAAK,EAAE,CAAC,CAAC,KAAK,CACZ,CAAC,CAAC,MAAM,CAAC;QACP,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QACjC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KAC/B,CAAC,CACH;CACF,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,0BAA0B,GAAsD;IAC3F,IAAI,EAAE,uBAAuB;IAC7B,WAAW,EAAE,kCAAkC;IAC/C,UAAU,EAAE,gCAAgC;IAC5C,MAAM,EAAE,4BAA4B;CACrC,CAAC;AAEF,gCAAgC;AAEhC,MAAM,CAAC,MAAM,2BAA2B,GAAG,IAAI,CAAC,MAAM,CAAC;IACrD,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;CACpD,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,qBAAqB,GAAiD;IACjF,IAAI,EAAE,yBAAyB;IAC/B,WAAW,EAAE,gCAAgC;IAC7C,UAAU,EAAE,2BAA2B;IACvC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;CACzC,CAAC"}

package/dist/server/documents/graph/tools/generate-contains.tool.js

@@ -0,0 +1,41 @@
+/**
+ * Tool：提交生成的 contains 关系。
+ *
+ * 用在 generateContains 链路：
+ * AI 分析完所有节点后调用这个 tool，把判断出的 contains 关系作为参数提交。
+ */
+import { Type } from '@earendil-works/pi-ai';
+import { z } from 'zod';
+// TypeBox schema（发给 API 用）
+export const generateContainsParameters = Type.Object({
+    relations: Type.Array(Type.Object({
+        fromId: Type.String({ description: '上层（更抽象）节点的 id' }),
+        toId: Type.String({ description: '下层（更具体）节点的 id' }),
+        confidence: Type.Number({ description: '关系的置信度，0-1' }),
+    }), { description: '包含关系列表' }),
+});
+// Zod schema（运行时校验 + 类型推断用）
+export const generateContainsSchema = z.object({
+    relations: z.array(z.object({
+        fromId: z.string().min(1),
+        toId: z.string().min(1),
+        confidence: z.number().min(0).max(1),
+    })),
+});
+export const generateContainsTool = {
+    name: 'submitContainsRelations',
+    description: '提交节点之间的 contains 包含关系列表。分析完成后调用此工具提交结果。',
+    parameters: generateContainsParameters,
+    schema: generateContainsSchema,
+};
+// ========== 降级 tool ==========
+export const noContainsRelationsParameters = Type.Object({
+    reason: Type.String({ description: '无法生成包含关系的原因' }),
+});
+export const noContainsRelationsTool = {
+    name: 'submitNoContainsRelations',
+    description: '当节点太少或无法判断有效包含关系时，调用此工具说明原因。',
+    parameters: noContainsRelationsParameters,
+    schema: z.object({ reason: z.string() }),
+};
+//# sourceMappingURL=generate-contains.tool.js.map

package/dist/server/documents/graph/tools/generate-contains.tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate-contains.tool.js","sourceRoot":"","sources":["../../../../../src/server/documents/graph/tools/generate-contains.tool.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,IAAI,EAAe,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,2BAA2B;AAC3B,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC,MAAM,CAAC;IACpD,SAAS,EAAE,IAAI,CAAC,KAAK,CACnB,IAAI,CAAC,MAAM,CAAC;QACV,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;QACrD,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;QACnD,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC;KACvD,CAAC,EACF,EAAE,WAAW,EAAE,QAAQ,EAAE,CAC1B;CACF,CAAC,CAAC;AAEH,4BAA4B;AAC5B,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,SAAS,EAAE,CAAC,CAAC,KAAK,CAChB,CAAC,CAAC,MAAM,CAAC;QACP,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACrC,CAAC,CACH;CACF,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,oBAAoB,GAAgD;IAC/E,IAAI,EAAE,yBAAyB;IAC/B,WAAW,EAAE,yCAAyC;IACtD,UAAU,EAAE,0BAA0B;IACtC,MAAM,EAAE,sBAAsB;CAC/B,CAAC;AAEF,gCAAgC;AAEhC,MAAM,CAAC,MAAM,6BAA6B,GAAG,IAAI,CAAC,MAAM,CAAC;IACvD,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;CACpD,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,uBAAuB,GAAmD;IACrF,IAAI,EAAE,2BAA2B;IACjC,WAAW,EAAE,8BAA8B;IAC3C,UAAU,EAAE,6BAA6B;IACzC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;CACzC,CAAC"}

package/dist/server/documents/graph/tools/induce-concepts.tool.js

@@ -0,0 +1,43 @@
+/**
+ * Tool：提交归纳出的上层概念。
+ *
+ * 用在 induceConceptNodes 链路：
+ * AI 读完所有 doc 节点后调用这个 tool，把归纳出的上层概念作为参数提交。
+ */
+import { Type } from '@earendil-works/pi-ai';
+import { z } from 'zod';
+// TypeBox schema（发给 API 用）
+export const induceConceptsParameters = Type.Object({
+    concepts: Type.Array(Type.Object({
+        label: Type.String({ description: '概念名称' }),
+        definition: Type.Optional(Type.String({ description: '如果有准确定义，填写此字段' })),
+        description: Type.String({ description: '概念的完整描述' }),
+        confidence: Type.Number({ description: '归纳的置信度，0-1' }),
+    }), { description: '上层概念列表' }),
+});
+// Zod schema（运行时校验 + 类型推断用）
+export const induceConceptsSchema = z.object({
+    concepts: z.array(z.object({
+        label: z.string().min(1),
+        definition: z.string().optional(),
+        description: z.string().min(1),
+        confidence: z.number().min(0).max(1),
+    })),
+});
+export const induceConceptsTool = {
+    name: 'submitInducedConcepts',
+    description: '提交从知识节点中归纳出的上层概念列表。分析完成后调用此工具提交结果。',
+    parameters: induceConceptsParameters,
+    schema: induceConceptsSchema,
+};
+// ========== 降级 tool ==========
+export const noConceptsParameters = Type.Object({
+    reason: Type.String({ description: '无法归纳上层概念的原因' }),
+});
+export const noConceptsTool = {
+    name: 'submitNoConcepts',
+    description: '当节点太少或无法归纳出有效上层概念时，调用此工具说明原因。',
+    parameters: noConceptsParameters,
+    schema: z.object({ reason: z.string() }),
+};
+//# sourceMappingURL=induce-concepts.tool.js.map

package/dist/server/documents/graph/tools/induce-concepts.tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"induce-concepts.tool.js","sourceRoot":"","sources":["../../../../../src/server/documents/graph/tools/induce-concepts.tool.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,IAAI,EAAe,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,2BAA2B;AAC3B,MAAM,CAAC,MAAM,wBAAwB,GAAG,IAAI,CAAC,MAAM,CAAC;IAClD,QAAQ,EAAE,IAAI,CAAC,KAAK,CAClB,IAAI,CAAC,MAAM,CAAC;QACV,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;QAC3C,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC,CAAC;QACxE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;QACpD,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC;KACvD,CAAC,EACF,EAAE,WAAW,EAAE,QAAQ,EAAE,CAC1B;CACF,CAAC,CAAC;AAEH,4BAA4B;AAC5B,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,QAAQ,EAAE,CAAC,CAAC,KAAK,CACf,CAAC,CAAC,MAAM,CAAC;QACP,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QACjC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACrC,CAAC,CACH;CACF,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,kBAAkB,GAA8C;IAC3E,IAAI,EAAE,uBAAuB;IAC7B,WAAW,EAAE,oCAAoC;IACjD,UAAU,EAAE,wBAAwB;IACpC,MAAM,EAAE,oBAAoB;CAC7B,CAAC;AAEF,gCAAgC;AAEhC,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAAC;IAC9C,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;CACpD,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,cAAc,GAA0C;IACnE,IAAI,EAAE,kBAAkB;IACxB,WAAW,EAAE,+BAA+B;IAC5C,UAAU,EAAE,oBAAoB;IAChC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;CACzC,CAAC"}

package/dist/server/documents/graph/types.js

@@ -0,0 +1,12 @@
+/**
+ * 知识图谱核心类型定义。
+ *
+ * 节点分两类（都是知识节点，只是来源不同）：
+ * - doc: 从单篇文章直接提取的知识块，带 sources（记录来源文章）
+ * - concept: 从已有节点中归纳抽象出的概念，不带 sources
+ *
+ * 边：
+ * - contains：上层包含下层（抽象 → 具体），concept 可以包含 doc 或更具体的 concept
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/server/documents/graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/server/documents/graph/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG"}

package/dist/server/documents/graph/utils.js

@@ -0,0 +1,41 @@
+/**
+ * 图谱工具函数：id 生成、slug 归一化等纯逻辑。
+ */
+/**
+ * 将 label 归一化为 slug。
+ * - 去首尾空格
+ * - 转小写（只转英文字母）
+ * - 中文/英文/数字保留
+ * - 其他字符替换为 -，连续 - 合并
+ */
+export function slugify(label) {
+    return label
+        .trim()
+        .replace(/\s+/g, '-')
+        .replace(/[^a-zA-Z0-9\u4e00-\u9fa5-]/g, '-')
+        .replace(/-+/g, '-')
+        .replace(/^-+|-+$/g, '')
+        .toLowerCase();
+}
+/** 生成节点 id（末尾带 4 位随机数，保证唯一） */
+export function makeNodeId(type, label) {
+    const rand = Math.floor(Math.random() * 10000).toString().padStart(4, '0');
+    return `${type}:${slugify(label)}-${rand}`;
+}
+/** 增量判断：当前 commit 与缓存的 commit 不同就需要重建 */
+export function needRebuild(currentCommitId, cachedCommitId) {
+    if (!cachedCommitId)
+        return true;
+    return currentCommitId !== cachedCommitId;
+}
+/**
+ * 找出所有「入度为 0」的节点（没有被任何边指向的节点）。
+ *
+ * 用于自底向上构建时：每层只把顶层节点（入度为 0）喂给 AI 归纳 concept / 生成 contains，
+ * 下层已经有父节点的节点不参与本层归纳，避免重复处理。
+ */
+export function findRootNodes(nodes, edges) {
+    const nonRootIds = new Set(edges.map((e) => e.to));
+    return nodes.filter((n) => !nonRootIds.has(n.id));
+}
+//# sourceMappingURL=utils.js.map

package/dist/server/documents/graph/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../../src/server/documents/graph/utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa;IACnC,OAAO,KAAK;SACT,IAAI,EAAE;SACN,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,OAAO,CAAC,6BAA6B,EAAE,GAAG,CAAC;SAC3C,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;SACnB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,WAAW,EAAE,CAAC;AACnB,CAAC;AAED,+BAA+B;AAC/B,MAAM,UAAU,UAAU,CAAC,IAAuB,EAAE,KAAa;IAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC3E,OAAO,GAAG,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;AAC7C,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,WAAW,CAAC,eAAuB,EAAE,cAAuB;IAC1E,IAAI,CAAC,cAAc;QAAE,OAAO,IAAI,CAAC;IACjC,OAAO,eAAe,KAAK,cAAc,CAAC;AAC5C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAU,EACV,KAA4B;IAE5B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,CAAC"}