@openrewrite/rewrite 8.66.0 → 8.66.1

package/dist/javascript/templating/comparator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comparator.d.ts","sourceRoot":"","sources":["../../../src/javascript/templating/comparator.ts"],"names":[],"mappings":"AAeA,OAAO,EAAC,MAAM,EAAE,IAAI,EAAC,MAAM,OAAO,CAAC;AACnC,OAAO,EAAC,CAAC,EAAC,MAAM,YAAY,CAAC;AAC7B,OAAO,EAAC,EAAE,EAAC,MAAM,UAAU,CAAC;AAC5B,OAAO,EAAC,mCAAmC,EAAC,MAAM,eAAe,CAAC;AAClE,OAAO,EAAmB,mBAAmB,EAAC,MAAM,SAAS,CAAC;AAE9D;;;;GAIG;AACH,qBAAa,yBAA0B,SAAQ,mCAAmC;IAE1E,OAAO,CAAC,QAAQ,CAAC,OAAO;gBAAP,OAAO,EAAE;QACtB,aAAa,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC;QAC9E,qBAAqB,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC;QAC5F,SAAS,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;QAClD,YAAY,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,KAAK,IAAI,CAAC;KACnE,EACD,mBAAmB,GAAE,OAAc;IAMvC;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAYb,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IAkBzF,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO;IAK/B,eAAe,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IAS3E,qBAAqB,CAAC,gBAAgB,EAAE,CAAC,CAAC,gBAAgB,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IA2D7F,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IA2B5D,sBAAsB,CAAC,eAAe,EAAE,EAAE,CAAC,eAAe,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IA2B5G;;;OAGG;YACW,cAAc;IAI5B;;;;;;;;;;;OAWG;YACW,aAAa;IAI3B;;;;;;;;;;;OAWG;YACW,sBAAsB;CAiMvC"}

package/dist/javascript/templating/comparator.js

