@principles/core 1.241.0 → 1.243.0

package/dist/runtime-v2/internalization/candidate-lineage.d.ts

@@ -0,0 +1,136 @@
+/**
+ * Layer 2 — CandidateLineage: on-demand ancestry traversal (design §6.4).
+ *
+ * Pure logic with **injected** I/O (artifact store + task reader). Walks an
+ * artifact's ancestry via `lineageArtifactIds`, determining each node's stage
+ * by the two-hop `artifact.sourceTaskId → task.taskKind` (F1 — never by
+ * `artifactKind`, which is ambiguous: all internalization artifacts are
+ * `principle`).
+ *
+ * Result contract (rc-9, design §6.4 error table):
+ *   - data corruption (unparseable / shape-invalid / store-throw) → `ok: false`
+ *     + a `LineageError`; the caller MUST surface it as an explicit failure or
+ *     structured degradation — never silently fall through.
+ *   - expected absence (no lineage ids / ancestor pruned / task missing / depth
+ *     limit / cycle) → `ok: true` with a partial chain + notes; `complete` is
+ *     false and `notes` is non-empty.
+ *
+ * Request-scoped cache: a single `CandidateLineage` instance lives for one
+ * `buildContext`; repeated `getArtifactById` calls for the same id hit the
+ * cache, not the store (CP-18).
+ *
+ * rc-1: every `contentJson` stays `unknown` — it is never narrowed or cast.
+ */
+import type { PIArtifactStore } from './pi-artifact.js';
+import type { ArtifactSummary, SummaryRunnerKind } from './artifact-summary.js';
+export interface LineageNode {
+    readonly artifactId: string;
+    readonly taskId: string;
+    /** Stage determined by the two-hop sourceTaskId → task.taskKind (F1). */
+    readonly taskKind: string;
+    readonly runnerKind: SummaryRunnerKind | 'unknown';
+    /** rc-1: remains `unknown`; the caller narrows it. */
+    readonly contentJson: unknown;
+    readonly summary?: ArtifactSummary;
+}
+export type LineageNoteCode = 'source_trace_missing' | 'ancestor_pruned' | 'task_missing' | 'depth_limit_reached' | 'cycle_detected';
+export interface LineageNote {
+    readonly code: LineageNoteCode;
+    readonly artifactId: string;
+    readonly detail: string;
+}
+export interface LineageChain {
+    /** From start node upstream, in traversal order. */
+    readonly nodes: readonly LineageNode[];
+    /** false when notes is non-empty (partial chain). */
+    readonly complete: boolean;
+    readonly notes: readonly LineageNote[];
+}
+export type LineageError = {
+    readonly kind: 'content_json_unparseable';
+    readonly artifactId: string;
+    readonly detail: string;
+} | {
+    readonly kind: 'artifact_shape_invalid';
+    readonly artifactId: string;
+    readonly detail: string;
+} | {
+    readonly kind: 'store_failure';
+    readonly detail: string;
+};
+export type LineageResult = {
+    readonly ok: true;
+    readonly value: LineageChain;
+} | {
+    readonly ok: false;
+    readonly error: LineageError;
+};
+/** Lineage telemetry event (forwarded to the caller's emit, if provided). */
+export type LineageEvent = {
+    readonly type: 'lineage_data_corrupt';
+    readonly artifactId: string;
+    readonly detail: string;
+    readonly errorKind: LineageError['kind'];
+} | {
+    readonly type: 'lineage_store_failure';
+    readonly detail: string;
+} | {
+    readonly type: 'lineage_partial';
+    readonly artifactId: string;
+    readonly noteCode: LineageNoteCode;
+    readonly detail: string;
+};
+/** Two-hop task reader (F1) — resolves taskKind from a taskId. */
+export interface LineageTaskReader {
+    getTaskById(taskId: string): Promise<{
+        readonly taskId: string;
+        readonly taskKind: string;
+    } | null>;
+}
+export interface CandidateLineageDeps {
+    readonly artifacts: Pick<PIArtifactStore, 'getArtifactById'>;
+    readonly tasks: LineageTaskReader;
+    /** Default 6 (longest pipeline chain + 1). */
+    readonly maxDepth?: number;
+    readonly emit?: (event: LineageEvent) => void;
+}
+export declare class CandidateLineage {
+    private readonly artifacts;
+    private readonly tasks;
+    private readonly maxDepth;
+    private readonly emit;
+    /** request-scoped: artifactId → resolved record (or null if known-absent). */
+    private readonly cache;
+    /** request-scoped: taskId → resolved taskKind (or null). */
+    private readonly taskCache;
+    constructor(deps: CandidateLineageDeps);
+    /**
+     * Resolve the full ancestry chain starting from `startArtifactId`.
+     * Walks `lineageArtifactIds` upstream, building an ordered node list.
+     */
+    resolve(startArtifactId: string): Promise<LineageResult>;
+    /**
+     * Find the nearest ancestor node with a given `taskKind` (F1 — never by
+     * `artifactKind`). Returns `{ ok: true, node: null }` when no ancestor
+     * matches (a valid result, not an error).
+     */
+    findAncestorByTaskKind(startArtifactId: string, taskKind: string): Promise<{
+        readonly ok: true;
+        readonly node: LineageNode | null;
+        readonly notes: readonly LineageNote[];
+    } | {
+        readonly ok: false;
+        readonly error: LineageError;
+    }>;
+    /**
+     * Iterative BFS resolution with cycle detection (via `visited`) and depth
+     * limiting. `visited` carries artifactIds already resolved (prevents cycles
+     * and redundant fetches across the whole traversal, not just one path).
+     */
+    private resolveChain;
+    /** Cached artifact fetch. Returns `ok:false` on store failure or corruption. */
+    private getArtifactCached;
+    /** Cached task fetch (two-hop). Returns `ok:false` only on reader failure (treated as store_failure). */
+    private getTaskCached;
+}
+//# sourceMappingURL=candidate-lineage.d.ts.map

