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

package/cjs/index.js

@@ -103,7 +103,6 @@ var require_classnames = __commonJS({
 var src_exports = {};
 __export(src_exports, {
   AND: () => AND,
-  ColumnFilter: () => ColumnFilter,
   ENDS_WITH: () => ENDS_WITH,
   EQUALS: () => EQUALS,
   FilterInput: () => FilterInput,
@@ -117,6 +116,8 @@ __export(src_exports, {
   filterClauses: () => filterClauses,
   filterEquals: () => filterEquals,
   filterIncludesColumn: () => filterIncludesColumn,
+  getNumericFilter: () => getNumericFilter,
+  getTypeaheadFilter: () => getTypeaheadFilter,
   overrideColName: () => overrideColName,
   removeFilter: () => removeFilter,
   splitFilterOnColumn: () => splitFilterOnColumn,
@@ -126,1288 +127,752 @@ __export(src_exports, {
 });
 module.exports = __toCommonJS(src_exports);
 
-// src/column-filter/ColumnFilter.tsx
-var import_salt_lab4 = require("@heswell/salt-lab");
+// src/filter-input/FilterInput.tsx
 var import_core = require("@salt-ds/core");
 
-// ../../node_modules/@salt-ds/icons/dist-es/packages/icons/src/icon/Icon.js
-var import_jsx_runtime = require("react/jsx-runtime");
-var import_react = require("react");
-
-// ../../node_modules/clsx/dist/clsx.m.js
-function r(e) {
-  var t, f, n = "";
-  if ("string" == typeof e || "number" == typeof e)
-    n += e;
-  else if ("object" == typeof e)
-    if (Array.isArray(e))
-      for (t = 0; t < e.length; t++)
-        e[t] && (f = r(e[t])) && (n && (n += " "), n += f);
-    else
-      for (t in e)
-        e[t] && (n && (n += " "), n += t);
-  return n;
-}
-function clsx() {
-  for (var e, t, f = 0, n = ""; f < arguments.length; )
-    (e = arguments[f++]) && (t = r(e)) && (n && (n += " "), n += t);
-  return n;
-}
+// src/filter-input/useCodeMirrorEditor.ts
+var import_vuu_codemirror5 = require("@vuu-ui/vuu-codemirror");
 
-// ../../node_modules/@salt-ds/icons/dist-es/node_modules/style-inject/dist/style-inject.es.js
-function styleInject(css, ref) {
-  if (ref === void 0)
-    ref = {};
-  var insertAt = ref.insertAt;
-  if (!css || typeof document === "undefined") {
-    return;
-  }
-  var head = document.head || document.getElementsByTagName("head")[0];
-  var style = document.createElement("style");
-  style.type = "text/css";
-  if (insertAt === "top") {
-    if (head.firstChild) {
-      head.insertBefore(style, head.firstChild);
-    } else {
-      head.appendChild(style);
-    }
-  } else {
-    head.appendChild(style);
-  }
-  if (style.styleSheet) {
-    style.styleSheet.cssText = css;
-  } else {
-    style.appendChild(document.createTextNode(css));
+// ../../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;
   }
-}
-
-// ../../node_modules/@salt-ds/icons/dist-es/packages/icons/src/icon/Icon.css.js
-var css_248z = "/* Style applied to the root element */\n.saltIcon {\n  --icon-color: var(--saltIcon-color, var(--salt-text-secondary-foreground));\n  --icon-size-multiplier: var(--saltIcon-size-multiplier, 1);\n  --icon-base-size: var(--salt-size-icon-base, 12px);\n  /**\n   * Icon size will be the multiplier (an integer from the size prop) * the base size (set by the theme per density)\n   * Icons should never be smaller than 12px for readability so we've added a max() to enforce this\n  */\n  --icon-size: max(calc(var(--icon-base-size) * var(--icon-size-multiplier)), 12px);\n}\n\n.saltIcon {\n  fill: var(--saltIcon-color, var(--icon-color));\n  display: inline-block;\n  margin: var(--saltIcon-margin, 0);\n  position: relative;\n  width: var(--icon-size);\n  height: var(--icon-size);\n  min-width: var(--icon-size);\n  min-height: var(--icon-size);\n}\n\n.saltIcon:hover {\n  --icon-color: var(--saltIcon-color-hover, var(--salt-text-secondary-foreground));\n}\n\n.saltIcon:active {\n  --icon-color: var(--saltIcon-color-active, var(--salt-text-secondary-foreground));\n}\n";
-styleInject(css_248z);
-
-// ../../node_modules/@salt-ds/icons/dist-es/packages/icons/src/icon/Icon.js
-var makePrefixer = (prefix) => (...names) => [prefix, ...names].join("-");
-var withBaseName = makePrefixer("saltIcon");
-var DEFAULT_ICON_SIZE = 1;
-var Icon = (0, import_react.forwardRef)(function Icon2({ children, className, size = DEFAULT_ICON_SIZE, style: styleProp, ...rest }, ref) {
-  const style = {
-    ...styleProp,
-    "--saltIcon-size-multiplier": `${size}`
-  };
-  return /* @__PURE__ */ (0, import_jsx_runtime.jsx)("svg", {
-    className: clsx(withBaseName(), className),
-    style,
-    role: "img",
-    ...rest,
-    ref,
-    children: /* @__PURE__ */ (0, import_jsx_runtime.jsx)("g", {
-      "aria-hidden": true,
-      children
-    })
-  });
-});
-
-// ../../node_modules/@salt-ds/icons/dist-es/packages/icons/src/components/Delete.js
-var import_jsx_runtime2 = require("react/jsx-runtime");
-var import_react2 = require("react");
-var DeleteIcon = (0, import_react2.forwardRef)(
-  function DeleteIcon2(props, ref) {
-    return /* @__PURE__ */ (0, import_jsx_runtime2.jsxs)(Icon, {
-      "data-testid": "DeleteIcon",
-      "aria-label": "delete",
-      viewBox: "0 0 12 12",
-      ref,
-      ...props,
-      children: [
-        /* @__PURE__ */ (0, import_jsx_runtime2.jsx)("path", {
-          d: "M5 4v6H4V4h1Zm2 0v6H6V4h1Z"
-        }),
-        /* @__PURE__ */ (0, import_jsx_runtime2.jsx)("path", {
-          fillRule: "evenodd",
-          d: "M4 0a1 1 0 0 0-1 1v1H0v1h1v7a2 2 0 0 0 2 2h5.25A1.75 1.75 0 0 0 10 10.25V3h1V2H8V1a1 1 0 0 0-1-1H4Zm5 3H2v7a1 1 0 0 0 1 1h5.25a.75.75 0 0 0 .75-.75V3ZM7 2H4v-.5a.5.5 0 0 1 .5-.5h2a.5.5 0 0 1 .5.5V2Z",
-          clipRule: "evenodd"
-        })
-      ]
+};
+var 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");
     });
   }
-);
-
-// src/column-filter/RangeFilter.tsx
-var import_salt_lab = require("@heswell/salt-lab");
-
-// src/filter-utils.ts
-var import_vuu_utils = require("@vuu-ui/vuu-utils");
-var AND = "and";
-var EQUALS = "=";
-var GREATER_THAN = ">";
-var LESS_THAN = "<";
-var OR = "or";
-var STARTS_WITH = "starts";
-var ENDS_WITH = "ends";
-var IN = "in";
-var filterClauses = (filter, clauses = []) => {
-  if (filter) {
-    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
-      filter.filters.forEach((f) => clauses.push(...filterClauses(f)));
-    } else {
-      clauses.push(filter);
-    }
+  /// 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];
+    };
   }
-  return clauses;
-};
-var DEFAULT_ADD_FILTER_OPTS = {
-  combineWith: "and"
 };
-var addFilter = (existingFilter, filter, { combineWith = AND } = DEFAULT_ADD_FILTER_OPTS) => {
-  var _a;
-  if (includesNoValues(filter)) {
-    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
-    } else {
-      existingFilter = removeFilterForColumn(existingFilter, {
-        name: filter.column
-      });
-    }
-  } else if (includesAllValues(filter)) {
-    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
-    }
-    return removeFilterForColumn(existingFilter, { name: (_a = filter.column) != null ? _a : "" });
-  }
-  if (!existingFilter) {
-    return filter;
+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;
   }
-  if (!filter) {
-    return existingFilter;
+  /// 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;
   }
-  if (existingFilter.op === AND && filter.op === AND) {
-    return {
-      op: AND,
-      filters: combine(existingFilter.filters, filter.filters)
-    };
+  /// 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];
   }
-  if (existingFilter.op === AND) {
-    const filters = replaceOrInsert(existingFilter.filters, filter);
-    return filters.length > 1 ? { op: AND, filters } : filters[0];
+  /// True when this is the top node of a grammar.
+  get isTop() {
+    return (this.flags & 1) > 0;
   }
-  if (filter.op === AND) {
-    return { op: AND, filters: filter.filters.concat(existingFilter) };
+  /// True when this node is produced by a skip rule.
+  get isSkipped() {
+    return (this.flags & 2) > 0;
   }
-  if (filterEquals(existingFilter, filter, true)) {
-    return filter;
+  /// Indicates whether this is an error node.
+  get isError() {
+    return (this.flags & 4) > 0;
   }
-  if (canMerge(existingFilter, filter)) {
-    return merge(existingFilter, filter);
+  /// 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;
   }
-  return { op: combineWith, filters: [existingFilter, filter] };
-};
-var includesNoValues = (filter) => {
-  if (!filter) {
-    return false;
+  /// 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;
   }
-  if ((0, import_vuu_utils.isInFilter)(filter) && filter.values.length === 0) {
-    return true;
+  /// 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;
+      }
+    };
   }
-  return (0, import_vuu_utils.isAndFilter)(filter) && filter.filters.some((f) => includesNoValues(f));
 };
-var includesAllValues = (filter) => {
-  if (!filter) {
-    return false;
+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");
   }
-  if (filter.op === STARTS_WITH && filter.value === "") {
-    return true;
+  /// 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);
   }
-  return filter.op === STARTS_WITH && filter.value === "";
-};
-var replaceOrInsert = (filters, filter) => {
-  return filters.concat(filter);
 };
-var merge = (f1, f2) => {
-  if (includesNoValues(f2)) {
-    return f2;
-  }
-  if ((0, import_vuu_utils.isInFilter)(f1) && (0, import_vuu_utils.isInFilter)(f2)) {
-    return {
-      ...f1,
-      values: [
-        ...f1.values,
-        ...f2.values.filter(
-          (v) => !f1.values.includes(v)
-        )
-      ]
-    };
-  } else if ((0, import_vuu_utils.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]
-    };
+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;
+    }
   }
-  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;
+  /// @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 + ")" : "");
   }
-  if (sourceFilter.op !== AND) {
-    throw Error(
-      `removeFilter cannot remove ${JSON.stringify(
-        filterToRemove
-      )} from ${JSON.stringify(sourceFilter)}`
-    );
+  /// 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);
   }
-  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];
+  /// 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;
   }
-  if (filter.column === columnName) {
-    return [filter, void 0];
+  /// Get a [syntax node](#common.SyntaxNode) object for the top of the
+  /// tree.
+  get topNode() {
+    return new TreeNode(this, 0, 0, null);
   }
-  if (filter.op !== AND) {
-    return [void 0, filter];
+  /// 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;
   }
-  const [[columnFilter = void 0], filters] = (0, import_vuu_utils.partition)(
-    filter.filters,
-    (f) => f.column === columnName
-  );
-  return filters.length === 1 ? [columnFilter, filters[0]] : [columnFilter, { op: AND, filters }];
-};
-var overrideColName = (filter, column) => {
-  if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
-    return {
-      op: filter.op,
-      filters: filter.filters.map((f) => overrideColName(f, column))
-    };
+  /// 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;
   }
-  return { ...filter, column };
-};
-var filterIncludesColumn = (filter, column) => {
-  if (!filter) {
-    return false;
+  /// 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;
+      }
+    }
   }
-  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;
+  /// 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;
   }
-};
-var removeFilterForColumn = (sourceFilter, column) => {
-  const colName = column.name;
-  if (!sourceFilter) {
-    return 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;
   }
-  if (sourceFilter.column === colName) {
-    return void 0;
+  /// 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)));
   }
-  if ((0, import_vuu_utils.isAndFilter)(sourceFilter) || (0, import_vuu_utils.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 };
-    }
+  /// Build a tree from a postfix-ordered buffer of node information,
+  /// or a cursor over such a buffer.
+  static build(data) {
+    return buildTree(data);
   }
-  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;
+Tree.empty = new Tree(NodeType.none, [], [], 0);
+var FlatBufferCursor = class {
+  constructor(buffer, index) {
+    this.buffer = buffer;
+    this.index = index;
   }
-  if (arr1.length === arr2.length) {
-    const a = arr1.slice().sort();
-    const b = arr2.slice().sort();
-    return a.join("|") === b.join("|");
+  get id() {
+    return this.buffer[this.index - 4];
   }
-  return false;
-};
-var filterEquals = (f1, f2, strict = false) => {
-  if (!strict) {
-    return true;
+  get start() {
+    return this.buffer[this.index - 3];
   }
-  if (f1 && f2 && canMerge(f1, f2)) {
-    return f1.op === f2.op && ((0, import_vuu_utils.isSingleValueFilter)(f1) && (0, import_vuu_utils.isSingleValueFilter)(f2) && f1.value === f2.value || (0, import_vuu_utils.isMultiValueFilter)(f1) && (0, import_vuu_utils.isMultiValueFilter)(f2) && sameValues(f1.values, f2.values));
+  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);
   }
-  return false;
 };
-var updateFilter = (filter, newFilter, mode) => {
-  if (filter && newFilter) {
-    if (mode === "replace") {
-      return newFilter;
-    }
-    if (filter.op === "and") {
-      return {
-        ...filter,
-        filters: filter.filters.concat(newFilter)
-      };
-    }
-    const { column: columnName } = newFilter;
-    if (columnName) {
-      const existingClause = newFilter.column ? (0, import_vuu_utils.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]
-    };
+var TreeBuffer = class {
+  /// Create a tree buffer.
+  constructor(buffer, length, set) {
+    this.buffer = buffer;
+    this.length = length;
+    this.set = set;
   }
-  if (newFilter) {
-    return newFilter;
+  /// @internal
+  get type() {
+    return NodeType.none;
   }
-  return filter;
-};
-
-// src/column-filter/utils.ts
-var isStartsWithValue = (value) => /\.\.\.$/.test(value);
-var getTypeaheadFilter = (column, filterValues, isStartsWithFilter) => {
-  if (filterValues.length === 0) {
-    return void 0;
+  /// @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(",");
   }
-  if (isStartsWithFilter) {
-    const startsWith = filterValues[0].substring(0, filterValues[0].length - 3);
-    return {
-      column,
-      op: "starts",
-      value: `"${startsWith}"`
-    };
+  /// @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(",") + ")";
   }
-  return {
-    column,
-    op: "in",
-    values: filterValues.map((value) => `"${value}"`)
-  };
-};
-var getRangeFilter = (column, startValue, endValue) => {
-  const startFilter = startValue === void 0 ? void 0 : { column, op: ">", value: startValue - 1 };
-  const endFilter = endValue === void 0 ? void 0 : { column, op: "<", value: endValue + 1 };
-  if (endFilter === void 0)
-    return startFilter;
-  return addFilter(startFilter, endFilter, { combineWith: "and" });
-};
-
-// src/column-filter/RangeFilter.tsx
-var import_jsx_runtime3 = require("react/jsx-runtime");
-var RangeFilter = ({
-  defaultTypeaheadParams,
-  filterValues,
-  onChange
-}) => {
-  var _a, _b;
-  const columnName = defaultTypeaheadParams[1];
-  const startChangeHandler = (e) => {
-    const value = parseFloat(e.target.value);
-    const newRange = {
-      start: isNaN(value) ? void 0 : value,
-      end: filterValues == null ? void 0 : filterValues.end
-    };
-    const filter = getRangeFilter(columnName, newRange.start, newRange.end);
-    onChange(newRange, filter);
-  };
-  const endChangeHandler = (e) => {
-    const value = parseFloat(e.target.value);
-    const newRange = {
-      start: filterValues == null ? void 0 : filterValues.start,
-      end: isNaN(value) ? void 0 : value
-    };
-    const filter = getRangeFilter(columnName, newRange.start, newRange.end);
-    onChange(newRange, filter);
-  };
-  return /* @__PURE__ */ (0, import_jsx_runtime3.jsxs)("div", { style: { display: "flex", flexDirection: "row" }, children: [
-    /* @__PURE__ */ (0, import_jsx_runtime3.jsx)(import_salt_lab.ToolbarField, { label: "From", children: /* @__PURE__ */ (0, import_jsx_runtime3.jsx)(
-      import_salt_lab.Input,
-      {
-        onChange: startChangeHandler,
-        value: ((_a = filterValues == null ? void 0 : filterValues.start) == null ? void 0 : _a.toString()) || "",
-        type: "number"
-      }
-    ) }),
-    /* @__PURE__ */ (0, import_jsx_runtime3.jsx)(import_salt_lab.ToolbarField, { label: "To", children: /* @__PURE__ */ (0, import_jsx_runtime3.jsx)(
-      import_salt_lab.Input,
-      {
-        onChange: endChangeHandler,
-        value: ((_b = filterValues == null ? void 0 : filterValues.end) == null ? void 0 : _b.toString()) || "",
-        type: "number"
-      }
-    ) })
-  ] });
-};
-
-// src/column-filter/TypeaheadFilter.tsx
-var import_vuu_data_react = require("@vuu-ui/vuu-data-react");
-var import_salt_lab2 = require("@heswell/salt-lab");
-var import_react3 = require("react");
-var import_jsx_runtime4 = require("react/jsx-runtime");
-var TypeaheadFilter = ({
-  defaultTypeaheadParams,
-  filterValues = [],
-  onChange: onFilterChange
-}) => {
-  const [tableName, columnName] = defaultTypeaheadParams;
-  const [searchValue, setSearchValue] = (0, import_react3.useState)("");
-  const [typeaheadValues, setTypeaheadValues] = (0, import_react3.useState)([]);
-  const getSuggestions = (0, import_vuu_data_react.useTypeaheadSuggestions)();
-  (0, import_react3.useEffect)(() => {
-    const params = searchValue ? [tableName, columnName, searchValue] : defaultTypeaheadParams;
-    let isSubscribed = true;
-    getSuggestions(params).then((options) => {
-      if (!isSubscribed) {
-        return;
-      }
-      if (isStartsWithValue(filterValues[0])) {
-        options.unshift(filterValues[0]);
-      }
-      if (searchValue) {
-        options.unshift(`${searchValue}...`);
-      }
-      options.concat(filterValues);
-      setTypeaheadValues(options);
-    });
-    return () => {
-      isSubscribed = false;
-    };
-  }, [
-    filterValues,
-    searchValue,
-    columnName,
-    tableName,
-    getSuggestions,
-    defaultTypeaheadParams
-  ]);
-  const onInputChange = (0, import_react3.useCallback)(
-    (evt) => {
-      const value = evt.target.value;
-      setSearchValue(value);
-    },
-    []
-  );
-  const onSelectionChange = (0, import_react3.useCallback)(
-    (_evt, selected) => {
-      setSearchValue("");
-      if (selected === null)
-        return;
-      if (selected.some(isStartsWithValue)) {
-        selected = selected.filter(isStartsWithValue).slice(-1);
+  /// @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;
       }
-      const filter = getTypeaheadFilter(
-        columnName,
-        selected,
-        isStartsWithValue(selected[0])
-      );
-      onFilterChange(selected, filter);
-    },
-    [columnName, onFilterChange]
-  );
-  return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
-    import_salt_lab2.ComboBoxDeprecated,
-    {
-      multiSelect: true,
-      onInputChange,
-      onChange: onSelectionChange,
-      source: typeaheadValues,
-      style: { minWidth: 200 },
-      inputValue: searchValue,
-      selectedItem: filterValues
-    },
-    columnName
-  );
-};
-
-// src/column-filter/ColumnListItem.tsx
-var import_react4 = require("react");
-var import_salt_lab3 = require("@heswell/salt-lab");
-var import_jsx_runtime5 = require("react/jsx-runtime");
-var ColumnListItem = (props) => {
-  return /* @__PURE__ */ (0, import_jsx_runtime5.jsx)(MemoColumnItem, { ...props });
-};
-var MemoColumnItem = (0, import_react4.memo)(function MemoizedItem({
-  item,
-  itemTextHighlightPattern,
-  ...restProps
-}) {
-  return /* @__PURE__ */ (0, import_jsx_runtime5.jsx)(import_salt_lab3.ListItem, { ...restProps, children: /* @__PURE__ */ (0, import_jsx_runtime5.jsx)("span", { style: { marginLeft: 10 }, children: /* @__PURE__ */ (0, import_jsx_runtime5.jsx)(
-    import_salt_lab3.Highlighter,
-    {
-      matchPattern: itemTextHighlightPattern,
-      text: item == null ? void 0 : item.name
     }
-  ) }) });
-});
-
-// src/column-filter/useColumnFilterStore.ts
-var import_vuu_utils2 = require("@vuu-ui/vuu-utils");
-var import_react5 = require("react");
-var addOrReplace = (array, newValue, key) => array.filter((oldValue) => oldValue[key] !== newValue[key]).concat(newValue);
-var useColumnFilterStore = (onFilterSubmit) => {
-  var _a, _b;
-  const [selectedColumnName, setSelectedColumnName] = (0, import_react5.useState)("");
-  const [savedFilters, setSavedFilters] = (0, import_react5.useState)([]);
-  const [rangeValues, setRangeValues] = (0, import_react5.useState)([]);
-  const [typeaheadValues, setTypeaheadValues] = (0, import_react5.useState)([]);
-  const clear = () => {
-    setSelectedColumnName("");
-    setRangeValues([]);
-    setTypeaheadValues([]);
-    setSavedFilters([]);
-    onFilterSubmit({ filter: "" });
-  };
-  const updateFilters = (0, import_react5.useCallback)(
-    (newFilter) => {
-      const newSavedFilters = addOrReplace(
-        savedFilters,
-        { column: selectedColumnName, filter: newFilter },
-        "column"
-      );
-      setSavedFilters(newSavedFilters);
-      const combinedFilter = newSavedFilters.map((x) => x.filter).reduce((prev, filter) => {
-        if (filter === void 0)
-          return prev;
-        return addFilter(prev, filter, { combineWith: AND });
-      }, void 0);
-      const query = combinedFilter === void 0 ? "" : (0, import_vuu_utils2.filterAsQuery)(combinedFilter);
-      onFilterSubmit({ filter: query, filterStruct: combinedFilter });
-    },
-    [selectedColumnName, onFilterSubmit, savedFilters]
-  );
-  const onTypeaheadChange = (0, import_react5.useCallback)(
-    (newValues, newFilter) => {
-      setTypeaheadValues(
-        addOrReplace(
-          typeaheadValues,
-          { column: selectedColumnName, value: newValues },
-          "column"
-        )
-      );
-      updateFilters(newFilter);
-    },
-    [selectedColumnName, typeaheadValues, updateFilters]
-  );
-  const onRangeChange = (0, import_react5.useCallback)(
-    (newValues, newFilter) => {
-      setRangeValues(
-        addOrReplace(
-          rangeValues,
-          { column: selectedColumnName, value: newValues },
-          "column"
-        )
-      );
-      updateFilters(newFilter);
-    },
-    [selectedColumnName, rangeValues, updateFilters]
-  );
-  const onSelectedColumnChange = (0, import_react5.useCallback)(
-    (column) => setSelectedColumnName((column == null ? void 0 : column.name) || ""),
-    []
-  );
-  const rangeValue = (_a = rangeValues.filter(
-    (v) => v.column === selectedColumnName
-  )[0]) == null ? void 0 : _a.value;
-  const typeaheadValue = (_b = typeaheadValues.filter(
-    (v) => v.column === selectedColumnName
-  )[0]) == null ? void 0 : _b.value;
-  return {
-    clear,
-    selectedColumnName,
-    rangeValue,
-    typeaheadValue,
-    onSelectedColumnChange,
-    onRangeChange,
-    onTypeaheadChange
-  };
+    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);
+  }
 };
-
-// src/column-filter/ColumnFilter.tsx
-var import_jsx_runtime6 = require("react/jsx-runtime");
-var ColumnFilter = ({
-  className,
-  table,
-  columns,
-  onFilterSubmit,
-  ...htmlAttributes
-}) => {
-  const {
-    clear,
-    onTypeaheadChange,
-    onRangeChange,
-    onSelectedColumnChange,
-    selectedColumnName,
-    rangeValue,
-    typeaheadValue
-  } = useColumnFilterStore(onFilterSubmit);
-  const getFilterComponent = () => {
-    var _a;
-    const defaultTypeaheadParams = [table, selectedColumnName];
-    const selectedColumnType = (_a = columns.find(
-      (column) => column.name === selectedColumnName
-    )) == null ? void 0 : _a.serverDataType;
-    switch (selectedColumnType) {
-      case "string":
-      case "char":
-        return /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(
-          import_salt_lab4.ToolbarField,
-          {
-            label: "Start typing to select a filter",
-            labelPlacement: "top",
-            children: /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(
-              TypeaheadFilter,
-              {
-                defaultTypeaheadParams,
-                filterValues: typeaheadValue,
-                onChange: onTypeaheadChange
-              }
-            )
-          }
-        );
-      case "int":
-      case "long":
-      case "double":
-        return /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(import_salt_lab4.ToolbarField, { label: "Select a range", labelPlacement: "top", children: /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(
-          RangeFilter,
-          {
-            defaultTypeaheadParams,
-            filterValues: rangeValue,
-            onChange: onRangeChange
-          }
-        ) });
-      default:
-        return /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(import_salt_lab4.ToolbarField, { children: /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(import_core.Text, { children: "Data type unsupported" }) });
+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 /* @__PURE__ */ (0, import_jsx_runtime6.jsxs)(
-    import_salt_lab4.Toolbar,
-    {
-      ...htmlAttributes,
-      style: { alignItems: "center", height: "36px" },
-      children: [
-        /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(
-          import_salt_lab4.ToolbarField,
-          {
-            label: "Select a column to filter",
-            labelPlacement: "top",
-            style: { width: 180 },
-            children: /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(
-              import_salt_lab4.Dropdown,
-              {
-                source: columns,
-                ListItem: ColumnListItem,
-                itemToString: (column) => column.name,
-                onSelectionChange: (_evt, column) => onSelectedColumnChange(column)
-              }
-            )
-          }
-        ),
-        selectedColumnName && getFilterComponent(),
-        /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(import_salt_lab4.ToolbarButton, { onClick: clear, children: /* @__PURE__ */ (0, import_jsx_runtime6.jsx)(DeleteIcon, {}) })
-      ]
+  }
+  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;
     }
-  );
-};
-
-// src/filter-input/FilterInput.tsx
-var import_core2 = require("@salt-ds/core");
-
-// src/filter-input/useCodeMirrorEditor.ts
-var import_vuu_codemirror5 = require("@vuu-ui/vuu-codemirror");
-
-// ../../node_modules/@lezer/common/dist/index.js
-var DefaultBufferLength = 1024;
-var nextPropID = 0;
-var Range = class {
-  constructor(from, to) {
+  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.to = to;
+    this.index = index;
+    this._parent = _parent;
   }
-};
-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");
-    });
+  get type() {
+    return this._tree.type;
   }
-  /// 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];
-    };
+  get name() {
+    return this._tree.type.name;
   }
