@sledorze/cairn 0.1.0

package/dist/core/MarkdownLinks.bench.js

@@ -0,0 +1,81 @@
+import { bench, describe } from 'vitest';
+import { buildBasenameIndex, checkContent, extractLinkDefinitions, extractLinks, stripCode } from "./MarkdownLinks.js";
+const makeDoc = (linkCount) => {
+    const lines = [];
+    for (let i = 0; i < linkCount; i++) {
+        const kind = i % 5;
+        if (kind === 0) {
+            lines.push(`See [section ${i}](#heading-${i}) for details.`);
+        }
+        else if (kind === 1) {
+            lines.push(`External ref [site ${i}](https://example.com/page/${i}) for more.`);
+        }
+        else if (kind === 2) {
+            lines.push(`Broken link [doc ${i}](../missing/dir-${i}/file-${i}.md) here.`);
+        }
+        else if (kind === 3) {
+            lines.push(`Reference style [label-${i}][ref-${i}] appears here.`, `[ref-${i}]: ../ref-target/dir-${i}/file-${i}.md`);
+        }
+        else {
+            lines.push('```md', `[in code](../should-be-ignored/${i}.md)`, '```', `Valid link [good ${i}](../real/dir-${i}/file-${i}.md).`);
+        }
+    }
+    return lines.join('\n');
+};
+const makeAbsPaths = (count) => {
+    const paths = [];
+    for (let i = 0; i < count; i++) {
+        paths.push(`/repo/docs/dir-${i % 50}/file-${i}.md`);
+    }
+    return paths;
+};
+const smallDoc = makeDoc(20);
+const largeDoc = makeDoc(500);
+const fewPaths = makeAbsPaths(300);
+const manyPaths = makeAbsPaths(3000);
+const manyPathsIndex = buildBasenameIndex(manyPaths);
+const existsAbs = (abs) => abs.includes('/real/');
+describe('stripCode()', () => {
+    bench('20 links', () => {
+        stripCode(smallDoc);
+    });
+    bench('500 links', () => {
+        stripCode(largeDoc);
+    });
+});
+describe('extractLinks()', () => {
+    bench('20 links', () => {
+        extractLinks(smallDoc);
+    });
+    bench('500 links', () => {
+        extractLinks(largeDoc);
+    });
+});
+describe('extractLinkDefinitions()', () => {
+    bench('20 links', () => {
+        extractLinkDefinitions(smallDoc);
+    });
+    bench('500 links', () => {
+        extractLinkDefinitions(largeDoc);
+    });
+});
+describe('buildBasenameIndex()', () => {
+    bench('300 paths', () => {
+        buildBasenameIndex(fewPaths);
+    });
+    bench('3000 paths', () => {
+        buildBasenameIndex(manyPaths);
+    });
+});
+describe('checkContent()', () => {
+    bench('20 links, no index', () => {
+        checkContent({ content: smallDoc, existsAbs, fileAbs: '/repo/docs/dir-0/file.md' });
+    });
+    bench('500 links, no index', () => {
+        checkContent({ content: largeDoc, existsAbs, fileAbs: '/repo/docs/dir-0/file.md' });
+    });
+    bench('500 links, with 3000-path index', () => {
+        checkContent({ content: largeDoc, existsAbs, fileAbs: '/repo/docs/dir-0/file.md', index: manyPathsIndex });
+    });
+});
+//# sourceMappingURL=MarkdownLinks.bench.js.map

package/dist/core/MarkdownLinks.bench.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MarkdownLinks.bench.js","sourceRoot":"","sources":["../../src/core/MarkdownLinks.bench.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAA;AAExC,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,sBAAsB,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAEtH,MAAM,OAAO,GAAG,CAAC,SAAiB,EAAU,EAAE;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;QAClB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,gBAAgB,CAAC,CAAA;QAC9D,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,8BAA8B,CAAC,aAAa,CAAC,CAAA;QACjF,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,oBAAoB,CAAC,SAAS,CAAC,YAAY,CAAC,CAAA;QAC9E,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CACR,0BAA0B,CAAC,SAAS,CAAC,iBAAiB,EACtD,QAAQ,CAAC,wBAAwB,CAAC,SAAS,CAAC,KAAK,CAClD,CAAA;QACH,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CACR,OAAO,EACP,kCAAkC,CAAC,MAAM,EACzC,KAAK,EACL,oBAAoB,CAAC,iBAAiB,CAAC,SAAS,CAAC,OAAO,CACzD,CAAA;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC,CAAA;AAED,MAAM,YAAY,GAAG,CAAC,KAAa,EAAY,EAAE;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;AAC5B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAA;AAE7B,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAA;AAClC,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;AACpC,MAAM,cAAc,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAA;AAEpD,MAAM,SAAS,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;AAElE,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACrB,SAAS,CAAC,QAAQ,CAAC,CAAA;IACrB,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE;QACtB,SAAS,CAAC,QAAQ,CAAC,CAAA;IACrB,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACrB,YAAY,CAAC,QAAQ,CAAC,CAAA;IACxB,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE;QACtB,YAAY,CAAC,QAAQ,CAAC,CAAA;IACxB,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACrB,sBAAsB,CAAC,QAAQ,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE;QACtB,sBAAsB,CAAC,QAAQ,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE;QACtB,kBAAkB,CAAC,QAAQ,CAAC,CAAA;IAC9B,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,YAAY,EAAE,GAAG,EAAE;QACvB,kBAAkB,CAAC,SAAS,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,KAAK,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC/B,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,0BAA0B,EAAE,CAAC,CAAA;IACrF,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAChC,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,0BAA0B,EAAE,CAAC,CAAA;IACrF,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC5C,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,0BAA0B,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAA;IAC5G,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/core/MarkdownLinks.d.ts

@@ -0,0 +1,51 @@
+export interface MarkdownLink {
+    readonly target: string;
+    readonly text: string;
+}
+export interface MarkdownLinkDef {
+    readonly label: string;
+    readonly target: string;
+}
+export interface BrokenLink {
+    readonly suggestion?: string;
+    readonly target: string;
+    readonly text: string;
+}
+export interface SuggestFixArgs {
+    readonly fromDir: string;
+    readonly index: ReadonlyMap<string, readonly string[]>;
+    readonly target: string;
+}
+export interface CheckContentArgs {
+    readonly content: string;
+    readonly existsAbs: (absPath: string) => boolean;
+    readonly fileAbs: string;
+    readonly index?: ReadonlyMap<string, readonly string[]>;
+}
+/**
+ * Blank out fenced (``` / ~~~) and inline (`code`) spans so links that only
+ * appear inside code examples are NOT treated as real links. Newlines are kept
+ * so line-based reasoning is unaffected; other characters become spaces.
+ */
+export declare const stripCode: (content: string) => string;
+/** Extract inline Markdown links/images as `{ target, text }`. */
+export declare const extractLinks: (content: string) => MarkdownLink[];
+/** Extract reference-style link definitions (`[label]: ./path "title"`). */
+export declare const extractLinkDefinitions: (content: string) => MarkdownLinkDef[];
+/** True only for relative paths we can resolve on disk. */
+export declare const isCheckableTarget: (target: string) => boolean;
+/** Drop `#anchor` and `?query` from a target. */
+export declare const stripAnchor: (target: string) => string;
+/** Map basename -> list of absolute paths, for ambiguity-aware fixing. */
+export declare const buildBasenameIndex: (absPaths: readonly string[]) => Map<string, string[]>;
+/**
+ * Suggest a repaired relative path for a broken target. Returns a path only
+ * when exactly one indexed file matches the basename (no ambiguity); else null.
+ */
+export declare const suggestFix: ({ fromDir, index, target }: SuggestFixArgs) => string | null;
+/**
+ * Check one file's content for broken relative links. Returns the broken ones,
+ * each with an optional `suggestion` when an `index` is supplied.
+ */
+export declare const checkContent: ({ content, existsAbs, fileAbs, index }: CheckContentArgs) => BrokenLink[];
+//# sourceMappingURL=MarkdownLinks.d.ts.map

package/dist/core/MarkdownLinks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MarkdownLinks.d.ts","sourceRoot":"","sources":["../../src/core/MarkdownLinks.ts"],"names":[],"mappings":"AAUA,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAA;IACtD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,CAAA;IAChD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAA;CACxD;AAMD;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,KAAG,MAGwB,CAAA;AAIpE,kEAAkE;AAClE,eAAO,MAAM,YAAY,GAAI,SAAS,MAAM,KAAG,YAAY,EAM1D,CAAA;AAED,4EAA4E;AAC5E,eAAO,MAAM,sBAAsB,GAAI,SAAS,MAAM,KAAG,eAAe,EAMvE,CAAA;AAED,2DAA2D;AAC3D,eAAO,MAAM,iBAAiB,GAAI,QAAQ,MAAM,KAAG,OAclD,CAAA;AAED,iDAAiD;AACjD,eAAO,MAAM,WAAW,GAAI,QAAQ,MAAM,KAAG,MAAuC,CAAA;AAEpF,0EAA0E;AAC1E,eAAO,MAAM,kBAAkB,GAAI,UAAU,SAAS,MAAM,EAAE,KAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAYpF,CAAA;AAOD;;;GAGG;AACH,eAAO,MAAM,UAAU,GAAI,4BAA4B,cAAc,KAAG,MAAM,GAAG,IAOhF,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,YAAY,GAAI,wCAAwC,gBAAgB,KAAG,UAAU,EA2BjG,CAAA"}

package/dist/core/MarkdownLinks.js

@@ -0,0 +1,115 @@
+// Pure, IO-free helpers to find and auto-repair relative Markdown links.
+// All functions here are deterministic and unit-tested in MarkdownLinks.unit.test.ts.
+// The Effect program that touches the filesystem lives in ../program/CheckLinks.ts.
+import * as nodePath from 'node:path';
+// Reason in POSIX so link resolution is identical on every OS (inputs are
+// normalised to `/` at the IO boundary).
+const path = nodePath.posix;
+const LINK_RE = /!?\[([^\]]*)\]\(([^)\s]+)(?:\s+"[^"]*")?\)/g;
+const FENCED_CODE_RE = /(^|\n)[ \t]*(```|~~~)[\s\S]*?\n[ \t]*\2[ \t]*(?=\n|$)/g;
+const INLINE_CODE_RE = /`[^`\n]*`/g;
+/**
+ * Blank out fenced (``` / ~~~) and inline (`code`) spans so links that only
+ * appear inside code examples are NOT treated as real links. Newlines are kept
+ * so line-based reasoning is unaffected; other characters become spaces.
+ */
+export const stripCode = (content) => content
+    .replaceAll(FENCED_CODE_RE, (block) => block.replaceAll(/[^\n]/g, ' '))
+    .replaceAll(INLINE_CODE_RE, (block) => ' '.repeat(block.length));
+const LINK_DEF_RE = /^[ \t]*\[([^\]]+)\]:[ \t]*<?([^>\s]+)>?/gm;
+/** Extract inline Markdown links/images as `{ target, text }`. */
+export const extractLinks = (content) => {
+    const links = [];
+    for (const match of content.matchAll(LINK_RE)) {
+        links.push({ target: match[2] ?? '', text: match[1] ?? '' });
+    }
+    return links;
+};
+/** Extract reference-style link definitions (`[label]: ./path "title"`). */
+export const extractLinkDefinitions = (content) => {
+    const defs = [];
+    for (const match of content.matchAll(LINK_DEF_RE)) {
+        defs.push({ label: match[1] ?? '', target: match[2] ?? '' });
+    }
+    return defs;
+};
+/** True only for relative paths we can resolve on disk. */
+export const isCheckableTarget = (target) => {
+    if (!target) {
+        return false;
+    }
+    if (target.startsWith('#')) {
+        return false;
+    } // same-page anchor
+    if (target.startsWith('//')) {
+        return false;
+    } // protocol-relative URL
+    if (/^[a-z][a-z0-9+.-]*:/i.test(target)) {
+        return false;
+    } // http:, mailto:, etc.
+    return true;
+};
+/** Drop `#anchor` and `?query` from a target. */
+export const stripAnchor = (target) => target.replace(/[#?].*$/, '');
+/** Map basename -> list of absolute paths, for ambiguity-aware fixing. */
+export const buildBasenameIndex = (absPaths) => {
+    const index = new Map();
+    for (const abs of absPaths) {
+        const base = path.basename(abs);
+        const bucket = index.get(base);
+        if (bucket) {
+            bucket.push(abs);
+        }
+        else {
+            index.set(base, [abs]);
+        }
+    }
+    return index;
+};
+const toRelative = (fromDir, toAbs) => {
+    const rel = path.relative(fromDir, toAbs).split(path.sep).join('/');
+    return rel.startsWith('.') ? rel : `./${rel}`;
+};
+/**
+ * Suggest a repaired relative path for a broken target. Returns a path only
+ * when exactly one indexed file matches the basename (no ambiguity); else null.
+ */
+export const suggestFix = ({ fromDir, index, target }) => {
+    const base = path.basename(stripAnchor(target));
+    const candidates = index.get(base);
+    if (!candidates || candidates.length !== 1) {
+        return null;
+    }
+    return toRelative(fromDir, candidates[0] ?? '');
+};
+/**
+ * Check one file's content for broken relative links. Returns the broken ones,
+ * each with an optional `suggestion` when an `index` is supplied.
+ */
+export const checkContent = ({ content, existsAbs, fileAbs, index }) => {
+    const fromDir = path.dirname(fileAbs);
+    const broken = [];
+    const masked = stripCode(content);
+    const candidates = [
+        ...extractLinks(masked),
+        // Reference-style definitions are checked by their target too.
+        ...extractLinkDefinitions(masked).map((def) => ({ target: def.target, text: `[${def.label}]` })),
+    ];
+    for (const link of candidates) {
+        if (!isCheckableTarget(link.target)) {
+            continue;
+        }
+        const rel = stripAnchor(link.target);
+        if (!rel) {
+            continue;
+        }
+        const abs = path.resolve(fromDir, rel);
+        if (existsAbs(abs)) {
+            continue;
+        }
+        const suggestion = index ? suggestFix({ fromDir, index, target: link.target }) : null;
+        broken.push(suggestion ? { suggestion, target: link.target, text: link.text } : { target: link.target, text: link.text });
+    }
+    return broken;
+};
+//# sourceMappingURL=MarkdownLinks.js.map

package/dist/core/MarkdownLinks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MarkdownLinks.js","sourceRoot":"","sources":["../../src/core/MarkdownLinks.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,sFAAsF;AACtF,oFAAoF;AAEpF,OAAO,KAAK,QAAQ,MAAM,WAAW,CAAA;AAErC,0EAA0E;AAC1E,yCAAyC;AACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAA;AA+B3B,MAAM,OAAO,GAAG,6CAA6C,CAAA;AAC7D,MAAM,cAAc,GAAG,wDAAwD,CAAA;AAC/E,MAAM,cAAc,GAAG,YAAY,CAAA;AAEnC;;;;GAIG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,OAAe,EAAU,EAAE,CACnD,OAAO;KACJ,UAAU,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;KACtE,UAAU,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;AAEpE,MAAM,WAAW,GAAG,2CAA2C,CAAA;AAE/D,kEAAkE;AAClE,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,OAAe,EAAkB,EAAE;IAC9D,MAAM,KAAK,GAAmB,EAAE,CAAA;IAChC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;IAC9D,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,OAAe,EAAqB,EAAE;IAC3E,MAAM,IAAI,GAAsB,EAAE,CAAA;IAClC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;IAC9D,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,2DAA2D;AAC3D,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,MAAc,EAAW,EAAE;IAC3D,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO,KAAK,CAAA;IACd,CAAC,CAAC,mBAAmB;IACrB,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAA;IACd,CAAC,CAAC,wBAAwB;IAC1B,IAAI,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAA;IACd,CAAC,CAAC,uBAAuB;IACzB,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,iDAAiD;AACjD,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;AAEpF,0EAA0E;AAC1E,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,QAA2B,EAAyB,EAAE;IACvF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAA;IACzC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;QAC/B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CAAC,OAAe,EAAE,KAAa,EAAU,EAAE;IAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACnE,OAAO,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAA;AAC/C,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAkB,EAAiB,EAAE;IACtF,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;IAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAClC,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;AACjD,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAoB,EAAgB,EAAE;IACrG,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IACrC,MAAM,MAAM,GAAiB,EAAE,CAAA;IAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IACjC,MAAM,UAAU,GAAmB;QACjC,GAAG,YAAY,CAAC,MAAM,CAAC;QACvB,+DAA+D;QAC/D,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;KACjG,CAAA;IACD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACpC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QACtC,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,SAAQ;QACV,CAAC;QACD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACrF,MAAM,CAAC,IAAI,CACT,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAC7G,CAAA;IACH,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC,CAAA"}

package/dist/core/SummaryTree.bench.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=SummaryTree.bench.d.ts.map

package/dist/core/SummaryTree.bench.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SummaryTree.bench.d.ts","sourceRoot":"","sources":["../../src/core/SummaryTree.bench.ts"],"names":[],"mappings":""}

package/dist/core/SummaryTree.bench.js

@@ -0,0 +1,70 @@
+import * as nodePath from 'node:path';
+import { bench, describe } from 'vitest';
+import { hashContent, isSummaryFile, sourceHashTag, summaryPathFor } from "./DocSummaries.js";
+import { DIR_SUMMARY, isDirSummary, planSummaries } from "./SummaryTree.js";
+const path = nodePath.posix;
+const bigContent = (seed) => Array.from({ length: 40 }, (_, i) => `${seed} body line ${i} with some representative prose content`).join('\n');
+const smallContent = (seed) => `${seed} short note`;
+/** A fully stamped, link-complete tree: `planSummaries` on it reports every node `ok`. */
+const buildFreshTree = ({ depth, dirsPerLevel, filesPerDir, root }) => {
+    const files = new Map();
+    const visit = (dir, level) => {
+        const docTargets = [];
+        const inputs = [];
+        for (let f = 0; f < filesPerDir; f++) {
+            const docPath = `${dir}/doc-${f}.md`;
+            const big = f % 3 !== 0;
+            const content = big ? bigContent(docPath) : smallContent(docPath);
+            files.set(docPath, content);
+            docTargets.push(docPath);
+            if (big) {
+                const sp = summaryPathFor(docPath);
+                files.set(sp, `${sourceHashTag(hashContent(content))}\n\n# summary\n\nSee [source](./${path.basename(docPath)}).`);
+                inputs.push(sp);
+            }
+            else {
+                inputs.push(docPath);
+            }
+        }
+        const dirTargets = [];
+        if (level < depth) {
+            for (let d = 0; d < dirsPerLevel; d++) {
+                const sub = `${dir}/sub-${d}`;
+                visit(sub, level + 1);
+                dirTargets.push(sub);
+                inputs.push(`${sub}/${DIR_SUMMARY}`);
+            }
+        }
+        const manifest = inputs
+            .map((input) => `${path.relative(dir, input)}:${hashContent(files.get(input) ?? '')}`)
+            .toSorted()
+            .join('\n');
+        const links = [...docTargets, ...dirTargets].map((t) => `- [link](${path.relative(dir, t)})`).join('\n');
+        files.set(`${dir}/${DIR_SUMMARY}`, `${sourceHashTag(hashContent(manifest))}\n\n${links}`);
+    };
+    visit(root, 0);
+    return files;
+};
+/** Same source docs, no summaries anywhere yet — the "first run" worst case. */
+const sourceOnly = (files) => new Map([...files].filter(([p]) => !isSummaryFile(p) && !isDirSummary(p)));
+const SMALL = { depth: 1, dirsPerLevel: 9, filesPerDir: 10, root: '/repo/docs' };
+const LARGE = { depth: 4, dirsPerLevel: 3, filesPerDir: 16, root: '/repo/docs' };
+const smallFresh = buildFreshTree(SMALL);
+const smallRaw = sourceOnly(smallFresh);
+const largeFresh = buildFreshTree(LARGE);
+const largeRaw = sourceOnly(largeFresh);
+describe('planSummaries()', () => {
+    bench('~100 files, flat/shallow, first run (no summaries)', () => {
+        planSummaries({ files: smallRaw, roots: [SMALL.root] });
+    });
+    bench('~100 files, flat/shallow, steady state (fully stamped)', () => {
+        planSummaries({ files: smallFresh, roots: [SMALL.root] });
+    });
+    bench('~2000 files, deep/nested, first run (no summaries)', () => {
+        planSummaries({ files: largeRaw, roots: [LARGE.root] });
+    });
+    bench('~2000 files, deep/nested, steady state (fully stamped)', () => {
+        planSummaries({ files: largeFresh, roots: [LARGE.root] });
+    });
+});
+//# sourceMappingURL=SummaryTree.bench.js.map

package/dist/core/SummaryTree.bench.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SummaryTree.bench.js","sourceRoot":"","sources":["../../src/core/SummaryTree.bench.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,QAAQ,MAAM,WAAW,CAAA;AAErC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAA;AAExC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAA;AAC7F,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AAE3E,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAA;AAS3B,MAAM,UAAU,GAAG,CAAC,IAAY,EAAU,EAAE,CAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,cAAc,CAAC,yCAAyC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAElH,MAAM,YAAY,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,GAAG,IAAI,aAAa,CAAA;AAEnE,0FAA0F;AAC1F,MAAM,cAAc,GAAG,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,EAAa,EAAuB,EAAE;IACpG,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IAEvC,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,KAAa,EAAQ,EAAE;QACjD,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAA;YACpC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YACvB,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;YACjE,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;YAC3B,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACxB,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,EAAE,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;gBAClC,KAAK,CAAC,GAAG,CACP,EAAE,EACF,GAAG,aAAa,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,mCAAmC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CACpG,CAAA;gBACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACjB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,GAAG,GAAG,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAA;gBAC7B,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;gBACrB,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACpB,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,WAAW,EAAE,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM;aACpB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;aACrF,QAAQ,EAAE;aACV,IAAI,CAAC,IAAI,CAAC,CAAA;QACb,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxG,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,WAAW,EAAE,EAAE,GAAG,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,CAAA;IAC3F,CAAC,CAAA;IAED,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACd,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,gFAAgF;AAChF,MAAM,UAAU,GAAG,CAAC,KAAkC,EAAuB,EAAE,CAC7E,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAE5E,MAAM,KAAK,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,CAAA;AAC3F,MAAM,KAAK,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,CAAA;AAE3F,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAA;AACxC,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,CAAA;AACvC,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAA;AACxC,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,CAAA;AAEvC,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,KAAK,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC/D,aAAa,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,wDAAwD,EAAE,GAAG,EAAE;QACnE,aAAa,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC3D,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC/D,aAAa,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,wDAAwD,EAAE,GAAG,EAAE;QACnE,aAAa,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC3D,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/core/SummaryTree.d.ts

@@ -0,0 +1,45 @@
+import type { Naming, SummaryStatus } from './DocSummaries.ts';
+/** Default per-directory digest filename. */
+export declare const DIR_SUMMARY: string;
+export interface PlanNode {
+    readonly expectedHash: string;
+    readonly inputs: readonly string[];
+    readonly kind: 'dir' | 'file';
+    readonly missingLinks: readonly string[];
+    readonly path: string;
+    readonly recordedHash: string | null;
+    readonly status: SummaryStatus;
+}
+export interface PlanArgs {
+    readonly files: ReadonlyMap<string, string>;
+    readonly ignore?: readonly string[];
+    readonly naming?: Naming;
+    readonly requireDirSummaries?: boolean;
+    readonly roots: readonly string[];
+    readonly thresholdLines?: number;
+}
+export interface SummaryPlan {
+    readonly nodes: readonly PlanNode[];
+    readonly orphans: readonly string[];
+    readonly todo: readonly PlanNode[];
+}
+/** True when `p` is a directory summary under the configured naming. */
+export declare const isDirSummary: (p: string, naming?: Naming) => boolean;
+export interface NodeHashArgs {
+    readonly files: ReadonlyMap<string, string>;
+    readonly inputs: readonly string[];
+    readonly kind: 'dir' | 'file';
+    readonly path: string;
+}
+/**
+ * A single node's expected hash, computed directly from its (structurally
+ * stable — doesn't change while stamping) `inputs` and their CURRENT content —
+ * without re-deriving the whole directory graph. `planSummaries` uses this to
+ * build each node; `stampSummaries` reuses it to recompute just-stamped nodes'
+ * parents against freshly-written children, without a full replan per node
+ * (previously O(nodes) work repeated once per node, i.e. O(nodes^2) overall).
+ */
+export declare const nodeExpectedHash: ({ files, inputs, kind, path: nodeAtPath }: NodeHashArgs) => string;
+/** Compute the full hierarchical summary plan from the current file contents. */
+export declare const planSummaries: ({ files, ignore, naming, requireDirSummaries, roots, thresholdLines, }: PlanArgs) => SummaryPlan;
+//# sourceMappingURL=SummaryTree.d.ts.map

package/dist/core/SummaryTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SummaryTree.d.ts","sourceRoot":"","sources":["../../src/core/SummaryTree.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAA;AAgB9D,6CAA6C;AAC7C,eAAO,MAAM,WAAW,QAA4B,CAAA;AAEpD,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,CAAA;IAC7B,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAA;IACxC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAA;IACpC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;CAC/B;AAED,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC3C,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,mBAAmB,CAAC,EAAE,OAAO,CAAA;IACtC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;IACjC,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CACjC;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAA;IACnC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,QAAQ,CAAC,IAAI,EAAE,SAAS,QAAQ,EAAE,CAAA;CACnC;AAID,wEAAwE;AACxE,eAAO,MAAM,YAAY,GAAI,GAAG,MAAM,EAAE,SAAQ,MAAuB,KAAG,OACV,CAAA;AA2BhE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC3C,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,CAAA;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,gBAAgB,GAAI,2CAA2C,YAAY,KAAG,MAU1F,CAAA;AAED,iFAAiF;AACjF,eAAO,MAAM,aAAa,GAAI,wEAO3B,QAAQ,KAAG,WAiHb,CAAA"}

package/dist/core/SummaryTree.js

@@ -0,0 +1,196 @@
+// Pure planner for the HIERARCHICAL summary system.
+//
+// Two kinds of summaries:
+//  - file summary `X.summary.md` for every source doc `X.md` over the threshold;
+//  - directory summary `DIR/_SUMMARY.md` for every directory, aggregating its
+//    direct docs (or their summary when the doc is big) AND the `_SUMMARY.md`
+//    of its direct sub-directories.
+//
+// Freshness is content-hash based (clone/CI-proof, unlike mtime). Each summary
+// embeds `<!-- source-sha256: H -->`:
+//  - file summary  -> H = hash(source doc content)
+//  - dir summary   -> H = hash(manifest of its inputs' relative-path:content-hash)
+//
+// `planSummaries` returns every expected summary with its status and, crucially,
+// the bottom-up order in which to (re)generate them so a single pass converges:
+// file summaries first, then directories deepest-first (a parent's manifest then
+// sees its already-fresh children).
+//
+// Filenames (`naming`), the line threshold, ignored globs and whether directory
+// summaries are required are all configurable; defaults reproduce the original.
+import * as nodePath from 'node:path';
+import { countLines, DEFAULT_NAMING, extractSourceHash, hashContent, isSummaryFile, summaryPathFor, } from "./DocSummaries.js";
+import { matchesAny } from "./glob.js";
+import { extractLinks, isCheckableTarget, stripAnchor, stripCode } from "./MarkdownLinks.js";
+// POSIX path semantics so the plan is identical on every OS (inputs normalised
+// to `/` at the IO boundary).
+const path = nodePath.posix;
+/** Default per-directory digest filename. */
+export const DIR_SUMMARY = DEFAULT_NAMING.dirSummary;
+const DEFAULT_THRESHOLD_LINES = 30;
+/** True when `p` is a directory summary under the configured naming. */
+export const isDirSummary = (p, naming = DEFAULT_NAMING) => p === naming.dirSummary || p.endsWith(`/${naming.dirSummary}`);
+/** Absolute targets of the relative links found in `content`, resolved from `dir`. */
+const resolveLinks = (content, dir) => {
+    const set = new Set();
+    for (const { target } of extractLinks(stripCode(content))) {
+        if (!isCheckableTarget(target)) {
+            continue;
+        }
+        const rel = stripAnchor(target);
+        if (rel) {
+            set.add(path.resolve(dir, rel));
+        }
+    }
+    return set;
+};
+const statusOf = (exists, recorded, expected) => {
+    if (!exists) {
+        return 'missing';
+    }
+    if (recorded !== expected) {
+        return 'stale';
+    }
+    return 'ok';
+};
+/**
+ * A single node's expected hash, computed directly from its (structurally
+ * stable — doesn't change while stamping) `inputs` and their CURRENT content —
+ * without re-deriving the whole directory graph. `planSummaries` uses this to
+ * build each node; `stampSummaries` reuses it to recompute just-stamped nodes'
+ * parents against freshly-written children, without a full replan per node
+ * (previously O(nodes) work repeated once per node, i.e. O(nodes^2) overall).
+ */
+export const nodeExpectedHash = ({ files, inputs, kind, path: nodeAtPath }) => {
+    if (kind === 'file') {
+        return hashContent(files.get(inputs[0] ?? '') ?? '');
+    }
+    const dir = path.dirname(nodeAtPath);
+    const manifest = inputs
+        .map((input) => `${path.relative(dir, input)}:${hashContent(files.get(input) ?? '')}`)
+        .toSorted()
+        .join('\n');
+    return hashContent(manifest);
+};
+/** Compute the full hierarchical summary plan from the current file contents. */
+export const planSummaries = ({ files, ignore = [], naming = DEFAULT_NAMING, requireDirSummaries = true, roots, thresholdLines = DEFAULT_THRESHOLD_LINES, }) => {
+    const allPaths = [...files.keys()];
+    const recorded = (p) => (files.has(p) ? extractSourceHash(files.get(p) ?? '') : null);
+    const sourceDocs = allPaths.filter((p) => p.endsWith('.md') && !isSummaryFile(p, naming) && !isDirSummary(p, naming) && !matchesAny(p, ignore));
+    // Computed once per doc up front (a Set lookup below) rather than via a
+    // countLines() call at each of the two sites that ask "is this doc big" — the
+    // file-node filter and the dir-manifest input mapping both need the answer.
+    const bigDocs = new Set(sourceDocs.filter((doc) => countLines(files.get(doc) ?? '') > thresholdLines));
+    const isBig = (doc) => bigDocs.has(doc);
+    // --- file summaries ---
+    const fileNodes = [];
+    for (const doc of sourceDocs.toSorted()) {
+        if (!isBig(doc)) {
+            continue;
+        }
+        const sp = summaryPathFor(doc, naming);
+        const expectedHash = nodeExpectedHash({ files, inputs: [doc], kind: 'file', path: sp });
+        const recordedHash = recorded(sp);
+        fileNodes.push({
+            expectedHash,
+            inputs: [doc],
+            kind: 'file',
+            missingLinks: [],
+            path: sp,
+            recordedHash,
+            status: statusOf(files.has(sp), recordedHash, expectedHash),
+        });
+    }
+    if (!requireDirSummaries) {
+        const orphans = findOrphans({ files, ignore, naming, nodes: fileNodes, requireDirSummaries });
+        return { nodes: fileNodes, orphans, todo: fileNodes.filter((n) => n.status !== 'ok') };
+    }
+    // --- directories in scope ---
+    const inScope = (d) => roots.some((r) => d === r || d.startsWith(`${r}/`));
+    const dirs = new Set();
+    for (const doc of sourceDocs) {
+        let d = path.dirname(doc);
+        while (inScope(d)) {
+            dirs.add(d);
+            const parent = path.dirname(d);
+            if (parent === d) {
+                break;
+            }
+            d = parent;
+        }
+    }
+    // --- bucket each doc/dir under its parent once, instead of re-filtering
+    // `sourceDocs`/`dirs` from scratch inside the loop below (which was
+    // O(dirs x docs) + O(dirs^2) on a large tree). ---
+    const docsByParent = new Map();
+    for (const doc of sourceDocs) {
+        const parent = path.dirname(doc);
+        const bucket = docsByParent.get(parent);
+        if (bucket) {
+            bucket.push(doc);
+        }
+        else {
+            docsByParent.set(parent, [doc]);
+        }
+    }
+    const dirsByParent = new Map();
+    for (const d of dirs) {
+        const parent = path.dirname(d);
+        const bucket = dirsByParent.get(parent);
+        if (bucket) {
+            bucket.push(d);
+        }
+        else {
+            dirsByParent.set(parent, [d]);
+        }
+    }
+    // --- directory summaries ---
+    const dirNodes = [];
+    for (const dir of dirs) {
+        const childDocs = docsByParent.get(dir) ?? [];
+        const childDirs = dirsByParent.get(dir) ?? [];
+        const inputs = [
+            ...childDocs.map((doc) => (isBig(doc) ? summaryPathFor(doc, naming) : doc)),
+            ...childDirs.map((sub) => path.join(sub, naming.dirSummary)),
+        ];
+        const dsp = path.join(dir, naming.dirSummary);
+        const expectedHash = nodeExpectedHash({ files, inputs, kind: 'dir', path: dsp });
+        const recordedHash = recorded(dsp);
+        const exists = files.has(dsp);
+        // A directory summary must link every direct sub-file AND sub-folder.
+        const requiredLinks = [...childDocs, ...childDirs];
+        const linked = resolveLinks(files.get(dsp) ?? '', dir);
+        const missingLinks = requiredLinks.filter((target) => !linked.has(target)).toSorted();
+        const fresh = exists && recordedHash === expectedHash && missingLinks.length === 0;
+        dirNodes.push({
+            expectedHash,
+            inputs: inputs.toSorted(),
+            kind: 'dir',
+            missingLinks,
+            path: dsp,
+            recordedHash,
+            status: exists ? (fresh ? 'ok' : 'stale') : 'missing',
+        });
+    }
+    // Bottom-up order: file summaries first, then dirs deepest-first.
+    const depth = (p) => p.split('/').length;
+    dirNodes.sort((a, b) => depth(b.path) - depth(a.path) || a.path.localeCompare(b.path));
+    const nodes = [...fileNodes, ...dirNodes];
+    const orphans = findOrphans({ files, ignore, naming, nodes, requireDirSummaries });
+    return { nodes, orphans, todo: nodes.filter((n) => n.status !== 'ok') };
+};
+/**
+ * A `.summary.md`/`_SUMMARY.md` on disk that no longer corresponds to any
+ * expected node — its source doc was deleted, renamed, or (for file summaries)
+ * dropped below the threshold. Excludes paths matching `ignore`. When
+ * `requireDirSummaries` is false, directory summaries are never expected, so
+ * they are never flagged as orphans.
+ */
+const findOrphans = ({ files, ignore, naming, nodes, requireDirSummaries }) => {
+    const expected = new Set(nodes.map((n) => n.path));
+    const actualSummaries = [...files.keys()].filter((p) => isManagedSummaryPath(p, naming, requireDirSummaries) && !matchesAny(p, ignore));
+    return actualSummaries.filter((p) => !expected.has(p)).toSorted();
+};
+/** A path cairn manages as a summary artifact under `naming` — a file summary always, a directory summary only when required. */
+const isManagedSummaryPath = (p, naming, requireDirSummaries) => isSummaryFile(p, naming) || (requireDirSummaries && isDirSummary(p, naming));
+//# sourceMappingURL=SummaryTree.js.map

package/dist/core/SummaryTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SummaryTree.js","sourceRoot":"","sources":["../../src/core/SummaryTree.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,EAAE;AACF,0BAA0B;AAC1B,iFAAiF;AACjF,8EAA8E;AAC9E,8EAA8E;AAC9E,oCAAoC;AACpC,EAAE;AACF,+EAA+E;AAC/E,sCAAsC;AACtC,mDAAmD;AACnD,mFAAmF;AACnF,EAAE;AACF,iFAAiF;AACjF,gFAAgF;AAChF,iFAAiF;AACjF,oCAAoC;AACpC,EAAE;AACF,gFAAgF;AAChF,gFAAgF;AAEhF,OAAO,KAAK,QAAQ,MAAM,WAAW,CAAA;AAGrC,OAAO,EACL,UAAU,EACV,cAAc,EACd,iBAAiB,EACjB,WAAW,EACX,aAAa,EACb,cAAc,GACf,MAAM,mBAAmB,CAAA;AAC1B,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA;AACtC,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAE5F,+EAA+E;AAC/E,8BAA8B;AAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAA;AAE3B,6CAA6C;AAC7C,MAAM,CAAC,MAAM,WAAW,GAAG,cAAc,CAAC,UAAU,CAAA;AA2BpD,MAAM,uBAAuB,GAAG,EAAE,CAAA;AAElC,wEAAwE;AACxE,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,SAAiB,cAAc,EAAW,EAAE,CAClF,CAAC,KAAK,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC,CAAA;AAEhE,sFAAsF;AACtF,MAAM,YAAY,GAAG,CAAC,OAAe,EAAE,GAAW,EAAe,EAAE;IACjE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,YAAY,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAA;QAC/B,IAAI,GAAG,EAAE,CAAC;YACR,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CAAC,MAAe,EAAE,QAAuB,EAAE,QAAgB,EAAiB,EAAE;IAC7F,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC1B,OAAO,OAAO,CAAA;IAChB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AASD;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAgB,EAAU,EAAE;IAClG,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QACpB,OAAO,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;IACpC,MAAM,QAAQ,GAAG,MAAM;SACpB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;SACrF,QAAQ,EAAE;SACV,IAAI,CAAC,IAAI,CAAC,CAAA;IACb,OAAO,WAAW,CAAC,QAAQ,CAAC,CAAA;AAC9B,CAAC,CAAA;AAED,iFAAiF;AACjF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,EAC5B,KAAK,EACL,MAAM,GAAG,EAAE,EACX,MAAM,GAAG,cAAc,EACvB,mBAAmB,GAAG,IAAI,EAC1B,KAAK,EACL,cAAc,GAAG,uBAAuB,GAC/B,EAAe,EAAE;IAC1B,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IAClC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAiB,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAE5G,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAC5G,CAAA;IACD,wEAAwE;IACxE,8EAA8E;IAC9E,4EAA4E;IAC5E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC,CAAA;IACtG,MAAM,KAAK,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAExD,yBAAyB;IACzB,MAAM,SAAS,GAAe,EAAE,CAAA;IAChC,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAChB,SAAQ;QACV,CAAC;QACD,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACtC,MAAM,YAAY,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;QACvF,MAAM,YAAY,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAA;QACjC,SAAS,CAAC,IAAI,CAAC;YACb,YAAY;YACZ,MAAM,EAAE,CAAC,GAAG,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,YAAY,EAAE,EAAE;YAChB,IAAI,EAAE,EAAE;YACR,YAAY;YACZ,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,YAAY,CAAC;SAC5D,CAAC,CAAA;IACJ,CAAC;IAED,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,mBAAmB,EAAE,CAAC,CAAA;QAC7F,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAA;IACxF,CAAC;IAED,+BAA+B;IAC/B,MAAM,OAAO,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3F,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QACzB,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACX,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YAC9B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,MAAK;YACP,CAAC;YACD,CAAC,GAAG,MAAM,CAAA;QACZ,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,oEAAoE;IACpE,mDAAmD;IACnD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAA;IAChD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QAChC,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACvC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAA;IAChD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;QAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACvC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChB,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,MAAM,QAAQ,GAAe,EAAE,CAAA;IAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAA;QAC7C,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAA;QAC7C,MAAM,MAAM,GAAG;YACb,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3E,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;SAC7D,CAAA;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,CAAA;QAC7C,MAAM,YAAY,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAA;QAChF,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;QAClC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC7B,sEAAsE;QACtE,MAAM,aAAa,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,SAAS,CAAC,CAAA;QAClD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;QACtD,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;QACrF,MAAM,KAAK,GAAG,MAAM,IAAI,YAAY,KAAK,YAAY,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,CAAA;QAClF,QAAQ,CAAC,IAAI,CAAC;YACZ,YAAY;YACZ,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE;YACzB,IAAI,EAAE,KAAK;YACX,YAAY;YACZ,IAAI,EAAE,GAAG;YACT,YAAY;YACZ,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;SACtD,CAAC,CAAA;IACJ,CAAC;IAED,kEAAkE;IAClE,MAAM,KAAK,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAA;IACxD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAEtF,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,QAAQ,CAAC,CAAA;IACzC,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC,CAAA;IAClF,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAA;AACzE,CAAC,CAAA;AAUD;;;;;;GAMG;AACH,MAAM,WAAW,GAAG,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,EAAmB,EAAY,EAAE;IACvG,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAClD,MAAM,eAAe,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CACtF,CAAA;IACD,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;AACnE,CAAC,CAAA;AAED,iIAAiI;AACjI,MAAM,oBAAoB,GAAG,CAAC,CAAS,EAAE,MAAc,EAAE,mBAA4B,EAAW,EAAE,CAChG,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,mBAAmB,IAAI,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAA"}

package/dist/core/glob.bench.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=glob.bench.d.ts.map

package/dist/core/glob.bench.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"glob.bench.d.ts","sourceRoot":"","sources":["../../src/core/glob.bench.ts"],"names":[],"mappings":""}