ai.matey.patterns 0.2.0

package/CHANGELOG.md

@@ -0,0 +1,21 @@
+# ai.matey.patterns
+
+## 0.2.0
+
+### Minor Changes
+
+- aef9f4a: New `ai.matey.patterns` package: complexity routing, parallel aggregation, failover middleware,
+  cost optimization with budget windows, and batch processing. Router's `dispatchParallel` now
+  actually honors the `fastest` strategy (previously returned the first-registered success).
+
+### Patch Changes
+
+- Updated dependencies [dae4d01]
+- Updated dependencies [e7df1d0]
+- Updated dependencies [f227db2]
+- Updated dependencies [2912b7d]
+- Updated dependencies [aef9f4a]
+- Updated dependencies [78731bb]
+- Updated dependencies [b7e2312]
+  - ai.matey.types@0.3.0
+  - ai.matey.core@0.3.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 AI Matey Contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/cjs/batch-processor.js

@@ -0,0 +1,136 @@
+"use strict";
+/**
+ * Batch Processing with Rate Limiting
+ *
+ * High-throughput request processing with bounded concurrency, an optional
+ * token-bucket rate limit, retries, and progress reporting. Zero-dependency.
+ * Extracted from docs/PATTERNS.md §6.
+ *
+ * @module
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createBatchProcessor = createBatchProcessor;
+/**
+ * Create a batch processor.
+ *
+ * @example
+ * ```typescript
+ * const processor = createBatchProcessor({
+ *   execute: (request) => bridge.chat(request),
+ *   concurrency: 5,
+ *   requestsPerSecond: 10,
+ *   retries: 2,
+ * });
+ * const results = await processor.addAll(requests);
+ * ```
+ */
+function createBatchProcessor(config) {
+    const concurrency = config.concurrency ?? 5;
+    const maxQueueSize = config.maxQueueSize ?? Infinity;
+    const retries = config.retries ?? 0;
+    const queue = [];
+    let inFlight = 0;
+    let completed = 0;
+    let failed = 0;
+    let disposed = false;
+    const drainWaiters = [];
+    // Token bucket (only when rate limiting is configured)
+    let tokens = config.requestsPerSecond ?? Infinity;
+    let refillTimer;
+    if (config.requestsPerSecond) {
+        const perTick = config.requestsPerSecond / 10;
+        refillTimer = setInterval(() => {
+            tokens = Math.min(config.requestsPerSecond, tokens + perTick);
+            pump();
+        }, 100);
+        // Do not hold the process open for an idle processor
+        if (typeof refillTimer === 'object' && 'unref' in refillTimer) {
+            refillTimer.unref();
+        }
+    }
+    const stats = () => ({
+        completed,
+        failed,
+        pending: queue.length,
+        inFlight,
+    });
+    const notifyDrainWaiters = () => {
+        if (queue.length === 0 && inFlight === 0) {
+            while (drainWaiters.length > 0) {
+                drainWaiters.shift()?.();
+            }
+        }
+    };
+    const runItem = (item) => {
+        inFlight++;
+        item.attempts++;
+        config
+            .execute(item.request)
+            .then((result) => {
+            completed++;
+            item.resolve(result);
+        })
+            .catch((error) => {
+            if (item.attempts <= retries && !disposed) {
+                // Requeue for retry (does not consume a fresh queue slot check)
+                queue.push(item);
+                return;
+            }
+            failed++;
+            item.reject(error);
+        })
+            .finally(() => {
+            inFlight--;
+            config.onProgress?.(stats());
+            pump();
+            notifyDrainWaiters();
+        });
+    };
+    const pump = () => {
+        while (!disposed && inFlight < concurrency && queue.length > 0 && tokens >= 1) {
+            if (config.requestsPerSecond) {
+                tokens -= 1;
+            }
+            const item = queue.shift();
+            if (item) {
+                runItem(item);
+            }
+        }
+    };
+    return {
+        add(request) {
+            if (disposed) {
+                return Promise.reject(new Error('Batch processor disposed'));
+            }
+            if (queue.length >= maxQueueSize) {
+                return Promise.reject(new Error(`Queue full (max ${maxQueueSize})`));
+            }
+            return new Promise((resolve, reject) => {
+                queue.push({ request, resolve, reject, attempts: 0 });
+                pump();
+            });
+        },
+        addAll(requests) {
+            return Promise.allSettled(requests.map((request) => this.add(request)));
+        },
+        drain() {
+            if (queue.length === 0 && inFlight === 0) {
+                return Promise.resolve();
+            }
+            return new Promise((resolve) => {
+                drainWaiters.push(resolve);
+            });
+        },
+        stats,
+        dispose() {
+            disposed = true;
+            if (refillTimer) {
+                clearInterval(refillTimer);
+            }
+            while (queue.length > 0) {
+                queue.shift()?.reject(new Error('Batch processor disposed'));
+            }
+        },
+    };
+}
+//# sourceMappingURL=batch-processor.js.map

package/dist/cjs/batch-processor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"batch-processor.js","sourceRoot":"","sources":["../../src/batch-processor.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAqEH,oDAiIC;AA/ID;;;;;;;;;;;;;GAaG;AACH,SAAgB,oBAAoB,CAClC,MAAwC;IAExC,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,QAAQ,CAAC;IACrD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;IASpC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,YAAY,GAAsB,EAAE,CAAC;IAE3C,uDAAuD;IACvD,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,IAAI,QAAQ,CAAC;IAClD,IAAI,WAAuD,CAAC;IAC5D,IAAI,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC9C,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE;YAC7B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,iBAA2B,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC;YACxE,IAAI,EAAE,CAAC;QACT,CAAC,EAAE,GAAG,CAAC,CAAC;QACR,qDAAqD;QACrD,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YAC9D,WAAW,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,GAAe,EAAE,CAAC,CAAC;QAC/B,SAAS;QACT,MAAM;QACN,OAAO,EAAE,KAAK,CAAC,MAAM;QACrB,QAAQ;KACT,CAAC,CAAC;IAEH,MAAM,kBAAkB,GAAG,GAAS,EAAE;QACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACzC,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,YAAY,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,IAAe,EAAQ,EAAE;QACxC,QAAQ,EAAE,CAAC;QACX,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEhB,MAAM;aACH,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;aACrB,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;YACf,SAAS,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACxB,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC1C,gEAAgE;gBAChE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,OAAO;YACT,CAAC;YACD,MAAM,EAAE,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC,CAAC;aACD,OAAO,CAAC,GAAG,EAAE;YACZ,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7B,IAAI,EAAE,CAAC;YACP,kBAAkB,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;IACP,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,OAAO,CAAC,QAAQ,IAAI,QAAQ,GAAG,WAAW,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;YAC9E,IAAI,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBAC7B,MAAM,IAAI,CAAC,CAAC;YACd,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,CAAC,OAAa;YACf,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,CAAC;YAC/D,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;gBACjC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,mBAAmB,YAAY,GAAG,CAAC,CAAC,CAAC;YACvE,CAAC;YACD,OAAO,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;gBACtD,IAAI,EAAE,CAAC;YACT,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,CAAC,QAAyB;YAC9B,OAAO,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;QAED,KAAK;YACH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACzC,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;YAC3B,CAAC;YACD,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC7B,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7B,CAAC,CAAC,CAAC;QACL,CAAC;QAED,KAAK;QAEL,OAAO;YACL,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,WAAW,EAAE,CAAC;gBAChB,aAAa,CAAC,WAAW,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/cjs/complexity-router.js

@@ -0,0 +1,85 @@
+"use strict";
+/**
+ * Complexity-Based Routing
+ *
+ * Route requests to different backends by estimated query complexity —
+ * cheap/fast models for simple queries, capable models for hard ones.
+ * Extracted from docs/PATTERNS.md §1.
+ *
+ * @module
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultComplexityAnalyzer = defaultComplexityAnalyzer;
+exports.createComplexityRouter = createComplexityRouter;
+const ai_matey_core_1 = require("ai.matey.core");
+/**
+ * Heuristic complexity score (0-100) from message length, question depth,
+ * and reasoning keywords.
+ */
+function defaultComplexityAnalyzer(request) {
+    const text = request.messages
+        .map((message) => typeof message.content === 'string'
+        ? message.content
+        : message.content.map((block) => (block.type === 'text' ? block.text : '')).join(' '))
+        .join(' ');
+    let score = 0;
+    // Length: up to 40 points at ~2000 chars
+    score += Math.min(40, text.length / 50);
+    // Reasoning indicators: up to 40 points
+    const reasoningKeywords = [
+        'why',
+        'how',
+        'explain',
+        'analyze',
+        'compare',
+        'evaluate',
+        'design',
+        'architect',
+        'prove',
+        'derive',
+        'step by step',
+        'trade-off',
+        'tradeoff',
+    ];
+    const lower = text.toLowerCase();
+    const hits = reasoningKeywords.filter((keyword) => lower.includes(keyword)).length;
+    score += Math.min(40, hits * 10);
+    // Code blocks / structured content: up to 20 points
+    if (lower.includes('```') || lower.includes('function ') || lower.includes('class ')) {
+        score += 20;
+    }
+    return Math.min(100, Math.round(score));
+}
+/**
+ * Create a Router that picks its backend by query complexity.
+ *
+ * @example
+ * ```typescript
+ * const router = createComplexityRouter({
+ *   tiers: [
+ *     { backend: 'fast', maxComplexity: 30 },
+ *     { backend: 'balanced', maxComplexity: 70 },
+ *     { backend: 'powerful', maxComplexity: 100 },
+ *   ],
+ *   backends: { fast, balanced, powerful },
+ * });
+ * ```
+ */
+function createComplexityRouter(config) {
+    const analyzer = config.analyzer ?? defaultComplexityAnalyzer;
+    const tiers = [...config.tiers].sort((a, b) => a.maxComplexity - b.maxComplexity);
+    const router = new ai_matey_core_1.Router({
+        ...config.routerConfig,
+        routingStrategy: 'custom',
+        customRouter: (request, availableBackends) => {
+            const complexity = analyzer(request);
+            const tier = tiers.find((candidate) => complexity <= candidate.maxComplexity && availableBackends.includes(candidate.backend)) ?? tiers[tiers.length - 1];
+            return Promise.resolve(tier?.backend ?? null);
+        },
+    });
+    for (const [name, adapter] of Object.entries(config.backends)) {
+        router.register(name, adapter);
+    }
+    return router;
+}
+//# sourceMappingURL=complexity-router.js.map

package/dist/cjs/complexity-router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-router.js","sourceRoot":"","sources":["../../src/complexity-router.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAoCH,8DAwCC;AAiBD,wDAuBC;AAlHD,iDAAuC;AA8BvC;;;GAGG;AACH,SAAgB,yBAAyB,CAAC,OAAsB;IAC9D,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ;SAC1B,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CACf,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ;QACjC,CAAC,CAAC,OAAO,CAAC,OAAO;QACjB,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CACxF;SACA,IAAI,CAAC,GAAG,CAAC,CAAC;IAEb,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,yCAAyC;IACzC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;IAExC,wCAAwC;IACxC,MAAM,iBAAiB,GAAG;QACxB,KAAK;QACL,KAAK;QACL,SAAS;QACT,SAAS;QACT,SAAS;QACT,UAAU;QACV,QAAQ;QACR,WAAW;QACX,OAAO;QACP,QAAQ;QACR,cAAc;QACd,WAAW;QACX,UAAU;KACX,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACnF,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAEjC,oDAAoD;IACpD,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrF,KAAK,IAAI,EAAE,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAgB,sBAAsB,CAAC,MAA8B;IACnE,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,yBAAyB,CAAC;IAC9D,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IAElF,MAAM,MAAM,GAAG,IAAI,sBAAM,CAAC;QACxB,GAAG,MAAM,CAAC,YAAY;QACtB,eAAe,EAAE,QAAQ;QACzB,YAAY,EAAE,CAAC,OAAO,EAAE,iBAAiB,EAAE,EAAE;YAC3C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;YACrC,MAAM,IAAI,GACR,KAAK,CAAC,IAAI,CACR,CAAC,SAAS,EAAE,EAAE,CACZ,UAAU,IAAI,SAAS,CAAC,aAAa,IAAI,iBAAiB,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CACzF,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC;QAChD,CAAC;KACF,CAAC,CAAC;IAEH,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9D,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/cjs/cost-optimizer.js

@@ -0,0 +1,66 @@
+"use strict";
+/**
+ * Cost-Optimized Provider Selection
+ *
+ * A cost-optimizing Router plus a budget-window middleware: route to the
+ * cheapest capable backend and enforce a spending ceiling. Extracted from
+ * docs/PATTERNS.md §4.
+ *
+ * @module
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createCostOptimizer = createCostOptimizer;
+const ai_matey_core_1 = require("ai.matey.core");
+const ai_matey_errors_1 = require("ai.matey.errors");
+/**
+ * Create a cost-optimized router with an optional budget window.
+ *
+ * @example
+ * ```typescript
+ * const { router, middleware, recordSpend } = createCostOptimizer({
+ *   backends: { cheap, premium },
+ *   budget: { limitUSD: 10, windowMs: 3600_000 },
+ * });
+ * const bridge = new Bridge(frontend, router).use(middleware);
+ * ```
+ */
+function createCostOptimizer(config) {
+    const router = new ai_matey_core_1.Router({
+        trackCost: true,
+        capabilityBasedRouting: true,
+        optimization: 'cost',
+        ...config.routerConfig,
+    });
+    for (const [name, adapter] of Object.entries(config.backends)) {
+        router.register(name, adapter);
+    }
+    // Sliding-window spend ledger
+    const windowMs = config.budget?.windowMs ?? 3_600_000;
+    let entries = [];
+    const prune = () => {
+        const cutoff = Date.now() - windowMs;
+        entries = entries.filter((entry) => entry.at >= cutoff);
+    };
+    const getSpend = () => {
+        prune();
+        return entries.reduce((sum, entry) => sum + entry.costUSD, 0);
+    };
+    const recordSpend = (costUSD) => {
+        entries.push({ at: Date.now(), costUSD });
+    };
+    const middleware = async (_context, next) => {
+        if (config.budget && getSpend() >= config.budget.limitUSD) {
+            if ((config.budget.onExceeded ?? 'error') === 'error') {
+                throw new ai_matey_errors_1.AdapterError({
+                    code: ai_matey_errors_1.ErrorCode.RATE_LIMIT_EXCEEDED,
+                    message: `Budget of $${config.budget.limitUSD} exceeded for the current window`,
+                    isRetryable: true,
+                    provenance: { router: router.metadata.name },
+                });
+            }
+        }
+        return next();
+    };
+    return { router, middleware, getSpend, recordSpend };
+}
+//# sourceMappingURL=cost-optimizer.js.map

package/dist/cjs/cost-optimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost-optimizer.js","sourceRoot":"","sources":["../../src/cost-optimizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAyDH,kDA6CC;AApGD,iDAAuC;AACvC,qDAA0D;AA0C1D;;;;;;;;;;;GAWG;AACH,SAAgB,mBAAmB,CAAC,MAA2B;IAC7D,MAAM,MAAM,GAAG,IAAI,sBAAM,CAAC;QACxB,SAAS,EAAE,IAAI;QACf,sBAAsB,EAAE,IAAI;QAC5B,YAAY,EAAE,MAAM;QACpB,GAAG,MAAM,CAAC,YAAY;KACvB,CAAC,CAAC;IAEH,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9D,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,8BAA8B;IAC9B,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,IAAI,SAAS,CAAC;IACtD,IAAI,OAAO,GAA2C,EAAE,CAAC;IAEzD,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACrC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC;IAC1D,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,GAAW,EAAE;QAC5B,KAAK,EAAE,CAAC;QACR,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,CAAC,OAAe,EAAQ,EAAE;QAC5C,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAC5C,CAAC,CAAC;IAEF,MAAM,UAAU,GAAe,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE;QACtD,IAAI,MAAM,CAAC,MAAM,IAAI,QAAQ,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,IAAI,OAAO,CAAC,KAAK,OAAO,EAAE,CAAC;gBACtD,MAAM,IAAI,8BAAY,CAAC;oBACrB,IAAI,EAAE,2BAAS,CAAC,mBAAmB;oBACnC,OAAO,EAAE,cAAc,MAAM,CAAC,MAAM,CAAC,QAAQ,kCAAkC;oBAC/E,WAAW,EAAE,IAAI;oBACjB,UAAU,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE;iBAC7C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,OAAO,IAAI,EAAE,CAAC;IAChB,CAAC,CAAC;IAEF,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC;AACvD,CAAC"}

package/dist/cjs/failover.js

@@ -0,0 +1,55 @@
+"use strict";
+/**
+ * Automatic Failover Middleware
+ *
+ * Bridge-level failover: when the primary backend fails, retry the request
+ * against fallback adapters in order. For Router users, prefer the Router's
+ * built-in fallback chains — this pattern serves plain-Bridge setups.
+ * Extracted from docs/PATTERNS.md §3.
+ *
+ * @module
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createFailoverMiddleware = createFailoverMiddleware;
+const ai_matey_errors_1 = require("ai.matey.errors");
+/**
+ * Create failover middleware for a Bridge.
+ *
+ * @example
+ * ```typescript
+ * bridge.use(createFailoverMiddleware({
+ *   fallbacks: [new AnthropicBackendAdapter({ apiKey }), new GroqBackendAdapter({ apiKey })],
+ * }));
+ * ```
+ */
+function createFailoverMiddleware(config) {
+    const shouldFailover = config.shouldFailover ??
+        ((error) => (error instanceof ai_matey_errors_1.AdapterError ? error.isRetryable : true));
+    return async (context, next) => {
+        try {
+            return await next();
+        }
+        catch (primaryError) {
+            const error = primaryError instanceof Error ? primaryError : new Error(String(primaryError));
+            if (!shouldFailover(error)) {
+                throw error;
+            }
+            let lastError = error;
+            for (const fallback of config.fallbacks) {
+                config.onFailover?.({ to: fallback.metadata.name, error: lastError });
+                try {
+                    return await fallback.execute(context.request, context.signal);
+                }
+                catch (fallbackError) {
+                    lastError =
+                        fallbackError instanceof Error ? fallbackError : new Error(String(fallbackError));
+                    if (!shouldFailover(lastError)) {
+                        throw lastError;
+                    }
+                }
+            }
+            throw lastError;
+        }
+    };
+}
+//# sourceMappingURL=failover.js.map

package/dist/cjs/failover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"failover.js","sourceRoot":"","sources":["../../src/failover.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;AAgCH,4DAgCC;AA9DD,qDAA+C;AAoB/C;;;;;;;;;GASG;AACH,SAAgB,wBAAwB,CAAC,MAAsB;IAC7D,MAAM,cAAc,GAClB,MAAM,CAAC,cAAc;QACrB,CAAC,CAAC,KAAY,EAAE,EAAE,CAAC,CAAC,KAAK,YAAY,8BAAY,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEjF,OAAO,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE;QAC7B,IAAI,CAAC;YACH,OAAO,MAAM,IAAI,EAAE,CAAC;QACtB,CAAC;QAAC,OAAO,YAAY,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,YAAY,YAAY,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;YAE7F,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,CAAC;YACd,CAAC;YAED,IAAI,SAAS,GAAU,KAAK,CAAC;YAC7B,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACxC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;gBACtE,IAAI,CAAC;oBACH,OAAO,MAAM,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBACjE,CAAC;gBAAC,OAAO,aAAa,EAAE,CAAC;oBACvB,SAAS;wBACP,aAAa,YAAY,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;oBACpF,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC/B,MAAM,SAAS,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,SAAS,CAAC;QAClB,CAAC;IACH,CAAC,CAAC;AACJ,CAAC"}

package/dist/cjs/index.js

@@ -0,0 +1,23 @@
+"use strict";
+/**
+ * ai.matey.patterns
+ *
+ * Production integration patterns, extracted from the validated pattern
+ * library (docs/PATTERNS.md) into importable utilities.
+ *
+ * @module
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createBatchProcessor = exports.createCostOptimizer = exports.createFailoverMiddleware = exports.createParallelAggregator = exports.defaultComplexityAnalyzer = exports.createComplexityRouter = void 0;
+var complexity_router_js_1 = require("./complexity-router.js");
+Object.defineProperty(exports, "createComplexityRouter", { enumerable: true, get: function () { return complexity_router_js_1.createComplexityRouter; } });
+Object.defineProperty(exports, "defaultComplexityAnalyzer", { enumerable: true, get: function () { return complexity_router_js_1.defaultComplexityAnalyzer; } });
+var parallel_aggregator_js_1 = require("./parallel-aggregator.js");
+Object.defineProperty(exports, "createParallelAggregator", { enumerable: true, get: function () { return parallel_aggregator_js_1.createParallelAggregator; } });
+var failover_js_1 = require("./failover.js");
+Object.defineProperty(exports, "createFailoverMiddleware", { enumerable: true, get: function () { return failover_js_1.createFailoverMiddleware; } });
+var cost_optimizer_js_1 = require("./cost-optimizer.js");
+Object.defineProperty(exports, "createCostOptimizer", { enumerable: true, get: function () { return cost_optimizer_js_1.createCostOptimizer; } });
+var batch_processor_js_1 = require("./batch-processor.js");
+Object.defineProperty(exports, "createBatchProcessor", { enumerable: true, get: function () { return batch_processor_js_1.createBatchProcessor; } });
+//# sourceMappingURL=index.js.map

package/dist/cjs/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAEH,+DAKgC;AAJ9B,8HAAA,sBAAsB,OAAA;AACtB,iIAAA,yBAAyB,OAAA;AAK3B,mEAIkC;AAHhC,kIAAA,wBAAwB,OAAA;AAK1B,6CAA8E;AAArE,uHAAA,wBAAwB,OAAA;AAEjC,yDAI6B;AAH3B,wHAAA,mBAAmB,OAAA;AAKrB,2DAK8B;AAJ5B,0HAAA,oBAAoB,OAAA"}

package/dist/cjs/parallel-aggregator.js

@@ -0,0 +1,68 @@
+"use strict";
+/**
+ * Parallel Provider Aggregation
+ *
+ * Query several backends at once and aggregate: fastest-wins, all-results,
+ * or a custom judge. The aggregator is itself a BackendAdapter, so it plugs
+ * into a Bridge like any single backend. Extracted from docs/PATTERNS.md §2.
+ *
+ * @module
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createParallelAggregator = createParallelAggregator;
+const ai_matey_core_1 = require("ai.matey.core");
+/**
+ * Create a BackendAdapter that fans requests out to all configured
+ * backends in parallel.
+ *
+ * @example
+ * ```typescript
+ * const consensus = createParallelAggregator({
+ *   backends: { openai, anthropic, gemini },
+ *   strategy: (results) => results[0].response, // custom judge
+ * });
+ * const bridge = new Bridge(new OpenAIFrontendAdapter(), consensus);
+ * ```
+ */
+function createParallelAggregator(config) {
+    const strategy = config.strategy ?? 'fastest';
+    const router = new ai_matey_core_1.Router();
+    for (const [name, adapter] of Object.entries(config.backends)) {
+        router.register(name, adapter);
+    }
+    const metadata = {
+        name: 'parallel-aggregator',
+        version: '1.0.0',
+        provider: 'ai.matey.patterns',
+        capabilities: {
+            streaming: false,
+            multiModal: true,
+            tools: true,
+            systemMessageStrategy: 'in-messages',
+            supportsMultipleSystemMessages: true,
+        },
+    };
+    return {
+        metadata,
+        fromIR: (request) => request,
+        toIR: () => {
+            throw new Error('toIR() not applicable for parallel aggregator');
+        },
+        async execute(request, signal) {
+            if (typeof strategy === 'function') {
+                const result = await router.dispatchParallel(request, { strategy: 'all', timeout: config.timeout }, signal);
+                return strategy([...(result.allResponses ?? [])]);
+            }
+            const result = await router.dispatchParallel(request, {
+                strategy: strategy === 'fastest' ? 'fastest' : 'all',
+                timeout: config.timeout,
+            }, signal);
+            return result.response;
+        },
+        // eslint-disable-next-line @typescript-eslint/require-await, require-yield -- adapter interface requires an async generator; aggregation cannot stream
+        async *executeStream() {
+            throw new Error('Parallel aggregation does not support streaming; use a single backend for streams');
+        },
+    };
+}
+//# sourceMappingURL=parallel-aggregator.js.map

package/dist/cjs/parallel-aggregator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parallel-aggregator.js","sourceRoot":"","sources":["../../src/parallel-aggregator.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAiDH,4DAyDC;AAxGD,iDAAuC;AAkCvC;;;;;;;;;;;;GAYG;AACH,SAAgB,wBAAwB,CAAC,MAAgC;IACvE,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,SAAS,CAAC;IAE9C,MAAM,MAAM,GAAG,IAAI,sBAAM,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9D,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,QAAQ,GAAoB;QAChC,IAAI,EAAE,qBAAqB;QAC3B,OAAO,EAAE,OAAO;QAChB,QAAQ,EAAE,mBAAmB;QAC7B,YAAY,EAAE;YACZ,SAAS,EAAE,KAAK;YAChB,UAAU,EAAE,IAAI;YAChB,KAAK,EAAE,IAAI;YACX,qBAAqB,EAAE,aAAa;YACpC,8BAA8B,EAAE,IAAI;SACrC;KACF,CAAC;IAEF,OAAO;QACL,QAAQ;QAER,MAAM,EAAE,CAAC,OAAsB,EAAE,EAAE,CAAC,OAAO;QAC3C,IAAI,EAAE,GAAG,EAAE;YACT,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QAED,KAAK,CAAC,OAAO,CAAC,OAAsB,EAAE,MAAoB;YACxD,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,gBAAgB,CAC1C,OAAO,EACP,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,EAC5C,MAAM,CACP,CAAC;gBACF,OAAO,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,gBAAgB,CAC1C,OAAO,EACP;gBACE,QAAQ,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK;gBACpD,OAAO,EAAE,MAAM,CAAC,OAAO;aACxB,EACD,MAAM,CACP,CAAC;YACF,OAAO,MAAM,CAAC,QAAQ,CAAC;QACzB,CAAC;QAED,uJAAuJ;QACvJ,KAAK,CAAC,CAAC,aAAa;YAClB,MAAM,IAAI,KAAK,CACb,mFAAmF,CACpF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/esm/batch-processor.js

@@ -0,0 +1,133 @@
+/**
+ * Batch Processing with Rate Limiting
+ *
+ * High-throughput request processing with bounded concurrency, an optional
+ * token-bucket rate limit, retries, and progress reporting. Zero-dependency.
+ * Extracted from docs/PATTERNS.md §6.
+ *
+ * @module
+ */
+/**
+ * Create a batch processor.
+ *
+ * @example
+ * ```typescript
+ * const processor = createBatchProcessor({
+ *   execute: (request) => bridge.chat(request),
+ *   concurrency: 5,
+ *   requestsPerSecond: 10,
+ *   retries: 2,
+ * });
+ * const results = await processor.addAll(requests);
+ * ```
+ */
+export function createBatchProcessor(config) {
+    const concurrency = config.concurrency ?? 5;
+    const maxQueueSize = config.maxQueueSize ?? Infinity;
+    const retries = config.retries ?? 0;
+    const queue = [];
+    let inFlight = 0;
+    let completed = 0;
+    let failed = 0;
+    let disposed = false;
+    const drainWaiters = [];
+    // Token bucket (only when rate limiting is configured)
+    let tokens = config.requestsPerSecond ?? Infinity;
+    let refillTimer;
+    if (config.requestsPerSecond) {
+        const perTick = config.requestsPerSecond / 10;
+        refillTimer = setInterval(() => {
+            tokens = Math.min(config.requestsPerSecond, tokens + perTick);
+            pump();
+        }, 100);
+        // Do not hold the process open for an idle processor
+        if (typeof refillTimer === 'object' && 'unref' in refillTimer) {
+            refillTimer.unref();
+        }
+    }
+    const stats = () => ({
+        completed,
+        failed,
+        pending: queue.length,
+        inFlight,
+    });
+    const notifyDrainWaiters = () => {
+        if (queue.length === 0 && inFlight === 0) {
+            while (drainWaiters.length > 0) {
+                drainWaiters.shift()?.();
+            }
+        }
+    };
+    const runItem = (item) => {
+        inFlight++;
+        item.attempts++;
+        config
+            .execute(item.request)
+            .then((result) => {
+            completed++;
+            item.resolve(result);
+        })
+            .catch((error) => {
+            if (item.attempts <= retries && !disposed) {
+                // Requeue for retry (does not consume a fresh queue slot check)
+                queue.push(item);
+                return;
+            }
+            failed++;
+            item.reject(error);
+        })
+            .finally(() => {
+            inFlight--;
+            config.onProgress?.(stats());
+            pump();
+            notifyDrainWaiters();
+        });
+    };
+    const pump = () => {
+        while (!disposed && inFlight < concurrency && queue.length > 0 && tokens >= 1) {
+            if (config.requestsPerSecond) {
+                tokens -= 1;
+            }
+            const item = queue.shift();
+            if (item) {
+                runItem(item);
+            }
+        }
+    };
+    return {
+        add(request) {
+            if (disposed) {
+                return Promise.reject(new Error('Batch processor disposed'));
+            }
+            if (queue.length >= maxQueueSize) {
+                return Promise.reject(new Error(`Queue full (max ${maxQueueSize})`));
+            }
+            return new Promise((resolve, reject) => {
+                queue.push({ request, resolve, reject, attempts: 0 });
+                pump();
+            });
+        },
+        addAll(requests) {
+            return Promise.allSettled(requests.map((request) => this.add(request)));
+        },
+        drain() {
+            if (queue.length === 0 && inFlight === 0) {
+                return Promise.resolve();
+            }
+            return new Promise((resolve) => {
+                drainWaiters.push(resolve);
+            });
+        },
+        stats,
+        dispose() {
+            disposed = true;
+            if (refillTimer) {
+                clearInterval(refillTimer);
+            }
+            while (queue.length > 0) {
+                queue.shift()?.reject(new Error('Batch processor disposed'));
+            }
+        },
+    };
+}
+//# sourceMappingURL=batch-processor.js.map

package/dist/esm/batch-processor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"batch-processor.js","sourceRoot":"","sources":["../../src/batch-processor.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAuDH;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAwC;IAExC,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,QAAQ,CAAC;IACrD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;IASpC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,YAAY,GAAsB,EAAE,CAAC;IAE3C,uDAAuD;IACvD,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,IAAI,QAAQ,CAAC;IAClD,IAAI,WAAuD,CAAC;IAC5D,IAAI,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC9C,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE;YAC7B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,iBAA2B,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC;YACxE,IAAI,EAAE,CAAC;QACT,CAAC,EAAE,GAAG,CAAC,CAAC;QACR,qDAAqD;QACrD,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YAC9D,WAAW,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,GAAe,EAAE,CAAC,CAAC;QAC/B,SAAS;QACT,MAAM;QACN,OAAO,EAAE,KAAK,CAAC,MAAM;QACrB,QAAQ;KACT,CAAC,CAAC;IAEH,MAAM,kBAAkB,GAAG,GAAS,EAAE;QACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACzC,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,YAAY,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,IAAe,EAAQ,EAAE;QACxC,QAAQ,EAAE,CAAC;QACX,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEhB,MAAM;aACH,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;aACrB,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;YACf,SAAS,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACxB,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC1C,gEAAgE;gBAChE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,OAAO;YACT,CAAC;YACD,MAAM,EAAE,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC,CAAC;aACD,OAAO,CAAC,GAAG,EAAE;YACZ,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7B,IAAI,EAAE,CAAC;YACP,kBAAkB,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;IACP,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,OAAO,CAAC,QAAQ,IAAI,QAAQ,GAAG,WAAW,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;YAC9E,IAAI,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBAC7B,MAAM,IAAI,CAAC,CAAC;YACd,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,CAAC,OAAa;YACf,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,CAAC;YAC/D,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;gBACjC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,mBAAmB,YAAY,GAAG,CAAC,CAAC,CAAC;YACvE,CAAC;YACD,OAAO,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;gBACtD,IAAI,EAAE,CAAC;YACT,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,CAAC,QAAyB;YAC9B,OAAO,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;QAED,KAAK;YACH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACzC,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;YAC3B,CAAC;YACD,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC7B,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7B,CAAC,CAAC,CAAC;QACL,CAAC;QAED,KAAK;QAEL,OAAO;YACL,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,WAAW,EAAE,CAAC;gBAChB,aAAa,CAAC,WAAW,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC"}