@cleocode/core 2026.9.24 → 2026.9.26

package/dist/store/dependency-cycles.js

@@ -0,0 +1,360 @@
+/**
+ * Dependency-cycle guard support for `tasks_task_dependencies` (T12886).
+ *
+ * The guard itself is the pair of BEFORE triggers created by the
+ * `drizzle-cleo-project/20260930160000_t12886-dependency-cycle-guard`
+ * migration: every writer, raw SQL included, is refused with
+ * {@link DEPENDENCY_CYCLE_CODE}. A trigger message must be a literal, so it
+ * cannot say WHICH cycle. This module supplies that part:
+ *
+ * - {@link rethrowDependencyCycle} turns the trigger abort into a
+ *   {@link CleoError} that names the cycle (`T1 → T2 → T3 → T1`) and says
+ *   how to fix it. The write chokepoints call it.
+ * - {@link detectDependencyCycles} finds cycles already stored (edges written
+ *   before the guard existed) and proposes the edges to remove, for
+ *   `cleo doctor dep-cycles`. It never writes.
+ *
+ * An edge `{ taskId, dependsOn }` means "taskId depends on dependsOn"; a cycle
+ * is printed in that direction, each arrow reading "depends on".
+ *
+ * @module
+ * @task T12886
+ */
+import { ExitCode } from '@cleocode/contracts';
+import { CleoError } from '../errors.js';
+import * as schema from './tasks-schema.js';
+/** Stable error code raised by the dependency-cycle triggers. */
+export const DEPENDENCY_CYCLE_CODE = 'E_TASK_DEPENDENCY_CYCLE';
+/** Render a cycle as `T1 → T2 → T1`. */
+export function formatDependencyCycle(cycle) {
+    return cycle.join(' → ');
+}
+function buildAdjacency(edges) {
+    const adjacency = new Map();
+    for (const { taskId, dependsOn } of edges) {
+        const next = adjacency.get(taskId);
+        if (next)
+            next.push(dependsOn);
+        else
+            adjacency.set(taskId, [dependsOn]);
+    }
+    for (const next of adjacency.values())
+        next.sort();
+    return adjacency;
+}
+/**
+ * Shortest dependency path from `from` to `to` (breadth-first), or `null`.
+ * Each task is visited once, so the walk is bounded by the number of tasks.
+ */
+function shortestPath(adjacency, from, to) {
+    if (from === to)
+        return [from];
+    const previous = new Map([[from, from]]);
+    const queue = [from];
+    for (let head = 0; head < queue.length; head++) {
+        const id = queue[head];
+        for (const next of adjacency.get(id) ?? []) {
+            if (previous.has(next))
+                continue;
+            previous.set(next, id);
+            if (next === to) {
+                const path = [to];
+                let cursor = id;
+                while (cursor !== from) {
+                    path.push(cursor);
+                    cursor = previous.get(cursor);
+                }
+                path.push(from);
+                return path.reverse();
+            }
+            queue.push(next);
+        }
+    }
+    return null;
+}
+/**
+ * The cycle that `edge` would close over `existing`, or `null` when it closes none.
+ *
+ * @param existing - Edges already stored.
+ * @param edge - The edge being added.
+ * @returns The cycle in "depends on" order, starting and ending at `edge.taskId`.
+ *
+ * @example
+ * ```ts
+ * findClosedCycle([{ taskId: 'T2', dependsOn: 'T1' }], { taskId: 'T1', dependsOn: 'T2' });
+ * // => ['T1', 'T2', 'T1']
+ * ```
+ */
+export function findClosedCycle(existing, edge) {
+    if (edge.taskId === edge.dependsOn)
+        return [edge.taskId, edge.taskId];
+    const path = shortestPath(buildAdjacency(existing), edge.dependsOn, edge.taskId);
+    return path ? [edge.taskId, ...path] : null;
+}
+/**
+ * Build the error for an edge that closes `cycle`.
+ *
+ * @param edge - The refused edge.
+ * @param cycle - The cycle it closes, from {@link findClosedCycle}.
+ * @returns A {@link CleoError} naming the cycle, with a fix hint.
+ */
+export function dependencyCycleError(edge, cycle) {
+    const self = edge.taskId === edge.dependsOn;
+    const message = self
+        ? `${DEPENDENCY_CYCLE_CODE}: task ${edge.taskId} cannot depend on itself`
+        : `${DEPENDENCY_CYCLE_CODE}: ${edge.taskId} depends on ${edge.dependsOn} would close a dependency cycle: ${formatDependencyCycle(cycle)}`;
+    // The last existing edge of the cycle, the one that points back at taskId.
+    const closing = cycle.length >= 3 ? cycle[cycle.length - 2] : undefined;
+    const fix = self
+        ? `Drop ${edge.taskId} from its own --depends list`
+        : `Drop this dependency, or first remove another edge of the cycle, e.g. ` +
+            `cleo update ${closing} --remove-depends ${edge.taskId}`;
+    return new CleoError(ExitCode.CIRCULAR_REFERENCE, message, {
+        fix,
+        details: {
+            field: 'depends',
+            actual: edge.dependsOn,
+            taskId: edge.taskId,
+            cycle: [...cycle],
+        },
+    });
+}
+/**
+ * True when `err` is the dependency-cycle trigger abort. Drizzle wraps the
+ * SQLite error in a `DrizzleQueryError` whose own message is the failed SQL,
+ * so the `cause` chain is searched too.
+ */
+export function isDependencyCycleAbort(err) {
+    for (let e = err, depth = 0; e instanceof Error && depth < 8; depth++) {
+        if (e.message.includes(DEPENDENCY_CYCLE_CODE))
+            return true;
+        e = e.cause;
+    }
+    return false;
+}
+/**
+ * Read every stored dependency edge.
+ *
+ * @param db - Drizzle handle on the project store.
+ * @returns All rows of `tasks_task_dependencies`.
+ */
+export function readDependencyEdges(db) {
+    return db
+        .select({
+        taskId: schema.taskDependencies.taskId,
+        dependsOn: schema.taskDependencies.dependsOn,
+    })
+        .from(schema.taskDependencies)
+        .all();
+}
+/**
+ * Rethrow a write error, naming the cycle when it is the cycle-guard abort.
+ *
+ * Call it from the catch of a statement that inserted `attempted`. SQLite
+ * rolls back the aborted statement, so the stored edges are the state before
+ * it; the attempted edges are replayed over them in order to find the one
+ * that closes a cycle.
+ *
+ * @param db - Drizzle handle the statement ran on.
+ * @param err - The caught error.
+ * @param attempted - The edges the statement tried to insert, in order.
+ * @returns Never; always throws.
+ */
+export function rethrowDependencyCycle(db, err, attempted) {
+    if (!isDependencyCycleAbort(err))
+        throw err;
+    const edges = readDependencyEdges(db);
+    for (const edge of attempted) {
+        const cycle = findClosedCycle(edges, edge);
+        if (cycle)
+            throw dependencyCycleError(edge, cycle);
+        edges.push(edge);
+    }
+    throw err;
+}
+function skippedEdge(edge, cycle) {
+    return {
+        edge,
+        cycle,
+        message: `skipped dependency ${edge.taskId} → ${edge.dependsOn}: it would close the dependency ` +
+            `cycle ${formatDependencyCycle(cycle)} (${DEPENDENCY_CYCLE_CODE})`,
+    };
+}
+/**
+ * Insert one edge (ignoring an exact duplicate); when the cycle guard refuses
+ * it, leave it out and say why instead of failing.
+ *
+ * For bulk importers that must keep a record and its other edges when one
+ * edge is refused (legacy JSON import). Any other error propagates.
+ *
+ * @param db - Drizzle handle on the project store.
+ * @param edge - The edge to insert.
+ * @returns `null` when written (or already present), else what was skipped.
+ */
+export function insertDependencyEdgeOrSkipCycle(db, edge) {
+    try {
+        db.insert(schema.taskDependencies).values(edge).onConflictDoNothing().run();
+        return null;
+    }
+    catch (err) {
+        if (!isDependencyCycleAbort(err))
+            throw err;
+        const cycle = findClosedCycle(readDependencyEdges(db), edge) ?? [edge.taskId, edge.taskId];
+        return skippedEdge(edge, cycle);
+    }
+}
+/**
+ * Split planned edges into the ones that can be written and the ones that
+ * would close a cycle, replaying them in order over `existing`. Deterministic:
+ * of two edges that close a cycle together, the LATER one is dropped. Pure.
+ *
+ * @param existing - Edges already stored in the target.
+ * @param planned - Edges to add, in plan order.
+ * @returns The dropped edges with their cycles; every other planned edge is safe.
+ */
+export function dropCycleClosingEdges(existing, planned) {
+    const edges = [...existing];
+    const seen = new Set(existing.map((e) => `${e.taskId}\u0000${e.dependsOn}`));
+    const dropped = [];
+    for (const edge of planned) {
+        const key = `${edge.taskId}\u0000${edge.dependsOn}`;
+        if (seen.has(key))
+            continue;
+        const cycle = findClosedCycle(edges, edge);
+        if (cycle) {
+            dropped.push(skippedEdge(edge, cycle));
+            continue;
+        }
+        edges.push(edge);
+        seen.add(key);
+    }
+    return dropped;
+}
+/**
+ * Find every stored dependency cycle and a repair plan. Pure: never writes.
+ *
+ * Tarjan's algorithm (iterative, so a long chain cannot overflow the stack)
+ * finds the strongly connected components; any component with more than one
+ * task, or a task that depends on itself, holds a cycle. The repair plan is
+ * the back edges of a depth-first traversal, whose removal leaves the graph
+ * acyclic.
+ *
+ * @param edges - The stored edges.
+ * @returns Cyclic components and the edges to remove.
+ *
+ * @example
+ * ```ts
+ * const report = detectDependencyCycles(readDependencyEdges(db));
+ * for (const r of report.repairPlan) console.log(r.command);
+ * ```
+ */
+export function detectDependencyCycles(edges) {
+    const adjacency = buildAdjacency(edges);
+    const nodes = [...new Set(edges.flatMap((e) => [e.taskId, e.dependsOn]))].sort();
+    // Tarjan SCC, iterative.
+    const index = new Map();
+    const low = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const components = [];
+    let counter = 0;
+    for (const root of nodes) {
+        if (index.has(root))
+            continue;
+        const frames = [{ id: root, next: 0 }];
+        index.set(root, counter);
+        low.set(root, counter++);
+        stack.push(root);
+        onStack.add(root);
+        while (frames.length > 0) {
+            const frame = frames[frames.length - 1];
+            const successors = adjacency.get(frame.id) ?? [];
+            if (frame.next < successors.length) {
+                const w = successors[frame.next++];
+                if (!index.has(w)) {
+                    index.set(w, counter);
+                    low.set(w, counter++);
+                    stack.push(w);
+                    onStack.add(w);
+                    frames.push({ id: w, next: 0 });
+                }
+                else if (onStack.has(w)) {
+                    low.set(frame.id, Math.min(low.get(frame.id), index.get(w)));
+                }
+                continue;
+            }
+            frames.pop();
+            const parent = frames[frames.length - 1];
+            if (parent) {
+                low.set(parent.id, Math.min(low.get(parent.id), low.get(frame.id)));
+            }
+            if (low.get(frame.id) === index.get(frame.id)) {
+                const component = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.delete(w);
+                    component.push(w);
+                } while (w !== frame.id);
+                components.push(component.sort());
+            }
+        }
+    }
+    const cyclic = components.filter((c) => c.length > 1 || (adjacency.get(c[0]) ?? []).includes(c[0]));
+    const reported = cyclic
+        .map((tasks) => {
+        const start = tasks[0];
+        const members = new Set(tasks);
+        const inside = new Map(tasks.map((t) => [t, (adjacency.get(t) ?? []).filter((n) => members.has(n))]));
+        // A cycle through `start`: shortest path from a successor back to it.
+        let cycle = [start, start];
+        for (const next of inside.get(start) ?? []) {
+            const back = shortestPath(inside, next, start);
+            if (back) {
+                cycle = [start, ...back];
+                break;
+            }
+        }
+        return { tasks, cycle };
+    })
+        .sort((a, b) => a.tasks[0].localeCompare(b.tasks[0]));
+    // Repair plan: back edges of one DFS over the cyclic components.
+    const repairPlan = [];
+    const state = new Map();
+    for (const { tasks } of reported) {
+        const members = new Set(tasks);
+        for (const root of tasks) {
+            if (state.has(root))
+                continue;
+            const frames = [{ id: root, next: 0 }];
+            const path = [root];
+            state.set(root, 'active');
+            while (frames.length > 0) {
+                const frame = frames[frames.length - 1];
+                const successors = (adjacency.get(frame.id) ?? []).filter((n) => members.has(n));
+                if (frame.next < successors.length) {
+                    const w = successors[frame.next++];
+                    const seen = state.get(w);
+                    if (seen === undefined) {
+                        state.set(w, 'active');
+                        frames.push({ id: w, next: 0 });
+                        path.push(w);
+                    }
+                    else if (seen === 'active') {
+                        repairPlan.push({
+                            edge: { taskId: frame.id, dependsOn: w },
+                            command: `cleo update ${frame.id} --remove-depends ${w}`,
+                            breaks: [...path.slice(path.indexOf(w)), w],
+                        });
+                    }
+                    continue;
+                }
+                state.set(frame.id, 'done');
+                frames.pop();
+                path.pop();
+            }
+        }
+    }
+    return { edgeCount: edges.length, components: reported, repairPlan };
+}
+//# sourceMappingURL=dependency-cycles.js.map

package/dist/store/dependency-cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-cycles.js","sourceRoot":"","sources":["../../src/store/dependency-cycles.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAE/C,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAE5C,iEAAiE;AACjE,MAAM,CAAC,MAAM,qBAAqB,GAAG,yBAAyB,CAAC;AA0C/D,wCAAwC;AACxC,MAAM,UAAU,qBAAqB,CAAC,KAAwB;IAC5D,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,cAAc,CAAC,KAA+B;IACrD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,KAAK,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;YAC1B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,MAAM,EAAE;QAAE,IAAI,CAAC,IAAI,EAAE,CAAC;IACnD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CACnB,SAAiD,EACjD,IAAY,EACZ,EAAU;IAEV,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC/C,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAW,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACjC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACvB,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;gBAChB,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClB,IAAI,MAAM,GAAG,EAAE,CAAC;gBAChB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAClB,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAW,CAAC;gBAC1C,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAkC,EAClC,IAAoB;IAEpB,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,YAAY,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACjF,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAoB,EAAE,KAAwB;IACjF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI;QAClB,CAAC,CAAC,GAAG,qBAAqB,UAAU,IAAI,CAAC,MAAM,0BAA0B;QACzE,CAAC,CAAC,GAAG,qBAAqB,KAAK,IAAI,CAAC,MAAM,eAAe,IAAI,CAAC,SAAS,oCAAoC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;IAC5I,2EAA2E;IAC3E,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxE,MAAM,GAAG,GAAG,IAAI;QACd,CAAC,CAAC,QAAQ,IAAI,CAAC,MAAM,8BAA8B;QACnD,CAAC,CAAC,wEAAwE;YACxE,eAAe,OAAO,qBAAqB,IAAI,CAAC,MAAM,EAAE,CAAC;IAC7D,OAAO,IAAI,SAAS,CAAC,QAAQ,CAAC,kBAAkB,EAAE,OAAO,EAAE;QACzD,GAAG;QACH,OAAO,EAAE;YACP,KAAK,EAAE,SAAS;YAChB,MAAM,EAAE,IAAI,CAAC,SAAS;YACtB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC;SAClB;KACF,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAY;IACjD,KAAK,IAAI,CAAC,GAAY,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,YAAY,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/E,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,qBAAqB,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3D,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAsB;IACxD,OAAO,EAAE;SACN,MAAM,CAAC;QACN,MAAM,EAAE,MAAM,CAAC,gBAAgB,CAAC,MAAM;QACtC,SAAS,EAAE,MAAM,CAAC,gBAAgB,CAAC,SAAS;KAC7C,CAAC;SACD,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC;SAC7B,GAAG,EAAE,CAAC;AACX,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,EAAsB,EACtB,GAAY,EACZ,SAAoC;IAEpC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC;QAAE,MAAM,GAAG,CAAC;IAC5C,MAAM,KAAK,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,KAAK;YAAE,MAAM,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACnD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,CAAC;AACZ,CAAC;AAYD,SAAS,WAAW,CAAC,IAAoB,EAAE,KAAwB;IACjE,OAAO;QACL,IAAI;QACJ,KAAK;QACL,OAAO,EACL,sBAAsB,IAAI,CAAC,MAAM,MAAM,IAAI,CAAC,SAAS,kCAAkC;YACvF,SAAS,qBAAqB,CAAC,KAAK,CAAC,KAAK,qBAAqB,GAAG;KACrE,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,+BAA+B,CAC7C,EAAsB,EACtB,IAAoB;IAEpB,IAAI,CAAC;QACH,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,mBAAmB,EAAE,CAAC,GAAG,EAAE,CAAC;QAC5E,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC;YAAE,MAAM,GAAG,CAAC;QAC5C,MAAM,KAAK,GAAG,eAAe,CAAC,mBAAmB,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3F,OAAO,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,QAAmC,EACnC,OAAkC;IAElC,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC7E,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;QACpD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACvC,SAAS;QACX,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAgC;IACrE,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAEjF,yBAAyB;IACzB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9B,MAAM,MAAM,GAAwC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5E,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAiC,CAAC;YACxE,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACjD,IAAI,KAAK,CAAC,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAW,CAAC;gBAC7C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACtB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACf,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBAClC,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;gBACnF,CAAC;gBACD,SAAS;YACX,CAAC;YACD,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,MAAM,EAAE,CAAC;gBACX,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAW,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAW,CAAC,CAAC,CAAC;YAC1F,CAAC;YACD,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9C,MAAM,SAAS,GAAa,EAAE,CAAC;gBAC/B,IAAI,CAAS,CAAC;gBACd,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;oBAC1B,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC,QAAQ,CAAC,KAAK,KAAK,CAAC,EAAE,EAAE;gBACzB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,CACtF,CAAC;IAEF,MAAM,QAAQ,GAA+B,MAAM;SAChD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACb,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9E,CAAC;QACF,sEAAsE;QACtE,IAAI,KAAK,GAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/C,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,GAAG,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;gBACzB,MAAM;YACR,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAY,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;IAE9E,iEAAiE;IACjE,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;IACnD,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC9B,MAAM,MAAM,GAAwC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,MAAM,IAAI,GAAa,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC1B,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAiC,CAAC;gBACxE,MAAM,UAAU,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjF,IAAI,KAAK,CAAC,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAW,CAAC;oBAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC1B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;wBACvB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;wBAChC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACf,CAAC;yBAAM,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE;4BACxC,OAAO,EAAE,eAAe,KAAK,CAAC,EAAE,qBAAqB,CAAC,EAAE;4BACxD,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;yBAC5C,CAAC,CAAC;oBACL,CAAC;oBACD,SAAS;gBACX,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC5B,MAAM,CAAC,GAAG,EAAE,CAAC;gBACb,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AACvE,CAAC"}