@ai.ntellect/core 1.0.0 → 1.1.0

package/dist/routing/intent-classifier.js

@@ -0,0 +1,267 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HybridIntentClassifier = exports.IntentClassifier = void 0;
+const zod_1 = require("zod");
+// ---------------------------------------------------------------------------
+// Zod schema for LLM response validation
+// ---------------------------------------------------------------------------
+/** Zod schema used to validate the raw JSON returned by the LLM. */
+const IntentSchema = zod_1.z.object({
+    intent: zod_1.z.string(),
+    confidence: zod_1.z.number().min(0).max(1),
+    entities: zod_1.z.record(zod_1.z.string(), zod_1.z.any()).optional(),
+    intents: zod_1.z.array(zod_1.z.object({
+        intent: zod_1.z.string(),
+        confidence: zod_1.z.number().min(0).max(1),
+        entities: zod_1.z.record(zod_1.z.string(), zod_1.z.any()).optional(),
+    })).optional(),
+});
+// ---------------------------------------------------------------------------
+// IntentClassifier — pure LLM-backed classifier
+// ---------------------------------------------------------------------------
+/**
+ * LLM-backed intent classifier for the CortexFlow orchestration layer.
+ *
+ * The classifier sends a single prompt to an LLM and expects a JSON reply
+ * conforming to `{ intent, confidence, entities }`. The response is validated
+ * with Zod; any parse failure falls back to `UNKNOWN` with zero confidence.
+ *
+ * Keeping classification to **one LLM call per user turn** is a core design
+ * principle — all subsequent routing is done deterministically by the Petri net.
+ *
+ * @example
+ * ```ts
+ * const classifier = new IntentClassifier(llmFn, {
+ *   intents: ['FETCH_MAILS', 'SUMMARIZE', 'ARCHIVE'],
+ *   confidenceThreshold: 0.7,
+ * });
+ *
+ * const result = await classifier.classify('Please fetch my latest 5 emails');
+ * // { intent: 'FETCH_MAILS', confidence: 0.95, entities: { maxMails: 5 } }
+ * ```
+ */
+class IntentClassifier {
+    /**
+     * @param llmCall - Function that forwards a prompt to an LLM and returns its text response.
+     * @param options.intents - List of valid intent labels the LLM must choose from.
+     * @param options.confidenceThreshold - Minimum confidence to avoid triggering clarification.
+     *   Defaults to `0.6`.
+     */
+    constructor(llmCall, options) {
+        var _a;
+        this.llmCall = llmCall;
+        this.intents = (options === null || options === void 0 ? void 0 : options.intents) || [
+            'CREATE', 'APPROVE', 'REJECT', 'QUERY', 'CANCEL', 'ESCALATE', 'UNKNOWN',
+        ];
+        this.confidenceThreshold = (_a = options === null || options === void 0 ? void 0 : options.confidenceThreshold) !== null && _a !== void 0 ? _a : 0.6;
+    }
+    /**
+     * Classifies a user message into one of the registered intents via one LLM call.
+     *
+     * Supports multi-intent detection: if the LLM returns an `intents` array,
+     * the result will include multiple intents to be executed sequentially.
+     *
+     * On JSON parse failure or Zod validation error, returns a safe fallback
+     * `{ intent: "UNKNOWN", confidence: 0, entities: {} }` rather than throwing.
+     */
+    classify(message, context) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const turnHistory = (context === null || context === void 0 ? void 0 : context.turnHistory) || [];
+            const prompt = `You are an intent classifier for a workflow system.
+Available intents: ${this.intents.join(', ')} 
+
+Respond with JSON only in this format:
+{"intent": "INTENT_NAME", "confidence": 0.0-1.0, "entities": {}}
+
+If the user message contains MULTIPLE actions, also include an "intents" array:
+{"intent": "MAIN_INTENT", "confidence": 0.0-1.0, "entities": {}, "intents": [{"intent": "ACTION1", "confidence": 0.0-1.0, "entities": {}}, {"intent": "ACTION2", "confidence": 0.0-1.0, "entities": {}}]}
+
+User message: ${message}
+${turnHistory.length > 0 ? `Recent history: ${JSON.stringify(turnHistory.slice(-5))}` : ''}
+
+JSON response:`;
+            try {
+                const response = yield this.llmCall(prompt);
+                const parsed = JSON.parse(response);
+                const result = IntentSchema.parse(parsed);
+                const intentResult = {
+                    intent: result.intent,
+                    confidence: result.confidence,
+                    entities: result.entities || {},
+                    turnHistory,
+                };
+                if (result.intents && result.intents.length > 0) {
+                    intentResult.intents = result.intents.map(i => ({
+                        intent: i.intent,
+                        confidence: i.confidence,
+                        entities: i.entities || {},
+                    }));
+                }
+                return intentResult;
+            }
+            catch (_a) {
+                return { intent: 'UNKNOWN', confidence: 0, entities: {}, turnHistory };
+            }
+        });
+    }
+    /** Returns the current confidence threshold. */
+    getConfidenceThreshold() { return this.confidenceThreshold; }
+    /** Overrides the confidence threshold at runtime. */
+    setConfidenceThreshold(threshold) { this.confidenceThreshold = threshold; }
+    /**
+     * Converts this classifier instance into a plain `IntentClassifierFn`
+     * suitable for `CortexFlowOrchestrator.setIntentClassifier`.
+     */
+    static toFn(classifier) {
+        return (message, context) => classifier.classify(message, context);
+    }
+    /**
+     * Generates a short clarifying question when the user's intent is ambiguous.
+     *
+     * Falls back to a generic question listing available intents if the LLM call fails.
+     */
+    generateClarification(originalMessage) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const prompt = `User said: "${originalMessage}". Possible intents: ${this.intents.join(', ')}.
+Ask a short clarifying question to understand which action the user wants. Only return the question, nothing else.`;
+            try {
+                return (yield this.llmCall(prompt)).trim();
+            }
+            catch (_a) {
+                const options = this.intents.filter(i => i !== 'UNKNOWN').join(', ');
+                return `I didn't understand. Possible actions: ${options}. Which one do you want?`;
+            }
+        });
+    }
+}
+exports.IntentClassifier = IntentClassifier;
+// ---------------------------------------------------------------------------
+// HybridIntentClassifier — keyword-first, LLM fallback
+// ---------------------------------------------------------------------------
+/**
+ * A hybrid intent classifier that tries keyword rules first and only invokes
+ * the LLM when no rule reaches the configured confidence threshold.
+ *
+ * **Why this matters for performance**: intent classification is on the
+ * critical path of every user turn. For well-defined, unambiguous commands
+ * ("fetch my mails", "archive all newsletters") keyword rules resolve in
+ * microseconds at confidence ≥ 0.9, eliminating the first LLM call entirely.
+ * The LLM is reserved for genuinely ambiguous messages.
+ *
+ * The confidence of a rule is computed as:
+ * `baseConfidence × (matchedKeywords / totalKeywords)`.
+ * This means a rule with 4 keywords where 3 match scores 0.95 × 0.75 = 0.71,
+ * which may still exceed the threshold for coarse intents.
+ *
+ * @example
+ * ```ts
+ * const classifier = new HybridIntentClassifier(
+ *   [
+ *     { intent: 'TRIAGE_MAILS', keywords: ['fetch', 'mail', 'urgent', 'archive'], confidence: 0.95 },
+ *     { intent: 'FETCH_MAILS',  keywords: ['fetch', 'email'],                     confidence: 0.90 },
+ *   ],
+ *   { intents: ['TRIAGE_MAILS', 'FETCH_MAILS', 'UNKNOWN'], confidenceThreshold: 0.6 },
+ *   llmFn, // optional — omit for pure keyword mode
+ * );
+ *
+ * // "Fetch my 5 mails and flag the urgent ones" → keyword match, 0 LLM calls
+ * // "Do the thing with the emails maybe?"       → LLM fallback
+ * ```
+ */
+class HybridIntentClassifier {
+    /**
+     * @param rules - Ordered list of keyword rules. Rules are evaluated in order;
+     *   the highest-scoring match wins.
+     * @param options.intents - Valid intent labels (used for LLM fallback prompt and clarification).
+     * @param options.confidenceThreshold - Minimum confidence to accept a result without LLM fallback.
+     * @param llmFn - Optional LLM function. If omitted, unmatched messages return `UNKNOWN`.
+     */
+    constructor(rules, options, llmFn) {
+        var _a;
+        this.rules = rules;
+        this.intents = options.intents;
+        this.confidenceThreshold = (_a = options.confidenceThreshold) !== null && _a !== void 0 ? _a : 0.6;
+        if (llmFn) {
+            this.llmClassifier = new IntentClassifier(llmFn, options);
+        }
+    }
+    /** Returns the current confidence threshold. */
+    getConfidenceThreshold() { return this.confidenceThreshold; }
+    /**
+     * Classifies a message using keyword rules first.
+     *
+     * If the best keyword rule score meets the threshold, the result is returned
+     * immediately — no LLM call is made. Otherwise, the LLM classifier is invoked
+     * as a fallback (if configured). Messages that match no rule and have no LLM
+     * fallback return `UNKNOWN` with confidence 0.
+     */
+    classify(message, context) {
+        return __awaiter(this, void 0, void 0, function* () {
+            var _a, _b;
+            const ruleResult = this.applyRules(message, (_a = context === null || context === void 0 ? void 0 : context.turnHistory) !== null && _a !== void 0 ? _a : []);
+            if (ruleResult && ruleResult.confidence >= this.confidenceThreshold) {
+                return ruleResult;
+            }
+            if (this.llmClassifier) {
+                return this.llmClassifier.classify(message, context);
+            }
+            return ruleResult !== null && ruleResult !== void 0 ? ruleResult : { intent: 'UNKNOWN', confidence: 0, entities: {}, turnHistory: (_b = context === null || context === void 0 ? void 0 : context.turnHistory) !== null && _b !== void 0 ? _b : [] };
+        });
+    }
+    /**
+     * Generates a clarifying question for ambiguous messages.
+     * Delegates to the LLM classifier if available; otherwise returns a generic
+     * question listing the known intents.
+     */
+    generateClarification(originalMessage) {
+        return __awaiter(this, void 0, void 0, function* () {
+            if (this.llmClassifier) {
+                return this.llmClassifier.generateClarification(originalMessage);
+            }
+            const options = this.intents.filter(i => i !== 'UNKNOWN').join(', ');
+            return `I didn't understand. Possible actions: ${options}. Which one do you want?`;
+        });
+    }
+    /**
+     * Converts this classifier into a plain `IntentClassifierFn`.
+     * Works identically to `IntentClassifier.toFn`.
+     */
+    static toFn(classifier) {
+        return (message, context) => classifier.classify(message, context);
+    }
+    // ---------------------------------------------------------------------------
+    // Private helpers
+    // ---------------------------------------------------------------------------
+    applyRules(message, turnHistory) {
+        var _a, _b;
+        const lower = message.toLowerCase();
+        let best = null;
+        for (const rule of this.rules) {
+            // Skip if any negation term is present
+            if ((_a = rule.negations) === null || _a === void 0 ? void 0 : _a.some(n => lower.includes(n.toLowerCase())))
+                continue;
+            const matched = rule.keywords.filter(kw => lower.includes(kw.toLowerCase()));
+            if (matched.length === 0)
+                continue;
+            // Partial match: score scales with the fraction of keywords matched
+            const score = ((_b = rule.confidence) !== null && _b !== void 0 ? _b : 0.95) * (matched.length / rule.keywords.length);
+            if (!best || score > best.score) {
+                best = { intent: rule.intent, score };
+            }
+        }
+        if (!best)
+            return null;
+        return { intent: best.intent, confidence: best.score, entities: {}, turnHistory };
+    }
+}
+exports.HybridIntentClassifier = HybridIntentClassifier;
+//# sourceMappingURL=intent-classifier.js.map

package/dist/routing/intent-classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-classifier.js","sourceRoot":"","sources":["../../routing/intent-classifier.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,6BAAwB;AA2ExB,8EAA8E;AAC9E,yCAAyC;AACzC,8EAA8E;AAE9E,oEAAoE;AACpE,MAAM,YAAY,GAAG,OAAC,CAAC,MAAM,CAAC;IAC5B,MAAM,EAAM,OAAC,CAAC,MAAM,EAAE;IACtB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,QAAQ,EAAI,OAAC,CAAC,MAAM,CAAC,OAAC,CAAC,MAAM,EAAE,EAAE,OAAC,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE;IACpD,OAAO,EAAK,OAAC,CAAC,KAAK,CAAC,OAAC,CAAC,MAAM,CAAC;QAC3B,MAAM,EAAM,OAAC,CAAC,MAAM,EAAE;QACtB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,QAAQ,EAAI,OAAC,CAAC,MAAM,CAAC,OAAC,CAAC,MAAM,EAAE,EAAE,OAAC,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE;KACrD,CAAC,CAAC,CAAC,QAAQ,EAAE;CACf,CAAC,CAAC;AAEH,8EAA8E;AAC9E,gDAAgD;AAChD,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,gBAAgB;IAK3B;;;;;OAKG;IACH,YACE,OAA4C,EAC5C,OAA8D;;QAE9D,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,KAAI;YACjC,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS;SACxE,CAAC;QACF,IAAI,CAAC,mBAAmB,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,mBAAmB,mCAAI,GAAG,CAAC;IACjE,CAAC;IAED;;;;;;;;OAQG;IACG,QAAQ,CACZ,OAAe,EACf,OAAoC;;YAEpC,MAAM,WAAW,GAAG,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,KAAI,EAAE,CAAC;YAE/C,MAAM,MAAM,GAAG;qBACE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;;;gBAQ5B,OAAO;EACrB,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;;eAE3E,CAAC;YAEZ,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC5C,MAAM,MAAM,GAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAK,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAE5C,MAAM,YAAY,GAAiB;oBACjC,MAAM,EAAE,MAAM,CAAC,MAAM;oBACrB,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE;oBAC/B,WAAW;iBACZ,CAAC;gBAEF,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChD,YAAY,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBAC9C,MAAM,EAAE,CAAC,CAAC,MAAM;wBAChB,UAAU,EAAE,CAAC,CAAC,UAAU;wBACxB,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,EAAE;qBAC3B,CAAC,CAAC,CAAC;gBACN,CAAC;gBAED,OAAO,YAAY,CAAC;YACtB,CAAC;YAAC,WAAM,CAAC;gBACP,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;YACzE,CAAC;QACH,CAAC;KAAA;IAED,gDAAgD;IAChD,sBAAsB,KAAa,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAErE,qDAAqD;IACrD,sBAAsB,CAAC,SAAiB,IAAU,IAAI,CAAC,mBAAmB,GAAG,SAAS,CAAC,CAAC,CAAC;IAEzF;;;OAGG;IACH,MAAM,CAAC,IAAI,CAAC,UAA6B;QACvC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IAED;;;;OAIG;IACG,qBAAqB,CAAC,eAAuB;;YACjD,MAAM,MAAM,GAAG,eAAe,eAAe,wBAAwB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;mHACmB,CAAC;YAEhH,IAAI,CAAC;gBACH,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC7C,CAAC;YAAC,WAAM,CAAC;gBACP,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrE,OAAO,0CAA0C,OAAO,0BAA0B,CAAC;YACrF,CAAC;QACH,CAAC;KAAA;CACF;AA3GD,4CA2GC;AAED,8EAA8E;AAC9E,uDAAuD;AACvD,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAa,sBAAsB;IAMjC;;;;;;OAMG;IACH,YACE,KAAoB,EACpB,OAA4D,EAC5D,KAA2C;;QAE3C,IAAI,CAAC,KAAK,GAAiB,KAAK,CAAC;QACjC,IAAI,CAAC,OAAO,GAAe,OAAO,CAAC,OAAO,CAAC;QAC3C,IAAI,CAAC,mBAAmB,GAAG,MAAA,OAAO,CAAC,mBAAmB,mCAAI,GAAG,CAAC;QAC9D,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,aAAa,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,sBAAsB,KAAa,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAErE;;;;;;;OAOG;IACG,QAAQ,CACZ,OAAe,EACf,OAAoC;;;YAEpC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,mCAAI,EAAE,CAAC,CAAC;YAExE,IAAI,UAAU,IAAI,UAAU,CAAC,UAAU,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBACpE,OAAO,UAAU,CAAC;YACpB,CAAC;YAED,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;YAED,OAAO,UAAU,aAAV,UAAU,cAAV,UAAU,GAAI,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,mCAAI,EAAE,EAAE,CAAC;QACnH,CAAC;KAAA;IAED;;;;OAIG;IACG,qBAAqB,CAAC,eAAuB;;YACjD,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,aAAa,CAAC,qBAAqB,CAAC,eAAe,CAAC,CAAC;YACnE,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrE,OAAO,0CAA0C,OAAO,0BAA0B,CAAC;QACrF,CAAC;KAAA;IAED;;;OAGG;IACH,MAAM,CAAC,IAAI,CAAC,UAA6B;QACvC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAEtE,UAAU,CAAC,OAAe,EAAE,WAAqB;;QACvD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,IAAI,IAAI,GAA6C,IAAI,CAAC;QAE1D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,uCAAuC;YACvC,IAAI,MAAA,IAAI,CAAC,SAAS,0CAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;gBAAE,SAAS;YAEzE,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC7E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEnC,oEAAoE;YACpE,MAAM,KAAK,GAAG,CAAC,MAAA,IAAI,CAAC,UAAU,mCAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClF,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChC,IAAI,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;YACxC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;IACpF,CAAC;CACF;AApGD,wDAoGC"}

package/dist/routing/matrix.d.ts

@@ -0,0 +1,6 @@
+export declare function matrixZeros(rows: number, cols: number): number[][];
+export declare function matrixSubtract(a: number[][], b: number[][]): number[][];
+export declare function transpose(matrix: number[][]): number[][];
+export declare function findNullSpace(A: number[][]): number[][];
+export declare function hasPositiveNullVector(C: number[][]): boolean;
+//# sourceMappingURL=matrix.d.ts.map

package/dist/routing/matrix.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../../routing/matrix.ts"],"names":[],"mappings":"AAAA,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAElE;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CAUvE;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CAUxD;AA0CD,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CA0CvD;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAyB5D"}

package/dist/routing/matrix.js

@@ -0,0 +1,131 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.matrixZeros = matrixZeros;
+exports.matrixSubtract = matrixSubtract;
+exports.transpose = transpose;
+exports.findNullSpace = findNullSpace;
+exports.hasPositiveNullVector = hasPositiveNullVector;
+function matrixZeros(rows, cols) {
+    return Array.from({ length: rows }, () => new Array(cols).fill(0));
+}
+function matrixSubtract(a, b) {
+    const rows = a.length;
+    const cols = a[0].length;
+    const result = matrixZeros(rows, cols);
+    for (let i = 0; i < rows; i++) {
+        for (let j = 0; j < cols; j++) {
+            result[i][j] = a[i][j] - b[i][j];
+        }
+    }
+    return result;
+}
+function transpose(matrix) {
+    const rows = matrix.length;
+    const cols = matrix[0].length;
+    const result = matrixZeros(cols, rows);
+    for (let i = 0; i < rows; i++) {
+        for (let j = 0; j < cols; j++) {
+            result[j][i] = matrix[i][j];
+        }
+    }
+    return result;
+}
+function rref(matrix) {
+    const m = matrix.length;
+    if (m === 0)
+        return { result: [], pivots: [] };
+    const n = matrix[0].length;
+    const A = matrix.map(row => [...row]);
+    const pivots = [];
+    let row = 0;
+    for (let col = 0; col < n && row < m; col++) {
+        let pivotRow = row;
+        while (pivotRow < m && Math.abs(A[pivotRow][col]) < 1e-10) {
+            pivotRow++;
+        }
+        if (pivotRow === m)
+            continue;
+        if (pivotRow !== row) {
+            [A[row], A[pivotRow]] = [A[pivotRow], A[row]];
+        }
+        const pivotVal = A[row][col];
+        for (let j = 0; j < n; j++) {
+            A[row][j] /= pivotVal;
+        }
+        for (let i = 0; i < m; i++) {
+            if (i !== row && Math.abs(A[i][col]) > 1e-10) {
+                const factor = A[i][col];
+                for (let j = 0; j < n; j++) {
+                    A[i][j] -= factor * A[row][j];
+                }
+            }
+        }
+        pivots.push(col);
+        row++;
+    }
+    return { result: A, pivots };
+}
+function findNullSpace(A) {
+    const m = A.length;
+    if (m === 0)
+        return [];
+    const n = A[0].length;
+    if (n === 0)
+        return [];
+    const { result: R, pivots } = rref(A);
+    const pivotSet = new Set(pivots);
+    const freeCols = Array.from({ length: n }, (_, i) => i).filter(i => !pivotSet.has(i));
+    const basis = [];
+    for (const freeCol of freeCols) {
+        const vec = new Array(n).fill(0);
+        vec[freeCol] = 1;
+        for (let i = 0; i < R.length; i++) {
+            let pivotCol = -1;
+            for (let j = 0; j < n; j++) {
+                if (Math.abs(R[i][j]) > 1e-10) {
+                    pivotCol = j;
+                    break;
+                }
+            }
+            if (pivotCol !== -1 && pivotSet.has(pivotCol)) {
+                let sum = 0;
+                for (let j = 0; j < n; j++) {
+                    if (j !== pivotCol) {
+                        sum += R[i][j] * vec[j];
+                    }
+                }
+                vec[pivotCol] = -sum;
+            }
+        }
+        basis.push(vec);
+    }
+    return basis;
+}
+function hasPositiveNullVector(C) {
+    const CT = transpose(C);
+    if (CT.length === 0 || CT[0].length === 0)
+        return true;
+    const basis = findNullSpace(CT);
+    if (basis.length === 0) {
+        return true;
+    }
+    for (const vec of basis) {
+        if (vec.every(v => v > 1e-10))
+            return true;
+        if (vec.every(v => v < -1e-10))
+            return true;
+    }
+    if (basis.length >= 2) {
+        for (let i = 0; i < basis.length; i++) {
+            for (let j = i + 1; j < basis.length; j++) {
+                const sum = basis[i].map((v, k) => v + basis[j][k]);
+                if (sum.every(v => v > 1e-10))
+                    return true;
+                if (sum.every(v => v < -1e-10))
+                    return true;
+            }
+        }
+    }
+    return false;
+}
+//# sourceMappingURL=matrix.js.map

package/dist/routing/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../routing/matrix.ts"],"names":[],"mappings":";;AAAA,kCAEC;AAED,wCAUC;AAED,8BAUC;AA0CD,sCA0CC;AAED,sDAyBC;AAzID,SAAgB,WAAW,CAAC,IAAY,EAAE,IAAY;IACpD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACrE,CAAC;AAED,SAAgB,cAAc,CAAC,CAAa,EAAE,CAAa;IACzD,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACzB,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,SAAS,CAAC,MAAkB;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC9B,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,IAAI,CAAC,MAAkB;IAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC/C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QAC5C,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnB,OAAO,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;YAC1D,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,IAAI,QAAQ,KAAK,CAAC;YAAE,SAAS;QAE7B,IAAI,QAAQ,KAAK,GAAG,EAAE,CAAC;YACrB,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC;QACxB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;gBAC7C,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,GAAG,EAAE,CAAC;IACR,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;AAC/B,CAAC;AAED,SAAgB,aAAa,CAAC,CAAa;IACzC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAEjC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAC5D,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CACtB,CAAC;IAEF,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;oBAC9B,QAAQ,GAAG,CAAC,CAAC;oBACb,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC9C,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;wBACnB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;gBACD,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YACvB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAgB,qBAAqB,CAAC,CAAa;IACjD,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvD,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IAChC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3C,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IAC9C,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAC3C,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/routing/orchestrator.d.ts

@@ -0,0 +1,87 @@
+import { PetriNet, TransitionResult } from './index';
+import { ToolRegistry } from '../execution/registry';
+import { IntentClassifier } from './intent-classifier';
+import { IPetriCheckpointAdapter } from './checkpoint-adapter';
+export interface Session {
+    id: string;
+    petriNet: PetriNet;
+    context: Record<string, any>;
+    history: string[];
+    createdAt: number;
+    traceId?: string;
+    clarificationQuestion?: string;
+    inFallbackMode?: boolean;
+    fallbackContext?: {
+        conversationHistory: string[];
+        lastFallbackResponse?: string;
+    };
+}
+export type FallbackLLM = (message: string, session: Session, toolRegistry?: ToolRegistry) => Promise<{
+    response: string;
+    shouldReenterPetri?: boolean;
+    reinterpretMessage?: string;
+}>;
+export interface IntentResult {
+    intent: string;
+    confidence: number;
+    entities: Record<string, any>;
+    intents?: Array<{
+        intent: string;
+        confidence: number;
+        entities?: Record<string, any>;
+    }>;
+}
+export type IntentClassifierFn = (message: string, context?: {
+    turnHistory?: string[];
+}) => Promise<IntentResult>;
+export declare class CortexFlowOrchestrator {
+    private petriNet;
+    private toolRegistry;
+    private sessions;
+    private intentClassifier?;
+    private intentClassifierInstance?;
+    private llmCall?;
+    private petriCheckpointAdapter?;
+    private fallbackLLM?;
+    private confidenceThreshold;
+    constructor(name: string, toolRegistry?: ToolRegistry);
+    setFallbackLLM(fn: FallbackLLM): void;
+    setConfidenceThreshold(threshold: number): void;
+    getConfidenceThreshold(): number;
+    get petri(): PetriNet;
+    setPetriCheckpointAdapter(adapter: IPetriCheckpointAdapter): void;
+    savePetriState(sessionId: string): Promise<string | null>;
+    restorePetriState(checkpointId: string): Promise<string | null>;
+    listPetriCheckpoints(): Promise<{
+        id: string;
+        timestamp: number;
+        sessionId?: string;
+    }[]>;
+    setIntentClassifier(classifier: IntentClassifierFn, instance?: IntentClassifier): void;
+    setLLMCall(llmCall: (prompt: string) => Promise<string>): void;
+    classifyIntent(message: string, sessionId?: string): Promise<IntentResult>;
+    startSession(sessionId?: string): string;
+    getSession(sessionId: string): Session | undefined;
+    fire(transitionId: string, sessionId: string, tokenData?: Record<string, any>): Promise<TransitionResult & {
+        actionResult?: any;
+    }>;
+    private executeAction;
+    private executeGraphFlowAction;
+    private executeDynamicAction;
+    private generateDynamicPlan;
+    private compilePlan;
+    orchestrate(message: string, sessionId?: string): Promise<{
+        intent: IntentResult;
+        transitionResult?: TransitionResult & {
+            actionResult?: any;
+        };
+        sessionId: string;
+        needsClarification?: boolean;
+        clarificationQuestion?: string;
+        fallbackResponse?: string;
+        shouldReenterPetri?: boolean;
+    }>;
+    private enterFallbackMode;
+    private handleFallbackMode;
+}
+//# sourceMappingURL=orchestrator.d.ts.map

package/dist/routing/orchestrator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"orchestrator.d.ts","sourceRoot":"","sources":["../../routing/orchestrator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAoB,MAAM,SAAS,CAAC;AAEvE,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAKrD,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,QAAQ,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC7B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,eAAe,CAAC,EAAE;QAChB,mBAAmB,EAAE,MAAM,EAAE,CAAC;QAC9B,oBAAoB,CAAC,EAAE,MAAM,CAAC;KAC/B,CAAC;CACH;AAED,MAAM,MAAM,WAAW,GAAG,CACxB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,OAAO,EAChB,YAAY,CAAC,EAAE,YAAY,KACxB,OAAO,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAAC,kBAAkB,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAE9F,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC9B,OAAO,CAAC,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,CAAC,CAAC;CACzF;AAED,MAAM,MAAM,kBAAkB,GAAG,CAC/B,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,KACjC,OAAO,CAAC,YAAY,CAAC,CAAC;AAE3B,qBAAa,sBAAsB;IACjC,OAAO,CAAC,QAAQ,CAAW;IAC3B,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,QAAQ,CAAmC;IACnD,OAAO,CAAC,gBAAgB,CAAC,CAAqB;IAC9C,OAAO,CAAC,wBAAwB,CAAC,CAAmB;IACpD,OAAO,CAAC,OAAO,CAAC,CAAsC;IACtD,OAAO,CAAC,sBAAsB,CAAC,CAA0B;IACzD,OAAO,CAAC,WAAW,CAAC,CAAc;IAClC,OAAO,CAAC,mBAAmB,CAAe;gBAE9B,IAAI,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,YAAY;IAKrD,cAAc,CAAC,EAAE,EAAE,WAAW,GAAG,IAAI;IAIrC,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IAI/C,sBAAsB,IAAI,MAAM;IAIhC,IAAI,KAAK,IAAI,QAAQ,CAEpB;IAED,yBAAyB,CAAC,OAAO,EAAE,uBAAuB,GAAG,IAAI;IAI3D,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAazD,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IA2B/D,oBAAoB;;;;;IAK1B,mBAAmB,CAAC,UAAU,EAAE,kBAAkB,EAAE,QAAQ,CAAC,EAAE,gBAAgB,GAAG,IAAI;IAKtF,UAAU,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI;IAUxD,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAShF,YAAY,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM;IA2BxC,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAI5C,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,gBAAgB,GAAG;QAAE,YAAY,CAAC,EAAE,GAAG,CAAA;KAAE,CAAC;YA0B1H,aAAa;YAMb,sBAAsB;YA2BtB,oBAAoB;YA4BpB,mBAAmB;IAoCjC,OAAO,CAAC,WAAW;IAIb,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;QAC9D,MAAM,EAAE,YAAY,CAAC;QACrB,gBAAgB,CAAC,EAAE,gBAAgB,GAAG;YAAE,YAAY,CAAC,EAAE,GAAG,CAAA;SAAE,CAAC;QAC7D,SAAS,EAAE,MAAM,CAAC;QAClB,kBAAkB,CAAC,EAAE,OAAO,CAAC;QAC7B,qBAAqB,CAAC,EAAE,MAAM,CAAC;QAC/B,gBAAgB,CAAC,EAAE,MAAM,CAAC;QAC1B,kBAAkB,CAAC,EAAE,OAAO,CAAC;KAC9B,CAAC;YA4GY,iBAAiB;YAyCjB,kBAAkB;CAkCjC"}