@jbrowse/jexl 3.3.0 → 4.0.1

package/esm/parser/handlers.js.map

@@ -1 +1 @@
-{"version":3,"file":"handlers.js","sourceRoot":"","sources":["../../src/parser/handlers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAC5C,+EAA+E;AAC/E,8DAA8D;AAC9D,OAAO,MAAM,MAAM,aAAa,CAAA;AAkBhC;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,IAAI,GAAG,EAAE,CAAC;QACR,CAAC;QAAC,IAAI,CAAC,OAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAChD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU;IACxB,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,cAAc;QACpB,KAAK,EAAE,EAAE;KACV,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAe,GAAmB;IACxD,IAAI,GAAG,EAAE,CAAC;QACR,CAAC;QAAC,IAAI,CAAC,OAAwB,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACjD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAe,KAAY;IACjD,IAAI,KAAK,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QACxB,sEAAsE;QACtE,oEAAoE;QACpE,IACE,IAAI,CAAC,OAAO,EAAE,IAAI,KAAK,YAAY;YAClC,IAAI,CAAC,OAAsB,CAAC,IAAI,EACjC,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAA;QACpE,CAAC;QAED,MAAM,IAAI,GAAyB;YACjC,IAAI,EAAE,sBAAsB;YAC5B,QAAQ,EAAE,GAAG;YACb,IAAI,EAAE,IAAI,CAAC,OAAqB;SACjC,CAAA;QACD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAA;QACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACzB,OAAM;IACR,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,KAAe,CAAA;IACxC,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAA;IACnE,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,CAAA;IAClC,OAAO,MAAM,EAAE,CAAC;QACd,MAAM,UAAU,GAAG,MAA0B,CAAA;QAC7C,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAK;QACP,CAAC;QACD,IACE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,GAAG,UAAU,EACtE,CAAC;YACD,MAAK;QACP,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;QACrB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAA;IACzB,CAAC;IACD,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,kBAAkB;QACxB,QAAQ,EAAE,UAAU;QACpB,IAAI,EAAE,IAAI,CAAC,OAAQ;KACpB,CAAA;IACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAQ,EAAE,IAAI,CAAC,CAAA;IACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;IACrB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,GAAG;IACjB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,yEAAyE;IACzE,0EAA0E;IAC1E,6DAA6D;IAC7D,IAAI,CAAC,qBAAqB;QACxB,CAAC,CAAC,MAAM;YACR,MAAM,CAAC,IAAI,KAAK,iBAAiB;YACjC,CAAC,MAAM,CAAC,IAAI,KAAK,kBAAkB,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAExD,IAAI,CAAC,kBAAkB,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAA;IACrD,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;IACvB,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,kBAAkB;QACxB,IAAI,EAAE,GAAI;QACV,QAAQ,EAAE,IAAI,CAAC,UAAW,CAAC,UAAU,EAAE;QACvC,OAAO,EAAE,IAAI,CAAC,OAAQ;KACvB,CAAA;IACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY;IAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,EAAE,IAAI,KAAK,YAAY,EAAE,CAAC;QAClC,wEAAwE;QACxE,mDAAmD;QACnD,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAoB,CAAA;IACrC,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,cAAc;QACpB,IAAI,EAAG,MAAqB,CAAC,KAAK;QAClC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;QACxB,IAAI,EAAE,WAAW;KAClB,CAAA;IACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,KAAY;IACnD,MAAM,IAAI,GAAe;QACvB,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,KAAK,CAAC,KAAe;KAC7B,CAAA;IACD,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,OAAQ,CAAA;QACzB,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;IACpC,CAAC;SAAM,CAAC;QACN,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YACpB,IAAI,CAAC,kBAAkB,GAAG,KAAK,CAAA;QACjC,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAe,KAAY;IAChD,MAAM,IAAI,GAAY;QACpB,IAAI,EAAE,SAAS;QACf,KAAK,EAAE,KAAK,CAAC,KAAkC;KAChD,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAe,KAAY;IACvD,MAAM,KAAK,GAA6B,EAAE,CAAA;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAEhE,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC;aACvD,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAClD,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;YACxD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;YAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAA;YAEnC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;YAC3D,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,YAAY;gBAClB,KAAK,EAAE,MAAM;aACd,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,iBAAiB;QACvB,KAAK;KACN,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAe,KAAY;IAC/C,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,KAAe,CAAA;AACzC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ;IACtB,MAAM,IAAI,GAAkB;QAC1B,IAAI,EAAE,eAAe;QACrB,KAAK,EAAE,EAAE;KACV,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,sEAAsE;IACtE,6EAA6E;IAC7E,2DAA2D;IAC3D,MAAM,CAAC,cAAc,CAClB,IAAI,CAAC,OAAyB,CAAC,KAAK,EACrC,IAAI,CAAC,UAAW,EAChB;QACE,KAAK,EAAE,GAAI;QACX,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,IAAI;QAChB,YAAY,EAAE,IAAI;KACnB,CACF,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAe,GAAmB;IAC7D,IAAI,CAAC,cAAc,CAAC,GAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,GAAmB;IAC1D,CAAC;IAAC,IAAI,CAAC,OAAiC,CAAC,SAAS,GAAG,GAAG,IAAI,SAAS,CAAA;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,GAAmB;IAC1D,CAAC;IAAC,IAAI,CAAC,OAAiC,CAAC,UAAU,GAAG,GAAG,IAAI,SAAS,CAAA;AACxE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY;IAC1B,MAAM,IAAI,GAA0B;QAClC,IAAI,EAAE,uBAAuB;QAC7B,IAAI,EAAE,IAAI,CAAC,KAAM;KAClB,CAAA;IACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;IACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAe,KAAY;IAChD,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,iBAAiB;QACvB,QAAQ,EAAE,KAAK,CAAC,KAAe;KAChC,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS;IACvB,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/B,IAAI,CAAC,oBAAoB,GAAG,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3C,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC7C,CAAC;IAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;IACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;IACnB,IAAI,CAAC,MAAM,GAAG,eAAe,CAAA;AAC/B,CAAC"}
+{"version":3,"file":"handlers.js","sourceRoot":"","sources":["../../src/parser/handlers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAC5C,+EAA+E;AAC/E,8DAA8D;AAC9D,OAAO,MAAM,MAAM,aAAa,CAAA;AAkBhC;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,IAAI,GAAG,EAAE,CAAC;QACR,CAAC;QAAC,IAAI,CAAC,OAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAChD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU;IACxB,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,cAAc;QACpB,KAAK,EAAE,EAAE;KACV,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAe,GAAmB;IACxD,IAAI,GAAG,EAAE,CAAC;QACR,CAAC;QAAC,IAAI,CAAC,OAAwB,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACjD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAe,KAAY;IACjD,IAAI,KAAK,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QACxB,sEAAsE;QACtE,2EAA2E;QAC3E,IACE,IAAI,CAAC,OAAO,EAAE,IAAI,KAAK,YAAY;YAClC,IAAI,CAAC,OAAsB,CAAC,IAAI,EACjC,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAA;QACpE,CAAC;QAED,MAAM,IAAI,GAAyB;YACjC,IAAI,EAAE,sBAAsB;YAC5B,QAAQ,EAAE,GAAG;YACb,IAAI,EAAE,IAAI,CAAC,OAAqB;SACjC,CAAA;QACD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAA;QACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACzB,OAAM;IACR,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,KAAe,CAAA;IACxC,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAA;IACnE,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,CAAA;IAClC,OAAO,MAAM,EAAE,CAAC;QACd,MAAM,UAAU,GAAG,MAA0B,CAAA;QAC7C,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAK;QACP,CAAC;QACD,0EAA0E;QAC1E,4EAA4E;QAC5E,sEAAsE;QACtE,2EAA2E;QAC3E,MAAM,gBAAgB,GACpB,MAAM,CAAC,IAAI,KAAK,iBAAiB;YAC/B,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAA;QAC/D,IAAI,gBAAgB,GAAG,UAAU,EAAE,CAAC;YAClC,MAAK;QACP,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;QACrB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAA;IACzB,CAAC;IACD,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,kBAAkB;QACxB,QAAQ,EAAE,UAAU;QACpB,IAAI,EAAE,IAAI,CAAC,OAAQ;KACpB,CAAA;IACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAQ,EAAE,IAAI,CAAC,CAAA;IACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;IACrB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,GAAG;IACjB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,6EAA6E;IAC7E,8EAA8E;IAC9E,4EAA4E;IAC5E,yEAAyE;IACzE,8EAA8E;IAC9E,8DAA8D;IAC9D,IACE,CAAC,MAAM;QACP,MAAM,CAAC,IAAI,KAAK,iBAAiB;QACjC,CAAC,MAAM,CAAC,IAAI,KAAK,kBAAkB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EACrD,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,kBAAkB;QACxB,IAAI,EAAE,GAAI;QACV,OAAO,EAAE,IAAI,CAAC,OAAQ;KACvB,CAAA;IACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY;IAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,EAAE,IAAI,KAAK,YAAY,EAAE,CAAC;QAClC,wEAAwE;QACxE,mDAAmD;QACnD,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAoB,CAAA;IAC5C,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,cAAc;QACpB,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;KACzB,CAAA;IACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,KAAY;IACnD,MAAM,IAAI,GAAe;QACvB,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,KAAK,CAAC,KAAe;KAC7B,CAAA;IACD,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,OAAQ,CAAA;QACzB,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;IACpC,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAe,KAAY;IAChD,MAAM,IAAI,GAAY;QACpB,IAAI,EAAE,SAAS;QACf,KAAK,EAAE,KAAK,CAAC,KAAkC;KAChD,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAe,KAAY;IACvD,MAAM,KAAK,GAA6B,EAAE,CAAA;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAEhE,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC;aACvD,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAClD,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;YACxD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;YAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAA;YAEnC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;YAC3D,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,YAAY;gBAClB,KAAK,EAAE,MAAM;aACd,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,iBAAiB;QACvB,KAAK;KACN,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAe,KAAY;IAC/C,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,KAAe,CAAA;AACzC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ;IACtB,MAAM,IAAI,GAAkB;QAC1B,IAAI,EAAE,eAAe;QACrB,KAAK,EAAE,EAAE;KACV,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,sEAAsE;IACtE,6EAA6E;IAC7E,sDAAsD;IACtD,MAAM,CAAC,cAAc,CAClB,IAAI,CAAC,OAAyB,CAAC,KAAK,EACrC,IAAI,CAAC,UAAW,EAChB;QACE,KAAK,EAAE,GAAI;QACX,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,IAAI;QAChB,YAAY,EAAE,IAAI;KACnB,CACF,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAe,GAAmB;IAC7D,IAAI,CAAC,cAAc,CAAC,GAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,GAAmB;IAC1D,CAAC;IAAC,IAAI,CAAC,OAAiC,CAAC,SAAS,GAAG,GAAG,IAAI,SAAS,CAAA;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,GAAmB;IAC1D,CAAC;IAAC,IAAI,CAAC,OAAiC,CAAC,UAAU,GAAG,GAAG,IAAI,SAAS,CAAA;AACxE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY;IAC1B,IAAI,UAA+B,CAAA;IACnC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAM,CAAA;IACtB,OAAO,IAAI,CAAC,IAAI,KAAK,sBAAsB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC1D,UAAU,GAAG,IAAI,CAAA;QACjB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,MAAM,IAAI,GAA0B;QAClC,IAAI,EAAE,uBAAuB;QAC7B,IAAI;KACL,CAAA;IACD,IAAI,UAAU,EAAE,CAAC;QACf,UAAU,CAAC,KAAK,GAAG,IAAI,CAAA;QACvB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IACnC,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;IACnB,CAAC;IACD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;AACrB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAe,KAAY;IAChD,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,iBAAiB;QACvB,QAAQ,EAAE,KAAK,CAAC,KAAe;KAChC,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS;IACvB,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/B,IAAI,CAAC,oBAAoB,GAAG,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3C,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC7C,CAAC;IAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;IACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;IACnB,IAAI,CAAC,MAAM,GAAG,eAAe,CAAA;AAC/B,CAAC"}

package/esm/parser/states.js

@@ -77,10 +77,6 @@ export const states = {
             colon: { toState: 'objVal' }
         }
     },
-    postArgs: {
-        tokenTypes: afterOperand,
-        completable: true
-    },
     identifier: {
         tokenTypes: {
             ...afterOperand,
@@ -111,7 +107,9 @@ export const states = {
         subHandler: h.argVal,
         endStates: {
             comma: 'argVal',
-            closeParen: 'postArgs'
+            // a call's result is an ordinary operand: it can be operated on or
+            // drilled into, but not called again, since only a name can be called
+            closeParen: 'expectBinOp'
         }
     },
     objVal: {

package/esm/parser/states.js.map

@@ -1 +1 @@
-{"version":3,"file":"states.js","sourceRoot":"","sources":["../../src/parser/states.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,CAAC,MAAM,eAAe,CAAA;AAmBlC;;;;;GAKG;AACH,MAAM,YAAY,GAAqC;IACrD,QAAQ,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE;IACtC,GAAG,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE;IAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;IAClC,QAAQ,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE;IAC5D,SAAS,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE;CACpC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,CAAC,MAAM,MAAM,GAAW;IAC5B,aAAa,EAAE;QACb,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;YACnC,cAAc,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;YAC1C,UAAU,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE;YACrC,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE;YACvC,QAAQ,EAAE,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE;YAC1D,GAAG,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE;YAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,UAAU,EAAE;SAC5D;KACF;IACD,WAAW,EAAE;QACX,UAAU,EAAE,YAAY;QACxB,WAAW,EAAE,IAAI;KAClB;IACD,YAAY,EAAE;QACZ,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YAC1D,UAAU,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YAC7D,SAAS,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;SACtC;KACF;IACD,eAAe,EAAE;QACf,UAAU,EAAE;YACV,KAAK,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;SAC7B;KACF;IACD,QAAQ,EAAE;QACR,UAAU,EAAE,YAAY;QACxB,WAAW,EAAE,IAAI;KAClB;IACD,UAAU,EAAE;QACV,UAAU,EAAE;YACV,GAAG,YAAY;YACf,uEAAuE;YACvE,sEAAsE;YACtE,SAAS,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE;SAC1D;QACD,WAAW,EAAE,IAAI;KAClB;IACD,QAAQ,EAAE;QACR,UAAU,EAAE;YACV,UAAU,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE;SACtC;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,YAAY,EAAE,YAAY;SAC3B;KACF;IACD,aAAa,EAAE;QACb,UAAU,EAAE,CAAC,CAAC,aAAa;QAC3B,SAAS,EAAE;YACT,UAAU,EAAE,aAAa;SAC1B;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,KAAK,EAAE,QAAQ;YACf,UAAU,EAAE,UAAU;SACvB;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,KAAK,EAAE,cAAc;YACrB,SAAS,EAAE,aAAa;SACzB;KACF;IACD,QAAQ,EAAE;QACR,UAAU,EAAE,CAAC,CAAC,QAAQ;QACtB,SAAS,EAAE;YACT,KAAK,EAAE,UAAU;YACjB,YAAY,EAAE,aAAa;SAC5B;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,SAAS,EAAE;YACT,KAAK,EAAE,YAAY;SACpB;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,WAAW,EAAE,IAAI;KAClB;CACF,CAAA"}
+{"version":3,"file":"states.js","sourceRoot":"","sources":["../../src/parser/states.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,CAAC,MAAM,eAAe,CAAA;AAmBlC;;;;;GAKG;AACH,MAAM,YAAY,GAAqC;IACrD,QAAQ,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE;IACtC,GAAG,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE;IAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;IAClC,QAAQ,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE;IAC5D,SAAS,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE;CACpC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,CAAC,MAAM,MAAM,GAAW;IAC5B,aAAa,EAAE;QACb,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;YACnC,cAAc,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;YAC1C,UAAU,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE;YACrC,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE;YACvC,QAAQ,EAAE,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE;YAC1D,GAAG,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE;YAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,UAAU,EAAE;SAC5D;KACF;IACD,WAAW,EAAE;QACX,UAAU,EAAE,YAAY;QACxB,WAAW,EAAE,IAAI;KAClB;IACD,YAAY,EAAE;QACZ,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YAC1D,UAAU,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YAC7D,SAAS,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;SACtC;KACF;IACD,eAAe,EAAE;QACf,UAAU,EAAE;YACV,KAAK,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;SAC7B;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE;YACV,GAAG,YAAY;YACf,uEAAuE;YACvE,sEAAsE;YACtE,SAAS,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE;SAC1D;QACD,WAAW,EAAE,IAAI;KAClB;IACD,QAAQ,EAAE;QACR,UAAU,EAAE;YACV,UAAU,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE;SACtC;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,YAAY,EAAE,YAAY;SAC3B;KACF;IACD,aAAa,EAAE;QACb,UAAU,EAAE,CAAC,CAAC,aAAa;QAC3B,SAAS,EAAE;YACT,UAAU,EAAE,aAAa;SAC1B;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,KAAK,EAAE,QAAQ;YACf,mEAAmE;YACnE,sEAAsE;YACtE,UAAU,EAAE,aAAa;SAC1B;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,KAAK,EAAE,cAAc;YACrB,SAAS,EAAE,aAAa;SACzB;KACF;IACD,QAAQ,EAAE;QACR,UAAU,EAAE,CAAC,CAAC,QAAQ;QACtB,SAAS,EAAE;YACT,KAAK,EAAE,UAAU;YACjB,YAAY,EAAE,aAAa;SAC5B;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,SAAS,EAAE;YACT,KAAK,EAAE,YAAY;SACpB;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,WAAW,EAAE,IAAI;KAClB;CACF,CAAA"}

package/esm/types.d.ts

@@ -23,7 +23,6 @@ export interface Identifier extends AstNode {
     type: 'Identifier';
     value: string;
     from?: AstNode;
-    relative?: boolean;
 }
 export interface BinaryExpression extends AstNode {
     type: 'BinaryExpression';
@@ -59,12 +58,10 @@ export interface FunctionCall extends AstNode {
     type: 'FunctionCall';
     name: string;
     args: AstNode[];
-    pool: 'functions';
 }
 export interface FilterExpression extends AstNode {
     type: 'FilterExpression';
     expr: AstNode;
-    relative: boolean;
     subject: AstNode;
 }
 export interface ConditionalExpression extends AstNode {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@jbrowse/jexl",
-  "version": "3.3.0",
+  "version": "4.0.1",
   "description": "A fork of the jexl lang for jbrowse",
   "type": "module",
   "main": "dist/index.js",
@@ -15,6 +15,7 @@
   ],
   "scripts": {
     "test": "vitest",
+    "bench": "vitest bench --run",
     "coverage": "pnpm test --coverage",
     "clean": "rimraf dist esm",
     "format": "prettier --write .",

package/src/Expression.ts

@@ -4,7 +4,6 @@
  */
 
 import Lexer from './Lexer.ts'
-import Evaluator from './evaluator/Evaluator.ts'
 import { compileAst } from './evaluator/compile.ts'
 import Parser from './parser/Parser.ts'
 
@@ -71,7 +70,7 @@ class Expression {
     if (!this._fn) {
       return undefined
     }
-    return this._fn(new Evaluator(this._grammar, context))
+    return this._fn(context)
   }
 }
 

package/src/Jexl.ts

@@ -40,9 +40,9 @@ class Jexl {
    * Adds a binary operator to Jexl at the specified precedence. The higher the
    * precedence, the earlier the operator is applied in the order of operations.
    * For example, * has a higher precedence than +, because multiplication comes
-   * before division.
+   * before addition.
    *
-   * Please see grammar.js for a listing of all default operators and their
+   * Please see grammar.ts for a listing of all default operators and their
    * precedence values in order to choose the appropriate precedence for the
    * new operator.
    * @param {string} operator The operator string to be added

package/src/Lexer.ts

@@ -6,13 +6,26 @@
 import type { Grammar } from './grammar.ts'
 import type { TemplatePart, Token } from './types.ts'
 
-const numericRegex = /^-?(?:(?:[0-9]*\.[0-9]+)|[0-9]+)$/
-const identRegex =
-  /^[a-zA-Zа-яА-Я_\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u00FF$][a-zA-Zа-яА-Я0-9_\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u00FF$]*$/
+// what an identifier and a number look like, written once: the split regex
+// below carves elements out of the expression with these, and _createToken
+// then re-tests the elements it produced. Two spellings of either would
+// disagree on some input, and each disagreement is an "Invalid expression
+// token" for something the splitter was happy to produce.
+const identChars = String.raw`a-zA-Zа-яА-Я_\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u00FF$`
+const identPattern = `[${identChars}][${identChars}0-9]*`
+// unsigned: whether a leading '-' negates is decided separately, in getTokens
+const numberPattern = String.raw`(?:(?:[0-9]*\.[0-9]+)|[0-9]+)`
+
+const numericRegex = new RegExp(`^-?${numberPattern}$`)
+const identRegex = new RegExp(`^${identPattern}$`)
 const escEscRegex = /\\\\/g
 // a string literal opens with one of exactly two quote characters, so the two
 // unescaping regexes can just be named rather than built and cached per quote
 const escQuoteRegex = { "'": /\\'/g, '"': /\\"/g }
+// the escapes a template string's static text recognizes. One pass, so the
+// backslash an escaped backslash yields can't be re-read as the start of the
+// escape that follows it
+const templateEscRegex = /\\([`$\\])/g
 const whitespaceRegex = /^\s*$/
 const preOpRegexElems = [
   // Template strings
@@ -26,12 +39,7 @@ const preOpRegexElems = [
   String.raw`\btrue\b`,
   String.raw`\bfalse\b`
 ]
-const postOpRegexElems = [
-  // Identifiers
-  '[a-zA-Zа-яА-Я_\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u00FF\\$][a-zA-Z0-9а-яА-Я_\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u00FF\\$]*',
-  // Numerics (without negative symbol)
-  String.raw`(?:(?:[0-9]*\.[0-9]+)|[0-9]+)`
-]
+const postOpRegexElems = [identPattern, numberPattern]
 const unaryMinusToken = (): Token => ({
   type: 'unaryOp',
   value: '-',
@@ -49,14 +57,16 @@ const minusNegatesAfter = new Set([
 ])
 
 /**
- * Lexer is a collection of stateless, statically-accessed functions for the
- * lexical parsing of a Jexl string.  Its responsibility is to identify the
- * "parts of speech" of a Jexl expression, and tokenize and label each, but
- * to do only the most minimal syntax checking; the only errors the Lexer
- * should be concerned with are if it's unable to identify the utility of
- * any of its tokens.  Errors stemming from these tokens not being in a
- * sensible configuration should be left for the Parser to handle.
- * @type {{}}
+ * Lexer handles the lexical parsing of a Jexl string. Its responsibility is to
+ * identify the "parts of speech" of a Jexl expression, and tokenize and label
+ * each, but to do only the most minimal syntax checking; the only errors the
+ * Lexer should be concerned with are if it's unable to identify the utility of
+ * any of its tokens. Errors stemming from these tokens not being in a sensible
+ * configuration should be left for the Parser to handle.
+ *
+ * An instance is bound to one grammar and memoizes the regex that splits an
+ * expression into elements, which is expensive to build; {@link #_clearCache}
+ * discards it when the grammar's elements change.
  */
 class Lexer {
   _grammar: Grammar
@@ -98,37 +108,43 @@ class Lexer {
    */
   getTokens(elements: string[]) {
     const tokens: Token[] = []
-    let negate = false
+    // a prefix minus, held back until the element it applies to is known. It
+    // carries its own raw so that whitespace arriving before that element ("-
+    // 1") accumulates on the minus rather than on the token before it, which
+    // is what lets the parser's error messages quote the expression verbatim.
+    let pendingMinus: Token | undefined
     for (const element of elements) {
       if (this._isWhitespace(element)) {
-        const last = tokens.at(-1)
+        const last = pendingMinus ?? tokens.at(-1)
         if (last) {
           last.raw += element
         }
       } else if (element === '-' && this._isNegative(tokens)) {
         // a second prefix minus in a row ("- -x"): emit the pending one as a
         // unary operator so this one can negate whatever comes next
-        if (negate) {
-          tokens.push(unaryMinusToken())
+        if (pendingMinus) {
+          tokens.push(pendingMinus)
         }
-        negate = true
-      } else if (negate) {
-        negate = false
+        pendingMinus = unaryMinusToken()
+      } else if (pendingMinus) {
         if (numericRegex.exec(element)) {
           // fold the sign into the number, so "-1" stays a single literal
-          tokens.push(this._createToken('-' + element))
+          const token = this._createToken('-' + element)
+          token.raw = pendingMinus.raw + element
+          tokens.push(token)
         } else {
           // anything else gets a standalone prefix operator, letting "-x",
           // "-(a + b)" and "-foo.bar" negate a computed value
-          tokens.push(unaryMinusToken(), this._createToken(element))
+          tokens.push(pendingMinus, this._createToken(element))
         }
+        pendingMinus = undefined
       } else {
         tokens.push(this._createToken(element))
       }
     }
     // Catch a - at the end of the string. Let the parser handle that issue.
-    if (negate) {
-      tokens.push(this._createToken('-'))
+    if (pendingMinus) {
+      tokens.push(pendingMinus)
     }
     return tokens
   }
@@ -256,10 +272,8 @@ class Lexer {
    * @private
    */
   _isNegative(tokens: Token[]) {
-    if (!tokens.length) {
-      return true
-    }
-    return minusNegatesAfter.has(tokens[tokens.length - 1]!.type)
+    const last = tokens.at(-1)
+    return !last || minusNegatesAfter.has(last.type)
   }
 
   /**
@@ -366,10 +380,7 @@ class Lexer {
   }
 
   _unescapeTemplateString(str: string) {
-    return str
-      .replaceAll('\\`', '`')
-      .replaceAll(String.raw`\$`, '$')
-      .replaceAll('\\\\', '\\')
+    return str.replaceAll(templateEscRegex, '$1')
   }
 }
 

package/src/evaluator/compile.ts

@@ -5,13 +5,16 @@
 
 import type { Grammar } from '../grammar.ts'
 import type { AstNode, AstNodeUnion, JexlValue } from '../types.ts'
-import type Evaluator from './Evaluator.ts'
+
+/** The variables an expression is evaluated against. */
+export type Context = Record<string, JexlValue>
 
 /**
- * An AST node lowered to a closure. Calling it with an Evaluator (which carries
- * the context and grammar) produces the node's value.
+ * An AST node lowered to a closure. Calling it with a context produces the
+ * node's value. The grammar is captured when the closure is built, so it is not
+ * a parameter.
  */
-export type CompiledNode = (ev: Evaluator) => JexlValue
+export type CompiledNode = (context: Context) => JexlValue
 
 /**
  * Writes a key that a plain assignment would mishandle. Storing to
@@ -20,11 +23,7 @@ export type CompiledNode = (ev: Evaluator) => JexlValue
  * re-pointed the target's prototype). Defining the property instead matches
  * what `JSON.parse('{"__proto__":1}')` produces: an ordinary own property.
  */
-function defineOwn(
-  target: Record<string, JexlValue>,
-  key: string,
-  value: JexlValue
-) {
+function defineOwn(target: Context, key: string, value: JexlValue) {
   Object.defineProperty(target, key, {
     value,
     writable: true,
@@ -33,14 +32,40 @@ function defineOwn(
   })
 }
 
-function assignOwn(
-  target: Record<string, JexlValue>,
-  key: string,
-  value: JexlValue
-) {
+function assignOwn(target: Context, key: string, value: JexlValue) {
   target[key] = value
 }
 
+/**
+ * The key a bracket index that is neither a string nor a number reads under:
+ * its string form, when it has one worth using.
+ *
+ * A boolean and an array of primitives do — `['a']` is the key `'a'`, exactly
+ * as JS would index by it. A plain object does not, since '[object Object]' is
+ * not a key anything is stored under, so it and an array holding one answer
+ * `undefined` instead; indexing by either reached that lookup and missed
+ * anyway. null and undefined are the same case.
+ */
+function indexKey(value: JexlValue): string | undefined {
+  if (typeof value === 'boolean') {
+    return String(value)
+  }
+  return Array.isArray(value) && value.every(isKeyPart)
+    ? value.join(',')
+    : undefined
+}
+
+function isKeyPart(
+  value: JexlValue
+): value is string | number | boolean | null | undefined {
+  return (
+    value == null ||
+    typeof value === 'string' ||
+    typeof value === 'number' ||
+    typeof value === 'boolean'
+  )
+}
+
 /** Renders an interpolated value for a template literal. */
 function stringify(value: JexlValue) {
   if (value == null) {
@@ -88,21 +113,17 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
     case 'Identifier': {
       const name = node.value
       if (!node.from) {
-        return node.relative
-          ? (ev) => ev._relContext[name]
-          : (ev) => ev._context[name]
+        return (ctx) => ctx[name]
       }
       const from = compileAst(node.from, grammar)
-      return (ev) => {
-        const context = from(ev)
-        if (context == null) {
+      return (ctx) => {
+        const subject = from(ctx)
+        if (subject == null) {
           return undefined
         }
         // an identifier chained off an array reads through its first element
-        const ctx = Array.isArray(context) ? context[0] : context
-        return ctx == null
-          ? undefined
-          : (ctx as Record<string, JexlValue>)[name]
+        const target = Array.isArray(subject) ? subject[0] : subject
+        return target == null ? undefined : (target as Context)[name]
       }
     }
 
@@ -119,18 +140,18 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
       if (evalOnDemand) {
         // operands stay unevaluated behind an `eval` thunk, so operators such
         // as && and || can short-circuit
-        return (ev) =>
-          evalOnDemand({ eval: () => left(ev) }, { eval: () => right(ev) })
+        return (ctx) =>
+          evalOnDemand({ eval: () => left(ctx) }, { eval: () => right(ctx) })
       }
       const fn = op.eval
       if (!fn) {
-        return (ev) => {
-          left(ev)
-          right(ev)
+        return (ctx) => {
+          left(ctx)
+          right(ctx)
           return undefined
         }
       }
-      return (ev) => fn(left(ev), right(ev))
+      return (ctx) => fn(left(ctx), right(ctx))
     }
 
     case 'UnaryExpression': {
@@ -144,12 +165,12 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
             : undefined
       if (!fn) {
         // the operand is still evaluated for an unknown operator, as before
-        return (ev) => {
-          right(ev)
+        return (ctx) => {
+          right(ctx)
           return undefined
         }
       }
-      return (ev) => fn(right(ev))
+      return (ctx) => fn(right(ctx))
     }
 
     case 'ConditionalExpression': {
@@ -160,44 +181,60 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
       const alternate = node.alternate
         ? compileAst(node.alternate, grammar)
         : undefined
-      return (ev) => {
-        const res = test(ev)
+      return (ctx) => {
+        const res = test(ctx)
         if (res) {
           // an omitted consequent ("a ?: b") yields the test result
-          return consequent ? consequent(ev) : res
+          return consequent ? consequent(ctx) : res
         }
-        return alternate ? alternate(ev) : undefined
+        return alternate ? alternate(ctx) : undefined
       }
     }
 
     case 'FilterExpression': {
-      if (node.relative) {
-        // thrown on evaluation rather than compilation, as before
-        return () => {
-          throw new Error('Relative filter expressions are not supported')
-        }
-      }
       const subject = compileAst(node.subject, grammar)
       const index = compileAst(node.expr, grammar)
-      return (ev) => {
-        const subjectVal = subject(ev)
-        const indexVal = index(ev)
+      return (ctx) => {
+        const subjectVal = subject(ctx)
+        const indexVal = index(ctx)
         if (subjectVal == null) {
           return undefined
         }
-        return typeof indexVal === 'string' || typeof indexVal === 'number'
-          ? (subjectVal as Record<string | number, JexlValue>)[indexVal]
-          : undefined
+        if (typeof indexVal === 'string' || typeof indexVal === 'number') {
+          return (subjectVal as Record<string | number, JexlValue>)[indexVal]
+        }
+        // A value with a meaningful string form is indexed by it, which is what
+        // JS does and what this did until the evaluator was lowered to closures
+        // — the tree-walking version was a bare `subject?.[index]`. Answering
+        // `undefined` for everything else reads as a deliberate strictness and
+        // is not: nothing wanted it, and the shape it rejects is common.
+        //
+        // That shape is a one-element array. Every `@gmod/vcf` INFO value is a
+        // list — `Number=1` included, so `CLNSIG=Pathogenic` parses to
+        // `['Pathogenic']` — and the natural way to colour by one is a lookup
+        // table indexed by it. The miss is silent, because such an expression
+        // always carries a `|| fallback` for the values it has no entry for,
+        // and that fallback then answers for every record.
+        //
+        // A multi-valued list still misses — `['a','b']` is the key 'a,b' —
+        // which is the honest answer rather than a lucky one: reading through
+        // to the first element would be the index guessing which value was
+        // meant. `Identifier` above does read through a one-element array, but
+        // it is navigating rather than selecting, so it has nothing to guess.
+        const key = indexKey(indexVal)
+        return key === undefined
+          ? undefined
+          : (subjectVal as Record<string, JexlValue>)[key]
       }
     }
 
     case 'ArrayLiteral': {
       const items = node.value.map((item) => compileAst(item, grammar))
       const len = items.length
-      return (ev) => {
+      return (ctx) => {
         const out: JexlValue[] = new Array(len)
         for (let i = 0; i < len; i++) {
-          out[i] = items[i]!(ev)
+          out[i] = items[i]!(ctx)
         }
         return out
       }
@@ -210,10 +247,10 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
       const len = keys.length
       // resolved once, here, so the common case keeps its plain store
       const store = keys.includes('__proto__') ? defineOwn : assignOwn
-      return (ev) => {
+      return (ctx) => {
         const out: Record<string, JexlValue> = {}
         for (let i = 0; i < len; i++) {
-          store(out, keys[i]!, values[i]!(ev))
+          store(out, keys[i]!, values[i]!(ctx))
         }
         return out
       }
@@ -221,18 +258,18 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
 
     case 'TemplateLiteral': {
       // every part renders to a string, so these are narrower than CompiledNode
-      const parts = node.parts.map((part): ((ev: Evaluator) => string) => {
+      const parts = node.parts.map((part): ((ctx: Context) => string) => {
         if (part.type === 'static') {
           const { value } = part
           return () => value
         }
         const expr = compileAst(part.value, grammar)
-        return (ev) => stringify(expr(ev))
+        return (ctx) => stringify(expr(ctx))
       })
-      return (ev) => {
+      return (ctx) => {
         let out = ''
         for (const part of parts) {
-          out += part(ev)
+          out += part(ctx)
         }
         return out
       }
@@ -245,8 +282,8 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
       // and `constructor` aren't callable as Jexl functions. Resolved per call
       // rather than baked in, since functions are routinely registered after
       // an expression has been compiled.
-      const lookup = (ev: Evaluator) => {
-        const { functions } = ev._grammar
+      const lookup = () => {
+        const { functions } = grammar
         if (!Object.hasOwn(functions, name)) {
           throw new Error(`Jexl Function ${name} is not defined.`)
         }
@@ -256,15 +293,15 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
       // argument array and needs no spread
       switch (args.length) {
         case 0: {
-          return (ev) => lookup(ev)()
+          return () => lookup()()
         }
         case 1: {
           const [a0] = args as [CompiledNode]
-          return (ev) => lookup(ev)(a0(ev))
+          return (ctx) => lookup()(a0(ctx))
         }
         case 2: {
           const [a0, a1] = args as [CompiledNode, CompiledNode]
-          return (ev) => lookup(ev)(a0(ev), a1(ev))
+          return (ctx) => lookup()(a0(ctx), a1(ctx))
         }
         case 3: {
           const [a0, a1, a2] = args as [
@@ -272,16 +309,16 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
             CompiledNode,
             CompiledNode
           ]
-          return (ev) => lookup(ev)(a0(ev), a1(ev), a2(ev))
+          return (ctx) => lookup()(a0(ctx), a1(ctx), a2(ctx))
         }
         default: {
           const len = args.length
-          return (ev) => {
+          return (ctx) => {
             const vals: JexlValue[] = new Array(len)
             for (let i = 0; i < len; i++) {
-              vals[i] = args[i]!(ev)
+              vals[i] = args[i]!(ctx)
             }
-            return lookup(ev)(...vals)
+            return lookup()(...vals)
           }
         }
       }
@@ -290,10 +327,10 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
     case 'SequenceExpression': {
       const exprs = node.expressions.map((expr) => compileAst(expr, grammar))
       const len = exprs.length
-      return (ev) => {
+      return (ctx) => {
         let last: JexlValue
         for (let i = 0; i < len; i++) {
-          last = exprs[i]!(ev)
+          last = exprs[i]!(ctx)
         }
         return last
       }
@@ -303,9 +340,9 @@ export function compileAst(ast: AstNode, grammar: Grammar): CompiledNode {
       const name = node.left.value
       const right = compileAst(node.right!, grammar)
       const store = name === '__proto__' ? defineOwn : assignOwn
-      return (ev) => {
-        const value = right(ev)
-        store(ev._context, name, value)
+      return (ctx) => {
+        const value = right(ctx)
+        store(ctx, name, value)
         return value
       }
     }

package/src/grammar.ts

@@ -231,7 +231,7 @@ export const getGrammar = (): Grammar => ({
 
   /**
    * A map of function names to javascript functions. A Jexl function
-   * takes zero ore more arguemnts:
+   * takes zero or more arguments:
    *
    *     - {*} ...args: A variable number of arguments passed to this function.
    *       All of these are pre-evaluated to their actual values before calling