@jbrowse/jexl 3.0.2 → 3.1.0

package/esm/evaluator/handlers.js

@@ -1,194 +0,0 @@
-/*
- * Jexl
- * Copyright 2020 Tom Shawver
- */
-const poolNames = {
-    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 {[]} an array of evaluated values.
- * @private
- */
-export function ArrayLiteral(ast) {
-    return this.evalArray(ast.value);
-}
-/**
- * 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
- * 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 {*} the value of the BinaryExpression.
- * @private
- */
-export function BinaryExpression(ast) {
-    const grammarOp = this._grammar.elements[ast.operator];
-    if (grammarOp.evalOnDemand) {
-        const wrap = (subAst) => ({ eval: () => this.eval(subAst) });
-        return grammarOp.evalOnDemand(wrap(ast.left), wrap(ast.right));
-    }
-    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 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
- */
-export function ConditionalExpression(ast) {
-    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 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 {*} the value at the specified index/property.
- * @private
- */
-export function FilterExpression(ast) {
-    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'
- * expression tree or accessing the context provided when this Evaluator was
- * constructed.
- * @param {{type: 'Identifier', value: <string>, [from]: {}}} ast An expression
- *      tree with an Identifier as the top node
- * @returns {*} the identifier's value.
- * @private
- */
-export function Identifier(ast) {
-    if (!ast.from) {
-        const contextSource = ast.relative ? this._relContext : this._context;
-        return contextSource[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.
- * @param {{type: 'Literal', value: <string|number|boolean>}} ast An expression
- *      tree with a Literal as its only node
- * @returns {string|number|boolean} The value of the Literal node
- * @private
- */
-export function Literal(ast) {
-    return ast.value;
-}
-/**
- * Evaluates a TemplateLiteral by evaluating each interpolated expression
- * 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 {string} the final interpolated string
- * @private
- */
-export function TemplateLiteral(ast) {
-    const values = ast.parts.map((part) => {
-        if (part.type === 'static') {
-            return part.value;
-        }
-        const result = this.eval(part.value);
-        if (result == null) {
-            return '';
-        }
-        return String(result);
-    });
-    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 {{}} a map of evaluated values.
- * @private
- */
-export function ObjectLiteral(ast) {
-    return this.evalMap(ast.value);
-}
-/**
- * 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 {*} the value of the function call.
- * @private
- */
-export function FunctionCall(ast) {
-    const poolName = poolNames[ast.pool];
-    if (!poolName) {
-        throw new Error(`Corrupt AST: Pool '${ast.pool}' not found`);
-    }
-    const pool = this._grammar[ast.pool];
-    const func = pool?.[ast.name];
-    if (!func) {
-        throw new Error(`${poolName} ${ast.name} is not defined.`);
-    }
-    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 {*} the value of the UnaryExpression.
- * @constructor
- */
-export function UnaryExpression(ast) {
-    const right = this.eval(ast.right);
-    return this._grammar.elements[ast.operator].eval(right);
-}
-/**
- * Evaluates a SequenceExpression by evaluating each expression in order
- * and returning the value of the last expression.
- */
-export function SequenceExpression(ast) {
-    let lastValue;
-    for (const expr of ast.expressions) {
-        lastValue = this.eval(expr);
-    }
-    return lastValue;
-}
-/**
- * Evaluates an AssignmentExpression by evaluating the right side
- * and assigning it to the variable name on the left side.
- */
-export function AssignmentExpression(ast) {
-    const value = this.eval(ast.right);
-    const varName = ast.left.value;
-    this._context[varName] = value;
-    return value;
-}
-//# sourceMappingURL=handlers.js.map

package/esm/evaluator/handlers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"handlers.js","sourceRoot":"","sources":["../../src/evaluator/handlers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,MAAM,SAAS,GAA2B;IACxC,SAAS,EAAE,eAAe;CAC3B,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAkB,GAAQ;IACpD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAClC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,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,MAAM,UAAU,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,MAAM,UAAU,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,MAAM,UAAU,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,MAAM,UAAU,OAAO,CAAkB,GAAQ;IAC/C,OAAO,GAAG,CAAC,KAAK,CAAA;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,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,MAAM,UAAU,aAAa,CAAkB,GAAQ;IACrD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,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,MAAM,UAAU,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,MAAM,UAAU,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,MAAM,UAAU,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/src/evaluator/handlers.ts

@@ -1,212 +0,0 @@
-/*
- * Jexl
- * Copyright 2020 Tom Shawver
- */
-
-import type { AstNode } from '../types.ts'
-import type Evaluator from './Evaluator.ts'
-
-const poolNames: Record<string, string> = {
-  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 {[]} an array of evaluated values.
- * @private
- */
-export function ArrayLiteral(this: Evaluator, ast: any) {
-  return this.evalArray(ast.value)
-}
-
-/**
- * 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
- * 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 {*} the value of the BinaryExpression.
- * @private
- */
-export function BinaryExpression(this: Evaluator, ast: any) {
-  const grammarOp = this._grammar.elements[ast.operator]
-  if (grammarOp.evalOnDemand) {
-    const wrap = (subAst: AstNode) => ({ eval: () => this.eval(subAst) })
-    return grammarOp.evalOnDemand(wrap(ast.left), wrap(ast.right))
-  }
-  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 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
- */
-export function ConditionalExpression(this: Evaluator, ast: any) {
-  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 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 {*} the value at the specified index/property.
- * @private
- */
-export function FilterExpression(this: Evaluator, ast: any) {
-  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'
- * expression tree or accessing the context provided when this Evaluator was
- * constructed.
- * @param {{type: 'Identifier', value: <string>, [from]: {}}} ast An expression
- *      tree with an Identifier as the top node
- * @returns {*} the identifier's value.
- * @private
- */
-export function Identifier(this: Evaluator, ast: any) {
-  if (!ast.from) {
-    const contextSource = ast.relative ? this._relContext : this._context
-    return contextSource[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.
- * @param {{type: 'Literal', value: <string|number|boolean>}} ast An expression
- *      tree with a Literal as its only node
- * @returns {string|number|boolean} The value of the Literal node
- * @private
- */
-export function Literal(this: Evaluator, ast: any) {
-  return ast.value
-}
-
-/**
- * Evaluates a TemplateLiteral by evaluating each interpolated expression
- * 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 {string} the final interpolated string
- * @private
- */
-export function TemplateLiteral(this: Evaluator, ast: any) {
-  const values = ast.parts.map((part: any) => {
-    if (part.type === 'static') {
-      return part.value
-    }
-    const result = this.eval(part.value)
-    if (result == null) {
-      return ''
-    }
-    return String(result)
-  })
-
-  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 {{}} a map of evaluated values.
- * @private
- */
-export function ObjectLiteral(this: Evaluator, ast: any) {
-  return this.evalMap(ast.value)
-}
-
-/**
- * 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 {*} the value of the function call.
- * @private
- */
-export function FunctionCall(this: Evaluator, ast: any) {
-  const poolName = poolNames[ast.pool]
-  if (!poolName) {
-    throw new Error(`Corrupt AST: Pool '${ast.pool}' not found`)
-  }
-  const pool = (this._grammar as any)[ast.pool]
-  const func = pool?.[ast.name]
-  if (!func) {
-    throw new Error(`${poolName} ${ast.name} is not defined.`)
-  }
-  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 {*} the value of the UnaryExpression.
- * @constructor
- */
-export function UnaryExpression(this: Evaluator, ast: any) {
-  const right = this.eval(ast.right)
-  return this._grammar.elements[ast.operator].eval(right)
-}
-
-/**
- * Evaluates a SequenceExpression by evaluating each expression in order
- * and returning the value of the last expression.
- */
-export function SequenceExpression(this: Evaluator, ast: any) {
-  let lastValue: any
-
-  for (const expr of ast.expressions) {
-    lastValue = this.eval(expr)
-  }
-
-  return lastValue
-}
-
-/**
- * Evaluates an AssignmentExpression by evaluating the right side
- * and assigning it to the variable name on the left side.
- */
-export function AssignmentExpression(this: Evaluator, ast: any) {
-  const value = this.eval(ast.right)
-  const varName = ast.left.value
-  this._context[varName] = value
-  return value
-}