@opencodehub/ingestion 0.1.0

package/dist/pipeline/profile-detectors/src-dirs.js

@@ -0,0 +1,89 @@
+/**
+ * Source-directory detection.
+ *
+ * Heuristic: walk the top 2 levels of the repo. A directory qualifies as a
+ * "src dir" when it contains > 10 code files directly underneath (recursive
+ * descendants count). Common build/cache/vcs folders are excluded via a
+ * stop-list so we don't return `node_modules`, `.git`, or `dist`.
+ *
+ * The scan phase has already applied the repo's gitignore so most noise is
+ * filtered before this point, but the stop-list is still applied
+ * defensively.
+ *
+ * Determinism: output is sorted alphabetically.
+ */
+const STOP_LIST = new Set([
+    "node_modules",
+    ".git",
+    ".venv",
+    "venv",
+    "target",
+    "build",
+    "dist",
+    "__pycache__",
+    ".next",
+    ".turbo",
+    ".nuxt",
+    "vendor",
+    ".tox",
+    "coverage",
+    ".pytest_cache",
+    ".mypy_cache",
+    ".ruff_cache",
+    ".idea",
+    ".vscode",
+]);
+const MIN_CODE_FILES = 10;
+/** Two-level ancestor directories for a relative path, or `undefined`. */
+function topLevelAncestors(relPath) {
+    const parts = relPath.split("/");
+    if (parts.length < 2)
+        return [];
+    const out = [];
+    // Level 1 — first segment
+    const first = parts[0];
+    if (first !== undefined && first !== "")
+        out.push(first);
+    // Level 2 — first two segments joined
+    if (parts.length >= 3) {
+        const second = parts[1];
+        if (first !== undefined && second !== undefined && first !== "" && second !== "") {
+            out.push(`${first}/${second}`);
+        }
+    }
+    return out;
+}
+function isStopListed(dirPath) {
+    // Reject the dir if any segment appears in the stop list. This matches
+    // ".venv/bin" as well as plain "node_modules".
+    for (const seg of dirPath.split("/")) {
+        if (STOP_LIST.has(seg))
+            return true;
+    }
+    return false;
+}
+function looksLikeCodeFile(lang) {
+    return lang !== undefined;
+}
+export function detectSrcDirs(files) {
+    if (files.length === 0)
+        return [];
+    const counts = new Map();
+    for (const f of files) {
+        if (!looksLikeCodeFile(f.language))
+            continue;
+        for (const dir of topLevelAncestors(f.relPath)) {
+            if (isStopListed(dir))
+                continue;
+            counts.set(dir, (counts.get(dir) ?? 0) + 1);
+        }
+    }
+    const out = [];
+    for (const [dir, count] of counts) {
+        if (count > MIN_CODE_FILES)
+            out.push(dir);
+    }
+    out.sort();
+    return out;
+}
+//# sourceMappingURL=src-dirs.js.map

package/dist/pipeline/profile-detectors/src-dirs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"src-dirs.js","sourceRoot":"","sources":["../../../src/pipeline/profile-detectors/src-dirs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,MAAM,SAAS,GAAwB,IAAI,GAAG,CAAC;IAC7C,cAAc;IACd,MAAM;IACN,OAAO;IACP,MAAM;IACN,QAAQ;IACR,OAAO;IACP,MAAM;IACN,aAAa;IACb,OAAO;IACP,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,MAAM;IACN,UAAU;IACV,eAAe;IACf,aAAa;IACb,aAAa;IACb,OAAO;IACP,SAAS;CACV,CAAC,CAAC;AAEH,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,0EAA0E;AAC1E,SAAS,iBAAiB,CAAC,OAAe;IACxC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,0BAA0B;IAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzD,sCAAsC;IACtC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;YACjF,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,OAAe;IACnC,uEAAuE;IACvE,+CAA+C;IAC/C,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CAAC,IAA4B;IACrD,OAAO,IAAI,KAAK,SAAS,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAA6B;IACzD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,QAAQ,CAAC;YAAE,SAAS;QAC7C,KAAK,MAAM,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/C,IAAI,YAAY,CAAC,GAAG,CAAC;gBAAE,SAAS;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QAClC,IAAI,KAAK,GAAG,cAAc;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5C,CAAC;IACD,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/pipeline/profile-detectors/variant-detectors.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Back-compat shim for the legacy `variant-detectors` module.
+ *
+ * @deprecated Import from `@opencodehub/frameworks` instead.
+ */
+export { VARIANT_RESOLVERS, type VariantResolveInput, type VariantResolver, } from "@opencodehub/frameworks";
+//# sourceMappingURL=variant-detectors.d.ts.map

package/dist/pipeline/profile-detectors/variant-detectors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"variant-detectors.d.ts","sourceRoot":"","sources":["../../../src/pipeline/profile-detectors/variant-detectors.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,iBAAiB,EACjB,KAAK,mBAAmB,EACxB,KAAK,eAAe,GACrB,MAAM,yBAAyB,CAAC"}

package/dist/pipeline/profile-detectors/variant-detectors.js

@@ -0,0 +1,7 @@
+/**
+ * Back-compat shim for the legacy `variant-detectors` module.
+ *
+ * @deprecated Import from `@opencodehub/frameworks` instead.
+ */
+export { VARIANT_RESOLVERS, } from "@opencodehub/frameworks";
+//# sourceMappingURL=variant-detectors.js.map

package/dist/pipeline/profile-detectors/variant-detectors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"variant-detectors.js","sourceRoot":"","sources":["../../../src/pipeline/profile-detectors/variant-detectors.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,iBAAiB,GAGlB,MAAM,yBAAyB,CAAC"}

package/dist/pipeline/runner.d.ts

@@ -0,0 +1,54 @@
+/**
+ * DAG validator + topological executor for the ingestion pipeline.
+ *
+ * The runner owns three concerns:
+ *  1. Structural validation — duplicate-name, missing-dep, and cycle
+ *     detection (the latter returns a concrete cycle path so failure
+ *     messages point operators at the offending arrows).
+ *  2. Deterministic ordering — Kahn's algorithm with an alphabetic name
+ *     tiebreak so the output order is reproducible across runs and across
+ *     JS engine Map iteration quirks.
+ *  3. Dep isolation — each phase only sees outputs of the phases it
+ *     declared as dependencies. This blocks implicit coupling and keeps
+ *     the DAG honest: if phase B reads phase A's output, B must name A in
+ *     its `deps`.
+ *
+ * Error wrapping: when a phase throws, the runner re-throws as a regular
+ * `Error` whose message embeds the phase name and whose `cause` points at
+ * the original error. Progress-callback errors are swallowed so they can
+ * never mask the original failure.
+ */
+import type { PhaseResult, PipelineContext, PipelinePhase } from "./types.js";
+/** Structural problem with the phase set (duplicate/missing/cycle). */
+export declare class PipelineGraphError extends Error {
+    readonly cyclePath?: readonly string[];
+    readonly missing?: readonly string[];
+    readonly duplicate?: readonly string[];
+    constructor(message: string, details?: {
+        readonly cyclePath?: readonly string[];
+        readonly missing?: readonly string[];
+        readonly duplicate?: readonly string[];
+    });
+}
+/**
+ * Walk phases and surface structural errors as a single
+ * {@link PipelineGraphError}. Checks run in order (duplicate → missing →
+ * cycle) so the most actionable message wins.
+ */
+export declare function validatePipeline(phases: readonly PipelinePhase[]): void;
+/**
+ * Kahn topological sort with an alphabetic name tiebreak.
+ *
+ * The tiebreak is purely cosmetic — any topological order is correct — but
+ * pinning it ensures two structurally identical pipelines produce the same
+ * execution order across machines and Map iteration implementations.
+ */
+export declare function topologicalSort(phases: readonly PipelinePhase[]): readonly PipelinePhase[];
+/**
+ * Execute phases in topological order. Each phase receives a filtered map
+ * containing only the outputs of phases it declared in `deps`. Per-phase
+ * timing is captured and returned. Failures wrap with the phase name and
+ * halt further execution.
+ */
+export declare function runPipeline(phases: readonly PipelinePhase[], ctx: PipelineContext): Promise<readonly PhaseResult[]>;
+//# sourceMappingURL=runner.d.ts.map

package/dist/pipeline/runner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"runner.d.ts","sourceRoot":"","sources":["../../src/pipeline/runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,EAAiB,MAAM,YAAY,CAAC;AAE7F,uEAAuE;AACvE,qBAAa,kBAAmB,SAAQ,KAAK;IAC3C,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;gBAGrC,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;QACP,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QACvC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;KACnC;CAQT;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,GAAG,IAAI,CA0EvE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,GAAG,SAAS,aAAa,EAAE,CAiD1F;AAWD;;;;;GAKG;AACH,wBAAsB,WAAW,CAC/B,MAAM,EAAE,SAAS,aAAa,EAAE,EAChC,GAAG,EAAE,eAAe,GACnB,OAAO,CAAC,SAAS,WAAW,EAAE,CAAC,CAkEjC"}

package/dist/pipeline/runner.js

@@ -0,0 +1,247 @@
+/**
+ * DAG validator + topological executor for the ingestion pipeline.
+ *
+ * The runner owns three concerns:
+ *  1. Structural validation — duplicate-name, missing-dep, and cycle
+ *     detection (the latter returns a concrete cycle path so failure
+ *     messages point operators at the offending arrows).
+ *  2. Deterministic ordering — Kahn's algorithm with an alphabetic name
+ *     tiebreak so the output order is reproducible across runs and across
+ *     JS engine Map iteration quirks.
+ *  3. Dep isolation — each phase only sees outputs of the phases it
+ *     declared as dependencies. This blocks implicit coupling and keeps
+ *     the DAG honest: if phase B reads phase A's output, B must name A in
+ *     its `deps`.
+ *
+ * Error wrapping: when a phase throws, the runner re-throws as a regular
+ * `Error` whose message embeds the phase name and whose `cause` points at
+ * the original error. Progress-callback errors are swallowed so they can
+ * never mask the original failure.
+ */
+/** Structural problem with the phase set (duplicate/missing/cycle). */
+export class PipelineGraphError extends Error {
+    cyclePath;
+    missing;
+    duplicate;
+    constructor(message, details = {}) {
+        super(message);
+        this.name = "PipelineGraphError";
+        if (details.cyclePath !== undefined)
+            this.cyclePath = details.cyclePath;
+        if (details.missing !== undefined)
+            this.missing = details.missing;
+        if (details.duplicate !== undefined)
+            this.duplicate = details.duplicate;
+    }
+}
+/**
+ * Walk phases and surface structural errors as a single
+ * {@link PipelineGraphError}. Checks run in order (duplicate → missing →
+ * cycle) so the most actionable message wins.
+ */
+export function validatePipeline(phases) {
+    // ---- 1. Duplicate name detection. -------------------------------------
+    const seen = new Set();
+    const dupes = [];
+    for (const p of phases) {
+        if (seen.has(p.name))
+            dupes.push(p.name);
+        else
+            seen.add(p.name);
+    }
+    if (dupes.length > 0) {
+        const sortedDupes = [...new Set(dupes)].sort();
+        throw new PipelineGraphError(`Duplicate phase name(s): ${sortedDupes.join(", ")}`, {
+            duplicate: sortedDupes,
+        });
+    }
+    // ---- 2. Missing-dep detection. ----------------------------------------
+    const names = new Set(phases.map((p) => p.name));
+    const missing = [];
+    for (const p of phases) {
+        for (const d of p.deps) {
+            if (!names.has(d)) {
+                missing.push(`${p.name} -> ${d}`);
+            }
+        }
+    }
+    if (missing.length > 0) {
+        throw new PipelineGraphError(`Missing dependency: ${missing.join(", ")}`, { missing });
+    }
+    // ---- 3. Cycle detection via DFS; returns a concrete cycle path. -------
+    const adj = new Map();
+    for (const p of phases)
+        adj.set(p.name, p.deps);
+    const WHITE = 0;
+    const GRAY = 1;
+    const BLACK = 2;
+    const color = new Map();
+    for (const p of phases)
+        color.set(p.name, WHITE);
+    const stack = [];
+    function dfs(n) {
+        color.set(n, GRAY);
+        stack.push(n);
+        const outgoing = adj.get(n) ?? [];
+        for (const next of outgoing) {
+            const c = color.get(next);
+            if (c === GRAY) {
+                // Found a back-edge: slice the stack from where `next` first
+                // appears and close the cycle by appending `next` again.
+                const startIdx = stack.indexOf(next);
+                const path = stack.slice(startIdx);
+                path.push(next);
+                return path;
+            }
+            if (c === WHITE) {
+                const found = dfs(next);
+                if (found !== undefined)
+                    return found;
+            }
+        }
+        stack.pop();
+        color.set(n, BLACK);
+        return undefined;
+    }
+    const sortedNames = [...names].sort();
+    for (const n of sortedNames) {
+        if (color.get(n) === WHITE) {
+            const cyclePath = dfs(n);
+            if (cyclePath !== undefined) {
+                throw new PipelineGraphError(`Cycle detected: ${cyclePath.join(" -> ")}`, { cyclePath });
+            }
+        }
+    }
+}
+/**
+ * Kahn topological sort with an alphabetic name tiebreak.
+ *
+ * The tiebreak is purely cosmetic — any topological order is correct — but
+ * pinning it ensures two structurally identical pipelines produce the same
+ * execution order across machines and Map iteration implementations.
+ */
+export function topologicalSort(phases) {
+    validatePipeline(phases);
+    const byName = new Map();
+    for (const p of phases)
+        byName.set(p.name, p);
+    // Inverse edges: consumer-of map so we can enqueue dependents when a
+    // phase has no outstanding deps.
+    const consumers = new Map();
+    for (const p of phases)
+        consumers.set(p.name, []);
+    const indeg = new Map();
+    for (const p of phases) {
+        indeg.set(p.name, p.deps.length);
+        for (const d of p.deps) {
+            consumers.get(d).push(p.name);
+        }
+    }
+    // Min-heap via a sorted array — O(n log n) is fine for DAG sizes we see.
+    const ready = [];
+    for (const [n, deg] of indeg) {
+        if (deg === 0)
+            ready.push(n);
+    }
+    ready.sort();
+    const order = [];
+    while (ready.length > 0) {
+        const next = ready.shift();
+        order.push(byName.get(next));
+        const dependents = consumers.get(next) ?? [];
+        for (const dep of dependents) {
+            const d = (indeg.get(dep) ?? 0) - 1;
+            indeg.set(dep, d);
+            if (d === 0) {
+                // Insert in sorted position — cheap given tiny ready-set sizes.
+                let i = 0;
+                while (i < ready.length && ready[i] < dep)
+                    i += 1;
+                ready.splice(i, 0, dep);
+            }
+        }
+    }
+    if (order.length !== phases.length) {
+        // Should be unreachable — validatePipeline catches cycles — but be
+        // explicit so future edits don't silently produce bad orderings.
+        throw new PipelineGraphError("Topological sort did not consume every phase");
+    }
+    return order;
+}
+function emit(ctx, ev) {
+    if (ctx.onProgress === undefined)
+        return;
+    try {
+        ctx.onProgress(ev);
+    }
+    catch {
+        // Progress-callback errors must never mask phase-level failures.
+    }
+}
+/**
+ * Execute phases in topological order. Each phase receives a filtered map
+ * containing only the outputs of phases it declared in `deps`. Per-phase
+ * timing is captured and returned. Failures wrap with the phase name and
+ * halt further execution.
+ */
+export async function runPipeline(phases, ctx) {
+    const ordered = topologicalSort(phases);
+    const outputs = new Map();
+    const results = [];
+    // The context exposes phaseOutputs as a read-only view; we update the
+    // underlying map via a thin wrapper so later phases observe prior ones.
+    const livePhaseOutputs = outputs;
+    const liveCtx = {
+        ...ctx,
+        phaseOutputs: livePhaseOutputs,
+    };
+    // Gated memory/timing telemetry. Only active when `DEBUG_PHASE_MEM=1` is
+    // set in the environment; leave unset in normal usage so we don't spam
+    // stderr for every analyze run. Useful for diagnosing OOM/regression on
+    // large monorepos.
+    const phaseMemDebug = process.env["DEBUG_PHASE_MEM"] === "1";
+    for (const phase of ordered) {
+        const depMap = new Map();
+        for (const d of phase.deps) {
+            depMap.set(d, outputs.get(d));
+        }
+        emit(liveCtx, { phase: phase.name, kind: "start" });
+        const started = Date.now();
+        const memBefore = phaseMemDebug ? process.memoryUsage() : undefined;
+        let output;
+        try {
+            output = await phase.run(liveCtx, depMap);
+        }
+        catch (err) {
+            const cause = err instanceof Error ? err : new Error(String(err));
+            const wrapped = new Error(`Phase '${phase.name}' failed: ${cause.message}`, {
+                cause,
+            });
+            emit(liveCtx, {
+                phase: phase.name,
+                kind: "error",
+                message: cause.message,
+                elapsedMs: Date.now() - started,
+            });
+            throw wrapped;
+        }
+        const durationMs = Date.now() - started;
+        if (phaseMemDebug && memBefore !== undefined) {
+            const memAfter = process.memoryUsage();
+            const mb = (n) => Math.round(n / 1024 / 1024);
+            const delta = memAfter.heapUsed - memBefore.heapUsed;
+            process.stderr.write(`[phase-telemetry] ${phase.name} dur=${durationMs}ms ` +
+                `heapUsed=${mb(memAfter.heapUsed)}MB rss=${mb(memAfter.rss)}MB ` +
+                `delta=${delta >= 0 ? "+" : ""}${mb(delta)}MB\n`);
+        }
+        outputs.set(phase.name, output);
+        results.push({ name: phase.name, output, durationMs, warnings: [] });
+        emit(liveCtx, {
+            phase: phase.name,
+            kind: "end",
+            elapsedMs: durationMs,
+        });
+    }
+    return results;
+}
+//# sourceMappingURL=runner.js.map

package/dist/pipeline/runner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runner.js","sourceRoot":"","sources":["../../src/pipeline/runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAIH,uEAAuE;AACvE,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IAClC,SAAS,CAAqB;IAC9B,OAAO,CAAqB;IAC5B,SAAS,CAAqB;IAEvC,YACE,OAAe,EACf,UAII,EAAE;QAEN,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC;QACjC,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACxE,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAClE,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IAC1E,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAgC;IAC/D,0EAA0E;IAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;;YACpC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/C,MAAM,IAAI,kBAAkB,CAAC,4BAA4B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE;YACjF,SAAS,EAAE,WAAW;SACvB,CAAC,CAAC;IACL,CAAC;IAED,0EAA0E;IAC1E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACjD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,kBAAkB,CAAC,uBAAuB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IACzF,CAAC;IAED,0EAA0E;IAC1E,MAAM,GAAG,GAAG,IAAI,GAAG,EAA6B,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAEhD,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEjD,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,SAAS,GAAG,CAAC,CAAS;QACpB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,6DAA6D;gBAC7D,yDAAyD;gBACzD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACrC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChB,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;gBAChB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;gBACxB,IAAI,KAAK,KAAK,SAAS;oBAAE,OAAO,KAAK,CAAC;YACxC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACpB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,IAAI,kBAAkB,CAAC,mBAAmB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,MAAgC;IAC9D,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAEzB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE9C,qEAAqE;IACrE,iCAAiC;IACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACtB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAC7B,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,CAAC,IAAI,EAAE,CAAC;IAEb,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAkB,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,gEAAgE;gBAChE,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAK,KAAK,CAAC,CAAC,CAAY,GAAG,GAAG;oBAAE,CAAC,IAAI,CAAC,CAAC;gBAC9D,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACnC,mEAAmE;QACnE,iEAAiE;QACjE,MAAM,IAAI,kBAAkB,CAAC,8CAA8C,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,IAAI,CAAC,GAAoB,EAAE,EAAiB;IACnD,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO;IACzC,IAAI,CAAC;QACH,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,iEAAiE;IACnE,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,MAAgC,EAChC,GAAoB;IAEpB,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,sEAAsE;IACtE,wEAAwE;IACxE,MAAM,gBAAgB,GAAiC,OAAO,CAAC;IAC/D,MAAM,OAAO,GAAoB;QAC/B,GAAG,GAAG;QACN,YAAY,EAAE,gBAAgB;KAC/B,CAAC;IAEF,yEAAyE;IACzE,uEAAuE;IACvE,wEAAwE;IACxE,mBAAmB;IACnB,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,KAAK,GAAG,CAAC;IAE7D,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACpE,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC5C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,UAAU,KAAK,CAAC,IAAI,aAAa,KAAK,CAAC,OAAO,EAAE,EAAE;gBAC1E,KAAK;aACN,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,EAAE;gBACZ,KAAK,EAAE,KAAK,CAAC,IAAI;gBACjB,IAAI,EAAE,OAAO;gBACb,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO;aAChC,CAAC,CAAC;YACH,MAAM,OAAO,CAAC;QAChB,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;QACxC,IAAI,aAAa,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,EAAE,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;YAC9D,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;YACrD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,qBAAqB,KAAK,CAAC,IAAI,QAAQ,UAAU,KAAK;gBACpD,YAAY,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK;gBAChE,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CACnD,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QACrE,IAAI,CAAC,OAAO,EAAE;YACZ,KAAK,EAAE,KAAK,CAAC,IAAI;YACjB,IAAI,EAAE,KAAK;YACX,SAAS,EAAE,UAAU;SACtB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}