@cleocode/core 2026.6.11 → 2026.6.13

package/dist/release/provenance-fk.js

@@ -1,122 +0,0 @@
-/**
- * Post-cutover provenance `task_id` / `epic_id` FK reconciliation (DHQ-051).
- *
- * Shared between `cleo release reconcile` ({@link releaseReconcileV2}) and
- * `cleo release plan` ({@link releasePlan} → `upsertReleasesRow`). Both verbs
- * write provenance rows (`task_commits`, `pr_tasks`, `releases`,
- * `release_changes`) whose `task_id` / `epic_id` foreign keys reference the
- * BARE `tasks` table — which is empty on a consolidated dual-scope `cleo.db`
- * after the T11578 cutover (runtime task data moved to the prefixed
- * `tasks_tasks` table). A row inserted with an `epicId` / `taskId` that exists
- * only in `tasks_tasks` violates the FK at INSERT time, aborting the verb.
- *
- * This module is the single source of truth for the FK-ordered parent backfill
- * that makes those FKs satisfiable. `reconcile.ts` re-exports both symbols so
- * its public surface is unchanged.
- *
- * @task T11659 — reconcile slice (original)
- * @task T11818 — plan/open slice (DRY hoist)
- * @epic T11466
- */
-import { getLogger } from '../logger.js';
-const log = getLogger('release:provenance-fk');
-/**
- * Make the provenance `task_id` foreign keys satisfiable on a consolidated
- * `cleo.db` by inserting any missing FK-parent rows in FK order (parent-before
- * -child), then returning the set of IDs the FK can resolve.
- *
- * ## Background (DHQ-051 · T11659 / T11818 — same class as DHQ-045)
- *
- * After the dual-scope `cleo.db` cutover (T11578) the runtime task store moved
- * from the bare `tasks` table to the prefixed `tasks_tasks` table. The drizzle
- * `schema.tasks` symbol is shadowed at the barrel (`tasks-schema.ts`) onto
- * `tasks_tasks`, so token-validity probes read the populated prefixed table.
- * BUT the provenance tables (`task_commits`, `pr_tasks`, `releases`,
- * `release_changes`) predate the cutover — their `task_id` / `epic_id` FKs
- * still reference the BARE `tasks` table, which is empty on a consolidated
- * `cleo.db`. A token validated against `tasks_tasks` therefore passes the
- * legacy gate yet violates the FK at INSERT time, aborting the whole verb with
- * `E_PROVENANCE_FAILED` (reconcile) or `E_INTERNAL` (plan).
- *
- * ## Strategy — FK-ordered parent backfill (Strategy 1)
- *
- * For every task referenced by this release we ensure a row exists in the FK
- * parent table BEFORE the child provenance rows are written. The parent table
- * is discovered dynamically via `PRAGMA foreign_key_list('task_commits')` (so
- * the logic tracks whatever the live schema enforces — including a future
- * schema that repoints the FK at `tasks_tasks`, where this becomes a no-op).
- * Missing parent rows are copied from the runtime `tasks_tasks` store via
- * `INSERT OR IGNORE … SELECT` of only the NOT NULL columns, so the copied rows
- * satisfy the parent table's own CHECK/NOT NULL constraints. Tasks that exist
- * in neither table remain unresolvable and are skipped-with-warn / NULLed by
- * the callers (the row, never the whole verb).
- *
- * Idempotent: `INSERT OR IGNORE` never duplicates and never overwrites an
- * existing parent row. Callers run it inside their write transaction so a later
- * failure rolls the shim rows back too.
- *
- * @param nativeDb - The consolidated `cleo.db` native handle.
- * @param referencedIds - Every task id this verb may reference (commit tokens,
- *   PR tokens, plan tasks, epic).
- * @returns The FK parent table name + the IDs it can now resolve.
- */
-export function ensureProvenanceTaskFkParents(nativeDb, referencedIds) {
-    // Discover the physical parent table the `task_commits.task_id` FK targets.
-    let parentTable = 'tasks';
-    try {
-        const fks = nativeDb.prepare(`PRAGMA foreign_key_list('task_commits')`).all();
-        const taskFk = fks.find((fk) => fk.from === 'task_id');
-        if (taskFk?.table)
-            parentTable = taskFk.table;
-    }
-    catch {
-        // PRAGMA unavailable (table absent / older sqlite) — keep the bare default.
-    }
-    const tableExists = (name) => nativeDb.prepare(`SELECT name FROM sqlite_master WHERE type='table' AND name=?`).get(name) !=
-        null;
-    // Parent table absent entirely → nothing resolvable, nothing to backfill.
-    if (!tableExists(parentTable)) {
-        return { parentTable: null, resolvableIds: new Set() };
-    }
-    // FK-ordered shim backfill: copy any referenced task that lives in the
-    // runtime `tasks_tasks` store but is missing from the FK parent. Only when
-    // the parent is the bare legacy table AND the prefixed store exists (i.e. the
-    // post-cutover split-brain) — when the FK already points at `tasks_tasks`
-    // this is skipped and the parent is read as-is.
-    // Identifiers come from sqlite_master / the FK pragma (verified existing
-    // table names), never user input — safe to interpolate (node:sqlite exposes
-    // no bound-identifier form). All VALUES are bound parameters.
-    if (parentTable !== 'tasks_tasks' && tableExists('tasks_tasks') && referencedIds.size > 0) {
-        // `pipeline_stage` is copied alongside the NOT NULL columns so the bare
-        // `tasks` table's T877 invariant trigger (status='done' ⇒ pipeline_stage IN
-        // ('contribution','cancelled'); status='cancelled' ⇒ pipeline_stage=
-        // 'cancelled') is satisfied. A released epic is typically status='done', so
-        // omitting `pipeline_stage` would RAISE(ABORT) the shim copy and leave the
-        // epic unresolvable (DHQ-051 · T11818).
-        const insertShim = nativeDb.prepare(`INSERT OR IGNORE INTO "${parentTable}" (id, title, status, priority, role, scope, pipeline_stage)
-       SELECT id, title, status, priority, role, scope, pipeline_stage FROM tasks_tasks WHERE id = ?`);
-        for (const id of referencedIds) {
-            try {
-                insertShim.run(id);
-            }
-            catch (err) {
-                // A single shim copy that violates the parent's own constraints (e.g. a
-                // NOT NULL / CHECK the prefixed row does not satisfy) must NOT abort the
-                // whole verb. Leave the id unresolvable — the writers below
-                // skip-with-warn that one link (Strategy 3). SAVEPOINT-free: the failed
-                // statement is rolled back individually by SQLite, leaving the
-                // surrounding transaction intact.
-                log.warn({ taskId: id, parentTable, err: err instanceof Error ? err.message : String(err) }, 'provenance: FK-parent shim copy failed — task_id stays unresolvable, link will be skipped');
-            }
-        }
-    }
-    // Read back what the FK can now resolve.
-    const resolvableIds = new Set();
-    const rows = nativeDb.prepare(`SELECT id FROM "${parentTable}"`).all();
-    for (const r of rows) {
-        if (typeof r.id === 'string')
-            resolvableIds.add(r.id);
-    }
-    return { parentTable, resolvableIds };
-}
-//# sourceMappingURL=provenance-fk.js.map

package/dist/release/provenance-fk.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"provenance-fk.js","sourceRoot":"","sources":["../../src/release/provenance-fk.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAGzC,MAAM,GAAG,GAAG,SAAS,CAAC,uBAAuB,CAAC,CAAC;AAc/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AACH,MAAM,UAAU,6BAA6B,CAC3C,QAAsB,EACtB,aAAkC;IAElC,4EAA4E;IAC5E,IAAI,WAAW,GAAG,OAAO,CAAC;IAC1B,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,EAGzE,CAAC;QACH,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QACvD,IAAI,MAAM,EAAE,KAAK;YAAE,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;IAChD,CAAC;IAAC,MAAM,CAAC;QACP,4EAA4E;IAC9E,CAAC;IAED,MAAM,WAAW,GAAG,CAAC,IAAY,EAAW,EAAE,CAC5C,QAAQ,CAAC,OAAO,CAAC,8DAA8D,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;QAC1F,IAAI,CAAC;IAEP,0EAA0E;IAC1E,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,GAAG,EAAU,EAAE,CAAC;IACjE,CAAC;IAED,uEAAuE;IACvE,2EAA2E;IAC3E,8EAA8E;IAC9E,0EAA0E;IAC1E,gDAAgD;IAChD,yEAAyE;IACzE,4EAA4E;IAC5E,8DAA8D;IAC9D,IAAI,WAAW,KAAK,aAAa,IAAI,WAAW,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1F,wEAAwE;QACxE,4EAA4E;QAC5E,qEAAqE;QACrE,4EAA4E;QAC5E,2EAA2E;QAC3E,wCAAwC;QACxC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CACjC,0BAA0B,WAAW;qGAC0D,CAChG,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,wEAAwE;gBACxE,yEAAyE;gBACzE,4DAA4D;gBAC5D,wEAAwE;gBACxE,+DAA+D;gBAC/D,kCAAkC;gBAClC,GAAG,CAAC,IAAI,CACN,EAAE,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAClF,2FAA2F,CAC5F,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,mBAAmB,WAAW,GAAG,CAAC,CAAC,GAAG,EAA4B,CAAC;IACjG,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ;YAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AACxC,CAAC"}

