flow-frame-core 0.1.0

package/dist/services/stepByStepAiPlanner.d.ts

@@ -0,0 +1,39 @@
+import { UiPlanner } from './uiPlanner.js';
+export declare class StepByStepAiPlanner extends UiPlanner {
+    /**
+     * @param {Object} uiMap
+     * @param {Object} pathFinder
+     * @param {Object} [macroRegistry]
+     * @param {Array} [automationFiles]
+     */
+    constructor(uiMap: any, pathFinder: any, macroRegistry?: {}, automationFiles?: any[]);
+    /**
+     * Iteratively builds a plan one step at a time, validating each step before proceeding.
+     * Uses the dependencyGraph (if provided in context) to guide the planning.
+     *
+     * @param {string} request
+     * @param {string} startStateId
+     * @param {Object} context - Must include 'dependencyGraph' if available.
+     * @param {string} model
+     * @returns {Promise<Object>} The compiled plan.
+     */
+    plan(request: any, startStateId?: string, context?: {}, model?: string): Promise<{
+        steps: any[];
+    }>;
+    _identifyKeySteps(request: any, actionsSummary: any, model: any): Promise<any>;
+    _buildStepLookup(files: any): Map<any, any>;
+    _predictNextStep(request: any, currentPlan: any, currentState: any, uiMapSummary: any, graphSummary: any, errors: any, context: any, model: any): Promise<any>;
+    _validateSingleStep(step: any, currentState: any, dependencyGraph: any): {
+        valid: boolean;
+        error: string;
+        inferredState?: undefined;
+    } | {
+        valid: boolean;
+        inferredState: any;
+        error?: undefined;
+    };
+    _getUiMapSummary(): string;
+    _getDependencyGraphSummary(graph: any, stepIndex: any): string;
+    _getActionsSummary(): string;
+}
+//# sourceMappingURL=stepByStepAiPlanner.d.ts.map

package/dist/services/stepByStepAiPlanner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stepByStepAiPlanner.d.ts","sourceRoot":"","sources":["../../src/services/stepByStepAiPlanner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAG3C,qBAAa,mBAAoB,SAAQ,SAAS;IAC9C;;;;;OAKG;gBACS,KAAK,KAAA,EAAE,UAAU,KAAA,EAAE,aAAa,KAAK,EAAE,eAAe,QAAK;IAIvE;;;;;;;;;OASG;IACG,IAAI,CAAC,OAAO,KAAA,EAAE,YAAY,SAAS,EAAE,OAAO,KAAK,EAAE,KAAK,SAAuB;;;IAiF/E,iBAAiB,CAAC,OAAO,KAAA,EAAE,cAAc,KAAA,EAAE,KAAK,KAAA;IAgFtD,gBAAgB,CAAC,KAAK,KAAA;IAqBhB,gBAAgB,CAAC,OAAO,KAAA,EAAE,WAAW,KAAA,EAAE,YAAY,KAAA,EAAE,YAAY,KAAA,EAAE,YAAY,KAAA,EAAE,MAAM,KAAA,EAAE,OAAO,KAAA,EAAE,KAAK,KAAA;IAoD7G,mBAAmB,CAAC,IAAI,KAAA,EAAE,YAAY,KAAA,EAAE,eAAe,KAAA;;;;;;;;;IAqEvD,gBAAgB;IAkBhB,0BAA0B,CAAC,KAAK,KAAA,EAAE,SAAS,KAAA;IA0C3C,kBAAkB;CA2BrB"}

package/dist/services/stepByStepAiPlanner.js

@@ -0,0 +1,379 @@
+import { UiPlanner } from './uiPlanner.js';
+import { runPrompt, processLLMResponse } from './runPrompt.js';
+export class StepByStepAiPlanner extends UiPlanner {
+    /**
+     * @param {Object} uiMap
+     * @param {Object} pathFinder
+     * @param {Object} [macroRegistry]
+     * @param {Array} [automationFiles]
+     */
+    constructor(uiMap, pathFinder, macroRegistry = {}, automationFiles = []) {
+        super(uiMap, pathFinder, macroRegistry, automationFiles);
+    }
+    /**
+     * Iteratively builds a plan one step at a time, validating each step before proceeding.
+     * Uses the dependencyGraph (if provided in context) to guide the planning.
+     *
+     * @param {string} request
+     * @param {string} startStateId
+     * @param {Object} context - Must include 'dependencyGraph' if available.
+     * @param {string} model
+     * @returns {Promise<Object>} The compiled plan.
+     */
+    async plan(request, startStateId = 'home', context = {}, model = 'gpt-5.2-2025-12-11') {
+        const dependencyGraph = context.dependencyGraph || { nodes: [], edges: [] };
+        // Index all steps from automation files for lookup by ID or Field Name
+        const stepLookup = this._buildStepLookup(this.automationFiles);
+        if (stepLookup.has(startStateId)) {
+            const startStep = stepLookup.get(startStateId);
+            const meta = startStep.selfLearningMetadata || startStep.params?.selfLearningMetadata || startStep.param?.selfLearningMetadata;
+            const resolvedLocation = meta?.location_2 || meta?.location || startStep.location || startStep.params?.location;
+            if (resolvedLocation) {
+                console.log(`Resolved startStateId "${startStateId}" to location "${resolvedLocation}" from step definition.`);
+                startStateId = resolvedLocation;
+            }
+        }
+        await new Promise(r => setTimeout(r, 10000)); // slight delay for logging clarity
+        console.log('StepByStepAiPlanner: Starting Key Step Identification');
+        console.log('Dependency Graph Nodes:', dependencyGraph.nodes?.length);
+        // 1. Prepare static context (UI Map fields, Dependency Graph summary)
+        // const uiMapSummary = this._getUiMapSummary();
+        // const graphSummary = this._getDependencyGraphSummary(dependencyGraph, stepLookup);
+        const actionsSummary = this._getActionsSummary();
+        // 2. Identify the Key Steps (High-Level Plan)
+        const rawKeySteps = await this._identifyKeySteps(request, actionsSummary, model);
+        console.log(`StepByStepAiPlanner: Identified ${rawKeySteps.length} raw key steps.`);
+        // Hydrate ID-based key steps from Automation Files
+        const keySteps = [];
+        for (const stepIdRaw of rawKeySteps) {
+            // Handle both string ID and legacy object format
+            const stepId = typeof stepIdRaw === 'string' ? stepIdRaw : (stepIdRaw.field || stepIdRaw.id);
+            if (stepLookup.has(stepId)) {
+                keySteps.push(stepLookup.get(stepId));
+            }
+            else {
+                console.warn(`Skipping key step ID "${stepId}" because it was not found in automation files.`);
+            }
+        }
+        console.log(`StepByStepAiPlanner: Validated ${keySteps.length} key steps.`);
+        // 3. Resolve Target States for Key Steps (Preparation for Routing)
+        // We need to hint to the pathfinder where these fields live.
+        const planOps = [];
+        for (const step of keySteps) {
+            // Basic structure needed for compile()
+            const op = { ...step };
+            // Ensure 'field' is present if hidden in metadata (needed for state lookup below)
+            const meta = op.selfLearningMetadata || op.params?.selfLearningMetadata || op.param?.selfLearningMetadata;
+            if (!op.field && meta && meta.field) {
+                op.field = meta.field;
+            }
+            // Try to resolve targetStateId via index
+            if (op.field) {
+                const states = this.indexes.fieldToStateIds.get(op.field);
+                if (states && states.length > 0) {
+                    op.targetStateId = states[0]; // Heuristic: Pick first occurrence
+                }
+            }
+            planOps.push(op);
+        }
+        // 4. Compile the Route (Pathfinding)
+        // This traverses the Key Steps and uses pathFinder to inject navigation steps between them.
+        const compiled = this.compile(planOps, startStateId);
+        // 5. Describe the Final Plan
+        compiled.description = await this._generatePlanDescription(compiled.steps, request, model);
+        return compiled;
+    }
+    async _identifyKeySteps(request, actionsSummary, model) {
+        // Build a prompt that focuses on ORDER and SELECTION of critical nodes
+        console.log(`actionsSummary length: ${actionsSummary.length}`);
+        console.log(actionsSummary);
+        const systemPrompt = `
+You are an expert Automation Strategist.
+Your goal is to identify the "Key Steps" required to satisfy the User Request.
+
+
+OUTPUT SCHEMA (JSON):
+{
+  "keySteps": [
+    "ID_OF_STEP_1",
+    "ID_OF_STEP_2"
+  ]
+}
+
+AVAILABLE ACTIONS (Detailed Descriptions):
+${actionsSummary}
+
+`;
+        console.log("Identifying key steps with prompt context length:", systemPrompt.length);
+        const response = await runPrompt([{ role: 'system', content: systemPrompt }, { role: 'user', content: typeof request === 'object' ? JSON.stringify(request) : request }], model);
+        let result = {};
+        // 1. Try standard processing
+        try {
+            console.log('--- Raw LLM Response for Key Steps ---');
+            console.log(response);
+            console.log('--- End of Raw LLM Response ---');
+            const standardResult = await processLLMResponse(response, model, 'openai');
+            console.log(standardResult);
+            console.log("********** processLLMResponse returned **************", JSON.stringify(standardResult));
+            if (standardResult && typeof standardResult === 'object' && Array.isArray(standardResult.keySteps)) {
+                result = standardResult;
+            }
+            else {
+                console.log("processLLMResponse returned invalid structure:", JSON.stringify(standardResult));
+            }
+        }
+        catch (e) {
+            console.warn("processLLMResponse threw error:", e);
+        }
+        // 2. Fallback: Aggressive manual parse if keySteps missing
+        if (!result.keySteps) {
+            console.log("Attempting aggressive manual JSON extraction from response...");
+            try {
+                // Find the first outer brace pair
+                const match = response.match(/\{[\s\S]*\}/);
+                if (match) {
+                    const candidate = match[0];
+                    // Try parsing
+                    const parsed = JSON.parse(candidate);
+                    if (parsed && Array.isArray(parsed.keySteps)) {
+                        result = parsed;
+                        console.log("Manual extraction successful.");
+                    }
+                }
+            }
+            catch (e) {
+                console.warn("Manual parsing failed:", e);
+                // Last ditch: try to clean markdown if it exists but regex missed it
+                try {
+                    const clean = response.replace(/```json/g, '').replace(/```/g, '').trim();
+                    if (clean.startsWith('{')) {
+                        const parsed = JSON.parse(clean);
+                        if (parsed.keySteps)
+                            result = parsed;
+                    }
+                }
+                catch (z) { }
+            }
+        }
+        const steps = result.keySteps || [];
+        console.log(`Identified ${steps.length} key steps from raw response.`);
+        if (steps.length === 0) {
+            console.log("Raw Response was:", response);
+        }
+        return steps;
+    }
+    _buildStepLookup(files) {
+        const lookup = new Map();
+        if (!files)
+            return lookup;
+        for (const file of files) {
+            const steps = file.content?.steps || [];
+            for (const step of steps) {
+                // Index by ID
+                if (step.id)
+                    lookup.set(step.id, step);
+                // Index by Metadata Field/Name
+                const meta = step.selfLearningMetadata || step.params?.selfLearningMetadata || step.param?.selfLearningMetadata;
+                if (meta) {
+                    const name = meta.field || meta.name;
+                    if (name)
+                        lookup.set(name, step);
+                }
+            }
+        }
+        return lookup;
+    }
+    async _predictNextStep(request, currentPlan, currentState, uiMapSummary, graphSummary, errors, context, model) {
+        const planSummary = currentPlan.map((s, i) => `${i + 1}. [${s.kind}] ${s.field || s.target || s.label} ${s.value ? `(${s.value})` : ''}`).join('\n');
+        const systemPrompt = `
+You are an expert UI Automation Planner building a plan STEP BY STEP.
+Your goal is to satisfy the USER REQUEST by adding one valid step at a time.
+
+USER REQUEST: "${typeof request === 'object' ? JSON.stringify(request) : request}"
+
+CONTEXT:
+- Current Screen State: "${currentState}"
+- UI Map Fields: 
+${uiMapSummary}
+
+- Dependency Graph (Business Logic / Flow):
+${graphSummary}
+
+CURRENT PLAN SO FAR:
+${planSummary || "(No steps yet)"}
+
+RECENT ERRORS (Avoid repeating these):
+${errors.join('\n')}
+
+INSTRUCTIONS:
+1. Analyze the User Request to identify the starting point in the Dependency Graph.
+2. If a node in the Dependency Graph matches the intent, YOU MUST FOLLOW THE EDGES defined in the graph.
+   - Root nodes (nodes with no incoming dependencies for a task) often start a sequence.
+   - If Node A connects to Node B, you MUST typically add Node A's step, then Node B's step.
+3. Determine the SINGLE next logical step.
+4. If the plan is already complete and satisfies the request, return "FINISH".
+5. If a step is needed, return "ADD_STEP" with the step details.
+
+STEP SCHEMA:
+{
+  "action": "ADD_STEP" | "FINISH",
+  "step": { // Only required if action is ADD_STEP
+      "kind": "setField" | "select" | "navigate" | "commit" | "wait",
+      "field": "string (Exact match from UI Map OR Dependency Graph Step Name)", 
+      "value": "any (if needed)",
+      "target": "string (for navigate)",
+      "label": "string (for commit)",
+      "description": "Short reasoning"
+  }
+}
+
+Respond ONLY with valid JSON.
+`;
+        const response = await runPrompt([{ role: 'system', content: systemPrompt }], model);
+        return processLLMResponse(response, model, 'openai');
+    }
+    _validateSingleStep(step, currentState, dependencyGraph) {
+        // 1. Basic Schema Validation
+        if (!step.kind)
+            return { valid: false, error: "Missing 'kind' in step" };
+        let inferredState = currentState;
+        // 2. Logic Validation based on UI Map
+        if (step.kind === 'setField' || step.kind === 'select' || step.kind === 'wait') {
+            const fieldName = step.field;
+            const candidateStates = this.indexes.fieldToStateIds.get(fieldName);
+            if (!candidateStates || candidateStates.length === 0) {
+                // Check automation files fallback
+                const inFiles = this.automationFieldIndex ? this.automationFieldIndex.has(fieldName) : false;
+                if (inFiles) {
+                    // We accept it but warn we don't know the exact state
+                    // We assume the current state or a transition will happen
+                    // For heuristic, we say valid.
+                }
+                else {
+                    return { valid: false, error: `Field "${fieldName}" not found in UI Map or automation files.` };
+                }
+            }
+            else {
+                // Check if we are reachable or in the correct state
+                // If the field exists in the current state, great.
+                if (candidateStates.includes(currentState)) {
+                    inferredState = currentState;
+                }
+                else {
+                    // Requires navigation? 
+                    // The planner should ideally output a navigate step first, OR we implicit allow it 
+                    // and let the compiler handle the path finding.
+                    // However, if we want strict step-by-step, we might enforce navigation.
+                    // Let's be lenient: if a path exists, we allow it, and the compiler adds the edges.
+                    // But we update inferredState to where the field is.
+                    inferredState = candidateStates[0];
+                }
+            }
+        }
+        if (step.kind === 'navigate') {
+            if (!this.uiMap.states[step.target]) {
+                return { valid: false, error: `Target state "${step.target}" does not exist.` };
+            }
+            inferredState = step.target;
+        }
+        // 3. Dependency Graph Validation
+        // If the dependency graph has rules like "Node A must be visited before Node B"
+        // We can check if 'step.field' corresponds to a node in the graph, and check its incoming edges.
+        if (dependencyGraph && Array.isArray(dependencyGraph.edges)) {
+            // Find node corresponding to this step
+            const graphNode = dependencyGraph.nodes?.find(n => n.data?.label === step.field || n.data?.step?.name === step.field);
+            if (graphNode) {
+                // Check prerequisites
+                const incomingEdges = dependencyGraph.edges.filter(e => e.target === graphNode.id);
+                /*
+                for (const edge of incomingEdges) {
+                    const sourceNode = dependencyGraph.nodes.find(n => n.id === edge.source);
+                    // Check if sourceNode's acton has been performed in currentPlan
+                    // This is a complex check requiring mapping plan steps to graph nodes.
+                    // For now, we'll skip deep graph validation unless explicitly requested,
+                    // as mapping string steps to graph IDs is non-trivial without more shared IDs.
+                }
+                */
+            }
+        }
+        return { valid: true, inferredState };
+    }
+    _getUiMapSummary() {
+        const fields = [];
+        for (const [stateId, state] of Object.entries(this.uiMap.states)) {
+            if (state.fields) {
+                state.fields.forEach(f => {
+                    fields.push(`- [${stateId}] ${f.name || f.field} (${f.type})`);
+                });
+            }
+        }
+        // If empty, fallback to index
+        if (fields.length === 0) {
+            for (const [field, states] of this.indexes.fieldToStateIds.entries()) {
+                fields.push(`- [${states.join(', ')}] ${field}`);
+            }
+        }
+        return fields.slice(0, 200).join('\n') + (fields.length > 200 ? '\n... (more fields truncated)' : '');
+    }
+    _getDependencyGraphSummary(graph, stepIndex) {
+        if (!graph || !graph.nodes)
+            return "No dependency graph available.";
+        // Summarize nodes and connections
+        const lines = [];
+        const nodeMap = new Map(graph.nodes.map(n => [n.id, n]));
+        // Collect detailed info for each node using stepIndex
+        const nodeDescriptions = graph.nodes.map(n => {
+            const stepId = n.data?.stepId; // The ID linking to automation files
+            const step = stepIndex ? stepIndex.get(stepId) : null;
+            const meta = step?.selfLearningMetadata || n.data?.selfLearningMetadata || {};
+            const description = meta.description || meta.desc || "No description";
+            const fieldName = meta.field || n.data?.label || n.data?.step?.name || n.id;
+            return `Node "${n.id}" matches Step "${fieldName}": ${description}`;
+        });
+        // List connections
+        for (const edge of graph.edges || []) {
+            const src = nodeMap.get(edge.source);
+            const tgt = nodeMap.get(edge.target);
+            if (src && tgt) {
+                // Resolve friendly names
+                const getFriendlyName = (n) => {
+                    const sId = n.data?.id;
+                    const s = stepIndex ? stepIndex.get(sId) : null;
+                    const m = s?.selfLearningMetadata || n.data?.selfLearningMetadata || {};
+                    return m.field || n.data?.label || n.id;
+                };
+                const srcName = getFriendlyName(src);
+                const tgtName = getFriendlyName(tgt);
+                lines.push(`- Step "${srcName}" (Node ${src.id}) leads to Step "${tgtName}" (Node ${tgt.id})`);
+            }
+        }
+        return `Graph Nodes Detail:\n${nodeDescriptions.join('\n')}\n\nRequired Flow Sequence:\n${lines.length > 0 ? lines.join('\n') : "No specific sequence defined."}`;
+    }
+    _getActionsSummary() {
+        if (!this.automationFiles)
+            return "No automation actions available.";
+        const actions = [];
+        const seen = new Set();
+        for (const file of this.automationFiles) {
+            const steps = file.content?.steps || [];
+            for (const step of steps) {
+                const meta = step.selfLearningMetadata || step.params?.selfLearningMetadata || step.param?.selfLearningMetadata; // Consistent check
+                if (meta) {
+                    // Start of Selection - user requested to use 'action' property if available
+                    if (meta.action) {
+                        const id = step.annotation?.stepId || step.id;
+                        if (!seen.has(id)) {
+                            seen.add(id);
+                            // actions.push({ id: step.annotation.stepId, action: meta.action });
+                            actions.push(`ID: ${id} | Action: ${meta.action} | Description: ${meta.description || 'No description'}`);
+                        }
+                        continue;
+                    }
+                    // End of Selection
+                }
+            }
+        }
+        return actions.slice(0, 300).join('\n') + (actions.length > 300 ? '\n... (more actions truncated)' : '');
+    }
+}
+//# sourceMappingURL=stepByStepAiPlanner.js.map