package/dist/runtime-v2/internalization/candidate-lineage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-lineage.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/candidate-lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,KAAK,EAAoB,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC1E,OAAO,KAAK,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAKhF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yEAAyE;IACzE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,iBAAiB,GAAG,SAAS,CAAC;IACnD,sDAAsD;IACtD,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,eAAe,CAAC;CACpC;AAED,MAAM,MAAM,eAAe,GACvB,sBAAsB,GACtB,iBAAiB,GACjB,cAAc,GACd,qBAAqB,GACrB,gBAAgB,CAAC;AAErB,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,YAAY;IAC3B,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,SAAS,WAAW,EAAE,CAAC;IACvC,qDAAqD;IACrD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,WAAW,EAAE,CAAC;CACxC;AAED,MAAM,MAAM,YAAY,GACpB;IAAE,QAAQ,CAAC,IAAI,EAAE,0BAA0B,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACnG;IAAE,QAAQ,CAAC,IAAI,EAAE,wBAAwB,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACjG;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEhE,MAAM,MAAM,aAAa,GACrB;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAA;CAAE,GACnD;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAA;CAAE,CAAC;AAEzD,6EAA6E;AAC7E,MAAM,MAAM,YAAY,GACpB;IAAE,QAAQ,CAAC,IAAI,EAAE,sBAAsB,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;CAAE,GACzI;IAAE,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACnE;IAAE,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnI,kEAAkE;AAClE,MAAM,WAAW,iBAAiB;IAChC,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC,CAAC;CACrG;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,EAAE,iBAAiB,CAAC,CAAC;IAC7D,QAAQ,CAAC,KAAK,EAAE,iBAAiB,CAAC;IAClC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,YAAY,KAAK,IAAI,CAAC;CAC/C;AA8CD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoC;IAC9D,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoB;IAC1C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgC;IACrD,8EAA8E;IAC9E,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmD;IACzE,4DAA4D;IAC5D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAyF;IAEnH,YAAY,IAAI,EAAE,oBAAoB,EAKrC;IAED;;;OAGG;IACG,OAAO,CAAC,eAAe,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,CAE7D;IAED;;;;OAIG;IACG,sBAAsB,CAC1B,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,MAAM,GACf,OAAO,CACN;QAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,WAAW,EAAE,CAAA;KAAE,GAChG;QAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAA;KAAE,CACvD,CAKA;IAID;;;;OAIG;YACW,YAAY;IAsG1B,gFAAgF;YAClE,iBAAiB;IAiB/B,yGAAyG;YAC3F,aAAa;CAgB5B"}

package/dist/runtime-v2/internalization/candidate-lineage.js

