mcp4openapi 0.2.8 → 0.3.1

package/dist/src/tooling/composite-executor.d.ts

@@ -0,0 +1,77 @@
+/**
+ * Composite action executor for chaining API calls
+ *
+ * Why: Reduces roundtrips by fetching related data in sequence (e.g., MR + comments).
+ * Aggregates results into single JSON structure as defined by store_as paths.
+ */
+import type { CompositeStep } from '../types/profile.js';
+import type { HttpClient } from '../transport/interceptors.js';
+import { OpenAPIParser } from '../openapi/openapi-parser.js';
+export interface CompositeResult {
+    data: Record<string, unknown>;
+    completed_steps: number;
+    total_steps: number;
+    errors?: StepError[];
+}
+export interface StepError {
+    step_index: number;
+    step_call: string;
+    error: string;
+    timestamp: string;
+}
+export declare class CompositeExecutor {
+    private parser;
+    private httpClient?;
+    private parameterAliases;
+    constructor(parser: OpenAPIParser, httpClient?: HttpClient | undefined, parameterAliases?: Record<string, string[]>);
+    /**
+     * Execute a series of API calls and merge results
+     *
+     * Why parallel: Steps may have dependencies, but independent steps can run concurrently.
+     * Uses DAG analysis to determine safe parallelization while maintaining correctness.
+     *
+     * Supports partial results: If allowPartial=true, continues after errors and returns
+     * what was completed. Useful for composite actions where some data is better than none.
+     */
+    execute(steps: CompositeStep[], args: Record<string, unknown>, allowPartial?: boolean, httpClient?: HttpClient): Promise<CompositeResult>;
+    /**
+     * Execute single composite step (extracted for parallel execution)
+     *
+     * @param step The composite step to execute
+     * @param stepIndex Original index for error reporting
+     * @param args Arguments for parameter substitution
+     * @param httpClient Optional HTTP client override
+     * @returns Promise resolving to HTTP response
+     */
+    private executeStep;
+    /**
+     * Parse composite step call syntax
+     *
+     * Format: "GET /projects/{id}/merge_requests/{iid}"
+     */
+    private parseCall;
+    /**
+     * Resolve path template with actual values
+     *
+     * Example: "/projects/{id}" + {id: "123"} => "/projects/123"
+     * Supports parameter_aliases: {project_id: "123"} can map to {id} if configured
+     */
+    private resolvePath;
+    /**
+     * Extract query parameters from args based on operation definition
+     */
+    private extractQueryParams;
+    /**
+     * Store value at JSONPath-like location
+     *
+     * Why nested: Allows semantic structure (comments belong under merge_request object).
+     *
+     * Examples:
+     * - "merge_request" => { merge_request: value }
+     * - "merge_request.comments" => { merge_request: { comments: value } }
+     *
+     * Validates path navigation to prevent overwriting non-object values.
+     */
+    private storeResult;
+}
+//# sourceMappingURL=composite-executor.d.ts.map

package/dist/src/tooling/composite-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"composite-executor.d.ts","sourceRoot":"","sources":["../../../src/tooling/composite-executor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAE/D,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAI7D,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,SAAS;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,qBAAa,iBAAiB;IAE1B,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,UAAU,CAAC;IACnB,OAAO,CAAC,gBAAgB;gBAFhB,MAAM,EAAE,aAAa,EACrB,UAAU,CAAC,EAAE,UAAU,YAAA,EACvB,gBAAgB,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAM;IAGzD;;;;;;;;OAQG;IACG,OAAO,CACX,KAAK,EAAE,aAAa,EAAE,EACtB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,YAAY,GAAE,OAAe,EAC7B,UAAU,CAAC,EAAE,UAAU,GACtB,OAAO,CAAC,eAAe,CAAC;IA+D3B;;;;;;;;OAQG;YACW,WAAW;IA6BzB;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAQjB;;;;;OAKG;IACH,OAAO,CAAC,WAAW;IAsBnB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAkB1B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,WAAW;CAwCpB"}

package/dist/src/tooling/composite-executor.js