package/dist/services/stepByStepAiPlanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stepByStepAiPlanner.js","sourceRoot":"","sources":["../../src/services/stepByStepAiPlanner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAE/D,MAAM,OAAO,mBAAoB,SAAQ,SAAS;IAC9C;;;;;OAKG;IACH,YAAY,KAAK,EAAE,UAAU,EAAE,aAAa,GAAG,EAAE,EAAE,eAAe,GAAG,EAAE;QACnE,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,eAAe,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,GAAG,MAAM,EAAE,OAAO,GAAG,EAAE,EAAE,KAAK,GAAG,oBAAoB;QACjF,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAE5E,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAE/D,IAAI,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,oBAAoB,IAAI,SAAS,CAAC,MAAM,EAAE,oBAAoB,IAAI,SAAS,CAAC,KAAK,EAAE,oBAAoB,CAAC;YAC/H,MAAM,gBAAgB,GAAG,IAAI,EAAE,UAAU,IAAI,IAAI,EAAE,QAAQ,IAAI,SAAS,CAAC,QAAQ,IAAI,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC;YAChH,IAAI,gBAAgB,EAAE,CAAC;gBACnB,OAAO,CAAC,GAAG,CAAC,0BAA0B,YAAY,kBAAkB,gBAAgB,yBAAyB,CAAC,CAAC;gBAC/G,YAAY,GAAG,gBAAgB,CAAC;YACpC,CAAC;QACL,CAAC;QACD,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,mCAAmC;QACjF,OAAO,CAAC,GAAG,CAAC,uDAAuD,CAAC,CAAC;QACrE,OAAO,CAAC,GAAG,CAAC,yBAAyB,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEtE,sEAAsE;QACtE,gDAAgD;QAChD,qFAAqF;QACrF,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAEjD,8CAA8C;QAC9C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAC5C,OAAO,EACP,cAAc,EACd,KAAK,CACR,CAAC;QAEF,OAAO,CAAC,GAAG,CAAC,mCAAmC,WAAW,CAAC,MAAM,iBAAiB,CAAC,CAAC;QAEpF,mDAAmD;QACnD,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;YAClC,iDAAiD;YACjD,MAAM,MAAM,GAAG,OAAO,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,EAAE,CAAC,CAAC;YAE7F,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1C,CAAC;iBAAM,CAAC;gBACJ,OAAO,CAAC,IAAI,CAAC,yBAAyB,MAAM,iDAAiD,CAAC,CAAC;YACnG,CAAC;QACL,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,kCAAkC,QAAQ,CAAC,MAAM,aAAa,CAAC,CAAC;QAE5E,mEAAmE;QACnE,6DAA6D;QAC7D,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC1B,uCAAuC;YACvC,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;YAEvB,kFAAkF;YAClF,MAAM,IAAI,GAAG,EAAE,CAAC,oBAAoB,IAAI,EAAE,CAAC,MAAM,EAAE,oBAAoB,IAAI,EAAE,CAAC,KAAK,EAAE,oBAAoB,CAAC;YAC1G,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAClC,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YAC1B,CAAC;YAED,yCAAyC;YACzC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC1D,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9B,EAAE,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,mCAAmC;gBACrE,CAAC;YACL,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QAED,qCAAqC;QACrC,4FAA4F;QAC5F,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAErD,6BAA6B;QAC7B,QAAQ,CAAC,WAAW,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAE3F,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,cAAc,EAAE,KAAK;QAClD,uEAAuE;QACvE,OAAO,CAAC,GAAG,CAAC,0BAA0B,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/D,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC5B,MAAM,YAAY,GAAG;;;;;;;;;;;;;;EAc3B,cAAc;;CAEf,CAAC;QACM,OAAO,CAAC,GAAG,CAAC,mDAAmD,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;QACtF,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAEjL,IAAI,MAAM,GAAG,EAAE,CAAC;QAEhB,6BAA6B;QAC7B,IAAI,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,wCAAwC,CAAC,CAAC;YACtD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC;YAC/C,MAAM,cAAc,GAAG,MAAM,kBAAkB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC3E,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,uDAAuD,EAAE,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC;YACrG,IAAI,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjG,MAAM,GAAG,cAAc,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACJ,OAAO,CAAC,GAAG,CAAC,gDAAgD,EAAE,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC;YAClG,CAAC;QACL,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACT,OAAO,CAAC,IAAI,CAAC,iCAAiC,EAAE,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,2DAA2D;QAC3D,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,+DAA+D,CAAC,CAAC;YAC7E,IAAI,CAAC;gBACD,kCAAkC;gBAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;gBAC5C,IAAI,KAAK,EAAE,CAAC;oBACR,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC3B,cAAc;oBACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;oBACrC,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3C,MAAM,GAAG,MAAM,CAAC;wBAChB,OAAO,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAC;oBACjD,CAAC;gBACL,CAAC;YACL,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACT,OAAO,CAAC,IAAI,CAAC,wBAAwB,EAAE,CAAC,CAAC,CAAC;gBAC1C,qEAAqE;gBACrE,IAAI,CAAC;oBACD,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;oBAC1E,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;wBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;wBACjC,IAAI,MAAM,CAAC,QAAQ;4BAAE,MAAM,GAAG,MAAM,CAAC;oBACzC,CAAC;gBACL,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,cAAc,KAAK,CAAC,MAAM,+BAA+B,CAAC,CAAC;QACvE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,mBAAmB,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAGD,gBAAgB,CAAC,KAAK;QAClB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK;YAAE,OAAO,MAAM,CAAC;QAE1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;YACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,cAAc;gBACd,IAAI,IAAI,CAAC,EAAE;oBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAEvC,+BAA+B;gBAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,MAAM,EAAE,oBAAoB,IAAI,IAAI,CAAC,KAAK,EAAE,oBAAoB,CAAC;gBAChH,IAAI,IAAI,EAAE,CAAC;oBACP,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;oBACrC,IAAI,IAAI;wBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACrC,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;QACzG,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAErJ,MAAM,YAAY,GAAG;;;;iBAIZ,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO;;;2BAGrD,YAAY;;EAErC,YAAY;;;EAGZ,YAAY;;;EAGZ,WAAW,IAAI,gBAAgB;;;EAG/B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;CAyBlB,CAAC;QAEM,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACrF,OAAO,kBAAkB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,eAAe;QACnD,6BAA6B;QAC7B,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,wBAAwB,EAAE,CAAC;QAEzE,IAAI,aAAa,GAAG,YAAY,CAAC;QAEjC,sCAAsC;QACtC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC7E,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;YAC7B,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEpE,IAAI,CAAC,eAAe,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnD,kCAAkC;gBAClC,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC7F,IAAI,OAAO,EAAE,CAAC;oBACV,sDAAsD;oBACtD,0DAA0D;oBAC1D,+BAA+B;gBACnC,CAAC;qBAAM,CAAC;oBACJ,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,SAAS,4CAA4C,EAAE,CAAC;gBACpG,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,oDAAoD;gBACpD,mDAAmD;gBACnD,IAAI,eAAe,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;oBACzC,aAAa,GAAG,YAAY,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACJ,wBAAwB;oBACxB,oFAAoF;oBACpF,gDAAgD;oBAChD,wEAAwE;oBACxE,oFAAoF;oBACpF,qDAAqD;oBACrD,aAAa,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBACvC,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,iBAAiB,IAAI,CAAC,MAAM,mBAAmB,EAAE,CAAC;YACpF,CAAC;YACD,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC;QAChC,CAAC;QAED,iCAAiC;QACjC,gFAAgF;QAChF,iGAAiG;QACjG,IAAI,eAAe,IAAI,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1D,uCAAuC;YACvC,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;YACtH,IAAI,SAAS,EAAE,CAAC;gBACZ,sBAAsB;gBACtB,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC,CAAC;gBACnF;;;;;;;;kBAQE;YACN,CAAC;QACL,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED,gBAAgB;QACZ,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBACf,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;oBACrB,MAAM,CAAC,IAAI,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACnE,CAAC,CAAC,CAAC;YACP,CAAC;QACL,CAAC;QACD,8BAA8B;QAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;gBACnE,MAAM,CAAC,IAAI,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;YACrD,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1G,CAAC;IAED,0BAA0B,CAAC,KAAK,EAAE,SAAS;QACvC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK;YAAE,OAAO,gCAAgC,CAAC;QAEpE,kCAAkC;QAClC,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzD,sDAAsD;QACtD,MAAM,gBAAgB,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACzC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,qCAAqC;YACpE,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAEtD,MAAM,IAAI,GAAG,IAAI,EAAE,oBAAoB,IAAI,CAAC,CAAC,IAAI,EAAE,oBAAoB,IAAI,EAAE,CAAC;YAC9E,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,gBAAgB,CAAC;YACtE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YAE5E,OAAO,SAAS,CAAC,CAAC,EAAE,mBAAmB,SAAS,MAAM,WAAW,EAAE,CAAC;QACxE,CAAC,CAAC,CAAC;QAEH,mBAAmB;QACnB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;gBACb,yBAAyB;gBACzB,MAAM,eAAe,GAAG,CAAC,CAAC,EAAE,EAAE;oBAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;oBACvB,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBAChD,MAAM,CAAC,GAAG,CAAC,EAAE,oBAAoB,IAAI,CAAC,CAAC,IAAI,EAAE,oBAAoB,IAAI,EAAE,CAAC;oBACxE,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC5C,CAAC,CAAC;gBAEF,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;gBACrC,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;gBAErC,KAAK,CAAC,IAAI,CAAC,WAAW,OAAO,WAAW,GAAG,CAAC,EAAE,oBAAoB,OAAO,WAAW,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YACnG,CAAC;QACL,CAAC;QAED,OAAO,wBAAwB,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,gCAAgC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,+BAA+B,EAAE,CAAC;IACtK,CAAC;IAED,kBAAkB;QACd,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO,kCAAkC,CAAC;QAErE,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;YACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,MAAM,EAAE,oBAAoB,IAAI,IAAI,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC,mBAAmB;gBACpI,IAAI,IAAI,EAAE,CAAC;oBACP,4EAA4E;oBAC5E,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;wBACd,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;wBAC9C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;4BAChB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;4BACb,qEAAqE;4BACrE,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,IAAI,CAAC,MAAM,mBAAmB,IAAI,CAAC,WAAW,IAAI,gBAAgB,EAAE,CAAC,CAAC;wBAC9G,CAAC;wBACD,SAAS;oBACb,CAAC;oBACD,mBAAmB;gBACvB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7G,CAAC;CACJ"}

