@transitrix/diagrams 1.8.21 → 1.9.18

package/dist/compliance/index.d.ts

@@ -5,6 +5,8 @@ export { buildGapReport } from './gap-report.js';
 export type { GapReport, GapReportOptions } from './gap-report.js';
 export { emptyCanon, ingestComplianceDoc } from './classify.js';
 export type { ComplianceCanon, ComplianceProduct, ComplianceCodexDoc } from './classify.js';
+export { CLOSED_VERIFICATION_OUTCOMES } from '../verification/types.js';
+export { CLOSED_VALIDATION_OUTCOMES } from '../validation/types.js';
 export { admitDocumentToCatalog, buildComplianceScan, catalogFromMap, } from './canon-catalog.js';
 export type { ComplianceScanResult, ScannedYamlDoc } from './canon-catalog.js';
 export { renderComplianceMarkdown } from './markdown.js';
@@ -16,4 +18,4 @@ export type { ImpactCell, ImpactColumn, ImpactEmptyCellLabels, ImpactFinding, Im
 export { assertionToScoringElement, complianceConfidenceHeader, requirementToScoringElement, scoreComplianceView, } from './confidence.js';
 export { parseCoverageMetricConfig, buildCoverageMatrix, collectCoverageViewResolutionFindings, } from './coverage-metric.js';
 export type { CoverageMetricConfig, CoverageMetricRegimes, CoverageMetricRegimesFilter, CoverageMetricSubjects, CoverageMetricThresholds, CoverageMatrix, CoverageRow, CoverageViewFinding, ParseCoverageMetricResult, RagStatus, } from './coverage-metric.js';
-export type { ComplianceIndex, ComplianceIndexInput, DeadlineStatus, IndexRequirement, IndexAssertion, LawTree, LawTreeRequirement, ProductView, ProductRequirementStatus, ObjectDetailDef, ObjectDetailInput, RequirementTrace, TraceAssertionRow, TraceElementCatalog, TraceElementRef, TraceSourceRef, } from './types.js';
+export type { ComplianceIndex, ComplianceIndexInput, DeadlineStatus, IndexRequirement, IndexAssertion, IndexVerification, IndexNeed, IndexValidation, LawTree, LawTreeRequirement, ProductView, ProductRequirementStatus, ObjectDetailDef, ObjectDetailInput, RequirementTrace, TraceAssertionRow, TraceVerificationRow, TraceElementCatalog, TraceElementRef, TraceSourceRef, } from './types.js';

package/dist/compliance/index.js

@@ -3,6 +3,8 @@ export { buildLawTree, buildProductView } from './views.js';
 export { buildRequirementTrace, buildTraceElementCatalog } from './trace.js';
 export { buildGapReport } from './gap-report.js';
 export { emptyCanon, ingestComplianceDoc } from './classify.js';
+export { CLOSED_VERIFICATION_OUTCOMES } from '../verification/types.js';
+export { CLOSED_VALIDATION_OUTCOMES } from '../validation/types.js';
 export { admitDocumentToCatalog, buildComplianceScan, catalogFromMap, } from './canon-catalog.js';
 export { renderComplianceMarkdown } from './markdown.js';
 export { renderComplianceHtml, renderImpactMatrixHtml } from './html.js';

package/dist/compliance/markdown.js

@@ -1,4 +1,4 @@
-// Markdown renderers for the compliance views (vkgeorgia/strategy#84 Phase 5).
+// Markdown renderers for the compliance views (Phase 5).
 // Pure string builders consumed by the `transitrix export-compliance` CLI.
 // PDF rendering lives in `html.ts` (HTML doc fed to WeasyPrint by the CLI).
 import { buildComplianceMatrix } from '../compliance-matrix/index.js';
@@ -90,10 +90,16 @@ function productMarkdown(canon, productId) {
     return out.join('\n');
 }
 function gapMarkdown(canon, today) {
-    const index = buildComplianceIndex({ requirements: canon.requirements, assertions: canon.assertions });
+    const index = buildComplianceIndex({
+        requirements: canon.requirements,
+        assertions: canon.assertions,
+        verifications: canon.verifications,
+    });
     const report = buildGapReport(index, { today });
-    const total = report.requirementsWithoutAssertions.length + report.assertionsWithoutEvidence.length + report.staleAssertions.length + report.pastDeadlineRequirements.length;
-    const out = ['# Compliance Gap Dashboard', '', `_${total} gap(s) across 4 checks_`, ''];
+    const total = report.requirementsWithoutAssertions.length + report.assertionsWithoutEvidence.length
+        + report.staleAssertions.length + report.pastDeadlineRequirements.length
+        + report.requirementsWithoutVerification.length + report.requirementsWithUnresolvedVerification.length;
+    const out = ['# Compliance Gap Dashboard', '', `_${total} gap(s) across 6 checks_`, ''];
     out.push(`## Requirements without assertions (${report.requirementsWithoutAssertions.length})`, '');
     if (report.requirementsWithoutAssertions.length === 0)
         out.push('_✓ none_', '');
@@ -126,5 +132,21 @@ function gapMarkdown(canon, today) {
             out.push(`- [ ] \`${r.id}\` ${r.name} — deadline: ${r.deadline ?? '—'}${r.severity ? `, severity: ${r.severity}` : ''}`);
         out.push('');
     }
+    out.push(`## Requirements without verification — REQ-VERIF-COVERAGE-001 (${report.requirementsWithoutVerification.length})`, '');
+    if (report.requirementsWithoutVerification.length === 0)
+        out.push('_✓ none_', '');
+    else {
+        for (const r of report.requirementsWithoutVerification)
+            out.push(`- [ ] \`${r.id}\` ${r.name}${r.severity ? ` — severity: ${r.severity}` : ''}`);
+        out.push('');
+    }
+    out.push(`## Requirements with unresolved verification — REQ-VERIF-COVERAGE-002 (${report.requirementsWithUnresolvedVerification.length})`, '');
+    if (report.requirementsWithUnresolvedVerification.length === 0)
+        out.push('_✓ none_', '');
+    else {
+        for (const r of report.requirementsWithUnresolvedVerification)
+            out.push(`- [ ] \`${r.id}\` ${r.name}${r.severity ? ` — severity: ${r.severity}` : ''}`);
+        out.push('');
+    }
     return out.join('\n');
 }

package/dist/compliance/reverse-index.d.ts

@@ -3,6 +3,11 @@ import type { ComplianceIndex, ComplianceIndexInput } from './types.js';
  * Builds the reverse indexes used by every compliance view. Pure; the input
  * arrays are read, not mutated. Requirements with no `derived_from` simply do
  * not appear under any law; assertions are indexed by both their requirement
- * (`about`) and their subject.
+ * (`about`) and their subject; verifications are indexed by their requirement
+ * (`verifies`) — an independent catalogue from assertions (27-verification.md §4).
+ * Needs are indexed by id; requirements are additionally indexed by the NEED
+ * they `serves` (15-requirement.md §2.7), and validations by the NEED they
+ * `validate` (28-validation.md §2) — both feed the NEED-side coverage rules
+ * (ELEMENT_PRIMITIVES.md §9).
  */
 export declare function buildComplianceIndex(input: ComplianceIndexInput): ComplianceIndex;

package/dist/compliance/reverse-index.js

@@ -1,4 +1,4 @@
-// Reverse-index builder (vkgeorgia/strategy#84 Phase 3).
+// Reverse-index builder (Phase 3).
 function push(map, key, value) {
     const list = map.get(key);
     if (list)
@@ -10,7 +10,12 @@ function push(map, key, value) {
  * Builds the reverse indexes used by every compliance view. Pure; the input
  * arrays are read, not mutated. Requirements with no `derived_from` simply do
  * not appear under any law; assertions are indexed by both their requirement
- * (`about`) and their subject.
+ * (`about`) and their subject; verifications are indexed by their requirement
+ * (`verifies`) — an independent catalogue from assertions (27-verification.md §4).
+ * Needs are indexed by id; requirements are additionally indexed by the NEED
+ * they `serves` (15-requirement.md §2.7), and validations by the NEED they
+ * `validate` (28-validation.md §2) — both feed the NEED-side coverage rules
+ * (ELEMENT_PRIMITIVES.md §9).
  */
 export function buildComplianceIndex(input) {
     const requirementById = new Map();
@@ -18,16 +23,35 @@ export function buildComplianceIndex(input) {
     const assertionsByRequirement = new Map();
     const assertionsBySubject = new Map();
     const requirementsByParent = new Map();
+    const verificationsByRequirement = new Map();
+    const needById = new Map();
+    const requirementsByNeed = new Map();
+    const validationsByNeed = new Map();
     for (const r of input.requirements) {
         requirementById.set(r.id, r);
         for (const law of r.derived_from ?? [])
             push(requirementsByLaw, law, r);
         if (r.parent)
             push(requirementsByParent, r.parent, r);
+        if (r.serves)
+            push(requirementsByNeed, r.serves, r);
     }
     for (const a of input.assertions) {
         push(assertionsByRequirement, a.about, a);
         push(assertionsBySubject, a.subject, a);
     }
-    return { requirementById, requirementsByLaw, assertionsByRequirement, assertionsBySubject, requirementsByParent };
+    for (const v of input.verifications ?? []) {
+        push(verificationsByRequirement, v.verifies, v);
+    }
+    for (const n of input.needs ?? []) {
+        needById.set(n.id, n);
+    }
+    for (const v of input.validations ?? []) {
+        push(validationsByNeed, v.validates, v);
+    }
+    return {
+        requirementById, requirementsByLaw, assertionsByRequirement, assertionsBySubject,
+        requirementsByParent, verificationsByRequirement,
+        needById, requirementsByNeed, validationsByNeed,
+    };
 }

package/dist/compliance/trace.js

@@ -69,9 +69,13 @@ export function buildRequirementTrace(requirementId, index, catalog, codex = [])
         subject: resolveElement(assertion.subject, catalog),
         realisedVia: (assertion.realised_via ?? []).map(rid => resolveElement(rid, catalog)),
     }));
+    const rawVerifications = index.verificationsByRequirement.get(requirementId) ?? [];
+    const verifications = [...rawVerifications]
+        .sort(byId)
+        .map(verification => ({ verification }));
     const ancestors = collectAncestors(requirement, index);
     const children = [...(index.requirementsByParent.get(requirementId) ?? [])].sort(byId);
-    return { requirement, sources, assertions, ancestors, children };
+    return { requirement, sources, assertions, verifications, ancestors, children };
 }
 /**
  * Convenience: build a `TraceElementCatalog` from the scanned canon's product

package/dist/compliance/types.d.ts

@@ -1,4 +1,6 @@
 import type { AssertionStatus } from '../assertion/types.js';
+import type { VerificationMethod, VerificationOutcome } from '../verification/types.js';
+import type { ValidationMethod, ValidationOutcome } from '../validation/types.js';
 import type { ComplianceCodexDoc } from './classify.js';
 /** Projection of a REQUIREMENT (or CONSTRAINT) the compliance views need. */
 export interface IndexRequirement {
@@ -47,6 +49,33 @@ export interface IndexRequirement {
      * Present when the author has scheduled a review; drives `REQ-STALE-001`.
      */
     next_review_at?: string;
+    /**
+     * Typed ID of the upstream `NEED` this requirement traces to
+     * (15-requirement.md §2.7; `REQ-SERVES-001`). Optional, singular. Feeds
+     * `NEED-COVERAGE-001` (ELEMENT_PRIMITIVES.md §9) on the NEED side.
+     */
+    serves?: string;
+}
+/** Projection of a `NEED` element (ELEMENT_PRIMITIVES.md §7.28) the compliance
+ *  views need — just enough to list an unaddressed / unvalidated need. */
+export interface IndexNeed {
+    id: string;
+    name: string;
+}
+/** Projection of a `VALIDATION` claim (28-validation.md §2) the compliance
+ *  views need — the validation-domain peer of `IndexVerification`, anchored
+ *  on NEED instead of REQUIREMENT. */
+export interface IndexValidation {
+    id: string;
+    /** Typed ID of the NEED this validation targets. */
+    validates: string;
+    method: ValidationMethod;
+    outcome: ValidationOutcome;
+    performed_at?: string;
+    /** Number of evidence entries — feeds the VALID-006 gap. */
+    evidenceCount?: number;
+    /** Admission date (CONTRACT §6) — feeds DQ-1 freshness decay. */
+    admitted_at?: string;
 }
 /**
  * Temporal status of a requirement deadline relative to today.
@@ -80,6 +109,19 @@ export interface IndexAssertion {
     /** ID or name of the party who must confirm this assertion (pending-owner state). */
     owner_to_confirm?: string;
 }
+/** Projection of a VERIFICATION the compliance views need (27-verification.md §2). */
+export interface IndexVerification {
+    id: string;
+    /** Typed ID of the REQUIREMENT this verification targets. */
+    verifies: string;
+    method: VerificationMethod;
+    outcome: VerificationOutcome;
+    performed_at?: string;
+    /** Number of evidence entries — feeds the VERIF-006 gap. */
+    evidenceCount?: number;
+    /** Admission date (CONTRACT §6) — feeds DQ-1 freshness decay. */
+    admitted_at?: string;
+}
 /** One stage (or task) element of a business object, used as a matrix sub-column. */
 export interface ObjectDetailDef {
     id: string;
@@ -116,6 +158,12 @@ export interface ObjectDetailInput {
 export interface ComplianceIndexInput {
     requirements: IndexRequirement[];
     assertions: IndexAssertion[];
+    /** Optional — absent inputs (existing callers) simply index no verifications. */
+    verifications?: IndexVerification[];
+    /** Optional — absent inputs (existing callers) simply index no needs. */
+    needs?: IndexNeed[];
+    /** Optional — absent inputs (existing callers) simply index no validations. */
+    validations?: IndexValidation[];
 }
 /** The reverse-index — all maps are keyed by canonical id. */
 export interface ComplianceIndex {
@@ -131,6 +179,18 @@ export interface ComplianceIndex {
      * (15-requirement.md §2.4). Enables the requirement-hierarchy view.
      */
     requirementsByParent: Map<string, IndexRequirement[]>;
+    /** Requirement id → verifications whose `verifies` names it
+     *  (27-verification.md §2). The engineering V&V analogue of
+     *  `assertionsByRequirement` — the two catalogues are independent. */
+    verificationsByRequirement: Map<string, IndexVerification[]>;
+    /** NEED id → needs, keyed by their own id (single-entry lookup convenience). */
+    needById: Map<string, IndexNeed>;
+    /** NEED id → requirements whose `serves` names it (15-requirement.md §2.7).
+     *  Feeds `NEED-COVERAGE-001`. */
+    requirementsByNeed: Map<string, IndexRequirement[]>;
+    /** NEED id → validations whose `validates` names it (28-validation.md §2).
+     *  Feeds `NEED-VALIDATION-COVERAGE-001..002`. */
+    validationsByNeed: Map<string, IndexValidation[]>;
 }
 export interface LawTreeRequirement {
     requirement: IndexRequirement;
@@ -173,6 +233,12 @@ export interface TraceAssertionRow {
     /** Elements named in the assertion's `realised_via` list (may be empty). */
     realisedVia: TraceElementRef[];
 }
+/** One VERIFICATION targeting the traced requirement (27-verification.md §2).
+ *  No subject/realised_via — a verification claims a protocol was run against
+ *  the requirement's acceptance criteria directly (16-assertion.md §4). */
+export interface TraceVerificationRow {
+    verification: IndexVerification;
+}
 /**
  * Requirement traceability + hierarchy view.
  *
@@ -194,6 +260,10 @@ export interface RequirementTrace {
     sources: TraceSourceRef[];
     /** Forward-trace via ASSERTION. Empty for CONSTRAINT elements (16-assertion.md §1) or for a REQUIREMENT with no filed assertion. */
     assertions: TraceAssertionRow[];
+    /** Forward-trace via VERIFICATION (27-verification.md §2). Empty for CONSTRAINT
+     *  elements (the engineering V&V leg applies to REQUIREMENT only, same posture
+     *  as ASSERTION) or for a REQUIREMENT with no filed verification. */
+    verifications: TraceVerificationRow[];
     /** Parent chain: immediate parent first, root last. Empty when the element has no `parent`. */
     ancestors: IndexRequirement[];
     /** Direct children: elements naming this one as their `parent`, id-sorted. */

package/dist/compliance/types.js

@@ -1,5 +1,4 @@
-// Shared compliance reverse-index + derived views (vkgeorgia/strategy#84
-// Phase 3). The reverse-index pass (Law → Requirements, Requirement →
+// Shared compliance reverse-index + derived views (Phase 3). The reverse-index pass (Law → Requirements, Requirement →
 // Assertions, Subject → Assertions) backs the single-law tree and the
 // single-product view here, and the gap dashboard in Phase 4.
 export {};

package/dist/compliance/views.js

@@ -1,4 +1,4 @@
-// Single-law tree + single-product view builders (vkgeorgia/strategy#84 Phase 3).
+// Single-law tree + single-product view builders (Phase 3).
 function byId(a, b) {
     return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;
 }

package/dist/compliance-matrix/types.d.ts

@@ -81,6 +81,6 @@ export interface MatrixFilter {
     statuses?: AssertionStatus[];
     /** Keep only requirement columns whose resolved jurisdictions intersect this
      *  set. Requirements with no resolved jurisdiction are filtered out when this
-     *  is non-empty (F16, epic #84). */
+     *  is non-empty (F16). */
     jurisdictions?: string[];
 }

package/dist/compliance-matrix/types.js

@@ -1,4 +1,4 @@
-// Compliance matrix model (vkgeorgia/strategy#84 Phase 2).
+// Compliance matrix model (Phase 2).
 //
 // The matrix is Products × Requirements. Each cell is the status of the
 // (Product, Requirement) ASSERTION when one exists, or a gap when none does.

package/dist/confidence/score.js

@@ -2,7 +2,7 @@
 // callers (Studio previews, DSM React) pass already-resolved element inputs
 // and a `today` reference; this module returns the per-element scores and
 // the view composite. Lives in @transitrix/diagrams so Studio and DSM share
-// one implementation (see vkgeorgia/strategy#159 — DQ-1).
+// one implementation (DQ-1).
 /** §11.3 implicit defaults — used when the adopter omits `confidence_decay`. */
 export const IMPLICIT_DECAY_DEFAULTS = {
     fresh_days: 180,

package/dist/constraint/validate.js

@@ -1,6 +1,7 @@
 // CONSTRAINT validator — methodology ELEMENT_PRIMITIVES.md §7.13 (sibling to
 // 15-requirement.md). Implements CONST-001..005 for the compliance suite (#518 C4).
 import { typeOfId, isCanonicalIdOfType } from '../typed-id.js';
+import { checkAgreement } from '../agreement.js';
 import { CONSTRAINT_STATUSES, CONSTRAINT_SEVERITIES } from './types.js';
 const REQUIRED_FIELDS = [
     'notation',
@@ -111,5 +112,7 @@ export function validateConstraint(input, options = {}) {
             });
         }
     }
+    // AGREE-001..003 — agreement axis (CONTRACT.md §6.3.1), optional; absent ⇒ agreed.
+    errors.push(...checkAgreement(c));
     return { valid: errors.length === 0, errors, warnings };
 }

package/dist/edge-path.js

@@ -5,7 +5,7 @@
 // arrow reads as perpendicular to the node's vertical edge.
 //
 // Pulling the path math here (rather than duplicating it inline in each
-// preview) makes the configurable-curvature behaviour (vkgeorgia/strategy#76)
+// preview) makes the configurable-curvature behaviour
 // unit-testable — the extension has no test harness.
 /**
  * Base handle length floor + span factors. The handle grows with both the

package/dist/factor/validate.js

@@ -24,8 +24,8 @@ export function validateFactor(input, options = {}) {
     }
     const f = input;
     // FACTOR-001 — id grammar + notation tag + envelope.
-    if (!isCanonicalIdOfType(f.id, 'FACTOR')) {
-        errors.push({ code: 'FACTOR-001', message: `id "${String(f.id)}" must match FACTOR-[<middle>-]<INTEGER>.`, path: 'id' });
+    if (!isCanonicalIdOfType(f.id, 'DRIVER')) {
+        errors.push({ code: 'FACTOR-001', message: `id "${String(f.id)}" must match DRIVER-[<middle>-]<INTEGER>.`, path: 'id' });
     }
     if (f.notation !== 'driver') {
         errors.push({ code: 'FACTOR-001', message: 'notation must be the fixed value "driver".', path: 'notation' });

package/dist/fgca/chain-table.js

@@ -1,4 +1,4 @@
-// Chain-table model for the FGCA / FGA previews (vkgeorgia/strategy#137).
+// Chain-table model for the FGCA / FGA previews.
 //
 // The tree/chain preview (`layoutFGCAPreview`) shows Driver → Goal → Change →
 // Activity as columns of nodes joined by edges. This module produces the

package/dist/fgca/nodeTypes.d.ts

@@ -1,6 +1,6 @@
 export declare const FGCA_NODE_TYPES: {
-    readonly fgcaDriver: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAFactorNode").FGCADriverNodeProps) => import("react/jsx-runtime").JSX.Element>;
-    readonly fgcaGoal: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAGoalNode").FGCAGoalNodeProps) => import("react/jsx-runtime").JSX.Element>;
-    readonly fgcaChange: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAChangeNode").FGCAChangeNodeProps) => import("react/jsx-runtime").JSX.Element>;
-    readonly fgcaActivity: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAActivityNode").FGCAActivityNodeProps) => import("react/jsx-runtime").JSX.Element>;
+    readonly fgcaDriver: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAFactorNode").FGCADriverNodeProps) => import("react").JSX.Element>;
+    readonly fgcaGoal: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAGoalNode").FGCAGoalNodeProps) => import("react").JSX.Element>;
+    readonly fgcaChange: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAChangeNode").FGCAChangeNodeProps) => import("react").JSX.Element>;
+    readonly fgcaActivity: import("react").MemoExoticComponent<({ data, isConnectable }: import("./nodes/FGCAActivityNode").FGCAActivityNodeProps) => import("react").JSX.Element>;
 };

package/dist/fgca/nodes/FGCAActivityNode.d.ts

@@ -9,5 +9,5 @@ export interface FGCAActivityNodeProps {
     };
     isConnectable?: boolean;
 }
-declare const FGCAActivityNode: React.MemoExoticComponent<({ data, isConnectable }: FGCAActivityNodeProps) => import("react/jsx-runtime").JSX.Element>;
+declare const FGCAActivityNode: React.MemoExoticComponent<({ data, isConnectable }: FGCAActivityNodeProps) => React.JSX.Element>;
 export default FGCAActivityNode;

package/dist/fgca/nodes/FGCAChangeNode.d.ts

@@ -8,5 +8,5 @@ export interface FGCAChangeNodeProps {
     };
     isConnectable?: boolean;
 }
-declare const FGCAChangeNode: React.MemoExoticComponent<({ data, isConnectable }: FGCAChangeNodeProps) => import("react/jsx-runtime").JSX.Element>;
+declare const FGCAChangeNode: React.MemoExoticComponent<({ data, isConnectable }: FGCAChangeNodeProps) => React.JSX.Element>;
 export default FGCAChangeNode;

package/dist/fgca/nodes/FGCAFactorNode.d.ts

@@ -8,5 +8,5 @@ export interface FGCADriverNodeProps {
     };
     isConnectable?: boolean;
 }
-declare const FGCADriverNode: React.MemoExoticComponent<({ data, isConnectable }: FGCADriverNodeProps) => import("react/jsx-runtime").JSX.Element>;
+declare const FGCADriverNode: React.MemoExoticComponent<({ data, isConnectable }: FGCADriverNodeProps) => React.JSX.Element>;
 export default FGCADriverNode;

package/dist/fgca/nodes/FGCAGoalNode.d.ts

@@ -10,5 +10,5 @@ export interface FGCAGoalNodeProps {
     };
     isConnectable?: boolean;
 }
-declare const FGCAGoalNode: React.MemoExoticComponent<({ data, isConnectable }: FGCAGoalNodeProps) => import("react/jsx-runtime").JSX.Element>;
+declare const FGCAGoalNode: React.MemoExoticComponent<({ data, isConnectable }: FGCAGoalNodeProps) => React.JSX.Element>;
 export default FGCAGoalNode;

package/dist/fgca/parse-canonical.d.ts

@@ -17,7 +17,7 @@
  * historically but the layout code only uses IDs as opaque keys, so
  * string IDs work fine.
  *
- * Strategy hub #63: this lives at the input boundary so the library's
+ * This lives at the input boundary so the library's
  * internal types (currently using DSM-API form — numeric IDs and
  * singular cross-refs) can stay where they are. A follow-up task can
  * unify the internal types with the canonical form across all sister
@@ -49,7 +49,7 @@ export interface CanonicalFGAResult extends ValidationResult {
  * FGA-001..011). The resulting internal `FGCADoc` carries `activity.goal_id`,
  * which is exactly what the renderer needs to draw goal → activity edges —
  * the field whose absence produced the "FGA nodes render, no edges" bug
- * (transitrix/methodology#65 / vkgeorgia/strategy#65).
+ * (transitrix/methodology#65).
  *
  * Lives beside `parseCanonicalFGCA` (rather than inline in the extension) so
  * the canonical FGA path is unit-testable and the library owns the single

package/dist/fgca/parse-canonical.js

@@ -17,7 +17,7 @@
  * historically but the layout code only uses IDs as opaque keys, so
  * string IDs work fine.
  *
- * Strategy hub #63: this lives at the input boundary so the library's
+ * This lives at the input boundary so the library's
  * internal types (currently using DSM-API form — numeric IDs and
  * singular cross-refs) can stay where they are. A follow-up task can
  * unify the internal types with the canonical form across all sister
@@ -301,7 +301,7 @@ const FGA_DOC_ID_RE = /^(FGA|DGA)(-[A-Z0-9][A-Z0-9_]*)*-\d+$/;
  * FGA-001..011). The resulting internal `FGCADoc` carries `activity.goal_id`,
  * which is exactly what the renderer needs to draw goal → activity edges —
  * the field whose absence produced the "FGA nodes render, no edges" bug
- * (transitrix/methodology#65 / vkgeorgia/strategy#65).
+ * (transitrix/methodology#65).
  *
  * Lives beside `parseCanonicalFGCA` (rather than inline in the extension) so
  * the canonical FGA path is unit-testable and the library owns the single

package/dist/fgca/preview-layout.d.ts

@@ -37,7 +37,7 @@ export interface FGCAPreviewLayoutOptions {
     colGap?: number;
     /** Vertical gap (px) between stacked nodes within a column. Default matches the historical hardcoded value. */
     rowGap?: number;
-    /** Trim to a level cap or a single root goal (vkgeorgia/strategy#77). Defaults to 'all'. */
+    /** Trim to a level cap or a single root goal. Defaults to 'all'. */
     scope?: Scope;
     /** Entity node width (px). Default {@link FGCA_NODE_W}. */
     nodeWidth?: number;

package/dist/goals/GoalNode.d.ts

@@ -15,5 +15,5 @@ export interface GoalNodeData {
 }
 declare const GoalNode: React.MemoExoticComponent<({ data }: {
     data: GoalNodeData;
-}) => import("react/jsx-runtime").JSX.Element>;
+}) => React.JSX.Element>;
 export default GoalNode;

package/dist/goals/layout.d.ts

@@ -1,7 +1,7 @@
 import type { Goal, GoalTree, LayoutOptions, GoalTreeLayout } from './types.js';
 import type { Scope } from '../scope.js';
 /**
- * Trims a flat goal list to a scope (vkgeorgia/strategy#77).
+ * Trims a flat goal list to a scope.
  *   - 'level' → goals with `level <= maxLevel`.
  *   - 'root'  → the root goal (matched by string id) plus all its descendants
  *               via `parent_id`; an empty list when the root is absent.

package/dist/goals/layout.js

@@ -4,7 +4,7 @@ const DEFAULT_NODE_HEIGHT = 80;
 const DEFAULT_RANK_SEP = 80;
 const DEFAULT_NODE_SEP = 40;
 /**
- * Trims a flat goal list to a scope (vkgeorgia/strategy#77).
+ * Trims a flat goal list to a scope.
  *   - 'level' → goals with `level <= maxLevel`.
  *   - 'root'  → the root goal (matched by string id) plus all its descendants
  *               via `parent_id`; an empty list when the root is absent.

package/dist/goals/parse-canonical.d.ts

@@ -15,7 +15,7 @@
  * mapped to internal sequential numbers, `parent: GOAL-X` becomes
  * `parent_id: <numeric>`, `parent_id: 0` denotes a root.
  *
- * Strategy hub #63: this lives at the input boundary so the library's
+ * This lives at the input boundary so the library's
  * internal types (numeric IDs) stay where they are. Convergence on
  * canonical typed-string IDs across all sister modules is a follow-up
  * task.

package/dist/goals/parse-canonical.js

@@ -15,7 +15,7 @@
  * mapped to internal sequential numbers, `parent: GOAL-X` becomes
  * `parent_id: <numeric>`, `parent_id: 0` denotes a root.
  *
- * Strategy hub #63: this lives at the input boundary so the library's
+ * This lives at the input boundary so the library's
  * internal types (numeric IDs) stay where they are. Convergence on
  * canonical typed-string IDs across all sister modules is a follow-up
  * task.

package/dist/goals/types.d.ts

@@ -44,7 +44,7 @@ export interface LayoutOptions {
     nodeSep?: number;
     hideCollapsed?: number[];
     viewDepth?: number | null;
-    /** Trim the tree to a level cap or a subtree root (vkgeorgia/strategy#77). Defaults to 'all'. */
+    /** Trim the tree to a level cap or a subtree root. Defaults to 'all'. */
     scope?: Scope;
 }
 export interface LaidOutNode {

package/dist/goals/validate.js

@@ -15,7 +15,7 @@ export function validateGoalTree(input) {
         return { valid: false, errors, warnings };
     const tree = raw;
     // GOALS-013 — goal_types[].level values must be contiguous starting from 0.
-    // Per the N+1 rule (decision in vkgeorgia/strategy#66), the level set must
+    // Per the N+1 rule, the level set must
     // be exactly {0, 1, …, N}; a gap breaks the parent→child level invariant
     // and means GOALS-012 cannot be enforced consistently.
     const levels = tree.goal_types
@@ -84,7 +84,7 @@ export function validateGoalTree(input) {
             continue;
         }
         // GOALS-012 — parent must be exactly one level above the child (N+1
-        // hierarchy, decision in vkgeorgia/strategy#66). Only enforced when the
+        // hierarchy). Only enforced when the
         // parent is resolvable; a missing parent is covered by BROKEN_PARENT_REF.
         if (g.parent_id !== 0) {
             const parentLevel = levelById.get(g.parent_id);

package/dist/link-suspicion.d.ts

@@ -0,0 +1,43 @@
+export declare const ENVELOPE_FIELDS: string[];
+/** Every non-blank, non-comment line of the file, except those belonging to
+ *  an `ENVELOPE_FIELDS` block (the key line and its more-indented
+ *  continuation lines), whitespace-normalised and sorted —
+ *  order-independent, formatting-independent, comment-independent. Not a
+ *  general YAML parser — a flat, line-oriented pass over the already-known
+ *  envelope field names, the same posture the methodology reference script
+ *  takes (its own header comment cites `baseline-manifest.mjs` /
+ *  `check-agreement.mjs` for precedent). */
+export declare function statementLines(text: string): string[];
+export interface LineEdit {
+    from: string;
+    to: string;
+}
+/** A parsed `migrations/<slug>/TRANSFORM.yaml` manifest (§16.3). */
+export interface MigrationManifest {
+    slug: string;
+    mechanical: boolean;
+    appliesTo: string[];
+    lineEdits: LineEdit[];
+}
+/** Minimal parse of the fixed `TRANSFORM.yaml` shape — `mechanical: true`,
+ *  `applies_to: [exact relative paths]`, `line_edits: [{from, to}]`. Not a
+ *  general YAML parser, same posture as {@link statementLines}. */
+export declare function parseMigrationManifest(text: string): Omit<MigrationManifest, 'slug'>;
+export interface SuspicionResult {
+    suspicious: boolean;
+    /** True when a manifest declared `mechanical: true` for this target but
+     *  its replay did not fully explain the change — the hatch does not
+     *  self-grant; suspicion stands regardless of the flag (§16.3). */
+    hatchRefused?: boolean;
+}
+/**
+ * §16.2: *Suspicious* ⟺ the target's content identity at the anchor commit
+ * differs from its content identity now, **and** §16.3's hatch does not
+ * explain the difference.
+ *
+ * `beforeText` / `afterText` are already-fetched (git IO lives in the
+ * caller); `undefined` for either (no anchor, or the target no longer
+ * exists) means nothing to compare — not suspicious, per the reference
+ * script's `target-absent-at-anchor` / `target-absent-now` cases.
+ */
+export declare function checkSuspicion(beforeText: string | undefined, afterText: string | undefined, applicableManifests?: Array<Omit<MigrationManifest, 'slug'>>): SuspicionResult;