@cuxt/sandboxjs 0.1.1 → 0.1.4

package/dist/esm/utils/Scope.d.ts

@@ -0,0 +1,47 @@
+import { VarType, IExecContext, IScope } from './types';
+import { Prop } from './Prop';
+export type Unknown = undefined | null | Record<string | number, unknown>;
+export declare class Scope {
+    parent: Scope | null;
+    const: {
+        [key: string]: true;
+    };
+    let: {
+        [key: string]: true;
+    };
+    var: {
+        [key: string]: true;
+    };
+    internal: {
+        [key: string]: true;
+    };
+    globals: {
+        [key: string]: true;
+    };
+    allVars: {
+        [key: string]: unknown;
+    } & object;
+    internalVars: {
+        [key: string]: unknown;
+    };
+    functionThis?: Unknown;
+    constructor(parent: Scope | null, vars?: {}, functionThis?: Unknown);
+    get(key: string, internal: boolean): Prop;
+    set(key: string, val: unknown, internal: boolean): Prop<unknown>;
+    getWhereValScope(key: string, isThis: boolean, internal: boolean): Scope | null;
+    getWhereVarScope(key: string, localScope: boolean, internal: boolean): Scope;
+    declare(key: string, type: VarType, value: unknown, isGlobal: boolean, internal: boolean): Prop;
+}
+export declare class FunctionScope implements IScope {
+}
+export declare class LocalScope implements IScope {
+}
+export declare const optional: {};
+export declare class DelayedSynchronousResult {
+    readonly result: unknown;
+    constructor(cb: () => unknown);
+}
+export declare function delaySynchronousResult(cb: () => Promise<unknown>): DelayedSynchronousResult;
+export declare function sanitizeProp(value: unknown, context: IExecContext, cache?: WeakSet<object>): unknown;
+export declare function sanitizeScope(scope: IScope, context: IExecContext, cache?: WeakSet<object>): void;
+export declare function sanitizeScopes(scopes: IScope[], context: IExecContext, cache?: WeakSet<object>): void;

package/dist/esm/utils/Scope.js

@@ -0,0 +1,122 @@
+import { SandboxError } from "./errors.js";
+import { VarType, reservedWords } from "./types.js";
+import { Prop, hasOwnProperty, resolveSandboxProp } from "./Prop.js";
+//#region src/utils/Scope.ts
+function keysOnly(obj) {
+	const ret = Object.assign({}, obj);
+	for (const key in ret) ret[key] = true;
+	return ret;
+}
+var Scope = class {
+	constructor(parent, vars = {}, functionThis) {
+		this.const = {};
+		this.let = {};
+		this.var = {};
+		this.internal = {};
+		this.internalVars = {};
+		const isFuncScope = functionThis !== void 0 || parent === null;
+		this.parent = parent;
+		this.allVars = vars;
+		this.let = isFuncScope ? this.let : keysOnly(vars);
+		this.var = isFuncScope ? keysOnly(vars) : this.var;
+		this.globals = parent === null ? keysOnly(vars) : {};
+		this.functionThis = functionThis;
+	}
+	get(key, internal) {
+		const isThis = key === "this";
+		const scope = this.getWhereValScope(key, isThis, internal);
+		if (scope && isThis) return new Prop({ this: scope.functionThis }, key, false, false, true);
+		if (!scope) return new Prop(void 0, key);
+		if (internal && scope.internalVars[key]) return new Prop(scope.internalVars, key, false, false, true, true);
+		return new Prop(scope.allVars, key, hasOwnProperty(scope.const, key), hasOwnProperty(scope.globals, key), true);
+	}
+	set(key, val, internal) {
+		if (key === "this") throw new SyntaxError("\"this\" cannot be assigned");
+		if (reservedWords.has(key)) throw new SyntaxError("Unexepected token '" + key + "'");
+		const prop = this.get(key, internal);
+		if (prop.context === void 0) throw new ReferenceError(`Variable '${key}' was not declared.`);
+		if (prop.context === null) throw new TypeError(`Cannot set properties of null, (setting '${key}')`);
+		if (prop.isConst) throw new TypeError(`Assignment to constant variable`);
+		if (prop.isGlobal) throw new SandboxError(`Cannot override global variable '${key}'`);
+		prop.context[prop.prop] = val;
+		return prop;
+	}
+	getWhereValScope(key, isThis, internal) {
+		let scope = this;
+		if (isThis) {
+			do {
+				if (scope.functionThis !== void 0) return scope;
+				scope = scope.parent;
+			} while (scope !== null);
+			return null;
+		}
+		do {
+			if (internal && key in scope.internalVars && !(key in {} && !hasOwnProperty(scope.internalVars, key))) return scope;
+			if (key in scope.allVars && !(key in {} && !hasOwnProperty(scope.allVars, key))) return scope;
+			scope = scope.parent;
+		} while (scope !== null);
+		return null;
+	}
+	getWhereVarScope(key, localScope, internal) {
+		let scope = this;
+		do {
+			if (internal && key in scope.internalVars && !(key in {} && !hasOwnProperty(scope.internalVars, key))) return scope;
+			if (key in scope.allVars && !(key in {} && !hasOwnProperty(scope.allVars, key))) return scope;
+			if (scope.parent === null || localScope || scope.functionThis !== void 0) return scope;
+			scope = scope.parent;
+		} while (scope !== null);
+		return scope;
+	}
+	declare(key, type, value, isGlobal, internal) {
+		if (key === "this") throw new SyntaxError("\"this\" cannot be declared");
+		if (reservedWords.has(key)) throw new SyntaxError("Unexepected token '" + key + "'");
+		const existingScope = this.getWhereVarScope(key, type !== VarType.var, internal);
+		if (type === VarType.var) {
+			if (existingScope.var[key]) {
+				existingScope.allVars[key] = value;
+				if (!isGlobal) delete existingScope.globals[key];
+				else existingScope.globals[key] = true;
+				return new Prop(existingScope.allVars, key, false, existingScope.globals[key], true);
+			} else if (key in existingScope.allVars) throw new SyntaxError(`Identifier '${key}' has already been declared`);
+		}
+		if (key in existingScope.allVars || key in existingScope.internalVars) throw new SyntaxError(`Identifier '${key}' has already been declared`);
+		if (isGlobal) existingScope.globals[key] = true;
+		existingScope[type][key] = true;
+		if (type === VarType.internal) existingScope.internalVars[key] = value;
+		else existingScope.allVars[key] = value;
+		return new Prop(type === VarType.internal ? this.internalVars : this.allVars, key, type === VarType.const, isGlobal, true, type === VarType.internal);
+	}
+};
+var LocalScope = class {};
+var optional = {};
+var DelayedSynchronousResult = class {
+	constructor(cb) {
+		this.result = cb();
+	}
+};
+function delaySynchronousResult(cb) {
+	return new DelayedSynchronousResult(cb);
+}
+function sanitizeProp(value, context, cache = /* @__PURE__ */ new WeakSet()) {
+	if (value === null || typeof value !== "object" && typeof value !== "function") return value;
+	value = resolveSandboxProp(value, context) || value;
+	if (value instanceof Prop) value = value.get(context);
+	if (value === optional) return;
+	return value;
+}
+function sanitizeScope(scope, context, cache = /* @__PURE__ */ new WeakSet()) {
+	if (cache.has(scope)) return;
+	cache.add(scope);
+	for (const key in scope) {
+		const val = scope[key];
+		if (val !== null && typeof val === "object") sanitizeScope(val, context, cache);
+		scope[key] = sanitizeProp(val, context);
+	}
+}
+function sanitizeScopes(scopes, context, cache = /* @__PURE__ */ new WeakSet()) {
+	for (const scope of scopes) sanitizeScope(scope, context, cache);
+}
+//#endregion
+export { DelayedSynchronousResult, LocalScope, Scope, delaySynchronousResult, optional, sanitizeProp, sanitizeScope, sanitizeScopes };
+
+//# sourceMappingURL=Scope.js.map