@@ -0,0 +1,198 @@
+/**
+ * Composite action executor for chaining API calls
+ *
+ * Why: Reduces roundtrips by fetching related data in sequence (e.g., MR + comments).
+ * Aggregates results into single JSON structure as defined by store_as paths.
+ */
+import { DAGExecutor } from './dag-executor.js';
+import { isSafePropertyName } from '../validation/validation-utils.js';
+export class CompositeExecutor {
+    constructor(parser, httpClient, parameterAliases = {}) {
+        this.parser = parser;
+        this.httpClient = httpClient;
+        this.parameterAliases = parameterAliases;
+    }
+    /**
+     * Execute a series of API calls and merge results
+     *
+     * Why parallel: Steps may have dependencies, but independent steps can run concurrently.
+     * Uses DAG analysis to determine safe parallelization while maintaining correctness.
+     *
+     * Supports partial results: If allowPartial=true, continues after errors and returns
+     * what was completed. Useful for composite actions where some data is better than none.
+     */
+    async execute(steps, args, allowPartial = false, httpClient) {
+        // Analyze DAG and get execution levels
+        const executionLevels = DAGExecutor.topologicalSort(steps);
+        const result = {};
+        const errors = [];
+        let completedSteps = 0;
+        // Execute level by level (each level can run in parallel)
+        for (const level of executionLevels) {
+            // Execute all steps in current level concurrently
+            const levelPromises = level.steps.map((step, levelIndex) => this.executeStep(step, level.stepIndices[levelIndex], args, httpClient));
+            // Wait for all steps in this level to complete
+            const levelResults = await Promise.allSettled(levelPromises);
+            // Process results
+            for (let i = 0; i < levelResults.length; i++) {
+                const promiseResult = levelResults[i];
+                const step = level.steps[i];
+                const originalStepIndex = level.stepIndices[i];
+                if (promiseResult.status === 'fulfilled') {
+                    // Step completed successfully
+                    const response = promiseResult.value;
+                    this.storeResult(result, step.store_as, response.body);
+                    completedSteps++;
+                }
+                else {
+                    // Step failed
+                    const error = promiseResult.reason;
+                    const stepError = {
+                        step_index: originalStepIndex,
+                        step_call: step.call,
+                        error: error instanceof Error ? error.message : String(error),
+                        timestamp: new Date().toISOString(),
+                    };
+                    errors.push(stepError);
+                    // Store error in result for debugging
+                    this.storeResult(result, `${step.store_as}_error`, stepError);
+                    if (!allowPartial) {
+                        throw new Error(`Composite step ${originalStepIndex + 1}/${steps.length} failed: ${stepError.error}\n` +
+                            `Completed steps: ${completedSteps}\n` +
+                            `Failed step: ${step.call}`);
+                    }
+                }
+            }
+        }
+        return {
+            data: result,
+            completed_steps: completedSteps,
+            total_steps: steps.length,
+            errors: errors.length > 0 ? errors : undefined,
+        };
+    }
+    /**
+     * Execute single composite step (extracted for parallel execution)
+     *
+     * @param step The composite step to execute
+     * @param stepIndex Original index for error reporting
+     * @param args Arguments for parameter substitution
+     * @param httpClient Optional HTTP client override
+     * @returns Promise resolving to HTTP response
+     */
+    async executeStep(step, stepIndex, args, httpClient) {
+        const { method, path, operation } = this.parseCall(step.call);
+        if (!operation) {
+            throw new Error(`Operation not found for call: ${step.call}`);
+        }
+        // Substitute path parameters from args
+        const resolvedPath = this.resolvePath(path, args);
+        // Execute request
+        const client = httpClient || this.httpClient;
+        if (!client) {
+            throw new Error('HTTP client not provided');
+        }
+        const response = await client.request(method, resolvedPath, {
+            params: this.extractQueryParams(operation, args),
+            operationId: operation.operationId,
+        });
+        return response;
+    }
+    /**
+     * Parse composite step call syntax
+     *
+     * Format: "GET /projects/{id}/merge_requests/{iid}"
+     */
+    parseCall(call) {
+        const [method, path] = call.split(' ');
+        const pathInfo = this.parser.getPath(path);
+        const operation = pathInfo?.operations[method.toLowerCase()];
+        return { method, path, operation };
+    }
+    /**
+     * Resolve path template with actual values
+     *
+     * Example: "/projects/{id}" + {id: "123"} => "/projects/123"
+     * Supports parameter_aliases: {project_id: "123"} can map to {id} if configured
+     */
+    resolvePath(template, args) {
+        return template.replace(/\{(\w+)\}/g, (_, key) => {
+            // Try direct match first
+            if (args[key] !== undefined) {
+                return encodeURIComponent(String(args[key]));
+            }
+            // Try aliases from profile
+            const possibleAliases = this.parameterAliases[key] || [];
+            for (const alias of possibleAliases) {
+                if (args[alias] !== undefined) {
+                    return encodeURIComponent(String(args[alias]));
+                }
+            }
+            throw new Error(`Missing path parameter: ${key}` +
+                (possibleAliases.length > 0 ? `. Tried aliases: ${possibleAliases.join(', ')}` : ''));
+        });
+    }
+    /**
+     * Extract query parameters from args based on operation definition
+     */
+    extractQueryParams(operation, args) {
+        const params = {};
+        for (const param of operation.parameters) {
+            if (param.in === 'query' && args[param.name] !== undefined) {
+                const value = args[param.name];
+                // Pass arrays as-is for HttpClient serialization
+                if (Array.isArray(value)) {
+                    params[param.name] = value.map(String);
+                }
+                else {
+                    params[param.name] = String(value);
+                }
+            }
+        }
+        return params;
+    }
+    /**
+     * Store value at JSONPath-like location
+     *
+     * Why nested: Allows semantic structure (comments belong under merge_request object).
+     *
+     * Examples:
+     * - "merge_request" => { merge_request: value }
+     * - "merge_request.comments" => { merge_request: { comments: value } }
+     *
+     * Validates path navigation to prevent overwriting non-object values.
+     */
+    storeResult(target, path, value) {
+        const parts = path.split('.');
+        let current = target;
+        for (let i = 0; i < parts.length - 1; i++) {
+            const part = parts[i];
+            // Prevent prototype pollution
+            if (!isSafePropertyName(part)) {
+                throw new Error(`Invalid property name in path: ${part}`);
+            }
+            const existing = current[part];
+            // Validate we can navigate through this path
+            if (existing !== undefined && (typeof existing !== 'object' || existing === null)) {
+                throw new Error(`Cannot store at path '${path}': ` +
+                    `'${parts.slice(0, i + 1).join('.')}' is ${typeof existing}, not an object`);
+            }
+            if (!current[part]) {
+                // nosemgrep: javascript.lang.security.audit.prototype-pollution.prototype-pollution-loop.prototype-pollution-loop
+                // Guarded by isSafePropertyName(part) above; safe dynamic key after validation.
+                current[part] = {};
+            }
+            // nosemgrep: javascript.lang.security.audit.prototype-pollution.prototype-pollution-loop.prototype-pollution-loop
+            // Guarded by isSafePropertyName(part) above; safe dynamic key after validation.
+            current = current[part];
+        }
+        const finalKey = parts[parts.length - 1];
+        if (!isSafePropertyName(finalKey)) {
+            throw new Error(`Invalid property name in path: ${finalKey}`);
+        }
+        // codeql[js/prototype-pollution-utility]
+        // Guarded by isSafePropertyName above.
+        current[finalKey] = value;
+    }
+}
+//# sourceMappingURL=composite-executor.js.map

