@aquex/cmos-mcp 1.0.0

package/dist/auth/project-key-capture.js

@@ -0,0 +1,218 @@
+"use strict";
+// ABOUTME: Sprint 57 m02 — capture + partial-failure recovery for auto-issued project-scoped keys.
+// ABOUTME: Keeps the credential-store write discipline out of checkpoint-backfill and the startup hook.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.captureRegisterResponse = captureRegisterResponse;
+exports.recoverProjectKey = recoverProjectKey;
+exports.runStartupProjectKeyRecovery = runStartupProjectKeyRecovery;
+exports.runStartupCredentialCheck = runStartupCredentialCheck;
+/**
+ * Project-scoped key capture + /reissue recovery.
+ *
+ * This module centralizes the two write paths that move a project-scoped
+ * key from the dashboard into the local `CredentialStore`:
+ *
+ *  1. **Auto-capture on registration** (`captureRegisterResponse`) —
+ *     `POST /api/projects/register` returns `{ key, keyId, label }` on
+ *     first-time registration. We stamp it to `projectKeys[projectRoot]`
+ *     with `parentKeyId` set to the user-scoped credential that
+ *     authenticated the register call.
+ *
+ *  2. **Partial-failure recovery** (`recoverProjectKey`) — if the register
+ *     response arrives but the local write fails (crash, disk error), the
+ *     dashboard has a project-scoped key that we don't know about. We call
+ *     `POST /api/projects/:id/keys/reissue` on next startup, which revokes
+ *     the orphan and mints a fresh one bound to the same parent.
+ *
+ * @module auth/project-key-capture
+ */
+const dashboard_client_1 = require("../tools/cmos/dashboard-client");
+const client_1 = require("../tools/cmos/client");
+const credential_store_1 = require("../intelligence/credential-store");
+/**
+ * Inspect a `/register` response and persist a new project-scoped key row
+ * when one was minted. Idempotent re-registrations (`keyRotated === false`)
+ * are no-ops; first-time registrations with a `key` produce a write.
+ */
+async function captureRegisterResponse(options) {
+    // Idempotent re-register — dashboard explicitly signals "no new key minted."
+    if (options.response.keyRotated === false) {
+        return 'reregistration-noop';
+    }
+    const { key, keyId, label } = options.response;
+    if (!key || !keyId) {
+        return 'no-key-in-response';
+    }
+    if (!options.parentKeyId) {
+        return 'missing-parent-key-id';
+    }
+    const now = new Date().toISOString();
+    const record = {
+        key,
+        keyId,
+        parentKeyId: options.parentKeyId,
+        label: label ?? '',
+        issuedAt: now,
+        lastUsedAt: now,
+    };
+    const store = options.store ?? (await credential_store_1.CredentialStore.create());
+    await store.upsertProjectKey(options.projectRoot, record);
+    return 'captured';
+}
+/**
+ * Call `/api/projects/:id/keys/reissue` and persist the response to the
+ * local store. Callers should gate this behind a check that `getProjectKey`
+ * returns undefined (otherwise the existing key is fine).
+ */
+async function recoverProjectKey(options) {
+    const store = options.store ?? (await credential_store_1.CredentialStore.create());
+    const existing = await store.getProjectKey(options.projectRoot);
+    if (existing) {
+        return { kind: 'no-op-already-present' };
+    }
+    const parentKeyId = options.client.authenticatingKeyId;
+    if (!parentKeyId) {
+        return { kind: 'missing-parent-key-id' };
+    }
+    const result = await options.client.reissueProjectKey(options.projectId);
+    if (!result.success || !result.data) {
+        return {
+            kind: 'reissue-failed',
+            error: result.error?.message ?? 'reissue returned no data',
+        };
+    }
+    const now = new Date().toISOString();
+    const record = {
+        key: result.data.key,
+        keyId: result.data.keyId,
+        parentKeyId,
+        label: result.data.label,
+        issuedAt: now,
+        lastUsedAt: now,
+    };
+    await store.upsertProjectKey(options.projectRoot, record);
+    return { kind: 'recovered', record };
+}
+async function defaultMetadataReader(projectRoot) {
+    try {
+        const result = await (0, client_1.withClientAsync)(async (client) => {
+            const registered = client.getOne(`SELECT value FROM metadata WHERE key = 'dashboard_registered'`);
+            const projectId = client.getOne(`SELECT value FROM metadata WHERE key = 'dashboard_project_id'`);
+            return {
+                success: true,
+                data: {
+                    registered: registered.success && registered.data?.value === 'true',
+                    projectId: (projectId.success && projectId.data?.value) || null,
+                },
+            };
+        }, { projectRoot });
+        if (!result.success || !result.data)
+            return null;
+        return result.data;
+    }
+    catch {
+        return null;
+    }
+}
+async function defaultClientFactory(projectRoot) {
+    const result = await dashboard_client_1.DashboardClient.fromEnvForProject(projectRoot);
+    if (!result.success || !result.data)
+        return null;
+    return result.data.client;
+}
+/**
+ * Scan the current project for a registered-but-missing project key and call
+ * `/reissue` to recover it. Runs at startup after attribution self-test.
+ *
+ * Always returns a structured result — never throws. The caller (index.ts)
+ * logs a single line based on `status`.
+ */
+async function runStartupProjectKeyRecovery(options = {}) {
+    if (!options.projectRoot) {
+        return {
+            checked: false,
+            status: 'skipped-no-project',
+            message: 'no project root resolved — skipping',
+        };
+    }
+    const metadataReader = options.metadataReader ?? defaultMetadataReader;
+    const metadata = await metadataReader(options.projectRoot);
+    if (!metadata || !metadata.registered || !metadata.projectId) {
+        return {
+            checked: true,
+            status: 'skipped-not-registered',
+            message: 'project has no dashboard registration — nothing to recover',
+        };
+    }
+    const store = options.store ?? (await credential_store_1.CredentialStore.create());
+    const existing = await store.getProjectKey(options.projectRoot);
+    if (existing) {
+        return {
+            checked: true,
+            status: 'skipped-already-present',
+            message: 'local project key already present',
+        };
+    }
+    const clientFactory = options.clientFactory ?? defaultClientFactory;
+    const client = await clientFactory(options.projectRoot);
+    if (!client) {
+        return {
+            checked: true,
+            status: 'skipped-unconfigured',
+            message: 'dashboard client unavailable — recovery deferred',
+        };
+    }
+    const result = await recoverProjectKey({
+        projectRoot: options.projectRoot,
+        projectId: metadata.projectId,
+        client,
+        store,
+    });
+    switch (result.kind) {
+        case 'recovered':
+            return {
+                checked: true,
+                status: 'recovered',
+                message: `reissued project key (keyId=${result.record.keyId})`,
+            };
+        case 'no-op-already-present':
+            return {
+                checked: true,
+                status: 'skipped-already-present',
+                message: 'local project key present on re-read',
+            };
+        case 'missing-parent-key-id':
+            return {
+                checked: true,
+                status: 'skipped-no-parent-key-id',
+                message: 'dashboard client has no authenticatingKeyId — run device code flow, then reissue will succeed',
+            };
+        case 'reissue-failed':
+            return {
+                checked: true,
+                status: 'error',
+                message: `reissue failed: ${result.error}`,
+            };
+    }
+}
+/**
+ * Inspect the local credential store on startup and emit a one-line [WARN]
+ * when no user-scoped keys are present. A fresh install with no device-code
+ * bootstrap looks identical to a broken install from the MCP's perspective —
+ * this makes that state audible so the operator knows to run
+ * `cmos_auth(action="login")` before attempting a send.
+ *
+ * Non-fatal: never throws. Startup continues regardless.
+ */
+async function runStartupCredentialCheck(options = {}) {
+    const store = options.store ?? (await credential_store_1.CredentialStore.create());
+    const writer = options.writer ?? ((line) => process.stderr.write(line));
+    const userKeys = await store.listUserScopedKeys();
+    const count = Object.keys(userKeys).length;
+    if (count === 0) {
+        writer('[WARN] cmos-mcp: no user-scoped credentials found; run cmos_auth(action="login") to bootstrap\n');
+        return { status: 'empty-credential-store', warned: true, userScopedKeyCount: 0 };
+    }
+    return { status: 'has-user-scoped-keys', warned: false, userScopedKeyCount: count };
+}
+//# sourceMappingURL=project-key-capture.js.map