package/dist/services/test-genjs.js

@@ -0,0 +1,39 @@
+import { generateJsTransformFromPrompt } from "./generateJsTransformFromPrompt.js";
+const { code, transform, attempts } = await generateJsTransformFromPrompt({
+    model: 'meta-llama/llama-4-maverick-17b-128e-instruct',
+    prompt: "Given an array of {name,sizeKB}, return { top3: largest by sizeKB desc, totalKB }",
+    inputSchema: {
+        type: "array",
+        items: {
+            type: "object",
+            additionalProperties: false,
+            required: ["name", "sizeKB"],
+            properties: { name: { type: "string" }, sizeKB: { type: "number" } }
+        }
+    },
+    outputSchema: {
+        type: "object", additionalProperties: false,
+        required: ["top3", "totalKB"],
+        properties: {
+            top3: {
+                type: "array", items: {
+                    type: "object", additionalProperties: false,
+                    required: ["name", "sizeKB"],
+                    properties: { name: { type: "string" }, sizeKB: { type: "number" } }
+                }
+            },
+            totalKB: { type: "number" }
+        }
+    },
+    examples: [
+        {
+            input: [{ name: "a", sizeKB: 2 }, { name: "b", sizeKB: 5 }, { name: "c", sizeKB: 1 }],
+            output: { top3: [{ name: "b", sizeKB: 5 }, { name: "a", sizeKB: 2 }, { name: "c", sizeKB: 1 }], totalKB: 8 }
+        }
+    ],
+    retries: 2,
+    verbose: true
+});
+console.log(`Generated in ${attempts} attempt(s)`);
+console.log(code);
+console.log(await transform([{ name: "x", sizeKB: 4 }, { name: "y", sizeKB: 9 }, { name: "z", sizeKB: 1 }]));

