@jbrowse/jexl 5.0.1 → 6.0.0

package/dist/analyze.js

@@ -4,13 +4,15 @@
  * Copyright 2020 Tom Shawver
  */
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.literalValue = literalValue;
 exports.analyze = analyze;
+const errors_ts_1 = require("./errors.js");
 function literalKey(node) {
     const value = literalValue(node);
     return typeof value === 'boolean' ? String(value) : (value ?? undefined);
 }
-function literalValue(ast) {
-    const node = ast;
+/** A literal's value, or a template's with no interpolation. */
+function literalValue(node) {
     if (node.type === 'Literal') {
         return node.value;
     }
@@ -29,8 +31,7 @@ function extend(read, keys, dynamic = false) {
         ? { root: read.root, path, dynamic }
         : { root: read.root, path };
 }
-function isBarePath(ast) {
-    const node = ast;
+function isBarePath(node) {
     if (node.type === 'Identifier') {
         return !node.from || isBarePath(node.from);
     }
@@ -134,8 +135,7 @@ function analyze(ast, { accessors = {}, row, env } = {}) {
         }
         return subject.map((read) => extend(read, keys, dynamic));
     }
-    function walk(ast, scope) {
-        const node = ast;
+    function walk(node, scope) {
         switch (node.type) {
             case 'Literal': {
                 return [];
@@ -230,7 +230,7 @@ function analyze(ast, { accessors = {}, row, env } = {}) {
                 return [];
             }
             default: {
-                throw new Error(`Corrupt AST: unknown node type '${ast.type}'`);
+                return (0, errors_ts_1.unknownNode)(node);
             }
         }
     }

package/dist/analyze.js.map

@@ -1 +1 @@
-{"version":3,"file":"analyze.js","sourceRoot":"","sources":["../src/analyze.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAkKH,0BAoNC;AAnSD,SAAS,UAAU,CAAC,IAAa;IAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;IAChC,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAA;AAC1E,CAAC;AAED,SAAS,YAAY,CAAC,GAAY;IAChC,MAAM,IAAI,GAAG,GAAmB,CAAA;IAChC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IACD,IACE,IAAI,CAAC,IAAI,KAAK,iBAAiB;QAC/B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,EAClD,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,SAAS,MAAM,CAAC,IAAU,EAAE,IAAwB,EAAE,OAAO,GAAG,KAAK;IACnE,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAA;IACpC,OAAO,OAAO;QACZ,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE;QACpC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAA;AAC/B,CAAC;AAED,SAAS,UAAU,CAAC,GAAY;IAC9B,MAAM,IAAI,GAAG,GAAmB,CAAA;IAChC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5C,CAAC;IACD,OAAO,CACL,IAAI,CAAC,IAAI,KAAK,kBAAkB;QAChC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS;QACnC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CACzB,CAAA;AACH,CAAC;AAED,SAAS,OAAO,CACd,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAQ,EAC7B,GAAuB,EACvB,GAAkC;IAElC,MAAM,SAAS,GACb,IAAI,KAAK,GAAG;QACV,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;YAC1B,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC;YACjB,CAAC,CAAC,SAAS,CAAA;IACjB,OAAO,CACL,SAAS,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAC5E,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,IAAa,EAAE,KAAa;IAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;IAClC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;IAC5C,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;QACvB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAE,EAAE;QACnC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAA;AACzB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,OAAO,CACrB,GAAmB,EACnB,EAAE,SAAS,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,KAAqB,EAAE;IAEjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAA;IACrC,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAElC,SAAS,OAAO,CAAC,KAAa;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;YAChE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,GAAG,CAAC,IAAa,EAAE,KAAY;QACtC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;IAC5B,CAAC;IAED,SAAS,OAAO,CAAC,KAAY,EAAE,KAAa;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;gBAClD,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,MAAM,CAAC,IAAyB,EAAE,KAAY;QACrD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,EAAE,CAAA;QACX,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC/B,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QACrB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,SAAS,IAAI,CAAC,IAAkB,EAAE,KAAY;QAC5C,MAAM,MAAM,GAAS,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAA;QAClD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAClB,MAAM,CAAC,WAAW,EAAE,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC,IAAI,CAAA;QAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC;YAChD,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;YACtB,CAAC,CAAC,SAAS,CAAA;QACb,IAAI,CAAC,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;gBACtC,OAAO,CAAC,KAAK,CAAC,CAAA;YAChB,CAAC;YACD,OAAO,EAAE,CAAA;QACX,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;QACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAA;QAChD,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;QACxB,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAA;YAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;gBACtC,OAAO,CAAC,KAAK,CAAC,CAAA;gBACd,OAAO,GAAG,IAAI,CAAA;YAChB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,YAAY,CAAC,GAAG,CAAE,EAAE,CAAC,CAAA;gBAChE,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAA;IAC3D,CAAC;IAED,SAAS,IAAI,CAAC,GAAY,EAAE,KAAY;QACtC,MAAM,IAAI,GAAG,GAAmB,CAAA;QAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,YAAY,CAAC,CAAC,CAAC;gBAClB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACzC,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAC3B,CAAA;gBACH,CAAC;gBACD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACrC,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,GAAG,IAAI,CAAA;oBACnB,OAAO,OAAO,CAAC,KAAK,CAAA;gBACtB,CAAC;gBACD,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;YACzC,CAAC;YAED,KAAK,kBAAkB,CAAC,CAAC,CAAC;gBACxB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;gBACzC,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACjC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;oBACtB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACnD,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACrB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAA;YACtD,CAAC;YAED,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;YAC1B,CAAC;YAED,KAAK,uBAAuB,CAAC,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACnC,OAAO,CAAC,IAAI,CAAC,CAAA;gBACb,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU;oBAChC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC;oBAChC,CAAC,CAAC,IAAI,CAAA;gBACR,OAAO,CAAC,GAAG,UAAU,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAA;YAC1D,CAAC;YAED,KAAK,kBAAkB,CAAC,CAAC,CAAC;gBACxB,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACrB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;gBAClC,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACvB,GAAG,CAAC,IAAI,CAAC,KAAM,EAAE,KAAK,CAAC,CAAA;gBACvB,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC9B,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAClB,CAAC;gBACD,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,eAAe,CAAC,CAAC,CAAC;gBACrB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9C,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBACnB,CAAC;gBACD,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACvB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;wBAC/B,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;oBACxB,CAAC;gBACH,CAAC;gBACD,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,oBAAoB,CAAC,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAA;gBAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;oBAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;wBACzC,OAAO,CAAC,KAAK,CAAC,CAAA;oBAChB,CAAC;gBACH,CAAC;gBACD,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAA;YACnC,CAAC;YAED,KAAK,sBAAsB,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAM,EAAE,KAAK,CAAC,CAAA;gBACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAA;gBAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAChC,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;oBAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;gBACzB,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;gBACvC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAClB,OAAO,KAAK,CAAA;YACd,CAAC;YAED,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,KAAK,GAAU,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;gBACnC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;gBAC7C,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACrB,OAAO,EAAE,CAAA;YACX,CAAC;YAED,OAAO,CAAC,CAAC,CAAC;gBACR,MAAM,IAAI,KAAK,CAAC,mCAAmC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAA;YACjE,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAU,IAAI,GAAG,EAAE,CAAA;IAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC3C,OAAO,CAAC,OAAO,CAAC,CAAA;IAChB,OAAO,CAAC,KAAK,CAAC,CAAA;IACd,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAA;IACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;IACH,CAAC;IACD,OAAO;QACL,SAAS,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,KAAK,EAAE,QAAQ;QACf,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,OAAO;QACP,IAAI,EAAE,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC;QACrC,KAAK;QACL,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;KACxB,CAAA;AACH,CAAC"}
+{"version":3,"file":"analyze.js","sourceRoot":"","sources":["../src/analyze.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AA2FH,oCAWC;AA6DD,0BAmNC;AApXD,2CAAyC;AAmFzC,SAAS,UAAU,CAAC,IAAa;IAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;IAChC,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAA;AAC1E,CAAC;AAED,gEAAgE;AAChE,SAAgB,YAAY,CAAC,IAAa;IACxC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IACD,IACE,IAAI,CAAC,IAAI,KAAK,iBAAiB;QAC/B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,EAClD,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,SAAS,MAAM,CAAC,IAAU,EAAE,IAAwB,EAAE,OAAO,GAAG,KAAK;IACnE,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAA;IACpC,OAAO,OAAO;QACZ,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE;QACpC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAA;AAC/B,CAAC;AAED,SAAS,UAAU,CAAC,IAAa;IAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5C,CAAC;IACD,OAAO,CACL,IAAI,CAAC,IAAI,KAAK,kBAAkB;QAChC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS;QACnC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CACzB,CAAA;AACH,CAAC;AAED,SAAS,OAAO,CACd,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAQ,EAC7B,GAAuB,EACvB,GAAkC;IAElC,MAAM,SAAS,GACb,IAAI,KAAK,GAAG;QACV,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;YAC1B,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC;YACjB,CAAC,CAAC,SAAS,CAAA;IACjB,OAAO,CACL,SAAS,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAC5E,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,IAAa,EAAE,KAAa;IAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;IAClC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;IAC5C,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;QACvB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAE,EAAE;QACnC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAA;AACzB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,OAAO,CACrB,GAAmB,EACnB,EAAE,SAAS,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,KAAqB,EAAE;IAEjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAA;IACrC,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAElC,SAAS,OAAO,CAAC,KAAa;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;YAChE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,GAAG,CAAC,IAAa,EAAE,KAAY;QACtC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;IAC5B,CAAC;IAED,SAAS,OAAO,CAAC,KAAY,EAAE,KAAa;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;gBAClD,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,MAAM,CAAC,IAAyB,EAAE,KAAY;QACrD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,EAAE,CAAA;QACX,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC/B,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QACrB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,SAAS,IAAI,CAAC,IAAkB,EAAE,KAAY;QAC5C,MAAM,MAAM,GAAS,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAA;QAClD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAClB,MAAM,CAAC,WAAW,EAAE,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC,IAAI,CAAA;QAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC;YAChD,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;YACtB,CAAC,CAAC,SAAS,CAAA;QACb,IAAI,CAAC,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;gBACtC,OAAO,CAAC,KAAK,CAAC,CAAA;YAChB,CAAC;YACD,OAAO,EAAE,CAAA;QACX,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;QACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAA;QAChD,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;QACxB,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAA;YAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;gBACtC,OAAO,CAAC,KAAK,CAAC,CAAA;gBACd,OAAO,GAAG,IAAI,CAAA;YAChB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,YAAY,CAAC,GAAG,CAAE,EAAE,CAAC,CAAA;gBAChE,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAA;IAC3D,CAAC;IAED,SAAS,IAAI,CAAC,IAAa,EAAE,KAAY;QACvC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,YAAY,CAAC,CAAC,CAAC;gBAClB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACzC,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAC3B,CAAA;gBACH,CAAC;gBACD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACrC,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,GAAG,IAAI,CAAA;oBACnB,OAAO,OAAO,CAAC,KAAK,CAAA;gBACtB,CAAC;gBACD,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;YACzC,CAAC;YAED,KAAK,kBAAkB,CAAC,CAAC,CAAC;gBACxB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;gBACzC,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACjC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;oBACtB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACnD,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACrB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAA;YACtD,CAAC;YAED,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;YAC1B,CAAC;YAED,KAAK,uBAAuB,CAAC,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACnC,OAAO,CAAC,IAAI,CAAC,CAAA;gBACb,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU;oBAChC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC;oBAChC,CAAC,CAAC,IAAI,CAAA;gBACR,OAAO,CAAC,GAAG,UAAU,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAA;YAC1D,CAAC;YAED,KAAK,kBAAkB,CAAC,CAAC,CAAC;gBACxB,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACrB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;gBAClC,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACvB,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBACtB,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC9B,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAClB,CAAC;gBACD,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,eAAe,CAAC,CAAC,CAAC;gBACrB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9C,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBACnB,CAAC;gBACD,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACvB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;wBAC/B,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;oBACxB,CAAC;gBACH,CAAC;gBACD,OAAO,EAAE,CAAA;YACX,CAAC;YAED,KAAK,oBAAoB,CAAC,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAA;gBAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;oBAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;wBACzC,OAAO,CAAC,KAAK,CAAC,CAAA;oBAChB,CAAC;gBACH,CAAC;gBACD,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAA;YACnC,CAAC;YAED,KAAK,sBAAsB,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAA;gBAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAChC,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;oBAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;gBACzB,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;gBACvC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAClB,OAAO,KAAK,CAAA;YACd,CAAC;YAED,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,KAAK,GAAU,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;gBACnC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;gBAC7C,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACrB,OAAO,EAAE,CAAA;YACX,CAAC;YAED,OAAO,CAAC,CAAC,CAAC;gBACR,OAAO,IAAA,uBAAW,EAAC,IAAI,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAU,IAAI,GAAG,EAAE,CAAA;IAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC3C,OAAO,CAAC,OAAO,CAAC,CAAA;IAChB,OAAO,CAAC,KAAK,CAAC,CAAA;IACd,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAA;IACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;IACH,CAAC;IACD,OAAO;QACL,SAAS,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,KAAK,EAAE,QAAQ;QACf,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,OAAO;QACP,IAAI,EAAE,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC;QACrC,KAAK;QACL,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;KACxB,CAAA;AACH,CAAC"}

package/dist/check.d.ts

@@ -93,11 +93,6 @@ export interface CheckResult {
     type: Type;
 }
 export declare const UNKNOWN: Type;
-/**
- * Renders a tree back to expression text, for messages and suggestions. The
- * text parses back to the same tree.
- */
-export declare function print(ast: AstNode): string;
 /** The type of a row whose fields `schema` declares. */
 export declare function recordOf(schema: readonly FieldSchema[]): Type;
 export declare function union(a: Type, b: Type): Type;

package/dist/check.js

@@ -5,10 +5,13 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.UNKNOWN = void 0;
-exports.print = print;
 exports.recordOf = recordOf;
 exports.union = union;
 exports.check = check;
+const analyze_ts_1 = require("./analyze.js");
+const errors_ts_1 = require("./errors.js");
+const operators_ts_1 = require("./operators.js");
+const print_ts_1 = require("./print.js");
 exports.UNKNOWN = { kind: 'unknown' };
 const UNDEFINED = { kind: 'undefined' };
 const BOOLEAN = { kind: 'boolean' };
@@ -18,184 +21,6 @@ const MAX_VALUES = 64;
 const ARITHMETIC = new Set(['-', '*', '/', '//', '%', '^']);
 const ORDER = new Set(['<', '<=', '>', '>=']);
 const EQUALITY = new Set(['==', '!=']);
-const PRECEDENCE = {
-    '=': 2,
-    '||': 10,
-    '??': 10,
-    '&&': 11,
-    '==': 20,
-    '!=': 20,
-    '~': 20,
-    '!~': 20,
-    '<': 20,
-    '<=': 20,
-    '>': 20,
-    '>=': 20,
-    in: 20,
-    '+': 30,
-    '-': 30,
-    '*': 40,
-    '/': 40,
-    '//': 40,
-    '%': 50,
-    '^': 50
-};
-const RIGHT_ASSOCIATIVE = new Set(['^']);
-const LOGICAL = new Set(['||', '&&']);
-// how tightly each form binds, mirroring the Parser's levels: `;`, then `=`
-// and lambdas, then `?:`, then binary operators, then prefix operators
-const SEQUENCE = 0;
-const ASSIGNMENT = 1;
-const CONDITIONAL = 2;
-const CUSTOM_BINARY = 3;
-const UNARY = 100;
-const letter = String.raw `a-zA-Zа-яА-Я_À-ÖØ-öø-ÿ$`;
-const IDENTIFIER = new RegExp(`^[${letter}][${letter}0-9]*$`);
-const WORDS = new Set(['in', 'true', 'false', 'null']);
-function isName(text) {
-    return IDENTIFIER.test(text) && !WORDS.has(text);
-}
-function key(name) {
-    return isName(name) ? `.${name}` : `[${quote(name)}]`;
-}
-function quote(text) {
-    return `'${text.replaceAll('\\', '\\\\').replaceAll("'", String.raw `\'`)}'`;
-}
-function precedenceOf(node) {
-    switch (node.type) {
-        case 'SequenceExpression': {
-            return SEQUENCE;
-        }
-        case 'AssignmentExpression':
-        case 'Lambda': {
-            return ASSIGNMENT;
-        }
-        case 'ConditionalExpression': {
-            // with no alternate, it ends only before `)`, `]`, `}`, `,`, `;` or the end
-            return node.alternate ? CONDITIONAL : SEQUENCE;
-        }
-        case 'BinaryExpression': {
-            return PRECEDENCE[node.operator] ?? CUSTOM_BINARY;
-        }
-        case 'UnaryExpression': {
-            return UNARY;
-        }
-        default: {
-            return Infinity;
-        }
-    }
-}
-function within(ast, least) {
-    const text = print(ast);
-    return precedenceOf(ast) < least ? `(${text})` : text;
-}
-function binaryOperand(parent, ast, left) {
-    const own = PRECEDENCE[parent.operator];
-    if (own === undefined) {
-        return within(ast, UNARY);
-    }
-    const child = ast;
-    const theirs = precedenceOf(child);
-    const chained = child.type === 'BinaryExpression' &&
-        RIGHT_ASSOCIATIVE.has(parent.operator) &&
-        RIGHT_ASSOCIATIVE.has(child.operator);
-    const mixesNullish = child.type === 'BinaryExpression' &&
-        ((parent.operator === '??' && LOGICAL.has(child.operator)) ||
-            (child.operator === '??' && LOGICAL.has(parent.operator)));
-    const text = print(ast);
-    return theirs < own || (theirs === own && left === chained) || mixesNullish
-        ? `(${text})`
-        : text;
-}
-/**
- * Renders a tree back to expression text, for messages and suggestions. The
- * text parses back to the same tree.
- */
-function print(ast) {
-    const node = ast;
-    switch (node.type) {
-        case 'Literal': {
-            const { value } = node;
-            return typeof value === 'string'
-                ? quote(value)
-                : Object.is(value, -0)
-                    ? '-0'
-                    : String(value);
-        }
-        case 'Identifier': {
-            return node.from
-                ? within(node.from, Infinity) + key(node.value)
-                : node.value;
-        }
-        case 'FilterExpression': {
-            return `${within(node.subject, Infinity)}[${within(node.expr, ASSIGNMENT)}]`;
-        }
-        case 'BinaryExpression': {
-            return `${binaryOperand(node, node.left, true)} ${node.operator} ${binaryOperand(node, node.right, false)}`;
-        }
-        case 'UnaryExpression': {
-            const { operator } = node;
-            const right = within(node.right, UNARY);
-            // the Lexer folds a minus before a digit into the number
-            if (operator === '-' && /^\d/.test(right)) {
-                return `-(${right})`;
-            }
-            return IDENTIFIER.test(operator)
-                ? `${operator} ${right}`
-                : operator + right;
-        }
-        case 'ConditionalExpression': {
-            const test = within(node.test, CUSTOM_BINARY);
-            const consequent = node.consequent
-                ? ` ${within(node.consequent, ASSIGNMENT)} `
-                : '';
-            const alternate = node.alternate
-                ? ` ${within(node.alternate, ASSIGNMENT)}`
-                : '';
-            return `${test} ?${consequent}:${alternate}`;
-        }
-        case 'FunctionCall': {
-            const args = node.args.map((arg) => within(arg, ASSIGNMENT));
-            return `${node.name}(${args.join(', ')})`;
-        }
-        case 'ArrayLiteral': {
-            const items = node.value.map((item) => within(item, ASSIGNMENT));
-            return `[${items.join(', ')}]`;
-        }
-        case 'ObjectLiteral': {
-            const entries = Object.entries(node.value).map(([name, value]) => `${isName(name) ? name : quote(name)}: ${within(value, ASSIGNMENT)}`);
-            return `{${entries.join(', ')}}`;
-        }
-        case 'TemplateLiteral': {
-            const parts = node.parts.map((part) => part.type === 'static'
-                ? part.value
-                    .replaceAll('\\', '\\\\')
-                    .replaceAll('`', '\\`')
-                    .replaceAll('${', '\\${')
-                : `\${${print(part.value)}}`);
-            return `\`${parts.join('')}\``;
-        }
-        case 'SequenceExpression': {
-            const { expressions } = node;
-            const text = expressions
-                .map((expr) => within(expr, ASSIGNMENT))
-                .join('; ');
-            return expressions.length === 1 ? `${text};` : text;
-        }
-        case 'AssignmentExpression': {
-            return `${node.left.value} = ${within(node.right, ASSIGNMENT)}`;
-        }
-        case 'Lambda': {
-            const params = node.params.length === 1
-                ? node.params[0]
-                : `(${node.params.join(', ')})`;
-            return `${params} => ${within(node.body, ASSIGNMENT)}`;
-        }
-        default: {
-            return '?';
-        }
-    }
-}
 function distance(a, b) {
     let before = [];
     let previous = Array.from({ length: b.length + 1 }, (_, i) => i);
@@ -313,7 +138,7 @@ function isBoxed(type) {
 }
 function isPattern(pattern) {
     try {
-        new RegExp(pattern.startsWith('(?i)') ? pattern.slice(4) : pattern);
+        (0, operators_ts_1.toRegExp)(pattern);
         return true;
     }
     catch {
@@ -570,21 +395,17 @@ function negate(type) {
     }
 }
 function paramName(subject, context) {
-    const node = subject;
-    const base = node.type === 'Identifier'
-        ? node.value.toLowerCase().replaceAll(/\W/g, '')
+    const base = subject.type === 'Identifier'
+        ? subject.value.toLowerCase().replaceAll(/\W/g, '')
         : '';
-    const name = isName(base) ? base : 'x';
-    const text = print(context);
+    const name = (0, print_ts_1.isName)(base) ? base : 'x';
+    const text = (0, print_ts_1.print)(context);
     let candidate = name;
     for (let i = 2; new RegExp(String.raw `\b${candidate}\b`).test(text); i++) {
         candidate = `${name}${i}`;
     }
     return candidate;
 }
-function literalValue(node) {
-    return node.type === 'Literal' ? node.value : undefined;
-}
 function describe(type) {
     switch (type.kind) {
         case 'list': {
@@ -597,7 +418,7 @@ function describe(type) {
             return type.values?.length === 1 ? String(type.values[0]) : 'a number';
         }
         case 'string': {
-            return type.values?.length === 1 ? quote(type.values[0]) : 'text';
+            return type.values?.length === 1 ? (0, print_ts_1.quote)(type.values[0]) : 'text';
         }
         case 'boolean': {
             return type.field?.type === 'flag' ? 'a flag' : 'a boolean';
@@ -671,10 +492,10 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         });
     }
     function text(node, name) {
-        return node ? print(node) + key(name) : name;
+        return node ? (0, print_ts_1.print)(node) + (0, print_ts_1.key)(name) : name;
     }
     function field(subject, name, node, subjectNode, spell = (candidate) => text(subjectNode, candidate)) {
-        const where = subjectNode ? print(subjectNode) : 'the row';
+        const where = subjectNode ? (0, print_ts_1.print)(subjectNode) : 'the row';
         switch (subject.kind) {
             case 'record': {
                 const found = subject.fields.get(name) ?? subject.each;
@@ -698,16 +519,16 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                         (item.open || !!item.each || item.fields.has(name)));
                 const suggestions = [];
                 if (entriesHave && subjectNode && node.type === 'Identifier') {
-                    const list = print(subjectNode);
+                    const list = (0, print_ts_1.print)(subjectNode);
                     const param = paramName(subjectNode, node);
-                    suggestions.push(`${list}[0]${key(name)}`);
+                    suggestions.push(`${list}[0]${(0, print_ts_1.key)(name)}`);
                     if (functions?.map) {
-                        suggestions.push(`map(${list}, ${param} => ${param}${key(name)})`);
+                        suggestions.push(`map(${list}, ${param} => ${param}${(0, print_ts_1.key)(name)})`);
                     }
                 }
-                report('dot-through-list', 'warning', node, `${where} is a list, so ${key(name)} is undefined` +
+                report('dot-through-list', 'warning', node, `${where} is a list, so ${(0, print_ts_1.key)(name)} is undefined` +
                     (entriesHave
-                        ? `; [0]${key(name)} reads the first entry's` +
+                        ? `; [0]${(0, print_ts_1.key)(name)} reads the first entry's` +
                             (functions?.any ? ', and any() tests each' : '')
                         : ''), suggestions);
                 return UNDEFINED;
@@ -730,7 +551,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         return exports.UNKNOWN;
     }
     function index(subject, at, node, subjectNode) {
-        const where = print(subjectNode);
+        const where = (0, print_ts_1.print)(subjectNode);
         switch (subject.kind) {
             case 'list': {
                 const absent = firstAbsentIndex(subject.cardinality);
@@ -759,23 +580,17 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
             }
         }
     }
-    function chain(node) {
+    function dottedKey(node) {
         const names = [node.value];
         let base = node;
-        while (base.type === 'Identifier' && base.from) {
-            base = base.from;
-            if (base.type === 'Identifier') {
-                names.unshift(base.value);
+        while (base.from) {
+            if (base.from.type !== 'Identifier') {
+                return undefined;
             }
+            base = base.from;
+            names.unshift(base.value);
         }
-        return { base, names };
-    }
-    function dottedKey(node) {
-        if (!node.from) {
-            return undefined;
-        }
-        const { base, names } = chain(node);
-        if (base.from) {
+        if (base === node) {
             return undefined;
         }
         let type = variable(base, false);
@@ -791,8 +606,8 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                 const stepReaches = step?.kind === 'record' &&
                     (step.fields.has(names[i + 1]) || !!step.each);
                 if (record.fields.has(whole) && !stepReaches) {
-                    const fixed = print(subjectNode) + key(whole);
-                    report('dotted-key', 'warning', node, `${whole} is one field of ${print(subjectNode)}; jexl reads ${names.slice(i, j).join(' then ')}`, [[fixed, ...names.slice(j).map((name) => key(name))].join('')]);
+                    const fixed = (0, print_ts_1.print)(subjectNode) + (0, print_ts_1.key)(whole);
+                    report('dotted-key', 'warning', node, `${whole} is one field of ${(0, print_ts_1.print)(subjectNode)}; jexl reads ${names.slice(i, j).join(' then ')}`, [[fixed, ...names.slice(j).map((name) => (0, print_ts_1.key)(name))].join('')]);
                     let resolved = record.fields.get(whole);
                     for (const name of names.slice(j)) {
                         resolved = field(resolved, name, node, undefined);
@@ -849,23 +664,31 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         if (node.type !== 'BinaryExpression' ||
             node.operator !== '-' ||
             node.left.type !== 'Identifier' ||
-            node.right?.type !== 'Identifier' ||
+            node.right.type !== 'Identifier' ||
             node.right.from) {
             return undefined;
         }
         const left = node.left;
+        const name = left.value;
+        if (!left.from &&
+            (scope.has(name) || name === row || (env && Object.hasOwn(env, name)))) {
+            return undefined;
+        }
         const reported = diagnostics.length;
         const subject = left.from ? infer(left.from) : root;
         diagnostics.length = reported;
-        if (subject.kind !== 'record' || subject.fields.has(left.value)) {
+        if (subject.kind !== 'record' || subject.fields.has(name)) {
             return undefined;
         }
-        const whole = `${left.value}-${node.right.value}`;
+        const whole = `${name}-${node.right.value}`;
         const found = subject.fields.get(whole);
         if (!found) {
             return undefined;
         }
-        report('unknown-field', 'warning', node, `${print(node)} subtracts; ${whole} is one field`, [text(left.from, whole)]);
+        // a bare name can't hold a hyphen, so only a row variable can spell it
+        const holder = left.from ??
+            (row === undefined ? undefined : { type: 'Identifier', value: row });
+        report('unknown-field', 'warning', node, `${(0, print_ts_1.print)(node)} subtracts; ${whole} is one field`, holder ? [text(holder, whole)] : []);
         return found;
     }
     function memberFor(element, value, valueNode, listNode, node) {
@@ -878,10 +701,10 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                 const scalar = type.kind === 'list' ? type.of : type;
                 return scalar.kind === 'string' && scalar.values?.includes(literal);
             });
-            report('never-equal', 'warning', node, `${print(listNode)} holds records, so no entry equals ${quote(literal)}` +
+            report('never-equal', 'warning', node, `${(0, print_ts_1.print)(listNode)} holds records, so no entry equals ${(0, print_ts_1.quote)(literal)}` +
                 (holder ? `; it is a value of their ${holder[0]} field` : ''), holder && functions?.any
                 ? [
-                    `any(${print(listNode)}, ${paramName(listNode, node)} => ${print(valueNode)} in ${paramName(listNode, node)}${key(holder[0])})`
+                    `any(${(0, print_ts_1.print)(listNode)}, ${paramName(listNode, node)} => ${(0, print_ts_1.print)(valueNode)} in ${paramName(listNode, node)}${(0, print_ts_1.key)(holder[0])})`
                 ]
                 : []);
             return;
@@ -892,21 +715,21 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         if (type.kind === 'number' &&
             typeof literal === 'string' &&
             Number.isNaN(Number(literal))) {
-            report('never-equal', 'warning', node, `${quote(literal)} is not a number, so it never equals ${describe(type)}`);
+            report('never-equal', 'warning', node, `${(0, print_ts_1.quote)(literal)} is not a number, so it never equals ${describe(type)}`);
         }
         else if (type.kind === 'boolean' && typeof literal === 'string') {
-            report('never-equal', 'warning', node, `${describe(type)} never equals the text ${quote(literal)}`, literal === 'true' || literal === 'false' ? [literal] : []);
+            report('never-equal', 'warning', node, `${describe(type)} never equals the text ${(0, print_ts_1.quote)(literal)}`, literal === 'true' || literal === 'false' ? [literal] : []);
         }
         else if (type.kind === 'string' &&
             type.field?.categories &&
             typeof literal === 'string' &&
             !type.field.categories.includes(literal)) {
             const near = nearest(literal, type.field.categories);
-            report('unknown-category', 'warning', node, `${quote(literal)} is not one of the values the header declares for ${type.field.path.join('.')}` +
-                (near.length ? `; did you mean ${near.map(quote).join(', ')}?` : ''), near.map(quote));
+            report('unknown-category', 'warning', node, `${(0, print_ts_1.quote)(literal)} is not one of the values the header declares for ${type.field.path.join('.')}` +
+                (near.length ? `; did you mean ${near.map(print_ts_1.quote).join(', ')}?` : ''), near.map(print_ts_1.quote));
         }
         else if (type.kind === 'record') {
-            report('never-equal', 'warning', node, `a record never equals ${quote(String(literal))}`);
+            report('never-equal', 'warning', node, `a record never equals ${(0, print_ts_1.quote)(String(literal))}`);
         }
     }
     function binary(node) {
@@ -929,7 +752,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         if (operator === '~' || operator === '!~') {
             const pattern = literalOf(right);
             if (typeof pattern === 'string' && !isPattern(pattern)) {
-                report('invalid-pattern', 'error', node, `${quote(pattern)} is not a valid regular expression`);
+                report('invalid-pattern', 'error', node, `${(0, print_ts_1.quote)(pattern)} is not a valid regular expression`);
             }
             return BOOLEAN;
         }
@@ -945,7 +768,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
             second &&
             (ARITHMETIC.has(operator) || operator === '+') &&
             !pairs(first.cardinality, second.cardinality)) {
-            report('list-lengths', 'warning', node, `${print(node.left)} ${holding(first)} and ${print(rightNode)} ${holding(second)}, so ${operator} pairs them only where both hold one value`);
+            report('list-lengths', 'warning', node, `${(0, print_ts_1.print)(node.left)} ${holding(first)} and ${(0, print_ts_1.print)(rightNode)} ${holding(second)}, so ${operator} pairs them only where both hold one value`);
         }
         const eachOf = (item) => first ? { kind: 'list', of: item, cardinality: first.cardinality } : item;
         if (operator === '+') {
@@ -960,9 +783,9 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
             ]) {
                 const numericOther = ARITHMETIC.has(operator) || isNumberish(other);
                 if (type.kind === 'string' && type.field && numericOther) {
-                    report('string-numeric', 'warning', node, `${print(typeNode)} is text, so ${operator} converts it to a number, ${ORDER.has(operator) ? 'answering false' : 'giving NaN'} wherever it is not one`, functions?.parseFloat
+                    report('string-numeric', 'warning', node, `${(0, print_ts_1.print)(typeNode)} is text, so ${operator} converts it to a number, ${ORDER.has(operator) ? 'answering false' : 'giving NaN'} wherever it is not one`, functions?.parseFloat
                         ? [
-                            print(node).replace(print(typeNode), `parseFloat(${print(typeNode)})`)
+                            (0, print_ts_1.print)(node).replace((0, print_ts_1.print)(typeNode), `parseFloat(${(0, print_ts_1.print)(typeNode)})`)
                         ]
                         : []);
                 }
@@ -974,7 +797,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         if (EQUALITY.has(operator)) {
             const leftLiteral = literalOf(leftItem);
             const rightLiteral = literalOf(rightItem);
-            if (rightLiteral !== undefined && node.right?.type === 'Literal') {
+            if (rightLiteral !== undefined && node.right.type === 'Literal') {
                 compareLiteral(leftItem, rightLiteral, node);
             }
             else if (leftLiteral !== undefined && node.left.type === 'Literal') {
@@ -987,7 +810,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                 memberFor(right.of, leftItem, node.left, rightNode, node);
             }
             else if (right.kind === 'number' || right.kind === 'boolean') {
-                report('never-equal', 'warning', node, `in tests a list, text, a Set, a Map or an object's keys, and ${print(rightNode)} is ${describe(right)}`);
+                report('never-equal', 'warning', node, `in tests a list, text, a Set, a Map or an object's keys, and ${(0, print_ts_1.print)(rightNode)} is ${describe(right)}`);
             }
             return BOOLEAN;
         }
@@ -1061,12 +884,12 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                 step(String(name), node);
             }
             for (const arg of keyArgs) {
-                const name = literalValue(arg);
+                const name = (0, analyze_ts_1.literalValue)(arg);
                 if (typeof name !== 'string' && typeof name !== 'number') {
                     keyArgs.forEach(infer);
                     return exports.UNKNOWN;
                 }
-                step(String(name), arg, quote);
+                step(String(name), arg, print_ts_1.quote);
             }
             return type;
         }
@@ -1076,7 +899,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
             if (functions) {
                 const near = nearest(name, Object.keys(functions));
                 report('unknown-function', 'error', node, `no function ${name}` +
-                    (near.length ? `; did you mean ${near.join(', ')}?` : ''), near.map((candidate) => print({ ...node, name: candidate })));
+                    (near.length ? `; did you mean ${near.join(', ')}?` : ''), near.map((candidate) => (0, print_ts_1.print)({ ...node, name: candidate })));
             }
             return exports.UNKNOWN;
         }
@@ -1104,7 +927,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
             const type = infer(arg);
             types.push(type);
             if (accepted.includes('lambda')) {
-                report('argument-type', 'error', arg, `${name} expects a function such as x => …, not ${print(arg)}`);
+                report('argument-type', 'error', arg, `${name} expects a function such as x => …, not ${(0, print_ts_1.print)(arg)}`);
                 continue;
             }
             if (accepted.includes('member') && lastCollection && lastCollectionNode) {
@@ -1119,7 +942,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                     ? 'list-operand'
                     : type.kind === 'string'
                         ? 'string-numeric'
-                        : 'argument-type', 'warning', arg, `${name} expects ${accepted.join(' or ')} as argument ${i + 1}, but ${print(arg)} ${problems[0]}`);
+                        : 'argument-type', 'warning', arg, `${name} expects ${accepted.join(' or ')} as argument ${i + 1}, but ${(0, print_ts_1.print)(arg)} ${problems[0]}`);
             }
             if (accepted.includes('list')) {
                 lastCollection = type;
@@ -1135,8 +958,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
         }
         return returns ?? exports.UNKNOWN;
     }
-    function infer(ast) {
-        const node = ast;
+    function infer(node) {
         switch (node.type) {
             case 'Literal': {
                 const { value } = node;
@@ -1160,20 +982,20 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
             }
             case 'FilterExpression': {
                 const subject = infer(node.subject);
-                const at = literalValue(node.expr);
+                const at = (0, analyze_ts_1.literalValue)(node.expr);
                 if (typeof at === 'number') {
                     return index(subject, at, node, node.subject);
                 }
                 if (typeof at === 'string') {
                     if (subject.kind === 'list' && at !== 'length') {
-                        report('unknown-field', 'warning', node, `${print(node.subject)} is ${describe(subject)}, so [${quote(at)}] reads nothing`);
+                        report('unknown-field', 'warning', node, `${(0, print_ts_1.print)(node.subject)} is ${describe(subject)}, so [${(0, print_ts_1.quote)(at)}] reads nothing`);
                         return UNDEFINED;
                     }
                     return field(subject, at, node, node.subject);
                 }
                 const by = infer(node.expr);
                 if (isMulti(by)) {
-                    report('list-operand', 'warning', node, `${print(node.expr)} ${holding(by)}, so indexing by it finds an entry only when there is exactly one`);
+                    report('list-operand', 'warning', node, `${(0, print_ts_1.print)(node.expr)} ${holding(by)}, so indexing by it finds an entry only when there is exactly one`);
                 }
                 if (subject.kind === 'record') {
                     return unionAll([
@@ -1257,7 +1079,7 @@ function check(ast, { schema, functions, accessors = {}, row, env } = {}) {
                 return lambda(node);
             }
             default: {
-                throw new Error(`Corrupt AST: unknown node type '${ast.type}'`);
+                return (0, errors_ts_1.unknownNode)(node);
             }
         }
     }