@@ -0,0 +1,230 @@
+/**
+ * Layer 2 — CandidateLineage: on-demand ancestry traversal (design §6.4).
+ *
+ * Pure logic with **injected** I/O (artifact store + task reader). Walks an
+ * artifact's ancestry via `lineageArtifactIds`, determining each node's stage
+ * by the two-hop `artifact.sourceTaskId → task.taskKind` (F1 — never by
+ * `artifactKind`, which is ambiguous: all internalization artifacts are
+ * `principle`).
+ *
+ * Result contract (rc-9, design §6.4 error table):
+ *   - data corruption (unparseable / shape-invalid / store-throw) → `ok: false`
+ *     + a `LineageError`; the caller MUST surface it as an explicit failure or
+ *     structured degradation — never silently fall through.
+ *   - expected absence (no lineage ids / ancestor pruned / task missing / depth
+ *     limit / cycle) → `ok: true` with a partial chain + notes; `complete` is
+ *     false and `notes` is non-empty.
+ *
+ * Request-scoped cache: a single `CandidateLineage` instance lives for one
+ * `buildContext`; repeated `getArtifactById` calls for the same id hit the
+ * cache, not the store (CP-18).
+ *
+ * rc-1: every `contentJson` stays `unknown` — it is never narrowed or cast.
+ */
+import { SUMMARY_RUNNER_KINDS } from './artifact-summary.js';
+// ── Helpers ──────────────────────────────────────────────────────────────────
+const DEFAULT_MAX_DEPTH = 6;
+function isRecord(value) {
+    return value !== null && typeof value === 'object' && !Array.isArray(value);
+}
+/**
+ * Read an existing ArtifactSummary off a contentJson (Layer 0 envelope), with
+ * full value-type validation (rc-2). Returns null when absent or malformed —
+ * the node simply carries no `summary`, which is a valid partial state.
+ */
+function readSummary(contentJson) {
+    if (!isRecord(contentJson) || !Object.hasOwn(contentJson, 'summary'))
+        return undefined;
+    const { summary } = contentJson;
+    if (!isRecord(summary))
+        return undefined;
+    // rc-2: full value-type validation, then construct a typed object (no as cast).
+    if (Object.hasOwn(summary, 'schemaVersion') && summary.schemaVersion === 1
+        && Object.hasOwn(summary, 'runnerKind') && typeof summary.runnerKind === 'string'
+        && SUMMARY_RUNNER_KINDS.includes(summary.runnerKind)
+        && Object.hasOwn(summary, 'headline') && typeof summary.headline === 'string'
+        && Object.hasOwn(summary, 'fields') && isRecord(summary.fields)
+        && Object.values(summary.fields).every((v) => typeof v === 'string')
+        && Object.hasOwn(summary, 'derivedFrom') && summary.derivedFrom === 'structured_output'
+        && Object.hasOwn(summary, 'omittedFields') && Array.isArray(summary.omittedFields)
+        && summary.omittedFields.every((v) => typeof v === 'string')) {
+        // runtime-contract-exempt: ERR-001 narrowing after full value-type validation: runnerKind checked against SUMMARY_RUNNER_KINDS, fields checked via Object.values().every(typeof string), omittedFields checked via Array.isArray + every. The casts are type-only — the values are already validated at runtime above.
+        return {
+            schemaVersion: 1,
+            runnerKind: summary.runnerKind, // runtime-contract-exempt: ERR-001 validated via SUMMARY_RUNNER_KINDS.includes above
+            headline: summary.headline,
+            fields: summary.fields, // runtime-contract-exempt: ERR-001 validated via Object.values().every(typeof===string) above
+            derivedFrom: 'structured_output',
+            omittedFields: summary.omittedFields, // runtime-contract-exempt: ERR-001 validated via Array.isArray + every(typeof===string) above
+        };
+    }
+    return undefined;
+}
+// ── CandidateLineage ─────────────────────────────────────────────────────────
+export class CandidateLineage {
+    artifacts;
+    tasks;
+    maxDepth;
+    emit;
+    /** request-scoped: artifactId → resolved record (or null if known-absent). */
+    cache = new Map();
+    /** request-scoped: taskId → resolved taskKind (or null). */
+    taskCache = new Map();
+    constructor(deps) {
+        this.artifacts = deps.artifacts;
+        this.tasks = deps.tasks;
+        this.maxDepth = deps.maxDepth ?? DEFAULT_MAX_DEPTH;
+        this.emit = deps.emit ?? (() => undefined);
+    }
+    /**
+     * Resolve the full ancestry chain starting from `startArtifactId`.
+     * Walks `lineageArtifactIds` upstream, building an ordered node list.
+     */
+    async resolve(startArtifactId) {
+        return this.resolveChain(startArtifactId, new Set());
+    }
+    /**
+     * Find the nearest ancestor node with a given `taskKind` (F1 — never by
+     * `artifactKind`). Returns `{ ok: true, node: null }` when no ancestor
+     * matches (a valid result, not an error).
+     */
+    async findAncestorByTaskKind(startArtifactId, taskKind) {
+        const result = await this.resolve(startArtifactId);
+        if (!result.ok)
+            return { ok: false, error: result.error };
+        const node = result.value.nodes.find((n) => n.taskKind === taskKind) ?? null;
+        return { ok: true, node, notes: result.value.notes };
+    }
+    // ── Internal traversal ─────────────────────────────────────────────────────
+    /**
+     * Iterative BFS resolution with cycle detection (via `visited`) and depth
+     * limiting. `visited` carries artifactIds already resolved (prevents cycles
+     * and redundant fetches across the whole traversal, not just one path).
+     */
+    async resolveChain(startArtifactId, visited) {
+        const nodes = [];
+        const notes = [];
+        // BFS-style frontier of artifact ids to resolve, seeded with the start.
+        // We process in order; each node's lineageArtifactIds extend the frontier.
+        const queue = [startArtifactId];
+        let depth = 0;
+        while (queue.length > 0) {
+            if (depth >= this.maxDepth) {
+                const [last] = queue;
+                notes.push({ code: 'depth_limit_reached', artifactId: last ?? startArtifactId, detail: `maxDepth (${this.maxDepth}) reached; remaining ${queue.length} ancestor(s) not traversed` });
+                this.emit({ type: 'lineage_partial', artifactId: last ?? startArtifactId, noteCode: 'depth_limit_reached', detail: `maxDepth ${this.maxDepth}` });
+                break;
+            }
+            const artifactId = queue.shift();
+            if (artifactId === undefined)
+                break;
+            // Cycle detection.
+            if (visited.has(artifactId)) {
+                notes.push({ code: 'cycle_detected', artifactId, detail: `artifact ${artifactId} already on the resolution path` });
+                this.emit({ type: 'lineage_partial', artifactId, noteCode: 'cycle_detected', detail: 'cycle detected' });
+                continue;
+            }
+            visited.add(artifactId);
+            // Fetch artifact (cached).
+            const artifactResult = await this.getArtifactCached(artifactId);
+            if (!artifactResult.ok)
+                return artifactResult; // propagate corruption / store failure
+            const artifact = artifactResult.value;
+            if (artifact === null) {
+                // Ancestor referenced but pruned — expected, partial.
+                notes.push({ code: 'ancestor_pruned', artifactId, detail: `ancestor artifact ${artifactId} not found (pruned)` });
+                this.emit({ type: 'lineage_partial', artifactId, noteCode: 'ancestor_pruned', detail: 'artifact not found' });
+                continue;
+            }
+            // Parse contentJson (rc-1: stays unknown on success; unparseable = corruption).
+            let contentJson;
+            try {
+                contentJson = JSON.parse(artifact.contentJson);
+            }
+            catch {
+                const err = { kind: 'content_json_unparseable', artifactId, detail: `contentJson of ${artifactId} is not valid JSON` };
+                this.emit({ type: 'lineage_data_corrupt', artifactId, detail: err.detail, errorKind: 'content_json_unparseable' });
+                return { ok: false, error: err };
+            }
+            // Shape check: must have sourceTaskId (rc-3 fail loud on corruption).
+            if (typeof artifact.sourceTaskId !== 'string' || artifact.sourceTaskId === '') {
+                const err = { kind: 'artifact_shape_invalid', artifactId, detail: `artifact ${artifactId} missing required sourceTaskId` };
+                this.emit({ type: 'lineage_data_corrupt', artifactId, detail: err.detail, errorKind: 'artifact_shape_invalid' });
+                return { ok: false, error: err };
+            }
+            // Two-hop: sourceTaskId → task.taskKind (F1).
+            const taskResult = await this.getTaskCached(artifact.sourceTaskId);
+            if (!taskResult.ok)
+                return taskResult;
+            const task = taskResult.value;
+            let taskKind;
+            let runnerKind;
+            if (task === null) {
+                taskKind = 'unknown';
+                runnerKind = 'unknown';
+                notes.push({ code: 'task_missing', artifactId, detail: `task ${artifact.sourceTaskId} not found; cannot determine stage via two-hop` });
+                this.emit({ type: 'lineage_partial', artifactId, noteCode: 'task_missing', detail: `task ${artifact.sourceTaskId} missing` });
+            }
+            else {
+                ({ taskKind } = task);
+                runnerKind = SUMMARY_RUNNER_KINDS.includes(taskKind)
+                    ? taskKind
+                    : 'unknown';
+            }
+            const node = {
+                artifactId,
+                taskId: artifact.sourceTaskId,
+                taskKind,
+                runnerKind,
+                contentJson,
+                summary: readSummary(contentJson),
+            };
+            nodes.push(node);
+            // Extend frontier with lineage ids (ancestry).
+            const lineageIds = Array.isArray(artifact.lineageArtifactIds) ? artifact.lineageArtifactIds : [];
+            if (lineageIds.length === 0 && nodes.length === 1) {
+                // The start node has no ancestry — not an error, just a short chain.
+            }
+            for (const id of lineageIds) {
+                if (typeof id === 'string' && id !== '') {
+                    queue.push(id);
+                }
+            }
+            depth++;
+        }
+        return { ok: true, value: { nodes, complete: notes.length === 0, notes } };
+    }
+    /** Cached artifact fetch. Returns `ok:false` on store failure or corruption. */
+    async getArtifactCached(artifactId) {
+        if (this.cache.has(artifactId)) {
+            return { ok: true, value: this.cache.get(artifactId) ?? null };
+        }
+        try {
+            const record = await this.artifacts.getArtifactById(artifactId);
+            this.cache.set(artifactId, record);
+            return { ok: true, value: record };
+        }
+        catch (storeErr) {
+            const err = { kind: 'store_failure', detail: storeErr instanceof Error ? storeErr.message : String(storeErr) };
+            this.emit({ type: 'lineage_store_failure', detail: err.detail });
+            return { ok: false, error: err };
+        }
+    }
+    /** Cached task fetch (two-hop). Returns `ok:false` only on reader failure (treated as store_failure). */
+    async getTaskCached(taskId) {
+        if (this.taskCache.has(taskId)) {
+            return { ok: true, value: this.taskCache.get(taskId) ?? null };
+        }
+        try {
+            const task = await this.tasks.getTaskById(taskId);
+            this.taskCache.set(taskId, task);
+            return { ok: true, value: task };
+        }
+        catch (readerErr) {
+            const err = { kind: 'store_failure', detail: readerErr instanceof Error ? readerErr.message : String(readerErr) };
+            this.emit({ type: 'lineage_store_failure', detail: err.detail });
+            return { ok: false, error: err };
+        }
+    }
+}
+//# sourceMappingURL=candidate-lineage.js.map