-};
-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;
+  get to() {
+    return this.from + this._tree.length;
   }
-  /// 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];
+  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);
         }
       }
-    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;
+      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;
     }
-    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;
-      }
-    };
+  get firstChild() {
+    return this.nextChild(
+      0,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
   }
-};
-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");
+  get lastChild() {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
   }
-  /// 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);
+  childAfter(pos) {
+    return this.nextChild(
+      0,
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
   }
-};
-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;
-    }
+  childBefore(pos) {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
   }
-  /// @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;
+  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.type.name ? children : (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (children.length ? "(" + children + ")" : "");
+    return this.nextChild(0, 1, pos, side, mode);
   }
-  /// 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);
+  nextSignificantParent() {
+    let val = this;
+    while (val.type.isAnonymous && val._parent)
+      val = val._parent;
+    return val;
   }
-  /// 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 parent() {
+    return this._parent ? this._parent.nextSignificantParent() : null;
   }
-  /// Get a [syntax node](#common.SyntaxNode) object for the top of the
-  /// tree.
-  get topNode() {
-    return new TreeNode(this, 0, 0, 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;
   }
-  /// 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;
+    return resolveNode(this, pos, side, false);
   }
-  /// 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;
+    return resolveNode(this, pos, side, true);
   }
-  /// 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;
-      }
-    }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
   }
-  /// 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;
+  getChild(type, before = null, after = null) {
+    let r = getChildren(this, type, before, after);
+    return r.length ? r[0] : null;
   }
-  /// 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;
+  getChildren(type, before = null, after = null) {
+    return getChildren(this, type, before, after);
   }
-  /// 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)));
+  /// @internal
+  toString() {
+    return this._tree.toString();
   }
-  /// Build a tree from a postfix-ordered buffer of node information,
-  /// or a cursor over such a buffer.
-  static build(data) {
-    return buildTree(data);
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
   }
 };
