@smthrs/std 0.0.0-stage → 1.0.0-rc.12

package/dist/esm/internal/TestReport.js

@@ -0,0 +1,172 @@
+/**
+ * What a test runner said, read out of what it printed.
+ *
+ * A suite's answer is two facts — how many passed, and which ones failed — and
+ * a runner spends twenty to thirty kilobytes of stdout saying them. Paying a
+ * model to read that is the expensive way to learn a number, and the measured
+ * program shows what it costs: sixteen frames on sphinx-8721 existed because a
+ * pre-existing failure was never isolated, and the failure *names* were in the
+ * output all along.
+ *
+ * The parsers below recognise the report shapes the standard runners print.
+ * Precision is the design constraint, exactly as in `Probe`: a reader claims a
+ * complete report only when the runner printed an authoritative completion
+ * statement and the observed outcomes agree with it. Pytest requires a tally,
+ * TAP requires a plan with every planned outcome, and unittest requires its
+ * `Ran` line plus an `OK` or `FAILED` summary. Incomplete captures still return
+ * the outcomes they contain with `parsed: false`. A wrong failure set is worse
+ * than no failure set, because attribution is built on it.
+ *
+ * @since 1.0.0
+ */
+const unique = (ids) => [...new Set(ids)];
+const collect = (text, pattern) => {
+    const found = [];
+    for (const match of text.matchAll(pattern)) {
+        found.push(match[1]);
+    }
+    return found;
+};
+const count = (text, pattern) => {
+    const match = pattern.exec(text);
+    return match === null ? undefined : Number(match[1]);
+};
+/**
+ * pytest, in every verbosity it is normally run at.
+ *
+ * The short summary (`-rA`, and the default on failure) prints one
+ * `FAILED path::id - reason` line per failure, and the tally line prints the
+ * authoritative counts. Verbose outcome lines preserve observations from an
+ * incomplete capture but cannot establish that the run completed.
+ */
+const pytest = (text) => {
+    const summaryFailed = collect(text, /^(?:FAILED|ERROR)[ \t]+(.+?)(?:[ \t]+-[ \t]+.*)?$/gm);
+    const outcomes = [...text.matchAll(/^(.+?)[ \t]+(PASSED|FAILED|ERROR)(?:[ \t]+.*)?$/gm)];
+    const verboseFailed = outcomes.flatMap((match) => match[2] === "FAILED" || match[2] === "ERROR" ? [match[1]] : []);
+    const verbosePassed = unique(outcomes.flatMap((match) => match[2] === "PASSED" ? [match[1]] : [])).length;
+    const failed = unique([...summaryFailed, ...verboseFailed]);
+    // Only a terminal pytest summary can certify completion. Earlier diagnostic
+    // lines (including test stdout) are not runner tallies.
+    const lastLine = text.trimEnd().split("\n").at(-1);
+    const summary = /^(?:=+[ \t]*)?(\d+ [a-z]+(?:,[ \t]*\d+ [a-z]+)*) in \d+(?:\.\d+)?s(?: \([^)]*\))?[ \t]*(?:=+)?$/
+        .exec(lastLine)?.[1];
+    const tally = summary === undefined ? undefined : count(summary, /\b(\d+) passed\b/);
+    const failures = summary === undefined ? undefined : count(summary, /\b(\d+) failed\b/);
+    const errors = summary === undefined ? undefined : count(summary, /\b(\d+) errors?\b/);
+    const hasTally = tally !== undefined || failures !== undefined || errors !== undefined;
+    const reportedFailed = hasTally ? (failures ?? 0) + (errors ?? 0) : undefined;
+    if (!hasTally && outcomes.length === 0 && summaryFailed.length === 0)
+        return undefined;
+    return {
+        passed: tally ?? verbosePassed,
+        failed,
+        reportedFailed,
+        parsed: hasTally && failed.length === reportedFailed
+    };
+};
+/**
+ * unittest, whose failures name a method and a class in the opposite order to
+ * the dotted id everything else uses.
+ */
+const unittest = (text) => {
+    const ran = count(text, /^Ran (\d+) tests?\b/m);
+    const outcomes = [...text.matchAll(/^(?:FAIL|ERROR|UNEXPECTED SUCCESS):[ \t]+(\S+)[ \t]+\(([^)\s]+)\)/gm)];
+    if (ran === undefined && outcomes.length === 0)
+        return undefined;
+    const failed = unique(outcomes.map((match) => match[2].endsWith(`.${match[1]}`) ? match[2] : `${match[2]}.${match[1]}`));
+    const summary = /^(OK|FAILED)(?: \(([^)]*)\))?[ \t]*$/m.exec(text);
+    const counts = new Map();
+    let known = summary !== null;
+    for (const entry of summary?.[2]?.split(", ") ?? []) {
+        const match = /^(failures|errors|skipped|expected failures|unexpected successes)=(\d+)$/.exec(entry);
+        if (match === null || counts.has(match[1]))
+            known = false;
+        else
+            counts.set(match[1], Number(match[2]));
+    }
+    const reportedFailed = known
+        ? (counts.get("failures") ?? 0) + (counts.get("errors") ?? 0) + (counts.get("unexpected successes") ?? 0)
+        : undefined;
+    const skipped = counts.get("skipped") ?? 0;
+    const expectedFailures = counts.get("expected failures") ?? 0;
+    const passed = ran === undefined || reportedFailed === undefined
+        ? 0
+        : Math.max(0, ran - reportedFailed - skipped - expectedFailures);
+    return {
+        passed,
+        failed,
+        reportedFailed,
+        parsed: ran !== undefined && reportedFailed !== undefined && failed.length === reportedFailed &&
+            (summary?.[1] === "OK" ? reportedFailed === 0 : reportedFailed > 0) &&
+            passed + failed.length + skipped + expectedFailures === ran
+    };
+};
+/**
+ * TAP, which several ecosystems emit and which names each test on its own line.
+ */
+const tap = (text) => {
+    const outcomes = [...text.matchAll(/^(not ok|ok)\b[ \t]*\d*[ \t]*-?[ \t]*(.*)$/gm)].map((match) => {
+        const directive = /[ \t]*#[ \t]*(SKIP|TODO)\b.*$/i.exec(match[2]);
+        return {
+            ok: match[1] === "ok",
+            id: match[2].slice(0, directive?.index).trim(),
+            directive: directive === null ? undefined : directive[1].toUpperCase()
+        };
+    });
+    const failures = outcomes.filter((outcome) => !outcome.ok && outcome.directive === undefined);
+    const failed = unique(failures.flatMap((outcome) => outcome.id === "" ? [] : [outcome.id]));
+    const passed = outcomes.filter((outcome) => outcome.ok && outcome.directive !== "SKIP").length;
+    const planned = count(text, /^1\.\.(\d+)\b/m);
+    if (outcomes.length === 0 && planned === undefined)
+        return undefined;
+    const reportedFailed = failures.length;
+    return {
+        passed,
+        failed,
+        reportedFailed,
+        parsed: planned !== undefined && outcomes.length === planned && failed.length === reportedFailed
+    };
+};
+/**
+ * Reads one run's report, or says plainly that it could not.
+ *
+ * @category parsing
+ * @since 1.0.0
+ */
+export const parse = (text) => {
+    const hasTap = /^(?:TAP version \d+|1\.\.\d+|not ok\b|ok\b)/m.test(text);
+    const hasUnittest = /^Ran \d+ tests?\b/m.test(text);
+    const lastLine = text.trimEnd().split("\n").at(-1);
+    const hasPytest = /^(?:=+[ \t]*)?\d+ [a-z]+(?:,[ \t]*\d+ [a-z]+)* in \d+(?:\.\d+)?s(?: \([^)]*\))?[ \t]*(?:=+)?$/
+        .test(lastLine);
+    // Two runner completion signatures in one capture cannot establish which
+    // protocol owns the outcomes. Never attribute such a report.
+    if ([hasTap, hasUnittest, hasPytest].filter(Boolean).length > 1) {
+        return { passed: 0, failed: [], reportedFailed: undefined, parsed: false };
+    }
+    const readers = hasTap ? [tap] : hasUnittest ? [unittest] : hasPytest ? [pytest] : [unittest, pytest, tap];
+    for (const reader of readers) {
+        const report = reader(text);
+        if (report !== undefined)
+            return report;
+    }
+    return { passed: 0, failed: [], reportedFailed: undefined, parsed: false };
+};
+/**
+ * How two runs of the same command differ, which is the whole of attribution.
+ *
+ * @category parsing
+ * @since 1.0.0
+ */
+export const attribute = (current, base) => {
+    if (!current.parsed || !base.parsed)
+        return undefined;
+    const before = new Set(base.failed);
+    const now = new Set(current.failed);
+    return {
+        introduced: current.failed.filter((id) => !before.has(id)),
+        preexisting: current.failed.filter((id) => before.has(id)),
+        fixed: base.failed.filter((id) => !now.has(id))
+    };
+};
+//# sourceMappingURL=TestReport.js.map