package/dist/esm/utils/Scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Scope.js","names":[],"sources":["../../../src/utils/Scope.ts"],"sourcesContent":["import { reservedWords, VarType } from './types';\nimport { Prop, resolveSandboxProp, hasOwnProperty } from './Prop';\nimport { SandboxError } from './errors';\nimport type { IExecContext, IScope } from './types';\n\nfunction keysOnly(obj: unknown): Record<string, true> {\n  const ret: Record<string, true> = Object.assign({}, obj);\n  for (const key in ret) {\n    ret[key] = true;\n  }\n  return ret;\n}\n\nexport type Unknown = undefined | null | Record<string | number, unknown>;\n\nexport class Scope {\n  parent: Scope | null;\n  const: { [key: string]: true } = {};\n  let: { [key: string]: true } = {};\n  var: { [key: string]: true } = {};\n  internal: { [key: string]: true } = {};\n  globals: { [key: string]: true };\n  allVars: { [key: string]: unknown } & object;\n  internalVars: { [key: string]: unknown } = {};\n  functionThis?: Unknown;\n  constructor(parent: Scope | null, vars = {}, functionThis?: Unknown) {\n    const isFuncScope = functionThis !== undefined || parent === null;\n    this.parent = parent;\n    this.allVars = vars;\n    this.let = isFuncScope ? this.let : keysOnly(vars);\n    this.var = isFuncScope ? keysOnly(vars) : this.var;\n    this.globals = parent === null ? keysOnly(vars) : {};\n    this.functionThis = functionThis;\n  }\n\n  get(key: string, internal: boolean): Prop {\n    const isThis = key === 'this';\n    const scope = this.getWhereValScope(key, isThis, internal);\n    if (scope && isThis) {\n      return new Prop({ this: scope.functionThis }, key, false, false, true);\n    }\n    if (!scope) {\n      return new Prop(undefined, key);\n    }\n    if (internal && scope.internalVars[key]) {\n      return new Prop(scope.internalVars, key, false, false, true, true);\n    }\n    return new Prop(\n      scope.allVars,\n      key,\n      hasOwnProperty(scope.const, key),\n      hasOwnProperty(scope.globals, key),\n      true,\n    );\n  }\n\n  set(key: string, val: unknown, internal: boolean) {\n    if (key === 'this') throw new SyntaxError('\"this\" cannot be assigned');\n    if (reservedWords.has(key)) throw new SyntaxError(\"Unexepected token '\" + key + \"'\");\n    const prop = this.get(key, internal);\n    if (prop.context === undefined) {\n      throw new ReferenceError(`Variable '${key}' was not declared.`);\n    }\n    if (prop.context === null) {\n      throw new TypeError(`Cannot set properties of null, (setting '${key}')`);\n    }\n    if (prop.isConst) {\n      throw new TypeError(`Assignment to constant variable`);\n    }\n    if (prop.isGlobal) {\n      throw new SandboxError(`Cannot override global variable '${key}'`);\n    }\n    (prop.context as any)[prop.prop] = val;\n    return prop;\n  }\n\n  getWhereValScope(key: string, isThis: boolean, internal: boolean): Scope | null {\n    let scope: Scope = this;\n    if (isThis) {\n      do {\n        if (scope.functionThis !== undefined) return scope;\n        scope = scope.parent!;\n      } while (scope !== null);\n      return null;\n    }\n    do {\n      if (\n        internal &&\n        key in scope.internalVars &&\n        !(key in {} && !hasOwnProperty(scope.internalVars, key))\n      ) {\n        return scope;\n      }\n      if (key in scope.allVars && !(key in {} && !hasOwnProperty(scope.allVars, key))) {\n        return scope;\n      }\n      scope = scope.parent!;\n    } while (scope !== null);\n    return null;\n  }\n\n  getWhereVarScope(key: string, localScope: boolean, internal: boolean): Scope {\n    let scope: Scope = this;\n    do {\n      if (\n        internal &&\n        key in scope.internalVars &&\n        !(key in {} && !hasOwnProperty(scope.internalVars, key))\n      ) {\n        return scope;\n      }\n      if (key in scope.allVars && !(key in {} && !hasOwnProperty(scope.allVars, key))) {\n        return scope;\n      }\n      if (scope.parent === null || localScope || scope.functionThis !== undefined) {\n        return scope;\n      }\n      scope = scope.parent!;\n    } while (scope !== null);\n    return scope;\n  }\n\n  declare(key: string, type: VarType, value: unknown, isGlobal: boolean, internal: boolean): Prop {\n    if (key === 'this') throw new SyntaxError('\"this\" cannot be declared');\n    if (reservedWords.has(key)) throw new SyntaxError(\"Unexepected token '\" + key + \"'\");\n    const existingScope = this.getWhereVarScope(key, type !== VarType.var, internal);\n    if (type === VarType.var) {\n      if (existingScope.var[key]) {\n        existingScope.allVars[key] = value;\n        if (!isGlobal) {\n          delete existingScope.globals[key];\n        } else {\n          existingScope.globals[key] = true;\n        }\n        return new Prop(existingScope.allVars, key, false, existingScope.globals[key], true);\n      } else if (key in existingScope.allVars) {\n        throw new SyntaxError(`Identifier '${key}' has already been declared`);\n      }\n    }\n    if (key in existingScope.allVars || key in existingScope.internalVars) {\n      throw new SyntaxError(`Identifier '${key}' has already been declared`);\n    }\n\n    if (isGlobal) {\n      existingScope.globals[key] = true;\n    }\n    existingScope[type][key] = true;\n    if (type === VarType.internal) {\n      existingScope.internalVars[key] = value;\n    } else {\n      existingScope.allVars[key] = value;\n    }\n\n    return new Prop(\n      type === VarType.internal ? this.internalVars : this.allVars,\n      key,\n      type === VarType.const,\n      isGlobal,\n      true,\n      type === VarType.internal,\n    );\n  }\n}\n\nexport class FunctionScope implements IScope {}\n\nexport class LocalScope implements IScope {}\n\nexport const optional = {};\n\nexport class DelayedSynchronousResult {\n  readonly result: unknown;\n  constructor(cb: () => unknown) {\n    this.result = cb();\n  }\n}\n\nexport function delaySynchronousResult(cb: () => Promise<unknown>) {\n  return new DelayedSynchronousResult(cb);\n}\n\nexport function sanitizeProp(\n  value: unknown,\n  context: IExecContext,\n  cache = new WeakSet<object>(),\n): unknown {\n  if (value === null || (typeof value !== 'object' && typeof value !== 'function')) return value;\n\n  value = resolveSandboxProp(value, context) || value;\n\n  if (value instanceof Prop) {\n    value = value.get(context);\n  }\n\n  if (value === optional) {\n    return undefined;\n  }\n\n  return value;\n}\n\nexport function sanitizeScope(scope: IScope, context: IExecContext, cache = new WeakSet<object>()) {\n  if (cache.has(scope)) return;\n  cache.add(scope);\n  for (const key in scope) {\n    const val = scope[key];\n    if (val !== null && typeof val === 'object') {\n      sanitizeScope(val, context, cache);\n    }\n    scope[key] = sanitizeProp(val, context);\n  }\n}\n\nexport function sanitizeScopes(\n  scopes: IScope[],\n  context: IExecContext,\n  cache = new WeakSet<object>(),\n) {\n  for (const scope of scopes) {\n    sanitizeScope(scope, context, cache);\n  }\n}\n"],"mappings":";;;;AAKA,SAAS,SAAS,KAAoC;CACpD,MAAM,MAA4B,OAAO,OAAO,EAAE,EAAE,IAAI;AACxD,MAAK,MAAM,OAAO,IAChB,KAAI,OAAO;AAEb,QAAO;;AAKT,IAAa,QAAb,MAAmB;CAUjB,YAAY,QAAsB,OAAO,EAAE,EAAE,cAAwB;eARpC,EAAE;aACJ,EAAE;aACF,EAAE;kBACG,EAAE;sBAGK,EAAE;EAG3C,MAAM,cAAc,iBAAiB,KAAA,KAAa,WAAW;AAC7D,OAAK,SAAS;AACd,OAAK,UAAU;AACf,OAAK,MAAM,cAAc,KAAK,MAAM,SAAS,KAAK;AAClD,OAAK,MAAM,cAAc,SAAS,KAAK,GAAG,KAAK;AAC/C,OAAK,UAAU,WAAW,OAAO,SAAS,KAAK,GAAG,EAAE;AACpD,OAAK,eAAe;;CAGtB,IAAI,KAAa,UAAyB;EACxC,MAAM,SAAS,QAAQ;EACvB,MAAM,QAAQ,KAAK,iBAAiB,KAAK,QAAQ,SAAS;AAC1D,MAAI,SAAS,OACX,QAAO,IAAI,KAAK,EAAE,MAAM,MAAM,cAAc,EAAE,KAAK,OAAO,OAAO,KAAK;AAExE,MAAI,CAAC,MACH,QAAO,IAAI,KAAK,KAAA,GAAW,IAAI;AAEjC,MAAI,YAAY,MAAM,aAAa,KACjC,QAAO,IAAI,KAAK,MAAM,cAAc,KAAK,OAAO,OAAO,MAAM,KAAK;AAEpE,SAAO,IAAI,KACT,MAAM,SACN,KACA,eAAe,MAAM,OAAO,IAAI,EAChC,eAAe,MAAM,SAAS,IAAI,EAClC,KACD;;CAGH,IAAI,KAAa,KAAc,UAAmB;AAChD,MAAI,QAAQ,OAAQ,OAAM,IAAI,YAAY,8BAA4B;AACtE,MAAI,cAAc,IAAI,IAAI,CAAE,OAAM,IAAI,YAAY,wBAAwB,MAAM,IAAI;EACpF,MAAM,OAAO,KAAK,IAAI,KAAK,SAAS;AACpC,MAAI,KAAK,YAAY,KAAA,EACnB,OAAM,IAAI,eAAe,aAAa,IAAI,qBAAqB;AAEjE,MAAI,KAAK,YAAY,KACnB,OAAM,IAAI,UAAU,4CAA4C,IAAI,IAAI;AAE1E,MAAI,KAAK,QACP,OAAM,IAAI,UAAU,kCAAkC;AAExD,MAAI,KAAK,SACP,OAAM,IAAI,aAAa,oCAAoC,IAAI,GAAG;AAEnE,OAAK,QAAgB,KAAK,QAAQ;AACnC,SAAO;;CAGT,iBAAiB,KAAa,QAAiB,UAAiC;EAC9E,IAAI,QAAe;AACnB,MAAI,QAAQ;AACV,MAAG;AACD,QAAI,MAAM,iBAAiB,KAAA,EAAW,QAAO;AAC7C,YAAQ,MAAM;YACP,UAAU;AACnB,UAAO;;AAET,KAAG;AACD,OACE,YACA,OAAO,MAAM,gBACb,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,MAAM,cAAc,IAAI,EAEvD,QAAO;AAET,OAAI,OAAO,MAAM,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,MAAM,SAAS,IAAI,EAC5E,QAAO;AAET,WAAQ,MAAM;WACP,UAAU;AACnB,SAAO;;CAGT,iBAAiB,KAAa,YAAqB,UAA0B;EAC3E,IAAI,QAAe;AACnB,KAAG;AACD,OACE,YACA,OAAO,MAAM,gBACb,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,MAAM,cAAc,IAAI,EAEvD,QAAO;AAET,OAAI,OAAO,MAAM,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,MAAM,SAAS,IAAI,EAC5E,QAAO;AAET,OAAI,MAAM,WAAW,QAAQ,cAAc,MAAM,iBAAiB,KAAA,EAChE,QAAO;AAET,WAAQ,MAAM;WACP,UAAU;AACnB,SAAO;;CAGT,QAAQ,KAAa,MAAe,OAAgB,UAAmB,UAAyB;AAC9F,MAAI,QAAQ,OAAQ,OAAM,IAAI,YAAY,8BAA4B;AACtE,MAAI,cAAc,IAAI,IAAI,CAAE,OAAM,IAAI,YAAY,wBAAwB,MAAM,IAAI;EACpF,MAAM,gBAAgB,KAAK,iBAAiB,KAAK,SAAS,QAAQ,KAAK,SAAS;AAChF,MAAI,SAAS,QAAQ;OACf,cAAc,IAAI,MAAM;AAC1B,kBAAc,QAAQ,OAAO;AAC7B,QAAI,CAAC,SACH,QAAO,cAAc,QAAQ;QAE7B,eAAc,QAAQ,OAAO;AAE/B,WAAO,IAAI,KAAK,cAAc,SAAS,KAAK,OAAO,cAAc,QAAQ,MAAM,KAAK;cAC3E,OAAO,cAAc,QAC9B,OAAM,IAAI,YAAY,eAAe,IAAI,6BAA6B;;AAG1E,MAAI,OAAO,cAAc,WAAW,OAAO,cAAc,aACvD,OAAM,IAAI,YAAY,eAAe,IAAI,6BAA6B;AAGxE,MAAI,SACF,eAAc,QAAQ,OAAO;AAE/B,gBAAc,MAAM,OAAO;AAC3B,MAAI,SAAS,QAAQ,SACnB,eAAc,aAAa,OAAO;MAElC,eAAc,QAAQ,OAAO;AAG/B,SAAO,IAAI,KACT,SAAS,QAAQ,WAAW,KAAK,eAAe,KAAK,SACrD,KACA,SAAS,QAAQ,OACjB,UACA,MACA,SAAS,QAAQ,SAClB;;;AAML,IAAa,aAAb,MAA0C;AAE1C,IAAa,WAAW,EAAE;AAE1B,IAAa,2BAAb,MAAsC;CAEpC,YAAY,IAAmB;AAC7B,OAAK,SAAS,IAAI;;;AAItB,SAAgB,uBAAuB,IAA4B;AACjE,QAAO,IAAI,yBAAyB,GAAG;;AAGzC,SAAgB,aACd,OACA,SACA,wBAAQ,IAAI,SAAiB,EACpB;AACT,KAAI,UAAU,QAAS,OAAO,UAAU,YAAY,OAAO,UAAU,WAAa,QAAO;AAEzF,SAAQ,mBAAmB,OAAO,QAAQ,IAAI;AAE9C,KAAI,iBAAiB,KACnB,SAAQ,MAAM,IAAI,QAAQ;AAG5B,KAAI,UAAU,SACZ;AAGF,QAAO;;AAGT,SAAgB,cAAc,OAAe,SAAuB,wBAAQ,IAAI,SAAiB,EAAE;AACjG,KAAI,MAAM,IAAI,MAAM,CAAE;AACtB,OAAM,IAAI,MAAM;AAChB,MAAK,MAAM,OAAO,OAAO;EACvB,MAAM,MAAM,MAAM;AAClB,MAAI,QAAQ,QAAQ,OAAO,QAAQ,SACjC,eAAc,KAAK,SAAS,MAAM;AAEpC,QAAM,OAAO,aAAa,KAAK,QAAQ;;;AAI3C,SAAgB,eACd,QACA,SACA,wBAAQ,IAAI,SAAiB,EAC7B;AACA,MAAK,MAAM,SAAS,OAClB,eAAc,OAAO,SAAS,MAAM"}

package/dist/esm/utils/errors.d.ts

@@ -0,0 +1,10 @@
+export declare class SandboxError extends Error {
+}
+export declare class SandboxExecutionQuotaExceededError extends SandboxError {
+}
+export declare class SandboxExecutionTreeError extends SandboxError {
+}
+export declare class SandboxCapabilityError extends SandboxError {
+}
+export declare class SandboxAccessError extends SandboxError {
+}

package/dist/esm/utils/errors.js

@@ -0,0 +1,10 @@
+//#region src/utils/errors.ts
+var SandboxError = class extends Error {};
+var SandboxExecutionQuotaExceededError = class extends SandboxError {};
+var SandboxExecutionTreeError = class extends SandboxError {};
+var SandboxCapabilityError = class extends SandboxError {};
+var SandboxAccessError = class extends SandboxError {};
+//#endregion
+export { SandboxAccessError, SandboxCapabilityError, SandboxError, SandboxExecutionQuotaExceededError, SandboxExecutionTreeError };
+
+//# sourceMappingURL=errors.js.map

package/dist/esm/utils/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","names":[],"sources":["../../../src/utils/errors.ts"],"sourcesContent":["import { IExecContext, IScope } from './types';\n\nexport class SandboxError extends Error {}\n\nexport class SandboxExecutionQuotaExceededError extends SandboxError {}\n\nexport class SandboxExecutionTreeError extends SandboxError {}\n\nexport class SandboxCapabilityError extends SandboxError {}\n\nexport class SandboxAccessError extends SandboxError {}\n"],"mappings":";AAEA,IAAa,eAAb,cAAkC,MAAM;AAExC,IAAa,qCAAb,cAAwD,aAAa;AAErE,IAAa,4BAAb,cAA+C,aAAa;AAE5D,IAAa,yBAAb,cAA4C,aAAa;AAEzD,IAAa,qBAAb,cAAwC,aAAa"}

package/dist/esm/utils/functionReplacements.d.ts

@@ -0,0 +1,11 @@
+import { IExecContext } from './types';
+/**
+ * Checks if adding `expectTicks` would exceed the tick limit, and throws SandboxExecutionQuotaExceededError
+ * (which bypasses user try/catch) if so. Otherwise increments the tick counter.
+ */
+export declare function checkTicksAndThrow(ctx: IExecContext, expectTicks: bigint): void;
+export declare const typedArrayProtos: Set<any>;
+type Factory = (ctx: IExecContext) => Function;
+export declare const DEFAULT_FUNCTION_REPLACEMENTS: Map<Function, Factory>;
+export declare const THIS_DEPENDENT_FUNCTION_REPLACEMENTS: Set<Function>;
+export {};

package/dist/esm/utils/functionReplacements.js

@@ -0,0 +1,361 @@
+import { SandboxExecutionQuotaExceededError } from "./errors.js";
+//#region src/utils/functionReplacements.ts
+/**
+* Checks if adding `expectTicks` would exceed the tick limit, and throws SandboxExecutionQuotaExceededError
+* (which bypasses user try/catch) if so. Otherwise increments the tick counter.
+*/
+function checkTicksAndThrow(ctx, expectTicks) {
+	const { ticks } = ctx.ctx;
+	if (ticks.tickLimit !== void 0 && ticks.tickLimit <= ticks.ticks + expectTicks) throw new SandboxExecutionQuotaExceededError("Execution quota exceeded");
+	ticks.ticks += expectTicks;
+}
+var typedArrayProtos = new Set([
+	Int8Array,
+	Uint8Array,
+	Uint8ClampedArray,
+	Int16Array,
+	Uint16Array,
+	Int32Array,
+	Uint32Array,
+	Float32Array,
+	Float64Array
+].map((T) => Object.getPrototypeOf(T.prototype)));
+function isTypedArray(obj) {
+	return ArrayBuffer.isView(obj) && !(obj instanceof DataView) && typedArrayProtos.has(Object.getPrototypeOf(Object.getPrototypeOf(obj)));
+}
+function makeReplacement(original, getTicks) {
+	return (ctx) => function(...args) {
+		checkTicksAndThrow(ctx, getTicks(this, args));
+		return original.apply(this, args);
+	};
+}
+var arr = [];
+var arrProto = Array.prototype;
+function arrayTicks(complexity, original) {
+	return (thisArg, args) => {
+		if (!Array.isArray(thisArg)) return 0n;
+		const n = BigInt(thisArg.length);
+		switch (complexity) {
+			case "one": return 1n;
+			case "n": return n;
+			case "nlogn": return thisArg.length <= 1 ? 1n : n * BigInt(Math.round(Math.log2(thisArg.length)));
+			case "arrs": {
+				let ticks = 0n;
+				const maxDepth = original === arr.flat ? typeof args[0] === "number" ? args[0] : 1 : 1;
+				const recurse = (a, depth = 0) => {
+					ticks += BigInt(a.length);
+					if (depth >= maxDepth) return;
+					for (const item of a) if (Array.isArray(item)) recurse(item, depth + 1);
+				};
+				recurse(thisArg);
+				return ticks;
+			}
+		}
+	};
+}
+var arrayReplacementDefs = [
+	[arr.push, "one"],
+	[arr.pop, "one"],
+	[arrProto.at, "one"],
+	[arr.fill, "n"],
+	[arr.includes, "n"],
+	[arr.indexOf, "n"],
+	[arr.lastIndexOf, "n"],
+	[arr.find, "n"],
+	[arr.findIndex, "n"],
+	[arrProto.findLast, "n"],
+	[arrProto.findLastIndex, "n"],
+	[arr.forEach, "n"],
+	[arr.map, "n"],
+	[arr.filter, "n"],
+	[arr.reduce, "n"],
+	[arr.reduceRight, "n"],
+	[arr.every, "n"],
+	[arr.some, "n"],
+	[arr.join, "n"],
+	[arr.reverse, "n"],
+	[arr.shift, "n"],
+	[arr.unshift, "n"],
+	[arr.splice, "n"],
+	[arr.slice, "n"],
+	[arr.copyWithin, "n"],
+	[arr.entries, "n"],
+	[arr.keys, "n"],
+	[arr.values, "n"],
+	[arrProto.toReversed, "n"],
+	[arrProto.toSpliced, "n"],
+	[arrProto.with, "n"],
+	[arr.toString, "n"],
+	[arr.toLocaleString, "n"],
+	[arr.sort, "nlogn"],
+	[arrProto.toSorted, "nlogn"],
+	[arr.flat, "arrs"],
+	[arr.flatMap, "arrs"],
+	[arr.concat, "arrs"]
+];
+var str = "";
+var strProto = String.prototype;
+function stringTicks(complexity) {
+	return (thisArg) => {
+		if (typeof thisArg !== "string") return 0n;
+		return complexity === "one" ? 1n : BigInt(thisArg.length);
+	};
+}
+var stringReplacementDefs = [
+	[str.charAt, "one"],
+	[str.charCodeAt, "one"],
+	[str.codePointAt, "one"],
+	[strProto.at, "one"],
+	[str.indexOf, "n"],
+	[str.lastIndexOf, "n"],
+	[str.includes, "n"],
+	[str.startsWith, "n"],
+	[str.endsWith, "n"],
+	[str.slice, "n"],
+	[str.substring, "n"],
+	[str.padStart, "n"],
+	[str.padEnd, "n"],
+	[str.repeat, "n"],
+	[str.split, "n"],
+	[str.replace, "n"],
+	[strProto.replaceAll, "n"],
+	[str.match, "n"],
+	[str.matchAll, "n"],
+	[str.search, "n"],
+	[str.trim, "n"],
+	[str.trimStart, "n"],
+	[str.trimEnd, "n"],
+	[str.toLowerCase, "n"],
+	[str.toUpperCase, "n"],
+	[str.toLocaleLowerCase, "n"],
+	[str.toLocaleUpperCase, "n"],
+	[str.normalize, "n"],
+	[str.concat, "n"],
+	[str.toString, "n"],
+	[str.valueOf, "n"]
+];
+var _map = /* @__PURE__ */ new Map();
+var mapReplacementDefs = [
+	[_map.get, "one"],
+	[_map.set, "one"],
+	[_map.has, "one"],
+	[_map.delete, "one"],
+	[_map.keys, "n"],
+	[_map.values, "n"],
+	[_map.entries, "n"],
+	[_map.forEach, "n"],
+	[_map.clear, "n"]
+];
+function mapTicks(complexity) {
+	return (thisArg) => {
+		if (!(thisArg instanceof Map)) return 0n;
+		return complexity === "one" ? 1n : BigInt(thisArg.size);
+	};
+}
+var _set = /* @__PURE__ */ new Set();
+var setReplacementDefs = [
+	[_set.add, "one"],
+	[_set.has, "one"],
+	[_set.delete, "one"],
+	[_set.values, "n"],
+	[_set.keys, "n"],
+	[_set.entries, "n"],
+	[_set.forEach, "n"],
+	[_set.clear, "n"]
+];
+function setTicks(complexity) {
+	return (thisArg) => {
+		if (!(thisArg instanceof Set)) return 0n;
+		return complexity === "one" ? 1n : BigInt(thisArg.size);
+	};
+}
+var typedArrayReplacementDefs = [];
+for (const proto of typedArrayProtos) {
+	if (proto.at) typedArrayReplacementDefs.push([proto.at, "one"]);
+	if (proto.set) typedArrayReplacementDefs.push([proto.set, "one"]);
+	for (const m of [
+		"fill",
+		"find",
+		"findIndex",
+		"findLast",
+		"findLastIndex",
+		"includes",
+		"indexOf",
+		"lastIndexOf",
+		"forEach",
+		"map",
+		"filter",
+		"reduce",
+		"reduceRight",
+		"every",
+		"some",
+		"join",
+		"reverse",
+		"slice",
+		"subarray",
+		"copyWithin",
+		"entries",
+		"keys",
+		"values",
+		"toReversed",
+		"with",
+		"toString",
+		"toLocaleString"
+	]) if (proto[m]) typedArrayReplacementDefs.push([proto[m], "n"]);
+	if (proto.sort) typedArrayReplacementDefs.push([proto.sort, "nlogn"]);
+	if (proto.toSorted) typedArrayReplacementDefs.push([proto.toSorted, "nlogn"]);
+}
+function typedArrayTicks(complexity) {
+	return (thisArg) => {
+		if (!isTypedArray(thisArg)) return 0n;
+		const n = BigInt(thisArg.length);
+		switch (complexity) {
+			case "one": return 1n;
+			case "n": return n;
+			case "nlogn": return thisArg.length <= 1 ? 1n : n * BigInt(Math.round(Math.log2(thisArg.length)));
+		}
+	};
+}
+var mathReplacementDefs = [
+	[Math.max],
+	[Math.min],
+	[Math.hypot]
+];
+var _re = /x/;
+var regexpReplacementDefs = [
+	_re.exec,
+	_re.test,
+	_re[Symbol.match],
+	_re[Symbol.matchAll],
+	_re[Symbol.replace],
+	_re[Symbol.search],
+	_re[Symbol.split]
+];
+var promiseReplacementDefs = [
+	Promise.all,
+	Promise.allSettled,
+	Promise.race,
+	...typeof Promise.any === "function" ? [Promise.any] : []
+];
+var objectReplacementDefs = [
+	[Object.prototype.hasOwnProperty, "one"],
+	[Object.prototype.propertyIsEnumerable, "one"],
+	[Object.prototype.isPrototypeOf, "one"],
+	[Object.create, "one"],
+	[Object.getPrototypeOf, "one"],
+	[Object.setPrototypeOf, "one"],
+	[Object.is, "one"],
+	[Object.defineProperty, "one"],
+	[Object.getOwnPropertyDescriptor, "one"],
+	[Object.isExtensible, "one"],
+	[Object.preventExtensions, "one"],
+	[Object.keys, "n"],
+	[Object.values, "n"],
+	[Object.entries, "n"],
+	[Object.assign, "n"],
+	[Object.fromEntries, "n"],
+	[Object.getOwnPropertyNames, "n"],
+	[Object.getOwnPropertySymbols, "n"],
+	[Object.getOwnPropertyDescriptors, "n"],
+	[Object.freeze, "n"],
+	[Object.seal, "n"],
+	[Object.isFrozen, "n"],
+	[Object.isSealed, "n"]
+];
+function objectTicks(complexity, isStatic) {
+	return (thisArg, args) => {
+		if (complexity === "one") return 1n;
+		const target = isStatic ? args[0] : thisArg;
+		if (target !== null && typeof target === "object") return BigInt(Object.keys(target).length);
+		return 1n;
+	};
+}
+var staticObjectMethods = new Set([
+	Object.keys,
+	Object.values,
+	Object.entries,
+	Object.assign,
+	Object.fromEntries,
+	Object.getOwnPropertyNames,
+	Object.getOwnPropertySymbols,
+	Object.getOwnPropertyDescriptors,
+	Object.freeze,
+	Object.seal,
+	Object.isFrozen,
+	Object.isSealed
+]);
+var DEFAULT_FUNCTION_REPLACEMENTS = /* @__PURE__ */ new Map();
+var THIS_DEPENDENT_FUNCTION_REPLACEMENTS = /* @__PURE__ */ new Set();
+for (const [original, complexity] of arrayReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, arrayTicks(complexity, original)));
+	THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+for (const [original, complexity] of stringReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, stringTicks(complexity)));
+	THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+for (const [original, complexity] of mapReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, mapTicks(complexity)));
+	THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+for (const [original, complexity] of setReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, setTicks(complexity)));
+	THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+for (const [original, complexity] of typedArrayReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, typedArrayTicks(complexity)));
+	THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+for (const [original] of mathReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, (_thisArg, args) => BigInt(args.length)));
+}
+for (const original of [JSON.parse, JSON.stringify]) DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, (_thisArg, args) => {
+	const target = args[0];
+	if (typeof target === "string") return BigInt(target.length);
+	if (target !== null && typeof target === "object") return BigInt(Object.keys(target).length);
+	return 1n;
+}));
+for (const original of regexpReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, (_thisArg, args) => {
+		const input = args[0];
+		return typeof input === "string" ? BigInt(input.length) : 1n;
+	}));
+	THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+for (const original of promiseReplacementDefs) {
+	if (!original) continue;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, (_thisArg, args) => {
+		const iterable = args[0];
+		return Array.isArray(iterable) ? BigInt(iterable.length) : 0n;
+	}));
+}
+for (const [original, complexity] of objectReplacementDefs) {
+	if (!original) continue;
+	const isStatic = staticObjectMethods.has(original);
+	DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, objectTicks(complexity, isStatic)));
+	if (!isStatic) THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);
+}
+if (Array.from) DEFAULT_FUNCTION_REPLACEMENTS.set(Array.from, makeReplacement(Array.from, (_thisArg, args) => {
+	const source = args[0];
+	if (source != null && typeof source.length === "number") return BigInt(source.length);
+	return 0n;
+}));
+if (typeof Array.fromAsync === "function") {
+	const fromAsync = Array.fromAsync;
+	DEFAULT_FUNCTION_REPLACEMENTS.set(fromAsync, makeReplacement(fromAsync, (_thisArg, args) => {
+		const source = args[0];
+		if (source != null && typeof source.length === "number") return BigInt(source.length);
+		return 0n;
+	}));
+}
+//#endregion
+export { DEFAULT_FUNCTION_REPLACEMENTS, THIS_DEPENDENT_FUNCTION_REPLACEMENTS, checkTicksAndThrow, typedArrayProtos };
+
+//# sourceMappingURL=functionReplacements.js.map

package/dist/esm/utils/functionReplacements.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"functionReplacements.js","names":[],"sources":["../../../src/utils/functionReplacements.ts"],"sourcesContent":["import type { IContext, IExecContext } from './types';\nimport { SandboxExecutionQuotaExceededError } from './errors';\n\n/**\n * Checks if adding `expectTicks` would exceed the tick limit, and throws SandboxExecutionQuotaExceededError\n * (which bypasses user try/catch) if so. Otherwise increments the tick counter.\n */\nexport function checkTicksAndThrow(ctx: IExecContext, expectTicks: bigint): void {\n  const { ticks } = ctx.ctx;\n  if (ticks.tickLimit !== undefined && ticks.tickLimit <= ticks.ticks + expectTicks) {\n    throw new SandboxExecutionQuotaExceededError('Execution quota exceeded');\n  }\n  ticks.ticks += expectTicks;\n}\n\n// ---------------------------------------------------------------------------\n// TypedArray shared prototype detection (mirrors call.ts)\n// ---------------------------------------------------------------------------\n\nconst _typedArrayCtors = [\n  Int8Array,\n  Uint8Array,\n  Uint8ClampedArray,\n  Int16Array,\n  Uint16Array,\n  Int32Array,\n  Uint32Array,\n  Float32Array,\n  Float64Array,\n];\nexport const typedArrayProtos = new Set(\n  _typedArrayCtors.map((T) => Object.getPrototypeOf(T.prototype) as any),\n);\n\nfunction isTypedArray(obj: unknown): obj is { length: number } {\n  return (\n    ArrayBuffer.isView(obj) &&\n    !(obj instanceof DataView) &&\n    typedArrayProtos.has(Object.getPrototypeOf(Object.getPrototypeOf(obj)))\n  );\n}\n\n// ---------------------------------------------------------------------------\n// Helpers to build replacements\n// ---------------------------------------------------------------------------\n\ntype Factory = (ctx: IExecContext) => Function;\n\nfunction makeReplacement(\n  original: Function,\n  getTicks: (thisArg: unknown, args: unknown[]) => bigint,\n): Factory {\n  return (ctx: IExecContext) =>\n    function (this: unknown, ...args: unknown[]) {\n      checkTicksAndThrow(ctx, getTicks(this, args));\n      return (original as any).apply(this, args);\n    };\n}\n\n// ---------------------------------------------------------------------------\n// Array replacements\n// ---------------------------------------------------------------------------\n\nconst arr: any[] = [];\nconst arrProto = Array.prototype as any;\n\nfunction arrayTicks(\n  complexity: 'one' | 'n' | 'nlogn' | 'arrs',\n  original: Function,\n): (thisArg: unknown, args: unknown[]) => bigint {\n  return (thisArg, args) => {\n    if (!Array.isArray(thisArg)) return 0n;\n    const n = BigInt(thisArg.length);\n    switch (complexity) {\n      case 'one':\n        return 1n;\n      case 'n':\n        return n;\n      case 'nlogn':\n        return thisArg.length <= 1 ? 1n : n * BigInt(Math.round(Math.log2(thisArg.length)));\n      case 'arrs': {\n        let ticks = 0n;\n        const maxDepth = original === arr.flat ? (typeof args[0] === 'number' ? args[0] : 1) : 1;\n        const recurse = (a: unknown[], depth = 0) => {\n          ticks += BigInt(a.length);\n          if (depth >= maxDepth) return;\n          for (const item of a) {\n            if (Array.isArray(item)) recurse(item, depth + 1);\n          }\n        };\n        recurse(thisArg);\n        return ticks;\n      }\n    }\n  };\n}\n\nconst arrayReplacementDefs: [Function, 'one' | 'n' | 'nlogn' | 'arrs'][] = [\n  // O(1)\n  [arr.push, 'one'],\n  [arr.pop, 'one'],\n  [arrProto.at, 'one'],\n  // O(n)\n  [arr.fill, 'n'],\n  [arr.includes, 'n'],\n  [arr.indexOf, 'n'],\n  [arr.lastIndexOf, 'n'],\n  [arr.find, 'n'],\n  [arr.findIndex, 'n'],\n  [arrProto.findLast, 'n'],\n  [arrProto.findLastIndex, 'n'],\n  [arr.forEach, 'n'],\n  [arr.map, 'n'],\n  [arr.filter, 'n'],\n  [arr.reduce, 'n'],\n  [arr.reduceRight, 'n'],\n  [arr.every, 'n'],\n  [arr.some, 'n'],\n  [arr.join, 'n'],\n  [arr.reverse, 'n'],\n  [arr.shift, 'n'],\n  [arr.unshift, 'n'],\n  [arr.splice, 'n'],\n  [arr.slice, 'n'],\n  [arr.copyWithin, 'n'],\n  [arr.entries, 'n'],\n  [arr.keys, 'n'],\n  [arr.values, 'n'],\n  [arrProto.toReversed, 'n'],\n  [arrProto.toSpliced, 'n'],\n  [arrProto.with, 'n'],\n  [arr.toString, 'n'],\n  [arr.toLocaleString, 'n'],\n  // O(n log n)\n  [arr.sort, 'nlogn'],\n  [arrProto.toSorted, 'nlogn'],\n  // O(n) across arrays\n  [arr.flat, 'arrs'],\n  [arr.flatMap, 'arrs'],\n  [arr.concat, 'arrs'],\n];\n\n// ---------------------------------------------------------------------------\n// String replacements\n// ---------------------------------------------------------------------------\n\nconst str = '';\nconst strProto = String.prototype as any;\n\nfunction stringTicks(complexity: 'one' | 'n'): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (typeof thisArg !== 'string') return 0n;\n    return complexity === 'one' ? 1n : BigInt(thisArg.length);\n  };\n}\n\nconst stringReplacementDefs: [Function, 'one' | 'n'][] = [\n  // O(1)\n  [str.charAt, 'one'],\n  [str.charCodeAt, 'one'],\n  [str.codePointAt, 'one'],\n  [strProto.at, 'one'],\n  // O(n)\n  [str.indexOf, 'n'],\n  [str.lastIndexOf, 'n'],\n  [str.includes, 'n'],\n  [str.startsWith, 'n'],\n  [str.endsWith, 'n'],\n  [str.slice, 'n'],\n  [str.substring, 'n'],\n  [str.padStart, 'n'],\n  [str.padEnd, 'n'],\n  [str.repeat, 'n'],\n  [str.split, 'n'],\n  [str.replace, 'n'],\n  [strProto.replaceAll, 'n'],\n  [str.match, 'n'],\n  [str.matchAll, 'n'],\n  [str.search, 'n'],\n  [str.trim, 'n'],\n  [str.trimStart, 'n'],\n  [str.trimEnd, 'n'],\n  [str.toLowerCase, 'n'],\n  [str.toUpperCase, 'n'],\n  [str.toLocaleLowerCase, 'n'],\n  [str.toLocaleUpperCase, 'n'],\n  [str.normalize, 'n'],\n  [str.concat, 'n'],\n  [str.toString, 'n'],\n  [str.valueOf, 'n'],\n];\n\n// ---------------------------------------------------------------------------\n// Map replacements\n// ---------------------------------------------------------------------------\n\nconst _map = new Map<never, never>();\n\nconst mapReplacementDefs: [Function, 'one' | 'n'][] = [\n  [_map.get, 'one'],\n  [_map.set, 'one'],\n  [_map.has, 'one'],\n  [_map.delete, 'one'],\n  [_map.keys, 'n'],\n  [_map.values, 'n'],\n  [_map.entries, 'n'],\n  [_map.forEach, 'n'],\n  [_map.clear, 'n'],\n];\n\nfunction mapTicks(complexity: 'one' | 'n'): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (!(thisArg instanceof Map)) return 0n;\n    return complexity === 'one' ? 1n : BigInt(thisArg.size);\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Set replacements\n// ---------------------------------------------------------------------------\n\nconst _set = new Set<never>();\n\nconst setReplacementDefs: [Function, 'one' | 'n'][] = [\n  [_set.add, 'one'],\n  [_set.has, 'one'],\n  [_set.delete, 'one'],\n  [_set.values, 'n'],\n  [_set.keys, 'n'],\n  [_set.entries, 'n'],\n  [_set.forEach, 'n'],\n  [_set.clear, 'n'],\n];\n\nfunction setTicks(complexity: 'one' | 'n'): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (!(thisArg instanceof Set)) return 0n;\n    return complexity === 'one' ? 1n : BigInt(thisArg.size);\n  };\n}\n\n// ---------------------------------------------------------------------------\n// TypedArray replacements\n// ---------------------------------------------------------------------------\n\nconst typedArrayReplacementDefs: [Function, 'one' | 'n' | 'nlogn'][] = [];\nfor (const proto of typedArrayProtos) {\n  if (proto.at) typedArrayReplacementDefs.push([proto.at, 'one']);\n  if (proto.set) typedArrayReplacementDefs.push([proto.set, 'one']);\n  const nMethods = [\n    'fill',\n    'find',\n    'findIndex',\n    'findLast',\n    'findLastIndex',\n    'includes',\n    'indexOf',\n    'lastIndexOf',\n    'forEach',\n    'map',\n    'filter',\n    'reduce',\n    'reduceRight',\n    'every',\n    'some',\n    'join',\n    'reverse',\n    'slice',\n    'subarray',\n    'copyWithin',\n    'entries',\n    'keys',\n    'values',\n    'toReversed',\n    'with',\n    'toString',\n    'toLocaleString',\n  ] as const;\n  for (const m of nMethods) {\n    if (proto[m]) typedArrayReplacementDefs.push([proto[m], 'n']);\n  }\n  if (proto.sort) typedArrayReplacementDefs.push([proto.sort, 'nlogn']);\n  if (proto.toSorted) typedArrayReplacementDefs.push([proto.toSorted, 'nlogn']);\n}\n\nfunction typedArrayTicks(\n  complexity: 'one' | 'n' | 'nlogn',\n): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (!isTypedArray(thisArg)) return 0n;\n    const n = BigInt(thisArg.length);\n    switch (complexity) {\n      case 'one':\n        return 1n;\n      case 'n':\n        return n;\n      case 'nlogn':\n        return (thisArg as any).length <= 1\n          ? 1n\n          : n * BigInt(Math.round(Math.log2((thisArg as any).length)));\n    }\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Math replacements\n// ---------------------------------------------------------------------------\n\nconst mathReplacementDefs: [Function][] = [[Math.max], [Math.min], [Math.hypot]];\n\n// ---------------------------------------------------------------------------\n// JSON replacements\n// ---------------------------------------------------------------------------\n\n// (JSON.stringify with subscription traversal is handled separately in LispType.Call)\n\n// ---------------------------------------------------------------------------\n// RegExp replacements\n// ---------------------------------------------------------------------------\n\nconst _re = /x/;\n\nconst regexpReplacementDefs: Function[] = [\n  _re.exec,\n  _re.test,\n  (_re as any)[Symbol.match],\n  (_re as any)[Symbol.matchAll],\n  (_re as any)[Symbol.replace],\n  (_re as any)[Symbol.search],\n  (_re as any)[Symbol.split],\n];\n\n// ---------------------------------------------------------------------------\n// Promise replacements\n// ---------------------------------------------------------------------------\n\nconst promiseReplacementDefs: Function[] = [\n  Promise.all,\n  Promise.allSettled,\n  Promise.race,\n  ...(typeof (Promise as any).any === 'function' ? [(Promise as any).any] : []),\n];\n\n// ---------------------------------------------------------------------------\n// Object replacements\n// ---------------------------------------------------------------------------\n\nconst objectReplacementDefs: [Function, 'one' | 'n'][] = [\n  [Object.prototype.hasOwnProperty, 'one'],\n  [Object.prototype.propertyIsEnumerable, 'one'],\n  [Object.prototype.isPrototypeOf, 'one'],\n  [Object.create, 'one'],\n  [Object.getPrototypeOf, 'one'],\n  [Object.setPrototypeOf, 'one'],\n  [Object.is, 'one'],\n  [Object.defineProperty, 'one'],\n  [Object.getOwnPropertyDescriptor, 'one'],\n  [Object.isExtensible, 'one'],\n  [Object.preventExtensions, 'one'],\n  [Object.keys, 'n'],\n  [Object.values, 'n'],\n  [Object.entries, 'n'],\n  [Object.assign, 'n'],\n  [Object.fromEntries, 'n'],\n  [Object.getOwnPropertyNames, 'n'],\n  [Object.getOwnPropertySymbols, 'n'],\n  [Object.getOwnPropertyDescriptors, 'n'],\n  [Object.freeze, 'n'],\n  [Object.seal, 'n'],\n  [Object.isFrozen, 'n'],\n  [Object.isSealed, 'n'],\n];\n\nfunction objectTicks(\n  complexity: 'one' | 'n',\n  isStatic: boolean,\n): (thisArg: unknown, args: unknown[]) => bigint {\n  return (thisArg, args) => {\n    if (complexity === 'one') return 1n;\n    const target = isStatic ? args[0] : thisArg;\n    if (target !== null && typeof target === 'object')\n      return BigInt(Object.keys(target as object).length);\n    return 1n;\n  };\n}\n\n// Static Object methods whose tick count is based on args[0] key count\nconst staticObjectMethods = new Set<Function>([\n  Object.keys,\n  Object.values,\n  Object.entries,\n  Object.assign,\n  Object.fromEntries,\n  Object.getOwnPropertyNames,\n  Object.getOwnPropertySymbols,\n  Object.getOwnPropertyDescriptors,\n  Object.freeze,\n  Object.seal,\n  Object.isFrozen,\n  Object.isSealed,\n]);\n\n// ---------------------------------------------------------------------------\n// Array.from / Array.fromAsync\n// ---------------------------------------------------------------------------\n\n// ---------------------------------------------------------------------------\n// Build the default replacements map\n// ---------------------------------------------------------------------------\n\nexport const DEFAULT_FUNCTION_REPLACEMENTS = new Map<Function, Factory>();\nexport const THIS_DEPENDENT_FUNCTION_REPLACEMENTS = new Set<Function>();\n\n// Array\nfor (const [original, complexity] of arrayReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, arrayTicks(complexity, original)),\n  );\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// String\nfor (const [original, complexity] of stringReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, stringTicks(complexity)));\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Map\nfor (const [original, complexity] of mapReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, mapTicks(complexity)));\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Set\nfor (const [original, complexity] of setReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, setTicks(complexity)));\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// TypedArray\nfor (const [original, complexity] of typedArrayReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, typedArrayTicks(complexity)),\n  );\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Math — O(n) on arg count\nfor (const [original] of mathReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => BigInt(args.length)),\n  );\n}\n\n// JSON — O(n) on string/object size\nfor (const original of [JSON.parse, JSON.stringify]) {\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => {\n      const target = args[0];\n      if (typeof target === 'string') return BigInt(target.length);\n      if (target !== null && typeof target === 'object')\n        return BigInt(Object.keys(target as object).length);\n      return 1n;\n    }),\n  );\n}\n\n// RegExp — O(n) on input string length\nfor (const original of regexpReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => {\n      const input = args[0];\n      return typeof input === 'string' ? BigInt(input.length) : 1n;\n    }),\n  );\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Promise.all/allSettled/race/any — O(n) on iterable length\nfor (const original of promiseReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => {\n      const iterable = args[0];\n      return Array.isArray(iterable) ? BigInt(iterable.length) : 0n;\n    }),\n  );\n}\n\n// Object static & instance methods\nfor (const [original, complexity] of objectReplacementDefs) {\n  if (!original) continue;\n  const isStatic = staticObjectMethods.has(original);\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, objectTicks(complexity, isStatic)),\n  );\n  if (!isStatic) {\n    THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n  }\n}\n\n// Array.from — O(n) on source length\nif (Array.from) {\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    Array.from,\n    makeReplacement(Array.from, (_thisArg, args) => {\n      const source = args[0];\n      if (source != null && typeof (source as any).length === 'number')\n        return BigInt((source as any).length);\n      return 0n;\n    }),\n  );\n}\n\n// Array.fromAsync — O(n) on source length (if available)\nif (typeof (Array as any).fromAsync === 'function') {\n  const fromAsync = (Array as any).fromAsync as Function;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    fromAsync,\n    makeReplacement(fromAsync, (_thisArg, args) => {\n      const source = args[0];\n      if (source != null && typeof (source as any).length === 'number')\n        return BigInt((source as any).length);\n      return 0n;\n    }),\n  );\n}\n"],"mappings":";;;;;;AAOA,SAAgB,mBAAmB,KAAmB,aAA2B;CAC/E,MAAM,EAAE,UAAU,IAAI;AACtB,KAAI,MAAM,cAAc,KAAA,KAAa,MAAM,aAAa,MAAM,QAAQ,YACpE,OAAM,IAAI,mCAAmC,2BAA2B;AAE1E,OAAM,SAAS;;AAkBjB,IAAa,mBAAmB,IAAI,IAXX;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAEkB,KAAK,MAAM,OAAO,eAAe,EAAE,UAAU,CAAQ,CACvE;AAED,SAAS,aAAa,KAAyC;AAC7D,QACE,YAAY,OAAO,IAAI,IACvB,EAAE,eAAe,aACjB,iBAAiB,IAAI,OAAO,eAAe,OAAO,eAAe,IAAI,CAAC,CAAC;;AAU3E,SAAS,gBACP,UACA,UACS;AACT,SAAQ,QACN,SAAyB,GAAG,MAAiB;AAC3C,qBAAmB,KAAK,SAAS,MAAM,KAAK,CAAC;AAC7C,SAAQ,SAAiB,MAAM,MAAM,KAAK;;;AAQhD,IAAM,MAAa,EAAE;AACrB,IAAM,WAAW,MAAM;AAEvB,SAAS,WACP,YACA,UAC+C;AAC/C,SAAQ,SAAS,SAAS;AACxB,MAAI,CAAC,MAAM,QAAQ,QAAQ,CAAE,QAAO;EACpC,MAAM,IAAI,OAAO,QAAQ,OAAO;AAChC,UAAQ,YAAR;GACE,KAAK,MACH,QAAO;GACT,KAAK,IACH,QAAO;GACT,KAAK,QACH,QAAO,QAAQ,UAAU,IAAI,KAAK,IAAI,OAAO,KAAK,MAAM,KAAK,KAAK,QAAQ,OAAO,CAAC,CAAC;GACrF,KAAK,QAAQ;IACX,IAAI,QAAQ;IACZ,MAAM,WAAW,aAAa,IAAI,OAAQ,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,IAAK;IACvF,MAAM,WAAW,GAAc,QAAQ,MAAM;AAC3C,cAAS,OAAO,EAAE,OAAO;AACzB,SAAI,SAAS,SAAU;AACvB,UAAK,MAAM,QAAQ,EACjB,KAAI,MAAM,QAAQ,KAAK,CAAE,SAAQ,MAAM,QAAQ,EAAE;;AAGrD,YAAQ,QAAQ;AAChB,WAAO;;;;;AAMf,IAAM,uBAAqE;CAEzE,CAAC,IAAI,MAAM,MAAM;CACjB,CAAC,IAAI,KAAK,MAAM;CAChB,CAAC,SAAS,IAAI,MAAM;CAEpB,CAAC,IAAI,MAAM,IAAI;CACf,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,aAAa,IAAI;CACtB,CAAC,IAAI,MAAM,IAAI;CACf,CAAC,IAAI,WAAW,IAAI;CACpB,CAAC,SAAS,UAAU,IAAI;CACxB,CAAC,SAAS,eAAe,IAAI;CAC7B,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,KAAK,IAAI;CACd,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,aAAa,IAAI;CACtB,CAAC,IAAI,OAAO,IAAI;CAChB,CAAC,IAAI,MAAM,IAAI;CACf,CAAC,IAAI,MAAM,IAAI;CACf,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,OAAO,IAAI;CAChB,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,OAAO,IAAI;CAChB,CAAC,IAAI,YAAY,IAAI;CACrB,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,MAAM,IAAI;CACf,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,SAAS,YAAY,IAAI;CAC1B,CAAC,SAAS,WAAW,IAAI;CACzB,CAAC,SAAS,MAAM,IAAI;CACpB,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,gBAAgB,IAAI;CAEzB,CAAC,IAAI,MAAM,QAAQ;CACnB,CAAC,SAAS,UAAU,QAAQ;CAE5B,CAAC,IAAI,MAAM,OAAO;CAClB,CAAC,IAAI,SAAS,OAAO;CACrB,CAAC,IAAI,QAAQ,OAAO;CACrB;AAMD,IAAM,MAAM;AACZ,IAAM,WAAW,OAAO;AAExB,SAAS,YAAY,YAAyE;AAC5F,SAAQ,YAAY;AAClB,MAAI,OAAO,YAAY,SAAU,QAAO;AACxC,SAAO,eAAe,QAAQ,KAAK,OAAO,QAAQ,OAAO;;;AAI7D,IAAM,wBAAmD;CAEvD,CAAC,IAAI,QAAQ,MAAM;CACnB,CAAC,IAAI,YAAY,MAAM;CACvB,CAAC,IAAI,aAAa,MAAM;CACxB,CAAC,SAAS,IAAI,MAAM;CAEpB,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,aAAa,IAAI;CACtB,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,YAAY,IAAI;CACrB,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,OAAO,IAAI;CAChB,CAAC,IAAI,WAAW,IAAI;CACpB,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,OAAO,IAAI;CAChB,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,SAAS,YAAY,IAAI;CAC1B,CAAC,IAAI,OAAO,IAAI;CAChB,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,MAAM,IAAI;CACf,CAAC,IAAI,WAAW,IAAI;CACpB,CAAC,IAAI,SAAS,IAAI;CAClB,CAAC,IAAI,aAAa,IAAI;CACtB,CAAC,IAAI,aAAa,IAAI;CACtB,CAAC,IAAI,mBAAmB,IAAI;CAC5B,CAAC,IAAI,mBAAmB,IAAI;CAC5B,CAAC,IAAI,WAAW,IAAI;CACpB,CAAC,IAAI,QAAQ,IAAI;CACjB,CAAC,IAAI,UAAU,IAAI;CACnB,CAAC,IAAI,SAAS,IAAI;CACnB;AAMD,IAAM,uBAAO,IAAI,KAAmB;AAEpC,IAAM,qBAAgD;CACpD,CAAC,KAAK,KAAK,MAAM;CACjB,CAAC,KAAK,KAAK,MAAM;CACjB,CAAC,KAAK,KAAK,MAAM;CACjB,CAAC,KAAK,QAAQ,MAAM;CACpB,CAAC,KAAK,MAAM,IAAI;CAChB,CAAC,KAAK,QAAQ,IAAI;CAClB,CAAC,KAAK,SAAS,IAAI;CACnB,CAAC,KAAK,SAAS,IAAI;CACnB,CAAC,KAAK,OAAO,IAAI;CAClB;AAED,SAAS,SAAS,YAAyE;AACzF,SAAQ,YAAY;AAClB,MAAI,EAAE,mBAAmB,KAAM,QAAO;AACtC,SAAO,eAAe,QAAQ,KAAK,OAAO,QAAQ,KAAK;;;AAQ3D,IAAM,uBAAO,IAAI,KAAY;AAE7B,IAAM,qBAAgD;CACpD,CAAC,KAAK,KAAK,MAAM;CACjB,CAAC,KAAK,KAAK,MAAM;CACjB,CAAC,KAAK,QAAQ,MAAM;CACpB,CAAC,KAAK,QAAQ,IAAI;CAClB,CAAC,KAAK,MAAM,IAAI;CAChB,CAAC,KAAK,SAAS,IAAI;CACnB,CAAC,KAAK,SAAS,IAAI;CACnB,CAAC,KAAK,OAAO,IAAI;CAClB;AAED,SAAS,SAAS,YAAyE;AACzF,SAAQ,YAAY;AAClB,MAAI,EAAE,mBAAmB,KAAM,QAAO;AACtC,SAAO,eAAe,QAAQ,KAAK,OAAO,QAAQ,KAAK;;;AAQ3D,IAAM,4BAAiE,EAAE;AACzE,KAAK,MAAM,SAAS,kBAAkB;AACpC,KAAI,MAAM,GAAI,2BAA0B,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC;AAC/D,KAAI,MAAM,IAAK,2BAA0B,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC;AA8BjE,MAAK,MAAM,KA7BM;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAEC,KAAI,MAAM,GAAI,2BAA0B,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC;AAE/D,KAAI,MAAM,KAAM,2BAA0B,KAAK,CAAC,MAAM,MAAM,QAAQ,CAAC;AACrE,KAAI,MAAM,SAAU,2BAA0B,KAAK,CAAC,MAAM,UAAU,QAAQ,CAAC;;AAG/E,SAAS,gBACP,YACgD;AAChD,SAAQ,YAAY;AAClB,MAAI,CAAC,aAAa,QAAQ,CAAE,QAAO;EACnC,MAAM,IAAI,OAAO,QAAQ,OAAO;AAChC,UAAQ,YAAR;GACE,KAAK,MACH,QAAO;GACT,KAAK,IACH,QAAO;GACT,KAAK,QACH,QAAQ,QAAgB,UAAU,IAC9B,KACA,IAAI,OAAO,KAAK,MAAM,KAAK,KAAM,QAAgB,OAAO,CAAC,CAAC;;;;AAStE,IAAM,sBAAoC;CAAC,CAAC,KAAK,IAAI;CAAE,CAAC,KAAK,IAAI;CAAE,CAAC,KAAK,MAAM;CAAC;AAYhF,IAAM,MAAM;AAEZ,IAAM,wBAAoC;CACxC,IAAI;CACJ,IAAI;CACH,IAAY,OAAO;CACnB,IAAY,OAAO;CACnB,IAAY,OAAO;CACnB,IAAY,OAAO;CACnB,IAAY,OAAO;CACrB;AAMD,IAAM,yBAAqC;CACzC,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,GAAI,OAAQ,QAAgB,QAAQ,aAAa,CAAE,QAAgB,IAAI,GAAG,EAAE;CAC7E;AAMD,IAAM,wBAAmD;CACvD,CAAC,OAAO,UAAU,gBAAgB,MAAM;CACxC,CAAC,OAAO,UAAU,sBAAsB,MAAM;CAC9C,CAAC,OAAO,UAAU,eAAe,MAAM;CACvC,CAAC,OAAO,QAAQ,MAAM;CACtB,CAAC,OAAO,gBAAgB,MAAM;CAC9B,CAAC,OAAO,gBAAgB,MAAM;CAC9B,CAAC,OAAO,IAAI,MAAM;CAClB,CAAC,OAAO,gBAAgB,MAAM;CAC9B,CAAC,OAAO,0BAA0B,MAAM;CACxC,CAAC,OAAO,cAAc,MAAM;CAC5B,CAAC,OAAO,mBAAmB,MAAM;CACjC,CAAC,OAAO,MAAM,IAAI;CAClB,CAAC,OAAO,QAAQ,IAAI;CACpB,CAAC,OAAO,SAAS,IAAI;CACrB,CAAC,OAAO,QAAQ,IAAI;CACpB,CAAC,OAAO,aAAa,IAAI;CACzB,CAAC,OAAO,qBAAqB,IAAI;CACjC,CAAC,OAAO,uBAAuB,IAAI;CACnC,CAAC,OAAO,2BAA2B,IAAI;CACvC,CAAC,OAAO,QAAQ,IAAI;CACpB,CAAC,OAAO,MAAM,IAAI;CAClB,CAAC,OAAO,UAAU,IAAI;CACtB,CAAC,OAAO,UAAU,IAAI;CACvB;AAED,SAAS,YACP,YACA,UAC+C;AAC/C,SAAQ,SAAS,SAAS;AACxB,MAAI,eAAe,MAAO,QAAO;EACjC,MAAM,SAAS,WAAW,KAAK,KAAK;AACpC,MAAI,WAAW,QAAQ,OAAO,WAAW,SACvC,QAAO,OAAO,OAAO,KAAK,OAAiB,CAAC,OAAO;AACrD,SAAO;;;AAKX,IAAM,sBAAsB,IAAI,IAAc;CAC5C,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACR,CAAC;AAUF,IAAa,gDAAgC,IAAI,KAAwB;AACzE,IAAa,uDAAuC,IAAI,KAAe;AAGvE,KAAK,MAAM,CAAC,UAAU,eAAe,sBAAsB;AACzD,KAAI,CAAC,SAAU;AACf,+BAA8B,IAC5B,UACA,gBAAgB,UAAU,WAAW,YAAY,SAAS,CAAC,CAC5D;AACD,sCAAqC,IAAI,SAAS;;AAIpD,KAAK,MAAM,CAAC,UAAU,eAAe,uBAAuB;AAC1D,KAAI,CAAC,SAAU;AACf,+BAA8B,IAAI,UAAU,gBAAgB,UAAU,YAAY,WAAW,CAAC,CAAC;AAC/F,sCAAqC,IAAI,SAAS;;AAIpD,KAAK,MAAM,CAAC,UAAU,eAAe,oBAAoB;AACvD,KAAI,CAAC,SAAU;AACf,+BAA8B,IAAI,UAAU,gBAAgB,UAAU,SAAS,WAAW,CAAC,CAAC;AAC5F,sCAAqC,IAAI,SAAS;;AAIpD,KAAK,MAAM,CAAC,UAAU,eAAe,oBAAoB;AACvD,KAAI,CAAC,SAAU;AACf,+BAA8B,IAAI,UAAU,gBAAgB,UAAU,SAAS,WAAW,CAAC,CAAC;AAC5F,sCAAqC,IAAI,SAAS;;AAIpD,KAAK,MAAM,CAAC,UAAU,eAAe,2BAA2B;AAC9D,KAAI,CAAC,SAAU;AACf,+BAA8B,IAC5B,UACA,gBAAgB,UAAU,gBAAgB,WAAW,CAAC,CACvD;AACD,sCAAqC,IAAI,SAAS;;AAIpD,KAAK,MAAM,CAAC,aAAa,qBAAqB;AAC5C,KAAI,CAAC,SAAU;AACf,+BAA8B,IAC5B,UACA,gBAAgB,WAAW,UAAU,SAAS,OAAO,KAAK,OAAO,CAAC,CACnE;;AAIH,KAAK,MAAM,YAAY,CAAC,KAAK,OAAO,KAAK,UAAU,CACjD,+BAA8B,IAC5B,UACA,gBAAgB,WAAW,UAAU,SAAS;CAC5C,MAAM,SAAS,KAAK;AACpB,KAAI,OAAO,WAAW,SAAU,QAAO,OAAO,OAAO,OAAO;AAC5D,KAAI,WAAW,QAAQ,OAAO,WAAW,SACvC,QAAO,OAAO,OAAO,KAAK,OAAiB,CAAC,OAAO;AACrD,QAAO;EACP,CACH;AAIH,KAAK,MAAM,YAAY,uBAAuB;AAC5C,KAAI,CAAC,SAAU;AACf,+BAA8B,IAC5B,UACA,gBAAgB,WAAW,UAAU,SAAS;EAC5C,MAAM,QAAQ,KAAK;AACnB,SAAO,OAAO,UAAU,WAAW,OAAO,MAAM,OAAO,GAAG;GAC1D,CACH;AACD,sCAAqC,IAAI,SAAS;;AAIpD,KAAK,MAAM,YAAY,wBAAwB;AAC7C,KAAI,CAAC,SAAU;AACf,+BAA8B,IAC5B,UACA,gBAAgB,WAAW,UAAU,SAAS;EAC5C,MAAM,WAAW,KAAK;AACtB,SAAO,MAAM,QAAQ,SAAS,GAAG,OAAO,SAAS,OAAO,GAAG;GAC3D,CACH;;AAIH,KAAK,MAAM,CAAC,UAAU,eAAe,uBAAuB;AAC1D,KAAI,CAAC,SAAU;CACf,MAAM,WAAW,oBAAoB,IAAI,SAAS;AAClD,+BAA8B,IAC5B,UACA,gBAAgB,UAAU,YAAY,YAAY,SAAS,CAAC,CAC7D;AACD,KAAI,CAAC,SACH,sCAAqC,IAAI,SAAS;;AAKtD,IAAI,MAAM,KACR,+BAA8B,IAC5B,MAAM,MACN,gBAAgB,MAAM,OAAO,UAAU,SAAS;CAC9C,MAAM,SAAS,KAAK;AACpB,KAAI,UAAU,QAAQ,OAAQ,OAAe,WAAW,SACtD,QAAO,OAAQ,OAAe,OAAO;AACvC,QAAO;EACP,CACH;AAIH,IAAI,OAAQ,MAAc,cAAc,YAAY;CAClD,MAAM,YAAa,MAAc;AACjC,+BAA8B,IAC5B,WACA,gBAAgB,YAAY,UAAU,SAAS;EAC7C,MAAM,SAAS,KAAK;AACpB,MAAI,UAAU,QAAQ,OAAQ,OAAe,WAAW,SACtD,QAAO,OAAQ,OAAe,OAAO;AACvC,SAAO;GACP,CACH"}

package/dist/esm/utils/index.d.ts

@@ -0,0 +1,7 @@
+export * from './unraw';
+export * from './errors';
+export * from './CodeString';
+export * from './types';
+export * from './Prop';
+export * from './Scope';
+export * from './ExecContext';