package/dist/src/tooling/composite-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"composite-executor.js","sourceRoot":"","sources":["../../../src/tooling/composite-executor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,EAAE,WAAW,EAAuB,MAAM,mBAAmB,CAAC;AACrE,OAAO,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AAgBvE,MAAM,OAAO,iBAAiB;IAC5B,YACU,MAAqB,EACrB,UAAuB,EACvB,mBAA6C,EAAE;QAF/C,WAAM,GAAN,MAAM,CAAe;QACrB,eAAU,GAAV,UAAU,CAAa;QACvB,qBAAgB,GAAhB,gBAAgB,CAA+B;IACtD,CAAC;IAEJ;;;;;;;;OAQG;IACH,KAAK,CAAC,OAAO,CACX,KAAsB,EACtB,IAA6B,EAC7B,eAAwB,KAAK,EAC7B,UAAuB;QAEvB,uCAAuC;QACvC,MAAM,eAAe,GAAG,WAAW,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAE3D,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,0DAA0D;QAC1D,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,kDAAkD;YAClD,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,CACzD,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CACxE,CAAC;YAEF,+CAA+C;YAC/C,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YAE7D,kBAAkB;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,iBAAiB,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAE/C,IAAI,aAAa,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBACzC,8BAA8B;oBAC9B,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC;oBACrC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;oBACvD,cAAc,EAAE,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,cAAc;oBACd,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC;oBACnC,MAAM,SAAS,GAAc;wBAC3B,UAAU,EAAE,iBAAiB;wBAC7B,SAAS,EAAE,IAAI,CAAC,IAAI;wBACpB,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;wBAC7D,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;qBACpC,CAAC;oBAEF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAEvB,sCAAsC;oBACtC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,QAAQ,EAAE,SAAS,CAAC,CAAC;oBAE9D,IAAI,CAAC,YAAY,EAAE,CAAC;wBAClB,MAAM,IAAI,KAAK,CACb,kBAAkB,iBAAiB,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,YAAY,SAAS,CAAC,KAAK,IAAI;4BACtF,oBAAoB,cAAc,IAAI;4BACtC,gBAAgB,IAAI,CAAC,IAAI,EAAE,CAC5B,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI,EAAE,MAAM;YACZ,eAAe,EAAE,cAAc;YAC/B,WAAW,EAAE,KAAK,CAAC,MAAM;YACzB,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;SAC/C,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,WAAW,CACvB,IAAmB,EACnB,SAAiB,EACjB,IAA6B,EAC7B,UAAuB;QAEvB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAED,uCAAuC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAElD,kBAAkB;QAClB,MAAM,MAAM,GAAG,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC;QAC7C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,EAAE;YAC1D,MAAM,EAAE,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC;YAChD,WAAW,EAAE,SAAS,CAAC,WAAW;SACnC,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,SAAS,CAAC,IAAY;QAC5B,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAE7D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,QAAgB,EAAE,IAA6B;QACjE,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YAC/C,yBAAyB;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC5B,OAAO,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;YAED,2BAA2B;YAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACzD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;gBACpC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,SAAS,EAAE,CAAC;oBAC9B,OAAO,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;YAED,MAAM,IAAI,KAAK,CACb,2BAA2B,GAAG,EAAE;gBAChC,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACrF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,SAAwB,EAAE,IAA6B;QAChF,MAAM,MAAM,GAAsC,EAAE,CAAC;QAErD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/B,iDAAiD;gBACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;oBACzB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACzC,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACK,WAAW,CAAC,MAA+B,EAAE,IAAY,EAAE,KAAc;QAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,OAAO,GAAG,MAAiC,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,8BAA8B;YAC9B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,EAAE,CAAC,CAAC;YAC5D,CAAC;YAED,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAE/B,6CAA6C;YAC7C,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;gBAClF,MAAM,IAAI,KAAK,CACb,yBAAyB,IAAI,KAAK;oBAClC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,OAAO,QAAQ,iBAAiB,CAC5E,CAAC;YACJ,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnB,kHAAkH;gBAClH,gFAAgF;gBAChF,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YACrB,CAAC;YACD,kHAAkH;YAClH,gFAAgF;YAChF,OAAO,GAAG,OAAO,CAAC,IAAI,CAA4B,CAAC;QACrD,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,kCAAkC,QAAQ,EAAE,CAAC,CAAC;QAChE,CAAC;QACD,yCAAyC;QACzC,uCAAuC;QACvC,OAAO,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;CACF"}

