@incremark/core 0.3.1 → 0.3.3

package/dist/{types-N1b99kYB.d.ts → types-B7GTGJc2.d.ts}

@@ -31,8 +31,9 @@ interface IAstBuilder {
     parse(text: string): Root;
     /**
      * 将 AST 节点转换为 ParsedBlock
+     * @param generateBlockId - 接收 block 的 startOffset 参数，用于生成稳定的 id
      */
-    nodesToBlocks(nodes: RootContent[], startOffset: number, rawText: string, status: BlockStatus, generateBlockId: () => string): ParsedBlock[];
+    nodesToBlocks(nodes: RootContent[], startOffset: number, rawText: string, status: BlockStatus, generateBlockId: (startOffset: number) => string): ParsedBlock[];
     /**
      * 更新配置选项（动态更新，不需要重建实例）
      * @param options 部分配置选项

package/dist/utils/index.d.ts

@@ -23,6 +23,13 @@ declare function splitLines(text: string): string[];
 declare function joinLines(lines: string[], start: number, end: number): string;
 declare function isDefinitionNode(node: RootContent): node is Definition;
 declare function isFootnoteDefinitionNode(node: RootContent): node is FootnoteDefinition;
+/**
+ * 从 AST 节点中收集脚注引用标识符
+ *
+ * @param node 起始节点
+ * @returns 脚注引用标识符列表（按出现顺序，去重）
+ */
+declare function collectFootnoteReferences(node: RootContent): string[];
 /**
  * AST 节点遍历器
  * 深度优先遍历 AST 节点
@@ -40,4 +47,4 @@ declare function traverseAst(node: RootContent, visitor: (node: RootContent) =>
  */
 declare function collectAstNodes<T extends RootContent>(node: RootContent, predicate: (node: RootContent) => node is T): T[];
 
-export { calculateLineOffset, collectAstNodes, generateId, isDefinitionNode, isFootnoteDefinitionNode, joinLines, resetIdCounter, splitLines, traverseAst };
+export { calculateLineOffset, collectAstNodes, collectFootnoteReferences, generateId, isDefinitionNode, isFootnoteDefinitionNode, joinLines, resetIdCounter, splitLines, traverseAst };

package/dist/utils/index.js

@@ -25,6 +25,20 @@ function isDefinitionNode(node) {
 function isFootnoteDefinitionNode(node) {
   return node.type === "footnoteDefinition";
 }
+function collectFootnoteReferences(node) {
+  const references = [];
+  const seen = /* @__PURE__ */ new Set();
+  traverseAst(node, (n) => {
+    if (n.type === "footnoteReference" && "identifier" in n) {
+      const identifier = n.identifier;
+      if (!seen.has(identifier)) {
+        seen.add(identifier);
+        references.push(identifier);
+      }
+    }
+  });
+  return references;
+}
 function traverseAst(node, visitor) {
   const stopEarly = visitor(node);
   if (stopEarly === true) {
@@ -46,6 +60,6 @@ function collectAstNodes(node, predicate) {
   return results;
 }
 
-export { calculateLineOffset, collectAstNodes, generateId, isDefinitionNode, isFootnoteDefinitionNode, joinLines, resetIdCounter, splitLines, traverseAst };
+export { calculateLineOffset, collectAstNodes, collectFootnoteReferences, generateId, isDefinitionNode, isFootnoteDefinitionNode, joinLines, resetIdCounter, splitLines, traverseAst };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/utils/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/index.ts"],"names":["node"],"mappings":";AASA,IAAI,SAAA,GAAY,CAAA;AACT,SAAS,UAAA,CAAW,SAAS,OAAA,EAAiB;AACnD,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,EAAE,SAAS,CAAA,CAAA;AACjC;AAKO,SAAS,cAAA,GAAuB;AACrC,EAAA,SAAA,GAAY,CAAA;AACd;AAKO,SAAS,mBAAA,CAAoB,OAAiB,SAAA,EAA2B;AAC9E,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,aAAa,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACtD,IAAA,MAAA,IAAU,KAAA,CAAM,CAAC,CAAA,CAAE,MAAA,GAAS,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,WAAW,IAAA,EAAwB;AACjD,EAAA,OAAO,IAAA,CAAK,MAAM,IAAI,CAAA;AACxB;AAKO,SAAS,SAAA,CAAU,KAAA,EAAiB,KAAA,EAAe,GAAA,EAAqB;AAC7E,EAAA,OAAO,MAAM,KAAA,CAAM,KAAA,EAAO,MAAM,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AAC9C;AAEO,SAAS,iBAAiB,IAAA,EAAuC;AACtE,EAAA,OAAO,KAAK,IAAA,KAAS,YAAA;AACvB;AAEO,SAAS,yBAAyB,IAAA,EAA+C;AACtF,EAAA,OAAO,KAAK,IAAA,KAAS,oBAAA;AACvB;AASO,SAAS,WAAA,CACd,MACA,OAAA,EACM;AAEN,EAAA,MAAM,SAAA,GAAY,QAAQ,IAAI,CAAA;AAC9B,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA;AAAA,EACF;AAGA,EAAA,IAAI,cAAc,IAAA,IAAQ,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,QAAQ,CAAA,EAAG;AACtD,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,QAAA,EAAU;AACjC,MAAA,WAAA,CAAY,OAAsB,OAAO,CAAA;AAAA,IAC3C;AAAA,EACF;AACF;AASO,SAAS,eAAA,CACd,MACA,SAAA,EACK;AACL,EAAA,MAAM,UAAe,EAAC;AAEtB,EAAA,WAAA,CAAY,IAAA,EAAM,CAACA,KAAAA,KAAS;AAC1B,IAAA,IAAI,SAAA,CAAUA,KAAI,CAAA,EAAG;AACnB,MAAA,OAAA,CAAQ,KAAKA,KAAI,CAAA;AAAA,IACnB;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,OAAA;AACT","file":"index.js","sourcesContent":["/**\n * 工具函数\n */\n\nimport type { Definition, FootnoteDefinition, RootContent } from \"mdast\"\n\n/**\n * 生成唯一 ID\n */\nlet idCounter = 0\nexport function generateId(prefix = 'block'): string {\n  return `${prefix}-${++idCounter}`\n}\n\n/**\n * 重置 ID 计数器（用于测试）\n */\nexport function resetIdCounter(): void {\n  idCounter = 0\n}\n\n/**\n * 计算行的偏移量\n */\nexport function calculateLineOffset(lines: string[], lineIndex: number): number {\n  let offset = 0\n  for (let i = 0; i < lineIndex && i < lines.length; i++) {\n    offset += lines[i].length + 1 // +1 for newline\n  }\n  return offset\n}\n\n/**\n * 将文本按行分割\n */\nexport function splitLines(text: string): string[] {\n  return text.split('\\n')\n}\n\n/**\n * 合并行为文本\n */\nexport function joinLines(lines: string[], start: number, end: number): string {\n  return lines.slice(start, end + 1).join('\\n')\n}\n\nexport function isDefinitionNode(node: RootContent): node is Definition {\n  return node.type === 'definition'\n}\n\nexport function isFootnoteDefinitionNode(node: RootContent): node is FootnoteDefinition {\n  return node.type === 'footnoteDefinition'\n}\n\n/**\n * AST 节点遍历器\n * 深度优先遍历 AST 节点\n *\n * @param node 起始节点\n * @param visitor 访问者函数，返回 true 可以提前终止遍历\n */\nexport function traverseAst(\n  node: RootContent,\n  visitor: (node: RootContent) => boolean | void\n): void {\n  // 访问当前节点\n  const stopEarly = visitor(node)\n  if (stopEarly === true) {\n    return\n  }\n\n  // 递归遍历子节点\n  if ('children' in node && Array.isArray(node.children)) {\n    for (const child of node.children) {\n      traverseAst(child as RootContent, visitor)\n    }\n  }\n}\n\n/**\n * 从 AST 节点中收集指定类型的节点\n *\n * @param node 起始节点\n * @param predicate 匹配谓词\n * @returns 匹配的节点列表\n */\nexport function collectAstNodes<T extends RootContent>(\n  node: RootContent,\n  predicate: (node: RootContent) => node is T\n): T[] {\n  const results: T[] = []\n\n  traverseAst(node, (node) => {\n    if (predicate(node)) {\n      results.push(node)\n    }\n  })\n\n  return results\n}"]}
+{"version":3,"sources":["../../src/utils/index.ts"],"names":["node"],"mappings":";AASA,IAAI,SAAA,GAAY,CAAA;AACT,SAAS,UAAA,CAAW,SAAS,OAAA,EAAiB;AACnD,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,EAAE,SAAS,CAAA,CAAA;AACjC;AAKO,SAAS,cAAA,GAAuB;AACrC,EAAA,SAAA,GAAY,CAAA;AACd;AAKO,SAAS,mBAAA,CAAoB,OAAiB,SAAA,EAA2B;AAC9E,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,aAAa,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACtD,IAAA,MAAA,IAAU,KAAA,CAAM,CAAC,CAAA,CAAE,MAAA,GAAS,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,WAAW,IAAA,EAAwB;AACjD,EAAA,OAAO,IAAA,CAAK,MAAM,IAAI,CAAA;AACxB;AAKO,SAAS,SAAA,CAAU,KAAA,EAAiB,KAAA,EAAe,GAAA,EAAqB;AAC7E,EAAA,OAAO,MAAM,KAAA,CAAM,KAAA,EAAO,MAAM,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AAC9C;AAEO,SAAS,iBAAiB,IAAA,EAAuC;AACtE,EAAA,OAAO,KAAK,IAAA,KAAS,YAAA;AACvB;AAEO,SAAS,yBAAyB,IAAA,EAA+C;AACtF,EAAA,OAAO,KAAK,IAAA,KAAS,oBAAA;AACvB;AAQO,SAAS,0BAA0B,IAAA,EAA6B;AACrE,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAE7B,EAAA,WAAA,CAAY,IAAA,EAAM,CAAC,CAAA,KAAM;AACvB,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,mBAAA,IAAuB,YAAA,IAAgB,CAAA,EAAG;AACvD,MAAA,MAAM,aAAa,CAAA,CAAE,UAAA;AACrB,MAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,UAAU,CAAA,EAAG;AACzB,QAAA,IAAA,CAAK,IAAI,UAAU,CAAA;AACnB,QAAA,UAAA,CAAW,KAAK,UAAU,CAAA;AAAA,MAC5B;AAAA,IACF;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,UAAA;AACT;AASO,SAAS,WAAA,CACd,MACA,OAAA,EACM;AAEN,EAAA,MAAM,SAAA,GAAY,QAAQ,IAAI,CAAA;AAC9B,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA;AAAA,EACF;AAGA,EAAA,IAAI,cAAc,IAAA,IAAQ,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,QAAQ,CAAA,EAAG;AACtD,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,QAAA,EAAU;AACjC,MAAA,WAAA,CAAY,OAAsB,OAAO,CAAA;AAAA,IAC3C;AAAA,EACF;AACF;AASO,SAAS,eAAA,CACd,MACA,SAAA,EACK;AACL,EAAA,MAAM,UAAe,EAAC;AAEtB,EAAA,WAAA,CAAY,IAAA,EAAM,CAACA,KAAAA,KAAS;AAC1B,IAAA,IAAI,SAAA,CAAUA,KAAI,CAAA,EAAG;AACnB,MAAA,OAAA,CAAQ,KAAKA,KAAI,CAAA;AAAA,IACnB;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,OAAA;AACT","file":"index.js","sourcesContent":["/**\n * 工具函数\n */\n\nimport type { Definition, FootnoteDefinition, RootContent } from \"mdast\"\n\n/**\n * 生成唯一 ID\n */\nlet idCounter = 0\nexport function generateId(prefix = 'block'): string {\n  return `${prefix}-${++idCounter}`\n}\n\n/**\n * 重置 ID 计数器（用于测试）\n */\nexport function resetIdCounter(): void {\n  idCounter = 0\n}\n\n/**\n * 计算行的偏移量\n */\nexport function calculateLineOffset(lines: string[], lineIndex: number): number {\n  let offset = 0\n  for (let i = 0; i < lineIndex && i < lines.length; i++) {\n    offset += lines[i].length + 1 // +1 for newline\n  }\n  return offset\n}\n\n/**\n * 将文本按行分割\n */\nexport function splitLines(text: string): string[] {\n  return text.split('\\n')\n}\n\n/**\n * 合并行为文本\n */\nexport function joinLines(lines: string[], start: number, end: number): string {\n  return lines.slice(start, end + 1).join('\\n')\n}\n\nexport function isDefinitionNode(node: RootContent): node is Definition {\n  return node.type === 'definition'\n}\n\nexport function isFootnoteDefinitionNode(node: RootContent): node is FootnoteDefinition {\n  return node.type === 'footnoteDefinition'\n}\n\n/**\n * 从 AST 节点中收集脚注引用标识符\n *\n * @param node 起始节点\n * @returns 脚注引用标识符列表（按出现顺序，去重）\n */\nexport function collectFootnoteReferences(node: RootContent): string[] {\n  const references: string[] = []\n  const seen = new Set<string>()\n\n  traverseAst(node, (n) => {\n    if (n.type === 'footnoteReference' && 'identifier' in n) {\n      const identifier = n.identifier as string\n      if (!seen.has(identifier)) {\n        seen.add(identifier)\n        references.push(identifier)\n      }\n    }\n  })\n\n  return references\n}\n\n/**\n * AST 节点遍历器\n * 深度优先遍历 AST 节点\n *\n * @param node 起始节点\n * @param visitor 访问者函数，返回 true 可以提前终止遍历\n */\nexport function traverseAst(\n  node: RootContent,\n  visitor: (node: RootContent) => boolean | void\n): void {\n  // 访问当前节点\n  const stopEarly = visitor(node)\n  if (stopEarly === true) {\n    return\n  }\n\n  // 递归遍历子节点\n  if ('children' in node && Array.isArray(node.children)) {\n    for (const child of node.children) {\n      traverseAst(child as RootContent, visitor)\n    }\n  }\n}\n\n/**\n * 从 AST 节点中收集指定类型的节点\n *\n * @param node 起始节点\n * @param predicate 匹配谓词\n * @returns 匹配的节点列表\n */\nexport function collectAstNodes<T extends RootContent>(\n  node: RootContent,\n  predicate: (node: RootContent) => node is T\n): T[] {\n  const results: T[] = []\n\n  traverseAst(node, (node) => {\n    if (predicate(node)) {\n      results.push(node)\n    }\n  })\n\n  return results\n}"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@incremark/core",
-  "version": "0.3.1",
+  "version": "0.3.3",
   "description": "High-performance incremental markdown parser specifically designed for AI streaming output scenarios.",
   "type": "module",
   "main": "./dist/index.js",