package/dist/services/test-genjs.manual-test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=test-genjs.manual-test.d.ts.map

package/dist/services/test-genjs.manual-test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-genjs.manual-test.d.ts","sourceRoot":"","sources":["../../src/services/test-genjs.manual-test.ts"],"names":[],"mappings":""}

package/dist/services/test-genjs.manual-test.js

@@ -0,0 +1,40 @@
+import { generateJsTransformFromPrompt } from "./generateJsTransformFromPrompt.js";
+const { code, transform, attempts } = await generateJsTransformFromPrompt({
+    model: 'meta-llama/llama-4-maverick-17b-128e-instruct',
+    prompt: "Given an array of {name,sizeKB}, return { top3: largest by sizeKB desc, totalKB }",
+    inputSchema: {
+        type: "array",
+        items: {
+            type: "object",
+            additionalProperties: false,
+            required: ["name", "sizeKB"],
+            properties: { name: { type: "string" }, sizeKB: { type: "number" } }
+        }
+    },
+    outputSchema: {
+        type: "object", additionalProperties: false,
+        required: ["top3", "totalKB"],
+        properties: {
+            top3: {
+                type: "array", items: {
+                    type: "object", additionalProperties: false,
+                    required: ["name", "sizeKB"],
+                    properties: { name: { type: "string" }, sizeKB: { type: "number" } }
+                }
+            },
+            totalKB: { type: "number" }
+        }
+    },
+    examples: [
+        {
+            input: [{ name: "a", sizeKB: 2 }, { name: "b", sizeKB: 5 }, { name: "c", sizeKB: 1 }],
+            output: { top3: [{ name: "b", sizeKB: 5 }, { name: "a", sizeKB: 2 }, { name: "c", sizeKB: 1 }], totalKB: 8 }
+        }
+    ],
+    retries: 2,
+    verbose: true
+});
+console.log(`Generated in ${attempts} attempt(s)`);
+console.log(code);
+console.log(await transform([{ name: "x", sizeKB: 4 }, { name: "y", sizeKB: 9 }, { name: "z", sizeKB: 1 }]));
+//# sourceMappingURL=test-genjs.manual-test.js.map