package/dist/esm/internal/TestReport.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TestReport.js","sourceRoot":"","sources":["../../../src/internal/TestReport.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAeH,MAAM,MAAM,GAAG,CAAC,GAA0B,EAAyB,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAEvF,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,OAAe,EAAyB,EAAE;IACvE,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,OAAe,EAAsB,EAAE;IAClE,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAChC,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,GAAG,CAAC,IAAY,EAAsB,EAAE;IAClD,MAAM,aAAa,GAAG,OAAO,CAAC,IAAI,EAAE,qDAAqD,CAAC,CAAA;IAC1F,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,mDAAmD,CAAC,CAAC,CAAA;IACxF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACnH,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAA;IAC1G,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,aAAa,CAAC,CAAC,CAAA;IAC3D,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAA;IACnD,MAAM,OAAO,GAAG,iGAAiG;SAC9G,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACtB,MAAM,KAAK,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAA;IACpF,MAAM,QAAQ,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAA;IACvF,MAAM,MAAM,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,mBAAmB,CAAC,CAAA;IACtF,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,CAAA;IACtF,MAAM,cAAc,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IAC7E,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IACtF,OAAO;QACL,MAAM,EAAE,KAAK,IAAI,aAAa;QAC9B,MAAM;QACN,cAAc;QACd,MAAM,EAAE,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,cAAc;KACrD,CAAA;AACH,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAsB,EAAE;IACpD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,sBAAsB,CAAC,CAAA;IAC/C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,qEAAqE,CAAC,CAAC,CAAA;IAC1G,IAAI,GAAG,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IAChE,MAAM,MAAM,GAAG,MAAM,CACnB,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CACpG,CAAA;IACD,MAAM,OAAO,GAAG,uCAAuC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAClE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,IAAI,KAAK,GAAG,OAAO,KAAK,IAAI,CAAA;IAC5B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,0EAA0E,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpG,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;YAAE,KAAK,GAAG,KAAK,CAAA;;YACrD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9C,CAAC;IACD,MAAM,cAAc,GAAG,KAAK;QAC1B,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACzG,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IAC1C,MAAM,gBAAgB,GAAG,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAA;IAC7D,MAAM,MAAM,GAAG,GAAG,KAAK,SAAS,IAAI,cAAc,KAAK,SAAS;QAC9D,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,cAAc,GAAG,OAAO,GAAG,gBAAgB,CAAC,CAAA;IAClE,OAAO;QACL,MAAM;QACN,MAAM;QACN,cAAc;QACd,MAAM,EAAE,GAAG,KAAK,SAAS,IAAI,cAAc,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,cAAc;YAC3F,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC;YACnE,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,OAAO,GAAG,gBAAgB,KAAK,GAAG;KAC9D,CAAA;AACH,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,GAAG,GAAG,CAAC,IAAY,EAAsB,EAAE;IAC/C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,8CAA8C,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAChG,MAAM,SAAS,GAAG,gCAAgC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;QAClE,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACrB,EAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE;YAC/C,SAAS,EAAE,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE;SACxE,CAAA;IACH,CAAC,CAAC,CAAA;IACF,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAA;IAC7F,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC3F,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,MAAM,CAAA;IAC9F,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAA;IAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IACpE,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAA;IACtC,OAAO;QACL,MAAM;QACN,MAAM;QACN,cAAc;QACd,MAAM,EAAE,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,IAAI,MAAM,CAAC,MAAM,KAAK,cAAc;KACjG,CAAA;AACH,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE;IAC5C,MAAM,MAAM,GAAG,8CAA8C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxE,MAAM,WAAW,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAA;IACnD,MAAM,SAAS,GAAG,+FAA+F;SAC9G,IAAI,CAAC,QAAQ,CAAC,CAAA;IACjB,yEAAyE;IACzE,6DAA6D;IAC7D,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;IAC5E,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,CAAA;IAC1G,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;QAC3B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAA;IACzC,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;AAC5E,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,OAAe,EACf,IAAY,EAKA,EAAE;IACd,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAA;IACrD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IACnC,OAAO;QACL,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1D,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1D,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;KAChD,CAAA;AACH,CAAC,CAAA","sourcesContent":["/**\n * What a test runner said, read out of what it printed.\n *\n * A suite's answer is two facts — how many passed, and which ones failed — and\n * a runner spends twenty to thirty kilobytes of stdout saying them. Paying a\n * model to read that is the expensive way to learn a number, and the measured\n * program shows what it costs: sixteen frames on sphinx-8721 existed because a\n * pre-existing failure was never isolated, and the failure *names* were in the\n * output all along.\n *\n * The parsers below recognise the report shapes the standard runners print.\n * Precision is the design constraint, exactly as in `Probe`: a reader claims a\n * complete report only when the runner printed an authoritative completion\n * statement and the observed outcomes agree with it. Pytest requires a tally,\n * TAP requires a plan with every planned outcome, and unittest requires its\n * `Ran` line plus an `OK` or `FAILED` summary. Incomplete captures still return\n * the outcomes they contain with `parsed: false`. A wrong failure set is worse\n * than no failure set, because attribution is built on it.\n *\n * @since 1.0.0\n */\n\n/**\n * One run's outcome as this module could read it.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Report {\n  readonly passed: number\n  readonly failed: ReadonlyArray<string>\n  readonly reportedFailed: number | undefined\n  readonly parsed: boolean\n}\n\nconst unique = (ids: ReadonlyArray<string>): ReadonlyArray<string> => [...new Set(ids)]\n\nconst collect = (text: string, pattern: RegExp): ReadonlyArray<string> => {\n  const found: Array<string> = []\n  for (const match of text.matchAll(pattern)) {\n    found.push(match[1]!)\n  }\n  return found\n}\n\nconst count = (text: string, pattern: RegExp): number | undefined => {\n  const match = pattern.exec(text)\n  return match === null ? undefined : Number(match[1])\n}\n\n/**\n * pytest, in every verbosity it is normally run at.\n *\n * The short summary (`-rA`, and the default on failure) prints one\n * `FAILED path::id - reason` line per failure, and the tally line prints the\n * authoritative counts. Verbose outcome lines preserve observations from an\n * incomplete capture but cannot establish that the run completed.\n */\nconst pytest = (text: string): Report | undefined => {\n  const summaryFailed = collect(text, /^(?:FAILED|ERROR)[ \\t]+(.+?)(?:[ \\t]+-[ \\t]+.*)?$/gm)\n  const outcomes = [...text.matchAll(/^(.+?)[ \\t]+(PASSED|FAILED|ERROR)(?:[ \\t]+.*)?$/gm)]\n  const verboseFailed = outcomes.flatMap((match) => match[2] === \"FAILED\" || match[2] === \"ERROR\" ? [match[1]!] : [])\n  const verbosePassed = unique(outcomes.flatMap((match) => match[2] === \"PASSED\" ? [match[1]!] : [])).length\n  const failed = unique([...summaryFailed, ...verboseFailed])\n  // Only a terminal pytest summary can certify completion. Earlier diagnostic\n  // lines (including test stdout) are not runner tallies.\n  const lastLine = text.trimEnd().split(\"\\n\").at(-1)!\n  const summary = /^(?:=+[ \\t]*)?(\\d+ [a-z]+(?:,[ \\t]*\\d+ [a-z]+)*) in \\d+(?:\\.\\d+)?s(?: \\([^)]*\\))?[ \\t]*(?:=+)?$/\n    .exec(lastLine)?.[1]\n  const tally = summary === undefined ? undefined : count(summary, /\\b(\\d+) passed\\b/)\n  const failures = summary === undefined ? undefined : count(summary, /\\b(\\d+) failed\\b/)\n  const errors = summary === undefined ? undefined : count(summary, /\\b(\\d+) errors?\\b/)\n  const hasTally = tally !== undefined || failures !== undefined || errors !== undefined\n  const reportedFailed = hasTally ? (failures ?? 0) + (errors ?? 0) : undefined\n  if (!hasTally && outcomes.length === 0 && summaryFailed.length === 0) return undefined\n  return {\n    passed: tally ?? verbosePassed,\n    failed,\n    reportedFailed,\n    parsed: hasTally && failed.length === reportedFailed\n  }\n}\n\n/**\n * unittest, whose failures name a method and a class in the opposite order to\n * the dotted id everything else uses.\n */\nconst unittest = (text: string): Report | undefined => {\n  const ran = count(text, /^Ran (\\d+) tests?\\b/m)\n  const outcomes = [...text.matchAll(/^(?:FAIL|ERROR|UNEXPECTED SUCCESS):[ \\t]+(\\S+)[ \\t]+\\(([^)\\s]+)\\)/gm)]\n  if (ran === undefined && outcomes.length === 0) return undefined\n  const failed = unique(\n    outcomes.map((match) => match[2]!.endsWith(`.${match[1]}`) ? match[2]! : `${match[2]}.${match[1]}`)\n  )\n  const summary = /^(OK|FAILED)(?: \\(([^)]*)\\))?[ \\t]*$/m.exec(text)\n  const counts = new Map<string, number>()\n  let known = summary !== null\n  for (const entry of summary?.[2]?.split(\", \") ?? []) {\n    const match = /^(failures|errors|skipped|expected failures|unexpected successes)=(\\d+)$/.exec(entry)\n    if (match === null || counts.has(match[1]!)) known = false\n    else counts.set(match[1]!, Number(match[2]))\n  }\n  const reportedFailed = known\n    ? (counts.get(\"failures\") ?? 0) + (counts.get(\"errors\") ?? 0) + (counts.get(\"unexpected successes\") ?? 0)\n    : undefined\n  const skipped = counts.get(\"skipped\") ?? 0\n  const expectedFailures = counts.get(\"expected failures\") ?? 0\n  const passed = ran === undefined || reportedFailed === undefined\n    ? 0\n    : Math.max(0, ran - reportedFailed - skipped - expectedFailures)\n  return {\n    passed,\n    failed,\n    reportedFailed,\n    parsed: ran !== undefined && reportedFailed !== undefined && failed.length === reportedFailed &&\n      (summary?.[1] === \"OK\" ? reportedFailed === 0 : reportedFailed > 0) &&\n      passed + failed.length + skipped + expectedFailures === ran\n  }\n}\n\n/**\n * TAP, which several ecosystems emit and which names each test on its own line.\n */\nconst tap = (text: string): Report | undefined => {\n  const outcomes = [...text.matchAll(/^(not ok|ok)\\b[ \\t]*\\d*[ \\t]*-?[ \\t]*(.*)$/gm)].map((match) => {\n    const directive = /[ \\t]*#[ \\t]*(SKIP|TODO)\\b.*$/i.exec(match[2]!)\n    return {\n      ok: match[1] === \"ok\",\n      id: match[2]!.slice(0, directive?.index).trim(),\n      directive: directive === null ? undefined : directive[1]!.toUpperCase()\n    }\n  })\n  const failures = outcomes.filter((outcome) => !outcome.ok && outcome.directive === undefined)\n  const failed = unique(failures.flatMap((outcome) => outcome.id === \"\" ? [] : [outcome.id]))\n  const passed = outcomes.filter((outcome) => outcome.ok && outcome.directive !== \"SKIP\").length\n  const planned = count(text, /^1\\.\\.(\\d+)\\b/m)\n  if (outcomes.length === 0 && planned === undefined) return undefined\n  const reportedFailed = failures.length\n  return {\n    passed,\n    failed,\n    reportedFailed,\n    parsed: planned !== undefined && outcomes.length === planned && failed.length === reportedFailed\n  }\n}\n\n/**\n * Reads one run's report, or says plainly that it could not.\n *\n * @category parsing\n * @since 1.0.0\n */\nexport const parse = (text: string): Report => {\n  const hasTap = /^(?:TAP version \\d+|1\\.\\.\\d+|not ok\\b|ok\\b)/m.test(text)\n  const hasUnittest = /^Ran \\d+ tests?\\b/m.test(text)\n  const lastLine = text.trimEnd().split(\"\\n\").at(-1)!\n  const hasPytest = /^(?:=+[ \\t]*)?\\d+ [a-z]+(?:,[ \\t]*\\d+ [a-z]+)* in \\d+(?:\\.\\d+)?s(?: \\([^)]*\\))?[ \\t]*(?:=+)?$/\n    .test(lastLine)\n  // Two runner completion signatures in one capture cannot establish which\n  // protocol owns the outcomes. Never attribute such a report.\n  if ([hasTap, hasUnittest, hasPytest].filter(Boolean).length > 1) {\n    return { passed: 0, failed: [], reportedFailed: undefined, parsed: false }\n  }\n  const readers = hasTap ? [tap] : hasUnittest ? [unittest] : hasPytest ? [pytest] : [unittest, pytest, tap]\n  for (const reader of readers) {\n    const report = reader(text)\n    if (report !== undefined) return report\n  }\n  return { passed: 0, failed: [], reportedFailed: undefined, parsed: false }\n}\n\n/**\n * How two runs of the same command differ, which is the whole of attribution.\n *\n * @category parsing\n * @since 1.0.0\n */\nexport const attribute = (\n  current: Report,\n  base: Report\n): {\n  readonly introduced: ReadonlyArray<string>\n  readonly preexisting: ReadonlyArray<string>\n  readonly fixed: ReadonlyArray<string>\n} | undefined => {\n  if (!current.parsed || !base.parsed) return undefined\n  const before = new Set(base.failed)\n  const now = new Set(current.failed)\n  return {\n    introduced: current.failed.filter((id) => !before.has(id)),\n    preexisting: current.failed.filter((id) => before.has(id)),\n    fixed: base.failed.filter((id) => !now.has(id))\n  }\n}\n"]}

package/dist/esm/internal/Text.d.ts

@@ -0,0 +1,125 @@
+/**
+ * Shared text paging, numbering, and byte-budget helpers.
+ *
+ * Every limit here is a display budget, not a policy limit: exceeding one is
+ * always disclosed to the model rather than silently applied.
+ *
+ * @since 1.0.0
+ */
+/**
+ * Default number of lines or entries returned by a paged flow.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const DEFAULT_READ_LIMIT = 2000;
+/**
+ * Maximum number of directory entries or glob paths returned in one call.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const MAX_ENTRIES = 1000;
+/**
+ * Maximum number of grep matches returned in one call.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const MAX_GREP_MATCHES = 200;
+/**
+ * Maximum number of Unicode scalar values displayed for a single line.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const MAX_LINE_CHARS = 2000;
+/**
+ * Maximum UTF-8 byte budget for one rendered text payload.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const MAX_OUTPUT_BYTES = 60000;
+/**
+ * Maximum UTF-8 byte budget captured per shell output stream.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const MAX_SHELL_OUTPUT_BYTES = 30000;
+/**
+ * A byte-budgeted rendering of a text value.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export interface Truncation {
+    readonly text: string;
+    readonly truncated: boolean;
+    readonly keptBytes: number;
+    readonly droppedBytes: number;
+}
+/**
+ * One page of source lines.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export interface Page {
+    readonly lines: ReadonlyArray<string>;
+    readonly startLine: number;
+    readonly endLine: number;
+    readonly totalLines: number;
+}
+/**
+ * Trims a string to a UTF-8 byte budget without splitting a code point.
+ *
+ * `keep: "head"` retains the beginning of the value; `keep: "tail"` retains
+ * the end, which is what shell output needs because the interesting part of an
+ * overflowing stream is almost always its last lines.
+ *
+ * @category rendering
+ * @since 1.0.0
+ */
+export declare const truncateBytes: (text: string, maxBytes: number, options: {
+    readonly keep: "head" | "tail";
+}) => Truncation;
+/**
+ * Joins the start and the end of a stream cut in the middle around one line
+ * naming the bytes cut between them.
+ *
+ * The line stands alone, so a start that stops mid-line is ended before it.
+ * Only the line's own newlines are added; `droppedBytes` counts printed bytes.
+ *
+ * @category rendering
+ * @since 1.0.0-rc.5
+ */
+export declare const elideMiddle: (start: string, droppedBytes: number, end: string) => string;
+/**
+ * Splits on LF without counting a terminal LF as a line.
+ * Carriage returns remain part of each line, including the CR in CRLF, so
+ * joining a page with LF preserves its bytes except for the final LF.
+ *
+ * @category parsing
+ * @since 1.0.0
+ */
+export declare const sourceLines: (text: string) => ReadonlyArray<string>;
+/**
+ * Selects a 1-based page of lines from a text value.
+ *
+ * @category paging
+ * @since 1.0.0
+ */
+export declare const slice: (text: string, options: {
+    readonly offset: number;
+    readonly limit: number;
+}) => Page;
+/**
+ * Renders the disclosure appended whenever output was capped.
+ *
+ * @category rendering
+ * @since 1.0.0
+ */
+export declare const notice: (unit: string, shown: number, total: number) => string;
+//# sourceMappingURL=Text.d.ts.map

package/dist/esm/internal/Text.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Text.d.ts","sourceRoot":"","sources":["../../../src/internal/Text.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,OAAQ,CAAA;AAEvC;;;;;GAKG;AACH,eAAO,MAAM,WAAW,OAAQ,CAAA;AAEhC;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,MAAM,CAAA;AAEnC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,OAAQ,CAAA;AAEnC;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,QAAS,CAAA;AAEtC;;;;;GAKG;AACH,eAAO,MAAM,sBAAsB,QAAS,CAAA;AAE5C;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAA;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;CAC9B;AAED;;;;;GAKG;AACH,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAC5B;AAKD;;;;;;;;;GASG;AACH,eAAO,MAAM,aAAa,GACxB,MAAM,MAAM,EACZ,UAAU,MAAM,EAChB,SAAS;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,KAC1C,UAwBF,CAAA;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,WAAW,GAAI,OAAO,MAAM,EAAE,cAAc,MAAM,EAAE,KAAK,MAAM,KAAG,MAG1D,CAAA;AAErB;;;;;;;GAOG;AACH,eAAO,MAAM,WAAW,GAAI,MAAM,MAAM,KAAG,aAAa,CAAC,MAAM,CAI9D,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,KAAK,GAChB,MAAM,MAAM,EACZ,SAAS;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,KAC3D,IAWF,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,MAAM,EAAE,OAAO,MAAM,EAAE,OAAO,MAAM,KAAG,MACL,CAAA"}

package/dist/esm/internal/Text.js

@@ -0,0 +1,141 @@
+/**
+ * Shared text paging, numbering, and byte-budget helpers.
+ *
+ * Every limit here is a display budget, not a policy limit: exceeding one is
+ * always disclosed to the model rather than silently applied.
+ *
+ * @since 1.0.0
+ */
+/**
+ * Default number of lines or entries returned by a paged flow.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export const DEFAULT_READ_LIMIT = 2_000;
+/**
+ * Maximum number of directory entries or glob paths returned in one call.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export const MAX_ENTRIES = 1_000;
+/**
+ * Maximum number of grep matches returned in one call.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export const MAX_GREP_MATCHES = 200;
+/**
+ * Maximum number of Unicode scalar values displayed for a single line.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export const MAX_LINE_CHARS = 2_000;
+/**
+ * Maximum UTF-8 byte budget for one rendered text payload.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export const MAX_OUTPUT_BYTES = 60_000;
+/**
+ * Maximum UTF-8 byte budget captured per shell output stream.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export const MAX_SHELL_OUTPUT_BYTES = 30_000;
+const encoder = new TextEncoder();
+const fatalDecoder = new TextDecoder("utf-8", { fatal: true });
+/**
+ * Trims a string to a UTF-8 byte budget without splitting a code point.
+ *
+ * `keep: "head"` retains the beginning of the value; `keep: "tail"` retains
+ * the end, which is what shell output needs because the interesting part of an
+ * overflowing stream is almost always its last lines.
+ *
+ * @category rendering
+ * @since 1.0.0
+ */
+export const truncateBytes = (text, maxBytes, options) => {
+    const bytes = encoder.encode(text);
+    if (bytes.byteLength <= maxBytes) {
+        return { text, truncated: false, keptBytes: bytes.byteLength, droppedBytes: 0 };
+    }
+    let start = options.keep === "head" ? 0 : bytes.byteLength - maxBytes;
+    let end = options.keep === "head" ? maxBytes : bytes.byteLength;
+    // TextEncoder produces valid UTF-8. Moving a cut inward reaches a scalar
+    // boundary after at most three continuation bytes, so decoding must succeed.
+    while (true) {
+        try {
+            const decoded = fatalDecoder.decode(bytes.subarray(start, end));
+            const keptBytes = end - start;
+            return {
+                text: decoded,
+                truncated: true,
+                keptBytes,
+                droppedBytes: bytes.byteLength - keptBytes
+            };
+        }
+        catch {
+            if (options.keep === "head")
+                end--;
+            else
+                start++;
+        }
+    }
+};
+/**
+ * Joins the start and the end of a stream cut in the middle around one line
+ * naming the bytes cut between them.
+ *
+ * The line stands alone, so a start that stops mid-line is ended before it.
+ * Only the line's own newlines are added; `droppedBytes` counts printed bytes.
+ *
+ * @category rendering
+ * @since 1.0.0-rc.5
+ */
+export const elideMiddle = (start, droppedBytes, end) => `${start}${start === "" || start.endsWith("\n") ? "" : "\n"}[${droppedBytes} ${droppedBytes === 1 ? "byte" : "bytes"} omitted]\n${end}`;
+/**
+ * Splits on LF without counting a terminal LF as a line.
+ * Carriage returns remain part of each line, including the CR in CRLF, so
+ * joining a page with LF preserves its bytes except for the final LF.
+ *
+ * @category parsing
+ * @since 1.0.0
+ */
+export const sourceLines = (text) => {
+    const lines = text.length === 0 ? [] : text.split("\n");
+    if (text.endsWith("\n"))
+        lines.pop();
+    return lines;
+};
+/**
+ * Selects a 1-based page of lines from a text value.
+ *
+ * @category paging
+ * @since 1.0.0
+ */
+export const slice = (text, options) => {
+    const lines = sourceLines(text);
+    const totalLines = lines.length;
+    const startLine = Math.max(1, options.offset);
+    const endLine = Math.min(totalLines, startLine + Math.max(0, options.limit) - 1);
+    return {
+        lines: lines.slice(startLine - 1, endLine),
+        startLine,
+        endLine,
+        totalLines
+    };
+};
+/**
+ * Renders the disclosure appended whenever output was capped.
+ *
+ * @category rendering
+ * @since 1.0.0
+ */
+export const notice = (unit, shown, total) => `Showing ${shown} of ${total} ${unit}; output was truncated.`;
+//# sourceMappingURL=Text.js.map

package/dist/esm/internal/Text.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Text.js","sourceRoot":"","sources":["../../../src/internal/Text.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,CAAA;AAEvC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,CAAA;AAEhC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAA;AAEnC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,KAAK,CAAA;AAEnC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAA;AAEtC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,MAAM,CAAA;AA4B5C,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;AACjC,MAAM,YAAY,GAAG,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;AAE9D;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,IAAY,EACZ,QAAgB,EAChB,OAA2C,EAC/B,EAAE;IACd,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAClC,IAAI,KAAK,CAAC,UAAU,IAAI,QAAQ,EAAE,CAAC;QACjC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IACjF,CAAC;IACD,IAAI,KAAK,GAAG,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,GAAG,QAAQ,CAAA;IACrE,IAAI,GAAG,GAAG,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAA;IAC/D,yEAAyE;IACzE,6EAA6E;IAC7E,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;YAC/D,MAAM,SAAS,GAAG,GAAG,GAAG,KAAK,CAAA;YAC7B,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,SAAS,EAAE,IAAI;gBACf,SAAS;gBACT,YAAY,EAAE,KAAK,CAAC,UAAU,GAAG,SAAS;aAC3C,CAAA;QACH,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM;gBAAE,GAAG,EAAE,CAAA;;gBAC7B,KAAK,EAAE,CAAA;QACd,CAAC;IACH,CAAC;AACH,CAAC,CAAA;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAa,EAAE,YAAoB,EAAE,GAAW,EAAU,EAAE,CACtF,GAAG,KAAK,GAAG,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,YAAY,IACzE,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAChC,cAAc,GAAG,EAAE,CAAA;AAErB;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,IAAY,EAAyB,EAAE;IACjE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IACvD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,KAAK,CAAC,GAAG,EAAE,CAAA;IACpC,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,IAAY,EACZ,OAA4D,EACtD,EAAE;IACR,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;IAC/B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAA;IAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IAChF,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,OAAO,CAAC;QAC1C,SAAS;QACT,OAAO;QACP,UAAU;KACX,CAAA;AACH,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,KAAa,EAAU,EAAE,CAC3E,WAAW,KAAK,OAAO,KAAK,IAAI,IAAI,yBAAyB,CAAA","sourcesContent":["/**\n * Shared text paging, numbering, and byte-budget helpers.\n *\n * Every limit here is a display budget, not a policy limit: exceeding one is\n * always disclosed to the model rather than silently applied.\n *\n * @since 1.0.0\n */\n\n/**\n * Default number of lines or entries returned by a paged flow.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const DEFAULT_READ_LIMIT = 2_000\n\n/**\n * Maximum number of directory entries or glob paths returned in one call.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_ENTRIES = 1_000\n\n/**\n * Maximum number of grep matches returned in one call.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_GREP_MATCHES = 200\n\n/**\n * Maximum number of Unicode scalar values displayed for a single line.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_LINE_CHARS = 2_000\n\n/**\n * Maximum UTF-8 byte budget for one rendered text payload.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_OUTPUT_BYTES = 60_000\n\n/**\n * Maximum UTF-8 byte budget captured per shell output stream.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_SHELL_OUTPUT_BYTES = 30_000\n\n/**\n * A byte-budgeted rendering of a text value.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Truncation {\n  readonly text: string\n  readonly truncated: boolean\n  readonly keptBytes: number\n  readonly droppedBytes: number\n}\n\n/**\n * One page of source lines.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Page {\n  readonly lines: ReadonlyArray<string>\n  readonly startLine: number\n  readonly endLine: number\n  readonly totalLines: number\n}\n\nconst encoder = new TextEncoder()\nconst fatalDecoder = new TextDecoder(\"utf-8\", { fatal: true })\n\n/**\n * Trims a string to a UTF-8 byte budget without splitting a code point.\n *\n * `keep: \"head\"` retains the beginning of the value; `keep: \"tail\"` retains\n * the end, which is what shell output needs because the interesting part of an\n * overflowing stream is almost always its last lines.\n *\n * @category rendering\n * @since 1.0.0\n */\nexport const truncateBytes = (\n  text: string,\n  maxBytes: number,\n  options: { readonly keep: \"head\" | \"tail\" }\n): Truncation => {\n  const bytes = encoder.encode(text)\n  if (bytes.byteLength <= maxBytes) {\n    return { text, truncated: false, keptBytes: bytes.byteLength, droppedBytes: 0 }\n  }\n  let start = options.keep === \"head\" ? 0 : bytes.byteLength - maxBytes\n  let end = options.keep === \"head\" ? maxBytes : bytes.byteLength\n  // TextEncoder produces valid UTF-8. Moving a cut inward reaches a scalar\n  // boundary after at most three continuation bytes, so decoding must succeed.\n  while (true) {\n    try {\n      const decoded = fatalDecoder.decode(bytes.subarray(start, end))\n      const keptBytes = end - start\n      return {\n        text: decoded,\n        truncated: true,\n        keptBytes,\n        droppedBytes: bytes.byteLength - keptBytes\n      }\n    } catch {\n      if (options.keep === \"head\") end--\n      else start++\n    }\n  }\n}\n\n/**\n * Joins the start and the end of a stream cut in the middle around one line\n * naming the bytes cut between them.\n *\n * The line stands alone, so a start that stops mid-line is ended before it.\n * Only the line's own newlines are added; `droppedBytes` counts printed bytes.\n *\n * @category rendering\n * @since 1.0.0-rc.5\n */\nexport const elideMiddle = (start: string, droppedBytes: number, end: string): string =>\n  `${start}${start === \"\" || start.endsWith(\"\\n\") ? \"\" : \"\\n\"}[${droppedBytes} ${\n    droppedBytes === 1 ? \"byte\" : \"bytes\"\n  } omitted]\\n${end}`\n\n/**\n * Splits on LF without counting a terminal LF as a line.\n * Carriage returns remain part of each line, including the CR in CRLF, so\n * joining a page with LF preserves its bytes except for the final LF.\n *\n * @category parsing\n * @since 1.0.0\n */\nexport const sourceLines = (text: string): ReadonlyArray<string> => {\n  const lines = text.length === 0 ? [] : text.split(\"\\n\")\n  if (text.endsWith(\"\\n\")) lines.pop()\n  return lines\n}\n\n/**\n * Selects a 1-based page of lines from a text value.\n *\n * @category paging\n * @since 1.0.0\n */\nexport const slice = (\n  text: string,\n  options: { readonly offset: number; readonly limit: number }\n): Page => {\n  const lines = sourceLines(text)\n  const totalLines = lines.length\n  const startLine = Math.max(1, options.offset)\n  const endLine = Math.min(totalLines, startLine + Math.max(0, options.limit) - 1)\n  return {\n    lines: lines.slice(startLine - 1, endLine),\n    startLine,\n    endLine,\n    totalLines\n  }\n}\n\n/**\n * Renders the disclosure appended whenever output was capped.\n *\n * @category rendering\n * @since 1.0.0\n */\nexport const notice = (unit: string, shown: number, total: number): string =>\n  `Showing ${shown} of ${total} ${unit}; output was truncated.`\n"]}