package/dist/runtime-v2/internalization/candidate-lineage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-lineage.js","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/candidate-lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAIH,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAgE7D,gFAAgF;AAEhF,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,WAAoB;IACvC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IACvF,MAAM,EAAE,OAAO,EAAE,GAAG,WAAW,CAAC;IAChC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,SAAS,CAAC;IACzC,gFAAgF;IAChF,IACE,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,eAAe,CAAC,IAAI,OAAO,CAAC,aAAa,KAAK,CAAC;WACnE,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,QAAQ;WAC7E,oBAA0C,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC;WACxE,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;WAC1E,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC;WAC5D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;WACjE,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,IAAI,OAAO,CAAC,WAAW,KAAK,mBAAmB;WACpF,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,eAAe,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;WAC9E,OAAO,CAAC,aAAoC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EACpF,CAAC;QACD,uTAAuT;QACvT,OAAO;YACL,aAAa,EAAE,CAAC;YAChB,UAAU,EAAE,OAAO,CAAC,UAA+B,EAAE,qFAAqF;YAC1I,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,MAAM,EAAE,OAAO,CAAC,MAAgC,EAAE,8FAA8F;YAChJ,WAAW,EAAE,mBAAmB;YAChC,aAAa,EAAE,OAAO,CAAC,aAAkC,EAAE,8FAA8F;SAC1J,CAAC;IACJ,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,gFAAgF;AAEhF,MAAM,OAAO,gBAAgB;IACV,SAAS,CAAoC;IAC7C,KAAK,CAAoB;IACzB,QAAQ,CAAS;IACjB,IAAI,CAAgC;IACrD,8EAA8E;IAC7D,KAAK,GAAyC,IAAI,GAAG,EAAE,CAAC;IACzE,4DAA4D;IAC3C,SAAS,GAA+E,IAAI,GAAG,EAAE,CAAC;IAEnH,YAAY,IAA0B;QACpC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;QACnD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,eAAuB;QACnC,OAAO,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;IAC/D,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,sBAAsB,CAC1B,eAAuB,EACvB,QAAgB;QAKhB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,EAAE;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,IAAI,IAAI,CAAC;QAC7E,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACvD,CAAC;IAED,8EAA8E;IAE9E;;;;OAIG;IACK,KAAK,CAAC,YAAY,CACxB,eAAuB,EACvB,OAAoB;QAEpB,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAkB,EAAE,CAAC;QAEhC,wEAAwE;QACxE,2EAA2E;QAC3E,MAAM,KAAK,GAAa,CAAC,eAAe,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,qBAAqB,EAAE,UAAU,EAAE,IAAI,IAAI,eAAe,EAAE,MAAM,EAAE,aAAa,IAAI,CAAC,QAAQ,wBAAwB,KAAK,CAAC,MAAM,4BAA4B,EAAE,CAAC,CAAC;gBACrL,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,IAAI,IAAI,eAAe,EAAE,QAAQ,EAAE,qBAAqB,EAAE,MAAM,EAAE,YAAY,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBAClJ,MAAM;YACR,CAAC;YACD,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,UAAU,KAAK,SAAS;gBAAE,MAAM;YAEpC,mBAAmB;YACnB,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,UAAU,iCAAiC,EAAE,CAAC,CAAC;gBACpH,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC;gBACzG,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAExB,2BAA2B;YAC3B,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;YAChE,IAAI,CAAC,cAAc,CAAC,EAAE;gBAAE,OAAO,cAAc,CAAC,CAAC,uCAAuC;YACtF,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;YACtC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;gBACtB,sDAAsD;gBACtD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,EAAE,qBAAqB,UAAU,qBAAqB,EAAE,CAAC,CAAC;gBAClH,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAC,CAAC;gBAC9G,SAAS;YACX,CAAC;YAED,gFAAgF;YAChF,IAAI,WAAoB,CAAC;YACzB,IAAI,CAAC;gBACH,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACP,MAAM,GAAG,GAAiB,EAAE,IAAI,EAAE,0BAA0B,EAAE,UAAU,EAAE,MAAM,EAAE,kBAAkB,UAAU,oBAAoB,EAAE,CAAC;gBACrI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,0BAA0B,EAAE,CAAC,CAAC;gBACnH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YACnC,CAAC;YAED,sEAAsE;YACtE,IAAI,OAAO,QAAQ,CAAC,YAAY,KAAK,QAAQ,IAAI,QAAQ,CAAC,YAAY,KAAK,EAAE,EAAE,CAAC;gBAC9E,MAAM,GAAG,GAAiB,EAAE,IAAI,EAAE,wBAAwB,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,UAAU,gCAAgC,EAAE,CAAC;gBACzI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,wBAAwB,EAAE,CAAC,CAAC;gBACjH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YACnC,CAAC;YAED,8CAA8C;YAC9C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YACnE,IAAI,CAAC,UAAU,CAAC,EAAE;gBAAE,OAAO,UAAU,CAAC;YACtC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;YAC9B,IAAI,QAAgB,CAAC;YACrB,IAAI,UAAyC,CAAC;YAC9C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,QAAQ,GAAG,SAAS,CAAC;gBACrB,UAAU,GAAG,SAAS,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,QAAQ,CAAC,YAAY,gDAAgD,EAAE,CAAC,CAAC;gBACxI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,QAAQ,QAAQ,CAAC,YAAY,UAAU,EAAE,CAAC,CAAC;YAChI,CAAC;iBAAM,CAAC;gBACN,CAAC,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,CAAC;gBACtB,UAAU,GAAI,oBAA0C,CAAC,QAAQ,CAAC,QAAQ,CAAC;oBACzE,CAAC,CAAE,QAA8B;oBACjC,CAAC,CAAC,SAAS,CAAC;YAChB,CAAC;YAED,MAAM,IAAI,GAAgB;gBACxB,UAAU;gBACV,MAAM,EAAE,QAAQ,CAAC,YAAY;gBAC7B,QAAQ;gBACR,UAAU;gBACV,WAAW;gBACX,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC;aAClC,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEjB,+CAA+C;YAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;YACjG,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAClD,qEAAqE;YACvE,CAAC;YACD,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC5B,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;oBACxC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;IAC7E,CAAC;IAED,gFAAgF;IACxE,KAAK,CAAC,iBAAiB,CAC7B,UAAkB;QAElB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC;QACjE,CAAC;QACD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YAChE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YACnC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACrC,CAAC;QAAC,OAAO,QAAQ,EAAE,CAAC;YAClB,MAAM,GAAG,GAAiB,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,QAAQ,YAAY,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7H,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACjE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;IAED,yGAAyG;IACjG,KAAK,CAAC,aAAa,CACzB,MAAc;QAEd,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACjE,CAAC;QACD,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACjC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACnC,CAAC;QAAC,OAAO,SAAS,EAAE,CAAC;YACnB,MAAM,GAAG,GAAiB,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,SAAS,YAAY,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YAChI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACjE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;CACF"}

