@deephaven/iris-grid 1.8.1-beta.8 → 1.9.0

package/dist/sidebar/visibility-ordering-builder/sortable-tree/utilities.d.ts

@@ -2,7 +2,7 @@ import type { dh } from '@deephaven/jsapi-types';
 import { type ModelIndex, type MoveOperation } from '@deephaven/grid';
 import type ColumnHeaderGroup from '../../../ColumnHeaderGroup';
 import { type ReadonlyTreeItems, type FlattenedItem, type TreeItem } from './types';
-interface IrisGridTreeItemData {
+export interface IrisGridTreeItemData {
     modelIndex: number | number[];
     visibleIndex: number | [number, number];
     isVisible: boolean;
@@ -19,14 +19,15 @@ export declare function getTreeItems(columns: readonly dh.Column[], movedColumns
  * @param overId ID of the item currently being dragged over
  * @param dragOffset The x-axis offset of the dragged item
  * @param indentationWidth The width for each level of the tree
- * @returns The projected position and depth if the item were to be dropped
+ * @returns The projected position and depth if the item were to be dropped.
+ *          Null if the projection could not be calculated.
  */
 export declare function getProjection(items: FlattenedItem[], activeId: string, overId: string, dragOffset: number, indentationWidth: number): {
     depth: number;
     maxDepth: number;
     minDepth: number;
     parentId: string | null;
-};
+} | null;
 /**
  * Flattens a tree into a 1D array given the items
  * @param items The tree items to flatten
@@ -51,5 +52,4 @@ export declare function getChildCount(items: ReadonlyTreeItems, id: string): num
  * @returns The flattened items without the children of the parents
  */
 export declare function removeChildrenOf<T>(items: FlattenedItem<T>[], ids: string[]): FlattenedItem<T>[];
-export {};
 //# sourceMappingURL=utilities.d.ts.map

package/dist/sidebar/visibility-ordering-builder/sortable-tree/utilities.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utilities.d.ts","sourceRoot":"","sources":["../../../../src/sidebar/visibility-ordering-builder/sortable-tree/utilities.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAEL,KAAK,UAAU,EACf,KAAK,aAAa,EACnB,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,iBAAiB,MAAM,4BAA4B,CAAC;AAChE,OAAO,EAEL,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,KAAK,QAAQ,EACd,MAAM,SAAS,CAAC;AAajB,UAAU,oBAAoB;IAC5B,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAC9B,YAAY,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,iBAAiB,CAAC;CAC3B;AAED,MAAM,MAAM,gBAAgB,GAAG,QAAQ,CAAC,oBAAoB,CAAC,CAAC;AAE9D,MAAM,MAAM,yBAAyB,GAAG,aAAa,CAAC,oBAAoB,CAAC,CAAC;AAsE5E,wBAAgB,YAAY,CAC1B,OAAO,EAAE,SAAS,EAAE,CAAC,MAAM,EAAE,EAC7B,YAAY,EAAE,SAAS,aAAa,EAAE,EACtC,kBAAkB,EAAE,SAAS,iBAAiB,EAAE,EAChD,aAAa,EAAE,SAAS,UAAU,EAAE,EACpC,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,iBAAiB,EAAE,OAAO,GACzB,gBAAgB,EAAE,CAwCpB;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,aAAa,EAAE,EACtB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,gBAAgB,EAAE,MAAM,GACvB;IACD,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB,CA4CA;AAiDD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAC1B,aAAa,CAAC,CAAC,CAAC,EAAE,CAMpB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,iBAAiB,EACxB,MAAM,EAAE,MAAM,GACb,QAAQ,GAAG,SAAS,CAmBtB;AAYD,wBAAgB,aAAa,CAAC,KAAK,EAAE,iBAAiB,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAI1E;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACzB,GAAG,EAAE,MAAM,EAAE,GACZ,aAAa,CAAC,CAAC,CAAC,EAAE,CAapB"}
+{"version":3,"file":"utilities.d.ts","sourceRoot":"","sources":["../../../../src/sidebar/visibility-ordering-builder/sortable-tree/utilities.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAEL,KAAK,UAAU,EACf,KAAK,aAAa,EACnB,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,iBAAiB,MAAM,4BAA4B,CAAC;AAChE,OAAO,EAEL,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,KAAK,QAAQ,EACd,MAAM,SAAS,CAAC;AAajB,MAAM,WAAW,oBAAoB;IACnC,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAC9B,YAAY,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,iBAAiB,CAAC;CAC3B;AAED,MAAM,MAAM,gBAAgB,GAAG,QAAQ,CAAC,oBAAoB,CAAC,CAAC;AAE9D,MAAM,MAAM,yBAAyB,GAAG,aAAa,CAAC,oBAAoB,CAAC,CAAC;AAsE5E,wBAAgB,YAAY,CAC1B,OAAO,EAAE,SAAS,EAAE,CAAC,MAAM,EAAE,EAC7B,YAAY,EAAE,SAAS,aAAa,EAAE,EACtC,kBAAkB,EAAE,SAAS,iBAAiB,EAAE,EAChD,aAAa,EAAE,SAAS,UAAU,EAAE,EACpC,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,iBAAiB,EAAE,OAAO,GACzB,gBAAgB,EAAE,CAwCpB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,aAAa,EAAE,EACtB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,gBAAgB,EAAE,MAAM,GACvB;IACD,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,CA+CP;AAiDD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAC1B,aAAa,CAAC,CAAC,CAAC,EAAE,CAMpB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,iBAAiB,EACxB,MAAM,EAAE,MAAM,GACb,QAAQ,GAAG,SAAS,CAmBtB;AAYD,wBAAgB,aAAa,CAAC,KAAK,EAAE,iBAAiB,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAI1E;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACzB,GAAG,EAAE,MAAM,EAAE,GACZ,aAAa,CAAC,CAAC,CAAC,EAAE,CAapB"}

package/dist/sidebar/visibility-ordering-builder/sortable-tree/utilities.js

@@ -91,7 +91,8 @@ export function getTreeItems(columns, movedColumns, columnHeaderGroups, hiddenCo
  * @param overId ID of the item currently being dragged over
  * @param dragOffset The x-axis offset of the dragged item
  * @param indentationWidth The width for each level of the tree
- * @returns The projected position and depth if the item were to be dropped
+ * @returns The projected position and depth if the item were to be dropped.
+ *          Null if the projection could not be calculated.
  */
 export function getProjection(items, activeId, overId, dragOffset, indentationWidth) {
   var overItemIndex = items.findIndex(_ref2 => {
@@ -106,6 +107,9 @@ export function getProjection(items, activeId, overId, dragOffset, indentationWi
     } = _ref3;
     return id === activeId;
   });
+  if (overItemIndex === -1 || activeItemIndex === -1) {
+    return null;
+  }
   var activeItem = items[activeItemIndex];
   var newItems = arrayMove(items, activeItemIndex, overItemIndex);
   var previousItem = newItems[overItemIndex - 1];

package/dist/sidebar/visibility-ordering-builder/sortable-tree/utilities.js.map

@@ -1 +1 @@
-{"version":3,"file":"utilities.js","names":["arrayMove","GridUtils","isFlattenedTreeItem","getDragDepth","offset","indentationWidth","Math","round","getTreeItem","columns","movedColumns","columnHeaderGroupMap","name","hiddenColumnSet","selectedItems","showHiddenColumns","modelIndex","findIndex","col","group","get","Error","concat","modelIndexes","childIndexes","flat","id","selected","has","children","filter","_","i","map","childName","sort","a","b","aVal","Array","isArray","data","visibleIndex","bVal","getVisibleRange","isVisible","some","index","getVisibleIndex","getTreeItems","columnHeaderGroups","hiddenColumns","items","selectedItemsSet","Set","groupMap","Map","_loop","getModelIndex","columnName","find","_ref","includes","undefined","parent","item","push","length","getProjection","activeId","overId","dragOffset","overItemIndex","_ref2","activeItemIndex","_ref3","activeItem","newItems","previousItem","nextItem","dragDepth","projectedDepth","depth","maxDepth","getMaxDepth","minDepth","getMinDepth","parentId","getParentId","_newItems$slice$rever","newParent","slice","reverse","_ref4","_previousItem$depth","_nextItem$depth","max","_ref5","flatten","arguments","reduce","acc","_objectSpread","flattenTree","every","findItemDeep","itemId","child","countChildren","count","_ref6","getChildCount","removeChildrenOf","ids","excludeParentIds","add"],"sources":["../../../../src/sidebar/visibility-ordering-builder/sortable-tree/utilities.ts"],"sourcesContent":["import { arrayMove } from '@dnd-kit/sortable';\nimport type { dh } from '@deephaven/jsapi-types';\nimport {\n  GridUtils,\n  type ModelIndex,\n  type MoveOperation,\n} from '@deephaven/grid';\nimport type ColumnHeaderGroup from '../../../ColumnHeaderGroup';\nimport {\n  isFlattenedTreeItem,\n  type ReadonlyTreeItems,\n  type FlattenedItem,\n  type TreeItem,\n} from './types';\n\n/**\n * Gets the depth of an item dragged with a given x-axis offset\n *\n * @param offset x-axis offset of the dragging item\n * @param indentationWidth Width of indentation for each depth\n * @returns The drag depth for the given offset\n */\nfunction getDragDepth(offset: number, indentationWidth: number): number {\n  return Math.round(offset / indentationWidth);\n}\n\ninterface IrisGridTreeItemData {\n  modelIndex: number | number[];\n  visibleIndex: number | [number, number];\n  isVisible: boolean;\n  group?: ColumnHeaderGroup;\n}\n\nexport type IrisGridTreeItem = TreeItem<IrisGridTreeItemData>;\n\nexport type FlattenedIrisGridTreeItem = FlattenedItem<IrisGridTreeItemData>;\n\nfunction getTreeItem(\n  columns: readonly dh.Column[],\n  movedColumns: readonly MoveOperation[],\n  columnHeaderGroupMap: Map<string, ColumnHeaderGroup>,\n  name: string,\n  hiddenColumnSet: Set<ModelIndex>,\n  selectedItems: Set<string>,\n  showHiddenColumns: boolean\n): IrisGridTreeItem {\n  const modelIndex = columns.findIndex(col => col.name === name);\n  if (modelIndex === -1) {\n    const group = columnHeaderGroupMap.get(name);\n\n    if (group == null) {\n      throw new Error(`Column or header group not found: ${name}`);\n    }\n\n    const modelIndexes = group.childIndexes.flat();\n\n    return {\n      id: name,\n      selected: selectedItems.has(name),\n      children: group.children\n        .filter(\n          (_, i) =>\n            showHiddenColumns || !hiddenColumnSet.has(group.childIndexes[i])\n        )\n        .map(childName =>\n          getTreeItem(\n            columns,\n            movedColumns,\n            columnHeaderGroupMap,\n            childName,\n            hiddenColumnSet,\n            selectedItems,\n            showHiddenColumns\n          )\n        )\n        .sort((a, b) => {\n          const aVal = Array.isArray(a.data.visibleIndex)\n            ? a.data.visibleIndex[0]\n            : a.data.visibleIndex;\n          const bVal = Array.isArray(b.data.visibleIndex)\n            ? b.data.visibleIndex[0]\n            : b.data.visibleIndex;\n          return aVal - bVal;\n        }),\n      data: {\n        modelIndex: modelIndexes,\n        visibleIndex: group.getVisibleRange(movedColumns),\n        group,\n        isVisible: modelIndexes.some(index => !hiddenColumnSet.has(index)),\n      },\n    };\n  }\n\n  return {\n    id: name,\n    children: [],\n    selected: selectedItems.has(name),\n    data: {\n      modelIndex,\n      visibleIndex: GridUtils.getVisibleIndex(modelIndex, movedColumns),\n      isVisible: !hiddenColumnSet.has(modelIndex),\n    },\n  };\n}\n\nexport function getTreeItems(\n  columns: readonly dh.Column[],\n  movedColumns: readonly MoveOperation[],\n  columnHeaderGroups: readonly ColumnHeaderGroup[],\n  hiddenColumns: readonly ModelIndex[],\n  selectedItems: readonly string[],\n  showHiddenColumns: boolean\n): IrisGridTreeItem[] {\n  const items: IrisGridTreeItem[] = [];\n  const selectedItemsSet = new Set(selectedItems);\n  const groupMap = new Map(\n    columnHeaderGroups.map(group => [group.name, group])\n  );\n  const hiddenColumnSet = new Set(hiddenColumns);\n\n  let visibleIndex = 0;\n  while (visibleIndex < columns.length) {\n    const modelIndex = GridUtils.getModelIndex(visibleIndex, movedColumns);\n    const columnName = columns[modelIndex].name;\n\n    let group = columnHeaderGroups.find(({ children }) =>\n      children.includes(columnName)\n    );\n    while (group !== undefined && group.parent !== undefined) {\n      group = groupMap.get(group.parent);\n    }\n\n    const item = getTreeItem(\n      columns,\n      movedColumns,\n      groupMap,\n      group ? group.name : columnName,\n      hiddenColumnSet,\n      selectedItemsSet,\n      showHiddenColumns\n    );\n\n    items.push(item);\n\n    if (Array.isArray(item.data.visibleIndex)) {\n      visibleIndex += item.data.visibleIndex[1] - item.data.visibleIndex[0] + 1;\n    } else {\n      visibleIndex += 1;\n    }\n  }\n\n  return items;\n}\n\n/**\n * Gets the projected drop position and depth of the dragged item\n *\n * @param items List of flattened items\n * @param activeId ID of the actively dragged item\n * @param overId ID of the item currently being dragged over\n * @param dragOffset The x-axis offset of the dragged item\n * @param indentationWidth The width for each level of the tree\n * @returns The projected position and depth if the item were to be dropped\n */\nexport function getProjection(\n  items: FlattenedItem[],\n  activeId: string,\n  overId: string,\n  dragOffset: number,\n  indentationWidth: number\n): {\n  depth: number;\n  maxDepth: number;\n  minDepth: number;\n  parentId: string | null;\n} {\n  const overItemIndex = items.findIndex(({ id }) => id === overId);\n  const activeItemIndex = items.findIndex(({ id }) => id === activeId);\n  const activeItem = items[activeItemIndex];\n  const newItems = arrayMove(items, activeItemIndex, overItemIndex);\n  const previousItem: FlattenedItem | undefined = newItems[overItemIndex - 1];\n  const nextItem = newItems[overItemIndex + 1];\n  const dragDepth = getDragDepth(dragOffset, indentationWidth);\n  const projectedDepth = activeItem.depth + dragDepth;\n  const maxDepth = getMaxDepth({\n    previousItem,\n    nextItem,\n  });\n  const minDepth = getMinDepth({ nextItem });\n  let depth = projectedDepth;\n\n  if (projectedDepth >= maxDepth) {\n    depth = maxDepth;\n  } else if (projectedDepth < minDepth) {\n    depth = minDepth;\n  }\n\n  return { depth, maxDepth, minDepth, parentId: getParentId() };\n\n  function getParentId(): string | null {\n    if (depth === 0 || !previousItem) {\n      return null;\n    }\n\n    if (depth === previousItem.depth) {\n      return previousItem.parentId;\n    }\n\n    if (depth > previousItem.depth) {\n      return previousItem.id;\n    }\n\n    const newParent = newItems\n      .slice(0, overItemIndex)\n      .reverse()\n      .find(item => item.depth === depth)?.parentId;\n\n    return newParent ?? null;\n  }\n}\n\nfunction getMaxDepth({\n  previousItem,\n  nextItem,\n}: {\n  previousItem?: FlattenedItem;\n  nextItem?: FlattenedItem;\n}): number {\n  return Math.max(previousItem?.depth ?? 0, nextItem?.depth ?? 0);\n}\n\nfunction getMinDepth({\n  nextItem,\n}: {\n  nextItem: FlattenedItem | undefined;\n}): number {\n  if (nextItem) {\n    return nextItem.depth;\n  }\n\n  return 0;\n}\n\n/**\n * Helper function to recursively flatten a tree\n *\n * @param items Items to flatten\n * @param parentId The current parentId of the items\n * @param depth The current depth of the items\n * @returns Flattened items\n */\nfunction flatten<T>(\n  items: ReadonlyTreeItems<T>,\n  parentId: string | null = null,\n  depth = 0\n): FlattenedItem<T>[] {\n  return items\n    .reduce<FlattenedItem<T>[]>(\n      (acc, item) => [\n        ...acc,\n        { ...item, parentId, depth, index: 0 }, // Index will be recalculated after\n        ...flatten(item.children, item.id, depth + 1),\n      ],\n      []\n    )\n    .map((item, index) => ({ ...item, index })); // Recalculate indexes to be sequential\n}\n\n/**\n * Flattens a tree into a 1D array given the items\n * @param items The tree items to flatten\n * @returns The flattened tree items list\n */\nexport function flattenTree<T>(\n  items: ReadonlyTreeItems<T>\n): FlattenedItem<T>[] {\n  // Should help prevent double flattening since FlattenedItems are valid TreeItems\n  if (items.every(isFlattenedTreeItem)) {\n    return [...items];\n  }\n  return flatten(items);\n}\n\n/**\n * Recursively checks for the item in a list of items.\n * The list does not have to be flattened prior to searching.\n *\n * @param items Items to search\n * @param itemId Item to find\n * @returns The item if found\n */\nexport function findItemDeep(\n  items: ReadonlyTreeItems,\n  itemId: string\n): TreeItem | undefined {\n  for (let i = 0; i < items.length; i += 1) {\n    const item = items[i];\n    const { id, children } = item;\n\n    if (id === itemId) {\n      return item;\n    }\n\n    if (children.length) {\n      const child = findItemDeep(children, itemId);\n\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  return undefined;\n}\n\nfunction countChildren(items: TreeItem[], count = 0): number {\n  return items.reduce((acc, { children }) => {\n    if (children.length) {\n      return countChildren(children, acc + 1);\n    }\n\n    return acc + 1;\n  }, count);\n}\n\nexport function getChildCount(items: ReadonlyTreeItems, id: string): number {\n  const item = findItemDeep(items, id);\n\n  return item ? countChildren(item.children) : 0;\n}\n\n/**\n * Removes the children of the list of parents from the list of flattened items\n *\n * @param items The flattened items to remove from\n * @param ids The parents we want to remove the children of\n * @returns The flattened items without the children of the parents\n */\nexport function removeChildrenOf<T>(\n  items: FlattenedItem<T>[],\n  ids: string[]\n): FlattenedItem<T>[] {\n  const excludeParentIds = new Set(ids);\n\n  return items.filter(item => {\n    if (item.parentId != null && excludeParentIds.has(item.parentId)) {\n      if (item.children.length) {\n        excludeParentIds.add(item.id);\n      }\n      return false;\n    }\n\n    return true;\n  });\n}\n"],"mappings":";;;;;AAAA,SAASA,SAAS,QAAQ,mBAAmB;AAE7C,SACEC,SAAS,QAGJ,iBAAiB;AAAC,SAGvBC,mBAAmB;AAMrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,YAAYA,CAACC,MAAc,EAAEC,gBAAwB,EAAU;EACtE,OAAOC,IAAI,CAACC,KAAK,CAACH,MAAM,GAAGC,gBAAgB,CAAC;AAC9C;AAaA,SAASG,WAAWA,CAClBC,OAA6B,EAC7BC,YAAsC,EACtCC,oBAAoD,EACpDC,IAAY,EACZC,eAAgC,EAChCC,aAA0B,EAC1BC,iBAA0B,EACR;EAClB,IAAMC,UAAU,GAAGP,OAAO,CAACQ,SAAS,CAACC,GAAG,IAAIA,GAAG,CAACN,IAAI,KAAKA,IAAI,CAAC;EAC9D,IAAII,UAAU,KAAK,CAAC,CAAC,EAAE;IACrB,IAAMG,KAAK,GAAGR,oBAAoB,CAACS,GAAG,CAACR,IAAI,CAAC;IAE5C,IAAIO,KAAK,IAAI,IAAI,EAAE;MACjB,MAAM,IAAIE,KAAK,sCAAAC,MAAA,CAAsCV,IAAI,CAAE,CAAC;IAC9D;IAEA,IAAMW,YAAY,GAAGJ,KAAK,CAACK,YAAY,CAACC,IAAI,CAAC,CAAC;IAE9C,OAAO;MACLC,EAAE,EAAEd,IAAI;MACRe,QAAQ,EAAEb,aAAa,CAACc,GAAG,CAAChB,IAAI,CAAC;MACjCiB,QAAQ,EAAEV,KAAK,CAACU,QAAQ,CACrBC,MAAM,CACL,CAACC,CAAC,EAAEC,CAAC,KACHjB,iBAAiB,IAAI,CAACF,eAAe,CAACe,GAAG,CAACT,KAAK,CAACK,YAAY,CAACQ,CAAC,CAAC,CACnE,CAAC,CACAC,GAAG,CAACC,SAAS,IACZ1B,WAAW,CACTC,OAAO,EACPC,YAAY,EACZC,oBAAoB,EACpBuB,SAAS,EACTrB,eAAe,EACfC,aAAa,EACbC,iBACF,CACF,CAAC,CACAoB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAK;QACd,IAAMC,IAAI,GAAGC,KAAK,CAACC,OAAO,CAACJ,CAAC,CAACK,IAAI,CAACC,YAAY,CAAC,GAC3CN,CAAC,CAACK,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GACtBN,CAAC,CAACK,IAAI,CAACC,YAAY;QACvB,IAAMC,IAAI,GAAGJ,KAAK,CAACC,OAAO,CAACH,CAAC,CAACI,IAAI,CAACC,YAAY,CAAC,GAC3CL,CAAC,CAACI,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GACtBL,CAAC,CAACI,IAAI,CAACC,YAAY;QACvB,OAAOJ,IAAI,GAAGK,IAAI;MACpB,CAAC,CAAC;MACJF,IAAI,EAAE;QACJzB,UAAU,EAAEO,YAAY;QACxBmB,YAAY,EAAEvB,KAAK,CAACyB,eAAe,CAAClC,YAAY,CAAC;QACjDS,KAAK;QACL0B,SAAS,EAAEtB,YAAY,CAACuB,IAAI,CAACC,KAAK,IAAI,CAAClC,eAAe,CAACe,GAAG,CAACmB,KAAK,CAAC;MACnE;IACF,CAAC;EACH;EAEA,OAAO;IACLrB,EAAE,EAAEd,IAAI;IACRiB,QAAQ,EAAE,EAAE;IACZF,QAAQ,EAAEb,aAAa,CAACc,GAAG,CAAChB,IAAI,CAAC;IACjC6B,IAAI,EAAE;MACJzB,UAAU;MACV0B,YAAY,EAAEzC,SAAS,CAAC+C,eAAe,CAAChC,UAAU,EAAEN,YAAY,CAAC;MACjEmC,SAAS,EAAE,CAAChC,eAAe,CAACe,GAAG,CAACZ,UAAU;IAC5C;EACF,CAAC;AACH;AAEA,OAAO,SAASiC,YAAYA,CAC1BxC,OAA6B,EAC7BC,YAAsC,EACtCwC,kBAAgD,EAChDC,aAAoC,EACpCrC,aAAgC,EAChCC,iBAA0B,EACN;EACpB,IAAMqC,KAAyB,GAAG,EAAE;EACpC,IAAMC,gBAAgB,GAAG,IAAIC,GAAG,CAACxC,aAAa,CAAC;EAC/C,IAAMyC,QAAQ,GAAG,IAAIC,GAAG,CACtBN,kBAAkB,CAACjB,GAAG,CAACd,KAAK,IAAI,CAACA,KAAK,CAACP,IAAI,EAAEO,KAAK,CAAC,CACrD,CAAC;EACD,IAAMN,eAAe,GAAG,IAAIyC,GAAG,CAACH,aAAa,CAAC;EAE9C,IAAIT,YAAY,GAAG,CAAC;EAAC,IAAAe,KAAA,YAAAA,MAAA,EACiB;IACpC,IAAMzC,UAAU,GAAGf,SAAS,CAACyD,aAAa,CAAChB,YAAY,EAAEhC,YAAY,CAAC;IACtE,IAAMiD,UAAU,GAAGlD,OAAO,CAACO,UAAU,CAAC,CAACJ,IAAI;IAE3C,IAAIO,KAAK,GAAG+B,kBAAkB,CAACU,IAAI,CAACC,IAAA;MAAA,IAAC;QAAEhC;MAAS,CAAC,GAAAgC,IAAA;MAAA,OAC/ChC,QAAQ,CAACiC,QAAQ,CAACH,UAAU,CAAC;IAAA,CAC/B,CAAC;IACD,OAAOxC,KAAK,KAAK4C,SAAS,IAAI5C,KAAK,CAAC6C,MAAM,KAAKD,SAAS,EAAE;MACxD5C,KAAK,GAAGoC,QAAQ,CAACnC,GAAG,CAACD,KAAK,CAAC6C,MAAM,CAAC;IACpC;IAEA,IAAMC,IAAI,GAAGzD,WAAW,CACtBC,OAAO,EACPC,YAAY,EACZ6C,QAAQ,EACRpC,KAAK,GAAGA,KAAK,CAACP,IAAI,GAAG+C,UAAU,EAC/B9C,eAAe,EACfwC,gBAAgB,EAChBtC,iBACF,CAAC;IAEDqC,KAAK,CAACc,IAAI,CAACD,IAAI,CAAC;IAEhB,IAAI1B,KAAK,CAACC,OAAO,CAACyB,IAAI,CAACxB,IAAI,CAACC,YAAY,CAAC,EAAE;MACzCA,YAAY,IAAIuB,IAAI,CAACxB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GAAGuB,IAAI,CAACxB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAC3E,CAAC,MAAM;MACLA,YAAY,IAAI,CAAC;IACnB;EACF,CAAC;EA5BD,OAAOA,YAAY,GAAGjC,OAAO,CAAC0D,MAAM;IAAAV,KAAA;EAAA;EA8BpC,OAAOL,KAAK;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASgB,aAAaA,CAC3BhB,KAAsB,EACtBiB,QAAgB,EAChBC,MAAc,EACdC,UAAkB,EAClBlE,gBAAwB,EAMxB;EACA,IAAMmE,aAAa,GAAGpB,KAAK,CAACnC,SAAS,CAACwD,KAAA;IAAA,IAAC;MAAE/C;IAAG,CAAC,GAAA+C,KAAA;IAAA,OAAK/C,EAAE,KAAK4C,MAAM;EAAA,EAAC;EAChE,IAAMI,eAAe,GAAGtB,KAAK,CAACnC,SAAS,CAAC0D,KAAA;IAAA,IAAC;MAAEjD;IAAG,CAAC,GAAAiD,KAAA;IAAA,OAAKjD,EAAE,KAAK2C,QAAQ;EAAA,EAAC;EACpE,IAAMO,UAAU,GAAGxB,KAAK,CAACsB,eAAe,CAAC;EACzC,IAAMG,QAAQ,GAAG7E,SAAS,CAACoD,KAAK,EAAEsB,eAAe,EAAEF,aAAa,CAAC;EACjE,IAAMM,YAAuC,GAAGD,QAAQ,CAACL,aAAa,GAAG,CAAC,CAAC;EAC3E,IAAMO,QAAQ,GAAGF,QAAQ,CAACL,aAAa,GAAG,CAAC,CAAC;EAC5C,IAAMQ,SAAS,GAAG7E,YAAY,CAACoE,UAAU,EAAElE,gBAAgB,CAAC;EAC5D,IAAM4E,cAAc,GAAGL,UAAU,CAACM,KAAK,GAAGF,SAAS;EACnD,IAAMG,QAAQ,GAAGC,WAAW,CAAC;IAC3BN,YAAY;IACZC;EACF,CAAC,CAAC;EACF,IAAMM,QAAQ,GAAGC,WAAW,CAAC;IAAEP;EAAS,CAAC,CAAC;EAC1C,IAAIG,KAAK,GAAGD,cAAc;EAE1B,IAAIA,cAAc,IAAIE,QAAQ,EAAE;IAC9BD,KAAK,GAAGC,QAAQ;EAClB,CAAC,MAAM,IAAIF,cAAc,GAAGI,QAAQ,EAAE;IACpCH,KAAK,GAAGG,QAAQ;EAClB;EAEA,OAAO;IAAEH,KAAK;IAAEC,QAAQ;IAAEE,QAAQ;IAAEE,QAAQ,EAAEC,WAAW,CAAC;EAAE,CAAC;EAE7D,SAASA,WAAWA,CAAA,EAAkB;IAAA,IAAAC,qBAAA;IACpC,IAAIP,KAAK,KAAK,CAAC,IAAI,CAACJ,YAAY,EAAE;MAChC,OAAO,IAAI;IACb;IAEA,IAAII,KAAK,KAAKJ,YAAY,CAACI,KAAK,EAAE;MAChC,OAAOJ,YAAY,CAACS,QAAQ;IAC9B;IAEA,IAAIL,KAAK,GAAGJ,YAAY,CAACI,KAAK,EAAE;MAC9B,OAAOJ,YAAY,CAACpD,EAAE;IACxB;IAEA,IAAMgE,SAAS,IAAAD,qBAAA,GAAGZ,QAAQ,CACvBc,KAAK,CAAC,CAAC,EAAEnB,aAAa,CAAC,CACvBoB,OAAO,CAAC,CAAC,CACThC,IAAI,CAACK,IAAI,IAAIA,IAAI,CAACiB,KAAK,KAAKA,KAAK,CAAC,cAAAO,qBAAA,uBAHnBA,qBAAA,CAGqBF,QAAQ;IAE/C,OAAOG,SAAS,aAATA,SAAS,cAATA,SAAS,GAAI,IAAI;EAC1B;AACF;AAEA,SAASN,WAAWA,CAAAS,KAAA,EAMT;EAAA,IAAAC,mBAAA,EAAAC,eAAA;EAAA,IANU;IACnBjB,YAAY;IACZC;EAIF,CAAC,GAAAc,KAAA;EACC,OAAOvF,IAAI,CAAC0F,GAAG,EAAAF,mBAAA,GAAChB,YAAY,aAAZA,YAAY,uBAAZA,YAAY,CAAEI,KAAK,cAAAY,mBAAA,cAAAA,mBAAA,GAAI,CAAC,GAAAC,eAAA,GAAEhB,QAAQ,aAARA,QAAQ,uBAARA,QAAQ,CAAEG,KAAK,cAAAa,eAAA,cAAAA,eAAA,GAAI,CAAC,CAAC;AACjE;AAEA,SAAST,WAAWA,CAAAW,KAAA,EAIT;EAAA,IAJU;IACnBlB;EAGF,CAAC,GAAAkB,KAAA;EACC,IAAIlB,QAAQ,EAAE;IACZ,OAAOA,QAAQ,CAACG,KAAK;EACvB;EAEA,OAAO,CAAC;AACV;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASgB,OAAOA,CACd9C,KAA2B,EAGP;EAAA,IAFpBmC,QAAuB,GAAAY,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,IAAI;EAAA,IAC9BjB,KAAK,GAAAiB,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,CAAC;EAET,OAAO/C,KAAK,CACTgD,MAAM,CACL,CAACC,GAAG,EAAEpC,IAAI,KAAK,CACb,GAAGoC,GAAG,EAAAC,aAAA,CAAAA,aAAA,KACDrC,IAAI;IAAEsB,QAAQ;IAAEL,KAAK;IAAEnC,KAAK,EAAE;EAAC;EAAI;EACxC,GAAGmD,OAAO,CAACjC,IAAI,CAACpC,QAAQ,EAAEoC,IAAI,CAACvC,EAAE,EAAEwD,KAAK,GAAG,CAAC,CAAC,CAC9C,EACD,EACF,CAAC,CACAjD,GAAG,CAAC,CAACgC,IAAI,EAAElB,KAAK,KAAAuD,aAAA,CAAAA,aAAA,KAAWrC,IAAI;IAAElB;EAAK,EAAG,CAAC,CAAC,CAAC;AACjD;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASwD,WAAWA,CACzBnD,KAA2B,EACP;EACpB;EACA,IAAIA,KAAK,CAACoD,KAAK,CAACtG,mBAAmB,CAAC,EAAE;IACpC,OAAO,CAAC,GAAGkD,KAAK,CAAC;EACnB;EACA,OAAO8C,OAAO,CAAC9C,KAAK,CAAC;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASqD,YAAYA,CAC1BrD,KAAwB,EACxBsD,MAAc,EACQ;EACtB,KAAK,IAAI1E,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoB,KAAK,CAACe,MAAM,EAAEnC,CAAC,IAAI,CAAC,EAAE;IACxC,IAAMiC,IAAI,GAAGb,KAAK,CAACpB,CAAC,CAAC;IACrB,IAAM;MAAEN,EAAE;MAAEG;IAAS,CAAC,GAAGoC,IAAI;IAE7B,IAAIvC,EAAE,KAAKgF,MAAM,EAAE;MACjB,OAAOzC,IAAI;IACb;IAEA,IAAIpC,QAAQ,CAACsC,MAAM,EAAE;MACnB,IAAMwC,KAAK,GAAGF,YAAY,CAAC5E,QAAQ,EAAE6E,MAAM,CAAC;MAE5C,IAAIC,KAAK,EAAE;QACT,OAAOA,KAAK;MACd;IACF;EACF;EAEA,OAAO5C,SAAS;AAClB;AAEA,SAAS6C,aAAaA,CAACxD,KAAiB,EAAqB;EAAA,IAAnByD,KAAK,GAAAV,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,CAAC;EACjD,OAAO/C,KAAK,CAACgD,MAAM,CAAC,CAACC,GAAG,EAAAS,KAAA,KAAmB;IAAA,IAAjB;MAAEjF;IAAS,CAAC,GAAAiF,KAAA;IACpC,IAAIjF,QAAQ,CAACsC,MAAM,EAAE;MACnB,OAAOyC,aAAa,CAAC/E,QAAQ,EAAEwE,GAAG,GAAG,CAAC,CAAC;IACzC;IAEA,OAAOA,GAAG,GAAG,CAAC;EAChB,CAAC,EAAEQ,KAAK,CAAC;AACX;AAEA,OAAO,SAASE,aAAaA,CAAC3D,KAAwB,EAAE1B,EAAU,EAAU;EAC1E,IAAMuC,IAAI,GAAGwC,YAAY,CAACrD,KAAK,EAAE1B,EAAE,CAAC;EAEpC,OAAOuC,IAAI,GAAG2C,aAAa,CAAC3C,IAAI,CAACpC,QAAQ,CAAC,GAAG,CAAC;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASmF,gBAAgBA,CAC9B5D,KAAyB,EACzB6D,GAAa,EACO;EACpB,IAAMC,gBAAgB,GAAG,IAAI5D,GAAG,CAAC2D,GAAG,CAAC;EAErC,OAAO7D,KAAK,CAACtB,MAAM,CAACmC,IAAI,IAAI;IAC1B,IAAIA,IAAI,CAACsB,QAAQ,IAAI,IAAI,IAAI2B,gBAAgB,CAACtF,GAAG,CAACqC,IAAI,CAACsB,QAAQ,CAAC,EAAE;MAChE,IAAItB,IAAI,CAACpC,QAAQ,CAACsC,MAAM,EAAE;QACxB+C,gBAAgB,CAACC,GAAG,CAAClD,IAAI,CAACvC,EAAE,CAAC;MAC/B;MACA,OAAO,KAAK;IACd;IAEA,OAAO,IAAI;EACb,CAAC,CAAC;AACJ","ignoreList":[]}
+{"version":3,"file":"utilities.js","names":["arrayMove","GridUtils","isFlattenedTreeItem","getDragDepth","offset","indentationWidth","Math","round","getTreeItem","columns","movedColumns","columnHeaderGroupMap","name","hiddenColumnSet","selectedItems","showHiddenColumns","modelIndex","findIndex","col","group","get","Error","concat","modelIndexes","childIndexes","flat","id","selected","has","children","filter","_","i","map","childName","sort","a","b","aVal","Array","isArray","data","visibleIndex","bVal","getVisibleRange","isVisible","some","index","getVisibleIndex","getTreeItems","columnHeaderGroups","hiddenColumns","items","selectedItemsSet","Set","groupMap","Map","_loop","getModelIndex","columnName","find","_ref","includes","undefined","parent","item","push","length","getProjection","activeId","overId","dragOffset","overItemIndex","_ref2","activeItemIndex","_ref3","activeItem","newItems","previousItem","nextItem","dragDepth","projectedDepth","depth","maxDepth","getMaxDepth","minDepth","getMinDepth","parentId","getParentId","_newItems$slice$rever","newParent","slice","reverse","_ref4","_previousItem$depth","_nextItem$depth","max","_ref5","flatten","arguments","reduce","acc","_objectSpread","flattenTree","every","findItemDeep","itemId","child","countChildren","count","_ref6","getChildCount","removeChildrenOf","ids","excludeParentIds","add"],"sources":["../../../../src/sidebar/visibility-ordering-builder/sortable-tree/utilities.ts"],"sourcesContent":["import { arrayMove } from '@dnd-kit/sortable';\nimport type { dh } from '@deephaven/jsapi-types';\nimport {\n  GridUtils,\n  type ModelIndex,\n  type MoveOperation,\n} from '@deephaven/grid';\nimport type ColumnHeaderGroup from '../../../ColumnHeaderGroup';\nimport {\n  isFlattenedTreeItem,\n  type ReadonlyTreeItems,\n  type FlattenedItem,\n  type TreeItem,\n} from './types';\n\n/**\n * Gets the depth of an item dragged with a given x-axis offset\n *\n * @param offset x-axis offset of the dragging item\n * @param indentationWidth Width of indentation for each depth\n * @returns The drag depth for the given offset\n */\nfunction getDragDepth(offset: number, indentationWidth: number): number {\n  return Math.round(offset / indentationWidth);\n}\n\nexport interface IrisGridTreeItemData {\n  modelIndex: number | number[];\n  visibleIndex: number | [number, number];\n  isVisible: boolean;\n  group?: ColumnHeaderGroup;\n}\n\nexport type IrisGridTreeItem = TreeItem<IrisGridTreeItemData>;\n\nexport type FlattenedIrisGridTreeItem = FlattenedItem<IrisGridTreeItemData>;\n\nfunction getTreeItem(\n  columns: readonly dh.Column[],\n  movedColumns: readonly MoveOperation[],\n  columnHeaderGroupMap: Map<string, ColumnHeaderGroup>,\n  name: string,\n  hiddenColumnSet: Set<ModelIndex>,\n  selectedItems: Set<string>,\n  showHiddenColumns: boolean\n): IrisGridTreeItem {\n  const modelIndex = columns.findIndex(col => col.name === name);\n  if (modelIndex === -1) {\n    const group = columnHeaderGroupMap.get(name);\n\n    if (group == null) {\n      throw new Error(`Column or header group not found: ${name}`);\n    }\n\n    const modelIndexes = group.childIndexes.flat();\n\n    return {\n      id: name,\n      selected: selectedItems.has(name),\n      children: group.children\n        .filter(\n          (_, i) =>\n            showHiddenColumns || !hiddenColumnSet.has(group.childIndexes[i])\n        )\n        .map(childName =>\n          getTreeItem(\n            columns,\n            movedColumns,\n            columnHeaderGroupMap,\n            childName,\n            hiddenColumnSet,\n            selectedItems,\n            showHiddenColumns\n          )\n        )\n        .sort((a, b) => {\n          const aVal = Array.isArray(a.data.visibleIndex)\n            ? a.data.visibleIndex[0]\n            : a.data.visibleIndex;\n          const bVal = Array.isArray(b.data.visibleIndex)\n            ? b.data.visibleIndex[0]\n            : b.data.visibleIndex;\n          return aVal - bVal;\n        }),\n      data: {\n        modelIndex: modelIndexes,\n        visibleIndex: group.getVisibleRange(movedColumns),\n        group,\n        isVisible: modelIndexes.some(index => !hiddenColumnSet.has(index)),\n      },\n    };\n  }\n\n  return {\n    id: name,\n    children: [],\n    selected: selectedItems.has(name),\n    data: {\n      modelIndex,\n      visibleIndex: GridUtils.getVisibleIndex(modelIndex, movedColumns),\n      isVisible: !hiddenColumnSet.has(modelIndex),\n    },\n  };\n}\n\nexport function getTreeItems(\n  columns: readonly dh.Column[],\n  movedColumns: readonly MoveOperation[],\n  columnHeaderGroups: readonly ColumnHeaderGroup[],\n  hiddenColumns: readonly ModelIndex[],\n  selectedItems: readonly string[],\n  showHiddenColumns: boolean\n): IrisGridTreeItem[] {\n  const items: IrisGridTreeItem[] = [];\n  const selectedItemsSet = new Set(selectedItems);\n  const groupMap = new Map(\n    columnHeaderGroups.map(group => [group.name, group])\n  );\n  const hiddenColumnSet = new Set(hiddenColumns);\n\n  let visibleIndex = 0;\n  while (visibleIndex < columns.length) {\n    const modelIndex = GridUtils.getModelIndex(visibleIndex, movedColumns);\n    const columnName = columns[modelIndex].name;\n\n    let group = columnHeaderGroups.find(({ children }) =>\n      children.includes(columnName)\n    );\n    while (group !== undefined && group.parent !== undefined) {\n      group = groupMap.get(group.parent);\n    }\n\n    const item = getTreeItem(\n      columns,\n      movedColumns,\n      groupMap,\n      group ? group.name : columnName,\n      hiddenColumnSet,\n      selectedItemsSet,\n      showHiddenColumns\n    );\n\n    items.push(item);\n\n    if (Array.isArray(item.data.visibleIndex)) {\n      visibleIndex += item.data.visibleIndex[1] - item.data.visibleIndex[0] + 1;\n    } else {\n      visibleIndex += 1;\n    }\n  }\n\n  return items;\n}\n\n/**\n * Gets the projected drop position and depth of the dragged item\n *\n * @param items List of flattened items\n * @param activeId ID of the actively dragged item\n * @param overId ID of the item currently being dragged over\n * @param dragOffset The x-axis offset of the dragged item\n * @param indentationWidth The width for each level of the tree\n * @returns The projected position and depth if the item were to be dropped.\n *          Null if the projection could not be calculated.\n */\nexport function getProjection(\n  items: FlattenedItem[],\n  activeId: string,\n  overId: string,\n  dragOffset: number,\n  indentationWidth: number\n): {\n  depth: number;\n  maxDepth: number;\n  minDepth: number;\n  parentId: string | null;\n} | null {\n  const overItemIndex = items.findIndex(({ id }) => id === overId);\n  const activeItemIndex = items.findIndex(({ id }) => id === activeId);\n  if (overItemIndex === -1 || activeItemIndex === -1) {\n    return null;\n  }\n  const activeItem = items[activeItemIndex];\n  const newItems = arrayMove(items, activeItemIndex, overItemIndex);\n  const previousItem: FlattenedItem | undefined = newItems[overItemIndex - 1];\n  const nextItem = newItems[overItemIndex + 1];\n  const dragDepth = getDragDepth(dragOffset, indentationWidth);\n  const projectedDepth = activeItem.depth + dragDepth;\n  const maxDepth = getMaxDepth({\n    previousItem,\n    nextItem,\n  });\n  const minDepth = getMinDepth({ nextItem });\n  let depth = projectedDepth;\n\n  if (projectedDepth >= maxDepth) {\n    depth = maxDepth;\n  } else if (projectedDepth < minDepth) {\n    depth = minDepth;\n  }\n\n  return { depth, maxDepth, minDepth, parentId: getParentId() };\n\n  function getParentId(): string | null {\n    if (depth === 0 || !previousItem) {\n      return null;\n    }\n\n    if (depth === previousItem.depth) {\n      return previousItem.parentId;\n    }\n\n    if (depth > previousItem.depth) {\n      return previousItem.id;\n    }\n\n    const newParent = newItems\n      .slice(0, overItemIndex)\n      .reverse()\n      .find(item => item.depth === depth)?.parentId;\n\n    return newParent ?? null;\n  }\n}\n\nfunction getMaxDepth({\n  previousItem,\n  nextItem,\n}: {\n  previousItem?: FlattenedItem;\n  nextItem?: FlattenedItem;\n}): number {\n  return Math.max(previousItem?.depth ?? 0, nextItem?.depth ?? 0);\n}\n\nfunction getMinDepth({\n  nextItem,\n}: {\n  nextItem: FlattenedItem | undefined;\n}): number {\n  if (nextItem) {\n    return nextItem.depth;\n  }\n\n  return 0;\n}\n\n/**\n * Helper function to recursively flatten a tree\n *\n * @param items Items to flatten\n * @param parentId The current parentId of the items\n * @param depth The current depth of the items\n * @returns Flattened items\n */\nfunction flatten<T>(\n  items: ReadonlyTreeItems<T>,\n  parentId: string | null = null,\n  depth = 0\n): FlattenedItem<T>[] {\n  return items\n    .reduce<FlattenedItem<T>[]>(\n      (acc, item) => [\n        ...acc,\n        { ...item, parentId, depth, index: 0 }, // Index will be recalculated after\n        ...flatten(item.children, item.id, depth + 1),\n      ],\n      []\n    )\n    .map((item, index) => ({ ...item, index })); // Recalculate indexes to be sequential\n}\n\n/**\n * Flattens a tree into a 1D array given the items\n * @param items The tree items to flatten\n * @returns The flattened tree items list\n */\nexport function flattenTree<T>(\n  items: ReadonlyTreeItems<T>\n): FlattenedItem<T>[] {\n  // Should help prevent double flattening since FlattenedItems are valid TreeItems\n  if (items.every(isFlattenedTreeItem)) {\n    return [...items];\n  }\n  return flatten(items);\n}\n\n/**\n * Recursively checks for the item in a list of items.\n * The list does not have to be flattened prior to searching.\n *\n * @param items Items to search\n * @param itemId Item to find\n * @returns The item if found\n */\nexport function findItemDeep(\n  items: ReadonlyTreeItems,\n  itemId: string\n): TreeItem | undefined {\n  for (let i = 0; i < items.length; i += 1) {\n    const item = items[i];\n    const { id, children } = item;\n\n    if (id === itemId) {\n      return item;\n    }\n\n    if (children.length) {\n      const child = findItemDeep(children, itemId);\n\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  return undefined;\n}\n\nfunction countChildren(items: TreeItem[], count = 0): number {\n  return items.reduce((acc, { children }) => {\n    if (children.length) {\n      return countChildren(children, acc + 1);\n    }\n\n    return acc + 1;\n  }, count);\n}\n\nexport function getChildCount(items: ReadonlyTreeItems, id: string): number {\n  const item = findItemDeep(items, id);\n\n  return item ? countChildren(item.children) : 0;\n}\n\n/**\n * Removes the children of the list of parents from the list of flattened items\n *\n * @param items The flattened items to remove from\n * @param ids The parents we want to remove the children of\n * @returns The flattened items without the children of the parents\n */\nexport function removeChildrenOf<T>(\n  items: FlattenedItem<T>[],\n  ids: string[]\n): FlattenedItem<T>[] {\n  const excludeParentIds = new Set(ids);\n\n  return items.filter(item => {\n    if (item.parentId != null && excludeParentIds.has(item.parentId)) {\n      if (item.children.length) {\n        excludeParentIds.add(item.id);\n      }\n      return false;\n    }\n\n    return true;\n  });\n}\n"],"mappings":";;;;;AAAA,SAASA,SAAS,QAAQ,mBAAmB;AAE7C,SACEC,SAAS,QAGJ,iBAAiB;AAAC,SAGvBC,mBAAmB;AAMrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,YAAYA,CAACC,MAAc,EAAEC,gBAAwB,EAAU;EACtE,OAAOC,IAAI,CAACC,KAAK,CAACH,MAAM,GAAGC,gBAAgB,CAAC;AAC9C;AAaA,SAASG,WAAWA,CAClBC,OAA6B,EAC7BC,YAAsC,EACtCC,oBAAoD,EACpDC,IAAY,EACZC,eAAgC,EAChCC,aAA0B,EAC1BC,iBAA0B,EACR;EAClB,IAAMC,UAAU,GAAGP,OAAO,CAACQ,SAAS,CAACC,GAAG,IAAIA,GAAG,CAACN,IAAI,KAAKA,IAAI,CAAC;EAC9D,IAAII,UAAU,KAAK,CAAC,CAAC,EAAE;IACrB,IAAMG,KAAK,GAAGR,oBAAoB,CAACS,GAAG,CAACR,IAAI,CAAC;IAE5C,IAAIO,KAAK,IAAI,IAAI,EAAE;MACjB,MAAM,IAAIE,KAAK,sCAAAC,MAAA,CAAsCV,IAAI,CAAE,CAAC;IAC9D;IAEA,IAAMW,YAAY,GAAGJ,KAAK,CAACK,YAAY,CAACC,IAAI,CAAC,CAAC;IAE9C,OAAO;MACLC,EAAE,EAAEd,IAAI;MACRe,QAAQ,EAAEb,aAAa,CAACc,GAAG,CAAChB,IAAI,CAAC;MACjCiB,QAAQ,EAAEV,KAAK,CAACU,QAAQ,CACrBC,MAAM,CACL,CAACC,CAAC,EAAEC,CAAC,KACHjB,iBAAiB,IAAI,CAACF,eAAe,CAACe,GAAG,CAACT,KAAK,CAACK,YAAY,CAACQ,CAAC,CAAC,CACnE,CAAC,CACAC,GAAG,CAACC,SAAS,IACZ1B,WAAW,CACTC,OAAO,EACPC,YAAY,EACZC,oBAAoB,EACpBuB,SAAS,EACTrB,eAAe,EACfC,aAAa,EACbC,iBACF,CACF,CAAC,CACAoB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAK;QACd,IAAMC,IAAI,GAAGC,KAAK,CAACC,OAAO,CAACJ,CAAC,CAACK,IAAI,CAACC,YAAY,CAAC,GAC3CN,CAAC,CAACK,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GACtBN,CAAC,CAACK,IAAI,CAACC,YAAY;QACvB,IAAMC,IAAI,GAAGJ,KAAK,CAACC,OAAO,CAACH,CAAC,CAACI,IAAI,CAACC,YAAY,CAAC,GAC3CL,CAAC,CAACI,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GACtBL,CAAC,CAACI,IAAI,CAACC,YAAY;QACvB,OAAOJ,IAAI,GAAGK,IAAI;MACpB,CAAC,CAAC;MACJF,IAAI,EAAE;QACJzB,UAAU,EAAEO,YAAY;QACxBmB,YAAY,EAAEvB,KAAK,CAACyB,eAAe,CAAClC,YAAY,CAAC;QACjDS,KAAK;QACL0B,SAAS,EAAEtB,YAAY,CAACuB,IAAI,CAACC,KAAK,IAAI,CAAClC,eAAe,CAACe,GAAG,CAACmB,KAAK,CAAC;MACnE;IACF,CAAC;EACH;EAEA,OAAO;IACLrB,EAAE,EAAEd,IAAI;IACRiB,QAAQ,EAAE,EAAE;IACZF,QAAQ,EAAEb,aAAa,CAACc,GAAG,CAAChB,IAAI,CAAC;IACjC6B,IAAI,EAAE;MACJzB,UAAU;MACV0B,YAAY,EAAEzC,SAAS,CAAC+C,eAAe,CAAChC,UAAU,EAAEN,YAAY,CAAC;MACjEmC,SAAS,EAAE,CAAChC,eAAe,CAACe,GAAG,CAACZ,UAAU;IAC5C;EACF,CAAC;AACH;AAEA,OAAO,SAASiC,YAAYA,CAC1BxC,OAA6B,EAC7BC,YAAsC,EACtCwC,kBAAgD,EAChDC,aAAoC,EACpCrC,aAAgC,EAChCC,iBAA0B,EACN;EACpB,IAAMqC,KAAyB,GAAG,EAAE;EACpC,IAAMC,gBAAgB,GAAG,IAAIC,GAAG,CAACxC,aAAa,CAAC;EAC/C,IAAMyC,QAAQ,GAAG,IAAIC,GAAG,CACtBN,kBAAkB,CAACjB,GAAG,CAACd,KAAK,IAAI,CAACA,KAAK,CAACP,IAAI,EAAEO,KAAK,CAAC,CACrD,CAAC;EACD,IAAMN,eAAe,GAAG,IAAIyC,GAAG,CAACH,aAAa,CAAC;EAE9C,IAAIT,YAAY,GAAG,CAAC;EAAC,IAAAe,KAAA,YAAAA,MAAA,EACiB;IACpC,IAAMzC,UAAU,GAAGf,SAAS,CAACyD,aAAa,CAAChB,YAAY,EAAEhC,YAAY,CAAC;IACtE,IAAMiD,UAAU,GAAGlD,OAAO,CAACO,UAAU,CAAC,CAACJ,IAAI;IAE3C,IAAIO,KAAK,GAAG+B,kBAAkB,CAACU,IAAI,CAACC,IAAA;MAAA,IAAC;QAAEhC;MAAS,CAAC,GAAAgC,IAAA;MAAA,OAC/ChC,QAAQ,CAACiC,QAAQ,CAACH,UAAU,CAAC;IAAA,CAC/B,CAAC;IACD,OAAOxC,KAAK,KAAK4C,SAAS,IAAI5C,KAAK,CAAC6C,MAAM,KAAKD,SAAS,EAAE;MACxD5C,KAAK,GAAGoC,QAAQ,CAACnC,GAAG,CAACD,KAAK,CAAC6C,MAAM,CAAC;IACpC;IAEA,IAAMC,IAAI,GAAGzD,WAAW,CACtBC,OAAO,EACPC,YAAY,EACZ6C,QAAQ,EACRpC,KAAK,GAAGA,KAAK,CAACP,IAAI,GAAG+C,UAAU,EAC/B9C,eAAe,EACfwC,gBAAgB,EAChBtC,iBACF,CAAC;IAEDqC,KAAK,CAACc,IAAI,CAACD,IAAI,CAAC;IAEhB,IAAI1B,KAAK,CAACC,OAAO,CAACyB,IAAI,CAACxB,IAAI,CAACC,YAAY,CAAC,EAAE;MACzCA,YAAY,IAAIuB,IAAI,CAACxB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GAAGuB,IAAI,CAACxB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAC3E,CAAC,MAAM;MACLA,YAAY,IAAI,CAAC;IACnB;EACF,CAAC;EA5BD,OAAOA,YAAY,GAAGjC,OAAO,CAAC0D,MAAM;IAAAV,KAAA;EAAA;EA8BpC,OAAOL,KAAK;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASgB,aAAaA,CAC3BhB,KAAsB,EACtBiB,QAAgB,EAChBC,MAAc,EACdC,UAAkB,EAClBlE,gBAAwB,EAMjB;EACP,IAAMmE,aAAa,GAAGpB,KAAK,CAACnC,SAAS,CAACwD,KAAA;IAAA,IAAC;MAAE/C;IAAG,CAAC,GAAA+C,KAAA;IAAA,OAAK/C,EAAE,KAAK4C,MAAM;EAAA,EAAC;EAChE,IAAMI,eAAe,GAAGtB,KAAK,CAACnC,SAAS,CAAC0D,KAAA;IAAA,IAAC;MAAEjD;IAAG,CAAC,GAAAiD,KAAA;IAAA,OAAKjD,EAAE,KAAK2C,QAAQ;EAAA,EAAC;EACpE,IAAIG,aAAa,KAAK,CAAC,CAAC,IAAIE,eAAe,KAAK,CAAC,CAAC,EAAE;IAClD,OAAO,IAAI;EACb;EACA,IAAME,UAAU,GAAGxB,KAAK,CAACsB,eAAe,CAAC;EACzC,IAAMG,QAAQ,GAAG7E,SAAS,CAACoD,KAAK,EAAEsB,eAAe,EAAEF,aAAa,CAAC;EACjE,IAAMM,YAAuC,GAAGD,QAAQ,CAACL,aAAa,GAAG,CAAC,CAAC;EAC3E,IAAMO,QAAQ,GAAGF,QAAQ,CAACL,aAAa,GAAG,CAAC,CAAC;EAC5C,IAAMQ,SAAS,GAAG7E,YAAY,CAACoE,UAAU,EAAElE,gBAAgB,CAAC;EAC5D,IAAM4E,cAAc,GAAGL,UAAU,CAACM,KAAK,GAAGF,SAAS;EACnD,IAAMG,QAAQ,GAAGC,WAAW,CAAC;IAC3BN,YAAY;IACZC;EACF,CAAC,CAAC;EACF,IAAMM,QAAQ,GAAGC,WAAW,CAAC;IAAEP;EAAS,CAAC,CAAC;EAC1C,IAAIG,KAAK,GAAGD,cAAc;EAE1B,IAAIA,cAAc,IAAIE,QAAQ,EAAE;IAC9BD,KAAK,GAAGC,QAAQ;EAClB,CAAC,MAAM,IAAIF,cAAc,GAAGI,QAAQ,EAAE;IACpCH,KAAK,GAAGG,QAAQ;EAClB;EAEA,OAAO;IAAEH,KAAK;IAAEC,QAAQ;IAAEE,QAAQ;IAAEE,QAAQ,EAAEC,WAAW,CAAC;EAAE,CAAC;EAE7D,SAASA,WAAWA,CAAA,EAAkB;IAAA,IAAAC,qBAAA;IACpC,IAAIP,KAAK,KAAK,CAAC,IAAI,CAACJ,YAAY,EAAE;MAChC,OAAO,IAAI;IACb;IAEA,IAAII,KAAK,KAAKJ,YAAY,CAACI,KAAK,EAAE;MAChC,OAAOJ,YAAY,CAACS,QAAQ;IAC9B;IAEA,IAAIL,KAAK,GAAGJ,YAAY,CAACI,KAAK,EAAE;MAC9B,OAAOJ,YAAY,CAACpD,EAAE;IACxB;IAEA,IAAMgE,SAAS,IAAAD,qBAAA,GAAGZ,QAAQ,CACvBc,KAAK,CAAC,CAAC,EAAEnB,aAAa,CAAC,CACvBoB,OAAO,CAAC,CAAC,CACThC,IAAI,CAACK,IAAI,IAAIA,IAAI,CAACiB,KAAK,KAAKA,KAAK,CAAC,cAAAO,qBAAA,uBAHnBA,qBAAA,CAGqBF,QAAQ;IAE/C,OAAOG,SAAS,aAATA,SAAS,cAATA,SAAS,GAAI,IAAI;EAC1B;AACF;AAEA,SAASN,WAAWA,CAAAS,KAAA,EAMT;EAAA,IAAAC,mBAAA,EAAAC,eAAA;EAAA,IANU;IACnBjB,YAAY;IACZC;EAIF,CAAC,GAAAc,KAAA;EACC,OAAOvF,IAAI,CAAC0F,GAAG,EAAAF,mBAAA,GAAChB,YAAY,aAAZA,YAAY,uBAAZA,YAAY,CAAEI,KAAK,cAAAY,mBAAA,cAAAA,mBAAA,GAAI,CAAC,GAAAC,eAAA,GAAEhB,QAAQ,aAARA,QAAQ,uBAARA,QAAQ,CAAEG,KAAK,cAAAa,eAAA,cAAAA,eAAA,GAAI,CAAC,CAAC;AACjE;AAEA,SAAST,WAAWA,CAAAW,KAAA,EAIT;EAAA,IAJU;IACnBlB;EAGF,CAAC,GAAAkB,KAAA;EACC,IAAIlB,QAAQ,EAAE;IACZ,OAAOA,QAAQ,CAACG,KAAK;EACvB;EAEA,OAAO,CAAC;AACV;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASgB,OAAOA,CACd9C,KAA2B,EAGP;EAAA,IAFpBmC,QAAuB,GAAAY,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,IAAI;EAAA,IAC9BjB,KAAK,GAAAiB,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,CAAC;EAET,OAAO/C,KAAK,CACTgD,MAAM,CACL,CAACC,GAAG,EAAEpC,IAAI,KAAK,CACb,GAAGoC,GAAG,EAAAC,aAAA,CAAAA,aAAA,KACDrC,IAAI;IAAEsB,QAAQ;IAAEL,KAAK;IAAEnC,KAAK,EAAE;EAAC;EAAI;EACxC,GAAGmD,OAAO,CAACjC,IAAI,CAACpC,QAAQ,EAAEoC,IAAI,CAACvC,EAAE,EAAEwD,KAAK,GAAG,CAAC,CAAC,CAC9C,EACD,EACF,CAAC,CACAjD,GAAG,CAAC,CAACgC,IAAI,EAAElB,KAAK,KAAAuD,aAAA,CAAAA,aAAA,KAAWrC,IAAI;IAAElB;EAAK,EAAG,CAAC,CAAC,CAAC;AACjD;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASwD,WAAWA,CACzBnD,KAA2B,EACP;EACpB;EACA,IAAIA,KAAK,CAACoD,KAAK,CAACtG,mBAAmB,CAAC,EAAE;IACpC,OAAO,CAAC,GAAGkD,KAAK,CAAC;EACnB;EACA,OAAO8C,OAAO,CAAC9C,KAAK,CAAC;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASqD,YAAYA,CAC1BrD,KAAwB,EACxBsD,MAAc,EACQ;EACtB,KAAK,IAAI1E,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoB,KAAK,CAACe,MAAM,EAAEnC,CAAC,IAAI,CAAC,EAAE;IACxC,IAAMiC,IAAI,GAAGb,KAAK,CAACpB,CAAC,CAAC;IACrB,IAAM;MAAEN,EAAE;MAAEG;IAAS,CAAC,GAAGoC,IAAI;IAE7B,IAAIvC,EAAE,KAAKgF,MAAM,EAAE;MACjB,OAAOzC,IAAI;IACb;IAEA,IAAIpC,QAAQ,CAACsC,MAAM,EAAE;MACnB,IAAMwC,KAAK,GAAGF,YAAY,CAAC5E,QAAQ,EAAE6E,MAAM,CAAC;MAE5C,IAAIC,KAAK,EAAE;QACT,OAAOA,KAAK;MACd;IACF;EACF;EAEA,OAAO5C,SAAS;AAClB;AAEA,SAAS6C,aAAaA,CAACxD,KAAiB,EAAqB;EAAA,IAAnByD,KAAK,GAAAV,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,CAAC;EACjD,OAAO/C,KAAK,CAACgD,MAAM,CAAC,CAACC,GAAG,EAAAS,KAAA,KAAmB;IAAA,IAAjB;MAAEjF;IAAS,CAAC,GAAAiF,KAAA;IACpC,IAAIjF,QAAQ,CAACsC,MAAM,EAAE;MACnB,OAAOyC,aAAa,CAAC/E,QAAQ,EAAEwE,GAAG,GAAG,CAAC,CAAC;IACzC;IAEA,OAAOA,GAAG,GAAG,CAAC;EAChB,CAAC,EAAEQ,KAAK,CAAC;AACX;AAEA,OAAO,SAASE,aAAaA,CAAC3D,KAAwB,EAAE1B,EAAU,EAAU;EAC1E,IAAMuC,IAAI,GAAGwC,YAAY,CAACrD,KAAK,EAAE1B,EAAE,CAAC;EAEpC,OAAOuC,IAAI,GAAG2C,aAAa,CAAC3C,IAAI,CAACpC,QAAQ,CAAC,GAAG,CAAC;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASmF,gBAAgBA,CAC9B5D,KAAyB,EACzB6D,GAAa,EACO;EACpB,IAAMC,gBAAgB,GAAG,IAAI5D,GAAG,CAAC2D,GAAG,CAAC;EAErC,OAAO7D,KAAK,CAACtB,MAAM,CAACmC,IAAI,IAAI;IAC1B,IAAIA,IAAI,CAACsB,QAAQ,IAAI,IAAI,IAAI2B,gBAAgB,CAACtF,GAAG,CAACqC,IAAI,CAACsB,QAAQ,CAAC,EAAE;MAChE,IAAItB,IAAI,CAACpC,QAAQ,CAACsC,MAAM,EAAE;QACxB+C,gBAAgB,CAACC,GAAG,CAAClD,IAAI,CAACvC,EAAE,CAAC;MAC/B;MACA,OAAO,KAAK;IACd;IAEA,OAAO,IAAI;EACb,CAAC,CAAC;AACJ","ignoreList":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@deephaven/iris-grid",
-  "version": "1.8.1-beta.8+f3eb5389",
+  "version": "1.9.0",
   "description": "Deephaven Iris Grid",
   "author": "Deephaven Data Labs LLC",
   "license": "Apache-2.0",
@@ -31,20 +31,21 @@
     "build:sass": "sass --embed-sources --load-path=../../node_modules ./src:./dist"
   },
   "dependencies": {
-    "@deephaven/components": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/console": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/filters": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/grid": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/icons": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/jsapi-components": "^1.8.1-beta.8+f3eb5389",
+    "@deephaven/components": "^1.9.0",
+    "@deephaven/console": "^1.9.0",
+    "@deephaven/filters": "^1.1.0",
+    "@deephaven/grid": "^1.9.0",
+    "@deephaven/icons": "^1.2.0",
+    "@deephaven/jsapi-components": "^1.9.0",
     "@deephaven/jsapi-types": "^1.0.0-dev0.40.4",
-    "@deephaven/jsapi-utils": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/log": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/react-hooks": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/storage": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/utils": "^1.8.1-beta.8+f3eb5389",
+    "@deephaven/jsapi-utils": "^1.9.0",
+    "@deephaven/log": "^1.8.0",
+    "@deephaven/react-hooks": "^1.8.0",
+    "@deephaven/storage": "^1.8.0",
+    "@deephaven/utils": "^1.8.0",
     "@dnd-kit/core": "^6.1.0",
-    "@dnd-kit/sortable": "^7.0.2",
+    "@dnd-kit/modifiers": "^9.0.0",
+    "@dnd-kit/sortable": "^10.0.0",
     "@dnd-kit/utilities": "^3.2.2",
     "@fortawesome/react-fontawesome": "^0.2.0",
     "@hello-pangea/dnd": "^18.0.1",
@@ -60,13 +61,13 @@
     "react-transition-group": "^4.4.2"
   },
   "peerDependencies": {
-    "react": ">=16.8.0",
-    "react-dom": ">=16.8.0"
+    "react": ">=18.0.0",
+    "react-dom": ">=18.0.0"
   },
   "devDependencies": {
-    "@deephaven/jsapi-shim": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/mocks": "^1.8.1-beta.8+f3eb5389",
-    "@deephaven/test-utils": "^1.8.1-beta.8+f3eb5389",
+    "@deephaven/jsapi-shim": "^1.9.0",
+    "@deephaven/mocks": "^1.1.0",
+    "@deephaven/test-utils": "^1.8.0",
     "deep-equal": "2.2.3"
   },
   "files": [
@@ -79,5 +80,5 @@
   "publishConfig": {
     "access": "public"
   },
-  "gitHead": "f3eb5389531d00888d8846c12fc9f11aaed1f691"
+  "gitHead": "590def353bdddd4fa81dce63b150b4d15f1e50fe"
 }

package/dist/sidebar/visibility-ordering-builder/sortable-tree/SortableTreeInner.d.ts

@@ -1,21 +0,0 @@
-import React from 'react';
-import type { FlattenedItem } from './types';
-interface Props<T> {
-    items: FlattenedItem<T>[];
-    indentationWidth?: number;
-    indicator?: boolean;
-    renderItem: (props: {
-        clone: boolean;
-        childCount?: number;
-        value: string;
-        item: FlattenedItem<T>;
-        ref: React.Ref<HTMLDivElement>;
-        handleProps?: Record<string, unknown>;
-    }) => JSX.Element;
-    activeId: string | null;
-    overId: string | null;
-    offsetLeft: number;
-}
-export default function SortableTreeInner<T>({ items, renderItem, indentationWidth, indicator, activeId, overId, offsetLeft, }: Props<T>): JSX.Element;
-export {};
-//# sourceMappingURL=SortableTreeInner.d.ts.map

package/dist/sidebar/visibility-ordering-builder/sortable-tree/SortableTreeInner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SortableTreeInner.d.ts","sourceRoot":"","sources":["../../../../src/sidebar/visibility-ordering-builder/sortable-tree/SortableTreeInner.tsx"],"names":[],"mappings":"AAAA,OAAO,KAA4B,MAAM,OAAO,CAAC;AAYjD,OAAO,KAAK,EAAE,aAAa,EAAiB,MAAM,SAAS,CAAC;AAkE5D,UAAU,KAAK,CAAC,CAAC;IACf,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1B,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,CAAC,KAAK,EAAE;QAClB,KAAK,EAAE,OAAO,CAAC;QACf,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,KAAK,EAAE,MAAM,CAAC;QACd,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QACvB,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC/B,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACvC,KAAK,GAAG,CAAC,OAAO,CAAC;IAClB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,CAAC,OAAO,UAAU,iBAAiB,CAAC,CAAC,EAAE,EAC3C,KAAK,EACL,UAAU,EACV,gBAAqB,EACrB,SAAiB,EACjB,QAAQ,EACR,MAAM,EACN,UAAU,GACX,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAqFxB"}

package/dist/sidebar/visibility-ordering-builder/sortable-tree/SortableTreeInner.js

@@ -1,149 +0,0 @@
-function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
-function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
-function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
-function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-import React, { useEffect, useRef } from 'react';
-import { createPortal } from 'react-dom';
-import classNames from 'classnames';
-import { DragOverlay, defaultDropAnimation, useDndContext } from '@dnd-kit/core';
-import { CSS } from '@dnd-kit/utilities';
-import { getProjection, getChildCount } from "./utilities.js";
-import { SortableTreeItem } from "./SortableTreeItem.js";
-import { jsx as _jsx, Fragment as _Fragment, jsxs as _jsxs } from "react/jsx-runtime";
-var dropAnimationConfig = {
-  keyframes(_ref) {
-    var {
-      transform
-    } = _ref;
-    return [{
-      opacity: 1,
-      transform: CSS.Transform.toString(transform.initial)
-    }, {
-      opacity: 0,
-      transform: CSS.Transform.toString(_objectSpread(_objectSpread({}, transform.final), {}, {
-        x: transform.final.x + 5,
-        y: transform.final.y + 5
-      }))
-    }];
-  },
-  easing: 'ease-out',
-  sideEffects(_ref2) {
-    var {
-      active
-    } = _ref2;
-    active.node.animate([{
-      opacity: 0
-    }, {
-      opacity: 1
-    }], {
-      duration: defaultDropAnimation.duration,
-      easing: defaultDropAnimation.easing
-    });
-  }
-};
-
-// Used to track the offset for adjustToCursor
-// Once drag starts, set this. Once it ends, null this
-var offsetY = null;
-
-/**
- * This adjusts the transform to move to the cursor if it gets shifted due to multi-select.
- * With multi-select, the selected items (except dragged) are removed on drag.
- * This can cause the overlay item to disconnect from the cursor in some cases.
- * E.g. select first 3 items, start dragging from 3rd item.
- * Without this modifier, the drag overlay will be shifted 60px up from the cursor after the items are removed.
- *
- * This assumes all items are the same height as the dragged item
- * @param args Modifier args from dnd-kit
- * @returns Transform so that the dragged item stays on the cursor
- */
-function adjustToCursor(args) {
-  if (offsetY == null && args.activeNodeRect && args.activatorEvent instanceof PointerEvent) {
-    offsetY = Math.floor((args.activatorEvent.clientY - args.activeNodeRect.top) / args.activeNodeRect.height) * args.activeNodeRect.height;
-  }
-  if (!args.activeNodeRect) {
-    offsetY = null;
-  }
-  return _objectSpread(_objectSpread({}, args.transform), {}, {
-    y: args.transform.y + (offsetY !== null && offsetY !== void 0 ? offsetY : 0)
-  });
-}
-export default function SortableTreeInner(_ref3) {
-  var {
-    items,
-    renderItem,
-    indentationWidth = 30,
-    indicator = false,
-    activeId,
-    overId,
-    offsetLeft
-  } = _ref3;
-  var context = useDndContext();
-  var contextRef = useRef(context);
-  useEffect(function updateContextRef() {
-    contextRef.current = context;
-  }, [context]);
-
-  // Without this, animations are funky when using the move/sort buttons
-  // dnd-kit only remeasures on drag/drop by default
-  // The context object changes while dragging (items don't)
-  // Using the context ref allows this to trigger properly on only items changes
-  useEffect(function remeasureContainers() {
-    contextRef.current.measureDroppableContainers(items.map(_ref4 => {
-      var {
-        id
-      } = _ref4;
-      return id;
-    }));
-  }, [items]);
-  var projected = activeId != null && overId != null ? getProjection(items, activeId, overId, offsetLeft, indentationWidth) : null;
-  var sensorContext = useRef({
-    items,
-    offset: offsetLeft
-  });
-  var activeItem = activeId != null ? items.find(_ref5 => {
-    var {
-      id
-    } = _ref5;
-    return id === activeId;
-  }) : null;
-  useEffect(() => {
-    sensorContext.current = {
-      items,
-      offset: offsetLeft
-    };
-  }, [items, offsetLeft]);
-  return /*#__PURE__*/_jsxs(_Fragment, {
-    children: [/*#__PURE__*/_jsx("div", {
-      className: classNames('tree-container', activeId != null && 'marching-ants'),
-      children: items.map(item => {
-        var {
-          id,
-          depth
-        } = item;
-        return /*#__PURE__*/_jsx(SortableTreeItem, {
-          id: id,
-          value: id,
-          depth: id === activeId && projected ? projected.depth : depth,
-          item: item,
-          renderItem: renderItem
-        }, id);
-      })
-    }), /*#__PURE__*/createPortal(/*#__PURE__*/_jsx(DragOverlay, {
-      dropAnimation: dropAnimationConfig,
-      modifiers: [adjustToCursor],
-      className: "visibility-ordering-list",
-      children: activeId != null && activeItem ? /*#__PURE__*/_jsx(SortableTreeItem, {
-        id: activeId,
-        depth: activeItem.depth,
-        clone: true,
-        childCount: getChildCount(items, activeId) + 1,
-        value: activeId.toString(),
-        renderItem: renderItem,
-        item: activeItem
-      }) : null
-    }), document.body)]
-  });
-}
-//# sourceMappingURL=SortableTreeInner.js.map

package/dist/sidebar/visibility-ordering-builder/sortable-tree/SortableTreeInner.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SortableTreeInner.js","names":["React","useEffect","useRef","createPortal","classNames","DragOverlay","defaultDropAnimation","useDndContext","CSS","getProjection","getChildCount","SortableTreeItem","jsx","_jsx","Fragment","_Fragment","jsxs","_jsxs","dropAnimationConfig","keyframes","_ref","transform","opacity","Transform","toString","initial","_objectSpread","final","x","y","easing","sideEffects","_ref2","active","node","animate","duration","offsetY","adjustToCursor","args","activeNodeRect","activatorEvent","PointerEvent","Math","floor","clientY","top","height","SortableTreeInner","_ref3","items","renderItem","indentationWidth","indicator","activeId","overId","offsetLeft","context","contextRef","updateContextRef","current","remeasureContainers","measureDroppableContainers","map","_ref4","id","projected","sensorContext","offset","activeItem","find","_ref5","children","className","item","depth","value","dropAnimation","modifiers","clone","childCount","document","body"],"sources":["../../../../src/sidebar/visibility-ordering-builder/sortable-tree/SortableTreeInner.tsx"],"sourcesContent":["import React, { useEffect, useRef } from 'react';\nimport { createPortal } from 'react-dom';\nimport classNames from 'classnames';\nimport {\n  DragOverlay,\n  type DropAnimation,\n  type Modifier,\n  defaultDropAnimation,\n  useDndContext,\n} from '@dnd-kit/core';\nimport { CSS } from '@dnd-kit/utilities';\nimport { getProjection, getChildCount } from './utilities';\nimport type { FlattenedItem, SensorContext } from './types';\nimport { SortableTreeItem } from './SortableTreeItem';\n\nconst dropAnimationConfig: DropAnimation = {\n  keyframes({ transform }) {\n    return [\n      { opacity: 1, transform: CSS.Transform.toString(transform.initial) },\n      {\n        opacity: 0,\n        transform: CSS.Transform.toString({\n          ...transform.final,\n          x: transform.final.x + 5,\n          y: transform.final.y + 5,\n        }),\n      },\n    ];\n  },\n  easing: 'ease-out',\n  sideEffects({ active }) {\n    active.node.animate([{ opacity: 0 }, { opacity: 1 }], {\n      duration: defaultDropAnimation.duration,\n      easing: defaultDropAnimation.easing,\n    });\n  },\n};\n\n// Used to track the offset for adjustToCursor\n// Once drag starts, set this. Once it ends, null this\nlet offsetY: number | null = null;\n\n/**\n * This adjusts the transform to move to the cursor if it gets shifted due to multi-select.\n * With multi-select, the selected items (except dragged) are removed on drag.\n * This can cause the overlay item to disconnect from the cursor in some cases.\n * E.g. select first 3 items, start dragging from 3rd item.\n * Without this modifier, the drag overlay will be shifted 60px up from the cursor after the items are removed.\n *\n * This assumes all items are the same height as the dragged item\n * @param args Modifier args from dnd-kit\n * @returns Transform so that the dragged item stays on the cursor\n */\nfunction adjustToCursor(args: Parameters<Modifier>[0]): {\n  y: number;\n  x: number;\n  scaleX: number;\n  scaleY: number;\n} {\n  if (\n    offsetY == null &&\n    args.activeNodeRect &&\n    args.activatorEvent instanceof PointerEvent\n  ) {\n    offsetY =\n      Math.floor(\n        (args.activatorEvent.clientY - args.activeNodeRect.top) /\n          args.activeNodeRect.height\n      ) * args.activeNodeRect.height;\n  }\n\n  if (!args.activeNodeRect) {\n    offsetY = null;\n  }\n\n  return { ...args.transform, y: args.transform.y + (offsetY ?? 0) };\n}\n\ninterface Props<T> {\n  items: FlattenedItem<T>[];\n  indentationWidth?: number;\n  indicator?: boolean;\n  renderItem: (props: {\n    clone: boolean;\n    childCount?: number;\n    value: string;\n    item: FlattenedItem<T>;\n    ref: React.Ref<HTMLDivElement>;\n    handleProps?: Record<string, unknown>;\n  }) => JSX.Element;\n  activeId: string | null;\n  overId: string | null;\n  offsetLeft: number;\n}\n\nexport default function SortableTreeInner<T>({\n  items,\n  renderItem,\n  indentationWidth = 30,\n  indicator = false,\n  activeId,\n  overId,\n  offsetLeft,\n}: Props<T>): JSX.Element {\n  const context = useDndContext();\n  const contextRef = useRef(context);\n\n  useEffect(\n    function updateContextRef() {\n      contextRef.current = context;\n    },\n    [context]\n  );\n\n  // Without this, animations are funky when using the move/sort buttons\n  // dnd-kit only remeasures on drag/drop by default\n  // The context object changes while dragging (items don't)\n  // Using the context ref allows this to trigger properly on only items changes\n  useEffect(\n    function remeasureContainers() {\n      contextRef.current.measureDroppableContainers(items.map(({ id }) => id));\n    },\n    [items]\n  );\n\n  const projected =\n    activeId != null && overId != null\n      ? getProjection(items, activeId, overId, offsetLeft, indentationWidth)\n      : null;\n  const sensorContext: SensorContext = useRef({\n    items,\n    offset: offsetLeft,\n  });\n\n  const activeItem =\n    activeId != null ? items.find(({ id }) => id === activeId) : null;\n\n  useEffect(() => {\n    sensorContext.current = {\n      items,\n      offset: offsetLeft,\n    };\n  }, [items, offsetLeft]);\n\n  return (\n    <>\n      <div\n        className={classNames(\n          'tree-container',\n          activeId != null && 'marching-ants'\n        )}\n      >\n        {items.map(item => {\n          const { id, depth } = item;\n          return (\n            <SortableTreeItem\n              key={id}\n              id={id}\n              value={id}\n              depth={id === activeId && projected ? projected.depth : depth}\n              item={item}\n              renderItem={renderItem}\n            />\n          );\n        })}\n      </div>\n      {createPortal(\n        <DragOverlay\n          dropAnimation={dropAnimationConfig}\n          modifiers={[adjustToCursor]}\n          className=\"visibility-ordering-list\"\n        >\n          {activeId != null && activeItem ? (\n            <SortableTreeItem\n              id={activeId}\n              depth={activeItem.depth}\n              clone\n              childCount={getChildCount(items, activeId) + 1}\n              value={activeId.toString()}\n              renderItem={renderItem}\n              item={activeItem}\n            />\n          ) : null}\n        </DragOverlay>,\n        document.body\n      )}\n    </>\n  );\n}\n"],"mappings":";;;;;AAAA,OAAOA,KAAK,IAAIC,SAAS,EAAEC,MAAM,QAAQ,OAAO;AAChD,SAASC,YAAY,QAAQ,WAAW;AACxC,OAAOC,UAAU,MAAM,YAAY;AACnC,SACEC,WAAW,EAGXC,oBAAoB,EACpBC,aAAa,QACR,eAAe;AACtB,SAASC,GAAG,QAAQ,oBAAoB;AAAC,SAChCC,aAAa,EAAEC,aAAa;AAAA,SAE5BC,gBAAgB;AAAA,SAAAC,GAAA,IAAAC,IAAA,EAAAC,QAAA,IAAAC,SAAA,EAAAC,IAAA,IAAAC,KAAA;AAEzB,IAAMC,mBAAkC,GAAG;EACzCC,SAASA,CAAAC,IAAA,EAAgB;IAAA,IAAf;MAAEC;IAAU,CAAC,GAAAD,IAAA;IACrB,OAAO,CACL;MAAEE,OAAO,EAAE,CAAC;MAAED,SAAS,EAAEb,GAAG,CAACe,SAAS,CAACC,QAAQ,CAACH,SAAS,CAACI,OAAO;IAAE,CAAC,EACpE;MACEH,OAAO,EAAE,CAAC;MACVD,SAAS,EAAEb,GAAG,CAACe,SAAS,CAACC,QAAQ,CAAAE,aAAA,CAAAA,aAAA,KAC5BL,SAAS,CAACM,KAAK;QAClBC,CAAC,EAAEP,SAAS,CAACM,KAAK,CAACC,CAAC,GAAG,CAAC;QACxBC,CAAC,EAAER,SAAS,CAACM,KAAK,CAACE,CAAC,GAAG;MAAC,EACzB;IACH,CAAC,CACF;EACH,CAAC;EACDC,MAAM,EAAE,UAAU;EAClBC,WAAWA,CAAAC,KAAA,EAAa;IAAA,IAAZ;MAAEC;IAAO,CAAC,GAAAD,KAAA;IACpBC,MAAM,CAACC,IAAI,CAACC,OAAO,CAAC,CAAC;MAAEb,OAAO,EAAE;IAAE,CAAC,EAAE;MAAEA,OAAO,EAAE;IAAE,CAAC,CAAC,EAAE;MACpDc,QAAQ,EAAE9B,oBAAoB,CAAC8B,QAAQ;MACvCN,MAAM,EAAExB,oBAAoB,CAACwB;IAC/B,CAAC,CAAC;EACJ;AACF,CAAC;;AAED;AACA;AACA,IAAIO,OAAsB,GAAG,IAAI;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAACC,IAA6B,EAKnD;EACA,IACEF,OAAO,IAAI,IAAI,IACfE,IAAI,CAACC,cAAc,IACnBD,IAAI,CAACE,cAAc,YAAYC,YAAY,EAC3C;IACAL,OAAO,GACLM,IAAI,CAACC,KAAK,CACR,CAACL,IAAI,CAACE,cAAc,CAACI,OAAO,GAAGN,IAAI,CAACC,cAAc,CAACM,GAAG,IACpDP,IAAI,CAACC,cAAc,CAACO,MACxB,CAAC,GAAGR,IAAI,CAACC,cAAc,CAACO,MAAM;EAClC;EAEA,IAAI,CAACR,IAAI,CAACC,cAAc,EAAE;IACxBH,OAAO,GAAG,IAAI;EAChB;EAEA,OAAAX,aAAA,CAAAA,aAAA,KAAYa,IAAI,CAAClB,SAAS;IAAEQ,CAAC,EAAEU,IAAI,CAAClB,SAAS,CAACQ,CAAC,IAAIQ,OAAO,aAAPA,OAAO,cAAPA,OAAO,GAAI,CAAC;EAAC;AAClE;AAmBA,eAAe,SAASW,iBAAiBA,CAAAC,KAAA,EAQf;EAAA,IARmB;IAC3CC,KAAK;IACLC,UAAU;IACVC,gBAAgB,GAAG,EAAE;IACrBC,SAAS,GAAG,KAAK;IACjBC,QAAQ;IACRC,MAAM;IACNC;EACQ,CAAC,GAAAP,KAAA;EACT,IAAMQ,OAAO,GAAGlD,aAAa,CAAC,CAAC;EAC/B,IAAMmD,UAAU,GAAGxD,MAAM,CAACuD,OAAO,CAAC;EAElCxD,SAAS,CACP,SAAS0D,gBAAgBA,CAAA,EAAG;IAC1BD,UAAU,CAACE,OAAO,GAAGH,OAAO;EAC9B,CAAC,EACD,CAACA,OAAO,CACV,CAAC;;EAED;EACA;EACA;EACA;EACAxD,SAAS,CACP,SAAS4D,mBAAmBA,CAAA,EAAG;IAC7BH,UAAU,CAACE,OAAO,CAACE,0BAA0B,CAACZ,KAAK,CAACa,GAAG,CAACC,KAAA;MAAA,IAAC;QAAEC;MAAG,CAAC,GAAAD,KAAA;MAAA,OAAKC,EAAE;IAAA,EAAC,CAAC;EAC1E,CAAC,EACD,CAACf,KAAK,CACR,CAAC;EAED,IAAMgB,SAAS,GACbZ,QAAQ,IAAI,IAAI,IAAIC,MAAM,IAAI,IAAI,GAC9B9C,aAAa,CAACyC,KAAK,EAAEI,QAAQ,EAAEC,MAAM,EAAEC,UAAU,EAAEJ,gBAAgB,CAAC,GACpE,IAAI;EACV,IAAMe,aAA4B,GAAGjE,MAAM,CAAC;IAC1CgD,KAAK;IACLkB,MAAM,EAAEZ;EACV,CAAC,CAAC;EAEF,IAAMa,UAAU,GACdf,QAAQ,IAAI,IAAI,GAAGJ,KAAK,CAACoB,IAAI,CAACC,KAAA;IAAA,IAAC;MAAEN;IAAG,CAAC,GAAAM,KAAA;IAAA,OAAKN,EAAE,KAAKX,QAAQ;EAAA,EAAC,GAAG,IAAI;EAEnErD,SAAS,CAAC,MAAM;IACdkE,aAAa,CAACP,OAAO,GAAG;MACtBV,KAAK;MACLkB,MAAM,EAAEZ;IACV,CAAC;EACH,CAAC,EAAE,CAACN,KAAK,EAAEM,UAAU,CAAC,CAAC;EAEvB,oBACEvC,KAAA,CAAAF,SAAA;IAAAyD,QAAA,gBACE3D,IAAA;MACE4D,SAAS,EAAErE,UAAU,CACnB,gBAAgB,EAChBkD,QAAQ,IAAI,IAAI,IAAI,eACtB,CAAE;MAAAkB,QAAA,EAEDtB,KAAK,CAACa,GAAG,CAACW,IAAI,IAAI;QACjB,IAAM;UAAET,EAAE;UAAEU;QAAM,CAAC,GAAGD,IAAI;QAC1B,oBACE7D,IAAA,CAACF,gBAAgB;UAEfsD,EAAE,EAAEA,EAAG;UACPW,KAAK,EAAEX,EAAG;UACVU,KAAK,EAAEV,EAAE,KAAKX,QAAQ,IAAIY,SAAS,GAAGA,SAAS,CAACS,KAAK,GAAGA,KAAM;UAC9DD,IAAI,EAAEA,IAAK;UACXvB,UAAU,EAAEA;QAAW,GALlBc,EAMN,CAAC;MAEN,CAAC;IAAC,CACC,CAAC,eACL9D,YAAY,cACXU,IAAA,CAACR,WAAW;MACVwE,aAAa,EAAE3D,mBAAoB;MACnC4D,SAAS,EAAE,CAACxC,cAAc,CAAE;MAC5BmC,SAAS,EAAC,0BAA0B;MAAAD,QAAA,EAEnClB,QAAQ,IAAI,IAAI,IAAIe,UAAU,gBAC7BxD,IAAA,CAACF,gBAAgB;QACfsD,EAAE,EAAEX,QAAS;QACbqB,KAAK,EAAEN,UAAU,CAACM,KAAM;QACxBI,KAAK;QACLC,UAAU,EAAEtE,aAAa,CAACwC,KAAK,EAAEI,QAAQ,CAAC,GAAG,CAAE;QAC/CsB,KAAK,EAAEtB,QAAQ,CAAC9B,QAAQ,CAAC,CAAE;QAC3B2B,UAAU,EAAEA,UAAW;QACvBuB,IAAI,EAAEL;MAAW,CAClB,CAAC,GACA;IAAI,CACG,CAAC,EACdY,QAAQ,CAACC,IACX,CAAC;EAAA,CACD,CAAC;AAEP","ignoreList":[]}