package/dist/validation/chain-validation.d.ts

@@ -1,43 +0,0 @@
-/**
- * Chain Validation Engine
- *
- * Validates WarpChain definitions for structural correctness (shape)
- * and gate satisfiability (gates reference valid stages/gate names).
- *
- * @task T5401
- */
-import type { ChainShape, ChainValidation, WarpChain } from '@cleocode/contracts';
-/**
- * Validate the topology/DAG of a chain shape.
- *
- * Checks:
- * - All link source/target IDs reference existing stages
- * - entryPoint references an existing stage
- * - All exitPoints reference existing stages
- * - No cycles (topological sort)
- * - All stages are reachable from the entry point
- *
- * @task T5401
- */
-export declare function validateChainShape(shape: ChainShape): string[];
-/**
- * Validate that all gates in a chain reference valid stages and gate names.
- *
- * Checks:
- * - Every gate's stageId references an existing stage
- * - Every stage_complete check references an existing stage
- * - Every verification_gate check references a valid GateName
- *
- * @task T5401
- */
-export declare function validateGateSatisfiability(chain: WarpChain): string[];
-/**
- * Validate a complete WarpChain definition.
- *
- * Orchestrates shape validation and gate satisfiability checks,
- * returning a unified ChainValidation result.
- *
- * @task T5401
- */
-export declare function validateChain(chain: WarpChain): ChainValidation;
-//# sourceMappingURL=chain-validation.d.ts.map

package/dist/validation/chain-validation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chain-validation.d.ts","sourceRoot":"","sources":["../../src/validation/chain-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAGlF;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE,CAmF9D;AAED;;;;;;;;;GASG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,EAAE,CA4BrE;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,eAAe,CAa/D"}

package/dist/validation/chain-validation.js