package/dist/auth/project-key-capture.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project-key-capture.js","sourceRoot":"","sources":["../../src/auth/project-key-capture.ts"],"names":[],"mappings":";AAAA,mGAAmG;AACnG,wGAAwG;;AA2DxG,0DA8BC;AAwBD,8CAiCC;AAuED,oEAgFC;AAuBD,8DAiBC;AA/UD;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,qEAAiE;AAEjE,iDAAuD;AACvD,uEAA0F;AA4B1F;;;;GAIG;AACI,KAAK,UAAU,uBAAuB,CAC3C,OAAuC;IAEvC,6EAA6E;IAC7E,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;QAC1C,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IAED,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC;IAC/C,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACnB,OAAO,oBAAoB,CAAC;IAC9B,CAAC;IAED,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACzB,OAAO,uBAAuB,CAAC;IACjC,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,MAAM,GAAqB;QAC/B,GAAG;QACH,KAAK;QACL,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,KAAK,EAAE,KAAK,IAAI,EAAE;QAClB,QAAQ,EAAE,GAAG;QACb,UAAU,EAAE,GAAG;KAChB,CAAC;IAEF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,kCAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAChE,MAAM,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC1D,OAAO,UAAU,CAAC;AACpB,CAAC;AAmBD;;;;GAIG;AACI,KAAK,UAAU,iBAAiB,CACrC,OAAiC;IAEjC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,kCAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAChE,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,EAAE,IAAI,EAAE,uBAAuB,EAAE,CAAC;IAC3C,CAAC;IAED,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,mBAAmB,CAAC;IACvD,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,EAAE,IAAI,EAAE,uBAAuB,EAAE,CAAC;IAC3C,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,iBAAiB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACzE,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACpC,OAAO;YACL,IAAI,EAAE,gBAAgB;YACtB,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,IAAI,0BAA0B;SAC3D,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,MAAM,GAAqB;QAC/B,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG;QACpB,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK;QACxB,WAAW;QACX,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK;QACxB,QAAQ,EAAE,GAAG;QACb,UAAU,EAAE,GAAG;KAChB,CAAC;IACF,MAAM,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC1D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;AACvC,CAAC;AA0BD,KAAK,UAAU,qBAAqB,CAClC,WAAmB;IAEnB,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,IAAA,wBAAe,EAIlC,KAAK,EAAE,MAAM,EAAE,EAAE;YACf,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAC9B,+DAA+D,CAChE,CAAC;YACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,+DAA+D,CAChE,CAAC;YACF,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,IAAI,EAAE;oBACJ,UAAU,EAAE,UAAU,CAAC,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,KAAK,MAAM;oBACnE,SAAS,EAAE,CAAC,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI;iBAChE;aACF,CAAC;QACJ,CAAC,EACD,EAAE,WAAW,EAAE,CAChB,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACjD,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,KAAK,UAAU,oBAAoB,CAAC,WAAmB;IACrD,MAAM,MAAM,GAAG,MAAM,kCAAe,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;IACpE,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACjD,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;AAC5B,CAAC;AAED;;;;;;GAMG;AACI,KAAK,UAAU,4BAA4B,CAChD,UAKI,EAAE;IAEN,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACzB,OAAO;YACL,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,oBAAoB;YAC5B,OAAO,EAAE,qCAAqC;SAC/C,CAAC;IACJ,CAAC;IAED,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,qBAAqB,CAAC;IACvE,MAAM,QAAQ,GAAG,MAAM,cAAc,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC3D,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,UAAU,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;QAC7D,OAAO;YACL,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,wBAAwB;YAChC,OAAO,EAAE,4DAA4D;SACtE,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,kCAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAChE,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,yBAAyB;YACjC,OAAO,EAAE,mCAAmC;SAC7C,CAAC;IACJ,CAAC;IAED,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,oBAAoB,CAAC;IACpE,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACxD,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO;YACL,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,sBAAsB;YAC9B,OAAO,EAAE,kDAAkD;SAC5D,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,iBAAiB,CAAC;QACrC,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,MAAM;QACN,KAAK;KACN,CAAC,CAAC;IAEH,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,WAAW;YACd,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,WAAW;gBACnB,OAAO,EAAE,+BAA+B,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG;aAC/D,CAAC;QACJ,KAAK,uBAAuB;YAC1B,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,yBAAyB;gBACjC,OAAO,EAAE,sCAAsC;aAChD,CAAC;QACJ,KAAK,uBAAuB;YAC1B,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,0BAA0B;gBAClC,OAAO,EACL,+FAA+F;aAClG,CAAC;QACJ,KAAK,gBAAgB;YACnB,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,mBAAmB,MAAM,CAAC,KAAK,EAAE;aAC3C,CAAC;IACN,CAAC;AACH,CAAC;AAcD;;;;;;;;GAQG;AACI,KAAK,UAAU,yBAAyB,CAC7C,UAAwE,EAAE;IAE1E,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,kCAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,IAAY,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAEhF,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,kBAAkB,EAAE,CAAC;IAClD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;IAE3C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,CACJ,iGAAiG,CAClG,CAAC;QACF,OAAO,EAAE,MAAM,EAAE,wBAAwB,EAAE,MAAM,EAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC;IACnF,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,KAAK,EAAE,kBAAkB,EAAE,KAAK,EAAE,CAAC;AACtF,CAAC"}

