@vuu-ui/vuu-table 0.7.6-debug → 0.8.0-debug

package/esm/index.js

@@ -1,3 +1,76 @@
+var __accessCheck = (obj, member, msg) => {
+  if (!member.has(obj))
+    throw TypeError("Cannot " + msg);
+};
+var __privateGet = (obj, member, getter) => {
+  __accessCheck(obj, member, "read from private field");
+  return getter ? getter.call(obj) : member.get(obj);
+};
+var __privateAdd = (obj, member, value) => {
+  if (member.has(obj))
+    throw TypeError("Cannot add the same private member more than once");
+  member instanceof WeakSet ? member.add(obj) : member.set(obj, value);
+};
+var __privateSet = (obj, member, value, setter) => {
+  __accessCheck(obj, member, "write to private field");
+  setter ? setter.call(obj, value) : member.set(obj, value);
+  return value;
+};
+
+// src/ColumnResizer.tsx
+import { useCallback, useRef } from "react";
+import { jsx } from "react/jsx-runtime";
+var NOOP = () => void 0;
+var baseClass = "vuuColumnResizer";
+var ColumnResizer = ({
+  onDrag,
+  onDragEnd = NOOP,
+  onDragStart = NOOP
+}) => {
+  const position = useRef(0);
+  const onMouseMove = useCallback(
+    (e) => {
+      if (e.stopPropagation) {
+        e.stopPropagation();
+      }
+      if (e.preventDefault) {
+        e.preventDefault();
+      }
+      const x = Math.round(e.clientX);
+      const moveBy = x - position.current;
+      position.current = x;
+      if (moveBy !== 0) {
+        onDrag(e, moveBy);
+      }
+    },
+    [onDrag]
+  );
+  const onMouseUp = useCallback(
+    (e) => {
+      window.removeEventListener("mouseup", onMouseUp);
+      window.removeEventListener("mousemove", onMouseMove);
+      onDragEnd(e);
+    },
+    [onDragEnd, onMouseMove]
+  );
+  const handleMouseDown = useCallback(
+    (e) => {
+      onDragStart(e);
+      position.current = Math.round(e.clientX);
+      window.addEventListener("mouseup", onMouseUp);
+      window.addEventListener("mousemove", onMouseMove);
+      if (e.stopPropagation) {
+        e.stopPropagation();
+      }
+      if (e.preventDefault) {
+        e.preventDefault();
+      }
+    },
+    [onDragStart, onMouseMove, onMouseUp]
+  );
+  return /* @__PURE__ */ jsx("div", { className: baseClass, "data-align": "end", onMouseDown: handleMouseDown });
+};
+
 // src/context-menu/buildContextMenuDescriptors.ts
 import { isNumericColumn } from "@vuu-ui/vuu-utils";
 var buildContextMenuDescriptors = (dataSource) => (location, options) => {
@@ -16,6 +89,12 @@ var buildContextMenuDescriptors = (dataSource) => (location, options) => {
       ...buildAggregationMenuItems(options, dataSource)
     );
     descriptors.push(...buildColumnDisplayMenuItems(options));
+    descriptors.push({
+      action: "column-settings",
+      icon: "cog",
+      label: `Column Settings`,
+      options
+    });
   } else if (location === "filter") {
     const { column, filter } = options;
     const colIsOnlyFilter = (filter == null ? void 0 : filter.column) === (column == null ? void 0 : column.name);
@@ -217,7 +296,7 @@ function buildGroupMenuItems(options, { groupBy }) {
 }
 
 // src/context-menu/useTableContextMenu.ts
-import { removeColumnFromFilter } from "@vuu-ui/vuu-filters";
+import { removeColumnFromFilter } from "@vuu-ui/vuu-utils";
 import {
   addGroupColumn,
   addSortColumn,
@@ -289,6 +368,8 @@ var useTableContextMenu = ({
           return onPersistentColumnOperation({ type: "pinColumn", column, pin: "right" }), true;
         case "column-unpin":
           return onPersistentColumnOperation({ type: "pinColumn", column, pin: void 0 }), true;
+        case "column-settings":
+          return onPersistentColumnOperation({ type: "columnSettings", column }), true;
         default:
       }
     }
@@ -321,7 +402,7 @@ import {
   notHidden
 } from "@vuu-ui/vuu-utils";
 import cx2 from "classnames";
-import { memo as memo2, useCallback as useCallback3 } from "react";
+import { memo as memo2, useCallback as useCallback4 } from "react";
 
 // src/TableCell.tsx
 import { getColumnStyle, metadataKeys } from "@vuu-ui/vuu-utils";
@@ -329,11 +410,11 @@ import { EditableLabel } from "@heswell/salt-lab";
 import cx from "classnames";
 import {
   memo,
-  useCallback,
-  useRef,
+  useCallback as useCallback2,
+  useRef as useRef2,
   useState
 } from "react";
-import { jsx } from "react/jsx-runtime";
+import { jsx as jsx2 } from "react/jsx-runtime";
 var { KEY } = metadataKeys;
 var TableCell = memo(
   ({
@@ -343,7 +424,7 @@ var TableCell = memo(
     onClick,
     row
   }) => {
-    const labelFieldRef = useRef(null);
+    const labelFieldRef = useRef2(null);
     const {
       align,
       CellRenderer,
@@ -365,7 +446,7 @@ var TableCell = memo(
         setEditing(true);
       }
     };
-    const handleClick = useCallback(
+    const handleClick = useCallback2(
       (evt) => {
         onClick == null ? void 0 : onClick(evt, column);
       },
@@ -394,7 +475,7 @@ var TableCell = memo(
       "vuuTableCell-resizing": resizing
     }) || void 0;
     const style = getColumnStyle(column);
-    return editable ? /* @__PURE__ */ jsx(
+    return editable ? /* @__PURE__ */ jsx2(
       "div",
       {
         className,
@@ -402,7 +483,7 @@ var TableCell = memo(
         role: "cell",
         style,
         onKeyDown: handleTitleKeyDown,
-        children: /* @__PURE__ */ jsx(
+        children: /* @__PURE__ */ jsx2(
           EditableLabel,
           {
             editing,
@@ -418,14 +499,14 @@ var TableCell = memo(
           "title"
         )
       }
-    ) : /* @__PURE__ */ jsx(
+    ) : /* @__PURE__ */ jsx2(
       "div",
       {
         className,
         role: "cell",
         style,
         onClick: handleClick,
-        children: CellRenderer ? /* @__PURE__ */ jsx(CellRenderer, { column, columnMap, row }) : value
+        children: CellRenderer ? /* @__PURE__ */ jsx2(CellRenderer, { column, columnMap, row }) : value
       }
     );
   },
@@ -437,26 +518,18 @@ function cellValuesAreEqual(prev, next) {
 }
 
 // src/TableGroupCell.tsx
-import { getColumnStyle as getColumnStyle2, metadataKeys as metadataKeys2 } from "@vuu-ui/vuu-utils";
-import { useCallback as useCallback2 } from "react";
-import { jsx as jsx2, jsxs } from "react/jsx-runtime";
-var { DEPTH, IS_LEAF } = metadataKeys2;
-var getGroupValueAndOffset = (columns, row) => {
-  const { [DEPTH]: depth, [IS_LEAF]: isLeaf } = row;
-  if (isLeaf || depth > columns.length) {
-    return [null, depth === null ? 0 : Math.max(0, depth - 1)];
-  } else if (depth === 0) {
-    return ["$root", 0];
-  } else {
-    const { key, valueFormatter } = columns[depth - 1];
-    const value = valueFormatter(row[key]);
-    return [value, depth - 1];
-  }
-};
+import {
+  getColumnStyle as getColumnStyle2,
+  getGroupValueAndOffset,
+  metadataKeys as metadataKeys2
+} from "@vuu-ui/vuu-utils";
+import { useCallback as useCallback3 } from "react";
+import { jsx as jsx3, jsxs } from "react/jsx-runtime";
+var { IS_LEAF } = metadataKeys2;
 var TableGroupCell = ({ column, onClick, row }) => {
   const { columns } = column;
   const [value, offset] = getGroupValueAndOffset(columns, row);
-  const handleClick = useCallback2(
+  const handleClick = useCallback3(
     (evt) => {
       onClick == null ? void 0 : onClick(evt, column);
     },
@@ -464,7 +537,7 @@ var TableGroupCell = ({ column, onClick, row }) => {
   );
   const style = getColumnStyle2(column);
   const isLeaf = row[IS_LEAF];
-  const spacers = Array(offset).fill(0).map((n, i) => /* @__PURE__ */ jsx2("span", { className: "vuuTableGroupCell-spacer" }, i));
+  const spacers = Array(offset).fill(0).map((n, i) => /* @__PURE__ */ jsx3("span", { className: "vuuTableGroupCell-spacer" }, i));
   return /* @__PURE__ */ jsxs(
     "div",
     {
@@ -474,15 +547,15 @@ var TableGroupCell = ({ column, onClick, row }) => {
       style,
       children: [
         spacers,
-        isLeaf ? null : /* @__PURE__ */ jsx2("span", { className: "vuuTableGroupCell-toggle", "data-icon": "triangle-right" }),
-        /* @__PURE__ */ jsx2("span", { children: value })
+        isLeaf ? null : /* @__PURE__ */ jsx3("span", { className: "vuuTableGroupCell-toggle", "data-icon": "triangle-right" }),
+        /* @__PURE__ */ jsx3("span", { children: value })
       ]
     }
   );
 };
 
 // src/TableRow.tsx
-import { jsx as jsx3, jsxs as jsxs2 } from "react/jsx-runtime";
+import { jsx as jsx4, jsxs as jsxs2 } from "react/jsx-runtime";
 var { IDX, IS_EXPANDED, SELECTED } = metadataKeys3;
 var classBase = "vuuTableRow";
 var TableRow = memo2(function Row({
@@ -504,7 +577,7 @@ var TableRow = memo2(function Row({
     [`${classBase}-expanded`]: isExpanded,
     [`${classBase}-preSelected`]: isSelected === 2
   });
-  const handleRowClick = useCallback3(
+  const handleRowClick = useCallback4(
     (evt) => {
       const rangeSelect = evt.shiftKey;
       const keepExistingSelection = evt.ctrlKey || evt.metaKey;
@@ -512,7 +585,7 @@ var TableRow = memo2(function Row({
     },
     [onClick, row]
   );
-  const handleGroupCellClick = useCallback3(
+  const handleGroupCellClick = useCallback4(
     (evt, column) => {
       if (isGroupColumn(column) || isJsonGroup(column, row)) {
         evt.stopPropagation();
@@ -533,12 +606,12 @@ var TableRow = memo2(function Row({
         transform: `translate3d(0px, ${offset}px, 0px)`
       },
       children: [
-        virtualColSpan > 0 ? /* @__PURE__ */ jsx3("div", { role: "cell", style: { width: virtualColSpan } }) : null,
+        virtualColSpan > 0 ? /* @__PURE__ */ jsx4("div", { role: "cell", style: { width: virtualColSpan } }) : null,
         columns.filter(notHidden).map((column) => {
           const isGroup = isGroupColumn(column);
           const isJsonCell = isJsonColumn(column);
           const Cell = isGroup ? TableGroupCell : TableCell;
-          return /* @__PURE__ */ jsx3(
+          return /* @__PURE__ */ jsx4(
             Cell,
             {
               column,
@@ -558,60 +631,6 @@ var TableRow = memo2(function Row({
 import cx3 from "classnames";
 import { useRef as useRef4 } from "react";
 
-// src/ColumnResizer.tsx
-import { useCallback as useCallback4, useRef as useRef2 } from "react";
-import { jsx as jsx4 } from "react/jsx-runtime";
-var NOOP = () => void 0;
-var baseClass = "vuuColumnResizer";
-var ColumnResizer = ({
-  onDrag,
-  onDragEnd = NOOP,
-  onDragStart = NOOP
-}) => {
-  const position = useRef2(0);
-  const onMouseMove = useCallback4(
-    (e) => {
-      if (e.stopPropagation) {
-        e.stopPropagation();
-      }
-      if (e.preventDefault) {
-        e.preventDefault();
-      }
-      const x = Math.round(e.clientX);
-      const moveBy = x - position.current;
-      position.current = x;
-      if (moveBy !== 0) {
-        onDrag(e, moveBy);
-      }
-    },
-    [onDrag]
-  );
-  const onMouseUp = useCallback4(
-    (e) => {
-      window.removeEventListener("mouseup", onMouseUp);
-      window.removeEventListener("mousemove", onMouseMove);
-      onDragEnd(e);
-    },
-    [onDragEnd, onMouseMove]
-  );
-  const handleMouseDown = useCallback4(
-    (e) => {
-      onDragStart(e);
-      position.current = Math.round(e.clientX);
-      window.addEventListener("mouseup", onMouseUp);
-      window.addEventListener("mousemove", onMouseMove);
-      if (e.stopPropagation) {
-        e.stopPropagation();
-      }
-      if (e.preventDefault) {
-        e.preventDefault();
-      }
-    },
-    [onDragStart, onMouseMove, onMouseUp]
-  );
-  return /* @__PURE__ */ jsx4("div", { className: baseClass, "data-align": "end", onMouseDown: handleMouseDown });
-};
-
 // src/useTableColumnResize.tsx
 import { useCallback as useCallback5, useRef as useRef3 } from "react";
 var useTableColumnResize = ({
@@ -624,6 +643,7 @@ var useTableColumnResize = ({
   const { name } = column;
   const handleResizeStart = useCallback5(() => {
     if (onResize && rootRef.current) {
+      console.log("handleResizeStart");
       const { width } = rootRef.current.getBoundingClientRect();
       widthRef.current = Math.round(width);
       isResizing.current = true;
@@ -759,204 +779,3261 @@ var FilterIndicator = ({ column, filter }) => {
       "data-icon": "filter",
       onClick: handleClick
     }
-  );
+  );
+};
+
+// src/TableHeaderCell.tsx
+import { jsx as jsx8, jsxs as jsxs5 } from "react/jsx-runtime";
+var classBase4 = "vuuTable-headerCell";
+var TableHeaderCell = ({
+  column,
+  className: classNameProp,
+  onClick,
+  onDragStart,
+  onResize,
+  ...props
+}) => {
+  const rootRef = useRef5(null);
+  const { isResizing, ...resizeProps } = useTableColumnResize({
+    column,
+    onResize,
+    rootRef
+  });
+  const showContextMenu = useContextMenu2();
+  const dragTimerRef = useRef5(null);
+  const handleContextMenu = (e) => {
+    showContextMenu(e, "header", { column });
+  };
+  const handleClick = useCallback7(
+    (evt) => !isResizing && (onClick == null ? void 0 : onClick(evt)),
+    [isResizing, onClick]
+  );
+  const handleMouseDown = useCallback7(
+    (evt) => {
+      dragTimerRef.current = window.setTimeout(() => {
+        onDragStart == null ? void 0 : onDragStart(evt);
+        dragTimerRef.current = null;
+      }, 500);
+    },
+    [onDragStart]
+  );
+  const handleMouseUp = useCallback7(() => {
+    if (dragTimerRef.current !== null) {
+      window.clearTimeout(dragTimerRef.current);
+      dragTimerRef.current = null;
+    }
+  }, []);
+  const className = cx6(classBase4, classNameProp, {
+    vuuPinFloating: column.pin === "floating",
+    vuuPinLeft: column.pin === "left",
+    vuuPinRight: column.pin === "right",
+    vuuEndPin: column.endPin,
+    [`${classBase4}-resizing`]: column.resizing,
+    [`${classBase4}-right`]: column.align === "right"
+  });
+  return /* @__PURE__ */ jsx8(
+    "div",
+    {
+      className,
+      ...props,
+      onClick: handleClick,
+      onContextMenu: handleContextMenu,
+      onMouseDown: handleMouseDown,
+      onMouseUp: handleMouseUp,
+      ref: rootRef,
+      children: /* @__PURE__ */ jsxs5("div", { className: `${classBase4}-inner`, children: [
+        /* @__PURE__ */ jsx8(FilterIndicator, { column }),
+        /* @__PURE__ */ jsx8("div", { className: `${classBase4}-label`, children: column.label }),
+        /* @__PURE__ */ jsx8(SortIndicator, { sorted: column.sorted }),
+        column.resizeable !== false ? /* @__PURE__ */ jsx8(ColumnResizer, { ...resizeProps }) : null
+      ] })
+    }
+  );
+};
+
+// src/RowBasedTable.tsx
+import { jsx as jsx9, jsxs as jsxs6 } from "react/jsx-runtime";
+var classBase5 = "vuuTable";
+var { RENDER_IDX } = metadataKeys4;
+var RowBasedTable = ({
+  columns,
+  columnsWithinViewport,
+  data,
+  getRowOffset,
+  headings,
+  onColumnResize,
+  onHeaderCellDragStart,
+  onContextMenu,
+  onRemoveColumnFromGroupBy,
+  onRowClick,
+  onSort,
+  onToggleGroup,
+  tableId,
+  virtualColSpan = 0,
+  rowCount
+}) => {
+  const handleDragStart = useCallback8(
+    (evt) => {
+      onHeaderCellDragStart == null ? void 0 : onHeaderCellDragStart(evt);
+    },
+    [onHeaderCellDragStart]
+  );
+  const visibleColumns = useMemo(() => {
+    return columns.filter(notHidden2);
+  }, [columns]);
+  const columnMap = useMemo(() => buildColumnMap(columns), [columns]);
+  const handleHeaderClick = useCallback8(
+    (evt) => {
+      var _a;
+      const targetElement = evt.target;
+      const headerCell = targetElement.closest(
+        ".vuuTable-headerCell"
+      );
+      const colIdx = parseInt((_a = headerCell == null ? void 0 : headerCell.dataset.idx) != null ? _a : "-1");
+      const column = visibleColumnAtIndex(columns, colIdx);
+      const isAdditive = evt.shiftKey;
+      column && onSort(column, isAdditive);
+    },
+    [columns, onSort]
+  );
+  return /* @__PURE__ */ jsxs6("div", { "aria-rowcount": rowCount, className: `${classBase5}-table`, role: "table", children: [
+    /* @__PURE__ */ jsxs6("div", { className: `${classBase5}-headers`, role: "rowGroup", children: [
+      headings.map((colHeaders, i) => /* @__PURE__ */ jsx9("div", { className: "vuuTable-heading", children: colHeaders.map(({ label, width }, j) => /* @__PURE__ */ jsx9("div", { className: "vuuTable-headingCell", style: { width }, children: label }, j)) }, i)),
+      /* @__PURE__ */ jsx9("div", { role: "row", children: visibleColumns.map((column, i) => {
+        const style = getColumnStyle3(column);
+        return isGroupColumn2(column) ? /* @__PURE__ */ jsx9(
+          TableGroupHeaderCell,
+          {
+            column,
+            "data-idx": i,
+            onRemoveColumn: onRemoveColumnFromGroupBy,
+            onResize: onColumnResize,
+            role: "columnHeader",
+            style
+          },
+          i
+        ) : /* @__PURE__ */ jsx9(
+          TableHeaderCell,
+          {
+            column,
+            "data-idx": i,
+            id: `${tableId}-${i}`,
+            onClick: handleHeaderClick,
+            onDragStart: handleDragStart,
+            onResize: onColumnResize,
+            role: "columnHeader",
+            style
+          },
+          i
+        );
+      }) })
+    ] }),
+    /* @__PURE__ */ jsx9(
+      "div",
+      {
+        className: `${classBase5}-body`,
+        onContextMenu,
+        role: "rowGroup",
+        children: data == null ? void 0 : data.map((row) => /* @__PURE__ */ jsx9(
+          TableRow,
+          {
+            columnMap,
+            columns: columnsWithinViewport,
+            offset: getRowOffset(row),
+            onClick: onRowClick,
+            virtualColSpan,
+            onToggleGroup,
+            row
+          },
+          row[RENDER_IDX]
+        ))
+      }
+    )
+  ] });
+};
+
+// src/useTable.ts
+import { useContextMenu as usePopupContextMenu } from "@vuu-ui/vuu-popups";
+import {
+  applySort,
+  buildColumnMap as buildColumnMap2,
+  isJsonGroup as isJsonGroup2,
+  metadataKeys as metadataKeys10,
+  moveItem as moveItem2
+} from "@vuu-ui/vuu-utils";
+import {
+  useCallback as useCallback24,
+  useEffect as useEffect9,
+  useMemo as useMemo8,
+  useRef as useRef16,
+  useState as useState9
+} from "react";
+
+// ../vuu-data-react/src/hooks/useDataSource.ts
+import { getFullRange, metadataKeys as metadataKeys5, WindowRange } from "@vuu-ui/vuu-utils";
+import { useCallback as useCallback9, useEffect, useMemo as useMemo2, useRef as useRef6, useState as useState2 } from "react";
+var { SELECTED: SELECTED2 } = metadataKeys5;
+
+// ../vuu-data-react/src/hooks/useServerConnectionStatus.ts
+import { useCallback as useCallback10, useEffect as useEffect2, useState as useState3 } from "react";
+import { ConnectionManager } from "@vuu-ui/vuu-data";
+
+// ../vuu-data-react/src/hooks/useServerConnectionQuality.ts
+import { useCallback as useCallback11, useEffect as useEffect3, useState as useState4 } from "react";
+import { ConnectionManager as ConnectionManager2 } from "@vuu-ui/vuu-data";
+
+// ../vuu-data-react/src/hooks/useTypeaheadSuggestions.ts
+import { useCallback as useCallback12 } from "react";
+import { makeRpcCall } from "@vuu-ui/vuu-data";
+
+// ../../node_modules/@lezer/common/dist/index.js
+var DefaultBufferLength = 1024;
+var nextPropID = 0;
+var Range = class {
+  constructor(from, to) {
+    this.from = from;
+    this.to = to;
+  }
+};
+var NodeProp = class {
+  /// Create a new node prop type.
+  constructor(config = {}) {
+    this.id = nextPropID++;
+    this.perNode = !!config.perNode;
+    this.deserialize = config.deserialize || (() => {
+      throw new Error("This node type doesn't define a deserialize function");
+    });
+  }
+  /// This is meant to be used with
+  /// [`NodeSet.extend`](#common.NodeSet.extend) or
+  /// [`LRParser.configure`](#lr.ParserConfig.props) to compute
+  /// prop values for each node type in the set. Takes a [match
+  /// object](#common.NodeType^match) or function that returns undefined
+  /// if the node type doesn't get this prop, and the prop's value if
+  /// it does.
+  add(match) {
+    if (this.perNode)
+      throw new RangeError("Can't add per-node props to node types");
+    if (typeof match != "function")
+      match = NodeType.match(match);
+    return (type) => {
+      let result = match(type);
+      return result === void 0 ? null : [this, result];
+    };
+  }
+};
+NodeProp.closedBy = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.openedBy = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.group = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.contextHash = new NodeProp({ perNode: true });
+NodeProp.lookAhead = new NodeProp({ perNode: true });
+NodeProp.mounted = new NodeProp({ perNode: true });
+var noProps = /* @__PURE__ */ Object.create(null);
+var NodeType = class {
+  /// @internal
+  constructor(name, props, id, flags = 0) {
+    this.name = name;
+    this.props = props;
+    this.id = id;
+    this.flags = flags;
+  }
+  /// Define a node type.
+  static define(spec) {
+    let props = spec.props && spec.props.length ? /* @__PURE__ */ Object.create(null) : noProps;
+    let flags = (spec.top ? 1 : 0) | (spec.skipped ? 2 : 0) | (spec.error ? 4 : 0) | (spec.name == null ? 8 : 0);
+    let type = new NodeType(spec.name || "", props, spec.id, flags);
+    if (spec.props)
+      for (let src of spec.props) {
+        if (!Array.isArray(src))
+          src = src(type);
+        if (src) {
+          if (src[0].perNode)
+            throw new RangeError("Can't store a per-node prop on a node type");
+          props[src[0].id] = src[1];
+        }
+      }
+    return type;
+  }
+  /// Retrieves a node prop for this type. Will return `undefined` if
+  /// the prop isn't present on this node.
+  prop(prop) {
+    return this.props[prop.id];
+  }
+  /// True when this is the top node of a grammar.
+  get isTop() {
+    return (this.flags & 1) > 0;
+  }
+  /// True when this node is produced by a skip rule.
+  get isSkipped() {
+    return (this.flags & 2) > 0;
+  }
+  /// Indicates whether this is an error node.
+  get isError() {
+    return (this.flags & 4) > 0;
+  }
+  /// When true, this node type doesn't correspond to a user-declared
+  /// named node, for example because it is used to cache repetition.
+  get isAnonymous() {
+    return (this.flags & 8) > 0;
+  }
+  /// Returns true when this node's name or one of its
+  /// [groups](#common.NodeProp^group) matches the given string.
+  is(name) {
+    if (typeof name == "string") {
+      if (this.name == name)
+        return true;
+      let group = this.prop(NodeProp.group);
+      return group ? group.indexOf(name) > -1 : false;
+    }
+    return this.id == name;
+  }
+  /// Create a function from node types to arbitrary values by
+  /// specifying an object whose property names are node or
+  /// [group](#common.NodeProp^group) names. Often useful with
+  /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple
+  /// names, separated by spaces, in a single property name to map
+  /// multiple node names to a single value.
+  static match(map) {
+    let direct = /* @__PURE__ */ Object.create(null);
+    for (let prop in map)
+      for (let name of prop.split(" "))
+        direct[name] = map[prop];
+    return (node) => {
+      for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {
+        let found = direct[i < 0 ? node.name : groups[i]];
+        if (found)
+          return found;
+      }
+    };
+  }
+};
+NodeType.none = new NodeType(
+  "",
+  /* @__PURE__ */ Object.create(null),
+  0,
+  8
+  /* NodeFlag.Anonymous */
+);
+var NodeSet = class {
+  /// Create a set with the given types. The `id` property of each
+  /// type should correspond to its position within the array.
+  constructor(types) {
+    this.types = types;
+    for (let i = 0; i < types.length; i++)
+      if (types[i].id != i)
+        throw new RangeError("Node type ids should correspond to array positions when creating a node set");
+  }
+  /// Create a copy of this set with some node properties added. The
+  /// arguments to this method can be created with
+  /// [`NodeProp.add`](#common.NodeProp.add).
+  extend(...props) {
+    let newTypes = [];
+    for (let type of this.types) {
+      let newProps = null;
+      for (let source of props) {
+        let add = source(type);
+        if (add) {
+          if (!newProps)
+            newProps = Object.assign({}, type.props);
+          newProps[add[0].id] = add[1];
+        }
+      }
+      newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);
+    }
+    return new NodeSet(newTypes);
+  }
+};
+var CachedNode = /* @__PURE__ */ new WeakMap();
+var CachedInnerNode = /* @__PURE__ */ new WeakMap();
+var IterMode;
+(function(IterMode2) {
+  IterMode2[IterMode2["ExcludeBuffers"] = 1] = "ExcludeBuffers";
+  IterMode2[IterMode2["IncludeAnonymous"] = 2] = "IncludeAnonymous";
+  IterMode2[IterMode2["IgnoreMounts"] = 4] = "IgnoreMounts";
+  IterMode2[IterMode2["IgnoreOverlays"] = 8] = "IgnoreOverlays";
+})(IterMode || (IterMode = {}));
+var Tree = class {
+  /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).
+  constructor(type, children, positions, length, props) {
+    this.type = type;
+    this.children = children;
+    this.positions = positions;
+    this.length = length;
+    this.props = null;
+    if (props && props.length) {
+      this.props = /* @__PURE__ */ Object.create(null);
+      for (let [prop, value] of props)
+        this.props[typeof prop == "number" ? prop : prop.id] = value;
+    }
+  }
+  /// @internal
+  toString() {
+    let mounted = this.prop(NodeProp.mounted);
+    if (mounted && !mounted.overlay)
+      return mounted.tree.toString();
+    let children = "";
+    for (let ch of this.children) {
+      let str = ch.toString();
+      if (str) {
+        if (children)
+          children += ",";
+        children += str;
+      }
+    }
+    return !this.type.name ? children : (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (children.length ? "(" + children + ")" : "");
+  }
+  /// Get a [tree cursor](#common.TreeCursor) positioned at the top of
+  /// the tree. Mode can be used to [control](#common.IterMode) which
+  /// nodes the cursor visits.
+  cursor(mode = 0) {
+    return new TreeCursor(this.topNode, mode);
+  }
+  /// Get a [tree cursor](#common.TreeCursor) pointing into this tree
+  /// at the given position and side (see
+  /// [`moveTo`](#common.TreeCursor.moveTo).
+  cursorAt(pos, side = 0, mode = 0) {
+    let scope = CachedNode.get(this) || this.topNode;
+    let cursor = new TreeCursor(scope);
+    cursor.moveTo(pos, side);
+    CachedNode.set(this, cursor._tree);
+    return cursor;
+  }
+  /// Get a [syntax node](#common.SyntaxNode) object for the top of the
+  /// tree.
+  get topNode() {
+    return new TreeNode(this, 0, 0, null);
+  }
+  /// Get the [syntax node](#common.SyntaxNode) at the given position.
+  /// If `side` is -1, this will move into nodes that end at the
+  /// position. If 1, it'll move into nodes that start at the
+  /// position. With 0, it'll only enter nodes that cover the position
+  /// from both sides.
+  ///
+  /// Note that this will not enter
+  /// [overlays](#common.MountedTree.overlay), and you often want
+  /// [`resolveInner`](#common.Tree.resolveInner) instead.
+  resolve(pos, side = 0) {
+    let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);
+    CachedNode.set(this, node);
+    return node;
+  }
+  /// Like [`resolve`](#common.Tree.resolve), but will enter
+  /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node
+  /// pointing into the innermost overlaid tree at the given position
+  /// (with parent links going through all parent structure, including
+  /// the host trees).
+  resolveInner(pos, side = 0) {
+    let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);
+    CachedInnerNode.set(this, node);
+    return node;
+  }
+  /// Iterate over the tree and its children, calling `enter` for any
+  /// node that touches the `from`/`to` region (if given) before
+  /// running over such a node's children, and `leave` (if given) when
+  /// leaving the node. When `enter` returns `false`, that node will
+  /// not have its children iterated over (or `leave` called).
+  iterate(spec) {
+    let { enter, leave, from = 0, to = this.length } = spec;
+    let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;
+    for (let c = this.cursor(mode | IterMode.IncludeAnonymous); ; ) {
+      let entered = false;
+      if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {
+        if (c.firstChild())
+          continue;
+        entered = true;
+      }
+      for (; ; ) {
+        if (entered && leave && (anon || !c.type.isAnonymous))
+          leave(c);
+        if (c.nextSibling())
+          break;
+        if (!c.parent())
+          return;
+        entered = true;
+      }
+    }
+  }
+  /// Get the value of the given [node prop](#common.NodeProp) for this
+  /// node. Works with both per-node and per-type props.
+  prop(prop) {
+    return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : void 0;
+  }
+  /// Returns the node's [per-node props](#common.NodeProp.perNode) in a
+  /// format that can be passed to the [`Tree`](#common.Tree)
+  /// constructor.
+  get propValues() {
+    let result = [];
+    if (this.props)
+      for (let id in this.props)
+        result.push([+id, this.props[id]]);
+    return result;
+  }
+  /// Balance the direct children of this tree, producing a copy of
+  /// which may have children grouped into subtrees with type
+  /// [`NodeType.none`](#common.NodeType^none).
+  balance(config = {}) {
+    return this.children.length <= 8 ? this : balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));
+  }
+  /// Build a tree from a postfix-ordered buffer of node information,
+  /// or a cursor over such a buffer.
+  static build(data) {
+    return buildTree(data);
+  }
+};
+Tree.empty = new Tree(NodeType.none, [], [], 0);
+var FlatBufferCursor = class {
+  constructor(buffer, index) {
+    this.buffer = buffer;
+    this.index = index;
+  }
+  get id() {
+    return this.buffer[this.index - 4];
+  }
+  get start() {
+    return this.buffer[this.index - 3];
+  }
+  get end() {
+    return this.buffer[this.index - 2];
+  }
+  get size() {
+    return this.buffer[this.index - 1];
+  }
+  get pos() {
+    return this.index;
+  }
+  next() {
+    this.index -= 4;
+  }
+  fork() {
+    return new FlatBufferCursor(this.buffer, this.index);
+  }
+};
+var TreeBuffer = class {
+  /// Create a tree buffer.
+  constructor(buffer, length, set) {
+    this.buffer = buffer;
+    this.length = length;
+    this.set = set;
+  }
+  /// @internal
+  get type() {
+    return NodeType.none;
+  }
+  /// @internal
+  toString() {
+    let result = [];
+    for (let index = 0; index < this.buffer.length; ) {
+      result.push(this.childString(index));
+      index = this.buffer[index + 3];
+    }
+    return result.join(",");
+  }
+  /// @internal
+  childString(index) {
+    let id = this.buffer[index], endIndex = this.buffer[index + 3];
+    let type = this.set.types[id], result = type.name;
+    if (/\W/.test(result) && !type.isError)
+      result = JSON.stringify(result);
+    index += 4;
+    if (endIndex == index)
+      return result;
+    let children = [];
+    while (index < endIndex) {
+      children.push(this.childString(index));
+      index = this.buffer[index + 3];
+    }
+    return result + "(" + children.join(",") + ")";
+  }
+  /// @internal
+  findChild(startIndex, endIndex, dir, pos, side) {
+    let { buffer } = this, pick = -1;
+    for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {
+      if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {
+        pick = i;
+        if (dir > 0)
+          break;
+      }
+    }
+    return pick;
+  }
+  /// @internal
+  slice(startI, endI, from) {
+    let b = this.buffer;
+    let copy = new Uint16Array(endI - startI), len = 0;
+    for (let i = startI, j = 0; i < endI; ) {
+      copy[j++] = b[i++];
+      copy[j++] = b[i++] - from;
+      let to = copy[j++] = b[i++] - from;
+      copy[j++] = b[i++] - startI;
+      len = Math.max(len, to);
+    }
+    return new TreeBuffer(copy, len, this.set);
+  }
+};
+function checkSide(side, pos, from, to) {
+  switch (side) {
+    case -2:
+      return from < pos;
+    case -1:
+      return to >= pos && from < pos;
+    case 0:
+      return from < pos && to > pos;
+    case 1:
+      return from <= pos && to > pos;
+    case 2:
+      return to > pos;
+    case 4:
+      return true;
+  }
+}
+function enterUnfinishedNodesBefore(node, pos) {
+  let scan = node.childBefore(pos);
+  while (scan) {
+    let last = scan.lastChild;
+    if (!last || last.to != scan.to)
+      break;
+    if (last.type.isError && last.from == last.to) {
+      node = scan;
+      scan = last.prevSibling;
+    } else {
+      scan = last;
+    }
+  }
+  return node;
+}
+function resolveNode(node, pos, side, overlays) {
+  var _a;
+  while (node.from == node.to || (side < 1 ? node.from >= pos : node.from > pos) || (side > -1 ? node.to <= pos : node.to < pos)) {
+    let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;
+    if (!parent)
+      return node;
+    node = parent;
+  }
+  let mode = overlays ? 0 : IterMode.IgnoreOverlays;
+  if (overlays)
+    for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {
+      if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)
+        node = parent;
+    }
+  for (; ; ) {
+    let inner = node.enter(pos, side, mode);
+    if (!inner)
+      return node;
+    node = inner;
+  }
+}
+var TreeNode = class {
+  constructor(_tree, from, index, _parent) {
+    this._tree = _tree;
+    this.from = from;
+    this.index = index;
+    this._parent = _parent;
+  }
+  get type() {
+    return this._tree.type;
+  }
+  get name() {
+    return this._tree.type.name;
+  }
+  get to() {
+    return this.from + this._tree.length;
+  }
+  nextChild(i, dir, pos, side, mode = 0) {
+    for (let parent = this; ; ) {
+      for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {
+        let next = children[i], start = positions[i] + parent.from;
+        if (!checkSide(side, pos, start, start + next.length))
+          continue;
+        if (next instanceof TreeBuffer) {
+          if (mode & IterMode.ExcludeBuffers)
+            continue;
+          let index = next.findChild(0, next.buffer.length, dir, pos - start, side);
+          if (index > -1)
+            return new BufferNode(new BufferContext(parent, next, i, start), null, index);
+        } else if (mode & IterMode.IncludeAnonymous || (!next.type.isAnonymous || hasChild(next))) {
+          let mounted;
+          if (!(mode & IterMode.IgnoreMounts) && next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)
+            return new TreeNode(mounted.tree, start, i, parent);
+          let inner = new TreeNode(next, start, i, parent);
+          return mode & IterMode.IncludeAnonymous || !inner.type.isAnonymous ? inner : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);
+        }
+      }
+      if (mode & IterMode.IncludeAnonymous || !parent.type.isAnonymous)
+        return null;
+      if (parent.index >= 0)
+        i = parent.index + dir;
+      else
+        i = dir < 0 ? -1 : parent._parent._tree.children.length;
+      parent = parent._parent;
+      if (!parent)
+        return null;
+    }
+  }
+  get firstChild() {
+    return this.nextChild(
+      0,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get lastChild() {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  childAfter(pos) {
+    return this.nextChild(
+      0,
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  childBefore(pos) {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  enter(pos, side, mode = 0) {
+    let mounted;
+    if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {
+      let rPos = pos - this.from;
+      for (let { from, to } of mounted.overlay) {
+        if ((side > 0 ? from <= rPos : from < rPos) && (side < 0 ? to >= rPos : to > rPos))
+          return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);
+      }
+    }
+    return this.nextChild(0, 1, pos, side, mode);
+  }
+  nextSignificantParent() {
+    let val = this;
+    while (val.type.isAnonymous && val._parent)
+      val = val._parent;
+    return val;
+  }
+  get parent() {
+    return this._parent ? this._parent.nextSignificantParent() : null;
+  }
+  get nextSibling() {
+    return this._parent && this.index >= 0 ? this._parent.nextChild(
+      this.index + 1,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    ) : null;
+  }
+  get prevSibling() {
+    return this._parent && this.index >= 0 ? this._parent.nextChild(
+      this.index - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    ) : null;
+  }
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  get tree() {
+    return this._tree;
+  }
+  toTree() {
+    return this._tree;
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
+  }
+  getChild(type, before = null, after = null) {
+    let r = getChildren(this, type, before, after);
+    return r.length ? r[0] : null;
+  }
+  getChildren(type, before = null, after = null) {
+    return getChildren(this, type, before, after);
+  }
+  /// @internal
+  toString() {
+    return this._tree.toString();
+  }
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
+  }
+};
+function getChildren(node, type, before, after) {
+  let cur = node.cursor(), result = [];
+  if (!cur.firstChild())
+    return result;
+  if (before != null) {
+    while (!cur.type.is(before))
+      if (!cur.nextSibling())
+        return result;
+  }
+  for (; ; ) {
+    if (after != null && cur.type.is(after))
+      return result;
+    if (cur.type.is(type))
+      result.push(cur.node);
+    if (!cur.nextSibling())
+      return after == null ? result : [];
+  }
+}
+function matchNodeContext(node, context, i = context.length - 1) {
+  for (let p = node.parent; i >= 0; p = p.parent) {
+    if (!p)
+      return false;
+    if (!p.type.isAnonymous) {
+      if (context[i] && context[i] != p.name)
+        return false;
+      i--;
+    }
+  }
+  return true;
+}
+var BufferContext = class {
+  constructor(parent, buffer, index, start) {
+    this.parent = parent;
+    this.buffer = buffer;
+    this.index = index;
+    this.start = start;
+  }
+};
+var BufferNode = class {
+  get name() {
+    return this.type.name;
+  }
+  get from() {
+    return this.context.start + this.context.buffer.buffer[this.index + 1];
+  }
+  get to() {
+    return this.context.start + this.context.buffer.buffer[this.index + 2];
+  }
+  constructor(context, _parent, index) {
+    this.context = context;
+    this._parent = _parent;
+    this.index = index;
+    this.type = context.buffer.set.types[context.buffer.buffer[index]];
+  }
+  child(dir, pos, side) {
+    let { buffer } = this.context;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);
+    return index < 0 ? null : new BufferNode(this.context, this, index);
+  }
+  get firstChild() {
+    return this.child(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get lastChild() {
+    return this.child(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  childAfter(pos) {
+    return this.child(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  childBefore(pos) {
+    return this.child(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  enter(pos, side, mode = 0) {
+    if (mode & IterMode.ExcludeBuffers)
+      return null;
+    let { buffer } = this.context;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);
+    return index < 0 ? null : new BufferNode(this.context, this, index);
+  }
+  get parent() {
+    return this._parent || this.context.parent.nextSignificantParent();
+  }
+  externalSibling(dir) {
+    return this._parent ? null : this.context.parent.nextChild(
+      this.context.index + dir,
+      dir,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get nextSibling() {
+    let { buffer } = this.context;
+    let after = buffer.buffer[this.index + 3];
+    if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))
+      return new BufferNode(this.context, this._parent, after);
+    return this.externalSibling(1);
+  }
+  get prevSibling() {
+    let { buffer } = this.context;
+    let parentStart = this._parent ? this._parent.index + 4 : 0;
+    if (this.index == parentStart)
+      return this.externalSibling(-1);
+    return new BufferNode(this.context, this._parent, buffer.findChild(
+      parentStart,
+      this.index,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    ));
+  }
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  get tree() {
+    return null;
+  }
+  toTree() {
+    let children = [], positions = [];
+    let { buffer } = this.context;
+    let startI = this.index + 4, endI = buffer.buffer[this.index + 3];
+    if (endI > startI) {
+      let from = buffer.buffer[this.index + 1];
+      children.push(buffer.slice(startI, endI, from));
+      positions.push(0);
+    }
+    return new Tree(this.type, children, positions, this.to - this.from);
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
+  }
+  /// @internal
+  toString() {
+    return this.context.buffer.childString(this.index);
+  }
+  getChild(type, before = null, after = null) {
+    let r = getChildren(this, type, before, after);
+    return r.length ? r[0] : null;
+  }
+  getChildren(type, before = null, after = null) {
+    return getChildren(this, type, before, after);
+  }
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
+  }
+};
+var TreeCursor = class {
+  /// Shorthand for `.type.name`.
+  get name() {
+    return this.type.name;
+  }
+  /// @internal
+  constructor(node, mode = 0) {
+    this.mode = mode;
+    this.buffer = null;
+    this.stack = [];
+    this.index = 0;
+    this.bufferNode = null;
+    if (node instanceof TreeNode) {
+      this.yieldNode(node);
+    } else {
+      this._tree = node.context.parent;
+      this.buffer = node.context;
+      for (let n = node._parent; n; n = n._parent)
+        this.stack.unshift(n.index);
+      this.bufferNode = node;
+      this.yieldBuf(node.index);
+    }
+  }
+  yieldNode(node) {
+    if (!node)
+      return false;
+    this._tree = node;
+    this.type = node.type;
+    this.from = node.from;
+    this.to = node.to;
+    return true;
+  }
+  yieldBuf(index, type) {
+    this.index = index;
+    let { start, buffer } = this.buffer;
+    this.type = type || buffer.set.types[buffer.buffer[index]];
+    this.from = start + buffer.buffer[index + 1];
+    this.to = start + buffer.buffer[index + 2];
+    return true;
+  }
+  yield(node) {
+    if (!node)
+      return false;
+    if (node instanceof TreeNode) {
+      this.buffer = null;
+      return this.yieldNode(node);
+    }
+    this.buffer = node.context;
+    return this.yieldBuf(node.index, node.type);
+  }
+  /// @internal
+  toString() {
+    return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();
+  }
+  /// @internal
+  enterChild(dir, pos, side) {
+    if (!this.buffer)
+      return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));
+    let { buffer } = this.buffer;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);
+    if (index < 0)
+      return false;
+    this.stack.push(this.index);
+    return this.yieldBuf(index);
+  }
+  /// Move the cursor to this node's first child. When this returns
+  /// false, the node has no child, and the cursor has not been moved.
+  firstChild() {
+    return this.enterChild(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  /// Move the cursor to this node's last child.
+  lastChild() {
+    return this.enterChild(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  /// Move the cursor to the first child that ends after `pos`.
+  childAfter(pos) {
+    return this.enterChild(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  /// Move to the last child that starts before `pos`.
+  childBefore(pos) {
+    return this.enterChild(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  /// Move the cursor to the child around `pos`. If side is -1 the
+  /// child may end at that position, when 1 it may start there. This
+  /// will also enter [overlaid](#common.MountedTree.overlay)
+  /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is
+  /// set to false.
+  enter(pos, side, mode = this.mode) {
+    if (!this.buffer)
+      return this.yield(this._tree.enter(pos, side, mode));
+    return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);
+  }
+  /// Move to the node's parent node, if this isn't the top node.
+  parent() {
+    if (!this.buffer)
+      return this.yieldNode(this.mode & IterMode.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+    if (this.stack.length)
+      return this.yieldBuf(this.stack.pop());
+    let parent = this.mode & IterMode.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+    this.buffer = null;
+    return this.yieldNode(parent);
+  }
+  /// @internal
+  sibling(dir) {
+    if (!this.buffer)
+      return !this._tree._parent ? false : this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4, this.mode));
+    let { buffer } = this.buffer, d = this.stack.length - 1;
+    if (dir < 0) {
+      let parentStart = d < 0 ? 0 : this.stack[d] + 4;
+      if (this.index != parentStart)
+        return this.yieldBuf(buffer.findChild(
+          parentStart,
+          this.index,
+          -1,
+          0,
+          4
+          /* Side.DontCare */
+        ));
+    } else {
+      let after = buffer.buffer[this.index + 3];
+      if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))
+        return this.yieldBuf(after);
+    }
+    return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4, this.mode)) : false;
+  }
+  /// Move to this node's next sibling, if any.
+  nextSibling() {
+    return this.sibling(1);
+  }
+  /// Move to this node's previous sibling, if any.
+  prevSibling() {
+    return this.sibling(-1);
+  }
+  atLastNode(dir) {
+    let index, parent, { buffer } = this;
+    if (buffer) {
+      if (dir > 0) {
+        if (this.index < buffer.buffer.buffer.length)
+          return false;
+      } else {
+        for (let i = 0; i < this.index; i++)
+          if (buffer.buffer.buffer[i + 3] < this.index)
+            return false;
+      }
+      ({ index, parent } = buffer);
+    } else {
+      ({ index, _parent: parent } = this._tree);
+    }
+    for (; parent; { index, _parent: parent } = parent) {
+      if (index > -1)
+        for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {
+          let child = parent._tree.children[i];
+          if (this.mode & IterMode.IncludeAnonymous || child instanceof TreeBuffer || !child.type.isAnonymous || hasChild(child))
+            return false;
+        }
+    }
+    return true;
+  }
+  move(dir, enter) {
+    if (enter && this.enterChild(
+      dir,
+      0,
+      4
+      /* Side.DontCare */
+    ))
+      return true;
+    for (; ; ) {
+      if (this.sibling(dir))
+        return true;
+      if (this.atLastNode(dir) || !this.parent())
+        return false;
+    }
+  }
+  /// Move to the next node in a
+  /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)
+  /// traversal, going from a node to its first child or, if the
+  /// current node is empty or `enter` is false, its next sibling or
+  /// the next sibling of the first parent node that has one.
+  next(enter = true) {
+    return this.move(1, enter);
+  }
+  /// Move to the next node in a last-to-first pre-order traveral. A
+  /// node is followed by its last child or, if it has none, its
+  /// previous sibling or the previous sibling of the first parent
+  /// node that has one.
+  prev(enter = true) {
+    return this.move(-1, enter);
+  }
+  /// Move the cursor to the innermost node that covers `pos`. If
+  /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,
+  /// it will enter nodes that start at `pos`.
+  moveTo(pos, side = 0) {
+    while (this.from == this.to || (side < 1 ? this.from >= pos : this.from > pos) || (side > -1 ? this.to <= pos : this.to < pos))
+      if (!this.parent())
+        break;
+    while (this.enterChild(1, pos, side)) {
+    }
+    return this;
+  }
+  /// Get a [syntax node](#common.SyntaxNode) at the cursor's current
+  /// position.
+  get node() {
+    if (!this.buffer)
+      return this._tree;
+    let cache = this.bufferNode, result = null, depth = 0;
+    if (cache && cache.context == this.buffer) {
+      scan:
+        for (let index = this.index, d = this.stack.length; d >= 0; ) {
+          for (let c = cache; c; c = c._parent)
+            if (c.index == index) {
+              if (index == this.index)
+                return c;
+              result = c;
+              depth = d + 1;
+              break scan;
+            }
+          index = this.stack[--d];
+        }
+    }
+    for (let i = depth; i < this.stack.length; i++)
+      result = new BufferNode(this.buffer, result, this.stack[i]);
+    return this.bufferNode = new BufferNode(this.buffer, result, this.index);
+  }
+  /// Get the [tree](#common.Tree) that represents the current node, if
+  /// any. Will return null when the node is in a [tree
+  /// buffer](#common.TreeBuffer).
+  get tree() {
+    return this.buffer ? null : this._tree._tree;
+  }
+  /// Iterate over the current node and all its descendants, calling
+  /// `enter` when entering a node and `leave`, if given, when leaving
+  /// one. When `enter` returns `false`, any children of that node are
+  /// skipped, and `leave` isn't called for it.
+  iterate(enter, leave) {
+    for (let depth = 0; ; ) {
+      let mustLeave = false;
+      if (this.type.isAnonymous || enter(this) !== false) {
+        if (this.firstChild()) {
+          depth++;
+          continue;
+        }
+        if (!this.type.isAnonymous)
+          mustLeave = true;
+      }
+      for (; ; ) {
+        if (mustLeave && leave)
+          leave(this);
+        mustLeave = this.type.isAnonymous;
+        if (this.nextSibling())
+          break;
+        if (!depth)
+          return;
+        this.parent();
+        depth--;
+        mustLeave = true;
+      }
+    }
+  }
+  /// Test whether the current node matches a given context—a sequence
+  /// of direct parent node names. Empty strings in the context array
+  /// are treated as wildcards.
+  matchContext(context) {
+    if (!this.buffer)
+      return matchNodeContext(this.node, context);
+    let { buffer } = this.buffer, { types } = buffer.set;
+    for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {
+      if (d < 0)
+        return matchNodeContext(this.node, context, i);
+      let type = types[buffer.buffer[this.stack[d]]];
+      if (!type.isAnonymous) {
+        if (context[i] && context[i] != type.name)
+          return false;
+        i--;
+      }
+    }
+    return true;
+  }
+};
+function hasChild(tree) {
+  return tree.children.some((ch) => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));
+}
+function buildTree(data) {
+  var _a;
+  let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;
+  let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;
+  let types = nodeSet.types;
+  let contextHash = 0, lookAhead = 0;
+  function takeNode(parentStart, minPos, children2, positions2, inRepeat) {
+    let { id, start, end, size } = cursor;
+    let lookAheadAtStart = lookAhead;
+    while (size < 0) {
+      cursor.next();
+      if (size == -1) {
+        let node2 = reused[id];
+        children2.push(node2);
+        positions2.push(start - parentStart);
+        return;
+      } else if (size == -3) {
+        contextHash = id;
+        return;
+      } else if (size == -4) {
+        lookAhead = id;
+        return;
+      } else {
+        throw new RangeError(`Unrecognized record size: ${size}`);
+      }
+    }
+    let type = types[id], node, buffer2;
+    let startPos = start - parentStart;
+    if (end - start <= maxBufferLength && (buffer2 = findBufferSize(cursor.pos - minPos, inRepeat))) {
+      let data2 = new Uint16Array(buffer2.size - buffer2.skip);
+      let endPos = cursor.pos - buffer2.size, index = data2.length;
+      while (cursor.pos > endPos)
+        index = copyToBuffer(buffer2.start, data2, index);
+      node = new TreeBuffer(data2, end - buffer2.start, nodeSet);
+      startPos = buffer2.start - parentStart;
+    } else {
+      let endPos = cursor.pos - size;
+      cursor.next();
+      let localChildren = [], localPositions = [];
+      let localInRepeat = id >= minRepeatType ? id : -1;
+      let lastGroup = 0, lastEnd = end;
+      while (cursor.pos > endPos) {
+        if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {
+          if (cursor.end <= lastEnd - maxBufferLength) {
+            makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);
+            lastGroup = localChildren.length;
+            lastEnd = cursor.end;
+          }
+          cursor.next();
+        } else {
+          takeNode(start, endPos, localChildren, localPositions, localInRepeat);
+        }
+      }
+      if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)
+        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);
+      localChildren.reverse();
+      localPositions.reverse();
+      if (localInRepeat > -1 && lastGroup > 0) {
+        let make = makeBalanced(type);
+        node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);
+      } else {
+        node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);
+      }
+    }
+    children2.push(node);
+    positions2.push(startPos);
+  }
+  function makeBalanced(type) {
+    return (children2, positions2, length2) => {
+      let lookAhead2 = 0, lastI = children2.length - 1, last, lookAheadProp;
+      if (lastI >= 0 && (last = children2[lastI]) instanceof Tree) {
+        if (!lastI && last.type == type && last.length == length2)
+          return last;
+        if (lookAheadProp = last.prop(NodeProp.lookAhead))
+          lookAhead2 = positions2[lastI] + last.length + lookAheadProp;
+      }
+      return makeTree(type, children2, positions2, length2, lookAhead2);
+    };
+  }
+  function makeRepeatLeaf(children2, positions2, base, i, from, to, type, lookAhead2) {
+    let localChildren = [], localPositions = [];
+    while (children2.length > i) {
+      localChildren.push(children2.pop());
+      localPositions.push(positions2.pop() + base - from);
+    }
+    children2.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead2 - to));
+    positions2.push(from - base);
+  }
+  function makeTree(type, children2, positions2, length2, lookAhead2 = 0, props) {
+    if (contextHash) {
+      let pair2 = [NodeProp.contextHash, contextHash];
+      props = props ? [pair2].concat(props) : [pair2];
+    }
+    if (lookAhead2 > 25) {
+      let pair2 = [NodeProp.lookAhead, lookAhead2];
+      props = props ? [pair2].concat(props) : [pair2];
+    }
+    return new Tree(type, children2, positions2, length2, props);
+  }
+  function findBufferSize(maxSize, inRepeat) {
+    let fork = cursor.fork();
+    let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;
+    let result = { size: 0, start: 0, skip: 0 };
+    scan:
+      for (let minPos = fork.pos - maxSize; fork.pos > minPos; ) {
+        let nodeSize2 = fork.size;
+        if (fork.id == inRepeat && nodeSize2 >= 0) {
+          result.size = size;
+          result.start = start;
+          result.skip = skip;
+          skip += 4;
+          size += 4;
+          fork.next();
+          continue;
+        }
+        let startPos = fork.pos - nodeSize2;
+        if (nodeSize2 < 0 || startPos < minPos || fork.start < minStart)
+          break;
+        let localSkipped = fork.id >= minRepeatType ? 4 : 0;
+        let nodeStart = fork.start;
+        fork.next();
+        while (fork.pos > startPos) {
+          if (fork.size < 0) {
+            if (fork.size == -3)
+              localSkipped += 4;
+            else
+              break scan;
+          } else if (fork.id >= minRepeatType) {
+            localSkipped += 4;
+          }
+          fork.next();
+        }
+        start = nodeStart;
+        size += nodeSize2;
+        skip += localSkipped;
+      }
+    if (inRepeat < 0 || size == maxSize) {
+      result.size = size;
+      result.start = start;
+      result.skip = skip;
+    }
+    return result.size > 4 ? result : void 0;
+  }
+  function copyToBuffer(bufferStart, buffer2, index) {
+    let { id, start, end, size } = cursor;
+    cursor.next();
+    if (size >= 0 && id < minRepeatType) {
+      let startIndex = index;
+      if (size > 4) {
+        let endPos = cursor.pos - (size - 4);
+        while (cursor.pos > endPos)
+          index = copyToBuffer(bufferStart, buffer2, index);
+      }
+      buffer2[--index] = startIndex;
+      buffer2[--index] = end - bufferStart;
+      buffer2[--index] = start - bufferStart;
+      buffer2[--index] = id;
+    } else if (size == -3) {
+      contextHash = id;
+    } else if (size == -4) {
+      lookAhead = id;
+    }
+    return index;
+  }
+  let children = [], positions = [];
+  while (cursor.pos > 0)
+    takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);
+  let length = (_a = data.length) !== null && _a !== void 0 ? _a : children.length ? positions[0] + children[0].length : 0;
+  return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);
+}
+var nodeSizeCache = /* @__PURE__ */ new WeakMap();
+function nodeSize(balanceType, node) {
+  if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)
+    return 1;
+  let size = nodeSizeCache.get(node);
+  if (size == null) {
+    size = 1;
+    for (let child of node.children) {
+      if (child.type != balanceType || !(child instanceof Tree)) {
+        size = 1;
+        break;
+      }
+      size += nodeSize(balanceType, child);
+    }
+    nodeSizeCache.set(node, size);
+  }
+  return size;
+}
+function balanceRange(balanceType, children, positions, from, to, start, length, mkTop, mkTree) {
+  let total = 0;
+  for (let i = from; i < to; i++)
+    total += nodeSize(balanceType, children[i]);
+  let maxChild = Math.ceil(
+    total * 1.5 / 8
+    /* Balance.BranchFactor */
+  );
+  let localChildren = [], localPositions = [];
+  function divide(children2, positions2, from2, to2, offset) {
+    for (let i = from2; i < to2; ) {
+      let groupFrom = i, groupStart = positions2[i], groupSize = nodeSize(balanceType, children2[i]);
+      i++;
+      for (; i < to2; i++) {
+        let nextSize = nodeSize(balanceType, children2[i]);
+        if (groupSize + nextSize >= maxChild)
+          break;
+        groupSize += nextSize;
+      }
+      if (i == groupFrom + 1) {
+        if (groupSize > maxChild) {
+          let only = children2[groupFrom];
+          divide(only.children, only.positions, 0, only.children.length, positions2[groupFrom] + offset);
+          continue;
+        }
+        localChildren.push(children2[groupFrom]);
+      } else {
+        let length2 = positions2[i - 1] + children2[i - 1].length - groupStart;
+        localChildren.push(balanceRange(balanceType, children2, positions2, groupFrom, i, groupStart, length2, null, mkTree));
+      }
+      localPositions.push(groupStart + offset - start);
+    }
+  }
+  divide(children, positions, from, to, 0);
+  return (mkTop || mkTree)(localChildren, localPositions, length);
+}
+var Parser = class {
+  /// Start a parse, returning a [partial parse](#common.PartialParse)
+  /// object. [`fragments`](#common.TreeFragment) can be passed in to
+  /// make the parse incremental.
+  ///
+  /// By default, the entire input is parsed. You can pass `ranges`,
+  /// which should be a sorted array of non-empty, non-overlapping
+  /// ranges, to parse only those ranges. The tree returned in that
+  /// case will start at `ranges[0].from`.
+  startParse(input, fragments, ranges) {
+    if (typeof input == "string")
+      input = new StringInput(input);
+    ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map((r) => new Range(r.from, r.to)) : [new Range(0, 0)];
+    return this.createParse(input, fragments || [], ranges);
+  }
+  /// Run a full parse, returning the resulting tree.
+  parse(input, fragments, ranges) {
+    let parse = this.startParse(input, fragments, ranges);
+    for (; ; ) {
+      let done = parse.advance();
+      if (done)
+        return done;
+    }
+  }
+};
+var StringInput = class {
+  constructor(string) {
+    this.string = string;
+  }
+  get length() {
+    return this.string.length;
+  }
+  chunk(from) {
+    return this.string.slice(from);
+  }
+  get lineChunks() {
+    return false;
+  }
+  read(from, to) {
+    return this.string.slice(from, to);
+  }
+};
+var stoppedInner = new NodeProp({ perNode: true });
+
+// ../../node_modules/@lezer/lr/dist/index.js
+var Stack = class {
+  /// @internal
+  constructor(p, stack, state, reducePos, pos, score, buffer, bufferBase, curContext, lookAhead = 0, parent) {
+    this.p = p;
+    this.stack = stack;
+    this.state = state;
+    this.reducePos = reducePos;
+    this.pos = pos;
+    this.score = score;
+    this.buffer = buffer;
+    this.bufferBase = bufferBase;
+    this.curContext = curContext;
+    this.lookAhead = lookAhead;
+    this.parent = parent;
+  }
+  /// @internal
+  toString() {
+    return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? "!" + this.score : ""}`;
+  }
+  // Start an empty stack
+  /// @internal
+  static start(p, state, pos = 0) {
+    let cx9 = p.parser.context;
+    return new Stack(p, [], state, pos, pos, 0, [], 0, cx9 ? new StackContext(cx9, cx9.start) : null, 0, null);
+  }
+  /// The stack's current [context](#lr.ContextTracker) value, if
+  /// any. Its type will depend on the context tracker's type
+  /// parameter, or it will be `null` if there is no context
+  /// tracker.
+  get context() {
+    return this.curContext ? this.curContext.context : null;
+  }
+  // Push a state onto the stack, tracking its start position as well
+  // as the buffer base at that point.
+  /// @internal
+  pushState(state, start) {
+    this.stack.push(this.state, start, this.bufferBase + this.buffer.length);
+    this.state = state;
+  }
+  // Apply a reduce action
+  /// @internal
+  reduce(action) {
+    var _a;
+    let depth = action >> 19, type = action & 65535;
+    let { parser: parser2 } = this.p;
+    let dPrec = parser2.dynamicPrecedence(type);
+    if (dPrec)
+      this.score += dPrec;
+    if (depth == 0) {
+      this.pushState(parser2.getGoto(this.state, type, true), this.reducePos);
+      if (type < parser2.minRepeatTerm)
+        this.storeNode(type, this.reducePos, this.reducePos, 4, true);
+      this.reduceContext(type, this.reducePos);
+      return;
+    }
+    let base = this.stack.length - (depth - 1) * 3 - (action & 262144 ? 6 : 0);
+    let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;
+    if (size >= 2e3 && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {
+      if (start == this.p.lastBigReductionStart) {
+        this.p.bigReductionCount++;
+        this.p.lastBigReductionSize = size;
+      } else if (this.p.lastBigReductionSize < size) {
+        this.p.bigReductionCount = 1;
+        this.p.lastBigReductionStart = start;
+        this.p.lastBigReductionSize = size;
+      }
+    }
+    let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;
+    if (type < parser2.minRepeatTerm || action & 131072) {
+      let pos = parser2.stateFlag(
+        this.state,
+        1
+        /* StateFlag.Skipped */
+      ) ? this.pos : this.reducePos;
+      this.storeNode(type, start, pos, count + 4, true);
+    }
+    if (action & 262144) {
+      this.state = this.stack[base];
+    } else {
+      let baseStateID = this.stack[base - 3];
+      this.state = parser2.getGoto(baseStateID, type, true);
+    }
+    while (this.stack.length > base)
+      this.stack.pop();
+    this.reduceContext(type, start);
+  }
+  // Shift a value into the buffer
+  /// @internal
+  storeNode(term, start, end, size = 4, isReduce = false) {
+    if (term == 0 && (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {
+      let cur = this, top = this.buffer.length;
+      if (top == 0 && cur.parent) {
+        top = cur.bufferBase - cur.parent.bufferBase;
+        cur = cur.parent;
+      }
+      if (top > 0 && cur.buffer[top - 4] == 0 && cur.buffer[top - 1] > -1) {
+        if (start == end)
+          return;
+        if (cur.buffer[top - 2] >= start) {
+          cur.buffer[top - 2] = end;
+          return;
+        }
+      }
+    }
+    if (!isReduce || this.pos == end) {
+      this.buffer.push(term, start, end, size);
+    } else {
+      let index = this.buffer.length;
+      if (index > 0 && this.buffer[index - 4] != 0)
+        while (index > 0 && this.buffer[index - 2] > end) {
+          this.buffer[index] = this.buffer[index - 4];
+          this.buffer[index + 1] = this.buffer[index - 3];
+          this.buffer[index + 2] = this.buffer[index - 2];
+          this.buffer[index + 3] = this.buffer[index - 1];
+          index -= 4;
+          if (size > 4)
+            size -= 4;
+        }
+      this.buffer[index] = term;
+      this.buffer[index + 1] = start;
+      this.buffer[index + 2] = end;
+      this.buffer[index + 3] = size;
+    }
+  }
+  // Apply a shift action
+  /// @internal
+  shift(action, next, nextEnd) {
+    let start = this.pos;
+    if (action & 131072) {
+      this.pushState(action & 65535, this.pos);
+    } else if ((action & 262144) == 0) {
+      let nextState = action, { parser: parser2 } = this.p;
+      if (nextEnd > this.pos || next <= parser2.maxNode) {
+        this.pos = nextEnd;
+        if (!parser2.stateFlag(
+          nextState,
+          1
+          /* StateFlag.Skipped */
+        ))
+          this.reducePos = nextEnd;
+      }
+      this.pushState(nextState, start);
+      this.shiftContext(next, start);
+      if (next <= parser2.maxNode)
+        this.buffer.push(next, start, nextEnd, 4);
+    } else {
+      this.pos = nextEnd;
+      this.shiftContext(next, start);
+      if (next <= this.p.parser.maxNode)
+        this.buffer.push(next, start, nextEnd, 4);
+    }
+  }
+  // Apply an action
+  /// @internal
+  apply(action, next, nextEnd) {
+    if (action & 65536)
+      this.reduce(action);
+    else
+      this.shift(action, next, nextEnd);
+  }
+  // Add a prebuilt (reused) node into the buffer.
+  /// @internal
+  useNode(value, next) {
+    let index = this.p.reused.length - 1;
+    if (index < 0 || this.p.reused[index] != value) {
+      this.p.reused.push(value);
+      index++;
+    }
+    let start = this.pos;
+    this.reducePos = this.pos = start + value.length;
+    this.pushState(next, start);
+    this.buffer.push(
+      index,
+      start,
+      this.reducePos,
+      -1
+      /* size == -1 means this is a reused value */
+    );
+    if (this.curContext)
+      this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));
+  }
+  // Split the stack. Due to the buffer sharing and the fact
+  // that `this.stack` tends to stay quite shallow, this isn't very
+  // expensive.
+  /// @internal
+  split() {
+    let parent = this;
+    let off = parent.buffer.length;
+    while (off > 0 && parent.buffer[off - 2] > parent.reducePos)
+      off -= 4;
+    let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;
+    while (parent && base == parent.bufferBase)
+      parent = parent.parent;
+    return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);
+  }
+  // Try to recover from an error by 'deleting' (ignoring) one token.
+  /// @internal
+  recoverByDelete(next, nextEnd) {
+    let isNode = next <= this.p.parser.maxNode;
+    if (isNode)
+      this.storeNode(next, this.pos, nextEnd, 4);
+    this.storeNode(0, this.pos, nextEnd, isNode ? 8 : 4);
+    this.pos = this.reducePos = nextEnd;
+    this.score -= 190;
+  }
+  /// Check if the given term would be able to be shifted (optionally
+  /// after some reductions) on this stack. This can be useful for
+  /// external tokenizers that want to make sure they only provide a
+  /// given token when it applies.
+  canShift(term) {
+    for (let sim = new SimulatedStack(this); ; ) {
+      let action = this.p.parser.stateSlot(
+        sim.state,
+        4
+        /* ParseState.DefaultReduce */
+      ) || this.p.parser.hasAction(sim.state, term);
+      if (action == 0)
+        return false;
+      if ((action & 65536) == 0)
+        return true;
+      sim.reduce(action);
+    }
+  }
+  // Apply up to Recover.MaxNext recovery actions that conceptually
+  // inserts some missing token or rule.
+  /// @internal
+  recoverByInsert(next) {
+    if (this.stack.length >= 300)
+      return [];
+    let nextStates = this.p.parser.nextStates(this.state);
+    if (nextStates.length > 4 << 1 || this.stack.length >= 120) {
+      let best = [];
+      for (let i = 0, s; i < nextStates.length; i += 2) {
+        if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))
+          best.push(nextStates[i], s);
+      }
+      if (this.stack.length < 120)
+        for (let i = 0; best.length < 4 << 1 && i < nextStates.length; i += 2) {
+          let s = nextStates[i + 1];
+          if (!best.some((v, i2) => i2 & 1 && v == s))
+            best.push(nextStates[i], s);
+        }
+      nextStates = best;
+    }
+    let result = [];
+    for (let i = 0; i < nextStates.length && result.length < 4; i += 2) {
+      let s = nextStates[i + 1];
+      if (s == this.state)
+        continue;
+      let stack = this.split();
+      stack.pushState(s, this.pos);
+      stack.storeNode(0, stack.pos, stack.pos, 4, true);
+      stack.shiftContext(nextStates[i], this.pos);
+      stack.score -= 200;
+      result.push(stack);
+    }
+    return result;
+  }
+  // Force a reduce, if possible. Return false if that can't
+  // be done.
+  /// @internal
+  forceReduce() {
+    let reduce = this.p.parser.stateSlot(
+      this.state,
+      5
+      /* ParseState.ForcedReduce */
+    );
+    if ((reduce & 65536) == 0)
+      return false;
+    let { parser: parser2 } = this.p;
+    if (!parser2.validAction(this.state, reduce)) {
+      let depth = reduce >> 19, term = reduce & 65535;
+      let target = this.stack.length - depth * 3;
+      if (target < 0 || parser2.getGoto(this.stack[target], term, false) < 0)
+        return false;
+      this.storeNode(0, this.reducePos, this.reducePos, 4, true);
+      this.score -= 100;
+    }
+    this.reducePos = this.pos;
+    this.reduce(reduce);
+    return true;
+  }
+  /// @internal
+  forceAll() {
+    while (!this.p.parser.stateFlag(
+      this.state,
+      2
+      /* StateFlag.Accepting */
+    )) {
+      if (!this.forceReduce()) {
+        this.storeNode(0, this.pos, this.pos, 4, true);
+        break;
+      }
+    }
+    return this;
+  }
+  /// Check whether this state has no further actions (assumed to be a direct descendant of the
+  /// top state, since any other states must be able to continue
+  /// somehow). @internal
+  get deadEnd() {
+    if (this.stack.length != 3)
+      return false;
+    let { parser: parser2 } = this.p;
+    return parser2.data[parser2.stateSlot(
+      this.state,
+      1
+      /* ParseState.Actions */
+    )] == 65535 && !parser2.stateSlot(
+      this.state,
+      4
+      /* ParseState.DefaultReduce */
+    );
+  }
+  /// Restart the stack (put it back in its start state). Only safe
+  /// when this.stack.length == 3 (state is directly below the top
+  /// state). @internal
+  restart() {
+    this.state = this.stack[0];
+    this.stack.length = 0;
+  }
+  /// @internal
+  sameState(other) {
+    if (this.state != other.state || this.stack.length != other.stack.length)
+      return false;
+    for (let i = 0; i < this.stack.length; i += 3)
+      if (this.stack[i] != other.stack[i])
+        return false;
+    return true;
+  }
+  /// Get the parser used by this stack.
+  get parser() {
+    return this.p.parser;
+  }
+  /// Test whether a given dialect (by numeric ID, as exported from
+  /// the terms file) is enabled.
+  dialectEnabled(dialectID) {
+    return this.p.parser.dialect.flags[dialectID];
+  }
+  shiftContext(term, start) {
+    if (this.curContext)
+      this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));
+  }
+  reduceContext(term, start) {
+    if (this.curContext)
+      this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));
+  }
+  /// @internal
+  emitContext() {
+    let last = this.buffer.length - 1;
+    if (last < 0 || this.buffer[last] != -3)
+      this.buffer.push(this.curContext.hash, this.reducePos, this.reducePos, -3);
+  }
+  /// @internal
+  emitLookAhead() {
+    let last = this.buffer.length - 1;
+    if (last < 0 || this.buffer[last] != -4)
+      this.buffer.push(this.lookAhead, this.reducePos, this.reducePos, -4);
+  }
+  updateContext(context) {
+    if (context != this.curContext.context) {
+      let newCx = new StackContext(this.curContext.tracker, context);
+      if (newCx.hash != this.curContext.hash)
+        this.emitContext();
+      this.curContext = newCx;
+    }
+  }
+  /// @internal
+  setLookAhead(lookAhead) {
+    if (lookAhead > this.lookAhead) {
+      this.emitLookAhead();
+      this.lookAhead = lookAhead;
+    }
+  }
+  /// @internal
+  close() {
+    if (this.curContext && this.curContext.tracker.strict)
+      this.emitContext();
+    if (this.lookAhead > 0)
+      this.emitLookAhead();
+  }
+};
+var StackContext = class {
+  constructor(tracker, context) {
+    this.tracker = tracker;
+    this.context = context;
+    this.hash = tracker.strict ? tracker.hash(context) : 0;
+  }
+};
+var Recover;
+(function(Recover2) {
+  Recover2[Recover2["Insert"] = 200] = "Insert";
+  Recover2[Recover2["Delete"] = 190] = "Delete";
+  Recover2[Recover2["Reduce"] = 100] = "Reduce";
+  Recover2[Recover2["MaxNext"] = 4] = "MaxNext";
+  Recover2[Recover2["MaxInsertStackDepth"] = 300] = "MaxInsertStackDepth";
+  Recover2[Recover2["DampenInsertStackDepth"] = 120] = "DampenInsertStackDepth";
+  Recover2[Recover2["MinBigReduction"] = 2e3] = "MinBigReduction";
+})(Recover || (Recover = {}));
+var SimulatedStack = class {
+  constructor(start) {
+    this.start = start;
+    this.state = start.state;
+    this.stack = start.stack;
+    this.base = this.stack.length;
+  }
+  reduce(action) {
+    let term = action & 65535, depth = action >> 19;
+    if (depth == 0) {
+      if (this.stack == this.start.stack)
+        this.stack = this.stack.slice();
+      this.stack.push(this.state, 0, 0);
+      this.base += 3;
+    } else {
+      this.base -= (depth - 1) * 3;
+    }
+    let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);
+    this.state = goto;
+  }
+};
+var StackBufferCursor = class {
+  constructor(stack, pos, index) {
+    this.stack = stack;
+    this.pos = pos;
+    this.index = index;
+    this.buffer = stack.buffer;
+    if (this.index == 0)
+      this.maybeNext();
+  }
+  static create(stack, pos = stack.bufferBase + stack.buffer.length) {
+    return new StackBufferCursor(stack, pos, pos - stack.bufferBase);
+  }
+  maybeNext() {
+    let next = this.stack.parent;
+    if (next != null) {
+      this.index = this.stack.bufferBase - next.bufferBase;
+      this.stack = next;
+      this.buffer = next.buffer;
+    }
+  }
+  get id() {
+    return this.buffer[this.index - 4];
+  }
+  get start() {
+    return this.buffer[this.index - 3];
+  }
+  get end() {
+    return this.buffer[this.index - 2];
+  }
+  get size() {
+    return this.buffer[this.index - 1];
+  }
+  next() {
+    this.index -= 4;
+    this.pos -= 4;
+    if (this.index == 0)
+      this.maybeNext();
+  }
+  fork() {
+    return new StackBufferCursor(this.stack, this.pos, this.index);
+  }
+};
+function decodeArray(input, Type = Uint16Array) {
+  if (typeof input != "string")
+    return input;
+  let array = null;
+  for (let pos = 0, out = 0; pos < input.length; ) {
+    let value = 0;
+    for (; ; ) {
+      let next = input.charCodeAt(pos++), stop = false;
+      if (next == 126) {
+        value = 65535;
+        break;
+      }
+      if (next >= 92)
+        next--;
+      if (next >= 34)
+        next--;
+      let digit = next - 32;
+      if (digit >= 46) {
+        digit -= 46;
+        stop = true;
+      }
+      value += digit;
+      if (stop)
+        break;
+      value *= 46;
+    }
+    if (array)
+      array[out++] = value;
+    else
+      array = new Type(value);
+  }
+  return array;
+}
+var CachedToken = class {
+  constructor() {
+    this.start = -1;
+    this.value = -1;
+    this.end = -1;
+    this.extended = -1;
+    this.lookAhead = 0;
+    this.mask = 0;
+    this.context = 0;
+  }
+};
+var nullToken = new CachedToken();
+var InputStream = class {
+  /// @internal
+  constructor(input, ranges) {
+    this.input = input;
+    this.ranges = ranges;
+    this.chunk = "";
+    this.chunkOff = 0;
+    this.chunk2 = "";
+    this.chunk2Pos = 0;
+    this.next = -1;
+    this.token = nullToken;
+    this.rangeIndex = 0;
+    this.pos = this.chunkPos = ranges[0].from;
+    this.range = ranges[0];
+    this.end = ranges[ranges.length - 1].to;
+    this.readNext();
+  }
+  /// @internal
+  resolveOffset(offset, assoc) {
+    let range = this.range, index = this.rangeIndex;
+    let pos = this.pos + offset;
+    while (pos < range.from) {
+      if (!index)
+        return null;
+      let next = this.ranges[--index];
+      pos -= range.from - next.to;
+      range = next;
+    }
+    while (assoc < 0 ? pos > range.to : pos >= range.to) {
+      if (index == this.ranges.length - 1)
+        return null;
+      let next = this.ranges[++index];
+      pos += next.from - range.to;
+      range = next;
+    }
+    return pos;
+  }
+  /// @internal
+  clipPos(pos) {
+    if (pos >= this.range.from && pos < this.range.to)
+      return pos;
+    for (let range of this.ranges)
+      if (range.to > pos)
+        return Math.max(pos, range.from);
+    return this.end;
+  }
+  /// Look at a code unit near the stream position. `.peek(0)` equals
+  /// `.next`, `.peek(-1)` gives you the previous character, and so
+  /// on.
+  ///
+  /// Note that looking around during tokenizing creates dependencies
+  /// on potentially far-away content, which may reduce the
+  /// effectiveness incremental parsing—when looking forward—or even
+  /// cause invalid reparses when looking backward more than 25 code
+  /// units, since the library does not track lookbehind.
+  peek(offset) {
+    let idx = this.chunkOff + offset, pos, result;
+    if (idx >= 0 && idx < this.chunk.length) {
+      pos = this.pos + offset;
+      result = this.chunk.charCodeAt(idx);
+    } else {
+      let resolved = this.resolveOffset(offset, 1);
+      if (resolved == null)
+        return -1;
+      pos = resolved;
+      if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {
+        result = this.chunk2.charCodeAt(pos - this.chunk2Pos);
+      } else {
+        let i = this.rangeIndex, range = this.range;
+        while (range.to <= pos)
+          range = this.ranges[++i];
+        this.chunk2 = this.input.chunk(this.chunk2Pos = pos);
+        if (pos + this.chunk2.length > range.to)
+          this.chunk2 = this.chunk2.slice(0, range.to - pos);
+        result = this.chunk2.charCodeAt(0);
+      }
+    }
+    if (pos >= this.token.lookAhead)
+      this.token.lookAhead = pos + 1;
+    return result;
+  }
+  /// Accept a token. By default, the end of the token is set to the
+  /// current stream position, but you can pass an offset (relative to
+  /// the stream position) to change that.
+  acceptToken(token, endOffset = 0) {
+    let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;
+    if (end == null || end < this.token.start)
+      throw new RangeError("Token end out of bounds");
+    this.token.value = token;
+    this.token.end = end;
+  }
+  getChunk() {
+    if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {
+      let { chunk, chunkPos } = this;
+      this.chunk = this.chunk2;
+      this.chunkPos = this.chunk2Pos;
+      this.chunk2 = chunk;
+      this.chunk2Pos = chunkPos;
+      this.chunkOff = this.pos - this.chunkPos;
+    } else {
+      this.chunk2 = this.chunk;
+      this.chunk2Pos = this.chunkPos;
+      let nextChunk = this.input.chunk(this.pos);
+      let end = this.pos + nextChunk.length;
+      this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;
+      this.chunkPos = this.pos;
+      this.chunkOff = 0;
+    }
+  }
+  readNext() {
+    if (this.chunkOff >= this.chunk.length) {
+      this.getChunk();
+      if (this.chunkOff == this.chunk.length)
+        return this.next = -1;
+    }
+    return this.next = this.chunk.charCodeAt(this.chunkOff);
+  }
+  /// Move the stream forward N (defaults to 1) code units. Returns
+  /// the new value of [`next`](#lr.InputStream.next).
+  advance(n = 1) {
+    this.chunkOff += n;
+    while (this.pos + n >= this.range.to) {
+      if (this.rangeIndex == this.ranges.length - 1)
+        return this.setDone();
+      n -= this.range.to - this.pos;
+      this.range = this.ranges[++this.rangeIndex];
+      this.pos = this.range.from;
+    }
+    this.pos += n;
+    if (this.pos >= this.token.lookAhead)
+      this.token.lookAhead = this.pos + 1;
+    return this.readNext();
+  }
+  setDone() {
+    this.pos = this.chunkPos = this.end;
+    this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];
+    this.chunk = "";
+    return this.next = -1;
+  }
+  /// @internal
+  reset(pos, token) {
+    if (token) {
+      this.token = token;
+      token.start = pos;
+      token.lookAhead = pos + 1;
+      token.value = token.extended = -1;
+    } else {
+      this.token = nullToken;
+    }
+    if (this.pos != pos) {
+      this.pos = pos;
+      if (pos == this.end) {
+        this.setDone();
+        return this;
+      }
+      while (pos < this.range.from)
+        this.range = this.ranges[--this.rangeIndex];
+      while (pos >= this.range.to)
+        this.range = this.ranges[++this.rangeIndex];
+      if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {
+        this.chunkOff = pos - this.chunkPos;
+      } else {
+        this.chunk = "";
+        this.chunkOff = 0;
+      }
+      this.readNext();
+    }
+    return this;
+  }
+  /// @internal
+  read(from, to) {
+    if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)
+      return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);
+    if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)
+      return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);
+    if (from >= this.range.from && to <= this.range.to)
+      return this.input.read(from, to);
+    let result = "";
+    for (let r of this.ranges) {
+      if (r.from >= to)
+        break;
+      if (r.to > from)
+        result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));
+    }
+    return result;
+  }
+};
+var TokenGroup = class {
+  constructor(data, id) {
+    this.data = data;
+    this.id = id;
+  }
+  token(input, stack) {
+    let { parser: parser2 } = stack.p;
+    readToken(this.data, input, stack, this.id, parser2.data, parser2.tokenPrecTable);
+  }
+};
+TokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;
+var LocalTokenGroup = class {
+  constructor(data, precTable, elseToken) {
+    this.precTable = precTable;
+    this.elseToken = elseToken;
+    this.data = typeof data == "string" ? decodeArray(data) : data;
+  }
+  token(input, stack) {
+    let start = input.pos, skipped = 0;
+    for (; ; ) {
+      readToken(this.data, input, stack, 0, this.data, this.precTable);
+      if (input.token.value > -1)
+        break;
+      if (this.elseToken == null)
+        return;
+      if (input.next < 0)
+        break;
+      input.advance();
+      input.reset(input.pos, input.token);
+      skipped++;
+    }
+    if (skipped) {
+      input.reset(start, input.token);
+      input.acceptToken(this.elseToken, skipped);
+    }
+  }
+};
+LocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;
+function readToken(data, input, stack, group, precTable, precOffset) {
+  let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;
+  scan:
+    for (; ; ) {
+      if ((groupMask & data[state]) == 0)
+        break;
+      let accEnd = data[state + 1];
+      for (let i = state + 3; i < accEnd; i += 2)
+        if ((data[i + 1] & groupMask) > 0) {
+          let term = data[i];
+          if (dialect.allows(term) && (input.token.value == -1 || input.token.value == term || overrides(term, input.token.value, precTable, precOffset))) {
+            input.acceptToken(term);
+            break;
+          }
+        }
+      let next = input.next, low = 0, high = data[state + 2];
+      if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 && data[accEnd + high * 3 - 3] == 65535) {
+        state = data[accEnd + high * 3 - 1];
+        continue scan;
+      }
+      for (; low < high; ) {
+        let mid = low + high >> 1;
+        let index = accEnd + mid + (mid << 1);
+        let from = data[index], to = data[index + 1] || 65536;
+        if (next < from)
+          high = mid;
+        else if (next >= to)
+          low = mid + 1;
+        else {
+          state = data[index + 2];
+          input.advance();
+          continue scan;
+        }
+      }
+      break;
+    }
+}
+function findOffset(data, start, term) {
+  for (let i = start, next; (next = data[i]) != 65535; i++)
+    if (next == term)
+      return i - start;
+  return -1;
+}
+function overrides(token, prev, tableData, tableOffset) {
+  let iPrev = findOffset(tableData, tableOffset, prev);
+  return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;
+}
+var verbose = typeof process != "undefined" && process.env && /\bparse\b/.test(process.env.LOG);
+var stackIDs = null;
+var Safety;
+(function(Safety2) {
+  Safety2[Safety2["Margin"] = 25] = "Margin";
+})(Safety || (Safety = {}));
+function cutAt(tree, pos, side) {
+  let cursor = tree.cursor(IterMode.IncludeAnonymous);
+  cursor.moveTo(pos);
+  for (; ; ) {
+    if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))
+      for (; ; ) {
+        if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)
+          return side < 0 ? Math.max(0, Math.min(
+            cursor.to - 1,
+            pos - 25
+            /* Safety.Margin */
+          )) : Math.min(tree.length, Math.max(
+            cursor.from + 1,
+            pos + 25
+            /* Safety.Margin */
+          ));
+        if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())
+          break;
+        if (!cursor.parent())
+          return side < 0 ? 0 : tree.length;
+      }
+  }
+}
+var FragmentCursor = class {
+  constructor(fragments, nodeSet) {
+    this.fragments = fragments;
+    this.nodeSet = nodeSet;
+    this.i = 0;
+    this.fragment = null;
+    this.safeFrom = -1;
+    this.safeTo = -1;
+    this.trees = [];
+    this.start = [];
+    this.index = [];
+    this.nextFragment();
+  }
+  nextFragment() {
+    let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];
+    if (fr) {
+      this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;
+      this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;
+      while (this.trees.length) {
+        this.trees.pop();
+        this.start.pop();
+        this.index.pop();
+      }
+      this.trees.push(fr.tree);
+      this.start.push(-fr.offset);
+      this.index.push(0);
+      this.nextStart = this.safeFrom;
+    } else {
+      this.nextStart = 1e9;
+    }
+  }
+  // `pos` must be >= any previously given `pos` for this cursor
+  nodeAt(pos) {
+    if (pos < this.nextStart)
+      return null;
+    while (this.fragment && this.safeTo <= pos)
+      this.nextFragment();
+    if (!this.fragment)
+      return null;
+    for (; ; ) {
+      let last = this.trees.length - 1;
+      if (last < 0) {
+        this.nextFragment();
+        return null;
+      }
+      let top = this.trees[last], index = this.index[last];
+      if (index == top.children.length) {
+        this.trees.pop();
+        this.start.pop();
+        this.index.pop();
+        continue;
+      }
+      let next = top.children[index];
+      let start = this.start[last] + top.positions[index];
+      if (start > pos) {
+        this.nextStart = start;
+        return null;
+      }
+      if (next instanceof Tree) {
+        if (start == pos) {
+          if (start < this.safeFrom)
+            return null;
+          let end = start + next.length;
+          if (end <= this.safeTo) {
+            let lookAhead = next.prop(NodeProp.lookAhead);
+            if (!lookAhead || end + lookAhead < this.fragment.to)
+              return next;
+          }
+        }
+        this.index[last]++;
+        if (start + next.length >= Math.max(this.safeFrom, pos)) {
+          this.trees.push(next);
+          this.start.push(start);
+          this.index.push(0);
+        }
+      } else {
+        this.index[last]++;
+        this.nextStart = start + next.length;
+      }
+    }
+  }
+};
+var TokenCache = class {
+  constructor(parser2, stream) {
+    this.stream = stream;
+    this.tokens = [];
+    this.mainToken = null;
+    this.actions = [];
+    this.tokens = parser2.tokenizers.map((_) => new CachedToken());
+  }
+  getActions(stack) {
+    let actionIndex = 0;
+    let main = null;
+    let { parser: parser2 } = stack.p, { tokenizers } = parser2;
+    let mask = parser2.stateSlot(
+      stack.state,
+      3
+      /* ParseState.TokenizerMask */
+    );
+    let context = stack.curContext ? stack.curContext.hash : 0;
+    let lookAhead = 0;
+    for (let i = 0; i < tokenizers.length; i++) {
+      if ((1 << i & mask) == 0)
+        continue;
+      let tokenizer = tokenizers[i], token = this.tokens[i];
+      if (main && !tokenizer.fallback)
+        continue;
+      if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {
+        this.updateCachedToken(token, tokenizer, stack);
+        token.mask = mask;
+        token.context = context;
+      }
+      if (token.lookAhead > token.end + 25)
+        lookAhead = Math.max(token.lookAhead, lookAhead);
+      if (token.value != 0) {
+        let startIndex = actionIndex;
+        if (token.extended > -1)
+          actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);
+        actionIndex = this.addActions(stack, token.value, token.end, actionIndex);
+        if (!tokenizer.extend) {
+          main = token;
+          if (actionIndex > startIndex)
+            break;
+        }
+      }
+    }
+    while (this.actions.length > actionIndex)
+      this.actions.pop();
+    if (lookAhead)
+      stack.setLookAhead(lookAhead);
+    if (!main && stack.pos == this.stream.end) {
+      main = new CachedToken();
+      main.value = stack.p.parser.eofTerm;
+      main.start = main.end = stack.pos;
+      actionIndex = this.addActions(stack, main.value, main.end, actionIndex);
+    }
+    this.mainToken = main;
+    return this.actions;
+  }
+  getMainToken(stack) {
+    if (this.mainToken)
+      return this.mainToken;
+    let main = new CachedToken(), { pos, p } = stack;
+    main.start = pos;
+    main.end = Math.min(pos + 1, p.stream.end);
+    main.value = pos == p.stream.end ? p.parser.eofTerm : 0;
+    return main;
+  }
+  updateCachedToken(token, tokenizer, stack) {
+    let start = this.stream.clipPos(stack.pos);
+    tokenizer.token(this.stream.reset(start, token), stack);
+    if (token.value > -1) {
+      let { parser: parser2 } = stack.p;
+      for (let i = 0; i < parser2.specialized.length; i++)
+        if (parser2.specialized[i] == token.value) {
+          let result = parser2.specializers[i](this.stream.read(token.start, token.end), stack);
+          if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {
+            if ((result & 1) == 0)
+              token.value = result >> 1;
+            else
+              token.extended = result >> 1;
+            break;
+          }
+        }
+    } else {
+      token.value = 0;
+      token.end = this.stream.clipPos(start + 1);
+    }
+  }
+  putAction(action, token, end, index) {
+    for (let i = 0; i < index; i += 3)
+      if (this.actions[i] == action)
+        return index;
+    this.actions[index++] = action;
+    this.actions[index++] = token;
+    this.actions[index++] = end;
+    return index;
+  }
+  addActions(stack, token, end, index) {
+    let { state } = stack, { parser: parser2 } = stack.p, { data } = parser2;
+    for (let set = 0; set < 2; set++) {
+      for (let i = parser2.stateSlot(
+        state,
+        set ? 2 : 1
+        /* ParseState.Actions */
+      ); ; i += 3) {
+        if (data[i] == 65535) {
+          if (data[i + 1] == 1) {
+            i = pair(data, i + 2);
+          } else {
+            if (index == 0 && data[i + 1] == 2)
+              index = this.putAction(pair(data, i + 2), token, end, index);
+            break;
+          }
+        }
+        if (data[i] == token)
+          index = this.putAction(pair(data, i + 1), token, end, index);
+      }
+    }
+    return index;
+  }
+};
+var Rec;
+(function(Rec2) {
+  Rec2[Rec2["Distance"] = 5] = "Distance";
+  Rec2[Rec2["MaxRemainingPerStep"] = 3] = "MaxRemainingPerStep";
+  Rec2[Rec2["MinBufferLengthPrune"] = 500] = "MinBufferLengthPrune";
+  Rec2[Rec2["ForceReduceLimit"] = 10] = "ForceReduceLimit";
+  Rec2[Rec2["CutDepth"] = 15e3] = "CutDepth";
+  Rec2[Rec2["CutTo"] = 9e3] = "CutTo";
+  Rec2[Rec2["MaxLeftAssociativeReductionCount"] = 300] = "MaxLeftAssociativeReductionCount";
+  Rec2[Rec2["MaxStackCount"] = 12] = "MaxStackCount";
+})(Rec || (Rec = {}));
+var Parse = class {
+  constructor(parser2, input, fragments, ranges) {
+    this.parser = parser2;
+    this.input = input;
+    this.ranges = ranges;
+    this.recovering = 0;
+    this.nextStackID = 9812;
+    this.minStackPos = 0;
+    this.reused = [];
+    this.stoppedAt = null;
+    this.lastBigReductionStart = -1;
+    this.lastBigReductionSize = 0;
+    this.bigReductionCount = 0;
+    this.stream = new InputStream(input, ranges);
+    this.tokens = new TokenCache(parser2, this.stream);
+    this.topTerm = parser2.top[1];
+    let { from } = ranges[0];
+    this.stacks = [Stack.start(this, parser2.top[0], from)];
+    this.fragments = fragments.length && this.stream.end - from > parser2.bufferLength * 4 ? new FragmentCursor(fragments, parser2.nodeSet) : null;
+  }
+  get parsedPos() {
+    return this.minStackPos;
+  }
+  // Move the parser forward. This will process all parse stacks at
+  // `this.pos` and try to advance them to a further position. If no
+  // stack for such a position is found, it'll start error-recovery.
+  //
+  // When the parse is finished, this will return a syntax tree. When
+  // not, it returns `null`.
+  advance() {
+    let stacks = this.stacks, pos = this.minStackPos;
+    let newStacks = this.stacks = [];
+    let stopped, stoppedTokens;
+    if (this.bigReductionCount > 300 && stacks.length == 1) {
+      let [s] = stacks;
+      while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) {
+      }
+      this.bigReductionCount = this.lastBigReductionSize = 0;
+    }
+    for (let i = 0; i < stacks.length; i++) {
+      let stack = stacks[i];
+      for (; ; ) {
+        this.tokens.mainToken = null;
+        if (stack.pos > pos) {
+          newStacks.push(stack);
+        } else if (this.advanceStack(stack, newStacks, stacks)) {
+          continue;
+        } else {
+          if (!stopped) {
+            stopped = [];
+            stoppedTokens = [];
+          }
+          stopped.push(stack);
+          let tok = this.tokens.getMainToken(stack);
+          stoppedTokens.push(tok.value, tok.end);
+        }
+        break;
+      }
+    }
+    if (!newStacks.length) {
+      let finished = stopped && findFinished(stopped);
+      if (finished)
+        return this.stackToTree(finished);
+      if (this.parser.strict) {
+        if (verbose && stopped)
+          console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none"));
+        throw new SyntaxError("No parse at " + pos);
+      }
+      if (!this.recovering)
+        this.recovering = 5;
+    }
+    if (this.recovering && stopped) {
+      let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0] : this.runRecovery(stopped, stoppedTokens, newStacks);
+      if (finished)
+        return this.stackToTree(finished.forceAll());
+    }
+    if (this.recovering) {
+      let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3;
+      if (newStacks.length > maxRemaining) {
+        newStacks.sort((a, b) => b.score - a.score);
+        while (newStacks.length > maxRemaining)
+          newStacks.pop();
+      }
+      if (newStacks.some((s) => s.reducePos > pos))
+        this.recovering--;
+    } else if (newStacks.length > 1) {
+      outer:
+        for (let i = 0; i < newStacks.length - 1; i++) {
+          let stack = newStacks[i];
+          for (let j = i + 1; j < newStacks.length; j++) {
+            let other = newStacks[j];
+            if (stack.sameState(other) || stack.buffer.length > 500 && other.buffer.length > 500) {
+              if ((stack.score - other.score || stack.buffer.length - other.buffer.length) > 0) {
+                newStacks.splice(j--, 1);
+              } else {
+                newStacks.splice(i--, 1);
+                continue outer;
+              }
+            }
+          }
+        }
+      if (newStacks.length > 12)
+        newStacks.splice(
+          12,
+          newStacks.length - 12
+          /* Rec.MaxStackCount */
+        );
+    }
+    this.minStackPos = newStacks[0].pos;
+    for (let i = 1; i < newStacks.length; i++)
+      if (newStacks[i].pos < this.minStackPos)
+        this.minStackPos = newStacks[i].pos;
+    return null;
+  }
+  stopAt(pos) {
+    if (this.stoppedAt != null && this.stoppedAt < pos)
+      throw new RangeError("Can't move stoppedAt forward");
+    this.stoppedAt = pos;
+  }
+  // Returns an updated version of the given stack, or null if the
+  // stack can't advance normally. When `split` and `stacks` are
+  // given, stacks split off by ambiguous operations will be pushed to
+  // `split`, or added to `stacks` if they move `pos` forward.
+  advanceStack(stack, stacks, split) {
+    let start = stack.pos, { parser: parser2 } = this;
+    let base = verbose ? this.stackID(stack) + " -> " : "";
+    if (this.stoppedAt != null && start > this.stoppedAt)
+      return stack.forceReduce() ? stack : null;
+    if (this.fragments) {
+      let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;
+      for (let cached = this.fragments.nodeAt(start); cached; ) {
+        let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser2.getGoto(stack.state, cached.type.id) : -1;
+        if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {
+          stack.useNode(cached, match);
+          if (verbose)
+            console.log(base + this.stackID(stack) + ` (via reuse of ${parser2.getName(cached.type.id)})`);
+          return true;
+        }
+        if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)
+          break;
+        let inner = cached.children[0];
+        if (inner instanceof Tree && cached.positions[0] == 0)
+          cached = inner;
+        else
+          break;
+      }
+    }
+    let defaultReduce = parser2.stateSlot(
+      stack.state,
+      4
+      /* ParseState.DefaultReduce */
+    );
+    if (defaultReduce > 0) {
+      stack.reduce(defaultReduce);
+      if (verbose)
+        console.log(base + this.stackID(stack) + ` (via always-reduce ${parser2.getName(
+          defaultReduce & 65535
+          /* Action.ValueMask */
+        )})`);
+      return true;
+    }
+    if (stack.stack.length >= 15e3) {
+      while (stack.stack.length > 9e3 && stack.forceReduce()) {
+      }
+    }
+    let actions = this.tokens.getActions(stack);
+    for (let i = 0; i < actions.length; ) {
+      let action = actions[i++], term = actions[i++], end = actions[i++];
+      let last = i == actions.length || !split;
+      let localStack = last ? stack : stack.split();
+      localStack.apply(action, term, end);
+      if (verbose)
+        console.log(base + this.stackID(localStack) + ` (via ${(action & 65536) == 0 ? "shift" : `reduce of ${parser2.getName(
+          action & 65535
+          /* Action.ValueMask */
+        )}`} for ${parser2.getName(term)} @ ${start}${localStack == stack ? "" : ", split"})`);
+      if (last)
+        return true;
+      else if (localStack.pos > start)
+        stacks.push(localStack);
+      else
+        split.push(localStack);
+    }
+    return false;
+  }
+  // Advance a given stack forward as far as it will go. Returns the
+  // (possibly updated) stack if it got stuck, or null if it moved
+  // forward and was given to `pushStackDedup`.
+  advanceFully(stack, newStacks) {
+    let pos = stack.pos;
+    for (; ; ) {
+      if (!this.advanceStack(stack, null, null))
+        return false;
+      if (stack.pos > pos) {
+        pushStackDedup(stack, newStacks);
+        return true;
+      }
+    }
+  }
+  runRecovery(stacks, tokens, newStacks) {
+    let finished = null, restarted = false;
+    for (let i = 0; i < stacks.length; i++) {
+      let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];
+      let base = verbose ? this.stackID(stack) + " -> " : "";
+      if (stack.deadEnd) {
+        if (restarted)
+          continue;
+        restarted = true;
+        stack.restart();
+        if (verbose)
+          console.log(base + this.stackID(stack) + " (restarted)");
+        let done = this.advanceFully(stack, newStacks);
+        if (done)
+          continue;
+      }
+      let force = stack.split(), forceBase = base;
+      for (let j = 0; force.forceReduce() && j < 10; j++) {
+        if (verbose)
+          console.log(forceBase + this.stackID(force) + " (via force-reduce)");
+        let done = this.advanceFully(force, newStacks);
+        if (done)
+          break;
+        if (verbose)
+          forceBase = this.stackID(force) + " -> ";
+      }
+      for (let insert of stack.recoverByInsert(token)) {
+        if (verbose)
+          console.log(base + this.stackID(insert) + " (via recover-insert)");
+        this.advanceFully(insert, newStacks);
+      }
+      if (this.stream.end > stack.pos) {
+        if (tokenEnd == stack.pos) {
+          tokenEnd++;
+          token = 0;
+        }
+        stack.recoverByDelete(token, tokenEnd);
+        if (verbose)
+          console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);
+        pushStackDedup(stack, newStacks);
+      } else if (!finished || finished.score < stack.score) {
+        finished = stack;
+      }
+    }
+    return finished;
+  }
+  // Convert the stack's buffer to a syntax tree.
+  stackToTree(stack) {
+    stack.close();
+    return Tree.build({
+      buffer: StackBufferCursor.create(stack),
+      nodeSet: this.parser.nodeSet,
+      topID: this.topTerm,
+      maxBufferLength: this.parser.bufferLength,
+      reused: this.reused,
+      start: this.ranges[0].from,
+      length: stack.pos - this.ranges[0].from,
+      minRepeatType: this.parser.minRepeatTerm
+    });
+  }
+  stackID(stack) {
+    let id = (stackIDs || (stackIDs = /* @__PURE__ */ new WeakMap())).get(stack);
+    if (!id)
+      stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));
+    return id + stack;
+  }
+};
+function pushStackDedup(stack, newStacks) {
+  for (let i = 0; i < newStacks.length; i++) {
+    let other = newStacks[i];
+    if (other.pos == stack.pos && other.sameState(stack)) {
+      if (newStacks[i].score < stack.score)
+        newStacks[i] = stack;
+      return;
+    }
+  }
+  newStacks.push(stack);
+}
+var Dialect = class {
+  constructor(source, flags, disabled) {
+    this.source = source;
+    this.flags = flags;
+    this.disabled = disabled;
+  }
+  allows(term) {
+    return !this.disabled || this.disabled[term] == 0;
+  }
+};
+var LRParser = class extends Parser {
+  /// @internal
+  constructor(spec) {
+    super();
+    this.wrappers = [];
+    if (spec.version != 14)
+      throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14})`);
+    let nodeNames = spec.nodeNames.split(" ");
+    this.minRepeatTerm = nodeNames.length;
+    for (let i = 0; i < spec.repeatNodeCount; i++)
+      nodeNames.push("");
+    let topTerms = Object.keys(spec.topRules).map((r) => spec.topRules[r][1]);
+    let nodeProps = [];
+    for (let i = 0; i < nodeNames.length; i++)
+      nodeProps.push([]);
+    function setProp(nodeID, prop, value) {
+      nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);
+    }
+    if (spec.nodeProps)
+      for (let propSpec of spec.nodeProps) {
+        let prop = propSpec[0];
+        if (typeof prop == "string")
+          prop = NodeProp[prop];
+        for (let i = 1; i < propSpec.length; ) {
+          let next = propSpec[i++];
+          if (next >= 0) {
+            setProp(next, prop, propSpec[i++]);
+          } else {
+            let value = propSpec[i + -next];
+            for (let j = -next; j > 0; j--)
+              setProp(propSpec[i++], prop, value);
+            i++;
+          }
+        }
+      }
+    this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({
+      name: i >= this.minRepeatTerm ? void 0 : name,
+      id: i,
+      props: nodeProps[i],
+      top: topTerms.indexOf(i) > -1,
+      error: i == 0,
+      skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1
+    })));
+    if (spec.propSources)
+      this.nodeSet = this.nodeSet.extend(...spec.propSources);
+    this.strict = false;
+    this.bufferLength = DefaultBufferLength;
+    let tokenArray = decodeArray(spec.tokenData);
+    this.context = spec.context;
+    this.specializerSpecs = spec.specialized || [];
+    this.specialized = new Uint16Array(this.specializerSpecs.length);
+    for (let i = 0; i < this.specializerSpecs.length; i++)
+      this.specialized[i] = this.specializerSpecs[i].term;
+    this.specializers = this.specializerSpecs.map(getSpecializer);
+    this.states = decodeArray(spec.states, Uint32Array);
+    this.data = decodeArray(spec.stateData);
+    this.goto = decodeArray(spec.goto);
+    this.maxTerm = spec.maxTerm;
+    this.tokenizers = spec.tokenizers.map((value) => typeof value == "number" ? new TokenGroup(tokenArray, value) : value);
+    this.topRules = spec.topRules;
+    this.dialects = spec.dialects || {};
+    this.dynamicPrecedences = spec.dynamicPrecedences || null;
+    this.tokenPrecTable = spec.tokenPrec;
+    this.termNames = spec.termNames || null;
+    this.maxNode = this.nodeSet.types.length - 1;
+    this.dialect = this.parseDialect();
+    this.top = this.topRules[Object.keys(this.topRules)[0]];
+  }
+  createParse(input, fragments, ranges) {
+    let parse = new Parse(this, input, fragments, ranges);
+    for (let w of this.wrappers)
+      parse = w(parse, input, fragments, ranges);
+    return parse;
+  }
+  /// Get a goto table entry @internal
+  getGoto(state, term, loose = false) {
+    let table = this.goto;
+    if (term >= table[0])
+      return -1;
+    for (let pos = table[term + 1]; ; ) {
+      let groupTag = table[pos++], last = groupTag & 1;
+      let target = table[pos++];
+      if (last && loose)
+        return target;
+      for (let end = pos + (groupTag >> 1); pos < end; pos++)
+        if (table[pos] == state)
+          return target;
+      if (last)
+        return -1;
+    }
+  }
+  /// Check if this state has an action for a given terminal @internal
+  hasAction(state, terminal) {
+    let data = this.data;
+    for (let set = 0; set < 2; set++) {
+      for (let i = this.stateSlot(
+        state,
+        set ? 2 : 1
+        /* ParseState.Actions */
+      ), next; ; i += 3) {
+        if ((next = data[i]) == 65535) {
+          if (data[i + 1] == 1)
+            next = data[i = pair(data, i + 2)];
+          else if (data[i + 1] == 2)
+            return pair(data, i + 2);
+          else
+            break;
+        }
+        if (next == terminal || next == 0)
+          return pair(data, i + 1);
+      }
+    }
+    return 0;
+  }
+  /// @internal
+  stateSlot(state, slot) {
+    return this.states[state * 6 + slot];
+  }
+  /// @internal
+  stateFlag(state, flag) {
+    return (this.stateSlot(
+      state,
+      0
+      /* ParseState.Flags */
+    ) & flag) > 0;
+  }
+  /// @internal
+  validAction(state, action) {
+    if (action == this.stateSlot(
+      state,
+      4
+      /* ParseState.DefaultReduce */
+    ))
+      return true;
+    for (let i = this.stateSlot(
+      state,
+      1
+      /* ParseState.Actions */
+    ); ; i += 3) {
+      if (this.data[i] == 65535) {
+        if (this.data[i + 1] == 1)
+          i = pair(this.data, i + 2);
+        else
+          return false;
+      }
+      if (action == pair(this.data, i + 1))
+        return true;
+    }
+  }
+  /// Get the states that can follow this one through shift actions or
+  /// goto jumps. @internal
+  nextStates(state) {
+    let result = [];
+    for (let i = this.stateSlot(
+      state,
+      1
+      /* ParseState.Actions */
+    ); ; i += 3) {
+      if (this.data[i] == 65535) {
+        if (this.data[i + 1] == 1)
+          i = pair(this.data, i + 2);
+        else
+          break;
+      }
+      if ((this.data[i + 2] & 65536 >> 16) == 0) {
+        let value = this.data[i + 1];
+        if (!result.some((v, i2) => i2 & 1 && v == value))
+          result.push(this.data[i], value);
+      }
+    }
+    return result;
+  }
+  /// Configure the parser. Returns a new parser instance that has the
+  /// given settings modified. Settings not provided in `config` are
+  /// kept from the original parser.
+  configure(config) {
+    let copy = Object.assign(Object.create(LRParser.prototype), this);
+    if (config.props)
+      copy.nodeSet = this.nodeSet.extend(...config.props);
+    if (config.top) {
+      let info2 = this.topRules[config.top];
+      if (!info2)
+        throw new RangeError(`Invalid top rule name ${config.top}`);
+      copy.top = info2;
+    }
+    if (config.tokenizers)
+      copy.tokenizers = this.tokenizers.map((t) => {
+        let found = config.tokenizers.find((r) => r.from == t);
+        return found ? found.to : t;
+      });
+    if (config.specializers) {
+      copy.specializers = this.specializers.slice();
+      copy.specializerSpecs = this.specializerSpecs.map((s, i) => {
+        let found = config.specializers.find((r) => r.from == s.external);
+        if (!found)
+          return s;
+        let spec = Object.assign(Object.assign({}, s), { external: found.to });
+        copy.specializers[i] = getSpecializer(spec);
+        return spec;
+      });
+    }
+    if (config.contextTracker)
+      copy.context = config.contextTracker;
+    if (config.dialect)
+      copy.dialect = this.parseDialect(config.dialect);
+    if (config.strict != null)
+      copy.strict = config.strict;
+    if (config.wrap)
+      copy.wrappers = copy.wrappers.concat(config.wrap);
+    if (config.bufferLength != null)
+      copy.bufferLength = config.bufferLength;
+    return copy;
+  }
+  /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)
+  /// are registered for this parser.
+  hasWrappers() {
+    return this.wrappers.length > 0;
+  }
+  /// Returns the name associated with a given term. This will only
+  /// work for all terms when the parser was generated with the
+  /// `--names` option. By default, only the names of tagged terms are
+  /// stored.
+  getName(term) {
+    return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);
+  }
+  /// The eof term id is always allocated directly after the node
+  /// types. @internal
+  get eofTerm() {
+    return this.maxNode + 1;
+  }
+  /// The type of top node produced by the parser.
+  get topNode() {
+    return this.nodeSet.types[this.top[1]];
+  }
+  /// @internal
+  dynamicPrecedence(term) {
+    let prec = this.dynamicPrecedences;
+    return prec == null ? 0 : prec[term] || 0;
+  }
+  /// @internal
+  parseDialect(dialect) {
+    let values = Object.keys(this.dialects), flags = values.map(() => false);
+    if (dialect)
+      for (let part of dialect.split(" ")) {
+        let id = values.indexOf(part);
+        if (id >= 0)
+          flags[id] = true;
+      }
+    let disabled = null;
+    for (let i = 0; i < values.length; i++)
+      if (!flags[i]) {
+        for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535; )
+          (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;
+      }
+    return new Dialect(dialect, flags, disabled);
+  }
+  /// Used by the output of the parser generator. Not available to
+  /// user code. @hide
+  static deserialize(spec) {
+    return new LRParser(spec);
+  }
 };
+function pair(data, off) {
+  return data[off] | data[off + 1] << 16;
+}
+function findFinished(stacks) {
+  let best = null;
+  for (let stack of stacks) {
+    let stopped = stack.p.stoppedAt;
+    if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) && stack.p.parser.stateFlag(
+      stack.state,
+      2
+      /* StateFlag.Accepting */
+    ) && (!best || best.score < stack.score))
+      best = stack;
+  }
+  return best;
+}
+function getSpecializer(spec) {
+  if (spec.external) {
+    let mask = spec.extend ? 1 : 0;
+    return (value, stack) => spec.external(value, stack) << 1 | mask;
+  }
+  return spec.get;
+}
 
-// src/TableHeaderCell.tsx
-import { jsx as jsx8, jsxs as jsxs5 } from "react/jsx-runtime";
-var classBase4 = "vuuTable-headerCell";
-var TableHeaderCell = ({
-  column,
-  className: classNameProp,
-  onClick,
-  onDragStart,
-  onResize,
-  ...props
-}) => {
-  const rootRef = useRef5(null);
-  const { isResizing, ...resizeProps } = useTableColumnResize({
-    column,
-    onResize,
-    rootRef
-  });
-  const showContextMenu = useContextMenu2();
-  const dragTimerRef = useRef5(null);
-  const handleContextMenu = (e) => {
-    showContextMenu(e, "header", { column });
-  };
-  const handleClick = useCallback7(
-    (evt) => !isResizing && (onClick == null ? void 0 : onClick(evt)),
-    [isResizing, onClick]
-  );
-  const handleMouseDown = useCallback7(
-    (evt) => {
-      dragTimerRef.current = window.setTimeout(() => {
-        onDragStart == null ? void 0 : onDragStart(evt);
-        dragTimerRef.current = null;
-      }, 500);
-    },
-    [onDragStart]
-  );
-  const handleMouseUp = useCallback7(() => {
-    if (dragTimerRef.current !== null) {
-      window.clearTimeout(dragTimerRef.current);
-      dragTimerRef.current = null;
+// ../vuu-filter-parser/src/generated/filter-parser.js
+var parser = LRParser.deserialize({
+  version: 14,
+  states: "%QOVQPOOOOQO'#C_'#C_O_QQO'#C^OOQO'#DO'#DOOvQQO'#C|OOQO'#DR'#DROVQPO'#CuOOQO'#C}'#C}QOQPOOOOQO'#C`'#C`O!UQQO,58xO!dQPO,59VOVQPO,59]OVQPO,59_O!iQPO,59hO!nQQO,59aOOQO'#DQ'#DQOOQO1G.d1G.dO!UQQO1G.qO!yQQO1G.wOOQO1G.y1G.yOOQO'#Cw'#CwOOQO1G/S1G/SOOQO1G.{1G.{O#[QPO'#CnO#dQPO7+$]O!UQQO'#CxO#iQPO,59YOOQO<<Gw<<GwOOQO,59d,59dOOQO-E6v-E6v",
+  stateData: "#q~OoOS~OsPOvUO~OTXOUXOVXOWXOXXOYXO`ZO~Of[Oh]Oj^OmpX~OZ`O[`O]`O^`O~OabO~OseO~Of[Oh]OwgO~Oh]Ofeijeimeiwei~OcjOdbX~OdlO~OcjOdba~O",
+  goto: "#YvPPw}!TPPPPPPPPPPwPP!WPP!ZP!ZP!aP!g!jPPP!p!s!aP#P!aXROU[]XQOU[]RYQRibXTOU[]XVOU[]Rf^QkhRnkRWOQSOQ_UQc[Rd]QaYQhbRmj",
+  nodeNames: "\u26A0 Filter ColumnValueExpression Column Operator Eq NotEq Gt Lt Starts Ends Number String True False ColumnSetExpression In LBrack Values Comma RBrack AndExpression And OrExpression Or ParenthesizedExpression As FilterName",
+  maxTerm: 39,
+  skippedNodes: [0],
+  repeatNodeCount: 1,
+  tokenData: "6p~RnXY#PYZ#P]^#Ppq#Pqr#brs#mxy$eyz$j|}$o!O!P$t!Q![%S!^!_%_!_!`%d!`!a%i!c!}%n!}#O&V#P#Q&[#R#S%n#T#U&a#U#X%n#X#Y(w#Y#Z+]#Z#]%n#]#^.]#^#c%n#c#d/e#d#g%n#g#h0m#h#i4[#i#o%n~#USo~XY#PYZ#P]^#Ppq#P~#eP!_!`#h~#mOU~~#pWOX#mZ]#m^r#mrs$Ys#O#m#P;'S#m;'S;=`$_<%lO#m~$_O[~~$bP;=`<%l#m~$jOv~~$oOw~~$tOc~~$wP!Q![$z~%PPZ~!Q![$z~%XQZ~!O!P$t!Q![%S~%dOW~~%iOT~~%nOV~P%sUsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n~&[Oa~~&aOd~R&fYsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c'U#c#g%n#g#h(^#h#o%nR'ZWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X's#X#o%nR'zUfQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(eUjQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c)f#c#o%nR)kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X*T#X#o%nR*YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h*r#h#o%nR*yUYQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR+bVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U+w#U#o%nR+|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#`%n#`#a,f#a#o%nR,kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h-T#h#o%nR-YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y-r#Y#o%nR-yU^QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR.bWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c.z#c#o%nR/RU`QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR/jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g0S#g#o%nR0ZUhQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR0rWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i1[#i#o%nR1aVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U1v#U#o%nR1{WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g2e#g#o%nR2jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i3S#i#o%nR3XWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h3q#h#o%nR3xUXQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR4aWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g4y#g#o%nR5OWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#i%n#i#j5h#j#o%nR5mWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y6V#Y#o%nR6^U]QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n",
+  tokenizers: [0, 1],
+  topRules: { "Filter": [0, 1] },
+  tokenPrec: 0
+});
+
+// ../vuu-filter-parser/src/FilterTreeWalker.ts
+import {
+  isMultiClauseFilter,
+  isMultiValueFilter,
+  isSingleValueFilter
+} from "@vuu-ui/vuu-utils";
+var _filter;
+var FilterExpression = class {
+  constructor() {
+    __privateAdd(this, _filter, void 0);
+  }
+  setFilterCombinatorOp(op, filter = __privateGet(this, _filter)) {
+    if (isMultiClauseFilter(filter) && filter.op === op) {
+      return;
+    } else {
+      __privateSet(this, _filter, {
+        op,
+        filters: [__privateGet(this, _filter)]
+      });
     }
-  }, []);
-  const className = cx6(classBase4, classNameProp, {
-    vuuPinFloating: column.pin === "floating",
-    vuuPinLeft: column.pin === "left",
-    vuuPinRight: column.pin === "right",
-    vuuEndPin: column.endPin,
-    [`${classBase4}-resizing`]: column.resizing,
-    [`${classBase4}-right`]: column.align === "right"
-  });
-  return /* @__PURE__ */ jsx8(
-    "div",
-    {
-      className,
-      ...props,
-      onClick: handleClick,
-      onContextMenu: handleContextMenu,
-      onMouseDown: handleMouseDown,
-      onMouseUp: handleMouseUp,
-      ref: rootRef,
-      children: /* @__PURE__ */ jsxs5("div", { className: `${classBase4}-inner`, children: [
-        /* @__PURE__ */ jsx8(FilterIndicator, { column }),
-        /* @__PURE__ */ jsx8("div", { className: `${classBase4}-label`, children: column.label }),
-        /* @__PURE__ */ jsx8(SortIndicator, { sorted: column.sorted }),
-        column.resizeable !== false ? /* @__PURE__ */ jsx8(ColumnResizer, { ...resizeProps }) : null
-      ] })
+  }
+  add(filter) {
+    if (__privateGet(this, _filter) === void 0) {
+      __privateSet(this, _filter, filter);
+    } else if (isMultiClauseFilter(__privateGet(this, _filter))) {
+      __privateGet(this, _filter).filters.push(filter);
+    } else {
+      throw Error(`Invalid filter passed to FilterExpression`);
     }
-  );
-};
-
-// src/RowBasedTable.tsx
-import { jsx as jsx9, jsxs as jsxs6 } from "react/jsx-runtime";
-var classBase5 = "vuuTable";
-var { RENDER_IDX } = metadataKeys4;
-var RowBasedTable = ({
-  columns,
-  columnsWithinViewport,
-  data,
-  getRowOffset,
-  headings,
-  onColumnResize,
-  onHeaderCellDragStart,
-  onContextMenu,
-  onRemoveColumnFromGroupBy,
-  onRowClick,
-  onSort,
-  onToggleGroup,
-  tableId,
-  virtualColSpan = 0,
-  rowCount
-}) => {
-  const handleDragStart = useCallback8(
-    (evt) => {
-      onHeaderCellDragStart == null ? void 0 : onHeaderCellDragStart(evt);
-    },
-    [onHeaderCellDragStart]
-  );
-  const visibleColumns = useMemo(() => {
-    return columns.filter(notHidden2);
-  }, [columns]);
-  const columnMap = useMemo(() => buildColumnMap(columns), [columns]);
-  const handleHeaderClick = useCallback8(
-    (evt) => {
-      var _a;
-      const targetElement = evt.target;
-      const headerCell = targetElement.closest(
-        ".vuuTable-headerCell"
-      );
-      const colIdx = parseInt((_a = headerCell == null ? void 0 : headerCell.dataset.idx) != null ? _a : "-1");
-      const column = visibleColumnAtIndex(columns, colIdx);
-      const isAdditive = evt.shiftKey;
-      column && onSort(column, isAdditive);
-    },
-    [columns, onSort]
-  );
-  return /* @__PURE__ */ jsxs6("div", { "aria-rowcount": rowCount, className: `${classBase5}-table`, role: "table", children: [
-    /* @__PURE__ */ jsxs6("div", { className: `${classBase5}-headers`, role: "rowGroup", children: [
-      headings.map((colHeaders, i) => /* @__PURE__ */ jsx9("div", { className: "vuuTable-heading", children: colHeaders.map(({ label, width }, j) => /* @__PURE__ */ jsx9("div", { className: "vuuTable-headingCell", style: { width }, children: label }, j)) }, i)),
-      /* @__PURE__ */ jsx9("div", { role: "row", children: visibleColumns.map((column, i) => {
-        const style = getColumnStyle3(column);
-        return isGroupColumn2(column) ? /* @__PURE__ */ jsx9(
-          TableGroupHeaderCell,
-          {
-            column,
-            "data-idx": i,
-            onRemoveColumn: onRemoveColumnFromGroupBy,
-            onResize: onColumnResize,
-            role: "columnHeader",
-            style
-          },
-          i
-        ) : /* @__PURE__ */ jsx9(
-          TableHeaderCell,
-          {
-            column,
-            "data-idx": i,
-            id: `${tableId}-${i}`,
-            onClick: handleHeaderClick,
-            onDragStart: handleDragStart,
-            onResize: onColumnResize,
-            role: "columnHeader",
-            style
-          },
-          i
-        );
-      }) })
-    ] }),
-    /* @__PURE__ */ jsx9(
-      "div",
-      {
-        className: `${classBase5}-body`,
-        onContextMenu,
-        role: "rowGroup",
-        children: data == null ? void 0 : data.map((row) => /* @__PURE__ */ jsx9(
-          TableRow,
-          {
-            columnMap,
-            columns: columnsWithinViewport,
-            offset: getRowOffset(row),
-            onClick: onRowClick,
-            virtualColSpan,
-            onToggleGroup,
-            row
-          },
-          row[RENDER_IDX]
-        ))
+  }
+  setColumn(column, filter = __privateGet(this, _filter)) {
+    if (isMultiClauseFilter(filter)) {
+      const target = filter.filters.at(-1);
+      if (target) {
+        this.setColumn(column, target);
       }
-    )
-  ] });
+    } else if (filter) {
+      filter.column = column;
+    }
+  }
+  setOp(value, filter = __privateGet(this, _filter)) {
+    if (isMultiClauseFilter(filter)) {
+      const target = filter.filters.at(-1);
+      if (target) {
+        this.setOp(value, target);
+      }
+    } else if (filter) {
+      filter.op = value;
+    }
+  }
+  setValue(value, filter = __privateGet(this, _filter)) {
+    var _a;
+    if (isMultiClauseFilter(filter)) {
+      const target = filter.filters.at(-1);
+      if (target) {
+        this.setValue(value, target);
+      }
+    } else if (isMultiValueFilter(filter)) {
+      (_a = filter.values) != null ? _a : filter.values = [];
+      filter.values.push(value);
+    } else if (isSingleValueFilter(filter)) {
+      filter.value = value;
+    }
+  }
+  toJSON(filter = __privateGet(this, _filter)) {
+    if (this.name) {
+      return {
+        ...filter,
+        name: this.name
+      };
+    } else {
+      return filter;
+    }
+  }
 };
+_filter = new WeakMap();
 
-// src/useTable.ts
-import { useContextMenu as usePopupContextMenu } from "@vuu-ui/vuu-popups";
+// ../vuu-filter-parser/src/FilterParser.ts
+var strictParser = parser.configure({ strict: true });
+
+// ../vuu-data-react/src/hooks/useVuuMenuActions.ts
 import {
-  applySort,
-  buildColumnMap as buildColumnMap2,
-  isJsonGroup as isJsonGroup2,
-  metadataKeys as metadataKeys8,
-  moveItem as moveItem2
+  getRowRecord,
+  isGroupMenuItemDescriptor,
+  metadataKeys as metadataKeys6
 } from "@vuu-ui/vuu-utils";
-import {
-  useCallback as useCallback18,
-  useEffect as useEffect5,
-  useMemo as useMemo7,
-  useRef as useRef15,
-  useState as useState5
-} from "react";
+import { useCallback as useCallback13 } from "react";
+var { KEY: KEY2 } = metadataKeys6;
+var isVisualLinksAction = (action) => action.type === "vuu-links";
+var isViewportMenusAction = (action) => action.type === "vuu-menu";
+var isVuuFeatureAction = (action) => isViewportMenusAction(action) || isVisualLinksAction(action);
+var isVuuFeatureInvocation = (action) => action.type === "vuu-link-created" || action.type === "vuu-link-removed";
+
+// ../vuu-data-react/src/hooks/useVuuTables.ts
+import { useCallback as useCallback14, useEffect as useEffect4, useState as useState5 } from "react";
+import { getServerAPI } from "@vuu-ui/vuu-data";
 
 // src/useDataSource.ts
-import {
-  isVuuFeatureAction,
-  isVuuFeatureInvocation
-} from "@vuu-ui/vuu-data";
-import { getFullRange, metadataKeys as metadataKeys5, WindowRange } from "@vuu-ui/vuu-utils";
-import { useCallback as useCallback9, useEffect, useMemo as useMemo2, useRef as useRef6, useState as useState2 } from "react";
-var { SELECTED: SELECTED2 } = metadataKeys5;
+import { getFullRange as getFullRange2, metadataKeys as metadataKeys7, WindowRange as WindowRange2 } from "@vuu-ui/vuu-utils";
+import { useCallback as useCallback15, useEffect as useEffect5, useMemo as useMemo3, useRef as useRef7, useState as useState6 } from "react";
+var { SELECTED: SELECTED3 } = metadataKeys7;
 function useDataSource({
   dataSource,
   onConfigChange,
@@ -968,18 +4045,18 @@ function useDataSource({
   renderBufferSize = 0,
   viewportRowCount
 }) {
-  const [, forceUpdate] = useState2(null);
-  const isMounted = useRef6(true);
-  const hasUpdated = useRef6(false);
-  const rangeRef = useRef6({ from: 0, to: 0 });
-  const rafHandle = useRef6(null);
-  const data = useRef6([]);
-  const dataWindow = useMemo2(
-    () => new MovingWindow(getFullRange(range)),
+  const [, forceUpdate] = useState6(null);
+  const isMounted = useRef7(true);
+  const hasUpdated = useRef7(false);
+  const rangeRef = useRef7({ from: 0, to: 0 });
+  const rafHandle = useRef7(null);
+  const data = useRef7([]);
+  const dataWindow = useMemo3(
+    () => new MovingWindow(getFullRange2(range)),
     // eslint-disable-next-line react-hooks/exhaustive-deps
     []
   );
-  const setData = useCallback9(
+  const setData = useCallback15(
     (updates) => {
       for (const row of updates) {
         dataWindow.add(row);
@@ -989,7 +4066,7 @@ function useDataSource({
     },
     [dataWindow]
   );
-  const datasourceMessageHandler = useCallback9(
+  const datasourceMessageHandler = useCallback15(
     (message) => {
       if (message.type === "subscribed") {
         onSubscribed == null ? void 0 : onSubscribed(message);
@@ -1021,7 +4098,7 @@ function useDataSource({
       setData
     ]
   );
-  useEffect(
+  useEffect5(
     () => () => {
       if (rafHandle.current) {
         cancelAnimationFrame(rafHandle.current);
@@ -1031,7 +4108,7 @@ function useDataSource({
     },
     []
   );
-  const refreshIfUpdated = useCallback9(() => {
+  const refreshIfUpdated = useCallback15(() => {
     if (isMounted.current) {
       if (hasUpdated.current) {
         forceUpdate({});
@@ -1040,33 +4117,33 @@ function useDataSource({
       rafHandle.current = requestAnimationFrame(refreshIfUpdated);
     }
   }, [forceUpdate]);
-  useEffect(() => {
+  useEffect5(() => {
     rafHandle.current = requestAnimationFrame(refreshIfUpdated);
   }, [refreshIfUpdated]);
-  const adjustRange = useCallback9(
+  const adjustRange = useCallback15(
     (rowCount) => {
       const { from } = dataSource.range;
       const rowRange = { from, to: from + rowCount };
-      const fullRange = getFullRange(rowRange, renderBufferSize);
+      const fullRange = getFullRange2(rowRange, renderBufferSize);
       dataWindow.setRange(fullRange);
       dataSource.range = rangeRef.current = fullRange;
       dataSource.emit("range", rowRange);
     },
     [dataSource, dataWindow, renderBufferSize]
   );
-  const setRange = useCallback9(
+  const setRange = useCallback15(
     (range2) => {
-      const fullRange = getFullRange(range2, renderBufferSize);
+      const fullRange = getFullRange2(range2, renderBufferSize);
       dataWindow.setRange(fullRange);
       dataSource.range = rangeRef.current = fullRange;
       dataSource.emit("range", range2);
     },
     [dataSource, dataWindow, renderBufferSize]
   );
-  const getSelectedRows = useCallback9(() => {
+  const getSelectedRows = useCallback15(() => {
     return dataWindow.getSelectedRows();
   }, [dataWindow]);
-  useEffect(() => {
+  useEffect5(() => {
     dataSource == null ? void 0 : dataSource.subscribe(
       {
         range: rangeRef.current
@@ -1074,7 +4151,7 @@ function useDataSource({
       datasourceMessageHandler
     );
   }, [dataSource, datasourceMessageHandler, onConfigChange]);
-  useEffect(() => {
+  useEffect5(() => {
     adjustRange(viewportRowCount);
   }, [adjustRange, viewportRowCount]);
   return {
@@ -1094,7 +4171,7 @@ var MovingWindow = class {
       }
       this.rowCount = rowCount;
     };
-    this.range = new WindowRange(from, to);
+    this.range = new WindowRange2(from, to);
     this.data = new Array(to - from);
     this.rowCount = 0;
   }
@@ -1104,12 +4181,12 @@ var MovingWindow = class {
     if (this.isWithinRange(index)) {
       const internalIndex = index - this.range.from;
       this.data[internalIndex] = data;
-      const isSelected = data[SELECTED2];
-      const preSelected = (_a = this.data[internalIndex - 1]) == null ? void 0 : _a[SELECTED2];
+      const isSelected = data[SELECTED3];
+      const preSelected = (_a = this.data[internalIndex - 1]) == null ? void 0 : _a[SELECTED3];
       if (preSelected === 0 && isSelected) {
-        this.data[internalIndex - 1][SELECTED2] = 2;
+        this.data[internalIndex - 1][SELECTED3] = 2;
       } else if (preSelected === 2 && !isSelected) {
-        this.data[internalIndex - 1][SELECTED2] = 0;
+        this.data[internalIndex - 1][SELECTED3] = 0;
       }
     }
   }
@@ -1136,17 +4213,17 @@ var MovingWindow = class {
     }
   }
   getSelectedRows() {
-    return this.data.filter((row) => row[SELECTED2] === 1);
+    return this.data.filter((row) => row[SELECTED3] === 1);
   }
 };
 
 // src/useDraggableColumn.ts
 import { useDragDrop } from "@heswell/salt-lab";
-import { useCallback as useCallback10, useRef as useRef7 } from "react";
+import { useCallback as useCallback16, useRef as useRef8 } from "react";
 var useDraggableColumn = ({ onDrop }) => {
-  const mousePosRef = useRef7();
-  const containerRef = useRef7(null);
-  const handleDropSettle = useCallback10(() => {
+  const mousePosRef = useRef8();
+  const containerRef = useRef8(null);
+  const handleDropSettle = useCallback16(() => {
     console.log(`handleDropSettle`);
     mousePosRef.current = void 0;
     containerRef.current = null;
@@ -1161,7 +4238,7 @@ var useDraggableColumn = ({ onDrop }) => {
     onDrop,
     onDropSettle: handleDropSettle
   });
-  const onHeaderCellDragStart = useCallback10(
+  const onHeaderCellDragStart = useCallback16(
     (evt) => {
       const { clientX, clientY } = evt;
       console.log(
@@ -1194,11 +4271,11 @@ var useDraggableColumn = ({ onDrop }) => {
 // src/useKeyboardNavigation.ts
 import { withinRange } from "@vuu-ui/vuu-utils";
 import {
-  useCallback as useCallback11,
-  useEffect as useEffect2,
+  useCallback as useCallback17,
+  useEffect as useEffect6,
   useLayoutEffect,
-  useMemo as useMemo3,
-  useRef as useRef8
+  useMemo as useMemo4,
+  useRef as useRef9
 } from "react";
 
 // src/keyUtils.ts
@@ -1304,10 +4381,10 @@ var useKeyboardNavigation = ({
 }) => {
   var _a;
   const { from: viewportFirstRow, to: viewportLastRow } = viewportRange;
-  const focusedCellPos = useRef8([-1, -1]);
-  const focusableCell = useRef8();
-  const activeCellPos = useRef8([-1, 0]);
-  const getTableCell = useCallback11(
+  const focusedCellPos = useRef9([-1, -1]);
+  const focusableCell = useRef9();
+  const activeCellPos = useRef9([-1, 0]);
+  const getTableCell = useCallback17(
     ([rowIdx, colIdx]) => {
       var _a2;
       const cssQuery = rowIdx === -1 ? headerCellQuery(colIdx) : dataCellQuery(rowIdx, colIdx);
@@ -1335,7 +4412,7 @@ var useKeyboardNavigation = ({
     }
     return NULL_CELL_POS;
   };
-  const focusCell = useCallback11(
+  const focusCell = useCallback17(
     (cellPos) => {
       var _a2;
       if (containerRef.current) {
@@ -1357,7 +4434,7 @@ var useKeyboardNavigation = ({
     // be often whilst scrolling - store range in a a ref ?
     [containerRef, getTableCell, requestScroll, viewportRange]
   );
-  const setActiveCell = useCallback11(
+  const setActiveCell = useCallback17(
     (rowIdx, colIdx, fromKeyboard = false) => {
       const pos = [rowIdx, colIdx];
       activeCellPos.current = pos;
@@ -1368,12 +4445,12 @@ var useKeyboardNavigation = ({
     },
     [focusCell]
   );
-  const virtualizeActiveCell = useCallback11(() => {
+  const virtualizeActiveCell = useCallback17(() => {
     var _a2;
     (_a2 = focusableCell.current) == null ? void 0 : _a2.setAttribute("tabindex", "");
     focusableCell.current = void 0;
   }, []);
-  const nextPageItemIdx = useCallback11(
+  const nextPageItemIdx = useCallback17(
     async (key, cellPos) => {
       switch (key) {
         case PageDown:
@@ -1393,7 +4470,7 @@ var useKeyboardNavigation = ({
     },
     [requestScroll]
   );
-  const handleFocus = useCallback11(() => {
+  const handleFocus = useCallback17(() => {
     var _a2;
     if (disableHighlightOnFocus !== true) {
       if ((_a2 = containerRef.current) == null ? void 0 : _a2.contains(document.activeElement)) {
@@ -1404,7 +4481,7 @@ var useKeyboardNavigation = ({
       }
     }
   }, [disableHighlightOnFocus, containerRef]);
-  const navigateChildItems = useCallback11(
+  const navigateChildItems = useCallback17(
     async (key) => {
       const [nextRowIdx, nextColIdx] = isPagingKey(key) ? await nextPageItemIdx(key, activeCellPos.current) : nextCellPos(key, activeCellPos.current, columnCount, rowCount);
       const [rowIdx, colIdx] = activeCellPos.current;
@@ -1414,7 +4491,7 @@ var useKeyboardNavigation = ({
     },
     [columnCount, nextPageItemIdx, rowCount, setActiveCell]
   );
-  const handleKeyDown = useCallback11(
+  const handleKeyDown = useCallback17(
     (e) => {
       if (data.length > 0 && isNavigationKey(e.key)) {
         e.preventDefault();
@@ -1424,7 +4501,7 @@ var useKeyboardNavigation = ({
     },
     [data, navigateChildItems]
   );
-  const handleClick = useCallback11(
+  const handleClick = useCallback17(
     // Might not be a cell e.g the Settings button
     (evt) => {
       const target = evt.target;
@@ -1436,7 +4513,7 @@ var useKeyboardNavigation = ({
     },
     [setActiveCell]
   );
-  const containerProps = useMemo3(() => {
+  const containerProps = useMemo4(() => {
     return {
       onClick: handleClick,
       onFocus: handleFocus,
@@ -1453,7 +4530,7 @@ var useKeyboardNavigation = ({
     }
   }, [focusCell, viewportFirstRow, viewportLastRow, virtualizeActiveCell]);
   const fullyRendered = ((_a = containerRef.current) == null ? void 0 : _a.firstChild) != null;
-  useEffect2(() => {
+  useEffect6(() => {
     var _a2;
     if (fullyRendered && focusableCell.current === void 0) {
       const headerCell = (_a2 = containerRef.current) == null ? void 0 : _a2.querySelector(
@@ -1470,10 +4547,10 @@ var useKeyboardNavigation = ({
 
 // src/useMeasuredContainer.ts
 import { isValidNumber } from "@vuu-ui/vuu-utils";
-import { useCallback as useCallback13, useMemo as useMemo4, useRef as useRef10, useState as useState3 } from "react";
+import { useCallback as useCallback19, useMemo as useMemo5, useRef as useRef11, useState as useState7 } from "react";
 
 // src/useResizeObserver.ts
-import { useCallback as useCallback12, useEffect as useEffect3, useRef as useRef9 } from "react";
+import { useCallback as useCallback18, useEffect as useEffect7, useRef as useRef10 } from "react";
 var observedMap = /* @__PURE__ */ new Map();
 var getTargetSize = (element, size, dimension) => {
   switch (dimension) {
@@ -1524,8 +4601,8 @@ var resizeObserver = new ResizeObserver((entries) => {
   }
 });
 function useResizeObserver(ref, dimensions, onResize, reportInitialSize = false) {
-  const dimensionsRef = useRef9(dimensions);
-  const measure = useCallback12((target) => {
+  const dimensionsRef = useRef10(dimensions);
+  const measure = useCallback18((target) => {
     const { width, height } = target.getBoundingClientRect();
     const { clientWidth: contentWidth, clientHeight: contentHeight } = target;
     return dimensionsRef.current.reduce(
@@ -1540,7 +4617,7 @@ function useResizeObserver(ref, dimensions, onResize, reportInitialSize = false)
       {}
     );
   }, []);
-  useEffect3(() => {
+  useEffect7(() => {
     const target = ref.current;
     async function registerObserver() {
       observedMap.set(target, { measurements: {} });
@@ -1575,7 +4652,7 @@ function useResizeObserver(ref, dimensions, onResize, reportInitialSize = false)
       }
     };
   }, [measure, ref]);
-  useEffect3(() => {
+  useEffect7(() => {
     const target = ref.current;
     const record = observedMap.get(target);
     if (record) {
@@ -1617,8 +4694,8 @@ var useMeasuredContainer = ({
   height,
   width
 }) => {
-  const containerRef = useRef10(null);
-  const [size, setSize] = useState3({
+  const containerRef = useRef11(null);
+  const [size, setSize] = useState7({
     css: getInitialCssSize(height, width),
     inner: getInitialInnerSize(height, width),
     outer: {
@@ -1626,7 +4703,7 @@ var useMeasuredContainer = ({
       width: width != null ? width : "100%"
     }
   });
-  useMemo4(() => {
+  useMemo5(() => {
     setSize((currentSize) => {
       const { inner, outer } = currentSize;
       if (isValidNumber(height) && isValidNumber(width) && inner && outer) {
@@ -1645,7 +4722,7 @@ var useMeasuredContainer = ({
       return currentSize;
     });
   }, [height, width]);
-  const onResize = useCallback13(
+  const onResize = useCallback19(
     ({ clientWidth, clientHeight }) => {
       setSize((currentSize) => {
         const { css, inner, outer } = currentSize;
@@ -1671,23 +4748,28 @@ var useMeasuredContainer = ({
 };
 
 // src/useSelection.ts
-import { deselectItem, metadataKeys as metadataKeys6, selectItem } from "@vuu-ui/vuu-utils";
-import { useCallback as useCallback14, useRef as useRef11 } from "react";
-var { IDX: IDX2, SELECTED: SELECTED3 } = metadataKeys6;
+import {
+  deselectItem,
+  isRowSelected,
+  metadataKeys as metadataKeys8,
+  selectItem
+} from "@vuu-ui/vuu-utils";
+import { useCallback as useCallback20, useRef as useRef12 } from "react";
+var { IDX: IDX2 } = metadataKeys8;
 var NO_SELECTION = [];
 var useSelection = ({
   selectionModel,
   onSelectionChange
 }) => {
   selectionModel === "extended" || selectionModel === "checkbox";
-  const lastActiveRef = useRef11(-1);
-  const selectedRef = useRef11(NO_SELECTION);
-  const handleSelectionChange = useCallback14(
+  const lastActiveRef = useRef12(-1);
+  const selectedRef = useRef12(NO_SELECTION);
+  const handleSelectionChange = useCallback20(
     (row, rangeSelect, keepExistingSelection) => {
-      const { [IDX2]: idx, [SELECTED3]: isSelected } = row;
+      const { [IDX2]: idx } = row;
       const { current: active } = lastActiveRef;
       const { current: selected } = selectedRef;
-      const selectOperation = isSelected ? deselectItem : selectItem;
+      const selectOperation = isRowSelected(row) ? deselectItem : selectItem;
       const newSelected = selectOperation(
         selectionModel,
         selected,
@@ -1723,14 +4805,15 @@ import {
   isPinned,
   isTypeDescriptor,
   logger,
-  metadataKeys as metadataKeys7,
+  metadataKeys as metadataKeys9,
+  updateColumn,
   sortPinnedColumns,
   stripFilterFromColumns
 } from "@vuu-ui/vuu-utils";
 import { useReducer } from "react";
 var { info } = logger("useTableModel");
 var DEFAULT_COLUMN_WIDTH = 100;
-var KEY_OFFSET = metadataKeys7.count;
+var KEY_OFFSET = metadataKeys9.count;
 var columnWithoutDataType = ({ serverDataType }) => serverDataType === void 0;
 var getCellRendererForColumn = (column) => {
   var _a;
@@ -1753,8 +4836,8 @@ var getServerDataTypeForColumn = (column, tableSchema) => {
 };
 var numericTypes = ["int", "long", "double"];
 var getDefaultAlignment = (serverDataType) => serverDataType === void 0 ? void 0 : numericTypes.includes(serverDataType) ? "right" : "left";
+var isShowSettings = (action) => action.type === "columnSettings";
 var columnReducer = (state, action) => {
-  info == null ? void 0 : info(`GridModelReducer ${action.type}`);
   switch (action.type) {
     case "init":
       return init(action);
@@ -1906,8 +4989,9 @@ function resizeColumn(state, { column, phase, width }) {
   const resizing = phase !== "end";
   switch (phase) {
     case "begin":
-    case "end":
       return updateColumnProp(state, { type, column, resizing });
+    case "end":
+      return updateColumnProp(state, { type, column, resizing, width });
     case "resize":
       return updateColumnProp(state, { type, column, width });
     default:
@@ -1941,39 +5025,34 @@ function setTableSchema(state, { tableSchema }) {
 function pinColumn2(state, action) {
   let { columns } = state;
   const { column, pin } = action;
-  const targetColumn = columns.find((col) => col.name === column.name);
-  if (targetColumn) {
-    columns = replaceColumn(columns, { ...targetColumn, pin });
-    columns = sortPinnedColumns(columns);
-    return {
-      ...state,
-      columns
-    };
-  } else {
-    return state;
-  }
+  columns = updateColumn(columns, column.name, { pin });
+  columns = sortPinnedColumns(columns);
+  console.log({ withPins: columns });
+  return {
+    ...state,
+    columns
+  };
 }
 function updateColumnProp(state, action) {
   let { columns } = state;
   const { align, column, hidden, label, resizing, width } = action;
-  const targetColumn = columns.find((col) => col.name === column.name);
-  if (targetColumn) {
-    if (align === "left" || align === "right") {
-      columns = replaceColumn(columns, { ...targetColumn, align });
-    }
-    if (typeof label === "string") {
-      columns = replaceColumn(columns, { ...targetColumn, label });
-    }
-    if (typeof resizing === "boolean") {
-      columns = replaceColumn(columns, { ...targetColumn, resizing });
-    }
-    if (typeof hidden === "boolean") {
-      columns = replaceColumn(columns, { ...targetColumn, hidden });
-    }
-    if (typeof width === "number") {
-      columns = replaceColumn(columns, { ...targetColumn, width });
-    }
+  const options = {};
+  if (align === "left" || align === "right") {
+    options.align = align;
+  }
+  if (typeof label === "string") {
+    options.label = label;
+  }
+  if (typeof resizing === "boolean") {
+    options.resizing = resizing;
+  }
+  if (typeof hidden === "boolean") {
+    options.hidden = hidden;
+  }
+  if (typeof width === "number") {
+    options.width = width;
   }
+  columns = updateColumn(columns, column.name, options);
   return {
     ...state,
     columns
@@ -2038,12 +5117,9 @@ function updateTableConfig(state, { columns, confirmed, filter, groupBy, sort })
   }
   return result;
 }
-function replaceColumn(state, column) {
-  return state.map((col) => col.name === column.name ? column : col);
-}
 
 // src/useTableScroll.ts
-import { useCallback as useCallback15, useRef as useRef12 } from "react";
+import { useCallback as useCallback21, useRef as useRef13 } from "react";
 var getPctScroll = (container) => {
   const { scrollLeft, scrollTop } = container;
   const { clientHeight, clientWidth, scrollHeight, scrollWidth } = container;
@@ -2059,8 +5135,8 @@ var useCallbackRef = ({
   onAttach,
   onDetach
 }) => {
-  const ref = useRef12(null);
-  const callbackRef = useCallback15(
+  const ref = useRef13(null);
+  const callbackRef = useCallback21(
     (el) => {
       if (el) {
         ref.current = el;
@@ -2080,15 +5156,15 @@ var useTableScroll = ({
   onVerticalScroll,
   viewport
 }) => {
-  const contentContainerScrolledRef = useRef12(false);
-  const scrollPosRef = useRef12({ scrollTop: 0, scrollLeft: 0 });
-  const scrollbarContainerRef = useRef12(null);
-  const contentContainerRef = useRef12(null);
+  const contentContainerScrolledRef = useRef13(false);
+  const scrollPosRef = useRef13({ scrollTop: 0, scrollLeft: 0 });
+  const scrollbarContainerRef = useRef13(null);
+  const contentContainerRef = useRef13(null);
   const {
     maxScrollContainerScrollHorizontal: maxScrollLeft,
     maxScrollContainerScrollVertical: maxScrollTop
   } = viewport;
-  const handleScrollbarContainerScroll = useCallback15(() => {
+  const handleScrollbarContainerScroll = useCallback21(() => {
     const { current: contentContainer } = contentContainerRef;
     const { current: scrollbarContainer } = scrollbarContainerRef;
     const { current: contentContainerScrolled } = contentContainerScrolledRef;
@@ -2099,6 +5175,9 @@ var useTableScroll = ({
       const [maxScrollLeft2, maxScrollTop2] = getMaxScroll(contentContainer);
       const rootScrollLeft = Math.round(pctScrollLeft * maxScrollLeft2);
       const rootScrollTop = Math.round(pctScrollTop * maxScrollTop2);
+      console.log(
+        `pctScrollTop ${pctScrollTop}, maxScrollTop ${maxScrollTop2} rootScrollTop ${rootScrollTop}`
+      );
       contentContainer.scrollTo({
         left: rootScrollLeft,
         top: rootScrollTop,
@@ -2106,7 +5185,7 @@ var useTableScroll = ({
       });
     }
   }, []);
-  const handleContentContainerScroll = useCallback15(() => {
+  const handleContentContainerScroll = useCallback21(() => {
     const { current: contentContainer } = contentContainerRef;
     const { current: scrollbarContainer } = scrollbarContainerRef;
     const { current: scrollPos } = scrollPosRef;
@@ -2126,7 +5205,7 @@ var useTableScroll = ({
       }
     }
   }, [maxScrollLeft, maxScrollTop, onHorizontalScroll, onVerticalScroll]);
-  const handleAttachScrollbarContainer = useCallback15(
+  const handleAttachScrollbarContainer = useCallback21(
     (el) => {
       scrollbarContainerRef.current = el;
       el.addEventListener("scroll", handleScrollbarContainerScroll, {
@@ -2135,14 +5214,14 @@ var useTableScroll = ({
     },
     [handleScrollbarContainerScroll]
   );
-  const handleDetachScrollbarContainer = useCallback15(
+  const handleDetachScrollbarContainer = useCallback21(
     (el) => {
       scrollbarContainerRef.current = null;
       el.removeEventListener("scroll", handleScrollbarContainerScroll);
     },
     [handleScrollbarContainerScroll]
   );
-  const handleAttachContentContainer = useCallback15(
+  const handleAttachContentContainer = useCallback21(
     (el) => {
       contentContainerRef.current = el;
       el.addEventListener("scroll", handleContentContainerScroll, {
@@ -2151,7 +5230,7 @@ var useTableScroll = ({
     },
     [handleContentContainerScroll]
   );
-  const handleDetachContentContainer = useCallback15(
+  const handleDetachContentContainer = useCallback21(
     (el) => {
       contentContainerRef.current = null;
       el.removeEventListener("scroll", handleContentContainerScroll);
@@ -2166,7 +5245,7 @@ var useTableScroll = ({
     onAttach: handleAttachScrollbarContainer,
     onDetach: handleDetachScrollbarContainer
   });
-  const requestScroll = useCallback15(
+  const requestScroll = useCallback21(
     (scrollRequest) => {
       const { current: scrollbarContainer } = contentContainerRef;
       if (scrollbarContainer) {
@@ -2208,7 +5287,7 @@ var useTableScroll = ({
 };
 
 // src/useTableViewport.ts
-import { useCallback as useCallback16, useMemo as useMemo5, useRef as useRef13 } from "react";
+import { useCallback as useCallback22, useMemo as useMemo6, useRef as useRef14 } from "react";
 import {
   actualRowPositioning,
   virtualRowPositioning
@@ -2245,7 +5324,11 @@ var measurePinnedColumns = (columns) => {
       unpinnedWidth += visibleWidth;
     }
   }
-  return { pinnedWidthLeft, pinnedWidthRight, unpinnedWidth };
+  return {
+    pinnedWidthLeft: pinnedWidthLeft + 4,
+    pinnedWidthRight: pinnedWidthRight + 4,
+    unpinnedWidth
+  };
 };
 var useTableViewport = ({
   columns,
@@ -2255,20 +5338,20 @@ var useTableViewport = ({
   rowHeight,
   size
 }) => {
-  const pctScrollTopRef = useRef13(0);
+  const pctScrollTopRef = useRef14(0);
   const appliedRowCount = Math.min(rowCount, MAX_RAW_ROWS);
   const appliedContentHeight = appliedRowCount * rowHeight;
   const virtualContentHeight = rowCount * rowHeight;
   const virtualisedExtent = virtualContentHeight - appliedContentHeight;
-  const { pinnedWidthLeft, pinnedWidthRight, unpinnedWidth } = useMemo5(
+  const { pinnedWidthLeft, pinnedWidthRight, unpinnedWidth } = useMemo6(
     () => measurePinnedColumns(columns),
     [columns]
   );
-  const [actualRowOffset, actualRowAtPosition] = useMemo5(
+  const [actualRowOffset, actualRowAtPosition] = useMemo6(
     () => actualRowPositioning(rowHeight),
     [rowHeight]
   );
-  const [getRowOffset, getRowAtPosition] = useMemo5(() => {
+  const [getRowOffset, getRowAtPosition] = useMemo6(() => {
     if (virtualisedExtent) {
       return virtualRowPositioning(
         rowHeight,
@@ -2279,10 +5362,10 @@ var useTableViewport = ({
       return [actualRowOffset, actualRowAtPosition];
     }
   }, [actualRowAtPosition, actualRowOffset, virtualisedExtent, rowHeight]);
-  const setPctScrollTop = useCallback16((scrollPct) => {
+  const setPctScrollTop = useCallback22((scrollPct) => {
     pctScrollTopRef.current = scrollPct;
   }, []);
-  return useMemo5(() => {
+  return useMemo6(() => {
     var _a;
     if (size) {
       const headingsDepth = headings.length;
@@ -2335,22 +5418,22 @@ import {
   getColumnsInViewport,
   itemsChanged
 } from "@vuu-ui/vuu-utils";
-import { useCallback as useCallback17, useEffect as useEffect4, useMemo as useMemo6, useRef as useRef14, useState as useState4 } from "react";
+import { useCallback as useCallback23, useEffect as useEffect8, useMemo as useMemo7, useRef as useRef15, useState as useState8 } from "react";
 var useVirtualViewport = ({
   columns,
   getRowAtPosition,
   setRange,
   viewportMeasurements
 }) => {
-  const firstRowRef = useRef14(-1);
+  const firstRowRef = useRef15(-1);
   const {
     rowCount: viewportRowCount,
     contentWidth,
     maxScrollContainerScrollHorizontal
   } = viewportMeasurements;
   const availableWidth = contentWidth - maxScrollContainerScrollHorizontal;
-  const scrollLeftRef = useRef14(0);
-  const [visibleColumns, preSpan] = useMemo6(
+  const scrollLeftRef = useRef15(0);
+  const [visibleColumns, preSpan] = useMemo7(
     () => getColumnsInViewport(
       columns,
       scrollLeftRef.current,
@@ -2358,12 +5441,12 @@ var useVirtualViewport = ({
     ),
     [availableWidth, columns]
   );
-  const preSpanRef = useRef14(preSpan);
-  useEffect4(() => {
+  const preSpanRef = useRef15(preSpan);
+  useEffect8(() => {
     setColumnsWithinViewport(visibleColumns);
   }, [visibleColumns]);
-  const [columnsWithinViewport, setColumnsWithinViewport] = useState4(visibleColumns);
-  const handleHorizontalScroll = useCallback17(
+  const [columnsWithinViewport, setColumnsWithinViewport] = useState8(visibleColumns);
+  const handleHorizontalScroll = useCallback23(
     (scrollLeft) => {
       scrollLeftRef.current = scrollLeft;
       const [visibleColumns2, pre] = getColumnsInViewport(
@@ -2378,7 +5461,7 @@ var useVirtualViewport = ({
     },
     [availableWidth, columns, columnsWithinViewport]
   );
-  const handleVerticalScroll = useCallback17(
+  const handleVerticalScroll = useCallback23(
     (scrollTop) => {
       const firstRow = getRowAtPosition(scrollTop);
       if (firstRow !== firstRowRef.current) {
@@ -2399,7 +5482,7 @@ var useVirtualViewport = ({
 
 // src/useTable.ts
 var NO_ROWS = [];
-var { KEY: KEY2, IS_EXPANDED: IS_EXPANDED2, IS_LEAF: IS_LEAF2 } = metadataKeys8;
+var { KEY: KEY3, IS_EXPANDED: IS_EXPANDED2, IS_LEAF: IS_LEAF2 } = metadataKeys10;
 var useTable = ({
   config,
   dataSource,
@@ -2414,15 +5497,15 @@ var useTable = ({
   ...measuredProps
 }) => {
   var _a, _b;
-  const [rowCount, setRowCount] = useState5(dataSource.size);
-  const expectConfigChangeRef = useRef15(false);
-  const dataSourceRef = useRef15();
+  const [rowCount, setRowCount] = useState9(dataSource.size);
+  const expectConfigChangeRef = useRef16(false);
+  const dataSourceRef = useRef16();
   dataSourceRef.current = dataSource;
   if (dataSource === void 0) {
     throw Error("no data source provided to Vuu Table");
   }
   const containerMeasurements = useMeasuredContainer(measuredProps);
-  const onDataRowcountChange = useCallback18((size) => {
+  const onDataRowcountChange = useCallback24((size) => {
     setRowCount(size);
   }, []);
   const { columns, dispatchColumnAction, headings } = useTableModel(
@@ -2442,7 +5525,7 @@ var useTable = ({
     rowHeight,
     size: containerMeasurements.innerSize
   });
-  const onSubscribed = useCallback18(
+  const onSubscribed = useCallback24(
     ({ tableSchema }) => {
       if (tableSchema) {
         expectConfigChangeRef.current = true;
@@ -2456,7 +5539,7 @@ var useTable = ({
     },
     [dispatchColumnAction]
   );
-  const handleSelectionChange = useCallback18(
+  const handleSelectionChange = useCallback24(
     (selected) => {
       dataSource.select(selected);
       onSelectionChange == null ? void 0 : onSelectionChange(selected);
@@ -2476,9 +5559,9 @@ var useTable = ({
     renderBufferSize,
     viewportRowCount: viewportMeasurements.rowCount
   });
-  const dataRef = useRef15();
+  const dataRef = useRef16();
   dataRef.current = data;
-  const onPersistentColumnOperation = useCallback18(
+  const onPersistentColumnOperation = useCallback24(
     (action) => {
       expectConfigChangeRef.current = true;
       dispatchColumnAction(action);
@@ -2489,7 +5572,7 @@ var useTable = ({
     dataSource,
     onPersistentColumnOperation
   });
-  const handleSort = useCallback18(
+  const handleSort = useCallback24(
     (column, extendSort = false, sortType) => {
       if (dataSource) {
         dataSource.sort = applySort(
@@ -2502,7 +5585,7 @@ var useTable = ({
     },
     [dataSource]
   );
-  const handleColumnResize = useCallback18(
+  const handleColumnResize = useCallback24(
     (phase, columnName, width) => {
       const column = columns.find((column2) => column2.name === columnName);
       if (column) {
@@ -2523,10 +5606,10 @@ var useTable = ({
     },
     [columns, dispatchColumnAction]
   );
-  const handleToggleGroup = useCallback18(
+  const handleToggleGroup = useCallback24(
     (row, column) => {
       const isJson = isJsonGroup2(column, row);
-      const key = row[KEY2];
+      const key = row[KEY3];
       if (row[IS_EXPANDED2]) {
         dataSource.closeTreeNode(key, true);
         if (isJson) {
@@ -2570,7 +5653,7 @@ var useTable = ({
     setRange,
     viewportMeasurements
   });
-  const handleVerticalScroll = useCallback18(
+  const handleVerticalScroll = useCallback24(
     (scrollTop, pctScrollTop) => {
       setPctScrollTop(pctScrollTop);
       onVerticalScroll(scrollTop);
@@ -2591,7 +5674,7 @@ var useTable = ({
     rowCount: dataSource == null ? void 0 : dataSource.size,
     viewportRange: range
   });
-  const handleRemoveColumnFromGroupBy = useCallback18(
+  const handleRemoveColumnFromGroupBy = useCallback24(
     (column) => {
       if (column) {
         if (dataSource && dataSource.groupBy.includes(column.name)) {
@@ -2605,7 +5688,7 @@ var useTable = ({
     },
     [dataSource]
   );
-  const handleDropColumn = useCallback18(
+  const handleDropColumn = useCallback24(
     (fromIndex, toIndex) => {
       const column = dataSource.columns[fromIndex];
       const columns2 = moveItem2(dataSource.columns, column, toIndex);
@@ -2619,7 +5702,7 @@ var useTable = ({
   const draggableHook = useDraggableColumn({
     onDrop: handleDropColumn
   });
-  useEffect5(() => {
+  useEffect9(() => {
     if (dataSourceRef.current) {
       expectConfigChangeRef.current = true;
       dispatchColumnAction({
@@ -2629,7 +5712,7 @@ var useTable = ({
       });
     }
   }, [config, dispatchColumnAction]);
-  useEffect5(() => {
+  useEffect9(() => {
     dataSource.on("config", (config2, confirmed) => {
       expectConfigChangeRef.current = true;
       dispatchColumnAction({
@@ -2639,7 +5722,7 @@ var useTable = ({
       });
     });
   }, [dataSource, dispatchColumnAction]);
-  useMemo7(() => {
+  useMemo8(() => {
     if (expectConfigChangeRef.current) {
       onConfigChange == null ? void 0 : onConfigChange({
         ...config,
@@ -2649,7 +5732,7 @@ var useTable = ({
     }
   }, [columns, config, onConfigChange]);
   const showContextMenu = usePopupContextMenu();
-  const onContextMenu = useCallback18(
+  const onContextMenu = useCallback24(
     (evt) => {
       var _a2;
       const { current: currentData } = dataRef;
@@ -2831,12 +5914,12 @@ var Table = ({
 import cx8 from "classnames";
 import {
   isJsonAttribute,
-  metadataKeys as metadataKeys9,
+  metadataKeys as metadataKeys11,
   registerComponent
 } from "@vuu-ui/vuu-utils";
 import { jsx as jsx11, jsxs as jsxs8 } from "react/jsx-runtime";
 var classBase7 = "vuuJsonCell";
-var { IS_EXPANDED: IS_EXPANDED3, KEY: KEY3 } = metadataKeys9;
+var { IS_EXPANDED: IS_EXPANDED3, KEY: KEY4 } = metadataKeys11;
 var localKey = (key) => {
   const pos = key.lastIndexOf("|");
   if (pos === -1) {
@@ -2856,7 +5939,7 @@ var JsonCell = ({ column, row }) => {
     value = value.slice(0, -1);
     isToggle = true;
   }
-  const rowKey = localKey(row[KEY3]);
+  const rowKey = localKey(row[KEY4]);
   const className = cx8({
     [`${classBase7}-name`]: rowKey === value,
     [`${classBase7}-value`]: rowKey !== value,
@@ -2876,9 +5959,13 @@ var JsonCell = ({ column, row }) => {
 };
 registerComponent("json", JsonCell, "cell-renderer", {});
 export {
+  ColumnResizer,
   Table,
   buildContextMenuDescriptors,
+  isShowSettings,
   useMeasuredContainer,
+  useSelection,
+  useTableColumnResize,
   useTableContextMenu,
   useTableModel,
   useTableViewport