@codeyam/codeyam-cli 0.1.0-staging.b8a55ba → 0.1.0-staging.bd4126b

package/packages/ai/src/lib/dataStructure/helpers/convertTypeAnnotationsToValues.js

@@ -0,0 +1,173 @@
+/**
+ * Converts type annotation strings that appear as values in mockData to actual values.
+ *
+ * The LLM sometimes echoes the schema type annotation as the actual value.
+ * For example, if the schema says { filePath: "string | undefined" },
+ * the LLM might return { filePath: "string | undefined" } instead of
+ * generating an actual value like { filePath: "/path/to/file.tsx" }.
+ *
+ * This causes runtime errors when the code tries to use these "values"
+ * as actual data (e.g., calling .length on the string "string | undefined").
+ *
+ * This function detects type annotation strings and converts them to
+ * appropriate default values:
+ * - "string" → ""
+ * - "number" → 0
+ * - "boolean" → false
+ * - "function" → () => {}
+ * - "Date" → new Date()
+ * - "T | undefined" → undefined
+ * - "T | null" → null
+ * - "string[]" → []
+ */
+// Pattern to detect if a string looks like a TypeScript type annotation
+// This matches common type patterns:
+// - Primitive types: string, number, boolean, function, Date, object, any, unknown
+// - Union types: string | undefined, number | null, T | null | undefined
+// - Array types: string[], number[], T[]
+// - Optional types: T?
+const TYPE_ANNOTATION_PATTERN = /^(string|number|boolean|function|Date|object|any|unknown|void|never|null|undefined|array)(\s*\|\s*(string|number|boolean|function|Date|object|any|unknown|void|never|null|undefined|array))*(\[\])?$/i;
+/**
+ * Check if a string value looks like a TypeScript type annotation.
+ */
+function isTypeAnnotation(value) {
+    if (typeof value !== 'string')
+        return false;
+    const trimmed = value.trim();
+    // Quick check: type annotations are typically short
+    if (trimmed.length > 100)
+        return false;
+    // Check against the pattern
+    if (TYPE_ANNOTATION_PATTERN.test(trimmed))
+        return true;
+    // Also check for common patterns that the regex might miss
+    const commonTypePatterns = [
+        'string',
+        'number',
+        'boolean',
+        'function',
+        'object',
+        'array',
+        'Date',
+        'any',
+        'unknown',
+        'void',
+        'never',
+        'null',
+        'undefined',
+        'string | undefined',
+        'string | null',
+        'string | null | undefined',
+        'number | undefined',
+        'number | null',
+        'number | null | undefined',
+        'boolean | undefined',
+        'boolean | null',
+        'boolean | null | undefined',
+        'Date | undefined',
+        'Date | null',
+        'function | undefined',
+        'object | undefined',
+        'object | null',
+        'string[]',
+        'number[]',
+        'boolean[]',
+        'any[]',
+        'string | number',
+        'string | number | undefined',
+    ];
+    if (commonTypePatterns.includes(trimmed))
+        return true;
+    // Check for arrow function type annotations like "() => void", "(event: MouseEvent) => void"
+    // These contain '=>' but the body is a type keyword, not a JS expression
+    if (trimmed.includes('=>')) {
+        const arrowIndex = trimmed.indexOf('=>');
+        const body = trimmed.slice(arrowIndex + 2).trim();
+        if (/^(void|string|number|boolean|any|unknown|never|null|undefined|object|Date|Promise<\w+>)$/i.test(body)) {
+            return true;
+        }
+    }
+    return false;
+}
+/**
+ * Convert a type annotation string to an appropriate default value.
+ */
+function typeAnnotationToValue(typeAnnotation) {
+    const trimmed = typeAnnotation.trim().toLowerCase();
+    // Handle undefined types first (they take precedence)
+    if (trimmed.includes('| undefined') || trimmed.includes('undefined |')) {
+        return undefined;
+    }
+    // Handle null types
+    if (trimmed.includes('| null') || trimmed.includes('null |')) {
+        return null;
+    }
+    // Handle array types
+    if (trimmed.endsWith('[]') || trimmed === 'array') {
+        return [];
+    }
+    // Handle arrow function type annotations like "() => void"
+    if (trimmed.includes('=>'))
+        return () => { };
+    // Handle primitive types
+    if (trimmed === 'string')
+        return '';
+    if (trimmed === 'number')
+        return 0;
+    if (trimmed === 'boolean')
+        return false;
+    if (trimmed === 'function')
+        return () => { };
+    if (trimmed === 'date')
+        return new Date();
+    if (trimmed === 'object')
+        return {};
+    if (trimmed === 'null')
+        return null;
+    if (trimmed === 'undefined')
+        return undefined;
+    if (trimmed === 'any' || trimmed === 'unknown')
+        return undefined;
+    if (trimmed === 'void' || trimmed === 'never')
+        return undefined;
+    // Handle union types - prefer the first concrete type
+    if (trimmed.includes(' | ')) {
+        const parts = trimmed.split(' | ').map((p) => p.trim());
+        for (const part of parts) {
+            if (part === 'string')
+                return '';
+            if (part === 'number')
+                return 0;
+            if (part === 'boolean')
+                return false;
+        }
+    }
+    // Fallback: return undefined for unknown type patterns
+    return undefined;
+}
+/**
+ * Recursively convert type annotation strings to values in a mockData object.
+ * Mutates the object in place.
+ */
+export default function convertTypeAnnotationsToValues(mockData) {
+    for (const [key, value] of Object.entries(mockData)) {
+        if (typeof value === 'string' && isTypeAnnotation(value)) {
+            mockData[key] = typeAnnotationToValue(value);
+        }
+        else if (Array.isArray(value)) {
+            // Recursively process array elements
+            for (const item of value) {
+                if (item !== null && typeof item === 'object' && !Array.isArray(item)) {
+                    convertTypeAnnotationsToValues(item);
+                }
+            }
+        }
+        else if (value !== null &&
+            typeof value === 'object' &&
+            !Array.isArray(value)) {
+            // Recursively process nested objects
+            convertTypeAnnotationsToValues(value);
+        }
+    }
+}
+//# sourceMappingURL=convertTypeAnnotationsToValues.js.map