package/dist/services/test-genjs.manual-test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-genjs.manual-test.js","sourceRoot":"","sources":["../../src/services/test-genjs.manual-test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,6BAA6B,EAAE,MAAM,oCAAoC,CAAC;AAEnF,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,MAAM,6BAA6B,CAAC;IACtE,KAAK,EAAE,+CAA+C;IACtD,MAAM,EAAE,mFAAmF;IAC3F,WAAW,EAAE;QACT,IAAI,EAAE,OAAO;QACb,KAAK,EAAE;YACH,IAAI,EAAE,QAAQ;YACd,oBAAoB,EAAE,KAAK;YAC3B,QAAQ,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC;YAC5B,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;SACvE;KACJ;IACD,YAAY,EAAE;QACV,IAAI,EAAE,QAAQ,EAAE,oBAAoB,EAAE,KAAK;QAC3C,QAAQ,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC;QAC7B,UAAU,EAAE;YACR,IAAI,EAAE;gBACF,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE;oBAClB,IAAI,EAAE,QAAQ,EAAE,oBAAoB,EAAE,KAAK;oBAC3C,QAAQ,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC;oBAC5B,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;iBACvE;aACJ;YACD,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;SAC9B;KACJ;IACD,QAAQ,EAAE;QACN;YACI,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YACrF,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;SAC/G;KACJ;IACD,OAAO,EAAE,CAAC;IACV,OAAO,EAAE,IAAI;CAChB,CAAC,CAAC;AAEH,OAAO,CAAC,GAAG,CAAC,gBAAgB,QAAQ,aAAa,CAAC,CAAC;AACnD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAClB,OAAO,CAAC,GAAG,CAAC,MAAM,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC"}

package/dist/services/uiMapPathFinder.d.ts

@@ -0,0 +1,13 @@
+export declare class UiMapPathFinder {
+    constructor(uiMap: any);
+    _buildAdjacencyList(): void;
+    /**
+     * Finds the shortest path from startStateId to a destination (state ID or field name).
+     * @param {string} startStateId
+     * @param {string} destination
+     * @param {string} [targetStateId] - Optional: Specific state ID if destination is a field
+     * @returns {Array<any>|null} Array of edges representing the path, or null if not found.
+     */
+    findPath(startStateId: any, destination: any, targetStateId?: any): any[];
+}
+//# sourceMappingURL=uiMapPathFinder.d.ts.map

package/dist/services/uiMapPathFinder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uiMapPathFinder.d.ts","sourceRoot":"","sources":["../../src/services/uiMapPathFinder.ts"],"names":[],"mappings":"AACA,qBAAa,eAAe;gBACd,KAAK,KAAA;IAMjB,mBAAmB;IAUnB;;;;;;OAMG;IACH,QAAQ,CAAC,YAAY,KAAA,EAAE,WAAW,KAAA,EAAE,aAAa,MAAO;CA+DzD"}

package/dist/services/uiMapPathFinder.js

@@ -0,0 +1,79 @@
+export class UiMapPathFinder {
+    constructor(uiMap) {
+        this.uiMap = uiMap;
+        this.adjacencyList = {};
+        this._buildAdjacencyList();
+    }
+    _buildAdjacencyList() {
+        for (const edgeId in this.uiMap.edges) {
+            const edge = this.uiMap.edges[edgeId];
+            if (!this.adjacencyList[edge.from]) {
+                this.adjacencyList[edge.from] = [];
+            }
+            this.adjacencyList[edge.from].push(edge);
+        }
+    }
+    /**
+     * Finds the shortest path from startStateId to a destination (state ID or field name).
+     * @param {string} startStateId
+     * @param {string} destination
+     * @param {string} [targetStateId] - Optional: Specific state ID if destination is a field
+     * @returns {Array<any>|null} Array of edges representing the path, or null if not found.
+     */
+    findPath(startStateId, destination, targetStateId = null) {
+        const targetStateIds = new Set();
+        if (targetStateId) {
+            const state = this.uiMap.states[targetStateId];
+            if (state) {
+                // If destination matches the state ID, or if the state contains the destination as a field
+                const hasField = Array.isArray(state.fields)
+                    ? state.fields.some(f => (f.name === destination || f.field === destination))
+                    : (state.fields && state.fields[destination]);
+                if (destination === targetStateId || hasField) {
+                    targetStateIds.add(targetStateId);
+                }
+            }
+        }
+        else {
+            // Is destination a state?
+            if (this.uiMap.states[destination]) {
+                targetStateIds.add(destination);
+            }
+            // Is destination a field? (Search all states)
+            for (const stateId in this.uiMap.states) {
+                const state = this.uiMap.states[stateId];
+                const hasField = Array.isArray(state.fields)
+                    ? state.fields.some(f => (f.name === destination || f.field === destination))
+                    : (state.fields && state.fields[destination]);
+                if (hasField) {
+                    targetStateIds.add(stateId);
+                }
+            }
+        }
+        if (targetStateIds.size === 0)
+            return null;
+        // BFS
+        const queue = [{ stateId: startStateId, path: [] }];
+        const visited = new Set();
+        visited.add(startStateId);
+        while (queue.length > 0) {
+            const { stateId, path } = queue.shift();
+            // Check if we reached a target state
+            if (targetStateIds.has(stateId)) {
+                return path;
+            }
+            const neighbors = this.adjacencyList[stateId] || [];
+            for (const edge of neighbors) {
+                if (!visited.has(edge.to)) {
+                    visited.add(edge.to);
+                    queue.push({
+                        stateId: edge.to,
+                        path: [...path, edge]
+                    });
+                }
+            }
+        }
+        return null;
+    }
+}
+//# sourceMappingURL=uiMapPathFinder.js.map