@@ -0,0 +1,393 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PatternMatchingComparator = void 0;
+/*
+ * Copyright 2025 the original author or authors.
+ * <p>
+ * Licensed under the Moderne Source Available License (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ * <p>
+ * https://docs.moderne.io/licensing/moderne-source-available-license
+ * <p>
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+const __1 = require("../..");
+const java_1 = require("../../java");
+const index_1 = require("../index");
+const comparator_1 = require("../comparator");
+const utils_1 = require("./utils");
+/**
+ * A comparator for pattern matching that is lenient about optional properties.
+ * Allows patterns without type annotations to match actual code with type annotations.
+ * Uses semantic comparison to match semantically equivalent code (e.g., isDate() and util.isDate()).
+ */
+class PatternMatchingComparator extends comparator_1.JavaScriptSemanticComparatorVisitor {
+    constructor(matcher, lenientTypeMatching = true) {
+        // Enable lenient type matching based on pattern configuration (default: true for backward compatibility)
+        super(lenientTypeMatching);
+        this.matcher = matcher;
+    }
+    /**
+     * Extracts the wrapper from the cursor if the parent is a RightPadded.
+     */
+    getWrapperFromCursor(cursor) {
+        if (!cursor.parent) {
+            return undefined;
+        }
+        const parent = cursor.parent.value;
+        // Check if parent is a RightPadded by checking its kind
+        if (parent.kind === java_1.J.Kind.RightPadded) {
+            return parent;
+        }
+        return undefined;
+    }
+    visit(j, p, parent) {
+        const _super = Object.create(null, {
+            visit: { get: () => super.visit }
+        });
+        return __awaiter(this, void 0, void 0, function* () {
+            // Check if the pattern node is a capture - this handles captures anywhere in the tree
+            if (utils_1.PlaceholderUtils.isCapture(j)) {
+                const wrapper = this.getWrapperFromCursor(this.cursor);
+                const success = this.matcher.handleCapture(j, p, wrapper);
+                if (!success) {
+                    return this.abort(j);
+                }
+                return j;
+            }
+            if (!this.match) {
+                return j;
+            }
+            return _super.visit.call(this, j, p, parent);
+        });
+    }
+    hasSameKind(j, other) {
+        return super.hasSameKind(j, other) ||
+            (j.kind == java_1.J.Kind.Identifier && utils_1.PlaceholderUtils.isCapture(j));
+    }
+    visitIdentifier(identifier, other) {
+        const _super = Object.create(null, {
+            visitIdentifier: { get: () => super.visitIdentifier }
+        });
+        return __awaiter(this, void 0, void 0, function* () {
+            if (utils_1.PlaceholderUtils.isCapture(identifier)) {
+                const wrapper = this.getWrapperFromCursor(this.cursor);
+                const success = this.matcher.handleCapture(identifier, other, wrapper);
+                return success ? identifier : this.abort(identifier);
+            }
+            return _super.visitIdentifier.call(this, identifier, other);
+        });
+    }
+    visitMethodInvocation(methodInvocation, other) {
+        const _super = Object.create(null, {
+            visitMethodInvocation: { get: () => super.visitMethodInvocation }
+        });
+        return __awaiter(this, void 0, void 0, function* () {
+            // Check if any arguments are variadic captures
+            const hasVariadicCapture = methodInvocation.arguments.elements.some(arg => utils_1.PlaceholderUtils.isVariadicCapture(arg.element));
+            // If no variadic captures, use parent implementation (which includes semantic/type-aware matching)
+            if (!hasVariadicCapture) {
+                return _super.visitMethodInvocation.call(this, methodInvocation, other);
+            }
+            // Otherwise, handle variadic captures ourselves
+            if (!this.match || other.kind !== java_1.J.Kind.MethodInvocation) {
+                return this.abort(methodInvocation);
+            }
+            const otherMethodInvocation = other;
+            // Compare select
+            if ((methodInvocation.select === undefined) !== (otherMethodInvocation.select === undefined)) {
+                return this.abort(methodInvocation);
+            }
+            // Visit select if present
+            if (methodInvocation.select && otherMethodInvocation.select) {
+                yield this.visit(methodInvocation.select.element, otherMethodInvocation.select.element);
+                if (!this.match)
+                    return methodInvocation;
+            }
+            // Compare typeParameters
+            if ((methodInvocation.typeParameters === undefined) !== (otherMethodInvocation.typeParameters === undefined)) {
+                return this.abort(methodInvocation);
+            }
+            // Visit typeParameters if present
+            if (methodInvocation.typeParameters && otherMethodInvocation.typeParameters) {
+                if (methodInvocation.typeParameters.elements.length !== otherMethodInvocation.typeParameters.elements.length) {
+                    return this.abort(methodInvocation);
+                }
+                // Visit each type parameter in lock step
+                for (let i = 0; i < methodInvocation.typeParameters.elements.length; i++) {
+                    yield this.visit(methodInvocation.typeParameters.elements[i].element, otherMethodInvocation.typeParameters.elements[i].element);
+                    if (!this.match)
+                        return methodInvocation;
+                }
+            }
+            // Visit name
+            yield this.visit(methodInvocation.name, otherMethodInvocation.name);
+            if (!this.match)
+                return methodInvocation;
+            // Special handling for variadic captures in arguments
+            if (!(yield this.matchArguments(methodInvocation.arguments.elements, otherMethodInvocation.arguments.elements))) {
+                return this.abort(methodInvocation);
+            }
+            return methodInvocation;
+        });
+    }
+    visitBlock(block, other) {
+        const _super = Object.create(null, {
+            visitBlock: { get: () => super.visitBlock }
+        });
+        return __awaiter(this, void 0, void 0, function* () {
+            // Check if any statements have CaptureMarker indicating they're variadic
+            const hasVariadicCapture = block.statements.some(stmt => {
+                const captureMarker = utils_1.PlaceholderUtils.getCaptureMarker(stmt.element);
+                return (captureMarker === null || captureMarker === void 0 ? void 0 : captureMarker.variadicOptions) !== undefined;
+            });
+            // If no variadic captures, use parent implementation
+            if (!hasVariadicCapture) {
+                return _super.visitBlock.call(this, block, other);
+            }
+            // Otherwise, handle variadic captures ourselves
+            if (!this.match || other.kind !== java_1.J.Kind.Block) {
+                return this.abort(block);
+            }
+            const otherBlock = other;
+            // Special handling for variadic captures in statements
+            if (!(yield this.matchSequence(block.statements, otherBlock.statements, false))) {
+                return this.abort(block);
+            }
+            return block;
+        });
+    }
+    visitJsCompilationUnit(compilationUnit, other) {
+        const _super = Object.create(null, {
+            visitJsCompilationUnit: { get: () => super.visitJsCompilationUnit }
+        });
+        return __awaiter(this, void 0, void 0, function* () {
+            // Check if any statements are variadic captures (unwrap ExpressionStatement wrappers first)
+            const hasVariadicCapture = compilationUnit.statements.some(stmt => {
+                const unwrapped = utils_1.PlaceholderUtils.unwrapStatementCapture(stmt.element);
+                return utils_1.PlaceholderUtils.isVariadicCapture(unwrapped);
+            });
+            // If no variadic captures, use parent implementation
+            if (!hasVariadicCapture) {
+                return _super.visitJsCompilationUnit.call(this, compilationUnit, other);
+            }
+            // Otherwise, handle variadic captures ourselves
+            if (!this.match || other.kind !== index_1.JS.Kind.CompilationUnit) {
+                return this.abort(compilationUnit);
+            }
+            const otherCompilationUnit = other;
+            // Special handling for variadic captures in top-level statements
+            if (!(yield this.matchSequence(compilationUnit.statements, otherCompilationUnit.statements, false))) {
+                return this.abort(compilationUnit);
+            }
+            return compilationUnit;
+        });
+    }
+    /**
+     * Matches argument lists, with special handling for variadic captures.
+     * A variadic capture can match zero or more consecutive arguments.
+     */
+    matchArguments(patternArgs, targetArgs) {
+        return __awaiter(this, void 0, void 0, function* () {
+            return this.matchSequence(patternArgs, targetArgs, true);
+        });
+    }
+    /**
+     * Generic sequence matching with variadic capture support.
+     * Works for any sequence of JRightPadded elements (arguments, statements, etc.).
+     * A variadic capture can match zero or more consecutive elements.
+     *
+     * Uses pivot detection to optimize matching, with backtracking as fallback.
+     *
+     * @param patternElements The pattern elements (JRightPadded)
+     * @param targetElements The target elements to match against (JRightPadded)
+     * @param filterEmpty Whether to filter out J.Empty elements when capturing (true for arguments, false for statements)
+     * @returns true if the sequence matches, false otherwise
+     */
+    matchSequence(patternElements, targetElements, filterEmpty) {
+        return __awaiter(this, void 0, void 0, function* () {
+            return yield this.matchSequenceOptimized(patternElements, targetElements, 0, 0, filterEmpty);
+        });
+    }
+    /**
+     * Optimized sequence matcher with pivot detection and backtracking.
+     * For variadic patterns, tries to detect pivots (where next pattern matches) to avoid
+     * unnecessary backtracking. Falls back to full backtracking when pivots are ambiguous.
+     *
+     * @param patternElements The pattern elements (JRightPadded)
+     * @param targetElements The target elements to match against (JRightPadded)
+     * @param patternIdx Current position in pattern
+     * @param targetIdx Current position in target
+     * @param filterEmpty Whether to filter out J.Empty elements when capturing
+     * @returns true if the remaining sequence matches, false otherwise
+     */
+    matchSequenceOptimized(patternElements, targetElements, patternIdx, targetIdx, filterEmpty) {
+        return __awaiter(this, void 0, void 0, function* () {
+            var _a, _b;
+            // Base case: all patterns matched
+            if (patternIdx >= patternElements.length) {
+                return targetIdx >= targetElements.length; // Success if all targets consumed
+            }
+            const patternElement = patternElements[patternIdx].element;
+            const captureMarker = utils_1.PlaceholderUtils.getCaptureMarker(patternElement);
+            const isVariadic = (captureMarker === null || captureMarker === void 0 ? void 0 : captureMarker.variadicOptions) !== undefined;
+            if (isVariadic) {
+                // Variadic pattern: try different consumption amounts with backtracking
+                const variadicOptions = captureMarker.variadicOptions;
+                const min = (_a = variadicOptions === null || variadicOptions === void 0 ? void 0 : variadicOptions.min) !== null && _a !== void 0 ? _a : 0;
+                const max = (_b = variadicOptions === null || variadicOptions === void 0 ? void 0 : variadicOptions.max) !== null && _b !== void 0 ? _b : Infinity;
+                // Calculate maximum possible consumption
+                let nonVariadicRemainingPatterns = 0;
+                for (let i = patternIdx + 1; i < patternElements.length; i++) {
+                    const nextPatternElement = patternElements[i].element;
+                    const nextCaptureMarker = utils_1.PlaceholderUtils.getCaptureMarker(nextPatternElement);
+                    const nextIsVariadic = (nextCaptureMarker === null || nextCaptureMarker === void 0 ? void 0 : nextCaptureMarker.variadicOptions) !== undefined;
+                    if (!nextIsVariadic) {
+                        nonVariadicRemainingPatterns++;
+                    }
+                }
+                const remainingTargetElements = targetElements.length - targetIdx;
+                const maxPossible = Math.min(remainingTargetElements - nonVariadicRemainingPatterns, max);
+                // Pivot detection optimization: try to find where next pattern matches
+                // This avoids unnecessary backtracking when constraints make the split point obvious
+                let pivotDetected = false;
+                let pivotAt = -1;
+                if (patternIdx + 1 < patternElements.length && min <= maxPossible) {
+                    const nextPattern = patternElements[patternIdx + 1].element;
+                    // Scan through possible consumption amounts starting from min
+                    for (let tryConsume = min; tryConsume <= maxPossible; tryConsume++) {
+                        // Check if element after our consumption would match next pattern
+                        if (targetIdx + tryConsume < targetElements.length) {
+                            const candidateElement = targetElements[targetIdx + tryConsume].element;
+                            // Skip J.Empty for arguments
+                            if (filterEmpty && candidateElement.kind === java_1.J.Kind.Empty) {
+                                continue;
+                            }
+                            // Test if next pattern matches this element
+                            const savedMatch = this.match;
+                            const savedState = this.matcher.saveState();
+                            yield this.visit(nextPattern, candidateElement);
+                            const matchesNext = this.match;
+                            this.match = savedMatch;
+                            this.matcher.restoreState(savedState);
+                            if (matchesNext) {
+                                // Found pivot! Try this consumption amount first
+                                pivotDetected = true;
+                                pivotAt = tryConsume;
+                                break;
+                            }
+                        }
+                    }
+                }
+                // Try different consumption amounts
+                // If pivot detected, try that first; otherwise use greedy approach (max to min)
+                const consumptionOrder = [];
+                if (pivotDetected && pivotAt >= 0) {
+                    // Try pivot first, then others as fallback
+                    consumptionOrder.push(pivotAt);
+                    for (let c = maxPossible; c >= min; c--) {
+                        if (c !== pivotAt) {
+                            consumptionOrder.push(c);
+                        }
+                    }
+                }
+                else {
+                    // Greedy approach: max to min
+                    for (let c = maxPossible; c >= min; c--) {
+                        consumptionOrder.push(c);
+                    }
+                }
+                for (const consume of consumptionOrder) {
+                    // Capture elements for this consumption amount
+                    const capturedWrappers = [];
+                    for (let i = 0; i < consume; i++) {
+                        const wrapped = targetElements[targetIdx + i];
+                        const element = wrapped.element;
+                        // For arguments, filter out J.Empty as it represents an empty argument list
+                        // For statements, include all elements
+                        if (!filterEmpty || element.kind !== java_1.J.Kind.Empty) {
+                            capturedWrappers.push(wrapped);
+                        }
+                    }
+                    // Extract just the elements for the constraint check
+                    const capturedElements = capturedWrappers.map(w => w.element);
+                    // Re-check min/max constraints against actual captured elements (after filtering if applicable)
+                    if (capturedElements.length < min || capturedElements.length > max) {
+                        continue; // Try next consumption amount
+                    }
+                    // Save current state for backtracking
+                    const savedState = this.matcher.saveState();
+                    // Handle the variadic capture
+                    const success = this.matcher.handleVariadicCapture(patternElement, capturedElements, capturedWrappers);
+                    if (!success) {
+                        // Restore state and try next amount
+                        this.matcher.restoreState(savedState);
+                        continue;
+                    }
+                    // Try to match the rest of the pattern
+                    const restMatches = yield this.matchSequenceOptimized(patternElements, targetElements, patternIdx + 1, targetIdx + consume, filterEmpty);
+                    if (restMatches) {
+                        return true; // Found a valid matching
+                    }
+                    // Backtrack: restore state and try next amount
+                    this.matcher.restoreState(savedState);
+                }
+                return false; // No consumption amount worked
+            }
+            else {
+                // Regular non-variadic element - must match exactly one target element
+                if (targetIdx >= targetElements.length) {
+                    return false; // Pattern has more elements than target
+                }
+                const targetWrapper = targetElements[targetIdx];
+                const targetElement = targetWrapper.element;
+                // For arguments, J.Empty represents no argument, so regular captures should not match it
+                if (filterEmpty && targetElement.kind === java_1.J.Kind.Empty) {
+                    return false;
+                }
+                // Save current state for backtracking (both match state and capture bindings)
+                const savedMatch = this.match;
+                const savedState = this.matcher.saveState();
+                // Push wrapper onto cursor so captures can access it
+                const savedCursor = this.cursor;
+                this.cursor = new __1.Cursor(targetWrapper, this.cursor);
+                try {
+                    yield this.visit(patternElement, targetElement);
+                }
+                finally {
+                    this.cursor = savedCursor;
+                }
+                if (!this.match) {
+                    // Restore state on match failure
+                    this.match = savedMatch;
+                    this.matcher.restoreState(savedState);
+                    return false;
+                }
+                // Continue matching the rest
+                const restMatches = yield this.matchSequenceOptimized(patternElements, targetElements, patternIdx + 1, targetIdx + 1, filterEmpty);
+                if (!restMatches) {
+                    // Restore full state on backtracking failure
+                    this.match = savedMatch;
+                    this.matcher.restoreState(savedState);
+                }
+                return restMatches;
+            }
+        });
+    }
+}
+exports.PatternMatchingComparator = PatternMatchingComparator;
+//# sourceMappingURL=comparator.js.map

package/dist/javascript/templating/comparator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"comparator.js","sourceRoot":"","sources":["../../../src/javascript/templating/comparator.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA;;;;;;;;;;;;;;GAcG;AACH,6BAAmC;AACnC,qCAA6B;AAC7B,oCAA4B;AAC5B,8CAAkE;AAClE,mCAA8D;AAE9D;;;;GAIG;AACH,MAAa,yBAA0B,SAAQ,gDAAmC;IAC9E,YACqB,OAKhB,EACD,sBAA+B,IAAI;QAEnC,yGAAyG;QACzG,KAAK,CAAC,mBAAmB,CAAC,CAAC;QATV,YAAO,GAAP,OAAO,CAKvB;IAKL,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,MAAc;QACvC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;QACnC,wDAAwD;QACxD,IAAK,MAAc,CAAC,IAAI,KAAK,QAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAC9C,OAAO,MAA0B,CAAC;QACtC,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAEc,KAAK,CAAc,CAAO,EAAE,CAAI,EAAE,MAAe;;;;;YAC5D,sFAAsF;YACtF,IAAI,wBAAgB,CAAC,SAAS,CAAC,CAAM,CAAC,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC/D,IAAI,CAAC,OAAO,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAM,CAAC;gBAC9B,CAAC;gBACD,OAAO,CAAM,CAAC;YAClB,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACd,OAAO,CAAM,CAAC;YAClB,CAAC;YAED,OAAO,OAAM,KAAK,YAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE;QACrC,CAAC;KAAA;IAES,WAAW,CAAC,CAAI,EAAE,KAAQ;QAChC,OAAO,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,KAAK,CAAC;YAC3B,CAAC,CAAC,CAAC,IAAI,IAAI,QAAC,CAAC,IAAI,CAAC,UAAU,IAAI,wBAAgB,CAAC,SAAS,CAAC,CAAiB,CAAC,CAAC,CAAC;IAC1F,CAAC;IAEc,eAAe,CAAC,UAAwB,EAAE,KAAQ;;;;;YAC7D,IAAI,wBAAgB,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;gBACzC,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;gBACvE,OAAO,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACzD,CAAC;YACD,OAAO,OAAM,eAAe,YAAC,UAAU,EAAE,KAAK,EAAE;QACpD,CAAC;KAAA;IAEc,qBAAqB,CAAC,gBAAoC,EAAE,KAAQ;;;;;YAC/E,+CAA+C;YAC/C,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CACtE,wBAAgB,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,CAClD,CAAC;YAEF,mGAAmG;YACnG,IAAI,CAAC,kBAAkB,EAAE,CAAC;gBACtB,OAAO,OAAM,qBAAqB,YAAC,gBAAgB,EAAE,KAAK,EAAE;YAChE,CAAC;YAED,gDAAgD;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,QAAC,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxD,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACxC,CAAC;YAED,MAAM,qBAAqB,GAAG,KAA2B,CAAC;YAE1D,iBAAiB;YACjB,IAAI,CAAC,gBAAgB,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;gBAC3F,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACxC,CAAC;YAED,0BAA0B;YAC1B,IAAI,gBAAgB,CAAC,MAAM,IAAI,qBAAqB,CAAC,MAAM,EAAE,CAAC;gBAC1D,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,qBAAqB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACxF,IAAI,CAAC,IAAI,CAAC,KAAK;oBAAE,OAAO,gBAAgB,CAAC;YAC7C,CAAC;YAED,yBAAyB;YACzB,IAAI,CAAC,gBAAgB,CAAC,cAAc,KAAK,SAAS,CAAC,KAAK,CAAC,qBAAqB,CAAC,cAAc,KAAK,SAAS,CAAC,EAAE,CAAC;gBAC3G,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACxC,CAAC;YAED,kCAAkC;YAClC,IAAI,gBAAgB,CAAC,cAAc,IAAI,qBAAqB,CAAC,cAAc,EAAE,CAAC;gBAC1E,IAAI,gBAAgB,CAAC,cAAc,CAAC,QAAQ,CAAC,MAAM,KAAK,qBAAqB,CAAC,cAAc,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;oBAC3G,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBACxC,CAAC;gBAED,yCAAyC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,cAAc,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvE,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,qBAAqB,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAChI,IAAI,CAAC,IAAI,CAAC,KAAK;wBAAE,OAAO,gBAAgB,CAAC;gBAC7C,CAAC;YACL,CAAC;YAED,aAAa;YACb,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,qBAAqB,CAAC,IAAI,CAAC,CAAC;YACpE,IAAI,CAAC,IAAI,CAAC,KAAK;gBAAE,OAAO,gBAAgB,CAAC;YAEzC,sDAAsD;YACtD,IAAI,CAAC,CAAA,MAAM,IAAI,CAAC,cAAc,CAAC,gBAAgB,CAAC,SAAS,CAAC,QAAQ,EAAE,qBAAqB,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA,EAAE,CAAC;gBAC5G,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACxC,CAAC;YAED,OAAO,gBAAgB,CAAC;QAC5B,CAAC;KAAA;IAEc,UAAU,CAAC,KAAc,EAAE,KAAQ;;;;;YAC9C,yEAAyE;YACzE,MAAM,kBAAkB,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACpD,MAAM,aAAa,GAAG,wBAAgB,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtE,OAAO,CAAA,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,eAAe,MAAK,SAAS,CAAC;YACxD,CAAC,CAAC,CAAC;YAEH,qDAAqD;YACrD,IAAI,CAAC,kBAAkB,EAAE,CAAC;gBACtB,OAAO,OAAM,UAAU,YAAC,KAAK,EAAE,KAAK,EAAE;YAC1C,CAAC;YAED,gDAAgD;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,QAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YAED,MAAM,UAAU,GAAG,KAAgB,CAAC;YAEpC,uDAAuD;YACvD,IAAI,CAAC,CAAA,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA,EAAE,CAAC;gBAC5E,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YAED,OAAO,KAAK,CAAC;QACjB,CAAC;KAAA;IAEc,sBAAsB,CAAC,eAAmC,EAAE,KAAQ;;;;;YAC/E,4FAA4F;YAC5F,MAAM,kBAAkB,GAAG,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC9D,MAAM,SAAS,GAAG,wBAAgB,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxE,OAAO,wBAAgB,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YAEH,qDAAqD;YACrD,IAAI,CAAC,kBAAkB,EAAE,CAAC;gBACtB,OAAO,OAAM,sBAAsB,YAAC,eAAe,EAAE,KAAK,EAAE;YAChE,CAAC;YAED,gDAAgD;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,UAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;gBACxD,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvC,CAAC;YAED,MAAM,oBAAoB,GAAG,KAA2B,CAAC;YAEzD,iEAAiE;YACjE,IAAI,CAAC,CAAA,MAAM,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,UAAU,EAAE,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA,EAAE,CAAC;gBAChG,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvC,CAAC;YAED,OAAO,eAAe,CAAC;QAC3B,CAAC;KAAA;IAED;;;OAGG;IACW,cAAc,CAAC,WAA+B,EAAE,UAA8B;;YACxF,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;QAC7D,CAAC;KAAA;IAED;;;;;;;;;;;OAWG;IACW,aAAa,CAAC,eAAmC,EAAE,cAAkC,EAAE,WAAoB;;YACrH,OAAO,MAAM,IAAI,CAAC,sBAAsB,CAAC,eAAe,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QACjG,CAAC;KAAA;IAED;;;;;;;;;;;OAWG;IACW,sBAAsB,CAChC,eAAmC,EACnC,cAAkC,EAClC,UAAkB,EAClB,SAAiB,EACjB,WAAoB;;;YAEpB,kCAAkC;YAClC,IAAI,UAAU,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;gBACvC,OAAO,SAAS,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,kCAAkC;YACjF,CAAC;YAED,MAAM,cAAc,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC;YAC3D,MAAM,aAAa,GAAG,wBAAgB,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC;YACxE,MAAM,UAAU,GAAG,CAAA,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,eAAe,MAAK,SAAS,CAAC;YAEhE,IAAI,UAAU,EAAE,CAAC;gBACb,wEAAwE;gBACxE,MAAM,eAAe,GAAG,aAAc,CAAC,eAAe,CAAC;gBACvD,MAAM,GAAG,GAAG,MAAA,eAAe,aAAf,eAAe,uBAAf,eAAe,CAAE,GAAG,mCAAI,CAAC,CAAC;gBACtC,MAAM,GAAG,GAAG,MAAA,eAAe,aAAf,eAAe,uBAAf,eAAe,CAAE,GAAG,mCAAI,QAAQ,CAAC;gBAE7C,yCAAyC;gBACzC,IAAI,4BAA4B,GAAG,CAAC,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3D,MAAM,kBAAkB,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;oBACtD,MAAM,iBAAiB,GAAG,wBAAgB,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;oBAChF,MAAM,cAAc,GAAG,CAAA,iBAAiB,aAAjB,iBAAiB,uBAAjB,iBAAiB,CAAE,eAAe,MAAK,SAAS,CAAC;oBACxE,IAAI,CAAC,cAAc,EAAE,CAAC;wBAClB,4BAA4B,EAAE,CAAC;oBACnC,CAAC;gBACL,CAAC;gBACD,MAAM,uBAAuB,GAAG,cAAc,CAAC,MAAM,GAAG,SAAS,CAAC;gBAClE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,uBAAuB,GAAG,4BAA4B,EAAE,GAAG,CAAC,CAAC;gBAE1F,uEAAuE;gBACvE,qFAAqF;gBACrF,IAAI,aAAa,GAAG,KAAK,CAAC;gBAC1B,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;gBAEjB,IAAI,UAAU,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC;oBAChE,MAAM,WAAW,GAAG,eAAe,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;oBAE5D,8DAA8D;oBAC9D,KAAK,IAAI,UAAU,GAAG,GAAG,EAAE,UAAU,IAAI,WAAW,EAAE,UAAU,EAAE,EAAE,CAAC;wBACjE,kEAAkE;wBAClE,IAAI,SAAS,GAAG,UAAU,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;4BACjD,MAAM,gBAAgB,GAAG,cAAc,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC,OAAO,CAAC;4BAExE,6BAA6B;4BAC7B,IAAI,WAAW,IAAI,gBAAgB,CAAC,IAAI,KAAK,QAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gCACxD,SAAS;4BACb,CAAC;4BAED,4CAA4C;4BAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;4BAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;4BAE5C,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC;4BAChD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;4BAE/B,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;4BACxB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;4BAEtC,IAAI,WAAW,EAAE,CAAC;gCACd,iDAAiD;gCACjD,aAAa,GAAG,IAAI,CAAC;gCACrB,OAAO,GAAG,UAAU,CAAC;gCACrB,MAAM;4BACV,CAAC;wBACL,CAAC;oBACL,CAAC;gBACL,CAAC;gBAED,oCAAoC;gBACpC,gFAAgF;gBAChF,MAAM,gBAAgB,GAAa,EAAE,CAAC;gBACtC,IAAI,aAAa,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;oBAChC,2CAA2C;oBAC3C,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAC/B,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;4BAChB,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC7B,CAAC;oBACL,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACJ,8BAA8B;oBAC9B,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC7B,CAAC;gBACL,CAAC;gBAED,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;oBACrC,+CAA+C;oBAC/C,MAAM,gBAAgB,GAAuB,EAAE,CAAC;oBAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC/B,MAAM,OAAO,GAAG,cAAc,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;wBAC9C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;wBAChC,4EAA4E;wBAC5E,uCAAuC;wBACvC,IAAI,CAAC,WAAW,IAAI,OAAO,CAAC,IAAI,KAAK,QAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;4BAChD,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;wBACnC,CAAC;oBACL,CAAC;oBAED,qDAAqD;oBACrD,MAAM,gBAAgB,GAAQ,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAEnE,gGAAgG;oBAChG,IAAI,gBAAgB,CAAC,MAAM,GAAG,GAAG,IAAI,gBAAgB,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;wBACjE,SAAS,CAAC,8BAA8B;oBAC5C,CAAC;oBAED,sCAAsC;oBACtC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;oBAE5C,8BAA8B;oBAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,cAAc,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;oBACvG,IAAI,CAAC,OAAO,EAAE,CAAC;wBACX,oCAAoC;wBACpC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;wBACtC,SAAS;oBACb,CAAC;oBAED,uCAAuC;oBACvC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,sBAAsB,CACjD,eAAe,EACf,cAAc,EACd,UAAU,GAAG,CAAC,EACd,SAAS,GAAG,OAAO,EACnB,WAAW,CACd,CAAC;oBAEF,IAAI,WAAW,EAAE,CAAC;wBACd,OAAO,IAAI,CAAC,CAAC,yBAAyB;oBAC1C,CAAC;oBAED,+CAA+C;oBAC/C,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;gBAC1C,CAAC;gBAED,OAAO,KAAK,CAAC,CAAC,+BAA+B;YACjD,CAAC;iBAAM,CAAC;gBACJ,uEAAuE;gBACvE,IAAI,SAAS,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;oBACrC,OAAO,KAAK,CAAC,CAAC,wCAAwC;gBAC1D,CAAC;gBAED,MAAM,aAAa,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;gBAChD,MAAM,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC;gBAE5C,yFAAyF;gBACzF,IAAI,WAAW,IAAI,aAAa,CAAC,IAAI,KAAK,QAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;oBACrD,OAAO,KAAK,CAAC;gBACjB,CAAC;gBAED,8EAA8E;gBAC9E,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;gBAE5C,qDAAqD;gBACrD,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;gBAChC,IAAI,CAAC,MAAM,GAAG,IAAI,UAAM,CAAC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrD,IAAI,CAAC;oBACD,MAAM,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;gBACpD,CAAC;wBAAS,CAAC;oBACP,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;gBAC9B,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;oBACd,iCAAiC;oBACjC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;oBACxB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;oBACtC,OAAO,KAAK,CAAC;gBACjB,CAAC;gBAED,6BAA6B;gBAC7B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,sBAAsB,CACjD,eAAe,EACf,cAAc,EACd,UAAU,GAAG,CAAC,EACd,SAAS,GAAG,CAAC,EACb,WAAW,CACd,CAAC;gBAEF,IAAI,CAAC,WAAW,EAAE,CAAC;oBACf,6CAA6C;oBAC7C,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;oBACxB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;gBAC1C,CAAC;gBAED,OAAO,WAAW,CAAC;YACvB,CAAC;QACL,CAAC;KAAA;CACJ;AAnZD,8DAmZC"}

package/dist/javascript/templating/engine.d.ts

@@ -0,0 +1,75 @@
+import { Cursor } from '../..';
+import { J } from '../../java';
+import { JavaCoordinates } from './template';
+/**
+ * Parameter specification for template generation.
+ * Represents a placeholder in a template that will be replaced with a parameter value.
+ */
+export interface Parameter {
+    /**
+     * The value to substitute into the template.
+     */
+    value: any;
+}
+/**
+ * Internal template engine - handles the core templating logic.
+ * Not exported from index, so only visible within the templating module.
+ */
+export declare class TemplateEngine {
+    /**
+     * Applies a template with optional match results from pattern matching.
+     *
+     * @param templateParts The string parts of the template
+     * @param parameters The parameters between the string parts
+     * @param cursor The cursor pointing to the current location in the AST
+     * @param coordinates The coordinates specifying where and how to insert the generated AST
+     * @param values Map of capture names to values to replace the parameters with
+     * @param wrappersMap Map of capture names to J.RightPadded wrappers (for preserving markers)
+     * @param contextStatements Context declarations (imports, types, etc.) to prepend for type attribution
+     * @param dependencies NPM dependencies for type attribution
+     * @returns A Promise resolving to the generated AST node
+     */
+    static applyTemplate(templateParts: TemplateStringsArray, parameters: Parameter[], cursor: Cursor, coordinates: JavaCoordinates, values?: Pick<Map<string, J>, 'get'>, wrappersMap?: Pick<Map<string, J.RightPadded<J> | J.RightPadded<J>[]>, 'get'>, contextStatements?: string[], dependencies?: Record<string, string>): Promise<J | undefined>;
+    /**
+     * Builds a template string with parameter placeholders.
+     *
+     * @param templateParts The string parts of the template
+     * @param parameters The parameters between the string parts
+     * @returns The template string
+     */
+    private static buildTemplateString;
+}
+/**
+ * Helper class for applying a template to an AST.
+ */
+export declare class TemplateApplier {
+    private readonly cursor;
+    private readonly coordinates;
+    private readonly ast;
+    constructor(cursor: Cursor, coordinates: JavaCoordinates, ast: J);
+    /**
+     * Applies the template to the current AST.
+     *
+     * @returns A Promise resolving to the modified AST
+     */
+    apply(): Promise<J | undefined>;
+    /**
+     * Applies the template to an expression.
+     *
+     * @returns A Promise resolving to the modified AST
+     */
+    private applyToExpression;
+    /**
+     * Applies the template to a statement.
+     *
+     * @returns A Promise resolving to the modified AST
+     */
+    private applyToStatement;
+    /**
+     * Applies the template to a block.
+     *
+     * @returns A Promise resolving to the modified AST
+     */
+    private applyToBlock;
+}
+//# sourceMappingURL=engine.d.ts.map

