@nahisaho/musubix-library-learner 2.0.0

package/dist/abstraction/TypeAnalyzer.js

@@ -0,0 +1,239 @@
+/**
+ * TypeAnalyzer - Type-directed search and analysis
+ *
+ * REQ-LL-003: 型指向探索
+ * DES-PHASE2-001: Abstraction Engine / TypeAnalyzer
+ */
+/**
+ * Default TypeAnalyzer implementation
+ */
+class TypeAnalyzerImpl {
+    isCompatible(source, target) {
+        // Same kind check
+        if (source.kind !== target.kind) {
+            // Special cases
+            if (target.kind === 'union' && target.members) {
+                return target.members.some((m) => this.isCompatible(source, m));
+            }
+            if (source.kind === 'primitive' && source.name === 'any') {
+                return true;
+            }
+            if (target.kind === 'primitive' && target.name === 'any') {
+                return true;
+            }
+            // unknown is compatible with anything (top type)
+            if (source.kind === 'primitive' && source.name === 'unknown') {
+                return true;
+            }
+            if (target.kind === 'primitive' && target.name === 'unknown') {
+                return true;
+            }
+            return false;
+        }
+        switch (source.kind) {
+            case 'primitive':
+                return source.name === target.name ||
+                    target.name === 'any' ||
+                    source.name === 'any' ||
+                    source.name === 'unknown' ||
+                    target.name === 'unknown';
+            case 'function':
+                return this.isFunctionCompatible(source, target);
+            case 'array':
+                return this.isCompatible(source.elementType ?? { kind: 'primitive', name: 'unknown' }, target.elementType ?? { kind: 'primitive', name: 'unknown' });
+            case 'object':
+                return this.isObjectCompatible(source, target);
+            case 'union':
+                return this.isUnionCompatible(source, target);
+            case 'intersection':
+                return this.isIntersectionCompatible(source, target);
+            case 'generic':
+                // Generics match if they have the same type parameters
+                return JSON.stringify(source.typeParams) === JSON.stringify(target.typeParams);
+            default:
+                return false;
+        }
+    }
+    filterByType(candidates, expectedType) {
+        return candidates.filter((candidate) => {
+            const candidateType = this.inferPatternType(candidate);
+            return this.isCompatible(candidateType, expectedType);
+        });
+    }
+    scoreByTypeMatch(candidate, context) {
+        const candidateType = this.inferPatternType(candidate);
+        let score = 0;
+        // Check compatibility with context variables
+        for (const [name, type] of context.variables) {
+            if (this.usesVariable(candidate, name)) {
+                if (this.isCompatible(candidateType, type)) {
+                    score += 1;
+                }
+            }
+        }
+        // Check compatibility with context functions
+        for (const [name, type] of context.functions) {
+            if (this.usesFunction(candidate, name)) {
+                if (this.isCompatible(candidateType, type)) {
+                    score += 1;
+                }
+            }
+        }
+        return score;
+    }
+    inferType(expression) {
+        if (expression === null) {
+            return { kind: 'primitive', name: 'null' };
+        }
+        if (expression === undefined) {
+            return { kind: 'primitive', name: 'undefined' };
+        }
+        switch (typeof expression) {
+            case 'string':
+                return { kind: 'primitive', name: 'string' };
+            case 'number':
+                return { kind: 'primitive', name: 'number' };
+            case 'boolean':
+                return { kind: 'primitive', name: 'boolean' };
+            case 'function':
+                return { kind: 'function', paramTypes: [], returnType: { kind: 'primitive', name: 'unknown' } };
+            case 'object':
+                if (Array.isArray(expression)) {
+                    const elementType = expression.length > 0
+                        ? this.inferType(expression[0])
+                        : { kind: 'primitive', name: 'unknown' };
+                    return { kind: 'array', elementType };
+                }
+                return this.inferObjectType(expression);
+            default:
+                return { kind: 'primitive', name: 'unknown' };
+        }
+    }
+    isSubtype(sub, sup) {
+        // any is supertype of everything
+        if (sup.kind === 'primitive' && sup.name === 'any') {
+            return true;
+        }
+        // never is subtype of everything
+        if (sub.kind === 'primitive' && sub.name === 'never') {
+            return true;
+        }
+        // unknown is not subtype of anything except any and unknown
+        if (sub.kind === 'primitive' && sub.name === 'unknown') {
+            return sup.kind === 'primitive' && (sup.name === 'any' || sup.name === 'unknown');
+        }
+        return this.isCompatible(sub, sup);
+    }
+    // =========================================================================
+    // Private methods
+    // =========================================================================
+    isFunctionCompatible(source, target) {
+        // Contravariant parameter types, covariant return type
+        const sourceParams = source.paramTypes ?? [];
+        const targetParams = target.paramTypes ?? [];
+        // Target can have fewer parameters (extra params are ignored)
+        if (targetParams.length > sourceParams.length) {
+            return false;
+        }
+        // Check parameter types (contravariant)
+        for (let i = 0; i < targetParams.length; i++) {
+            if (!this.isCompatible(targetParams[i], sourceParams[i])) {
+                return false;
+            }
+        }
+        // Check return type (covariant)
+        const sourceReturn = source.returnType ?? { kind: 'primitive', name: 'void' };
+        const targetReturn = target.returnType ?? { kind: 'primitive', name: 'void' };
+        return this.isCompatible(sourceReturn, targetReturn);
+    }
+    isObjectCompatible(source, target) {
+        const sourceProps = source.properties ?? {};
+        const targetProps = target.properties ?? {};
+        // Source must have all properties that target requires
+        for (const [key, targetType] of Object.entries(targetProps)) {
+            const sourceType = sourceProps[key];
+            if (!sourceType) {
+                return false;
+            }
+            if (!this.isCompatible(sourceType, targetType)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    isUnionCompatible(source, target) {
+        const sourceMembers = source.members ?? [];
+        const targetMembers = target.members ?? [];
+        // Every source member must be compatible with some target member
+        return sourceMembers.every((sm) => targetMembers.some((tm) => this.isCompatible(sm, tm)));
+    }
+    isIntersectionCompatible(source, target) {
+        const sourceMembers = source.members ?? [];
+        const targetMembers = target.members ?? [];
+        // Source must satisfy all target intersection members
+        return targetMembers.every((tm) => sourceMembers.some((sm) => this.isCompatible(sm, tm)));
+    }
+    inferPatternType(candidate) {
+        // Infer type from pattern AST
+        const ast = candidate.ast;
+        switch (ast.type) {
+            case 'Declaration':
+                return { kind: 'primitive', name: 'void' };
+            case 'ReturnStatement':
+                return { kind: 'primitive', name: 'unknown' };
+            case 'IfStatement':
+            case 'ForLoop':
+            case 'WhileLoop':
+                return { kind: 'primitive', name: 'void' };
+            case 'Expression':
+                return this.inferType(ast.value);
+            case 'NumberLiteral':
+                return { kind: 'primitive', name: 'number' };
+            case 'StringLiteral':
+                return { kind: 'primitive', name: 'string' };
+            case 'BooleanLiteral':
+                return { kind: 'primitive', name: 'boolean' };
+            case 'ArrayExpression':
+                return { kind: 'array', elementType: { kind: 'primitive', name: 'unknown' } };
+            case 'Identifier':
+                return { kind: 'primitive', name: 'unknown' };
+            default:
+                return { kind: 'primitive', name: 'unknown' };
+        }
+    }
+    inferObjectType(obj) {
+        const properties = {};
+        for (const [key, value] of Object.entries(obj)) {
+            properties[key] = this.inferType(value);
+        }
+        return { kind: 'object', properties };
+    }
+    usesVariable(candidate, name) {
+        // Check if the pattern uses a variable with the given name
+        return this.astContains(candidate.ast, name);
+    }
+    usesFunction(candidate, name) {
+        // Check if the pattern calls a function with the given name
+        return this.astContains(candidate.ast, name);
+    }
+    astContains(node, name) {
+        if (typeof node !== 'object' || node === null) {
+            return node === name;
+        }
+        const obj = node;
+        if (obj.name === name || obj.value === name) {
+            return true;
+        }
+        if (Array.isArray(obj.children)) {
+            return obj.children.some((child) => this.astContains(child, name));
+        }
+        return false;
+    }
+}
+/**
+ * Factory function to create a TypeAnalyzer
+ */
+export function createTypeAnalyzer() {
+    return new TypeAnalyzerImpl();
+}
+//# sourceMappingURL=TypeAnalyzer.js.map

package/dist/abstraction/TypeAnalyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TypeAnalyzer.js","sourceRoot":"","sources":["../../src/abstraction/TypeAnalyzer.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AA4BH;;GAEG;AACH,MAAM,gBAAgB;IACpB,YAAY,CAAC,MAAqB,EAAE,MAAqB;QACvD,kBAAkB;QAClB,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;YAChC,gBAAgB;YAChB,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC9C,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAClE,CAAC;YACD,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACzD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACzD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,iDAAiD;YACjD,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC7D,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC7D,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,WAAW;gBACd,OAAO,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;oBAC3B,MAAM,CAAC,IAAI,KAAK,KAAK;oBACrB,MAAM,CAAC,IAAI,KAAK,KAAK;oBACrB,MAAM,CAAC,IAAI,KAAK,SAAS;oBACzB,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC;YAEnC,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAEnD,KAAK,OAAO;gBACV,OAAO,IAAI,CAAC,YAAY,CACtB,MAAM,CAAC,WAAW,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,EAC5D,MAAM,CAAC,WAAW,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAC7D,CAAC;YAEJ,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAEjD,KAAK,OAAO;gBACV,OAAO,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAEhD,KAAK,cAAc;gBACjB,OAAO,IAAI,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAEvD,KAAK,SAAS;gBACZ,uDAAuD;gBACvD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAEjF;gBACE,OAAO,KAAK,CAAC;QACjB,CAAC;IACH,CAAC;IAED,YAAY,CAAC,UAA8B,EAAE,YAA2B;QACtE,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE;YACrC,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC,YAAY,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,gBAAgB,CAAC,SAA2B,EAAE,OAAoB;QAChE,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACvD,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,6CAA6C;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvC,IAAI,IAAI,CAAC,YAAY,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC3C,KAAK,IAAI,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvC,IAAI,IAAI,CAAC,YAAY,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC3C,KAAK,IAAI,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,CAAC,UAAmB;QAC3B,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACxB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAC7C,CAAC;QAED,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAClD,CAAC;QAED,QAAQ,OAAO,UAAU,EAAE,CAAC;YAC1B,KAAK,QAAQ;gBACX,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;YAC/C,KAAK,QAAQ;gBACX,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;YAC/C,KAAK,SAAS;gBACZ,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAChD,KAAK,UAAU;gBACb,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;YAClG,KAAK,QAAQ;gBACX,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC9B,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC;wBACvC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBAC/B,CAAC,CAAC,EAAE,IAAI,EAAE,WAAoB,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;oBACpD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;gBACxC,CAAC;gBACD,OAAO,IAAI,CAAC,eAAe,CAAC,UAAqC,CAAC,CAAC;YACrE;gBACE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAClD,CAAC;IACH,CAAC;IAED,SAAS,CAAC,GAAkB,EAAE,GAAkB;QAC9C,iCAAiC;QACjC,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iCAAiC;QACjC,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,4DAA4D;QAC5D,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACvD,OAAO,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QACpF,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,4EAA4E;IAC5E,kBAAkB;IAClB,4EAA4E;IAEpE,oBAAoB,CAAC,MAAqB,EAAE,MAAqB;QACvE,uDAAuD;QACvD,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;QAC7C,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;QAE7C,8DAA8D;QAC9D,IAAI,YAAY,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,wCAAwC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAC9E,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAE9E,OAAO,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IACvD,CAAC;IAEO,kBAAkB,CAAC,MAAqB,EAAE,MAAqB;QACrE,MAAM,WAAW,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;QAE5C,uDAAuD;QACvD,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAC5D,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;gBAC/C,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,iBAAiB,CAAC,MAAqB,EAAE,MAAqB;QACpE,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QAC3C,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QAE3C,iEAAiE;QACjE,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAChC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CACtD,CAAC;IACJ,CAAC;IAEO,wBAAwB,CAAC,MAAqB,EAAE,MAAqB;QAC3E,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QAC3C,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QAE3C,sDAAsD;QACtD,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAChC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CACtD,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,SAA2B;QAClD,8BAA8B;QAC9B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC;QAE1B,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,aAAa;gBAChB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;YAC7C,KAAK,iBAAiB;gBACpB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAChD,KAAK,aAAa,CAAC;YACnB,KAAK,SAAS,CAAC;YACf,KAAK,WAAW;gBACd,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;YAC7C,KAAK,YAAY;gBACf,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnC,KAAK,eAAe;gBAClB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;YAC/C,KAAK,eAAe;gBAClB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;YAC/C,KAAK,gBAAgB;gBACnB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAChD,KAAK,iBAAiB;gBACpB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;YAChF,KAAK,YAAY;gBACf,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAChD;gBACE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAClD,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,GAA4B;QAClD,MAAM,UAAU,GAAkC,EAAE,CAAC;QAErD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/C,UAAU,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IACxC,CAAC;IAEO,YAAY,CAAC,SAA2B,EAAE,IAAY;QAC5D,2DAA2D;QAC3D,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC/C,CAAC;IAEO,YAAY,CAAC,SAA2B,EAAE,IAAY;QAC5D,4DAA4D;QAC5D,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC/C,CAAC;IAEO,WAAW,CAAC,IAAa,EAAE,IAAY;QAC7C,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAC9C,OAAO,IAAI,KAAK,IAAI,CAAC;QACvB,CAAC;QAED,MAAM,GAAG,GAAG,IAA+B,CAAC;QAE5C,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO,IAAI,gBAAgB,EAAE,CAAC;AAChC,CAAC"}

package/dist/abstraction/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Abstraction Engine exports
+ */
+export type { PatternMiner } from './PatternMiner.js';
+export { createPatternMiner } from './PatternMiner.js';
+export type { Abstractor } from './Abstractor.js';
+export { createAbstractor } from './Abstractor.js';
+export type { TypeAnalyzer } from './TypeAnalyzer.js';
+export { createTypeAnalyzer } from './TypeAnalyzer.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/abstraction/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/abstraction/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/abstraction/index.js

@@ -0,0 +1,7 @@
+/**
+ * Abstraction Engine exports
+ */
+export { createPatternMiner } from './PatternMiner.js';
+export { createAbstractor } from './Abstractor.js';
+export { createTypeAnalyzer } from './TypeAnalyzer.js';
+//# sourceMappingURL=index.js.map

package/dist/abstraction/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/abstraction/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAEvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/egraph/EGraph.d.ts

@@ -0,0 +1,29 @@
+/**
+ * EGraph - Equality Graph data structure
+ *
+ * REQ-LL-004: E-graph最適化
+ * DES-PHASE2-001: E-Graph Optimizer / EGraph
+ *
+ * @stub This is a stub implementation. Full implementation in M3.
+ */
+import type { ENode, EClass, EClassId } from '../types.js';
+/**
+ * EGraph interface
+ */
+export interface EGraph {
+    /** Add a node to the e-graph */
+    add(node: ENode): EClassId;
+    /** Merge two e-classes */
+    merge(id1: EClassId, id2: EClassId): EClassId;
+    /** Get an e-class by ID */
+    getEClass(id: EClassId): EClass | undefined;
+    /** Get all e-classes */
+    getAllClasses(): EClass[];
+    /** Find the canonical ID for an e-class */
+    find(id: EClassId): EClassId;
+}
+/**
+ * Factory function to create an EGraph
+ */
+export declare function createEGraph(): EGraph;
+//# sourceMappingURL=EGraph.d.ts.map

package/dist/egraph/EGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EGraph.d.ts","sourceRoot":"","sources":["../../src/egraph/EGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,MAAM;IACrB,gCAAgC;IAChC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,QAAQ,CAAC;IAE3B,0BAA0B;IAC1B,KAAK,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAE9C,2BAA2B;IAC3B,SAAS,CAAC,EAAE,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAC;IAE5C,wBAAwB;IACxB,aAAa,IAAI,MAAM,EAAE,CAAC;IAE1B,2CAA2C;IAC3C,IAAI,CAAC,EAAE,EAAE,QAAQ,GAAG,QAAQ,CAAC;CAC9B;AAqFD;;GAEG;AACH,wBAAgB,YAAY,IAAI,MAAM,CAErC"}

package/dist/egraph/EGraph.js

@@ -0,0 +1,86 @@
+/**
+ * EGraph - Equality Graph data structure
+ *
+ * REQ-LL-004: E-graph最適化
+ * DES-PHASE2-001: E-Graph Optimizer / EGraph
+ *
+ * @stub This is a stub implementation. Full implementation in M3.
+ */
+/**
+ * Default EGraph implementation (stub)
+ */
+class EGraphImpl {
+    classes = new Map();
+    unionFind = new Map();
+    nextId = 0;
+    add(node) {
+        const id = this.nextId++;
+        const eclass = {
+            id,
+            nodes: [node],
+            parents: new Set(),
+        };
+        this.classes.set(id, eclass);
+        this.unionFind.set(id, id);
+        return id;
+    }
+    merge(id1, id2) {
+        const root1 = this.find(id1);
+        const root2 = this.find(id2);
+        if (root1 === root2) {
+            return root1;
+        }
+        // Merge root2 into root1
+        const class1 = this.classes.get(root1);
+        const class2 = this.classes.get(root2);
+        if (class1 && class2) {
+            class1.nodes.push(...class2.nodes);
+            for (const parent of class2.parents) {
+                class1.parents.add(parent);
+            }
+            this.unionFind.set(root2, root1);
+        }
+        return root1;
+    }
+    getEClass(id) {
+        const root = this.find(id);
+        return this.classes.get(root);
+    }
+    getAllClasses() {
+        // Return only root classes
+        const roots = new Set();
+        for (const id of this.classes.keys()) {
+            roots.add(this.find(id));
+        }
+        return Array.from(roots).map((id) => this.classes.get(id)).filter(Boolean);
+    }
+    find(id) {
+        // Handle unregistered IDs
+        if (!this.unionFind.has(id)) {
+            return id;
+        }
+        let root = id;
+        let parent = this.unionFind.get(root);
+        while (parent !== undefined && parent !== root) {
+            root = parent;
+            parent = this.unionFind.get(root);
+        }
+        // Path compression
+        let current = id;
+        while (current !== root) {
+            const next = this.unionFind.get(current);
+            if (next === undefined)
+                break;
+            this.unionFind.set(current, root);
+            current = next;
+        }
+        return root;
+    }
+}
+/**
+ * Factory function to create an EGraph
+ */
+export function createEGraph() {
+    return new EGraphImpl();
+}
+//# sourceMappingURL=EGraph.js.map

package/dist/egraph/EGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EGraph.js","sourceRoot":"","sources":["../../src/egraph/EGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAwBH;;GAEG;AACH,MAAM,UAAU;IACN,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IACtC,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC1C,MAAM,GAAG,CAAC,CAAC;IAEnB,GAAG,CAAC,IAAW;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,MAAM,GAAW;YACrB,EAAE;YACF,KAAK,EAAE,CAAC,IAAI,CAAC;YACb,OAAO,EAAE,IAAI,GAAG,EAAE;SACnB,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK,CAAC,GAAa,EAAE,GAAa;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE7B,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,yBAAyB;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEvC,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;YACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YACnC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,CAAC,EAAY;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,aAAa;QACX,2BAA2B;QAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAY,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9E,CAAC;IAED,IAAI,CAAC,EAAY;QACf,0BAA0B;QAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAC/C,IAAI,GAAG,MAAM,CAAC;YACd,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,mBAAmB;QACnB,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAClC,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,YAAY;IAC1B,OAAO,IAAI,UAAU,EAAE,CAAC;AAC1B,CAAC"}

package/dist/egraph/EGraphBuilder.d.ts

@@ -0,0 +1,24 @@
+/**
+ * EGraphBuilder - Build e-graphs from patterns
+ *
+ * REQ-LL-004: E-graph最適化
+ * DES-PHASE2-001: E-Graph Optimizer / EGraphBuilder
+ *
+ * @stub This is a stub implementation. Full implementation in M3.
+ */
+import type { LearnedPattern, EqualityRule } from '../types.js';
+import type { EGraph } from './EGraph.js';
+/**
+ * EGraphBuilder interface
+ */
+export interface EGraphBuilder {
+    /** Build an e-graph from patterns */
+    build(patterns: LearnedPattern[]): EGraph;
+    /** Apply rules until saturation */
+    saturate(graph: EGraph, rules: EqualityRule[]): EGraph;
+}
+/**
+ * Factory function to create an EGraphBuilder
+ */
+export declare function createEGraphBuilder(): EGraphBuilder;
+//# sourceMappingURL=EGraphBuilder.d.ts.map

package/dist/egraph/EGraphBuilder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EGraphBuilder.d.ts","sourceRoot":"","sources":["../../src/egraph/EGraphBuilder.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAG1C;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,qCAAqC;IACrC,KAAK,CAAC,QAAQ,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC;IAE1C,mCAAmC;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;CACxD;AA2BD;;GAEG;AACH,wBAAgB,mBAAmB,IAAI,aAAa,CAEnD"}

package/dist/egraph/EGraphBuilder.js

@@ -0,0 +1,37 @@
+/**
+ * EGraphBuilder - Build e-graphs from patterns
+ *
+ * REQ-LL-004: E-graph最適化
+ * DES-PHASE2-001: E-Graph Optimizer / EGraphBuilder
+ *
+ * @stub This is a stub implementation. Full implementation in M3.
+ */
+import { createEGraph } from './EGraph.js';
+/**
+ * Default EGraphBuilder implementation (stub)
+ */
+class EGraphBuilderImpl {
+    build(patterns) {
+        const graph = createEGraph();
+        for (const pattern of patterns) {
+            // Add pattern as a node
+            graph.add({
+                op: pattern.name,
+                children: [],
+            });
+        }
+        return graph;
+    }
+    saturate(graph, _rules) {
+        // Stub: return graph unchanged
+        // Full implementation would apply rules until fixpoint
+        return graph;
+    }
+}
+/**
+ * Factory function to create an EGraphBuilder
+ */
+export function createEGraphBuilder() {
+    return new EGraphBuilderImpl();
+}
+//# sourceMappingURL=EGraphBuilder.js.map

package/dist/egraph/EGraphBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EGraphBuilder.js","sourceRoot":"","sources":["../../src/egraph/EGraphBuilder.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAa3C;;GAEG;AACH,MAAM,iBAAiB;IACrB,KAAK,CAAC,QAA0B;QAC9B,MAAM,KAAK,GAAG,YAAY,EAAE,CAAC;QAE7B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,wBAAwB;YACxB,KAAK,CAAC,GAAG,CAAC;gBACR,EAAE,EAAE,OAAO,CAAC,IAAI;gBAChB,QAAQ,EAAE,EAAE;aACb,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,MAAsB;QAC5C,+BAA+B;QAC/B,uDAAuD;QACvD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO,IAAI,iBAAiB,EAAE,CAAC;AACjC,CAAC"}

package/dist/egraph/Extractor.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Extractor - Extract optimal expressions from e-graphs
+ *
+ * REQ-LL-004: E-graph最適化
+ * DES-PHASE2-001: E-Graph Optimizer / Extractor
+ *
+ * @stub This is a stub implementation. Full implementation in M3.
+ */
+import type { EClassId, CostFunction, OptimalExpression } from '../types.js';
+import type { EGraph } from './EGraph.js';
+/**
+ * Extractor interface
+ */
+export interface Extractor {
+    /** Extract the optimal expression from an e-graph */
+    extract(graph: EGraph, costFn: CostFunction): OptimalExpression;
+    /** Extract from a specific e-class */
+    extractFromClass(graph: EGraph, classId: EClassId, costFn: CostFunction): OptimalExpression;
+}
+/**
+ * Factory function to create an Extractor
+ */
+export declare function createExtractor(): Extractor;
+//# sourceMappingURL=Extractor.d.ts.map

package/dist/egraph/Extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Extractor.d.ts","sourceRoot":"","sources":["../../src/egraph/Extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAE1C;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,qDAAqD;IACrD,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,GAAG,iBAAiB,CAAC;IAEhE,sCAAsC;IACtC,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,GAAG,iBAAiB,CAAC;CAC7F;AAsDD;;GAEG;AACH,wBAAgB,eAAe,IAAI,SAAS,CAE3C"}

package/dist/egraph/Extractor.js

@@ -0,0 +1,61 @@
+/**
+ * Extractor - Extract optimal expressions from e-graphs
+ *
+ * REQ-LL-004: E-graph最適化
+ * DES-PHASE2-001: E-Graph Optimizer / Extractor
+ *
+ * @stub This is a stub implementation. Full implementation in M3.
+ */
+/**
+ * Default Extractor implementation (stub)
+ */
+class ExtractorImpl {
+    extract(graph, costFn) {
+        const classes = graph.getAllClasses();
+        if (classes.length === 0) {
+            return {
+                root: -1,
+                ast: { type: 'Empty' },
+                cost: Infinity,
+            };
+        }
+        // Find the root (class with no parents)
+        const root = classes.find((c) => c.parents.size === 0) ?? classes[0];
+        return this.extractFromClass(graph, root.id, costFn);
+    }
+    extractFromClass(graph, classId, costFn) {
+        const eclass = graph.getEClass(classId);
+        if (!eclass || eclass.nodes.length === 0) {
+            return {
+                root: classId,
+                ast: { type: 'Empty' },
+                cost: Infinity,
+            };
+        }
+        // Find the lowest cost node
+        let bestNode = eclass.nodes[0];
+        let bestCost = costFn(bestNode, []);
+        for (const node of eclass.nodes) {
+            const cost = costFn(node, []);
+            if (cost < bestCost) {
+                bestCost = cost;
+                bestNode = node;
+            }
+        }
+        return {
+            root: classId,
+            ast: {
+                type: bestNode.op,
+                children: [],
+            },
+            cost: bestCost,
+        };
+    }
+}
+/**
+ * Factory function to create an Extractor
+ */
+export function createExtractor() {
+    return new ExtractorImpl();
+}
+//# sourceMappingURL=Extractor.js.map

package/dist/egraph/Extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Extractor.js","sourceRoot":"","sources":["../../src/egraph/Extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAgBH;;GAEG;AACH,MAAM,aAAa;IACjB,OAAO,CAAC,KAAa,EAAE,MAAoB;QACzC,MAAM,OAAO,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO;gBACL,IAAI,EAAE,CAAC,CAAC;gBACR,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;gBACtB,IAAI,EAAE,QAAQ;aACf,CAAC;QACJ,CAAC;QAED,wCAAwC;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IAED,gBAAgB,CAAC,KAAa,EAAE,OAAiB,EAAE,MAAoB;QACrE,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzC,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;gBACtB,IAAI,EAAE,QAAQ;aACf,CAAC;QACJ,CAAC;QAED,4BAA4B;QAC5B,IAAI,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAEpC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC9B,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACpB,QAAQ,GAAG,IAAI,CAAC;gBAChB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI,EAAE,OAAO;YACb,GAAG,EAAE;gBACH,IAAI,EAAE,QAAQ,CAAC,EAAE;gBACjB,QAAQ,EAAE,EAAE;aACb;YACD,IAAI,EAAE,QAAQ;SACf,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,eAAe;IAC7B,OAAO,IAAI,aAAa,EAAE,CAAC;AAC7B,CAAC"}

package/dist/egraph/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * E-Graph exports
+ */
+export type { EGraph } from './EGraph.js';
+export { createEGraph } from './EGraph.js';
+export type { EGraphBuilder } from './EGraphBuilder.js';
+export { createEGraphBuilder } from './EGraphBuilder.js';
+export type { Extractor } from './Extractor.js';
+export { createExtractor } from './Extractor.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/egraph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/egraph/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,YAAY,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,YAAY,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,YAAY,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/egraph/index.js

@@ -0,0 +1,7 @@
+/**
+ * E-Graph exports
+ */
+export { createEGraph } from './EGraph.js';
+export { createEGraphBuilder } from './EGraphBuilder.js';
+export { createExtractor } from './Extractor.js';
+//# sourceMappingURL=index.js.map

package/dist/egraph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/egraph/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAEzD,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC"}