package/packages/ai/src/lib/dataStructure/helpers/convertTypeAnnotationsToValues.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"convertTypeAnnotationsToValues.js","sourceRoot":"","sources":["../../../../../../../../packages/ai/src/lib/dataStructure/helpers/convertTypeAnnotationsToValues.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,wEAAwE;AACxE,qCAAqC;AACrC,mFAAmF;AACnF,yEAAyE;AACzE,yCAAyC;AACzC,uBAAuB;AACvB,MAAM,uBAAuB,GAC3B,uMAAuM,CAAC;AAE1M;;GAEG;AACH,SAAS,gBAAgB,CAAC,KAAa;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAE5C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAE7B,oDAAoD;IACpD,IAAI,OAAO,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,KAAK,CAAC;IAEvC,4BAA4B;IAC5B,IAAI,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvD,2DAA2D;IAC3D,MAAM,kBAAkB,GAAG;QACzB,QAAQ;QACR,QAAQ;QACR,SAAS;QACT,UAAU;QACV,QAAQ;QACR,OAAO;QACP,MAAM;QACN,KAAK;QACL,SAAS;QACT,MAAM;QACN,OAAO;QACP,MAAM;QACN,WAAW;QACX,oBAAoB;QACpB,eAAe;QACf,2BAA2B;QAC3B,oBAAoB;QACpB,eAAe;QACf,2BAA2B;QAC3B,qBAAqB;QACrB,gBAAgB;QAChB,4BAA4B;QAC5B,kBAAkB;QAClB,aAAa;QACb,sBAAsB;QACtB,oBAAoB;QACpB,eAAe;QACf,UAAU;QACV,UAAU;QACV,WAAW;QACX,OAAO;QACP,iBAAiB;QACjB,6BAA6B;KAC9B,CAAC;IAEF,IAAI,kBAAkB,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtD,6FAA6F;IAC7F,yEAAyE;IACzE,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAClD,IACE,2FAA2F,CAAC,IAAI,CAC9F,IAAI,CACL,EACD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,cAAsB;IACnD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAEpD,sDAAsD;IACtD,IAAI,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACvE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,oBAAoB;IACpB,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qBAAqB;IACrB,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QAClD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,2DAA2D;IAC3D,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,GAAG,EAAE,GAAE,CAAC,CAAC;IAE5C,yBAAyB;IACzB,IAAI,OAAO,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IACpC,IAAI,OAAO,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC;IACnC,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxC,IAAI,OAAO,KAAK,UAAU;QAAE,OAAO,GAAG,EAAE,GAAE,CAAC,CAAC;IAC5C,IAAI,OAAO,KAAK,MAAM;QAAE,OAAO,IAAI,IAAI,EAAE,CAAC;IAC1C,IAAI,OAAO,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IACpC,IAAI,OAAO,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,OAAO,KAAK,WAAW;QAAE,OAAO,SAAS,CAAC;IAC9C,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjE,IAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,SAAS,CAAC;IAEhE,sDAAsD;IACtD,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,KAAK,QAAQ;gBAAE,OAAO,EAAE,CAAC;YACjC,IAAI,IAAI,KAAK,QAAQ;gBAAE,OAAO,CAAC,CAAC;YAChC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;QACvC,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,OAAO,UAAU,8BAA8B,CACpD,QAAiC;IAEjC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YACzD,QAAQ,CAAC,GAAG,CAAC,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,qCAAqC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtE,8BAA8B,CAAC,IAA+B,CAAC,CAAC;gBAClE,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IACL,KAAK,KAAK,IAAI;YACd,OAAO,KAAK,KAAK,QAAQ;YACzB,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EACrB,CAAC;YACD,qCAAqC;YACrC,8BAA8B,CAAC,KAAgC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;AACH,CAAC"}

package/packages/ai/src/lib/dataStructure/helpers/deduplicateFunctionSchemas.js

@@ -58,38 +58,55 @@ export default function deduplicateFunctionSchemas(schema) {
             withoutArgs.forEach((k) => keysToRemove.add(k));
             // If multiple variants with arguments exist, find the one with the most robust structure
             if (withArgs.length > 1) {
-                // Count the number of related schema keys for each variant
-                const variantDepths = withArgs.map((variant) => {
-                    // Find the end of the function call (the closing parenthesis)
+                // Pre-compute function call prefixes for all variants
+                const variantPrefixes = withArgs.map((variant) => {
                     const closingParenIndex = variant.lastIndexOf(')');
-                    const functionCallPrefix = closingParenIndex > -1
-                        ? variant.slice(0, closingParenIndex + 1)
-                        : variant;
-                    const relatedKeys = Object.keys(schema).filter((k) => {
-                        // Check if this key is a child of the variant (starts with the function call)
-                        return (k.startsWith(functionCallPrefix + '.') ||
-                            k.startsWith(functionCallPrefix + '['));
-                    });
                     return {
                         key: variant,
-                        depth: relatedKeys.length,
-                        maxDepth: Math.max(0, ...relatedKeys.map((k) => {
-                            // Count the nesting depth by counting dots and brackets after the variant
-                            const remaining = k.slice(functionCallPrefix.length);
-                            return ((remaining.match(/\./g) || []).length +
-                                (remaining.match(/\[/g) || []).length);
-                        })),
+                        prefix: closingParenIndex > -1
+                            ? variant.slice(0, closingParenIndex + 1)
+                            : variant,
+                        depth: 0,
+                        maxDepth: 0,
                     };
                 });
+                // Single pass through schema keys to count related keys for ALL variants at once.
+                // This is O(schemaSize × variants) but done in one pass instead of
+                // O(variants × schemaSize) with separate passes per variant.
+                const schemaKeys = Object.keys(schema);
+                for (const k of schemaKeys) {
+                    for (const variantInfo of variantPrefixes) {
+                        // Check if key starts with prefix followed by . or [
+                        const prefixLen = variantInfo.prefix.length;
+                        if (k.length > prefixLen) {
+                            const nextChar = k[prefixLen];
+                            if ((nextChar === '.' || nextChar === '[') &&
+                                k.startsWith(variantInfo.prefix)) {
+                                variantInfo.depth++;
+                                // Count nesting depth by counting . and [ characters (faster than regex)
+                                const remaining = k.slice(prefixLen);
+                                let nestingDepth = 0;
+                                for (let i = 0; i < remaining.length; i++) {
+                                    const c = remaining[i];
+                                    if (c === '.' || c === '[')
+                                        nestingDepth++;
+                                }
+                                if (nestingDepth > variantInfo.maxDepth) {
+                                    variantInfo.maxDepth = nestingDepth;
+                                }
+                            }
+                        }
+                    }
+                }
                 // Sort by depth (number of related keys) and then by max depth (nesting level)
-                variantDepths.sort((a, b) => {
+                variantPrefixes.sort((a, b) => {
                     if (b.depth !== a.depth) {
                         return b.depth - a.depth;
                     }
                     return b.maxDepth - a.maxDepth;
                 });
                 // Keep the one with the most robust structure, remove others
-                const keepVariant = variantDepths[0].key;
+                const keepVariant = variantPrefixes[0].key;
                 withArgs.forEach((variant) => {
                     if (variant !== keepVariant) {
                         keysToRemove.add(variant);

package/packages/ai/src/lib/dataStructure/helpers/deduplicateFunctionSchemas.js.map

@@ -1 +1 @@
-{"version":3,"file":"deduplicateFunctionSchemas.js","sourceRoot":"","sources":["../../../../../../../../packages/ai/src/lib/dataStructure/helpers/deduplicateFunctionSchemas.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gCAAgC,EAChC,wBAAwB,GACzB,MAAM,+BAA+B,CAAC;AAEvC;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,OAAO,UAAU,0BAA0B,CAChD,MAA8B;IAE9B,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,8EAA8E;IAC9E,0EAA0E;IAC1E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEnD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAE1B,sEAAsE;QACtE,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;YACzB,uDAAuD;YACvD,6DAA6D;YAC7D,mFAAmF;YACnF,MAAM,KAAK,GAAG,gCAAgC,CAAC,GAAG,CAAC,CAAC;YACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEzC,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACjD,MAAM,YAAY,GAChB,kBAAkB,GAAG,CAAC,CAAC;gBACrB,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;gBACvC,CAAC,CAAC,QAAQ,CAAC;YAEf,4EAA4E;YAC5E,MAAM,QAAQ,GAAG,wBAAwB,CAAC;gBACxC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrB,YAAY;aACb,CAAC,CAAC;YAEH,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACnC,CAAC;YACD,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,cAAc,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,yBAAyB;YACzB,SAAS;QACX,CAAC;QAED,4DAA4D;QAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,GAAG,GAAG,CAAC,CACtD,CAAC;QAEF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,qEAAqE;YACrE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhD,yFAAyF;YACzF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,2DAA2D;gBAC3D,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC7C,8DAA8D;oBAC9D,MAAM,iBAAiB,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;oBACnD,MAAM,kBAAkB,GACtB,iBAAiB,GAAG,CAAC,CAAC;wBACpB,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,GAAG,CAAC,CAAC;wBACzC,CAAC,CAAC,OAAO,CAAC;oBAEd,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;wBACnD,8EAA8E;wBAC9E,OAAO,CACL,CAAC,CAAC,UAAU,CAAC,kBAAkB,GAAG,GAAG,CAAC;4BACtC,CAAC,CAAC,UAAU,CAAC,kBAAkB,GAAG,GAAG,CAAC,CACvC,CAAC;oBACJ,CAAC,CAAC,CAAC;oBAEH,OAAO;wBACL,GAAG,EAAE,OAAO;wBACZ,KAAK,EAAE,WAAW,CAAC,MAAM;wBACzB,QAAQ,EAAE,IAAI,CAAC,GAAG,CAChB,CAAC,EACD,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;4BACvB,0EAA0E;4BAC1E,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;4BACrD,OAAO,CACL,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM;gCACrC,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CACtC,CAAC;wBACJ,CAAC,CAAC,CACH;qBACF,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,+EAA+E;gBAC/E,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;wBACxB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;oBAC3B,CAAC;oBACD,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACjC,CAAC,CAAC,CAAC;gBAEH,6DAA6D;gBAC7D,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBACzC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC3B,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;wBAC5B,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBAC1B,mEAAmE;wBACnE,8EAA8E;oBAChF,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"deduplicateFunctionSchemas.js","sourceRoot":"","sources":["../../../../../../../../packages/ai/src/lib/dataStructure/helpers/deduplicateFunctionSchemas.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gCAAgC,EAChC,wBAAwB,GACzB,MAAM,+BAA+B,CAAC;AAEvC;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,OAAO,UAAU,0BAA0B,CAChD,MAA8B;IAE9B,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,8EAA8E;IAC9E,0EAA0E;IAC1E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEnD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAE1B,sEAAsE;QACtE,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;YACzB,uDAAuD;YACvD,6DAA6D;YAC7D,mFAAmF;YACnF,MAAM,KAAK,GAAG,gCAAgC,CAAC,GAAG,CAAC,CAAC;YACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEzC,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACjD,MAAM,YAAY,GAChB,kBAAkB,GAAG,CAAC,CAAC;gBACrB,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;gBACvC,CAAC,CAAC,QAAQ,CAAC;YAEf,4EAA4E;YAC5E,MAAM,QAAQ,GAAG,wBAAwB,CAAC;gBACxC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrB,YAAY;aACb,CAAC,CAAC;YAEH,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACnC,CAAC;YACD,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,cAAc,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,yBAAyB;YACzB,SAAS;QACX,CAAC;QAED,4DAA4D;QAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,GAAG,GAAG,CAAC,CACtD,CAAC;QAEF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,qEAAqE;YACrE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhD,yFAAyF;YACzF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,sDAAsD;gBACtD,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC/C,MAAM,iBAAiB,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;oBACnD,OAAO;wBACL,GAAG,EAAE,OAAO;wBACZ,MAAM,EACJ,iBAAiB,GAAG,CAAC,CAAC;4BACpB,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,GAAG,CAAC,CAAC;4BACzC,CAAC,CAAC,OAAO;wBACb,KAAK,EAAE,CAAC;wBACR,QAAQ,EAAE,CAAC;qBACZ,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,kFAAkF;gBAClF,mEAAmE;gBACnE,6DAA6D;gBAC7D,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBAC3B,KAAK,MAAM,WAAW,IAAI,eAAe,EAAE,CAAC;wBAC1C,qDAAqD;wBACrD,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC;wBAC5C,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;4BACzB,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;4BAC9B,IACE,CAAC,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,CAAC;gCACtC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,EAChC,CAAC;gCACD,WAAW,CAAC,KAAK,EAAE,CAAC;gCACpB,yEAAyE;gCACzE,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gCACrC,IAAI,YAAY,GAAG,CAAC,CAAC;gCACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC1C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oCACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;wCAAE,YAAY,EAAE,CAAC;gCAC7C,CAAC;gCACD,IAAI,YAAY,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC;oCACxC,WAAW,CAAC,QAAQ,GAAG,YAAY,CAAC;gCACtC,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,+EAA+E;gBAC/E,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC5B,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;wBACxB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;oBAC3B,CAAC;oBACD,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACjC,CAAC,CAAC,CAAC;gBAEH,6DAA6D;gBAC7D,MAAM,WAAW,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC3C,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC3B,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;wBAC5B,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBAC1B,mEAAmE;wBACnE,8EAA8E;oBAChF,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}