@principles/core 1.284.16 → 1.284.18

package/dist/runtime-v2/internalization/attach-summary-envelope.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"attach-summary-envelope.js","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/attach-summary-envelope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EACL,qBAAqB,EACrB,+BAA+B,EAC/B,oBAAoB,GAIrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,kBAAkB,EAAe,MAAM,4BAA4B,CAAC;AAE7E;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAkE;IACrG,cAAc,EAAE,IAAI;IACpB,cAAc,EAAE,gBAAgB;IAChC,WAAW,EAAE,gBAAgB;IAC7B,OAAO,EAAE,aAAa;IACtB,WAAW,EAAE,SAAS;IACtB,MAAM,EAAE,aAAa;IACrB,SAAS,EAAE,QAAQ;IACnB,SAAS,EAAE,WAAW;CACvB,CAAC;AAcF;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,WAAoB;IAC/C,IAAI,WAAW,KAAK,IAAI,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;QAAE,OAAO,IAAI,CAAC;IACvG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACxD,MAAM,EAAE,OAAO,EAAE,GAAG,WAAsC,CAAC;IAC3D,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3F,MAAM,SAAS,GAAG,OAAkC,CAAC;IACrD,qEAAqE;IACrE,yEAAyE;IACzE,yEAAyE;IACzE,sEAAsE;IACtE,wDAAwD;IACxD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,eAAe,CAAC,IAAI,SAAS,CAAC,aAAa,KAAK,+BAA+B;QAAE,OAAO,IAAI,CAAC;IAC3H,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,IAAI,OAAO,SAAS,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAE,oBAA0C,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IACpL,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,OAAO,SAAS,CAAC,QAAQ,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACjG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,SAAS,CAAC,MAAM,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7J,MAAM,SAAS,GAAG,SAAS,CAAC,MAAiC,CAAC;IAC9D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/E,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,aAAa,CAAC,IAAI,SAAS,CAAC,WAAW,KAAK,mBAAmB;QAAE,OAAO,IAAI,CAAC;IAC3G,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IACvG,IAAI,CAAE,SAAS,CAAC,aAAoC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IACtG,OAAO;QACL,aAAa,EAAE,+BAA+B;QAC9C,UAAU,EAAE,SAAS,CAAC,UAA+B;QACrD,QAAQ,EAAE,SAAS,CAAC,QAAQ;QAC5B,MAAM,EAAE,SAAmC;QAC3C,WAAW,EAAE,mBAAmB;QAChC,aAAa,EAAE,SAAS,CAAC,aAAkC;KAC5D,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,4LAA4L;AAC5L,MAAM,UAAU,qBAAqB,CACnC,UAA6B,EAC7B,eAAwB,EACxB,iBAAmD,EACnD,IAAY,EACZ,aAAgE;IAEhE,MAAM,UAAU,GAAG,qBAAqB,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;IACtE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;QACnB,aAAa,CAAC,EAAE,IAAI,EAAE,0BAA0B,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3F,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,QAAQ,GAAqC,EAAE,OAAO,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;IAEjF,IAAI,iBAAiB,KAAK,IAAI,EAAE,CAAC;QAC/B,aAAa,CAAC,EAAE,IAAI,EAAE,qCAAqC,EAAE,UAAU,EAAE,MAAM,EAAE,2BAA2B,EAAE,CAAC,CAAC;QAChH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,IAAI,kBAAkB,GAAG,mBAAmB,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAC5E,IAAI,kBAAkB,KAAK,IAAI,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,qBAAqB,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QACtG,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;YACnB,aAAa,CAAC,EAAE,IAAI,EAAE,sCAAsC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;YACvG,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,kBAAkB,GAAG,UAAU,CAAC,KAAK,CAAC;IACxC,CAAC;IAED,OAAO;QACL,GAAG,QAAQ;QACX,kBAAkB,EAAE;YAClB,UAAU,EAAE,iBAAiB,CAAC,UAAU;YACxC,UAAU,EAAE,iBAAiB,CAAC,UAAU;YACxC,WAAW,EAAE,kBAAkB,CAAC,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC;YACpE,OAAO,EAAE,kBAAkB;SAC5B;KACF,CAAC;AACJ,CAAC"}

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

@@ -1,185 +0,0 @@
-/**
- * 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.
- *
- * Stale-instance rebind (PRI-717): a lineage edge whose artifact id no longer
- * resolves is first checked against the producer-task convention
- * (`pi-art-<taskId>-run_<taskId>_<seq>`); when the producing task still has a
- * current durable artifact, the edge resolves to it and a
- * `lineage_edge_rebound` event is emitted. Everything else stays fail-closed
- * `ancestor_pruned`.
- *
- * 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;
-}
-/**
- * A lineage edge referenced a superseded artifact INSTANCE id and was
- * resolved to the producer task's CURRENT artifact (PRI-717). Durable
- * artifact ids embed the producing run (`pi-art-<taskId>-run_<taskId>_<seq>`)
- * and the upsert rewrites the id on every re-run of the same task, so edges
- * captured before an upstream revision dangle even though the logical
- * artifact (UNIQUE(source_task_id, artifact_kind)) still exists. Emitted so
- * the rebind stays observable (rc-9) — it is not a partial-chain note.
- */
- | {
-    readonly type: 'lineage_edge_rebound';
-    readonly staleArtifactId: string;
-    readonly resolvedArtifactId: string;
-    readonly taskId: 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' | 'listBySourceTaskId'>;
-    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).
-     *
-     * Depth counts BFS LEVELS (start = level 0), matching the documented
-     * `maxDepth = longest pipeline chain + 1` invariant — not the number of
-     * nodes processed. A node-counting loop would stop mid-level on wide chains
-     * (the split-diagnostician router fans out to two artifacts per level) and
-     * starve deep ancestors of resolution (PRI-717).
-     */
-    private resolveChain;
-    /**
-     * PRI-717: attempt to resolve a dangling lineage edge to the producer
-     * task's CURRENT artifact. Only fires when the edge id follows the
-     * producer convention AND that task still has a durable artifact of the
-     * SAME id family; any other outcome keeps the fail-closed
-     * `ancestor_pruned` handling in the caller.
-     *
-     * Review fix (rebind identity): the durable logical identity is
-     * (sourceTaskId, artifactKind) — an evaluator task may carry BOTH a
-     * `pi-art-…` principle row and a `pi-rule-…` rule row. The stale edge
-     * names a `pi-art-` instance of the task, so only the CURRENT instance of
-     * the SAME id family is a rebound candidate — never another kind's row
-     * and never array order. `matches.length !== 1` (0 = no current instance
-     * of this family, >1 = data anomaly against UNIQUE(source_task_id,
-     * artifact_kind)) stays fail-closed, with the ambiguity reported back so
-     * the caller's note says why — never a silent pick.
-     *
-     * The rebind result is cached under the STALE id so repeated edges to the
-     * same superseded instance stay idempotent within one request (CP-18).
-     */
-    private tryReboundInstance;
-    /** 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

@@ -1 +0,0 @@
-{"version":3,"file":"candidate-lineage.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/candidate-lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;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;AAChI;;;;;;;;GAQG;GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,sBAAsB,CAAC;IAAC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAE9I,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,GAAG,oBAAoB,CAAC,CAAC;IACpF,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;AAyED,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;;;;;;;;;;OAUG;YACW,YAAY;IAyI1B;;;;;;;;;;;;;;;;;;;OAmBG;YACW,kBAAkB;IAgChC,gFAAgF;YAClE,iBAAiB;IAiB/B,yGAAyG;YAC3F,aAAa;CAgB5B"}

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

@@ -1,357 +0,0 @@
-/**
- * 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.
- *
- * Stale-instance rebind (PRI-717): a lineage edge whose artifact id no longer
- * resolves is first checked against the producer-task convention
- * (`pi-art-<taskId>-run_<taskId>_<seq>`); when the producing task still has a
- * current durable artifact, the edge resolves to it and a
- * `lineage_edge_rebound` event is emitted. Everything else stays fail-closed
- * `ancestor_pruned`.
- *
- * 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;
-const ARTIFACT_ID_PREFIX = 'pi-art-';
-const RUN_MARKER = '-run_';
-/**
- * Recover the producing task id from a durable artifact INSTANCE id
- * (`pi-art-<taskId>-run_<taskId>_<seq>` — the run id embeds its own task id).
- *
- * Returns null when the id does not follow the producer convention (foreign
- * shape, mismatched run segment, non-numeric sequence); the caller then keeps
- * the fail-closed `ancestor_pruned` path — a non-parseable edge is never
- * silently rebound to a guessed task.
- */
-function parseArtifactInstanceTaskId(artifactId) {
-    if (!artifactId.startsWith(ARTIFACT_ID_PREFIX))
-        return null;
-    const markerIdx = artifactId.lastIndexOf(RUN_MARKER);
-    if (markerIdx <= ARTIFACT_ID_PREFIX.length)
-        return null;
-    const taskId = artifactId.slice(ARTIFACT_ID_PREFIX.length, markerIdx);
-    if (taskId === '')
-        return null;
-    // The run segment after the marker must be `run_<taskId>_<digits>` for the
-    // same taskId — a mismatch means the id is not a producer-convention id.
-    const runSegment = artifactId.slice(markerIdx + 1 + 'run_'.length);
-    const expectedRunPrefix = `${taskId}_`;
-    if (!runSegment.startsWith(expectedRunPrefix))
-        return null;
-    const seq = runSegment.slice(expectedRunPrefix.length);
-    return /^(0|[1-9][0-9]*)$/.test(seq) ? taskId : null;
-}
-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).
-     *
-     * Depth counts BFS LEVELS (start = level 0), matching the documented
-     * `maxDepth = longest pipeline chain + 1` invariant — not the number of
-     * nodes processed. A node-counting loop would stop mid-level on wide chains
-     * (the split-diagnostician router fans out to two artifacts per level) and
-     * starve deep ancestors of resolution (PRI-717).
-     */
-    async resolveChain(startArtifactId, visited) {
-        const nodes = [];
-        const notes = [];
-        // Resolved (post-rebind) artifact ids already emitted as nodes. Distinct
-        // edge ids — one stale instance, one current — can resolve to the SAME
-        // logical artifact when siblings were written across an upstream
-        // revision; the second resolution must be a silent skip, not a duplicate
-        // node or a spurious cycle note.
-        const seenResolvedIds = new Set();
-        // BFS-style frontier of artifact ids to resolve, seeded with the start.
-        // Each iteration drains one full LEVEL, then the frontier's next level is
-        // the artifacts discovered by that drain.
-        const queue = [startArtifactId];
-        let level = 0;
-        while (queue.length > 0) {
-            // NOTE: a re-queued already-visited id (fan-in diamond — the EP002
-            // router topology) is diagnosed as `cycle_detected` when popped. That
-            // is the pre-existing diagnostic contract (a true lineage cycle is
-            // indistinguishable from a diamond without creation-time ordering);
-            // `complete` is advisory only — production consumers gate on `ok` and
-            // node reachability, not on `complete`.
-            if (level >= 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 levelSize = queue.length;
-            for (let i = 0; i < levelSize; i++) {
-                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
-                let artifact = artifactResult.value;
-                if (artifact === null) {
-                    // Ancestor referenced but pruned — expected, partial. PRI-717: the
-                    // edge may reference a superseded INSTANCE id of a task whose
-                    // logical artifact still exists (id embeds the run; upsert rewrites
-                    // it on re-run). Attempt one observable rebind before giving up.
-                    const rebound = await this.tryReboundInstance(artifactId);
-                    if (!rebound.ok)
-                        return rebound;
-                    artifact = rebound.value;
-                    if (artifact === null) {
-                        notes.push({
-                            code: 'ancestor_pruned',
-                            artifactId,
-                            detail: rebound.ambiguousCandidates !== undefined
-                                ? `ancestor artifact ${artifactId} not rebound: ambiguous current artifacts for source task (${rebound.ambiguousCandidates} same-family candidates) — refusing to pick by array order`
-                                : `ancestor artifact ${artifactId} not found (pruned)`,
-                        });
-                        this.emit({ type: 'lineage_partial', artifactId, noteCode: 'ancestor_pruned', detail: 'artifact not found' });
-                        continue;
-                    }
-                }
-                if (seenResolvedIds.has(artifact.artifactId))
-                    continue;
-                seenResolvedIds.add(artifact.artifactId);
-                // 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 = {
-                    // On a rebind the node carries the RESOLVED artifact's identity, not
-                    // the superseded edge id — downstream stage attribution reads these.
-                    artifactId: artifact.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);
-                    }
-                }
-            }
-            level++;
-        }
-        return { ok: true, value: { nodes, complete: notes.length === 0, notes } };
-    }
-    /**
-     * PRI-717: attempt to resolve a dangling lineage edge to the producer
-     * task's CURRENT artifact. Only fires when the edge id follows the
-     * producer convention AND that task still has a durable artifact of the
-     * SAME id family; any other outcome keeps the fail-closed
-     * `ancestor_pruned` handling in the caller.
-     *
-     * Review fix (rebind identity): the durable logical identity is
-     * (sourceTaskId, artifactKind) — an evaluator task may carry BOTH a
-     * `pi-art-…` principle row and a `pi-rule-…` rule row. The stale edge
-     * names a `pi-art-` instance of the task, so only the CURRENT instance of
-     * the SAME id family is a rebound candidate — never another kind's row
-     * and never array order. `matches.length !== 1` (0 = no current instance
-     * of this family, >1 = data anomaly against UNIQUE(source_task_id,
-     * artifact_kind)) stays fail-closed, with the ambiguity reported back so
-     * the caller's note says why — never a silent pick.
-     *
-     * The rebind result is cached under the STALE id so repeated edges to the
-     * same superseded instance stay idempotent within one request (CP-18).
-     */
-    async tryReboundInstance(staleArtifactId) {
-        const taskId = parseArtifactInstanceTaskId(staleArtifactId);
-        if (taskId === null)
-            return { ok: true, value: null };
-        try {
-            const candidates = await this.artifacts.listBySourceTaskId(taskId);
-            const instancePrefix = `${ARTIFACT_ID_PREFIX}${taskId}-run_`;
-            const matches = candidates.filter((candidate) => candidate.artifactId.startsWith(instancePrefix));
-            if (matches.length !== 1) {
-                return { ok: true, value: null, ...(matches.length > 1 ? { ambiguousCandidates: matches.length } : {}) };
-            }
-            const [resolved] = matches;
-            if (resolved === undefined)
-                return { ok: true, value: null };
-            this.cache.set(staleArtifactId, resolved);
-            this.emit({
-                type: 'lineage_edge_rebound',
-                staleArtifactId,
-                resolvedArtifactId: resolved.artifactId,
-                taskId,
-            });
-            return { ok: true, value: resolved };
-        }
-        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 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

@@ -1 +0,0 @@
-{"version":3,"file":"candidate-lineage.js","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/candidate-lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAIH,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AA0E7D,gFAAgF;AAEhF,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,MAAM,kBAAkB,GAAG,SAAS,CAAC;AACrC,MAAM,UAAU,GAAG,OAAO,CAAC;AAE3B;;;;;;;;GAQG;AACH,SAAS,2BAA2B,CAAC,UAAkB;IACrD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,kBAAkB,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IACrD,IAAI,SAAS,IAAI,kBAAkB,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACxD,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACtE,IAAI,MAAM,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/B,2EAA2E;IAC3E,yEAAyE;IACzE,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IACnE,MAAM,iBAAiB,GAAG,GAAG,MAAM,GAAG,CAAC;IACvC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,iBAAiB,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3D,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACvD,OAAO,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACvD,CAAC;AAED,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;;;;;;;;;;OAUG;IACK,KAAK,CAAC,YAAY,CACxB,eAAuB,EACvB,OAAoB;QAEpB,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,yEAAyE;QACzE,uEAAuE;QACvE,iEAAiE;QACjE,yEAAyE;QACzE,iCAAiC;QACjC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAE1C,wEAAwE;QACxE,0EAA0E;QAC1E,0CAA0C;QAC1C,MAAM,KAAK,GAAa,CAAC,eAAe,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,mEAAmE;YACnE,sEAAsE;YACtE,mEAAmE;YACnE,oEAAoE;YACpE,sEAAsE;YACtE,wCAAwC;YACxC,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,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;YAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;gBACjC,IAAI,UAAU,KAAK,SAAS;oBAAE,MAAM;gBAEpC,mBAAmB;gBACnB,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC5B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,UAAU,iCAAiC,EAAE,CAAC,CAAC;oBACpH,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC;oBACzG,SAAS;gBACX,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,2BAA2B;gBAC3B,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBAChE,IAAI,CAAC,cAAc,CAAC,EAAE;oBAAE,OAAO,cAAc,CAAC,CAAC,uCAAuC;gBACtF,IAAI,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;gBACpC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;oBACtB,mEAAmE;oBACnE,8DAA8D;oBAC9D,oEAAoE;oBACpE,iEAAiE;oBACjE,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;oBAC1D,IAAI,CAAC,OAAO,CAAC,EAAE;wBAAE,OAAO,OAAO,CAAC;oBAChC,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC;oBACzB,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;wBACtB,KAAK,CAAC,IAAI,CAAC;4BACT,IAAI,EAAE,iBAAiB;4BACvB,UAAU;4BACV,MAAM,EAAE,OAAO,CAAC,mBAAmB,KAAK,SAAS;gCAC/C,CAAC,CAAC,qBAAqB,UAAU,8DAA8D,OAAO,CAAC,mBAAmB,4DAA4D;gCACtL,CAAC,CAAC,qBAAqB,UAAU,qBAAqB;yBACzD,CAAC,CAAC;wBACH,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAC,CAAC;wBAC9G,SAAS;oBACX,CAAC;gBACH,CAAC;gBACD,IAAI,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC;oBAAE,SAAS;gBACvD,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAEzC,gFAAgF;gBAChF,IAAI,WAAoB,CAAC;gBACzB,IAAI,CAAC;oBACH,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBACjD,CAAC;gBAAC,MAAM,CAAC;oBACP,MAAM,GAAG,GAAiB,EAAE,IAAI,EAAE,0BAA0B,EAAE,UAAU,EAAE,MAAM,EAAE,kBAAkB,UAAU,oBAAoB,EAAE,CAAC;oBACrI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,0BAA0B,EAAE,CAAC,CAAC;oBACnH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;gBACnC,CAAC;gBAED,sEAAsE;gBACtE,IAAI,OAAO,QAAQ,CAAC,YAAY,KAAK,QAAQ,IAAI,QAAQ,CAAC,YAAY,KAAK,EAAE,EAAE,CAAC;oBAC9E,MAAM,GAAG,GAAiB,EAAE,IAAI,EAAE,wBAAwB,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,UAAU,gCAAgC,EAAE,CAAC;oBACzI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,wBAAwB,EAAE,CAAC,CAAC;oBACjH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;gBACnC,CAAC;gBAED,8CAA8C;gBAC9C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACnE,IAAI,CAAC,UAAU,CAAC,EAAE;oBAAE,OAAO,UAAU,CAAC;gBACtC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;gBAC9B,IAAI,QAAgB,CAAC;gBACrB,IAAI,UAAyC,CAAC;gBAC9C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,QAAQ,GAAG,SAAS,CAAC;oBACrB,UAAU,GAAG,SAAS,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,QAAQ,CAAC,YAAY,gDAAgD,EAAE,CAAC,CAAC;oBACxI,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;gBAChI,CAAC;qBAAM,CAAC;oBACN,CAAC,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,CAAC;oBACtB,UAAU,GAAI,oBAA0C,CAAC,QAAQ,CAAC,QAAQ,CAAC;wBACzE,CAAC,CAAE,QAA8B;wBACjC,CAAC,CAAC,SAAS,CAAC;gBAChB,CAAC;gBAED,MAAM,IAAI,GAAgB;oBACxB,qEAAqE;oBACrE,qEAAqE;oBACrE,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,MAAM,EAAE,QAAQ,CAAC,YAAY;oBAC7B,QAAQ;oBACR,UAAU;oBACV,WAAW;oBACX,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC;iBAClC,CAAC;gBACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEjB,+CAA+C;gBAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjG,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAClD,qEAAqE;gBACvE,CAAC;gBACD,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBAC5B,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;wBACxC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,CAAC;gBACH,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;;;;;;;;;;;;;;;;;;;OAmBG;IACK,KAAK,CAAC,kBAAkB,CAC9B,eAAuB;QAKvB,MAAM,MAAM,GAAG,2BAA2B,CAAC,eAAe,CAAC,CAAC;QAC5D,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACtD,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YACnE,MAAM,cAAc,GAAG,GAAG,kBAAkB,GAAG,MAAM,OAAO,CAAC;YAC7D,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC;YAClG,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3G,CAAC;YACD,MAAM,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC;YAC3B,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAC7D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,sBAAsB;gBAC5B,eAAe;gBACf,kBAAkB,EAAE,QAAQ,CAAC,UAAU;gBACvC,MAAM;aACP,CAAC,CAAC;YACH,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;QACvC,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,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"}