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

package/esm/index.js

@@ -1,4479 +1,4 @@
-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 __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 __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;
-};
-
-// ../../node_modules/classnames/index.js
-var require_classnames = __commonJS({
-  "../../node_modules/classnames/index.js"(exports, module) {
-    (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 module !== "undefined" && module.exports) {
-        classNames.default = classNames;
-        module.exports = classNames;
-      } else if (typeof define === "function" && typeof define.amd === "object" && define.amd) {
-        define("classnames", [], function() {
-          return classNames;
-        });
-      } else {
-        window.classNames = classNames;
-      }
-    })();
-  }
-});
-
-// src/filter-input/FilterInput.tsx
-import { Button } from "@salt-ds/core";
-
-// src/filter-input/useCodeMirrorEditor.ts
-import {
-  autocompletion,
-  defaultKeymap,
-  EditorState as EditorState2,
-  EditorView as EditorView2,
-  ensureSyntaxTree,
-  keymap,
-  minimalSetup,
-  startCompletion
-} from "@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 });
-
-// ../../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;
-}
-
-// ../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
-import {
-  isMultiClauseFilter,
-  isMultiValueFilter,
-  isSingleValueFilter
-} from "@vuu-ui/vuu-utils";
-var _filter;
-var FilterExpression = class {
-  constructor() {
-    __privateAdd(this, _filter, void 0);
-  }
-  setFilterCombinatorOp(op, filter = __privateGet(this, _filter)) {
-    if (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 (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 (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 (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 (isMultiClauseFilter(filter)) {
-      const target = filter.filters.at(-1);
-      if (target) {
-        this.setValue(value, target);
-      }
-    } else if (isMultiValueFilter(filter)) {
-      (_a = filter.values) != null ? _a : filter.values = [];
-      filter.values.push(value);
-    } else if (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);
-import { useEffect, useMemo, useRef } from "react";
-
-// src/filter-input/FilterLanguage.ts
-import {
-  LanguageSupport,
-  LRLanguage,
-  styleTags,
-  tags as tag
-} from "@vuu-ui/vuu-codemirror";
-var filterLanguage = LRLanguage.define({
-  name: "VuuFilterQuery",
-  parser: parser.configure({
-    props: [
-      styleTags({
-        Identifier: tag.variableName,
-        String: tag.string,
-        Or: tag.emphasis,
-        Operator: tag.operator
-      })
-    ]
-  })
-});
-var filterLanguageSupport = () => {
-  return new LanguageSupport(filterLanguage);
-};
-
-// src/filter-input/highlighting.ts
-import {
-  HighlightStyle,
-  syntaxHighlighting,
-  tags
-} from "@vuu-ui/vuu-codemirror";
-var myHighlightStyle = HighlightStyle.define([
-  { tag: tags.variableName, color: "var(--vuuFilterEditor-variableColor)" },
-  { tag: tags.comment, color: "green", fontStyle: "italic" }
-]);
-var vuuHighlighting = syntaxHighlighting(myHighlightStyle);
-
-// src/filter-input/theme.ts
-import { EditorView } from "@vuu-ui/vuu-codemirror";
-var vuuTheme = 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
-import {
-  getNodeByName,
-  getValue,
-  syntaxTree
-} from "@vuu-ui/vuu-codemirror";
-import { useCallback } from "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 getValue(maybeColumnNode, state);
-  } else {
-    return void 0;
-  }
-};
-var getPartialOperator = (maybeOperatorNode, state, columnName) => {
-  const value = 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 getValue(maybeTargetNode, state);
-  } else {
-    return void 0;
-  }
-};
-var getFilterName = (node, state) => {
-  if (node.name === "FilterName") {
-    return 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 getValue(node, state);
-    }
-  }
-};
-var getColumnName = (node, state) => {
-  const prevNode = node.prevSibling;
-  if ((prevNode == null ? void 0 : prevNode.name) === "Column") {
-    return 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 = getValue(maybeTargetNode, state);
-    if (value) {
-      values.push(value);
-    } else {
-      break;
-    }
-    maybeTargetNode = maybeTargetNode.prevSibling;
-  }
-  return values;
-};
-var useAutoComplete = (suggestionProvider, onSubmit, existingFilter) => {
-  const makeSuggestions = useCallback(
-    async (context, suggestionType, optionalArgs = {}) => {
-      const { startsWith = "" } = optionalArgs;
-      const options = await suggestionProvider.getSuggestions(
-        suggestionType,
-        optionalArgs
-      );
-      return { from: context.pos - startsWith.length, options };
-    },
-    [suggestionProvider]
-  );
-  return 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 = 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 = 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 = 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 = getNodeByName(nodeBefore, state);
-          const selection = getSetValues(nodeBefore, state);
-          return makeSuggestions(context, "columnValue", {
-            columnName,
-            selection
-          });
-        }
-        case "Comma":
-        case "LBrack": {
-          const columnName = 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: getNodeByName(nodeBefore, state)
-              });
-            } else if ((lastToken == null ? void 0 : lastToken.name) === "Operator") {
-              return makeSuggestions(context, "columnValue", {
-                columnName: getNodeByName(lastToken, state),
-                operator: getValue(lastToken, state)
-              });
-            }
-          }
-          break;
-        case "In": {
-          return {
-            from: context.pos,
-            options: [{ label: "[", apply: " [", type: "text" }]
-          };
-        }
-        case "Eq": {
-          return makeSuggestions(context, "columnValue", {
-            columnName: 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 = useRef(null);
-  const onSubmit = useRef(noop);
-  const viewRef = useRef();
-  const completionFn = useAutoComplete(
-    suggestionProvider,
-    onSubmit,
-    existingFilter
-  );
-  const [createState, clearInput] = useMemo(() => {
-    const parseFilter2 = () => {
-      const view = getView(viewRef);
-      const source = view.state.doc.toString();
-      const tree = 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 keymap.of([
-        {
-          key,
-          run() {
-            submitFilterAndClearInput();
-            return true;
-          }
-        }
-      ]);
-    };
-    const showSuggestions = (key) => {
-      return keymap.of([
-        {
-          key,
-          run() {
-            startCompletion(getView(viewRef));
-            return true;
-          }
-        }
-      ]);
-    };
-    const createState2 = () => EditorState2.create({
-      doc: "",
-      extensions: [
-        minimalSetup,
-        autocompletion({
-          override: [completionFn],
-          optionClass: getOptionClass
-        }),
-        filterLanguageSupport(),
-        keymap.of(defaultKeymap),
-        submitFilter("Ctrl-Enter"),
-        showSuggestions("ArrowDown"),
-        EditorView2.updateListener.of((v) => {
-          const view = getView(viewRef);
-          if (v.docChanged) {
-            startCompletion(view);
-          }
-        }),
-        EditorState2.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]);
-  useEffect(() => {
-    if (!editorRef.current) {
-      throw Error("editor not in dom");
-    }
-    viewRef.current = new EditorView2({
-      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
-import { jsx, jsxs } from "react/jsx-runtime";
-var classBase = "vuuFilterInput";
-var FilterInput = ({
-  existingFilter,
-  iconName = "filter",
-  namedFilters,
-  onSubmitFilter,
-  suggestionProvider,
-  ...props
-}) => {
-  const { editorRef, clearInput } = useCodeMirrorEditor({
-    existingFilter,
-    onSubmitFilter,
-    suggestionProvider
-  });
-  return /* @__PURE__ */ jsxs("div", { ...props, className: classBase, children: [
-    /* @__PURE__ */ jsx(
-      Button,
-      {
-        className: `${classBase}-FilterButton`,
-        "data-icon": iconName,
-        tabIndex: -1
-      }
-    ),
-    /* @__PURE__ */ jsx("div", { className: `${classBase}-Editor`, ref: editorRef }),
-    /* @__PURE__ */ jsx(
-      Button,
-      {
-        className: `${classBase}-ClearButton`,
-        "data-icon": "close-circle",
-        onClick: clearInput
-      }
-    )
-  ] });
-};
-
-// src/filter-input/useFilterSuggestionProvider.ts
-import {
-  asNameSuggestion,
-  booleanJoinSuggestions,
-  getNamePrompt,
-  numericOperators,
-  stringOperators,
-  toSuggestions
-} from "@vuu-ui/vuu-codemirror";
-import {
-  getTypeaheadParams,
-  useTypeaheadSuggestions
-} from "@vuu-ui/vuu-data-react";
-import { useCallback as useCallback2, useRef as useRef2 } from "react";
-
-// src/filter-input/filterInfo.ts
-import { createEl } from "@vuu-ui/vuu-utils";
-var filterInfo = (filterName, filterQuery) => {
-  const rootElement = createEl("div", "vuuFunctionDoc");
-  const headingElement = createEl("div", "function-heading");
-  const nameElement = createEl("span", "function-name", filterName);
-  headingElement.appendChild(nameElement);
-  const child2 = 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(booleanJoinSuggestions).concat(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 = useTypeaheadSuggestions
-}) => {
-  const latestSuggestionsRef = useRef2();
-  const getTypeaheadSuggestions = useTypeahead();
-  const getSuggestions = useCallback2(
-    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(stringOperators, startsWith);
-                case "int":
-                case "long":
-                case "double":
-                  return withApplySpace(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 = getTypeaheadParams(
-                table,
-                columnName,
-                startsWith
-              );
-              const suggestions = await getTypeaheadSuggestions(params);
-              const isIllustration = operator === "starts";
-              latestSuggestionsRef.current = 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 getNamePrompt("filter");
-        default:
-      }
-      return [];
-    },
-    [columns, getTypeaheadSuggestions, namedFilters, saveOptions, table]
-  );
-  const isPartialMatch = useCallback2(
-    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_classnames2 = __toESM(require_classnames(), 1);
-import { Toolbar } from "@heswell/salt-lab";
-
-// src/filter-toolbar/useFilterToolbar.tsx
-import {
-  isMultiValueFilter as isMultiValueFilter2,
-  isNamedFilter,
-  isSingleValueFilter as isSingleValueFilter2
-} from "@vuu-ui/vuu-utils";
-import { ToggleButton, ToolbarField } from "@heswell/salt-lab";
-
-// src/filter-toolbar/FilterDropdown.tsx
-import { Dropdown } from "@heswell/salt-lab";
-import { useCallback as useCallback3, useState } from "react";
-import { jsx as jsx2 } from "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] = useState(initialValues);
-  console.log({ initialValues });
-  const handleOpenChange = useCallback3(
-    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__ */ jsx2(
-    Dropdown,
-    {
-      ...props,
-      onOpenChange: handleOpenChange,
-      selected,
-      source: values
-    }
-  );
-};
-
-// src/filter-toolbar/FilterDropdownMultiSelect.tsx
-import { Dropdown as Dropdown2 } from "@heswell/salt-lab";
-import { useCallback as useCallback4, useState as useState2 } from "react";
-import { jsx as jsx3 } from "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] = useState2(initialValues);
-  const handleOpenChange = useCallback4(
-    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__ */ jsx3(
-    Dropdown2,
-    {
-      ...props,
-      onOpenChange: handleOpenChange,
-      selected,
-      selectionStrategy: "multiple",
-      source: values
-    }
-  );
-};
-
-// src/filter-toolbar/useFilterToolbar.tsx
-import { jsx as jsx4 } from "react/jsx-runtime";
-var filterToControl = (filter, suggestionProvider) => {
-  if (isNamedFilter(filter)) {
-    return /* @__PURE__ */ jsx4(
-      ToggleButton,
-      {
-        className: "vuuToggleButton",
-        toggled: true,
-        variant: "secondary",
-        children: filter.name
-      }
-    );
-  }
-  if (isSingleValueFilter2(filter)) {
-    const { column, value } = filter;
-    return /* @__PURE__ */ jsx4(
-      ToolbarField,
-      {
-        className: "vuuFilterDropdown",
-        label: column,
-        labelPlacement: "top",
-        children: /* @__PURE__ */ jsx4(
-          FilterDropdown,
-          {
-            column,
-            selected: value.toString(),
-            selectionStrategy: "default",
-            source: [value.toString()],
-            suggestionProvider,
-            style: { width: 100 }
-          }
-        )
-      },
-      column
-    );
-  }
-  if (isMultiValueFilter2(filter)) {
-    const values = filter.values.map((v) => v.toString());
-    return /* @__PURE__ */ jsx4(
-      ToolbarField,
-      {
-        className: "vuuFilterDropdown",
-        label: filter.column,
-        labelPlacement: "top",
-        children: /* @__PURE__ */ jsx4(
-          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
-import { jsx as jsx5 } from "react/jsx-runtime";
-var FilterToolbar = ({
-  className,
-  filter,
-  suggestionProvider,
-  ...props
-}) => {
-  console.log(`FilterToolbar ${JSON.stringify(filter, null, 2)}`);
-  const toolbarItems = useFilterToolbar({ filter, suggestionProvider });
-  return /* @__PURE__ */ jsx5(Toolbar, { className: (0, import_classnames2.default)("vuuFilterToolbar", className), ...props, children: toolbarItems });
-};
-
-// src/filter-utils.ts
-import {
-  extractFilterForColumn,
-  isAndFilter,
-  isInFilter,
-  isMultiClauseFilter as isMultiClauseFilter2,
-  isMultiValueFilter as isMultiValueFilter3,
-  isOrFilter,
-  isSingleValueFilter as isSingleValueFilter3,
-  partition
-} from "@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 (isMultiClauseFilter2(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 (isMultiClauseFilter2(filter)) {
-    } else {
-      existingFilter = removeFilterForColumn(existingFilter, {
-        name: filter.column
-      });
-    }
-  } else if (includesAllValues(filter)) {
-    if (isMultiClauseFilter2(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 (isInFilter(filter) && filter.values.length === 0) {
-    return true;
-  }
-  return 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 (isInFilter(f1) && isInFilter(f2)) {
-    return {
-      ...f1,
-      values: [
-        ...f1.values,
-        ...f2.values.filter(
-          (v) => !f1.values.includes(v)
-        )
-      ]
-    };
-  } else if (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] = partition(
-    filter.filters,
-    (f) => f.column === columnName
-  );
-  return filters.length === 1 ? [columnFilter, filters[0]] : [columnFilter, { op: AND, filters }];
-};
-var overrideColName = (filter, column) => {
-  if (isMultiClauseFilter2(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 (isAndFilter(sourceFilter) || 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 && (isSingleValueFilter3(f1) && isSingleValueFilter3(f2) && f1.value === f2.value || isMultiValueFilter3(f1) && isMultiValueFilter3(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 ? 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 };
-};
-export {
-  AND,
-  ENDS_WITH,
-  EQUALS,
-  FilterInput,
-  FilterToolbar,
-  GREATER_THAN,
-  IN,
-  LESS_THAN,
-  OR,
-  STARTS_WITH,
-  addFilter,
-  filterClauses,
-  filterEquals,
-  filterIncludesColumn,
-  getNumericFilter,
-  getTypeaheadFilter,
-  overrideColName,
-  removeFilter,
-  splitFilterOnColumn,
-  updateFilter,
-  useCodeMirrorEditor,
-  useFilterSuggestionProvider
-};
+var Xt=Object.create;var Je=Object.defineProperty;var Gt=Object.getOwnPropertyDescriptor;var Yt=Object.getOwnPropertyNames;var qt=Object.getPrototypeOf,Zt=Object.prototype.hasOwnProperty;var Jt=(s,e)=>()=>(e||s((e={exports:{}}).exports,e),e.exports);var Kt=(s,e,t,r)=>{if(e&&typeof e=="object"||typeof e=="function")for(let i of Yt(e))!Zt.call(s,i)&&i!==t&&Je(s,i,{get:()=>e[i],enumerable:!(r=Gt(e,i))||r.enumerable});return s};var Ke=(s,e,t)=>(t=s!=null?Xt(qt(s)):{},Kt(e||!s||!s.__esModule?Je(t,"default",{value:s,enumerable:!0}):t,s));var et=(s,e,t)=>{if(!e.has(s))throw TypeError("Cannot "+t)};var V=(s,e,t)=>(et(s,e,"read from private field"),t?t.call(s):e.get(s)),tt=(s,e,t)=>{if(e.has(s))throw TypeError("Cannot add the same private member more than once");e instanceof WeakSet?e.add(s):e.set(s,t)},Ae=(s,e,t,r)=>(et(s,e,"write to private field"),r?r.call(s,t):e.set(s,t),t);var Le=Jt((Xs,ke)=>{(function(){"use strict";var s={}.hasOwnProperty,e="[native code]";function t(){for(var r=[],i=0;i<arguments.length;i++){var n=arguments[i];if(n){var o=typeof n;if(o==="string"||o==="number")r.push(n);else if(Array.isArray(n)){if(n.length){var l=t.apply(null,n);l&&r.push(l)}}else if(o==="object"){if(n.toString!==Object.prototype.toString&&!n.toString.toString().includes("[native code]")){r.push(n.toString());continue}for(var a in n)s.call(n,a)&&n[a]&&r.push(a)}}}return r.join(" ")}typeof ke<"u"&&ke.exports?(t.default=t,ke.exports=t):typeof define=="function"&&typeof define.amd=="object"&&define.amd?define("classnames",[],function(){return t}):window.classNames=t})()});import{Button as Nt}from"@salt-ds/core";import{autocompletion as yr,defaultKeymap as kr,EditorState as Pt,EditorView as wt,ensureSyntaxTree as vr,keymap as $e,minimalSetup as Or,startCompletion as Ft}from"@vuu-ui/vuu-codemirror";var er=0,oe=class{constructor(e,t){this.from=e,this.to=t}},k=class{constructor(e={}){this.id=er++,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=R.match(e)),t=>{let r=e(t);return r===void 0?null:[this,r]}}};k.closedBy=new k({deserialize:s=>s.split(" ")});k.openedBy=new k({deserialize:s=>s.split(" ")});k.group=new k({deserialize:s=>s.split(" ")});k.contextHash=new k({perNode:!0});k.lookAhead=new k({perNode:!0});k.mounted=new k({perNode:!0});var tr=Object.create(null),R=class{constructor(e,t,r,i=0){this.name=e,this.props=t,this.id=r,this.flags=i}static define(e){let t=e.props&&e.props.length?Object.create(null):tr,r=(e.top?1:0)|(e.skipped?2:0)|(e.error?4:0)|(e.name==null?8:0),i=new R(e.name||"",t,e.id,r);if(e.props){for(let n of e.props)if(Array.isArray(n)||(n=n(i)),n){if(n[0].perNode)throw new RangeError("Can't store a per-node prop on a node type");t[n[0].id]=n[1]}}return i}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 i of r.split(" "))t[i]=e[r];return r=>{for(let i=r.prop(k.group),n=-1;n<(i?i.length:0);n++){let o=t[n<0?r.name:i[n]];if(o)return o}}}};R.none=new R("",Object.create(null),0,8);var K=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 i=null;for(let n of e){let o=n(r);o&&(i||(i=Object.assign({},r.props)),i[o[0].id]=o[1])}t.push(i?new R(r.name,i,r.id,r.flags):r)}return new K(t)}},de=new WeakMap,rt=new WeakMap,F;(function(s){s[s.ExcludeBuffers=1]="ExcludeBuffers",s[s.IncludeAnonymous=2]="IncludeAnonymous",s[s.IgnoreMounts=4]="IgnoreMounts",s[s.IgnoreOverlays=8]="IgnoreOverlays"})(F||(F={}));var A=class{constructor(e,t,r,i,n){if(this.type=e,this.children=t,this.positions=r,this.length=i,this.props=null,n&&n.length){this.props=Object.create(null);for(let[o,l]of n)this.props[typeof o=="number"?o:o.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 i=r.toString();i&&(t&&(t+=","),t+=i)}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 te(this.topNode,e)}cursorAt(e,t=0,r=0){let i=de.get(this)||this.topNode,n=new te(i);return n.moveTo(e,t),de.set(this,n._tree),n}get topNode(){return new B(this,0,0,null)}resolve(e,t=0){let r=ee(de.get(this)||this.topNode,e,t,!1);return de.set(this,r),r}resolveInner(e,t=0){let r=ee(rt.get(this)||this.topNode,e,t,!0);return rt.set(this,r),r}iterate(e){let{enter:t,leave:r,from:i=0,to:n=this.length}=e,o=e.mode||0,l=(o&F.IncludeAnonymous)>0;for(let a=this.cursor(o|F.IncludeAnonymous);;){let u=!1;if(a.from<=n&&a.to>=i&&(!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:Re(R.none,this.children,this.positions,0,this.children.length,0,this.length,(t,r,i)=>new A(this.type,t,r,i,this.propValues),e.makeTree||((t,r,i)=>new A(R.none,t,r,i)))}static build(e){return rr(e)}};A.empty=new A(R.none,[],[],0);var le=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 le(this.buffer,this.index)}},$=class{constructor(e,t,r){this.buffer=e,this.length=t,this.set=r}get type(){return R.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],i=this.set.types[t],n=i.name;if(/\W/.test(n)&&!i.isError&&(n=JSON.stringify(n)),e+=4,r==e)return n;let o=[];for(;e<r;)o.push(this.childString(e)),e=this.buffer[e+3];return n+"("+o.join(",")+")"}findChild(e,t,r,i,n){let{buffer:o}=this,l=-1;for(let a=e;a!=t&&!(it(n,i,o[a+1],o[a+2])&&(l=a,r>0));a=o[a+3]);return l}slice(e,t,r){let i=this.buffer,n=new Uint16Array(t-e),o=0;for(let l=e,a=0;l<t;){n[a++]=i[l++],n[a++]=i[l++]-r;let u=n[a++]=i[l++]-r;n[a++]=i[l++]-e,o=Math.max(o,u)}return new $(n,o,this.set)}};function it(s,e,t,r){switch(s){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 nt(s,e){let t=s.childBefore(e);for(;t;){let r=t.lastChild;if(!r||r.to!=t.to)break;r.type.isError&&r.from==r.to?(s=t,t=r.prevSibling):t=r}return s}function ee(s,e,t,r){for(var i;s.from==s.to||(t<1?s.from>=e:s.from>e)||(t>-1?s.to<=e:s.to<e);){let o=!r&&s instanceof B&&s.index<0?null:s.parent;if(!o)return s;s=o}let n=r?0:F.IgnoreOverlays;if(r)for(let o=s,l=o.parent;l;o=l,l=o.parent)o instanceof B&&o.index<0&&((i=l.enter(e,t,n))===null||i===void 0?void 0:i.from)!=o.from&&(s=l);for(;;){let o=s.enter(e,t,n);if(!o)return s;s=o}}var B=class{constructor(e,t,r,i){this._tree=e,this.from=t,this.index=r,this._parent=i}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,i,n=0){for(let o=this;;){for(let{children:l,positions:a}=o._tree,u=t>0?l.length:-1;e!=u;e+=t){let c=l[e],h=a[e]+o.from;if(it(i,r,h,h+c.length)){if(c instanceof $){if(n&F.ExcludeBuffers)continue;let f=c.findChild(0,c.buffer.length,t,r-h,i);if(f>-1)return new _(new Te(o,c,e,h),null,f)}else if(n&F.IncludeAnonymous||!c.type.isAnonymous||Ee(c)){let f;if(!(n&F.IgnoreMounts)&&c.props&&(f=c.prop(k.mounted))&&!f.overlay)return new B(f.tree,h,e,o);let p=new B(c,h,e,o);return n&F.IncludeAnonymous||!p.type.isAnonymous?p:p.nextChild(t<0?c.children.length-1:0,t,r,i)}}}if(n&F.IncludeAnonymous||!o.type.isAnonymous||(o.index>=0?e=o.index+t:e=t<0?-1:o._parent._tree.children.length,o=o._parent,!o))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 i;if(!(r&F.IgnoreOverlays)&&(i=this._tree.prop(k.mounted))&&i.overlay){let n=e-this.from;for(let{from:o,to:l}of i.overlay)if((t>0?o<=n:o<n)&&(t<0?l>=n:l>n))return new B(i.tree,i.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 te(this,e)}get tree(){return this._tree}toTree(){return this._tree}resolve(e,t=0){return ee(this,e,t,!1)}resolveInner(e,t=0){return ee(this,e,t,!0)}enterUnfinishedNodesBefore(e){return nt(this,e)}getChild(e,t=null,r=null){let i=me(this,e,t,r);return i.length?i[0]:null}getChildren(e,t=null,r=null){return me(this,e,t,r)}toString(){return this._tree.toString()}get node(){return this}matchContext(e){return be(this,e)}};function me(s,e,t,r){let i=s.cursor(),n=[];if(!i.firstChild())return n;if(t!=null){for(;!i.type.is(t);)if(!i.nextSibling())return n}for(;;){if(r!=null&&i.type.is(r))return n;if(i.type.is(e)&&n.push(i.node),!i.nextSibling())return r==null?n:[]}}function be(s,e,t=e.length-1){for(let r=s.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 Te=class{constructor(e,t,r,i){this.parent=e,this.buffer=t,this.index=r,this.start=i}},_=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:i}=this.context,n=i.findChild(this.index+4,i.buffer[this.index+3],e,t-this.context.start,r);return n<0?null:new _(this.context,this,n)}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&F.ExcludeBuffers)return null;let{buffer:i}=this.context,n=i.findChild(this.index+4,i.buffer[this.index+3],t>0?1:-1,e-this.context.start,t);return n<0?null:new _(this.context,this,n)}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 _(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 _(this.context,this._parent,e.findChild(t,this.index,-1,0,4))}cursor(e=0){return new te(this,e)}get tree(){return null}toTree(){let e=[],t=[],{buffer:r}=this.context,i=this.index+4,n=r.buffer[this.index+3];if(n>i){let o=r.buffer[this.index+1];e.push(r.slice(i,n,o)),t.push(0)}return new A(this.type,e,t,this.to-this.from)}resolve(e,t=0){return ee(this,e,t,!1)}resolveInner(e,t=0){return ee(this,e,t,!0)}enterUnfinishedNodesBefore(e){return nt(this,e)}toString(){return this.context.buffer.childString(this.index)}getChild(e,t=null,r=null){let i=me(this,e,t,r);return i.length?i[0]:null}getChildren(e,t=null,r=null){return me(this,e,t,r)}get node(){return this}matchContext(e){return be(this,e)}},te=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 B)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:i}=this.buffer;return this.type=t||i.set.types[i.buffer[e]],this.from=r+i.buffer[e+1],this.to=r+i.buffer[e+2],!0}yield(e){return e?e instanceof B?(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:i}=this.buffer,n=i.findChild(this.index+4,i.buffer[this.index+3],e,t-this.buffer.start,r);return n<0?!1:(this.stack.push(this.index),this.yieldBuf(n))}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&F.ExcludeBuffers?!1:this.enterChild(1,e,t):this.yield(this._tree.enter(e,t,r))}parent(){if(!this.buffer)return this.yieldNode(this.mode&F.IncludeAnonymous?this._tree._parent:this._tree.parent);if(this.stack.length)return this.yieldBuf(this.stack.pop());let e=this.mode&F.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 i=r<0?0:this.stack[r]+4;if(this.index!=i)return this.yieldBuf(t.findChild(i,this.index,-1,0,4))}else{let i=t.buffer[this.index+3];if(i<(r<0?t.buffer.length:t.buffer[this.stack[r]+3]))return this.yieldBuf(i)}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:i}=this;if(i){if(e>0){if(this.index<i.buffer.buffer.length)return!1}else for(let n=0;n<this.index;n++)if(i.buffer.buffer[n+3]<this.index)return!1;({index:t,parent:r}=i)}else({index:t,_parent:r}=this._tree);for(;r;{index:t,_parent:r}=r)if(t>-1)for(let n=t+e,o=e<0?-1:r._tree.children.length;n!=o;n+=e){let l=r._tree.children[n];if(this.mode&F.IncludeAnonymous||l instanceof $||!l.type.isAnonymous||Ee(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 i=this.index,n=this.stack.length;n>=0;){for(let o=e;o;o=o._parent)if(o.index==i){if(i==this.index)return o;t=o,r=n+1;break e}i=this.stack[--n]}for(let i=r;i<this.stack.length;i++)t=new _(this.buffer,t,this.stack[i]);return this.bufferNode=new _(this.buffer,t,this.index)}get tree(){return this.buffer?null:this._tree._tree}iterate(e,t){for(let r=0;;){let i=!1;if(this.type.isAnonymous||e(this)!==!1){if(this.firstChild()){r++;continue}this.type.isAnonymous||(i=!0)}for(;i&&t&&t(this),i=this.type.isAnonymous,!this.nextSibling();){if(!r)return;this.parent(),r--,i=!0}}}matchContext(e){if(!this.buffer)return be(this.node,e);let{buffer:t}=this.buffer,{types:r}=t.set;for(let i=e.length-1,n=this.stack.length-1;i>=0;n--){if(n<0)return be(this.node,e,i);let o=r[t.buffer[this.stack[n]]];if(!o.isAnonymous){if(e[i]&&e[i]!=o.name)return!1;i--}}return!0}};function Ee(s){return s.children.some(e=>e instanceof $||!e.type.isAnonymous||Ee(e))}function rr(s){var e;let{buffer:t,nodeSet:r,maxBufferLength:i=1024,reused:n=[],minRepeatType:o=r.types.length}=s,l=Array.isArray(t)?new le(t,t.length):t,a=r.types,u=0,c=0;function h(S,v,g,b,P){let{id:y,start:x,end:C,size:E}=l,Q=c;for(;E<0;)if(l.next(),E==-1){let X=n[y];g.push(X),b.push(x-S);return}else if(E==-3){u=y;return}else if(E==-4){c=y;return}else throw new RangeError(`Unrecognized record size: ${E}`);let Z=a[y],H,W,qe=x-S;if(C-x<=i&&(W=m(l.pos-v,P))){let X=new Uint16Array(W.size-W.skip),M=l.pos-W.size,L=X.length;for(;l.pos>M;)L=T(W.start,X,L);H=new $(X,C-W.start,r),qe=W.start-S}else{let X=l.pos-E;l.next();let M=[],L=[],Y=y>=o?y:-1,J=0,pe=C;for(;l.pos>X;)Y>=0&&l.id==Y&&l.size>=0?(l.end<=pe-i&&(p(M,L,x,J,l.end,pe,Y,Q),J=M.length,pe=l.end),l.next()):h(x,X,M,L,Y);if(Y>=0&&J>0&&J<M.length&&p(M,L,x,J,x,pe,Y,Q),M.reverse(),L.reverse(),Y>-1&&J>0){let Ze=f(Z);H=Re(Z,M,L,0,M.length,0,C-x,Ze,Ze)}else H=d(Z,M,L,C-x,Q-C)}g.push(H),b.push(qe)}function f(S){return(v,g,b)=>{let P=0,y=v.length-1,x,C;if(y>=0&&(x=v[y])instanceof A){if(!y&&x.type==S&&x.length==b)return x;(C=x.prop(k.lookAhead))&&(P=g[y]+x.length+C)}return d(S,v,g,b,P)}}function p(S,v,g,b,P,y,x,C){let E=[],Q=[];for(;S.length>b;)E.push(S.pop()),Q.push(v.pop()+g-P);S.push(d(r.types[x],E,Q,y-P,C-y)),v.push(P-g)}function d(S,v,g,b,P=0,y){if(u){let x=[k.contextHash,u];y=y?[x].concat(y):[x]}if(P>25){let x=[k.lookAhead,P];y=y?[x].concat(y):[x]}return new A(S,v,g,b,y)}function m(S,v){let g=l.fork(),b=0,P=0,y=0,x=g.end-i,C={size:0,start:0,skip:0};e:for(let E=g.pos-S;g.pos>E;){let Q=g.size;if(g.id==v&&Q>=0){C.size=b,C.start=P,C.skip=y,y+=4,b+=4,g.next();continue}let Z=g.pos-Q;if(Q<0||Z<E||g.start<x)break;let H=g.id>=o?4:0,W=g.start;for(g.next();g.pos>Z;){if(g.size<0)if(g.size==-3)H+=4;else break e;else g.id>=o&&(H+=4);g.next()}P=W,b+=Q,y+=H}return(v<0||b==S)&&(C.size=b,C.start=P,C.skip=y),C.size>4?C:void 0}function T(S,v,g){let{id:b,start:P,end:y,size:x}=l;if(l.next(),x>=0&&b<o){let C=g;if(x>4){let E=l.pos-(x-4);for(;l.pos>E;)g=T(S,v,g)}v[--g]=C,v[--g]=y-S,v[--g]=P-S,v[--g]=b}else x==-3?u=b:x==-4&&(c=b);return g}let N=[],w=[];for(;l.pos>0;)h(s.start||0,s.bufferStart||0,N,w,-1);let O=(e=s.length)!==null&&e!==void 0?e:N.length?w[0]+N[0].length:0;return new A(a[s.topID],N.reverse(),w.reverse(),O)}var st=new WeakMap;function ge(s,e){if(!s.isAnonymous||e instanceof $||e.type!=s)return 1;let t=st.get(e);if(t==null){t=1;for(let r of e.children){if(r.type!=s||!(r instanceof A)){t=1;break}t+=ge(s,r)}st.set(e,t)}return t}function Re(s,e,t,r,i,n,o,l,a){let u=0;for(let d=r;d<i;d++)u+=ge(s,e[d]);let c=Math.ceil(u*1.5/8),h=[],f=[];function p(d,m,T,N,w){for(let O=T;O<N;){let S=O,v=m[O],g=ge(s,d[O]);for(O++;O<N;O++){let b=ge(s,d[O]);if(g+b>=c)break;g+=b}if(O==S+1){if(g>c){let b=d[S];p(b.children,b.positions,0,b.children.length,m[S]+w);continue}h.push(d[S])}else{let b=m[O-1]+d[O-1].length-v;h.push(Re(s,d,m,S,O,v,b,null,a))}f.push(v+w-n)}}return p(e,t,r,i,0),(l||a)(h,f,o)}var xe=class{startParse(e,t,r){return typeof e=="string"&&(e=new Ne(e)),r=r?r.length?r.map(i=>new oe(i.from,i.to)):[new oe(0,0)]:[new oe(0,e.length)],this.createParse(e,t||[],r)}parse(e,t,r){let i=this.startParse(e,t,r);for(;;){let n=i.advance();if(n)return n}}},Ne=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 Fs=new k({perNode:!0});var se=class{constructor(e,t,r,i,n,o,l,a,u,c=0,h){this.p=e,this.stack=t,this.state=r,this.reducePos=i,this.pos=n,this.score=o,this.buffer=l,this.bufferBase=a,this.curContext=u,this.lookAhead=c,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 i=e.parser.context;return new se(e,[],t,r,r,0,[],0,i?new Se(i,i.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,i=e&65535,{parser:n}=this.p,o=n.dynamicPrecedence(i);if(o&&(this.score+=o),r==0){this.pushState(n.getGoto(this.state,i,!0),this.reducePos),i<n.minRepeatTerm&&this.storeNode(i,this.reducePos,this.reducePos,4,!0),this.reduceContext(i,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[i])===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 c=l?this.stack[l-1]:0,h=this.bufferBase+this.buffer.length-c;if(i<n.minRepeatTerm||e&131072){let f=n.stateFlag(this.state,1)?this.pos:this.reducePos;this.storeNode(i,a,f,h+4,!0)}if(e&262144)this.state=this.stack[l];else{let f=this.stack[l-3];this.state=n.getGoto(f,i,!0)}for(;this.stack.length>l;)this.stack.pop();this.reduceContext(i,a)}storeNode(e,t,r,i=4,n=!1){if(e==0&&(!this.stack.length||this.stack[this.stack.length-1]<this.buffer.length+this.bufferBase)){let o=this,l=this.buffer.length;if(l==0&&o.parent&&(l=o.bufferBase-o.parent.bufferBase,o=o.parent),l>0&&o.buffer[l-4]==0&&o.buffer[l-1]>-1){if(t==r)return;if(o.buffer[l-2]>=t){o.buffer[l-2]=r;return}}}if(!n||this.pos==r)this.buffer.push(e,t,r,i);else{let o=this.buffer.length;if(o>0&&this.buffer[o-4]!=0)for(;o>0&&this.buffer[o-2]>r;)this.buffer[o]=this.buffer[o-4],this.buffer[o+1]=this.buffer[o-3],this.buffer[o+2]=this.buffer[o-2],this.buffer[o+3]=this.buffer[o-1],o-=4,i>4&&(i-=4);this.buffer[o]=e,this.buffer[o+1]=t,this.buffer[o+2]=r,this.buffer[o+3]=i}}shift(e,t,r){let i=this.pos;if(e&131072)this.pushState(e&65535,this.pos);else if(e&262144)this.pos=r,this.shiftContext(t,i),t<=this.p.parser.maxNode&&this.buffer.push(t,i,r,4);else{let n=e,{parser:o}=this.p;(r>this.pos||t<=o.maxNode)&&(this.pos=r,o.stateFlag(n,1)||(this.reducePos=r)),this.pushState(n,i),this.shiftContext(t,i),t<=o.maxNode&&this.buffer.push(t,i,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 i=this.pos;this.reducePos=this.pos=i+e.length,this.pushState(t,i),this.buffer.push(r,i,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),i=e.bufferBase+t;for(;e&&i==e.bufferBase;)e=e.parent;return new se(this.p,this.stack.slice(),this.state,this.reducePos,this.pos,this.score,r,i,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 De(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 i=[];for(let n=0,o;n<t.length;n+=2)(o=t[n+1])!=this.state&&this.p.parser.hasAction(o,e)&&i.push(t[n],o);if(this.stack.length<120)for(let n=0;i.length<4<<1&&n<t.length;n+=2){let o=t[n+1];i.some((l,a)=>a&1&&l==o)||i.push(t[n],o)}t=i}let r=[];for(let i=0;i<t.length&&r.length<4;i+=2){let n=t[i+1];if(n==this.state)continue;let o=this.split();o.pushState(n,this.pos),o.storeNode(0,o.pos,o.pos,4,!0),o.shiftContext(t[i],this.pos),o.score-=200,r.push(o)}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,i=t&65535,n=this.stack.length-r*3;if(n<0||e.getGoto(this.stack[n],i,!1)<0){let o=this.findForcedReduction();if(o==null)return!1;t=o}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=(i,n)=>{if(!t.includes(i))return t.push(i),e.allActions(i,o=>{if(!(o&393216))if(o&65536){let l=(o>>19)-n;if(l>1){let a=o&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(o,n+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 Se(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()}},Se=class{constructor(e,t){this.tracker=e,this.context=t,this.hash=e.strict?e.hash(t):0}},ot;(function(s){s[s.Insert=200]="Insert",s[s.Delete=190]="Delete",s[s.Reduce=100]="Reduce",s[s.MaxNext=4]="MaxNext",s[s.MaxInsertStackDepth=300]="MaxInsertStackDepth",s[s.DampenInsertStackDepth=120]="DampenInsertStackDepth",s[s.MinBigReduction=2e3]="MinBigReduction"})(ot||(ot={}));var De=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 i=this.start.p.parser.getGoto(this.stack[this.base-3],t,!0);this.state=i}},ie=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 ie(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 ie(this.stack,this.pos,this.index)}};function ae(s,e=Uint16Array){if(typeof s!="string")return s;let t=null;for(let r=0,i=0;r<s.length;){let n=0;for(;;){let o=s.charCodeAt(r++),l=!1;if(o==126){n=65535;break}o>=92&&o--,o>=34&&o--;let a=o-32;if(a>=46&&(a-=46,l=!0),n+=a,l)break;n*=46}t?t[i++]=n:t=new e(n)}return t}var re=class{constructor(){this.start=-1,this.value=-1,this.end=-1,this.extended=-1,this.lookAhead=0,this.mask=0,this.context=0}},lt=new re,Qe=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=lt,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,i=this.rangeIndex,n=this.pos+e;for(;n<r.from;){if(!i)return null;let o=this.ranges[--i];n-=r.from-o.to,r=o}for(;t<0?n>r.to:n>=r.to;){if(i==this.ranges.length-1)return null;let o=this.ranges[++i];n+=o.from-r.to,r=o}return n}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,i;if(t>=0&&t<this.chunk.length)r=this.pos+e,i=this.chunk.charCodeAt(t);else{let n=this.resolveOffset(e,1);if(n==null)return-1;if(r=n,r>=this.chunk2Pos&&r<this.chunk2Pos+this.chunk2.length)i=this.chunk2.charCodeAt(r-this.chunk2Pos);else{let o=this.rangeIndex,l=this.range;for(;l.to<=r;)l=this.ranges[++o];this.chunk2=this.input.chunk(this.chunk2Pos=r),r+this.chunk2.length>l.to&&(this.chunk2=this.chunk2.slice(0,l.to-r)),i=this.chunk2.charCodeAt(0)}}return r>=this.token.lookAhead&&(this.token.lookAhead=r+1),i}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=lt,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 i of this.ranges){if(i.from>=t)break;i.to>e&&(r+=this.input.read(Math.max(i.from,e),Math.min(i.to,t)))}return r}},G=class{constructor(e,t){this.data=e,this.id=t}token(e,t){let{parser:r}=t.p;dt(this.data,e,t,this.id,r.data,r.tokenPrecTable)}};G.prototype.contextual=G.prototype.fallback=G.prototype.extend=!1;var Me=class{constructor(e,t,r){this.precTable=t,this.elseToken=r,this.data=typeof e=="string"?ae(e):e}token(e,t){let r=e.pos,i=0;for(;;){let n=e.next<0,o=e.resolveOffset(1,1);if(dt(this.data,e,t,0,this.data,this.precTable),e.token.value>-1)break;if(this.elseToken==null)return;if(n||i++,o==null)break;e.reset(o,e.token)}i&&(e.reset(r,e.token),e.acceptToken(this.elseToken,i))}};Me.prototype.contextual=G.prototype.fallback=G.prototype.extend=!1;function dt(s,e,t,r,i,n){let o=0,l=1<<r,{dialect:a}=t.p.parser;e:for(;l&s[o];){let u=s[o+1];for(let p=o+3;p<u;p+=2)if((s[p+1]&l)>0){let d=s[p];if(a.allows(d)&&(e.token.value==-1||e.token.value==d||ir(d,e.token.value,i,n))){e.acceptToken(d);break}}let c=e.next,h=0,f=s[o+2];if(e.next<0&&f>h&&s[u+f*3-3]==65535&&s[u+f*3-3]==65535){o=s[u+f*3-1];continue e}for(;h<f;){let p=h+f>>1,d=u+p+(p<<1),m=s[d],T=s[d+1]||65536;if(c<m)f=p;else if(c>=T)h=p+1;else{o=s[d+2],e.advance();continue e}}break}}function at(s,e,t){for(let r=e,i;(i=s[r])!=65535;r++)if(i==t)return r-e;return-1}function ir(s,e,t,r){let i=at(t,r,e);return i<0||at(t,r,s)<i}var z=typeof process<"u"&&process.env&&/\bparse\b/.test(process.env.LOG),Ie=null,ut;(function(s){s[s.Margin=25]="Margin"})(ut||(ut={}));function ht(s,e,t){let r=s.cursor(F.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(s.length,Math.max(r.from+1,e+25));if(t<0?r.prevSibling():r.nextSibling())break;if(!r.parent())return t<0?0:s.length}}var Be=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?ht(e.tree,e.from+e.offset,1)-e.offset:e.from,this.safeTo=e.openEnd?ht(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],i=this.index[t];if(i==r.children.length){this.trees.pop(),this.start.pop(),this.index.pop();continue}let n=r.children[i],o=this.start[t]+r.positions[i];if(o>e)return this.nextStart=o,null;if(n instanceof A){if(o==e){if(o<this.safeFrom)return null;let l=o+n.length;if(l<=this.safeTo){let a=n.prop(k.lookAhead);if(!a||l+a<this.fragment.to)return n}}this.index[t]++,o+n.length>=Math.max(this.safeFrom,e)&&(this.trees.push(n),this.start.push(o),this.index.push(0))}else this.index[t]++,this.nextStart=o+n.length}}},ze=class{constructor(e,t){this.stream=t,this.tokens=[],this.mainToken=null,this.actions=[],this.tokens=e.tokenizers.map(r=>new re)}getActions(e){let t=0,r=null,{parser:i}=e.p,{tokenizers:n}=i,o=i.stateSlot(e.state,3),l=e.curContext?e.curContext.hash:0,a=0;for(let u=0;u<n.length;u++){if(!(1<<u&o))continue;let c=n[u],h=this.tokens[u];if(!(r&&!c.fallback)&&((c.contextual||h.start!=e.pos||h.mask!=o||h.context!=l)&&(this.updateCachedToken(h,c,e),h.mask=o,h.context=l),h.lookAhead>h.end+25&&(a=Math.max(h.lookAhead,a)),h.value!=0)){let f=t;if(h.extended>-1&&(t=this.addActions(e,h.extended,h.end,t)),t=this.addActions(e,h.value,h.end,t),!c.extend&&(r=h,t>f))break}}for(;this.actions.length>t;)this.actions.pop();return a&&e.setLookAhead(a),!r&&e.pos==this.stream.end&&(r=new re,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 re,{pos:r,p:i}=e;return t.start=r,t.end=Math.min(r+1,i.stream.end),t.value=r==i.stream.end?i.parser.eofTerm:0,t}updateCachedToken(e,t,r){let i=this.stream.clipPos(r.pos);if(t.token(this.stream.reset(i,e),r),e.value>-1){let{parser:n}=r.p;for(let o=0;o<n.specialized.length;o++)if(n.specialized[o]==e.value){let l=n.specializers[o](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(i+1)}putAction(e,t,r,i){for(let n=0;n<i;n+=3)if(this.actions[n]==e)return i;return this.actions[i++]=e,this.actions[i++]=t,this.actions[i++]=r,i}addActions(e,t,r,i){let{state:n}=e,{parser:o}=e.p,{data:l}=o;for(let a=0;a<2;a++)for(let u=o.stateSlot(n,a?2:1);;u+=3){if(l[u]==65535)if(l[u+1]==1)u=j(l,u+2);else{i==0&&l[u+1]==2&&(i=this.putAction(j(l,u+2),t,r,i));break}l[u]==t&&(i=this.putAction(j(l,u+1),t,r,i))}return i}},ft;(function(s){s[s.Distance=5]="Distance",s[s.MaxRemainingPerStep=3]="MaxRemainingPerStep",s[s.MinBufferLengthPrune=500]="MinBufferLengthPrune",s[s.ForceReduceLimit=10]="ForceReduceLimit",s[s.CutDepth=15e3]="CutDepth",s[s.CutTo=9e3]="CutTo",s[s.MaxLeftAssociativeReductionCount=300]="MaxLeftAssociativeReductionCount",s[s.MaxStackCount=12]="MaxStackCount"})(ft||(ft={}));var Ve=class{constructor(e,t,r,i){this.parser=e,this.input=t,this.ranges=i,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 Qe(t,i),this.tokens=new ze(e,this.stream),this.topTerm=e.top[1];let{from:n}=i[0];this.stacks=[se.start(this,e.top[0],n)],this.fragments=r.length&&this.stream.end-n>e.bufferLength*4?new Be(r,e.nodeSet):null}get parsedPos(){return this.minStackPos}advance(){let e=this.stacks,t=this.minStackPos,r=this.stacks=[],i,n;if(this.bigReductionCount>300&&e.length==1){let[o]=e;for(;o.forceReduce()&&o.stack.length&&o.stack[o.stack.length-2]>=this.lastBigReductionStart;);this.bigReductionCount=this.lastBigReductionSize=0}for(let o=0;o<e.length;o++){let l=e[o];for(;;){if(this.tokens.mainToken=null,l.pos>t)r.push(l);else{if(this.advanceStack(l,r,e))continue;{i||(i=[],n=[]),i.push(l);let a=this.tokens.getMainToken(l);n.push(a.value,a.end)}}break}}if(!r.length){let o=i&&nr(i);if(o)return this.stackToTree(o);if(this.parser.strict)throw z&&i&&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&&i){let o=this.stoppedAt!=null&&i[0].pos>this.stoppedAt?i[0]:this.runRecovery(i,n,r);if(o)return this.stackToTree(o.forceAll())}if(this.recovering){let o=this.recovering==1?1:this.recovering*3;if(r.length>o)for(r.sort((l,a)=>a.score-l.score);r.length>o;)r.pop();r.some(l=>l.reducePos>t)&&this.recovering--}else if(r.length>1){e:for(let o=0;o<r.length-1;o++){let l=r[o];for(let a=o+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(o--,1);continue e}}}r.length>12&&r.splice(12,r.length-12)}this.minStackPos=r[0].pos;for(let o=1;o<r.length;o++)r[o].pos<this.minStackPos&&(this.minStackPos=r[o].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 i=e.pos,{parser:n}=this,o=z?this.stackID(e)+" -> ":"";if(this.stoppedAt!=null&&i>this.stoppedAt)return e.forceReduce()?e:null;if(this.fragments){let u=e.curContext&&e.curContext.tracker.strict,c=u?e.curContext.hash:0;for(let h=this.fragments.nodeAt(i);h;){let f=this.parser.nodeSet.types[h.type.id]==h.type?n.getGoto(e.state,h.type.id):-1;if(f>-1&&h.length&&(!u||(h.prop(k.contextHash)||0)==c))return e.useNode(h,f),z&&console.log(o+this.stackID(e)+` (via reuse of ${n.getName(h.type.id)})`),!0;if(!(h instanceof A)||h.children.length==0||h.positions[0]>0)break;let p=h.children[0];if(p instanceof A&&h.positions[0]==0)h=p;else break}}let l=n.stateSlot(e.state,4);if(l>0)return e.reduce(l),z&&console.log(o+this.stackID(e)+` (via always-reduce ${n.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 c=a[u++],h=a[u++],f=a[u++],p=u==a.length||!r,d=p?e:e.split();if(d.apply(c,h,f),z&&console.log(o+this.stackID(d)+` (via ${c&65536?`reduce of ${n.getName(c&65535)}`:"shift"} for ${n.getName(h)} @ ${i}${d==e?"":", split"})`),p)return!0;d.pos>i?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 ct(e,t),!0}}runRecovery(e,t,r){let i=null,n=!1;for(let o=0;o<e.length;o++){let l=e[o],a=t[o<<1],u=t[(o<<1)+1],c=z?this.stackID(l)+" -> ":"";if(l.deadEnd&&(n||(n=!0,l.restart(),z&&console.log(c+this.stackID(l)+" (restarted)"),this.advanceFully(l,r))))continue;let h=l.split(),f=c;for(let p=0;h.forceReduce()&&p<10&&(z&&console.log(f+this.stackID(h)+" (via force-reduce)"),!this.advanceFully(h,r));p++)z&&(f=this.stackID(h)+" -> ");for(let p of l.recoverByInsert(a))z&&console.log(c+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),z&&console.log(c+this.stackID(l)+` (via recover-delete ${this.parser.getName(a)})`),ct(l,r)):(!i||i.score<l.score)&&(i=l)}return i}stackToTree(e){return e.close(),A.build({buffer:ie.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=(Ie||(Ie=new WeakMap)).get(e);return t||Ie.set(e,t=String.fromCodePoint(this.nextStackID++)),t+e}};function ct(s,e){for(let t=0;t<e.length;t++){let r=e[t];if(r.pos==s.pos&&r.sameState(s)){e[t].score<s.score&&(e[t]=s);return}}e.push(s)}var _e=class{constructor(e,t,r){this.source=e,this.flags=t,this.disabled=r}allows(e){return!this.disabled||this.disabled[e]==0}};var q=class extends xe{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]),i=[];for(let l=0;l<t.length;l++)i.push([]);function n(l,a,u){i[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 c=l[u++];if(c>=0)n(c,a,l[u++]);else{let h=l[u+-c];for(let f=-c;f>0;f--)n(l[u++],a,h);u++}}}this.nodeSet=new K(t.map((l,a)=>R.define({name:a>=this.minRepeatTerm?void 0:l,id:a,props:i[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 o=ae(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(pt),this.states=ae(e.states,Uint32Array),this.data=ae(e.stateData),this.goto=ae(e.goto),this.maxTerm=e.maxTerm,this.tokenizers=e.tokenizers.map(l=>typeof l=="number"?new G(o,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 i=new Ve(this,e,t,r);for(let n of this.wrappers)i=n(i,e,t,r);return i}getGoto(e,t,r=!1){let i=this.goto;if(t>=i[0])return-1;for(let n=i[t+1];;){let o=i[n++],l=o&1,a=i[n++];if(l&&r)return a;for(let u=n+(o>>1);n<u;n++)if(i[n]==e)return a;if(l)return-1}}hasAction(e,t){let r=this.data;for(let i=0;i<2;i++)for(let n=this.stateSlot(e,i?2:1),o;;n+=3){if((o=r[n])==65535)if(r[n+1]==1)o=r[n=j(r,n+2)];else{if(r[n+1]==2)return j(r,n+2);break}if(o==t||o==0)return j(r,n+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),i=r?t(r):void 0;for(let n=this.stateSlot(e,1);i==null;n+=3){if(this.data[n]==65535)if(this.data[n+1]==1)n=j(this.data,n+2);else break;i=t(j(this.data,n+1))}return i}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 i=this.data[r+1];t.some((n,o)=>o&1&&n==i)||t.push(this.data[r],i)}}return t}configure(e){let t=Object.assign(Object.create(q.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 i=e.tokenizers.find(n=>n.from==r);return i?i.to:r})),e.specializers&&(t.specializers=this.specializers.slice(),t.specializerSpecs=this.specializerSpecs.map((r,i)=>{let n=e.specializers.find(l=>l.from==r.external);if(!n)return r;let o=Object.assign(Object.assign({},r),{external:n.to});return t.specializers[i]=pt(o),o})),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 n of e.split(" ")){let o=t.indexOf(n);o>=0&&(r[o]=!0)}let i=null;for(let n=0;n<t.length;n++)if(!r[n])for(let o=this.dialects[t[n]],l;(l=this.data[o++])!=65535;)(i||(i=new Uint8Array(this.maxTerm+1)))[l]=1;return new _e(e,r,i)}static deserialize(e){return new q(e)}};function j(s,e){return s[e]|s[e+1]<<16}function nr(s){let e=null;for(let t of s){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 pt(s){if(s.external){let e=s.extend?1:0;return(t,r)=>s.external(t,r)<<1|e}return s.get}var ue=q.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});import{isMultiClauseFilter as he,isMultiValueFilter as or,isSingleValueFilter as lr}from"@vuu-ui/vuu-utils";var I,We=class{constructor(){tt(this,I,void 0)}setFilterCombinatorOp(e,t=V(this,I)){he(t)&&t.op===e||Ae(this,I,{op:e,filters:[V(this,I)]})}add(e){if(V(this,I)===void 0)Ae(this,I,e);else if(he(V(this,I)))V(this,I).filters.push(e);else throw Error("Invalid filter passed to FilterExpression")}setColumn(e,t=V(this,I)){if(he(t)){let r=t.filters.at(-1);r&&this.setColumn(e,r)}else t&&(t.column=e)}setOp(e,t=V(this,I)){if(he(t)){let r=t.filters.at(-1);r&&this.setOp(e,r)}else t&&(t.op=e)}setValue(e,t=V(this,I)){var r;if(he(t)){let i=t.filters.at(-1);i&&this.setValue(e,i)}else or(t)?((r=t.values)!=null||(t.values=[]),t.values.push(e)):lr(t)&&(t.value=e)}toJSON(e=V(this,I)){return this.name?{...e,name:this.name}:e}};I=new WeakMap;var ye=(s,e)=>{let t=new We,r=s.cursor();do{let{name:i,from:n,to:o}=r;switch(i){case"ColumnValueExpression":t.add({});break;case"ColumnSetExpression":t.add({op:"in"});break;case"Or":case"And":t.setFilterCombinatorOp(e.substring(n,o));break;case"Column":t.setColumn(e.substring(n,o));break;case"Operator":t.setOp(e.substring(n,o));break;case"String":t.setValue(e.substring(n+1,o-1));break;case"Number":t.setValue(parseFloat(e.substring(n,o)));break;case"True":t.setValue(!0);break;case"False":t.setValue(!1);break;case"FilterName":t.name=e.substring(n,o);break;default:}}while(r.next());return t.toJSON()};var zs=ue.configure({strict:!0});var At=Ke(Le(),1);import{useEffect as Cr,useMemo as Pr,useRef as je}from"react";import{LanguageSupport as ur,LRLanguage as hr,styleTags as fr,tags as ve}from"@vuu-ui/vuu-codemirror";var cr=hr.define({name:"VuuFilterQuery",parser:ue.configure({props:[fr({Identifier:ve.variableName,String:ve.string,Or:ve.emphasis,Operator:ve.operator})]})}),gt=()=>new ur(cr);import{HighlightStyle as pr,syntaxHighlighting as dr,tags as mt}from"@vuu-ui/vuu-codemirror";var gr=pr.define([{tag:mt.variableName,color:"var(--vuuFilterEditor-variableColor)"},{tag:mt.comment,color:"green",fontStyle:"italic"}]),bt=dr(gr);import{EditorView as mr}from"@vuu-ui/vuu-codemirror";var xt=mr.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});import{getNodeByName as ne,getValue as U,syntaxTree as br}from"@vuu-ui/vuu-codemirror";import{useCallback as St}from"react";var yt=(s,e)=>{let t=s.prevSibling||s.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 U(t,e)},xr=(s,e,t)=>{let r=U(s,e);if(!(t===void 0||r===t)&&["contains","ends","starts"].some(i=>i.startsWith(r.toLowerCase())))return r},kt=(s,e)=>{let t=s.prevSibling||s.parent||s.lastChild;for(;t&&t.name==="\u26A0";)t=t.prevSibling;if(t&&["As","Or","And"].includes(t.name))return U(t,e)},vt=(s,e)=>{if(s.name==="FilterName")return U(s,e);{let t=s.prevSibling||s.parent||s.lastChild;for(;t&&t.name!=="FilterName";)t=t.prevSibling;if(t&&t.name==="FilterName")return U(s,e)}},Ot=(s,e)=>{let t=s.prevSibling;if((t==null?void 0:t.name)==="Column")return U(t,e);if((t==null?void 0:t.name)==="Operator")return Ot(t,e)},Sr=(s,e)=>{let t=s.lastChild,r=[];for(;t&&t.name!=="In";){let i=U(t,e);if(i)r.push(i);else break;t=t.prevSibling}return r};var Ct=(s,e,t)=>{let r=St(async(i,n,o={})=>{let{startsWith:l=""}=o,a=await s.getSuggestions(n,o);return{from:i.pos-l.length,options:a}},[s]);return St(async i=>{var c,h;let{state:n,pos:o}=i,l=(c=i.matchBefore(/\w*/))!=null?c:{from:0,to:0,text:void 0},u=br(n).resolveInner(o,-1);switch(console.log({nodeBeforeName:u.name}),u.name){case"Filter":if(i.pos===0)return r(i,"column");if(kt(u,n)==="as")return r(i,"name");{let p=vt(u,n);return r(i,"save",{onSubmit:e.current,existingFilter:t,filterName:p})}case"String":{let f=yt(u,n),p=Ot(u,n),{from:d,to:m}=u;if(m-d===2&&i.pos===d+1){if(p&&f)return r(i,"columnValue",{columnName:p,operator:f,quoted:!0,startsWith:l.text})}else console.log(`we have a string, column is ${p} ${d} ${m}`)}break;case"As":return r(i,"name");case"FilterName":return r(i,"save",{onSubmit:e.current,existingFilter:t,filterName:vt(u,n)});case"Column":{let f=U(u,n);return await s.isPartialMatch("column",void 0,f)?r(i,"column",{startsWith:f}):r(i,"operator",{columnName:f})}case"\u26A0":{let f=ne(u,n),p=yt(u,n),d=p?void 0:xr(u,n,f);return d?r(i,"operator",{columnName:f,startsWith:d}):r(i,"columnValue",{columnName:f,operator:p,startsWith:l.text})}case"Identifier":if(kt(u,n)==="as")return{from:i.pos,options:[{label:"press ENTER to apply filter and save",apply:()=>e.current(),boost:5}]};break;case"ColumnSetExpression":case"Values":{let f=ne(u,n),p=Sr(u,n);return r(i,"columnValue",{columnName:f,selection:p})}case"Comma":case"LBrack":{let f=ne(u,n);return r(i,"columnValue",{columnName:f})}case"ColumnValueExpression":{let f=(h=u.lastChild)==null?void 0:h.prevSibling;if((f==null?void 0:f.name)==="Column")return r(i,"operator",{columnName:ne(u,n)});if((f==null?void 0:f.name)==="Operator")return r(i,"columnValue",{columnName:ne(f,n),operator:U(f,n)})}break;case"In":return{from:i.pos,options:[{label:"[",apply:" [",type:"text"}]};case"Eq":return r(i,"columnValue",{columnName:ne(u,n)});case"AndExpression":case"OrExpression":return r(i,"column");default:}},[t,r,e,s])};var fe=s=>{if(s.current==null)throw Error("EditorView not defined");return s.current},wr=s=>(0,At.default)("vuuSuggestion",{vuuIllustration:s.isIllustration}),Fr=s=>{let e=s.lastIndexOf(" as ");return e!==-1?s.slice(0,e):s},Ar=()=>console.log("noooop"),Tt=({existingFilter:s,onSubmitFilter:e,suggestionProvider:t})=>{let r=je(null),i=je(Ar),n=je(),o=Ct(t,i,s),[l,a]=Pr(()=>{let u=()=>{let m=fe(n),T=m.state.doc.toString(),N=vr(m.state,m.state.doc.length,5e3);if(N){let w=ye(N,T);return[w,Fr(T),w.name]}else return[void 0,"",void 0]},c=()=>{fe(n).setState(d())},h=m=>{let[T,N,w]=u();e==null||e(T,N,m,w),c()},f=m=>$e.of([{key:m,run(){return h(),!0}}]),p=m=>$e.of([{key:m,run(){return Ft(fe(n)),!0}}]),d=()=>Pt.create({doc:"",extensions:[Or,yr({override:[o],optionClass:wr}),gt(),$e.of(kr),f("Ctrl-Enter"),p("ArrowDown"),wt.updateListener.of(m=>{let T=fe(n);m.docChanged&&Ft(T)}),Pt.transactionFilter.of(m=>m.newDoc.lines>1?[]:m),xt,bt]});return i.current=m=>{h(m),setTimeout(()=>{fe(n).focus()},100)},[d,c]},[o,e]);return Cr(()=>{if(!r.current)throw Error("editor not in dom");return n.current=new wt({state:l(),parent:r.current}),()=>{var u;(u=n.current)==null||u.destroy()}},[o,l]),{editorRef:r,clearInput:a}};import{jsx as Ue,jsxs as Tr}from"react/jsx-runtime";var Oe="vuuFilterInput",Ti=({existingFilter:s,iconName:e="filter",namedFilters:t,onSubmitFilter:r,suggestionProvider:i,...n})=>{let{editorRef:o,clearInput:l}=Tt({existingFilter:s,onSubmitFilter:r,suggestionProvider:i});return Tr("div",{...n,className:Oe,children:[Ue(Nt,{className:`${Oe}-FilterButton`,"data-icon":e,tabIndex:-1}),Ue("div",{className:`${Oe}-Editor`,ref:o}),Ue(Nt,{className:`${Oe}-ClearButton`,"data-icon":"close-circle",onClick:l})]})};import{asNameSuggestion as Nr,booleanJoinSuggestions as Er,getNamePrompt as Rr,numericOperators as Ir,stringOperators as Dr,toSuggestions as Qr}from"@vuu-ui/vuu-codemirror";import{getTypeaheadParams as Mr,useTypeaheadSuggestions as Br}from"@vuu-ui/vuu-data-react";import{useCallback as Rt,useRef as zr}from"react";import{createEl as Ce}from"@vuu-ui/vuu-utils";var Et=(s,e)=>{let t=Ce("div","vuuFunctionDoc"),r=Ce("div","function-heading"),i=Ce("span","function-name",s);r.appendChild(i);let n=Ce("p",void 0,e);return t.appendChild(r),t.appendChild(n),t};var Vr=[],_r={},Wr=s=>[{label:"Press ENTER to create TAB",apply:()=>s("tab"),boost:6}],It=(s,e,t=!0)=>{let r=e?[{label:"REPLACE existing filter",apply:()=>s("replace"),boost:8},{label:"AND existing filter",apply:()=>s("and"),boost:7},{label:"OR existing filter",apply:()=>s("or"),boost:7}]:[{label:"Press ENTER to submit",apply:()=>s(),boost:6}];return t?r.concat(Er).concat(Nr):r},Lr=(s,e)=>It(s,e,!0),$r=s=>It(s,void 0),jr=({existingFilter:s,filterName:e,onSubmit:t,saveOptions:r})=>{let i=e&&r.allowSaveAsTab,n=s?Lr(t,s):$r(t);return i?n.concat(Wr(t)):n},Ur=s=>s.map(e=>({boost:5,label:e.name})),Hr=s=>s?Array.from(s.entries()).map(([e,t])=>({info:()=>Et(e,t),label:e,type:"filter"})):Vr,Xr={label:"Done",apply:"] ",type:"keyword",boost:10},Pe=(s,e="")=>s.filter(t=>e===""||t.label.startsWith(e)).map(t=>({...t,apply:t.label+" "})),Gr={allowReplace:!0},_i=({columns:s,namedFilters:e,saveOptions:t=Gr,table:r,typeaheadHook:i=Br})=>{let n=zr(),o=i(),l=Rt(async(u,c=_r)=>{let{columnName:h,existingFilter:f,filterName:p,operator:d,quoted:m,onSubmit:T,startsWith:N,selection:w}=c;switch(u){case"operator":{let O=s.find(S=>S.name===h);if(O)switch(O.serverDataType){case"string":case"char":return Pe(Dr,N);case"int":case"long":case"double":return Pe(Ir)}else console.warn(`'${h}' does not match any column name`)}break;case"column":{let O=await Ur(s),S=await Hr(e);return(n.current=Pe(O)).concat(Pe(S))}case"columnValue":if(h){let O=s.find(P=>P.name===h);if(!O)throw Error(`useFilterSUggestionProvider no column ${h}`);let S=Array.isArray(w)?w.length===0?"[":",":"",v=Mr(r,h,N),g=await o(v),b=d==="starts";return n.current=Qr(g,{moveCursorToEnd:m,quoted:(O==null?void 0:O.serverDataType)==="string"&&!m,suffix:m?"":" ",prefix:b?N:S,isIllustration:b}),Array.isArray(w)&&(w==null?void 0:w.length)>1?[Xr,...n.current]:n.current}break;case"save":{if(typeof T!="function")throw Error("useFilterSuggestionProvider, onSubmit must be supplied for 'save' suggestions");return await jr({existingFilter:f,filterName:p,onSubmit:T,saveOptions:t})}case"name":return await Rr("filter");default:}return[]},[s,o,e,t,r]),a=Rt(async(u,c,h)=>{let f=await l(u,{columnName:c});if(h&&f)for(let p of f){if(p.label===h)return!1;if(p.label.startsWith(h))return!0}return!1},[l]);return{getSuggestions:l,isPartialMatch:a}};var Wt=Ke(Le(),1);import{Toolbar as us}from"@heswell/salt-lab";import{isMultiValueFilter as ns,isNamedFilter as os,isSingleValueFilter as ls}from"@vuu-ui/vuu-utils";import{ToggleButton as as,ToolbarField as zt}from"@heswell/salt-lab";import{Dropdown as Yr}from"@heswell/salt-lab";import{useCallback as qr,useState as Zr}from"react";import{jsx as Kr}from"react/jsx-runtime";var Jr=s=>typeof s=="string",Dt=s=>Jr(s)?s.startsWith('"')&&s.endsWith('"')?s.slice(1,-1):s:s.map(Dt),Qt=({column:s,selected:e,suggestionProvider:t,...r})=>{let i=e!=null?Dt(e):void 0,n=Array.isArray(i)?i:i!=null?[i]:[],[o,l]=Zr(n);console.log({initialValues:n});let a=qr(async u=>{if(u){let c=await t.getSuggestions("columnValue",{columnName:s});console.log({values:c}),l(c.map(h=>h.label))}},[s,t]);return Kr(Yr,{...r,onOpenChange:a,selected:i,source:o})};import{Dropdown as es}from"@heswell/salt-lab";import{useCallback as ts,useState as rs}from"react";import{jsx as is}from"react/jsx-runtime";var ss=s=>typeof s=="string",Mt=s=>{if(s!==void 0)return ss(s)?s.startsWith('"')&&s.endsWith('"')?s.slice(1,-1):s:s.map(Mt)},Bt=({column:s,selected:e,suggestionProvider:t,...r})=>{let i=Mt(e),n=Array.isArray(i)?i:i!=null?[i]:[],[o,l]=rs(n),a=ts(async u=>{if(u){let c=await t.getSuggestions("columnValue",{columnName:s});console.log({values:c}),l(c.map(h=>h.label))}},[s,t]);return is(es,{...r,onOpenChange:a,selected:i,selectionStrategy:"multiple",source:o})};import{jsx as ce}from"react/jsx-runtime";var Vt=(s,e)=>{if(os(s))return ce(as,{className:"vuuToggleButton",toggled:!0,variant:"secondary",children:s.name});if(ls(s)){let{column:t,value:r}=s;return ce(zt,{className:"vuuFilterDropdown",label:t,labelPlacement:"top",children:ce(Qt,{column:t,selected:r.toString(),selectionStrategy:"default",source:[r.toString()],suggestionProvider:e,style:{width:100}})},t)}if(ns(s)){let t=s.values.map(r=>r.toString());return ce(zt,{className:"vuuFilterDropdown",label:s.column,labelPlacement:"top",children:ce(Bt,{column:s.column,selected:t,source:t,suggestionProvider:e,style:{width:100}})},s.column)}return s.filters.map(t=>Vt(t,e))},_t=({filter:s,suggestionProvider:e})=>s?Vt(s,e):[];import{jsx as hs}from"react/jsx-runtime";var gn=({className:s,filter:e,suggestionProvider:t,...r})=>{console.log(`FilterToolbar ${JSON.stringify(e,null,2)}`);let i=_t({filter:e,suggestionProvider:t});return hs(us,{className:(0,Wt.default)("vuuFilterToolbar",s),...r,children:i})};import{extractFilterForColumn as fs,isAndFilter as Ut,isInFilter as we,isMultiClauseFilter as Fe,isMultiValueFilter as Lt,isOrFilter as cs,isSingleValueFilter as $t,partition as ps}from"@vuu-ui/vuu-utils";var D="and",He="=",kn=">",vn="<",ds="or",jt="starts",On="ends",gs="in",ms=(s,e=[])=>(s&&(Fe(s)?s.filters.forEach(t=>e.push(...ms(t))):e.push(s)),e),bs={combineWith:"and"},Cn=(s,e,{combineWith:t=D}=bs)=>{var r;if(Ye(e))Fe(e)||(s=Xe(s,{name:e.column}));else if(xs(e))return Fe(e),Xe(s,{name:(r=e.column)!=null?r:""});if(!s)return e;if(!e)return s;if(s.op===D&&e.op===D)return{op:D,filters:ks(s.filters,e.filters)};if(s.op===D){let i=Ss(s.filters,e);return i.length>1?{op:D,filters:i}:i[0]}return e.op===D?{op:D,filters:e.filters.concat(s)}:Ge(s,e,!0)?e:Ht(s,e)?ys(s,e):{op:t,filters:[s,e]}},Ye=s=>s?we(s)&&s.values.length===0?!0:Ut(s)&&s.filters.some(e=>Ye(e)):!1,xs=s=>s?s.op===jt&&s.value===""?!0:s.op===jt&&s.value==="":!1,Ss=(s,e)=>s.concat(e),ys=(s,e)=>Ye(e)?e:we(s)&&we(e)?{...s,values:[...s.values,...e.values.filter(t=>!s.values.includes(t))]}:we(s)&&e.op===He?{...s,values:s.values.concat([e.value])}:s.op===He&&e.op===He?{column:s.column,op:gs,values:[s.value,e.value]}:e,ks=(s,e)=>{let t=({op:n},{op:o})=>n===o||n[0]===o[0],r=(n,o)=>n.column===o.column&&t(n,o),i=n=>e.some(o=>r(n,o))===!1;return s.filter(i).concat(e)},Pn=(s,e)=>{if(Ge(s,e,!0))return null;if(s.op!==D)throw Error(`removeFilter cannot remove ${JSON.stringify(e)} from ${JSON.stringify(s)}`);let t=s.filters.filter(r=>!Ge(r,e));return t.length>0?{type:D,filters:t}:null},wn=(s,e)=>{if(!e)return[void 0,void 0];if(e.column===s)return[e,void 0];if(e.op!==D)return[void 0,e];let[[t=void 0],r]=ps(e.filters,i=>i.column===s);return r.length===1?[t,r[0]]:[t,{op:D,filters:r}]},vs=(s,e)=>Fe(s)?{op:s.op,filters:s.filters.map(t=>vs(t,e))}:{...s,column:e},Os=(s,e)=>{if(!s)return!1;let{op:t,column:r}=s;switch(t){case D:case ds:return s.filters!=null&&s.filters.some(i=>Os(i,e));default:return r===e.name}},Xe=(s,e)=>{let t=e.name;if(s&&s.column!==t){if(Ut(s)||cs(s)){let{op:r}=s,n=s.filters.filter(o=>o.column!==t);switch(n.length){case 0:return;case 1:return n[0];default:return{op:r,filters:n}}}return s}},Ht=(s,e)=>s.column===e.column&&(s.op==="="||s.op==="in")&&(e.op==="="||e.op==="in"),Cs=(s,e)=>{if(s===e)return!0;if(s.length===e.length){let t=s.slice().sort(),r=e.slice().sort();return t.join("|")===r.join("|")}return!1},Ge=(s,e,t=!1)=>t?s&&e&&Ht(s,e)?s.op===e.op&&($t(s)&&$t(e)&&s.value===e.value||Lt(s)&&Lt(e)&&Cs(s.values,e.values)):!1:!0,Ps=(s,e,t)=>{if(s&&e){if(t==="replace")return e;if(s.op==="and")return{...s,filters:s.filters.concat(e)};let{column:r}=e;if(r&&(e.column?fs(s,r):void 0)&&r){let n=Xe(s,{name:r});return Ps(n,e,"add")}return{op:"and",filters:[s,e]}}return e||s},Fn=(s,e,t)=>{if(e.length!==0){if(t){let r=e[0].substring(0,e[0].length-3);return{column:s,op:"starts",value:`"${r}"`}}return{column:s,op:"in",values:e.map(r=>`"${r}"`)}}},An=(s,e,t)=>{if(e!==void 0&&!(t===void 0||isNaN(t)))return{column:s,op:e,value:t}};export{D as AND,On as ENDS_WITH,He as EQUALS,Ti as FilterInput,gn as FilterToolbar,kn as GREATER_THAN,gs as IN,vn as LESS_THAN,ds as OR,jt as STARTS_WITH,Cn as addFilter,ms as filterClauses,Ge as filterEquals,Os as filterIncludesColumn,An as getNumericFilter,Fn as getTypeaheadFilter,vs as overrideColName,Pn as removeFilter,wn as splitFilterOnColumn,Ps as updateFilter,Tt as useCodeMirrorEditor,_i as useFilterSuggestionProvider};
 /*! Bundled license information:
 
 classnames/index.js: