@deephaven/iris-grid 0.42.1-beta.2 → 0.43.0

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

@@ -1 +0,0 @@
-{"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","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","getModelIndex","columnName","find","includes","undefined","parent","item","push","length","getProjection","activeId","overId","dragOffset","overItemIndex","activeItemIndex","activeItem","newItems","previousItem","nextItem","dragDepth","projectedDepth","depth","maxDepth","getMaxDepth","minDepth","getMinDepth","parentId","getParentId","newParent","slice","reverse","max","flatten","reduce","acc","flattenTree","every","findItemDeep","itemId","i","child","countChildren","count","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 { Column } from '@deephaven/jsapi-types';\nimport { GridUtils, ModelIndex, MoveOperation } from '@deephaven/grid';\nimport type ColumnHeaderGroup from '../../../ColumnHeaderGroup';\nimport { isFlattenedTreeItem, 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) {\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 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 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  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() {\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}) {\n  return Math.max(previousItem?.depth ?? 0, nextItem?.depth ?? 0);\n}\n\nfunction getMinDepth({ nextItem }: { nextItem: FlattenedItem | undefined }) {\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,SAASC,SAAS,QAAmC,iBAAiB;AAAC,SAE9DC,mBAAmB;AAG5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,YAAY,CAACC,MAAc,EAAEC,gBAAwB,EAAE;EAC9D,OAAOC,IAAI,CAACC,KAAK,CAACH,MAAM,GAAGC,gBAAgB,CAAC;AAC9C;AAaA,SAASG,WAAW,CAClBC,OAA0B,EAC1BC,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,6CAAsCR,IAAI,EAAG;IAC9D;IAEA,IAAMS,YAAY,GAAGH,KAAK,CAACI,YAAY,CAACC,IAAI,EAAE;IAE9C,OAAO;MACLC,EAAE,EAAEZ,IAAI;MACRa,QAAQ,EAAEX,aAAa,CAACY,GAAG,CAACd,IAAI,CAAC;MACjCe,QAAQ,EAAET,KAAK,CAACS,QAAQ,CACrBC,GAAG,CAACC,SAAS,IACZrB,WAAW,CACTC,OAAO,EACPC,YAAY,EACZC,oBAAoB,EACpBkB,SAAS,EACThB,eAAe,EACfC,aAAa,CACd,CACF,CACAgB,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;QACJrB,UAAU,EAAEM,YAAY;QACxBgB,YAAY,EAAEnB,KAAK,CAACqB,eAAe,CAAC7B,YAAY,CAAC;QACjDQ,KAAK;QACLsB,SAAS,EAAEnB,YAAY,CAACoB,IAAI,CAACC,KAAK,IAAI,CAAC7B,eAAe,CAACa,GAAG,CAACgB,KAAK,CAAC;MACnE;IACF,CAAC;EACH;EAEA,OAAO;IACLlB,EAAE,EAAEZ,IAAI;IACRe,QAAQ,EAAE,EAAE;IACZF,QAAQ,EAAEX,aAAa,CAACY,GAAG,CAACd,IAAI,CAAC;IACjCwB,IAAI,EAAE;MACJrB,UAAU;MACVsB,YAAY,EAAEpC,SAAS,CAAC0C,eAAe,CAAC5B,UAAU,EAAEL,YAAY,CAAC;MACjE8B,SAAS,EAAE,CAAC3B,eAAe,CAACa,GAAG,CAACX,UAAU;IAC5C;EACF,CAAC;AACH;AAEA,OAAO,SAAS6B,YAAY,CAC1BnC,OAA0B,EAC1BC,YAAsC,EACtCmC,kBAAgD,EAChDC,aAAoC,EACpChC,aAAgC,EACZ;EACpB,IAAMiC,KAAyB,GAAG,EAAE;EACpC,IAAMC,gBAAgB,GAAG,IAAIC,GAAG,CAACnC,aAAa,CAAC;EAC/C,IAAMoC,QAAQ,GAAG,IAAIC,GAAG,CACtBN,kBAAkB,CAACjB,GAAG,CAACV,KAAK,IAAI,CAACA,KAAK,CAACN,IAAI,EAAEM,KAAK,CAAC,CAAC,CACrD;EACD,IAAML,eAAe,GAAG,IAAIoC,GAAG,CAACH,aAAa,CAAC;EAE9C,IAAIT,YAAY,GAAG,CAAC;EAAC,6BACiB;IACpC,IAAMtB,UAAU,GAAGd,SAAS,CAACmD,aAAa,CAACf,YAAY,EAAE3B,YAAY,CAAC;IACtE,IAAM2C,UAAU,GAAG5C,OAAO,CAACM,UAAU,CAAC,CAACH,IAAI;IAE3C,IAAIM,KAAK,GAAG2B,kBAAkB,CAACS,IAAI,CAAC;MAAA,IAAC;QAAE3B;MAAS,CAAC;MAAA,OAC/CA,QAAQ,CAAC4B,QAAQ,CAACF,UAAU,CAAC;IAAA,EAC9B;IACD,OAAOnC,KAAK,KAAKsC,SAAS,IAAItC,KAAK,CAACuC,MAAM,KAAKD,SAAS,EAAE;MACxDtC,KAAK,GAAGgC,QAAQ,CAAC/B,GAAG,CAACD,KAAK,CAACuC,MAAM,CAAC;IACpC;IAEA,IAAMC,IAAI,GAAGlD,WAAW,CACtBC,OAAO,EACPC,YAAY,EACZwC,QAAQ,EACRhC,KAAK,GAAGA,KAAK,CAACN,IAAI,GAAGyC,UAAU,EAC/BxC,eAAe,EACfmC,gBAAgB,CACjB;IAEDD,KAAK,CAACY,IAAI,CAACD,IAAI,CAAC;IAEhB,IAAIxB,KAAK,CAACC,OAAO,CAACuB,IAAI,CAACtB,IAAI,CAACC,YAAY,CAAC,EAAE;MACzCA,YAAY,IAAIqB,IAAI,CAACtB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GAAGqB,IAAI,CAACtB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAC3E,CAAC,MAAM;MACLA,YAAY,IAAI,CAAC;IACnB;EACF,CAAC;EA3BD,OAAOA,YAAY,GAAG5B,OAAO,CAACmD,MAAM;IAAA;EAAA;EA6BpC,OAAOb,KAAK;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASc,aAAa,CAC3Bd,KAAsB,EACtBe,QAAgB,EAChBC,MAAc,EACdC,UAAkB,EAClB3D,gBAAwB,EACxB;EACA,IAAM4D,aAAa,GAAGlB,KAAK,CAAC/B,SAAS,CAAC;IAAA,IAAC;MAAEQ;IAAG,CAAC;IAAA,OAAKA,EAAE,KAAKuC,MAAM;EAAA,EAAC;EAChE,IAAMG,eAAe,GAAGnB,KAAK,CAAC/B,SAAS,CAAC;IAAA,IAAC;MAAEQ;IAAG,CAAC;IAAA,OAAKA,EAAE,KAAKsC,QAAQ;EAAA,EAAC;EACpE,IAAMK,UAAU,GAAGpB,KAAK,CAACmB,eAAe,CAAC;EACzC,IAAME,QAAQ,GAAGpE,SAAS,CAAC+C,KAAK,EAAEmB,eAAe,EAAED,aAAa,CAAC;EACjE,IAAMI,YAAuC,GAAGD,QAAQ,CAACH,aAAa,GAAG,CAAC,CAAC;EAC3E,IAAMK,QAAQ,GAAGF,QAAQ,CAACH,aAAa,GAAG,CAAC,CAAC;EAC5C,IAAMM,SAAS,GAAGpE,YAAY,CAAC6D,UAAU,EAAE3D,gBAAgB,CAAC;EAC5D,IAAMmE,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;EAAG,CAAC;EAE7D,SAASA,WAAW,GAAG;IAAA;IACrB,IAAIN,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,CAAC7C,EAAE;IACxB;IAEA,IAAMwD,SAAS,4BAAGZ,QAAQ,CACvBa,KAAK,CAAC,CAAC,EAAEhB,aAAa,CAAC,CACvBiB,OAAO,EAAE,CACT5B,IAAI,CAACI,IAAI,IAAIA,IAAI,CAACe,KAAK,KAAKA,KAAK,CAAC,0DAHnB,sBAGqBK,QAAQ;IAE/C,OAAOE,SAAS,aAATA,SAAS,cAATA,SAAS,GAAI,IAAI;EAC1B;AACF;AAEA,SAASL,WAAW,QAMjB;EAAA;EAAA,IANkB;IACnBN,YAAY;IACZC;EAIF,CAAC;EACC,OAAOhE,IAAI,CAAC6E,GAAG,wBAACd,YAAY,aAAZA,YAAY,uBAAZA,YAAY,CAAEI,KAAK,qEAAI,CAAC,qBAAEH,QAAQ,aAARA,QAAQ,uBAARA,QAAQ,CAAEG,KAAK,6DAAI,CAAC,CAAC;AACjE;AAEA,SAASI,WAAW,QAAwD;EAAA,IAAvD;IAAEP;EAAkD,CAAC;EACxE,IAAIA,QAAQ,EAAE;IACZ,OAAOA,QAAQ,CAACG,KAAK;EACvB;EAEA,OAAO,CAAC;AACV;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASW,OAAO,CACdrC,KAA2B,EAGP;EAAA,IAFpB+B,QAAuB,uEAAG,IAAI;EAAA,IAC9BL,KAAK,uEAAG,CAAC;EAET,OAAO1B,KAAK,CAACsC,MAAM,CACjB,CAACC,GAAG,EAAE5B,IAAI,EAAEhB,KAAK,KAAK,CACpB,GAAG4C,GAAG,kCACD5B,IAAI;IAAEoB,QAAQ;IAAEL,KAAK;IAAE/B;EAAK,IACjC,GAAG0C,OAAO,CAAC1B,IAAI,CAAC/B,QAAQ,EAAE+B,IAAI,CAAClC,EAAE,EAAEiD,KAAK,GAAG,CAAC,CAAC,CAC9C,EACD,EAAE,CACH;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASc,WAAW,CACzBxC,KAA2B,EACP;EACpB;EACA,IAAIA,KAAK,CAACyC,KAAK,CAACtF,mBAAmB,CAAC,EAAE;IACpC,OAAO,CAAC,GAAG6C,KAAK,CAAC;EACnB;EACA,OAAOqC,OAAO,CAACrC,KAAK,CAAC;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS0C,YAAY,CAC1B1C,KAAwB,EACxB2C,MAAc,EACQ;EACtB,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG5C,KAAK,CAACa,MAAM,EAAE+B,CAAC,IAAI,CAAC,EAAE;IACxC,IAAMjC,IAAI,GAAGX,KAAK,CAAC4C,CAAC,CAAC;IACrB,IAAM;MAAEnE,EAAE;MAAEG;IAAS,CAAC,GAAG+B,IAAI;IAE7B,IAAIlC,EAAE,KAAKkE,MAAM,EAAE;MACjB,OAAOhC,IAAI;IACb;IAEA,IAAI/B,QAAQ,CAACiC,MAAM,EAAE;MACnB,IAAMgC,KAAK,GAAGH,YAAY,CAAC9D,QAAQ,EAAE+D,MAAM,CAAC;MAE5C,IAAIE,KAAK,EAAE;QACT,OAAOA,KAAK;MACd;IACF;EACF;EAEA,OAAOpC,SAAS;AAClB;AAEA,SAASqC,aAAa,CAAC9C,KAAiB,EAAqB;EAAA,IAAnB+C,KAAK,uEAAG,CAAC;EACjD,OAAO/C,KAAK,CAACsC,MAAM,CAAC,CAACC,GAAG,YAAmB;IAAA,IAAjB;MAAE3D;IAAS,CAAC;IACpC,IAAIA,QAAQ,CAACiC,MAAM,EAAE;MACnB,OAAOiC,aAAa,CAAClE,QAAQ,EAAE2D,GAAG,GAAG,CAAC,CAAC;IACzC;IAEA,OAAOA,GAAG,GAAG,CAAC;EAChB,CAAC,EAAEQ,KAAK,CAAC;AACX;AAEA,OAAO,SAASC,aAAa,CAAChD,KAAwB,EAAEvB,EAAU,EAAU;EAC1E,IAAMkC,IAAI,GAAG+B,YAAY,CAAC1C,KAAK,EAAEvB,EAAE,CAAC;EAEpC,OAAOkC,IAAI,GAAGmC,aAAa,CAACnC,IAAI,CAAC/B,QAAQ,CAAC,GAAG,CAAC;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASqE,gBAAgB,CAC9BjD,KAAyB,EACzBkD,GAAa,EACO;EACpB,IAAMC,gBAAgB,GAAG,IAAIjD,GAAG,CAACgD,GAAG,CAAC;EAErC,OAAOlD,KAAK,CAACoD,MAAM,CAACzC,IAAI,IAAI;IAC1B,IAAIA,IAAI,CAACoB,QAAQ,IAAI,IAAI,IAAIoB,gBAAgB,CAACxE,GAAG,CAACgC,IAAI,CAACoB,QAAQ,CAAC,EAAE;MAChE,IAAIpB,IAAI,CAAC/B,QAAQ,CAACiC,MAAM,EAAE;QACxBsC,gBAAgB,CAACE,GAAG,CAAC1C,IAAI,CAAClC,EAAE,CAAC;MAC/B;MACA,OAAO,KAAK;IACd;IAEA,OAAO,IAAI;EACb,CAAC,CAAC;AACJ"}