package/dist/src/tooling/dag-executor.d.ts

@@ -0,0 +1,49 @@
+/**
+ * DAG Execution Engine for Composite Steps
+ *
+ * Why: Enables parallel execution of independent composite steps
+ * while maintaining correct dependency order.
+ *
+ * Uses Kahn's algorithm for topological sorting - BFS-based approach
+ * that detects cycles and determines execution levels.
+ */
+import type { CompositeStep } from '../types/profile.js';
+/**
+ * Execution level containing steps that can run in parallel
+ */
+export interface ExecutionLevel {
+    steps: CompositeStep[];
+    stepIndices: number[];
+}
+/**
+ * Topological sort result for DAG execution
+ */
+export interface TopologicalSortResult {
+    levels: ExecutionLevel[];
+    hasCycles: boolean;
+    errorMessage?: string;
+}
+/**
+ * Execute composite steps with DAG-based parallelization
+ *
+ * Why: Some steps may depend on others (e.g., get MR ID, then fetch comments).
+ * Independent steps can run in parallel for better performance.
+ */
+export declare class DAGExecutor {
+    /**
+     * Sort composite steps into execution levels using Kahn's algorithm
+     *
+     * @param steps Composite steps with optional depends_on
+     * @returns Execution levels where each level can run in parallel
+     * @throws Error if cycles detected or invalid dependencies
+     */
+    static topologicalSort(steps: CompositeStep[]): ExecutionLevel[];
+    /**
+     * Analyze DAG structure without throwing
+     *
+     * @param steps Composite steps to analyze
+     * @returns Analysis result with levels or error info
+     */
+    static analyzeDAG(steps: CompositeStep[]): TopologicalSortResult;
+}
+//# sourceMappingURL=dag-executor.d.ts.map

package/dist/src/tooling/dag-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag-executor.d.ts","sourceRoot":"","sources":["../../../src/tooling/dag-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEzD;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,SAAS,EAAE,OAAO,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,qBAAa,WAAW;IACtB;;;;;;OAMG;IACH,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,cAAc,EAAE;IAQhE;;;;;OAKG;IACH,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,qBAAqB;CAoHjE"}

package/dist/src/tooling/dag-executor.js

@@ -0,0 +1,138 @@
+/**
+ * DAG Execution Engine for Composite Steps
+ *
+ * Why: Enables parallel execution of independent composite steps
+ * while maintaining correct dependency order.
+ *
+ * Uses Kahn's algorithm for topological sorting - BFS-based approach
+ * that detects cycles and determines execution levels.
+ */
+/**
+ * Execute composite steps with DAG-based parallelization
+ *
+ * Why: Some steps may depend on others (e.g., get MR ID, then fetch comments).
+ * Independent steps can run in parallel for better performance.
+ */
+export class DAGExecutor {
+    /**
+     * Sort composite steps into execution levels using Kahn's algorithm
+     *
+     * @param steps Composite steps with optional depends_on
+     * @returns Execution levels where each level can run in parallel
+     * @throws Error if cycles detected or invalid dependencies
+     */
+    static topologicalSort(steps) {
+        const result = this.analyzeDAG(steps);
+        if (result.hasCycles) {
+            throw new Error(`DAG analysis failed: ${result.errorMessage}`);
+        }
+        return result.levels;
+    }
+    /**
+     * Analyze DAG structure without throwing
+     *
+     * @param steps Composite steps to analyze
+     * @returns Analysis result with levels or error info
+     */
+    static analyzeDAG(steps) {
+        // Build dependency graph and in-degree map
+        const graph = new Map(); // node -> list of dependent nodes
+        const inDegree = new Map();
+        // Initialize all nodes
+        for (const step of steps) {
+            const node = step.store_as;
+            inDegree.set(node, 0);
+            if (!graph.has(node)) {
+                graph.set(node, []);
+            }
+        }
+        // Build edges and calculate in-degrees
+        for (const step of steps) {
+            if (step.depends_on) {
+                for (const dep of step.depends_on) {
+                    // Validate dependency exists
+                    if (!inDegree.has(dep)) {
+                        return {
+                            levels: [],
+                            hasCycles: true,
+                            errorMessage: `Step '${step.store_as}' depends on '${dep}' but no step produces '${dep}'`
+                        };
+                    }
+                    // Add edge: dep -> step.store_as
+                    if (!graph.has(dep)) {
+                        graph.set(dep, []);
+                    }
+                    graph.get(dep).push(step.store_as);
+                    // Increase in-degree of dependent step
+                    inDegree.set(step.store_as, inDegree.get(step.store_as) + 1);
+                }
+            }
+        }
+        // Kahn's algorithm: BFS with in-degree
+        const levels = [];
+        const queue = [];
+        // Start with nodes having in-degree 0 (no dependencies)
+        for (const [node, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(node);
+            }
+        }
+        // Process queue level by level
+        while (queue.length > 0) {
+            const currentLevel = [];
+            const currentIndices = [];
+            const levelSize = queue.length;
+            // Process all nodes at current level (can run in parallel)
+            for (let i = 0; i < levelSize; i++) {
+                const node = queue.shift();
+                // Find corresponding step and add to level
+                const stepIndex = steps.findIndex(s => s.store_as === node);
+                if (stepIndex >= 0) {
+                    currentLevel.push(steps[stepIndex]);
+                    currentIndices.push(stepIndex);
+                }
+                // Decrease in-degree of all dependent nodes
+                const neighbors = graph.get(node) || [];
+                for (const neighbor of neighbors) {
+                    const newDegree = inDegree.get(neighbor) - 1;
+                    inDegree.set(neighbor, newDegree);
+                    // If in-degree becomes 0, add to next level
+                    if (newDegree === 0) {
+                        queue.push(neighbor);
+                    }
+                }
+            }
+            // Add level if it contains steps
+            if (currentLevel.length > 0) {
+                levels.push({ steps: currentLevel, stepIndices: currentIndices });
+            }
+        }
+        // Check for cycles: if not all nodes were processed
+        const processedCount = levels.reduce((sum, level) => sum + level.steps.length, 0);
+        if (processedCount !== steps.length) {
+            // Find unprocessed nodes (part of cycle)
+            const processedNodes = new Set();
+            for (const level of levels) {
+                for (const step of level.steps) {
+                    processedNodes.add(step.store_as);
+                }
+            }
+            const cycleNodes = [];
+            for (const step of steps) {
+                if (!processedNodes.has(step.store_as)) {
+                    cycleNodes.push(step.store_as);
+                }
+            }
+            return {
+                levels: [],
+                hasCycles: true,
+                errorMessage: `Circular dependency detected involving: ${cycleNodes.join(', ')}`
+            };
+        }
+        return {
+            levels,
+            hasCycles: false
+        };
+    }
+}
+//# sourceMappingURL=dag-executor.js.map

package/dist/src/tooling/dag-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag-executor.js","sourceRoot":"","sources":["../../../src/tooling/dag-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAqBH;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IACtB;;;;;;OAMG;IACH,MAAM,CAAC,eAAe,CAAC,KAAsB;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,wBAAwB,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,UAAU,CAAC,KAAsB;QACtC,2CAA2C;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,kCAAkC;QAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBAClC,6BAA6B;oBAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACvB,OAAO;4BACL,MAAM,EAAE,EAAE;4BACV,SAAS,EAAE,IAAI;4BACf,YAAY,EAAE,SAAS,IAAI,CAAC,QAAQ,iBAAiB,GAAG,2BAA2B,GAAG,GAAG;yBAC1F,CAAC;oBACJ,CAAC;oBAED,iCAAiC;oBACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACpB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBACrB,CAAC;oBACD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAEpC,uCAAuC;oBACvC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,wDAAwD;QACxD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,YAAY,GAAoB,EAAE,CAAC;YACzC,MAAM,cAAc,GAAa,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;YAE/B,2DAA2D;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAE5B,2CAA2C;gBAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC;gBAC5D,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;oBACnB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;oBACpC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACjC,CAAC;gBAED,4CAA4C;gBAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAC;oBAC9C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;oBAElC,4CAA4C;oBAC5C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;wBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,iCAAiC;YACjC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClF,IAAI,cAAc,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YACpC,yCAAyC;YACzC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC/B,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACvC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,OAAO;gBACL,MAAM,EAAE,EAAE;gBACV,SAAS,EAAE,IAAI;gBACf,YAAY,EAAE,2CAA2C,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACjF,CAAC;QACJ,CAAC;QAED,OAAO;YACL,MAAM;YACN,SAAS,EAAE,KAAK;SACjB,CAAC;IACJ,CAAC;CACF"}