-Tree.empty = new Tree(NodeType.none, [], [], 0);
-var FlatBufferCursor = class {
-  constructor(buffer, index) {
+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;
   }
-  get id() {
-    return this.buffer[this.index - 4];
+};
+var BufferNode = class {
+  get name() {
+    return this.type.name;
   }
-  get start() {
-    return this.buffer[this.index - 3];
+  get from() {
+    return this.context.start + this.context.buffer.buffer[this.index + 1];
   }
-  get end() {
-    return this.buffer[this.index - 2];
+  get to() {
+    return this.context.start + this.context.buffer.buffer[this.index + 2];
   }
-  get size() {
-    return this.buffer[this.index - 1];
+  constructor(context, _parent, index) {
+    this.context = context;
+    this._parent = _parent;
+    this.index = index;
+    this.type = context.buffer.set.types[context.buffer.buffer[index]];
   }
-  get pos() {
-    return this.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);
   }
-  next() {
-    this.index -= 4;
+  get firstChild() {
+    return this.child(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
   }
-  fork() {
-    return new FlatBufferCursor(this.buffer, this.index);
+  get lastChild() {
+    return this.child(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
   }
-};
-var TreeBuffer = class {
-  /// Create a tree buffer.
-  constructor(buffer, length, set) {
-    this.buffer = buffer;
-    this.length = length;
-    this.set = set;
+  childAfter(pos) {
+    return this.child(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
   }
-  /// @internal
-  get type() {
-    return NodeType.none;
+  childBefore(pos) {
+    return this.child(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
   }
-  /// @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(",");
+  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);
   }
-  /// @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(",") + ")";
+  get parent() {
+    return this._parent || this.context.parent.nextSignificantParent();
   }
-  /// @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,
+  externalSibling(dir) {
+    return this._parent ? null : this.context.parent.nextChild(
+      this.context.index + dir,
+      dir,
       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;
+    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() {
-    return this._parent && this.index >= 0 ? this._parent.nextChild(
-      this.index - 1,
+    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 */
-    ) : null;
+    ));
   }
   cursor(mode = 0) {
     return new TreeCursor(this, mode);
   }
   get tree() {
-    return this._tree;
+    return null;
   }
   toTree() {
-    return this._tree;
+    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);
@@ -1418,17 +883,17 @@ var TreeNode = class {
   enterUnfinishedNodesBefore(pos) {
     return enterUnfinishedNodesBefore(this, pos);
   }
+  /// @internal
+  toString() {
+    return this.context.buffer.childString(this.index);
+  }
   getChild(type, before = null, after = null) {
-    let r2 = getChildren(this, type, before, after);
-    return r2.length ? r2[0] : 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;
   }
@@ -1436,203 +901,28 @@ var TreeNode = class {
     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;
+var TreeCursor = class {
+  /// Shorthand for `.type.name`.
+  get name() {
+    return this.type.name;
   }
-  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 r2 = getChildren(this, type, before, after);
-    return r2.length ? r2[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);
-    }
+  /// @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)
@@ -2148,7 +1438,7 @@ var Parser = class {
   startParse(input, fragments, ranges) {
     if (typeof input == "string")
       input = new StringInput(input);
-    ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map((r2) => new Range(r2.from, r2.to)) : [new Range(0, 0)];
+    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.
@@ -2897,11 +2187,11 @@ var InputStream = class {
     if (from >= this.range.from && to <= this.range.to)
       return this.input.read(from, to);
     let result = "";
-    for (let r2 of this.ranges) {
-      if (r2.from >= to)
+    for (let r of this.ranges) {
+      if (r.from >= to)
         break;
-      if (r2.to > from)
-        result += this.input.read(Math.max(r2.from, from), Math.min(r2.to, to));
+      if (r.to > from)
+        result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));
     }
     return result;
   }
@@ -3532,7 +2822,7 @@ var LRParser = class extends Parser {
     this.minRepeatTerm = nodeNames.length;
     for (let i = 0; i < spec.repeatNodeCount; i++)
       nodeNames.push("");
-    let topTerms = Object.keys(spec.topRules).map((r2) => spec.topRules[r2][1]);
+    let topTerms = Object.keys(spec.topRules).map((r) => spec.topRules[r][1]);
     let nodeProps = [];
     for (let i = 0; i < nodeNames.length; i++)
       nodeProps.push([]);
@@ -3712,13 +3002,13 @@ var LRParser = class extends Parser {
     }
     if (config.tokenizers)
       copy.tokenizers = this.tokenizers.map((t) => {
-        let found = config.tokenizers.find((r2) => r2.from == 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((r2) => r2.from == s.external);
+        let found = config.specializers.find((r) => r.from == s.external);
         if (!found)
           return s;
         let spec = Object.assign(Object.assign({}, s), { external: found.to });
@@ -3828,14 +3118,14 @@ var parser = LRParser.deserialize({
 });
 
 // ../vuu-filter-parser/src/FilterTreeWalker.ts
-var import_vuu_utils3 = require("@vuu-ui/vuu-utils");
+var import_vuu_utils = require("@vuu-ui/vuu-utils");
 var _filter;
 var FilterExpression = class {
   constructor() {
     __privateAdd(this, _filter, void 0);
   }
   setFilterCombinatorOp(op, filter = __privateGet(this, _filter)) {
-    if ((0, import_vuu_utils3.isMultiClauseFilter)(filter) && filter.op === op) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter) && filter.op === op) {
       return;
     } else {
       __privateSet(this, _filter, {
@@ -3847,14 +3137,14 @@ var FilterExpression = class {
   add(filter) {
     if (__privateGet(this, _filter) === void 0) {
       __privateSet(this, _filter, filter);
-    } else if ((0, import_vuu_utils3.isMultiClauseFilter)(__privateGet(this, _filter))) {
+    } else if ((0, import_vuu_utils.isMultiClauseFilter)(__privateGet(this, _filter))) {
       __privateGet(this, _filter).filters.push(filter);
     } else {
       throw Error(`Invalid filter passed to FilterExpression`);
     }
   }
   setColumn(column, filter = __privateGet(this, _filter)) {
-    if ((0, import_vuu_utils3.isMultiClauseFilter)(filter)) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
       const target = filter.filters.at(-1);
       if (target) {
         this.setColumn(column, target);
@@ -3864,7 +3154,7 @@ var FilterExpression = class {
     }
   }
   setOp(value, filter = __privateGet(this, _filter)) {
-    if ((0, import_vuu_utils3.isMultiClauseFilter)(filter)) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
       const target = filter.filters.at(-1);
       if (target) {
         this.setOp(value, target);
@@ -3875,15 +3165,15 @@ var FilterExpression = class {
   }
   setValue(value, filter = __privateGet(this, _filter)) {
     var _a;
-    if ((0, import_vuu_utils3.isMultiClauseFilter)(filter)) {
+    if ((0, import_vuu_utils.isMultiClauseFilter)(filter)) {
       const target = filter.filters.at(-1);
       if (target) {
         this.setValue(value, target);
       }
-    } else if ((0, import_vuu_utils3.isMultiValueFilter)(filter)) {
+    } else if ((0, import_vuu_utils.isMultiValueFilter)(filter)) {
       (_a = filter.values) != null ? _a : filter.values = [];
       filter.values.push(value);
-    } else if ((0, import_vuu_utils3.isSingleValueFilter)(filter)) {
+    } else if ((0, import_vuu_utils.isSingleValueFilter)(filter)) {
       filter.value = value;
     }
   }
@@ -3947,7 +3237,7 @@ var strictParser = parser.configure({ strict: true });
 
 // src/filter-input/useCodeMirrorEditor.ts
 var import_classnames = __toESM(require_classnames(), 1);
-var import_react7 = require("react");
+var import_react2 = require("react");
 
 // src/filter-input/FilterLanguage.ts
 var import_vuu_codemirror = require("@vuu-ui/vuu-codemirror");
@@ -4052,7 +3342,7 @@ var vuuTheme = import_vuu_codemirror3.EditorView.theme(
 
 // src/filter-input/useFilterAutoComplete.ts
 var import_vuu_codemirror4 = require("@vuu-ui/vuu-codemirror");
-var import_react6 = require("react");
+var import_react = require("react");
 var getOperator = (node, state) => {
   let maybeColumnNode = node.prevSibling || node.parent;
   while (maybeColumnNode && !["Column", "Operator", "In"].includes(maybeColumnNode.name)) {
@@ -4122,7 +3412,7 @@ var getSetValues = (node, state) => {
   return values;
 };
 var useAutoComplete = (suggestionProvider, onSubmit, existingFilter) => {
-  const makeSuggestions = (0, import_react6.useCallback)(
+  const makeSuggestions = (0, import_react.useCallback)(
     async (context, suggestionType, optionalArgs = {}) => {
       const { startsWith = "" } = optionalArgs;
       const options = await suggestionProvider.getSuggestions(
@@ -4133,7 +3423,7 @@ var useAutoComplete = (suggestionProvider, onSubmit, existingFilter) => {
     },
     [suggestionProvider]
   );
-  return (0, import_react6.useCallback)(
+  return (0, import_react.useCallback)(
     async (context) => {
       var _a, _b;
       const { state, pos } = context;
@@ -4317,15 +3607,15 @@ var useCodeMirrorEditor = ({
   onSubmitFilter,
   suggestionProvider
 }) => {
-  const editorRef = (0, import_react7.useRef)(null);
-  const onSubmit = (0, import_react7.useRef)(noop);
-  const viewRef = (0, import_react7.useRef)();
+  const editorRef = (0, import_react2.useRef)(null);
+  const onSubmit = (0, import_react2.useRef)(noop);
+  const viewRef = (0, import_react2.useRef)();
   const completionFn = useAutoComplete(
     suggestionProvider,
     onSubmit,
     existingFilter
   );
-  const [createState, clearInput] = (0, import_react7.useMemo)(() => {
+  const [createState, clearInput] = (0, import_react2.useMemo)(() => {
     const parseFilter2 = () => {
       const view = getView(viewRef);
       const source = view.state.doc.toString();
@@ -4400,7 +3690,7 @@ var useCodeMirrorEditor = ({
     };
     return [createState2, clearInput2];
   }, [completionFn, onSubmitFilter]);
-  (0, import_react7.useEffect)(() => {
+  (0, import_react2.useEffect)(() => {
     if (!editorRef.current) {
       throw Error("editor not in dom");
     }
@@ -4417,7 +3707,7 @@ var useCodeMirrorEditor = ({
 };
 
 // src/filter-input/FilterInput.tsx
-var import_jsx_runtime7 = require("react/jsx-runtime");
+var import_jsx_runtime = require("react/jsx-runtime");
 var classBase = "vuuFilterInput";
 var FilterInput = ({
   existingFilter,
@@ -4432,18 +3722,18 @@ var FilterInput = ({
     onSubmitFilter,
     suggestionProvider
   });
-  return /* @__PURE__ */ (0, import_jsx_runtime7.jsxs)("div", { ...props, className: classBase, children: [
-    /* @__PURE__ */ (0, import_jsx_runtime7.jsx)(
-      import_core2.Button,
+  return /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { ...props, className: classBase, children: [
+    /* @__PURE__ */ (0, import_jsx_runtime.jsx)(
+      import_core.Button,
       {
         className: `${classBase}-FilterButton`,
         "data-icon": iconName,
         tabIndex: -1
       }
     ),
-    /* @__PURE__ */ (0, import_jsx_runtime7.jsx)("div", { className: `${classBase}-Editor`, ref: editorRef }),
-    /* @__PURE__ */ (0, import_jsx_runtime7.jsx)(
-      import_core2.Button,
+    /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: `${classBase}-Editor`, ref: editorRef }),
+    /* @__PURE__ */ (0, import_jsx_runtime.jsx)(
+      import_core.Button,
       {
         className: `${classBase}-ClearButton`,
         "data-icon": "close-circle",
@@ -4455,17 +3745,17 @@ var FilterInput = ({
 
 // src/filter-input/useFilterSuggestionProvider.ts
 var import_vuu_codemirror6 = require("@vuu-ui/vuu-codemirror");
-var import_vuu_data_react2 = require("@vuu-ui/vuu-data-react");
-var import_react8 = require("react");
+var import_vuu_data_react = require("@vuu-ui/vuu-data-react");
+var import_react3 = require("react");
 
 // src/filter-input/filterInfo.ts
-var import_vuu_utils4 = require("@vuu-ui/vuu-utils");
+var import_vuu_utils2 = require("@vuu-ui/vuu-utils");
 var filterInfo = (filterName, filterQuery) => {
-  const rootElement = (0, import_vuu_utils4.createEl)("div", "vuuFunctionDoc");
-  const headingElement = (0, import_vuu_utils4.createEl)("div", "function-heading");
-  const nameElement = (0, import_vuu_utils4.createEl)("span", "function-name", filterName);
+  const rootElement = (0, import_vuu_utils2.createEl)("div", "vuuFunctionDoc");
+  const headingElement = (0, import_vuu_utils2.createEl)("div", "function-heading");
+  const nameElement = (0, import_vuu_utils2.createEl)("span", "function-name", filterName);
   headingElement.appendChild(nameElement);
-  const child2 = (0, import_vuu_utils4.createEl)("p", void 0, filterQuery);
+  const child2 = (0, import_vuu_utils2.createEl)("p", void 0, filterQuery);
   rootElement.appendChild(headingElement);
   rootElement.appendChild(child2);
   return rootElement;
@@ -4550,11 +3840,11 @@ var useFilterSuggestionProvider = ({
   namedFilters,
   saveOptions = defaultSaveOptions,
   table,
-  typeaheadHook: useTypeahead = import_vuu_data_react2.useTypeaheadSuggestions
+  typeaheadHook: useTypeahead = import_vuu_data_react.useTypeaheadSuggestions
 }) => {
-  const latestSuggestionsRef = (0, import_react8.useRef)();
+  const latestSuggestionsRef = (0, import_react3.useRef)();
   const getTypeaheadSuggestions = useTypeahead();
-  const getSuggestions = (0, import_react8.useCallback)(
+  const getSuggestions = (0, import_react3.useCallback)(
     async (suggestionType, options = NONE) => {
       const {
         columnName,
@@ -4602,7 +3892,7 @@ var useFilterSuggestionProvider = ({
                 );
               }
               const prefix = Array.isArray(selection) ? selection.length === 0 ? "[" : "," : "";
-              const params = (0, import_vuu_data_react2.getTypeaheadParams)(
+              const params = (0, import_vuu_data_react.getTypeaheadParams)(
                 table,
                 columnName,
                 startsWith
@@ -4644,7 +3934,7 @@ var useFilterSuggestionProvider = ({
     },
     [columns, getTypeaheadSuggestions, namedFilters, saveOptions, table]
   );
-  const isPartialMatch = (0, import_react8.useCallback)(
+  const isPartialMatch = (0, import_react3.useCallback)(
     async (valueType, columnName, pattern) => {
       const suggestions = (
         // latestSuggestions && latestSuggestions.length > 0
@@ -4664,204 +3954,486 @@ var useFilterSuggestionProvider = ({
     },
     [getSuggestions]
   );
-  return {
-    getSuggestions,
-    isPartialMatch
-  };
+  return {
+    getSuggestions,
+    isPartialMatch
+  };
+};
+
+// src/filter-toolbar/FilterToolbar.tsx
+var import_salt_lab4 = require("@heswell/salt-lab");
+var import_classnames2 = __toESM(require_classnames(), 1);
+
+// src/filter-toolbar/useFilterToolbar.tsx
+var import_vuu_utils3 = require("@vuu-ui/vuu-utils");
+var import_salt_lab3 = require("@heswell/salt-lab");
+
+// src/filter-toolbar/FilterDropdown.tsx
+var import_salt_lab = require("@heswell/salt-lab");
+var import_react4 = require("react");
+var import_jsx_runtime2 = require("react/jsx-runtime");
+var isString = (s) => typeof s === "string";
+var stripQuotes = (selected) => {
+  if (isString(selected)) {
+    if (selected.startsWith('"') && selected.endsWith('"')) {
+      return selected.slice(1, -1);
+    } else {
+      return selected;
+    }
+  } else {
+    return selected.map(stripQuotes);
+  }
+};
+var FilterDropdown = ({
+  column,
+  selected: selectedProp,
+  suggestionProvider,
+  ...props
+}) => {
+  const selected = selectedProp != null ? stripQuotes(selectedProp) : void 0;
+  const initialValues = Array.isArray(selected) ? selected : selected != null ? [selected] : [];
+  const [values, setValues] = (0, import_react4.useState)(initialValues);
+  console.log({ initialValues });
+  const handleOpenChange = (0, import_react4.useCallback)(
+    async (isOpen) => {
+      if (isOpen) {
+        const values2 = await suggestionProvider.getSuggestions("columnValue", {
+          columnName: column
+        });
+        console.log({ values: values2 });
+        setValues(values2.map((suggestion) => suggestion.label));
+      }
+    },
+    [column, suggestionProvider]
+  );
+  return /* @__PURE__ */ (0, import_jsx_runtime2.jsx)(
+    import_salt_lab.Dropdown,
+    {
+      ...props,
+      onOpenChange: handleOpenChange,
+      selected,
+      source: values
+    }
+  );
+};
+
+// src/filter-toolbar/FilterDropdownMultiSelect.tsx
+var import_salt_lab2 = require("@heswell/salt-lab");
+var import_react5 = require("react");
+var import_jsx_runtime3 = require("react/jsx-runtime");
+var isString2 = (s) => typeof s === "string";
+var stripQuotes2 = (selected) => {
+  if (selected === void 0) {
+    return void 0;
+  } else if (isString2(selected)) {
+    if (selected.startsWith('"') && selected.endsWith('"')) {
+      return selected.slice(1, -1);
+    } else {
+      return selected;
+    }
+  } else {
+    return selected.map(stripQuotes2);
+  }
+};
+var FilterDropdownMultiSelect = ({
+  column,
+  selected: selectedProp,
+  suggestionProvider,
+  ...props
+}) => {
+  const selected = stripQuotes2(selectedProp);
+  const initialValues = Array.isArray(selected) ? selected : selected != null ? [selected] : [];
+  const [values, setValues] = (0, import_react5.useState)(initialValues);
+  const handleOpenChange = (0, import_react5.useCallback)(
+    async (isOpen) => {
+      if (isOpen) {
+        const values2 = await suggestionProvider.getSuggestions("columnValue", {
+          columnName: column
+        });
+        console.log({ values: values2 });
+        setValues(values2.map((suggestion) => suggestion.label));
+      }
+    },
+    [column, suggestionProvider]
+  );
+  return /* @__PURE__ */ (0, import_jsx_runtime3.jsx)(
+    import_salt_lab2.Dropdown,
+    {
+      ...props,
+      onOpenChange: handleOpenChange,
+      selected,
+      selectionStrategy: "multiple",
+      source: values
+    }
+  );
+};
+
+// src/filter-toolbar/useFilterToolbar.tsx
+var import_jsx_runtime4 = require("react/jsx-runtime");
+var filterToControl = (filter, suggestionProvider) => {
+  if ((0, import_vuu_utils3.isNamedFilter)(filter)) {
+    return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+      import_salt_lab3.ToggleButton,
+      {
+        className: "vuuToggleButton",
+        toggled: true,
+        variant: "secondary",
+        children: filter.name
+      }
+    );
+  }
+  if ((0, import_vuu_utils3.isSingleValueFilter)(filter)) {
+    const { column, value } = filter;
+    return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+      import_salt_lab3.ToolbarField,
+      {
+        className: "vuuFilterDropdown",
+        label: column,
+        labelPlacement: "top",
+        children: /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+          FilterDropdown,
+          {
+            column,
+            selected: value.toString(),
+            selectionStrategy: "default",
+            source: [value.toString()],
+            suggestionProvider,
+            style: { width: 100 }
+          }
+        )
+      },
+      column
+    );
+  }
+  if ((0, import_vuu_utils3.isMultiValueFilter)(filter)) {
+    const values = filter.values.map((v) => v.toString());
+    return /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+      import_salt_lab3.ToolbarField,
+      {
+        className: "vuuFilterDropdown",
+        label: filter.column,
+        labelPlacement: "top",
+        children: /* @__PURE__ */ (0, import_jsx_runtime4.jsx)(
+          FilterDropdownMultiSelect,
+          {
+            column: filter.column,
+            selected: values,
+            source: values,
+            suggestionProvider,
+            style: { width: 100 }
+          }
+        )
+      },
+      filter.column
+    );
+  }
+  return filter.filters.map(
+    (filter2) => filterToControl(filter2, suggestionProvider)
+  );
+};
+var useFilterToolbar = ({
+  filter,
+  suggestionProvider
+}) => {
+  if (filter) {
+    return filterToControl(filter, suggestionProvider);
+  }
+  return [];
+};
+
+// src/filter-toolbar/FilterToolbar.tsx
+var import_jsx_runtime5 = require("react/jsx-runtime");
+var FilterToolbar = ({
+  className,
+  filter,
+  suggestionProvider,
+  ...props
+}) => {
+  console.log(`FilterToolbar ${JSON.stringify(filter, null, 2)}`);
+  const toolbarItems = useFilterToolbar({ filter, suggestionProvider });
+  return /* @__PURE__ */ (0, import_jsx_runtime5.jsx)(import_salt_lab4.Toolbar, { className: (0, import_classnames2.default)("vuuFilterToolbar", className), ...props, children: toolbarItems });
+};
+
+// src/filter-utils.ts
+var import_vuu_utils4 = require("@vuu-ui/vuu-utils");
+var AND = "and";
+var EQUALS = "=";
+var GREATER_THAN = ">";
+var LESS_THAN = "<";
+var OR = "or";
+var STARTS_WITH = "starts";
+var ENDS_WITH = "ends";
+var IN = "in";
+var filterClauses = (filter, clauses = []) => {
+  if (filter) {
+    if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+      filter.filters.forEach((f) => clauses.push(...filterClauses(f)));
+    } else {
+      clauses.push(filter);
+    }
+  }
+  return clauses;
+};
+var DEFAULT_ADD_FILTER_OPTS = {
+  combineWith: "and"
+};
+var addFilter = (existingFilter, filter, { combineWith = AND } = DEFAULT_ADD_FILTER_OPTS) => {
+  var _a;
+  if (includesNoValues(filter)) {
+    if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+    } else {
+      existingFilter = removeFilterForColumn(existingFilter, {
+        name: filter.column
+      });
+    }
+  } else if (includesAllValues(filter)) {
+    if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+    }
+    return removeFilterForColumn(existingFilter, { name: (_a = filter.column) != null ? _a : "" });
+  }
+  if (!existingFilter) {
+    return filter;
+  }
+  if (!filter) {
+    return existingFilter;
+  }
+  if (existingFilter.op === AND && filter.op === AND) {
+    return {
+      op: AND,
+      filters: combine(existingFilter.filters, filter.filters)
+    };
+  }
+  if (existingFilter.op === AND) {
+    const filters = replaceOrInsert(existingFilter.filters, filter);
+    return filters.length > 1 ? { op: AND, filters } : filters[0];
+  }
+  if (filter.op === AND) {
+    return { op: AND, filters: filter.filters.concat(existingFilter) };
+  }
+  if (filterEquals(existingFilter, filter, true)) {
+    return filter;
+  }
+  if (canMerge(existingFilter, filter)) {
+    return merge(existingFilter, filter);
+  }
+  return { op: combineWith, filters: [existingFilter, filter] };
+};
+var includesNoValues = (filter) => {
+  if (!filter) {
+    return false;
+  }
+  if ((0, import_vuu_utils4.isInFilter)(filter) && filter.values.length === 0) {
+    return true;
+  }
+  return (0, import_vuu_utils4.isAndFilter)(filter) && filter.filters.some((f) => includesNoValues(f));
+};
+var includesAllValues = (filter) => {
+  if (!filter) {
+    return false;
+  }
+  if (filter.op === STARTS_WITH && filter.value === "") {
+    return true;
+  }
+  return filter.op === STARTS_WITH && filter.value === "";
+};
+var replaceOrInsert = (filters, filter) => {
+  return filters.concat(filter);
+};
+var merge = (f1, f2) => {
+  if (includesNoValues(f2)) {
+    return f2;
+  }
+  if ((0, import_vuu_utils4.isInFilter)(f1) && (0, import_vuu_utils4.isInFilter)(f2)) {
+    return {
+      ...f1,
+      values: [
+        ...f1.values,
+        ...f2.values.filter(
+          (v) => !f1.values.includes(v)
+        )
+      ]
+    };
+  } else if ((0, import_vuu_utils4.isInFilter)(f1) && f2.op === EQUALS) {
+    return {
+      ...f1,
+      // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+      // @ts-ignore
+      values: f1.values.concat([f2.value])
+    };
+  } else if (f1.op === EQUALS && f2.op === EQUALS) {
+    return {
+      column: f1.column,
+      op: IN,
+      // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+      // @ts-ignore
+      values: [f1.value, f2.value]
+    };
+  }
+  return f2;
+};
+var combine = (existingFilters, replacementFilters) => {
+  const equivalentType = ({ op: t1 }, { op: t2 }) => {
+    return t1 === t2 || t1[0] === t2[0];
+  };
+  const replaces = (existingFilter, replacementFilter) => {
+    return existingFilter.column === replacementFilter.column && equivalentType(existingFilter, replacementFilter);
+  };
+  const stillApplicable = (existingFilter) => replacementFilters.some(
+    (replacementFilter) => replaces(existingFilter, replacementFilter)
+  ) === false;
+  return existingFilters.filter(stillApplicable).concat(replacementFilters);
+};
+var removeFilter = (sourceFilter, filterToRemove) => {
+  if (filterEquals(sourceFilter, filterToRemove, true)) {
+    return null;
+  }
+  if (sourceFilter.op !== AND) {
+    throw Error(
+      `removeFilter cannot remove ${JSON.stringify(
+        filterToRemove
+      )} from ${JSON.stringify(sourceFilter)}`
+    );
+  }
+  const filters = sourceFilter.filters.filter(
+    (f) => !filterEquals(f, filterToRemove)
+  );
+  return filters.length > 0 ? { type: AND, filters } : null;
+};
+var splitFilterOnColumn = (columnName, filter) => {
+  if (!filter) {
+    return [void 0, void 0];
+  }
+  if (filter.column === columnName) {
+    return [filter, void 0];
+  }
+  if (filter.op !== AND) {
+    return [void 0, filter];
+  }
+  const [[columnFilter = void 0], filters] = (0, import_vuu_utils4.partition)(
+    filter.filters,
+    (f) => f.column === columnName
+  );
+  return filters.length === 1 ? [columnFilter, filters[0]] : [columnFilter, { op: AND, filters }];
 };
-
-// src/filter-toolbar/FilterToolbar.tsx
-var import_salt_lab8 = require("@heswell/salt-lab");
-var import_classnames2 = __toESM(require_classnames(), 1);
-
-// src/filter-toolbar/useFilterToolbar.tsx
-var import_vuu_utils5 = require("@vuu-ui/vuu-utils");
-var import_salt_lab7 = require("@heswell/salt-lab");
-
-// src/filter-toolbar/FilterDropdown.tsx
-var import_salt_lab5 = require("@heswell/salt-lab");
-var import_react9 = require("react");
-var import_jsx_runtime8 = require("react/jsx-runtime");
-var isString = (s) => typeof s === "string";
-var stripQuotes = (selected) => {
-  if (isString(selected)) {
-    if (selected.startsWith('"') && selected.endsWith('"')) {
-      return selected.slice(1, -1);
-    } else {
-      return selected;
-    }
-  } else {
-    return selected.map(stripQuotes);
+var overrideColName = (filter, column) => {
+  if ((0, import_vuu_utils4.isMultiClauseFilter)(filter)) {
+    return {
+      op: filter.op,
+      filters: filter.filters.map((f) => overrideColName(f, column))
+    };
   }
+  return { ...filter, column };
 };
-var FilterDropdown = ({
-  column,
-  selected: selectedProp,
-  suggestionProvider,
-  ...props
-}) => {
-  const selected = selectedProp != null ? stripQuotes(selectedProp) : void 0;
-  const initialValues = Array.isArray(selected) ? selected : selected != null ? [selected] : [];
-  const [values, setValues] = (0, import_react9.useState)(initialValues);
-  console.log({ initialValues });
-  const handleOpenChange = (0, import_react9.useCallback)(
-    async (isOpen) => {
-      if (isOpen) {
-        const values2 = await suggestionProvider.getSuggestions("columnValue", {
-          columnName: column
-        });
-        console.log({ values: values2 });
-        setValues(values2.map((suggestion) => suggestion.label));
-      }
-    },
-    [column, suggestionProvider]
-  );
-  return /* @__PURE__ */ (0, import_jsx_runtime8.jsx)(
-    import_salt_lab5.Dropdown,
-    {
-      ...props,
-      onOpenChange: handleOpenChange,
-      selected,
-      source: values
-    }
-  );
+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;
+  }
 };
-
-// src/filter-toolbar/FilterDropdownMultiSelect.tsx
-var import_salt_lab6 = require("@heswell/salt-lab");
-var import_react10 = require("react");
-var import_jsx_runtime9 = require("react/jsx-runtime");
-var isString2 = (s) => typeof s === "string";
-var stripQuotes2 = (selected) => {
-  if (selected === void 0) {
+var removeFilterForColumn = (sourceFilter, column) => {
+  const colName = column.name;
+  if (!sourceFilter) {
     return void 0;
-  } else if (isString2(selected)) {
-    if (selected.startsWith('"') && selected.endsWith('"')) {
-      return selected.slice(1, -1);
-    } else {
-      return selected;
+  }
+  if (sourceFilter.column === colName) {
+    return void 0;
+  }
+  if ((0, import_vuu_utils4.isAndFilter)(sourceFilter) || (0, import_vuu_utils4.isOrFilter)(sourceFilter)) {
+    const { op } = sourceFilter;
+    const filters = sourceFilter.filters;
+    const otherColFilters = filters.filter((f) => f.column !== colName);
+    switch (otherColFilters.length) {
+      case 0:
+        return void 0;
+      case 1:
+        return otherColFilters[0];
+      default:
+        return { op, filters: otherColFilters };
     }
-  } else {
-    return selected.map(stripQuotes2);
   }
+  return sourceFilter;
 };
-var FilterDropdownMultiSelect = ({
-  column,
-  selected: selectedProp,
-  suggestionProvider,
-  ...props
-}) => {
-  const selected = stripQuotes2(selectedProp);
-  const initialValues = Array.isArray(selected) ? selected : selected != null ? [selected] : [];
-  const [values, setValues] = (0, import_react10.useState)(initialValues);
-  const handleOpenChange = (0, import_react10.useCallback)(
-    async (isOpen) => {
-      if (isOpen) {
-        const values2 = await suggestionProvider.getSuggestions("columnValue", {
-          columnName: column
-        });
-        console.log({ values: values2 });
-        setValues(values2.map((suggestion) => suggestion.label));
-      }
-    },
-    [column, suggestionProvider]
-  );
-  return /* @__PURE__ */ (0, import_jsx_runtime9.jsx)(
-    import_salt_lab6.Dropdown,
-    {
-      ...props,
-      onOpenChange: handleOpenChange,
-      selected,
-      selectionStrategy: "multiple",
-      source: values
-    }
-  );
+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;
 };
-
-// src/filter-toolbar/useFilterToolbar.tsx
-var import_jsx_runtime10 = require("react/jsx-runtime");
-var filterToControl = (filter, suggestionProvider) => {
-  if ((0, import_vuu_utils5.isNamedFilter)(filter)) {
-    return /* @__PURE__ */ (0, import_jsx_runtime10.jsx)(
-      import_salt_lab7.ToggleButton,
-      {
-        className: "vuuToggleButton",
-        toggled: true,
-        variant: "secondary",
-        children: filter.name
-      }
-    );
+var filterEquals = (f1, f2, strict = false) => {
+  if (!strict) {
+    return true;
   }
-  if ((0, import_vuu_utils5.isSingleValueFilter)(filter)) {
-    const { column, value } = filter;
-    return /* @__PURE__ */ (0, import_jsx_runtime10.jsx)(
-      import_salt_lab7.ToolbarField,
-      {
-        className: "vuuFilterDropdown",
-        label: column,
-        labelPlacement: "top",
-        children: /* @__PURE__ */ (0, import_jsx_runtime10.jsx)(
-          FilterDropdown,
-          {
-            column,
-            selected: value.toString(),
-            selectionStrategy: "default",
-            source: [value.toString()],
-            suggestionProvider,
-            style: { width: 100 }
-          }
-        )
-      },
-      column
-    );
+  if (f1 && f2 && canMerge(f1, f2)) {
+    return f1.op === f2.op && ((0, import_vuu_utils4.isSingleValueFilter)(f1) && (0, import_vuu_utils4.isSingleValueFilter)(f2) && f1.value === f2.value || (0, import_vuu_utils4.isMultiValueFilter)(f1) && (0, import_vuu_utils4.isMultiValueFilter)(f2) && sameValues(f1.values, f2.values));
   }
-  if ((0, import_vuu_utils5.isMultiValueFilter)(filter)) {
-    const values = filter.values.map((v) => v.toString());
-    return /* @__PURE__ */ (0, import_jsx_runtime10.jsx)(
-      import_salt_lab7.ToolbarField,
-      {
-        className: "vuuFilterDropdown",
-        label: filter.column,
-        labelPlacement: "top",
-        children: /* @__PURE__ */ (0, import_jsx_runtime10.jsx)(
-          FilterDropdownMultiSelect,
-          {
-            column: filter.column,
-            selected: values,
-            source: values,
-            suggestionProvider,
-            style: { width: 100 }
-          }
-        )
-      },
-      filter.column
-    );
+  return false;
+};
+var updateFilter = (filter, newFilter, mode) => {
+  if (filter && newFilter) {
+    if (mode === "replace") {
+      return newFilter;
+    }
+    if (filter.op === "and") {
+      return {
+        ...filter,
+        filters: filter.filters.concat(newFilter)
+      };
+    }
+    const { column: columnName } = newFilter;
+    if (columnName) {
+      const existingClause = newFilter.column ? (0, import_vuu_utils4.extractFilterForColumn)(filter, columnName) : void 0;
+      if (existingClause && columnName) {
+        const result = removeFilterForColumn(filter, { name: columnName });
+        return updateFilter(result, newFilter, "add");
+      }
+    }
+    return {
+      op: "and",
+      filters: [filter, newFilter]
+    };
   }
-  return filter.filters.map(
-    (filter2) => filterToControl(filter2, suggestionProvider)
-  );
+  if (newFilter) {
+    return newFilter;
+  }
+  return filter;
 };
-var useFilterToolbar = ({
-  filter,
-  suggestionProvider
-}) => {
-  if (filter) {
-    return filterToControl(filter, suggestionProvider);
+var getTypeaheadFilter = (column, filterValues, isStartsWithFilter) => {
+  if (filterValues.length === 0) {
+    return void 0;
   }
-  return [];
+  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}"`)
+  };
 };
-
-// src/filter-toolbar/FilterToolbar.tsx
-var import_jsx_runtime11 = require("react/jsx-runtime");
-var FilterToolbar = ({
-  className,
-  filter,
-  suggestionProvider,
-  ...props
-}) => {
-  console.log(`FilterToolbar ${JSON.stringify(filter, null, 2)}`);
-  const toolbarItems = useFilterToolbar({ filter, suggestionProvider });
-  return /* @__PURE__ */ (0, import_jsx_runtime11.jsx)(import_salt_lab8.Toolbar, { className: (0, import_classnames2.default)("vuuFilterToolbar", className), ...props, children: toolbarItems });
+var getNumericFilter = (column, operator, value) => {
+  if (operator === void 0)
+    return void 0;
+  if (value === void 0 || isNaN(value))
+    return void 0;
+  return { column, op: operator, value };
 };
 /*! Bundled license information: