@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/governance/boundary-fixtures.js

@@ -1,201 +1,2 @@
-/**
- * @module sdk/boundary-fixtures
- *
- * Validates captured external-boundary samples and explicit time-bounded
- * waivers without allowing production code to manufacture its own fixtures.
- */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="3edb1f4f-d26e-51a8-b62a-caffdd3ac44b")}catch(e){}}();
-import { isRfc3339DateTime } from "../../core/shared/time.js";
-/** Evidence source accepted for a captured boundary sample. */
-export const BOUNDARY_FIXTURE_CAPTURE_SOURCES = [
-    "captured_redacted",
-    "captured_verbatim",
-];
-const SECRET_OR_PRIVATE_PATTERNS = [
-    { label: "home directory", pattern: /(?:\/home\/|\/Users\/)[^/\s"']+/u },
-    { label: "GitHub token", pattern: /\b(?:gh[oprsu]_[A-Za-z0-9_]{20,})\b/u },
-    { label: "npm token", pattern: /\bnpm_[A-Za-z0-9]{20,}\b/u },
-    {
-        label: "private key",
-        pattern: /-----BEGIN (?:RSA |EC |OPENSSH )?PRIVATE KEY-----/u,
-    },
-];
-function nonEmpty(value) {
-    return typeof value === "string" && value.trim().length > 0;
-}
-function validateSample(boundary, sample) {
-    if (typeof sample !== "object" || sample === null || Array.isArray(sample)) {
-        return [
-            {
-                boundary_id: boundary.id,
-                kind: "invalid_fixture",
-                detail: `${boundary.fixture_path} must contain a JSON object.`,
-            },
-        ];
-    }
-    const fixture = sample;
-    const findings = [];
-    if (fixture.boundary_id !== boundary.id) {
-        findings.push({
-            boundary_id: boundary.id,
-            kind: "fixture_boundary_mismatch",
-            detail: `${boundary.fixture_path} names ${String(fixture.boundary_id)} instead of ${boundary.id}.`,
-        });
-    }
-    if (fixture.version !== 1 ||
-        !BOUNDARY_FIXTURE_CAPTURE_SOURCES.includes(fixture.capture_source) ||
-        !nonEmpty(fixture.capture_provenance) ||
-        !Array.isArray(fixture.redactions) ||
-        !fixture.redactions.every(nonEmpty) ||
-        !("input" in fixture) ||
-        !("observed" in fixture)) {
-        findings.push({
-            boundary_id: boundary.id,
-            kind: "invalid_fixture",
-            detail: `${boundary.fixture_path} lacks captured provenance, redaction metadata, input, or observed output.`,
-        });
-    }
-    const serialized = JSON.stringify(sample);
-    for (const sensitive of SECRET_OR_PRIVATE_PATTERNS) {
-        if (sensitive.pattern.test(serialized)) {
-            findings.push({
-                boundary_id: boundary.id,
-                kind: "unsafe_fixture",
-                detail: `${boundary.fixture_path} contains a possible ${sensitive.label}.`,
-            });
-        }
-    }
-    return findings;
-}
-/** Evaluate the independent validity and expiry rules for one waiver record. */
-function evaluateBoundaryWaiver(boundary, nowMs) {
-    const expiresAt = Date.parse(boundary.waiver_expires_at);
-    const validWaiver = nonEmpty(boundary.waiver_reason) &&
-        nonEmpty(boundary.waiver_owner) &&
-        boundary.waiver_expires_at.endsWith("Z") &&
-        isRfc3339DateTime(boundary.waiver_expires_at) &&
-        Number.isFinite(expiresAt);
-    return {
-        captured: 0,
-        waived: validWaiver && expiresAt >= nowMs ? 1 : 0,
-        findings: !validWaiver
-            ? [
-                {
-                    boundary_id: boundary.id,
-                    kind: "invalid_waiver",
-                    detail: `Boundary ${boundary.id} waiver requires reason, owner, and an RFC 3339 UTC expiry.`,
-                },
-            ]
-            : expiresAt < nowMs
-                ? [
-                    {
-                        boundary_id: boundary.id,
-                        kind: "expired_waiver",
-                        detail: `Boundary ${boundary.id} waiver expired at ${boundary.waiver_expires_at}.`,
-                    },
-                ]
-                : [],
-    };
-}
-function evaluateBoundaryRecord(boundary, fixtures, nowMs) {
-    if (!nonEmpty(boundary.id) ||
-        !nonEmpty(boundary.producer) ||
-        !nonEmpty(boundary.consumer) ||
-        !nonEmpty(boundary.format)) {
-        const boundaryId = nonEmpty(boundary.id) ? boundary.id : "unknown";
-        return {
-            captured: 0,
-            waived: 0,
-            findings: [
-                {
-                    boundary_id: boundaryId,
-                    kind: "invalid_boundary",
-                    detail: "Each boundary requires non-empty id, producer, consumer, and format.",
-                },
-            ],
-        };
-    }
-    if ("fixture_path" in boundary) {
-        const sample = fixtures[boundary.fixture_path];
-        const findings = nonEmpty(boundary.fixture_path) && boundary.fixture_path in fixtures
-            ? validateSample(boundary, sample)
-            : [
-                {
-                    boundary_id: boundary.id,
-                    kind: "missing_fixture",
-                    detail: `Boundary ${boundary.id} fixture ${String(boundary.fixture_path)} is missing.`,
-                },
-            ];
-        return {
-            captured: findings.length === 0 ? 1 : 0,
-            waived: 0,
-            findings,
-        };
-    }
-    return evaluateBoundaryWaiver(boundary, nowMs);
-}
-/** Validate an untrusted boundary registry and its already-loaded JSON samples. */
-export function evaluateBoundaryFixtures(registry, fixtures, now = new Date()) {
-    const findings = [];
-    if (registry.version !== 1 ||
-        !nonEmpty(registry.inventory_scope) ||
-        !Array.isArray(registry.boundaries)) {
-        return {
-            ok: false,
-            boundary_count: 0,
-            captured_count: 0,
-            waived_count: 0,
-            findings: [
-                {
-                    boundary_id: "registry",
-                    kind: "invalid_registry",
-                    detail: "Boundary registry requires version 1, inventory_scope, and boundaries.",
-                },
-            ],
-        };
-    }
-    const ids = new Set();
-    let capturedCount = 0;
-    let waivedCount = 0;
-    for (const candidate of registry.boundaries) {
-        if (typeof candidate !== "object" ||
-            candidate === null ||
-            Array.isArray(candidate)) {
-            findings.push({
-                boundary_id: "unknown",
-                kind: "invalid_boundary",
-                detail: "Each boundary must be a JSON object.",
-            });
-            continue;
-        }
-        const boundary = candidate;
-        const boundaryId = nonEmpty(boundary.id) ? boundary.id : undefined;
-        if (boundaryId !== undefined && ids.has(boundaryId)) {
-            findings.push({
-                boundary_id: boundaryId,
-                kind: "duplicate_boundary",
-                detail: `Boundary ${boundaryId} is inventoried more than once.`,
-            });
-            continue;
-        }
-        if (boundaryId !== undefined)
-            ids.add(boundaryId);
-        const evaluated = evaluateBoundaryRecord(boundary, fixtures, now.getTime());
-        capturedCount += evaluated.captured;
-        waivedCount += evaluated.waived;
-        findings.push(...evaluated.findings);
-    }
-    findings.sort((left, right) => left.boundary_id !== right.boundary_id
-        ? left.boundary_id.localeCompare(right.boundary_id)
-        : left.kind.localeCompare(right.kind));
-    return {
-        ok: findings.length === 0,
-        boundary_count: registry.boundaries.length,
-        captured_count: capturedCount,
-        waived_count: waivedCount,
-        findings,
-    };
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="aa6b9997-a4c6-5bfb-8804-45b34afd9e01")}catch(e2){}})();import{isRfc3339DateTime}from"../../core/shared/time.js";const BOUNDARY_FIXTURE_CAPTURE_SOURCES=["captured_redacted","captured_verbatim"];const SECRET_OR_PRIVATE_PATTERNS=[{label:"home directory",pattern:/(?:\/home\/|\/Users\/)[^/\s"']+/u},{label:"GitHub token",pattern:/\b(?:gh[oprsu]_[A-Za-z0-9_]{20,})\b/u},{label:"npm token",pattern:/\bnpm_[A-Za-z0-9]{20,}\b/u},{label:"private key",pattern:/-----BEGIN (?:RSA |EC |OPENSSH )?PRIVATE KEY-----/u}];function nonEmpty(value){return typeof value==="string"&&value.trim().length>0}function validateSample(boundary,sample){if(typeof sample!=="object"||sample===null||Array.isArray(sample)){return[{boundary_id:boundary.id,kind:"invalid_fixture",detail:`${boundary.fixture_path} must contain a JSON object.`}]}const fixture=sample;const findings=[];if(fixture.boundary_id!==boundary.id){findings.push({boundary_id:boundary.id,kind:"fixture_boundary_mismatch",detail:`${boundary.fixture_path} names ${String(fixture.boundary_id)} instead of ${boundary.id}.`})}if(fixture.version!==1||!BOUNDARY_FIXTURE_CAPTURE_SOURCES.includes(fixture.capture_source)||!nonEmpty(fixture.capture_provenance)||!Array.isArray(fixture.redactions)||!fixture.redactions.every(nonEmpty)||!("input"in fixture)||!("observed"in fixture)){findings.push({boundary_id:boundary.id,kind:"invalid_fixture",detail:`${boundary.fixture_path} lacks captured provenance, redaction metadata, input, or observed output.`})}const serialized=JSON.stringify(sample);for(const sensitive of SECRET_OR_PRIVATE_PATTERNS){if(sensitive.pattern.test(serialized)){findings.push({boundary_id:boundary.id,kind:"unsafe_fixture",detail:`${boundary.fixture_path} contains a possible ${sensitive.label}.`})}}return findings}function evaluateBoundaryWaiver(boundary,nowMs){const expiresAt=Date.parse(boundary.waiver_expires_at);const validWaiver=nonEmpty(boundary.waiver_reason)&&nonEmpty(boundary.waiver_owner)&&boundary.waiver_expires_at.endsWith("Z")&&isRfc3339DateTime(boundary.waiver_expires_at)&&Number.isFinite(expiresAt);return{captured:0,waived:validWaiver&&expiresAt>=nowMs?1:0,findings:!validWaiver?[{boundary_id:boundary.id,kind:"invalid_waiver",detail:`Boundary ${boundary.id} waiver requires reason, owner, and an RFC 3339 UTC expiry.`}]:expiresAt<nowMs?[{boundary_id:boundary.id,kind:"expired_waiver",detail:`Boundary ${boundary.id} waiver expired at ${boundary.waiver_expires_at}.`}]:[]}}function evaluateBoundaryRecord(boundary,fixtures,nowMs){if(!nonEmpty(boundary.id)||!nonEmpty(boundary.producer)||!nonEmpty(boundary.consumer)||!nonEmpty(boundary.format)){const boundaryId=nonEmpty(boundary.id)?boundary.id:"unknown";return{captured:0,waived:0,findings:[{boundary_id:boundaryId,kind:"invalid_boundary",detail:"Each boundary requires non-empty id, producer, consumer, and format."}]}}if("fixture_path"in boundary){const sample=fixtures[boundary.fixture_path];const findings=nonEmpty(boundary.fixture_path)&&boundary.fixture_path in fixtures?validateSample(boundary,sample):[{boundary_id:boundary.id,kind:"missing_fixture",detail:`Boundary ${boundary.id} fixture ${String(boundary.fixture_path)} is missing.`}];return{captured:findings.length===0?1:0,waived:0,findings}}return evaluateBoundaryWaiver(boundary,nowMs)}function evaluateBoundaryFixtures(registry,fixtures,now=new Date){const findings=[];if(registry.version!==1||!nonEmpty(registry.inventory_scope)||!Array.isArray(registry.boundaries)){return{ok:false,boundary_count:0,captured_count:0,waived_count:0,findings:[{boundary_id:"registry",kind:"invalid_registry",detail:"Boundary registry requires version 1, inventory_scope, and boundaries."}]}}const ids=new Set;let capturedCount=0;let waivedCount=0;for(const candidate of registry.boundaries){if(typeof candidate!=="object"||candidate===null||Array.isArray(candidate)){findings.push({boundary_id:"unknown",kind:"invalid_boundary",detail:"Each boundary must be a JSON object."});continue}const boundary=candidate;const boundaryId=nonEmpty(boundary.id)?boundary.id:void 0;if(boundaryId!==void 0&&ids.has(boundaryId)){findings.push({boundary_id:boundaryId,kind:"duplicate_boundary",detail:`Boundary ${boundaryId} is inventoried more than once.`});continue}if(boundaryId!==void 0)ids.add(boundaryId);const evaluated=evaluateBoundaryRecord(boundary,fixtures,now.getTime());capturedCount+=evaluated.captured;waivedCount+=evaluated.waived;findings.push(...evaluated.findings)}findings.sort((left,right)=>left.boundary_id!==right.boundary_id?left.boundary_id.localeCompare(right.boundary_id):left.kind.localeCompare(right.kind));return{ok:findings.length===0,boundary_count:registry.boundaries.length,captured_count:capturedCount,waived_count:waivedCount,findings}}export{BOUNDARY_FIXTURE_CAPTURE_SOURCES,evaluateBoundaryFixtures};
 //# sourceMappingURL=boundary-fixtures.js.map
-//# debugId=3edb1f4f-d26e-51a8-b62a-caffdd3ac44b

package/dist/sdk/governance/coverage-assurance.js

@@ -1,61 +1,2 @@
-/**
- * @module sdk/governance/coverage-assurance
- *
- * Provides exact integer coverage assurance for repository and package gates.
- */
-/** Coverage metrics required by the exact repository quality contract. */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="340305b6-e3c8-5daa-bfbe-4a9c62a6d039")}catch(e){}}();
-export const PM_EXACT_COVERAGE_METRICS = [
-    "lines",
-    "branches",
-    "functions",
-    "statements",
-];
-/** Require a coverage report entry to expose an object-shaped metric map. */
-function assertCoverageEntry(file, entry) {
-    if (typeof entry !== "object" || entry === null || Array.isArray(entry)) {
-        throw new TypeError(`Coverage entry for ${file} must be an object.`);
-    }
-}
-/** Return exact validated counts for one required metric. */
-function coverageCounts(file, metric, value) {
-    if (typeof value !== "object" || value === null || Array.isArray(value)) {
-        throw new TypeError(`Coverage entry ${file} has invalid ${metric} counts.`);
-    }
-    const counts = value;
-    if (typeof counts.covered !== "number" ||
-        typeof counts.total !== "number" ||
-        !Number.isInteger(counts.covered) ||
-        !Number.isInteger(counts.total) ||
-        counts.covered < 0 ||
-        counts.total < counts.covered) {
-        throw new TypeError(`Coverage entry ${file} has invalid ${metric} counts.`);
-    }
-    return { covered: counts.covered, total: counts.total };
-}
-/** Return exact uncovered counts for every summary entry and required metric. */
-export function findCoverageDeficits(summary) {
-    if (typeof summary !== "object" ||
-        summary === null ||
-        Array.isArray(summary)) {
-        throw new TypeError("Coverage summary must be a JSON object.");
-    }
-    if (!("total" in summary)) {
-        throw new TypeError("Coverage summary is missing the total entry.");
-    }
-    const deficits = [];
-    for (const [file, entry] of Object.entries(summary)) {
-        assertCoverageEntry(file, entry);
-        for (const metric of PM_EXACT_COVERAGE_METRICS) {
-            const counts = coverageCounts(file, metric, entry[metric]);
-            const uncovered = counts.total - counts.covered;
-            if (uncovered > 0) {
-                deficits.push({ file, metric, uncovered, ...counts });
-            }
-        }
-    }
-    return deficits;
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="b84b220f-cad0-5861-b3ed-07453179706e")}catch(e2){}})();const PM_EXACT_COVERAGE_METRICS=["lines","branches","functions","statements"];function assertCoverageEntry(file,entry){if(typeof entry!=="object"||entry===null||Array.isArray(entry)){throw new TypeError(`Coverage entry for ${file} must be an object.`)}}function coverageCounts(file,metric,value){if(typeof value!=="object"||value===null||Array.isArray(value)){throw new TypeError(`Coverage entry ${file} has invalid ${metric} counts.`)}const counts=value;if(typeof counts.covered!=="number"||typeof counts.total!=="number"||!Number.isInteger(counts.covered)||!Number.isInteger(counts.total)||counts.covered<0||counts.total<counts.covered){throw new TypeError(`Coverage entry ${file} has invalid ${metric} counts.`)}return{covered:counts.covered,total:counts.total}}function findCoverageDeficits(summary){if(typeof summary!=="object"||summary===null||Array.isArray(summary)){throw new TypeError("Coverage summary must be a JSON object.")}if(!("total"in summary)){throw new TypeError("Coverage summary is missing the total entry.")}const deficits=[];for(const[file,entry]of Object.entries(summary)){assertCoverageEntry(file,entry);for(const metric of PM_EXACT_COVERAGE_METRICS){const counts=coverageCounts(file,metric,entry[metric]);const uncovered=counts.total-counts.covered;if(uncovered>0){deficits.push({file,metric,uncovered,...counts})}}}return deficits}export{PM_EXACT_COVERAGE_METRICS,findCoverageDeficits};
 //# sourceMappingURL=coverage-assurance.js.map
-//# debugId=340305b6-e3c8-5daa-bfbe-4a9c62a6d039

package/dist/sdk/governance/defect-recurrence-coverage.js

@@ -1,189 +1,2 @@
-/**
- * @module sdk/governance/defect-recurrence-coverage
- *
- * Measures policy coverage against all recorded recurrence components and pages
- * the uncovered evidence without allowing pagination to weaken the verdict.
- */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="ef2edfdc-7166-5cfc-adf1-fc8c69dfab1c")}catch(e){}}();
-import { createHash } from "node:crypto";
-import { stableStringify } from "../../core/shared/serialization.js";
-import { DEFECT_ESCAPE_CLASSES, parseDefectRecurrencePolicy, parseDefectChangeRiskRequest, } from "./defect-recurrence.js";
-import { buildDefectRecurrenceGraph, readDefectRecurrenceRecord, } from "./defect-recurrence-graph.js";
-/** Validate lineage-policy and paging input at the untrusted transport boundary. */
-export function parseDefectRecurrenceCoverageRequest(value) {
-    if (typeof value !== "object" || value === null || Array.isArray(value)) {
-        throw new TypeError("recurrence coverage request must be an object");
-    }
-    const input = value;
-    if (Object.hasOwn(input, "change")) {
-        throw new TypeError("recurrence coverage request does not accept change");
-    }
-    if (input.uncoveredOnly !== undefined &&
-        typeof input.uncoveredOnly !== "boolean") {
-        throw new TypeError("recurrence coverage request.uncoveredOnly must be a boolean");
-    }
-    const { policy, cursor, limit } = parseDefectChangeRiskRequest({
-        ...input,
-        change: {},
-    });
-    return {
-        policy,
-        ...(cursor === undefined ? {} : { cursor }),
-        ...(limit === undefined ? {} : { limit }),
-        ...(input.uncoveredOnly === undefined
-            ? {}
-            : { uncoveredOnly: input.uncoveredOnly }),
-    };
-}
-/** Decode a cursor only when its evidence identity and safe integer offset match. */
-function coverageOffset(cursor, fingerprint) {
-    if (cursor === undefined)
-        return 0;
-    let value;
-    try {
-        value = JSON.parse(Buffer.from(cursor, "base64url").toString("utf8"));
-    }
-    catch {
-        throw new TypeError("recurrence coverage cursor is invalid");
-    }
-    if (typeof value !== "object" || value === null || Array.isArray(value)) {
-        throw new TypeError("recurrence coverage cursor is invalid");
-    }
-    const record = value;
-    if (record.fingerprint !== fingerprint ||
-        typeof record.offset !== "number" ||
-        !Number.isSafeInteger(record.offset) ||
-        record.offset < 0) {
-        throw new TypeError("recurrence coverage cursor does not match this evidence and filter");
-    }
-    return record.offset;
-}
-/** Count the complete graph and hash its evidence before selecting any page. */
-function summarizeCoverage(graph, records, knownIds, ids, identity, uncoveredOnly) {
-    const classCounts = Object.fromEntries(DEFECT_ESCAPE_CLASSES.map((key) => [key, 0]));
-    let coveredCount = 0;
-    let uncoveredCount = 0;
-    let missingCount = 0;
-    let classifiedCount = 0;
-    const selected = [];
-    const hash = createHash("sha256").update(identity);
-    for (const id of ids) {
-        const lineage = graph.membership.get(id);
-        const present = knownIds.has(id);
-        const covered = lineage.family_ids.length > 0;
-        if (covered && present)
-            coveredCount += 1;
-        if (!covered)
-            uncoveredCount += 1;
-        if (!present)
-            missingCount += 1;
-        const classification = records.get(id)?.escape_class;
-        if (classification !== undefined &&
-            DEFECT_ESCAPE_CLASSES.includes(classification)) {
-            classCounts[classification] += 1;
-            classifiedCount += 1;
-        }
-        hash.update(stableStringify([
-            id,
-            present,
-            records.get(id) ?? null,
-            lineage.id,
-            lineage.family_ids,
-        ]));
-        if (!uncoveredOnly || !covered || !present)
-            selected.push(id);
-    }
-    return {
-        classCounts,
-        coveredCount,
-        uncoveredCount,
-        missingCount,
-        classifiedCount,
-        selected,
-        fingerprint: hash.digest("hex"),
-    };
-}
-/** Evaluate all local recurs_from lineages before applying any result-row limit. */
-export function analyzeDefectRecurrenceCoverage(policy, items, options = {}) {
-    parseDefectRecurrencePolicy(policy);
-    const limit = options.limit ?? 25;
-    if (!Number.isSafeInteger(limit) || limit < 1 || limit > 100) {
-        throw new TypeError("recurrence coverage limit must be an integer from 1 through 100");
-    }
-    const knownIds = new Set();
-    const records = new Map();
-    for (const item of items) {
-        if (knownIds.has(item.id))
-            throw new TypeError(`Duplicate recurrence item ${item.id}`);
-        knownIds.add(item.id);
-        const record = readDefectRecurrenceRecord(item);
-        if (record !== undefined)
-            records.set(item.id, record);
-    }
-    const graph = buildDefectRecurrenceGraph(policy.families, records);
-    const ids = [...graph.membership.keys()].sort();
-    const identity = stableStringify({
-        policy,
-        uncoveredOnly: options.uncoveredOnly === true,
-    });
-    const { classCounts, coveredCount, uncoveredCount, missingCount, classifiedCount, selected, fingerprint, } = summarizeCoverage(graph, records, knownIds, ids, identity, options.uncoveredOnly === true);
-    const offset = coverageOffset(options.cursor, fingerprint);
-    if (offset > selected.length)
-        throw new TypeError("recurrence coverage cursor offset exceeds the selected population");
-    const page = selected
-        .slice(offset, offset + limit)
-        .map((id) => {
-        const lineage = graph.membership.get(id);
-        const present = knownIds.has(id);
-        return {
-            item_id: id,
-            lineage_id: lineage.id,
-            lineage_item_count: lineage.item_ids.length,
-            family_ids: lineage.family_ids,
-            present,
-            ...(!present
-                ? { finding: "missing_recurrence_item" }
-                : lineage.family_ids.length === 0
-                    ? { finding: "unregistered_recurrence_item" }
-                    : {}),
-        };
-    });
-    const nextOffset = offset + page.length;
-    const lowerBound = ids.length === 0 ? null : classCounts.production_defect / ids.length;
-    return {
-        ok: uncoveredCount === 0 && missingCount === 0,
-        fingerprint,
-        items: page,
-        total: selected.length,
-        has_more: nextOffset < selected.length,
-        ...(nextOffset < selected.length
-            ? {
-                next_cursor: Buffer.from(JSON.stringify({ fingerprint, offset: nextOffset })).toString("base64url"),
-            }
-            : {}),
-        population: {
-            scope: "all_recorded_recurrence_items",
-            item_count: ids.length,
-            lineage_count: graph.lineages.length,
-            edge_count: graph.edge_count,
-            covered_item_count: coveredCount,
-            uncovered_item_count: uncoveredCount,
-            missing_item_count: missingCount,
-            classified_item_count: classifiedCount,
-            unclassified_item_count: ids.length - classifiedCount,
-            class_counts: classCounts,
-            escape_rate: classifiedCount === ids.length ? lowerBound : null,
-            escape_rate_lower_bound: lowerBound,
-        },
-        budget_scope: "registered_families_only",
-        cost: {
-            items_scanned: items.length,
-            edges_scanned: graph.edge_count,
-            row_limit: limit,
-        },
-        row_contract: { row_keys: ["items"], jq_selector: ".items[]" },
-    };
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="538168d9-116c-5e72-81a4-a23e021c48f5")}catch(e2){}})();import{createHash}from"node:crypto";import{stableStringify}from"../../core/shared/serialization.js";import{DEFECT_ESCAPE_CLASSES,parseDefectRecurrencePolicy,parseDefectChangeRiskRequest}from"./defect-recurrence.js";import{buildDefectRecurrenceGraph,readDefectRecurrenceRecord}from"./defect-recurrence-graph.js";function parseDefectRecurrenceCoverageRequest(value){if(typeof value!=="object"||value===null||Array.isArray(value)){throw new TypeError("recurrence coverage request must be an object")}const input=value;if(Object.hasOwn(input,"change")){throw new TypeError("recurrence coverage request does not accept change")}if(input.uncoveredOnly!==void 0&&typeof input.uncoveredOnly!=="boolean"){throw new TypeError("recurrence coverage request.uncoveredOnly must be a boolean")}const{policy,cursor,limit}=parseDefectChangeRiskRequest({...input,change:{}});return{policy,...cursor===void 0?{}:{cursor},...limit===void 0?{}:{limit},...input.uncoveredOnly===void 0?{}:{uncoveredOnly:input.uncoveredOnly}}}function coverageOffset(cursor,fingerprint){if(cursor===void 0)return 0;let value;try{value=JSON.parse(Buffer.from(cursor,"base64url").toString("utf8"))}catch{throw new TypeError("recurrence coverage cursor is invalid")}if(typeof value!=="object"||value===null||Array.isArray(value)){throw new TypeError("recurrence coverage cursor is invalid")}const record=value;if(record.fingerprint!==fingerprint||typeof record.offset!=="number"||!Number.isSafeInteger(record.offset)||record.offset<0){throw new TypeError("recurrence coverage cursor does not match this evidence and filter")}return record.offset}function summarizeCoverage(graph,records,knownIds,ids,identity,uncoveredOnly){const classCounts=Object.fromEntries(DEFECT_ESCAPE_CLASSES.map(key=>[key,0]));let coveredCount=0;let uncoveredCount=0;let missingCount=0;let classifiedCount=0;const selected=[];const hash=createHash("sha256").update(identity);for(const id of ids){const lineage=graph.membership.get(id);const present=knownIds.has(id);const covered=lineage.family_ids.length>0;if(covered&&present)coveredCount+=1;if(!covered)uncoveredCount+=1;if(!present)missingCount+=1;const classification=records.get(id)?.escape_class;if(classification!==void 0&&DEFECT_ESCAPE_CLASSES.includes(classification)){classCounts[classification]+=1;classifiedCount+=1}hash.update(stableStringify([id,present,records.get(id)??null,lineage.id,lineage.family_ids]));if(!uncoveredOnly||!covered||!present)selected.push(id)}return{classCounts,coveredCount,uncoveredCount,missingCount,classifiedCount,selected,fingerprint:hash.digest("hex")}}function analyzeDefectRecurrenceCoverage(policy,items,options={}){parseDefectRecurrencePolicy(policy);const limit=options.limit??25;if(!Number.isSafeInteger(limit)||limit<1||limit>100){throw new TypeError("recurrence coverage limit must be an integer from 1 through 100")}const knownIds=new Set;const records=new Map;for(const item of items){if(knownIds.has(item.id))throw new TypeError(`Duplicate recurrence item ${item.id}`);knownIds.add(item.id);const record=readDefectRecurrenceRecord(item);if(record!==void 0)records.set(item.id,record)}const graph=buildDefectRecurrenceGraph(policy.families,records);const ids=[...graph.membership.keys()].sort();const identity=stableStringify({policy,uncoveredOnly:options.uncoveredOnly===true});const{classCounts,coveredCount,uncoveredCount,missingCount,classifiedCount,selected,fingerprint}=summarizeCoverage(graph,records,knownIds,ids,identity,options.uncoveredOnly===true);const offset=coverageOffset(options.cursor,fingerprint);if(offset>selected.length)throw new TypeError("recurrence coverage cursor offset exceeds the selected population");const page=selected.slice(offset,offset+limit).map(id=>{const lineage=graph.membership.get(id);const present=knownIds.has(id);return{item_id:id,lineage_id:lineage.id,lineage_item_count:lineage.item_ids.length,family_ids:lineage.family_ids,present,...!present?{finding:"missing_recurrence_item"}:lineage.family_ids.length===0?{finding:"unregistered_recurrence_item"}:{}}});const nextOffset=offset+page.length;const lowerBound=ids.length===0?null:classCounts.production_defect/ids.length;return{ok:uncoveredCount===0&&missingCount===0,fingerprint,items:page,total:selected.length,has_more:nextOffset<selected.length,...nextOffset<selected.length?{next_cursor:Buffer.from(JSON.stringify({fingerprint,offset:nextOffset})).toString("base64url")}:{},population:{scope:"all_recorded_recurrence_items",item_count:ids.length,lineage_count:graph.lineages.length,edge_count:graph.edge_count,covered_item_count:coveredCount,uncovered_item_count:uncoveredCount,missing_item_count:missingCount,classified_item_count:classifiedCount,unclassified_item_count:ids.length-classifiedCount,class_counts:classCounts,escape_rate:classifiedCount===ids.length?lowerBound:null,escape_rate_lower_bound:lowerBound},budget_scope:"registered_families_only",cost:{items_scanned:items.length,edges_scanned:graph.edge_count,row_limit:limit},row_contract:{row_keys:["items"],jq_selector:".items[]"}}}export{analyzeDefectRecurrenceCoverage,parseDefectRecurrenceCoverageRequest};
 //# sourceMappingURL=defect-recurrence-coverage.js.map
-//# debugId=ef2edfdc-7166-5cfc-adf1-fc8c69dfab1c

package/dist/sdk/governance/defect-recurrence-graph.js

@@ -1,121 +1,2 @@
-/**
- * @module sdk/governance/defect-recurrence-graph
- *
- * Derives recurrence families from local recorded edges. Association, hierarchy,
- * external references, and matching file globs never establish family coverage.
- */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="9d171110-2de0-5fa2-ae85-5a4e3ab4d46e")}catch(e){}}();
-import { isExternalDependencyReference, isExternalDependencySourceKind, } from "../../core/item/dependency-reference.js";
-/** Extract local recurrence targets while rejecting malformed and external edges. */
-function recurrenceTargets(item) {
-    const targets = new Set();
-    for (const edge of Array.isArray(item.dependencies)
-        ? item.dependencies
-        : []) {
-        if (typeof edge !== "object" || edge === null || Array.isArray(edge))
-            continue;
-        if (edge.kind !== "recurs_from")
-            continue;
-        if (typeof edge.id !== "string" || !edge.id.trim())
-            continue;
-        if (isExternalDependencyReference(edge.id) ||
-            isExternalDependencySourceKind(typeof edge.source_kind === "string" ? edge.source_kind : undefined))
-            continue;
-        targets.add(edge.id.trim());
-    }
-    return [...targets].sort();
-}
-/** Extract project-scoped exact file triggers from untrusted linked-file records. */
-function recurrenceFiles(item) {
-    const files = new Set();
-    for (const file of Array.isArray(item.files) ? item.files : []) {
-        if (typeof file !== "object" || file === null || Array.isArray(file))
-            continue;
-        const entry = file;
-        if (entry.scope !== undefined && entry.scope !== "project")
-            continue;
-        if (typeof entry.path === "string" && entry.path.trim())
-            files.add(entry.path.trim());
-    }
-    return [...files].sort();
-}
-/** Read a sparse projection without retaining full item bodies or history. */
-export function readDefectRecurrenceRecord(item) {
-    const targets = recurrenceTargets(item);
-    const files = recurrenceFiles(item);
-    const escapeClass = typeof item.escape_class === "string" ? item.escape_class : undefined;
-    if (targets.length === 0 && files.length === 0 && escapeClass === undefined)
-        return undefined;
-    return {
-        targets,
-        files,
-        ...(escapeClass === undefined ? {} : { escape_class: escapeClass }),
-    };
-}
-/** Traverse one component iteratively and collect only explicitly seeded families. */
-function traverseLineage(start, adjacency, seeds, membership) {
-    const lineage = {
-        id: start,
-        item_ids: [],
-        family_ids: [],
-    };
-    const pending = [start];
-    const familyIds = new Set();
-    membership.set(start, lineage);
-    while (pending.length > 0) {
-        const id = pending.pop();
-        lineage.item_ids.push(id);
-        for (const familyId of seeds.get(id) ?? [])
-            familyIds.add(familyId);
-        for (const target of adjacency.get(id)) {
-            if (membership.has(target))
-                continue;
-            membership.set(target, lineage);
-            pending.push(target);
-        }
-    }
-    lineage.item_ids.sort();
-    lineage.id = lineage.item_ids[0];
-    lineage.family_ids = [...familyIds].sort();
-    return lineage;
-}
-/** Build iterative undirected connectivity from directed recurrence evidence. */
-export function buildDefectRecurrenceGraph(families, records) {
-    const adjacency = new Map();
-    let edgeCount = 0;
-    for (const [id, record] of records) {
-        for (const target of new Set(record.targets)) {
-            const outgoing = adjacency.get(id) ?? new Set();
-            outgoing.add(target);
-            adjacency.set(id, outgoing);
-            const incoming = adjacency.get(target) ?? new Set();
-            incoming.add(id);
-            adjacency.set(target, incoming);
-            edgeCount += 1;
-        }
-    }
-    const seeds = new Map();
-    for (const family of families) {
-        for (const id of [
-            family.owner_item_id,
-            ...family.historical_item_ids,
-            ...(family.triggers.item_ids ?? []),
-        ]) {
-            const ids = seeds.get(id) ?? new Set();
-            ids.add(family.id);
-            seeds.set(id, ids);
-        }
-    }
-    const membership = new Map();
-    const lineages = [];
-    for (const start of adjacency.keys()) {
-        if (membership.has(start))
-            continue;
-        lineages.push(traverseLineage(start, adjacency, seeds, membership));
-    }
-    lineages.sort((left, right) => (left.id < right.id ? -1 : 1));
-    return { lineages, membership, edge_count: edgeCount };
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="8d87a4e8-5853-52ca-8fdf-1433e2a9e75d")}catch(e2){}})();import{isExternalDependencyReference,isExternalDependencySourceKind}from"../../core/item/dependency-reference.js";function recurrenceTargets(item){const targets=new Set;for(const edge of Array.isArray(item.dependencies)?item.dependencies:[]){if(typeof edge!=="object"||edge===null||Array.isArray(edge))continue;if(edge.kind!=="recurs_from")continue;if(typeof edge.id!=="string"||!edge.id.trim())continue;if(isExternalDependencyReference(edge.id)||isExternalDependencySourceKind(typeof edge.source_kind==="string"?edge.source_kind:void 0))continue;targets.add(edge.id.trim())}return[...targets].sort()}function recurrenceFiles(item){const files=new Set;for(const file of Array.isArray(item.files)?item.files:[]){if(typeof file!=="object"||file===null||Array.isArray(file))continue;const entry=file;if(entry.scope!==void 0&&entry.scope!=="project")continue;if(typeof entry.path==="string"&&entry.path.trim())files.add(entry.path.trim())}return[...files].sort()}function readDefectRecurrenceRecord(item){const targets=recurrenceTargets(item);const files=recurrenceFiles(item);const escapeClass=typeof item.escape_class==="string"?item.escape_class:void 0;if(targets.length===0&&files.length===0&&escapeClass===void 0)return void 0;return{targets,files,...escapeClass===void 0?{}:{escape_class:escapeClass}}}function traverseLineage(start,adjacency,seeds,membership){const lineage={id:start,item_ids:[],family_ids:[]};const pending=[start];const familyIds=new Set;membership.set(start,lineage);while(pending.length>0){const id=pending.pop();lineage.item_ids.push(id);for(const familyId of seeds.get(id)??[])familyIds.add(familyId);for(const target of adjacency.get(id)){if(membership.has(target))continue;membership.set(target,lineage);pending.push(target)}}lineage.item_ids.sort();lineage.id=lineage.item_ids[0];lineage.family_ids=[...familyIds].sort();return lineage}function buildDefectRecurrenceGraph(families,records){const adjacency=new Map;let edgeCount=0;for(const[id,record]of records){for(const target of new Set(record.targets)){const outgoing=adjacency.get(id)??new Set;outgoing.add(target);adjacency.set(id,outgoing);const incoming=adjacency.get(target)??new Set;incoming.add(id);adjacency.set(target,incoming);edgeCount+=1}}const seeds=new Map;for(const family of families){for(const id of[family.owner_item_id,...family.historical_item_ids,...family.triggers.item_ids??[]]){const ids=seeds.get(id)??new Set;ids.add(family.id);seeds.set(id,ids)}}const membership=new Map;const lineages=[];for(const start of adjacency.keys()){if(membership.has(start))continue;lineages.push(traverseLineage(start,adjacency,seeds,membership))}lineages.sort((left,right)=>left.id<right.id?-1:1);return{lineages,membership,edge_count:edgeCount}}export{buildDefectRecurrenceGraph,readDefectRecurrenceRecord};
 //# sourceMappingURL=defect-recurrence-graph.js.map
-//# debugId=9d171110-2de0-5fa2-ae85-5a4e3ab4d46e

package/dist/sdk/governance/defect-recurrence-signals.js

@@ -1,25 +1,2 @@
-/** Project one PM item to exactly the signals consumed by recurrence indexing. */
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="e78c3363-1741-52b9-8bd5-729e3ccada50")}catch(e){}}();
-export function defectRecurrenceItemSignals(item) {
-    return {
-        files: (Array.isArray(item.files) ? item.files : []).flatMap((entry) => {
-            if (typeof entry !== "object" || entry === null || Array.isArray(entry))
-                return [];
-            const value = entry.path;
-            return typeof value === "string" ? [value] : [];
-        }),
-        package_names: Array.isArray(item.package_names)
-            ? item.package_names.filter((value) => typeof value === "string")
-            : [],
-        item_ids: [item.id],
-        tags: Array.isArray(item.tags)
-            ? item.tags.filter((value) => typeof value === "string")
-            : [],
-        error_codes: Array.isArray(item.error_codes)
-            ? item.error_codes.filter((value) => typeof value === "string")
-            : [],
-    };
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="a14011f9-67eb-5cd6-b520-8e938ada4f1b")}catch(e2){}})();function defectRecurrenceItemSignals(item){return{files:(Array.isArray(item.files)?item.files:[]).flatMap(entry=>{if(typeof entry!=="object"||entry===null||Array.isArray(entry))return[];const value=entry.path;return typeof value==="string"?[value]:[]}),package_names:Array.isArray(item.package_names)?item.package_names.filter(value=>typeof value==="string"):[],item_ids:[item.id],tags:Array.isArray(item.tags)?item.tags.filter(value=>typeof value==="string"):[],error_codes:Array.isArray(item.error_codes)?item.error_codes.filter(value=>typeof value==="string"):[]}}export{defectRecurrenceItemSignals};
 //# sourceMappingURL=defect-recurrence-signals.js.map
-//# debugId=e78c3363-1741-52b9-8bd5-729e3ccada50