package/dist/combination/dependency-resolver.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Dependency Resolver with Circular Dependency Detection
+ *
+ * Resolves dependencies between domain packs and performs topological sorting
+ * to determine the correct load order. Detects and reports circular dependencies.
+ *
+ * Algorithm:
+ * 1. Build dependency graph from pack manifests
+ * 2. Detect circular dependencies using DFS
+ * 3. Perform topological sort for load order
+ * 4. Return ordered list of packs to load
+ *
+ * @module combination/dependency-resolver
+ */
+import { DomainPack } from '../domains/types';
+import { ResolvedDependencies } from './types';
+/**
+ * DependencyResolver
+ *
+ * Resolves pack dependencies and determines load order
+ */
+export declare class DependencyResolver {
+    /**
+     * Resolve dependencies for a set of packs
+     *
+     * @param packs - Array of domain packs to resolve
+     * @param availablePacks - All available packs (for dependency lookup)
+     * @returns Resolved dependencies with load order
+     */
+    resolve(packs: DomainPack[], availablePacks: DomainPack[]): ResolvedDependencies;
+    /**
+     * Build dependency graph from pack manifests
+     */
+    private buildGraph;
+    /**
+     * Detect circular dependencies using DFS
+     *
+     * @param graph - Dependency graph
+     * @returns Array of circular dependency cycles
+     */
+    private detectCircularDependencies;
+    /**
+     * Perform topological sort using Kahn's algorithm
+     *
+     * @param graph - Dependency graph
+     * @returns Ordered list of pack names
+     */
+    private topologicalSort;
+    /**
+     * Validate that all dependencies are satisfied
+     *
+     * @param pack - Pack to validate
+     * @param availablePacks - Available packs
+     * @returns Validation result
+     */
+    validateDependencies(pack: DomainPack, availablePacks: DomainPack[]): {
+        valid: boolean;
+        errors: string[];
+    };
+    /**
+     * Get all transitive dependencies for a pack
+     *
+     * @param packName - Name of the pack
+     * @param availablePacks - All available packs
+     * @returns Array of all dependencies (direct and transitive)
+     */
+    getTransitiveDependencies(packName: string, availablePacks: DomainPack[]): string[];
+}
+//# sourceMappingURL=dependency-resolver.d.ts.map