package/dist/runtime-v2/internalization/context-manifest.d.ts

@@ -0,0 +1,117 @@
+/**
+ * Layer 1 — ContextManifest: declarative field/budget declaration (design §6.2).
+ *
+ * Pure logic only: no I/O, no fs, no DB, no network (Core vs Plugin boundary,
+ * AGENTS.md `antipattern-core-io`).
+ *
+ * A `ContextManifest` declares which field paths a runner (or an evaluator
+ * stage) needs, layered into tier0/tier1/tier2, plus a token budget and a
+ * priority ordering. Layer 1's `allocateContext` (prompt-budget-manager.ts)
+ * consumes it; Layer 3's CLI surfaces its resolution.
+ *
+ * rc-4: tier* and priority array elements are validated element-wise as
+ * strings before use. rc-5: object keys read via `Object.hasOwn`.
+ */
+import type { SummaryRunnerKind } from './artifact-summary.js';
+export declare const CONTEXT_MANIFEST_SCHEMA_VERSION: 1;
+/**
+ * A declarative context-injection manifest (design §6.2).
+ *
+ * Field-path naming convention (design §6.6):
+ *   `<stage>.summary.<key>`        — read from an ArtifactSummary
+ *   `<stage>.predecessorSummary.*` — read from a forwarded predecessor summary
+ *   `<stage>.raw.<path>`           — read from tier2 full contentJson
+ */
+export interface ContextManifest {
+    readonly manifestId: string;
+    readonly schemaVersion: typeof CONTEXT_MANIFEST_SCHEMA_VERSION;
+    readonly runnerKind: SummaryRunnerKind;
+    readonly tier0: readonly string[];
+    readonly tier1: readonly string[];
+    /** Non-empty tier2 means CandidateLineage (Layer 2) may be triggered. */
+    readonly tier2: readonly string[];
+    /** Cross-level injection field budget (design §6.2.1). */
+    readonly budgetTokens: number;
+    /** Full priority sequence. Fields not listed here sort last (see rankOf). */
+    readonly priority: readonly string[];
+}
+export type ManifestWellFormednessError = {
+    readonly kind: 'budget_not_positive';
+    readonly budgetTokens: number;
+} | {
+    readonly kind: 'non_string_element';
+    readonly array: 'tier0' | 'tier1' | 'tier2' | 'priority';
+    readonly index: number;
+    readonly value: unknown;
+} | {
+    readonly kind: 'priority_does_not_cover_fields';
+    readonly missing: readonly string[];
+} | {
+    readonly kind: 'manifest_criterion_misaligned';
+    readonly detail: string;
+};
+export type ManifestValidationResult = {
+    readonly ok: true;
+} | {
+    readonly ok: false;
+    readonly error: ManifestWellFormednessError;
+};
+/**
+ * INV-MANIFEST-CRITERION (design §6.6.1): every non-excluded dreamer dimension
+ * that the fidelity criteria may adjudicate must have a corresponding injected
+ * path in the adjudicating manifest's tier0 ∪ tier1 ∪ tier2. The criteria must
+ * never ask the model to judge a dimension it cannot see.
+ *
+ * This is the direct regression guard for the Phase 0 root cause "criteria ask
+ * 5 dims, manifest injects 4" (design §12.1 conclusion 2 root cause 2). It only
+ * applies to manifests whose runnerKind is the adjudicator (evaluator); other
+ * stages are not fidelity-adjudicating and are skipped.
+ *
+ * NOTE: this checks that each non-excluded dimension's summary path
+ * (`dreamer.summary.<dim>`) is present. A future change promoting a dimension
+ * from `excluded` to `required`/`optional` in DIMENSION_COVERAGE_POLICY without
+ * adding its path to the evaluator manifest will fail this check.
+ *
+ * @param manifest the manifest to check
+ * @param isAdjudicator true only for evaluator-stage manifests (the ones whose
+ *   injected fields the fidelity criteria see). Callers pass false for
+ *   non-evaluator manifests so this invariant is scoped correctly.
+ */
+export declare function checkManifestCriterionAlignment(manifest: ContextManifest, isAdjudicator: boolean): ManifestWellFormednessError | null;
+/**
+ * Validate a manifest is well-formed (design §6.2, requirements 4.2–4.8, 4.12,
+ * 4.13, 4.15).
+ *
+ * Checks:
+ *   - budgetTokens > 0
+ *   - every tier* and priority element is a string (rc-4)
+ *   - priority covers every field in tier0 ∪ tier1 ∪ tier2 (with a documented
+ *     escape hatch: unlisted fields are allowed but sort last via rankOf; this
+ *     check is intentionally NOT enforced because rankOf defines their rank —
+ *     see the note below)
+ *   - INV-MANIFEST-CRITERION when the manifest is an adjudicator (§6.6.1)
+ *
+ * Note on `priority` coverage: design §6.2 requires "priority covers tier0 ∪
+ * tier1 ∪ tier2", but rankOf assigns unlisted fields a rank of
+ * `priority.length + declarationOrder` (sorting them last), which is the
+ * intended behaviour. The check here therefore only flags an empty priority
+ * when fields exist (a clear misconfiguration), rather than requiring every
+ * field be listed. The built-in manifests DO list every field.
+ */
+export declare function validateManifest(manifest: ContextManifest, opts?: {
+    readonly isAdjudicator?: boolean;
+}): ManifestValidationResult;
+/**
+ * The rank of a field path within a manifest (design §6.2 / requirement 4.6).
+ *
+ * Listed fields get their index in `priority` (0-based, ascending = higher
+ * priority). Unlisted fields get `priority.length + declarationOrder`, where
+ * declarationOrder is the field's position in dedupe(tier0 ++ tier1 ++ tier2)
+ * — so unlisted fields sort AFTER all listed fields, in a stable declaration
+ * order. This replaces the base proposal's `indexOf(...) `-1`` which sorted
+ * unlisted fields FIRST (opposite of intent).
+ */
+export declare function rankOf(fieldPath: string, manifest: ContextManifest): number;
+/** All declared field paths of a manifest, deduped, in tier order. */
+export declare function declaredFields(manifest: ContextManifest): string[];
+//# sourceMappingURL=context-manifest.d.ts.map

package/dist/runtime-v2/internalization/context-manifest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-manifest.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/context-manifest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAO/D,eAAO,MAAM,+BAA+B,EAAG,CAAU,CAAC;AAE1D;;;;;;;GAOG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,aAAa,EAAE,OAAO,+BAA+B,CAAC;IAC/D,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;IACvC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,yEAAyE;IACzE,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,0DAA0D;IAC1D,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC;AAID,MAAM,MAAM,2BAA2B,GACnC;IAAE,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAC;IAAC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;CAAE,GACvE;IAAE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,UAAU,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAClJ;IAAE,QAAQ,CAAC,IAAI,EAAE,gCAAgC,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,GACxF;IAAE,QAAQ,CAAC,IAAI,EAAE,+BAA+B,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEhF,MAAM,MAAM,wBAAwB,GAChC;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAA;CAAE,GACrB;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,2BAA2B,CAAA;CAAE,CAAC;AAyBxE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,+BAA+B,CAC7C,QAAQ,EAAE,eAAe,EACzB,aAAa,EAAE,OAAO,GACrB,2BAA2B,GAAG,IAAI,CAmBpC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,eAAe,EACzB,IAAI,GAAE;IAAE,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,CAAA;CAAO,GAC9C,wBAAwB,CA6B1B;AAID;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,eAAe,GAAG,MAAM,CAc3E;AAID,sEAAsE;AACtE,wBAAgB,cAAc,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,EAAE,CAElE"}