@jbrowse/jexl 2.3.1 → 3.0.2

package/dist/evaluator/Evaluator.d.ts

@@ -3,7 +3,6 @@ interface Grammar {
     elements: Record<string, any>;
     [key: string]: any;
 }
-type PromiseConstructor = typeof Promise | any;
 /**
  * The Evaluator takes a Jexl expression tree as generated by the
  * {@link Parser} and calculates its value within a given context. The
@@ -15,78 +14,38 @@ type PromiseConstructor = typeof Promise | any;
  * @param {{}} grammar A grammar object against which to evaluate the expression
  *      tree
  * @param {{}} [context] A map of variable keys to their values. This will be
- *      accessed to resolve the value of each non-relative identifier. Any
- *      Promise values will be passed to the expression as their resolved
- *      value.
+ *      accessed to resolve the value of each non-relative identifier.
  * @param {{}|Array<{}|Array>} [relativeContext] A map or array to be accessed
  *      to resolve the value of a relative identifier.
- * @param {function} promise A constructor for the Promise class to be used;
- *      probably either Promise or PromiseSync.
  */
 declare class Evaluator {
     _grammar: Grammar;
     _context: any;
     _relContext: any;
-    Promise: PromiseConstructor;
-    constructor(grammar: Grammar, context?: any, relativeContext?: any, promise?: PromiseConstructor);
+    constructor(grammar: Grammar, context?: any, relativeContext?: any);
     /**
      * Evaluates an expression tree within the configured context.
      * @param {{}} ast An expression tree object
-     * @returns {Promise<*>} resolves with the resulting value of the expression.
+     * @returns {*} the resulting value of the expression.
      */
     eval(ast: AstNode): any;
     /**
-     * Simultaneously evaluates each expression within an array, and delivers the
-     * response as an array with the resulting values at the same indexes as their
-     * originating expressions.
+     * Evaluates each expression within an array, and delivers the response as an
+     * array with the resulting values at the same indexes as their originating
+     * expressions.
      * @param {Array<string>} arr An array of expression strings to be evaluated
-     * @returns {Promise<Array<{}>>} resolves with the result array
+     * @returns {Array<{}>} the result array
      */
-    evalArray(arr: AstNode[]): any;
+    evalArray(arr: AstNode[]): any[];
     /**
-     * Simultaneously evaluates each expression within a map, and delivers the
-     * response as a map with the same keys, but with the evaluated result for each
-     * as their value.
+     * Evaluates each expression within a map, and delivers the response as a map
+     * with the same keys, but with the evaluated result for each as their value.
      * @param {{}} map A map of expression names to expression trees to be
      *      evaluated
-     * @returns {Promise<{}>} resolves with the result map.
+     * @returns {{}} the result map.
      */
-    evalMap(map: Record<string, AstNode>): any;
-    /**
-     * Applies a filter expression with relative identifier elements to a subject.
-     * The intent is for the subject to be an array of subjects that will be
-     * individually used as the relative context against the provided expression
-     * tree. Only the elements whose expressions result in a truthy value will be
-     * included in the resulting array.
-     *
-     * If the subject is not an array of values, it will be converted to a single-
-     * element array before running the filter.
-     * @param {*} subject The value to be filtered usually an array. If this value is
-     *      not an array, it will be converted to an array with this value as the
-     *      only element.
-     * @param {{}} expr The expression tree to run against each subject. If the
-     *      tree evaluates to a truthy result, then the value will be included in
-     *      the returned array otherwise, it will be eliminated.
-     * @returns {Promise<Array>} resolves with an array of values that passed the
-     *      expression filter.
-     * @private
-     */
-    _filterRelative(subject: any, expr: AstNode): any;
-    /**
-     * Applies a static filter expression to a subject value.  If the filter
-     * expression evaluates to boolean true, the subject is returned if false,
-     * undefined.
-     *
-     * For any other resulting value of the expression, this function will attempt
-     * to respond with the property at that name or index of the subject.
-     * @param {*} subject The value to be filtered.  Usually an Array (for which
-     *      the expression would generally resolve to a numeric index) or an
-     *      Object (for which the expression would generally resolve to a string
-     *      indicating a property name)
-     * @param {{}} expr The expression tree to run against the subject
-     * @returns {Promise<*>} resolves with the value of the drill-down.
-     * @private
-     */
-    _filterStatic(subject: any, expr: AstNode): any;
+    evalMap(map: Record<string, AstNode>): {
+        [k: string]: any;
+    };
 }
 export default Evaluator;

package/dist/evaluator/Evaluator.js

@@ -49,104 +49,45 @@ const handlers = __importStar(require("./handlers.js"));
  * @param {{}} grammar A grammar object against which to evaluate the expression
  *      tree
  * @param {{}} [context] A map of variable keys to their values. This will be
- *      accessed to resolve the value of each non-relative identifier. Any
- *      Promise values will be passed to the expression as their resolved
- *      value.
+ *      accessed to resolve the value of each non-relative identifier.
  * @param {{}|Array<{}|Array>} [relativeContext] A map or array to be accessed
  *      to resolve the value of a relative identifier.
- * @param {function} promise A constructor for the Promise class to be used;
- *      probably either Promise or PromiseSync.
  */
 class Evaluator {
-    constructor(grammar, context, relativeContext, promise = Promise) {
+    constructor(grammar, context, relativeContext) {
         this._grammar = grammar;
         this._context = context || {};
         this._relContext = relativeContext || this._context;
-        this.Promise = promise;
     }
     /**
      * Evaluates an expression tree within the configured context.
      * @param {{}} ast An expression tree object
-     * @returns {Promise<*>} resolves with the resulting value of the expression.
+     * @returns {*} the resulting value of the expression.
      */
     eval(ast) {
-        return this.Promise.resolve().then(() => {
-            return handlers[ast.type].call(this, ast);
-        });
+        return handlers[ast.type].call(this, ast);
     }
     /**
-     * Simultaneously evaluates each expression within an array, and delivers the
-     * response as an array with the resulting values at the same indexes as their
-     * originating expressions.
+     * Evaluates each expression within an array, and delivers the response as an
+     * array with the resulting values at the same indexes as their originating
+     * expressions.
      * @param {Array<string>} arr An array of expression strings to be evaluated
-     * @returns {Promise<Array<{}>>} resolves with the result array
+     * @returns {Array<{}>} the result array
      */
     evalArray(arr) {
-        return this.Promise.all(arr.map((elem) => this.eval(elem)));
+        return arr.map((elem) => this.eval(elem));
     }
     /**
-     * Simultaneously evaluates each expression within a map, and delivers the
-     * response as a map with the same keys, but with the evaluated result for each
-     * as their value.
+     * Evaluates each expression within a map, and delivers the response as a map
+     * with the same keys, but with the evaluated result for each as their value.
      * @param {{}} map A map of expression names to expression trees to be
      *      evaluated
-     * @returns {Promise<{}>} resolves with the result map.
+     * @returns {{}} the result map.
      */
     evalMap(map) {
         const entries = Object.entries(map);
-        const promises = entries.map(([_, ast]) => this.eval(ast));
-        return this.Promise.all(promises).then((vals) => Object.fromEntries(entries.map(([key], idx) => [key, vals[idx]])));
-    }
-    /**
-     * Applies a filter expression with relative identifier elements to a subject.
-     * The intent is for the subject to be an array of subjects that will be
-     * individually used as the relative context against the provided expression
-     * tree. Only the elements whose expressions result in a truthy value will be
-     * included in the resulting array.
-     *
-     * If the subject is not an array of values, it will be converted to a single-
-     * element array before running the filter.
-     * @param {*} subject The value to be filtered usually an array. If this value is
-     *      not an array, it will be converted to an array with this value as the
-     *      only element.
-     * @param {{}} expr The expression tree to run against each subject. If the
-     *      tree evaluates to a truthy result, then the value will be included in
-     *      the returned array otherwise, it will be eliminated.
-     * @returns {Promise<Array>} resolves with an array of values that passed the
-     *      expression filter.
-     * @private
-     */
-    _filterRelative(subject, expr) {
-        const arr = Array.isArray(subject)
-            ? subject
-            : subject == null
-                ? []
-                : [subject];
-        const promises = arr.map((elem) => new Evaluator(this._grammar, this._context, elem, this.Promise).eval(expr));
-        return this.Promise.all(promises).then((values) => arr.filter((_, idx) => values[idx]));
-    }
-    /**
-     * Applies a static filter expression to a subject value.  If the filter
-     * expression evaluates to boolean true, the subject is returned if false,
-     * undefined.
-     *
-     * For any other resulting value of the expression, this function will attempt
-     * to respond with the property at that name or index of the subject.
-     * @param {*} subject The value to be filtered.  Usually an Array (for which
-     *      the expression would generally resolve to a numeric index) or an
-     *      Object (for which the expression would generally resolve to a string
-     *      indicating a property name)
-     * @param {{}} expr The expression tree to run against the subject
-     * @returns {Promise<*>} resolves with the value of the drill-down.
-     * @private
-     */
-    _filterStatic(subject, expr) {
-        return this.eval(expr).then((res) => {
-            if (typeof res === 'boolean') {
-                return res ? subject : undefined;
-            }
-            return subject?.[res];
-        });
+        const vals = entries.map(([_, ast]) => this.eval(ast));
+        return Object.fromEntries(entries.map(([key], idx) => [key, vals[idx]]));
     }
 }
 exports.default = Evaluator;

package/dist/evaluator/Evaluator.js.map

@@ -1 +1 @@
-{"version":3,"file":"Evaluator.js","sourceRoot":"","sources":["../../src/evaluator/Evaluator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,wDAAyC;AAYzC;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,SAAS;IAMb,YACE,OAAgB,EAChB,OAAa,EACb,eAAqB,EACrB,UAA8B,OAAO;QAErC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI,EAAE,CAAA;QAC7B,IAAI,CAAC,WAAW,GAAG,eAAe,IAAI,IAAI,CAAC,QAAQ,CAAA;QACnD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACxB,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,GAAY;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;YACtC,OAAQ,QAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACpD,CAAC,CAAC,CAAA;IACJ,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,GAAc;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAa,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACtE,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,GAA4B;QAClC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1D,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,IAAW,EAAE,EAAE,CACrD,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAClE,CAAA;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,eAAe,CAAC,OAAY,EAAE,IAAa;QACzC,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YAChC,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,OAAO,IAAI,IAAI;gBACf,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;QAEf,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAChC,IAAI,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAC3E,CAAA;QAED,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,MAAa,EAAE,EAAE,CACvD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CACpC,CAAA;IACH,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,aAAa,CAAC,OAAY,EAAE,IAAa;QACvC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAQ,EAAE,EAAE;YACvC,IAAI,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;gBAC7B,OAAO,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAA;YAClC,CAAC;YACD,OAAO,OAAO,EAAE,CAAC,GAAG,CAAC,CAAA;QACvB,CAAC,CAAC,CAAA;IACJ,CAAC;CACF;AAED,kBAAe,SAAS,CAAA"}
+{"version":3,"file":"Evaluator.js","sourceRoot":"","sources":["../../src/evaluator/Evaluator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,wDAAyC;AASzC;;;;;;;;;;;;;;GAcG;AACH,MAAM,SAAS;IAKb,YAAY,OAAgB,EAAE,OAAa,EAAE,eAAqB;QAChE,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI,EAAE,CAAA;QAC7B,IAAI,CAAC,WAAW,GAAG,eAAe,IAAI,IAAI,CAAC,QAAQ,CAAA;IACrD,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,GAAY;QACf,OAAQ,QAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IACpD,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,GAAc;QACtB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAa,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;IACpD,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,GAA4B;QAClC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QACnC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QACtD,OAAO,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC;CACF;AAED,kBAAe,SAAS,CAAA"}

package/dist/evaluator/handlers.d.ts

@@ -4,30 +4,30 @@ import type Evaluator from './Evaluator.ts';
  * independently run through the evaluator.
  * @param {{type: 'ObjectLiteral', value: <{}>}} ast An expression tree with an
  *      ObjectLiteral as the top node
- * @returns {Promise.<[]>} resolves to a map contained evaluated values.
+ * @returns {[]} an array of evaluated values.
  * @private
  */
-export declare function ArrayLiteral(this: Evaluator, ast: any): any;
+export declare function ArrayLiteral(this: Evaluator, ast: any): any[];
 /**
  * Evaluates a BinaryExpression node by running the Grammar's evaluator for
  * the given operator. Note that binary expressions support two types of
  * evaluators: `eval` is called with the left and right operands pre-evaluated.
  * `evalOnDemand`, if it exists, will be called with the left and right operands
  * each individually wrapped in an object with an "eval" function that returns
- * a promise with the resulting value. This allows the binary expression to
- * evaluate the operands conditionally.
+ * the resulting value. This allows the binary expression to evaluate the
+ * operands conditionally.
  * @param {{type: 'BinaryExpression', operator: <string>, left: {},
  *      right: {}}} ast An expression tree with a BinaryExpression as the top
  *      node
- * @returns {Promise<*>} resolves with the value of the BinaryExpression.
+ * @returns {*} the value of the BinaryExpression.
  * @private
  */
 export declare function BinaryExpression(this: Evaluator, ast: any): any;
 /**
  * Evaluates a ConditionalExpression node by first evaluating its test branch,
- * and resolving with the consequent branch if the test is truthy, or the
- * alternate branch if it is not. If there is no consequent branch, the test
- * result will be used instead.
+ * and returning the consequent branch if the test is truthy, or the alternate
+ * branch if it is not. If there is no consequent branch, the test result will
+ * be used instead.
  * @param {{type: 'ConditionalExpression', test: {}, consequent: {},
  *      alternate: {}}} ast An expression tree with a ConditionalExpression as
  *      the top node
@@ -35,11 +35,12 @@ export declare function BinaryExpression(this: Evaluator, ast: any): any;
  */
 export declare function ConditionalExpression(this: Evaluator, ast: any): any;
 /**
- * Evaluates a FilterExpression by applying it to the subject value.
+ * Evaluates a FilterExpression by applying bracket notation for array/object access.
+ * Note: Relative filtering (with leading dot) is not supported.
  * @param {{type: 'FilterExpression', relative: <boolean>, expr: {},
  *      subject: {}}} ast An expression tree with a FilterExpression as the top
  *      node
- * @returns {Promise<*>} resolves with the value of the FilterExpression.
+ * @returns {*} the value at the specified index/property.
  * @private
  */
 export declare function FilterExpression(this: Evaluator, ast: any): any;
@@ -49,8 +50,7 @@ export declare function FilterExpression(this: Evaluator, ast: any): any;
  * constructed.
  * @param {{type: 'Identifier', value: <string>, [from]: {}}} ast An expression
  *      tree with an Identifier as the top node
- * @returns {Promise<*>|*} either the identifier's value, or a Promise that
- *      will resolve with the identifier's value.
+ * @returns {*} the identifier's value.
  * @private
  */
 export declare function Identifier(this: Evaluator, ast: any): any;
@@ -67,7 +67,7 @@ export declare function Literal(this: Evaluator, ast: any): any;
  * and concatenating all parts into a final string.
  * @param {{type: 'TemplateLiteral', parts: Array<{}>}} ast An expression
  *      tree with a TemplateLiteral as the top node
- * @returns {Promise<string>} resolves with the final interpolated string
+ * @returns {string} the final interpolated string
  * @private
  */
 export declare function TemplateLiteral(this: Evaluator, ast: any): any;
@@ -76,17 +76,18 @@ export declare function TemplateLiteral(this: Evaluator, ast: any): any;
  * independently run through the evaluator.
  * @param {{type: 'ObjectLiteral', value: <{}>}} ast An expression tree with an
  *      ObjectLiteral as the top node
- * @returns {Promise<{}>} resolves to a map contained evaluated values.
+ * @returns {{}} a map of evaluated values.
  * @private
  */
-export declare function ObjectLiteral(this: Evaluator, ast: any): any;
+export declare function ObjectLiteral(this: Evaluator, ast: any): {
+    [k: string]: any;
+};
 /**
  * Evaluates a FunctionCall node by applying the supplied arguments to a
  * function defined in one of the grammar's function pools.
  * @param {{type: 'FunctionCall', name: <string>}} ast An
  *      expression tree with a FunctionCall as the top node
- * @returns {Promise<*>|*} the value of the function call, or a Promise that
- *      will resolve with the resulting value.
+ * @returns {*} the value of the function call.
  * @private
  */
 export declare function FunctionCall(this: Evaluator, ast: any): any;
@@ -95,7 +96,7 @@ export declare function FunctionCall(this: Evaluator, ast: any): any;
  * operator's eval function.
  * @param {{type: 'UnaryExpression', operator: <string>, right: {}}} ast An
  *      expression tree with a UnaryExpression as the top node
- * @returns {Promise<*>} resolves with the value of the UnaryExpression.
+ * @returns {*} the value of the UnaryExpression.
  * @constructor
  */
 export declare function UnaryExpression(this: Evaluator, ast: any): any;

package/dist/evaluator/handlers.js

@@ -17,15 +17,14 @@ exports.UnaryExpression = UnaryExpression;
 exports.SequenceExpression = SequenceExpression;
 exports.AssignmentExpression = AssignmentExpression;
 const poolNames = {
-    functions: 'Jexl Function',
-    transforms: 'Transform'
+    functions: 'Jexl Function'
 };
 /**
  * Evaluates an ArrayLiteral by returning its value, with each element
  * independently run through the evaluator.
  * @param {{type: 'ObjectLiteral', value: <{}>}} ast An expression tree with an
  *      ObjectLiteral as the top node
- * @returns {Promise.<[]>} resolves to a map contained evaluated values.
+ * @returns {[]} an array of evaluated values.
  * @private
  */
 function ArrayLiteral(ast) {
@@ -37,12 +36,12 @@ function ArrayLiteral(ast) {
  * evaluators: `eval` is called with the left and right operands pre-evaluated.
  * `evalOnDemand`, if it exists, will be called with the left and right operands
  * each individually wrapped in an object with an "eval" function that returns
- * a promise with the resulting value. This allows the binary expression to
- * evaluate the operands conditionally.
+ * the resulting value. This allows the binary expression to evaluate the
+ * operands conditionally.
  * @param {{type: 'BinaryExpression', operator: <string>, left: {},
  *      right: {}}} ast An expression tree with a BinaryExpression as the top
  *      node
- * @returns {Promise<*>} resolves with the value of the BinaryExpression.
+ * @returns {*} the value of the BinaryExpression.
  * @private
  */
 function BinaryExpression(ast) {
@@ -51,44 +50,43 @@ function BinaryExpression(ast) {
         const wrap = (subAst) => ({ eval: () => this.eval(subAst) });
         return grammarOp.evalOnDemand(wrap(ast.left), wrap(ast.right));
     }
-    return this.Promise.all([this.eval(ast.left), this.eval(ast.right)]).then((arr) => grammarOp.eval(arr[0], arr[1]));
+    const left = this.eval(ast.left);
+    const right = this.eval(ast.right);
+    return grammarOp.eval(left, right);
 }
 /**
  * Evaluates a ConditionalExpression node by first evaluating its test branch,
- * and resolving with the consequent branch if the test is truthy, or the
- * alternate branch if it is not. If there is no consequent branch, the test
- * result will be used instead.
+ * and returning the consequent branch if the test is truthy, or the alternate
+ * branch if it is not. If there is no consequent branch, the test result will
+ * be used instead.
  * @param {{type: 'ConditionalExpression', test: {}, consequent: {},
  *      alternate: {}}} ast An expression tree with a ConditionalExpression as
  *      the top node
  * @private
  */
 function ConditionalExpression(ast) {
-    return this.eval(ast.test).then((res) => {
-        if (res) {
-            if (ast.consequent) {
-                return this.eval(ast.consequent);
-            }
-            return res;
-        }
-        return this.eval(ast.alternate);
-    });
+    const res = this.eval(ast.test);
+    if (res) {
+        return ast.consequent ? this.eval(ast.consequent) : res;
+    }
+    return this.eval(ast.alternate);
 }
 /**
- * Evaluates a FilterExpression by applying it to the subject value.
+ * Evaluates a FilterExpression by applying bracket notation for array/object access.
+ * Note: Relative filtering (with leading dot) is not supported.
  * @param {{type: 'FilterExpression', relative: <boolean>, expr: {},
  *      subject: {}}} ast An expression tree with a FilterExpression as the top
  *      node
- * @returns {Promise<*>} resolves with the value of the FilterExpression.
+ * @returns {*} the value at the specified index/property.
  * @private
  */
 function FilterExpression(ast) {
-    return this.eval(ast.subject).then((subject) => {
-        if (ast.relative) {
-            return this._filterRelative(subject, ast.expr);
-        }
-        return this._filterStatic(subject, ast.expr);
-    });
+    const subject = this.eval(ast.subject);
+    if (ast.relative) {
+        throw new Error('Relative filter expressions are not supported');
+    }
+    const index = this.eval(ast.expr);
+    return subject?.[index];
 }
 /**
  * Evaluates an Identifier by either stemming from the evaluated 'from'
@@ -96,8 +94,7 @@ function FilterExpression(ast) {
  * constructed.
  * @param {{type: 'Identifier', value: <string>, [from]: {}}} ast An expression
  *      tree with an Identifier as the top node
- * @returns {Promise<*>|*} either the identifier's value, or a Promise that
- *      will resolve with the identifier's value.
+ * @returns {*} the identifier's value.
  * @private
  */
 function Identifier(ast) {
@@ -105,13 +102,12 @@ function Identifier(ast) {
         const contextSource = ast.relative ? this._relContext : this._context;
         return contextSource[ast.value];
     }
-    return this.eval(ast.from).then((context) => {
-        if (context == null) {
-            return undefined;
-        }
-        const ctx = Array.isArray(context) ? context[0] : context;
-        return ctx?.[ast.value];
-    });
+    const context = this.eval(ast.from);
+    if (context == null) {
+        return undefined;
+    }
+    const ctx = Array.isArray(context) ? context[0] : context;
+    return ctx?.[ast.value];
 }
 /**
  * Evaluates a Literal by returning its value property.
@@ -128,29 +124,28 @@ function Literal(ast) {
  * and concatenating all parts into a final string.
  * @param {{type: 'TemplateLiteral', parts: Array<{}>}} ast An expression
  *      tree with a TemplateLiteral as the top node
- * @returns {Promise<string>} resolves with the final interpolated string
+ * @returns {string} the final interpolated string
  * @private
  */
 function TemplateLiteral(ast) {
-    const promises = ast.parts.map((part) => {
+    const values = ast.parts.map((part) => {
         if (part.type === 'static') {
-            return this.Promise.resolve(part.value);
+            return part.value;
         }
-        return this.eval(part.value).then((result) => {
-            if (result == null) {
-                return '';
-            }
-            return String(result);
-        });
+        const result = this.eval(part.value);
+        if (result == null) {
+            return '';
+        }
+        return String(result);
     });
-    return this.Promise.all(promises).then((values) => values.join(''));
+    return values.join('');
 }
 /**
  * Evaluates an ObjectLiteral by returning its value, with each key
  * independently run through the evaluator.
  * @param {{type: 'ObjectLiteral', value: <{}>}} ast An expression tree with an
  *      ObjectLiteral as the top node
- * @returns {Promise<{}>} resolves to a map contained evaluated values.
+ * @returns {{}} a map of evaluated values.
  * @private
  */
 function ObjectLiteral(ast) {
@@ -161,8 +156,7 @@ function ObjectLiteral(ast) {
  * function defined in one of the grammar's function pools.
  * @param {{type: 'FunctionCall', name: <string>}} ast An
  *      expression tree with a FunctionCall as the top node
- * @returns {Promise<*>|*} the value of the function call, or a Promise that
- *      will resolve with the resulting value.
+ * @returns {*} the value of the function call.
  * @private
  */
 function FunctionCall(ast) {
@@ -175,18 +169,20 @@ function FunctionCall(ast) {
     if (!func) {
         throw new Error(`${poolName} ${ast.name} is not defined.`);
     }
-    return this.evalArray(ast.args || []).then((args) => func(...args));
+    const args = this.evalArray(ast.args || []);
+    return func(...args);
 }
 /**
  * Evaluates a Unary expression by passing the right side through the
  * operator's eval function.
  * @param {{type: 'UnaryExpression', operator: <string>, right: {}}} ast An
  *      expression tree with a UnaryExpression as the top node
- * @returns {Promise<*>} resolves with the value of the UnaryExpression.
+ * @returns {*} the value of the UnaryExpression.
  * @constructor
  */
 function UnaryExpression(ast) {
-    return this.eval(ast.right).then((right) => this._grammar.elements[ast.operator].eval(right));
+    const right = this.eval(ast.right);
+    return this._grammar.elements[ast.operator].eval(right);
 }
 /**
  * Evaluates a SequenceExpression by evaluating each expression in order
@@ -194,23 +190,19 @@ function UnaryExpression(ast) {
  */
 function SequenceExpression(ast) {
     let lastValue;
-    let promise = this.Promise.resolve();
     for (const expr of ast.expressions) {
-        promise = promise.then(() => this.eval(expr).then((val) => {
-            lastValue = val;
-        }));
+        lastValue = this.eval(expr);
     }
-    return promise.then(() => lastValue);
+    return lastValue;
 }
 /**
  * Evaluates an AssignmentExpression by evaluating the right side
  * and assigning it to the variable name on the left side.
  */
 function AssignmentExpression(ast) {
-    return this.eval(ast.right).then((value) => {
-        const varName = ast.left.value;
-        this._context[varName] = value;
-        return value;
-    });
+    const value = this.eval(ast.right);
+    const varName = ast.left.value;
+    this._context[varName] = value;
+    return value;
 }
 //# sourceMappingURL=handlers.js.map

package/dist/evaluator/handlers.js.map

@@ -1 +1 @@
-{"version":3,"file":"handlers.js","sourceRoot":"","sources":["../../src/evaluator/handlers.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAkBH,oCAEC;AAgBD,4CASC;AAYD,sDAUC;AAUD,4CAOC;AAYD,gCAYC;AASD,0BAEC;AAUD,0CAcC;AAUD,sCAEC;AAWD,oCAWC;AAUD,0CAIC;AAMD,gDAaC;AAMD,oDAMC;AAzND,MAAM,SAAS,GAA2B;IACxC,SAAS,EAAE,eAAe;IAC1B,UAAU,EAAE,WAAW;CACxB,CAAA;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAkB,GAAQ;IACpD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAClC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,gBAAgB,CAAkB,GAAQ;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACtD,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,MAAe,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QACrE,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;IAChE,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CACvE,CAAC,GAAU,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAC/C,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,qBAAqB,CAAkB,GAAQ;IAC7D,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAQ,EAAE,EAAE;QAC3C,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YAClC,CAAC;YACD,OAAO,GAAG,CAAA;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAAkB,GAAQ;IACxD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,OAAY,EAAE,EAAE;QAClD,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;QAChD,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,UAAU,CAAkB,GAAQ;IAClD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,aAAa,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QACrE,OAAO,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,OAAY,EAAE,EAAE;QAC/C,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;YACpB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAA;QACzD,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACzB,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,OAAO,CAAkB,GAAQ;IAC/C,OAAO,GAAG,CAAC,KAAK,CAAA;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,eAAe,CAAkB,GAAQ;IACvD,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE;QAC3C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzC,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,MAAW,EAAE,EAAE;YAChD,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;gBACnB,OAAO,EAAE,CAAA;YACX,CAAC;YACD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAA;QACvB,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,MAAgB,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/E,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,aAAa,CAAkB,GAAQ;IACrD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAChC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,YAAY,CAAkB,GAAQ;IACpD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACpC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,CAAC,IAAI,aAAa,CAAC,CAAA;IAC9D,CAAC;IACD,MAAM,IAAI,GAAI,IAAI,CAAC,QAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7C,MAAM,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,GAAG,QAAQ,IAAI,GAAG,CAAC,IAAI,kBAAkB,CAAC,CAAA;IAC5D,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAW,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,eAAe,CAAkB,GAAQ;IACvD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAU,EAAE,EAAE,CAC9C,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CACjD,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB,CAAkB,GAAQ;IAC1D,IAAI,SAAc,CAAA;IAClB,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAA;IAEpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACnC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAQ,EAAE,EAAE;YAChC,SAAS,GAAG,GAAG,CAAA;QACjB,CAAC,CAAC,CACH,CAAA;IACH,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAA;AACtC,CAAC;AAED;;;GAGG;AACH,SAAgB,oBAAoB,CAAkB,GAAQ;IAC5D,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAU,EAAE,EAAE;QAC9C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAA;QAC9B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,KAAK,CAAA;QAC9B,OAAO,KAAK,CAAA;IACd,CAAC,CAAC,CAAA;AACJ,CAAC"}
+{"version":3,"file":"handlers.js","sourceRoot":"","sources":["../../src/evaluator/handlers.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAiBH,oCAEC;AAgBD,4CASC;AAYD,sDAMC;AAWD,4CAOC;AAWD,gCAWC;AASD,0BAEC;AAUD,0CAaC;AAUD,sCAEC;AAUD,oCAYC;AAUD,0CAGC;AAMD,gDAQC;AAMD,oDAKC;AA3MD,MAAM,SAAS,GAA2B;IACxC,SAAS,EAAE,eAAe;CAC3B,CAAA;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAkB,GAAQ;IACpD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAClC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,gBAAgB,CAAkB,GAAQ;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACtD,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,MAAe,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QACrE,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;IAChE,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAChC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClC,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;AACpC,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,qBAAqB,CAAkB,GAAQ;IAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC/B,IAAI,GAAG,EAAE,CAAC;QACR,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;IACzD,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;AACjC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,gBAAgB,CAAkB,GAAQ;IACxD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IACtC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAA;IAClE,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjC,OAAO,OAAO,EAAE,CAAC,KAAK,CAAC,CAAA;AACzB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,UAAU,CAAkB,GAAQ;IAClD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,aAAa,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QACrE,OAAO,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACnC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;QACpB,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAA;IACzD,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AACzB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,OAAO,CAAkB,GAAQ;IAC/C,OAAO,GAAG,CAAC,KAAK,CAAA;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,eAAe,CAAkB,GAAQ;IACvD,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE;QACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,KAAK,CAAA;QACnB,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,OAAO,EAAE,CAAA;QACX,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAA;IACvB,CAAC,CAAC,CAAA;IAEF,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACxB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,aAAa,CAAkB,GAAQ;IACrD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAkB,GAAQ;IACpD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACpC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,CAAC,IAAI,aAAa,CAAC,CAAA;IAC9D,CAAC;IACD,MAAM,IAAI,GAAI,IAAI,CAAC,QAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7C,MAAM,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,GAAG,QAAQ,IAAI,GAAG,CAAC,IAAI,kBAAkB,CAAC,CAAA;IAC5D,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAA;IAC3C,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;AACtB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,eAAe,CAAkB,GAAQ;IACvD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACzD,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB,CAAkB,GAAQ;IAC1D,IAAI,SAAc,CAAA;IAElB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACnC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;GAGG;AACH,SAAgB,oBAAoB,CAAkB,GAAQ;IAC5D,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAA;IAC9B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,KAAK,CAAA;IAC9B,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/grammar.d.ts

@@ -3,10 +3,10 @@ export interface BinaryOp {
     precedence: number;
     eval?: (left: any, right: any) => any;
     evalOnDemand?: (left: {
-        eval: () => Promise<any>;
+        eval: () => any;
     }, right: {
-        eval: () => Promise<any>;
-    }) => Promise<any>;
+        eval: () => any;
+    }) => any;
 }
 export interface UnaryOp {
     type: 'unaryOp';
@@ -20,6 +20,5 @@ export type GrammarElement = BinaryOp | UnaryOp | SimpleElement;
 export interface Grammar {
     elements: Record<string, GrammarElement>;
     functions: Record<string, (...args: any[]) => any>;
-    transforms: Record<string, (val: any, ...args: any[]) => any>;
 }
 export declare const getGrammar: () => Grammar;