@vuu-ui/vuu-filters 0.8.4 → 0.8.5-debug

package/cjs/index.js

@@ -1,34 +1,4440 @@
-"use strict";var Br=Object.create;var De=Object.defineProperty;var zr=Object.getOwnPropertyDescriptor;var Qr=Object.getOwnPropertyNames;var Vr=Object.getPrototypeOf,Lr=Object.prototype.hasOwnProperty;var _r=(o,e)=>()=>(e||o((e={exports:{}}).exports,e),e.exports),Ur=(o,e)=>{for(var t in e)De(o,t,{get:e[t],enumerable:!0})},kt=(o,e,t,r)=>{if(e&&typeof e=="object"||typeof e=="function")for(let n of Qr(e))!Lr.call(o,n)&&n!==t&&De(o,n,{get:()=>e[n],enumerable:!(r=zr(e,n))||r.enumerable});return o};var Pt=(o,e,t)=>(t=o!=null?Br(Vr(o)):{},kt(e||!o||!o.__esModule?De(t,"default",{value:o,enumerable:!0}):t,o)),Wr=o=>kt(De({},"__esModule",{value:!0}),o);var Ot=(o,e,t)=>{if(!e.has(o))throw TypeError("Cannot "+t)};var j=(o,e,t)=>(Ot(o,e,"read from private field"),t?t.call(o):e.get(o)),Ft=(o,e,t)=>{if(e.has(o))throw TypeError("Cannot add the same private member more than once");e instanceof WeakSet?e.add(o):e.set(o,t)},qe=(o,e,t,r)=>(Ot(o,e,"write to private field"),r?r.call(o,t):e.set(o,t),t);var bt=_r((Qn,$e)=>{(function(){"use strict";var o={}.hasOwnProperty,e="[native code]";function t(){for(var r=[],n=0;n<arguments.length;n++){var i=arguments[n];if(i){var s=typeof i;if(s==="string"||s==="number")r.push(i);else if(Array.isArray(i)){if(i.length){var l=t.apply(null,i);l&&r.push(l)}}else if(s==="object"){if(i.toString!==Object.prototype.toString&&!i.toString.toString().includes("[native code]")){r.push(i.toString());continue}for(var a in i)o.call(i,a)&&i[a]&&r.push(a)}}}return r.join(" ")}typeof $e<"u"&&$e.exports?(t.default=t,$e.exports=t):typeof define=="function"&&typeof define.amd=="object"&&define.amd?define("classnames",[],function(){return t}):window.classNames=t})()});var zo={};Ur(zo,{AND:()=>D,ColumnFilter:()=>so,ENDS_WITH:()=>Yr,EQUALS:()=>Me,FilterInput:()=>vo,FilterToolbar:()=>Bo,GREATER_THAN:()=>Xr,IN:()=>Mt,LESS_THAN:()=>Zr,OR:()=>Dt,STARTS_WITH:()=>et,addFilter:()=>ve,filterClauses:()=>Bt,filterEquals:()=>Be,filterIncludesColumn:()=>Qt,overrideColName:()=>zt,removeFilter:()=>ro,splitFilterOnColumn:()=>oo,updateFilter:()=>Lt,useCodeMirrorEditor:()=>It,useFilterSuggestionProvider:()=>Eo});module.exports=Wr(zo);var U=require("@heswell/salt-lab"),qt=require("@salt-ds/core");var Ke=require("react/jsx-runtime"),Nt=require("react");function wt(o){var e,t,r="";if(typeof o=="string"||typeof o=="number")r+=o;else if(typeof o=="object")if(Array.isArray(o))for(e=0;e<o.length;e++)o[e]&&(t=wt(o[e]))&&(r&&(r+=" "),r+=t);else for(e in o)o[e]&&(r&&(r+=" "),r+=e);return r}function Tt(){for(var o,e,t=0,r="";t<arguments.length;)(o=arguments[t++])&&(e=wt(o))&&(r&&(r+=" "),r+=e);return r}function At(o,e){e===void 0&&(e={});var t=e.insertAt;if(!(!o||typeof document>"u")){var r=document.head||document.getElementsByTagName("head")[0],n=document.createElement("style");n.type="text/css",t==="top"&&r.firstChild?r.insertBefore(n,r.firstChild):r.appendChild(n),n.styleSheet?n.styleSheet.cssText=o:n.appendChild(document.createTextNode(o))}}var Hr=`/* Style applied to the root element */
-.saltIcon {
-  --icon-color: var(--saltIcon-color, var(--salt-text-secondary-foreground));
-  --icon-size-multiplier: var(--saltIcon-size-multiplier, 1);
-  --icon-base-size: var(--salt-size-icon-base, 12px);
-  /**
-   * Icon size will be the multiplier (an integer from the size prop) * the base size (set by the theme per density)
-   * Icons should never be smaller than 12px for readability so we've added a max() to enforce this
-  */
-  --icon-size: max(calc(var(--icon-base-size) * var(--icon-size-multiplier)), 12px);
-}
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __commonJS = (cb, mod) => function __require() {
+  return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;
+};
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var __accessCheck = (obj, member, msg) => {
+  if (!member.has(obj))
+    throw TypeError("Cannot " + msg);
+};
+var __privateGet = (obj, member, getter) => {
+  __accessCheck(obj, member, "read from private field");
+  return getter ? getter.call(obj) : member.get(obj);
+};
+var __privateAdd = (obj, member, value) => {
+  if (member.has(obj))
+    throw TypeError("Cannot add the same private member more than once");
+  member instanceof WeakSet ? member.add(obj) : member.set(obj, value);
+};
+var __privateSet = (obj, member, value, setter) => {
+  __accessCheck(obj, member, "write to private field");
+  setter ? setter.call(obj, value) : member.set(obj, value);
+  return value;
+};
 
-.saltIcon {
-  fill: var(--saltIcon-color, var(--icon-color));
-  display: inline-block;
-  margin: var(--saltIcon-margin, 0);
-  position: relative;
-  width: var(--icon-size);
-  height: var(--icon-size);
-  min-width: var(--icon-size);
-  min-height: var(--icon-size);
-}
+// ../../node_modules/classnames/index.js
+var require_classnames = __commonJS({
+  "../../node_modules/classnames/index.js"(exports, module2) {
+    (function() {
+      "use strict";
+      var hasOwn = {}.hasOwnProperty;
+      var nativeCodeString = "[native code]";
+      function classNames() {
+        var classes = [];
+        for (var i = 0; i < arguments.length; i++) {
+          var arg = arguments[i];
+          if (!arg)
+            continue;
+          var argType = typeof arg;
+          if (argType === "string" || argType === "number") {
+            classes.push(arg);
+          } else if (Array.isArray(arg)) {
+            if (arg.length) {
+              var inner = classNames.apply(null, arg);
+              if (inner) {
+                classes.push(inner);
+              }
+            }
+          } else if (argType === "object") {
+            if (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes("[native code]")) {
+              classes.push(arg.toString());
+              continue;
+            }
+            for (var key in arg) {
+              if (hasOwn.call(arg, key) && arg[key]) {
+                classes.push(key);
+              }
+            }
+          }
+        }
+        return classes.join(" ");
+      }
+      if (typeof module2 !== "undefined" && module2.exports) {
+        classNames.default = classNames;
+        module2.exports = classNames;
+      } else if (typeof define === "function" && typeof define.amd === "object" && define.amd) {
+        define("classnames", [], function() {
+          return classNames;
+        });
+      } else {
+        window.classNames = classNames;
+      }
+    })();
+  }
+});
+
+// src/index.ts
+var src_exports = {};
+__export(src_exports, {
+  AND: () => AND,
+  ENDS_WITH: () => ENDS_WITH,
+  EQUALS: () => EQUALS,
+  FilterInput: () => FilterInput,
+  FilterToolbar: () => FilterToolbar,
+  GREATER_THAN: () => GREATER_THAN,
+  IN: () => IN,
+  LESS_THAN: () => LESS_THAN,
+  OR: () => OR,
+  STARTS_WITH: () => STARTS_WITH,
+  addFilter: () => addFilter,
+  filterClauses: () => filterClauses,
+  filterEquals: () => filterEquals,
+  filterIncludesColumn: () => filterIncludesColumn,
+  getNumericFilter: () => getNumericFilter,
+  getTypeaheadFilter: () => getTypeaheadFilter,
+  overrideColName: () => overrideColName,
+  removeFilter: () => removeFilter,
+  splitFilterOnColumn: () => splitFilterOnColumn,
+  updateFilter: () => updateFilter,
+  useCodeMirrorEditor: () => useCodeMirrorEditor,
+  useFilterSuggestionProvider: () => useFilterSuggestionProvider
+});
+module.exports = __toCommonJS(src_exports);
 
-.saltIcon:hover {
-  --icon-color: var(--saltIcon-color-hover, var(--salt-text-secondary-foreground));
+// src/filter-input/FilterInput.tsx
+var import_core = require("@salt-ds/core");
+
+// src/filter-input/useCodeMirrorEditor.ts
+var import_vuu_codemirror5 = require("@vuu-ui/vuu-codemirror");
+
+// ../../node_modules/@lezer/common/dist/index.js
+var DefaultBufferLength = 1024;
+var nextPropID = 0;
+var Range = class {
+  constructor(from, to) {
+    this.from = from;
+    this.to = to;
+  }
+};
+var NodeProp = class {
+  /// Create a new node prop type.
+  constructor(config = {}) {
+    this.id = nextPropID++;
+    this.perNode = !!config.perNode;
+    this.deserialize = config.deserialize || (() => {
+      throw new Error("This node type doesn't define a deserialize function");
+    });
+  }
+  /// This is meant to be used with
+  /// [`NodeSet.extend`](#common.NodeSet.extend) or
+  /// [`LRParser.configure`](#lr.ParserConfig.props) to compute
+  /// prop values for each node type in the set. Takes a [match
+  /// object](#common.NodeType^match) or function that returns undefined
+  /// if the node type doesn't get this prop, and the prop's value if
+  /// it does.
+  add(match) {
+    if (this.perNode)
+      throw new RangeError("Can't add per-node props to node types");
+    if (typeof match != "function")
+      match = NodeType.match(match);
+    return (type) => {
+      let result = match(type);
+      return result === void 0 ? null : [this, result];
+    };
+  }
+};
+NodeProp.closedBy = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.openedBy = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.group = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.contextHash = new NodeProp({ perNode: true });
+NodeProp.lookAhead = new NodeProp({ perNode: true });
+NodeProp.mounted = new NodeProp({ perNode: true });
+var noProps = /* @__PURE__ */ Object.create(null);
+var NodeType = class {
+  /// @internal
+  constructor(name, props, id, flags = 0) {
+    this.name = name;
+    this.props = props;
+    this.id = id;
+    this.flags = flags;
+  }
+  /// Define a node type.
+  static define(spec) {
+    let props = spec.props && spec.props.length ? /* @__PURE__ */ Object.create(null) : noProps;
+    let flags = (spec.top ? 1 : 0) | (spec.skipped ? 2 : 0) | (spec.error ? 4 : 0) | (spec.name == null ? 8 : 0);
+    let type = new NodeType(spec.name || "", props, spec.id, flags);
+    if (spec.props)
+      for (let src of spec.props) {
+        if (!Array.isArray(src))
+          src = src(type);
+        if (src) {
+          if (src[0].perNode)
+            throw new RangeError("Can't store a per-node prop on a node type");
+          props[src[0].id] = src[1];
+        }
+      }
+    return type;
+  }
+  /// Retrieves a node prop for this type. Will return `undefined` if
+  /// the prop isn't present on this node.
+  prop(prop) {
+    return this.props[prop.id];
+  }
+  /// True when this is the top node of a grammar.
+  get isTop() {
+    return (this.flags & 1) > 0;
+  }
+  /// True when this node is produced by a skip rule.
+  get isSkipped() {
+    return (this.flags & 2) > 0;
+  }
+  /// Indicates whether this is an error node.
+  get isError() {
+    return (this.flags & 4) > 0;
+  }
+  /// When true, this node type doesn't correspond to a user-declared
+  /// named node, for example because it is used to cache repetition.
+  get isAnonymous() {
+    return (this.flags & 8) > 0;
+  }
+  /// Returns true when this node's name or one of its
+  /// [groups](#common.NodeProp^group) matches the given string.
+  is(name) {
+    if (typeof name == "string") {
+      if (this.name == name)
+        return true;
+      let group = this.prop(NodeProp.group);
+      return group ? group.indexOf(name) > -1 : false;
+    }
+    return this.id == name;
+  }
+  /// Create a function from node types to arbitrary values by
+  /// specifying an object whose property names are node or
+  /// [group](#common.NodeProp^group) names. Often useful with
+  /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple
+  /// names, separated by spaces, in a single property name to map
+  /// multiple node names to a single value.
+  static match(map) {
+    let direct = /* @__PURE__ */ Object.create(null);
+    for (let prop in map)
+      for (let name of prop.split(" "))
+        direct[name] = map[prop];
+    return (node) => {
+      for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {
+        let found = direct[i < 0 ? node.name : groups[i]];
+        if (found)
+          return found;
+      }
+    };
+  }
+};
+NodeType.none = new NodeType(
+  "",
+  /* @__PURE__ */ Object.create(null),
+  0,
+  8
+  /* NodeFlag.Anonymous */
+);
+var NodeSet = class {
+  /// Create a set with the given types. The `id` property of each
+  /// type should correspond to its position within the array.
+  constructor(types) {
+    this.types = types;
+    for (let i = 0; i < types.length; i++)
+      if (types[i].id != i)
+        throw new RangeError("Node type ids should correspond to array positions when creating a node set");
+  }
+  /// Create a copy of this set with some node properties added. The
+  /// arguments to this method can be created with
+  /// [`NodeProp.add`](#common.NodeProp.add).
+  extend(...props) {
+    let newTypes = [];
+    for (let type of this.types) {
+      let newProps = null;
+      for (let source of props) {
+        let add = source(type);
+        if (add) {
+          if (!newProps)
+            newProps = Object.assign({}, type.props);
+          newProps[add[0].id] = add[1];
+        }
+      }
+      newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);
+    }
+    return new NodeSet(newTypes);
+  }
+};
+var CachedNode = /* @__PURE__ */ new WeakMap();
+var CachedInnerNode = /* @__PURE__ */ new WeakMap();
+var IterMode;
+(function(IterMode2) {
+  IterMode2[IterMode2["ExcludeBuffers"] = 1] = "ExcludeBuffers";
+  IterMode2[IterMode2["IncludeAnonymous"] = 2] = "IncludeAnonymous";
+  IterMode2[IterMode2["IgnoreMounts"] = 4] = "IgnoreMounts";
+  IterMode2[IterMode2["IgnoreOverlays"] = 8] = "IgnoreOverlays";
+})(IterMode || (IterMode = {}));
+var Tree = class {
+  /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).
+  constructor(type, children, positions, length, props) {
+    this.type = type;
+    this.children = children;
+    this.positions = positions;
+    this.length = length;
+    this.props = null;
+    if (props && props.length) {
+      this.props = /* @__PURE__ */ Object.create(null);
+      for (let [prop, value] of props)
+        this.props[typeof prop == "number" ? prop : prop.id] = value;
+    }
+  }
+  /// @internal
+  toString() {
+    let mounted = this.prop(NodeProp.mounted);
+    if (mounted && !mounted.overlay)
+      return mounted.tree.toString();
+    let children = "";
+    for (let ch of this.children) {
+      let str = ch.toString();
+      if (str) {
+        if (children)
+          children += ",";
+        children += str;
+      }
+    }
+    return !this.type.name ? children : (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (children.length ? "(" + children + ")" : "");
+  }
+  /// Get a [tree cursor](#common.TreeCursor) positioned at the top of
+  /// the tree. Mode can be used to [control](#common.IterMode) which
+  /// nodes the cursor visits.
+  cursor(mode = 0) {
+    return new TreeCursor(this.topNode, mode);
+  }
+  /// Get a [tree cursor](#common.TreeCursor) pointing into this tree
+  /// at the given position and side (see
+  /// [`moveTo`](#common.TreeCursor.moveTo).
+  cursorAt(pos, side = 0, mode = 0) {
+    let scope = CachedNode.get(this) || this.topNode;
+    let cursor = new TreeCursor(scope);
+    cursor.moveTo(pos, side);
+    CachedNode.set(this, cursor._tree);
+    return cursor;
+  }
+  /// Get a [syntax node](#common.SyntaxNode) object for the top of the
+  /// tree.
+  get topNode() {
+    return new TreeNode(this, 0, 0, null);
+  }
+  /// Get the [syntax node](#common.SyntaxNode) at the given position.
+  /// If `side` is -1, this will move into nodes that end at the
+  /// position. If 1, it'll move into nodes that start at the
+  /// position. With 0, it'll only enter nodes that cover the position
+  /// from both sides.
+  ///
+  /// Note that this will not enter
+  /// [overlays](#common.MountedTree.overlay), and you often want
+  /// [`resolveInner`](#common.Tree.resolveInner) instead.
+  resolve(pos, side = 0) {
+    let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);
+    CachedNode.set(this, node);
+    return node;
+  }
+  /// Like [`resolve`](#common.Tree.resolve), but will enter
+  /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node
+  /// pointing into the innermost overlaid tree at the given position
+  /// (with parent links going through all parent structure, including
+  /// the host trees).
+  resolveInner(pos, side = 0) {
+    let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);
+    CachedInnerNode.set(this, node);
+    return node;
+  }
+  /// Iterate over the tree and its children, calling `enter` for any
+  /// node that touches the `from`/`to` region (if given) before
+  /// running over such a node's children, and `leave` (if given) when
+  /// leaving the node. When `enter` returns `false`, that node will
+  /// not have its children iterated over (or `leave` called).
+  iterate(spec) {
+    let { enter, leave, from = 0, to = this.length } = spec;
+    let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;
+    for (let c = this.cursor(mode | IterMode.IncludeAnonymous); ; ) {
+      let entered = false;
+      if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {
+        if (c.firstChild())
+          continue;
+        entered = true;
+      }
+      for (; ; ) {
+        if (entered && leave && (anon || !c.type.isAnonymous))
+          leave(c);
+        if (c.nextSibling())
+          break;
+        if (!c.parent())
+          return;
+        entered = true;
+      }
+    }
+  }
+  /// Get the value of the given [node prop](#common.NodeProp) for this
+  /// node. Works with both per-node and per-type props.
+  prop(prop) {
+    return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : void 0;
+  }
+  /// Returns the node's [per-node props](#common.NodeProp.perNode) in a
+  /// format that can be passed to the [`Tree`](#common.Tree)
+  /// constructor.
+  get propValues() {
+    let result = [];
+    if (this.props)
+      for (let id in this.props)
+        result.push([+id, this.props[id]]);
+    return result;
+  }
+  /// Balance the direct children of this tree, producing a copy of
+  /// which may have children grouped into subtrees with type
+  /// [`NodeType.none`](#common.NodeType^none).
+  balance(config = {}) {
+    return this.children.length <= 8 ? this : balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));
+  }
+  /// Build a tree from a postfix-ordered buffer of node information,
+  /// or a cursor over such a buffer.
+  static build(data) {
+    return buildTree(data);
+  }
+};
+Tree.empty = new Tree(NodeType.none, [], [], 0);
+var FlatBufferCursor = class {
+  constructor(buffer, index) {
+    this.buffer = buffer;
+    this.index = index;
+  }
+  get id() {
+    return this.buffer[this.index - 4];
+  }
+  get start() {
+    return this.buffer[this.index - 3];
+  }
+  get end() {
+    return this.buffer[this.index - 2];
+  }
+  get size() {
+    return this.buffer[this.index - 1];
+  }
+  get pos() {
+    return this.index;
+  }
+  next() {
+    this.index -= 4;
+  }
+  fork() {
+    return new FlatBufferCursor(this.buffer, this.index);
+  }
+};
+var TreeBuffer = class {
+  /// Create a tree buffer.
+  constructor(buffer, length, set) {
+    this.buffer = buffer;
+    this.length = length;
+    this.set = set;
+  }
+  /// @internal
+  get type() {
+    return NodeType.none;
+  }
+  /// @internal
+  toString() {
+    let result = [];
+    for (let index = 0; index < this.buffer.length; ) {
+      result.push(this.childString(index));
+      index = this.buffer[index + 3];
+    }
+    return result.join(",");
+  }
+  /// @internal
+  childString(index) {
+    let id = this.buffer[index], endIndex = this.buffer[index + 3];
+    let type = this.set.types[id], result = type.name;
+    if (/\W/.test(result) && !type.isError)
+      result = JSON.stringify(result);
+    index += 4;
+    if (endIndex == index)
+      return result;
+    let children = [];
+    while (index < endIndex) {
+      children.push(this.childString(index));
+      index = this.buffer[index + 3];
+    }
+    return result + "(" + children.join(",") + ")";
+  }
+  /// @internal
+  findChild(startIndex, endIndex, dir, pos, side) {
+    let { buffer } = this, pick = -1;
+    for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {
+      if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {
+        pick = i;
+        if (dir > 0)
+          break;
+      }
+    }
+    return pick;
+  }
+  /// @internal
+  slice(startI, endI, from) {
+    let b = this.buffer;
+    let copy = new Uint16Array(endI - startI), len = 0;
+    for (let i = startI, j = 0; i < endI; ) {
+      copy[j++] = b[i++];
+      copy[j++] = b[i++] - from;
+      let to = copy[j++] = b[i++] - from;
+      copy[j++] = b[i++] - startI;
+      len = Math.max(len, to);
+    }
+    return new TreeBuffer(copy, len, this.set);
+  }
+};
+function checkSide(side, pos, from, to) {
+  switch (side) {
+    case -2:
+      return from < pos;
+    case -1:
+      return to >= pos && from < pos;
+    case 0:
+      return from < pos && to > pos;
+    case 1:
+      return from <= pos && to > pos;
+    case 2:
+      return to > pos;
+    case 4:
+      return true;
+  }
+}
+function enterUnfinishedNodesBefore(node, pos) {
+  let scan = node.childBefore(pos);
+  while (scan) {
+    let last = scan.lastChild;
+    if (!last || last.to != scan.to)
+      break;
+    if (last.type.isError && last.from == last.to) {
+      node = scan;
+      scan = last.prevSibling;
+    } else {
+      scan = last;
+    }
+  }
+  return node;
+}
+function resolveNode(node, pos, side, overlays) {
+  var _a;
+  while (node.from == node.to || (side < 1 ? node.from >= pos : node.from > pos) || (side > -1 ? node.to <= pos : node.to < pos)) {
+    let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;
+    if (!parent)
+      return node;
+    node = parent;
+  }
+  let mode = overlays ? 0 : IterMode.IgnoreOverlays;
+  if (overlays)
+    for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {
+      if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)
+        node = parent;
+    }
+  for (; ; ) {
+    let inner = node.enter(pos, side, mode);
+    if (!inner)
+      return node;
+    node = inner;
+  }
+}
+var TreeNode = class {
+  constructor(_tree, from, index, _parent) {
+    this._tree = _tree;
+    this.from = from;
+    this.index = index;
+    this._parent = _parent;
+  }
+  get type() {
+    return this._tree.type;
+  }
+  get name() {
+    return this._tree.type.name;
+  }
+  get to() {
+    return this.from + this._tree.length;
+  }
+  nextChild(i, dir, pos, side, mode = 0) {
+    for (let parent = this; ; ) {
+      for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {
+        let next = children[i], start = positions[i] + parent.from;
+        if (!checkSide(side, pos, start, start + next.length))
+          continue;
+        if (next instanceof TreeBuffer) {
+          if (mode & IterMode.ExcludeBuffers)
+            continue;
+          let index = next.findChild(0, next.buffer.length, dir, pos - start, side);
+          if (index > -1)
+            return new BufferNode(new BufferContext(parent, next, i, start), null, index);
+        } else if (mode & IterMode.IncludeAnonymous || (!next.type.isAnonymous || hasChild(next))) {
+          let mounted;
+          if (!(mode & IterMode.IgnoreMounts) && next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)
+            return new TreeNode(mounted.tree, start, i, parent);
+          let inner = new TreeNode(next, start, i, parent);
+          return mode & IterMode.IncludeAnonymous || !inner.type.isAnonymous ? inner : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);
+        }
+      }
+      if (mode & IterMode.IncludeAnonymous || !parent.type.isAnonymous)
+        return null;
+      if (parent.index >= 0)
+        i = parent.index + dir;
+      else
+        i = dir < 0 ? -1 : parent._parent._tree.children.length;
+      parent = parent._parent;
+      if (!parent)
+        return null;
+    }
+  }
+  get firstChild() {
+    return this.nextChild(
+      0,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get lastChild() {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  childAfter(pos) {
+    return this.nextChild(
+      0,
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  childBefore(pos) {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  enter(pos, side, mode = 0) {
+    let mounted;
+    if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {
+      let rPos = pos - this.from;
+      for (let { from, to } of mounted.overlay) {
+        if ((side > 0 ? from <= rPos : from < rPos) && (side < 0 ? to >= rPos : to > rPos))
+          return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);
+      }
+    }
+    return this.nextChild(0, 1, pos, side, mode);
+  }
+  nextSignificantParent() {
+    let val = this;
+    while (val.type.isAnonymous && val._parent)
+      val = val._parent;
+    return val;
+  }
+  get parent() {
+    return this._parent ? this._parent.nextSignificantParent() : null;
+  }
+  get nextSibling() {
+    return this._parent && this.index >= 0 ? this._parent.nextChild(
+      this.index + 1,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    ) : null;
+  }
+  get prevSibling() {
+    return this._parent && this.index >= 0 ? this._parent.nextChild(
+      this.index - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    ) : null;
+  }
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  get tree() {
+    return this._tree;
+  }
+  toTree() {
+    return this._tree;
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
+  }
+  getChild(type, before = null, after = null) {
+    let r = getChildren(this, type, before, after);
+    return r.length ? r[0] : null;
+  }
+  getChildren(type, before = null, after = null) {
+    return getChildren(this, type, before, after);
+  }
+  /// @internal
+  toString() {
+    return this._tree.toString();
+  }
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
+  }
+};
+function getChildren(node, type, before, after) {
+  let cur = node.cursor(), result = [];
+  if (!cur.firstChild())
+    return result;
+  if (before != null) {
+    while (!cur.type.is(before))
+      if (!cur.nextSibling())
+        return result;
+  }
+  for (; ; ) {
+    if (after != null && cur.type.is(after))
+      return result;
+    if (cur.type.is(type))
+      result.push(cur.node);
+    if (!cur.nextSibling())
+      return after == null ? result : [];
+  }
+}
+function matchNodeContext(node, context, i = context.length - 1) {
+  for (let p = node.parent; i >= 0; p = p.parent) {
+    if (!p)
+      return false;
+    if (!p.type.isAnonymous) {
+      if (context[i] && context[i] != p.name)
+        return false;
+      i--;
+    }
+  }
+  return true;
+}
+var BufferContext = class {
+  constructor(parent, buffer, index, start) {
+    this.parent = parent;
+    this.buffer = buffer;
+    this.index = index;
+    this.start = start;
+  }
+};
+var BufferNode = class {
+  get name() {
+    return this.type.name;
+  }
+  get from() {
+    return this.context.start + this.context.buffer.buffer[this.index + 1];
+  }
+  get to() {
+    return this.context.start + this.context.buffer.buffer[this.index + 2];
+  }
+  constructor(context, _parent, index) {
+    this.context = context;
+    this._parent = _parent;
+    this.index = index;
+    this.type = context.buffer.set.types[context.buffer.buffer[index]];
+  }
+  child(dir, pos, side) {
+    let { buffer } = this.context;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);
+    return index < 0 ? null : new BufferNode(this.context, this, index);
+  }
+  get firstChild() {
+    return this.child(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get lastChild() {
+    return this.child(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  childAfter(pos) {
+    return this.child(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  childBefore(pos) {
+    return this.child(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  enter(pos, side, mode = 0) {
+    if (mode & IterMode.ExcludeBuffers)
+      return null;
+    let { buffer } = this.context;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);
+    return index < 0 ? null : new BufferNode(this.context, this, index);
+  }
+  get parent() {
+    return this._parent || this.context.parent.nextSignificantParent();
+  }
+  externalSibling(dir) {
+    return this._parent ? null : this.context.parent.nextChild(
+      this.context.index + dir,
+      dir,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get nextSibling() {
+    let { buffer } = this.context;
+    let after = buffer.buffer[this.index + 3];
+    if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))
+      return new BufferNode(this.context, this._parent, after);
+    return this.externalSibling(1);
+  }
+  get prevSibling() {
+    let { buffer } = this.context;
+    let parentStart = this._parent ? this._parent.index + 4 : 0;
+    if (this.index == parentStart)
+      return this.externalSibling(-1);
+    return new BufferNode(this.context, this._parent, buffer.findChild(
+      parentStart,
+      this.index,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    ));
+  }
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  get tree() {
+    return null;
+  }
+  toTree() {
+    let children = [], positions = [];
+    let { buffer } = this.context;
+    let startI = this.index + 4, endI = buffer.buffer[this.index + 3];
+    if (endI > startI) {
+      let from = buffer.buffer[this.index + 1];
+      children.push(buffer.slice(startI, endI, from));
+      positions.push(0);
+    }
+    return new Tree(this.type, children, positions, this.to - this.from);
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
+  }
+  /// @internal
+  toString() {
+    return this.context.buffer.childString(this.index);
+  }
+  getChild(type, before = null, after = null) {
+    let r = getChildren(this, type, before, after);
+    return r.length ? r[0] : null;
+  }
+  getChildren(type, before = null, after = null) {
+    return getChildren(this, type, before, after);
+  }
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
+  }
+};
+var TreeCursor = class {
+  /// Shorthand for `.type.name`.
+  get name() {
+    return this.type.name;
+  }
+  /// @internal
+  constructor(node, mode = 0) {
+    this.mode = mode;
+    this.buffer = null;
+    this.stack = [];
+    this.index = 0;
+    this.bufferNode = null;
+    if (node instanceof TreeNode) {
+      this.yieldNode(node);
+    } else {
+      this._tree = node.context.parent;
+      this.buffer = node.context;
+      for (let n = node._parent; n; n = n._parent)
+        this.stack.unshift(n.index);
+      this.bufferNode = node;
+      this.yieldBuf(node.index);
+    }
+  }
+  yieldNode(node) {
+    if (!node)
+      return false;
+    this._tree = node;
+    this.type = node.type;
+    this.from = node.from;
+    this.to = node.to;
+    return true;
+  }
+  yieldBuf(index, type) {
+    this.index = index;
+    let { start, buffer } = this.buffer;
+    this.type = type || buffer.set.types[buffer.buffer[index]];
+    this.from = start + buffer.buffer[index + 1];
+    this.to = start + buffer.buffer[index + 2];
+    return true;
+  }
+  yield(node) {
+    if (!node)
+      return false;
+    if (node instanceof TreeNode) {
+      this.buffer = null;
+      return this.yieldNode(node);
+    }
+    this.buffer = node.context;
+    return this.yieldBuf(node.index, node.type);
+  }
+  /// @internal
+  toString() {
+    return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();
+  }
+  /// @internal
+  enterChild(dir, pos, side) {
+    if (!this.buffer)
+      return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));
+    let { buffer } = this.buffer;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);
+    if (index < 0)
+      return false;
+    this.stack.push(this.index);
+    return this.yieldBuf(index);
+  }
+  /// Move the cursor to this node's first child. When this returns
+  /// false, the node has no child, and the cursor has not been moved.
+  firstChild() {
+    return this.enterChild(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  /// Move the cursor to this node's last child.
+  lastChild() {
+    return this.enterChild(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  /// Move the cursor to the first child that ends after `pos`.
+  childAfter(pos) {
+    return this.enterChild(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  /// Move to the last child that starts before `pos`.
+  childBefore(pos) {
+    return this.enterChild(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  /// Move the cursor to the child around `pos`. If side is -1 the
+  /// child may end at that position, when 1 it may start there. This
+  /// will also enter [overlaid](#common.MountedTree.overlay)
+  /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is
+  /// set to false.
+  enter(pos, side, mode = this.mode) {
+    if (!this.buffer)
+      return this.yield(this._tree.enter(pos, side, mode));
+    return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);
+  }
+  /// Move to the node's parent node, if this isn't the top node.
+  parent() {
+    if (!this.buffer)
+      return this.yieldNode(this.mode & IterMode.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+    if (this.stack.length)
+      return this.yieldBuf(this.stack.pop());
+    let parent = this.mode & IterMode.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+    this.buffer = null;
+    return this.yieldNode(parent);
+  }
+  /// @internal
+  sibling(dir) {
+    if (!this.buffer)
+      return !this._tree._parent ? false : this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4, this.mode));
+    let { buffer } = this.buffer, d = this.stack.length - 1;
+    if (dir < 0) {
+      let parentStart = d < 0 ? 0 : this.stack[d] + 4;
+      if (this.index != parentStart)
+        return this.yieldBuf(buffer.findChild(
+          parentStart,
+          this.index,
+          -1,
+          0,
+          4
+          /* Side.DontCare */
+        ));
+    } else {
+      let after = buffer.buffer[this.index + 3];
+      if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))
+        return this.yieldBuf(after);
+    }
+    return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4, this.mode)) : false;
+  }
+  /// Move to this node's next sibling, if any.
+  nextSibling() {
+    return this.sibling(1);
+  }
+  /// Move to this node's previous sibling, if any.
+  prevSibling() {
+    return this.sibling(-1);
+  }
+  atLastNode(dir) {
+    let index, parent, { buffer } = this;
+    if (buffer) {
+      if (dir > 0) {
+        if (this.index < buffer.buffer.buffer.length)
+          return false;
+      } else {
+        for (let i = 0; i < this.index; i++)
+          if (buffer.buffer.buffer[i + 3] < this.index)
+            return false;
+      }
+      ({ index, parent } = buffer);
+    } else {
+      ({ index, _parent: parent } = this._tree);
+    }
+    for (; parent; { index, _parent: parent } = parent) {
+      if (index > -1)
+        for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {
+          let child = parent._tree.children[i];
+          if (this.mode & IterMode.IncludeAnonymous || child instanceof TreeBuffer || !child.type.isAnonymous || hasChild(child))
+            return false;
+        }
+    }
+    return true;
+  }
+  move(dir, enter) {
+    if (enter && this.enterChild(
+      dir,
+      0,
+      4
+      /* Side.DontCare */
+    ))
+      return true;
+    for (; ; ) {
+      if (this.sibling(dir))
+        return true;
+      if (this.atLastNode(dir) || !this.parent())
+        return false;
+    }
+  }
+  /// Move to the next node in a
+  /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)
+  /// traversal, going from a node to its first child or, if the
+  /// current node is empty or `enter` is false, its next sibling or
+  /// the next sibling of the first parent node that has one.
+  next(enter = true) {
+    return this.move(1, enter);
+  }
+  /// Move to the next node in a last-to-first pre-order traveral. A
+  /// node is followed by its last child or, if it has none, its
+  /// previous sibling or the previous sibling of the first parent
+  /// node that has one.
+  prev(enter = true) {
+    return this.move(-1, enter);
+  }
+  /// Move the cursor to the innermost node that covers `pos`. If
+  /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,
+  /// it will enter nodes that start at `pos`.
+  moveTo(pos, side = 0) {
+    while (this.from == this.to || (side < 1 ? this.from >= pos : this.from > pos) || (side > -1 ? this.to <= pos : this.to < pos))
+      if (!this.parent())
+        break;
+    while (this.enterChild(1, pos, side)) {
+    }
+    return this;
+  }
+  /// Get a [syntax node](#common.SyntaxNode) at the cursor's current
+  /// position.
+  get node() {
+    if (!this.buffer)
+      return this._tree;
+    let cache = this.bufferNode, result = null, depth = 0;
+    if (cache && cache.context == this.buffer) {
+      scan:
+        for (let index = this.index, d = this.stack.length; d >= 0; ) {
+          for (let c = cache; c; c = c._parent)
+            if (c.index == index) {
+              if (index == this.index)
+                return c;
+              result = c;
+              depth = d + 1;
+              break scan;
+            }
+          index = this.stack[--d];
+        }
+    }
+    for (let i = depth; i < this.stack.length; i++)
+      result = new BufferNode(this.buffer, result, this.stack[i]);
+    return this.bufferNode = new BufferNode(this.buffer, result, this.index);
+  }
+  /// Get the [tree](#common.Tree) that represents the current node, if
+  /// any. Will return null when the node is in a [tree
+  /// buffer](#common.TreeBuffer).
+  get tree() {
+    return this.buffer ? null : this._tree._tree;
+  }
+  /// Iterate over the current node and all its descendants, calling
+  /// `enter` when entering a node and `leave`, if given, when leaving
+  /// one. When `enter` returns `false`, any children of that node are
+  /// skipped, and `leave` isn't called for it.
+  iterate(enter, leave) {
+    for (let depth = 0; ; ) {
+      let mustLeave = false;
+      if (this.type.isAnonymous || enter(this) !== false) {
+        if (this.firstChild()) {
+          depth++;
+          continue;
+        }
+        if (!this.type.isAnonymous)
+          mustLeave = true;
+      }
+      for (; ; ) {
+        if (mustLeave && leave)
+          leave(this);
+        mustLeave = this.type.isAnonymous;
+        if (this.nextSibling())
+          break;
+        if (!depth)
+          return;
+        this.parent();
+        depth--;
+        mustLeave = true;
+      }
+    }
+  }
+  /// Test whether the current node matches a given context—a sequence
+  /// of direct parent node names. Empty strings in the context array
+  /// are treated as wildcards.
+  matchContext(context) {
+    if (!this.buffer)
+      return matchNodeContext(this.node, context);
+    let { buffer } = this.buffer, { types } = buffer.set;
+    for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {
+      if (d < 0)
+        return matchNodeContext(this.node, context, i);
+      let type = types[buffer.buffer[this.stack[d]]];
+      if (!type.isAnonymous) {
+        if (context[i] && context[i] != type.name)
+          return false;
+        i--;
+      }
+    }
+    return true;
+  }
+};
+function hasChild(tree) {
+  return tree.children.some((ch) => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));
+}
+function buildTree(data) {
+  var _a;
+  let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;
+  let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;
+  let types = nodeSet.types;
+  let contextHash = 0, lookAhead = 0;
+  function takeNode(parentStart, minPos, children2, positions2, inRepeat) {
+    let { id, start, end, size } = cursor;
+    let lookAheadAtStart = lookAhead;
+    while (size < 0) {
+      cursor.next();
+      if (size == -1) {
+        let node2 = reused[id];
+        children2.push(node2);
+        positions2.push(start - parentStart);
+        return;
+      } else if (size == -3) {
+        contextHash = id;
+        return;
+      } else if (size == -4) {
+        lookAhead = id;
+        return;
+      } else {
+        throw new RangeError(`Unrecognized record size: ${size}`);
+      }
+    }
+    let type = types[id], node, buffer2;
+    let startPos = start - parentStart;
+    if (end - start <= maxBufferLength && (buffer2 = findBufferSize(cursor.pos - minPos, inRepeat))) {
+      let data2 = new Uint16Array(buffer2.size - buffer2.skip);
+      let endPos = cursor.pos - buffer2.size, index = data2.length;
+      while (cursor.pos > endPos)
+        index = copyToBuffer(buffer2.start, data2, index);
+      node = new TreeBuffer(data2, end - buffer2.start, nodeSet);
+      startPos = buffer2.start - parentStart;
+    } else {
+      let endPos = cursor.pos - size;
+      cursor.next();
+      let localChildren = [], localPositions = [];
+      let localInRepeat = id >= minRepeatType ? id : -1;
+      let lastGroup = 0, lastEnd = end;
+      while (cursor.pos > endPos) {
+        if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {
+          if (cursor.end <= lastEnd - maxBufferLength) {
+            makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);
+            lastGroup = localChildren.length;
+            lastEnd = cursor.end;
+          }
+          cursor.next();
+        } else {
+          takeNode(start, endPos, localChildren, localPositions, localInRepeat);
+        }
+      }
+      if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)
+        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);
+      localChildren.reverse();
+      localPositions.reverse();
+      if (localInRepeat > -1 && lastGroup > 0) {
+        let make = makeBalanced(type);
+        node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);
+      } else {
+        node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);
+      }
+    }
+    children2.push(node);
+    positions2.push(startPos);
+  }
+  function makeBalanced(type) {
+    return (children2, positions2, length2) => {
+      let lookAhead2 = 0, lastI = children2.length - 1, last, lookAheadProp;
+      if (lastI >= 0 && (last = children2[lastI]) instanceof Tree) {
+        if (!lastI && last.type == type && last.length == length2)
+          return last;
+        if (lookAheadProp = last.prop(NodeProp.lookAhead))
+          lookAhead2 = positions2[lastI] + last.length + lookAheadProp;
+      }
+      return makeTree(type, children2, positions2, length2, lookAhead2);
+    };
+  }
+  function makeRepeatLeaf(children2, positions2, base, i, from, to, type, lookAhead2) {
+    let localChildren = [], localPositions = [];
+    while (children2.length > i) {
+      localChildren.push(children2.pop());
+      localPositions.push(positions2.pop() + base - from);
+    }
+    children2.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead2 - to));
+    positions2.push(from - base);
+  }
+  function makeTree(type, children2, positions2, length2, lookAhead2 = 0, props) {
+    if (contextHash) {
+      let pair2 = [NodeProp.contextHash, contextHash];
+      props = props ? [pair2].concat(props) : [pair2];
+    }
+    if (lookAhead2 > 25) {
+      let pair2 = [NodeProp.lookAhead, lookAhead2];
+      props = props ? [pair2].concat(props) : [pair2];
+    }
+    return new Tree(type, children2, positions2, length2, props);
+  }
+  function findBufferSize(maxSize, inRepeat) {
+    let fork = cursor.fork();
+    let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;
+    let result = { size: 0, start: 0, skip: 0 };
+    scan:
+      for (let minPos = fork.pos - maxSize; fork.pos > minPos; ) {
+        let nodeSize2 = fork.size;
+        if (fork.id == inRepeat && nodeSize2 >= 0) {
+          result.size = size;
+          result.start = start;
+          result.skip = skip;
+          skip += 4;
+          size += 4;
+          fork.next();
+          continue;
+        }
+        let startPos = fork.pos - nodeSize2;
+        if (nodeSize2 < 0 || startPos < minPos || fork.start < minStart)
+          break;
+        let localSkipped = fork.id >= minRepeatType ? 4 : 0;
+        let nodeStart = fork.start;
+        fork.next();
+        while (fork.pos > startPos) {
+          if (fork.size < 0) {
+            if (fork.size == -3)
+              localSkipped += 4;
+            else
+              break scan;
+          } else if (fork.id >= minRepeatType) {
+            localSkipped += 4;
+          }
+          fork.next();
+        }
+        start = nodeStart;
+        size += nodeSize2;
+        skip += localSkipped;
+      }
+    if (inRepeat < 0 || size == maxSize) {
+      result.size = size;
+      result.start = start;
+      result.skip = skip;
+    }
+    return result.size > 4 ? result : void 0;
+  }
+  function copyToBuffer(bufferStart, buffer2, index) {
+    let { id, start, end, size } = cursor;
+    cursor.next();
+    if (size >= 0 && id < minRepeatType) {
+      let startIndex = index;
+      if (size > 4) {
+        let endPos = cursor.pos - (size - 4);
+        while (cursor.pos > endPos)
+          index = copyToBuffer(bufferStart, buffer2, index);
+      }
+      buffer2[--index] = startIndex;
+      buffer2[--index] = end - bufferStart;
+      buffer2[--index] = start - bufferStart;
+      buffer2[--index] = id;
+    } else if (size == -3) {
+      contextHash = id;
+    } else if (size == -4) {
+      lookAhead = id;
+    }
+    return index;
+  }
+  let children = [], positions = [];
+  while (cursor.pos > 0)
+    takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);
+  let length = (_a = data.length) !== null && _a !== void 0 ? _a : children.length ? positions[0] + children[0].length : 0;
+  return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);
 }
+var nodeSizeCache = /* @__PURE__ */ new WeakMap();
+function nodeSize(balanceType, node) {
+  if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)
+    return 1;
+  let size = nodeSizeCache.get(node);
+  if (size == null) {
+    size = 1;
+    for (let child of node.children) {
+      if (child.type != balanceType || !(child instanceof Tree)) {
+        size = 1;
+        break;
+      }
+      size += nodeSize(balanceType, child);
+    }
+    nodeSizeCache.set(node, size);
+  }
+  return size;
+}
+function balanceRange(balanceType, children, positions, from, to, start, length, mkTop, mkTree) {
+  let total = 0;
+  for (let i = from; i < to; i++)
+    total += nodeSize(balanceType, children[i]);
+  let maxChild = Math.ceil(
+    total * 1.5 / 8
+    /* Balance.BranchFactor */
+  );
+  let localChildren = [], localPositions = [];
+  function divide(children2, positions2, from2, to2, offset) {
+    for (let i = from2; i < to2; ) {
+      let groupFrom = i, groupStart = positions2[i], groupSize = nodeSize(balanceType, children2[i]);
+      i++;
+      for (; i < to2; i++) {
+        let nextSize = nodeSize(balanceType, children2[i]);
+        if (groupSize + nextSize >= maxChild)
+          break;
+        groupSize += nextSize;
+      }
+      if (i == groupFrom + 1) {
+        if (groupSize > maxChild) {
+          let only = children2[groupFrom];
+          divide(only.children, only.positions, 0, only.children.length, positions2[groupFrom] + offset);
+          continue;
+        }
+        localChildren.push(children2[groupFrom]);
+      } else {
+        let length2 = positions2[i - 1] + children2[i - 1].length - groupStart;
+        localChildren.push(balanceRange(balanceType, children2, positions2, groupFrom, i, groupStart, length2, null, mkTree));
+      }
+      localPositions.push(groupStart + offset - start);
+    }
+  }
+  divide(children, positions, from, to, 0);
+  return (mkTop || mkTree)(localChildren, localPositions, length);
+}
+var Parser = class {
+  /// Start a parse, returning a [partial parse](#common.PartialParse)
+  /// object. [`fragments`](#common.TreeFragment) can be passed in to
+  /// make the parse incremental.
+  ///
+  /// By default, the entire input is parsed. You can pass `ranges`,
+  /// which should be a sorted array of non-empty, non-overlapping
+  /// ranges, to parse only those ranges. The tree returned in that
+  /// case will start at `ranges[0].from`.
+  startParse(input, fragments, ranges) {
+    if (typeof input == "string")
+      input = new StringInput(input);
+    ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map((r) => new Range(r.from, r.to)) : [new Range(0, 0)];
+    return this.createParse(input, fragments || [], ranges);
+  }
+  /// Run a full parse, returning the resulting tree.
+  parse(input, fragments, ranges) {
+    let parse = this.startParse(input, fragments, ranges);
+    for (; ; ) {
+      let done = parse.advance();
+      if (done)
+        return done;
+    }
+  }
+};
+var StringInput = class {
+  constructor(string) {
+    this.string = string;
+  }
+  get length() {
+    return this.string.length;
+  }
+  chunk(from) {
+    return this.string.slice(from);
+  }
+  get lineChunks() {
+    return false;
+  }
+  read(from, to) {
+    return this.string.slice(from, to);
+  }
+};
+var stoppedInner = new NodeProp({ perNode: true });
 
-.saltIcon:active {
-  --icon-color: var(--saltIcon-color-active, var(--salt-text-secondary-foreground));
+// ../../node_modules/@lezer/lr/dist/index.js
+var Stack = class {
+  /// @internal
+  constructor(p, stack, state, reducePos, pos, score, buffer, bufferBase, curContext, lookAhead = 0, parent) {
+    this.p = p;
+    this.stack = stack;
+    this.state = state;
+    this.reducePos = reducePos;
+    this.pos = pos;
+    this.score = score;
+    this.buffer = buffer;
+    this.bufferBase = bufferBase;
+    this.curContext = curContext;
+    this.lookAhead = lookAhead;
+    this.parent = parent;
+  }
+  /// @internal
+  toString() {
+    return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? "!" + this.score : ""}`;
+  }
+  // Start an empty stack
+  /// @internal
+  static start(p, state, pos = 0) {
+    let cx3 = p.parser.context;
+    return new Stack(p, [], state, pos, pos, 0, [], 0, cx3 ? new StackContext(cx3, cx3.start) : null, 0, null);
+  }
+  /// The stack's current [context](#lr.ContextTracker) value, if
+  /// any. Its type will depend on the context tracker's type
+  /// parameter, or it will be `null` if there is no context
+  /// tracker.
+  get context() {
+    return this.curContext ? this.curContext.context : null;
+  }
+  // Push a state onto the stack, tracking its start position as well
+  // as the buffer base at that point.
+  /// @internal
+  pushState(state, start) {
+    this.stack.push(this.state, start, this.bufferBase + this.buffer.length);
+    this.state = state;
+  }
+  // Apply a reduce action
+  /// @internal
+  reduce(action) {
+    var _a;
+    let depth = action >> 19, type = action & 65535;
+    let { parser: parser2 } = this.p;
+    let dPrec = parser2.dynamicPrecedence(type);
+    if (dPrec)
+      this.score += dPrec;
+    if (depth == 0) {
+      this.pushState(parser2.getGoto(this.state, type, true), this.reducePos);
+      if (type < parser2.minRepeatTerm)
+        this.storeNode(type, this.reducePos, this.reducePos, 4, true);
+      this.reduceContext(type, this.reducePos);
+      return;
+    }
+    let base = this.stack.length - (depth - 1) * 3 - (action & 262144 ? 6 : 0);
+    let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;
+    if (size >= 2e3 && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {
+      if (start == this.p.lastBigReductionStart) {
+        this.p.bigReductionCount++;
+        this.p.lastBigReductionSize = size;
+      } else if (this.p.lastBigReductionSize < size) {
+        this.p.bigReductionCount = 1;
+        this.p.lastBigReductionStart = start;
+        this.p.lastBigReductionSize = size;
+      }
+    }
+    let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;
+    if (type < parser2.minRepeatTerm || action & 131072) {
+      let pos = parser2.stateFlag(
+        this.state,
+        1
+        /* StateFlag.Skipped */
+      ) ? this.pos : this.reducePos;
+      this.storeNode(type, start, pos, count + 4, true);
+    }
+    if (action & 262144) {
+      this.state = this.stack[base];
+    } else {
+      let baseStateID = this.stack[base - 3];
+      this.state = parser2.getGoto(baseStateID, type, true);
+    }
+    while (this.stack.length > base)
+      this.stack.pop();
+    this.reduceContext(type, start);
+  }
+  // Shift a value into the buffer
+  /// @internal
+  storeNode(term, start, end, size = 4, isReduce = false) {
+    if (term == 0 && (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {
+      let cur = this, top = this.buffer.length;
+      if (top == 0 && cur.parent) {
+        top = cur.bufferBase - cur.parent.bufferBase;
+        cur = cur.parent;
+      }
+      if (top > 0 && cur.buffer[top - 4] == 0 && cur.buffer[top - 1] > -1) {
+        if (start == end)
+          return;
+        if (cur.buffer[top - 2] >= start) {
+          cur.buffer[top - 2] = end;
+          return;
+        }
+      }
+    }
+    if (!isReduce || this.pos == end) {
+      this.buffer.push(term, start, end, size);
+    } else {
+      let index = this.buffer.length;
+      if (index > 0 && this.buffer[index - 4] != 0)
+        while (index > 0 && this.buffer[index - 2] > end) {
+          this.buffer[index] = this.buffer[index - 4];
+          this.buffer[index + 1] = this.buffer[index - 3];
+          this.buffer[index + 2] = this.buffer[index - 2];
+          this.buffer[index + 3] = this.buffer[index - 1];
+          index -= 4;
+          if (size > 4)
+            size -= 4;
+        }
+      this.buffer[index] = term;
+      this.buffer[index + 1] = start;
+      this.buffer[index + 2] = end;
+      this.buffer[index + 3] = size;
+    }
+  }
+  // Apply a shift action
+  /// @internal
+  shift(action, next, nextEnd) {
+    let start = this.pos;
+    if (action & 131072) {
+      this.pushState(action & 65535, this.pos);
+    } else if ((action & 262144) == 0) {
+      let nextState = action, { parser: parser2 } = this.p;
+      if (nextEnd > this.pos || next <= parser2.maxNode) {
+        this.pos = nextEnd;
+        if (!parser2.stateFlag(
+          nextState,
+          1
+          /* StateFlag.Skipped */
+        ))
+          this.reducePos = nextEnd;
+      }
+      this.pushState(nextState, start);
+      this.shiftContext(next, start);
+      if (next <= parser2.maxNode)
+        this.buffer.push(next, start, nextEnd, 4);
+    } else {
+      this.pos = nextEnd;
+      this.shiftContext(next, start);
+      if (next <= this.p.parser.maxNode)
+        this.buffer.push(next, start, nextEnd, 4);
+    }
+  }
+  // Apply an action
+  /// @internal
+  apply(action, next, nextEnd) {
+    if (action & 65536)
+      this.reduce(action);
+    else
+      this.shift(action, next, nextEnd);
+  }
+  // Add a prebuilt (reused) node into the buffer.
+  /// @internal
+  useNode(value, next) {
+    let index = this.p.reused.length - 1;
+    if (index < 0 || this.p.reused[index] != value) {
+      this.p.reused.push(value);
+      index++;
+    }
+    let start = this.pos;
+    this.reducePos = this.pos = start + value.length;
+    this.pushState(next, start);
+    this.buffer.push(
+      index,
+      start,
+      this.reducePos,
+      -1
+      /* size == -1 means this is a reused value */
+    );
+    if (this.curContext)
+      this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));
+  }
+  // Split the stack. Due to the buffer sharing and the fact
+  // that `this.stack` tends to stay quite shallow, this isn't very
+  // expensive.
+  /// @internal
+  split() {
+    let parent = this;
+    let off = parent.buffer.length;
+    while (off > 0 && parent.buffer[off - 2] > parent.reducePos)
+      off -= 4;
+    let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;
+    while (parent && base == parent.bufferBase)
+      parent = parent.parent;
+    return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);
+  }
+  // Try to recover from an error by 'deleting' (ignoring) one token.
+  /// @internal
+  recoverByDelete(next, nextEnd) {
+    let isNode = next <= this.p.parser.maxNode;
+    if (isNode)
+      this.storeNode(next, this.pos, nextEnd, 4);
+    this.storeNode(0, this.pos, nextEnd, isNode ? 8 : 4);
+    this.pos = this.reducePos = nextEnd;
+    this.score -= 190;
+  }
+  /// Check if the given term would be able to be shifted (optionally
+  /// after some reductions) on this stack. This can be useful for
+  /// external tokenizers that want to make sure they only provide a
+  /// given token when it applies.
+  canShift(term) {
+    for (let sim = new SimulatedStack(this); ; ) {
+      let action = this.p.parser.stateSlot(
+        sim.state,
+        4
+        /* ParseState.DefaultReduce */
+      ) || this.p.parser.hasAction(sim.state, term);
+      if (action == 0)
+        return false;
+      if ((action & 65536) == 0)
+        return true;
+      sim.reduce(action);
+    }
+  }
+  // Apply up to Recover.MaxNext recovery actions that conceptually
+  // inserts some missing token or rule.
+  /// @internal
+  recoverByInsert(next) {
+    if (this.stack.length >= 300)
+      return [];
+    let nextStates = this.p.parser.nextStates(this.state);
+    if (nextStates.length > 4 << 1 || this.stack.length >= 120) {
+      let best = [];
+      for (let i = 0, s; i < nextStates.length; i += 2) {
+        if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))
+          best.push(nextStates[i], s);
+      }
+      if (this.stack.length < 120)
+        for (let i = 0; best.length < 4 << 1 && i < nextStates.length; i += 2) {
+          let s = nextStates[i + 1];
+          if (!best.some((v, i2) => i2 & 1 && v == s))
+            best.push(nextStates[i], s);
+        }
+      nextStates = best;
+    }
+    let result = [];
+    for (let i = 0; i < nextStates.length && result.length < 4; i += 2) {
+      let s = nextStates[i + 1];
+      if (s == this.state)
+        continue;
+      let stack = this.split();
+      stack.pushState(s, this.pos);
+      stack.storeNode(0, stack.pos, stack.pos, 4, true);
+      stack.shiftContext(nextStates[i], this.pos);
+      stack.score -= 200;
+      result.push(stack);
+    }
+    return result;
+  }
+  // Force a reduce, if possible. Return false if that can't
+  // be done.
+  /// @internal
+  forceReduce() {
+    let { parser: parser2 } = this.p;
+    let reduce = parser2.stateSlot(
+      this.state,
+      5
+      /* ParseState.ForcedReduce */
+    );
+    if ((reduce & 65536) == 0)
+      return false;
+    if (!parser2.validAction(this.state, reduce)) {
+      let depth = reduce >> 19, term = reduce & 65535;
+      let target = this.stack.length - depth * 3;
+      if (target < 0 || parser2.getGoto(this.stack[target], term, false) < 0) {
+        let backup = this.findForcedReduction();
+        if (backup == null)
+          return false;
+        reduce = backup;
+      }
+      this.storeNode(0, this.pos, this.pos, 4, true);
+      this.score -= 100;
+    }
+    this.reducePos = this.pos;
+    this.reduce(reduce);
+    return true;
+  }
+  /// Try to scan through the automaton to find some kind of reduction
+  /// that can be applied. Used when the regular ForcedReduce field
+  /// isn't a valid action. @internal
+  findForcedReduction() {
+    let { parser: parser2 } = this.p, seen = [];
+    let explore = (state, depth) => {
+      if (seen.includes(state))
+        return;
+      seen.push(state);
+      return parser2.allActions(state, (action) => {
+        if (action & (262144 | 131072))
+          ;
+        else if (action & 65536) {
+          let rDepth = (action >> 19) - depth;
+          if (rDepth > 1) {
+            let term = action & 65535, target = this.stack.length - rDepth * 3;
+            if (target >= 0 && parser2.getGoto(this.stack[target], term, false) >= 0)
+              return rDepth << 19 | 65536 | term;
+          }
+        } else {
+          let found = explore(action, depth + 1);
+          if (found != null)
+            return found;
+        }
+      });
+    };
+    return explore(this.state, 0);
+  }
+  /// @internal
+  forceAll() {
+    while (!this.p.parser.stateFlag(
+      this.state,
+      2
+      /* StateFlag.Accepting */
+    )) {
+      if (!this.forceReduce()) {
+        this.storeNode(0, this.pos, this.pos, 4, true);
+        break;
+      }
+    }
+    return this;
+  }
+  /// Check whether this state has no further actions (assumed to be a direct descendant of the
+  /// top state, since any other states must be able to continue
+  /// somehow). @internal
+  get deadEnd() {
+    if (this.stack.length != 3)
+      return false;
+    let { parser: parser2 } = this.p;
+    return parser2.data[parser2.stateSlot(
+      this.state,
+      1
+      /* ParseState.Actions */
+    )] == 65535 && !parser2.stateSlot(
+      this.state,
+      4
+      /* ParseState.DefaultReduce */
+    );
+  }
+  /// Restart the stack (put it back in its start state). Only safe
+  /// when this.stack.length == 3 (state is directly below the top
+  /// state). @internal
+  restart() {
+    this.state = this.stack[0];
+    this.stack.length = 0;
+  }
+  /// @internal
+  sameState(other) {
+    if (this.state != other.state || this.stack.length != other.stack.length)
+      return false;
+    for (let i = 0; i < this.stack.length; i += 3)
+      if (this.stack[i] != other.stack[i])
+        return false;
+    return true;
+  }
+  /// Get the parser used by this stack.
+  get parser() {
+    return this.p.parser;
+  }
+  /// Test whether a given dialect (by numeric ID, as exported from
+  /// the terms file) is enabled.
+  dialectEnabled(dialectID) {
+    return this.p.parser.dialect.flags[dialectID];
+  }
+  shiftContext(term, start) {
+    if (this.curContext)
+      this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));
+  }
+  reduceContext(term, start) {
+    if (this.curContext)
+      this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));
+  }
+  /// @internal
+  emitContext() {
+    let last = this.buffer.length - 1;
+    if (last < 0 || this.buffer[last] != -3)
+      this.buffer.push(this.curContext.hash, this.pos, this.pos, -3);
+  }
+  /// @internal
+  emitLookAhead() {
+    let last = this.buffer.length - 1;
+    if (last < 0 || this.buffer[last] != -4)
+      this.buffer.push(this.lookAhead, this.pos, this.pos, -4);
+  }
+  updateContext(context) {
+    if (context != this.curContext.context) {
+      let newCx = new StackContext(this.curContext.tracker, context);
+      if (newCx.hash != this.curContext.hash)
+        this.emitContext();
+      this.curContext = newCx;
+    }
+  }
+  /// @internal
+  setLookAhead(lookAhead) {
+    if (lookAhead > this.lookAhead) {
+      this.emitLookAhead();
+      this.lookAhead = lookAhead;
+    }
+  }
+  /// @internal
+  close() {
+    if (this.curContext && this.curContext.tracker.strict)
+      this.emitContext();
+    if (this.lookAhead > 0)
+      this.emitLookAhead();
+  }
+};
+var StackContext = class {
+  constructor(tracker, context) {
+    this.tracker = tracker;
+    this.context = context;
+    this.hash = tracker.strict ? tracker.hash(context) : 0;
+  }
+};
+var Recover;
+(function(Recover2) {
+  Recover2[Recover2["Insert"] = 200] = "Insert";
+  Recover2[Recover2["Delete"] = 190] = "Delete";
+  Recover2[Recover2["Reduce"] = 100] = "Reduce";
+  Recover2[Recover2["MaxNext"] = 4] = "MaxNext";
+  Recover2[Recover2["MaxInsertStackDepth"] = 300] = "MaxInsertStackDepth";
+  Recover2[Recover2["DampenInsertStackDepth"] = 120] = "DampenInsertStackDepth";
+  Recover2[Recover2["MinBigReduction"] = 2e3] = "MinBigReduction";
+})(Recover || (Recover = {}));
+var SimulatedStack = class {
+  constructor(start) {
+    this.start = start;
+    this.state = start.state;
+    this.stack = start.stack;
+    this.base = this.stack.length;
+  }
+  reduce(action) {
+    let term = action & 65535, depth = action >> 19;
+    if (depth == 0) {
+      if (this.stack == this.start.stack)
+        this.stack = this.stack.slice();
+      this.stack.push(this.state, 0, 0);
+      this.base += 3;
+    } else {
+      this.base -= (depth - 1) * 3;
+    }
+    let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);
+    this.state = goto;
+  }
+};
+var StackBufferCursor = class {
+  constructor(stack, pos, index) {
+    this.stack = stack;
+    this.pos = pos;
+    this.index = index;
+    this.buffer = stack.buffer;
+    if (this.index == 0)
+      this.maybeNext();
+  }
+  static create(stack, pos = stack.bufferBase + stack.buffer.length) {
+    return new StackBufferCursor(stack, pos, pos - stack.bufferBase);
+  }
+  maybeNext() {
+    let next = this.stack.parent;
+    if (next != null) {
+      this.index = this.stack.bufferBase - next.bufferBase;
+      this.stack = next;
+      this.buffer = next.buffer;
+    }
+  }
+  get id() {
+    return this.buffer[this.index - 4];
+  }
+  get start() {
+    return this.buffer[this.index - 3];
+  }
+  get end() {
+    return this.buffer[this.index - 2];
+  }
+  get size() {
+    return this.buffer[this.index - 1];
+  }
+  next() {
+    this.index -= 4;
+    this.pos -= 4;
+    if (this.index == 0)
+      this.maybeNext();
+  }
+  fork() {
+    return new StackBufferCursor(this.stack, this.pos, this.index);
+  }
+};
+function decodeArray(input, Type = Uint16Array) {
+  if (typeof input != "string")
+    return input;
+  let array = null;
+  for (let pos = 0, out = 0; pos < input.length; ) {
+    let value = 0;
+    for (; ; ) {
+      let next = input.charCodeAt(pos++), stop = false;
+      if (next == 126) {
+        value = 65535;
+        break;
+      }
+      if (next >= 92)
+        next--;
+      if (next >= 34)
+        next--;
+      let digit = next - 32;
+      if (digit >= 46) {
+        digit -= 46;
+        stop = true;
+      }
+      value += digit;
+      if (stop)
+        break;
+      value *= 46;
+    }
+    if (array)
+      array[out++] = value;
+    else
+      array = new Type(value);
+  }
+  return array;
+}
+var CachedToken = class {
+  constructor() {
+    this.start = -1;
+    this.value = -1;
+    this.end = -1;
+    this.extended = -1;
+    this.lookAhead = 0;
+    this.mask = 0;
+    this.context = 0;
+  }
+};
+var nullToken = new CachedToken();
+var InputStream = class {
+  /// @internal
+  constructor(input, ranges) {
+    this.input = input;
+    this.ranges = ranges;
+    this.chunk = "";
+    this.chunkOff = 0;
+    this.chunk2 = "";
+    this.chunk2Pos = 0;
+    this.next = -1;
+    this.token = nullToken;
+    this.rangeIndex = 0;
+    this.pos = this.chunkPos = ranges[0].from;
+    this.range = ranges[0];
+    this.end = ranges[ranges.length - 1].to;
+    this.readNext();
+  }
+  /// @internal
+  resolveOffset(offset, assoc) {
+    let range = this.range, index = this.rangeIndex;
+    let pos = this.pos + offset;
+    while (pos < range.from) {
+      if (!index)
+        return null;
+      let next = this.ranges[--index];
+      pos -= range.from - next.to;
+      range = next;
+    }
+    while (assoc < 0 ? pos > range.to : pos >= range.to) {
+      if (index == this.ranges.length - 1)
+        return null;
+      let next = this.ranges[++index];
+      pos += next.from - range.to;
+      range = next;
+    }
+    return pos;
+  }
+  /// @internal
+  clipPos(pos) {
+    if (pos >= this.range.from && pos < this.range.to)
+      return pos;
+    for (let range of this.ranges)
+      if (range.to > pos)
+        return Math.max(pos, range.from);
+    return this.end;
+  }
+  /// Look at a code unit near the stream position. `.peek(0)` equals
+  /// `.next`, `.peek(-1)` gives you the previous character, and so
+  /// on.
+  ///
+  /// Note that looking around during tokenizing creates dependencies
+  /// on potentially far-away content, which may reduce the
+  /// effectiveness incremental parsing—when looking forward—or even
+  /// cause invalid reparses when looking backward more than 25 code
+  /// units, since the library does not track lookbehind.
+  peek(offset) {
+    let idx = this.chunkOff + offset, pos, result;
+    if (idx >= 0 && idx < this.chunk.length) {
+      pos = this.pos + offset;
+      result = this.chunk.charCodeAt(idx);
+    } else {
+      let resolved = this.resolveOffset(offset, 1);
+      if (resolved == null)
+        return -1;
+      pos = resolved;
+      if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {
+        result = this.chunk2.charCodeAt(pos - this.chunk2Pos);
+      } else {
+        let i = this.rangeIndex, range = this.range;
+        while (range.to <= pos)
+          range = this.ranges[++i];
+        this.chunk2 = this.input.chunk(this.chunk2Pos = pos);
+        if (pos + this.chunk2.length > range.to)
+          this.chunk2 = this.chunk2.slice(0, range.to - pos);
+        result = this.chunk2.charCodeAt(0);
+      }
+    }
+    if (pos >= this.token.lookAhead)
+      this.token.lookAhead = pos + 1;
+    return result;
+  }
+  /// Accept a token. By default, the end of the token is set to the
+  /// current stream position, but you can pass an offset (relative to
+  /// the stream position) to change that.
+  acceptToken(token, endOffset = 0) {
+    let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;
+    if (end == null || end < this.token.start)
+      throw new RangeError("Token end out of bounds");
+    this.token.value = token;
+    this.token.end = end;
+  }
+  getChunk() {
+    if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {
+      let { chunk, chunkPos } = this;
+      this.chunk = this.chunk2;
+      this.chunkPos = this.chunk2Pos;
+      this.chunk2 = chunk;
+      this.chunk2Pos = chunkPos;
+      this.chunkOff = this.pos - this.chunkPos;
+    } else {
+      this.chunk2 = this.chunk;
+      this.chunk2Pos = this.chunkPos;
+      let nextChunk = this.input.chunk(this.pos);
+      let end = this.pos + nextChunk.length;
+      this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;
+      this.chunkPos = this.pos;
+      this.chunkOff = 0;
+    }
+  }
+  readNext() {
+    if (this.chunkOff >= this.chunk.length) {
+      this.getChunk();
+      if (this.chunkOff == this.chunk.length)
+        return this.next = -1;
+    }
+    return this.next = this.chunk.charCodeAt(this.chunkOff);
+  }
+  /// Move the stream forward N (defaults to 1) code units. Returns
+  /// the new value of [`next`](#lr.InputStream.next).
+  advance(n = 1) {
+    this.chunkOff += n;
+    while (this.pos + n >= this.range.to) {
+      if (this.rangeIndex == this.ranges.length - 1)
+        return this.setDone();
+      n -= this.range.to - this.pos;
+      this.range = this.ranges[++this.rangeIndex];
+      this.pos = this.range.from;
+    }
+    this.pos += n;
+    if (this.pos >= this.token.lookAhead)
+      this.token.lookAhead = this.pos + 1;
+    return this.readNext();
+  }
+  setDone() {
+    this.pos = this.chunkPos = this.end;
+    this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];
+    this.chunk = "";
+    return this.next = -1;
+  }
+  /// @internal
+  reset(pos, token) {
+    if (token) {
+      this.token = token;
+      token.start = pos;
+      token.lookAhead = pos + 1;
+      token.value = token.extended = -1;
+    } else {
+      this.token = nullToken;
+    }
+    if (this.pos != pos) {
+      this.pos = pos;
+      if (pos == this.end) {
+        this.setDone();
+        return this;
+      }
+      while (pos < this.range.from)
+        this.range = this.ranges[--this.rangeIndex];
+      while (pos >= this.range.to)
+        this.range = this.ranges[++this.rangeIndex];
+      if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {
+        this.chunkOff = pos - this.chunkPos;
+      } else {
+        this.chunk = "";
+        this.chunkOff = 0;
+      }
+      this.readNext();
+    }
+    return this;
+  }
+  /// @internal
+  read(from, to) {
+    if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)
+      return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);
+    if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)
+      return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);
+    if (from >= this.range.from && to <= this.range.to)
+      return this.input.read(from, to);
+    let result = "";
+    for (let r of this.ranges) {
+      if (r.from >= to)
+        break;
+      if (r.to > from)
+        result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));
+    }
+    return result;
+  }
+};
+var TokenGroup = class {
+  constructor(data, id) {
+    this.data = data;
+    this.id = id;
+  }
+  token(input, stack) {
+    let { parser: parser2 } = stack.p;
+    readToken(this.data, input, stack, this.id, parser2.data, parser2.tokenPrecTable);
+  }
+};
+TokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;
+var LocalTokenGroup = class {
+  constructor(data, precTable, elseToken) {
+    this.precTable = precTable;
+    this.elseToken = elseToken;
+    this.data = typeof data == "string" ? decodeArray(data) : data;
+  }
+  token(input, stack) {
+    let start = input.pos, skipped = 0;
+    for (; ; ) {
+      let atEof = input.next < 0, nextPos = input.resolveOffset(1, 1);
+      readToken(this.data, input, stack, 0, this.data, this.precTable);
+      if (input.token.value > -1)
+        break;
+      if (this.elseToken == null)
+        return;
+      if (!atEof)
+        skipped++;
+      if (nextPos == null)
+        break;
+      input.reset(nextPos, input.token);
+    }
+    if (skipped) {
+      input.reset(start, input.token);
+      input.acceptToken(this.elseToken, skipped);
+    }
+  }
+};
+LocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;
+function readToken(data, input, stack, group, precTable, precOffset) {
+  let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;
+  scan:
+    for (; ; ) {
+      if ((groupMask & data[state]) == 0)
+        break;
+      let accEnd = data[state + 1];
+      for (let i = state + 3; i < accEnd; i += 2)
+        if ((data[i + 1] & groupMask) > 0) {
+          let term = data[i];
+          if (dialect.allows(term) && (input.token.value == -1 || input.token.value == term || overrides(term, input.token.value, precTable, precOffset))) {
+            input.acceptToken(term);
+            break;
+          }
+        }
+      let next = input.next, low = 0, high = data[state + 2];
+      if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 && data[accEnd + high * 3 - 3] == 65535) {
+        state = data[accEnd + high * 3 - 1];
+        continue scan;
+      }
+      for (; low < high; ) {
+        let mid = low + high >> 1;
+        let index = accEnd + mid + (mid << 1);
+        let from = data[index], to = data[index + 1] || 65536;
+        if (next < from)
+          high = mid;
+        else if (next >= to)
+          low = mid + 1;
+        else {
+          state = data[index + 2];
+          input.advance();
+          continue scan;
+        }
+      }
+      break;
+    }
+}
+function findOffset(data, start, term) {
+  for (let i = start, next; (next = data[i]) != 65535; i++)
+    if (next == term)
+      return i - start;
+  return -1;
+}
+function overrides(token, prev, tableData, tableOffset) {
+  let iPrev = findOffset(tableData, tableOffset, prev);
+  return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;
+}
+var verbose = typeof process != "undefined" && process.env && /\bparse\b/.test(process.env.LOG);
+var stackIDs = null;
+var Safety;
+(function(Safety2) {
+  Safety2[Safety2["Margin"] = 25] = "Margin";
+})(Safety || (Safety = {}));
+function cutAt(tree, pos, side) {
+  let cursor = tree.cursor(IterMode.IncludeAnonymous);
+  cursor.moveTo(pos);
+  for (; ; ) {
+    if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))
+      for (; ; ) {
+        if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)
+          return side < 0 ? Math.max(0, Math.min(
+            cursor.to - 1,
+            pos - 25
+            /* Safety.Margin */
+          )) : Math.min(tree.length, Math.max(
+            cursor.from + 1,
+            pos + 25
+            /* Safety.Margin */
+          ));
+        if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())
+          break;
+        if (!cursor.parent())
+          return side < 0 ? 0 : tree.length;
+      }
+  }
+}
+var FragmentCursor = class {
+  constructor(fragments, nodeSet) {
+    this.fragments = fragments;
+    this.nodeSet = nodeSet;
+    this.i = 0;
+    this.fragment = null;
+    this.safeFrom = -1;
+    this.safeTo = -1;
+    this.trees = [];
+    this.start = [];
+    this.index = [];
+    this.nextFragment();
+  }
+  nextFragment() {
+    let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];
+    if (fr) {
+      this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;
+      this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;
+      while (this.trees.length) {
+        this.trees.pop();
+        this.start.pop();
+        this.index.pop();
+      }
+      this.trees.push(fr.tree);
+      this.start.push(-fr.offset);
+      this.index.push(0);
+      this.nextStart = this.safeFrom;
+    } else {
+      this.nextStart = 1e9;
+    }
+  }
+  // `pos` must be >= any previously given `pos` for this cursor
+  nodeAt(pos) {
+    if (pos < this.nextStart)
+      return null;
+    while (this.fragment && this.safeTo <= pos)
+      this.nextFragment();
+    if (!this.fragment)
+      return null;
+    for (; ; ) {
+      let last = this.trees.length - 1;
+      if (last < 0) {
+        this.nextFragment();
+        return null;
+      }
+      let top = this.trees[last], index = this.index[last];
+      if (index == top.children.length) {
+        this.trees.pop();
+        this.start.pop();
+        this.index.pop();
+        continue;
+      }
+      let next = top.children[index];
+      let start = this.start[last] + top.positions[index];
+      if (start > pos) {
+        this.nextStart = start;
+        return null;
+      }
+      if (next instanceof Tree) {
+        if (start == pos) {
+          if (start < this.safeFrom)
+            return null;
+          let end = start + next.length;
+          if (end <= this.safeTo) {
+            let lookAhead = next.prop(NodeProp.lookAhead);
+            if (!lookAhead || end + lookAhead < this.fragment.to)
+              return next;
+          }
+        }
+        this.index[last]++;
+        if (start + next.length >= Math.max(this.safeFrom, pos)) {
+          this.trees.push(next);
+          this.start.push(start);
+          this.index.push(0);
+        }
+      } else {
+        this.index[last]++;
+        this.nextStart = start + next.length;
+      }
+    }
+  }
+};
+var TokenCache = class {
+  constructor(parser2, stream) {
+    this.stream = stream;
+    this.tokens = [];
+    this.mainToken = null;
+    this.actions = [];
+    this.tokens = parser2.tokenizers.map((_) => new CachedToken());
+  }
+  getActions(stack) {
+    let actionIndex = 0;
+    let main = null;
+    let { parser: parser2 } = stack.p, { tokenizers } = parser2;
+    let mask = parser2.stateSlot(
+      stack.state,
+      3
+      /* ParseState.TokenizerMask */
+    );
+    let context = stack.curContext ? stack.curContext.hash : 0;
+    let lookAhead = 0;
+    for (let i = 0; i < tokenizers.length; i++) {
+      if ((1 << i & mask) == 0)
+        continue;
+      let tokenizer = tokenizers[i], token = this.tokens[i];
+      if (main && !tokenizer.fallback)
+        continue;
+      if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {
+        this.updateCachedToken(token, tokenizer, stack);
+        token.mask = mask;
+        token.context = context;
+      }
+      if (token.lookAhead > token.end + 25)
+        lookAhead = Math.max(token.lookAhead, lookAhead);
+      if (token.value != 0) {
+        let startIndex = actionIndex;
+        if (token.extended > -1)
+          actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);
+        actionIndex = this.addActions(stack, token.value, token.end, actionIndex);
+        if (!tokenizer.extend) {
+          main = token;
+          if (actionIndex > startIndex)
+            break;
+        }
+      }
+    }
+    while (this.actions.length > actionIndex)
+      this.actions.pop();
+    if (lookAhead)
+      stack.setLookAhead(lookAhead);
+    if (!main && stack.pos == this.stream.end) {
+      main = new CachedToken();
+      main.value = stack.p.parser.eofTerm;
+      main.start = main.end = stack.pos;
+      actionIndex = this.addActions(stack, main.value, main.end, actionIndex);
+    }
+    this.mainToken = main;
+    return this.actions;
+  }
+  getMainToken(stack) {
+    if (this.mainToken)
+      return this.mainToken;
+    let main = new CachedToken(), { pos, p } = stack;
+    main.start = pos;
+    main.end = Math.min(pos + 1, p.stream.end);
+    main.value = pos == p.stream.end ? p.parser.eofTerm : 0;
+    return main;
+  }
+  updateCachedToken(token, tokenizer, stack) {
+    let start = this.stream.clipPos(stack.pos);
+    tokenizer.token(this.stream.reset(start, token), stack);
+    if (token.value > -1) {
+      let { parser: parser2 } = stack.p;
+      for (let i = 0; i < parser2.specialized.length; i++)
+        if (parser2.specialized[i] == token.value) {
+          let result = parser2.specializers[i](this.stream.read(token.start, token.end), stack);
+          if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {
+            if ((result & 1) == 0)
+              token.value = result >> 1;
+            else
+              token.extended = result >> 1;
+            break;
+          }
+        }
+    } else {
+      token.value = 0;
+      token.end = this.stream.clipPos(start + 1);
+    }
+  }
+  putAction(action, token, end, index) {
+    for (let i = 0; i < index; i += 3)
+      if (this.actions[i] == action)
+        return index;
+    this.actions[index++] = action;
+    this.actions[index++] = token;
+    this.actions[index++] = end;
+    return index;
+  }
+  addActions(stack, token, end, index) {
+    let { state } = stack, { parser: parser2 } = stack.p, { data } = parser2;
+    for (let set = 0; set < 2; set++) {
+      for (let i = parser2.stateSlot(
+        state,
+        set ? 2 : 1
+        /* ParseState.Actions */
+      ); ; i += 3) {
+        if (data[i] == 65535) {
+          if (data[i + 1] == 1) {
+            i = pair(data, i + 2);
+          } else {
+            if (index == 0 && data[i + 1] == 2)
+              index = this.putAction(pair(data, i + 2), token, end, index);
+            break;
+          }
+        }
+        if (data[i] == token)
+          index = this.putAction(pair(data, i + 1), token, end, index);
+      }
+    }
+    return index;
+  }
+};
+var Rec;
+(function(Rec2) {
+  Rec2[Rec2["Distance"] = 5] = "Distance";
+  Rec2[Rec2["MaxRemainingPerStep"] = 3] = "MaxRemainingPerStep";
+  Rec2[Rec2["MinBufferLengthPrune"] = 500] = "MinBufferLengthPrune";
+  Rec2[Rec2["ForceReduceLimit"] = 10] = "ForceReduceLimit";
+  Rec2[Rec2["CutDepth"] = 15e3] = "CutDepth";
+  Rec2[Rec2["CutTo"] = 9e3] = "CutTo";
+  Rec2[Rec2["MaxLeftAssociativeReductionCount"] = 300] = "MaxLeftAssociativeReductionCount";
+  Rec2[Rec2["MaxStackCount"] = 12] = "MaxStackCount";
+})(Rec || (Rec = {}));
+var Parse = class {
+  constructor(parser2, input, fragments, ranges) {
+    this.parser = parser2;
+    this.input = input;
+    this.ranges = ranges;
+    this.recovering = 0;
+    this.nextStackID = 9812;
+    this.minStackPos = 0;
+    this.reused = [];
+    this.stoppedAt = null;
+    this.lastBigReductionStart = -1;
+    this.lastBigReductionSize = 0;
+    this.bigReductionCount = 0;
+    this.stream = new InputStream(input, ranges);
+    this.tokens = new TokenCache(parser2, this.stream);
+    this.topTerm = parser2.top[1];
+    let { from } = ranges[0];
+    this.stacks = [Stack.start(this, parser2.top[0], from)];
+    this.fragments = fragments.length && this.stream.end - from > parser2.bufferLength * 4 ? new FragmentCursor(fragments, parser2.nodeSet) : null;
+  }
+  get parsedPos() {
+    return this.minStackPos;
+  }
+  // Move the parser forward. This will process all parse stacks at
+  // `this.pos` and try to advance them to a further position. If no
+  // stack for such a position is found, it'll start error-recovery.
+  //
+  // When the parse is finished, this will return a syntax tree. When
+  // not, it returns `null`.
+  advance() {
+    let stacks = this.stacks, pos = this.minStackPos;
+    let newStacks = this.stacks = [];
+    let stopped, stoppedTokens;
+    if (this.bigReductionCount > 300 && stacks.length == 1) {
+      let [s] = stacks;
+      while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) {
+      }
+      this.bigReductionCount = this.lastBigReductionSize = 0;
+    }
+    for (let i = 0; i < stacks.length; i++) {
+      let stack = stacks[i];
+      for (; ; ) {
+        this.tokens.mainToken = null;
+        if (stack.pos > pos) {
+          newStacks.push(stack);
+        } else if (this.advanceStack(stack, newStacks, stacks)) {
+          continue;
+        } else {
+          if (!stopped) {
+            stopped = [];
+            stoppedTokens = [];
+          }
+          stopped.push(stack);
+          let tok = this.tokens.getMainToken(stack);
+          stoppedTokens.push(tok.value, tok.end);
+        }
+        break;
+      }
+    }
+    if (!newStacks.length) {
+      let finished = stopped && findFinished(stopped);
+      if (finished)
+        return this.stackToTree(finished);
+      if (this.parser.strict) {
+        if (verbose && stopped)
+          console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none"));
+        throw new SyntaxError("No parse at " + pos);
+      }
+      if (!this.recovering)
+        this.recovering = 5;
+    }
+    if (this.recovering && stopped) {
+      let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0] : this.runRecovery(stopped, stoppedTokens, newStacks);
+      if (finished)
+        return this.stackToTree(finished.forceAll());
+    }
+    if (this.recovering) {
+      let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3;
+      if (newStacks.length > maxRemaining) {
+        newStacks.sort((a, b) => b.score - a.score);
+        while (newStacks.length > maxRemaining)
+          newStacks.pop();
+      }
+      if (newStacks.some((s) => s.reducePos > pos))
+        this.recovering--;
+    } else if (newStacks.length > 1) {
+      outer:
+        for (let i = 0; i < newStacks.length - 1; i++) {
+          let stack = newStacks[i];
+          for (let j = i + 1; j < newStacks.length; j++) {
+            let other = newStacks[j];
+            if (stack.sameState(other) || stack.buffer.length > 500 && other.buffer.length > 500) {
+              if ((stack.score - other.score || stack.buffer.length - other.buffer.length) > 0) {
+                newStacks.splice(j--, 1);
+              } else {
+                newStacks.splice(i--, 1);
+                continue outer;
+              }
+            }
+          }
+        }
+      if (newStacks.length > 12)
+        newStacks.splice(
+          12,
+          newStacks.length - 12
+          /* Rec.MaxStackCount */
+        );
+    }
+    this.minStackPos = newStacks[0].pos;
+    for (let i = 1; i < newStacks.length; i++)
+      if (newStacks[i].pos < this.minStackPos)
+        this.minStackPos = newStacks[i].pos;
+    return null;
+  }
+  stopAt(pos) {
+    if (this.stoppedAt != null && this.stoppedAt < pos)
+      throw new RangeError("Can't move stoppedAt forward");
+    this.stoppedAt = pos;
+  }
+  // Returns an updated version of the given stack, or null if the
+  // stack can't advance normally. When `split` and `stacks` are
+  // given, stacks split off by ambiguous operations will be pushed to
+  // `split`, or added to `stacks` if they move `pos` forward.
+  advanceStack(stack, stacks, split) {
+    let start = stack.pos, { parser: parser2 } = this;
+    let base = verbose ? this.stackID(stack) + " -> " : "";
+    if (this.stoppedAt != null && start > this.stoppedAt)
+      return stack.forceReduce() ? stack : null;
+    if (this.fragments) {
+      let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;
+      for (let cached = this.fragments.nodeAt(start); cached; ) {
+        let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser2.getGoto(stack.state, cached.type.id) : -1;
+        if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {
+          stack.useNode(cached, match);
+          if (verbose)
+            console.log(base + this.stackID(stack) + ` (via reuse of ${parser2.getName(cached.type.id)})`);
+          return true;
+        }
+        if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)
+          break;
+        let inner = cached.children[0];
+        if (inner instanceof Tree && cached.positions[0] == 0)
+          cached = inner;
+        else
+          break;
+      }
+    }
+    let defaultReduce = parser2.stateSlot(
+      stack.state,
+      4
+      /* ParseState.DefaultReduce */
+    );
+    if (defaultReduce > 0) {
+      stack.reduce(defaultReduce);
+      if (verbose)
+        console.log(base + this.stackID(stack) + ` (via always-reduce ${parser2.getName(
+          defaultReduce & 65535
+          /* Action.ValueMask */
+        )})`);
+      return true;
+    }
+    if (stack.stack.length >= 15e3) {
+      while (stack.stack.length > 9e3 && stack.forceReduce()) {
+      }
+    }
+    let actions = this.tokens.getActions(stack);
+    for (let i = 0; i < actions.length; ) {
+      let action = actions[i++], term = actions[i++], end = actions[i++];
+      let last = i == actions.length || !split;
+      let localStack = last ? stack : stack.split();
+      localStack.apply(action, term, end);
+      if (verbose)
+        console.log(base + this.stackID(localStack) + ` (via ${(action & 65536) == 0 ? "shift" : `reduce of ${parser2.getName(
+          action & 65535
+          /* Action.ValueMask */
+        )}`} for ${parser2.getName(term)} @ ${start}${localStack == stack ? "" : ", split"})`);
+      if (last)
+        return true;
+      else if (localStack.pos > start)
+        stacks.push(localStack);
+      else
+        split.push(localStack);
+    }
+    return false;
+  }
+  // Advance a given stack forward as far as it will go. Returns the
+  // (possibly updated) stack if it got stuck, or null if it moved
+  // forward and was given to `pushStackDedup`.
+  advanceFully(stack, newStacks) {
+    let pos = stack.pos;
+    for (; ; ) {
+      if (!this.advanceStack(stack, null, null))
+        return false;
+      if (stack.pos > pos) {
+        pushStackDedup(stack, newStacks);
+        return true;
+      }
+    }
+  }
+  runRecovery(stacks, tokens, newStacks) {
+    let finished = null, restarted = false;
+    for (let i = 0; i < stacks.length; i++) {
+      let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];
+      let base = verbose ? this.stackID(stack) + " -> " : "";
+      if (stack.deadEnd) {
+        if (restarted)
+          continue;
+        restarted = true;
+        stack.restart();
+        if (verbose)
+          console.log(base + this.stackID(stack) + " (restarted)");
+        let done = this.advanceFully(stack, newStacks);
+        if (done)
+          continue;
+      }
+      let force = stack.split(), forceBase = base;
+      for (let j = 0; force.forceReduce() && j < 10; j++) {
+        if (verbose)
+          console.log(forceBase + this.stackID(force) + " (via force-reduce)");
+        let done = this.advanceFully(force, newStacks);
+        if (done)
+          break;
+        if (verbose)
+          forceBase = this.stackID(force) + " -> ";
+      }
+      for (let insert of stack.recoverByInsert(token)) {
+        if (verbose)
+          console.log(base + this.stackID(insert) + " (via recover-insert)");
+        this.advanceFully(insert, newStacks);
+      }
+      if (this.stream.end > stack.pos) {
+        if (tokenEnd == stack.pos) {
+          tokenEnd++;
+          token = 0;
+        }
+        stack.recoverByDelete(token, tokenEnd);
+        if (verbose)
+          console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);
+        pushStackDedup(stack, newStacks);
+      } else if (!finished || finished.score < stack.score) {
+        finished = stack;
+      }
+    }
+    return finished;
+  }
+  // Convert the stack's buffer to a syntax tree.
+  stackToTree(stack) {
+    stack.close();
+    return Tree.build({
+      buffer: StackBufferCursor.create(stack),
+      nodeSet: this.parser.nodeSet,
+      topID: this.topTerm,
+      maxBufferLength: this.parser.bufferLength,
+      reused: this.reused,
+      start: this.ranges[0].from,
+      length: stack.pos - this.ranges[0].from,
+      minRepeatType: this.parser.minRepeatTerm
+    });
+  }
+  stackID(stack) {
+    let id = (stackIDs || (stackIDs = /* @__PURE__ */ new WeakMap())).get(stack);
+    if (!id)
+      stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));
+    return id + stack;
+  }
+};
+function pushStackDedup(stack, newStacks) {
+  for (let i = 0; i < newStacks.length; i++) {
+    let other = newStacks[i];
+    if (other.pos == stack.pos && other.sameState(stack)) {
+      if (newStacks[i].score < stack.score)
+        newStacks[i] = stack;
+      return;
+    }
+  }
+  newStacks.push(stack);
+}
+var Dialect = class {
+  constructor(source, flags, disabled) {
+    this.source = source;
+    this.flags = flags;
+    this.disabled = disabled;
+  }
+  allows(term) {
+    return !this.disabled || this.disabled[term] == 0;
+  }
+};
+var LRParser = class extends Parser {
+  /// @internal
+  constructor(spec) {
+    super();
+    this.wrappers = [];
+    if (spec.version != 14)
+      throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14})`);
+    let nodeNames = spec.nodeNames.split(" ");
+    this.minRepeatTerm = nodeNames.length;
+    for (let i = 0; i < spec.repeatNodeCount; i++)
+      nodeNames.push("");
+    let topTerms = Object.keys(spec.topRules).map((r) => spec.topRules[r][1]);
+    let nodeProps = [];
+    for (let i = 0; i < nodeNames.length; i++)
+      nodeProps.push([]);
+    function setProp(nodeID, prop, value) {
+      nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);
+    }
+    if (spec.nodeProps)
+      for (let propSpec of spec.nodeProps) {
+        let prop = propSpec[0];
+        if (typeof prop == "string")
+          prop = NodeProp[prop];
+        for (let i = 1; i < propSpec.length; ) {
+          let next = propSpec[i++];
+          if (next >= 0) {
+            setProp(next, prop, propSpec[i++]);
+          } else {
+            let value = propSpec[i + -next];
+            for (let j = -next; j > 0; j--)
+              setProp(propSpec[i++], prop, value);
+            i++;
+          }
+        }
+      }
+    this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({
+      name: i >= this.minRepeatTerm ? void 0 : name,
+      id: i,
+      props: nodeProps[i],
+      top: topTerms.indexOf(i) > -1,
+      error: i == 0,
+      skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1
+    })));
+    if (spec.propSources)
+      this.nodeSet = this.nodeSet.extend(...spec.propSources);
+    this.strict = false;
+    this.bufferLength = DefaultBufferLength;
+    let tokenArray = decodeArray(spec.tokenData);
+    this.context = spec.context;
+    this.specializerSpecs = spec.specialized || [];
+    this.specialized = new Uint16Array(this.specializerSpecs.length);
+    for (let i = 0; i < this.specializerSpecs.length; i++)
+      this.specialized[i] = this.specializerSpecs[i].term;
+    this.specializers = this.specializerSpecs.map(getSpecializer);
+    this.states = decodeArray(spec.states, Uint32Array);
+    this.data = decodeArray(spec.stateData);
+    this.goto = decodeArray(spec.goto);
+    this.maxTerm = spec.maxTerm;
+    this.tokenizers = spec.tokenizers.map((value) => typeof value == "number" ? new TokenGroup(tokenArray, value) : value);
+    this.topRules = spec.topRules;
+    this.dialects = spec.dialects || {};
+    this.dynamicPrecedences = spec.dynamicPrecedences || null;
+    this.tokenPrecTable = spec.tokenPrec;
+    this.termNames = spec.termNames || null;
+    this.maxNode = this.nodeSet.types.length - 1;
+    this.dialect = this.parseDialect();
+    this.top = this.topRules[Object.keys(this.topRules)[0]];
+  }
+  createParse(input, fragments, ranges) {
+    let parse = new Parse(this, input, fragments, ranges);
+    for (let w of this.wrappers)
+      parse = w(parse, input, fragments, ranges);
+    return parse;
+  }
+  /// Get a goto table entry @internal
+  getGoto(state, term, loose = false) {
+    let table = this.goto;
+    if (term >= table[0])
+      return -1;
+    for (let pos = table[term + 1]; ; ) {
+      let groupTag = table[pos++], last = groupTag & 1;
+      let target = table[pos++];
+      if (last && loose)
+        return target;
+      for (let end = pos + (groupTag >> 1); pos < end; pos++)
+        if (table[pos] == state)
+          return target;
+      if (last)
+        return -1;
+    }
+  }
+  /// Check if this state has an action for a given terminal @internal
+  hasAction(state, terminal) {
+    let data = this.data;
+    for (let set = 0; set < 2; set++) {
+      for (let i = this.stateSlot(
+        state,
+        set ? 2 : 1
+        /* ParseState.Actions */
+      ), next; ; i += 3) {
+        if ((next = data[i]) == 65535) {
+          if (data[i + 1] == 1)
+            next = data[i = pair(data, i + 2)];
+          else if (data[i + 1] == 2)
+            return pair(data, i + 2);
+          else
+            break;
+        }
+        if (next == terminal || next == 0)
+          return pair(data, i + 1);
+      }
+    }
+    return 0;
+  }
+  /// @internal
+  stateSlot(state, slot) {
+    return this.states[state * 6 + slot];
+  }
+  /// @internal
+  stateFlag(state, flag) {
+    return (this.stateSlot(
+      state,
+      0
+      /* ParseState.Flags */
+    ) & flag) > 0;
+  }
+  /// @internal
+  validAction(state, action) {
+    return !!this.allActions(state, (a) => a == action ? true : null);
+  }
+  /// @internal
+  allActions(state, action) {
+    let deflt = this.stateSlot(
+      state,
+      4
+      /* ParseState.DefaultReduce */
+    );
+    let result = deflt ? action(deflt) : void 0;
+    for (let i = this.stateSlot(
+      state,
+      1
+      /* ParseState.Actions */
+    ); result == null; i += 3) {
+      if (this.data[i] == 65535) {
+        if (this.data[i + 1] == 1)
+          i = pair(this.data, i + 2);
+        else
+          break;
+      }
+      result = action(pair(this.data, i + 1));
+    }
+    return result;
+  }
+  /// Get the states that can follow this one through shift actions or
+  /// goto jumps. @internal
+  nextStates(state) {
+    let result = [];
+    for (let i = this.stateSlot(
+      state,
+      1
+      /* ParseState.Actions */
+    ); ; i += 3) {
+      if (this.data[i] == 65535) {
+        if (this.data[i + 1] == 1)
+          i = pair(this.data, i + 2);
+        else
+          break;
+      }
+      if ((this.data[i + 2] & 65536 >> 16) == 0) {
+        let value = this.data[i + 1];
+        if (!result.some((v, i2) => i2 & 1 && v == value))
+          result.push(this.data[i], value);
+      }
+    }
+    return result;
+  }
+  /// Configure the parser. Returns a new parser instance that has the
+  /// given settings modified. Settings not provided in `config` are
+  /// kept from the original parser.
+  configure(config) {
+    let copy = Object.assign(Object.create(LRParser.prototype), this);
+    if (config.props)
+      copy.nodeSet = this.nodeSet.extend(...config.props);
+    if (config.top) {
+      let info = this.topRules[config.top];
+      if (!info)
+        throw new RangeError(`Invalid top rule name ${config.top}`);
+      copy.top = info;
+    }
+    if (config.tokenizers)
+      copy.tokenizers = this.tokenizers.map((t) => {
+        let found = config.tokenizers.find((r) => r.from == t);
+        return found ? found.to : t;
+      });
+    if (config.specializers) {
+      copy.specializers = this.specializers.slice();
+      copy.specializerSpecs = this.specializerSpecs.map((s, i) => {
+        let found = config.specializers.find((r) => r.from == s.external);
+        if (!found)
+          return s;
+        let spec = Object.assign(Object.assign({}, s), { external: found.to });
+        copy.specializers[i] = getSpecializer(spec);
+        return spec;
+      });
+    }
+    if (config.contextTracker)
+      copy.context = config.contextTracker;
+    if (config.dialect)
+      copy.dialect = this.parseDialect(config.dialect);
+    if (config.strict != null)
+      copy.strict = config.strict;
+    if (config.wrap)
+      copy.wrappers = copy.wrappers.concat(config.wrap);
+    if (config.bufferLength != null)
+      copy.bufferLength = config.bufferLength;
+    return copy;
+  }
+  /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)
+  /// are registered for this parser.
+  hasWrappers() {
+    return this.wrappers.length > 0;
+  }
+  /// Returns the name associated with a given term. This will only
+  /// work for all terms when the parser was generated with the
+  /// `--names` option. By default, only the names of tagged terms are
+  /// stored.
+  getName(term) {
+    return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);
+  }
+  /// The eof term id is always allocated directly after the node
+  /// types. @internal
+  get eofTerm() {
+    return this.maxNode + 1;
+  }
+  /// The type of top node produced by the parser.
+  get topNode() {
+    return this.nodeSet.types[this.top[1]];
+  }
+  /// @internal
+  dynamicPrecedence(term) {
+    let prec = this.dynamicPrecedences;
+    return prec == null ? 0 : prec[term] || 0;
+  }
+  /// @internal
+  parseDialect(dialect) {
+    let values = Object.keys(this.dialects), flags = values.map(() => false);
+    if (dialect)
+      for (let part of dialect.split(" ")) {
+        let id = values.indexOf(part);
+        if (id >= 0)
+          flags[id] = true;
+      }
+    let disabled = null;
+    for (let i = 0; i < values.length; i++)
+      if (!flags[i]) {
+        for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535; )
+          (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;
+      }
+    return new Dialect(dialect, flags, disabled);
+  }
+  /// Used by the output of the parser generator. Not available to
+  /// user code. @hide
+  static deserialize(spec) {
+    return new LRParser(spec);
+  }
+};
+function pair(data, off) {
+  return data[off] | data[off + 1] << 16;
+}
+function findFinished(stacks) {
+  let best = null;
+  for (let stack of stacks) {
+    let stopped = stack.p.stoppedAt;
+    if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) && stack.p.parser.stateFlag(
+      stack.state,
+      2
+      /* StateFlag.Accepting */
+    ) && (!best || best.score < stack.score))
+      best = stack;
+  }
+  return best;
+}
+function getSpecializer(spec) {
+  if (spec.external) {
+    let mask = spec.extend ? 1 : 0;
+    return (value, stack) => spec.external(value, stack) << 1 | mask;
+  }
+  return spec.get;
 }
-`;At(Hr);var $r=o=>(...e)=>[o,...e].join("-"),jr=$r("saltIcon"),Gr=1,Rt=(0,Nt.forwardRef)(function({children:e,className:t,size:r=Gr,style:n,...i},s){let l={...n,"--saltIcon-size-multiplier":`${r}`};return(0,Ke.jsx)("svg",{className:Tt(jr(),t),style:l,role:"img",...i,ref:s,children:(0,Ke.jsx)("g",{"aria-hidden":!0,children:e})})});var ye=require("react/jsx-runtime"),Et=require("react");var Je=(0,Et.forwardRef)(function(e,t){return(0,ye.jsxs)(Rt,{"data-testid":"DeleteIcon","aria-label":"delete",viewBox:"0 0 12 12",ref:t,...e,children:[(0,ye.jsx)("path",{d:"M5 4v6H4V4h1Zm2 0v6H6V4h1Z"}),(0,ye.jsx)("path",{fillRule:"evenodd",d:"M4 0a1 1 0 0 0-1 1v1H0v1h1v7a2 2 0 0 0 2 2h5.25A1.75 1.75 0 0 0 10 10.25V3h1V2H8V1a1 1 0 0 0-1-1H4Zm5 3H2v7a1 1 0 0 0 1 1h5.25a.75.75 0 0 0 .75-.75V3ZM7 2H4v-.5a.5.5 0 0 1 .5-.5h2a.5.5 0 0 1 .5.5V2Z",clipRule:"evenodd"})]})});var fe=require("@heswell/salt-lab");var P=require("@vuu-ui/vuu-utils"),D="and",Me="=",Xr=">",Zr="<",Dt="or",et="starts",Yr="ends",Mt="in",Bt=(o,e=[])=>(o&&((0,P.isMultiClauseFilter)(o)?o.filters.forEach(t=>e.push(...Bt(t))):e.push(o)),e),qr={combineWith:"and"},ve=(o,e,{combineWith:t=D}=qr)=>{var r;if(rt(e))(0,P.isMultiClauseFilter)(e)||(o=tt(o,{name:e.column}));else if(Kr(e))return(0,P.isMultiClauseFilter)(e),tt(o,{name:(r=e.column)!=null?r:""});if(!o)return e;if(!e)return o;if(o.op===D&&e.op===D)return{op:D,filters:to(o.filters,e.filters)};if(o.op===D){let n=Jr(o.filters,e);return n.length>1?{op:D,filters:n}:n[0]}return e.op===D?{op:D,filters:e.filters.concat(o)}:Be(o,e,!0)?e:Vt(o,e)?eo(o,e):{op:t,filters:[o,e]}},rt=o=>o?(0,P.isInFilter)(o)&&o.values.length===0?!0:(0,P.isAndFilter)(o)&&o.filters.some(e=>rt(e)):!1,Kr=o=>o?o.op===et&&o.value===""?!0:o.op===et&&o.value==="":!1,Jr=(o,e)=>o.concat(e),eo=(o,e)=>rt(e)?e:(0,P.isInFilter)(o)&&(0,P.isInFilter)(e)?{...o,values:[...o.values,...e.values.filter(t=>!o.values.includes(t))]}:(0,P.isInFilter)(o)&&e.op===Me?{...o,values:o.values.concat([e.value])}:o.op===Me&&e.op===Me?{column:o.column,op:Mt,values:[o.value,e.value]}:e,to=(o,e)=>{let t=({op:i},{op:s})=>i===s||i[0]===s[0],r=(i,s)=>i.column===s.column&&t(i,s),n=i=>e.some(s=>r(i,s))===!1;return o.filter(n).concat(e)},ro=(o,e)=>{if(Be(o,e,!0))return null;if(o.op!==D)throw Error(`removeFilter cannot remove ${JSON.stringify(e)} from ${JSON.stringify(o)}`);let t=o.filters.filter(r=>!Be(r,e));return t.length>0?{type:D,filters:t}:null},oo=(o,e)=>{if(!e)return[void 0,void 0];if(e.column===o)return[e,void 0];if(e.op!==D)return[void 0,e];let[[t=void 0],r]=(0,P.partition)(e.filters,n=>n.column===o);return r.length===1?[t,r[0]]:[t,{op:D,filters:r}]},zt=(o,e)=>(0,P.isMultiClauseFilter)(o)?{op:o.op,filters:o.filters.map(t=>zt(t,e))}:{...o,column:e},Qt=(o,e)=>{if(!o)return!1;let{op:t,column:r}=o;switch(t){case D:case Dt:return o.filters!=null&&o.filters.some(n=>Qt(n,e));default:return r===e.name}},tt=(o,e)=>{let t=e.name;if(o&&o.column!==t){if((0,P.isAndFilter)(o)||(0,P.isOrFilter)(o)){let{op:r}=o,i=o.filters.filter(s=>s.column!==t);switch(i.length){case 0:return;case 1:return i[0];default:return{op:r,filters:i}}}return o}},Vt=(o,e)=>o.column===e.column&&(o.op==="="||o.op==="in")&&(e.op==="="||e.op==="in"),no=(o,e)=>{if(o===e)return!0;if(o.length===e.length){let t=o.slice().sort(),r=e.slice().sort();return t.join("|")===r.join("|")}return!1},Be=(o,e,t=!1)=>t?o&&e&&Vt(o,e)?o.op===e.op&&((0,P.isSingleValueFilter)(o)&&(0,P.isSingleValueFilter)(e)&&o.value===e.value||(0,P.isMultiValueFilter)(o)&&(0,P.isMultiValueFilter)(e)&&no(o.values,e.values)):!1:!0,Lt=(o,e,t)=>{if(o&&e){if(t==="replace")return e;if(o.op==="and")return{...o,filters:o.filters.concat(e)};let{column:r}=e;if(r&&(e.column?(0,P.extractFilterForColumn)(o,r):void 0)&&r){let i=tt(o,{name:r});return Lt(i,e,"add")}return{op:"and",filters:[o,e]}}return e||o};var Ce=o=>/\.\.\.$/.test(o),_t=(o,e,t)=>{if(e.length!==0){if(t){let r=e[0].substring(0,e[0].length-3);return{column:o,op:"starts",value:`"${r}"`}}return{column:o,op:"in",values:e.map(r=>`"${r}"`)}}},ot=(o,e,t)=>{let r=e===void 0?void 0:{column:o,op:">",value:e-1},n=t===void 0?void 0:{column:o,op:"<",value:t+1};return n===void 0?r:ve(r,n,{combineWith:"and"})};var se=require("react/jsx-runtime"),Ut=({defaultTypeaheadParams:o,filterValues:e,onChange:t})=>{var s,l;let r=o[1],n=a=>{let u=parseFloat(a.target.value),f={start:isNaN(u)?void 0:u,end:e==null?void 0:e.end},h=ot(r,f.start,f.end);t(f,h)},i=a=>{let u=parseFloat(a.target.value),f={start:e==null?void 0:e.start,end:isNaN(u)?void 0:u},h=ot(r,f.start,f.end);t(f,h)};return(0,se.jsxs)("div",{style:{display:"flex",flexDirection:"row"},children:[(0,se.jsx)(fe.ToolbarField,{label:"From",children:(0,se.jsx)(fe.Input,{onChange:n,value:((s=e==null?void 0:e.start)==null?void 0:s.toString())||"",type:"number"})}),(0,se.jsx)(fe.ToolbarField,{label:"To",children:(0,se.jsx)(fe.Input,{onChange:i,value:((l=e==null?void 0:e.end)==null?void 0:l.toString())||"",type:"number"})})]})};var Wt=require("@vuu-ui/vuu-data-react"),Ht=require("@heswell/salt-lab"),re=require("react");var jt=require("react/jsx-runtime"),$t=({defaultTypeaheadParams:o,filterValues:e=[],onChange:t})=>{let[r,n]=o,[i,s]=(0,re.useState)(""),[l,a]=(0,re.useState)([]),u=(0,Wt.useTypeaheadSuggestions)();(0,re.useEffect)(()=>{let c=i?[r,n,i]:o,p=!0;return u(c).then(d=>{p&&(Ce(e[0])&&d.unshift(e[0]),i&&d.unshift(`${i}...`),d.concat(e),a(d))}),()=>{p=!1}},[e,i,n,r,u,o]);let f=(0,re.useCallback)(c=>{let p=c.target.value;s(p)},[]),h=(0,re.useCallback)((c,p)=>{if(s(""),p===null)return;p.some(Ce)&&(p=p.filter(Ce).slice(-1));let d=_t(n,p,Ce(p[0]));t(p,d)},[n,t]);return(0,jt.jsx)(Ht.ComboBoxDeprecated,{multiSelect:!0,onInputChange:f,onChange:h,source:l,style:{minWidth:200},inputValue:i,selectedItem:e},n)};var Gt=require("react"),ze=require("@heswell/salt-lab"),ke=require("react/jsx-runtime"),Xt=o=>(0,ke.jsx)(io,{...o}),io=(0,Gt.memo)(function({item:e,itemTextHighlightPattern:t,...r}){return(0,ke.jsx)(ze.ListItem,{...r,children:(0,ke.jsx)("span",{style:{marginLeft:10},children:(0,ke.jsx)(ze.Highlighter,{matchPattern:t,text:e==null?void 0:e.name})})})});var Zt=require("@vuu-ui/vuu-utils"),G=require("react");var nt=(o,e,t)=>o.filter(r=>r[t]!==e[t]).concat(e),Yt=o=>{var F,T;let[e,t]=(0,G.useState)(""),[r,n]=(0,G.useState)([]),[i,s]=(0,G.useState)([]),[l,a]=(0,G.useState)([]),u=()=>{t(""),s([]),a([]),n([]),o({filter:""})},f=(0,G.useCallback)(S=>{let y=nt(r,{column:e,filter:S},"column");n(y);let x=y.map(m=>m.filter).reduce((m,b)=>b===void 0?m:ve(m,b,{combineWith:D}),void 0),C=x===void 0?"":(0,Zt.filterAsQuery)(x);o({filter:C,filterStruct:x})},[e,o,r]),h=(0,G.useCallback)((S,y)=>{a(nt(l,{column:e,value:S},"column")),f(y)},[e,l,f]),c=(0,G.useCallback)((S,y)=>{s(nt(i,{column:e,value:S},"column")),f(y)},[e,i,f]),p=(0,G.useCallback)(S=>t((S==null?void 0:S.name)||""),[]),d=(F=i.filter(S=>S.column===e)[0])==null?void 0:F.value,g=(T=l.filter(S=>S.column===e)[0])==null?void 0:T.value;return{clear:u,selectedColumnName:e,rangeValue:d,typeaheadValue:g,onSelectedColumnChange:p,onRangeChange:c,onTypeaheadChange:h}};var Q=require("react/jsx-runtime"),so=({className:o,table:e,columns:t,onFilterSubmit:r,...n})=>{let{clear:i,onTypeaheadChange:s,onRangeChange:l,onSelectedColumnChange:a,selectedColumnName:u,rangeValue:f,typeaheadValue:h}=Yt(r);return(0,Q.jsxs)(U.Toolbar,{...n,style:{alignItems:"center",height:"36px"},children:[(0,Q.jsx)(U.ToolbarField,{label:"Select a column to filter",labelPlacement:"top",style:{width:180},children:(0,Q.jsx)(U.Dropdown,{source:t,ListItem:Xt,itemToString:p=>p.name,onSelectionChange:(p,d)=>a(d)})}),u&&(()=>{var g;let p=[e,u];switch((g=t.find(F=>F.name===u))==null?void 0:g.serverDataType){case"string":case"char":return(0,Q.jsx)(U.ToolbarField,{label:"Start typing to select a filter",labelPlacement:"top",children:(0,Q.jsx)($t,{defaultTypeaheadParams:p,filterValues:h,onChange:s})});case"int":case"long":case"double":return(0,Q.jsx)(U.ToolbarField,{label:"Select a range",labelPlacement:"top",children:(0,Q.jsx)(Ut,{defaultTypeaheadParams:p,filterValues:f,onChange:l})});default:return(0,Q.jsx)(U.ToolbarField,{children:(0,Q.jsx)(qt.Text,{children:"Data type unsupported"})})}})(),(0,Q.jsx)(U.ToolbarButton,{onClick:i,children:(0,Q.jsx)(Je,{})})]})};var yt=require("@salt-ds/core");var w=require("@vuu-ui/vuu-codemirror");var lo=0,Pe=class{constructor(e,t){this.from=e,this.to=t}},k=class{constructor(e={}){this.id=lo++,this.perNode=!!e.perNode,this.deserialize=e.deserialize||(()=>{throw new Error("This node type doesn't define a deserialize function")})}add(e){if(this.perNode)throw new RangeError("Can't add per-node props to node types");return typeof e!="function"&&(e=B.match(e)),t=>{let r=e(t);return r===void 0?null:[this,r]}}};k.closedBy=new k({deserialize:o=>o.split(" ")});k.openedBy=new k({deserialize:o=>o.split(" ")});k.group=new k({deserialize:o=>o.split(" ")});k.contextHash=new k({perNode:!0});k.lookAhead=new k({perNode:!0});k.mounted=new k({perNode:!0});var ao=Object.create(null),B=class{constructor(e,t,r,n=0){this.name=e,this.props=t,this.id=r,this.flags=n}static define(e){let t=e.props&&e.props.length?Object.create(null):ao,r=(e.top?1:0)|(e.skipped?2:0)|(e.error?4:0)|(e.name==null?8:0),n=new B(e.name||"",t,e.id,r);if(e.props){for(let i of e.props)if(Array.isArray(i)||(i=i(n)),i){if(i[0].perNode)throw new RangeError("Can't store a per-node prop on a node type");t[i[0].id]=i[1]}}return n}prop(e){return this.props[e.id]}get isTop(){return(this.flags&1)>0}get isSkipped(){return(this.flags&2)>0}get isError(){return(this.flags&4)>0}get isAnonymous(){return(this.flags&8)>0}is(e){if(typeof e=="string"){if(this.name==e)return!0;let t=this.prop(k.group);return t?t.indexOf(e)>-1:!1}return this.id==e}static match(e){let t=Object.create(null);for(let r in e)for(let n of r.split(" "))t[n]=e[r];return r=>{for(let n=r.prop(k.group),i=-1;i<(n?n.length:0);i++){let s=t[i<0?r.name:n[i]];if(s)return s}}}};B.none=new B("",Object.create(null),0,8);var ce=class{constructor(e){this.types=e;for(let t=0;t<e.length;t++)if(e[t].id!=t)throw new RangeError("Node type ids should correspond to array positions when creating a node set")}extend(...e){let t=[];for(let r of this.types){let n=null;for(let i of e){let s=i(r);s&&(n||(n=Object.assign({},r.props)),n[s[0].id]=s[1])}t.push(n?new B(r.name,n,r.id,r.flags):r)}return new ce(t)}},Qe=new WeakMap,Kt=new WeakMap,R;(function(o){o[o.ExcludeBuffers=1]="ExcludeBuffers",o[o.IncludeAnonymous=2]="IncludeAnonymous",o[o.IgnoreMounts=4]="IgnoreMounts",o[o.IgnoreOverlays=8]="IgnoreOverlays"})(R||(R={}));var E=class{constructor(e,t,r,n,i){if(this.type=e,this.children=t,this.positions=r,this.length=n,this.props=null,i&&i.length){this.props=Object.create(null);for(let[s,l]of i)this.props[typeof s=="number"?s:s.id]=l}}toString(){let e=this.prop(k.mounted);if(e&&!e.overlay)return e.tree.toString();let t="";for(let r of this.children){let n=r.toString();n&&(t&&(t+=","),t+=n)}return this.type.name?(/\W/.test(this.type.name)&&!this.type.isError?JSON.stringify(this.type.name):this.type.name)+(t.length?"("+t+")":""):t}cursor(e=0){return new de(this.topNode,e)}cursorAt(e,t=0,r=0){let n=Qe.get(this)||this.topNode,i=new de(n);return i.moveTo(e,t),Qe.set(this,i._tree),i}get topNode(){return new W(this,0,0,null)}resolve(e,t=0){let r=pe(Qe.get(this)||this.topNode,e,t,!1);return Qe.set(this,r),r}resolveInner(e,t=0){let r=pe(Kt.get(this)||this.topNode,e,t,!0);return Kt.set(this,r),r}iterate(e){let{enter:t,leave:r,from:n=0,to:i=this.length}=e,s=e.mode||0,l=(s&R.IncludeAnonymous)>0;for(let a=this.cursor(s|R.IncludeAnonymous);;){let u=!1;if(a.from<=i&&a.to>=n&&(!l&&a.type.isAnonymous||t(a)!==!1)){if(a.firstChild())continue;u=!0}for(;u&&r&&(l||!a.type.isAnonymous)&&r(a),!a.nextSibling();){if(!a.parent())return;u=!0}}}prop(e){return e.perNode?this.props?this.props[e.id]:void 0:this.type.prop(e)}get propValues(){let e=[];if(this.props)for(let t in this.props)e.push([+t,this.props[t]]);return e}balance(e={}){return this.children.length<=8?this:at(B.none,this.children,this.positions,0,this.children.length,0,this.length,(t,r,n)=>new E(this.type,t,r,n,this.propValues),e.makeTree||((t,r,n)=>new E(B.none,t,r,n)))}static build(e){return uo(e)}};E.empty=new E(B.none,[],[],0);var Oe=class{constructor(e,t){this.buffer=e,this.index=t}get id(){return this.buffer[this.index-4]}get start(){return this.buffer[this.index-3]}get end(){return this.buffer[this.index-2]}get size(){return this.buffer[this.index-1]}get pos(){return this.index}next(){this.index-=4}fork(){return new Oe(this.buffer,this.index)}},K=class{constructor(e,t,r){this.buffer=e,this.length=t,this.set=r}get type(){return B.none}toString(){let e=[];for(let t=0;t<this.buffer.length;)e.push(this.childString(t)),t=this.buffer[t+3];return e.join(",")}childString(e){let t=this.buffer[e],r=this.buffer[e+3],n=this.set.types[t],i=n.name;if(/\W/.test(i)&&!n.isError&&(i=JSON.stringify(i)),e+=4,r==e)return i;let s=[];for(;e<r;)s.push(this.childString(e)),e=this.buffer[e+3];return i+"("+s.join(",")+")"}findChild(e,t,r,n,i){let{buffer:s}=this,l=-1;for(let a=e;a!=t&&!(er(i,n,s[a+1],s[a+2])&&(l=a,r>0));a=s[a+3]);return l}slice(e,t,r){let n=this.buffer,i=new Uint16Array(t-e),s=0;for(let l=e,a=0;l<t;){i[a++]=n[l++],i[a++]=n[l++]-r;let u=i[a++]=n[l++]-r;i[a++]=n[l++]-e,s=Math.max(s,u)}return new K(i,s,this.set)}};function er(o,e,t,r){switch(o){case-2:return t<e;case-1:return r>=e&&t<e;case 0:return t<e&&r>e;case 1:return t<=e&&r>e;case 2:return r>e;case 4:return!0}}function tr(o,e){let t=o.childBefore(e);for(;t;){let r=t.lastChild;if(!r||r.to!=t.to)break;r.type.isError&&r.from==r.to?(o=t,t=r.prevSibling):t=r}return o}function pe(o,e,t,r){for(var n;o.from==o.to||(t<1?o.from>=e:o.from>e)||(t>-1?o.to<=e:o.to<e);){let s=!r&&o instanceof W&&o.index<0?null:o.parent;if(!s)return o;o=s}let i=r?0:R.IgnoreOverlays;if(r)for(let s=o,l=s.parent;l;s=l,l=s.parent)s instanceof W&&s.index<0&&((n=l.enter(e,t,i))===null||n===void 0?void 0:n.from)!=s.from&&(o=l);for(;;){let s=o.enter(e,t,i);if(!s)return o;o=s}}var W=class{constructor(e,t,r,n){this._tree=e,this.from=t,this.index=r,this._parent=n}get type(){return this._tree.type}get name(){return this._tree.type.name}get to(){return this.from+this._tree.length}nextChild(e,t,r,n,i=0){for(let s=this;;){for(let{children:l,positions:a}=s._tree,u=t>0?l.length:-1;e!=u;e+=t){let f=l[e],h=a[e]+s.from;if(er(n,r,h,h+f.length)){if(f instanceof K){if(i&R.ExcludeBuffers)continue;let c=f.findChild(0,f.buffer.length,t,r-h,n);if(c>-1)return new X(new it(s,f,e,h),null,c)}else if(i&R.IncludeAnonymous||!f.type.isAnonymous||lt(f)){let c;if(!(i&R.IgnoreMounts)&&f.props&&(c=f.prop(k.mounted))&&!c.overlay)return new W(c.tree,h,e,s);let p=new W(f,h,e,s);return i&R.IncludeAnonymous||!p.type.isAnonymous?p:p.nextChild(t<0?f.children.length-1:0,t,r,n)}}}if(i&R.IncludeAnonymous||!s.type.isAnonymous||(s.index>=0?e=s.index+t:e=t<0?-1:s._parent._tree.children.length,s=s._parent,!s))return null}}get firstChild(){return this.nextChild(0,1,0,4)}get lastChild(){return this.nextChild(this._tree.children.length-1,-1,0,4)}childAfter(e){return this.nextChild(0,1,e,2)}childBefore(e){return this.nextChild(this._tree.children.length-1,-1,e,-2)}enter(e,t,r=0){let n;if(!(r&R.IgnoreOverlays)&&(n=this._tree.prop(k.mounted))&&n.overlay){let i=e-this.from;for(let{from:s,to:l}of n.overlay)if((t>0?s<=i:s<i)&&(t<0?l>=i:l>i))return new W(n.tree,n.overlay[0].from+this.from,-1,this)}return this.nextChild(0,1,e,t,r)}nextSignificantParent(){let e=this;for(;e.type.isAnonymous&&e._parent;)e=e._parent;return e}get parent(){return this._parent?this._parent.nextSignificantParent():null}get nextSibling(){return this._parent&&this.index>=0?this._parent.nextChild(this.index+1,1,0,4):null}get prevSibling(){return this._parent&&this.index>=0?this._parent.nextChild(this.index-1,-1,0,4):null}cursor(e=0){return new de(this,e)}get tree(){return this._tree}toTree(){return this._tree}resolve(e,t=0){return pe(this,e,t,!1)}resolveInner(e,t=0){return pe(this,e,t,!0)}enterUnfinishedNodesBefore(e){return tr(this,e)}getChild(e,t=null,r=null){let n=Le(this,e,t,r);return n.length?n[0]:null}getChildren(e,t=null,r=null){return Le(this,e,t,r)}toString(){return this._tree.toString()}get node(){return this}matchContext(e){return _e(this,e)}};function Le(o,e,t,r){let n=o.cursor(),i=[];if(!n.firstChild())return i;if(t!=null){for(;!n.type.is(t);)if(!n.nextSibling())return i}for(;;){if(r!=null&&n.type.is(r))return i;if(n.type.is(e)&&i.push(n.node),!n.nextSibling())return r==null?i:[]}}function _e(o,e,t=e.length-1){for(let r=o.parent;t>=0;r=r.parent){if(!r)return!1;if(!r.type.isAnonymous){if(e[t]&&e[t]!=r.name)return!1;t--}}return!0}var it=class{constructor(e,t,r,n){this.parent=e,this.buffer=t,this.index=r,this.start=n}},X=class{get name(){return this.type.name}get from(){return this.context.start+this.context.buffer.buffer[this.index+1]}get to(){return this.context.start+this.context.buffer.buffer[this.index+2]}constructor(e,t,r){this.context=e,this._parent=t,this.index=r,this.type=e.buffer.set.types[e.buffer.buffer[r]]}child(e,t,r){let{buffer:n}=this.context,i=n.findChild(this.index+4,n.buffer[this.index+3],e,t-this.context.start,r);return i<0?null:new X(this.context,this,i)}get firstChild(){return this.child(1,0,4)}get lastChild(){return this.child(-1,0,4)}childAfter(e){return this.child(1,e,2)}childBefore(e){return this.child(-1,e,-2)}enter(e,t,r=0){if(r&R.ExcludeBuffers)return null;let{buffer:n}=this.context,i=n.findChild(this.index+4,n.buffer[this.index+3],t>0?1:-1,e-this.context.start,t);return i<0?null:new X(this.context,this,i)}get parent(){return this._parent||this.context.parent.nextSignificantParent()}externalSibling(e){return this._parent?null:this.context.parent.nextChild(this.context.index+e,e,0,4)}get nextSibling(){let{buffer:e}=this.context,t=e.buffer[this.index+3];return t<(this._parent?e.buffer[this._parent.index+3]:e.buffer.length)?new X(this.context,this._parent,t):this.externalSibling(1)}get prevSibling(){let{buffer:e}=this.context,t=this._parent?this._parent.index+4:0;return this.index==t?this.externalSibling(-1):new X(this.context,this._parent,e.findChild(t,this.index,-1,0,4))}cursor(e=0){return new de(this,e)}get tree(){return null}toTree(){let e=[],t=[],{buffer:r}=this.context,n=this.index+4,i=r.buffer[this.index+3];if(i>n){let s=r.buffer[this.index+1];e.push(r.slice(n,i,s)),t.push(0)}return new E(this.type,e,t,this.to-this.from)}resolve(e,t=0){return pe(this,e,t,!1)}resolveInner(e,t=0){return pe(this,e,t,!0)}enterUnfinishedNodesBefore(e){return tr(this,e)}toString(){return this.context.buffer.childString(this.index)}getChild(e,t=null,r=null){let n=Le(this,e,t,r);return n.length?n[0]:null}getChildren(e,t=null,r=null){return Le(this,e,t,r)}get node(){return this}matchContext(e){return _e(this,e)}},de=class{get name(){return this.type.name}constructor(e,t=0){if(this.mode=t,this.buffer=null,this.stack=[],this.index=0,this.bufferNode=null,e instanceof W)this.yieldNode(e);else{this._tree=e.context.parent,this.buffer=e.context;for(let r=e._parent;r;r=r._parent)this.stack.unshift(r.index);this.bufferNode=e,this.yieldBuf(e.index)}}yieldNode(e){return e?(this._tree=e,this.type=e.type,this.from=e.from,this.to=e.to,!0):!1}yieldBuf(e,t){this.index=e;let{start:r,buffer:n}=this.buffer;return this.type=t||n.set.types[n.buffer[e]],this.from=r+n.buffer[e+1],this.to=r+n.buffer[e+2],!0}yield(e){return e?e instanceof W?(this.buffer=null,this.yieldNode(e)):(this.buffer=e.context,this.yieldBuf(e.index,e.type)):!1}toString(){return this.buffer?this.buffer.buffer.childString(this.index):this._tree.toString()}enterChild(e,t,r){if(!this.buffer)return this.yield(this._tree.nextChild(e<0?this._tree._tree.children.length-1:0,e,t,r,this.mode));let{buffer:n}=this.buffer,i=n.findChild(this.index+4,n.buffer[this.index+3],e,t-this.buffer.start,r);return i<0?!1:(this.stack.push(this.index),this.yieldBuf(i))}firstChild(){return this.enterChild(1,0,4)}lastChild(){return this.enterChild(-1,0,4)}childAfter(e){return this.enterChild(1,e,2)}childBefore(e){return this.enterChild(-1,e,-2)}enter(e,t,r=this.mode){return this.buffer?r&R.ExcludeBuffers?!1:this.enterChild(1,e,t):this.yield(this._tree.enter(e,t,r))}parent(){if(!this.buffer)return this.yieldNode(this.mode&R.IncludeAnonymous?this._tree._parent:this._tree.parent);if(this.stack.length)return this.yieldBuf(this.stack.pop());let e=this.mode&R.IncludeAnonymous?this.buffer.parent:this.buffer.parent.nextSignificantParent();return this.buffer=null,this.yieldNode(e)}sibling(e){if(!this.buffer)return this._tree._parent?this.yield(this._tree.index<0?null:this._tree._parent.nextChild(this._tree.index+e,e,0,4,this.mode)):!1;let{buffer:t}=this.buffer,r=this.stack.length-1;if(e<0){let n=r<0?0:this.stack[r]+4;if(this.index!=n)return this.yieldBuf(t.findChild(n,this.index,-1,0,4))}else{let n=t.buffer[this.index+3];if(n<(r<0?t.buffer.length:t.buffer[this.stack[r]+3]))return this.yieldBuf(n)}return r<0?this.yield(this.buffer.parent.nextChild(this.buffer.index+e,e,0,4,this.mode)):!1}nextSibling(){return this.sibling(1)}prevSibling(){return this.sibling(-1)}atLastNode(e){let t,r,{buffer:n}=this;if(n){if(e>0){if(this.index<n.buffer.buffer.length)return!1}else for(let i=0;i<this.index;i++)if(n.buffer.buffer[i+3]<this.index)return!1;({index:t,parent:r}=n)}else({index:t,_parent:r}=this._tree);for(;r;{index:t,_parent:r}=r)if(t>-1)for(let i=t+e,s=e<0?-1:r._tree.children.length;i!=s;i+=e){let l=r._tree.children[i];if(this.mode&R.IncludeAnonymous||l instanceof K||!l.type.isAnonymous||lt(l))return!1}return!0}move(e,t){if(t&&this.enterChild(e,0,4))return!0;for(;;){if(this.sibling(e))return!0;if(this.atLastNode(e)||!this.parent())return!1}}next(e=!0){return this.move(1,e)}prev(e=!0){return this.move(-1,e)}moveTo(e,t=0){for(;(this.from==this.to||(t<1?this.from>=e:this.from>e)||(t>-1?this.to<=e:this.to<e))&&this.parent(););for(;this.enterChild(1,e,t););return this}get node(){if(!this.buffer)return this._tree;let e=this.bufferNode,t=null,r=0;if(e&&e.context==this.buffer)e:for(let n=this.index,i=this.stack.length;i>=0;){for(let s=e;s;s=s._parent)if(s.index==n){if(n==this.index)return s;t=s,r=i+1;break e}n=this.stack[--i]}for(let n=r;n<this.stack.length;n++)t=new X(this.buffer,t,this.stack[n]);return this.bufferNode=new X(this.buffer,t,this.index)}get tree(){return this.buffer?null:this._tree._tree}iterate(e,t){for(let r=0;;){let n=!1;if(this.type.isAnonymous||e(this)!==!1){if(this.firstChild()){r++;continue}this.type.isAnonymous||(n=!0)}for(;n&&t&&t(this),n=this.type.isAnonymous,!this.nextSibling();){if(!r)return;this.parent(),r--,n=!0}}}matchContext(e){if(!this.buffer)return _e(this.node,e);let{buffer:t}=this.buffer,{types:r}=t.set;for(let n=e.length-1,i=this.stack.length-1;n>=0;i--){if(i<0)return _e(this.node,e,n);let s=r[t.buffer[this.stack[i]]];if(!s.isAnonymous){if(e[n]&&e[n]!=s.name)return!1;n--}}return!0}};function lt(o){return o.children.some(e=>e instanceof K||!e.type.isAnonymous||lt(e))}function uo(o){var e;let{buffer:t,nodeSet:r,maxBufferLength:n=1024,reused:i=[],minRepeatType:s=r.types.length}=o,l=Array.isArray(t)?new Oe(t,t.length):t,a=r.types,u=0,f=0;function h(x,C,m,b,A){let{id:v,start:I,end:O,size:M}=l,L=f;for(;M<0;)if(l.next(),M==-1){let te=i[v];m.push(te),b.push(I-x);return}else if(M==-3){u=v;return}else if(M==-4){f=v;return}else throw new RangeError(`Unrecognized record size: ${M}`);let ue=a[v],ee,Y,vt=I-x;if(O-I<=n&&(Y=g(l.pos-C,A))){let te=new Uint16Array(Y.size-Y.skip),_=l.pos-Y.size,q=te.length;for(;l.pos>_;)q=F(Y.start,te,q);ee=new K(te,O-Y.start,r),vt=Y.start-x}else{let te=l.pos-M;l.next();let _=[],q=[],ie=v>=s?v:-1,he=0,Ee=O;for(;l.pos>te;)ie>=0&&l.id==ie&&l.size>=0?(l.end<=Ee-n&&(p(_,q,I,he,l.end,Ee,ie,L),he=_.length,Ee=l.end),l.next()):h(I,te,_,q,ie);if(ie>=0&&he>0&&he<_.length&&p(_,q,I,he,I,Ee,ie,L),_.reverse(),q.reverse(),ie>-1&&he>0){let Ct=c(ue);ee=at(ue,_,q,0,_.length,0,O-I,Ct,Ct)}else ee=d(ue,_,q,O-I,L-O)}m.push(ee),b.push(vt)}function c(x){return(C,m,b)=>{let A=0,v=C.length-1,I,O;if(v>=0&&(I=C[v])instanceof E){if(!v&&I.type==x&&I.length==b)return I;(O=I.prop(k.lookAhead))&&(A=m[v]+I.length+O)}return d(x,C,m,b,A)}}function p(x,C,m,b,A,v,I,O){let M=[],L=[];for(;x.length>b;)M.push(x.pop()),L.push(C.pop()+m-A);x.push(d(r.types[I],M,L,v-A,O-v)),C.push(A-m)}function d(x,C,m,b,A=0,v){if(u){let I=[k.contextHash,u];v=v?[I].concat(v):[I]}if(A>25){let I=[k.lookAhead,A];v=v?[I].concat(v):[I]}return new E(x,C,m,b,v)}function g(x,C){let m=l.fork(),b=0,A=0,v=0,I=m.end-n,O={size:0,start:0,skip:0};e:for(let M=m.pos-x;m.pos>M;){let L=m.size;if(m.id==C&&L>=0){O.size=b,O.start=A,O.skip=v,v+=4,b+=4,m.next();continue}let ue=m.pos-L;if(L<0||ue<M||m.start<I)break;let ee=m.id>=s?4:0,Y=m.start;for(m.next();m.pos>ue;){if(m.size<0)if(m.size==-3)ee+=4;else break e;else m.id>=s&&(ee+=4);m.next()}A=Y,b+=L,v+=ee}return(C<0||b==x)&&(O.size=b,O.start=A,O.skip=v),O.size>4?O:void 0}function F(x,C,m){let{id:b,start:A,end:v,size:I}=l;if(l.next(),I>=0&&b<s){let O=m;if(I>4){let M=l.pos-(I-4);for(;l.pos>M;)m=F(x,C,m)}C[--m]=O,C[--m]=v-x,C[--m]=A-x,C[--m]=b}else I==-3?u=b:I==-4&&(f=b);return m}let T=[],S=[];for(;l.pos>0;)h(o.start||0,o.bufferStart||0,T,S,-1);let y=(e=o.length)!==null&&e!==void 0?e:T.length?S[0]+T[0].length:0;return new E(a[o.topID],T.reverse(),S.reverse(),y)}var Jt=new WeakMap;function Ve(o,e){if(!o.isAnonymous||e instanceof K||e.type!=o)return 1;let t=Jt.get(e);if(t==null){t=1;for(let r of e.children){if(r.type!=o||!(r instanceof E)){t=1;break}t+=Ve(o,r)}Jt.set(e,t)}return t}function at(o,e,t,r,n,i,s,l,a){let u=0;for(let d=r;d<n;d++)u+=Ve(o,e[d]);let f=Math.ceil(u*1.5/8),h=[],c=[];function p(d,g,F,T,S){for(let y=F;y<T;){let x=y,C=g[y],m=Ve(o,d[y]);for(y++;y<T;y++){let b=Ve(o,d[y]);if(m+b>=f)break;m+=b}if(y==x+1){if(m>f){let b=d[x];p(b.children,b.positions,0,b.children.length,g[x]+S);continue}h.push(d[x])}else{let b=g[y-1]+d[y-1].length-C;h.push(at(o,d,g,x,y,C,b,null,a))}c.push(C+S-i)}}return p(e,t,r,n,0),(l||a)(h,c,s)}var Ue=class{startParse(e,t,r){return typeof e=="string"&&(e=new st(e)),r=r?r.length?r.map(n=>new Pe(n.from,n.to)):[new Pe(0,0)]:[new Pe(0,e.length)],this.createParse(e,t||[],r)}parse(e,t,r){let n=this.startParse(e,t,r);for(;;){let i=n.advance();if(i)return i}}},st=class{constructor(e){this.string=e}get length(){return this.string.length}chunk(e){return this.string.slice(e)}get lineChunks(){return!1}read(e,t){return this.string.slice(e,t)}};var Sn=new k({perNode:!0});var ge=class{constructor(e,t,r,n,i,s,l,a,u,f=0,h){this.p=e,this.stack=t,this.state=r,this.reducePos=n,this.pos=i,this.score=s,this.buffer=l,this.bufferBase=a,this.curContext=u,this.lookAhead=f,this.parent=h}toString(){return`[${this.stack.filter((e,t)=>t%3==0).concat(this.state)}]@${this.pos}${this.score?"!"+this.score:""}`}static start(e,t,r=0){let n=e.parser.context;return new ge(e,[],t,r,r,0,[],0,n?new We(n,n.start):null,0,null)}get context(){return this.curContext?this.curContext.context:null}pushState(e,t){this.stack.push(this.state,t,this.bufferBase+this.buffer.length),this.state=e}reduce(e){var t;let r=e>>19,n=e&65535,{parser:i}=this.p,s=i.dynamicPrecedence(n);if(s&&(this.score+=s),r==0){this.pushState(i.getGoto(this.state,n,!0),this.reducePos),n<i.minRepeatTerm&&this.storeNode(n,this.reducePos,this.reducePos,4,!0),this.reduceContext(n,this.reducePos);return}let l=this.stack.length-(r-1)*3-(e&262144?6:0),a=l?this.stack[l-2]:this.p.ranges[0].from,u=this.reducePos-a;u>=2e3&&!(!((t=this.p.parser.nodeSet.types[n])===null||t===void 0)&&t.isAnonymous)&&(a==this.p.lastBigReductionStart?(this.p.bigReductionCount++,this.p.lastBigReductionSize=u):this.p.lastBigReductionSize<u&&(this.p.bigReductionCount=1,this.p.lastBigReductionStart=a,this.p.lastBigReductionSize=u));let f=l?this.stack[l-1]:0,h=this.bufferBase+this.buffer.length-f;if(n<i.minRepeatTerm||e&131072){let c=i.stateFlag(this.state,1)?this.pos:this.reducePos;this.storeNode(n,a,c,h+4,!0)}if(e&262144)this.state=this.stack[l];else{let c=this.stack[l-3];this.state=i.getGoto(c,n,!0)}for(;this.stack.length>l;)this.stack.pop();this.reduceContext(n,a)}storeNode(e,t,r,n=4,i=!1){if(e==0&&(!this.stack.length||this.stack[this.stack.length-1]<this.buffer.length+this.bufferBase)){let s=this,l=this.buffer.length;if(l==0&&s.parent&&(l=s.bufferBase-s.parent.bufferBase,s=s.parent),l>0&&s.buffer[l-4]==0&&s.buffer[l-1]>-1){if(t==r)return;if(s.buffer[l-2]>=t){s.buffer[l-2]=r;return}}}if(!i||this.pos==r)this.buffer.push(e,t,r,n);else{let s=this.buffer.length;if(s>0&&this.buffer[s-4]!=0)for(;s>0&&this.buffer[s-2]>r;)this.buffer[s]=this.buffer[s-4],this.buffer[s+1]=this.buffer[s-3],this.buffer[s+2]=this.buffer[s-2],this.buffer[s+3]=this.buffer[s-1],s-=4,n>4&&(n-=4);this.buffer[s]=e,this.buffer[s+1]=t,this.buffer[s+2]=r,this.buffer[s+3]=n}}shift(e,t,r){let n=this.pos;if(e&131072)this.pushState(e&65535,this.pos);else if(e&262144)this.pos=r,this.shiftContext(t,n),t<=this.p.parser.maxNode&&this.buffer.push(t,n,r,4);else{let i=e,{parser:s}=this.p;(r>this.pos||t<=s.maxNode)&&(this.pos=r,s.stateFlag(i,1)||(this.reducePos=r)),this.pushState(i,n),this.shiftContext(t,n),t<=s.maxNode&&this.buffer.push(t,n,r,4)}}apply(e,t,r){e&65536?this.reduce(e):this.shift(e,t,r)}useNode(e,t){let r=this.p.reused.length-1;(r<0||this.p.reused[r]!=e)&&(this.p.reused.push(e),r++);let n=this.pos;this.reducePos=this.pos=n+e.length,this.pushState(t,n),this.buffer.push(r,n,this.reducePos,-1),this.curContext&&this.updateContext(this.curContext.tracker.reuse(this.curContext.context,e,this,this.p.stream.reset(this.pos-e.length)))}split(){let e=this,t=e.buffer.length;for(;t>0&&e.buffer[t-2]>e.reducePos;)t-=4;let r=e.buffer.slice(t),n=e.bufferBase+t;for(;e&&n==e.bufferBase;)e=e.parent;return new ge(this.p,this.stack.slice(),this.state,this.reducePos,this.pos,this.score,r,n,this.curContext,this.lookAhead,e)}recoverByDelete(e,t){let r=e<=this.p.parser.maxNode;r&&this.storeNode(e,this.pos,t,4),this.storeNode(0,this.pos,t,r?8:4),this.pos=this.reducePos=t,this.score-=190}canShift(e){for(let t=new ht(this);;){let r=this.p.parser.stateSlot(t.state,4)||this.p.parser.hasAction(t.state,e);if(r==0)return!1;if(!(r&65536))return!0;t.reduce(r)}}recoverByInsert(e){if(this.stack.length>=300)return[];let t=this.p.parser.nextStates(this.state);if(t.length>4<<1||this.stack.length>=120){let n=[];for(let i=0,s;i<t.length;i+=2)(s=t[i+1])!=this.state&&this.p.parser.hasAction(s,e)&&n.push(t[i],s);if(this.stack.length<120)for(let i=0;n.length<4<<1&&i<t.length;i+=2){let s=t[i+1];n.some((l,a)=>a&1&&l==s)||n.push(t[i],s)}t=n}let r=[];for(let n=0;n<t.length&&r.length<4;n+=2){let i=t[n+1];if(i==this.state)continue;let s=this.split();s.pushState(i,this.pos),s.storeNode(0,s.pos,s.pos,4,!0),s.shiftContext(t[n],this.pos),s.score-=200,r.push(s)}return r}forceReduce(){let{parser:e}=this.p,t=e.stateSlot(this.state,5);if(!(t&65536))return!1;if(!e.validAction(this.state,t)){let r=t>>19,n=t&65535,i=this.stack.length-r*3;if(i<0||e.getGoto(this.stack[i],n,!1)<0){let s=this.findForcedReduction();if(s==null)return!1;t=s}this.storeNode(0,this.pos,this.pos,4,!0),this.score-=100}return this.reducePos=this.pos,this.reduce(t),!0}findForcedReduction(){let{parser:e}=this.p,t=[],r=(n,i)=>{if(!t.includes(n))return t.push(n),e.allActions(n,s=>{if(!(s&393216))if(s&65536){let l=(s>>19)-i;if(l>1){let a=s&65535,u=this.stack.length-l*3;if(u>=0&&e.getGoto(this.stack[u],a,!1)>=0)return l<<19|65536|a}}else{let l=r(s,i+1);if(l!=null)return l}})};return r(this.state,0)}forceAll(){for(;!this.p.parser.stateFlag(this.state,2);)if(!this.forceReduce()){this.storeNode(0,this.pos,this.pos,4,!0);break}return this}get deadEnd(){if(this.stack.length!=3)return!1;let{parser:e}=this.p;return e.data[e.stateSlot(this.state,1)]==65535&&!e.stateSlot(this.state,4)}restart(){this.state=this.stack[0],this.stack.length=0}sameState(e){if(this.state!=e.state||this.stack.length!=e.stack.length)return!1;for(let t=0;t<this.stack.length;t+=3)if(this.stack[t]!=e.stack[t])return!1;return!0}get parser(){return this.p.parser}dialectEnabled(e){return this.p.parser.dialect.flags[e]}shiftContext(e,t){this.curContext&&this.updateContext(this.curContext.tracker.shift(this.curContext.context,e,this,this.p.stream.reset(t)))}reduceContext(e,t){this.curContext&&this.updateContext(this.curContext.tracker.reduce(this.curContext.context,e,this,this.p.stream.reset(t)))}emitContext(){let e=this.buffer.length-1;(e<0||this.buffer[e]!=-3)&&this.buffer.push(this.curContext.hash,this.pos,this.pos,-3)}emitLookAhead(){let e=this.buffer.length-1;(e<0||this.buffer[e]!=-4)&&this.buffer.push(this.lookAhead,this.pos,this.pos,-4)}updateContext(e){if(e!=this.curContext.context){let t=new We(this.curContext.tracker,e);t.hash!=this.curContext.hash&&this.emitContext(),this.curContext=t}}setLookAhead(e){e>this.lookAhead&&(this.emitLookAhead(),this.lookAhead=e)}close(){this.curContext&&this.curContext.tracker.strict&&this.emitContext(),this.lookAhead>0&&this.emitLookAhead()}},We=class{constructor(e,t){this.tracker=e,this.context=t,this.hash=e.strict?e.hash(t):0}},rr;(function(o){o[o.Insert=200]="Insert",o[o.Delete=190]="Delete",o[o.Reduce=100]="Reduce",o[o.MaxNext=4]="MaxNext",o[o.MaxInsertStackDepth=300]="MaxInsertStackDepth",o[o.DampenInsertStackDepth=120]="DampenInsertStackDepth",o[o.MinBigReduction=2e3]="MinBigReduction"})(rr||(rr={}));var ht=class{constructor(e){this.start=e,this.state=e.state,this.stack=e.stack,this.base=this.stack.length}reduce(e){let t=e&65535,r=e>>19;r==0?(this.stack==this.start.stack&&(this.stack=this.stack.slice()),this.stack.push(this.state,0,0),this.base+=3):this.base-=(r-1)*3;let n=this.start.p.parser.getGoto(this.stack[this.base-3],t,!0);this.state=n}},xe=class{constructor(e,t,r){this.stack=e,this.pos=t,this.index=r,this.buffer=e.buffer,this.index==0&&this.maybeNext()}static create(e,t=e.bufferBase+e.buffer.length){return new xe(e,t,t-e.bufferBase)}maybeNext(){let e=this.stack.parent;e!=null&&(this.index=this.stack.bufferBase-e.bufferBase,this.stack=e,this.buffer=e.buffer)}get id(){return this.buffer[this.index-4]}get start(){return this.buffer[this.index-3]}get end(){return this.buffer[this.index-2]}get size(){return this.buffer[this.index-1]}next(){this.index-=4,this.pos-=4,this.index==0&&this.maybeNext()}fork(){return new xe(this.stack,this.pos,this.index)}};function Fe(o,e=Uint16Array){if(typeof o!="string")return o;let t=null;for(let r=0,n=0;r<o.length;){let i=0;for(;;){let s=o.charCodeAt(r++),l=!1;if(s==126){i=65535;break}s>=92&&s--,s>=34&&s--;let a=s-32;if(a>=46&&(a-=46,l=!0),i+=a,l)break;i*=46}t?t[n++]=i:t=new e(i)}return t}var me=class{constructor(){this.start=-1,this.value=-1,this.end=-1,this.extended=-1,this.lookAhead=0,this.mask=0,this.context=0}},or=new me,ft=class{constructor(e,t){this.input=e,this.ranges=t,this.chunk="",this.chunkOff=0,this.chunk2="",this.chunk2Pos=0,this.next=-1,this.token=or,this.rangeIndex=0,this.pos=this.chunkPos=t[0].from,this.range=t[0],this.end=t[t.length-1].to,this.readNext()}resolveOffset(e,t){let r=this.range,n=this.rangeIndex,i=this.pos+e;for(;i<r.from;){if(!n)return null;let s=this.ranges[--n];i-=r.from-s.to,r=s}for(;t<0?i>r.to:i>=r.to;){if(n==this.ranges.length-1)return null;let s=this.ranges[++n];i+=s.from-r.to,r=s}return i}clipPos(e){if(e>=this.range.from&&e<this.range.to)return e;for(let t of this.ranges)if(t.to>e)return Math.max(e,t.from);return this.end}peek(e){let t=this.chunkOff+e,r,n;if(t>=0&&t<this.chunk.length)r=this.pos+e,n=this.chunk.charCodeAt(t);else{let i=this.resolveOffset(e,1);if(i==null)return-1;if(r=i,r>=this.chunk2Pos&&r<this.chunk2Pos+this.chunk2.length)n=this.chunk2.charCodeAt(r-this.chunk2Pos);else{let s=this.rangeIndex,l=this.range;for(;l.to<=r;)l=this.ranges[++s];this.chunk2=this.input.chunk(this.chunk2Pos=r),r+this.chunk2.length>l.to&&(this.chunk2=this.chunk2.slice(0,l.to-r)),n=this.chunk2.charCodeAt(0)}}return r>=this.token.lookAhead&&(this.token.lookAhead=r+1),n}acceptToken(e,t=0){let r=t?this.resolveOffset(t,-1):this.pos;if(r==null||r<this.token.start)throw new RangeError("Token end out of bounds");this.token.value=e,this.token.end=r}getChunk(){if(this.pos>=this.chunk2Pos&&this.pos<this.chunk2Pos+this.chunk2.length){let{chunk:e,chunkPos:t}=this;this.chunk=this.chunk2,this.chunkPos=this.chunk2Pos,this.chunk2=e,this.chunk2Pos=t,this.chunkOff=this.pos-this.chunkPos}else{this.chunk2=this.chunk,this.chunk2Pos=this.chunkPos;let e=this.input.chunk(this.pos),t=this.pos+e.length;this.chunk=t>this.range.to?e.slice(0,this.range.to-this.pos):e,this.chunkPos=this.pos,this.chunkOff=0}}readNext(){return this.chunkOff>=this.chunk.length&&(this.getChunk(),this.chunkOff==this.chunk.length)?this.next=-1:this.next=this.chunk.charCodeAt(this.chunkOff)}advance(e=1){for(this.chunkOff+=e;this.pos+e>=this.range.to;){if(this.rangeIndex==this.ranges.length-1)return this.setDone();e-=this.range.to-this.pos,this.range=this.ranges[++this.rangeIndex],this.pos=this.range.from}return this.pos+=e,this.pos>=this.token.lookAhead&&(this.token.lookAhead=this.pos+1),this.readNext()}setDone(){return this.pos=this.chunkPos=this.end,this.range=this.ranges[this.rangeIndex=this.ranges.length-1],this.chunk="",this.next=-1}reset(e,t){if(t?(this.token=t,t.start=e,t.lookAhead=e+1,t.value=t.extended=-1):this.token=or,this.pos!=e){if(this.pos=e,e==this.end)return this.setDone(),this;for(;e<this.range.from;)this.range=this.ranges[--this.rangeIndex];for(;e>=this.range.to;)this.range=this.ranges[++this.rangeIndex];e>=this.chunkPos&&e<this.chunkPos+this.chunk.length?this.chunkOff=e-this.chunkPos:(this.chunk="",this.chunkOff=0),this.readNext()}return this}read(e,t){if(e>=this.chunkPos&&t<=this.chunkPos+this.chunk.length)return this.chunk.slice(e-this.chunkPos,t-this.chunkPos);if(e>=this.chunk2Pos&&t<=this.chunk2Pos+this.chunk2.length)return this.chunk2.slice(e-this.chunk2Pos,t-this.chunk2Pos);if(e>=this.range.from&&t<=this.range.to)return this.input.read(e,t);let r="";for(let n of this.ranges){if(n.from>=t)break;n.to>e&&(r+=this.input.read(Math.max(n.from,e),Math.min(n.to,t)))}return r}},oe=class{constructor(e,t){this.data=e,this.id=t}token(e,t){let{parser:r}=t.p;hr(this.data,e,t,this.id,r.data,r.tokenPrecTable)}};oe.prototype.contextual=oe.prototype.fallback=oe.prototype.extend=!1;var ct=class{constructor(e,t,r){this.precTable=t,this.elseToken=r,this.data=typeof e=="string"?Fe(e):e}token(e,t){let r=e.pos,n=0;for(;;){let i=e.next<0,s=e.resolveOffset(1,1);if(hr(this.data,e,t,0,this.data,this.precTable),e.token.value>-1)break;if(this.elseToken==null)return;if(i||n++,s==null)break;e.reset(s,e.token)}n&&(e.reset(r,e.token),e.acceptToken(this.elseToken,n))}};ct.prototype.contextual=oe.prototype.fallback=oe.prototype.extend=!1;function hr(o,e,t,r,n,i){let s=0,l=1<<r,{dialect:a}=t.p.parser;e:for(;l&o[s];){let u=o[s+1];for(let p=s+3;p<u;p+=2)if((o[p+1]&l)>0){let d=o[p];if(a.allows(d)&&(e.token.value==-1||e.token.value==d||fo(d,e.token.value,n,i))){e.acceptToken(d);break}}let f=e.next,h=0,c=o[s+2];if(e.next<0&&c>h&&o[u+c*3-3]==65535&&o[u+c*3-3]==65535){s=o[u+c*3-1];continue e}for(;h<c;){let p=h+c>>1,d=u+p+(p<<1),g=o[d],F=o[d+1]||65536;if(f<g)c=p;else if(f>=F)h=p+1;else{s=o[d+2],e.advance();continue e}}break}}function nr(o,e,t){for(let r=e,n;(n=o[r])!=65535;r++)if(n==t)return r-e;return-1}function fo(o,e,t,r){let n=nr(t,r,e);return n<0||nr(t,r,o)<n}var H=typeof process<"u"&&process.env&&/\bparse\b/.test(process.env.LOG),ut=null,ir;(function(o){o[o.Margin=25]="Margin"})(ir||(ir={}));function sr(o,e,t){let r=o.cursor(R.IncludeAnonymous);for(r.moveTo(e);;)if(!(t<0?r.childBefore(e):r.childAfter(e)))for(;;){if((t<0?r.to<e:r.from>e)&&!r.type.isError)return t<0?Math.max(0,Math.min(r.to-1,e-25)):Math.min(o.length,Math.max(r.from+1,e+25));if(t<0?r.prevSibling():r.nextSibling())break;if(!r.parent())return t<0?0:o.length}}var pt=class{constructor(e,t){this.fragments=e,this.nodeSet=t,this.i=0,this.fragment=null,this.safeFrom=-1,this.safeTo=-1,this.trees=[],this.start=[],this.index=[],this.nextFragment()}nextFragment(){let e=this.fragment=this.i==this.fragments.length?null:this.fragments[this.i++];if(e){for(this.safeFrom=e.openStart?sr(e.tree,e.from+e.offset,1)-e.offset:e.from,this.safeTo=e.openEnd?sr(e.tree,e.to+e.offset,-1)-e.offset:e.to;this.trees.length;)this.trees.pop(),this.start.pop(),this.index.pop();this.trees.push(e.tree),this.start.push(-e.offset),this.index.push(0),this.nextStart=this.safeFrom}else this.nextStart=1e9}nodeAt(e){if(e<this.nextStart)return null;for(;this.fragment&&this.safeTo<=e;)this.nextFragment();if(!this.fragment)return null;for(;;){let t=this.trees.length-1;if(t<0)return this.nextFragment(),null;let r=this.trees[t],n=this.index[t];if(n==r.children.length){this.trees.pop(),this.start.pop(),this.index.pop();continue}let i=r.children[n],s=this.start[t]+r.positions[n];if(s>e)return this.nextStart=s,null;if(i instanceof E){if(s==e){if(s<this.safeFrom)return null;let l=s+i.length;if(l<=this.safeTo){let a=i.prop(k.lookAhead);if(!a||l+a<this.fragment.to)return i}}this.index[t]++,s+i.length>=Math.max(this.safeFrom,e)&&(this.trees.push(i),this.start.push(s),this.index.push(0))}else this.index[t]++,this.nextStart=s+i.length}}},dt=class{constructor(e,t){this.stream=t,this.tokens=[],this.mainToken=null,this.actions=[],this.tokens=e.tokenizers.map(r=>new me)}getActions(e){let t=0,r=null,{parser:n}=e.p,{tokenizers:i}=n,s=n.stateSlot(e.state,3),l=e.curContext?e.curContext.hash:0,a=0;for(let u=0;u<i.length;u++){if(!(1<<u&s))continue;let f=i[u],h=this.tokens[u];if(!(r&&!f.fallback)&&((f.contextual||h.start!=e.pos||h.mask!=s||h.context!=l)&&(this.updateCachedToken(h,f,e),h.mask=s,h.context=l),h.lookAhead>h.end+25&&(a=Math.max(h.lookAhead,a)),h.value!=0)){let c=t;if(h.extended>-1&&(t=this.addActions(e,h.extended,h.end,t)),t=this.addActions(e,h.value,h.end,t),!f.extend&&(r=h,t>c))break}}for(;this.actions.length>t;)this.actions.pop();return a&&e.setLookAhead(a),!r&&e.pos==this.stream.end&&(r=new me,r.value=e.p.parser.eofTerm,r.start=r.end=e.pos,t=this.addActions(e,r.value,r.end,t)),this.mainToken=r,this.actions}getMainToken(e){if(this.mainToken)return this.mainToken;let t=new me,{pos:r,p:n}=e;return t.start=r,t.end=Math.min(r+1,n.stream.end),t.value=r==n.stream.end?n.parser.eofTerm:0,t}updateCachedToken(e,t,r){let n=this.stream.clipPos(r.pos);if(t.token(this.stream.reset(n,e),r),e.value>-1){let{parser:i}=r.p;for(let s=0;s<i.specialized.length;s++)if(i.specialized[s]==e.value){let l=i.specializers[s](this.stream.read(e.start,e.end),r);if(l>=0&&r.p.parser.dialect.allows(l>>1)){l&1?e.extended=l>>1:e.value=l>>1;break}}}else e.value=0,e.end=this.stream.clipPos(n+1)}putAction(e,t,r,n){for(let i=0;i<n;i+=3)if(this.actions[i]==e)return n;return this.actions[n++]=e,this.actions[n++]=t,this.actions[n++]=r,n}addActions(e,t,r,n){let{state:i}=e,{parser:s}=e.p,{data:l}=s;for(let a=0;a<2;a++)for(let u=s.stateSlot(i,a?2:1);;u+=3){if(l[u]==65535)if(l[u+1]==1)u=J(l,u+2);else{n==0&&l[u+1]==2&&(n=this.putAction(J(l,u+2),t,r,n));break}l[u]==t&&(n=this.putAction(J(l,u+1),t,r,n))}return n}},lr;(function(o){o[o.Distance=5]="Distance",o[o.MaxRemainingPerStep=3]="MaxRemainingPerStep",o[o.MinBufferLengthPrune=500]="MinBufferLengthPrune",o[o.ForceReduceLimit=10]="ForceReduceLimit",o[o.CutDepth=15e3]="CutDepth",o[o.CutTo=9e3]="CutTo",o[o.MaxLeftAssociativeReductionCount=300]="MaxLeftAssociativeReductionCount",o[o.MaxStackCount=12]="MaxStackCount"})(lr||(lr={}));var mt=class{constructor(e,t,r,n){this.parser=e,this.input=t,this.ranges=n,this.recovering=0,this.nextStackID=9812,this.minStackPos=0,this.reused=[],this.stoppedAt=null,this.lastBigReductionStart=-1,this.lastBigReductionSize=0,this.bigReductionCount=0,this.stream=new ft(t,n),this.tokens=new dt(e,this.stream),this.topTerm=e.top[1];let{from:i}=n[0];this.stacks=[ge.start(this,e.top[0],i)],this.fragments=r.length&&this.stream.end-i>e.bufferLength*4?new pt(r,e.nodeSet):null}get parsedPos(){return this.minStackPos}advance(){let e=this.stacks,t=this.minStackPos,r=this.stacks=[],n,i;if(this.bigReductionCount>300&&e.length==1){let[s]=e;for(;s.forceReduce()&&s.stack.length&&s.stack[s.stack.length-2]>=this.lastBigReductionStart;);this.bigReductionCount=this.lastBigReductionSize=0}for(let s=0;s<e.length;s++){let l=e[s];for(;;){if(this.tokens.mainToken=null,l.pos>t)r.push(l);else{if(this.advanceStack(l,r,e))continue;{n||(n=[],i=[]),n.push(l);let a=this.tokens.getMainToken(l);i.push(a.value,a.end)}}break}}if(!r.length){let s=n&&co(n);if(s)return this.stackToTree(s);if(this.parser.strict)throw H&&n&&console.log("Stuck with token "+(this.tokens.mainToken?this.parser.getName(this.tokens.mainToken.value):"none")),new SyntaxError("No parse at "+t);this.recovering||(this.recovering=5)}if(this.recovering&&n){let s=this.stoppedAt!=null&&n[0].pos>this.stoppedAt?n[0]:this.runRecovery(n,i,r);if(s)return this.stackToTree(s.forceAll())}if(this.recovering){let s=this.recovering==1?1:this.recovering*3;if(r.length>s)for(r.sort((l,a)=>a.score-l.score);r.length>s;)r.pop();r.some(l=>l.reducePos>t)&&this.recovering--}else if(r.length>1){e:for(let s=0;s<r.length-1;s++){let l=r[s];for(let a=s+1;a<r.length;a++){let u=r[a];if(l.sameState(u)||l.buffer.length>500&&u.buffer.length>500)if((l.score-u.score||l.buffer.length-u.buffer.length)>0)r.splice(a--,1);else{r.splice(s--,1);continue e}}}r.length>12&&r.splice(12,r.length-12)}this.minStackPos=r[0].pos;for(let s=1;s<r.length;s++)r[s].pos<this.minStackPos&&(this.minStackPos=r[s].pos);return null}stopAt(e){if(this.stoppedAt!=null&&this.stoppedAt<e)throw new RangeError("Can't move stoppedAt forward");this.stoppedAt=e}advanceStack(e,t,r){let n=e.pos,{parser:i}=this,s=H?this.stackID(e)+" -> ":"";if(this.stoppedAt!=null&&n>this.stoppedAt)return e.forceReduce()?e:null;if(this.fragments){let u=e.curContext&&e.curContext.tracker.strict,f=u?e.curContext.hash:0;for(let h=this.fragments.nodeAt(n);h;){let c=this.parser.nodeSet.types[h.type.id]==h.type?i.getGoto(e.state,h.type.id):-1;if(c>-1&&h.length&&(!u||(h.prop(k.contextHash)||0)==f))return e.useNode(h,c),H&&console.log(s+this.stackID(e)+` (via reuse of ${i.getName(h.type.id)})`),!0;if(!(h instanceof E)||h.children.length==0||h.positions[0]>0)break;let p=h.children[0];if(p instanceof E&&h.positions[0]==0)h=p;else break}}let l=i.stateSlot(e.state,4);if(l>0)return e.reduce(l),H&&console.log(s+this.stackID(e)+` (via always-reduce ${i.getName(l&65535)})`),!0;if(e.stack.length>=15e3)for(;e.stack.length>9e3&&e.forceReduce(););let a=this.tokens.getActions(e);for(let u=0;u<a.length;){let f=a[u++],h=a[u++],c=a[u++],p=u==a.length||!r,d=p?e:e.split();if(d.apply(f,h,c),H&&console.log(s+this.stackID(d)+` (via ${f&65536?`reduce of ${i.getName(f&65535)}`:"shift"} for ${i.getName(h)} @ ${n}${d==e?"":", split"})`),p)return!0;d.pos>n?t.push(d):r.push(d)}return!1}advanceFully(e,t){let r=e.pos;for(;;){if(!this.advanceStack(e,null,null))return!1;if(e.pos>r)return ar(e,t),!0}}runRecovery(e,t,r){let n=null,i=!1;for(let s=0;s<e.length;s++){let l=e[s],a=t[s<<1],u=t[(s<<1)+1],f=H?this.stackID(l)+" -> ":"";if(l.deadEnd&&(i||(i=!0,l.restart(),H&&console.log(f+this.stackID(l)+" (restarted)"),this.advanceFully(l,r))))continue;let h=l.split(),c=f;for(let p=0;h.forceReduce()&&p<10&&(H&&console.log(c+this.stackID(h)+" (via force-reduce)"),!this.advanceFully(h,r));p++)H&&(c=this.stackID(h)+" -> ");for(let p of l.recoverByInsert(a))H&&console.log(f+this.stackID(p)+" (via recover-insert)"),this.advanceFully(p,r);this.stream.end>l.pos?(u==l.pos&&(u++,a=0),l.recoverByDelete(a,u),H&&console.log(f+this.stackID(l)+` (via recover-delete ${this.parser.getName(a)})`),ar(l,r)):(!n||n.score<l.score)&&(n=l)}return n}stackToTree(e){return e.close(),E.build({buffer:xe.create(e),nodeSet:this.parser.nodeSet,topID:this.topTerm,maxBufferLength:this.parser.bufferLength,reused:this.reused,start:this.ranges[0].from,length:e.pos-this.ranges[0].from,minRepeatType:this.parser.minRepeatTerm})}stackID(e){let t=(ut||(ut=new WeakMap)).get(e);return t||ut.set(e,t=String.fromCodePoint(this.nextStackID++)),t+e}};function ar(o,e){for(let t=0;t<e.length;t++){let r=e[t];if(r.pos==o.pos&&r.sameState(o)){e[t].score<o.score&&(e[t]=o);return}}e.push(o)}var gt=class{constructor(e,t,r){this.source=e,this.flags=t,this.disabled=r}allows(e){return!this.disabled||this.disabled[e]==0}};var le=class extends Ue{constructor(e){if(super(),this.wrappers=[],e.version!=14)throw new RangeError(`Parser version (${e.version}) doesn't match runtime version (14)`);let t=e.nodeNames.split(" ");this.minRepeatTerm=t.length;for(let l=0;l<e.repeatNodeCount;l++)t.push("");let r=Object.keys(e.topRules).map(l=>e.topRules[l][1]),n=[];for(let l=0;l<t.length;l++)n.push([]);function i(l,a,u){n[l].push([a,a.deserialize(String(u))])}if(e.nodeProps)for(let l of e.nodeProps){let a=l[0];typeof a=="string"&&(a=k[a]);for(let u=1;u<l.length;){let f=l[u++];if(f>=0)i(f,a,l[u++]);else{let h=l[u+-f];for(let c=-f;c>0;c--)i(l[u++],a,h);u++}}}this.nodeSet=new ce(t.map((l,a)=>B.define({name:a>=this.minRepeatTerm?void 0:l,id:a,props:n[a],top:r.indexOf(a)>-1,error:a==0,skipped:e.skippedNodes&&e.skippedNodes.indexOf(a)>-1}))),e.propSources&&(this.nodeSet=this.nodeSet.extend(...e.propSources)),this.strict=!1,this.bufferLength=1024;let s=Fe(e.tokenData);this.context=e.context,this.specializerSpecs=e.specialized||[],this.specialized=new Uint16Array(this.specializerSpecs.length);for(let l=0;l<this.specializerSpecs.length;l++)this.specialized[l]=this.specializerSpecs[l].term;this.specializers=this.specializerSpecs.map(ur),this.states=Fe(e.states,Uint32Array),this.data=Fe(e.stateData),this.goto=Fe(e.goto),this.maxTerm=e.maxTerm,this.tokenizers=e.tokenizers.map(l=>typeof l=="number"?new oe(s,l):l),this.topRules=e.topRules,this.dialects=e.dialects||{},this.dynamicPrecedences=e.dynamicPrecedences||null,this.tokenPrecTable=e.tokenPrec,this.termNames=e.termNames||null,this.maxNode=this.nodeSet.types.length-1,this.dialect=this.parseDialect(),this.top=this.topRules[Object.keys(this.topRules)[0]]}createParse(e,t,r){let n=new mt(this,e,t,r);for(let i of this.wrappers)n=i(n,e,t,r);return n}getGoto(e,t,r=!1){let n=this.goto;if(t>=n[0])return-1;for(let i=n[t+1];;){let s=n[i++],l=s&1,a=n[i++];if(l&&r)return a;for(let u=i+(s>>1);i<u;i++)if(n[i]==e)return a;if(l)return-1}}hasAction(e,t){let r=this.data;for(let n=0;n<2;n++)for(let i=this.stateSlot(e,n?2:1),s;;i+=3){if((s=r[i])==65535)if(r[i+1]==1)s=r[i=J(r,i+2)];else{if(r[i+1]==2)return J(r,i+2);break}if(s==t||s==0)return J(r,i+1)}return 0}stateSlot(e,t){return this.states[e*6+t]}stateFlag(e,t){return(this.stateSlot(e,0)&t)>0}validAction(e,t){return!!this.allActions(e,r=>r==t?!0:null)}allActions(e,t){let r=this.stateSlot(e,4),n=r?t(r):void 0;for(let i=this.stateSlot(e,1);n==null;i+=3){if(this.data[i]==65535)if(this.data[i+1]==1)i=J(this.data,i+2);else break;n=t(J(this.data,i+1))}return n}nextStates(e){let t=[];for(let r=this.stateSlot(e,1);;r+=3){if(this.data[r]==65535)if(this.data[r+1]==1)r=J(this.data,r+2);else break;if(!(this.data[r+2]&1)){let n=this.data[r+1];t.some((i,s)=>s&1&&i==n)||t.push(this.data[r],n)}}return t}configure(e){let t=Object.assign(Object.create(le.prototype),this);if(e.props&&(t.nodeSet=this.nodeSet.extend(...e.props)),e.top){let r=this.topRules[e.top];if(!r)throw new RangeError(`Invalid top rule name ${e.top}`);t.top=r}return e.tokenizers&&(t.tokenizers=this.tokenizers.map(r=>{let n=e.tokenizers.find(i=>i.from==r);return n?n.to:r})),e.specializers&&(t.specializers=this.specializers.slice(),t.specializerSpecs=this.specializerSpecs.map((r,n)=>{let i=e.specializers.find(l=>l.from==r.external);if(!i)return r;let s=Object.assign(Object.assign({},r),{external:i.to});return t.specializers[n]=ur(s),s})),e.contextTracker&&(t.context=e.contextTracker),e.dialect&&(t.dialect=this.parseDialect(e.dialect)),e.strict!=null&&(t.strict=e.strict),e.wrap&&(t.wrappers=t.wrappers.concat(e.wrap)),e.bufferLength!=null&&(t.bufferLength=e.bufferLength),t}hasWrappers(){return this.wrappers.length>0}getName(e){return this.termNames?this.termNames[e]:String(e<=this.maxNode&&this.nodeSet.types[e].name||e)}get eofTerm(){return this.maxNode+1}get topNode(){return this.nodeSet.types[this.top[1]]}dynamicPrecedence(e){let t=this.dynamicPrecedences;return t==null?0:t[e]||0}parseDialect(e){let t=Object.keys(this.dialects),r=t.map(()=>!1);if(e)for(let i of e.split(" ")){let s=t.indexOf(i);s>=0&&(r[s]=!0)}let n=null;for(let i=0;i<t.length;i++)if(!r[i])for(let s=this.dialects[t[i]],l;(l=this.data[s++])!=65535;)(n||(n=new Uint8Array(this.maxTerm+1)))[l]=1;return new gt(e,r,n)}static deserialize(e){return new le(e)}};function J(o,e){return o[e]|o[e+1]<<16}function co(o){let e=null;for(let t of o){let r=t.p.stoppedAt;(t.pos==t.p.stream.end||r!=null&&t.pos>r)&&t.p.parser.stateFlag(t.state,2)&&(!e||e.score<t.score)&&(e=t)}return e}function ur(o){if(o.external){let e=o.extend?1:0;return(t,r)=>o.external(t,r)<<1|e}return o.get}var we=le.deserialize({version:14,states:"%QOVQPOOOOQO'#C_'#C_O_QQO'#C^OOQO'#DO'#DOOvQQO'#C|OOQO'#DR'#DROVQPO'#CuOOQO'#C}'#C}QOQPOOOOQO'#C`'#C`O!UQQO,58xO!dQPO,59VOVQPO,59]OVQPO,59_O!iQPO,59hO!nQQO,59aOOQO'#DQ'#DQOOQO1G.d1G.dO!UQQO1G.qO!yQQO1G.wOOQO1G.y1G.yOOQO'#Cw'#CwOOQO1G/S1G/SOOQO1G.{1G.{O#[QPO'#CnO#dQPO7+$]O!UQQO'#CxO#iQPO,59YOOQO<<Gw<<GwOOQO,59d,59dOOQO-E6v-E6v",stateData:"#q~OoOS~OsPOvUO~OTXOUXOVXOWXOXXOYXO`ZO~Of[Oh]Oj^OmpX~OZ`O[`O]`O^`O~OabO~OseO~Of[Oh]OwgO~Oh]Ofeijeimeiwei~OcjOdbX~OdlO~OcjOdba~O",goto:"#YvPPw}!TPPPPPPPPPPwPP!WPP!ZP!ZP!aP!g!jPPP!p!s!aP#P!aXROU[]XQOU[]RYQRibXTOU[]XVOU[]Rf^QkhRnkRWOQSOQ_UQc[Rd]QaYQhbRmj",nodeNames:"\u26A0 Filter ColumnValueExpression Column Operator Eq NotEq Gt Lt Starts Ends Number String True False ColumnSetExpression In LBrack Values Comma RBrack AndExpression And OrExpression Or ParenthesizedExpression As FilterName",maxTerm:39,skippedNodes:[0],repeatNodeCount:1,tokenData:"6p~RnXY#PYZ#P]^#Ppq#Pqr#brs#mxy$eyz$j|}$o!O!P$t!Q![%S!^!_%_!_!`%d!`!a%i!c!}%n!}#O&V#P#Q&[#R#S%n#T#U&a#U#X%n#X#Y(w#Y#Z+]#Z#]%n#]#^.]#^#c%n#c#d/e#d#g%n#g#h0m#h#i4[#i#o%n~#USo~XY#PYZ#P]^#Ppq#P~#eP!_!`#h~#mOU~~#pWOX#mZ]#m^r#mrs$Ys#O#m#P;'S#m;'S;=`$_<%lO#m~$_O[~~$bP;=`<%l#m~$jOv~~$oOw~~$tOc~~$wP!Q![$z~%PPZ~!Q![$z~%XQZ~!O!P$t!Q![%S~%dOW~~%iOT~~%nOV~P%sUsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n~&[Oa~~&aOd~R&fYsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c'U#c#g%n#g#h(^#h#o%nR'ZWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X's#X#o%nR'zUfQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(eUjQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c)f#c#o%nR)kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X*T#X#o%nR*YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h*r#h#o%nR*yUYQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR+bVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U+w#U#o%nR+|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#`%n#`#a,f#a#o%nR,kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h-T#h#o%nR-YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y-r#Y#o%nR-yU^QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR.bWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c.z#c#o%nR/RU`QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR/jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g0S#g#o%nR0ZUhQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR0rWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i1[#i#o%nR1aVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U1v#U#o%nR1{WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g2e#g#o%nR2jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i3S#i#o%nR3XWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h3q#h#o%nR3xUXQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR4aWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g4y#g#o%nR5OWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#i%n#i#j5h#j#o%nR5mWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y6V#Y#o%nR6^U]QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n",tokenizers:[0,1],topRules:{Filter:[0,1]},tokenPrec:0});var Z=require("@vuu-ui/vuu-utils");var z,xt=class{constructor(){Ft(this,z,void 0)}setFilterCombinatorOp(e,t=j(this,z)){(0,Z.isMultiClauseFilter)(t)&&t.op===e||qe(this,z,{op:e,filters:[j(this,z)]})}add(e){if(j(this,z)===void 0)qe(this,z,e);else if((0,Z.isMultiClauseFilter)(j(this,z)))j(this,z).filters.push(e);else throw Error("Invalid filter passed to FilterExpression")}setColumn(e,t=j(this,z)){if((0,Z.isMultiClauseFilter)(t)){let r=t.filters.at(-1);r&&this.setColumn(e,r)}else t&&(t.column=e)}setOp(e,t=j(this,z)){if((0,Z.isMultiClauseFilter)(t)){let r=t.filters.at(-1);r&&this.setOp(e,r)}else t&&(t.op=e)}setValue(e,t=j(this,z)){var r;if((0,Z.isMultiClauseFilter)(t)){let n=t.filters.at(-1);n&&this.setValue(e,n)}else(0,Z.isMultiValueFilter)(t)?((r=t.values)!=null||(t.values=[]),t.values.push(e)):(0,Z.isSingleValueFilter)(t)&&(t.value=e)}toJSON(e=j(this,z)){return this.name?{...e,name:this.name}:e}};z=new WeakMap;var He=(o,e)=>{let t=new xt,r=o.cursor();do{let{name:n,from:i,to:s}=r;switch(n){case"ColumnValueExpression":t.add({});break;case"ColumnSetExpression":t.add({op:"in"});break;case"Or":case"And":t.setFilterCombinatorOp(e.substring(i,s));break;case"Column":t.setColumn(e.substring(i,s));break;case"Operator":t.setOp(e.substring(i,s));break;case"String":t.setValue(e.substring(i+1,s-1));break;case"Number":t.setValue(parseFloat(e.substring(i,s)));break;case"True":t.setValue(!0);break;case"False":t.setValue(!1);break;case"FilterName":t.name=e.substring(i,s);break;default:}}while(r.next());return t.toJSON()};var Tn=we.configure({strict:!0});var Ir=Pt(bt(),1),ne=require("react");var $=require("@vuu-ui/vuu-codemirror");var mo=$.LRLanguage.define({name:"VuuFilterQuery",parser:we.configure({props:[(0,$.styleTags)({Identifier:$.tags.variableName,String:$.tags.string,Or:$.tags.emphasis,Operator:$.tags.operator})]})}),fr=()=>new $.LanguageSupport(mo);var ae=require("@vuu-ui/vuu-codemirror"),go=ae.HighlightStyle.define([{tag:ae.tags.variableName,color:"var(--vuuFilterEditor-variableColor)"},{tag:ae.tags.comment,color:"green",fontStyle:"italic"}]),cr=(0,ae.syntaxHighlighting)(go);var pr=require("@vuu-ui/vuu-codemirror"),dr=pr.EditorView.theme({"&":{color:"var(--vuuFilterEditor-color)",backgroundColor:"var(--vuuFilterEditor-background)",fontSize:"var(--vuuFilterEditor-fontSize)"},".cm-content":{caretColor:"var(--vuuFilterEditor-cursorColor)",padding:0},".cm-line":{lineHeight:"var(--vuuFilterEditor-lineHeight)"},"&.cm-focused .cm-cursor":{borderLeftColor:"var(--vuuFilterEditor-cursorColor)"},"&.cm-focused .cm-selectionBackground, ::selection":{backgroundColor:"var(--vuuFilterEditor-selectionBackground)"},".cm-selectionBackground, ::selection":{backgroundColor:"var(--vuuFilterEditor-selectionBackground)"},".cm-scroller":{fontFamily:"var(--vuuFilterEditor-fontFamily)"},".cm-tooltip":{background:"var(--vuuFilterEditor-tooltipBackground)",border:"var(--vuuFilterEditor-tooltipBorder)",boxShadow:"var(--vuuFilterEditor-tooltipElevation)","&.cm-tooltip-autocomplete > ul":{fontFamily:"var(--vuuFilterEditor-fontFamily)",fontSize:"var(--vuuFilterEditor-fontSize)",maxHeight:"240px"},"&.cm-tooltip-autocomplete > ul > li":{alignItems:"center",display:"flex",height:"var(--vuuFilterEditor-suggestion-height)",padding:"0 3px",lineHeight:"var(--vuuFilterEditor-suggestion-height)"},"&.cm-tooltip-autocomplete li[aria-selected]":{background:"var(--vuuFilterEditor-suggestion-selectedBackground)",color:"var(--vuuFilterEditor-suggestion-selectedColor)"}},".cm-completionIcon":{height:"18px",flex:"0 0 16px"},".cm-completionLabel":{flex:"1 1 auto"},".cm-completionIcon-filter":{position:"relative","&:after":{background:"var(--salt-text-secondary-foreground)",content:"''","-webkit-mask":"var(--svg-filter) center center/13px 13px","-webkit-mask-repeat":"no-repeat",position:"absolute",height:"18px",left:"0px",top:"0px",width:"16px"}}},{dark:!1});var N=require("@vuu-ui/vuu-codemirror"),St=require("react"),mr=(o,e)=>{let t=o.prevSibling||o.parent;for(;t&&!["Column","Operator","In"].includes(t.name);)t=t.prevSibling||t.parent;if((t==null?void 0:t.name)==="In"||(t==null?void 0:t.name)==="Operator")return(0,N.getValue)(t,e)},xo=(o,e,t)=>{let r=(0,N.getValue)(o,e);if(!(t===void 0||r===t)&&["contains","ends","starts"].some(n=>n.startsWith(r.toLowerCase())))return r},gr=(o,e)=>{let t=o.prevSibling||o.parent||o.lastChild;for(;t&&t.name==="\u26A0";)t=t.prevSibling;if(t&&["As","Or","And"].includes(t.name))return(0,N.getValue)(t,e)},xr=(o,e)=>{if(o.name==="FilterName")return(0,N.getValue)(o,e);{let t=o.prevSibling||o.parent||o.lastChild;for(;t&&t.name!=="FilterName";)t=t.prevSibling;if(t&&t.name==="FilterName")return(0,N.getValue)(o,e)}},br=(o,e)=>{let t=o.prevSibling;if((t==null?void 0:t.name)==="Column")return(0,N.getValue)(t,e);if((t==null?void 0:t.name)==="Operator")return br(t,e)},bo=(o,e)=>{let t=o.lastChild,r=[];for(;t&&t.name!=="In";){let n=(0,N.getValue)(t,e);if(n)r.push(n);else break;t=t.prevSibling}return r};var Sr=(o,e,t)=>{let r=(0,St.useCallback)(async(n,i,s={})=>{let{startsWith:l=""}=s,a=await o.getSuggestions(i,s);return{from:n.pos-l.length,options:a}},[o]);return(0,St.useCallback)(async n=>{var f,h;let{state:i,pos:s}=n,l=(f=n.matchBefore(/\w*/))!=null?f:{from:0,to:0,text:void 0},u=(0,N.syntaxTree)(i).resolveInner(s,-1);switch(console.log({nodeBeforeName:u.name}),u.name){case"Filter":if(n.pos===0)return r(n,"column");if(gr(u,i)==="as")return r(n,"name");{let p=xr(u,i);return r(n,"save",{onSubmit:e.current,existingFilter:t,filterName:p})}case"String":{let c=mr(u,i),p=br(u,i),{from:d,to:g}=u;if(g-d===2&&n.pos===d+1){if(p&&c)return r(n,"columnValue",{columnName:p,operator:c,quoted:!0,startsWith:l.text})}else console.log(`we have a string, column is ${p} ${d} ${g}`)}break;case"As":return r(n,"name");case"FilterName":return r(n,"save",{onSubmit:e.current,existingFilter:t,filterName:xr(u,i)});case"Column":{let c=(0,N.getValue)(u,i);return await o.isPartialMatch("column",void 0,c)?r(n,"column",{startsWith:c}):r(n,"operator",{columnName:c})}case"\u26A0":{let c=(0,N.getNodeByName)(u,i),p=mr(u,i),d=p?void 0:xo(u,i,c);return d?r(n,"operator",{columnName:c,startsWith:d}):r(n,"columnValue",{columnName:c,operator:p,startsWith:l.text})}case"Identifier":if(gr(u,i)==="as")return{from:n.pos,options:[{label:"press ENTER to apply filter and save",apply:()=>e.current(),boost:5}]};break;case"ColumnSetExpression":case"Values":{let c=(0,N.getNodeByName)(u,i),p=bo(u,i);return r(n,"columnValue",{columnName:c,selection:p})}case"Comma":case"LBrack":{let c=(0,N.getNodeByName)(u,i);return r(n,"columnValue",{columnName:c})}case"ColumnValueExpression":{let c=(h=u.lastChild)==null?void 0:h.prevSibling;if((c==null?void 0:c.name)==="Column")return r(n,"operator",{columnName:(0,N.getNodeByName)(u,i)});if((c==null?void 0:c.name)==="Operator")return r(n,"columnValue",{columnName:(0,N.getNodeByName)(c,i),operator:(0,N.getValue)(c,i)})}break;case"In":return{from:n.pos,options:[{label:"[",apply:" [",type:"text"}]};case"Eq":return r(n,"columnValue",{columnName:(0,N.getNodeByName)(u,i)});case"AndExpression":case"OrExpression":return r(n,"column");default:}},[t,r,e,o])};var Te=o=>{if(o.current==null)throw Error("EditorView not defined");return o.current},So=o=>(0,Ir.default)("vuuSuggestion",{vuuIllustration:o.isIllustration}),Io=o=>{let e=o.lastIndexOf(" as ");return e!==-1?o.slice(0,e):o},yo=()=>console.log("noooop"),It=({existingFilter:o,onSubmitFilter:e,suggestionProvider:t})=>{let r=(0,ne.useRef)(null),n=(0,ne.useRef)(yo),i=(0,ne.useRef)(),s=Sr(t,n,o),[l,a]=(0,ne.useMemo)(()=>{let u=()=>{let g=Te(i),F=g.state.doc.toString(),T=(0,w.ensureSyntaxTree)(g.state,g.state.doc.length,5e3);if(T){let S=He(T,F);return[S,Io(F),S.name]}else return[void 0,"",void 0]},f=()=>{Te(i).setState(d())},h=g=>{let[F,T,S]=u();e==null||e(F,T,g,S),f()},c=g=>w.keymap.of([{key:g,run(){return h(),!0}}]),p=g=>w.keymap.of([{key:g,run(){return(0,w.startCompletion)(Te(i)),!0}}]),d=()=>w.EditorState.create({doc:"",extensions:[w.minimalSetup,(0,w.autocompletion)({override:[s],optionClass:So}),fr(),w.keymap.of(w.defaultKeymap),c("Ctrl-Enter"),p("ArrowDown"),w.EditorView.updateListener.of(g=>{let F=Te(i);g.docChanged&&(0,w.startCompletion)(F)}),w.EditorState.transactionFilter.of(g=>g.newDoc.lines>1?[]:g),dr,cr]});return n.current=g=>{h(g),setTimeout(()=>{Te(i).focus()},100)},[d,f]},[s,e]);return(0,ne.useEffect)(()=>{if(!r.current)throw Error("editor not in dom");return i.current=new w.EditorView({state:l(),parent:r.current}),()=>{var u;(u=i.current)==null||u.destroy()}},[s,l]),{editorRef:r,clearInput:a}};var be=require("react/jsx-runtime"),je="vuuFilterInput",vo=({existingFilter:o,iconName:e="filter",namedFilters:t,onSubmitFilter:r,suggestionProvider:n,...i})=>{let{editorRef:s,clearInput:l}=It({existingFilter:o,onSubmitFilter:r,suggestionProvider:n});return(0,be.jsxs)("div",{...i,className:je,children:[(0,be.jsx)(yt.Button,{className:`${je}-FilterButton`,"data-icon":e,tabIndex:-1}),(0,be.jsx)("div",{className:`${je}-Editor`,ref:s}),(0,be.jsx)(yt.Button,{className:`${je}-ClearButton`,"data-icon":"close-circle",onClick:l})]})};var V=require("@vuu-ui/vuu-codemirror"),Xe=require("@vuu-ui/vuu-data-react"),Ne=require("react");var Ae=require("@vuu-ui/vuu-utils"),yr=(o,e)=>{let t=(0,Ae.createEl)("div","vuuFunctionDoc"),r=(0,Ae.createEl)("div","function-heading"),n=(0,Ae.createEl)("span","function-name",o);r.appendChild(n);let i=(0,Ae.createEl)("p",void 0,e);return t.appendChild(r),t.appendChild(i),t};var Co=[],ko={},Po=o=>[{label:"Press ENTER to create TAB",apply:()=>o("tab"),boost:6}],vr=(o,e,t=!0)=>{let r=e?[{label:"REPLACE existing filter",apply:()=>o("replace"),boost:8},{label:"AND existing filter",apply:()=>o("and"),boost:7},{label:"OR existing filter",apply:()=>o("or"),boost:7}]:[{label:"Press ENTER to submit",apply:()=>o(),boost:6}];return t?r.concat(V.booleanJoinSuggestions).concat(V.asNameSuggestion):r},Oo=(o,e)=>vr(o,e,!0),Fo=o=>vr(o,void 0),wo=({existingFilter:o,filterName:e,onSubmit:t,saveOptions:r})=>{let n=e&&r.allowSaveAsTab,i=o?Oo(t,o):Fo(t);return n?i.concat(Po(t)):i},To=o=>o.map(e=>({boost:5,label:e.name})),Ao=o=>o?Array.from(o.entries()).map(([e,t])=>({info:()=>yr(e,t),label:e,type:"filter"})):Co,No={label:"Done",apply:"] ",type:"keyword",boost:10},Ge=(o,e="")=>o.filter(t=>e===""||t.label.startsWith(e)).map(t=>({...t,apply:t.label+" "})),Ro={allowReplace:!0},Eo=({columns:o,namedFilters:e,saveOptions:t=Ro,table:r,typeaheadHook:n=Xe.useTypeaheadSuggestions})=>{let i=(0,Ne.useRef)(),s=n(),l=(0,Ne.useCallback)(async(u,f=ko)=>{let{columnName:h,existingFilter:c,filterName:p,operator:d,quoted:g,onSubmit:F,startsWith:T,selection:S}=f;switch(u){case"operator":{let y=o.find(x=>x.name===h);if(y)switch(y.serverDataType){case"string":case"char":return Ge(V.stringOperators,T);case"int":case"long":case"double":return Ge(V.numericOperators)}else console.warn(`'${h}' does not match any column name`)}break;case"column":{let y=await To(o),x=await Ao(e);return(i.current=Ge(y)).concat(Ge(x))}case"columnValue":if(h){let y=o.find(A=>A.name===h);if(!y)throw Error(`useFilterSUggestionProvider no column ${h}`);let x=Array.isArray(S)?S.length===0?"[":",":"",C=(0,Xe.getTypeaheadParams)(r,h,T),m=await s(C),b=d==="starts";return i.current=(0,V.toSuggestions)(m,{moveCursorToEnd:g,quoted:(y==null?void 0:y.serverDataType)==="string"&&!g,suffix:g?"":" ",prefix:b?T:x,isIllustration:b}),Array.isArray(S)&&(S==null?void 0:S.length)>1?[No,...i.current]:i.current}break;case"save":{if(typeof F!="function")throw Error("useFilterSuggestionProvider, onSubmit must be supplied for 'save' suggestions");return await wo({existingFilter:c,filterName:p,onSubmit:F,saveOptions:t})}case"name":return await(0,V.getNamePrompt)("filter");default:}return[]},[o,s,e,t,r]),a=(0,Ne.useCallback)(async(u,f,h)=>{let c=await l(u,{columnName:f});if(h&&c)for(let p of c){if(p.label===h)return!1;if(p.label.startsWith(h))return!0}return!1},[l]);return{getSuggestions:l,isPartialMatch:a}};var Er=require("@heswell/salt-lab"),Dr=Pt(bt(),1);var Ie=require("@vuu-ui/vuu-utils"),Re=require("@heswell/salt-lab");var Cr=require("@heswell/salt-lab"),Ze=require("react"),Or=require("react/jsx-runtime"),Do=o=>typeof o=="string",kr=o=>Do(o)?o.startsWith('"')&&o.endsWith('"')?o.slice(1,-1):o:o.map(kr),Pr=({column:o,selected:e,suggestionProvider:t,...r})=>{let n=e!=null?kr(e):void 0,i=Array.isArray(n)?n:n!=null?[n]:[],[s,l]=(0,Ze.useState)(i);console.log({initialValues:i});let a=(0,Ze.useCallback)(async u=>{if(u){let f=await t.getSuggestions("columnValue",{columnName:o});console.log({values:f}),l(f.map(h=>h.label))}},[o,t]);return(0,Or.jsx)(Cr.Dropdown,{...r,onOpenChange:a,selected:n,source:s})};var Fr=require("@heswell/salt-lab"),Ye=require("react"),Ar=require("react/jsx-runtime"),Mo=o=>typeof o=="string",wr=o=>{if(o!==void 0)return Mo(o)?o.startsWith('"')&&o.endsWith('"')?o.slice(1,-1):o:o.map(wr)},Tr=({column:o,selected:e,suggestionProvider:t,...r})=>{let n=wr(e),i=Array.isArray(n)?n:n!=null?[n]:[],[s,l]=(0,Ye.useState)(i),a=(0,Ye.useCallback)(async u=>{if(u){let f=await t.getSuggestions("columnValue",{columnName:o});console.log({values:f}),l(f.map(h=>h.label))}},[o,t]);return(0,Ar.jsx)(Fr.Dropdown,{...r,onOpenChange:a,selected:n,selectionStrategy:"multiple",source:s})};var Se=require("react/jsx-runtime"),Nr=(o,e)=>{if((0,Ie.isNamedFilter)(o))return(0,Se.jsx)(Re.ToggleButton,{className:"vuuToggleButton",toggled:!0,variant:"secondary",children:o.name});if((0,Ie.isSingleValueFilter)(o)){let{column:t,value:r}=o;return(0,Se.jsx)(Re.ToolbarField,{className:"vuuFilterDropdown",label:t,labelPlacement:"top",children:(0,Se.jsx)(Pr,{column:t,selected:r.toString(),selectionStrategy:"default",source:[r.toString()],suggestionProvider:e,style:{width:100}})},t)}if((0,Ie.isMultiValueFilter)(o)){let t=o.values.map(r=>r.toString());return(0,Se.jsx)(Re.ToolbarField,{className:"vuuFilterDropdown",label:o.column,labelPlacement:"top",children:(0,Se.jsx)(Tr,{column:o.column,selected:t,source:t,suggestionProvider:e,style:{width:100}})},o.column)}return o.filters.map(t=>Nr(t,e))},Rr=({filter:o,suggestionProvider:e})=>o?Nr(o,e):[];var Mr=require("react/jsx-runtime"),Bo=({className:o,filter:e,suggestionProvider:t,...r})=>{console.log(`FilterToolbar ${JSON.stringify(e,null,2)}`);let n=Rr({filter:e,suggestionProvider:t});return(0,Mr.jsx)(Er.Toolbar,{className:(0,Dr.default)("vuuFilterToolbar",o),...r,children:n})};
+
+// ../vuu-filter-parser/src/generated/filter-parser.js
+var parser = LRParser.deserialize({
+  version: 14,
+  states: "%QOVQPOOOOQO'#C_'#C_O_QQO'#C^OOQO'#DO'#DOOvQQO'#C|OOQO'#DR'#DROVQPO'#CuOOQO'#C}'#C}QOQPOOOOQO'#C`'#C`O!UQQO,58xO!dQPO,59VOVQPO,59]OVQPO,59_O!iQPO,59hO!nQQO,59aOOQO'#DQ'#DQOOQO1G.d1G.dO!UQQO1G.qO!yQQO1G.wOOQO1G.y1G.yOOQO'#Cw'#CwOOQO1G/S1G/SOOQO1G.{1G.{O#[QPO'#CnO#dQPO7+$]O!UQQO'#CxO#iQPO,59YOOQO<<Gw<<GwOOQO,59d,59dOOQO-E6v-E6v",
+  stateData: "#q~OoOS~OsPOvUO~OTXOUXOVXOWXOXXOYXO`ZO~Of[Oh]Oj^OmpX~OZ`O[`O]`O^`O~OabO~OseO~Of[Oh]OwgO~Oh]Ofeijeimeiwei~OcjOdbX~OdlO~OcjOdba~O",
+  goto: "#YvPPw}!TPPPPPPPPPPwPP!WPP!ZP!ZP!aP!g!jPPP!p!s!aP#P!aXROU[]XQOU[]RYQRibXTOU[]XVOU[]Rf^QkhRnkRWOQSOQ_UQc[Rd]QaYQhbRmj",
+  nodeNames: "\u26A0 Filter ColumnValueExpression Column Operator Eq NotEq Gt Lt Starts Ends Number String True False ColumnSetExpression In LBrack Values Comma RBrack AndExpression And OrExpression Or ParenthesizedExpression As FilterName",
+  maxTerm: 39,
+  skippedNodes: [0],
+  repeatNodeCount: 1,
+  tokenData: "6p~RnXY#PYZ#P]^#Ppq#Pqr#brs#mxy$eyz$j|}$o!O!P$t!Q![%S!^!_%_!_!`%d!`!a%i!c!}%n!}#O&V#P#Q&[#R#S%n#T#U&a#U#X%n#X#Y(w#Y#Z+]#Z#]%n#]#^.]#^#c%n#c#d/e#d#g%n#g#h0m#h#i4[#i#o%n~#USo~XY#PYZ#P]^#Ppq#P~#eP!_!`#h~#mOU~~#pWOX#mZ]#m^r#mrs$Ys#O#m#P;'S#m;'S;=`$_<%lO#m~$_O[~~$bP;=`<%l#m~$jOv~~$oOw~~$tOc~~$wP!Q![$z~%PPZ~!Q![$z~%XQZ~!O!P$t!Q![%S~%dOW~~%iOT~~%nOV~P%sUsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n~&[Oa~~&aOd~R&fYsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c'U#c#g%n#g#h(^#h#o%nR'ZWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X's#X#o%nR'zUfQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(eUjQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c)f#c#o%nR)kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X*T#X#o%nR*YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h*r#h#o%nR*yUYQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR+bVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U+w#U#o%nR+|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#`%n#`#a,f#a#o%nR,kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h-T#h#o%nR-YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y-r#Y#o%nR-yU^QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR.bWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c.z#c#o%nR/RU`QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR/jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g0S#g#o%nR0ZUhQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR0rWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i1[#i#o%nR1aVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U1v#U#o%nR1{WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g2e#g#o%nR2jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i3S#i#o%nR3XWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h3q#h#o%nR3xUXQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR4aWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g4y#g#o%nR5OWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#i%n#i#j5h#j#o%nR5mWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y6V#Y#o%nR6^U]QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n",
+  tokenizers: [0, 1],
+  topRules: { "Filter": [0, 1] },
+  tokenPrec: 0
+});
+
+// ../vuu-filter-parser/src/FilterTreeWalker.ts
+var import_vuu_utils = require("@vuu-ui/vuu-utils");
+var _filter;
+var FilterExpression = class {
+  constructor() {
+    __privateAdd(this, _filter, void 0);
+  }
+  setFilterCombinatorOp(op, filter = __privateGet(this, _filter)) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter) && filter.op === op) {
+      return;
+    } else {
+      __privateSet(this, _filter, {
+        op,
+        filters: [__privateGet(this, _filter)]
+      });
+    }
+  }
+  add(filter) {
+    if (__privateGet(this, _filter) === void 0) {
+      __privateSet(this, _filter, filter);
+    } else if ((0, import_vuu_utils.isMultiClauseFilter)(__privateGet(this, _filter))) {
+      __privateGet(this, _filter).filters.push(filter);
+    } else {
+      throw Error(`Invalid filter passed to FilterExpression`);
+    }
+  }
+  setColumn(column, filter = __privateGet(this, _filter)) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
+      const target = filter.filters.at(-1);
+      if (target) {
+        this.setColumn(column, target);
+      }
+    } else if (filter) {
+      filter.column = column;
+    }
+  }
+  setOp(value, filter = __privateGet(this, _filter)) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
+      const target = filter.filters.at(-1);
+      if (target) {
+        this.setOp(value, target);
+      }
+    } else if (filter) {
+      filter.op = value;
+    }
+  }
+  setValue(value, filter = __privateGet(this, _filter)) {
+    var _a;
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
+      const target = filter.filters.at(-1);
+      if (target) {
+        this.setValue(value, target);
+      }
+    } else if ((0, import_vuu_utils.isMultiValueFilter)(filter)) {
+      (_a = filter.values) != null ? _a : filter.values = [];
+      filter.values.push(value);
+    } else if ((0, import_vuu_utils.isSingleValueFilter)(filter)) {
+      filter.value = value;
+    }
+  }
+  toJSON(filter = __privateGet(this, _filter)) {
+    if (this.name) {
+      return {
+        ...filter,
+        name: this.name
+      };
+    } else {
+      return filter;
+    }
+  }
+};
+_filter = new WeakMap();
+var walkTree = (tree, source) => {
+  const filterExpression = new FilterExpression();
+  const cursor = tree.cursor();
+  do {
+    const { name, from, to } = cursor;
+    switch (name) {
+      case "ColumnValueExpression":
+        filterExpression.add({});
+        break;
+      case "ColumnSetExpression":
+        filterExpression.add({ op: "in" });
+        break;
+      case "Or":
+      case "And":
+        filterExpression.setFilterCombinatorOp(source.substring(from, to));
+        break;
+      case "Column":
+        filterExpression.setColumn(source.substring(from, to));
+        break;
+      case "Operator":
+        filterExpression.setOp(source.substring(from, to));
+        break;
+      case "String":
+        filterExpression.setValue(source.substring(from + 1, to - 1));
+        break;
+      case "Number":
+        filterExpression.setValue(parseFloat(source.substring(from, to)));
+        break;
+      case "True":
+        filterExpression.setValue(true);
+        break;
+      case "False":
+        filterExpression.setValue(false);
+        break;
+      case "FilterName":
+        filterExpression.name = source.substring(from, to);
+        break;
+      default:
+    }
+  } while (cursor.next());
+  return filterExpression.toJSON();
+};
+
+// ../vuu-filter-parser/src/FilterParser.ts
+var strictParser = parser.configure({ strict: true });
+
+// src/filter-input/useCodeMirrorEditor.ts
+var import_classnames = __toESM(require_classnames(), 1);
+var import_react2 = require("react");
+
+// src/filter-input/FilterLanguage.ts
+var import_vuu_codemirror = require("@vuu-ui/vuu-codemirror");
+var filterLanguage = import_vuu_codemirror.LRLanguage.define({
+  name: "VuuFilterQuery",
+  parser: parser.configure({
+    props: [
+      (0, import_vuu_codemirror.styleTags)({
+        Identifier: import_vuu_codemirror.tags.variableName,
+        String: import_vuu_codemirror.tags.string,
+        Or: import_vuu_codemirror.tags.emphasis,
+        Operator: import_vuu_codemirror.tags.operator
+      })
+    ]
+  })
+});
+var filterLanguageSupport = () => {
+  return new import_vuu_codemirror.LanguageSupport(filterLanguage);
+};
+
+// src/filter-input/highlighting.ts
+var import_vuu_codemirror2 = require("@vuu-ui/vuu-codemirror");
+var myHighlightStyle = import_vuu_codemirror2.HighlightStyle.define([
+  { tag: import_vuu_codemirror2.tags.variableName, color: "var(--vuuFilterEditor-variableColor)" },
+  { tag: import_vuu_codemirror2.tags.comment, color: "green", fontStyle: "italic" }
+]);
+var vuuHighlighting = (0, import_vuu_codemirror2.syntaxHighlighting)(myHighlightStyle);
+
+// src/filter-input/theme.ts
+var import_vuu_codemirror3 = require("@vuu-ui/vuu-codemirror");
+var vuuTheme = import_vuu_codemirror3.EditorView.theme(
+  {
+    "&": {
+      color: "var(--vuuFilterEditor-color)",
+      backgroundColor: "var(--vuuFilterEditor-background)",
+      fontSize: "var(--vuuFilterEditor-fontSize)"
+    },
+    ".cm-content": {
+      caretColor: "var(--vuuFilterEditor-cursorColor)",
+      padding: 0
+    },
+    ".cm-line": {
+      lineHeight: "var(--vuuFilterEditor-lineHeight)"
+    },
+    "&.cm-focused .cm-cursor": {
+      borderLeftColor: "var(--vuuFilterEditor-cursorColor)"
+    },
+    "&.cm-focused .cm-selectionBackground, ::selection": {
+      backgroundColor: "var(--vuuFilterEditor-selectionBackground)"
+    },
+    ".cm-selectionBackground, ::selection": {
+      backgroundColor: "var(--vuuFilterEditor-selectionBackground)"
+    },
+    ".cm-scroller": {
+      fontFamily: "var(--vuuFilterEditor-fontFamily)"
+    },
+    ".cm-tooltip": {
+      background: "var(--vuuFilterEditor-tooltipBackground)",
+      border: "var(--vuuFilterEditor-tooltipBorder)",
+      boxShadow: "var(--vuuFilterEditor-tooltipElevation)",
+      "&.cm-tooltip-autocomplete > ul": {
+        fontFamily: "var(--vuuFilterEditor-fontFamily)",
+        fontSize: "var(--vuuFilterEditor-fontSize)",
+        maxHeight: "240px"
+      },
+      "&.cm-tooltip-autocomplete > ul > li": {
+        alignItems: "center",
+        display: "flex",
+        height: "var(--vuuFilterEditor-suggestion-height)",
+        padding: "0 3px",
+        lineHeight: "var(--vuuFilterEditor-suggestion-height)"
+      },
+      "&.cm-tooltip-autocomplete li[aria-selected]": {
+        background: "var(--vuuFilterEditor-suggestion-selectedBackground)",
+        color: "var(--vuuFilterEditor-suggestion-selectedColor)"
+      }
+    },
+    ".cm-completionIcon": {
+      height: "18px",
+      flex: "0 0 16px"
+    },
+    ".cm-completionLabel": {
+      flex: "1 1 auto"
+    },
+    ".cm-completionIcon-filter": {
+      position: "relative",
+      "&:after": {
+        background: "var(--salt-text-secondary-foreground)",
+        content: "''",
+        "-webkit-mask": "var(--svg-filter) center center/13px 13px",
+        "-webkit-mask-repeat": "no-repeat",
+        position: "absolute",
+        height: "18px",
+        left: "0px",
+        top: "0px",
+        width: "16px"
+      }
+    }
+  },
+  { dark: false }
+);
+
+// src/filter-input/useFilterAutoComplete.ts
+var import_vuu_codemirror4 = require("@vuu-ui/vuu-codemirror");
+var import_react = require("react");
+var getOperator = (node, state) => {
+  let maybeColumnNode = node.prevSibling || node.parent;
+  while (maybeColumnNode && !["Column", "Operator", "In"].includes(maybeColumnNode.name)) {
+    maybeColumnNode = maybeColumnNode.prevSibling || maybeColumnNode.parent;
+  }
+  if ((maybeColumnNode == null ? void 0 : maybeColumnNode.name) === "In" || (maybeColumnNode == null ? void 0 : maybeColumnNode.name) === "Operator") {
+    return (0, import_vuu_codemirror4.getValue)(maybeColumnNode, state);
+  } else {
+    return void 0;
+  }
+};
+var getPartialOperator = (maybeOperatorNode, state, columnName) => {
+  const value = (0, import_vuu_codemirror4.getValue)(maybeOperatorNode, state);
+  if (columnName === void 0 || value === columnName) {
+    return;
+  }
+  if (["contains", "ends", "starts"].some(
+    (val) => val.startsWith(value.toLowerCase())
+  )) {
+    return value;
+  } else {
+    return void 0;
+  }
+};
+var getClauseOperator = (node, state) => {
+  let maybeTargetNode = node.prevSibling || node.parent || node.lastChild;
+  while (maybeTargetNode && maybeTargetNode.name === "\u26A0")
+    maybeTargetNode = maybeTargetNode.prevSibling;
+  if (maybeTargetNode && ["As", "Or", "And"].includes(maybeTargetNode.name)) {
+    return (0, import_vuu_codemirror4.getValue)(maybeTargetNode, state);
+  } else {
+    return void 0;
+  }
+};
+var getFilterName = (node, state) => {
+  if (node.name === "FilterName") {
+    return (0, import_vuu_codemirror4.getValue)(node, state);
+  } else {
+    let maybeTargetNode = node.prevSibling || node.parent || node.lastChild;
+    while (maybeTargetNode && maybeTargetNode.name !== "FilterName")
+      maybeTargetNode = maybeTargetNode.prevSibling;
+    if (maybeTargetNode && maybeTargetNode.name === "FilterName") {
+      return (0, import_vuu_codemirror4.getValue)(node, state);
+    }
+  }
+};
+var getColumnName = (node, state) => {
+  const prevNode = node.prevSibling;
+  if ((prevNode == null ? void 0 : prevNode.name) === "Column") {
+    return (0, import_vuu_codemirror4.getValue)(prevNode, state);
+  } else if ((prevNode == null ? void 0 : prevNode.name) === "Operator") {
+    return getColumnName(prevNode, state);
+  }
+};
+var getSetValues = (node, state) => {
+  let maybeTargetNode = node.lastChild;
+  const values = [];
+  while (maybeTargetNode && maybeTargetNode.name !== "In") {
+    const value = (0, import_vuu_codemirror4.getValue)(maybeTargetNode, state);
+    if (value) {
+      values.push(value);
+    } else {
+      break;
+    }
+    maybeTargetNode = maybeTargetNode.prevSibling;
+  }
+  return values;
+};
+var useAutoComplete = (suggestionProvider, onSubmit, existingFilter) => {
+  const makeSuggestions = (0, import_react.useCallback)(
+    async (context, suggestionType, optionalArgs = {}) => {
+      const { startsWith = "" } = optionalArgs;
+      const options = await suggestionProvider.getSuggestions(
+        suggestionType,
+        optionalArgs
+      );
+      return { from: context.pos - startsWith.length, options };
+    },
+    [suggestionProvider]
+  );
+  return (0, import_react.useCallback)(
+    async (context) => {
+      var _a, _b;
+      const { state, pos } = context;
+      const word = (_a = context.matchBefore(/\w*/)) != null ? _a : {
+        from: 0,
+        to: 0,
+        text: void 0
+      };
+      const tree = (0, import_vuu_codemirror4.syntaxTree)(state);
+      const nodeBefore = tree.resolveInner(pos, -1);
+      console.log({ nodeBeforeName: nodeBefore.name });
+      switch (nodeBefore.name) {
+        case "Filter":
+          if (context.pos === 0) {
+            return makeSuggestions(context, "column");
+          } else {
+            const clauseOperator = getClauseOperator(nodeBefore, state);
+            if (clauseOperator === "as") {
+              return makeSuggestions(context, "name");
+            } else {
+              const filterName = getFilterName(nodeBefore, state);
+              return makeSuggestions(context, "save", {
+                onSubmit: onSubmit.current,
+                existingFilter,
+                filterName
+              });
+            }
+          }
+        case "String":
+          {
+            const operator = getOperator(nodeBefore, state);
+            const columnName = getColumnName(nodeBefore, state);
+            const { from, to } = nodeBefore;
+            if (to - from === 2 && context.pos === from + 1) {
+              if (columnName && operator) {
+                return makeSuggestions(context, "columnValue", {
+                  columnName,
+                  operator,
+                  quoted: true,
+                  startsWith: word.text
+                });
+              }
+            } else {
+              console.log(
+                `we have a string, column is ${columnName} ${from} ${to}`
+              );
+            }
+          }
+          break;
+        case "As":
+          return makeSuggestions(context, "name");
+        case "FilterName":
+          return makeSuggestions(context, "save", {
+            onSubmit: onSubmit.current,
+            existingFilter,
+            filterName: getFilterName(nodeBefore, state)
+          });
+        case "Column": {
+          const columnName = (0, import_vuu_codemirror4.getValue)(nodeBefore, state);
+          const isPartialMatch = await suggestionProvider.isPartialMatch(
+            "column",
+            void 0,
+            columnName
+          );
+          if (isPartialMatch) {
+            return makeSuggestions(context, "column", {
+              startsWith: columnName
+            });
+          } else {
+            return makeSuggestions(context, "operator", { columnName });
+          }
+        }
+        case "\u26A0": {
+          const columnName = (0, import_vuu_codemirror4.getNodeByName)(nodeBefore, state);
+          const operator = getOperator(nodeBefore, state);
+          const partialOperator = operator ? void 0 : getPartialOperator(nodeBefore, state, columnName);
+          if (partialOperator) {
+            return makeSuggestions(context, "operator", {
+              columnName,
+              startsWith: partialOperator
+            });
+          } else {
+            return makeSuggestions(context, "columnValue", {
+              columnName,
+              operator,
+              startsWith: word.text
+            });
+          }
+        }
+        case "Identifier":
+          {
+            const clauseOperator = getClauseOperator(nodeBefore, state);
+            if (clauseOperator === "as") {
+              return {
+                from: context.pos,
+                options: [
+                  {
+                    label: "press ENTER to apply filter and save",
+                    apply: () => onSubmit.current(),
+                    boost: 5
+                  }
+                ]
+              };
+            }
+          }
+          break;
+        case "ColumnSetExpression":
+        case "Values": {
+          const columnName = (0, import_vuu_codemirror4.getNodeByName)(nodeBefore, state);
+          const selection = getSetValues(nodeBefore, state);
+          return makeSuggestions(context, "columnValue", {
+            columnName,
+            selection
+          });
+        }
+        case "Comma":
+        case "LBrack": {
+          const columnName = (0, import_vuu_codemirror4.getNodeByName)(nodeBefore, state);
+          return makeSuggestions(context, "columnValue", { columnName });
+        }
+        case "ColumnValueExpression":
+          {
+            const lastToken = (_b = nodeBefore.lastChild) == null ? void 0 : _b.prevSibling;
+            if ((lastToken == null ? void 0 : lastToken.name) === "Column") {
+              return makeSuggestions(context, "operator", {
+                columnName: (0, import_vuu_codemirror4.getNodeByName)(nodeBefore, state)
+              });
+            } else if ((lastToken == null ? void 0 : lastToken.name) === "Operator") {
+              return makeSuggestions(context, "columnValue", {
+                columnName: (0, import_vuu_codemirror4.getNodeByName)(lastToken, state),
+                operator: (0, import_vuu_codemirror4.getValue)(lastToken, state)
+              });
+            }
+          }
+          break;
+        case "In": {
+          return {
+            from: context.pos,
+            options: [{ label: "[", apply: " [", type: "text" }]
+          };
+        }
+        case "Eq": {
+          return makeSuggestions(context, "columnValue", {
+            columnName: (0, import_vuu_codemirror4.getNodeByName)(nodeBefore, state)
+          });
+        }
+        case "AndExpression":
+        case "OrExpression": {
+          return makeSuggestions(context, "column");
+        }
+        default:
+      }
+    },
+    [existingFilter, makeSuggestions, onSubmit, suggestionProvider]
+  );
+};
+
+// src/filter-input/useCodeMirrorEditor.ts
+var getView = (ref) => {
+  if (ref.current == void 0) {
+    throw Error("EditorView not defined");
+  }
+  return ref.current;
+};
+var getOptionClass = (completion) => {
+  return (0, import_classnames.default)("vuuSuggestion", {
+    vuuIllustration: completion.isIllustration
+  });
+};
+var stripName = (filterQuery) => {
+  const pos = filterQuery.lastIndexOf(" as ");
+  if (pos !== -1) {
+    return filterQuery.slice(0, pos);
+  } else {
+    return filterQuery;
+  }
+};
+var noop = () => console.log("noooop");
+var useCodeMirrorEditor = ({
+  existingFilter,
+  onSubmitFilter,
+  suggestionProvider
+}) => {
+  const editorRef = (0, import_react2.useRef)(null);
+  const onSubmit = (0, import_react2.useRef)(noop);
+  const viewRef = (0, import_react2.useRef)();
+  const completionFn = useAutoComplete(
+    suggestionProvider,
+    onSubmit,
+    existingFilter
+  );
+  const [createState, clearInput] = (0, import_react2.useMemo)(() => {
+    const parseFilter2 = () => {
+      const view = getView(viewRef);
+      const source = view.state.doc.toString();
+      const tree = (0, import_vuu_codemirror5.ensureSyntaxTree)(view.state, view.state.doc.length, 5e3);
+      if (tree) {
+        const filter = walkTree(tree, source);
+        return [filter, stripName(source), filter.name];
+      } else {
+        return [void 0, "", void 0];
+      }
+    };
+    const clearInput2 = () => {
+      getView(viewRef).setState(createState2());
+    };
+    const submitFilterAndClearInput = (mode) => {
+      const [filter, filterQuery, filterName] = parseFilter2();
+      onSubmitFilter == null ? void 0 : onSubmitFilter(filter, filterQuery, mode, filterName);
+      clearInput2();
+    };
+    const submitFilter = (key) => {
+      return import_vuu_codemirror5.keymap.of([
+        {
+          key,
+          run() {
+            submitFilterAndClearInput();
+            return true;
+          }
+        }
+      ]);
+    };
+    const showSuggestions = (key) => {
+      return import_vuu_codemirror5.keymap.of([
+        {
+          key,
+          run() {
+            (0, import_vuu_codemirror5.startCompletion)(getView(viewRef));
+            return true;
+          }
+        }
+      ]);
+    };
+    const createState2 = () => import_vuu_codemirror5.EditorState.create({
+      doc: "",
+      extensions: [
+        import_vuu_codemirror5.minimalSetup,
+        (0, import_vuu_codemirror5.autocompletion)({
+          override: [completionFn],
+          optionClass: getOptionClass
+        }),
+        filterLanguageSupport(),
+        import_vuu_codemirror5.keymap.of(import_vuu_codemirror5.defaultKeymap),
+        submitFilter("Ctrl-Enter"),
+        showSuggestions("ArrowDown"),
+        import_vuu_codemirror5.EditorView.updateListener.of((v) => {
+          const view = getView(viewRef);
+          if (v.docChanged) {
+            (0, import_vuu_codemirror5.startCompletion)(view);
+          }
+        }),
+        import_vuu_codemirror5.EditorState.transactionFilter.of(
+          (tr) => tr.newDoc.lines > 1 ? [] : tr
+        ),
+        vuuTheme,
+        vuuHighlighting
+      ]
+    });
+    onSubmit.current = (mode) => {
+      submitFilterAndClearInput(mode);
+      setTimeout(() => {
+        getView(viewRef).focus();
+      }, 100);
+    };
+    return [createState2, clearInput2];
+  }, [completionFn, onSubmitFilter]);
+  (0, import_react2.useEffect)(() => {
+    if (!editorRef.current) {
+      throw Error("editor not in dom");
+    }
+    viewRef.current = new import_vuu_codemirror5.EditorView({
+      state: createState(),
+      parent: editorRef.current
+    });
+    return () => {
+      var _a;
+      (_a = viewRef.current) == null ? void 0 : _a.destroy();
+    };
+  }, [completionFn, createState]);
+  return { editorRef, clearInput };
+};
+
+// src/filter-input/FilterInput.tsx
+var import_jsx_runtime = require("react/jsx-runtime");
+var classBase = "vuuFilterInput";
+var FilterInput = ({
+  existingFilter,
+  iconName = "filter",
+  namedFilters,
+  onSubmitFilter,
+  suggestionProvider,
+  ...props
+}) => {
+  const { editorRef, clearInput } = useCodeMirrorEditor({
+    existingFilter,
+    onSubmitFilter,
+    suggestionProvider
+  });
+  return /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { ...props, className: classBase, children: [
+    /* @__PURE__ */ (0, import_jsx_runtime.jsx)(
+      import_core.Button,
+      {
+        className: `${classBase}-FilterButton`,
+        "data-icon": iconName,
+        tabIndex: -1
+      }
+    ),
+    /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: `${classBase}-Editor`, ref: editorRef }),
+    /* @__PURE__ */ (0, import_jsx_runtime.jsx)(
+      import_core.Button,
+      {
+        className: `${classBase}-ClearButton`,
+        "data-icon": "close-circle",
+        onClick: clearInput
+      }
+    )
+  ] });
+};
+
+// src/filter-input/useFilterSuggestionProvider.ts
+var import_vuu_codemirror6 = require("@vuu-ui/vuu-codemirror");
+var import_vuu_data_react = require("@vuu-ui/vuu-data-react");
+var import_react3 = require("react");
+
+// src/filter-input/filterInfo.ts
+var import_vuu_utils2 = require("@vuu-ui/vuu-utils");
+var filterInfo = (filterName, filterQuery) => {
+  const rootElement = (0, import_vuu_utils2.createEl)("div", "vuuFunctionDoc");
+  const headingElement = (0, import_vuu_utils2.createEl)("div", "function-heading");
+  const nameElement = (0, import_vuu_utils2.createEl)("span", "function-name", filterName);
+  headingElement.appendChild(nameElement);
+  const child2 = (0, import_vuu_utils2.createEl)("p", void 0, filterQuery);
+  rootElement.appendChild(headingElement);
+  rootElement.appendChild(child2);
+  return rootElement;
+};
+
+// src/filter-input/useFilterSuggestionProvider.ts
+var NO_NAMED_FILTERS = [];
+var NONE = {};
+var saveAsTab = (onSubmit) => [
+  {
+    label: "Press ENTER to create TAB",
+    apply: () => onSubmit("tab"),
+    boost: 6
+  }
+];
+var makeSaveOrExtendSuggestions = (onSubmit, existingFilter, withJoinSuggestions = true) => {
+  const result = existingFilter ? [
+    {
+      label: "REPLACE existing filter",
+      apply: () => onSubmit("replace"),
+      boost: 8
+    },
+    {
+      label: "AND existing filter",
+      apply: () => onSubmit("and"),
+      boost: 7
+    },
+    {
+      label: "OR existing filter",
+      apply: () => onSubmit("or"),
+      boost: 7
+    }
+  ] : [
+    {
+      label: "Press ENTER to submit",
+      apply: () => onSubmit(),
+      boost: 6
+    }
+  ];
+  return withJoinSuggestions ? result.concat(import_vuu_codemirror6.booleanJoinSuggestions).concat(import_vuu_codemirror6.asNameSuggestion) : result;
+};
+var promptToSaveOrExtend = (onSubmit, existingFilter) => makeSaveOrExtendSuggestions(onSubmit, existingFilter, true);
+var promptToSave = (onSubmit) => makeSaveOrExtendSuggestions(onSubmit, void 0);
+var getSaveSuggestions = ({
+  existingFilter,
+  filterName,
+  onSubmit,
+  saveOptions
+}) => {
+  const includeTabSuggestion = filterName && saveOptions.allowSaveAsTab;
+  const result = existingFilter ? promptToSaveOrExtend(onSubmit, existingFilter) : promptToSave(onSubmit);
+  if (includeTabSuggestion) {
+    return result.concat(saveAsTab(onSubmit));
+  } else {
+    return result;
+  }
+};
+var suggestColumns = (columns) => columns.map((column) => ({
+  boost: 5,
+  label: column.name
+}));
+var suggestNamedFilters = (namedFilters) => namedFilters ? Array.from(namedFilters.entries()).map(([filterName, filterQuery]) => ({
+  info: () => filterInfo(filterName, filterQuery),
+  label: filterName,
+  type: "filter"
+})) : NO_NAMED_FILTERS;
+var doneCommand = {
+  label: "Done",
+  apply: "] ",
+  type: "keyword",
+  boost: 10
+};
+var withApplySpace = (suggestions, startsWith = "") => suggestions.filter((sugg) => startsWith === "" || sugg.label.startsWith(startsWith)).map((suggestion) => ({
+  ...suggestion,
+  apply: suggestion.label + " "
+}));
+var defaultSaveOptions = {
+  allowReplace: true
+};
+var useFilterSuggestionProvider = ({
+  columns,
+  namedFilters,
+  saveOptions = defaultSaveOptions,
+  table,
+  typeaheadHook: useTypeahead = import_vuu_data_react.useTypeaheadSuggestions
+}) => {
+  const latestSuggestionsRef = (0, import_react3.useRef)();
+  const getTypeaheadSuggestions = useTypeahead();
+  const getSuggestions = (0, import_react3.useCallback)(
+    async (suggestionType, options = NONE) => {
+      const {
+        columnName,
+        existingFilter,
+        filterName,
+        operator,
+        quoted: autoQuoted,
+        onSubmit,
+        startsWith,
+        selection
+      } = options;
+      switch (suggestionType) {
+        case "operator":
+          {
+            const column = columns.find((col) => col.name === columnName);
+            if (column) {
+              switch (column.serverDataType) {
+                case "string":
+                case "char":
+                  return withApplySpace(import_vuu_codemirror6.stringOperators, startsWith);
+                case "int":
+                case "long":
+                case "double":
+                  return withApplySpace(import_vuu_codemirror6.numericOperators);
+              }
+            } else {
+              console.warn(`'${columnName}' does not match any column name`);
+            }
+          }
+          break;
+        case "column": {
+          const columnSuggestions = await suggestColumns(columns);
+          const filterSuggestions = await suggestNamedFilters(namedFilters);
+          return (latestSuggestionsRef.current = withApplySpace(columnSuggestions)).concat(
+            withApplySpace(filterSuggestions)
+          );
+        }
+        case "columnValue":
+          {
+            if (columnName) {
+              const column = columns.find((col) => col.name === columnName);
+              if (!column) {
+                throw Error(
+                  `useFilterSUggestionProvider no column ${columnName}`
+                );
+              }
+              const prefix = Array.isArray(selection) ? selection.length === 0 ? "[" : "," : "";
+              const params = (0, import_vuu_data_react.getTypeaheadParams)(
+                table,
+                columnName,
+                startsWith
+              );
+              const suggestions = await getTypeaheadSuggestions(params);
+              const isIllustration = operator === "starts";
+              latestSuggestionsRef.current = (0, import_vuu_codemirror6.toSuggestions)(suggestions, {
+                moveCursorToEnd: autoQuoted,
+                quoted: (column == null ? void 0 : column.serverDataType) === "string" && !autoQuoted,
+                suffix: autoQuoted ? "" : " ",
+                prefix: isIllustration ? startsWith : prefix,
+                isIllustration
+              });
+              if (Array.isArray(selection) && (selection == null ? void 0 : selection.length) > 1) {
+                return [doneCommand, ...latestSuggestionsRef.current];
+              }
+              return latestSuggestionsRef.current;
+            }
+          }
+          break;
+        case "save": {
+          if (typeof onSubmit !== "function") {
+            throw Error(
+              "useFilterSuggestionProvider, onSubmit must be supplied for 'save' suggestions"
+            );
+          }
+          return await getSaveSuggestions({
+            existingFilter,
+            filterName,
+            onSubmit,
+            saveOptions
+          });
+        }
+        case "name":
+          return await (0, import_vuu_codemirror6.getNamePrompt)("filter");
+        default:
+      }
+      return [];
+    },
+    [columns, getTypeaheadSuggestions, namedFilters, saveOptions, table]
+  );
+  const isPartialMatch = (0, import_react3.useCallback)(
+    async (valueType, columnName, pattern) => {
+      const suggestions = (
+        // latestSuggestions && latestSuggestions.length > 0
+        //   ? latestSuggestions
+        await getSuggestions(valueType, { columnName })
+      );
+      if (pattern && suggestions) {
+        for (const option of suggestions) {
+          if (option.label === pattern) {
+            return false;
+          } else if (option.label.startsWith(pattern)) {
+            return true;
+          }
+        }
+      }
+      return false;
+    },
+    [getSuggestions]
+  );
+  return {
+    getSuggestions,
+    isPartialMatch
+  };
+};
+
+// src/filter-toolbar/FilterToolbar.tsx
+var import_salt_lab4 = require("@heswell/salt-lab");
+var import_classnames2 = __toESM(require_classnames(), 1);
+
+// src/filter-toolbar/useFilterToolbar.tsx
+var import_vuu_utils3 = require("@vuu-ui/vuu-utils");
+var import_salt_lab3 = require("@heswell/salt-lab");
+
+// src/filter-toolbar/FilterDropdown.tsx
+var import_salt_lab = require("@heswell/salt-lab");
+var import_react4 = require("react");
+var import_jsx_runtime2 = require("react/jsx-runtime");
+var isString = (s) => typeof s === "string";
+var stripQuotes = (selected) => {
+  if (isString(selected)) {
+    if (selected.startsWith('"') && selected.endsWith('"')) {
+      return selected.slice(1, -1);
+    } else {
+      return selected;
+    }
+  } else {
+    return selected.map(stripQuotes);
+  }
+};
+var FilterDropdown = ({
+  column,
+  selected: selectedProp,
+  suggestionProvider,
+  ...props
+}) => {
+  const selected = selectedProp != null ? stripQuotes(selectedProp) : void 0;
+  const initialValues = Array.isArray(selected) ? selected : selected != null ? [selected] : [];
+  const [values, setValues] = (0, import_react4.useState)(initialValues);
+  console.log({ initialValues });
+  const handleOpenChange = (0, import_react4.useCallback)(
+    async (isOpen) => {
+      if (isOpen) {
+        const values2 = await suggestionProvider.getSuggestions("columnValue", {
+          columnName: column
+        });
+        console.log({ values: values2 });
+        setValues(values2.map((suggestion) => suggestion.label));
+      }
+    },
+    [column, suggestionProvider]
+  );
+  return /* @__PURE__ */ (0, import_jsx_runtime2.jsx)(
+    import_salt_lab.Dropdown,
+    {
+      ...props,
+      onOpenChange: handleOpenChange,
+      selected,
+      source: values
+    }
+  );
+};
+
+// src/filter-toolbar/FilterDropdownMultiSelect.tsx
+var import_salt_lab2 = require("@heswell/salt-lab");
+var import_react5 = require("react");
+var import_jsx_runtime3 = require("react/jsx-runtime");
+var isString2 = (s) => typeof s === "string";
+var stripQuotes2 = (selected) => {
+  if (selected === void 0) {
+    return void 0;
+  } else if (isString2(selected)) {
+    if (selected.startsWith('"') && selected.endsWith('"')) {
+      return selected.slice(1, -1);
+    } else {
+      return selected;
+    }
+  } else {
+    return selected.map(stripQuotes2);
+  }
+};
+var FilterDropdownMultiSelect = ({
+  column,
+  selected: selectedProp,
+  suggestionProvider,
+  ...props
+}) => {
+  const selected = stripQuotes2(selectedProp);
+  const initialValues = Array.isArray(selected) ? selected : selected != null ? [selected] : [];
+  const [values, setValues] = (0, import_react5.useState)(initialValues);
+  const handleOpenChange = (0, import_react5.useCallback)(
+    async (isOpen) => {
+      if (isOpen) {
+        const values2 = await suggestionProvider.getSuggestions("columnValue", {
+          columnName: column
+        });
+        console.log({ values: values2 });
+        setValues(values2.map((suggestion) => suggestion.label));
+      }
+    },
+    [column, suggestionProvider]
+  );
+  return /* @__PURE__ */ (0, import_jsx_runtime3.jsx)(
+    import_salt_lab2.Dropdown,
+    {
+      ...props,
+      onOpenChange: handleOpenChange,
+      selected,
+      selectionStrategy: "multiple",
+      source: values
+    }
+  );
+};
+
+// src/filter-toolbar/useFilterToolbar.tsx
+var import_jsx_runtime4 = require("react/jsx-runtime");
+var filterToControl = (filter, suggestionProvider) => {
+  if ((0, import_vuu_utils3.isNamedFilter)(filter)) {
+    return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+      import_salt_lab3.ToggleButton,
+      {
+        className: "vuuToggleButton",
+        toggled: true,
+        variant: "secondary",
+        children: filter.name
+      }
+    );
+  }
+  if ((0, import_vuu_utils3.isSingleValueFilter)(filter)) {
+    const { column, value } = filter;
+    return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+      import_salt_lab3.ToolbarField,
+      {
+        className: "vuuFilterDropdown",
+        label: column,
+        labelPlacement: "top",
+        children: /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+          FilterDropdown,
+          {
+            column,
+            selected: value.toString(),
+            selectionStrategy: "default",
+            source: [value.toString()],
+            suggestionProvider,
+            style: { width: 100 }
+          }
+        )
+      },
+      column
+    );
+  }
+  if ((0, import_vuu_utils3.isMultiValueFilter)(filter)) {
+    const values = filter.values.map((v) => v.toString());
+    return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+      import_salt_lab3.ToolbarField,
+      {
+        className: "vuuFilterDropdown",
+        label: filter.column,
+        labelPlacement: "top",
+        children: /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+          FilterDropdownMultiSelect,
+          {
+            column: filter.column,
+            selected: values,
+            source: values,
+            suggestionProvider,
+            style: { width: 100 }
+          }
+        )
+      },
+      filter.column
+    );
+  }
+  return filter.filters.map(
+    (filter2) => filterToControl(filter2, suggestionProvider)
+  );
+};
+var useFilterToolbar = ({
+  filter,
+  suggestionProvider
+}) => {
+  if (filter) {
+    return filterToControl(filter, suggestionProvider);
+  }
+  return [];
+};
+
+// src/filter-toolbar/FilterToolbar.tsx
+var import_jsx_runtime5 = require("react/jsx-runtime");
+var FilterToolbar = ({
+  className,
+  filter,
+  suggestionProvider,
+  ...props
+}) => {
+  console.log(`FilterToolbar ${JSON.stringify(filter, null, 2)}`);
+  const toolbarItems = useFilterToolbar({ filter, suggestionProvider });
+  return /* @__PURE__ */ (0, import_jsx_runtime5.jsx)(import_salt_lab4.Toolbar, { className: (0, import_classnames2.default)("vuuFilterToolbar", className), ...props, children: toolbarItems });
+};
+
+// src/filter-utils.ts
+var import_vuu_utils4 = require("@vuu-ui/vuu-utils");
+var AND = "and";
+var EQUALS = "=";
+var GREATER_THAN = ">";
+var LESS_THAN = "<";
+var OR = "or";
+var STARTS_WITH = "starts";
+var ENDS_WITH = "ends";
+var IN = "in";
+var filterClauses = (filter, clauses = []) => {
+  if (filter) {
+    if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+      filter.filters.forEach((f) => clauses.push(...filterClauses(f)));
+    } else {
+      clauses.push(filter);
+    }
+  }
+  return clauses;
+};
+var DEFAULT_ADD_FILTER_OPTS = {
+  combineWith: "and"
+};
+var addFilter = (existingFilter, filter, { combineWith = AND } = DEFAULT_ADD_FILTER_OPTS) => {
+  var _a;
+  if (includesNoValues(filter)) {
+    if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+    } else {
+      existingFilter = removeFilterForColumn(existingFilter, {
+        name: filter.column
+      });
+    }
+  } else if (includesAllValues(filter)) {
+    if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+    }
+    return removeFilterForColumn(existingFilter, { name: (_a = filter.column) != null ? _a : "" });
+  }
+  if (!existingFilter) {
+    return filter;
+  }
+  if (!filter) {
+    return existingFilter;
+  }
+  if (existingFilter.op === AND && filter.op === AND) {
+    return {
+      op: AND,
+      filters: combine(existingFilter.filters, filter.filters)
+    };
+  }
+  if (existingFilter.op === AND) {
+    const filters = replaceOrInsert(existingFilter.filters, filter);
+    return filters.length > 1 ? { op: AND, filters } : filters[0];
+  }
+  if (filter.op === AND) {
+    return { op: AND, filters: filter.filters.concat(existingFilter) };
+  }
+  if (filterEquals(existingFilter, filter, true)) {
+    return filter;
+  }
+  if (canMerge(existingFilter, filter)) {
+    return merge(existingFilter, filter);
+  }
+  return { op: combineWith, filters: [existingFilter, filter] };
+};
+var includesNoValues = (filter) => {
+  if (!filter) {
+    return false;
+  }
+  if ((0, import_vuu_utils4.isInFilter)(filter) && filter.values.length === 0) {
+    return true;
+  }
+  return (0, import_vuu_utils4.isAndFilter)(filter) && filter.filters.some((f) => includesNoValues(f));
+};
+var includesAllValues = (filter) => {
+  if (!filter) {
+    return false;
+  }
+  if (filter.op === STARTS_WITH && filter.value === "") {
+    return true;
+  }
+  return filter.op === STARTS_WITH && filter.value === "";
+};
+var replaceOrInsert = (filters, filter) => {
+  return filters.concat(filter);
+};
+var merge = (f1, f2) => {
+  if (includesNoValues(f2)) {
+    return f2;
+  }
+  if ((0, import_vuu_utils4.isInFilter)(f1) && (0, import_vuu_utils4.isInFilter)(f2)) {
+    return {
+      ...f1,
+      values: [
+        ...f1.values,
+        ...f2.values.filter(
+          (v) => !f1.values.includes(v)
+        )
+      ]
+    };
+  } else if ((0, import_vuu_utils4.isInFilter)(f1) && f2.op === EQUALS) {
+    return {
+      ...f1,
+      // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+      // @ts-ignore
+      values: f1.values.concat([f2.value])
+    };
+  } else if (f1.op === EQUALS && f2.op === EQUALS) {
+    return {
+      column: f1.column,
+      op: IN,
+      // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+      // @ts-ignore
+      values: [f1.value, f2.value]
+    };
+  }
+  return f2;
+};
+var combine = (existingFilters, replacementFilters) => {
+  const equivalentType = ({ op: t1 }, { op: t2 }) => {
+    return t1 === t2 || t1[0] === t2[0];
+  };
+  const replaces = (existingFilter, replacementFilter) => {
+    return existingFilter.column === replacementFilter.column && equivalentType(existingFilter, replacementFilter);
+  };
+  const stillApplicable = (existingFilter) => replacementFilters.some(
+    (replacementFilter) => replaces(existingFilter, replacementFilter)
+  ) === false;
+  return existingFilters.filter(stillApplicable).concat(replacementFilters);
+};
+var removeFilter = (sourceFilter, filterToRemove) => {
+  if (filterEquals(sourceFilter, filterToRemove, true)) {
+    return null;
+  }
+  if (sourceFilter.op !== AND) {
+    throw Error(
+      `removeFilter cannot remove ${JSON.stringify(
+        filterToRemove
+      )} from ${JSON.stringify(sourceFilter)}`
+    );
+  }
+  const filters = sourceFilter.filters.filter(
+    (f) => !filterEquals(f, filterToRemove)
+  );
+  return filters.length > 0 ? { type: AND, filters } : null;
+};
+var splitFilterOnColumn = (columnName, filter) => {
+  if (!filter) {
+    return [void 0, void 0];
+  }
+  if (filter.column === columnName) {
+    return [filter, void 0];
+  }
+  if (filter.op !== AND) {
+    return [void 0, filter];
+  }
+  const [[columnFilter = void 0], filters] = (0, import_vuu_utils4.partition)(
+    filter.filters,
+    (f) => f.column === columnName
+  );
+  return filters.length === 1 ? [columnFilter, filters[0]] : [columnFilter, { op: AND, filters }];
+};
+var overrideColName = (filter, column) => {
+  if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+    return {
+      op: filter.op,
+      filters: filter.filters.map((f) => overrideColName(f, column))
+    };
+  }
+  return { ...filter, column };
+};
+var filterIncludesColumn = (filter, column) => {
+  if (!filter) {
+    return false;
+  }
+  const { op, column: filterColName } = filter;
+  switch (op) {
+    case AND:
+    case OR:
+      return filter.filters != null && filter.filters.some((f) => filterIncludesColumn(f, column));
+    default:
+      return filterColName === column.name;
+  }
+};
+var removeFilterForColumn = (sourceFilter, column) => {
+  const colName = column.name;
+  if (!sourceFilter) {
+    return void 0;
+  }
+  if (sourceFilter.column === colName) {
+    return void 0;
+  }
+  if ((0, import_vuu_utils4.isAndFilter)(sourceFilter) || (0, import_vuu_utils4.isOrFilter)(sourceFilter)) {
+    const { op } = sourceFilter;
+    const filters = sourceFilter.filters;
+    const otherColFilters = filters.filter((f) => f.column !== colName);
+    switch (otherColFilters.length) {
+      case 0:
+        return void 0;
+      case 1:
+        return otherColFilters[0];
+      default:
+        return { op, filters: otherColFilters };
+    }
+  }
+  return sourceFilter;
+};
+var canMerge = (f1, f2) => f1.column === f2.column && (f1.op === "=" || f1.op === "in") && (f2.op === "=" || f2.op === "in");
+var sameValues = (arr1, arr2) => {
+  if (arr1 === arr2) {
+    return true;
+  }
+  if (arr1.length === arr2.length) {
+    const a = arr1.slice().sort();
+    const b = arr2.slice().sort();
+    return a.join("|") === b.join("|");
+  }
+  return false;
+};
+var filterEquals = (f1, f2, strict = false) => {
+  if (!strict) {
+    return true;
+  }
+  if (f1 && f2 && canMerge(f1, f2)) {
+    return f1.op === f2.op && ((0, import_vuu_utils4.isSingleValueFilter)(f1) && (0, import_vuu_utils4.isSingleValueFilter)(f2) && f1.value === f2.value || (0, import_vuu_utils4.isMultiValueFilter)(f1) && (0, import_vuu_utils4.isMultiValueFilter)(f2) && sameValues(f1.values, f2.values));
+  }
+  return false;
+};
+var updateFilter = (filter, newFilter, mode) => {
+  if (filter && newFilter) {
+    if (mode === "replace") {
+      return newFilter;
+    }
+    if (filter.op === "and") {
+      return {
+        ...filter,
+        filters: filter.filters.concat(newFilter)
+      };
+    }
+    const { column: columnName } = newFilter;
+    if (columnName) {
+      const existingClause = newFilter.column ? (0, import_vuu_utils4.extractFilterForColumn)(filter, columnName) : void 0;
+      if (existingClause && columnName) {
+        const result = removeFilterForColumn(filter, { name: columnName });
+        return updateFilter(result, newFilter, "add");
+      }
+    }
+    return {
+      op: "and",
+      filters: [filter, newFilter]
+    };
+  }
+  if (newFilter) {
+    return newFilter;
+  }
+  return filter;
+};
+var getTypeaheadFilter = (column, filterValues, isStartsWithFilter) => {
+  if (filterValues.length === 0) {
+    return void 0;
+  }
+  if (isStartsWithFilter) {
+    const startsWith = filterValues[0].substring(0, filterValues[0].length - 3);
+    return {
+      column,
+      op: "starts",
+      value: `"${startsWith}"`
+    };
+  }
+  return {
+    column,
+    op: "in",
+    values: filterValues.map((value) => `"${value}"`)
+  };
+};
+var getNumericFilter = (column, operator, value) => {
+  if (operator === void 0)
+    return void 0;
+  if (value === void 0 || isNaN(value))
+    return void 0;
+  return { column, op: operator, value };
+};
 /*! Bundled license information:
 
 classnames/index.js: