vitest-pool-assemblyscript 0.3.1 → 0.5.0

package/README.md

@@ -141,7 +141,7 @@ npx vitest run
 - Suite and test definition using `describe()` and `test()` in AssemblyScript
 - Inline test option configuration for common vitest options: `timeout`, `retry`, `skip`, `only`, `fails`
 - Assertion matching API based on vitest/jest `expect()` API
-  - `.not`, `toBe`, `toBeCloseTo`, `toEqual` (with caveats*), `toStrictEqual`, `toHaveLength`, `toThrowError`, `toBeTruthy`, `toBeFalsy`, `toBeNull`, `toBeNullable`, `toBeNaN`
+  - `.not`, `toBe`, `toBeCloseTo`, `toEqual` (with caveats*), `toStrictEqual`, `toBeGreaterThan`, `toBeGreaterThanOrEqual`, `toBeLessThan`, `toBeLessThanOrEqual`, `toHaveLength`, `toThrowError`, `toBeTruthy`, `toBeFalsy`, `toBeNull`, `toBeNullable`, `toBeNaN`
   - See [Matchers API](docs/matchers-api.md) for details and differences from JavaScript
 - Highlighted diffs for assertion and runtime failures, which point to source code
 - Source-mapped WASM error stack traces (accurate AssemblyScript source `function file:line:column`)
@@ -166,11 +166,15 @@ npx vitest run
 
 | Dependency | Supported Versions |
 |---|---|
-| Node.js | 20, 22, 24+ |
+| Node.js | (20*), 22, 24+ |
 | Vitest | 3.2.x, 4.x |
 | AssemblyScript | 0.28+ |
 
-**Platforms with prebuilt native binaries:**
+>ℹ️ ***Node 20 Support:** If you don't need code coverage, Node 20 should continue to work for test execution.
+>
+>WASM coverage instrumentation is implemented using WebAssembly [multi-memory](https://github.com/WebAssembly/multi-memory) to isolate coverage counters from user test memory. This feature shipped in V8 12.0 / Node 22. 
+
+**Platforms with prebuilt native binaries for coverage instrumentation & debug info:**
 
 | | x64 | arm64 |
 |---|---|---|
@@ -293,7 +297,7 @@ These are known limitations which are currently being worked on.
 - Maybe: Per-file compilation setting override
 
 **Epic: Expand expect matcher API**
-- Planned: `toBeDefined`, `toBeUndefined`, `toBeGreaterThan`, `toBeGreaterThanOrEqual`, `toBeLessThan`, `toBeLessThanOrEqual`, `toContain`, `toContainEqual`
+- Planned: `toBeDefined`, `toBeUndefined`, `toContain`, `toContainEqual`
 - Likely: `toBeOneOf`, `toBeTypeOf`, `toBeInstanceOf`, `toHaveProperty`, `toMatch`
 
 **Epic: Spy and Mock**

package/assembly/compare.ts

@@ -219,6 +219,133 @@ export function equals<T, U>(actual: T, expected: U): bool {
   );
 }
 
+export enum InequalityOperation {
+  LessThan,
+  LessThanOrEqual,
+  GreaterThan,
+  GreaterThanOrEqual,
+}
+
+/**
+ * Applies an inequality operation to two values of the same promoted type.
+ * Handles <, <=, >, >= for any type that supports these operators (numbers, strings).
+ */
+function applyInequalityOp<T>(a: T, b: T, op: InequalityOperation): bool {
+  if (op == InequalityOperation.LessThan) return a < b;
+  if (op == InequalityOperation.LessThanOrEqual) return a <= b;
+  if (op == InequalityOperation.GreaterThan) return a > b;
+  return a >= b; // GreaterThanOrEqual
+}
+
+/**
+ * Generic inequality comparison. Promotes both values to a common type and applies
+ * the requested inequality operation.
+ *
+ * Strings are compared lexicographically. Booleans are treated as integers (true=1, false=0).
+ * Non-string references are not comparable and throw an error.
+ *
+ * Cross-sign integer comparisons are supported (more permissive than AS's own operators)
+ * via signed-negative early return + u64 promotion. Float/integer combinations where the
+ * float's mantissa cannot losslessly represent the integer type's range are rejected,
+ * matching AS compiler behavior. See docs/matcher-research.md for details.
+ */
+export function compareInequality<T, U>(actual: T, compareTo: U, expectedOperation: InequalityOperation): bool {
+  // --- Strings: lexicographic comparison ---
+  if (isString<T>() && isString<U>()) {
+    // Guard against null before casting, mirroring identical()'s pattern
+    const actualIsNull = isNullable<T>() && actual == null;
+    const compareToIsNull = isNullable<U>() && compareTo == null;
+    if (actualIsNull || compareToIsNull) {
+      throw new Error(
+        "Cannot compare null string with inequality operators: the result is undefined."
+        + " Use toBeNull() to check for null values."
+      );
+    }
+    return applyInequalityOp(<string>actual, <string>compareTo, expectedOperation);
+  }
+
+  // --- Reject non-string references (objects, arrays, etc.) ---
+  if (isReference<T>() || isReference<U>()) {
+    throw new Error(
+      "Inequality comparison is not supported for " + nameof<T>() + " and " + nameof<U>()
+      + ". Only numeric types and strings can be compared with inequality matchers."
+    );
+  }
+
+  // --- Float/integer precision-loss rejection ---
+  // Reject combinations where the float's mantissa cannot losslessly represent
+  // the integer type's full range (sizeof(integer) >= sizeof(float)).
+  // This mirrors AS's own operator rejection (e.g. f32 > i32, f64 > i64).
+  if (isFloat<T>() && isInteger<U>()) {
+    if (sizeof<U>() >= sizeof<T>()) {
+      throw new Error(
+        "Cannot compare " + nameof<T>() + " with " + nameof<U>()
+        + ": float precision is insufficient for the integer type's range."
+        + " Cast both values to f64 before comparing, e.g. expect(f64(a)).toBeGreaterThan(f64(b))."
+        + " Note: large integer values may lose precision when cast to f64, which could cause false positives."
+      );
+    }
+  } else if (isInteger<T>() && isFloat<U>()) {
+    if (sizeof<T>() >= sizeof<U>()) {
+      throw new Error(
+        "Cannot compare " + nameof<T>() + " with " + nameof<U>()
+        + ": float precision is insufficient for the integer type's range."
+        + " Cast both values to f64 before comparing, e.g. expect(f64(a)).toBeGreaterThan(f64(b))."
+        + " Note: large integer values may lose precision when cast to f64, which could cause false positives."
+      );
+    }
+  }
+
+  // --- Numeric comparisons ---
+  // Booleans flow through here naturally (isInteger<bool>() is true in AS).
+
+  if (isInteger<T>() && isInteger<U>()) {
+    // Both signed → promote to i64
+    if (isSigned<T>() && isSigned<U>()) {
+      return applyInequalityOp(i64(actual), i64(compareTo), expectedOperation);
+    }
+
+    // Both unsigned → promote to u64
+    if (!isSigned<T>() && !isSigned<U>()) {
+      return applyInequalityOp(u64(actual), u64(compareTo), expectedOperation);
+    }
+
+    // Mixed sign — more permissive than AS, which rejects these at compile time.
+    // If the signed value is negative, the result is deterministic: signed < unsigned.
+    if (isSigned<T>() && !isSigned<U>()) {
+      if (i64(actual) < 0) {
+        // actual (signed negative) is always less than compareTo (unsigned)
+        return expectedOperation == InequalityOperation.LessThan
+            || expectedOperation == InequalityOperation.LessThanOrEqual;
+      }
+      return applyInequalityOp(u64(actual), u64(compareTo), expectedOperation);
+    } else {
+      // !isSigned<T>() && isSigned<U>()
+      if (i64(compareTo) < 0) {
+        // compareTo (signed negative) is always less than actual (unsigned)
+        return expectedOperation == InequalityOperation.GreaterThan
+            || expectedOperation == InequalityOperation.GreaterThanOrEqual;
+      }
+      return applyInequalityOp(u64(actual), u64(compareTo), expectedOperation);
+    }
+  }
+
+  // Both floats → promote to f64
+  if (isFloat<T>() && isFloat<U>()) {
+    return applyInequalityOp(f64(actual), f64(compareTo), expectedOperation);
+  }
+
+  // Supported float/integer combo (passed precision-loss check above) → promote to f64
+  if ( (isFloat<T>() && isInteger<U>()) || (isInteger<T>() && isFloat<U>()) ) {
+    return applyInequalityOp(f64(actual), f64(compareTo), expectedOperation);
+  }
+
+  // Unsupported type combination (e.g. vectors)
+  throw new Error(
+    "Inequality comparison is not supported for " + nameof<T>() + " and " + nameof<U>() + "."
+  );
+}
+
 export function truthyOrFalsey<T>(actual: T, expected: bool): bool {
   return actual ? expected == true : expected == false;
 }

package/assembly/expect.ts

@@ -1,7 +1,9 @@
 import {
   closeTo,
+  compareInequality,
   equals,
   identical,
+  InequalityOperation,
   isNull,
   nan,
   truthyOrFalsey
@@ -97,12 +99,12 @@ abstract class BaseExpectMatcher<T> {
    * objects, arrays, etc).
    *
    * Cross-type numeric comparisons are allowed where AssemblyScript's own `==` operator
-   * permits them (e.g. `f64` vs `i32`). Combinations where the float type lacks sufficient
-   * mantissa precision for the integer type's range are rejected with an error, mirroring
-   * the AS compiler's behavior (e.g. `f32` vs `i32`, `f64` vs `i64`).
+   * permits them (e.g. `f64` vs `i32`). `toBeCloseTo()` is safer for any comparison
+   * involving a float and allows all numeric types because it can still produce accurate
+   * results in precision-loss casting edge cases.
    *
-   * `toBeCloseTo()` is safer for any comparison involving a float and allows all numeric 
-   * types because it can still produce accurate results in precision loss casting edge cases.
+   * @throws When comparing float/integer types where the float's mantissa cannot losslessly
+   * represent the integer type's range (e.g. `f32` vs `i32`, `f64` vs `i64`).
    *
    * @example
    * expect(1 + 1).toBe(2);
@@ -132,7 +134,7 @@ abstract class BaseExpectMatcher<T> {
    * Strings are compared by value equality as with `toBe`. Non-numeric, non-string types return false.
    *
    * @param precision - Specify the number of decimal places that must match for values to be 
-   * considered close. Defaults to 2 digits, meaning effectively that values must be within 0.005 of 
+   * considered close. Defaults to 2 digits, meaning effectively that values must be within 0.005 of
    * each other.
    *
    * @example
@@ -142,7 +144,109 @@ abstract class BaseExpectMatcher<T> {
   toBeCloseTo<U>(val: U, precision: i32 = 2): void {
     this.assertComparison(closeTo(this.actual, val, precision), this.actual, val, "to be close to", true);
   }
-  
+
+  /**
+   * Checks that a value is greater than the expected value. Supports numeric types
+   * (integers, floats, booleans) and strings (lexicographic comparison).
+   *
+   * Cross-type numeric comparisons are allowed where safe, including cross-sign integers
+   * (more permissive than AS's own `>` operator). Booleans are treated as numeric
+   * (true=1, false=0).
+   *
+   * @throws When comparing float/integer types where the float's mantissa cannot losslessly
+   * represent the integer type's range (e.g. `f32` vs `i32`, `f64` vs `i64`).
+   * @throws When comparing nullable strings where either value is null. Use `toBeNull()`
+   * to check for null values.
+   * @throws When comparing non-string reference types (objects, arrays, etc).
+   *
+   * @example
+   * expect(10).toBeGreaterThan(5);
+   * expect(3.14).toBeGreaterThan(3);
+   * expect("banana").toBeGreaterThan("apple");
+   */
+  toBeGreaterThan<U>(val: U): void {
+    this.assertComparison(
+      compareInequality(this.actual, val, InequalityOperation.GreaterThan),
+      this.actual, val, "to be greater than", true
+    );
+  }
+
+  /**
+   * Checks that a value is greater than or equal to the expected value. Supports numeric
+   * types (integers, floats, booleans) and strings (lexicographic comparison).
+   *
+   * Cross-type numeric comparisons are allowed where safe, including cross-sign integers
+   * (more permissive than AS's own `>=` operator). Booleans are treated as numeric
+   * (true=1, false=0).
+   *
+   * @throws When comparing float/integer types where the float's mantissa cannot losslessly
+   * represent the integer type's range (e.g. `f32` vs `i32`, `f64` vs `i64`).
+   * @throws When comparing nullable strings where either value is null. Use `toBeNull()`
+   * to check for null values.
+   * @throws When comparing non-string reference types (objects, arrays, etc).
+   *
+   * @example
+   * expect(10).toBeGreaterThanOrEqual(10);
+   * expect(3.14).toBeGreaterThanOrEqual(3);
+   */
+  toBeGreaterThanOrEqual<U>(val: U): void {
+    this.assertComparison(
+      compareInequality(this.actual, val, InequalityOperation.GreaterThanOrEqual),
+      this.actual, val, "to be greater than or equal to", true
+    );
+  }
+
+  /**
+   * Checks that a value is less than the expected value. Supports numeric types
+   * (integers, floats, booleans) and strings (lexicographic comparison).
+   *
+   * Cross-type numeric comparisons are allowed where safe, including cross-sign integers
+   * (more permissive than AS's own `<` operator). Booleans are treated as numeric
+   * (true=1, false=0).
+   *
+   * @throws When comparing float/integer types where the float's mantissa cannot losslessly
+   * represent the integer type's range (e.g. `f32` vs `i32`, `f64` vs `i64`).
+   * @throws When comparing nullable strings where either value is null. Use `toBeNull()`
+   * to check for null values.
+   * @throws When comparing non-string reference types (objects, arrays, etc).
+   *
+   * @example
+   * expect(5).toBeLessThan(10);
+   * expect(3).toBeLessThan(3.14);
+   * expect("apple").toBeLessThan("banana");
+   */
+  toBeLessThan<U>(val: U): void {
+    this.assertComparison(
+      compareInequality(this.actual, val, InequalityOperation.LessThan),
+      this.actual, val, "to be less than", true
+    );
+  }
+
+  /**
+   * Checks that a value is less than or equal to the expected value. Supports numeric
+   * types (integers, floats, booleans) and strings (lexicographic comparison).
+   *
+   * Cross-type numeric comparisons are allowed where safe, including cross-sign integers
+   * (more permissive than AS's own `<=` operator). Booleans are treated as numeric
+   * (true=1, false=0).
+   *
+   * @throws When comparing float/integer types where the float's mantissa cannot losslessly
+   * represent the integer type's range (e.g. `f32` vs `i32`, `f64` vs `i64`).
+   * @throws When comparing nullable strings where either value is null. Use `toBeNull()`
+   * to check for null values.
+   * @throws When comparing non-string reference types (objects, arrays, etc).
+   *
+   * @example
+   * expect(5).toBeLessThanOrEqual(5);
+   * expect(3).toBeLessThanOrEqual(3.14);
+   */
+  toBeLessThanOrEqual<U>(val: U): void {
+    this.assertComparison(
+      compareInequality(this.actual, val, InequalityOperation.LessThanOrEqual),
+      this.actual, val, "to be less than or equal to", true
+    );
+  }
+
   /**
    * Checks that two values have the same value (deep equality). Currently supports
    * checking equality of Arrays, Sets, Maps, and nulls. Values inside arrays are
@@ -151,13 +255,14 @@ abstract class BaseExpectMatcher<T> {
    * `toBe()` rules.
    *
    * Like `toBe`, cross-type numeric comparisons follow AssemblyScript's own `==` operator
-   * restrictions. Combinations where the float type lacks sufficient mantissa precision
-   * for the integer type's range are rejected with an error (e.g. `f32` vs `i32`,
-   * `f64` vs `i64`). `toBeCloseTo()` is safer for any comparison involving a float and
-   * accurately handles these edge cases.
+   * restrictions. `toBeCloseTo()` is safer for any comparison involving a float and
+   * accurately handles precision-loss edge cases.
    *
    * ⚠️ IMPORTANT: Does not yet support user-defined object deep equality checking.
    *
+   * @throws When comparing float/integer types where the float's mantissa cannot losslessly
+   * represent the integer type's range (e.g. `f32` vs `i32`, `f64` vs `i64`).
+   *
    * @example
    * expect([1, 2, 3]).toEqual([1, 2, 3]);
    * expect(["one", "two", "three"]).toEqual(["one", "two", "three"]);

package/dist/{ast-visitor-lTahoS9R.mjs → ast-visitor-DJLJd5dt.mjs}

@@ -1,4 +1,4 @@
-import { ASNodeKind } from "./constants-DX9yo-el.mjs";
+import { ASNodeKind } from "./constants-DuBLuMjt.mjs";
 
 //#region src/util/ast-visitor.ts
 /**
@@ -307,4 +307,4 @@ var ASTVisitor = class {
 
 //#endregion
 export { ASTVisitor };
-//# sourceMappingURL=ast-visitor-lTahoS9R.mjs.map
+//# sourceMappingURL=ast-visitor-DJLJd5dt.mjs.map

package/dist/{ast-visitor-lTahoS9R.mjs.map → ast-visitor-DJLJd5dt.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"ast-visitor-lTahoS9R.mjs","names":[],"sources":["../src/util/ast-visitor.ts"],"sourcesContent":["/**\n * Base AST Visitor for AssemblyScript\n *\n * Provides reusable walking logic for traversing AS AST nodes.\n * Subclasses override hook methods to perform specific tasks.\n *\n * Used by:\n * - ast-parser.ts: Extract function metadata for coverage\n * - strip-inline.mts: Strip @inline decorators\n */\n\nimport {\n  Node,\n  Source,\n  BlockStatement,\n  FunctionDeclaration,\n  MethodDeclaration,\n  ClassDeclaration,\n  NamespaceDeclaration,\n  VariableStatement,\n  VariableDeclaration,\n  FunctionExpression,\n  ExpressionStatement,\n  BinaryExpression,\n  PropertyAccessExpression,\n  IfStatement,\n  WhileStatement,\n  DoStatement,\n  ForStatement,\n  ForOfStatement,\n  SwitchStatement,\n  SwitchCase,\n  TryStatement,\n  ThrowStatement,\n  ReturnStatement,\n  CallExpression,\n  NewExpression,\n  ParenthesizedExpression,\n  TernaryExpression,\n  CommaExpression,\n  AssertionExpression,\n  InstanceOfExpression,\n  ElementAccessExpression,\n  UnaryPostfixExpression,\n  UnaryPrefixExpression,\n  ClassExpression,\n  ParameterNode,\n  EnumDeclaration,\n  EnumValueDeclaration,\n  FieldDeclaration,\n  InterfaceDeclaration,\n  VoidStatement,\n} from 'assemblyscript';\n\nimport { ASNodeKind } from '../types/constants.js';\n\n/**\n * Abstract base class for AST visitors.\n *\n * Subclasses override hook methods to perform tasks during traversal:\n * - beforeVisit: Called before visiting each node (e.g., strip decorators)\n * - onFunctionDeclaration: Called when visiting a function declaration\n * - onMethodDeclaration: Called when visiting a method declaration\n * - onVariableDeclaration: Called when visiting a variable declaration\n * - onClassEnter/onClassExit: Called when entering/exiting a class\n */\nexport abstract class ASTVisitor {\n  /**\n   * Visit all statements in a source file\n   */\n  visitSource(source: Source): void {\n    for (const stmt of source.statements) {\n      this.visitNode(stmt);\n    }\n  }\n\n  /**\n   * Hook called before visiting each node.\n   * Override to perform pre-visit tasks (e.g., stripping decorators).\n   */\n  protected beforeVisit(_node: Node): void {}\n\n  /**\n   * Hook called when entering a class declaration.\n   * Override to track class context.\n   */\n  protected onClassEnter(_node: ClassDeclaration): void {}\n\n  /**\n   * Hook called when exiting a class declaration.\n   * Override to restore class context.\n   */\n  protected onClassExit(_node: ClassDeclaration): void {}\n\n  /**\n   * Hook called when visiting a function declaration.\n   * Override to extract function info or perform other tasks.\n   * Return false to skip recursing into the function body.\n   */\n  protected onFunctionDeclaration(_node: FunctionDeclaration): boolean {\n    return true; // Continue recursion by default\n  }\n\n  /**\n   * Hook called when visiting a method declaration.\n   * Override to extract method info or perform other tasks.\n   * Return false to skip recursing into the method body.\n   */\n  protected onMethodDeclaration(_node: MethodDeclaration): boolean {\n    return true; // Continue recursion by default\n  }\n\n  /**\n   * Hook called when visiting a variable declaration.\n   * Override to handle variable declarations (e.g., arrow functions).\n   * Return false to skip recursing into the initializer.\n   */\n  protected onVariableDeclaration(_node: VariableDeclaration): boolean {\n    return true; // Continue recursion by default\n  }\n\n  /**\n   * Main visitor dispatch - routes to specific handler based on node kind\n   */\n  visitNode(node: Node): void {\n    // Call pre-visit hook\n    this.beforeVisit(node);\n\n    // Recurse into children based on node kind\n    switch (node.kind) {\n      // Type nodes - no children to visit\n      case ASNodeKind.NamedType:\n      case ASNodeKind.FunctionType:\n      case ASNodeKind.TypeName:\n      case ASNodeKind.TypeParameter:\n        break;\n\n      // Parameter - may have default value\n      case ASNodeKind.Parameter: {\n        const param = node as ParameterNode;\n        if (param.initializer) this.visitNode(param.initializer);\n        break;\n      }\n\n      // Simple expressions - no children\n      case ASNodeKind.Identifier:\n      case ASNodeKind.False:\n      case ASNodeKind.Literal:\n      case ASNodeKind.Null:\n      case ASNodeKind.Omitted:\n      case ASNodeKind.Super:\n      case ASNodeKind.This:\n      case ASNodeKind.True:\n      case ASNodeKind.Constructor:\n      case ASNodeKind.Compiled:\n        break;\n\n      // Expressions with children\n      case ASNodeKind.Assertion: {\n        const expr = node as AssertionExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.Binary: {\n        const expr = node as BinaryExpression;\n        this.visitNode(expr.left);\n        this.visitNode(expr.right);\n        break;\n      }\n      case ASNodeKind.Call: {\n        const expr = node as CallExpression;\n        this.visitNode(expr.expression);\n        for (const arg of expr.args) this.visitNode(arg);\n        break;\n      }\n      case ASNodeKind.Class: {\n        const expr = node as ClassExpression;\n        this.visitNode(expr.declaration);\n        break;\n      }\n      case ASNodeKind.Comma: {\n        const expr = node as CommaExpression;\n        for (const e of expr.expressions) this.visitNode(e);\n        break;\n      }\n      case ASNodeKind.ElementAccess: {\n        const expr = node as ElementAccessExpression;\n        this.visitNode(expr.expression);\n        this.visitNode(expr.elementExpression);\n        break;\n      }\n      case ASNodeKind.Function: {\n        const expr = node as FunctionExpression;\n        this.visitNode(expr.declaration);\n        break;\n      }\n      case ASNodeKind.InstanceOf: {\n        const expr = node as InstanceOfExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.New: {\n        const expr = node as NewExpression;\n        for (const arg of expr.args) this.visitNode(arg);\n        break;\n      }\n      case ASNodeKind.Parenthesized: {\n        const expr = node as ParenthesizedExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.PropertyAccess: {\n        const expr = node as PropertyAccessExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.Ternary: {\n        const expr = node as TernaryExpression;\n        this.visitNode(expr.condition);\n        this.visitNode(expr.ifThen);\n        this.visitNode(expr.ifElse);\n        break;\n      }\n      case ASNodeKind.UnaryPostfix: {\n        const expr = node as UnaryPostfixExpression;\n        this.visitNode(expr.operand);\n        break;\n      }\n      case ASNodeKind.UnaryPrefix: {\n        const expr = node as UnaryPrefixExpression;\n        this.visitNode(expr.operand);\n        break;\n      }\n\n      // Statements with no interesting children\n      case ASNodeKind.Break:\n      case ASNodeKind.Continue:\n      case ASNodeKind.Empty:\n      case ASNodeKind.Export:\n      case ASNodeKind.ExportDefault:\n      case ASNodeKind.ExportImport:\n      case ASNodeKind.Import:\n      case ASNodeKind.Module:\n        break;\n\n      // Statements with children\n      case ASNodeKind.Block: {\n        const stmt = node as BlockStatement;\n        for (const s of stmt.statements) this.visitNode(s);\n        break;\n      }\n      case ASNodeKind.Do: {\n        const stmt = node as DoStatement;\n        this.visitNode(stmt.body);\n        this.visitNode(stmt.condition);\n        break;\n      }\n      case ASNodeKind.Expression: {\n        const stmt = node as ExpressionStatement;\n        this.visitNode(stmt.expression);\n        break;\n      }\n      case ASNodeKind.For: {\n        const stmt = node as ForStatement;\n        if (stmt.initializer) this.visitNode(stmt.initializer);\n        if (stmt.condition) this.visitNode(stmt.condition);\n        if (stmt.incrementor) this.visitNode(stmt.incrementor);\n        this.visitNode(stmt.body);\n        break;\n      }\n      case ASNodeKind.ForOf: {\n        const stmt = node as ForOfStatement;\n        this.visitNode(stmt.variable);\n        this.visitNode(stmt.iterable);\n        this.visitNode(stmt.body);\n        break;\n      }\n      case ASNodeKind.If: {\n        const stmt = node as IfStatement;\n        this.visitNode(stmt.condition);\n        this.visitNode(stmt.ifTrue);\n        if (stmt.ifFalse) this.visitNode(stmt.ifFalse);\n        break;\n      }\n      case ASNodeKind.Return: {\n        const stmt = node as ReturnStatement;\n        if (stmt.value) this.visitNode(stmt.value);\n        break;\n      }\n      case ASNodeKind.Switch: {\n        const stmt = node as SwitchStatement;\n        this.visitNode(stmt.condition);\n        for (const switchCase of stmt.cases) this.visitNode(switchCase);\n        break;\n      }\n      case ASNodeKind.Throw: {\n        const stmt = node as ThrowStatement;\n        this.visitNode(stmt.value);\n        break;\n      }\n      case ASNodeKind.Try: {\n        const stmt = node as TryStatement;\n        for (const s of stmt.bodyStatements) this.visitNode(s);\n        if (stmt.catchStatements) {\n          for (const s of stmt.catchStatements) this.visitNode(s);\n        }\n        if (stmt.finallyStatements) {\n          for (const s of stmt.finallyStatements) this.visitNode(s);\n        }\n        break;\n      }\n      case ASNodeKind.Variable: {\n        const stmt = node as VariableStatement;\n        for (const decl of stmt.declarations) this.visitNode(decl);\n        break;\n      }\n      case ASNodeKind.Void: {\n        const stmt = node as VoidStatement;\n        this.visitNode(stmt.expression);\n        break;\n      }\n      case ASNodeKind.While: {\n        const stmt = node as WhileStatement;\n        this.visitNode(stmt.condition);\n        this.visitNode(stmt.body);\n        break;\n      }\n      case ASNodeKind.SwitchCase: {\n        const stmt = node as SwitchCase;\n        if (stmt.label) this.visitNode(stmt.label);\n        for (const s of stmt.statements) this.visitNode(s);\n        break;\n      }\n\n      // Declaration statements\n      case ASNodeKind.ImportDeclaration:\n      case ASNodeKind.TypeDeclaration:\n        break;\n\n      case ASNodeKind.ClassDeclaration: {\n        const decl = node as ClassDeclaration;\n        this.onClassEnter(decl);\n        for (const member of decl.members) this.visitNode(member);\n        this.onClassExit(decl);\n        break;\n      }\n      case ASNodeKind.EnumDeclaration: {\n        const decl = node as EnumDeclaration;\n        for (const value of decl.values) this.visitNode(value);\n        break;\n      }\n      case ASNodeKind.EnumValueDeclaration: {\n        const decl = node as EnumValueDeclaration;\n        if (decl.initializer) this.visitNode(decl.initializer);\n        break;\n      }\n      case ASNodeKind.FieldDeclaration: {\n        const decl = node as FieldDeclaration;\n        if (decl.initializer) this.visitNode(decl.initializer);\n        break;\n      }\n      case ASNodeKind.FunctionDeclaration: {\n        const decl = node as FunctionDeclaration;\n        const shouldRecurse = this.onFunctionDeclaration(decl);\n        if (shouldRecurse && decl.body) this.visitNode(decl.body);\n        break;\n      }\n      case ASNodeKind.InterfaceDeclaration: {\n        const decl = node as InterfaceDeclaration;\n        for (const member of decl.members) this.visitNode(member);\n        break;\n      }\n      case ASNodeKind.MethodDeclaration: {\n        const decl = node as MethodDeclaration;\n        const shouldRecurse = this.onMethodDeclaration(decl);\n        if (shouldRecurse && decl.body) this.visitNode(decl.body);\n        break;\n      }\n      case ASNodeKind.NamespaceDeclaration: {\n        const decl = node as NamespaceDeclaration;\n        for (const member of decl.members) this.visitNode(member);\n        break;\n      }\n      case ASNodeKind.VariableDeclaration: {\n        const decl = node as VariableDeclaration;\n        const shouldRecurse = this.onVariableDeclaration(decl);\n        if (shouldRecurse && decl.initializer) this.visitNode(decl.initializer);\n        break;\n      }\n\n      // Special nodes - no action needed\n      case ASNodeKind.ExportMember:\n      case ASNodeKind.IndexSignature:\n      case ASNodeKind.Comment:\n      case ASNodeKind.Decorator:\n        break;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAkEA,IAAsB,aAAtB,MAAiC;;;;CAI/B,YAAY,QAAsB;AAChC,OAAK,MAAM,QAAQ,OAAO,WACxB,MAAK,UAAU,KAAK;;;;;;CAQxB,AAAU,YAAY,OAAmB;;;;;CAMzC,AAAU,aAAa,OAA+B;;;;;CAMtD,AAAU,YAAY,OAA+B;;;;;;CAOrD,AAAU,sBAAsB,OAAqC;AACnE,SAAO;;;;;;;CAQT,AAAU,oBAAoB,OAAmC;AAC/D,SAAO;;;;;;;CAQT,AAAU,sBAAsB,OAAqC;AACnE,SAAO;;;;;CAMT,UAAU,MAAkB;AAE1B,OAAK,YAAY,KAAK;AAGtB,UAAQ,KAAK,MAAb;GAEE,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,cACd;GAGF,KAAK,WAAW,WAAW;IACzB,MAAM,QAAQ;AACd,QAAI,MAAM,YAAa,MAAK,UAAU,MAAM,YAAY;AACxD;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,SACd;GAGF,KAAK,WAAW,WAAW;IACzB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,QAAQ;IACtB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,KAAK;AACzB,SAAK,UAAU,KAAK,MAAM;AAC1B;;GAEF,KAAK,WAAW,MAAM;IACpB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,MAAM,OAAO,KAAK,KAAM,MAAK,UAAU,IAAI;AAChD;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,YAAY;AAChC;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,MAAM,KAAK,KAAK,YAAa,MAAK,UAAU,EAAE;AACnD;;GAEF,KAAK,WAAW,eAAe;IAC7B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,UAAU,KAAK,kBAAkB;AACtC;;GAEF,KAAK,WAAW,UAAU;IACxB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,YAAY;AAChC;;GAEF,KAAK,WAAW,YAAY;IAC1B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,KAAK;IACnB,MAAM,OAAO;AACb,SAAK,MAAM,OAAO,KAAK,KAAM,MAAK,UAAU,IAAI;AAChD;;GAEF,KAAK,WAAW,eAAe;IAC7B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,gBAAgB;IAC9B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,SAAS;IACvB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,UAAU,KAAK,OAAO;AAC3B,SAAK,UAAU,KAAK,OAAO;AAC3B;;GAEF,KAAK,WAAW,cAAc;IAC5B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,QAAQ;AAC5B;;GAEF,KAAK,WAAW,aAAa;IAC3B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,QAAQ;AAC5B;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,OACd;GAGF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,MAAM,KAAK,KAAK,WAAY,MAAK,UAAU,EAAE;AAClD;;GAEF,KAAK,WAAW,IAAI;IAClB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,KAAK;AACzB,SAAK,UAAU,KAAK,UAAU;AAC9B;;GAEF,KAAK,WAAW,YAAY;IAC1B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,KAAK;IACnB,MAAM,OAAO;AACb,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD,QAAI,KAAK,UAAW,MAAK,UAAU,KAAK,UAAU;AAClD,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD,SAAK,UAAU,KAAK,KAAK;AACzB;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,SAAS;AAC7B,SAAK,UAAU,KAAK,SAAS;AAC7B,SAAK,UAAU,KAAK,KAAK;AACzB;;GAEF,KAAK,WAAW,IAAI;IAClB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,UAAU,KAAK,OAAO;AAC3B,QAAI,KAAK,QAAS,MAAK,UAAU,KAAK,QAAQ;AAC9C;;GAEF,KAAK,WAAW,QAAQ;IACtB,MAAM,OAAO;AACb,QAAI,KAAK,MAAO,MAAK,UAAU,KAAK,MAAM;AAC1C;;GAEF,KAAK,WAAW,QAAQ;IACtB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,MAAM,cAAc,KAAK,MAAO,MAAK,UAAU,WAAW;AAC/D;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,MAAM;AAC1B;;GAEF,KAAK,WAAW,KAAK;IACnB,MAAM,OAAO;AACb,SAAK,MAAM,KAAK,KAAK,eAAgB,MAAK,UAAU,EAAE;AACtD,QAAI,KAAK,gBACP,MAAK,MAAM,KAAK,KAAK,gBAAiB,MAAK,UAAU,EAAE;AAEzD,QAAI,KAAK,kBACP,MAAK,MAAM,KAAK,KAAK,kBAAmB,MAAK,UAAU,EAAE;AAE3D;;GAEF,KAAK,WAAW,UAAU;IACxB,MAAM,OAAO;AACb,SAAK,MAAM,QAAQ,KAAK,aAAc,MAAK,UAAU,KAAK;AAC1D;;GAEF,KAAK,WAAW,MAAM;IACpB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,UAAU,KAAK,KAAK;AACzB;;GAEF,KAAK,WAAW,YAAY;IAC1B,MAAM,OAAO;AACb,QAAI,KAAK,MAAO,MAAK,UAAU,KAAK,MAAM;AAC1C,SAAK,MAAM,KAAK,KAAK,WAAY,MAAK,UAAU,EAAE;AAClD;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW,gBACd;GAEF,KAAK,WAAW,kBAAkB;IAChC,MAAM,OAAO;AACb,SAAK,aAAa,KAAK;AACvB,SAAK,MAAM,UAAU,KAAK,QAAS,MAAK,UAAU,OAAO;AACzD,SAAK,YAAY,KAAK;AACtB;;GAEF,KAAK,WAAW,iBAAiB;IAC/B,MAAM,OAAO;AACb,SAAK,MAAM,SAAS,KAAK,OAAQ,MAAK,UAAU,MAAM;AACtD;;GAEF,KAAK,WAAW,sBAAsB;IACpC,MAAM,OAAO;AACb,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD;;GAEF,KAAK,WAAW,kBAAkB;IAChC,MAAM,OAAO;AACb,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD;;GAEF,KAAK,WAAW,qBAAqB;IACnC,MAAM,OAAO;AAEb,QADsB,KAAK,sBAAsB,KAAK,IACjC,KAAK,KAAM,MAAK,UAAU,KAAK,KAAK;AACzD;;GAEF,KAAK,WAAW,sBAAsB;IACpC,MAAM,OAAO;AACb,SAAK,MAAM,UAAU,KAAK,QAAS,MAAK,UAAU,OAAO;AACzD;;GAEF,KAAK,WAAW,mBAAmB;IACjC,MAAM,OAAO;AAEb,QADsB,KAAK,oBAAoB,KAAK,IAC/B,KAAK,KAAM,MAAK,UAAU,KAAK,KAAK;AACzD;;GAEF,KAAK,WAAW,sBAAsB;IACpC,MAAM,OAAO;AACb,SAAK,MAAM,UAAU,KAAK,QAAS,MAAK,UAAU,OAAO;AACzD;;GAEF,KAAK,WAAW,qBAAqB;IACnC,MAAM,OAAO;AAEb,QADsB,KAAK,sBAAsB,KAAK,IACjC,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACvE;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,UACd"}
+{"version":3,"file":"ast-visitor-DJLJd5dt.mjs","names":[],"sources":["../src/util/ast-visitor.ts"],"sourcesContent":["/**\n * Base AST Visitor for AssemblyScript\n *\n * Provides reusable walking logic for traversing AS AST nodes.\n * Subclasses override hook methods to perform specific tasks.\n *\n * Used by:\n * - ast-parser.ts: Extract function metadata for coverage\n * - strip-inline.mts: Strip @inline decorators\n */\n\nimport {\n  Node,\n  Source,\n  BlockStatement,\n  FunctionDeclaration,\n  MethodDeclaration,\n  ClassDeclaration,\n  NamespaceDeclaration,\n  VariableStatement,\n  VariableDeclaration,\n  FunctionExpression,\n  ExpressionStatement,\n  BinaryExpression,\n  PropertyAccessExpression,\n  IfStatement,\n  WhileStatement,\n  DoStatement,\n  ForStatement,\n  ForOfStatement,\n  SwitchStatement,\n  SwitchCase,\n  TryStatement,\n  ThrowStatement,\n  ReturnStatement,\n  CallExpression,\n  NewExpression,\n  ParenthesizedExpression,\n  TernaryExpression,\n  CommaExpression,\n  AssertionExpression,\n  InstanceOfExpression,\n  ElementAccessExpression,\n  UnaryPostfixExpression,\n  UnaryPrefixExpression,\n  ClassExpression,\n  ParameterNode,\n  EnumDeclaration,\n  EnumValueDeclaration,\n  FieldDeclaration,\n  InterfaceDeclaration,\n  VoidStatement,\n} from 'assemblyscript';\n\nimport { ASNodeKind } from '../types/constants.js';\n\n/**\n * Abstract base class for AST visitors.\n *\n * Subclasses override hook methods to perform tasks during traversal:\n * - beforeVisit: Called before visiting each node (e.g., strip decorators)\n * - onFunctionDeclaration: Called when visiting a function declaration\n * - onMethodDeclaration: Called when visiting a method declaration\n * - onVariableDeclaration: Called when visiting a variable declaration\n * - onClassEnter/onClassExit: Called when entering/exiting a class\n */\nexport abstract class ASTVisitor {\n  /**\n   * Visit all statements in a source file\n   */\n  visitSource(source: Source): void {\n    for (const stmt of source.statements) {\n      this.visitNode(stmt);\n    }\n  }\n\n  /**\n   * Hook called before visiting each node.\n   * Override to perform pre-visit tasks (e.g., stripping decorators).\n   */\n  protected beforeVisit(_node: Node): void {}\n\n  /**\n   * Hook called when entering a class declaration.\n   * Override to track class context.\n   */\n  protected onClassEnter(_node: ClassDeclaration): void {}\n\n  /**\n   * Hook called when exiting a class declaration.\n   * Override to restore class context.\n   */\n  protected onClassExit(_node: ClassDeclaration): void {}\n\n  /**\n   * Hook called when visiting a function declaration.\n   * Override to extract function info or perform other tasks.\n   * Return false to skip recursing into the function body.\n   */\n  protected onFunctionDeclaration(_node: FunctionDeclaration): boolean {\n    return true; // Continue recursion by default\n  }\n\n  /**\n   * Hook called when visiting a method declaration.\n   * Override to extract method info or perform other tasks.\n   * Return false to skip recursing into the method body.\n   */\n  protected onMethodDeclaration(_node: MethodDeclaration): boolean {\n    return true; // Continue recursion by default\n  }\n\n  /**\n   * Hook called when visiting a variable declaration.\n   * Override to handle variable declarations (e.g., arrow functions).\n   * Return false to skip recursing into the initializer.\n   */\n  protected onVariableDeclaration(_node: VariableDeclaration): boolean {\n    return true; // Continue recursion by default\n  }\n\n  /**\n   * Main visitor dispatch - routes to specific handler based on node kind\n   */\n  visitNode(node: Node): void {\n    // Call pre-visit hook\n    this.beforeVisit(node);\n\n    // Recurse into children based on node kind\n    switch (node.kind) {\n      // Type nodes - no children to visit\n      case ASNodeKind.NamedType:\n      case ASNodeKind.FunctionType:\n      case ASNodeKind.TypeName:\n      case ASNodeKind.TypeParameter:\n        break;\n\n      // Parameter - may have default value\n      case ASNodeKind.Parameter: {\n        const param = node as ParameterNode;\n        if (param.initializer) this.visitNode(param.initializer);\n        break;\n      }\n\n      // Simple expressions - no children\n      case ASNodeKind.Identifier:\n      case ASNodeKind.False:\n      case ASNodeKind.Literal:\n      case ASNodeKind.Null:\n      case ASNodeKind.Omitted:\n      case ASNodeKind.Super:\n      case ASNodeKind.This:\n      case ASNodeKind.True:\n      case ASNodeKind.Constructor:\n      case ASNodeKind.Compiled:\n        break;\n\n      // Expressions with children\n      case ASNodeKind.Assertion: {\n        const expr = node as AssertionExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.Binary: {\n        const expr = node as BinaryExpression;\n        this.visitNode(expr.left);\n        this.visitNode(expr.right);\n        break;\n      }\n      case ASNodeKind.Call: {\n        const expr = node as CallExpression;\n        this.visitNode(expr.expression);\n        for (const arg of expr.args) this.visitNode(arg);\n        break;\n      }\n      case ASNodeKind.Class: {\n        const expr = node as ClassExpression;\n        this.visitNode(expr.declaration);\n        break;\n      }\n      case ASNodeKind.Comma: {\n        const expr = node as CommaExpression;\n        for (const e of expr.expressions) this.visitNode(e);\n        break;\n      }\n      case ASNodeKind.ElementAccess: {\n        const expr = node as ElementAccessExpression;\n        this.visitNode(expr.expression);\n        this.visitNode(expr.elementExpression);\n        break;\n      }\n      case ASNodeKind.Function: {\n        const expr = node as FunctionExpression;\n        this.visitNode(expr.declaration);\n        break;\n      }\n      case ASNodeKind.InstanceOf: {\n        const expr = node as InstanceOfExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.New: {\n        const expr = node as NewExpression;\n        for (const arg of expr.args) this.visitNode(arg);\n        break;\n      }\n      case ASNodeKind.Parenthesized: {\n        const expr = node as ParenthesizedExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.PropertyAccess: {\n        const expr = node as PropertyAccessExpression;\n        this.visitNode(expr.expression);\n        break;\n      }\n      case ASNodeKind.Ternary: {\n        const expr = node as TernaryExpression;\n        this.visitNode(expr.condition);\n        this.visitNode(expr.ifThen);\n        this.visitNode(expr.ifElse);\n        break;\n      }\n      case ASNodeKind.UnaryPostfix: {\n        const expr = node as UnaryPostfixExpression;\n        this.visitNode(expr.operand);\n        break;\n      }\n      case ASNodeKind.UnaryPrefix: {\n        const expr = node as UnaryPrefixExpression;\n        this.visitNode(expr.operand);\n        break;\n      }\n\n      // Statements with no interesting children\n      case ASNodeKind.Break:\n      case ASNodeKind.Continue:\n      case ASNodeKind.Empty:\n      case ASNodeKind.Export:\n      case ASNodeKind.ExportDefault:\n      case ASNodeKind.ExportImport:\n      case ASNodeKind.Import:\n      case ASNodeKind.Module:\n        break;\n\n      // Statements with children\n      case ASNodeKind.Block: {\n        const stmt = node as BlockStatement;\n        for (const s of stmt.statements) this.visitNode(s);\n        break;\n      }\n      case ASNodeKind.Do: {\n        const stmt = node as DoStatement;\n        this.visitNode(stmt.body);\n        this.visitNode(stmt.condition);\n        break;\n      }\n      case ASNodeKind.Expression: {\n        const stmt = node as ExpressionStatement;\n        this.visitNode(stmt.expression);\n        break;\n      }\n      case ASNodeKind.For: {\n        const stmt = node as ForStatement;\n        if (stmt.initializer) this.visitNode(stmt.initializer);\n        if (stmt.condition) this.visitNode(stmt.condition);\n        if (stmt.incrementor) this.visitNode(stmt.incrementor);\n        this.visitNode(stmt.body);\n        break;\n      }\n      case ASNodeKind.ForOf: {\n        const stmt = node as ForOfStatement;\n        this.visitNode(stmt.variable);\n        this.visitNode(stmt.iterable);\n        this.visitNode(stmt.body);\n        break;\n      }\n      case ASNodeKind.If: {\n        const stmt = node as IfStatement;\n        this.visitNode(stmt.condition);\n        this.visitNode(stmt.ifTrue);\n        if (stmt.ifFalse) this.visitNode(stmt.ifFalse);\n        break;\n      }\n      case ASNodeKind.Return: {\n        const stmt = node as ReturnStatement;\n        if (stmt.value) this.visitNode(stmt.value);\n        break;\n      }\n      case ASNodeKind.Switch: {\n        const stmt = node as SwitchStatement;\n        this.visitNode(stmt.condition);\n        for (const switchCase of stmt.cases) this.visitNode(switchCase);\n        break;\n      }\n      case ASNodeKind.Throw: {\n        const stmt = node as ThrowStatement;\n        this.visitNode(stmt.value);\n        break;\n      }\n      case ASNodeKind.Try: {\n        const stmt = node as TryStatement;\n        for (const s of stmt.bodyStatements) this.visitNode(s);\n        if (stmt.catchStatements) {\n          for (const s of stmt.catchStatements) this.visitNode(s);\n        }\n        if (stmt.finallyStatements) {\n          for (const s of stmt.finallyStatements) this.visitNode(s);\n        }\n        break;\n      }\n      case ASNodeKind.Variable: {\n        const stmt = node as VariableStatement;\n        for (const decl of stmt.declarations) this.visitNode(decl);\n        break;\n      }\n      case ASNodeKind.Void: {\n        const stmt = node as VoidStatement;\n        this.visitNode(stmt.expression);\n        break;\n      }\n      case ASNodeKind.While: {\n        const stmt = node as WhileStatement;\n        this.visitNode(stmt.condition);\n        this.visitNode(stmt.body);\n        break;\n      }\n      case ASNodeKind.SwitchCase: {\n        const stmt = node as SwitchCase;\n        if (stmt.label) this.visitNode(stmt.label);\n        for (const s of stmt.statements) this.visitNode(s);\n        break;\n      }\n\n      // Declaration statements\n      case ASNodeKind.ImportDeclaration:\n      case ASNodeKind.TypeDeclaration:\n        break;\n\n      case ASNodeKind.ClassDeclaration: {\n        const decl = node as ClassDeclaration;\n        this.onClassEnter(decl);\n        for (const member of decl.members) this.visitNode(member);\n        this.onClassExit(decl);\n        break;\n      }\n      case ASNodeKind.EnumDeclaration: {\n        const decl = node as EnumDeclaration;\n        for (const value of decl.values) this.visitNode(value);\n        break;\n      }\n      case ASNodeKind.EnumValueDeclaration: {\n        const decl = node as EnumValueDeclaration;\n        if (decl.initializer) this.visitNode(decl.initializer);\n        break;\n      }\n      case ASNodeKind.FieldDeclaration: {\n        const decl = node as FieldDeclaration;\n        if (decl.initializer) this.visitNode(decl.initializer);\n        break;\n      }\n      case ASNodeKind.FunctionDeclaration: {\n        const decl = node as FunctionDeclaration;\n        const shouldRecurse = this.onFunctionDeclaration(decl);\n        if (shouldRecurse && decl.body) this.visitNode(decl.body);\n        break;\n      }\n      case ASNodeKind.InterfaceDeclaration: {\n        const decl = node as InterfaceDeclaration;\n        for (const member of decl.members) this.visitNode(member);\n        break;\n      }\n      case ASNodeKind.MethodDeclaration: {\n        const decl = node as MethodDeclaration;\n        const shouldRecurse = this.onMethodDeclaration(decl);\n        if (shouldRecurse && decl.body) this.visitNode(decl.body);\n        break;\n      }\n      case ASNodeKind.NamespaceDeclaration: {\n        const decl = node as NamespaceDeclaration;\n        for (const member of decl.members) this.visitNode(member);\n        break;\n      }\n      case ASNodeKind.VariableDeclaration: {\n        const decl = node as VariableDeclaration;\n        const shouldRecurse = this.onVariableDeclaration(decl);\n        if (shouldRecurse && decl.initializer) this.visitNode(decl.initializer);\n        break;\n      }\n\n      // Special nodes - no action needed\n      case ASNodeKind.ExportMember:\n      case ASNodeKind.IndexSignature:\n      case ASNodeKind.Comment:\n      case ASNodeKind.Decorator:\n        break;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAkEA,IAAsB,aAAtB,MAAiC;;;;CAI/B,YAAY,QAAsB;AAChC,OAAK,MAAM,QAAQ,OAAO,WACxB,MAAK,UAAU,KAAK;;;;;;CAQxB,AAAU,YAAY,OAAmB;;;;;CAMzC,AAAU,aAAa,OAA+B;;;;;CAMtD,AAAU,YAAY,OAA+B;;;;;;CAOrD,AAAU,sBAAsB,OAAqC;AACnE,SAAO;;;;;;;CAQT,AAAU,oBAAoB,OAAmC;AAC/D,SAAO;;;;;;;CAQT,AAAU,sBAAsB,OAAqC;AACnE,SAAO;;;;;CAMT,UAAU,MAAkB;AAE1B,OAAK,YAAY,KAAK;AAGtB,UAAQ,KAAK,MAAb;GAEE,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,cACd;GAGF,KAAK,WAAW,WAAW;IACzB,MAAM,QAAQ;AACd,QAAI,MAAM,YAAa,MAAK,UAAU,MAAM,YAAY;AACxD;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,SACd;GAGF,KAAK,WAAW,WAAW;IACzB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,QAAQ;IACtB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,KAAK;AACzB,SAAK,UAAU,KAAK,MAAM;AAC1B;;GAEF,KAAK,WAAW,MAAM;IACpB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,MAAM,OAAO,KAAK,KAAM,MAAK,UAAU,IAAI;AAChD;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,YAAY;AAChC;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,MAAM,KAAK,KAAK,YAAa,MAAK,UAAU,EAAE;AACnD;;GAEF,KAAK,WAAW,eAAe;IAC7B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,UAAU,KAAK,kBAAkB;AACtC;;GAEF,KAAK,WAAW,UAAU;IACxB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,YAAY;AAChC;;GAEF,KAAK,WAAW,YAAY;IAC1B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,KAAK;IACnB,MAAM,OAAO;AACb,SAAK,MAAM,OAAO,KAAK,KAAM,MAAK,UAAU,IAAI;AAChD;;GAEF,KAAK,WAAW,eAAe;IAC7B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,gBAAgB;IAC9B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,SAAS;IACvB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,UAAU,KAAK,OAAO;AAC3B,SAAK,UAAU,KAAK,OAAO;AAC3B;;GAEF,KAAK,WAAW,cAAc;IAC5B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,QAAQ;AAC5B;;GAEF,KAAK,WAAW,aAAa;IAC3B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,QAAQ;AAC5B;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,OACd;GAGF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,MAAM,KAAK,KAAK,WAAY,MAAK,UAAU,EAAE;AAClD;;GAEF,KAAK,WAAW,IAAI;IAClB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,KAAK;AACzB,SAAK,UAAU,KAAK,UAAU;AAC9B;;GAEF,KAAK,WAAW,YAAY;IAC1B,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,KAAK;IACnB,MAAM,OAAO;AACb,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD,QAAI,KAAK,UAAW,MAAK,UAAU,KAAK,UAAU;AAClD,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD,SAAK,UAAU,KAAK,KAAK;AACzB;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,SAAS;AAC7B,SAAK,UAAU,KAAK,SAAS;AAC7B,SAAK,UAAU,KAAK,KAAK;AACzB;;GAEF,KAAK,WAAW,IAAI;IAClB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,UAAU,KAAK,OAAO;AAC3B,QAAI,KAAK,QAAS,MAAK,UAAU,KAAK,QAAQ;AAC9C;;GAEF,KAAK,WAAW,QAAQ;IACtB,MAAM,OAAO;AACb,QAAI,KAAK,MAAO,MAAK,UAAU,KAAK,MAAM;AAC1C;;GAEF,KAAK,WAAW,QAAQ;IACtB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,MAAM,cAAc,KAAK,MAAO,MAAK,UAAU,WAAW;AAC/D;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,MAAM;AAC1B;;GAEF,KAAK,WAAW,KAAK;IACnB,MAAM,OAAO;AACb,SAAK,MAAM,KAAK,KAAK,eAAgB,MAAK,UAAU,EAAE;AACtD,QAAI,KAAK,gBACP,MAAK,MAAM,KAAK,KAAK,gBAAiB,MAAK,UAAU,EAAE;AAEzD,QAAI,KAAK,kBACP,MAAK,MAAM,KAAK,KAAK,kBAAmB,MAAK,UAAU,EAAE;AAE3D;;GAEF,KAAK,WAAW,UAAU;IACxB,MAAM,OAAO;AACb,SAAK,MAAM,QAAQ,KAAK,aAAc,MAAK,UAAU,KAAK;AAC1D;;GAEF,KAAK,WAAW,MAAM;IACpB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,WAAW;AAC/B;;GAEF,KAAK,WAAW,OAAO;IACrB,MAAM,OAAO;AACb,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,UAAU,KAAK,KAAK;AACzB;;GAEF,KAAK,WAAW,YAAY;IAC1B,MAAM,OAAO;AACb,QAAI,KAAK,MAAO,MAAK,UAAU,KAAK,MAAM;AAC1C,SAAK,MAAM,KAAK,KAAK,WAAY,MAAK,UAAU,EAAE;AAClD;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW,gBACd;GAEF,KAAK,WAAW,kBAAkB;IAChC,MAAM,OAAO;AACb,SAAK,aAAa,KAAK;AACvB,SAAK,MAAM,UAAU,KAAK,QAAS,MAAK,UAAU,OAAO;AACzD,SAAK,YAAY,KAAK;AACtB;;GAEF,KAAK,WAAW,iBAAiB;IAC/B,MAAM,OAAO;AACb,SAAK,MAAM,SAAS,KAAK,OAAQ,MAAK,UAAU,MAAM;AACtD;;GAEF,KAAK,WAAW,sBAAsB;IACpC,MAAM,OAAO;AACb,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD;;GAEF,KAAK,WAAW,kBAAkB;IAChC,MAAM,OAAO;AACb,QAAI,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACtD;;GAEF,KAAK,WAAW,qBAAqB;IACnC,MAAM,OAAO;AAEb,QADsB,KAAK,sBAAsB,KAAK,IACjC,KAAK,KAAM,MAAK,UAAU,KAAK,KAAK;AACzD;;GAEF,KAAK,WAAW,sBAAsB;IACpC,MAAM,OAAO;AACb,SAAK,MAAM,UAAU,KAAK,QAAS,MAAK,UAAU,OAAO;AACzD;;GAEF,KAAK,WAAW,mBAAmB;IACjC,MAAM,OAAO;AAEb,QADsB,KAAK,oBAAoB,KAAK,IAC/B,KAAK,KAAM,MAAK,UAAU,KAAK,KAAK;AACzD;;GAEF,KAAK,WAAW,sBAAsB;IACpC,MAAM,OAAO;AACb,SAAK,MAAM,UAAU,KAAK,QAAS,MAAK,UAAU,OAAO;AACzD;;GAEF,KAAK,WAAW,qBAAqB;IACnC,MAAM,OAAO;AAEb,QADsB,KAAK,sBAAsB,KAAK,IACjC,KAAK,YAAa,MAAK,UAAU,KAAK,YAAY;AACvE;;GAIF,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW;GAChB,KAAK,WAAW,UACd"}

package/dist/{compile-runner-C2eh_xLp.mjs → compile-runner-BJ_ZF3Ma.mjs}

@@ -1,9 +1,9 @@
-import { POOL_ERROR_NAMES, POOL_INTERNAL_PATHS } from "./constants-DX9yo-el.mjs";
-import { createPoolErrorFromAnyError, debug, getTestErrorFromPoolError } from "./debug-Cf2jt1kg.mjs";
+import { INTERNAL_PATH_LIB_PREFIX, POOL_ERROR_NAMES, POOL_INTERNAL_PATHS } from "./constants-DuBLuMjt.mjs";
+import { createPoolErrorFromAnyError, debug, getTestErrorFromPoolError } from "./debug-Cm1VFmaz.mjs";
 import { failFile, getFullTaskHierarchy, prepareFileTaskForCollection } from "./vitest-file-tasks-BUwzh375.mjs";
-import { getTaskLogLabel, getTaskLogPrefix } from "./vitest-tasks-Cbri6MWZ.mjs";
-import { executeWASMDiscovery, flushRpcUpdates, reportFileCollected, reportFileError, reportFileQueued, reportUserConsoleLogs } from "./load-user-imports-eGZuxeNp.mjs";
-import { compileAssemblyScript } from "./compiler-BaNECXMW.mjs";
+import { getTaskLogLabel, getTaskLogPrefix } from "./vitest-tasks-ByPK8DvF.mjs";
+import { executeWASMDiscovery, flushRpcUpdates, reportFileCollected, reportFileError, reportFileQueued, reportUserConsoleLogs } from "./load-user-imports-CYTTU22Q.mjs";
+import { compileAssemblyScript } from "./compiler-CscxCJw3.mjs";
 import { basename, relative } from "node:path";
 
 //#region src/pool-thread/runner/compile-runner.ts
@@ -21,14 +21,17 @@ async function runCompileAndDiscover(file, logModule, rpc, poolOptions, projectR
 	try {
 		await reportFileQueued(rpc, file, logModule, fileLogLabel);
 		const instrumentationOptions = {
+			projectRoot,
 			relativeExcludedFiles: [
 				relative(projectRoot, file.filepath),
-				...POOL_INTERNAL_PATHS,
+				...poolOptions._instrumentPoolInternals ? [] : POOL_INTERNAL_PATHS,
 				...relativeUserCoverageExclusions
 			],
 			excludedLibraryFilePrefix: "~lib/",
+			excludedLibraryFileOverridePrefix: poolOptions._instrumentPoolInternals ? INTERNAL_PATH_LIB_PREFIX : void 0,
 			coverageMemoryPagesMin: poolOptions.coverageMemoryPagesInitial,
-			coverageMemoryPagesMax: poolOptions.coverageMemoryPagesMax
+			coverageMemoryPagesMax: poolOptions.coverageMemoryPagesMax,
+			debug: poolOptions.debugNative
 		};
 		const compilerOptions = {
 			stripInline: poolOptions.stripInline,
@@ -77,4 +80,4 @@ async function runCompileAndDiscover(file, logModule, rpc, poolOptions, projectR
 
 //#endregion
 export { runCompileAndDiscover };
-//# sourceMappingURL=compile-runner-C2eh_xLp.mjs.map
+//# sourceMappingURL=compile-runner-BJ_ZF3Ma.mjs.map

package/dist/compile-runner-BJ_ZF3Ma.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile-runner-BJ_ZF3Ma.mjs","names":[],"sources":["../src/pool-thread/runner/compile-runner.ts"],"sourcesContent":["/**\n * Worker thread test runner logic for AssemblyScript Pool\n */\n\nimport { basename, relative } from 'node:path';\nimport type { File } from '@vitest/runner/types';\nimport type { SerializedDiffOptions } from '@vitest/utils/diff';\n\nimport type {\n  AssemblyScriptCompilerOptions,\n  AssemblyScriptConsoleLog,\n  AssemblyScriptConsoleLogHandler,\n  InstrumentationOptions,\n  ResolvedAssemblyScriptPoolOptions,\n  ThreadImports,\n  WASMCompilation,\n  WorkerRPC,\n} from '../../types/types.js';\nimport {\n  ASSEMBLYSCRIPT_LIB_PREFIX,\n  INTERNAL_PATH_LIB_PREFIX,\n  POOL_ERROR_NAMES,\n  POOL_INTERNAL_PATHS,\n} from '../../types/constants.js';\nimport { executeWASMDiscovery } from '../../wasm-executor/index.js';\nimport { debug } from '../../util/debug.js';\nimport {\n  reportFileQueued,\n  reportFileCollected,\n  reportUserConsoleLogs,\n  flushRpcUpdates,\n  reportFileError,\n} from '../rpc-reporter.js';\nimport { createPoolErrorFromAnyError, getTestErrorFromPoolError } from '../../util/pool-errors.js';\nimport { compileAssemblyScript } from '../../compiler/index.js';\nimport {\n  getTaskLogLabel,\n  getTaskLogPrefix,\n} from '../../util/vitest-tasks.js';\nimport {\n  failFile,\n  getFullTaskHierarchy,\n  prepareFileTaskForCollection,\n} from '../../util/vitest-file-tasks.js';\n\nlet threadCompilationCount: number = 0;\n\nexport async function runCompileAndDiscover(\n  file: File,\n  logModule: string,\n  rpc: WorkerRPC,\n  poolOptions: ResolvedAssemblyScriptPoolOptions,\n  projectRoot: string,\n  collectCoverage: boolean,\n  relativeUserCoverageExclusions: string[],\n  threadImports: ThreadImports,\n  diffOptions?: SerializedDiffOptions,\n  testNamePattern?: RegExp,\n  allowOnly?: boolean,\n): Promise<WASMCompilation | undefined> {\n  const base = basename(file.filepath);\n  const fileLogPrefix = getTaskLogPrefix(logModule, base, file);\n  const fileLogLabel = getTaskLogLabel(base, file);\n\n  debug(`${fileLogPrefix} - Beginning runCompileAndDiscover for \"${file.filepath}\" at ${Date.now()}`);\n\n  const runStart = performance.now();\n  let compilation: WASMCompilation | undefined;\n\n  try {\n    await reportFileQueued(rpc, file, logModule, fileLogLabel);\n\n    // TODO - move to options helpers\n    const relativeTestFilePath = relative(projectRoot, file.filepath);\n    const instrumentationOptions: InstrumentationOptions = {\n      projectRoot,\n      relativeExcludedFiles: [\n        relativeTestFilePath,\n        ...(poolOptions._instrumentPoolInternals ? [] : POOL_INTERNAL_PATHS),\n        ...relativeUserCoverageExclusions,\n      ],\n      excludedLibraryFilePrefix: ASSEMBLYSCRIPT_LIB_PREFIX,\n      excludedLibraryFileOverridePrefix: poolOptions._instrumentPoolInternals ? INTERNAL_PATH_LIB_PREFIX : undefined,\n      coverageMemoryPagesMin: poolOptions.coverageMemoryPagesInitial,\n      coverageMemoryPagesMax: poolOptions.coverageMemoryPagesMax,\n      debug: poolOptions.debugNative,\n    };\n    const compilerOptions: AssemblyScriptCompilerOptions = {\n      stripInline: poolOptions.stripInline,\n      projectRoot: projectRoot,\n      shouldInstrument: collectCoverage,\n      instrumentationOptions,\n      extraFlags: poolOptions.extraCompilerFlags\n    };\n\n    const { binary, sourceMap, debugInfo, compileTiming } = await compileAssemblyScript(\n      file.filepath,\n      compilerOptions,\n      logModule,\n      fileLogLabel\n    );\n    file.setupDuration = compileTiming;\n    threadCompilationCount++;\n\n    debug(`${fileLogPrefix} - TIMING compileAssemblyScript total `\n      + `(thread comp # ${threadCompilationCount}): ${compileTiming.toFixed(2)} ms`\n    );\n    \n    const logMessages: AssemblyScriptConsoleLog[] = [];\n    const handleLog: AssemblyScriptConsoleLogHandler = (msg: string, isError: boolean = false): void => {\n      logMessages.push({ msg, time: Date.now(), isError });\n    };\n    \n    const discoverStart = performance.now();\n\n    await executeWASMDiscovery(\n      binary,\n      sourceMap,\n      base,\n      poolOptions,\n      collectCoverage,\n      handleLog,\n      file,\n      logModule,\n      threadImports,\n      diffOptions\n    );\n\n    // set skips when using only and/or user test name pattern, skip file task if all tests skipped\n    prepareFileTaskForCollection(file, testNamePattern, allowOnly);\n\n    file.collectDuration = performance.now() - discoverStart;\n    debug(`${fileLogPrefix} - TIMING Discovery Phase: ${file.collectDuration.toFixed(2)} ms`);\n\n    // vitest collect - report discovery results\n    await Promise.all([\n      // Report user console logs\n      reportUserConsoleLogs(rpc, logMessages, logModule, base, file),\n\n      // Report onCollected with collected and filtered tasks\n      reportFileCollected(rpc, file, logModule, fileLogLabel),\n    ]);\n\n    debug(() => `${fileLogPrefix} - Collected Test Suite Hierarchy:\\n${getFullTaskHierarchy(file)}`);\n\n    const totalTime = performance.now() - runStart;\n    debug(`${fileLogPrefix} - TIMING Compilation and Discovery: ${totalTime.toFixed(2)} ms`);\n\n    compilation = {\n      filePath: file.filepath,\n      binary,\n      sourceMap,\n      debugInfo,\n    };\n  } catch (error) {\n    const poolError = createPoolErrorFromAnyError(\n      `${fileLogLabel} - runCompileAndDiscover failure in worker`,\n      POOL_ERROR_NAMES.WASMExecutionHarnessError,\n      error\n    );\n    const testError = getTestErrorFromPoolError(poolError);\n\n    failFile(file, testError, runStart);\n\n    await reportFileQueued(rpc, file, logModule, fileLogLabel);\n    await reportFileError(rpc, file, logModule, fileLogLabel);\n\n    debug(`${fileLogPrefix} - Reported file error`);\n  } finally {\n    await flushRpcUpdates(rpc);\n    debug(`${fileLogPrefix} - runCompileAndDiscover Completed`);\n  }\n\n  return compilation;\n}\n"],"mappings":";;;;;;;;;;;;AA6CA,IAAI,yBAAiC;AAErC,eAAsB,sBACpB,MACA,WACA,KACA,aACA,aACA,iBACA,gCACA,eACA,aACA,iBACA,WACsC;CACtC,MAAM,OAAO,SAAS,KAAK,SAAS;CACpC,MAAM,gBAAgB,iBAAiB,WAAW,MAAM,KAAK;CAC7D,MAAM,eAAe,gBAAgB,MAAM,KAAK;AAEhD,OAAM,GAAG,cAAc,0CAA0C,KAAK,SAAS,OAAO,KAAK,KAAK,GAAG;CAEnG,MAAM,WAAW,YAAY,KAAK;CAClC,IAAI;AAEJ,KAAI;AACF,QAAM,iBAAiB,KAAK,MAAM,WAAW,aAAa;EAI1D,MAAM,yBAAiD;GACrD;GACA,uBAAuB;IAHI,SAAS,aAAa,KAAK,SAAS;IAK7D,GAAI,YAAY,2BAA2B,EAAE,GAAG;IAChD,GAAG;IACJ;GACD;GACA,mCAAmC,YAAY,2BAA2B,2BAA2B;GACrG,wBAAwB,YAAY;GACpC,wBAAwB,YAAY;GACpC,OAAO,YAAY;GACpB;EACD,MAAM,kBAAiD;GACrD,aAAa,YAAY;GACZ;GACb,kBAAkB;GAClB;GACA,YAAY,YAAY;GACzB;EAED,MAAM,EAAE,QAAQ,WAAW,WAAW,kBAAkB,MAAM,sBAC5D,KAAK,UACL,iBACA,WACA,aACD;AACD,OAAK,gBAAgB;AACrB;AAEA,QAAM,GAAG,cAAc,uDACD,uBAAuB,KAAK,cAAc,QAAQ,EAAE,CAAC,KAC1E;EAED,MAAM,cAA0C,EAAE;EAClD,MAAM,aAA8C,KAAa,UAAmB,UAAgB;AAClG,eAAY,KAAK;IAAE;IAAK,MAAM,KAAK,KAAK;IAAE;IAAS,CAAC;;EAGtD,MAAM,gBAAgB,YAAY,KAAK;AAEvC,QAAM,qBACJ,QACA,WACA,MACA,aACA,iBACA,WACA,MACA,WACA,eACA,YACD;AAGD,+BAA6B,MAAM,iBAAiB,UAAU;AAE9D,OAAK,kBAAkB,YAAY,KAAK,GAAG;AAC3C,QAAM,GAAG,cAAc,6BAA6B,KAAK,gBAAgB,QAAQ,EAAE,CAAC,KAAK;AAGzF,QAAM,QAAQ,IAAI,CAEhB,sBAAsB,KAAK,aAAa,WAAW,MAAM,KAAK,EAG9D,oBAAoB,KAAK,MAAM,WAAW,aAAa,CACxD,CAAC;AAEF,cAAY,GAAG,cAAc,sCAAsC,qBAAqB,KAAK,GAAG;AAGhG,QAAM,GAAG,cAAc,wCADL,YAAY,KAAK,GAAG,UACkC,QAAQ,EAAE,CAAC,KAAK;AAExF,gBAAc;GACZ,UAAU,KAAK;GACf;GACA;GACA;GACD;UACM,OAAO;AAQd,WAAS,MAFS,0BALA,4BAChB,GAAG,aAAa,6CAChB,iBAAiB,2BACjB,MACD,CACqD,EAE5B,SAAS;AAEnC,QAAM,iBAAiB,KAAK,MAAM,WAAW,aAAa;AAC1D,QAAM,gBAAgB,KAAK,MAAM,WAAW,aAAa;AAEzD,QAAM,GAAG,cAAc,wBAAwB;WACvC;AACR,QAAM,gBAAgB,IAAI;AAC1B,QAAM,GAAG,cAAc,oCAAoC;;AAG7D,QAAO"}

package/dist/compiler/transforms/strip-inline.mjs

@@ -1,5 +1,5 @@
-import { ASDecoratorKind, ASSourceKind } from "../../constants-DX9yo-el.mjs";
-import { ASTVisitor } from "../../ast-visitor-lTahoS9R.mjs";
+import { ASDecoratorKind, ASSourceKind } from "../../constants-DuBLuMjt.mjs";
+import { ASTVisitor } from "../../ast-visitor-DJLJd5dt.mjs";
 import { Transform } from "assemblyscript/transform";
 
 //#region src/compiler/transforms/strip-inline.mts