package/dist/esm/internal/Url.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Shared validation for outbound HTTP URLs.
+ *
+ * @since 1.0.0
+ */
+/**
+ * Parses an HTTP or HTTPS URL without admitting credentials or hostless URLs.
+ *
+ * @category parsing
+ * @since 1.0.0
+ */
+export declare const parseHttpUrl: (value: string, base?: URL) => URL | undefined;
+//# sourceMappingURL=Url.d.ts.map

package/dist/esm/internal/Url.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Url.d.ts","sourceRoot":"","sources":["../../../src/internal/Url.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;GAKG;AACH,eAAO,MAAM,YAAY,GAAI,OAAO,MAAM,EAAE,OAAO,GAAG,KAAG,GAAG,GAAG,SAU9D,CAAA"}

package/dist/esm/internal/Url.js

@@ -0,0 +1,27 @@
+/**
+ * Shared validation for outbound HTTP URLs.
+ *
+ * @since 1.0.0
+ */
+/**
+ * Parses an HTTP or HTTPS URL without admitting credentials or hostless URLs.
+ *
+ * @category parsing
+ * @since 1.0.0
+ */
+export const parseHttpUrl = (value, base) => {
+    if (value.trim() === "")
+        return undefined;
+    try {
+        const url = base === undefined ? new URL(value) : new URL(value, base);
+        if (url.protocol !== "http:" && url.protocol !== "https:")
+            return undefined;
+        if (url.hostname === "" || url.username !== "" || url.password !== "")
+            return undefined;
+        return url;
+    }
+    catch {
+        return undefined;
+    }
+};
+//# sourceMappingURL=Url.js.map