package/dist/javascript/templating/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../../../src/javascript/templating/engine.ts"],"names":[],"mappings":"AAeA,OAAO,EAAC,MAAM,EAAS,MAAM,OAAO,CAAC;AACrC,OAAO,EAAC,CAAC,EAAC,MAAM,YAAY,CAAC;AAM7B,OAAO,EAAC,eAAe,EAAC,MAAM,YAAY,CAAC;AAO3C;;;GAGG;AACH,MAAM,WAAW,SAAS;IACtB;;OAEG;IACH,KAAK,EAAE,GAAG,CAAC;CACd;AAED;;;GAGG;AACH,qBAAa,cAAc;IACvB;;;;;;;;;;;;OAYG;WACU,aAAa,CACtB,aAAa,EAAE,oBAAoB,EACnC,UAAU,EAAE,SAAS,EAAE,EACvB,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,eAAe,EAC5B,MAAM,GAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,CAAa,EAC/C,WAAW,GAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAa,EACxF,iBAAiB,GAAE,MAAM,EAAO,EAChC,YAAY,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAM,GAC1C,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IAoEzB;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;CAkCrC;AAED;;GAEG;AACH,qBAAa,eAAe;IAEpB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,GAAG;gBAFH,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,eAAe,EAC5B,GAAG,EAAE,CAAC;IAI3B;;;;OAIG;IACG,KAAK,IAAI,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC;IAgBrC;;;;OAIG;YACW,iBAAiB;IAS/B;;;;OAIG;YACW,gBAAgB;IAS9B;;;;OAIG;YACW,YAAY;CAQ7B"}