package/dist/combination/dependency-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.d.ts","sourceRoot":"","sources":["../../src/combination/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAkB,oBAAoB,EAA2B,MAAM,SAAS,CAAC;AAExF;;;;GAIG;AACH,qBAAa,kBAAkB;IAC7B;;;;;;OAMG;IACH,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,cAAc,EAAE,UAAU,EAAE,GAAG,oBAAoB;IA0DhF;;OAEG;IACH,OAAO,CAAC,UAAU;IA+DlB;;;;;OAKG;IACH,OAAO,CAAC,0BAA0B;IA4ClC;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IA2DvB;;;;;;OAMG;IACH,oBAAoB,CAClB,IAAI,EAAE,UAAU,EAChB,cAAc,EAAE,UAAU,EAAE,GAC3B;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAiCvC;;;;;;OAMG;IACH,yBAAyB,CAAC,QAAQ,EAAE,MAAM,EAAE,cAAc,EAAE,UAAU,EAAE,GAAG,MAAM,EAAE;CAoCpF"}

package/dist/combination/dependency-resolver.js

@@ -0,0 +1,303 @@
+"use strict";
+/**
+ * Dependency Resolver with Circular Dependency Detection
+ *
+ * Resolves dependencies between domain packs and performs topological sorting
+ * to determine the correct load order. Detects and reports circular dependencies.
+ *
+ * Algorithm:
+ * 1. Build dependency graph from pack manifests
+ * 2. Detect circular dependencies using DFS
+ * 3. Perform topological sort for load order
+ * 4. Return ordered list of packs to load
+ *
+ * @module combination/dependency-resolver
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DependencyResolver = void 0;
+const types_1 = require("./types");
+/**
+ * DependencyResolver
+ *
+ * Resolves pack dependencies and determines load order
+ */
+class DependencyResolver {
+    /**
+     * Resolve dependencies for a set of packs
+     *
+     * @param packs - Array of domain packs to resolve
+     * @param availablePacks - All available packs (for dependency lookup)
+     * @returns Resolved dependencies with load order
+     */
+    resolve(packs, availablePacks) {
+        const errors = [];
+        const graph = new Map();
+        // Step 1: Build dependency graph
+        try {
+            this.buildGraph(packs, availablePacks, graph);
+        }
+        catch (error) {
+            if (error instanceof Error) {
+                errors.push(error.message);
+            }
+            return {
+                loadOrder: [],
+                graph,
+                circularDependencies: [],
+                success: false,
+                errors,
+            };
+        }
+        // Step 2: Detect circular dependencies
+        const circularDeps = this.detectCircularDependencies(graph);
+        if (circularDeps.length > 0) {
+            const cycles = circularDeps.map((cycle) => cycle.join(' -> ')).join('; ');
+            errors.push(`Circular dependencies detected: ${cycles}`);
+            return {
+                loadOrder: [],
+                graph,
+                circularDependencies: circularDeps,
+                success: false,
+                errors,
+            };
+        }
+        // Step 3: Perform topological sort
+        try {
+            const loadOrder = this.topologicalSort(graph);
+            return {
+                loadOrder,
+                graph,
+                circularDependencies: [],
+                success: true,
+                errors: [],
+            };
+        }
+        catch (error) {
+            if (error instanceof Error) {
+                errors.push(error.message);
+            }
+            return {
+                loadOrder: [],
+                graph,
+                circularDependencies: [],
+                success: false,
+                errors,
+            };
+        }
+    }
+    /**
+     * Build dependency graph from pack manifests
+     */
+    buildGraph(packs, availablePacks, graph) {
+        // Create a map of available packs by name for quick lookup
+        const packMap = new Map();
+        for (const pack of availablePacks) {
+            packMap.set(pack.manifest.name, pack);
+        }
+        // Also add requested packs to the map
+        for (const pack of packs) {
+            packMap.set(pack.manifest.name, pack);
+        }
+        // Process each requested pack
+        const toProcess = [...packs];
+        const processed = new Set();
+        while (toProcess.length > 0) {
+            const pack = toProcess.shift();
+            const packName = pack.manifest.name;
+            // Skip if already processed
+            if (processed.has(packName)) {
+                continue;
+            }
+            // Create dependency node
+            const node = {
+                name: packName,
+                version: pack.manifest.version,
+                dependencies: pack.manifest.dependencies || [],
+                resolved: false,
+            };
+            graph.set(packName, node);
+            processed.add(packName);
+            // Add dependencies to processing queue
+            if (pack.manifest.dependencies) {
+                for (const dep of pack.manifest.dependencies) {
+                    if (!processed.has(dep.name)) {
+                        const depPack = packMap.get(dep.name);
+                        if (!depPack) {
+                            throw new types_1.DependencyNotFoundError(`Dependency "${dep.name}" not found in available packs`, dep.name);
+                        }
+                        toProcess.push(depPack);
+                    }
+                }
+            }
+        }
+        // Mark all nodes as resolved (dependencies exist)
+        for (const node of graph.values()) {
+            node.resolved = true;
+        }
+    }
+    /**
+     * Detect circular dependencies using DFS
+     *
+     * @param graph - Dependency graph
+     * @returns Array of circular dependency cycles
+     */
+    detectCircularDependencies(graph) {
+        const cycles = [];
+        const visited = new Set();
+        const recursionStack = new Set();
+        const currentPath = [];
+        const dfs = (nodeName) => {
+            if (recursionStack.has(nodeName)) {
+                // Found a cycle
+                const cycleStart = currentPath.indexOf(nodeName);
+                const cycle = [...currentPath.slice(cycleStart), nodeName];
+                cycles.push(cycle);
+                return;
+            }
+            if (visited.has(nodeName)) {
+                return;
+            }
+            visited.add(nodeName);
+            recursionStack.add(nodeName);
+            currentPath.push(nodeName);
+            const node = graph.get(nodeName);
+            if (node) {
+                for (const dep of node.dependencies) {
+                    dfs(dep.name);
+                }
+            }
+            currentPath.pop();
+            recursionStack.delete(nodeName);
+        };
+        // Run DFS from each unvisited node
+        for (const nodeName of graph.keys()) {
+            if (!visited.has(nodeName)) {
+                dfs(nodeName);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Perform topological sort using Kahn's algorithm
+     *
+     * @param graph - Dependency graph
+     * @returns Ordered list of pack names
+     */
+    topologicalSort(graph) {
+        const result = [];
+        const inDegree = new Map();
+        const adjList = new Map();
+        // Initialize in-degree and adjacency list
+        for (const [name, node] of graph.entries()) {
+            if (!inDegree.has(name)) {
+                inDegree.set(name, 0);
+            }
+            if (!adjList.has(name)) {
+                adjList.set(name, []);
+            }
+            for (const dep of node.dependencies) {
+                // Add edge from dependency to dependent
+                if (!adjList.has(dep.name)) {
+                    adjList.set(dep.name, []);
+                }
+                adjList.get(dep.name).push(name);
+                // Increment in-degree of dependent
+                inDegree.set(name, (inDegree.get(name) || 0) + 1);
+            }
+        }
+        // Find all nodes with in-degree 0 (no dependencies)
+        const queue = [];
+        for (const [name, degree] of inDegree.entries()) {
+            if (degree === 0) {
+                queue.push(name);
+            }
+        }
+        // Process nodes in topological order
+        while (queue.length > 0) {
+            const node = queue.shift();
+            result.push(node);
+            // Reduce in-degree of dependent nodes
+            const dependents = adjList.get(node) || [];
+            for (const dependent of dependents) {
+                const newDegree = (inDegree.get(dependent) || 0) - 1;
+                inDegree.set(dependent, newDegree);
+                if (newDegree === 0) {
+                    queue.push(dependent);
+                }
+            }
+        }
+        // Check if all nodes were processed
+        if (result.length !== graph.size) {
+            throw new Error('Topological sort failed: graph contains cycles');
+        }
+        return result;
+    }
+    /**
+     * Validate that all dependencies are satisfied
+     *
+     * @param pack - Pack to validate
+     * @param availablePacks - Available packs
+     * @returns Validation result
+     */
+    validateDependencies(pack, availablePacks) {
+        const errors = [];
+        if (!pack.manifest.dependencies) {
+            return { valid: true, errors: [] };
+        }
+        const availablePackMap = new Map(availablePacks.map((p) => [p.manifest.name, p]));
+        for (const dep of pack.manifest.dependencies) {
+            const availablePack = availablePackMap.get(dep.name);
+            if (!availablePack) {
+                errors.push(`Dependency "${dep.name}" not found`);
+                continue;
+            }
+            // Simple version check (exact match for now)
+            // Could be extended to support SemVer ranges
+            if (availablePack.manifest.version !== dep.version) {
+                errors.push(`Dependency "${dep.name}" version mismatch: ` +
+                    `required ${dep.version}, found ${availablePack.manifest.version}`);
+            }
+        }
+        return {
+            valid: errors.length === 0,
+            errors,
+        };
+    }
+    /**
+     * Get all transitive dependencies for a pack
+     *
+     * @param packName - Name of the pack
+     * @param availablePacks - All available packs
+     * @returns Array of all dependencies (direct and transitive)
+     */
+    getTransitiveDependencies(packName, availablePacks) {
+        const packMap = new Map(availablePacks.map((p) => [p.manifest.name, p]));
+        const pack = packMap.get(packName);
+        if (!pack) {
+            throw new types_1.DependencyNotFoundError(`Pack "${packName}" not found`, packName);
+        }
+        const dependencies = new Set();
+        const toProcess = [pack];
+        const processed = new Set();
+        while (toProcess.length > 0) {
+            const currentPack = toProcess.shift();
+            const currentName = currentPack.manifest.name;
+            if (processed.has(currentName)) {
+                continue;
+            }
+            processed.add(currentName);
+            if (currentPack.manifest.dependencies) {
+                for (const dep of currentPack.manifest.dependencies) {
+                    dependencies.add(dep.name);
+                    const depPack = packMap.get(dep.name);
+                    if (depPack && !processed.has(dep.name)) {
+                        toProcess.push(depPack);
+                    }
+                }
+            }
+        }
+        return Array.from(dependencies);
+    }
+}
+exports.DependencyResolver = DependencyResolver;
+//# sourceMappingURL=dependency-resolver.js.map

package/dist/combination/dependency-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../../src/combination/dependency-resolver.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;;AAGH,mCAAwF;AAExF;;;;GAIG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACH,OAAO,CAAC,KAAmB,EAAE,cAA4B;QACvD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;QAEhD,iCAAiC;QACjC,IAAI,CAAC;YACH,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO;gBACL,SAAS,EAAE,EAAE;gBACb,KAAK;gBACL,oBAAoB,EAAE,EAAE;gBACxB,OAAO,EAAE,KAAK;gBACd,MAAM;aACP,CAAC;QACJ,CAAC;QAED,uCAAuC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC;QAC5D,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1E,MAAM,CAAC,IAAI,CAAC,mCAAmC,MAAM,EAAE,CAAC,CAAC;YACzD,OAAO;gBACL,SAAS,EAAE,EAAE;gBACb,KAAK;gBACL,oBAAoB,EAAE,YAAY;gBAClC,OAAO,EAAE,KAAK;gBACd,MAAM;aACP,CAAC;QACJ,CAAC;QAED,mCAAmC;QACnC,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC9C,OAAO;gBACL,SAAS;gBACT,KAAK;gBACL,oBAAoB,EAAE,EAAE;gBACxB,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,EAAE;aACX,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO;gBACL,SAAS,EAAE,EAAE;gBACb,KAAK;gBACL,oBAAoB,EAAE,EAAE;gBACxB,OAAO,EAAE,KAAK;gBACd,MAAM;aACP,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAChB,KAAmB,EACnB,cAA4B,EAC5B,KAAkC;QAElC,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;QAED,8BAA8B;QAC9B,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YAEpC,4BAA4B;YAC5B,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YAED,yBAAyB;YACzB,MAAM,IAAI,GAAmB;gBAC3B,IAAI,EAAE,QAAQ;gBACd,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO;gBAC9B,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE;gBAC9C,QAAQ,EAAE,KAAK;aAChB,CAAC;YAEF,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC1B,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAExB,uCAAuC;YACvC,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;oBAC7C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACtC,IAAI,CAAC,OAAO,EAAE,CAAC;4BACb,MAAM,IAAI,+BAAuB,CAC/B,eAAe,GAAG,CAAC,IAAI,gCAAgC,EACvD,GAAG,CAAC,IAAI,CACT,CAAC;wBACJ,CAAC;wBACD,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,0BAA0B,CAAC,KAAkC;QACnE,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,MAAM,GAAG,GAAG,CAAC,QAAgB,EAAQ,EAAE;YACrC,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjC,gBAAgB;gBAChB,MAAM,UAAU,GAAG,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;gBAC3D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,OAAO;YACT,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,OAAO;YACT,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC7B,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAE3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACjC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;YAED,WAAW,CAAC,GAAG,EAAE,CAAC;YAClB,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAClC,CAAC,CAAC;QAEF,mCAAmC;QACnC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,KAAkC;QACxD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE5C,0CAA0C;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACxB,CAAC;YAED,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,wCAAwC;gBACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC5B,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAElC,mCAAmC;gBACnC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAElB,sCAAsC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC3C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAEnC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACpE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,oBAAoB,CAClB,IAAgB,EAChB,cAA4B;QAE5B,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAChC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QACrC,CAAC;QAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAElF,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAErD,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC;gBAClD,SAAS;YACX,CAAC;YAED,6CAA6C;YAC7C,6CAA6C;YAC7C,IAAI,aAAa,CAAC,QAAQ,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO,EAAE,CAAC;gBACnD,MAAM,CAAC,IAAI,CACT,eAAe,GAAG,CAAC,IAAI,sBAAsB;oBAC3C,YAAY,GAAG,CAAC,OAAO,WAAW,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,CACrE,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;YAC1B,MAAM;SACP,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,yBAAyB,CAAC,QAAgB,EAAE,cAA4B;QACtE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,+BAAuB,CAAC,SAAS,QAAQ,aAAa,EAAE,QAAQ,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;YACvC,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC;YAE9C,IAAI,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAE3B,IAAI,WAAW,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;gBACtC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;oBACpD,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAE3B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACtC,IAAI,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBACxC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAClC,CAAC;CACF;AA7UD,gDA6UC"}