@deephaven/iris-grid 1.7.1 → 1.7.2-beta.3

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","modelIndex","findIndex","col","group","get","Error","concat","modelIndexes","childIndexes","flat","id","selected","has","children","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","i","child","countChildren","count","_ref6","getChildCount","removeChildrenOf","ids","excludeParentIds","filter","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 { isFlattenedTreeItem, type ReadonlyTreeItems } from './types';\nimport type { FlattenedItem, TreeItem } 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): 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        .map(childName =>\n          getTreeItem(\n            columns,\n            movedColumns,\n            columnHeaderGroupMap,\n            childName,\n            hiddenColumnSet,\n            selectedItems\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): 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    );\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.reduce<FlattenedItem<T>[]>(\n    (acc, item, index) => [\n      ...acc,\n      { ...item, parentId, depth, index },\n      ...flatten(item.children, item.id, depth + 1),\n    ],\n    []\n  );\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,SAEhBC,mBAAmB;AAG5B;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,EACR;EAClB,IAAMC,UAAU,GAAGN,OAAO,CAACO,SAAS,CAACC,GAAG,IAAIA,GAAG,CAACL,IAAI,KAAKA,IAAI,CAAC;EAC9D,IAAIG,UAAU,KAAK,CAAC,CAAC,EAAE;IACrB,IAAMG,KAAK,GAAGP,oBAAoB,CAACQ,GAAG,CAACP,IAAI,CAAC;IAE5C,IAAIM,KAAK,IAAI,IAAI,EAAE;MACjB,MAAM,IAAIE,KAAK,sCAAAC,MAAA,CAAsCT,IAAI,CAAE,CAAC;IAC9D;IAEA,IAAMU,YAAY,GAAGJ,KAAK,CAACK,YAAY,CAACC,IAAI,CAAC,CAAC;IAE9C,OAAO;MACLC,EAAE,EAAEb,IAAI;MACRc,QAAQ,EAAEZ,aAAa,CAACa,GAAG,CAACf,IAAI,CAAC;MACjCgB,QAAQ,EAAEV,KAAK,CAACU,QAAQ,CACrBC,GAAG,CAACC,SAAS,IACZtB,WAAW,CACTC,OAAO,EACPC,YAAY,EACZC,oBAAoB,EACpBmB,SAAS,EACTjB,eAAe,EACfC,aACF,CACF,CAAC,CACAiB,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;QACJtB,UAAU,EAAEO,YAAY;QACxBgB,YAAY,EAAEpB,KAAK,CAACsB,eAAe,CAAC9B,YAAY,CAAC;QACjDQ,KAAK;QACLuB,SAAS,EAAEnB,YAAY,CAACoB,IAAI,CAACC,KAAK,IAAI,CAAC9B,eAAe,CAACc,GAAG,CAACgB,KAAK,CAAC;MACnE;IACF,CAAC;EACH;EAEA,OAAO;IACLlB,EAAE,EAAEb,IAAI;IACRgB,QAAQ,EAAE,EAAE;IACZF,QAAQ,EAAEZ,aAAa,CAACa,GAAG,CAACf,IAAI,CAAC;IACjCyB,IAAI,EAAE;MACJtB,UAAU;MACVuB,YAAY,EAAErC,SAAS,CAAC2C,eAAe,CAAC7B,UAAU,EAAEL,YAAY,CAAC;MACjE+B,SAAS,EAAE,CAAC5B,eAAe,CAACc,GAAG,CAACZ,UAAU;IAC5C;EACF,CAAC;AACH;AAEA,OAAO,SAAS8B,YAAYA,CAC1BpC,OAA6B,EAC7BC,YAAsC,EACtCoC,kBAAgD,EAChDC,aAAoC,EACpCjC,aAAgC,EACZ;EACpB,IAAMkC,KAAyB,GAAG,EAAE;EACpC,IAAMC,gBAAgB,GAAG,IAAIC,GAAG,CAACpC,aAAa,CAAC;EAC/C,IAAMqC,QAAQ,GAAG,IAAIC,GAAG,CACtBN,kBAAkB,CAACjB,GAAG,CAACX,KAAK,IAAI,CAACA,KAAK,CAACN,IAAI,EAAEM,KAAK,CAAC,CACrD,CAAC;EACD,IAAML,eAAe,GAAG,IAAIqC,GAAG,CAACH,aAAa,CAAC;EAE9C,IAAIT,YAAY,GAAG,CAAC;EAAC,IAAAe,KAAA,YAAAA,MAAA,EACiB;IACpC,IAAMtC,UAAU,GAAGd,SAAS,CAACqD,aAAa,CAAChB,YAAY,EAAE5B,YAAY,CAAC;IACtE,IAAM6C,UAAU,GAAG9C,OAAO,CAACM,UAAU,CAAC,CAACH,IAAI;IAE3C,IAAIM,KAAK,GAAG4B,kBAAkB,CAACU,IAAI,CAACC,IAAA;MAAA,IAAC;QAAE7B;MAAS,CAAC,GAAA6B,IAAA;MAAA,OAC/C7B,QAAQ,CAAC8B,QAAQ,CAACH,UAAU,CAAC;IAAA,CAC/B,CAAC;IACD,OAAOrC,KAAK,KAAKyC,SAAS,IAAIzC,KAAK,CAAC0C,MAAM,KAAKD,SAAS,EAAE;MACxDzC,KAAK,GAAGiC,QAAQ,CAAChC,GAAG,CAACD,KAAK,CAAC0C,MAAM,CAAC;IACpC;IAEA,IAAMC,IAAI,GAAGrD,WAAW,CACtBC,OAAO,EACPC,YAAY,EACZyC,QAAQ,EACRjC,KAAK,GAAGA,KAAK,CAACN,IAAI,GAAG2C,UAAU,EAC/B1C,eAAe,EACfoC,gBACF,CAAC;IAEDD,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;EA3BD,OAAOA,YAAY,GAAG7B,OAAO,CAACsD,MAAM;IAAAV,KAAA;EAAA;EA6BpC,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,EAClB9D,gBAAwB,EAMxB;EACA,IAAM+D,aAAa,GAAGpB,KAAK,CAAChC,SAAS,CAACqD,KAAA;IAAA,IAAC;MAAE5C;IAAG,CAAC,GAAA4C,KAAA;IAAA,OAAK5C,EAAE,KAAKyC,MAAM;EAAA,EAAC;EAChE,IAAMI,eAAe,GAAGtB,KAAK,CAAChC,SAAS,CAACuD,KAAA;IAAA,IAAC;MAAE9C;IAAG,CAAC,GAAA8C,KAAA;IAAA,OAAK9C,EAAE,KAAKwC,QAAQ;EAAA,EAAC;EACpE,IAAMO,UAAU,GAAGxB,KAAK,CAACsB,eAAe,CAAC;EACzC,IAAMG,QAAQ,GAAGzE,SAAS,CAACgD,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,GAAGzE,YAAY,CAACgE,UAAU,EAAE9D,gBAAgB,CAAC;EAC5D,IAAMwE,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,CAACjD,EAAE;IACxB;IAEA,IAAM6D,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,OAAOnF,IAAI,CAACsF,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,CAACgD,MAAM,CACjB,CAACC,GAAG,EAAEpC,IAAI,EAAElB,KAAK,KAAK,CACpB,GAAGsD,GAAG,EAAAC,aAAA,CAAAA,aAAA,KACDrC,IAAI;IAAEsB,QAAQ;IAAEL,KAAK;IAAEnC;EAAK,IACjC,GAAGmD,OAAO,CAACjC,IAAI,CAACjC,QAAQ,EAAEiC,IAAI,CAACpC,EAAE,EAAEqD,KAAK,GAAG,CAAC,CAAC,CAC9C,EACD,EACF,CAAC;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASqB,WAAWA,CACzBnD,KAA2B,EACP;EACpB;EACA,IAAIA,KAAK,CAACoD,KAAK,CAAClG,mBAAmB,CAAC,EAAE;IACpC,OAAO,CAAC,GAAG8C,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,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGvD,KAAK,CAACe,MAAM,EAAEwC,CAAC,IAAI,CAAC,EAAE;IACxC,IAAM1C,IAAI,GAAGb,KAAK,CAACuD,CAAC,CAAC;IACrB,IAAM;MAAE9E,EAAE;MAAEG;IAAS,CAAC,GAAGiC,IAAI;IAE7B,IAAIpC,EAAE,KAAK6E,MAAM,EAAE;MACjB,OAAOzC,IAAI;IACb;IAEA,IAAIjC,QAAQ,CAACmC,MAAM,EAAE;MACnB,IAAMyC,KAAK,GAAGH,YAAY,CAACzE,QAAQ,EAAE0E,MAAM,CAAC;MAE5C,IAAIE,KAAK,EAAE;QACT,OAAOA,KAAK;MACd;IACF;EACF;EAEA,OAAO7C,SAAS;AAClB;AAEA,SAAS8C,aAAaA,CAACzD,KAAiB,EAAqB;EAAA,IAAnB0D,KAAK,GAAAX,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,CAAC;EACjD,OAAO/C,KAAK,CAACgD,MAAM,CAAC,CAACC,GAAG,EAAAU,KAAA,KAAmB;IAAA,IAAjB;MAAE/E;IAAS,CAAC,GAAA+E,KAAA;IACpC,IAAI/E,QAAQ,CAACmC,MAAM,EAAE;MACnB,OAAO0C,aAAa,CAAC7E,QAAQ,EAAEqE,GAAG,GAAG,CAAC,CAAC;IACzC;IAEA,OAAOA,GAAG,GAAG,CAAC;EAChB,CAAC,EAAES,KAAK,CAAC;AACX;AAEA,OAAO,SAASE,aAAaA,CAAC5D,KAAwB,EAAEvB,EAAU,EAAU;EAC1E,IAAMoC,IAAI,GAAGwC,YAAY,CAACrD,KAAK,EAAEvB,EAAE,CAAC;EAEpC,OAAOoC,IAAI,GAAG4C,aAAa,CAAC5C,IAAI,CAACjC,QAAQ,CAAC,GAAG,CAAC;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASiF,gBAAgBA,CAC9B7D,KAAyB,EACzB8D,GAAa,EACO;EACpB,IAAMC,gBAAgB,GAAG,IAAI7D,GAAG,CAAC4D,GAAG,CAAC;EAErC,OAAO9D,KAAK,CAACgE,MAAM,CAACnD,IAAI,IAAI;IAC1B,IAAIA,IAAI,CAACsB,QAAQ,IAAI,IAAI,IAAI4B,gBAAgB,CAACpF,GAAG,CAACkC,IAAI,CAACsB,QAAQ,CAAC,EAAE;MAChE,IAAItB,IAAI,CAACjC,QAAQ,CAACmC,MAAM,EAAE;QACxBgD,gBAAgB,CAACE,GAAG,CAACpD,IAAI,CAACpC,EAAE,CAAC;MAC/B;MACA,OAAO,KAAK;IACd;IAEA,OAAO,IAAI;EACb,CAAC,CAAC;AACJ"}
+{"version":3,"file":"utilities.js","names":["arrayMove","GridUtils","isFlattenedTreeItem","getDragDepth","offset","indentationWidth","Math","round","getTreeItem","columns","movedColumns","columnHeaderGroupMap","name","hiddenColumnSet","selectedItems","modelIndex","findIndex","col","group","get","Error","concat","modelIndexes","childIndexes","flat","id","selected","has","children","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","i","child","countChildren","count","_ref6","getChildCount","removeChildrenOf","ids","excludeParentIds","filter","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): 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        .map(childName =>\n          getTreeItem(\n            columns,\n            movedColumns,\n            columnHeaderGroupMap,\n            childName,\n            hiddenColumnSet,\n            selectedItems\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): 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    );\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.reduce<FlattenedItem<T>[]>(\n    (acc, item, index) => [\n      ...acc,\n      { ...item, parentId, depth, index },\n      ...flatten(item.children, item.id, depth + 1),\n    ],\n    []\n  );\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,EACR;EAClB,IAAMC,UAAU,GAAGN,OAAO,CAACO,SAAS,CAACC,GAAG,IAAIA,GAAG,CAACL,IAAI,KAAKA,IAAI,CAAC;EAC9D,IAAIG,UAAU,KAAK,CAAC,CAAC,EAAE;IACrB,IAAMG,KAAK,GAAGP,oBAAoB,CAACQ,GAAG,CAACP,IAAI,CAAC;IAE5C,IAAIM,KAAK,IAAI,IAAI,EAAE;MACjB,MAAM,IAAIE,KAAK,sCAAAC,MAAA,CAAsCT,IAAI,CAAE,CAAC;IAC9D;IAEA,IAAMU,YAAY,GAAGJ,KAAK,CAACK,YAAY,CAACC,IAAI,CAAC,CAAC;IAE9C,OAAO;MACLC,EAAE,EAAEb,IAAI;MACRc,QAAQ,EAAEZ,aAAa,CAACa,GAAG,CAACf,IAAI,CAAC;MACjCgB,QAAQ,EAAEV,KAAK,CAACU,QAAQ,CACrBC,GAAG,CAACC,SAAS,IACZtB,WAAW,CACTC,OAAO,EACPC,YAAY,EACZC,oBAAoB,EACpBmB,SAAS,EACTjB,eAAe,EACfC,aACF,CACF,CAAC,CACAiB,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;QACJtB,UAAU,EAAEO,YAAY;QACxBgB,YAAY,EAAEpB,KAAK,CAACsB,eAAe,CAAC9B,YAAY,CAAC;QACjDQ,KAAK;QACLuB,SAAS,EAAEnB,YAAY,CAACoB,IAAI,CAACC,KAAK,IAAI,CAAC9B,eAAe,CAACc,GAAG,CAACgB,KAAK,CAAC;MACnE;IACF,CAAC;EACH;EAEA,OAAO;IACLlB,EAAE,EAAEb,IAAI;IACRgB,QAAQ,EAAE,EAAE;IACZF,QAAQ,EAAEZ,aAAa,CAACa,GAAG,CAACf,IAAI,CAAC;IACjCyB,IAAI,EAAE;MACJtB,UAAU;MACVuB,YAAY,EAAErC,SAAS,CAAC2C,eAAe,CAAC7B,UAAU,EAAEL,YAAY,CAAC;MACjE+B,SAAS,EAAE,CAAC5B,eAAe,CAACc,GAAG,CAACZ,UAAU;IAC5C;EACF,CAAC;AACH;AAEA,OAAO,SAAS8B,YAAYA,CAC1BpC,OAA6B,EAC7BC,YAAsC,EACtCoC,kBAAgD,EAChDC,aAAoC,EACpCjC,aAAgC,EACZ;EACpB,IAAMkC,KAAyB,GAAG,EAAE;EACpC,IAAMC,gBAAgB,GAAG,IAAIC,GAAG,CAACpC,aAAa,CAAC;EAC/C,IAAMqC,QAAQ,GAAG,IAAIC,GAAG,CACtBN,kBAAkB,CAACjB,GAAG,CAACX,KAAK,IAAI,CAACA,KAAK,CAACN,IAAI,EAAEM,KAAK,CAAC,CACrD,CAAC;EACD,IAAML,eAAe,GAAG,IAAIqC,GAAG,CAACH,aAAa,CAAC;EAE9C,IAAIT,YAAY,GAAG,CAAC;EAAC,IAAAe,KAAA,YAAAA,MAAA,EACiB;IACpC,IAAMtC,UAAU,GAAGd,SAAS,CAACqD,aAAa,CAAChB,YAAY,EAAE5B,YAAY,CAAC;IACtE,IAAM6C,UAAU,GAAG9C,OAAO,CAACM,UAAU,CAAC,CAACH,IAAI;IAE3C,IAAIM,KAAK,GAAG4B,kBAAkB,CAACU,IAAI,CAACC,IAAA;MAAA,IAAC;QAAE7B;MAAS,CAAC,GAAA6B,IAAA;MAAA,OAC/C7B,QAAQ,CAAC8B,QAAQ,CAACH,UAAU,CAAC;IAAA,CAC/B,CAAC;IACD,OAAOrC,KAAK,KAAKyC,SAAS,IAAIzC,KAAK,CAAC0C,MAAM,KAAKD,SAAS,EAAE;MACxDzC,KAAK,GAAGiC,QAAQ,CAAChC,GAAG,CAACD,KAAK,CAAC0C,MAAM,CAAC;IACpC;IAEA,IAAMC,IAAI,GAAGrD,WAAW,CACtBC,OAAO,EACPC,YAAY,EACZyC,QAAQ,EACRjC,KAAK,GAAGA,KAAK,CAACN,IAAI,GAAG2C,UAAU,EAC/B1C,eAAe,EACfoC,gBACF,CAAC;IAEDD,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;EA3BD,OAAOA,YAAY,GAAG7B,OAAO,CAACsD,MAAM;IAAAV,KAAA;EAAA;EA6BpC,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,EAClB9D,gBAAwB,EAMxB;EACA,IAAM+D,aAAa,GAAGpB,KAAK,CAAChC,SAAS,CAACqD,KAAA;IAAA,IAAC;MAAE5C;IAAG,CAAC,GAAA4C,KAAA;IAAA,OAAK5C,EAAE,KAAKyC,MAAM;EAAA,EAAC;EAChE,IAAMI,eAAe,GAAGtB,KAAK,CAAChC,SAAS,CAACuD,KAAA;IAAA,IAAC;MAAE9C;IAAG,CAAC,GAAA8C,KAAA;IAAA,OAAK9C,EAAE,KAAKwC,QAAQ;EAAA,EAAC;EACpE,IAAMO,UAAU,GAAGxB,KAAK,CAACsB,eAAe,CAAC;EACzC,IAAMG,QAAQ,GAAGzE,SAAS,CAACgD,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,GAAGzE,YAAY,CAACgE,UAAU,EAAE9D,gBAAgB,CAAC;EAC5D,IAAMwE,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,CAACjD,EAAE;IACxB;IAEA,IAAM6D,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,OAAOnF,IAAI,CAACsF,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,CAACgD,MAAM,CACjB,CAACC,GAAG,EAAEpC,IAAI,EAAElB,KAAK,KAAK,CACpB,GAAGsD,GAAG,EAAAC,aAAA,CAAAA,aAAA,KACDrC,IAAI;IAAEsB,QAAQ;IAAEL,KAAK;IAAEnC;EAAK,IACjC,GAAGmD,OAAO,CAACjC,IAAI,CAACjC,QAAQ,EAAEiC,IAAI,CAACpC,EAAE,EAAEqD,KAAK,GAAG,CAAC,CAAC,CAC9C,EACD,EACF,CAAC;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASqB,WAAWA,CACzBnD,KAA2B,EACP;EACpB;EACA,IAAIA,KAAK,CAACoD,KAAK,CAAClG,mBAAmB,CAAC,EAAE;IACpC,OAAO,CAAC,GAAG8C,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,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGvD,KAAK,CAACe,MAAM,EAAEwC,CAAC,IAAI,CAAC,EAAE;IACxC,IAAM1C,IAAI,GAAGb,KAAK,CAACuD,CAAC,CAAC;IACrB,IAAM;MAAE9E,EAAE;MAAEG;IAAS,CAAC,GAAGiC,IAAI;IAE7B,IAAIpC,EAAE,KAAK6E,MAAM,EAAE;MACjB,OAAOzC,IAAI;IACb;IAEA,IAAIjC,QAAQ,CAACmC,MAAM,EAAE;MACnB,IAAMyC,KAAK,GAAGH,YAAY,CAACzE,QAAQ,EAAE0E,MAAM,CAAC;MAE5C,IAAIE,KAAK,EAAE;QACT,OAAOA,KAAK;MACd;IACF;EACF;EAEA,OAAO7C,SAAS;AAClB;AAEA,SAAS8C,aAAaA,CAACzD,KAAiB,EAAqB;EAAA,IAAnB0D,KAAK,GAAAX,SAAA,CAAAhC,MAAA,QAAAgC,SAAA,QAAApC,SAAA,GAAAoC,SAAA,MAAG,CAAC;EACjD,OAAO/C,KAAK,CAACgD,MAAM,CAAC,CAACC,GAAG,EAAAU,KAAA,KAAmB;IAAA,IAAjB;MAAE/E;IAAS,CAAC,GAAA+E,KAAA;IACpC,IAAI/E,QAAQ,CAACmC,MAAM,EAAE;MACnB,OAAO0C,aAAa,CAAC7E,QAAQ,EAAEqE,GAAG,GAAG,CAAC,CAAC;IACzC;IAEA,OAAOA,GAAG,GAAG,CAAC;EAChB,CAAC,EAAES,KAAK,CAAC;AACX;AAEA,OAAO,SAASE,aAAaA,CAAC5D,KAAwB,EAAEvB,EAAU,EAAU;EAC1E,IAAMoC,IAAI,GAAGwC,YAAY,CAACrD,KAAK,EAAEvB,EAAE,CAAC;EAEpC,OAAOoC,IAAI,GAAG4C,aAAa,CAAC5C,IAAI,CAACjC,QAAQ,CAAC,GAAG,CAAC;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASiF,gBAAgBA,CAC9B7D,KAAyB,EACzB8D,GAAa,EACO;EACpB,IAAMC,gBAAgB,GAAG,IAAI7D,GAAG,CAAC4D,GAAG,CAAC;EAErC,OAAO9D,KAAK,CAACgE,MAAM,CAACnD,IAAI,IAAI;IAC1B,IAAIA,IAAI,CAACsB,QAAQ,IAAI,IAAI,IAAI4B,gBAAgB,CAACpF,GAAG,CAACkC,IAAI,CAACsB,QAAQ,CAAC,EAAE;MAChE,IAAItB,IAAI,CAACjC,QAAQ,CAACmC,MAAM,EAAE;QACxBgD,gBAAgB,CAACE,GAAG,CAACpD,IAAI,CAACpC,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.7.1",
+  "version": "1.7.2-beta.3+b369a51e",
   "description": "Deephaven Iris Grid",
   "author": "Deephaven Data Labs LLC",
   "license": "Apache-2.0",
@@ -31,18 +31,18 @@
     "build:sass": "sass --embed-sources --load-path=../../node_modules ./src:./dist"
   },
   "dependencies": {
-    "@deephaven/components": "^1.7.1",
-    "@deephaven/console": "^1.7.1",
-    "@deephaven/filters": "^1.1.0",
-    "@deephaven/grid": "^1.7.1",
-    "@deephaven/icons": "^1.2.0",
-    "@deephaven/jsapi-components": "^1.7.1",
+    "@deephaven/components": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/console": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/filters": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/grid": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/icons": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/jsapi-components": "^1.7.2-beta.3+b369a51e",
     "@deephaven/jsapi-types": "^1.0.0-dev0.39.4",
-    "@deephaven/jsapi-utils": "^1.7.1",
-    "@deephaven/log": "^1.5.3",
-    "@deephaven/react-hooks": "^1.7.1",
-    "@deephaven/storage": "^1.5.3",
-    "@deephaven/utils": "^1.7.1",
+    "@deephaven/jsapi-utils": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/log": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/react-hooks": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/storage": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/utils": "^1.7.2-beta.3+b369a51e",
     "@dnd-kit/core": "^6.1.0",
     "@dnd-kit/sortable": "^7.0.2",
     "@dnd-kit/utilities": "^3.2.2",
@@ -56,8 +56,7 @@
     "memoizee": "^0.4.15",
     "monaco-editor": "^0.43.0",
     "nanoid": "^5.0.7",
-    "prop-types": "^15.7.2",
-    "react-beautiful-dnd": "^13.1.0",
+    "react-beautiful-dnd": "^13.1.1",
     "react-transition-group": "^4.4.2"
   },
   "peerDependencies": {
@@ -65,9 +64,9 @@
     "react-dom": ">=16.8.0"
   },
   "devDependencies": {
-    "@deephaven/jsapi-shim": "^1.1.0",
-    "@deephaven/mocks": "^1.1.0",
-    "@deephaven/test-utils": "^1.1.0",
+    "@deephaven/jsapi-shim": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/mocks": "^1.7.2-beta.3+b369a51e",
+    "@deephaven/test-utils": "^1.7.2-beta.3+b369a51e",
     "deep-equal": "2.2.3"
   },
   "files": [
@@ -80,5 +79,5 @@
   "publishConfig": {
     "access": "public"
   },
-  "gitHead": "ebca722ed76f97d280a9302e79f21087f8d79965"
+  "gitHead": "b369a51ee94d212641a14c6ce1f19fcc85168339"
 }