package/dist/esm/internal/Url.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Url.js","sourceRoot":"","sources":["../../../src/internal/Url.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAa,EAAE,IAAU,EAAmB,EAAE;IACzE,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,SAAS,CAAA;IACzC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACtE,IAAI,GAAG,CAAC,QAAQ,KAAK,OAAO,IAAI,GAAG,CAAC,QAAQ,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAA;QAC3E,IAAI,GAAG,CAAC,QAAQ,KAAK,EAAE,IAAI,GAAG,CAAC,QAAQ,KAAK,EAAE,IAAI,GAAG,CAAC,QAAQ,KAAK,EAAE;YAAE,OAAO,SAAS,CAAA;QACvF,OAAO,GAAG,CAAA;IACZ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAA;IAClB,CAAC;AACH,CAAC,CAAA","sourcesContent":["/**\n * Shared validation for outbound HTTP URLs.\n *\n * @since 1.0.0\n */\n\n/**\n * Parses an HTTP or HTTPS URL without admitting credentials or hostless URLs.\n *\n * @category parsing\n * @since 1.0.0\n */\nexport const parseHttpUrl = (value: string, base?: URL): URL | undefined => {\n  if (value.trim() === \"\") return undefined\n  try {\n    const url = base === undefined ? new URL(value) : new URL(value, base)\n    if (url.protocol !== \"http:\" && url.protocol !== \"https:\") return undefined\n    if (url.hostname === \"\" || url.username !== \"\" || url.password !== \"\") return undefined\n    return url\n  } catch {\n    return undefined\n  }\n}\n"]}

package/dist/esm/internal/Walk.d.ts

@@ -0,0 +1,72 @@
+/**
+ * The directory names a repository walk never descends into.
+ *
+ * `grep` and `glob` walk with the kernel filesystem, and every entry costs a
+ * guarded stat. A walk rooted at "." that descends into `.git` visits tens of
+ * thousands of object files no search wants: one such `grep` held a benchmark
+ * frame for its entire fifteen-minute ceiling. The skip set is the same
+ * convention ripgrep ships — version control, dependency trees, and caches —
+ * and an explicit root inside a skipped directory still walks, because
+ * skipping applies to descent, never to what the caller named.
+ *
+ * @since 1.0.0
+ */
+import type * as Path from "@smthrs/kernel/Path";
+import { Effect } from "effect";
+import type * as FileSystem from "effect/FileSystem";
+import type * as StdError from "../StdError.ts";
+/**
+ * Directory basenames excluded from recursive descent.
+ *
+ * @category constants
+ * @since 1.0.0
+ */
+export declare const skippedDirectories: ReadonlySet<string>;
+/**
+ * Separates pattern path segments with slashes while preserving POSIX filenames.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const relativeForPattern: (path: Path.Path, from: string, to: string) => string;
+/**
+ * Answers whether each path is a symbolic link, which neither peer follows.
+ *
+ * `FileSystem.stat` resolves links, so the only probe available is `readLink`,
+ * and every probe is one more call in a loop that already makes one per entry.
+ * The walk therefore probes directories, where following a link would duplicate
+ * a subtree or loop forever, and the callers probe the far smaller set of files
+ * they are about to report — batched, never one at a time.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const symbolicLinks: (fileSystem: FileSystem.FileSystem, candidates: ReadonlyArray<string>) => Effect.Effect<ReadonlyArray<boolean>>;
+/**
+ * One walk: admitted files, explicit-root status, and ignore exclusions.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export interface Walked {
+    readonly ignored: boolean;
+    readonly explicitFile: boolean;
+    readonly files: ReadonlyArray<string>;
+}
+/**
+ * Lists the files a search under `root` reaches.
+ *
+ * Only the root the caller named is allowed to fail the walk. Every entry
+ * below it that the process cannot inspect — a dangling symlink, a symlink
+ * loop, a directory it may not list — is skipped and the walk continues, which
+ * is what `rg --no-messages` does with the same tree. Turning one of those into
+ * a typed failure would make a whole repository unsearchable because of one
+ * link, and would answer differently from the native peer. Only .gitignore
+ * files within this root are read; ignored directories are never descended.
+ * `included` narrows the empty-result diagnostic without changing descent.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const files: (fileSystem: FileSystem.FileSystem, path: Path.Path, root: string, hidden: boolean, noIgnore?: boolean, included?: (relative: string, basename: string) => boolean) => Effect.Effect<Walked, StdError.StdError>;
+//# sourceMappingURL=Walk.d.ts.map

package/dist/esm/internal/Walk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Walk.d.ts","sourceRoot":"","sources":["../../../src/internal/Walk.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAC/B,OAAO,KAAK,KAAK,UAAU,MAAM,mBAAmB,CAAA;AACpD,OAAO,KAAK,KAAK,QAAQ,MAAM,gBAAgB,CAAA;AAK/C;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,WAAW,CAAC,MAAM,CAAwC,CAAA;AAa3F;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,GAAI,MAAM,IAAI,CAAC,IAAI,EAAE,MAAM,MAAM,EAAE,IAAI,MAAM,KAAG,MAG9E,CAAA;AAED;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,aAAa,GACxB,YAAY,UAAU,CAAC,UAAU,EACjC,YAAY,aAAa,CAAC,MAAM,CAAC,KAChC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAKpC,CAAA;AAEH;;;;;GAKG;AACH,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACtC;AAED;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,KAAK,GAChB,YAAY,UAAU,CAAC,UAAU,EACjC,MAAM,IAAI,CAAC,IAAI,EACf,MAAM,MAAM,EACZ,QAAQ,OAAO,EACf,kBAAgB,EAChB,WAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,OAAoB,KACrE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAmEtC,CAAA"}