package/dist/src/tooling/proxy-executor.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Proxy download executor for fetching binary content through API
+ *
+ * Why: LLM needs file content but URLs require authentication.
+ * This executor fetches metadata, extracts URL, downloads content,
+ * and returns base64-encoded result.
+ */
+import type { ProxyDownloadOperation } from '../types/profile.js';
+import type { ResponseContext, AuthCredentials } from '../transport/interceptors.js';
+export interface DebugLogger {
+    debug(message: string, context?: Record<string, unknown>): void;
+    warn?(message: string, context?: Record<string, unknown>): void;
+}
+export interface HttpClient {
+    request(method: string, url: string, options?: {
+        headers?: Record<string, string>;
+        body?: unknown;
+    }): Promise<ResponseContext>;
+    getBaseUrl(): string;
+}
+export interface ProxyDownloadResult {
+    /** Original metadata from API */
+    metadata: Record<string, unknown>;
+    /** Base64-encoded file content */
+    content: string;
+    /** MIME type of the file */
+    mimeType: string;
+    /** File size in bytes */
+    size: number;
+    /** Original filename if available */
+    fileName?: string;
+}
+export declare class ProxyDownloadExecutor {
+    private httpClient;
+    private logger;
+    constructor(httpClient: HttpClient, logger?: DebugLogger);
+    /**
+     * Execute proxy download operation
+     *
+     * @param operation Proxy download configuration
+     * @param path API path with substituted parameters
+     * @param authCredentials Auth credentials (headers + query params) for download
+     */
+    execute(operation: ProxyDownloadOperation, metadataRequest: {
+        path: string;
+        method: string;
+    }, authCredentials: AuthCredentials, directDownloadRequest?: {
+        path: string;
+        method: string;
+    }): Promise<ProxyDownloadResult>;
+    private resolveMaxSize;
+    /**
+     * Extract URL from metadata using dot-notation path
+     */
+    private extractUrl;
+    private extractNestedString;
+    private extractNestedNumber;
+    private extractNestedValue;
+    private getBaseOrigin;
+    private resolveHttpUrl;
+    private enforceDownloadPolicy;
+    /**
+     * Check if MIME type matches whitelist (supports wildcards like 'image/*')
+     */
+    private isMimeTypeAllowed;
+    /**
+     * Download binary content and return base64
+     *
+     * @param skipAuth If true, download URL is fetched without authentication headers/params
+     *                 Metadata endpoint still requires auth, only the final download is unauthenticated
+     */
+    private downloadWithAuth;
+    private buildDownloadUrlWithOptionalQueryAuth;
+    private isRedirectStatus;
+    private resolveRedirectTarget;
+    private enforceAllowedDownloadTarget;
+    private lookupAllIpAddresses;
+    private isAllowedHost;
+    private isDisallowedIPv4;
+    private isDisallowedIPv6;
+    /**
+     * Handle inline data URLs (data:mime;base64,...)
+     */
+    private downloadFromDataUrl;
+}
+//# sourceMappingURL=proxy-executor.d.ts.map

package/dist/src/tooling/proxy-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proxy-executor.d.ts","sourceRoot":"","sources":["../../../src/tooling/proxy-executor.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAClE,OAAO,KAAK,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAMrF,MAAM,WAAW,WAAW;IAC1B,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IAChE,IAAI,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;CACjE;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,CACL,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE;QACR,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,OAAO,CAAC;KAChB,GACA,OAAO,CAAC,eAAe,CAAC,CAAC;IAC5B,UAAU,IAAI,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAClC,iCAAiC;IACjC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAElC,kCAAkC;IAClC,OAAO,EAAE,MAAM,CAAC;IAEhB,4BAA4B;IAC5B,QAAQ,EAAE,MAAM,CAAC;IAEjB,yBAAyB;IACzB,IAAI,EAAE,MAAM,CAAC;IAEb,qCAAqC;IACrC,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAMD,qBAAa,qBAAqB;IAE9B,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,MAAM;gBADN,UAAU,EAAE,UAAU,EACtB,MAAM,GAAE,WAAiC;IAGnD;;;;;;OAMG;IACG,OAAO,CACX,SAAS,EAAE,sBAAsB,EACjC,eAAe,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EACjD,eAAe,EAAE,eAAe,EAChC,qBAAqB,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GACvD,OAAO,CAAC,mBAAmB,CAAC;IA6H/B,OAAO,CAAC,cAAc;IAyBtB;;OAEG;IACH,OAAO,CAAC,UAAU;IAmBlB,OAAO,CAAC,mBAAmB;IAK3B,OAAO,CAAC,mBAAmB;IAK3B,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,aAAa;IAQrB,OAAO,CAAC,cAAc;YA6CR,qBAAqB;IAuBnC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAUzB;;;;;OAKG;YACW,gBAAgB;IAqG9B,OAAO,CAAC,qCAAqC;IAiB7C,OAAO,CAAC,gBAAgB;IAIxB,OAAO,CAAC,qBAAqB;YAef,4BAA4B;YAsE5B,oBAAoB;IAkClC,OAAO,CAAC,aAAa;IAgBrB,OAAO,CAAC,gBAAgB;IAaxB,OAAO,CAAC,gBAAgB;IAWxB;;OAEG;IACH,OAAO,CAAC,mBAAmB;CAa5B"}