@@ -1,146 +0,0 @@
-/**
- * Chain Validation Engine
- *
- * Validates WarpChain definitions for structural correctness (shape)
- * and gate satisfiability (gates reference valid stages/gate names).
- *
- * @task T5401
- */
-import { VERIFICATION_GATE_ORDER } from './verification.js';
-/**
- * Validate the topology/DAG of a chain shape.
- *
- * Checks:
- * - All link source/target IDs reference existing stages
- * - entryPoint references an existing stage
- * - All exitPoints reference existing stages
- * - No cycles (topological sort)
- * - All stages are reachable from the entry point
- *
- * @task T5401
- */
-export function validateChainShape(shape) {
-    const errors = [];
-    const stageIds = new Set(shape.stages.map((s) => s.id));
-    if (!stageIds.has(shape.entryPoint)) {
-        errors.push(`entryPoint "${shape.entryPoint}" does not reference an existing stage`);
-    }
-    for (const exit of shape.exitPoints) {
-        if (!stageIds.has(exit)) {
-            errors.push(`exitPoint "${exit}" does not reference an existing stage`);
-        }
-    }
-    for (const link of shape.links) {
-        if (!stageIds.has(link.from)) {
-            errors.push(`Link source "${link.from}" does not reference an existing stage`);
-        }
-        if (!stageIds.has(link.to)) {
-            errors.push(`Link target "${link.to}" does not reference an existing stage`);
-        }
-    }
-    // Cycle detection via topological sort (Kahn's algorithm)
-    const inDegree = new Map();
-    const adjacency = new Map();
-    for (const id of stageIds) {
-        inDegree.set(id, 0);
-        adjacency.set(id, []);
-    }
-    for (const link of shape.links) {
-        if (stageIds.has(link.from) && stageIds.has(link.to)) {
-            adjacency.get(link.from).push(link.to);
-            inDegree.set(link.to, (inDegree.get(link.to) ?? 0) + 1);
-        }
-    }
-    const queue = [];
-    for (const [id, deg] of inDegree) {
-        if (deg === 0)
-            queue.push(id);
-    }
-    let sorted = 0;
-    while (queue.length > 0) {
-        const node = queue.shift();
-        sorted++;
-        for (const neighbor of adjacency.get(node) ?? []) {
-            const newDeg = (inDegree.get(neighbor) ?? 1) - 1;
-            inDegree.set(neighbor, newDeg);
-            if (newDeg === 0)
-                queue.push(neighbor);
-        }
-    }
-    if (sorted < stageIds.size) {
-        errors.push('Chain contains a cycle — topological sort could not complete');
-    }
-    // Reachability from entry point (BFS)
-    if (stageIds.has(shape.entryPoint)) {
-        const visited = new Set();
-        const bfsQueue = [shape.entryPoint];
-        visited.add(shape.entryPoint);
-        while (bfsQueue.length > 0) {
-            const current = bfsQueue.shift();
-            for (const neighbor of adjacency.get(current) ?? []) {
-                if (!visited.has(neighbor)) {
-                    visited.add(neighbor);
-                    bfsQueue.push(neighbor);
-                }
-            }
-        }
-        for (const id of stageIds) {
-            if (!visited.has(id)) {
-                errors.push(`Stage "${id}" is not reachable from entry point "${shape.entryPoint}"`);
-            }
-        }
-    }
-    return errors;
-}
-/**
- * Validate that all gates in a chain reference valid stages and gate names.
- *
- * Checks:
- * - Every gate's stageId references an existing stage
- * - Every stage_complete check references an existing stage
- * - Every verification_gate check references a valid GateName
- *
- * @task T5401
- */
-export function validateGateSatisfiability(chain) {
-    const errors = [];
-    const stageIds = new Set(chain.shape.stages.map((s) => s.id));
-    const validGateNames = new Set(VERIFICATION_GATE_ORDER);
-    for (const gate of chain.gates) {
-        if (!stageIds.has(gate.stageId)) {
-            errors.push(`Gate "${gate.id}" references non-existent stage "${gate.stageId}"`);
-        }
-        if (gate.check.type === 'stage_complete') {
-            if (!stageIds.has(gate.check.stageId)) {
-                errors.push(`Gate "${gate.id}" stage_complete check references non-existent stage "${gate.check.stageId}"`);
-            }
-        }
-        if (gate.check.type === 'verification_gate') {
-            if (!validGateNames.has(gate.check.gateName)) {
-                errors.push(`Gate "${gate.id}" references invalid verification gate name "${gate.check.gateName}"`);
-            }
-        }
-    }
-    return errors;
-}
-/**
- * Validate a complete WarpChain definition.
- *
- * Orchestrates shape validation and gate satisfiability checks,
- * returning a unified ChainValidation result.
- *
- * @task T5401
- */
-export function validateChain(chain) {
-    const shapeErrors = validateChainShape(chain.shape);
-    const gateErrors = validateGateSatisfiability(chain);
-    const allErrors = [...shapeErrors, ...gateErrors];
-    return {
-        wellFormed: shapeErrors.length === 0,
-        gateSatisfiable: gateErrors.length === 0,
-        artifactComplete: true,
-        errors: allErrors,
-        warnings: [],
-    };
-}
-//# sourceMappingURL=chain-validation.js.map

package/dist/validation/chain-validation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"chain-validation.js","sourceRoot":"","sources":["../../src/validation/chain-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,uBAAuB,EAAE,MAAM,mBAAmB,CAAC;AAE5D;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAiB;IAClD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,UAAU,wCAAwC,CAAC,CAAC;IACvF,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,cAAc,IAAI,wCAAwC,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,IAAI,wCAAwC,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,EAAE,wCAAwC,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpB,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACrD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,EAAE,CAAC;QACT,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC/B,IAAI,MAAM,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,IAAI,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,8DAA8D,CAAC,CAAC;IAC9E,CAAC;IAED,sCAAsC;IACtC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAa,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC9C,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAE9B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAC;YAClC,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,wCAAwC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,0BAA0B,CAAC,KAAgB;IACzD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAS,uBAA4C,CAAC,CAAC;IAErF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,oCAAoC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACnF,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,MAAM,CAAC,IAAI,CACT,SAAS,IAAI,CAAC,EAAE,yDAAyD,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAC/F,CAAC;YACJ,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;YAC5C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7C,MAAM,CAAC,IAAI,CACT,SAAS,IAAI,CAAC,EAAE,gDAAgD,IAAI,CAAC,KAAK,CAAC,QAAkB,GAAG,CACjG,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC5C,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;IAErD,MAAM,SAAS,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,UAAU,CAAC,CAAC;IAElD,OAAO;QACL,UAAU,EAAE,WAAW,CAAC,MAAM,KAAK,CAAC;QACpC,eAAe,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC;QACxC,gBAAgB,EAAE,IAAI;QACtB,MAAM,EAAE,SAAS;QACjB,QAAQ,EAAE,EAAE;KACb,CAAC;AACJ,CAAC"}