package/dist/services/uiMapPathFinder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"uiMapPathFinder.js","sourceRoot":"","sources":["../../src/services/uiMapPathFinder.ts"],"names":[],"mappings":"AACA,MAAM,OAAO,eAAe;IAC1B,YAAY,KAAK;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,mBAAmB,EAAE,CAAC;IAC7B,CAAC;IAED,mBAAmB;QACjB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YACrC,CAAC;YACD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,YAAY,EAAE,WAAW,EAAE,aAAa,GAAG,IAAI;QACtD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QAEjC,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YAC/C,IAAI,KAAK,EAAE,CAAC;gBACV,2FAA2F;gBAC3F,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC;oBACxC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAC;oBAC7E,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;gBAElD,IAAI,WAAW,KAAK,aAAa,IAAI,QAAQ,EAAE,CAAC;oBAC9C,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,0BAA0B;YAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;gBACnC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAClC,CAAC;YAED,8CAA8C;YAC9C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC;oBACxC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAC;oBAC7E,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;gBAElD,IAAI,QAAQ,EAAE,CAAC;oBACb,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE3C,MAAM;QACN,MAAM,KAAK,GAAG,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAExC,qCAAqC;YACrC,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC;YACd,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACpD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC;wBACT,OAAO,EAAE,IAAI,CAAC,EAAE;wBAChB,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC;qBACtB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}