@itwin/presentation-hierarchies-react 2.0.0-alpha.62 → 2.0.0-alpha.64

package/lib/presentation-hierarchies-react/UseSelectionHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"UseSelectionHandler.js","names":["useCallback","useEffect","useRef","TreeRendererProps","TreeNode","SelectionMode","SelectionChangeType","UseSelectionHandlerProps","Pick","selectionMode","UseSelectionHandlerResult","handleNodeSelect","props","nodeId","isSelected","shiftDown","ctrlDown","FlatTreeState","flatNodeList","Array","nodeIdToIndexMap","Map","useSelectionHandler","$","_c","rootNodes","selectNodes","previousSelectionRef","undefined","t0","Symbol","for","state","t1","t2","current","computeFlatNodeList","t3","firstId","secondId","getIndex","get","firstIndex","secondIndex","startingIndex","Math","min","endIndex","max","slice","getNodeRange","t4","t5","nodeId_0","selection","getSelectionAction","type","nodes","select","length","SelectionAction","getExtendedSelectionAction","flattenNodeRecursively","forEach","node","set","id","push","isExpanded","children"],"sources":["../../src/presentation-hierarchies-react/UseSelectionHandler.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useEffect, useRef } from \"react\";\n\nimport type { TreeRendererProps } from \"./Renderers.js\";\nimport type { TreeNode } from \"./TreeNode.js\";\n\n/**\n * A union of different supported selection modes in a tree component:\n * - `none` - no selection is allowed,\n * - `single` - only one node can be selected at a time,\n * - `extended` - multiple nodes can be selected using shift and ctrl keys,\n * - `multiple` - multiple nodes can be selected without using shift or ctrl keys.\n *\n * @public\n */\nexport type SelectionMode = \"none\" | \"single\" | \"extended\" | \"multiple\";\n\n/**\n * Type of selection change.\n * - `add` - a node was added to the selection,\n * - `replace` - a selected node was replaced with a different one,\n * - `remove` - a node was removed from the selection.\n *\n * @public\n */\nexport type SelectionChangeType = \"add\" | \"replace\" | \"remove\";\n\n/**\n * Props for `useSelectionHandler` hook.\n * @alpha\n */\ntype UseSelectionHandlerProps = Pick<TreeRendererProps, \"selectNodes\" | \"rootNodes\"> & {\n  /**\n   * Selection mode that the component is working in.\n   */\n  selectionMode: SelectionMode;\n};\n\n/**\n * Result of `useSelectionHandler` hook.\n * @internal\n */\ninterface UseSelectionHandlerResult {\n  /** Updates nodes selection based on current node state and modifier keys used. */\n  handleNodeSelect: (props: { nodeId: string; isSelected: boolean; shiftDown: boolean; ctrlDown: boolean }) => void;\n}\n\ninterface FlatTreeState {\n  flatNodeList: Array<string>;\n  nodeIdToIndexMap: Map<string, number>;\n}\n\n/**\n * A react hook that helps implement different selection modes in a tree component created using `useTree` hook.\n * @internal\n */\nexport function useSelectionHandler(props: UseSelectionHandlerProps): UseSelectionHandlerResult {\n  const { rootNodes, selectionMode, selectNodes } = props;\n  const previousSelectionRef = useRef<string | undefined>(undefined);\n  const state = useRef<FlatTreeState>({ flatNodeList: [], nodeIdToIndexMap: new Map() });\n\n  useEffect(() => {\n    state.current = computeFlatNodeList(rootNodes);\n  }, [rootNodes]);\n\n  const getNodeRange = (firstId?: string, secondId?: string) => {\n    const getIndex = (nodeId?: string) => {\n      return nodeId ? state.current.nodeIdToIndexMap.get(nodeId) : 0;\n    };\n    const firstIndex = getIndex(firstId);\n    const secondIndex = getIndex(secondId);\n    if (firstIndex === undefined || secondIndex === undefined) {\n      return [];\n    }\n\n    const startingIndex = Math.min(firstIndex, secondIndex);\n    const endIndex = Math.max(firstIndex, secondIndex);\n    return state.current.flatNodeList.slice(startingIndex, endIndex + 1);\n  };\n\n  const handleNodeSelect = useCallback<UseSelectionHandlerResult[\"handleNodeSelect\"]>(\n    ({ nodeId, isSelected, shiftDown, ctrlDown }) => {\n      const selection = getSelectionAction(selectionMode, isSelected, shiftDown, ctrlDown);\n      if (selection.type === \"disabled\") {\n        return;\n      }\n\n      const nodes = selection.select === \"range\" ? getNodeRange(previousSelectionRef.current, nodeId) : [nodeId];\n      if (!nodes.length) {\n        return;\n      }\n\n      selection.select !== \"range\" && (previousSelectionRef.current = nodeId);\n      selectNodes(nodes, selection.type);\n    },\n    [selectionMode, selectNodes],\n  );\n\n  return { handleNodeSelect };\n}\n\ninterface SelectionAction {\n  select: \"node\" | \"range\";\n  type: SelectionChangeType | \"disabled\";\n}\n\nfunction getSelectionAction(\n  selectionMode: SelectionMode,\n  isSelected: boolean,\n  shiftDown: boolean,\n  ctrlDown: boolean,\n): SelectionAction {\n  switch (selectionMode) {\n    case \"none\":\n      return { select: \"node\", type: \"disabled\" };\n    case \"single\":\n      return { select: \"node\", type: isSelected ? \"remove\" : \"replace\" };\n    case \"multiple\":\n      return { select: \"node\", type: isSelected ? \"remove\" : \"add\" };\n    case \"extended\":\n      return getExtendedSelectionAction(isSelected, shiftDown, ctrlDown);\n  }\n}\n\nfunction getExtendedSelectionAction(isSelected: boolean, shiftDown: boolean, ctrlDown: boolean): SelectionAction {\n  if (shiftDown) {\n    return { select: \"range\", type: \"replace\" };\n  }\n  if (ctrlDown) {\n    return { select: \"node\", type: isSelected ? \"remove\" : \"add\" };\n  }\n  return { select: \"node\", type: \"replace\" };\n}\n\nfunction computeFlatNodeList(rootNodes: Array<TreeNode>): FlatTreeState {\n  const flatNodeList: Array<string> = [];\n  const nodeIdToIndexMap: Map<string, number> = new Map();\n\n  const flattenNodeRecursively = (nodes: Array<TreeNode>) => {\n    nodes.forEach((node) => {\n      nodeIdToIndexMap.set(node.id, flatNodeList.length);\n      flatNodeList.push(node.id);\n      if (node.isExpanded && typeof node.children !== \"boolean\") {\n        flattenNodeRecursively(node.children);\n      }\n    });\n  };\n\n  flattenNodeRecursively(rootNodes);\n  return { flatNodeList, nodeIdToIndexMap };\n}\n"],"mappings":";;;;;;;AA4DA,SAAOsB,oBAAAV,OAAA;CAAA,MAAAW,IAAAC,EAAA,GAAA;CACL,MAAA,EAAAC,WAAAhB,eAAAiB,gBAAkDd;CAClD,MAAAe,uBAA6BzB,OAA2B0B,KAAAA,EAAU;CAAC,IAAAC;AAAA,KAAAN,EAAA,OAAAO,OAAAC,IAAA,4BAAA,EAAA;AAC/BF,OAAA;GAAAX,cAAgB,EAAE;GAAAE,kCAAoB,IAAIC,KAAI;GAAG;AAAAE,IAAA,KAAAM;OAAAA,MAAAN,EAAA;CAArF,MAAAS,QAAc9B,OAAsB2B,GAAkD;CAAC,IAAAI;CAAA,IAAAC;AAAA,KAAAX,EAAA,OAAAE,WAAA;AAE7EQ,aAAA;AACRD,SAAKG,UAAWC,oBAAoBX,UAAvB;;AACZS,OAAA,CAACT,UAAU;AAAAF,IAAA,KAAAE;AAAAF,IAAA,KAAAU;AAAAV,IAAA,KAAAW;QAAA;AAAAD,OAAAV,EAAA;AAAAW,OAAAX,EAAA;;AAFdtB,WAAUgC,IAEPC,GAAY;CAAA,IAAAG;AAAA,KAAAd,EAAA,OAAAO,OAAAC,IAAA,4BAAA,EAAA;AAEMM,QAAAC,SAAAC,aAAA;GACnB,MAAAC,YAAiB3B,WACRA,SAASmB,MAAKG,QAAQf,iBAAiBqB,IAAK5B,OAAW,GAAvD;GAET,MAAA6B,aAAmBF,SAASF,QAAQ;GACpC,MAAAK,cAAoBH,SAASD,SAAS;AACtC,OAAIG,eAAed,KAAAA,KAAae,gBAAgBf,KAAAA,EAAS,QAChD,EAAE;GAGX,MAAAgB,gBAAsBC,KAAIC,IAAKJ,YAAYC,YAAY;GACvD,MAAAI,WAAiBF,KAAIG,IAAKN,YAAYC,YAAY;AAAC,UAC5CX,MAAKG,QAAQjB,aAAa+B,MAAOL,eAAeG,WAAW,EAAE;;AACrExB,IAAA,KAAAc;OAAAA,MAAAd,EAAA;CAbD,MAAA2B,eAAqBb;CAanB,IAAAc;AAAA,KAAA5B,EAAA,OAAAG,eAAAH,EAAA,OAAAd,eAAA;AAGA0C,QAAAC,OAAA;GAAC,MAAA,EAAAvC,QAAAwC,UAAAvC,YAAAC,WAAAC,aAAAoC;GACC,MAAAE,YAAkBC,mBAAmB9C,eAAeK,YAAYC,WAAWC,SAAS;AACpF,OAAIsC,UAASE,SAAU,WAAU;GAIjC,MAAAC,QAAcH,UAASI,WAAY,UAAUR,aAAavB,qBAAoBQ,SAAUtB,SAAkB,GAA5F,CAAqFA,SAAO;AAC1G,OAAI,CAAC4C,MAAKE,OAAO;AAIjBL,aAASI,WAAY,YAAY/B,qBAAoBQ,UAAWtB;AAChEa,eAAY+B,OAAOH,UAASE,KAAM;;AACnCjC,IAAA,KAAAG;AAAAH,IAAA,KAAAd;AAAAc,IAAA,KAAA4B;OAAAA,MAAA5B,EAAA;CAdH,MAAAZ,mBAAyBwC;CAgBvB,IAAAC;AAAA,KAAA7B,EAAA,OAAAZ,kBAAA;AAEKyC,OAAA,EAAAzC,kBAAoB;AAAAY,IAAA,KAAAZ;AAAAY,IAAA,KAAA6B;OAAAA,MAAA7B,EAAA;AAAA,QAApB6B;;AAQT,SAASG,mBACP9C,eACAK,YACAC,WACAC,UACiB;AACjB,SAAQP,eAAR;EACE,KAAK,OACH,QAAO;GAAEiD,QAAQ;GAAQF,MAAM;GAAY;EAC7C,KAAK,SACH,QAAO;GAAEE,QAAQ;GAAQF,MAAM1C,aAAa,WAAW;GAAW;EACpE,KAAK,WACH,QAAO;GAAE4C,QAAQ;GAAQF,MAAM1C,aAAa,WAAW;GAAO;EAChE,KAAK,WACH,QAAO+C,2BAA2B/C,YAAYC,WAAWC,SAAS;;;AAIxE,SAAS6C,2BAA2B/C,YAAqBC,WAAoBC,UAAoC;AAC/G,KAAID,UACF,QAAO;EAAE2C,QAAQ;EAASF,MAAM;EAAW;AAE7C,KAAIxC,SACF,QAAO;EAAE0C,QAAQ;EAAQF,MAAM1C,aAAa,WAAW;EAAO;AAEhE,QAAO;EAAE4C,QAAQ;EAAQF,MAAM;EAAW;;AAG5C,SAASpB,oBAAoBX,WAA2C;CACtE,MAAMP,eAA8B,EAAE;CACtC,MAAME,mCAAwC,IAAIC,KAAK;CAEvD,MAAMyC,0BAA0BL,UAA2B;AACzDA,QAAMM,SAASC,SAAS;AACtB5C,oBAAiB6C,IAAID,KAAKE,IAAIhD,aAAayC,OAAO;AAClDzC,gBAAaiD,KAAKH,KAAKE,GAAG;AAC1B,OAAIF,KAAKI,cAAc,OAAOJ,KAAKK,aAAa,UAC9CP,wBAAuBE,KAAKK,SAAS;IAEvC;;AAGJP,wBAAuBrC,UAAU;AACjC,QAAO;EAAEP;EAAcE;EAAkB"}
+{"version":3,"file":"UseSelectionHandler.js","names":["useCallback","useEffect","useRef","TreeRendererProps","TreeNode","SelectionMode","SelectionChangeType","UseSelectionHandlerProps","Pick","selectionMode","UseSelectionHandlerResult","handleNodeSelect","props","nodeId","isSelected","shiftDown","ctrlDown","FlatTreeState","flatNodeList","Array","nodeIdToIndexMap","Map","useSelectionHandler","$","_c","rootNodes","selectNodes","previousSelectionRef","undefined","t0","Symbol","for","state","t1","t2","current","computeFlatNodeList","t3","firstId","secondId","getIndex","get","firstIndex","secondIndex","startingIndex","Math","min","endIndex","max","slice","getNodeRange","t4","t5","nodeId_0","selection","getSelectionAction","type","nodes","select","length","SelectionAction","getExtendedSelectionAction","flattenNodeRecursively","forEach","node","set","id","push","isExpanded","children"],"sources":["../../src/presentation-hierarchies-react/UseSelectionHandler.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useEffect, useRef } from \"react\";\n\nimport type { TreeRendererProps } from \"./Renderers.js\";\nimport type { TreeNode } from \"./TreeNode.js\";\n\n/**\n * A union of different supported selection modes in a tree component:\n * - `none` - no selection is allowed,\n * - `single` - only one node can be selected at a time,\n * - `extended` - multiple nodes can be selected using shift and ctrl keys,\n * - `multiple` - multiple nodes can be selected without using shift or ctrl keys.\n *\n * @public\n */\nexport type SelectionMode = \"none\" | \"single\" | \"extended\" | \"multiple\";\n\n/**\n * Type of selection change.\n * - `add` - a node was added to the selection,\n * - `replace` - a selected node was replaced with a different one,\n * - `remove` - a node was removed from the selection.\n *\n * @public\n */\nexport type SelectionChangeType = \"add\" | \"replace\" | \"remove\";\n\n/**\n * Props for `useSelectionHandler` hook.\n * @alpha\n */\ntype UseSelectionHandlerProps = Pick<TreeRendererProps, \"selectNodes\" | \"rootNodes\"> & {\n  /**\n   * Selection mode that the component is working in.\n   */\n  selectionMode: SelectionMode;\n};\n\n/**\n * Result of `useSelectionHandler` hook.\n * @internal\n */\ninterface UseSelectionHandlerResult {\n  /** Updates nodes selection based on current node state and modifier keys used. */\n  handleNodeSelect: (props: { nodeId: string; isSelected: boolean; shiftDown: boolean; ctrlDown: boolean }) => void;\n}\n\ninterface FlatTreeState {\n  flatNodeList: Array<string>;\n  nodeIdToIndexMap: Map<string, number>;\n}\n\n/**\n * A react hook that helps implement different selection modes in a tree component created using `useTree` hook.\n * @internal\n */\nexport function useSelectionHandler(props: UseSelectionHandlerProps): UseSelectionHandlerResult {\n  const { rootNodes, selectionMode, selectNodes } = props;\n  const previousSelectionRef = useRef<string | undefined>(undefined);\n  const state = useRef<FlatTreeState>({ flatNodeList: [], nodeIdToIndexMap: new Map() });\n\n  useEffect(() => {\n    state.current = computeFlatNodeList(rootNodes);\n  }, [rootNodes]);\n\n  const getNodeRange = (firstId?: string, secondId?: string) => {\n    const getIndex = (nodeId?: string) => {\n      return nodeId ? state.current.nodeIdToIndexMap.get(nodeId) : 0;\n    };\n    const firstIndex = getIndex(firstId);\n    const secondIndex = getIndex(secondId);\n    if (firstIndex === undefined || secondIndex === undefined) {\n      return [];\n    }\n\n    const startingIndex = Math.min(firstIndex, secondIndex);\n    const endIndex = Math.max(firstIndex, secondIndex);\n    return state.current.flatNodeList.slice(startingIndex, endIndex + 1);\n  };\n\n  const handleNodeSelect = useCallback<UseSelectionHandlerResult[\"handleNodeSelect\"]>(\n    ({ nodeId, isSelected, shiftDown, ctrlDown }) => {\n      const selection = getSelectionAction(selectionMode, isSelected, shiftDown, ctrlDown);\n      if (selection.type === \"disabled\") {\n        return;\n      }\n\n      const nodes = selection.select === \"range\" ? getNodeRange(previousSelectionRef.current, nodeId) : [nodeId];\n      if (!nodes.length) {\n        return;\n      }\n\n      selection.select !== \"range\" && (previousSelectionRef.current = nodeId);\n      selectNodes(nodes, selection.type);\n    },\n    [selectionMode, selectNodes],\n  );\n\n  return { handleNodeSelect };\n}\n\ninterface SelectionAction {\n  select: \"node\" | \"range\";\n  type: SelectionChangeType | \"disabled\";\n}\n\nfunction getSelectionAction(\n  selectionMode: SelectionMode,\n  isSelected: boolean,\n  shiftDown: boolean,\n  ctrlDown: boolean,\n): SelectionAction {\n  switch (selectionMode) {\n    case \"none\":\n      return { select: \"node\", type: \"disabled\" };\n    case \"single\":\n      return { select: \"node\", type: isSelected ? \"remove\" : \"replace\" };\n    case \"multiple\":\n      return { select: \"node\", type: isSelected ? \"remove\" : \"add\" };\n    case \"extended\":\n      return getExtendedSelectionAction(isSelected, shiftDown, ctrlDown);\n  }\n}\n\nfunction getExtendedSelectionAction(isSelected: boolean, shiftDown: boolean, ctrlDown: boolean): SelectionAction {\n  if (shiftDown) {\n    return { select: \"range\", type: \"replace\" };\n  }\n  if (ctrlDown) {\n    return { select: \"node\", type: isSelected ? \"remove\" : \"add\" };\n  }\n  return { select: \"node\", type: \"replace\" };\n}\n\nfunction computeFlatNodeList(rootNodes: Array<TreeNode>): FlatTreeState {\n  const flatNodeList: Array<string> = [];\n  const nodeIdToIndexMap: Map<string, number> = new Map();\n\n  const flattenNodeRecursively = (nodes: Array<TreeNode>) => {\n    nodes.forEach((node) => {\n      nodeIdToIndexMap.set(node.id, flatNodeList.length);\n      flatNodeList.push(node.id);\n      if (node.isExpanded && typeof node.children !== \"boolean\") {\n        flattenNodeRecursively(node.children);\n      }\n    });\n  };\n\n  flattenNodeRecursively(rootNodes);\n  return { flatNodeList, nodeIdToIndexMap };\n}\n"],"mappings":";;;;;;;AA4DA,SAAOsB,oBAAAV,OAAA;CAAA,MAAAW,IAAAC,EAAA,EAAA;CACL,MAAA,EAAAC,WAAAhB,eAAAiB,gBAAkDd;CAClD,MAAAe,uBAA6BzB,OAA2B0B,KAAAA,CAAS;CAAE,IAAAC;CAAA,IAAAN,EAAA,OAAAO,OAAAC,IAAA,2BAAA,GAAA;EAC/BF,KAAA;GAAAX,cAAgB,CAAA;GAAEE,kCAAoB,IAAIC,IAAI;EAAE;EAACE,EAAA,KAAAM;CAAA,OAAAA,KAAAN,EAAA;CAArF,MAAAS,QAAc9B,OAAsB2B,EAAiD;CAAE,IAAAI;CAAA,IAAAC;CAAA,IAAAX,EAAA,OAAAE,WAAA;EAE7EQ,WAAA;GACRD,MAAKG,UAAWC,oBAAoBX,SAAS;EAAhC;EACZS,KAAA,CAACT,SAAS;EAACF,EAAA,KAAAE;EAAAF,EAAA,KAAAU;EAAAV,EAAA,KAAAW;CAAA,OAAA;EAAAD,KAAAV,EAAA;EAAAW,KAAAX,EAAA;CAAA;CAFdtB,UAAUgC,IAEPC,EAAW;CAAC,IAAAG;CAAA,IAAAd,EAAA,OAAAO,OAAAC,IAAA,2BAAA,GAAA;EAEMM,MAAAC,SAAAC,aAAA;GACnB,MAAAC,YAAiB3B,WACRA,SAASmB,MAAKG,QAAQf,iBAAiBqB,IAAK5B,MAAU,IAAtD;GAET,MAAA6B,aAAmBF,SAASF,OAAO;GACnC,MAAAK,cAAoBH,SAASD,QAAQ;GACrC,IAAIG,eAAed,KAAAA,KAAae,gBAAgBf,KAAAA,GAAS,OAChD,CAAA;GAGT,MAAAgB,gBAAsBC,KAAIC,IAAKJ,YAAYC,WAAW;GACtD,MAAAI,WAAiBF,KAAIG,IAAKN,YAAYC,WAAW;GAAE,OAC5CX,MAAKG,QAAQjB,aAAa+B,MAAOL,eAAeG,WAAW,CAAC;EAAC;EACrExB,EAAA,KAAAc;CAAA,OAAAA,KAAAd,EAAA;CAbD,MAAA2B,eAAqBb;CAanB,IAAAc;CAAA,IAAA5B,EAAA,OAAAG,eAAAH,EAAA,OAAAd,eAAA;EAGA0C,MAAAC,OAAA;GAAC,MAAA,EAAAvC,QAAAwC,UAAAvC,YAAAC,WAAAC,aAAAoC;GACC,MAAAE,YAAkBC,mBAAmB9C,eAAeK,YAAYC,WAAWC,QAAQ;GACnF,IAAIsC,UAASE,SAAU,YAAU;GAIjC,MAAAC,QAAcH,UAASI,WAAY,UAAUR,aAAavB,qBAAoBQ,SAAUtB,QAAiB,IAA3F,CAAqFA,QAAM;GACzG,IAAI,CAAC4C,MAAKE,QAAO;GAIjBL,UAASI,WAAY,YAAY/B,qBAAoBQ,UAAWtB;GAChEa,YAAY+B,OAAOH,UAASE,IAAK;EAAC;EACnCjC,EAAA,KAAAG;EAAAH,EAAA,KAAAd;EAAAc,EAAA,KAAA4B;CAAA,OAAAA,KAAA5B,EAAA;CAdH,MAAAZ,mBAAyBwC;CAgBvB,IAAAC;CAAA,IAAA7B,EAAA,OAAAZ,kBAAA;EAEKyC,KAAA,EAAAzC,iBAAmB;EAACY,EAAA,KAAAZ;EAAAY,EAAA,KAAA6B;CAAA,OAAAA,KAAA7B,EAAA;CAAA,OAApB6B;AAAoB;AAQ7B,SAASG,mBACP9C,eACAK,YACAC,WACAC,UACiB;CACjB,QAAQP,eAAR;EACE,KAAK,QACH,OAAO;GAAEiD,QAAQ;GAAQF,MAAM;EAAW;EAC5C,KAAK,UACH,OAAO;GAAEE,QAAQ;GAAQF,MAAM1C,aAAa,WAAW;EAAU;EACnE,KAAK,YACH,OAAO;GAAE4C,QAAQ;GAAQF,MAAM1C,aAAa,WAAW;EAAM;EAC/D,KAAK,YACH,OAAO+C,2BAA2B/C,YAAYC,WAAWC,QAAQ;CACrE;AACF;AAEA,SAAS6C,2BAA2B/C,YAAqBC,WAAoBC,UAAoC;CAC/G,IAAID,WACF,OAAO;EAAE2C,QAAQ;EAASF,MAAM;CAAU;CAE5C,IAAIxC,UACF,OAAO;EAAE0C,QAAQ;EAAQF,MAAM1C,aAAa,WAAW;CAAM;CAE/D,OAAO;EAAE4C,QAAQ;EAAQF,MAAM;CAAU;AAC3C;AAEA,SAASpB,oBAAoBX,WAA2C;CACtE,MAAMP,eAA8B,CAAA;CACpC,MAAME,mCAAwC,IAAIC,IAAI;CAEtD,MAAMyC,0BAA0BL,UAA2B;EACzDA,MAAMM,SAASC,SAAS;GACtB5C,iBAAiB6C,IAAID,KAAKE,IAAIhD,aAAayC,MAAM;GACjDzC,aAAaiD,KAAKH,KAAKE,EAAE;GACzB,IAAIF,KAAKI,cAAc,OAAOJ,KAAKK,aAAa,WAC9CP,uBAAuBE,KAAKK,QAAQ;EAExC,CAAC;CACH;CAEAP,uBAAuBrC,SAAS;CAChC,OAAO;EAAEP;EAAcE;CAAiB;AAC1C"}

package/lib/presentation-hierarchies-react/UseTree.d.ts

@@ -3,7 +3,6 @@ import { RootErrorRendererProps, TreeRendererProps } from "./Renderers.js";
 import { UseUnifiedTreeSelectionProps } from "./internal/UseUnifiedSelection.js";
 import { GenericInstanceFilter, HierarchyNode, HierarchyProvider, HierarchySearchTree } from "@itwin/presentation-hierarchies";
 import { IPrimitiveValueFormatter } from "@itwin/presentation-shared";
-
 //#region src/presentation-hierarchies-react/UseTree.d.ts
 /**
  * A React hook that creates state for a tree component.
@@ -33,20 +32,13 @@ declare function useTree(props: UseTreeProps): UseTreeResult;
  * @see `UnifiedSelectionProvider`
  * @public
  */
-declare function useUnifiedSelectionTree({
-  sourceName,
-  selectionStorage,
-  createSelectableForGenericNode,
-  ...props
-}: UseTreeProps & UseUnifiedTreeSelectionProps): UseTreeResult;
+declare function useUnifiedSelectionTree({ sourceName, selectionStorage, createSelectableForGenericNode, ...props }: UseTreeProps & UseUnifiedTreeSelectionProps): UseTreeResult;
 /** @public */
 interface UseTreeProps {
   /** Provides the hierarchy provider for the tree. */
   getHierarchyProvider: () => HierarchyProvider;
   /** Provides paths to search nodes. */
-  getSearchPaths?: ({
-    abortSignal
-  }: {
+  getSearchPaths?: ({ abortSignal }: {
     abortSignal: AbortSignal;
   }) => Promise<HierarchySearchTree[] | undefined>;
   /**
@@ -99,7 +91,8 @@ type RendererProps = {
    */
   rootErrorRendererProps: RootErrorRendererProps;
 } | {
-  /** Is undefined when rootNodes were successfully loaded or are in initial loading process. */rootErrorRendererProps: undefined;
+  /** Is undefined when rootNodes were successfully loaded or are in initial loading process. */
+  rootErrorRendererProps: undefined;
   /**
    * An object containing information used to render tree.
    * Use with `TreeRenderer` or your custom implementation.

package/lib/presentation-hierarchies-react/UseTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UseTree.d.ts","names":[],"sources":["../../src/presentation-hierarchies-react/UseTree.ts"],"mappings":";;;;;;;;AAiCA;;;;;;;;;AAoBA;;iBApBgB,OAAA,CAAQ,KAAA,EAAO,YAAA,GAAe,aAAA;;;;;;;;;;;;;;;;iBAoB9B,uBAAA,CAAA;EACd,UAAA;EACA,gBAAA;EACA,8BAAA;EAAA,GACG;AAAA,GACF,YAAA,GAAe,4BAAA,GAA+B,aAAA;;UAehC,YAAA;EAf6C;EAiB5D,oBAAA,QAA4B,iBAAA;EAFb;EAIf,cAAA;IAAoB;EAAA;IAAiB,WAAA,EAAa,WAAA;EAAA,MAAkB,OAAA,CAAQ,mBAAA;EAAxD;;;;EAKpB,qBAAA,IAAyB,MAAA,sDAA4D,QAAA;EAa1D;EAX3B,wBAAA,IAA4B,KAAA;IAC1B,QAAA;IACA,MAAA,GAAS,qBAAA;IACT,KAAA;EAAA;EAVF;EAaA,oBAAA,IAAwB,KAAA;IAAS,QAAA;IAAmB,IAAA;IAA6B,KAAA;EAAA;EAbL;;;;EAkB5E,iBAAA,IAAqB,IAAA,EAAM,aAAA,KAAkB,SAAA;AAAA;;KAInC,aAAA;EAZR;;;;EAiBF,WAAA;EAdiF;;;EAkBjF,OAAA,GAAU,MAAA,aAAmB,QAAA;EAbR;;;EAiBrB,YAAA,GAAe,SAAA,EAAW,wBAAA;AAAA,IACxB,aAAA;;;;KAKC,aAAA;EALD;;;;;EAYE,sBAAA,EAAwB,sBAAA;AAAA;EAb5B,8FAiBI,sBAAA;EAjBW;;;;AACC;EAsBZ,iBAAA,GAAoB,iBAAA;AAAA"}
+{"version":3,"file":"UseTree.d.ts","names":[],"sources":["../../src/presentation-hierarchies-react/UseTree.ts"],"mappings":";;;;;;;;;;;;;;;;;;iBAiCgB,QAAQ,OAAO,eAAe;;;;;;;;;;;;;;;;iBAoB9B,0BACd,YACA,kBACA,mCACG,SACF,eAAe,+BAA+B;;UAehC;;EAEf,4BAA4B;;EAE5B,oBAAoB;IAAiB,aAAa;QAAkB,QAAQ;;;;;EAK5E,yBAAyB,4DAA4D;;EAErF,4BAA4B;IAC1B;IACA,SAAS;IACT;;;EAGF,wBAAwB;IAAS;IAAmB;IAA6B;;;;;;EAKjF,qBAAqB,MAAM,kBAAkB;;;KAInC;;;;;EAKV;;;;EAIA,UAAU,mBAAmB;;;;EAI7B,eAAe,WAAW;IACxB;;;;KAKC;;;;;;EAOC,wBAAwB;;;EAIxB;;;;;;EAMA,oBAAoB"}

package/lib/presentation-hierarchies-react/UseTree.js

@@ -134,12 +134,13 @@ function useTreeInternal({ getHierarchyProvider, getSearchPaths, onPerformanceMe
 	const onHierarchyLoadErrorRef = useLatest(onHierarchyLoadError);
 	const getTreeNodeErrorsRef = useLatest(getTreeNodeErrors);
 	const [actions] = useState(() => new TreeActions((model) => {
+		const rootNodes = model.parentChildMap.get(void 0) !== void 0 ? generateTreeStructure(void 0, model, getTreeNodeErrorsRef.current) : void 0;
 		setState({
 			model,
-			rootNodes: model.parentChildMap.get(void 0) !== void 0 ? generateTreeStructure(void 0, model, getTreeNodeErrorsRef.current) : void 0
+			rootNodes
 		});
 	}, (actionType, duration) => onPerformanceMeasuredRef.current?.(actionType, duration), (props) => onHierarchyLimitExceededRef.current?.(props), (props_0) => onHierarchyLoadErrorRef.current?.(props_0)));
-	const currentFormatter = useRef();
+	const currentFormatter = useRef(void 0);
 	const [hierarchyProvider, setHierarchyProvider] = useState();
 	useEffect(() => {
 		const provider = getHierarchyProvider();

package/lib/presentation-hierarchies-react/UseTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"UseTree.js","names":["useCallback","useEffect","useMemo","useRef","useState","HierarchyNode","TreeActions","TreeModel","useUnifiedTreeSelection","safeDispose","useLatest","GenericInstanceFilter","HierarchyProvider","HierarchySearchTree","IPrimitiveValueFormatter","TreeModelHierarchyNode","TreeModelRootNode","UseUnifiedTreeSelectionProps","RootErrorRendererProps","TreeRendererProps","ErrorInfo","TreeNode","SelectionChangeType","useTree","props","$","_c","t0","useTreeInternal","rest","getTreeModelNode","_","t1","useUnifiedSelectionTree","createSelectableForGenericNode","selectionStorage","sourceName","t2","selectionProps","rootErrorRendererProps","undefined","treeRendererProps","rootNodes","t3","t4","UseTreeProps","getHierarchyProvider","getSearchPaths","abortSignal","AbortSignal","Promise","onPerformanceMeasured","action","duration","onHierarchyLimitExceeded","parentId","filter","limit","onHierarchyLoadError","type","error","getTreeNodeErrors","node","UseTreeResult","isReloading","getNode","nodeId","setFormatter","formatter","RendererProps","TreeState","model","Array","state","setState","idToNode","Map","parentChildMap","rootNode","id","nodeData","onPerformanceMeasuredRef","onHierarchyLimitExceededRef","onHierarchyLoadErrorRef","getTreeNodeErrorsRef","actions","get","generateTreeStructure","current","actionType","currentFormatter","hierarchyProvider","setHierarchyProvider","provider","removeHierarchyChangedListener","hierarchyChanged","addListener","hierarchyChangeArgs","shouldDiscardState","searchChange","newSearch","reloadTree","reset","isSearching","setIsSearching","disposed","controller","AbortController","setHierarchySearch","paths","signal","abort","createTreeNode","expandNode","isExpanded","options","selectNodes","nodeIds","changeType","isNodeSelected","getHierarchyLevelDetails","hierarchyNode","isGroupingNode","getInstanceKeysIterator","getNodeInstanceKeys","parentNode","instanceFilter","hierarchyLevelSizeLimit","setInstanceFilter","sizeLimit","hierarchyLimit","setSizeLimit","value","setHierarchyLimit","renderProps","isLoading","parentNodeId","currentChildren","map","childId","modelNode","allErrors","children","label","isFilterable","supportsFiltering","isFiltered","errors"],"sources":["../../src/presentation-hierarchies-react/UseTree.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useEffect, useMemo, useRef, useState } from \"react\";\nimport { HierarchyNode } from \"@itwin/presentation-hierarchies\";\nimport { TreeActions } from \"./internal/TreeActions.js\";\nimport { TreeModel } from \"./internal/TreeModel.js\";\nimport { useUnifiedTreeSelection } from \"./internal/UseUnifiedSelection.js\";\nimport { safeDispose } from \"./internal/Utils.js\";\nimport { useLatest } from \"./Utils.js\";\n\nimport type { GenericInstanceFilter, HierarchyProvider, HierarchySearchTree } from \"@itwin/presentation-hierarchies\";\nimport type { IPrimitiveValueFormatter } from \"@itwin/presentation-shared\";\nimport type { TreeModelHierarchyNode, TreeModelRootNode } from \"./internal/TreeModel.js\";\nimport type { UseUnifiedTreeSelectionProps } from \"./internal/UseUnifiedSelection.js\";\nimport type { RootErrorRendererProps, TreeRendererProps } from \"./Renderers.js\";\nimport type { ErrorInfo, TreeNode } from \"./TreeNode.js\";\nimport type { SelectionChangeType } from \"./UseSelectionHandler.js\";\n\n/**\n * A React hook that creates state for a tree component.\n *\n * The hook uses `@itwin/presentation-hierarchies` package to load the hierarchy data and returns a\n * component-agnostic result which may be used to render the hierarchy using any UI framework.\n *\n * See `README.md` for an example\n *\n * @see `useUnifiedSelectionTree`\n * @see `useIModelTree`\n * @public\n */\nexport function useTree(props: UseTreeProps): UseTreeResult {\n  const { getTreeModelNode: _, ...rest } = useTreeInternal(props);\n  return rest;\n}\n\n/**\n * A React hook that creates state for a tree component, that is integrated with unified selection\n * through the given selection storage (previously the storage was provided through the, now\n * deprecated, `UnifiedSelectionProvider`).\n *\n * The hook uses `@itwin/presentation-hierarchies` package to load the hierarchy data and returns a\n * component-agnostic result which may be used to render the hierarchy using any UI framework.\n *\n * See `README.md` for an example\n *\n * @see `useTree`\n * @see `useIModelUnifiedSelectionTree`\n * @see `UnifiedSelectionProvider`\n * @public\n */\nexport function useUnifiedSelectionTree({\n  sourceName,\n  selectionStorage,\n  createSelectableForGenericNode,\n  ...props\n}: UseTreeProps & UseUnifiedTreeSelectionProps): UseTreeResult {\n  const { getTreeModelNode, ...rest } = useTreeInternal(props);\n  const selectionProps = useUnifiedTreeSelection({\n    sourceName,\n    selectionStorage,\n    getTreeModelNode,\n    createSelectableForGenericNode,\n  });\n  if (rest.rootErrorRendererProps === undefined && rest.treeRendererProps?.rootNodes) {\n    return { ...rest, treeRendererProps: { ...rest.treeRendererProps, ...selectionProps } };\n  }\n  return rest;\n}\n\n/** @public */\nexport interface UseTreeProps {\n  /** Provides the hierarchy provider for the tree. */\n  getHierarchyProvider: () => HierarchyProvider;\n  /** Provides paths to search nodes. */\n  getSearchPaths?: ({ abortSignal }: { abortSignal: AbortSignal }) => Promise<HierarchySearchTree[] | undefined>;\n  /**\n   * Callback that is called just after a certain action is finished.\n   * Can be used for performance tracking.\n   */\n  onPerformanceMeasured?: (action: \"initial-load\" | \"hierarchy-level-load\" | \"reload\", duration: number) => void;\n  /** Action to perform when hierarchy level contains more items that the specified limit. */\n  onHierarchyLimitExceeded?: (props: {\n    parentId?: string;\n    filter?: GenericInstanceFilter;\n    limit?: number | \"unbounded\";\n  }) => void;\n  /** Action to perform when an error occurs while loading hierarchy. */\n  onHierarchyLoadError?: (props: { parentId?: string; type: \"timeout\" | \"unknown\"; error: unknown }) => void;\n  /**\n   * Callback to set custom TreeNode errors.\n   * Errors returned from this callback are combined with internal errors when populating `TreeNode.errors`.\n   */\n  getTreeNodeErrors?: (node: HierarchyNode) => ErrorInfo[];\n}\n\n/** @public */\nexport type UseTreeResult = {\n  /**\n   * Specifies whether tree is reloading or not. It is set to `false` when initial tree load is in progress to check if\n   * or tree is reloading.\n   */\n  isReloading: boolean;\n  /**\n   * Get a tree node by id\n   */\n  getNode: (nodeId: string) => TreeNode | undefined;\n  /**\n   * Sets a formatter for the primitive values that are displayed in the hierarchy.\n   */\n  setFormatter: (formatter: IPrimitiveValueFormatter | undefined) => void;\n} & RendererProps;\n\n/**.\n * @alpha\n */\ntype RendererProps =\n  | {\n      /**\n       * An object containing information used to render root error handling UI.\n       * Use in combination with `RootErrorRenderer` or your custom implementation.\n       * Defined when root nodes fail to load.\n       */\n      rootErrorRendererProps: RootErrorRendererProps;\n    }\n  | {\n      /** Is undefined when rootNodes were successfully loaded or are in initial loading process. */\n      rootErrorRendererProps: undefined;\n      /**\n       * An object containing information used to render tree.\n       * Use with `TreeRenderer` or your custom implementation.\n       * Is undefined on initial loading process.\n       */\n      treeRendererProps?: TreeRendererProps;\n    };\n\ninterface TreeState {\n  model: TreeModel;\n  rootNodes: Array<TreeNode> | undefined;\n}\n\nfunction useTreeInternal({\n  getHierarchyProvider,\n  getSearchPaths,\n  onPerformanceMeasured,\n  onHierarchyLimitExceeded,\n  onHierarchyLoadError,\n  getTreeNodeErrors,\n}: UseTreeProps): UseTreeResult & {\n  getTreeModelNode: (nodeId: string) => TreeModelRootNode | TreeModelHierarchyNode | undefined;\n} {\n  const [state, setState] = useState<TreeState>({\n    model: { idToNode: new Map(), parentChildMap: new Map(), rootNode: { id: undefined, nodeData: undefined } },\n    rootNodes: undefined,\n  });\n  const onPerformanceMeasuredRef = useLatest(onPerformanceMeasured);\n  const onHierarchyLimitExceededRef = useLatest(onHierarchyLimitExceeded);\n  const onHierarchyLoadErrorRef = useLatest(onHierarchyLoadError);\n  const getTreeNodeErrorsRef = useLatest(getTreeNodeErrors);\n\n  const [actions] = useState<TreeActions>(\n    () =>\n      new TreeActions(\n        (model) => {\n          const rootNodes =\n            model.parentChildMap.get(undefined) !== undefined\n              ? generateTreeStructure(undefined, model, getTreeNodeErrorsRef.current)\n              : undefined;\n          setState({ model, rootNodes });\n        },\n        (actionType, duration) => onPerformanceMeasuredRef.current?.(actionType, duration),\n        (props) => onHierarchyLimitExceededRef.current?.(props),\n        (props) => onHierarchyLoadErrorRef.current?.(props),\n      ),\n  );\n  const currentFormatter = useRef<IPrimitiveValueFormatter>();\n\n  const [hierarchyProvider, setHierarchyProvider] = useState<HierarchyProvider | undefined>();\n  useEffect(() => {\n    const provider = getHierarchyProvider();\n    provider.setFormatter(currentFormatter.current);\n    const removeHierarchyChangedListener = provider.hierarchyChanged.addListener((hierarchyChangeArgs) => {\n      const shouldDiscardState = hierarchyChangeArgs.searchChange?.newSearch !== undefined;\n      actions.reloadTree({ state: shouldDiscardState ? \"discard\" : \"keep\" });\n    });\n    actions.setHierarchyProvider(provider);\n    setHierarchyProvider(provider);\n    return () => {\n      removeHierarchyChangedListener();\n      actions.reset();\n      safeDispose(provider);\n    };\n  }, [actions, getHierarchyProvider]);\n\n  const [isSearching, setIsSearching] = useState(false);\n  useEffect(() => {\n    let disposed = false as boolean;\n    const controller = new AbortController();\n    void (async () => {\n      if (!hierarchyProvider) {\n        return;\n      }\n\n      if (!getSearchPaths) {\n        hierarchyProvider.setHierarchySearch(undefined);\n        // reload tree in case hierarchy provider does not use hierarchy search to load initial nodes\n        actions.reloadTree({ state: \"keep\" });\n        setIsSearching(false);\n        return;\n      }\n\n      setIsSearching(true);\n      let paths: HierarchySearchTree[] | undefined;\n      try {\n        paths = await getSearchPaths({ abortSignal: controller.signal });\n      } catch {\n      } finally {\n        if (!disposed) {\n          hierarchyProvider.setHierarchySearch(paths ? { paths } : undefined);\n          setIsSearching(false);\n        }\n      }\n    })();\n    return () => {\n      controller.abort();\n      disposed = true;\n    };\n  }, [hierarchyProvider, getSearchPaths, actions]);\n\n  const getTreeModelNode = useCallback<(nodeId: string) => TreeModelRootNode | TreeModelHierarchyNode | undefined>(\n    (nodeId: string) => {\n      return actions.getNode(nodeId);\n    },\n    [actions],\n  );\n\n  const getNode = useCallback(\n    (nodeId: string): TreeNode | undefined => {\n      const node = actions.getNode(nodeId);\n      if (!node || node.id === undefined) {\n        return undefined;\n      }\n      return createTreeNode(node, state.model, getTreeNodeErrorsRef.current);\n    },\n    [actions, getTreeNodeErrorsRef, state.model],\n  );\n\n  const expandNode = useCallback<TreeRendererProps[\"expandNode\"]>(\n    (nodeId: string, isExpanded: boolean) => {\n      actions.expandNode(nodeId, isExpanded);\n    },\n    [actions],\n  );\n\n  const reloadTree = useCallback<TreeRendererProps[\"reloadTree\"]>(\n    (options) => {\n      actions.reloadTree(options);\n    },\n    [actions],\n  );\n\n  const selectNodes = useCallback<TreeRendererProps[\"selectNodes\"]>(\n    (nodeIds: Array<string>, changeType: SelectionChangeType) => {\n      actions.selectNodes(nodeIds, changeType);\n    },\n    [actions],\n  );\n\n  const isNodeSelected = useCallback<TreeRendererProps[\"isNodeSelected\"]>(\n    (nodeId: string) => TreeModel.isNodeSelected(state.model, nodeId),\n    [state],\n  );\n\n  const setFormatter = useCallback<UseTreeResult[\"setFormatter\"]>(\n    (formatter: IPrimitiveValueFormatter | undefined) => {\n      currentFormatter.current = formatter;\n      if (!hierarchyProvider) {\n        return;\n      }\n\n      hierarchyProvider.setFormatter(formatter);\n    },\n    [hierarchyProvider],\n  );\n\n  const getHierarchyLevelDetails = useCallback<TreeRendererProps[\"getHierarchyLevelDetails\"]>(\n    (nodeId) => {\n      const node = actions.getNode(nodeId);\n      if (!hierarchyProvider || !node) {\n        return undefined;\n      }\n      const hierarchyNode = node.nodeData;\n      if (hierarchyNode && HierarchyNode.isGroupingNode(hierarchyNode)) {\n        return undefined;\n      }\n\n      return {\n        hierarchyNode,\n        getInstanceKeysIterator: (props) =>\n          hierarchyProvider.getNodeInstanceKeys({\n            parentNode: hierarchyNode,\n            instanceFilter: props?.instanceFilter,\n            hierarchyLevelSizeLimit: props?.hierarchyLevelSizeLimit,\n          }),\n        instanceFilter: node.instanceFilter,\n        setInstanceFilter: (filter) => actions.setInstanceFilter(nodeId, filter),\n        sizeLimit: node.hierarchyLimit,\n        setSizeLimit: (value) => actions.setHierarchyLimit(nodeId, value),\n      };\n    },\n    [actions, hierarchyProvider],\n  );\n\n  const renderProps: RendererProps = useMemo(() => {\n    if (state.model.rootNode.error) {\n      return { rootErrorRendererProps: { error: state.model.rootNode.error, reloadTree, getHierarchyLevelDetails } };\n    }\n    return {\n      rootErrorRendererProps: undefined,\n      treeRendererProps: state.rootNodes\n        ? { rootNodes: state.rootNodes, expandNode, selectNodes, isNodeSelected, reloadTree, getHierarchyLevelDetails }\n        : undefined,\n    };\n  }, [\n    expandNode,\n    getHierarchyLevelDetails,\n    isNodeSelected,\n    reloadTree,\n    selectNodes,\n    state.model.rootNode.error,\n    state.rootNodes,\n  ]);\n\n  return {\n    ...renderProps,\n    isReloading: !!state.model.rootNode.isLoading || isSearching,\n    getTreeModelNode,\n    getNode,\n    setFormatter,\n  };\n}\n\nfunction generateTreeStructure(\n  parentNodeId: string | undefined,\n  model: TreeModel,\n  getTreeNodeErrors?: (node: HierarchyNode) => ErrorInfo[],\n): Array<TreeNode> | undefined {\n  const currentChildren = model.parentChildMap.get(parentNodeId);\n  if (!currentChildren) {\n    return undefined;\n  }\n\n  return currentChildren\n    .map((childId) => model.idToNode.get(childId))\n    .filter((node): node is TreeModelHierarchyNode => !!node)\n    .map<TreeNode>((node) => {\n      return createTreeNode(node, model, getTreeNodeErrors);\n    });\n}\n\nfunction createTreeNode(\n  modelNode: TreeModelHierarchyNode,\n  model: TreeModel,\n  getTreeNodeErrors?: (node: HierarchyNode) => ErrorInfo[],\n): TreeNode {\n  const allErrors = [\n    // internal errors\n    ...(modelNode.error ? [modelNode.error] : []),\n    // external errors\n    ...(getTreeNodeErrors?.(modelNode.nodeData) ?? []),\n  ];\n\n  let children: Array<TreeNode> | undefined;\n  return {\n    id: modelNode.id,\n    label: modelNode.label,\n    nodeData: modelNode.nodeData,\n    isLoading: !!modelNode.isLoading,\n    isExpanded: !!modelNode.isExpanded,\n    isFilterable:\n      !HierarchyNode.isGroupingNode(modelNode.nodeData) && !!modelNode.nodeData.supportsFiltering && modelNode.children,\n    isFiltered: !!modelNode.instanceFilter,\n    errors: allErrors,\n    get children() {\n      if (!children) {\n        children = generateTreeStructure(modelNode.id, model, getTreeNodeErrors);\n      }\n      return children ? children : modelNode.children === true ? true : [];\n    },\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAiCA,SAAOuB,QAAAC,OAAA;CAAA,MAAAC,IAAAC,EAAA,EAAA;CACoC,MAAAC,KAAAC,gBAAgBJ,MAAM;CAAA,IAAAK;AAAA,KAAAJ,EAAA,OAAAE,IAAA;EAA/D,MAAA,EAAAG,kBAAAC,GAAA,GAAAC,OAAyCL;AAAzCE,SAAAG;AAAgEP,IAAA,KAAAE;AAAAF,IAAA,KAAAI;OAAAA,QAAAJ,EAAA;AAAA,QACzDI;;;;;;;;;;;;;;;;;AAkBT,SAAOI,wBAAAN,IAAA;CAAA,MAAAF,IAAAC,EAAA,GAAA;CAAA,IAAAQ;CAAA,IAAAV;CAAA,IAAAW;CAAA,IAAAC;AAAA,KAAAX,EAAA,OAAAE,IAAA;AAAiC,GAAA,CAAAS,YAAAD,kBAAAD,mCAAAV,SAAAG;AAKMF,IAAA,KAAAE;AAAAF,IAAA,KAAAS;AAAAT,IAAA,KAAAD;AAAAC,IAAA,KAAAU;AAAAV,IAAA,KAAAW;QAAA;AAAAF,mCAAAT,EAAA;AAAAD,UAAAC,EAAA;AAAAU,qBAAAV,EAAA;AAAAW,eAAAX,EAAA;;CACN,MAAAO,KAAAJ,gBAAgBJ,MAAM;CAAA,IAAAM;CAAA,IAAAD;AAAA,KAAAJ,EAAA,OAAAO,IAAA;AAA5D,GAAA,CAAAF,qBAAAD,QAAsCG;AAAuBP,IAAA,KAAAO;AAAAP,IAAA,KAAAK;AAAAL,IAAA,KAAAI;QAAA;AAAAC,qBAAAL,EAAA;AAAAI,SAAAJ,EAAA;;CAAA,IAAAY;AAAA,KAAAZ,EAAA,OAAAS,kCAAAT,EAAA,OAAAK,oBAAAL,EAAA,QAAAU,oBAAAV,EAAA,QAAAW,YAAA;AACdC,OAAA;GAAAD;GAAAD;GAAAL;GAAAI;GAK9C;AAAAT,IAAA,KAAAS;AAAAT,IAAA,KAAAK;AAAAL,IAAA,MAAAU;AAAAV,IAAA,MAAAW;AAAAX,IAAA,MAAAY;OAAAA,MAAAZ,EAAA;CALD,MAAAa,iBAAuB9B,wBAAwB6B,GAK7C;AACF,KAAIR,KAAIU,2BAA4BC,KAAAA,KAAaX,KAAIY,mBAA6BC,WAAA;EAAA,IAAAC;AAAA,MAAAlB,EAAA,QAAAI,KAAAY,qBAAAhB,EAAA,QAAAa,gBAAA;AAC3CK,QAAA;IAAA,GAAKd,KAAIY;IAAkB,GAAKH;IAAgB;AAAAb,KAAA,MAAAI,KAAAY;AAAAhB,KAAA,MAAAa;AAAAb,KAAA,MAAAkB;QAAAA,MAAAlB,EAAA;EAAA,IAAAmB;AAAA,MAAAnB,EAAA,QAAAI,QAAAJ,EAAA,QAAAkB,IAAA;AAA9EC,QAAA;IAAA,GAAKf;IAAIY,mBAAqBE;IAAkD;AAAAlB,KAAA,MAAAI;AAAAJ,KAAA,MAAAkB;AAAAlB,KAAA,MAAAmB;QAAAA,MAAAnB,EAAA;AAAA,SAAhFmB;;AACR,QACMf;;AA0ET,SAASD,gBAAgB,EACvBkB,sBACAC,gBACAI,uBACAG,0BACAI,sBACAG,qBAGA;CACA,MAAM,CAACY,OAAOC,YAAYtE,SAAoB;EAC5CmE,OAAO;GAAEI,0BAAU,IAAIC,KAAK;GAAEC,gCAAgB,IAAID,KAAK;GAAEE,UAAU;IAAEC,IAAIvC,KAAAA;IAAWwC,UAAUxC,KAAAA;IAAU;GAAG;EAC3GE,WAAWF,KAAAA;EACZ,CAAC;CACF,MAAMyC,2BAA2BvE,UAAUyC,sBAAsB;CACjE,MAAM+B,8BAA8BxE,UAAU4C,yBAAyB;CACvE,MAAM6B,0BAA0BzE,UAAUgD,qBAAqB;CAC/D,MAAM0B,uBAAuB1E,UAAUmD,kBAAkB;CAEzD,MAAM,CAACwB,WAAWjF,eAEd,IAAIE,aACDiE,UAAU;AAKTG,WAAS;GAAEH;GAAO7B,WAHhB6B,MAAMM,eAAeS,IAAI9C,KAAAA,EAAU,KAAKA,KAAAA,IACpC+C,sBAAsB/C,KAAAA,GAAW+B,OAAOa,qBAAqBI,QAAQ,GACrEhD,KAAAA;GACuB,CAAC;KAE/BiD,YAAYpC,aAAa4B,yBAAyBO,UAAUC,YAAYpC,SAAS,GACjF7B,UAAU0D,4BAA4BM,UAAUhE,MAAM,GACtDA,YAAU2D,wBAAwBK,UAAUhE,QAC/C,CACJ,CAAC;CACD,MAAMkE,mBAAmBvF,QAAkC;CAE3D,MAAM,CAACwF,mBAAmBC,wBAAwBxF,UAAyC;AAC3FH,iBAAgB;EACd,MAAM4F,WAAW/C,sBAAsB;AACvC+C,WAAS1B,aAAauB,iBAAiBF,QAAQ;EAC/C,MAAMM,iCAAiCD,SAASE,iBAAiBC,aAAaC,wBAAwB;GACpG,MAAMC,qBAAqBD,oBAAoBE,cAAcC,cAAc5D,KAAAA;AAC3E6C,WAAQgB,WAAW,EAAE5B,OAAOyB,qBAAqB,YAAY,QAAQ,CAAC;IACtE;AACFb,UAAQO,qBAAqBC,SAAS;AACtCD,uBAAqBC,SAAS;AAC9B,eAAa;AACXC,mCAAgC;AAChCT,WAAQiB,OAAO;AACf7F,eAAYoF,SAAS;;IAEtB,CAACR,SAASvC,qBAAqB,CAAC;CAEnC,MAAM,CAACyD,aAAaC,kBAAkBpG,SAAS,MAAM;AACrDH,iBAAgB;EACd,IAAIwG,WAAW;EACf,MAAMC,aAAa,IAAIC,iBAAiB;AACxC,GAAM,YAAY;AAChB,OAAI,CAAChB,kBACH;AAGF,OAAI,CAAC5C,gBAAgB;AACnB4C,sBAAkBiB,mBAAmBpE,KAAAA,EAAU;AAE/C6C,YAAQgB,WAAW,EAAE5B,OAAO,QAAQ,CAAC;AACrC+B,mBAAe,MAAM;AACrB;;AAGFA,kBAAe,KAAK;GACpB,IAAIK;AACJ,OAAI;AACFA,YAAQ,MAAM9D,eAAe,EAAEC,aAAa0D,WAAWI,QAAQ,CAAC;WAC1D,WACE;AACR,QAAI,CAACL,UAAU;AACbd,uBAAkBiB,mBAAmBC,QAAQ,EAAEA,OAAO,GAAGrE,KAAAA,EAAU;AACnEgE,oBAAe,MAAM;;;MAGvB;AACJ,eAAa;AACXE,cAAWK,OAAO;AAClBN,cAAW;;IAEZ;EAACd;EAAmB5C;EAAgBsC;EAAQ,CAAC;CAEhD,MAAMvD,mBAAmB9B,aACtBkE,WAAmB;AAClB,SAAOmB,QAAQpB,QAAQC,OAAO;IAEhC,CAACmB,QACH,CAAC;CAED,MAAMpB,UAAUjE,aACbkE,aAAyC;EACxC,MAAMJ,OAAOuB,QAAQpB,QAAQC,SAAO;AACpC,MAAI,CAACJ,QAAQA,KAAKiB,OAAOvC,KAAAA,EACvB;AAEF,SAAOwE,eAAelD,MAAMW,MAAMF,OAAOa,qBAAqBI,QAAQ;IAExE;EAACH;EAASD;EAAsBX,MAAMF;EACxC,CAAC;CAED,MAAM0C,aAAajH,aAChBkE,UAAgBgD,eAAwB;AACvC7B,UAAQ4B,WAAW/C,UAAQgD,WAAW;IAExC,CAAC7B,QACH,CAAC;CAED,MAAMgB,aAAarG,aAChBmH,YAAY;AACX9B,UAAQgB,WAAWc,QAAQ;IAE7B,CAAC9B,QACH,CAAC;CAED,MAAM+B,cAAcpH,aACjBqH,SAAwBC,eAAoC;AAC3DjC,UAAQ+B,YAAYC,SAASC,WAAW;IAE1C,CAACjC,QACH,CAAC;CAED,MAAMkC,iBAAiBvH,aACpBkE,aAAmB3D,UAAUgH,eAAe9C,MAAMF,OAAOL,SAAO,EACjE,CAACO,MACH,CAAC;CAED,MAAMN,eAAenE,aAClBoE,cAAoD;AACnDsB,mBAAiBF,UAAUpB;AAC3B,MAAI,CAACuB,kBACH;AAGFA,oBAAkBxB,aAAaC,UAAU;IAE3C,CAACuB,kBACH,CAAC;CAED,MAAM6B,2BAA2BxH,aAC9BkE,aAAW;EACV,MAAMJ,SAAOuB,QAAQpB,QAAQC,SAAO;AACpC,MAAI,CAACyB,qBAAqB,CAAC7B,OACzB;EAEF,MAAM2D,gBAAgB3D,OAAKkB;AAC3B,MAAIyC,iBAAiBpH,cAAcqH,eAAeD,cAAc,CAC9D;AAGF,SAAO;GACLA;GACAE,0BAA0BnG,YACxBmE,kBAAkBiC,oBAAoB;IACpCC,YAAYJ;IACZK,gBAAgBtG,SAAOsG;IACvBC,yBAAyBvG,SAAOuG;IACjC,CAAC;GACJD,gBAAgBhE,OAAKgE;GACrBE,oBAAoBxE,WAAW6B,QAAQ2C,kBAAkB9D,UAAQV,OAAO;GACxEyE,WAAWnE,OAAKoE;GAChBC,eAAeC,UAAU/C,QAAQgD,kBAAkBnE,UAAQkE,MAAK;GACjE;IAEH,CAAC/C,SAASM,kBACZ,CAAC;AAsBD,QAAO;EACL,GArBiCzF,cAAc;AAC/C,OAAIuE,MAAMF,MAAMO,SAASlB,MACvB,QAAO,EAAErB,wBAAwB;IAAEqB,OAAOa,MAAMF,MAAMO,SAASlB;IAAOyC;IAAYmB;IAAyB,EAAG;AAEhH,UAAO;IACLjF,wBAAwBC,KAAAA;IACxBC,mBAAmBgC,MAAM/B,YACrB;KAAEA,WAAW+B,MAAM/B;KAAWuE;KAAYG;KAAaG;KAAgBlB;KAAYmB;KAA0B,GAC7GhF,KAAAA;IACL;KACA;GACDyE;GACAO;GACAD;GACAlB;GACAe;GACA3C,MAAMF,MAAMO,SAASlB;GACrBa,MAAM/B;GACP,CAAC;EAIAsB,aAAa,CAAC,CAACS,MAAMF,MAAMO,SAASyD,aAAahC;EACjDzE;EACAmC;EACAE;EACD;;AAGH,SAASoB,sBACPiD,cACAjE,OACAV,mBAC6B;CAC7B,MAAM4E,kBAAkBlE,MAAMM,eAAeS,IAAIkD,aAAa;AAC9D,KAAI,CAACC,gBACH;AAGF,QAAOA,gBACJC,KAAKC,YAAYpE,MAAMI,SAASW,IAAIqD,QAAQ,CAAC,CAC7CnF,QAAQM,SAAyC,CAAC,CAACA,KAAK,CACxD4E,KAAe5E,SAAS;AACvB,SAAOkD,eAAelD,MAAMS,OAAOV,kBAAkB;GACrD;;AAGN,SAASmD,eACP4B,WACArE,OACAV,mBACU;CACV,MAAMgF,YAAY,CAEhB,GAAID,UAAUhF,QAAQ,CAACgF,UAAUhF,MAAM,GAAG,EAAE,EAE5C,GAAIC,oBAAoB+E,UAAU5D,SAAS,IAAI,EAAE,CAClD;CAED,IAAI8D;AACJ,QAAO;EACL/D,IAAI6D,UAAU7D;EACdgE,OAAOH,UAAUG;EACjB/D,UAAU4D,UAAU5D;EACpBuD,WAAW,CAAC,CAACK,UAAUL;EACvBrB,YAAY,CAAC,CAAC0B,UAAU1B;EACxB8B,cACE,CAAC3I,cAAcqH,eAAekB,UAAU5D,SAAS,IAAI,CAAC,CAAC4D,UAAU5D,SAASiE,qBAAqBL,UAAUE;EAC3GI,YAAY,CAAC,CAACN,UAAUd;EACxBqB,QAAQN;EACR,IAAIC,WAAW;AACb,OAAI,CAACA,SACHA,YAAWvD,sBAAsBqD,UAAU7D,IAAIR,OAAOV,kBAAkB;AAE1E,UAAOiF,WAAWA,WAAWF,UAAUE,aAAa,OAAO,OAAO,EAAE;;EAEvE"}
+{"version":3,"file":"UseTree.js","names":["useCallback","useEffect","useMemo","useRef","useState","HierarchyNode","TreeActions","TreeModel","useUnifiedTreeSelection","safeDispose","useLatest","GenericInstanceFilter","HierarchyProvider","HierarchySearchTree","IPrimitiveValueFormatter","TreeModelHierarchyNode","TreeModelRootNode","UseUnifiedTreeSelectionProps","RootErrorRendererProps","TreeRendererProps","ErrorInfo","TreeNode","SelectionChangeType","useTree","props","$","_c","t0","useTreeInternal","rest","getTreeModelNode","_","t1","useUnifiedSelectionTree","createSelectableForGenericNode","selectionStorage","sourceName","t2","selectionProps","rootErrorRendererProps","undefined","treeRendererProps","rootNodes","t3","t4","UseTreeProps","getHierarchyProvider","getSearchPaths","abortSignal","AbortSignal","Promise","onPerformanceMeasured","action","duration","onHierarchyLimitExceeded","parentId","filter","limit","onHierarchyLoadError","type","error","getTreeNodeErrors","node","UseTreeResult","isReloading","getNode","nodeId","setFormatter","formatter","RendererProps","TreeState","model","Array","state","setState","idToNode","Map","parentChildMap","rootNode","id","nodeData","onPerformanceMeasuredRef","onHierarchyLimitExceededRef","onHierarchyLoadErrorRef","getTreeNodeErrorsRef","actions","get","generateTreeStructure","current","actionType","currentFormatter","hierarchyProvider","setHierarchyProvider","provider","removeHierarchyChangedListener","hierarchyChanged","addListener","hierarchyChangeArgs","shouldDiscardState","searchChange","newSearch","reloadTree","reset","isSearching","setIsSearching","disposed","controller","AbortController","setHierarchySearch","paths","signal","abort","createTreeNode","expandNode","isExpanded","options","selectNodes","nodeIds","changeType","isNodeSelected","getHierarchyLevelDetails","hierarchyNode","isGroupingNode","getInstanceKeysIterator","getNodeInstanceKeys","parentNode","instanceFilter","hierarchyLevelSizeLimit","setInstanceFilter","sizeLimit","hierarchyLimit","setSizeLimit","value","setHierarchyLimit","renderProps","isLoading","parentNodeId","currentChildren","map","childId","modelNode","allErrors","children","label","isFilterable","supportsFiltering","isFiltered","errors"],"sources":["../../src/presentation-hierarchies-react/UseTree.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useEffect, useMemo, useRef, useState } from \"react\";\nimport { HierarchyNode } from \"@itwin/presentation-hierarchies\";\nimport { TreeActions } from \"./internal/TreeActions.js\";\nimport { TreeModel } from \"./internal/TreeModel.js\";\nimport { useUnifiedTreeSelection } from \"./internal/UseUnifiedSelection.js\";\nimport { safeDispose } from \"./internal/Utils.js\";\nimport { useLatest } from \"./Utils.js\";\n\nimport type { GenericInstanceFilter, HierarchyProvider, HierarchySearchTree } from \"@itwin/presentation-hierarchies\";\nimport type { IPrimitiveValueFormatter } from \"@itwin/presentation-shared\";\nimport type { TreeModelHierarchyNode, TreeModelRootNode } from \"./internal/TreeModel.js\";\nimport type { UseUnifiedTreeSelectionProps } from \"./internal/UseUnifiedSelection.js\";\nimport type { RootErrorRendererProps, TreeRendererProps } from \"./Renderers.js\";\nimport type { ErrorInfo, TreeNode } from \"./TreeNode.js\";\nimport type { SelectionChangeType } from \"./UseSelectionHandler.js\";\n\n/**\n * A React hook that creates state for a tree component.\n *\n * The hook uses `@itwin/presentation-hierarchies` package to load the hierarchy data and returns a\n * component-agnostic result which may be used to render the hierarchy using any UI framework.\n *\n * See `README.md` for an example\n *\n * @see `useUnifiedSelectionTree`\n * @see `useIModelTree`\n * @public\n */\nexport function useTree(props: UseTreeProps): UseTreeResult {\n  const { getTreeModelNode: _, ...rest } = useTreeInternal(props);\n  return rest;\n}\n\n/**\n * A React hook that creates state for a tree component, that is integrated with unified selection\n * through the given selection storage (previously the storage was provided through the, now\n * deprecated, `UnifiedSelectionProvider`).\n *\n * The hook uses `@itwin/presentation-hierarchies` package to load the hierarchy data and returns a\n * component-agnostic result which may be used to render the hierarchy using any UI framework.\n *\n * See `README.md` for an example\n *\n * @see `useTree`\n * @see `useIModelUnifiedSelectionTree`\n * @see `UnifiedSelectionProvider`\n * @public\n */\nexport function useUnifiedSelectionTree({\n  sourceName,\n  selectionStorage,\n  createSelectableForGenericNode,\n  ...props\n}: UseTreeProps & UseUnifiedTreeSelectionProps): UseTreeResult {\n  const { getTreeModelNode, ...rest } = useTreeInternal(props);\n  const selectionProps = useUnifiedTreeSelection({\n    sourceName,\n    selectionStorage,\n    getTreeModelNode,\n    createSelectableForGenericNode,\n  });\n  if (rest.rootErrorRendererProps === undefined && rest.treeRendererProps?.rootNodes) {\n    return { ...rest, treeRendererProps: { ...rest.treeRendererProps, ...selectionProps } };\n  }\n  return rest;\n}\n\n/** @public */\nexport interface UseTreeProps {\n  /** Provides the hierarchy provider for the tree. */\n  getHierarchyProvider: () => HierarchyProvider;\n  /** Provides paths to search nodes. */\n  getSearchPaths?: ({ abortSignal }: { abortSignal: AbortSignal }) => Promise<HierarchySearchTree[] | undefined>;\n  /**\n   * Callback that is called just after a certain action is finished.\n   * Can be used for performance tracking.\n   */\n  onPerformanceMeasured?: (action: \"initial-load\" | \"hierarchy-level-load\" | \"reload\", duration: number) => void;\n  /** Action to perform when hierarchy level contains more items that the specified limit. */\n  onHierarchyLimitExceeded?: (props: {\n    parentId?: string;\n    filter?: GenericInstanceFilter;\n    limit?: number | \"unbounded\";\n  }) => void;\n  /** Action to perform when an error occurs while loading hierarchy. */\n  onHierarchyLoadError?: (props: { parentId?: string; type: \"timeout\" | \"unknown\"; error: unknown }) => void;\n  /**\n   * Callback to set custom TreeNode errors.\n   * Errors returned from this callback are combined with internal errors when populating `TreeNode.errors`.\n   */\n  getTreeNodeErrors?: (node: HierarchyNode) => ErrorInfo[];\n}\n\n/** @public */\nexport type UseTreeResult = {\n  /**\n   * Specifies whether tree is reloading or not. It is set to `false` when initial tree load is in progress to check if\n   * or tree is reloading.\n   */\n  isReloading: boolean;\n  /**\n   * Get a tree node by id\n   */\n  getNode: (nodeId: string) => TreeNode | undefined;\n  /**\n   * Sets a formatter for the primitive values that are displayed in the hierarchy.\n   */\n  setFormatter: (formatter: IPrimitiveValueFormatter | undefined) => void;\n} & RendererProps;\n\n/**.\n * @alpha\n */\ntype RendererProps =\n  | {\n      /**\n       * An object containing information used to render root error handling UI.\n       * Use in combination with `RootErrorRenderer` or your custom implementation.\n       * Defined when root nodes fail to load.\n       */\n      rootErrorRendererProps: RootErrorRendererProps;\n    }\n  | {\n      /** Is undefined when rootNodes were successfully loaded or are in initial loading process. */\n      rootErrorRendererProps: undefined;\n      /**\n       * An object containing information used to render tree.\n       * Use with `TreeRenderer` or your custom implementation.\n       * Is undefined on initial loading process.\n       */\n      treeRendererProps?: TreeRendererProps;\n    };\n\ninterface TreeState {\n  model: TreeModel;\n  rootNodes: Array<TreeNode> | undefined;\n}\n\nfunction useTreeInternal({\n  getHierarchyProvider,\n  getSearchPaths,\n  onPerformanceMeasured,\n  onHierarchyLimitExceeded,\n  onHierarchyLoadError,\n  getTreeNodeErrors,\n}: UseTreeProps): UseTreeResult & {\n  getTreeModelNode: (nodeId: string) => TreeModelRootNode | TreeModelHierarchyNode | undefined;\n} {\n  const [state, setState] = useState<TreeState>({\n    model: { idToNode: new Map(), parentChildMap: new Map(), rootNode: { id: undefined, nodeData: undefined } },\n    rootNodes: undefined,\n  });\n  const onPerformanceMeasuredRef = useLatest(onPerformanceMeasured);\n  const onHierarchyLimitExceededRef = useLatest(onHierarchyLimitExceeded);\n  const onHierarchyLoadErrorRef = useLatest(onHierarchyLoadError);\n  const getTreeNodeErrorsRef = useLatest(getTreeNodeErrors);\n\n  const [actions] = useState<TreeActions>(\n    // eslint-disable-next-line react-hooks/refs\n    () =>\n      new TreeActions(\n        (model) => {\n          const rootNodes =\n            model.parentChildMap.get(undefined) !== undefined\n              ? generateTreeStructure(undefined, model, getTreeNodeErrorsRef.current)\n              : undefined;\n          setState({ model, rootNodes });\n        },\n        (actionType, duration) => onPerformanceMeasuredRef.current?.(actionType, duration),\n        (props) => onHierarchyLimitExceededRef.current?.(props),\n        (props) => onHierarchyLoadErrorRef.current?.(props),\n      ),\n  );\n  const currentFormatter = useRef<IPrimitiveValueFormatter | undefined>(undefined);\n\n  const [hierarchyProvider, setHierarchyProvider] = useState<HierarchyProvider | undefined>();\n  useEffect(() => {\n    const provider = getHierarchyProvider();\n    provider.setFormatter(currentFormatter.current);\n    const removeHierarchyChangedListener = provider.hierarchyChanged.addListener((hierarchyChangeArgs) => {\n      const shouldDiscardState = hierarchyChangeArgs.searchChange?.newSearch !== undefined;\n      actions.reloadTree({ state: shouldDiscardState ? \"discard\" : \"keep\" });\n    });\n    actions.setHierarchyProvider(provider);\n    // eslint-disable-next-line react-hooks/set-state-in-effect\n    setHierarchyProvider(provider);\n    return () => {\n      removeHierarchyChangedListener();\n      actions.reset();\n      safeDispose(provider);\n    };\n  }, [actions, getHierarchyProvider]);\n\n  const [isSearching, setIsSearching] = useState(false);\n  useEffect(() => {\n    let disposed = false as boolean;\n    const controller = new AbortController();\n    void (async () => {\n      if (!hierarchyProvider) {\n        return;\n      }\n\n      if (!getSearchPaths) {\n        hierarchyProvider.setHierarchySearch(undefined);\n        // reload tree in case hierarchy provider does not use hierarchy search to load initial nodes\n        actions.reloadTree({ state: \"keep\" });\n        setIsSearching(false);\n        return;\n      }\n\n      setIsSearching(true);\n      let paths: HierarchySearchTree[] | undefined;\n      try {\n        paths = await getSearchPaths({ abortSignal: controller.signal });\n      } catch {\n      } finally {\n        if (!disposed) {\n          hierarchyProvider.setHierarchySearch(paths ? { paths } : undefined);\n          setIsSearching(false);\n        }\n      }\n    })();\n    return () => {\n      controller.abort();\n      disposed = true;\n    };\n  }, [hierarchyProvider, getSearchPaths, actions]);\n\n  const getTreeModelNode = useCallback<(nodeId: string) => TreeModelRootNode | TreeModelHierarchyNode | undefined>(\n    (nodeId: string) => {\n      return actions.getNode(nodeId);\n    },\n    [actions],\n  );\n\n  const getNode = useCallback(\n    (nodeId: string): TreeNode | undefined => {\n      const node = actions.getNode(nodeId);\n      if (!node || node.id === undefined) {\n        return undefined;\n      }\n      return createTreeNode(node, state.model, getTreeNodeErrorsRef.current);\n    },\n    [actions, getTreeNodeErrorsRef, state.model],\n  );\n\n  const expandNode = useCallback<TreeRendererProps[\"expandNode\"]>(\n    (nodeId: string, isExpanded: boolean) => {\n      actions.expandNode(nodeId, isExpanded);\n    },\n    [actions],\n  );\n\n  const reloadTree = useCallback<TreeRendererProps[\"reloadTree\"]>(\n    (options) => {\n      actions.reloadTree(options);\n    },\n    [actions],\n  );\n\n  const selectNodes = useCallback<TreeRendererProps[\"selectNodes\"]>(\n    (nodeIds: Array<string>, changeType: SelectionChangeType) => {\n      actions.selectNodes(nodeIds, changeType);\n    },\n    [actions],\n  );\n\n  const isNodeSelected = useCallback<TreeRendererProps[\"isNodeSelected\"]>(\n    (nodeId: string) => TreeModel.isNodeSelected(state.model, nodeId),\n    [state],\n  );\n\n  const setFormatter = useCallback<UseTreeResult[\"setFormatter\"]>(\n    (formatter: IPrimitiveValueFormatter | undefined) => {\n      currentFormatter.current = formatter;\n      if (!hierarchyProvider) {\n        return;\n      }\n\n      hierarchyProvider.setFormatter(formatter);\n    },\n    [hierarchyProvider],\n  );\n\n  const getHierarchyLevelDetails = useCallback<TreeRendererProps[\"getHierarchyLevelDetails\"]>(\n    (nodeId) => {\n      const node = actions.getNode(nodeId);\n      if (!hierarchyProvider || !node) {\n        return undefined;\n      }\n      const hierarchyNode = node.nodeData;\n      if (hierarchyNode && HierarchyNode.isGroupingNode(hierarchyNode)) {\n        return undefined;\n      }\n\n      return {\n        hierarchyNode,\n        getInstanceKeysIterator: (props) =>\n          hierarchyProvider.getNodeInstanceKeys({\n            parentNode: hierarchyNode,\n            instanceFilter: props?.instanceFilter,\n            hierarchyLevelSizeLimit: props?.hierarchyLevelSizeLimit,\n          }),\n        instanceFilter: node.instanceFilter,\n        setInstanceFilter: (filter) => actions.setInstanceFilter(nodeId, filter),\n        sizeLimit: node.hierarchyLimit,\n        setSizeLimit: (value) => actions.setHierarchyLimit(nodeId, value),\n      };\n    },\n    [actions, hierarchyProvider],\n  );\n\n  const renderProps: RendererProps = useMemo(() => {\n    if (state.model.rootNode.error) {\n      return { rootErrorRendererProps: { error: state.model.rootNode.error, reloadTree, getHierarchyLevelDetails } };\n    }\n    return {\n      rootErrorRendererProps: undefined,\n      treeRendererProps: state.rootNodes\n        ? { rootNodes: state.rootNodes, expandNode, selectNodes, isNodeSelected, reloadTree, getHierarchyLevelDetails }\n        : undefined,\n    };\n  }, [\n    expandNode,\n    getHierarchyLevelDetails,\n    isNodeSelected,\n    reloadTree,\n    selectNodes,\n    state.model.rootNode.error,\n    state.rootNodes,\n  ]);\n\n  return {\n    ...renderProps,\n    isReloading: !!state.model.rootNode.isLoading || isSearching,\n    getTreeModelNode,\n    getNode,\n    setFormatter,\n  };\n}\n\nfunction generateTreeStructure(\n  parentNodeId: string | undefined,\n  model: TreeModel,\n  getTreeNodeErrors?: (node: HierarchyNode) => ErrorInfo[],\n): Array<TreeNode> | undefined {\n  const currentChildren = model.parentChildMap.get(parentNodeId);\n  if (!currentChildren) {\n    return undefined;\n  }\n\n  return currentChildren\n    .map((childId) => model.idToNode.get(childId))\n    .filter((node): node is TreeModelHierarchyNode => !!node)\n    .map<TreeNode>((node) => {\n      return createTreeNode(node, model, getTreeNodeErrors);\n    });\n}\n\nfunction createTreeNode(\n  modelNode: TreeModelHierarchyNode,\n  model: TreeModel,\n  getTreeNodeErrors?: (node: HierarchyNode) => ErrorInfo[],\n): TreeNode {\n  const allErrors = [\n    // internal errors\n    ...(modelNode.error ? [modelNode.error] : []),\n    // external errors\n    ...(getTreeNodeErrors?.(modelNode.nodeData) ?? []),\n  ];\n\n  let children: Array<TreeNode> | undefined;\n  return {\n    id: modelNode.id,\n    label: modelNode.label,\n    nodeData: modelNode.nodeData,\n    isLoading: !!modelNode.isLoading,\n    isExpanded: !!modelNode.isExpanded,\n    isFilterable:\n      !HierarchyNode.isGroupingNode(modelNode.nodeData) && !!modelNode.nodeData.supportsFiltering && modelNode.children,\n    isFiltered: !!modelNode.instanceFilter,\n    errors: allErrors,\n    get children() {\n      if (!children) {\n        children = generateTreeStructure(modelNode.id, model, getTreeNodeErrors);\n      }\n      return children ? children : modelNode.children === true ? true : [];\n    },\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAiCA,SAAOuB,QAAAC,OAAA;CAAA,MAAAC,IAAAC,EAAA,CAAA;CACoC,MAAAC,KAAAC,gBAAgBJ,KAAK;CAAC,IAAAK;CAAA,IAAAJ,EAAA,OAAAE,IAAA;EAA/D,MAAA,EAAAG,kBAAAC,GAAA,GAAAC,OAAyCL;EAAzCE,OAAAG;EAAgEP,EAAA,KAAAE;EAAAF,EAAA,KAAAI;CAAA,OAAAA,OAAAJ,EAAA;CAAA,OACzDI;AAAI;;;;;;;;;;;;;;;;AAkBb,SAAOI,wBAAAN,IAAA;CAAA,MAAAF,IAAAC,EAAA,EAAA;CAAA,IAAAQ;CAAA,IAAAV;CAAA,IAAAW;CAAA,IAAAC;CAAA,IAAAX,EAAA,OAAAE,IAAA;EAAiC,CAAA,CAAAS,YAAAD,kBAAAD,mCAAAV,SAAAG;EAKMF,EAAA,KAAAE;EAAAF,EAAA,KAAAS;EAAAT,EAAA,KAAAD;EAAAC,EAAA,KAAAU;EAAAV,EAAA,KAAAW;CAAA,OAAA;EAAAF,iCAAAT,EAAA;EAAAD,QAAAC,EAAA;EAAAU,mBAAAV,EAAA;EAAAW,aAAAX,EAAA;CAAA;CACN,MAAAO,KAAAJ,gBAAgBJ,KAAK;CAAC,IAAAM;CAAA,IAAAD;CAAA,IAAAJ,EAAA,OAAAO,IAAA;EAA5D,CAAA,CAAAF,qBAAAD,QAAsCG;EAAuBP,EAAA,KAAAO;EAAAP,EAAA,KAAAK;EAAAL,EAAA,KAAAI;CAAA,OAAA;EAAAC,mBAAAL,EAAA;EAAAI,OAAAJ,EAAA;CAAA;CAAA,IAAAY;CAAA,IAAAZ,EAAA,OAAAS,kCAAAT,EAAA,OAAAK,oBAAAL,EAAA,QAAAU,oBAAAV,EAAA,QAAAW,YAAA;EACdC,KAAA;GAAAD;GAAAD;GAAAL;GAAAI;EAK/C;EAACT,EAAA,KAAAS;EAAAT,EAAA,KAAAK;EAAAL,EAAA,MAAAU;EAAAV,EAAA,MAAAW;EAAAX,EAAA,MAAAY;CAAA,OAAAA,KAAAZ,EAAA;CALD,MAAAa,iBAAuB9B,wBAAwB6B,EAK9C;CACD,IAAIR,KAAIU,2BAA4BC,KAAAA,KAAaX,KAAIY,mBAA6BC,WAAA;EAAA,IAAAC;EAAA,IAAAlB,EAAA,QAAAI,KAAAY,qBAAAhB,EAAA,QAAAa,gBAAA;GAC3CK,KAAA;IAAA,GAAKd,KAAIY;IAAkB,GAAKH;GAAe;GAACb,EAAA,MAAAI,KAAAY;GAAAhB,EAAA,MAAAa;GAAAb,EAAA,MAAAkB;EAAA,OAAAA,KAAAlB,EAAA;EAAA,IAAAmB;EAAA,IAAAnB,EAAA,QAAAI,QAAAJ,EAAA,QAAAkB,IAAA;GAA9EC,KAAA;IAAA,GAAKf;IAAIY,mBAAqBE;GAAiD;GAAClB,EAAA,MAAAI;GAAAJ,EAAA,MAAAkB;GAAAlB,EAAA,MAAAmB;EAAA,OAAAA,KAAAnB,EAAA;EAAA,OAAhFmB;CAAgF;CACxF,OACMf;AAAI;AA0Eb,SAASD,gBAAgB,EACvBkB,sBACAC,gBACAI,uBACAG,0BACAI,sBACAG,qBAGA;CACA,MAAM,CAACY,OAAOC,YAAYtE,SAAoB;EAC5CmE,OAAO;GAAEI,0BAAU,IAAIC,IAAI;GAAGC,gCAAgB,IAAID,IAAI;GAAGE,UAAU;IAAEC,IAAIvC,KAAAA;IAAWwC,UAAUxC,KAAAA;GAAU;EAAE;EAC1GE,WAAWF,KAAAA;CACb,CAAC;CACD,MAAMyC,2BAA2BvE,UAAUyC,qBAAqB;CAChE,MAAM+B,8BAA8BxE,UAAU4C,wBAAwB;CACtE,MAAM6B,0BAA0BzE,UAAUgD,oBAAoB;CAC9D,MAAM0B,uBAAuB1E,UAAUmD,iBAAiB;CAExD,MAAM,CAACwB,WAAWjF,eAGd,IAAIE,aACDiE,UAAU;EACT,MAAM7B,YACJ6B,MAAMM,eAAeS,IAAI9C,KAAAA,CAAS,MAAMA,KAAAA,IACpC+C,sBAAsB/C,KAAAA,GAAW+B,OAAOa,qBAAqBI,OAAO,IACpEhD,KAAAA;EACNkC,SAAS;GAAEH;GAAO7B;EAAU,CAAC;CAC/B,IACC+C,YAAYpC,aAAa4B,yBAAyBO,UAAUC,YAAYpC,QAAQ,IAChF7B,UAAU0D,4BAA4BM,UAAUhE,KAAK,IACrDA,YAAU2D,wBAAwBK,UAAUhE,OAAK,CACpD,CACJ;CACA,MAAMkE,mBAAmBvF,OAA6CqC,KAAAA,CAAS;CAE/E,MAAM,CAACmD,mBAAmBC,wBAAwBxF,SAAwC;CAC1FH,gBAAgB;EACd,MAAM4F,WAAW/C,qBAAqB;EACtC+C,SAAS1B,aAAauB,iBAAiBF,OAAO;EAC9C,MAAMM,iCAAiCD,SAASE,iBAAiBC,aAAaC,wBAAwB;GACpG,MAAMC,qBAAqBD,oBAAoBE,cAAcC,cAAc5D,KAAAA;GAC3E6C,QAAQgB,WAAW,EAAE5B,OAAOyB,qBAAqB,YAAY,OAAO,CAAC;EACvE,CAAC;EACDb,QAAQO,qBAAqBC,QAAQ;EAErCD,qBAAqBC,QAAQ;EAC7B,aAAa;GACXC,+BAA+B;GAC/BT,QAAQiB,MAAM;GACd7F,YAAYoF,QAAQ;EACtB;CACF,GAAG,CAACR,SAASvC,oBAAoB,CAAC;CAElC,MAAM,CAACyD,aAAaC,kBAAkBpG,SAAS,KAAK;CACpDH,gBAAgB;EACd,IAAIwG,WAAW;EACf,MAAMC,aAAa,IAAIC,gBAAgB;EACvC,CAAM,YAAY;GAChB,IAAI,CAAChB,mBACH;GAGF,IAAI,CAAC5C,gBAAgB;IACnB4C,kBAAkBiB,mBAAmBpE,KAAAA,CAAS;IAE9C6C,QAAQgB,WAAW,EAAE5B,OAAO,OAAO,CAAC;IACpC+B,eAAe,KAAK;IACpB;GACF;GAEAA,eAAe,IAAI;GACnB,IAAIK;GACJ,IAAI;IACFA,QAAQ,MAAM9D,eAAe,EAAEC,aAAa0D,WAAWI,OAAO,CAAC;GACjE,QAAQ,CACR,UAAU;IACR,IAAI,CAACL,UAAU;KACbd,kBAAkBiB,mBAAmBC,QAAQ,EAAEA,MAAM,IAAIrE,KAAAA,CAAS;KAClEgE,eAAe,KAAK;IACtB;GACF;EACF,EAAA,CAAG;EACH,aAAa;GACXE,WAAWK,MAAM;GACjBN,WAAW;EACb;CACF,GAAG;EAACd;EAAmB5C;EAAgBsC;CAAO,CAAC;CAE/C,MAAMvD,mBAAmB9B,aACtBkE,WAAmB;EAClB,OAAOmB,QAAQpB,QAAQC,MAAM;CAC/B,GACA,CAACmB,OAAO,CACV;CAEA,MAAMpB,UAAUjE,aACbkE,aAAyC;EACxC,MAAMJ,OAAOuB,QAAQpB,QAAQC,QAAM;EACnC,IAAI,CAACJ,QAAQA,KAAKiB,OAAOvC,KAAAA,GACvB;EAEF,OAAOwE,eAAelD,MAAMW,MAAMF,OAAOa,qBAAqBI,OAAO;CACvE,GACA;EAACH;EAASD;EAAsBX,MAAMF;CAAK,CAC7C;CAEA,MAAM0C,aAAajH,aAChBkE,UAAgBgD,eAAwB;EACvC7B,QAAQ4B,WAAW/C,UAAQgD,UAAU;CACvC,GACA,CAAC7B,OAAO,CACV;CAEA,MAAMgB,aAAarG,aAChBmH,YAAY;EACX9B,QAAQgB,WAAWc,OAAO;CAC5B,GACA,CAAC9B,OAAO,CACV;CAEA,MAAM+B,cAAcpH,aACjBqH,SAAwBC,eAAoC;EAC3DjC,QAAQ+B,YAAYC,SAASC,UAAU;CACzC,GACA,CAACjC,OAAO,CACV;CAEA,MAAMkC,iBAAiBvH,aACpBkE,aAAmB3D,UAAUgH,eAAe9C,MAAMF,OAAOL,QAAM,GAChE,CAACO,KAAK,CACR;CAEA,MAAMN,eAAenE,aAClBoE,cAAoD;EACnDsB,iBAAiBF,UAAUpB;EAC3B,IAAI,CAACuB,mBACH;EAGFA,kBAAkBxB,aAAaC,SAAS;CAC1C,GACA,CAACuB,iBAAiB,CACpB;CAEA,MAAM6B,2BAA2BxH,aAC9BkE,aAAW;EACV,MAAMJ,SAAOuB,QAAQpB,QAAQC,QAAM;EACnC,IAAI,CAACyB,qBAAqB,CAAC7B,QACzB;EAEF,MAAM2D,gBAAgB3D,OAAKkB;EAC3B,IAAIyC,iBAAiBpH,cAAcqH,eAAeD,aAAa,GAC7D;EAGF,OAAO;GACLA;GACAE,0BAA0BnG,YACxBmE,kBAAkBiC,oBAAoB;IACpCC,YAAYJ;IACZK,gBAAgBtG,SAAOsG;IACvBC,yBAAyBvG,SAAOuG;GAClC,CAAC;GACHD,gBAAgBhE,OAAKgE;GACrBE,oBAAoBxE,WAAW6B,QAAQ2C,kBAAkB9D,UAAQV,MAAM;GACvEyE,WAAWnE,OAAKoE;GAChBC,eAAeC,UAAU/C,QAAQgD,kBAAkBnE,UAAQkE,KAAK;EAClE;CACF,GACA,CAAC/C,SAASM,iBAAiB,CAC7B;CAsBA,OAAO;EACL,GArBiCzF,cAAc;GAC/C,IAAIuE,MAAMF,MAAMO,SAASlB,OACvB,OAAO,EAAErB,wBAAwB;IAAEqB,OAAOa,MAAMF,MAAMO,SAASlB;IAAOyC;IAAYmB;GAAyB,EAAE;GAE/G,OAAO;IACLjF,wBAAwBC,KAAAA;IACxBC,mBAAmBgC,MAAM/B,YACrB;KAAEA,WAAW+B,MAAM/B;KAAWuE;KAAYG;KAAaG;KAAgBlB;KAAYmB;IAAyB,IAC5GhF,KAAAA;GACN;EACF,GAAG;GACDyE;GACAO;GACAD;GACAlB;GACAe;GACA3C,MAAMF,MAAMO,SAASlB;GACrBa,MAAM/B;EAAS,CAIZ4F;EACHtE,aAAa,CAAC,CAACS,MAAMF,MAAMO,SAASyD,aAAahC;EACjDzE;EACAmC;EACAE;CACF;AACF;AAEA,SAASoB,sBACPiD,cACAjE,OACAV,mBAC6B;CAC7B,MAAM4E,kBAAkBlE,MAAMM,eAAeS,IAAIkD,YAAY;CAC7D,IAAI,CAACC,iBACH;CAGF,OAAOA,gBACJC,KAAKC,YAAYpE,MAAMI,SAASW,IAAIqD,OAAO,CAAC,CAAC,CAC7CnF,QAAQM,SAAyC,CAAC,CAACA,IAAI,CAAC,CACxD4E,KAAe5E,SAAS;EACvB,OAAOkD,eAAelD,MAAMS,OAAOV,iBAAiB;CACtD,CAAC;AACL;AAEA,SAASmD,eACP4B,WACArE,OACAV,mBACU;CACV,MAAMgF,YAAY,CAEhB,GAAID,UAAUhF,QAAQ,CAACgF,UAAUhF,KAAK,IAAI,CAAA,GAE1C,GAAIC,oBAAoB+E,UAAU5D,QAAQ,KAAK,CAAA,CAAG;CAGpD,IAAI8D;CACJ,OAAO;EACL/D,IAAI6D,UAAU7D;EACdgE,OAAOH,UAAUG;EACjB/D,UAAU4D,UAAU5D;EACpBuD,WAAW,CAAC,CAACK,UAAUL;EACvBrB,YAAY,CAAC,CAAC0B,UAAU1B;EACxB8B,cACE,CAAC3I,cAAcqH,eAAekB,UAAU5D,QAAQ,KAAK,CAAC,CAAC4D,UAAU5D,SAASiE,qBAAqBL,UAAUE;EAC3GI,YAAY,CAAC,CAACN,UAAUd;EACxBqB,QAAQN;EACR,IAAIC,WAAW;GACb,IAAI,CAACA,UACHA,WAAWvD,sBAAsBqD,UAAU7D,IAAIR,OAAOV,iBAAiB;GAEzE,OAAOiF,WAAWA,WAAWF,UAAUE,aAAa,OAAO,OAAO,CAAA;EACpE;CACF;AACF"}

package/lib/presentation-hierarchies-react/Utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"Utils.js","names":["useCallback","useInsertionEffect","useRef","LegacyRef","MutableRefObject","Ref","useLatest","value","$","_c","ref","t0","t1","current","useEvent","callback","latestCallback","args","useMergedRefs","refs","ReadonlyArray","T","instance","forEach"],"sources":["../../src/presentation-hierarchies-react/Utils.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useInsertionEffect, useRef } from \"react\";\n\nimport type { LegacyRef, MutableRefObject, Ref } from \"react\";\n\n/** @internal */\nexport function useLatest<T>(value: T) {\n  const ref = useRef(value);\n\n  useInsertionEffect(() => {\n    ref.current = value;\n  }, [value]);\n\n  return ref;\n}\n\n/* c8 ignore start */\n/** @internal */\nexport function useEvent<TCallback extends (...args: any[]) => void>(callback: TCallback) {\n  const latestCallback = useLatest(callback);\n\n  return useCallback(\n    (...args: Parameters<TCallback>) => {\n      latestCallback.current(...args);\n    },\n    [latestCallback],\n  );\n}\n/* c8 ignore end */\n\n/* c8 ignore start */\n/** @internal */\nexport function useMergedRefs<T>(...refs: ReadonlyArray<Ref<T> | LegacyRef<T> | undefined | null>) {\n  return useCallback(\n    (instance: T | null) => {\n      refs.forEach((ref) => {\n        if (typeof ref === \"function\") {\n          ref(instance);\n        } else if (ref) {\n          (ref as MutableRefObject<T | null>).current = instance;\n        }\n      });\n    }, // eslint-disable-next-line react-hooks/exhaustive-deps\n    [...refs],\n  );\n}\n/* c8 ignore end */\n"],"mappings":";;;;AAUA,SAAOM,UAAAC,OAAA;CAAA,MAAAC,IAAAC,EAAA,EAAA;CACL,MAAAC,MAAYR,OAAOK,MAAM;CAAC,IAAAI;CAAA,IAAAC;AAAA,KAAAJ,EAAA,OAAAD,OAAA;AAEPI,aAAA;AACjBD,OAAGG,UAAWN;;AACbK,OAAA,CAACL,MAAM;AAAAC,IAAA,KAAAD;AAAAC,IAAA,KAAAG;AAAAH,IAAA,KAAAI;QAAA;AAAAD,OAAAH,EAAA;AAAAI,OAAAJ,EAAA;;AAFVP,oBAAmBU,IAEhBC,GAAQ;AAAA,QAEJF;;;;AAKT,SAAOI,SAAAC,UAAA;CAAA,MAAAP,IAAAC,EAAA,EAAA;CACL,MAAAO,iBAAuBV,UAAUS,SAAS;CAAC,IAAAJ;AAAA,KAAAH,EAAA,OAAAQ,gBAAA;AAGzCL,QAAA,GAAAC,OAAA;GAAC,MAAAK,OAAAL;AACCI,kBAAcH,QAAQ,GAAII,KAAK;;AAChCT,IAAA,KAAAQ;AAAAR,IAAA,KAAAG;OAAAA,MAAAH,EAAA;AAAA,QAHIG;;;;;AAWT,SAAgBO,cAAiB,GAAGC,MAA+D;AACjG,QAAOnB,aACJsB,aAAuB;AACtBH,OAAKI,SAASb,QAAQ;AACpB,OAAI,OAAOA,QAAQ,WACjBA,KAAIY,SAAS;YACJZ,IACRA,KAAmCG,UAAUS;IAEhD;IAEJ,CAAC,GAAGH,KACN,CAAC"}
+{"version":3,"file":"Utils.js","names":["useCallback","useInsertionEffect","useRef","LegacyRef","Ref","useLatest","value","$","_c","ref","t0","t1","current","useEvent","callback","latestCallback","args","useMergedRefs","refs","ReadonlyArray","T","instance","forEach"],"sources":["../../src/presentation-hierarchies-react/Utils.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useInsertionEffect, useRef } from \"react\";\n\nimport type { LegacyRef, Ref } from \"react\";\n\n/** @internal */\nexport function useLatest<T>(value: T) {\n  const ref = useRef(value);\n\n  useInsertionEffect(() => {\n    ref.current = value;\n  }, [value]);\n\n  return ref;\n}\n\n/* c8 ignore start */\n/** @internal */\nexport function useEvent<TCallback extends (...args: any[]) => void>(callback: TCallback) {\n  const latestCallback = useLatest(callback);\n\n  return useCallback(\n    (...args: Parameters<TCallback>) => {\n      latestCallback.current(...args);\n    },\n    [latestCallback],\n  );\n}\n/* c8 ignore end */\n\n/* c8 ignore start */\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/no-deprecated\nexport function useMergedRefs<T>(...refs: ReadonlyArray<Ref<T> | LegacyRef<T> | undefined | null>) {\n  return useCallback(\n    (instance: T | null) => {\n      refs.forEach((ref) => {\n        if (typeof ref === \"function\") {\n          ref(instance);\n        } else if (ref) {\n          ref.current = instance;\n        }\n      });\n    }, // eslint-disable-next-line react-hooks/exhaustive-deps, react-hooks/use-memo\n    [...refs],\n  );\n}\n/* c8 ignore end */\n"],"mappings":";;;;AAUA,SAAOK,UAAAC,OAAA;CAAA,MAAAC,IAAAC,EAAA,CAAA;CACL,MAAAC,MAAYP,OAAOI,KAAK;CAAE,IAAAI;CAAA,IAAAC;CAAA,IAAAJ,EAAA,OAAAD,OAAA;EAEPI,WAAA;GACjBD,IAAGG,UAAWN;EAAH;EACVK,KAAA,CAACL,KAAK;EAACC,EAAA,KAAAD;EAAAC,EAAA,KAAAG;EAAAH,EAAA,KAAAI;CAAA,OAAA;EAAAD,KAAAH,EAAA;EAAAI,KAAAJ,EAAA;CAAA;CAFVN,mBAAmBS,IAEhBC,EAAO;CAAC,OAEJF;AAAG;;;AAKZ,SAAOI,SAAAC,UAAA;CAAA,MAAAP,IAAAC,EAAA,CAAA;CACL,MAAAO,iBAAuBV,UAAUS,QAAQ;CAAE,IAAAJ;CAAA,IAAAH,EAAA,OAAAQ,gBAAA;EAGzCL,MAAA,GAAAC,OAAA;GAAC,MAAAK,OAAAL;GACCI,eAAcH,QAAQ,GAAII,IAAI;EAAC;EAChCT,EAAA,KAAAQ;EAAAR,EAAA,KAAAG;CAAA,OAAAA,KAAAH,EAAA;CAAA,OAHIG;AAKN;;;;AAOH,SAAgBO,cAAiB,GAAGC,MAA+D;CACjG,OAAOlB,aACJqB,aAAuB;EACtBH,KAAKI,SAASb,QAAQ;GACpB,IAAI,OAAOA,QAAQ,YACjBA,IAAIY,QAAQ;QACP,IAAIZ,KACTA,IAAIG,UAAUS;EAElB,CAAC;CACH,GACA,CAAC,GAAGH,IAAI,CACV;AACF"}

package/lib/presentation-hierarchies-react/internal/DisposePolyfill.js.map

@@ -1 +1 @@
-{"version":3,"file":"DisposePolyfill.js","names":["Symbol","dispose","asyncDispose"],"sources":["../../../src/presentation-hierarchies-react/internal/DisposePolyfill.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\n/**\n * Polyfill for upcoming resource management feature: https://github.com/tc39/proposal-explicit-resource-management\n */\n(Symbol as any).dispose ??= Symbol(\"Symbol.dispose\");\n(Symbol as any).asyncDispose ??= Symbol(\"Symbol.asyncDispose\");\n"],"mappings":";;;;AAQA,OAAgBC,YAAYD,OAAO,iBAAiB;AACpD,OAAgBE,iBAAiBF,OAAO,sBAAsB"}
+{"version":3,"file":"DisposePolyfill.js","names":["Symbol","dispose","asyncDispose"],"sources":["../../../src/presentation-hierarchies-react/internal/DisposePolyfill.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\n/**\n * Polyfill for upcoming resource management feature: https://github.com/tc39/proposal-explicit-resource-management\n */\n(Symbol as any).dispose ??= Symbol(\"Symbol.dispose\");\n(Symbol as any).asyncDispose ??= Symbol(\"Symbol.asyncDispose\");\n"],"mappings":";;;;AAQA,OAAgBC,YAAYD,OAAO,gBAAgB;AACnD,OAAgBE,iBAAiBF,OAAO,qBAAqB"}

package/lib/presentation-hierarchies-react/internal/LocalizedStrings.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"LocalizedStrings.d.ts","names":[],"sources":["../../../src/presentation-hierarchies-react/internal/LocalizedStrings.ts"],"mappings":";;;;;cAmLa,uBAAA"}
+{"version":3,"file":"LocalizedStrings.d.ts","names":[],"sources":["../../../src/presentation-hierarchies-react/internal/LocalizedStrings.ts"],"mappings":";;;;;cAmLa"}

package/lib/presentation-hierarchies-react/internal/LocalizedStrings.js.map

@@ -1 +1 @@
-{"version":3,"file":"LocalizedStrings.js","names":["LOCALIZED_STRINGS","loading","filterHierarchyLevel","filterHierarchyLevelActiveDescription","clearHierarchyLevelFilter","noFilteredChildren","noFilteredChildrenChangeFilter","failedToCreateHierarchy","failedToCreateRootHierarchy","resultLimitExceeded","rootResultLimitExceeded","issuesForTree","issuesFound","noIssuesFound","increaseHierarchyLimit","increaseHierarchyLimitToUnlimited","increaseHierarchyLimitWithFiltering","retry","rename","more","confirm","cancel","newLabel","other","unspecified","AddPrefix","TPrefix","TPath","ObjectKeys","Acc","TObject","K","LocalizationKey","LOCALIZATION_NAMESPACE","LOCALIZATION_NAMESPACES"],"sources":["../../../src/presentation-hierarchies-react/internal/LocalizedStrings.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\n/**\n * Localized strings used in the components.\n *\n * The version suffix in `LOCALIZATION_NAMESPACE` should be bumped when making changes to this object:\n * - minor bump when new strings are added or exists string values are changed,\n * - major bump when a string is removed.\n *\n * @internal\n */\nexport const LOCALIZED_STRINGS = {\n  /**\n   * Message displayed when nodes are loading.\n   * Default value: `Loading...`.\n   */\n  loading: \"Loading...\",\n  /**\n   * Title for apply hierarchy filter button.\n   * Default value: `Apply filter`.\n   */\n  filterHierarchyLevel: \"Apply filter\",\n  /**\n   * Accessible description for applied hierarchy filter button.\n   * Default value: `Filter is applied`.\n   */\n  filterHierarchyLevelActiveDescription: \"Filter is applied\",\n  /**\n   * Title for clear hierarchy filter button.\n   * Default value: `Clear active filter`.\n   */\n  clearHierarchyLevelFilter: \"Clear active filter\",\n  /**\n   * Message displayed when no nodes matching filter are found.\n   * Default value: `No matches for current filter for {{node}}.`.\n   */\n  noFilteredChildren: \"No matches for current filter for {{node}}.\",\n  /**\n   * Label for change filter action.\n   * Default value: `Change filter`.\n   */\n  noFilteredChildrenChangeFilter: \"Change filter\",\n  /**\n   * Message displayed when hierarchy creation for a node failed.\n   * Default value: `Failed to create hierarchy for {{node}}.`.\n   */\n  failedToCreateHierarchy: \"Failed to create hierarchy for {{node}}.\",\n  /**\n   * Message displayed when hierarchy creation for a node failed.\n   * Default value: `Failed to load tree.`.\n   */\n  failedToCreateRootHierarchy: \"Failed to load tree.\",\n  /**\n   * Message displayed when result limit exceeds hierarchy size limit.\n   * Default value: `The hierarchy for {{node}} contains {{limit}}+ items. Try using filters or increase the limit.`.\n   */\n  resultLimitExceeded: \"The hierarchy for {{node}} contains {{limit}}+ items. Try using filters or increase the limit.\",\n  /**\n   * Message displayed when result limit exceeds hierarchy size limit.\n   * Default value: `The root item hierarchy contains {{limit}}+ items. Try increasing the limit.`.\n   */\n  rootResultLimitExceeded: \"The root item hierarchy contains {{limit}}+ items. Try increasing the limit.\",\n  /**\n   * Name for the error region landmark.\n   * Default value: `Issues for {{tree_label}}.`.\n   */\n  issuesForTree: \"Issues for {{tree_label}}.\",\n  /**\n   * Label displayed on the error region, when errors are detected.\n   * Default value: `{{number_of_issues}} issue(s) found.`.\n   */\n  issuesFound: \"{{number_of_issues}} issue(s) found.\",\n  /**\n   * Label displayed on the error region, when no issues are found.\n   * Default value: `No issues found.`.\n   */\n  noIssuesFound: \"No issues found.\",\n  /**\n   * Message displayed when hierarchy size limit can be overridden.\n   * Default value: `Increase limit to {{limit}}`.\n   */\n  increaseHierarchyLimit: \"Increase limit to {{limit}}\",\n  /**\n   * Message displayed when hierarchy size limit can be overridden.\n   * Default value: `Remove limit`.\n   */\n  increaseHierarchyLimitToUnlimited: \"Remove limit\",\n  /**\n   * Message displayed when hierarchy size limit can be overridden and hierarchy filtering is enabled.\n   * Default value: `Add Filter`.\n   */\n  increaseHierarchyLimitWithFiltering: \"Add Filter\",\n  /**\n   * Label for retry action.\n   * Default value: `Retry`.\n   */\n  retry: \"Retry\",\n  /**\n   * Label for rename action.\n   * Default value: `Rename`.\n   */\n  rename: \"Rename\",\n  /**\n   * Label for more actions button.\n   * Default value: `More`.\n   */\n  more: \"More\",\n  /**\n   * Label for confirm button.\n   * Default value: `Confirm`.\n   */\n  confirm: \"Confirm\",\n  /**\n   * Label for cancel button.\n   * Default value: `Cancel`.\n   */\n  cancel: \"Cancel\",\n  /**\n   * Label for tree node rename input.\n   * Default value: `New label`.\n   */\n  newLabel: \"New label\",\n  /**\n   * A string for \"Other\". Used for label of a range property grouping node that\n   * groups values which don't fit into any other range.\n   */\n  other: \"Other\",\n  /**\n   * A string for \"Unspecified\". Used for labels of property grouping nodes\n   * that group by an empty value.\n   */\n  unspecified: \"Unspecified\",\n};\n\ntype AddPrefix<TPrefix extends string, TPath extends string> = [TPrefix] extends [never]\n  ? `${TPath}`\n  : `${TPrefix}.${TPath}`;\n\n/**\n * Utility type that extracts all possible keys from a nested object as dot-separated strings\n *\n * Example:\n *\n * ```ts\n * type Example = {\n *   a: {\n *     b: string;\n *     c: number;\n *   };\n *   d: boolean;\n * }\n * // ExampleKeys will be \"a.b\" | \"a.c\" | \"d\"\n * type ExampleKeys = ObjectKeys<Example>\n * ```\n */\ntype ObjectKeys<TObject extends object, Acc extends string = never> =\n  | Acc\n  | {\n      [K in keyof TObject & string]: TObject[K] extends object\n        ? ObjectKeys<TObject[K], AddPrefix<Acc, K>>\n        : AddPrefix<Acc, K>;\n    }[keyof TObject & string];\n\n/**\n * Type representing all possible localization keys\n * @internal\n */\nexport type LocalizationKey = ObjectKeys<typeof LOCALIZED_STRINGS>;\n\n/** @internal */\nexport const LOCALIZATION_NAMESPACE = \"PresentationHierarchies_1.0\";\n\n/**\n * Namespaces used for localization of presentation hierarchies components.\n * @alpha\n */\nexport const LOCALIZATION_NAMESPACES = [LOCALIZATION_NAMESPACE];\n"],"mappings":";;AA6KA,MAAaiC,yBAAyB;;;;;AAMtC,MAAaC,0BAA0B,CAACD,uBAAuB"}
+{"version":3,"file":"LocalizedStrings.js","names":["LOCALIZED_STRINGS","loading","filterHierarchyLevel","filterHierarchyLevelActiveDescription","clearHierarchyLevelFilter","noFilteredChildren","noFilteredChildrenChangeFilter","failedToCreateHierarchy","failedToCreateRootHierarchy","resultLimitExceeded","rootResultLimitExceeded","issuesForTree","issuesFound","noIssuesFound","increaseHierarchyLimit","increaseHierarchyLimitToUnlimited","increaseHierarchyLimitWithFiltering","retry","rename","more","confirm","cancel","newLabel","other","unspecified","AddPrefix","TPrefix","TPath","ObjectKeys","Acc","TObject","K","LocalizationKey","LOCALIZATION_NAMESPACE","LOCALIZATION_NAMESPACES"],"sources":["../../../src/presentation-hierarchies-react/internal/LocalizedStrings.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\n/**\n * Localized strings used in the components.\n *\n * The version suffix in `LOCALIZATION_NAMESPACE` should be bumped when making changes to this object:\n * - minor bump when new strings are added or exists string values are changed,\n * - major bump when a string is removed.\n *\n * @internal\n */\nexport const LOCALIZED_STRINGS = {\n  /**\n   * Message displayed when nodes are loading.\n   * Default value: `Loading...`.\n   */\n  loading: \"Loading...\",\n  /**\n   * Title for apply hierarchy filter button.\n   * Default value: `Apply filter`.\n   */\n  filterHierarchyLevel: \"Apply filter\",\n  /**\n   * Accessible description for applied hierarchy filter button.\n   * Default value: `Filter is applied`.\n   */\n  filterHierarchyLevelActiveDescription: \"Filter is applied\",\n  /**\n   * Title for clear hierarchy filter button.\n   * Default value: `Clear active filter`.\n   */\n  clearHierarchyLevelFilter: \"Clear active filter\",\n  /**\n   * Message displayed when no nodes matching filter are found.\n   * Default value: `No matches for current filter for {{node}}.`.\n   */\n  noFilteredChildren: \"No matches for current filter for {{node}}.\",\n  /**\n   * Label for change filter action.\n   * Default value: `Change filter`.\n   */\n  noFilteredChildrenChangeFilter: \"Change filter\",\n  /**\n   * Message displayed when hierarchy creation for a node failed.\n   * Default value: `Failed to create hierarchy for {{node}}.`.\n   */\n  failedToCreateHierarchy: \"Failed to create hierarchy for {{node}}.\",\n  /**\n   * Message displayed when hierarchy creation for a node failed.\n   * Default value: `Failed to load tree.`.\n   */\n  failedToCreateRootHierarchy: \"Failed to load tree.\",\n  /**\n   * Message displayed when result limit exceeds hierarchy size limit.\n   * Default value: `The hierarchy for {{node}} contains {{limit}}+ items. Try using filters or increase the limit.`.\n   */\n  resultLimitExceeded: \"The hierarchy for {{node}} contains {{limit}}+ items. Try using filters or increase the limit.\",\n  /**\n   * Message displayed when result limit exceeds hierarchy size limit.\n   * Default value: `The root item hierarchy contains {{limit}}+ items. Try increasing the limit.`.\n   */\n  rootResultLimitExceeded: \"The root item hierarchy contains {{limit}}+ items. Try increasing the limit.\",\n  /**\n   * Name for the error region landmark.\n   * Default value: `Issues for {{tree_label}}.`.\n   */\n  issuesForTree: \"Issues for {{tree_label}}.\",\n  /**\n   * Label displayed on the error region, when errors are detected.\n   * Default value: `{{number_of_issues}} issue(s) found.`.\n   */\n  issuesFound: \"{{number_of_issues}} issue(s) found.\",\n  /**\n   * Label displayed on the error region, when no issues are found.\n   * Default value: `No issues found.`.\n   */\n  noIssuesFound: \"No issues found.\",\n  /**\n   * Message displayed when hierarchy size limit can be overridden.\n   * Default value: `Increase limit to {{limit}}`.\n   */\n  increaseHierarchyLimit: \"Increase limit to {{limit}}\",\n  /**\n   * Message displayed when hierarchy size limit can be overridden.\n   * Default value: `Remove limit`.\n   */\n  increaseHierarchyLimitToUnlimited: \"Remove limit\",\n  /**\n   * Message displayed when hierarchy size limit can be overridden and hierarchy filtering is enabled.\n   * Default value: `Add Filter`.\n   */\n  increaseHierarchyLimitWithFiltering: \"Add Filter\",\n  /**\n   * Label for retry action.\n   * Default value: `Retry`.\n   */\n  retry: \"Retry\",\n  /**\n   * Label for rename action.\n   * Default value: `Rename`.\n   */\n  rename: \"Rename\",\n  /**\n   * Label for more actions button.\n   * Default value: `More`.\n   */\n  more: \"More\",\n  /**\n   * Label for confirm button.\n   * Default value: `Confirm`.\n   */\n  confirm: \"Confirm\",\n  /**\n   * Label for cancel button.\n   * Default value: `Cancel`.\n   */\n  cancel: \"Cancel\",\n  /**\n   * Label for tree node rename input.\n   * Default value: `New label`.\n   */\n  newLabel: \"New label\",\n  /**\n   * A string for \"Other\". Used for label of a range property grouping node that\n   * groups values which don't fit into any other range.\n   */\n  other: \"Other\",\n  /**\n   * A string for \"Unspecified\". Used for labels of property grouping nodes\n   * that group by an empty value.\n   */\n  unspecified: \"Unspecified\",\n};\n\ntype AddPrefix<TPrefix extends string, TPath extends string> = [TPrefix] extends [never]\n  ? `${TPath}`\n  : `${TPrefix}.${TPath}`;\n\n/**\n * Utility type that extracts all possible keys from a nested object as dot-separated strings\n *\n * Example:\n *\n * ```ts\n * type Example = {\n *   a: {\n *     b: string;\n *     c: number;\n *   };\n *   d: boolean;\n * }\n * // ExampleKeys will be \"a.b\" | \"a.c\" | \"d\"\n * type ExampleKeys = ObjectKeys<Example>\n * ```\n */\ntype ObjectKeys<TObject extends object, Acc extends string = never> =\n  | Acc\n  | {\n      [K in keyof TObject & string]: TObject[K] extends object\n        ? ObjectKeys<TObject[K], AddPrefix<Acc, K>>\n        : AddPrefix<Acc, K>;\n    }[keyof TObject & string];\n\n/**\n * Type representing all possible localization keys\n * @internal\n */\nexport type LocalizationKey = ObjectKeys<typeof LOCALIZED_STRINGS>;\n\n/** @internal */\nexport const LOCALIZATION_NAMESPACE = \"PresentationHierarchies_1.0\";\n\n/**\n * Namespaces used for localization of presentation hierarchies components.\n * @alpha\n */\nexport const LOCALIZATION_NAMESPACES = [LOCALIZATION_NAMESPACE];\n"],"mappings":";;AA6KA,MAAaiC,yBAAyB;;;;;AAMtC,MAAaC,0BAA0B,CAACD,sBAAsB"}

package/lib/presentation-hierarchies-react/internal/TreeActions.js

@@ -9,6 +9,10 @@ import { EMPTY, Subject, buffer, debounceTime, groupBy, map, mergeMap, reduce, s
 enableMapSet();
 /** @internal */
 var TreeActions = class {
+	_onModelChanged;
+	_onLoad;
+	_onHierarchyLimitExceeded;
+	_onHierarchyLoadError;
 	_loader;
 	_nodeIdFactory;
 	_currentModel;
@@ -267,6 +271,7 @@ var NoopTreeLoader = class {
 	}
 };
 var TimeTracker = class {
+	_onFinish;
 	_start;
 	_stopped = false;
 	constructor(_onFinish) {

package/lib/presentation-hierarchies-react/internal/TreeActions.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeActions.js","names":["enableMapSet","produce","buffer","debounceTime","EMPTY","groupBy","map","mergeMap","reduce","Subject","switchMap","takeUntil","tap","HierarchyNode","TreeLoader","TreeModel","createNodeId","sameNodes","Draft","Observable","GenericInstanceFilter","HierarchyProvider","ErrorInfo","SelectionChangeType","HierarchyLevelOptions","ITreeLoader","LoadedTreePart","LoadNodesOptions","TreeModelHierarchyNode","TreeModelRootNode","LoadDebouncedNodesOptions","loadOptions","onComplete","timeTracker","TimeTracker","initialRootNode","parentId","discardState","TreeActions","_loader","_nodeIdFactory","node","Pick","_currentModel","_reset","_nodeLoader","constructor","_onModelChanged","model","_onLoad","actionType","duration","_onHierarchyLimitExceeded","props","filter","limit","_onHierarchyLoadError","type","error","nodeIdFactory","seed","NoopTreeLoader","idToNode","Map","parentChildMap","rootNode","id","undefined","nodeData","createNodeLoader","subject","pipe","item","group","groupArr","returnIndex","length","forEach","member","index","Symbol","dispose","loadNodes","collectTreePartsUntil","next","newModel","parentNode","get","handleLoadedHierarchy","finish","complete","onLoadingComplete","subscribe","updateTreeModel","updater","loadedHierarchy","addHierarchyPart","setIsLoading","getLoadAction","size","loadSubTree","options","loadAction","parent","time","Promise","resolve","ignoreCache","getHierarchyLevelOptions","createHierarchyLevelOptions","getNonGroupedParentId","shouldLoadChildren","autoExpand","reloadSubTree","oldModel","currModel","expandedNodes","collectNodes","isExpanded","collapsedNodes","instanceFilter","hierarchyLevelSizeLimit","filteredNodeId","findIndex","expandedNode","collapsedNode","buildNode","addAttributes","getNode","reset","setHierarchyProvider","provider","Number","MAX_SAFE_INTEGER","nodeId","selectNodes","nodeIds","Array","changeType","expandNode","childrenAction","ReturnType","setHierarchyLimit","loadChildren","setInstanceFilter","reloadTree","parentNodeId","state","removeSubTree","untilNotifier","source","treeModel","loadedPart","addTreePartToModel","addNodesToModel","addErrorToModel","set","loadedNodes","oldNode","hierarchyLimit","isSelected","pred","currentChildren","flatMap","child","currNode","isGroupingNode","nonGroupingAncestor","modelNode","_start","_stopped","_onFinish","Date","now","elapsedTime"],"sources":["../../../src/presentation-hierarchies-react/internal/TreeActions.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport \"./DisposePolyfill.js\";\n\nimport { enableMapSet, produce } from \"immer\";\nimport { buffer, debounceTime, EMPTY, groupBy, map, mergeMap, reduce, Subject, switchMap, takeUntil, tap } from \"rxjs\";\nimport { HierarchyNode } from \"@itwin/presentation-hierarchies\";\nimport { TreeLoader } from \"./TreeLoader.js\";\nimport { TreeModel } from \"./TreeModel.js\";\nimport { createNodeId, sameNodes } from \"./Utils.js\";\n\nimport type { Draft } from \"immer\";\nimport type { Observable } from \"rxjs\";\nimport type { GenericInstanceFilter, HierarchyProvider } from \"@itwin/presentation-hierarchies\";\nimport type { ErrorInfo } from \"../TreeNode.js\";\nimport type { SelectionChangeType } from \"../UseSelectionHandler.js\";\nimport type { HierarchyLevelOptions, ITreeLoader, LoadedTreePart, LoadNodesOptions } from \"./TreeLoader.js\";\nimport type { TreeModelHierarchyNode, TreeModelRootNode } from \"./TreeModel.js\";\n\nenableMapSet();\n\ninterface LoadDebouncedNodesOptions {\n  loadOptions: LoadNodesOptions;\n  onComplete: () => void;\n  timeTracker?: TimeTracker;\n  initialRootNode?: TreeModelRootNode;\n  parentId?: string;\n  discardState?: boolean;\n}\n\n/** @internal */\nexport class TreeActions {\n  private _loader: ITreeLoader;\n  private _nodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string;\n  private _currentModel: TreeModel;\n  private _reset = new Subject<void>();\n  private _nodeLoader: Subject<LoadDebouncedNodesOptions>;\n\n  constructor(\n    private _onModelChanged: (model: TreeModel) => void,\n    private _onLoad: (actionType: \"initial-load\" | \"hierarchy-level-load\" | \"reload\", duration: number) => void,\n    private _onHierarchyLimitExceeded: (props: {\n      parentId?: string;\n      filter?: GenericInstanceFilter;\n      limit?: number | \"unbounded\";\n    }) => void,\n    private _onHierarchyLoadError: (props: { parentId?: string; type: \"timeout\" | \"unknown\"; error: unknown }) => void,\n    nodeIdFactory?: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string,\n    seed?: TreeModel,\n  ) {\n    this._loader = new NoopTreeLoader();\n    this._nodeIdFactory = nodeIdFactory ?? createNodeId;\n    this._currentModel = seed ?? {\n      idToNode: new Map(),\n      parentChildMap: new Map(),\n      rootNode: { id: undefined, nodeData: undefined },\n    };\n\n    this._nodeLoader = this.createNodeLoader();\n  }\n\n  private createNodeLoader() {\n    const subject = new Subject<LoadDebouncedNodesOptions>();\n    subject\n      .pipe(\n        groupBy((item) => item.parentId),\n        mergeMap((group) =>\n          group.pipe(\n            buffer(group.pipe(debounceTime(0))),\n            map((groupArr) => {\n              let returnIndex = groupArr.length - 1;\n\n              groupArr.forEach((member, index) => {\n                if (member.discardState) {\n                  returnIndex = index;\n                }\n              });\n\n              groupArr.forEach((member, index) => {\n                if (index === returnIndex) {\n                  return;\n                }\n                member.timeTracker?.[Symbol.dispose];\n                member.onComplete();\n              });\n              return groupArr[returnIndex];\n            }),\n            switchMap((props) =>\n              this._loader.loadNodes(props.loadOptions).pipe(\n                collectTreePartsUntil(this._reset, props.initialRootNode),\n                tap({\n                  next: (newModel: TreeModel) => {\n                    const parentNode = props.parentId ? newModel.idToNode.get(props.parentId) : newModel.rootNode;\n                    this.handleLoadedHierarchy(props.parentId, newModel);\n                    // only report load duration if children were loaded\n                    if (!(parentNode && parentNode.error)) {\n                      props.timeTracker?.finish();\n                    }\n                  },\n                  complete: () => {\n                    this.onLoadingComplete(props.parentId);\n                    props.timeTracker?.[Symbol.dispose]();\n                    props.onComplete();\n                  },\n                }),\n              ),\n            ),\n          ),\n        ),\n      )\n      .subscribe();\n\n    return subject;\n  }\n\n  private updateTreeModel(updater: (model: Draft<TreeModel>) => void) {\n    const newModel = produce(this._currentModel, updater);\n    if (this._currentModel === newModel) {\n      return;\n    }\n\n    this._currentModel = newModel;\n    this._onModelChanged(this._currentModel);\n  }\n\n  private handleLoadedHierarchy(parentId: string | undefined, loadedHierarchy: TreeModel) {\n    this.updateTreeModel((model) => {\n      TreeModel.addHierarchyPart(model, parentId, loadedHierarchy);\n    });\n  }\n\n  private onLoadingComplete(parentId: string | undefined) {\n    this.updateTreeModel((model) => {\n      TreeModel.setIsLoading(model, parentId, false);\n    });\n  }\n\n  private getLoadAction(parentId: string | undefined) {\n    return this._currentModel.idToNode.size === 0\n      ? \"initial-load\"\n      : parentId === undefined\n        ? \"reload\"\n        : \"hierarchy-level-load\";\n  }\n\n  private loadSubTree(options: LoadNodesOptions, initialRootNode?: TreeModelRootNode, discardState?: boolean) {\n    const loadAction = this.getLoadAction(options.parent.id);\n    const timeTracker = new TimeTracker((time) => this._onLoad(loadAction, time));\n\n    return {\n      complete: new Promise<void>((resolve) => {\n        this._nodeLoader.next({\n          loadOptions: options,\n          onComplete: resolve,\n          timeTracker,\n          parentId: options.parent.id,\n          initialRootNode,\n          discardState,\n        });\n      }),\n    };\n  }\n\n  private loadNodes(parentId: string, ignoreCache?: boolean) {\n    const parentNode = this._currentModel.idToNode.get(parentId);\n    if (!parentNode) {\n      return { complete: Promise.resolve() };\n    }\n    return this.loadSubTree({\n      parent: parentNode,\n      getHierarchyLevelOptions: (node) =>\n        createHierarchyLevelOptions(this._currentModel, getNonGroupedParentId(node, this._nodeIdFactory)),\n      shouldLoadChildren: (node) => !!node.nodeData.autoExpand,\n      ignoreCache,\n    });\n  }\n\n  private reloadSubTree(\n    parentId: string | undefined,\n    oldModel: TreeModel,\n    options?: { discardState?: boolean; ignoreCache?: boolean },\n  ) {\n    const currModel = this._currentModel;\n    const expandedNodes = !!options?.discardState\n      ? []\n      : collectNodes(parentId, oldModel, (node) => node.isExpanded === true);\n    const collapsedNodes = !!options?.discardState\n      ? []\n      : collectNodes(parentId, oldModel, (node) => node.isExpanded === false);\n    const getHierarchyLevelOptions = (node: TreeModelRootNode | TreeModelHierarchyNode) => {\n      if (!!options?.discardState) {\n        return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };\n      }\n      const filteredNodeId = getNonGroupedParentId(node, this._nodeIdFactory);\n      return createHierarchyLevelOptions(filteredNodeId === parentId ? currModel : oldModel, filteredNodeId);\n    };\n    const shouldLoadChildren = (node: TreeModelHierarchyNode) => {\n      if (expandedNodes.findIndex((expandedNode) => sameNodes(expandedNode.nodeData, node.nodeData)) !== -1) {\n        return true;\n      }\n      if (collapsedNodes.findIndex((collapsedNode) => sameNodes(collapsedNode.nodeData, node.nodeData)) !== -1) {\n        return false;\n      }\n      return !!node.nodeData.autoExpand;\n    };\n    const buildNode = (node: TreeModelHierarchyNode) =>\n      !!options?.discardState || node.id === parentId ? node : addAttributes(node, oldModel);\n\n    const rootNode = parentId !== undefined ? this.getNode(parentId) : currModel.rootNode;\n    if (!rootNode) {\n      return { complete: Promise.resolve() };\n    }\n\n    if (parentId === undefined) {\n      // cancel all ongoing requests\n      this._reset.next();\n    }\n\n    return this.loadSubTree(\n      { parent: rootNode, getHierarchyLevelOptions, shouldLoadChildren, buildNode, ignoreCache: options?.ignoreCache },\n      !!options?.discardState ? undefined : { ...currModel.rootNode },\n      options?.discardState,\n    );\n  }\n\n  public reset() {\n    this._reset.next();\n  }\n\n  public setHierarchyProvider(provider?: HierarchyProvider) {\n    this._loader = provider\n      ? new TreeLoader(\n          provider,\n          this._onHierarchyLimitExceeded,\n          ({ parentId, type, error }) => {\n            if (type === \"timeout\") {\n              const loadAction = this.getLoadAction(parentId);\n              this._onLoad(loadAction, Number.MAX_SAFE_INTEGER);\n            }\n            this._onHierarchyLoadError({ parentId, type, error });\n          },\n          this._nodeIdFactory,\n        )\n      : new NoopTreeLoader();\n  }\n\n  public getNode(nodeId: string | undefined): TreeModelHierarchyNode | TreeModelRootNode | undefined {\n    return TreeModel.getNode(this._currentModel, nodeId);\n  }\n\n  public selectNodes(nodeIds: Array<string>, changeType: SelectionChangeType) {\n    this.updateTreeModel((model) => {\n      TreeModel.selectNodes(model, nodeIds, changeType);\n    });\n  }\n\n  public expandNode(nodeId: string, isExpanded: boolean) {\n    let childrenAction = \"none\" as ReturnType<typeof TreeModel.expandNode>;\n    this.updateTreeModel((model) => {\n      childrenAction = TreeModel.expandNode(model, nodeId, isExpanded);\n    });\n\n    if (childrenAction === \"none\") {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.loadNodes(nodeId, childrenAction === \"reloadChildren\");\n  }\n\n  public setHierarchyLimit(nodeId: string | undefined, limit?: number | \"unbounded\") {\n    const oldModel = this._currentModel;\n    let loadChildren = false as boolean;\n    this.updateTreeModel((model) => {\n      loadChildren = TreeModel.setHierarchyLimit(model, nodeId, limit);\n    });\n\n    if (!loadChildren) {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.reloadSubTree(nodeId, oldModel);\n  }\n\n  public setInstanceFilter(nodeId: string | undefined, filter?: GenericInstanceFilter) {\n    const oldModel = this._currentModel;\n    let loadChildren = false as boolean;\n    this.updateTreeModel((model) => {\n      loadChildren = TreeModel.setInstanceFilter(model, nodeId, filter);\n    });\n\n    if (!loadChildren) {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.reloadSubTree(nodeId, oldModel);\n  }\n\n  public reloadTree(options?: { parentNodeId?: string; state?: \"keep\" | \"discard\" | \"reset\" }) {\n    const oldModel = this._currentModel;\n    this.updateTreeModel((model) => {\n      TreeModel.setIsLoading(model, options?.parentNodeId, true);\n      if (options?.state === \"reset\") {\n        TreeModel.removeSubTree(model, options.parentNodeId);\n      }\n    });\n\n    const discardState = options?.state === \"discard\" || options?.state === \"reset\";\n    const ignoreCache = options?.state === \"reset\";\n    return this.reloadSubTree(options?.parentNodeId, oldModel, { discardState, ignoreCache });\n  }\n}\n\nfunction collectTreePartsUntil(untilNotifier: Observable<void>, rootNode?: TreeModelRootNode) {\n  return (source: Observable<LoadedTreePart>) =>\n    source.pipe(\n      reduce<LoadedTreePart, TreeModel>(\n        (treeModel, loadedPart) => {\n          addTreePartToModel(treeModel, loadedPart);\n          return treeModel;\n        },\n        {\n          idToNode: new Map(),\n          parentChildMap: new Map(),\n          rootNode: rootNode ?? { id: undefined, nodeData: undefined },\n        },\n      ),\n      takeUntil(untilNotifier),\n    );\n}\n\nfunction addTreePartToModel(treeModel: TreeModel, loadedPart: LoadedTreePart) {\n  if (\"loadedNodes\" in loadedPart) {\n    addNodesToModel(treeModel, loadedPart);\n  } else {\n    addErrorToModel(treeModel, loadedPart);\n  }\n}\n\nfunction addErrorToModel(\n  model: TreeModel,\n  loadedPart: { parent: TreeModelHierarchyNode | TreeModelRootNode; error: ErrorInfo },\n) {\n  if (loadedPart.parent.id === undefined) {\n    model.rootNode.error = loadedPart.error;\n  } else {\n    model.idToNode.set(loadedPart.parent.id, { ...loadedPart.parent, error: loadedPart.error });\n  }\n}\n\nfunction addNodesToModel(\n  model: TreeModel,\n  loadedPart: { parent: TreeModelHierarchyNode | TreeModelRootNode; loadedNodes: TreeModelHierarchyNode[] },\n) {\n  model.parentChildMap.set(\n    loadedPart.parent.id,\n    loadedPart.loadedNodes.map((node) => node.id),\n  );\n  for (const node of loadedPart.loadedNodes) {\n    model.idToNode.set(node.id, node);\n  }\n  const parentNode = loadedPart.parent.id ? model.idToNode.get(loadedPart.parent.id) : undefined;\n  if (parentNode && loadedPart.loadedNodes.length !== 0) {\n    parentNode.isExpanded = true;\n  }\n}\n\nfunction addAttributes(node: TreeModelHierarchyNode, oldModel: TreeModel) {\n  const oldNode = oldModel.idToNode.get(node.id);\n  if (oldNode) {\n    node.hierarchyLimit = oldNode.hierarchyLimit;\n    node.instanceFilter = oldNode.instanceFilter;\n    node.isSelected = oldNode.isSelected;\n  }\n  return node;\n}\n\nfunction collectNodes(\n  parentId: string | undefined,\n  model: TreeModel,\n  pred: (node: TreeModelHierarchyNode) => boolean,\n): TreeModelHierarchyNode[] {\n  const currentChildren = model.parentChildMap.get(parentId);\n  if (!currentChildren) {\n    return [];\n  }\n\n  if (parentId === undefined) {\n    return currentChildren.flatMap((child) => collectNodes(child, model, pred));\n  }\n\n  const currNode = model.idToNode.get(parentId);\n  if (!currNode || !pred(currNode)) {\n    return [];\n  }\n\n  return [currNode, ...currentChildren.flatMap((child) => collectNodes(child, model, pred))];\n}\n\nfunction getNonGroupedParentId(\n  node: TreeModelHierarchyNode | TreeModelRootNode,\n  nodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string,\n) {\n  if (!node.nodeData || !HierarchyNode.isGroupingNode(node.nodeData)) {\n    return node.id;\n  }\n\n  if (!node.nodeData.nonGroupingAncestor) {\n    return undefined;\n  }\n\n  return nodeIdFactory(node.nodeData.nonGroupingAncestor);\n}\n\nfunction createHierarchyLevelOptions(model: TreeModel, nodeId: string | undefined): HierarchyLevelOptions {\n  if (nodeId === undefined) {\n    return { instanceFilter: model.rootNode.instanceFilter, hierarchyLevelSizeLimit: model.rootNode.hierarchyLimit };\n  }\n\n  const modelNode = model.idToNode.get(nodeId);\n  if (!modelNode) {\n    return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };\n  }\n  return { instanceFilter: modelNode.instanceFilter, hierarchyLevelSizeLimit: modelNode.hierarchyLimit };\n}\n\nclass NoopTreeLoader implements ITreeLoader {\n  public loadNodes(): Observable<LoadedTreePart> {\n    return EMPTY;\n  }\n}\n\nclass TimeTracker {\n  private _start: number;\n  private _stopped: boolean = false;\n\n  constructor(private _onFinish: (time: number) => void) {\n    this._start = Date.now();\n  }\n\n  public [Symbol.dispose]() {\n    this._stopped = true;\n  }\n\n  public finish() {\n    if (this._stopped) {\n      return;\n    }\n\n    this._stopped = true;\n    const elapsedTime = Date.now() - this._start;\n    this._onFinish(elapsedTime);\n  }\n}\n"],"mappings":";;;;;;;;AAsBAA,cAAc;;AAYd,IAAasC,cAAb,MAAyB;CACvB;CACA;CACA;CACA,SAAiB,IAAI7B,SAAe;CACpC;CAEAqC,YACE,iBACA,SACA,2BAKA,uBACAa,eACAC,MACA;AAVQb,OAAAA,kBAAAA;AACAE,OAAAA,UAAAA;AACAG,OAAAA,4BAAAA;AAKAI,OAAAA,wBAAAA;AAIR,OAAKjB,UAAU,IAAIsB,gBAAgB;AACnC,OAAKrB,iBAAiBmB,iBAAiB3C;AACvC,OAAK2B,gBAAgBiB,QAAQ;GAC3BE,0BAAU,IAAIC,KAAK;GACnBC,gCAAgB,IAAID,KAAK;GACzBE,UAAU;IAAEC,IAAIC,KAAAA;IAAWC,UAAUD,KAAAA;IAAU;GAChD;AAED,OAAKtB,cAAc,KAAKwB,kBAAkB;;CAG5C,mBAA2B;EACzB,MAAMC,UAAU,IAAI7D,SAAoC;AACxD6D,UACGC,KACClE,SAASmE,SAASA,KAAKpC,SAAS,EAChC7B,UAAUkE,UACRA,MAAMF,KACJrE,OAAOuE,MAAMF,KAAKpE,aAAa,EAAE,CAAC,CAAC,EACnCG,KAAKoE,aAAa;GAChB,IAAIC,cAAcD,SAASE,SAAS;AAEpCF,YAASG,SAASC,QAAQC,UAAU;AAClC,QAAID,OAAOzC,aACTsC,eAAcI;KAEhB;AAEFL,YAASG,SAASC,QAAQC,UAAU;AAClC,QAAIA,UAAUJ,YACZ;AAEFG,WAAO7C,cAAc+C,OAAOC;AAC5BH,WAAO9C,YAAY;KACnB;AACF,UAAO0C,SAASC;IAChB,EACFjE,WAAW2C,UACT,KAAKd,QAAQ2C,UAAU7B,MAAMtB,YAAY,CAACwC,KACxCY,sBAAsB,KAAKvC,QAAQS,MAAMlB,gBAAgB,EACzDvB,IAAI;GACFwE,OAAOC,aAAwB;IAC7B,MAAMC,aAAajC,MAAMjB,WAAWiD,SAASvB,SAASyB,IAAIlC,MAAMjB,SAAS,GAAGiD,SAASpB;AACrF,SAAKuB,sBAAsBnC,MAAMjB,UAAUiD,SAAS;AAEpD,QAAI,EAAEC,cAAcA,WAAW5B,OAC7BL,OAAMpB,aAAawD,QAAQ;;GAG/BC,gBAAgB;AACd,SAAKC,kBAAkBtC,MAAMjB,SAAS;AACtCiB,UAAMpB,cAAc+C,OAAOC,UAAU;AACrC5B,UAAMrB,YAAY;;GAErB,CACH,CACF,CACF,CACF,CACF,CAAC,CACA4D,WAAW;AAEd,SAAOtB;;CAGT,gBAAwBwB,SAA4C;EAClE,MAAMT,WAAWpF,QAAQ,KAAK0C,eAAemD,QAAQ;AACrD,MAAI,KAAKnD,kBAAkB0C,SACzB;AAGF,OAAK1C,gBAAgB0C;AACrB,OAAKtC,gBAAgB,KAAKJ,cAAc;;CAG1C,sBAA8BP,UAA8B2D,iBAA4B;AACtF,OAAKF,iBAAiB7C,UAAU;AAC9BjC,aAAUiF,iBAAiBhD,OAAOZ,UAAU2D,gBAAgB;IAC5D;;CAGJ,kBAA0B3D,UAA8B;AACtD,OAAKyD,iBAAiB7C,UAAU;AAC9BjC,aAAUkF,aAAajD,OAAOZ,UAAU,MAAM;IAC9C;;CAGJ,cAAsBA,UAA8B;AAClD,SAAO,KAAKO,cAAcmB,SAASqC,SAAS,IACxC,iBACA/D,aAAa+B,KAAAA,IACX,WACA;;CAGR,YAAoBkC,SAA2BlE,iBAAqCE,cAAwB;EAC1G,MAAMiE,aAAa,KAAKJ,cAAcG,QAAQE,OAAOrC,GAAG;EACxD,MAAMjC,cAAc,IAAIC,aAAasE,SAAS,KAAKvD,QAAQqD,YAAYE,KAAK,CAAC;AAE7E,SAAO,EACLd,UAAU,IAAIe,SAAeC,YAAY;AACvC,QAAK7D,YAAYuC,KAAK;IACpBrD,aAAasE;IACbrE,YAAY0E;IACZzE;IACAG,UAAUiE,QAAQE,OAAOrC;IACzB/B;IACAE;IACD,CAAC;IACH,EACF;;CAGH,UAAkBD,UAAkBuE,aAAuB;EACzD,MAAMrB,aAAa,KAAK3C,cAAcmB,SAASyB,IAAInD,SAAS;AAC5D,MAAI,CAACkD,WACH,QAAO,EAAEI,UAAUe,QAAQC,SAAQ,EAAG;AAExC,SAAO,KAAKN,YAAY;GACtBG,QAAQjB;GACRsB,2BAA2BnE,SACzBoE,4BAA4B,KAAKlE,eAAemE,sBAAsBrE,MAAM,KAAKD,eAAe,CAAC;GACnGuE,qBAAqBtE,SAAS,CAAC,CAACA,KAAK2B,SAAS4C;GAC9CL;GACD,CAAC;;CAGJ,cACEvE,UACA8E,UACAb,SACA;EACA,MAAMc,YAAY,KAAKxE;EACvB,MAAMyE,gBAAgB,CAAC,CAACf,SAAShE,eAC7B,EAAE,GACFgF,aAAajF,UAAU8E,WAAWzE,SAASA,KAAK6E,eAAe,KAAK;EACxE,MAAMC,iBAAiB,CAAC,CAAClB,SAAShE,eAC9B,EAAE,GACFgF,aAAajF,UAAU8E,WAAWzE,SAASA,KAAK6E,eAAe,MAAM;EACzE,MAAMV,4BAA4BnE,SAAqD;AACrF,OAAI,CAAC,CAAC4D,SAAShE,aACb,QAAO;IAAEmF,gBAAgBrD,KAAAA;IAAWsD,yBAAyBtD,KAAAA;IAAW;GAE1E,MAAMuD,iBAAiBZ,sBAAsBrE,MAAM,KAAKD,eAAe;AACvE,UAAOqE,4BAA4Ba,mBAAmBtF,WAAW+E,YAAYD,UAAUQ,eAAe;;EAExG,MAAMX,sBAAsBtE,SAAiC;AAC3D,OAAI2E,cAAcO,WAAWC,iBAAiB3G,UAAU2G,aAAaxD,UAAU3B,KAAK2B,SAAS,CAAC,KAAK,GACjG,QAAO;AAET,OAAImD,eAAeI,WAAWE,kBAAkB5G,UAAU4G,cAAczD,UAAU3B,KAAK2B,SAAS,CAAC,KAAK,GACpG,QAAO;AAET,UAAO,CAAC,CAAC3B,KAAK2B,SAAS4C;;EAEzB,MAAMc,aAAarF,SACjB,CAAC,CAAC4D,SAAShE,gBAAgBI,KAAKyB,OAAO9B,WAAWK,OAAOsF,cAActF,MAAMyE,SAAS;EAExF,MAAMjD,WAAW7B,aAAa+B,KAAAA,IAAY,KAAK6D,QAAQ5F,SAAS,GAAG+E,UAAUlD;AAC7E,MAAI,CAACA,SACH,QAAO,EAAEyB,UAAUe,QAAQC,SAAQ,EAAG;AAGxC,MAAItE,aAAa+B,KAAAA,EAEf,MAAKvB,OAAOwC,MAAM;AAGpB,SAAO,KAAKgB,YACV;GAAEG,QAAQtC;GAAU2C;GAA0BG;GAAoBe;GAAWnB,aAAaN,SAASM;GAAa,EAChH,CAAC,CAACN,SAAShE,eAAe8B,KAAAA,IAAY,EAAE,GAAGgD,UAAUlD,UAAU,EAC/DoC,SAAShE,aACV;;CAGH,QAAe;AACb,OAAKO,OAAOwC,MAAM;;CAGpB,qBAA4B+C,UAA8B;AACxD,OAAK5F,UAAU4F,WACX,IAAIrH,WACFqH,UACA,KAAK/E,4BACJ,EAAEhB,UAAUqB,MAAMC,YAAY;AAC7B,OAAID,SAAS,WAAW;IACtB,MAAM6C,aAAa,KAAKJ,cAAc9D,SAAS;AAC/C,SAAKa,QAAQqD,YAAY8B,OAAOC,iBAAiB;;AAEnD,QAAK7E,sBAAsB;IAAEpB;IAAUqB;IAAMC;IAAO,CAAC;KAEvD,KAAKlB,eACN,GACD,IAAIqB,gBAAgB;;CAG1B,QAAeyE,QAAoF;AACjG,SAAOvH,UAAUiH,QAAQ,KAAKrF,eAAe2F,OAAO;;CAGtD,YAAmBE,SAAwBE,YAAiC;AAC1E,OAAK7C,iBAAiB7C,UAAU;AAC9BjC,aAAUwH,YAAYvF,OAAOwF,SAASE,WAAW;IACjD;;CAGJ,WAAkBJ,QAAgBhB,YAAqB;EACrD,IAAIsB,iBAAiB;AACrB,OAAK/C,iBAAiB7C,UAAU;AAC9B4F,oBAAiB7H,UAAU4H,WAAW3F,OAAOsF,QAAQhB,WAAW;IAChE;AAEF,MAAIsB,mBAAmB,OACrB,QAAO,EAAElD,UAAUe,QAAQC,SAAQ,EAAG;AAGxC,SAAO,KAAKxB,UAAUoD,QAAQM,mBAAmB,iBAAiB;;CAGpE,kBAAyBN,QAA4B/E,OAA8B;EACjF,MAAM2D,WAAW,KAAKvE;EACtB,IAAIoG,eAAe;AACnB,OAAKlD,iBAAiB7C,UAAU;AAC9B+F,kBAAehI,UAAU+H,kBAAkB9F,OAAOsF,QAAQ/E,MAAM;IAChE;AAEF,MAAI,CAACwF,aACH,QAAO,EAAErD,UAAUe,QAAQC,SAAQ,EAAG;AAGxC,SAAO,KAAKO,cAAcqB,QAAQpB,SAAS;;CAG7C,kBAAyBoB,QAA4BhF,QAAgC;EACnF,MAAM4D,WAAW,KAAKvE;EACtB,IAAIoG,eAAe;AACnB,OAAKlD,iBAAiB7C,UAAU;AAC9B+F,kBAAehI,UAAUiI,kBAAkBhG,OAAOsF,QAAQhF,OAAO;IACjE;AAEF,MAAI,CAACyF,aACH,QAAO,EAAErD,UAAUe,QAAQC,SAAQ,EAAG;AAGxC,SAAO,KAAKO,cAAcqB,QAAQpB,SAAS;;CAG7C,WAAkBb,SAA2E;EAC3F,MAAMa,WAAW,KAAKvE;AACtB,OAAKkD,iBAAiB7C,UAAU;AAC9BjC,aAAUkF,aAAajD,OAAOqD,SAAS6C,cAAc,KAAK;AAC1D,OAAI7C,SAAS8C,UAAU,QACrBpI,WAAUqI,cAAcpG,OAAOqD,QAAQ6C,aAAa;IAEtD;EAEF,MAAM7G,eAAegE,SAAS8C,UAAU,aAAa9C,SAAS8C,UAAU;EACxE,MAAMxC,cAAcN,SAAS8C,UAAU;AACvC,SAAO,KAAKlC,cAAcZ,SAAS6C,cAAchC,UAAU;GAAE7E;GAAcsE;GAAa,CAAC;;;AAI7F,SAASxB,sBAAsBkE,eAAiCpF,UAA8B;AAC5F,SAAQqF,WACNA,OAAO/E,KACL/D,QACG+I,WAAWC,eAAe;AACzBC,qBAAmBF,WAAWC,WAAW;AACzC,SAAOD;IAET;EACEzF,0BAAU,IAAIC,KAAK;EACnBC,gCAAgB,IAAID,KAAK;EACzBE,UAAUA,YAAY;GAAEC,IAAIC,KAAAA;GAAWC,UAAUD,KAAAA;GAAU;EAE/D,CAAC,EACDxD,UAAU0I,cACZ,CAAC;;AAGL,SAASI,mBAAmBF,WAAsBC,YAA4B;AAC5E,KAAI,iBAAiBA,WACnBE,iBAAgBH,WAAWC,WAAW;KAEtCG,iBAAgBJ,WAAWC,WAAW;;AAI1C,SAASG,gBACP3G,OACAwG,YACA;AACA,KAAIA,WAAWjD,OAAOrC,OAAOC,KAAAA,EAC3BnB,OAAMiB,SAASP,QAAQ8F,WAAW9F;KAElCV,OAAMc,SAAS8F,IAAIJ,WAAWjD,OAAOrC,IAAI;EAAE,GAAGsF,WAAWjD;EAAQ7C,OAAO8F,WAAW9F;EAAO,CAAC;;AAI/F,SAASgG,gBACP1G,OACAwG,YACA;AACAxG,OAAMgB,eAAe4F,IACnBJ,WAAWjD,OAAOrC,IAClBsF,WAAWK,YAAYvJ,KAAKmC,SAASA,KAAKyB,GAC5C,CAAC;AACD,MAAK,MAAMzB,QAAQ+G,WAAWK,YAC5B7G,OAAMc,SAAS8F,IAAInH,KAAKyB,IAAIzB,KAAK;CAEnC,MAAM6C,aAAakE,WAAWjD,OAAOrC,KAAKlB,MAAMc,SAASyB,IAAIiE,WAAWjD,OAAOrC,GAAG,GAAGC,KAAAA;AACrF,KAAImB,cAAckE,WAAWK,YAAYjF,WAAW,EAClDU,YAAWgC,aAAa;;AAI5B,SAASS,cAActF,MAA8ByE,UAAqB;CACxE,MAAM4C,UAAU5C,SAASpD,SAASyB,IAAI9C,KAAKyB,GAAG;AAC9C,KAAI4F,SAAS;AACXrH,OAAKsH,iBAAiBD,QAAQC;AAC9BtH,OAAK+E,iBAAiBsC,QAAQtC;AAC9B/E,OAAKuH,aAAaF,QAAQE;;AAE5B,QAAOvH;;AAGT,SAAS4E,aACPjF,UACAY,OACAiH,MAC0B;CAC1B,MAAMC,kBAAkBlH,MAAMgB,eAAeuB,IAAInD,SAAS;AAC1D,KAAI,CAAC8H,gBACH,QAAO,EAAE;AAGX,KAAI9H,aAAa+B,KAAAA,EACf,QAAO+F,gBAAgBC,SAASC,UAAU/C,aAAa+C,OAAOpH,OAAOiH,KAAK,CAAC;CAG7E,MAAMI,WAAWrH,MAAMc,SAASyB,IAAInD,SAAS;AAC7C,KAAI,CAACiI,YAAY,CAACJ,KAAKI,SAAS,CAC9B,QAAO,EAAE;AAGX,QAAO,CAACA,UAAU,GAAGH,gBAAgBC,SAASC,UAAU/C,aAAa+C,OAAOpH,OAAOiH,KAAK,CAAC,CAAC;;AAG5F,SAASnD,sBACPrE,MACAkB,eACA;AACA,KAAI,CAAClB,KAAK2B,YAAY,CAACvD,cAAcyJ,eAAe7H,KAAK2B,SAAS,CAChE,QAAO3B,KAAKyB;AAGd,KAAI,CAACzB,KAAK2B,SAASmG,oBACjB;AAGF,QAAO5G,cAAclB,KAAK2B,SAASmG,oBAAoB;;AAGzD,SAAS1D,4BAA4B7D,OAAkBsF,QAAmD;AACxG,KAAIA,WAAWnE,KAAAA,EACb,QAAO;EAAEqD,gBAAgBxE,MAAMiB,SAASuD;EAAgBC,yBAAyBzE,MAAMiB,SAAS8F;EAAgB;CAGlH,MAAMS,YAAYxH,MAAMc,SAASyB,IAAI+C,OAAO;AAC5C,KAAI,CAACkC,UACH,QAAO;EAAEhD,gBAAgBrD,KAAAA;EAAWsD,yBAAyBtD,KAAAA;EAAW;AAE1E,QAAO;EAAEqD,gBAAgBgD,UAAUhD;EAAgBC,yBAAyB+C,UAAUT;EAAgB;;AAGxG,IAAMlG,iBAAN,MAA4C;CAC1C,YAA+C;AAC7C,SAAOzD;;;AAIX,IAAM8B,cAAN,MAAkB;CAChB;CACA,WAA4B;CAE5BY,YAAY,WAA2C;AAAnC6H,OAAAA,YAAAA;AAClB,OAAKF,SAASG,KAAKC,KAAK;;CAG1B,CAAQ7F,OAAOC,WAAW;AACxB,OAAKyF,WAAW;;CAGlB,SAAgB;AACd,MAAI,KAAKA,SACP;AAGF,OAAKA,WAAW;EAChB,MAAMI,cAAcF,KAAKC,KAAK,GAAG,KAAKJ;AACtC,OAAKE,UAAUG,YAAY"}
+{"version":3,"file":"TreeActions.js","names":["enableMapSet","produce","buffer","debounceTime","EMPTY","groupBy","map","mergeMap","reduce","Subject","switchMap","takeUntil","tap","HierarchyNode","TreeLoader","TreeModel","createNodeId","sameNodes","Draft","Observable","GenericInstanceFilter","HierarchyProvider","ErrorInfo","SelectionChangeType","HierarchyLevelOptions","ITreeLoader","LoadedTreePart","LoadNodesOptions","TreeModelHierarchyNode","TreeModelRootNode","LoadDebouncedNodesOptions","loadOptions","onComplete","timeTracker","TimeTracker","initialRootNode","parentId","discardState","TreeActions","_loader","_nodeIdFactory","node","Pick","_currentModel","_reset","_nodeLoader","constructor","_onModelChanged","model","_onLoad","actionType","duration","_onHierarchyLimitExceeded","props","filter","limit","_onHierarchyLoadError","type","error","nodeIdFactory","seed","NoopTreeLoader","idToNode","Map","parentChildMap","rootNode","id","undefined","nodeData","createNodeLoader","subject","pipe","item","group","groupArr","returnIndex","length","forEach","member","index","Symbol","dispose","loadNodes","collectTreePartsUntil","next","newModel","parentNode","get","handleLoadedHierarchy","finish","complete","onLoadingComplete","subscribe","updateTreeModel","updater","loadedHierarchy","addHierarchyPart","setIsLoading","getLoadAction","size","loadSubTree","options","loadAction","parent","time","Promise","resolve","ignoreCache","getHierarchyLevelOptions","createHierarchyLevelOptions","getNonGroupedParentId","shouldLoadChildren","autoExpand","reloadSubTree","oldModel","currModel","expandedNodes","collectNodes","isExpanded","collapsedNodes","instanceFilter","hierarchyLevelSizeLimit","filteredNodeId","findIndex","expandedNode","collapsedNode","buildNode","addAttributes","getNode","reset","setHierarchyProvider","provider","Number","MAX_SAFE_INTEGER","nodeId","selectNodes","nodeIds","Array","changeType","expandNode","childrenAction","ReturnType","setHierarchyLimit","loadChildren","setInstanceFilter","reloadTree","parentNodeId","state","removeSubTree","untilNotifier","source","treeModel","loadedPart","addTreePartToModel","addNodesToModel","addErrorToModel","set","loadedNodes","oldNode","hierarchyLimit","isSelected","pred","currentChildren","flatMap","child","currNode","isGroupingNode","nonGroupingAncestor","modelNode","_start","_stopped","_onFinish","Date","now","elapsedTime"],"sources":["../../../src/presentation-hierarchies-react/internal/TreeActions.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport \"./DisposePolyfill.js\";\n\nimport { enableMapSet, produce } from \"immer\";\nimport { buffer, debounceTime, EMPTY, groupBy, map, mergeMap, reduce, Subject, switchMap, takeUntil, tap } from \"rxjs\";\nimport { HierarchyNode } from \"@itwin/presentation-hierarchies\";\nimport { TreeLoader } from \"./TreeLoader.js\";\nimport { TreeModel } from \"./TreeModel.js\";\nimport { createNodeId, sameNodes } from \"./Utils.js\";\n\nimport type { Draft } from \"immer\";\nimport type { Observable } from \"rxjs\";\nimport type { GenericInstanceFilter, HierarchyProvider } from \"@itwin/presentation-hierarchies\";\nimport type { ErrorInfo } from \"../TreeNode.js\";\nimport type { SelectionChangeType } from \"../UseSelectionHandler.js\";\nimport type { HierarchyLevelOptions, ITreeLoader, LoadedTreePart, LoadNodesOptions } from \"./TreeLoader.js\";\nimport type { TreeModelHierarchyNode, TreeModelRootNode } from \"./TreeModel.js\";\n\nenableMapSet();\n\ninterface LoadDebouncedNodesOptions {\n  loadOptions: LoadNodesOptions;\n  onComplete: () => void;\n  timeTracker?: TimeTracker;\n  initialRootNode?: TreeModelRootNode;\n  parentId?: string;\n  discardState?: boolean;\n}\n\n/** @internal */\nexport class TreeActions {\n  private _loader: ITreeLoader;\n  private _nodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string;\n  private _currentModel: TreeModel;\n  private _reset = new Subject<void>();\n  private _nodeLoader: Subject<LoadDebouncedNodesOptions>;\n\n  constructor(\n    private _onModelChanged: (model: TreeModel) => void,\n    private _onLoad: (actionType: \"initial-load\" | \"hierarchy-level-load\" | \"reload\", duration: number) => void,\n    private _onHierarchyLimitExceeded: (props: {\n      parentId?: string;\n      filter?: GenericInstanceFilter;\n      limit?: number | \"unbounded\";\n    }) => void,\n    private _onHierarchyLoadError: (props: { parentId?: string; type: \"timeout\" | \"unknown\"; error: unknown }) => void,\n    nodeIdFactory?: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string,\n    seed?: TreeModel,\n  ) {\n    this._loader = new NoopTreeLoader();\n    this._nodeIdFactory = nodeIdFactory ?? createNodeId;\n    this._currentModel = seed ?? {\n      idToNode: new Map(),\n      parentChildMap: new Map(),\n      rootNode: { id: undefined, nodeData: undefined },\n    };\n\n    this._nodeLoader = this.createNodeLoader();\n  }\n\n  private createNodeLoader() {\n    const subject = new Subject<LoadDebouncedNodesOptions>();\n    subject\n      .pipe(\n        groupBy((item) => item.parentId),\n        mergeMap((group) =>\n          group.pipe(\n            buffer(group.pipe(debounceTime(0))),\n            map((groupArr) => {\n              let returnIndex = groupArr.length - 1;\n\n              groupArr.forEach((member, index) => {\n                if (member.discardState) {\n                  returnIndex = index;\n                }\n              });\n\n              groupArr.forEach((member, index) => {\n                if (index === returnIndex) {\n                  return;\n                }\n                member.timeTracker?.[Symbol.dispose];\n                member.onComplete();\n              });\n              return groupArr[returnIndex];\n            }),\n            switchMap((props) =>\n              this._loader.loadNodes(props.loadOptions).pipe(\n                collectTreePartsUntil(this._reset, props.initialRootNode),\n                tap({\n                  next: (newModel: TreeModel) => {\n                    const parentNode = props.parentId ? newModel.idToNode.get(props.parentId) : newModel.rootNode;\n                    this.handleLoadedHierarchy(props.parentId, newModel);\n                    // only report load duration if children were loaded\n                    if (!(parentNode && parentNode.error)) {\n                      props.timeTracker?.finish();\n                    }\n                  },\n                  complete: () => {\n                    this.onLoadingComplete(props.parentId);\n                    props.timeTracker?.[Symbol.dispose]();\n                    props.onComplete();\n                  },\n                }),\n              ),\n            ),\n          ),\n        ),\n      )\n      .subscribe();\n\n    return subject;\n  }\n\n  private updateTreeModel(updater: (model: Draft<TreeModel>) => void) {\n    const newModel = produce(this._currentModel, updater);\n    if (this._currentModel === newModel) {\n      return;\n    }\n\n    this._currentModel = newModel;\n    this._onModelChanged(this._currentModel);\n  }\n\n  private handleLoadedHierarchy(parentId: string | undefined, loadedHierarchy: TreeModel) {\n    this.updateTreeModel((model) => {\n      TreeModel.addHierarchyPart(model, parentId, loadedHierarchy);\n    });\n  }\n\n  private onLoadingComplete(parentId: string | undefined) {\n    this.updateTreeModel((model) => {\n      TreeModel.setIsLoading(model, parentId, false);\n    });\n  }\n\n  private getLoadAction(parentId: string | undefined) {\n    return this._currentModel.idToNode.size === 0\n      ? \"initial-load\"\n      : parentId === undefined\n        ? \"reload\"\n        : \"hierarchy-level-load\";\n  }\n\n  private loadSubTree(options: LoadNodesOptions, initialRootNode?: TreeModelRootNode, discardState?: boolean) {\n    const loadAction = this.getLoadAction(options.parent.id);\n    const timeTracker = new TimeTracker((time) => this._onLoad(loadAction, time));\n\n    return {\n      complete: new Promise<void>((resolve) => {\n        this._nodeLoader.next({\n          loadOptions: options,\n          onComplete: resolve,\n          timeTracker,\n          parentId: options.parent.id,\n          initialRootNode,\n          discardState,\n        });\n      }),\n    };\n  }\n\n  private loadNodes(parentId: string, ignoreCache?: boolean) {\n    const parentNode = this._currentModel.idToNode.get(parentId);\n    if (!parentNode) {\n      return { complete: Promise.resolve() };\n    }\n    return this.loadSubTree({\n      parent: parentNode,\n      getHierarchyLevelOptions: (node) =>\n        createHierarchyLevelOptions(this._currentModel, getNonGroupedParentId(node, this._nodeIdFactory)),\n      shouldLoadChildren: (node) => !!node.nodeData.autoExpand,\n      ignoreCache,\n    });\n  }\n\n  private reloadSubTree(\n    parentId: string | undefined,\n    oldModel: TreeModel,\n    options?: { discardState?: boolean; ignoreCache?: boolean },\n  ) {\n    const currModel = this._currentModel;\n    const expandedNodes = !!options?.discardState\n      ? []\n      : collectNodes(parentId, oldModel, (node) => node.isExpanded === true);\n    const collapsedNodes = !!options?.discardState\n      ? []\n      : collectNodes(parentId, oldModel, (node) => node.isExpanded === false);\n    const getHierarchyLevelOptions = (node: TreeModelRootNode | TreeModelHierarchyNode) => {\n      if (!!options?.discardState) {\n        return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };\n      }\n      const filteredNodeId = getNonGroupedParentId(node, this._nodeIdFactory);\n      return createHierarchyLevelOptions(filteredNodeId === parentId ? currModel : oldModel, filteredNodeId);\n    };\n    const shouldLoadChildren = (node: TreeModelHierarchyNode) => {\n      if (expandedNodes.findIndex((expandedNode) => sameNodes(expandedNode.nodeData, node.nodeData)) !== -1) {\n        return true;\n      }\n      if (collapsedNodes.findIndex((collapsedNode) => sameNodes(collapsedNode.nodeData, node.nodeData)) !== -1) {\n        return false;\n      }\n      return !!node.nodeData.autoExpand;\n    };\n    const buildNode = (node: TreeModelHierarchyNode) =>\n      !!options?.discardState || node.id === parentId ? node : addAttributes(node, oldModel);\n\n    const rootNode = parentId !== undefined ? this.getNode(parentId) : currModel.rootNode;\n    if (!rootNode) {\n      return { complete: Promise.resolve() };\n    }\n\n    if (parentId === undefined) {\n      // cancel all ongoing requests\n      this._reset.next();\n    }\n\n    return this.loadSubTree(\n      { parent: rootNode, getHierarchyLevelOptions, shouldLoadChildren, buildNode, ignoreCache: options?.ignoreCache },\n      !!options?.discardState ? undefined : { ...currModel.rootNode },\n      options?.discardState,\n    );\n  }\n\n  public reset() {\n    this._reset.next();\n  }\n\n  public setHierarchyProvider(provider?: HierarchyProvider) {\n    this._loader = provider\n      ? new TreeLoader(\n          provider,\n          this._onHierarchyLimitExceeded,\n          ({ parentId, type, error }) => {\n            if (type === \"timeout\") {\n              const loadAction = this.getLoadAction(parentId);\n              this._onLoad(loadAction, Number.MAX_SAFE_INTEGER);\n            }\n            this._onHierarchyLoadError({ parentId, type, error });\n          },\n          this._nodeIdFactory,\n        )\n      : new NoopTreeLoader();\n  }\n\n  public getNode(nodeId: string | undefined): TreeModelHierarchyNode | TreeModelRootNode | undefined {\n    return TreeModel.getNode(this._currentModel, nodeId);\n  }\n\n  public selectNodes(nodeIds: Array<string>, changeType: SelectionChangeType) {\n    this.updateTreeModel((model) => {\n      TreeModel.selectNodes(model, nodeIds, changeType);\n    });\n  }\n\n  public expandNode(nodeId: string, isExpanded: boolean) {\n    let childrenAction = \"none\" as ReturnType<typeof TreeModel.expandNode>;\n    this.updateTreeModel((model) => {\n      childrenAction = TreeModel.expandNode(model, nodeId, isExpanded);\n    });\n\n    if (childrenAction === \"none\") {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.loadNodes(nodeId, childrenAction === \"reloadChildren\");\n  }\n\n  public setHierarchyLimit(nodeId: string | undefined, limit?: number | \"unbounded\") {\n    const oldModel = this._currentModel;\n    let loadChildren = false as boolean;\n    this.updateTreeModel((model) => {\n      loadChildren = TreeModel.setHierarchyLimit(model, nodeId, limit);\n    });\n\n    if (!loadChildren) {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.reloadSubTree(nodeId, oldModel);\n  }\n\n  public setInstanceFilter(nodeId: string | undefined, filter?: GenericInstanceFilter) {\n    const oldModel = this._currentModel;\n    let loadChildren = false as boolean;\n    this.updateTreeModel((model) => {\n      loadChildren = TreeModel.setInstanceFilter(model, nodeId, filter);\n    });\n\n    if (!loadChildren) {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.reloadSubTree(nodeId, oldModel);\n  }\n\n  public reloadTree(options?: { parentNodeId?: string; state?: \"keep\" | \"discard\" | \"reset\" }) {\n    const oldModel = this._currentModel;\n    this.updateTreeModel((model) => {\n      TreeModel.setIsLoading(model, options?.parentNodeId, true);\n      if (options?.state === \"reset\") {\n        TreeModel.removeSubTree(model, options.parentNodeId);\n      }\n    });\n\n    const discardState = options?.state === \"discard\" || options?.state === \"reset\";\n    const ignoreCache = options?.state === \"reset\";\n    return this.reloadSubTree(options?.parentNodeId, oldModel, { discardState, ignoreCache });\n  }\n}\n\nfunction collectTreePartsUntil(untilNotifier: Observable<void>, rootNode?: TreeModelRootNode) {\n  return (source: Observable<LoadedTreePart>) =>\n    source.pipe(\n      reduce<LoadedTreePart, TreeModel>(\n        (treeModel, loadedPart) => {\n          addTreePartToModel(treeModel, loadedPart);\n          return treeModel;\n        },\n        {\n          idToNode: new Map(),\n          parentChildMap: new Map(),\n          rootNode: rootNode ?? { id: undefined, nodeData: undefined },\n        },\n      ),\n      takeUntil(untilNotifier),\n    );\n}\n\nfunction addTreePartToModel(treeModel: TreeModel, loadedPart: LoadedTreePart) {\n  if (\"loadedNodes\" in loadedPart) {\n    addNodesToModel(treeModel, loadedPart);\n  } else {\n    addErrorToModel(treeModel, loadedPart);\n  }\n}\n\nfunction addErrorToModel(\n  model: TreeModel,\n  loadedPart: { parent: TreeModelHierarchyNode | TreeModelRootNode; error: ErrorInfo },\n) {\n  if (loadedPart.parent.id === undefined) {\n    model.rootNode.error = loadedPart.error;\n  } else {\n    model.idToNode.set(loadedPart.parent.id, { ...loadedPart.parent, error: loadedPart.error });\n  }\n}\n\nfunction addNodesToModel(\n  model: TreeModel,\n  loadedPart: { parent: TreeModelHierarchyNode | TreeModelRootNode; loadedNodes: TreeModelHierarchyNode[] },\n) {\n  model.parentChildMap.set(\n    loadedPart.parent.id,\n    loadedPart.loadedNodes.map((node) => node.id),\n  );\n  for (const node of loadedPart.loadedNodes) {\n    model.idToNode.set(node.id, node);\n  }\n  const parentNode = loadedPart.parent.id ? model.idToNode.get(loadedPart.parent.id) : undefined;\n  if (parentNode && loadedPart.loadedNodes.length !== 0) {\n    parentNode.isExpanded = true;\n  }\n}\n\nfunction addAttributes(node: TreeModelHierarchyNode, oldModel: TreeModel) {\n  const oldNode = oldModel.idToNode.get(node.id);\n  if (oldNode) {\n    node.hierarchyLimit = oldNode.hierarchyLimit;\n    node.instanceFilter = oldNode.instanceFilter;\n    node.isSelected = oldNode.isSelected;\n  }\n  return node;\n}\n\nfunction collectNodes(\n  parentId: string | undefined,\n  model: TreeModel,\n  pred: (node: TreeModelHierarchyNode) => boolean,\n): TreeModelHierarchyNode[] {\n  const currentChildren = model.parentChildMap.get(parentId);\n  if (!currentChildren) {\n    return [];\n  }\n\n  if (parentId === undefined) {\n    return currentChildren.flatMap((child) => collectNodes(child, model, pred));\n  }\n\n  const currNode = model.idToNode.get(parentId);\n  if (!currNode || !pred(currNode)) {\n    return [];\n  }\n\n  return [currNode, ...currentChildren.flatMap((child) => collectNodes(child, model, pred))];\n}\n\nfunction getNonGroupedParentId(\n  node: TreeModelHierarchyNode | TreeModelRootNode,\n  nodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string,\n) {\n  if (!node.nodeData || !HierarchyNode.isGroupingNode(node.nodeData)) {\n    return node.id;\n  }\n\n  if (!node.nodeData.nonGroupingAncestor) {\n    return undefined;\n  }\n\n  return nodeIdFactory(node.nodeData.nonGroupingAncestor);\n}\n\nfunction createHierarchyLevelOptions(model: TreeModel, nodeId: string | undefined): HierarchyLevelOptions {\n  if (nodeId === undefined) {\n    return { instanceFilter: model.rootNode.instanceFilter, hierarchyLevelSizeLimit: model.rootNode.hierarchyLimit };\n  }\n\n  const modelNode = model.idToNode.get(nodeId);\n  if (!modelNode) {\n    return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };\n  }\n  return { instanceFilter: modelNode.instanceFilter, hierarchyLevelSizeLimit: modelNode.hierarchyLimit };\n}\n\nclass NoopTreeLoader implements ITreeLoader {\n  public loadNodes(): Observable<LoadedTreePart> {\n    return EMPTY;\n  }\n}\n\nclass TimeTracker {\n  private _start: number;\n  private _stopped: boolean = false;\n\n  constructor(private _onFinish: (time: number) => void) {\n    this._start = Date.now();\n  }\n\n  public [Symbol.dispose]() {\n    this._stopped = true;\n  }\n\n  public finish() {\n    if (this._stopped) {\n      return;\n    }\n\n    this._stopped = true;\n    const elapsedTime = Date.now() - this._start;\n    this._onFinish(elapsedTime);\n  }\n}\n"],"mappings":";;;;;;;;AAsBAA,aAAa;;AAYb,IAAasC,cAAb,MAAyB;CAQbS;CACAE;CACAG;CAKAI;CAdV;CACA;CACA;CACA,SAAiB,IAAI/C,QAAc;CACnC;CAEAqC,YACE,iBACA,SACA,2BAKA,uBACAa,eACAC,MACA;EAVQb,KAAAA,kBAAAA;EACAE,KAAAA,UAAAA;EACAG,KAAAA,4BAAAA;EAKAI,KAAAA,wBAAAA;EAIR,KAAKjB,UAAU,IAAIsB,eAAe;EAClC,KAAKrB,iBAAiBmB,iBAAiB3C;EACvC,KAAK2B,gBAAgBiB,QAAQ;GAC3BE,0BAAU,IAAIC,IAAI;GAClBC,gCAAgB,IAAID,IAAI;GACxBE,UAAU;IAAEC,IAAIC,KAAAA;IAAWC,UAAUD,KAAAA;GAAU;EACjD;EAEA,KAAKtB,cAAc,KAAKwB,iBAAiB;CAC3C;CAEA,mBAA2B;EACzB,MAAMC,UAAU,IAAI7D,QAAmC;EACvD6D,QACGC,KACClE,SAASmE,SAASA,KAAKpC,QAAQ,GAC/B7B,UAAUkE,UACRA,MAAMF,KACJrE,OAAOuE,MAAMF,KAAKpE,aAAa,CAAC,CAAC,CAAC,GAClCG,KAAKoE,aAAa;GAChB,IAAIC,cAAcD,SAASE,SAAS;GAEpCF,SAASG,SAASC,QAAQC,UAAU;IAClC,IAAID,OAAOzC,cACTsC,cAAcI;GAElB,CAAC;GAEDL,SAASG,SAASC,QAAQC,UAAU;IAClC,IAAIA,UAAUJ,aACZ;IAEFG,OAAO7C,cAAc+C,OAAOC;IAC5BH,OAAO9C,WAAW;GACpB,CAAC;GACD,OAAO0C,SAASC;EAClB,CAAC,GACDjE,WAAW2C,UACT,KAAKd,QAAQ2C,UAAU7B,MAAMtB,WAAW,CAAC,CAACwC,KACxCY,sBAAsB,KAAKvC,QAAQS,MAAMlB,eAAe,GACxDvB,IAAI;GACFwE,OAAOC,aAAwB;IAC7B,MAAMC,aAAajC,MAAMjB,WAAWiD,SAASvB,SAASyB,IAAIlC,MAAMjB,QAAQ,IAAIiD,SAASpB;IACrF,KAAKuB,sBAAsBnC,MAAMjB,UAAUiD,QAAQ;IAEnD,IAAI,EAAEC,cAAcA,WAAW5B,QAC7BL,MAAMpB,aAAawD,OAAO;GAE9B;GACAC,gBAAgB;IACd,KAAKC,kBAAkBtC,MAAMjB,QAAQ;IACrCiB,MAAMpB,cAAc+C,OAAOC,QAAQ,CAAC;IACpC5B,MAAMrB,WAAW;GACnB;EACF,CAAC,CACH,CACF,CACF,CACF,CACF,CAAC,CACA4D,UAAU;EAEb,OAAOtB;CACT;CAEA,gBAAwBwB,SAA4C;EAClE,MAAMT,WAAWpF,QAAQ,KAAK0C,eAAemD,OAAO;EACpD,IAAI,KAAKnD,kBAAkB0C,UACzB;EAGF,KAAK1C,gBAAgB0C;EACrB,KAAKtC,gBAAgB,KAAKJ,aAAa;CACzC;CAEA,sBAA8BP,UAA8B2D,iBAA4B;EACtF,KAAKF,iBAAiB7C,UAAU;GAC9BjC,UAAUiF,iBAAiBhD,OAAOZ,UAAU2D,eAAe;EAC7D,CAAC;CACH;CAEA,kBAA0B3D,UAA8B;EACtD,KAAKyD,iBAAiB7C,UAAU;GAC9BjC,UAAUkF,aAAajD,OAAOZ,UAAU,KAAK;EAC/C,CAAC;CACH;CAEA,cAAsBA,UAA8B;EAClD,OAAO,KAAKO,cAAcmB,SAASqC,SAAS,IACxC,iBACA/D,aAAa+B,KAAAA,IACX,WACA;CACR;CAEA,YAAoBkC,SAA2BlE,iBAAqCE,cAAwB;EAC1G,MAAMiE,aAAa,KAAKJ,cAAcG,QAAQE,OAAOrC,EAAE;EACvD,MAAMjC,cAAc,IAAIC,aAAasE,SAAS,KAAKvD,QAAQqD,YAAYE,IAAI,CAAC;EAE5E,OAAO,EACLd,UAAU,IAAIe,SAAeC,YAAY;GACvC,KAAK7D,YAAYuC,KAAK;IACpBrD,aAAasE;IACbrE,YAAY0E;IACZzE;IACAG,UAAUiE,QAAQE,OAAOrC;IACzB/B;IACAE;GACF,CAAC;EACH,CAAC,EACH;CACF;CAEA,UAAkBD,UAAkBuE,aAAuB;EACzD,MAAMrB,aAAa,KAAK3C,cAAcmB,SAASyB,IAAInD,QAAQ;EAC3D,IAAI,CAACkD,YACH,OAAO,EAAEI,UAAUe,QAAQC,QAAQ,EAAE;EAEvC,OAAO,KAAKN,YAAY;GACtBG,QAAQjB;GACRsB,2BAA2BnE,SACzBoE,4BAA4B,KAAKlE,eAAemE,sBAAsBrE,MAAM,KAAKD,cAAc,CAAC;GAClGuE,qBAAqBtE,SAAS,CAAC,CAACA,KAAK2B,SAAS4C;GAC9CL;EACF,CAAC;CACH;CAEA,cACEvE,UACA8E,UACAb,SACA;EACA,MAAMc,YAAY,KAAKxE;EACvB,MAAMyE,gBAAgB,CAAC,CAACf,SAAShE,eAC7B,CAAA,IACAgF,aAAajF,UAAU8E,WAAWzE,SAASA,KAAK6E,eAAe,IAAI;EACvE,MAAMC,iBAAiB,CAAC,CAAClB,SAAShE,eAC9B,CAAA,IACAgF,aAAajF,UAAU8E,WAAWzE,SAASA,KAAK6E,eAAe,KAAK;EACxE,MAAMV,4BAA4BnE,SAAqD;GACrF,IAAI,CAAC,CAAC4D,SAAShE,cACb,OAAO;IAAEmF,gBAAgBrD,KAAAA;IAAWsD,yBAAyBtD,KAAAA;GAAU;GAEzE,MAAMuD,iBAAiBZ,sBAAsBrE,MAAM,KAAKD,cAAc;GACtE,OAAOqE,4BAA4Ba,mBAAmBtF,WAAW+E,YAAYD,UAAUQ,cAAc;EACvG;EACA,MAAMX,sBAAsBtE,SAAiC;GAC3D,IAAI2E,cAAcO,WAAWC,iBAAiB3G,UAAU2G,aAAaxD,UAAU3B,KAAK2B,QAAQ,CAAC,MAAM,IACjG,OAAO;GAET,IAAImD,eAAeI,WAAWE,kBAAkB5G,UAAU4G,cAAczD,UAAU3B,KAAK2B,QAAQ,CAAC,MAAM,IACpG,OAAO;GAET,OAAO,CAAC,CAAC3B,KAAK2B,SAAS4C;EACzB;EACA,MAAMc,aAAarF,SACjB,CAAC,CAAC4D,SAAShE,gBAAgBI,KAAKyB,OAAO9B,WAAWK,OAAOsF,cAActF,MAAMyE,QAAQ;EAEvF,MAAMjD,WAAW7B,aAAa+B,KAAAA,IAAY,KAAK6D,QAAQ5F,QAAQ,IAAI+E,UAAUlD;EAC7E,IAAI,CAACA,UACH,OAAO,EAAEyB,UAAUe,QAAQC,QAAQ,EAAE;EAGvC,IAAItE,aAAa+B,KAAAA,GAEf,KAAKvB,OAAOwC,KAAK;EAGnB,OAAO,KAAKgB,YACV;GAAEG,QAAQtC;GAAU2C;GAA0BG;GAAoBe;GAAWnB,aAAaN,SAASM;EAAY,GAC/G,CAAC,CAACN,SAAShE,eAAe8B,KAAAA,IAAY,EAAE,GAAGgD,UAAUlD,SAAS,GAC9DoC,SAAShE,YACX;CACF;CAEA,QAAe;EACb,KAAKO,OAAOwC,KAAK;CACnB;CAEA,qBAA4B+C,UAA8B;EACxD,KAAK5F,UAAU4F,WACX,IAAIrH,WACFqH,UACA,KAAK/E,4BACJ,EAAEhB,UAAUqB,MAAMC,YAAY;GAC7B,IAAID,SAAS,WAAW;IACtB,MAAM6C,aAAa,KAAKJ,cAAc9D,QAAQ;IAC9C,KAAKa,QAAQqD,YAAY8B,OAAOC,gBAAgB;GAClD;GACA,KAAK7E,sBAAsB;IAAEpB;IAAUqB;IAAMC;GAAM,CAAC;EACtD,GACA,KAAKlB,cACP,IACA,IAAIqB,eAAe;CACzB;CAEA,QAAeyE,QAAoF;EACjG,OAAOvH,UAAUiH,QAAQ,KAAKrF,eAAe2F,MAAM;CACrD;CAEA,YAAmBE,SAAwBE,YAAiC;EAC1E,KAAK7C,iBAAiB7C,UAAU;GAC9BjC,UAAUwH,YAAYvF,OAAOwF,SAASE,UAAU;EAClD,CAAC;CACH;CAEA,WAAkBJ,QAAgBhB,YAAqB;EACrD,IAAIsB,iBAAiB;EACrB,KAAK/C,iBAAiB7C,UAAU;GAC9B4F,iBAAiB7H,UAAU4H,WAAW3F,OAAOsF,QAAQhB,UAAU;EACjE,CAAC;EAED,IAAIsB,mBAAmB,QACrB,OAAO,EAAElD,UAAUe,QAAQC,QAAQ,EAAE;EAGvC,OAAO,KAAKxB,UAAUoD,QAAQM,mBAAmB,gBAAgB;CACnE;CAEA,kBAAyBN,QAA4B/E,OAA8B;EACjF,MAAM2D,WAAW,KAAKvE;EACtB,IAAIoG,eAAe;EACnB,KAAKlD,iBAAiB7C,UAAU;GAC9B+F,eAAehI,UAAU+H,kBAAkB9F,OAAOsF,QAAQ/E,KAAK;EACjE,CAAC;EAED,IAAI,CAACwF,cACH,OAAO,EAAErD,UAAUe,QAAQC,QAAQ,EAAE;EAGvC,OAAO,KAAKO,cAAcqB,QAAQpB,QAAQ;CAC5C;CAEA,kBAAyBoB,QAA4BhF,QAAgC;EACnF,MAAM4D,WAAW,KAAKvE;EACtB,IAAIoG,eAAe;EACnB,KAAKlD,iBAAiB7C,UAAU;GAC9B+F,eAAehI,UAAUiI,kBAAkBhG,OAAOsF,QAAQhF,MAAM;EAClE,CAAC;EAED,IAAI,CAACyF,cACH,OAAO,EAAErD,UAAUe,QAAQC,QAAQ,EAAE;EAGvC,OAAO,KAAKO,cAAcqB,QAAQpB,QAAQ;CAC5C;CAEA,WAAkBb,SAA2E;EAC3F,MAAMa,WAAW,KAAKvE;EACtB,KAAKkD,iBAAiB7C,UAAU;GAC9BjC,UAAUkF,aAAajD,OAAOqD,SAAS6C,cAAc,IAAI;GACzD,IAAI7C,SAAS8C,UAAU,SACrBpI,UAAUqI,cAAcpG,OAAOqD,QAAQ6C,YAAY;EAEvD,CAAC;EAED,MAAM7G,eAAegE,SAAS8C,UAAU,aAAa9C,SAAS8C,UAAU;EACxE,MAAMxC,cAAcN,SAAS8C,UAAU;EACvC,OAAO,KAAKlC,cAAcZ,SAAS6C,cAAchC,UAAU;GAAE7E;GAAcsE;EAAY,CAAC;CAC1F;AACF;AAEA,SAASxB,sBAAsBkE,eAAiCpF,UAA8B;CAC5F,QAAQqF,WACNA,OAAO/E,KACL/D,QACG+I,WAAWC,eAAe;EACzBC,mBAAmBF,WAAWC,UAAU;EACxC,OAAOD;CACT,GACA;EACEzF,0BAAU,IAAIC,IAAI;EAClBC,gCAAgB,IAAID,IAAI;EACxBE,UAAUA,YAAY;GAAEC,IAAIC,KAAAA;GAAWC,UAAUD,KAAAA;EAAU;CAC7D,CACF,GACAxD,UAAU0I,aAAa,CACzB;AACJ;AAEA,SAASI,mBAAmBF,WAAsBC,YAA4B;CAC5E,IAAI,iBAAiBA,YACnBE,gBAAgBH,WAAWC,UAAU;MAErCG,gBAAgBJ,WAAWC,UAAU;AAEzC;AAEA,SAASG,gBACP3G,OACAwG,YACA;CACA,IAAIA,WAAWjD,OAAOrC,OAAOC,KAAAA,GAC3BnB,MAAMiB,SAASP,QAAQ8F,WAAW9F;MAElCV,MAAMc,SAAS8F,IAAIJ,WAAWjD,OAAOrC,IAAI;EAAE,GAAGsF,WAAWjD;EAAQ7C,OAAO8F,WAAW9F;CAAM,CAAC;AAE9F;AAEA,SAASgG,gBACP1G,OACAwG,YACA;CACAxG,MAAMgB,eAAe4F,IACnBJ,WAAWjD,OAAOrC,IAClBsF,WAAWK,YAAYvJ,KAAKmC,SAASA,KAAKyB,EAAE,CAC9C;CACA,KAAK,MAAMzB,QAAQ+G,WAAWK,aAC5B7G,MAAMc,SAAS8F,IAAInH,KAAKyB,IAAIzB,IAAI;CAElC,MAAM6C,aAAakE,WAAWjD,OAAOrC,KAAKlB,MAAMc,SAASyB,IAAIiE,WAAWjD,OAAOrC,EAAE,IAAIC,KAAAA;CACrF,IAAImB,cAAckE,WAAWK,YAAYjF,WAAW,GAClDU,WAAWgC,aAAa;AAE5B;AAEA,SAASS,cAActF,MAA8ByE,UAAqB;CACxE,MAAM4C,UAAU5C,SAASpD,SAASyB,IAAI9C,KAAKyB,EAAE;CAC7C,IAAI4F,SAAS;EACXrH,KAAKsH,iBAAiBD,QAAQC;EAC9BtH,KAAK+E,iBAAiBsC,QAAQtC;EAC9B/E,KAAKuH,aAAaF,QAAQE;CAC5B;CACA,OAAOvH;AACT;AAEA,SAAS4E,aACPjF,UACAY,OACAiH,MAC0B;CAC1B,MAAMC,kBAAkBlH,MAAMgB,eAAeuB,IAAInD,QAAQ;CACzD,IAAI,CAAC8H,iBACH,OAAO,CAAA;CAGT,IAAI9H,aAAa+B,KAAAA,GACf,OAAO+F,gBAAgBC,SAASC,UAAU/C,aAAa+C,OAAOpH,OAAOiH,IAAI,CAAC;CAG5E,MAAMI,WAAWrH,MAAMc,SAASyB,IAAInD,QAAQ;CAC5C,IAAI,CAACiI,YAAY,CAACJ,KAAKI,QAAQ,GAC7B,OAAO,CAAA;CAGT,OAAO,CAACA,UAAU,GAAGH,gBAAgBC,SAASC,UAAU/C,aAAa+C,OAAOpH,OAAOiH,IAAI,CAAC,CAAC;AAC3F;AAEA,SAASnD,sBACPrE,MACAkB,eACA;CACA,IAAI,CAAClB,KAAK2B,YAAY,CAACvD,cAAcyJ,eAAe7H,KAAK2B,QAAQ,GAC/D,OAAO3B,KAAKyB;CAGd,IAAI,CAACzB,KAAK2B,SAASmG,qBACjB;CAGF,OAAO5G,cAAclB,KAAK2B,SAASmG,mBAAmB;AACxD;AAEA,SAAS1D,4BAA4B7D,OAAkBsF,QAAmD;CACxG,IAAIA,WAAWnE,KAAAA,GACb,OAAO;EAAEqD,gBAAgBxE,MAAMiB,SAASuD;EAAgBC,yBAAyBzE,MAAMiB,SAAS8F;CAAe;CAGjH,MAAMS,YAAYxH,MAAMc,SAASyB,IAAI+C,MAAM;CAC3C,IAAI,CAACkC,WACH,OAAO;EAAEhD,gBAAgBrD,KAAAA;EAAWsD,yBAAyBtD,KAAAA;CAAU;CAEzE,OAAO;EAAEqD,gBAAgBgD,UAAUhD;EAAgBC,yBAAyB+C,UAAUT;CAAe;AACvG;AAEA,IAAMlG,iBAAN,MAA4C;CAC1C,YAA+C;EAC7C,OAAOzD;CACT;AACF;AAEA,IAAM8B,cAAN,MAAkB;CAIIyI;CAHpB;CACA,WAA4B;CAE5B7H,YAAY,WAA2C;EAAnC6H,KAAAA,YAAAA;EAClB,KAAKF,SAASG,KAAKC,IAAI;CACzB;CAEA,CAAQ7F,OAAOC,WAAW;EACxB,KAAKyF,WAAW;CAClB;CAEA,SAAgB;EACd,IAAI,KAAKA,UACP;EAGF,KAAKA,WAAW;EAChB,MAAMI,cAAcF,KAAKC,IAAI,IAAI,KAAKJ;EACtC,KAAKE,UAAUG,WAAW;CAC5B;AACF"}

package/lib/presentation-hierarchies-react/internal/TreeLoader.js

@@ -3,6 +3,9 @@ import { EMPTY, catchError, expand, filter, from, map, mergeMap, of, toArray } f
 //#region src/presentation-hierarchies-react/internal/TreeLoader.ts
 /** @internal */
 var TreeLoader = class {
+	_hierarchyProvider;
+	_onHierarchyLimitExceeded;
+	_onHierarchyLoadError;
 	_treeNodeIdFactory;
 	constructor(_hierarchyProvider, _onHierarchyLimitExceeded, _onHierarchyLoadError, treeNodeIdFactory) {
 		this._hierarchyProvider = _hierarchyProvider;

package/lib/presentation-hierarchies-react/internal/TreeLoader.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeLoader.js","names":["catchError","EMPTY","expand","filter","from","map","mergeMap","of","toArray","createNodeId","Observable","GenericInstanceFilter","HierarchyNode","HierarchyProvider","RowsLimitExceededError","ErrorInfo","TreeModelHierarchyNode","TreeModelRootNode","LoadedTreePart","parent","loadedNodes","error","HierarchyLevelOptions","instanceFilter","hierarchyLevelSizeLimit","LoadNodesOptions","getHierarchyLevelOptions","node","shouldLoadChildren","buildNode","ignoreCache","ITreeLoader","loadNodes","options","TreeLoader","_treeNodeIdFactory","Pick","constructor","_hierarchyProvider","_onHierarchyLimitExceeded","props","parentId","limit","_onHierarchyLoadError","type","treeNodeIdFactory","loadChildren","Omit","infoNodeIdBase","id","treeModelNodesFactory","createTreeModelNodesFactory","getNodes","parentNode","nodeData","pipe","childNodes","length","const","err","hierarchyLoadErrorType","Error","isRowsLimitError","message","resultSetSizeLimit","isTimeoutError","loadedPart","modelNode","children","label","includes"],"sources":["../../../src/presentation-hierarchies-react/internal/TreeLoader.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { catchError, EMPTY, expand, filter, from, map, mergeMap, of, toArray } from \"rxjs\";\nimport { createNodeId } from \"./Utils.js\";\n\nimport type { Observable } from \"rxjs\";\nimport type {\n  GenericInstanceFilter,\n  HierarchyNode,\n  HierarchyProvider,\n  RowsLimitExceededError,\n} from \"@itwin/presentation-hierarchies\";\nimport type { ErrorInfo } from \"../TreeNode.js\";\nimport type { TreeModelHierarchyNode, TreeModelRootNode } from \"./TreeModel.js\";\n\n/** @internal */\nexport type LoadedTreePart = { parent: TreeModelHierarchyNode | TreeModelRootNode } & (\n  | { loadedNodes: TreeModelHierarchyNode[] }\n  | { error: ErrorInfo }\n);\n\n/** @internal */\nexport interface HierarchyLevelOptions {\n  instanceFilter?: GenericInstanceFilter;\n  hierarchyLevelSizeLimit?: number | \"unbounded\";\n}\n\n/** @internal */\nexport interface LoadNodesOptions {\n  parent: TreeModelHierarchyNode | TreeModelRootNode;\n  getHierarchyLevelOptions: (node: TreeModelRootNode | TreeModelHierarchyNode) => HierarchyLevelOptions;\n  shouldLoadChildren: (node: TreeModelHierarchyNode) => boolean;\n  buildNode?: (node: TreeModelHierarchyNode) => TreeModelHierarchyNode;\n  ignoreCache?: boolean;\n}\n\n/** @internal */\nexport interface ITreeLoader {\n  loadNodes(options: LoadNodesOptions): Observable<LoadedTreePart>;\n}\n\n/** @internal */\nexport class TreeLoader implements ITreeLoader {\n  private _treeNodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string;\n\n  constructor(\n    private _hierarchyProvider: HierarchyProvider,\n    private _onHierarchyLimitExceeded: (props: {\n      parentId?: string;\n      filter?: GenericInstanceFilter;\n      limit?: number | \"unbounded\";\n    }) => void,\n    private _onHierarchyLoadError: (props: { parentId?: string; type: \"timeout\" | \"unknown\"; error: unknown }) => void,\n    treeNodeIdFactory?: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string,\n  ) {\n    this._treeNodeIdFactory = treeNodeIdFactory ?? createNodeId;\n  }\n\n  private loadChildren({\n    parent,\n    getHierarchyLevelOptions,\n    buildNode,\n    ignoreCache,\n  }: Omit<LoadNodesOptions, \"shouldLoadChildren\">) {\n    const { instanceFilter, hierarchyLevelSizeLimit } = getHierarchyLevelOptions(parent);\n    const infoNodeIdBase = `${parent.id ?? \"<root>\"}`;\n    const treeModelNodesFactory = createTreeModelNodesFactory({\n      buildNode,\n      treeNodeIdFactory: this._treeNodeIdFactory,\n    });\n    return from(\n      this._hierarchyProvider.getNodes({\n        parentNode: parent.nodeData,\n        hierarchyLevelSizeLimit,\n        instanceFilter,\n        ignoreCache,\n      }),\n    ).pipe(\n      toArray(),\n      map((childNodes): LoadedTreePart => {\n        return instanceFilter && childNodes.length === 0\n          ? { parent, error: { id: `${infoNodeIdBase}-no-filter-matches`, type: \"NoFilterMatches\" as const } }\n          : { parent, loadedNodes: childNodes.map(treeModelNodesFactory) };\n      }),\n      catchError((err) => {\n        let hierarchyLoadErrorType: \"unknown\" | \"timeout\" = \"unknown\";\n        if (err instanceof Error) {\n          if (isRowsLimitError(err)) {\n            this._onHierarchyLimitExceeded({ parentId: parent.id, filter: instanceFilter, limit: err.limit });\n            return of({\n              parent,\n              error: {\n                id: `${infoNodeIdBase}-${err.message}`,\n                type: \"ResultSetTooLarge\" as const,\n                resultSetSizeLimit: err.limit,\n              },\n            });\n          }\n          if (isTimeoutError(err)) {\n            hierarchyLoadErrorType = \"timeout\";\n          }\n        }\n\n        this._onHierarchyLoadError({ parentId: parent.id, type: hierarchyLoadErrorType, error: err });\n        return of({\n          parent,\n          error: {\n            id: `${infoNodeIdBase}-ChildrenLoad`,\n            type: \"ChildrenLoad\" as const,\n            message: \"Failed to create hierarchy level\",\n          },\n        });\n      }),\n    );\n  }\n\n  public loadNodes({ shouldLoadChildren, ...options }: LoadNodesOptions) {\n    return this.loadChildren(options).pipe(\n      expand((loadedPart) =>\n        \"loadedNodes\" in loadedPart\n          ? from(loadedPart.loadedNodes).pipe(\n              filter((node) => shouldLoadChildren(node)),\n              mergeMap((node) => this.loadChildren({ ...options, parent: node })),\n            )\n          : EMPTY,\n      ),\n    );\n  }\n}\n\nfunction createTreeModelNodesFactory({\n  buildNode,\n  treeNodeIdFactory,\n}: {\n  buildNode?: (node: TreeModelHierarchyNode) => TreeModelHierarchyNode;\n  treeNodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string;\n}): (node: HierarchyNode) => TreeModelHierarchyNode {\n  return (node: HierarchyNode) => {\n    const modelNode: TreeModelHierarchyNode = {\n      id: treeNodeIdFactory(node),\n      children: node.children,\n      label: node.label,\n      nodeData: node,\n    };\n    return buildNode ? buildNode(modelNode) : modelNode;\n  };\n}\n\nfunction isRowsLimitError(error: Error): error is RowsLimitExceededError {\n  return \"limit\" in error && error.message.includes(\"Query rows limit of\");\n}\n\nfunction isTimeoutError(error: Error) {\n  return error.message.includes(\"query too long to execute or server is too busy\");\n}\n"],"mappings":";;;;AA6CA,IAAakC,aAAb,MAA+C;CAC7C;CAEAG,YACE,oBACA,2BAKA,uBACAQ,mBACA;AARQP,OAAAA,qBAAAA;AACAC,OAAAA,4BAAAA;AAKAI,OAAAA,wBAAAA;AAGR,OAAKR,qBAAqBU,qBAAqBpC;;CAGjD,aAAqB,EACnBU,QACAO,0BACAG,WACAC,eAC+C;EAC/C,MAAM,EAAEP,gBAAgBC,4BAA4BE,yBAAyBP,OAAO;EACpF,MAAM6B,iBAAiB,GAAG7B,OAAO8B,MAAM;EACvC,MAAMC,wBAAwBC,4BAA4B;GACxDtB;GACAgB,mBAAmB,KAAKV;GACzB,CAAC;AACF,SAAO/B,KACL,KAAKkC,mBAAmBc,SAAS;GAC/BC,YAAYlC,OAAOmC;GACnB9B;GACAD;GACAO;GACD,CACH,CAAC,CAACyB,KACA/C,SAAS,EACTH,KAAKmD,eAA+B;AAClC,UAAOjC,kBAAkBiC,WAAWC,WAAW,IAC3C;IAAEtC;IAAQE,OAAO;KAAE4B,IAAI,GAAGD,eAAc;KAAsBJ,MAAM;KAA2B;IAAG,GAClG;IAAEzB;IAAQC,aAAaoC,WAAWnD,IAAI6C,sBAAqB;IAAG;IAClE,EACFlD,YAAY2D,QAAQ;GAClB,IAAIC,yBAAgD;AACpD,OAAID,eAAeE,OAAO;AACxB,QAAIC,iBAAiBH,IAAI,EAAE;AACzB,UAAKpB,0BAA0B;MAAEE,UAAUtB,OAAO8B;MAAI9C,QAAQoB;MAAgBmB,OAAOiB,IAAIjB;MAAO,CAAC;AACjG,YAAOnC,GAAG;MACRY;MACAE,OAAO;OACL4B,IAAI,GAAGD,eAAc,GAAIW,IAAII;OAC7BnB,MAAM;OACNoB,oBAAoBL,IAAIjB;OAC1B;MACD,CAAC;;AAEJ,QAAIuB,eAAeN,IAAI,CACrBC,0BAAyB;;AAI7B,QAAKjB,sBAAsB;IAAEF,UAAUtB,OAAO8B;IAAIL,MAAMgB;IAAwBvC,OAAOsC;IAAK,CAAC;AAC7F,UAAOpD,GAAG;IACRY;IACAE,OAAO;KACL4B,IAAI,GAAGD,eAAc;KACrBJ,MAAM;KACNmB,SAAS;KACX;IACD,CAAC;IAEN,CAAC;;CAGH,UAAiB,EAAEnC,oBAAoB,GAAGK,WAA6B;AACrE,SAAO,KAAKa,aAAab,QAAQ,CAACsB,KAChCrD,QAAQgE,eACN,iBAAiBA,aACb9D,KAAK8D,WAAW9C,YAAY,CAACmC,KAC3BpD,QAAQwB,SAASC,mBAAmBD,KAAK,CAAC,EAC1CrB,UAAUqB,SAAS,KAAKmB,aAAa;GAAE,GAAGb;GAASd,QAAQQ;GAAM,CAAC,CACpE,CAAC,GACD1B,MAER,CAAC;;;AAIL,SAASkD,4BAA4B,EACnCtB,WACAgB,qBAIkD;AAClD,SAAQlB,SAAwB;EAC9B,MAAMwC,YAAoC;GACxClB,IAAIJ,kBAAkBlB,KAAK;GAC3ByC,UAAUzC,KAAKyC;GACfC,OAAO1C,KAAK0C;GACZf,UAAU3B;GACX;AACD,SAAOE,YAAYA,UAAUsC,UAAU,GAAGA;;;AAI9C,SAASL,iBAAiBzC,OAA+C;AACvE,QAAO,WAAWA,SAASA,MAAM0C,QAAQO,SAAS,sBAAsB;;AAG1E,SAASL,eAAe5C,OAAc;AACpC,QAAOA,MAAM0C,QAAQO,SAAS,kDAAkD"}
+{"version":3,"file":"TreeLoader.js","names":["catchError","EMPTY","expand","filter","from","map","mergeMap","of","toArray","createNodeId","Observable","GenericInstanceFilter","HierarchyNode","HierarchyProvider","RowsLimitExceededError","ErrorInfo","TreeModelHierarchyNode","TreeModelRootNode","LoadedTreePart","parent","loadedNodes","error","HierarchyLevelOptions","instanceFilter","hierarchyLevelSizeLimit","LoadNodesOptions","getHierarchyLevelOptions","node","shouldLoadChildren","buildNode","ignoreCache","ITreeLoader","loadNodes","options","TreeLoader","_treeNodeIdFactory","Pick","constructor","_hierarchyProvider","_onHierarchyLimitExceeded","props","parentId","limit","_onHierarchyLoadError","type","treeNodeIdFactory","loadChildren","Omit","infoNodeIdBase","id","treeModelNodesFactory","createTreeModelNodesFactory","getNodes","parentNode","nodeData","pipe","childNodes","length","const","err","hierarchyLoadErrorType","Error","isRowsLimitError","message","resultSetSizeLimit","isTimeoutError","loadedPart","modelNode","children","label","includes"],"sources":["../../../src/presentation-hierarchies-react/internal/TreeLoader.ts"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { catchError, EMPTY, expand, filter, from, map, mergeMap, of, toArray } from \"rxjs\";\nimport { createNodeId } from \"./Utils.js\";\n\nimport type { Observable } from \"rxjs\";\nimport type {\n  GenericInstanceFilter,\n  HierarchyNode,\n  HierarchyProvider,\n  RowsLimitExceededError,\n} from \"@itwin/presentation-hierarchies\";\nimport type { ErrorInfo } from \"../TreeNode.js\";\nimport type { TreeModelHierarchyNode, TreeModelRootNode } from \"./TreeModel.js\";\n\n/** @internal */\nexport type LoadedTreePart = { parent: TreeModelHierarchyNode | TreeModelRootNode } & (\n  | { loadedNodes: TreeModelHierarchyNode[] }\n  | { error: ErrorInfo }\n);\n\n/** @internal */\nexport interface HierarchyLevelOptions {\n  instanceFilter?: GenericInstanceFilter;\n  hierarchyLevelSizeLimit?: number | \"unbounded\";\n}\n\n/** @internal */\nexport interface LoadNodesOptions {\n  parent: TreeModelHierarchyNode | TreeModelRootNode;\n  getHierarchyLevelOptions: (node: TreeModelRootNode | TreeModelHierarchyNode) => HierarchyLevelOptions;\n  shouldLoadChildren: (node: TreeModelHierarchyNode) => boolean;\n  buildNode?: (node: TreeModelHierarchyNode) => TreeModelHierarchyNode;\n  ignoreCache?: boolean;\n}\n\n/** @internal */\nexport interface ITreeLoader {\n  loadNodes(options: LoadNodesOptions): Observable<LoadedTreePart>;\n}\n\n/** @internal */\nexport class TreeLoader implements ITreeLoader {\n  private _treeNodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string;\n\n  constructor(\n    private _hierarchyProvider: HierarchyProvider,\n    private _onHierarchyLimitExceeded: (props: {\n      parentId?: string;\n      filter?: GenericInstanceFilter;\n      limit?: number | \"unbounded\";\n    }) => void,\n    private _onHierarchyLoadError: (props: { parentId?: string; type: \"timeout\" | \"unknown\"; error: unknown }) => void,\n    treeNodeIdFactory?: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string,\n  ) {\n    this._treeNodeIdFactory = treeNodeIdFactory ?? createNodeId;\n  }\n\n  private loadChildren({\n    parent,\n    getHierarchyLevelOptions,\n    buildNode,\n    ignoreCache,\n  }: Omit<LoadNodesOptions, \"shouldLoadChildren\">) {\n    const { instanceFilter, hierarchyLevelSizeLimit } = getHierarchyLevelOptions(parent);\n    const infoNodeIdBase = `${parent.id ?? \"<root>\"}`;\n    const treeModelNodesFactory = createTreeModelNodesFactory({\n      buildNode,\n      treeNodeIdFactory: this._treeNodeIdFactory,\n    });\n    return from(\n      this._hierarchyProvider.getNodes({\n        parentNode: parent.nodeData,\n        hierarchyLevelSizeLimit,\n        instanceFilter,\n        ignoreCache,\n      }),\n    ).pipe(\n      toArray(),\n      map((childNodes): LoadedTreePart => {\n        return instanceFilter && childNodes.length === 0\n          ? { parent, error: { id: `${infoNodeIdBase}-no-filter-matches`, type: \"NoFilterMatches\" as const } }\n          : { parent, loadedNodes: childNodes.map(treeModelNodesFactory) };\n      }),\n      catchError((err) => {\n        let hierarchyLoadErrorType: \"unknown\" | \"timeout\" = \"unknown\";\n        if (err instanceof Error) {\n          if (isRowsLimitError(err)) {\n            this._onHierarchyLimitExceeded({ parentId: parent.id, filter: instanceFilter, limit: err.limit });\n            return of({\n              parent,\n              error: {\n                id: `${infoNodeIdBase}-${err.message}`,\n                type: \"ResultSetTooLarge\" as const,\n                resultSetSizeLimit: err.limit,\n              },\n            });\n          }\n          if (isTimeoutError(err)) {\n            hierarchyLoadErrorType = \"timeout\";\n          }\n        }\n\n        this._onHierarchyLoadError({ parentId: parent.id, type: hierarchyLoadErrorType, error: err });\n        return of({\n          parent,\n          error: {\n            id: `${infoNodeIdBase}-ChildrenLoad`,\n            type: \"ChildrenLoad\" as const,\n            message: \"Failed to create hierarchy level\",\n          },\n        });\n      }),\n    );\n  }\n\n  public loadNodes({ shouldLoadChildren, ...options }: LoadNodesOptions) {\n    return this.loadChildren(options).pipe(\n      expand((loadedPart) =>\n        \"loadedNodes\" in loadedPart\n          ? from(loadedPart.loadedNodes).pipe(\n              filter((node) => shouldLoadChildren(node)),\n              mergeMap((node) => this.loadChildren({ ...options, parent: node })),\n            )\n          : EMPTY,\n      ),\n    );\n  }\n}\n\nfunction createTreeModelNodesFactory({\n  buildNode,\n  treeNodeIdFactory,\n}: {\n  buildNode?: (node: TreeModelHierarchyNode) => TreeModelHierarchyNode;\n  treeNodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string;\n}): (node: HierarchyNode) => TreeModelHierarchyNode {\n  return (node: HierarchyNode) => {\n    const modelNode: TreeModelHierarchyNode = {\n      id: treeNodeIdFactory(node),\n      children: node.children,\n      label: node.label,\n      nodeData: node,\n    };\n    return buildNode ? buildNode(modelNode) : modelNode;\n  };\n}\n\nfunction isRowsLimitError(error: Error): error is RowsLimitExceededError {\n  return \"limit\" in error && error.message.includes(\"Query rows limit of\");\n}\n\nfunction isTimeoutError(error: Error) {\n  return error.message.includes(\"query too long to execute or server is too busy\");\n}\n"],"mappings":";;;;AA6CA,IAAakC,aAAb,MAA+C;CAInCI;CACAC;CAKAI;CATV;CAEAN,YACE,oBACA,2BAKA,uBACAQ,mBACA;EARQP,KAAAA,qBAAAA;EACAC,KAAAA,4BAAAA;EAKAI,KAAAA,wBAAAA;EAGR,KAAKR,qBAAqBU,qBAAqBpC;CACjD;CAEA,aAAqB,EACnBU,QACAO,0BACAG,WACAC,eAC+C;EAC/C,MAAM,EAAEP,gBAAgBC,4BAA4BE,yBAAyBP,MAAM;EACnF,MAAM6B,iBAAiB,GAAG7B,OAAO8B,MAAM;EACvC,MAAMC,wBAAwBC,4BAA4B;GACxDtB;GACAgB,mBAAmB,KAAKV;EAC1B,CAAC;EACD,OAAO/B,KACL,KAAKkC,mBAAmBc,SAAS;GAC/BC,YAAYlC,OAAOmC;GACnB9B;GACAD;GACAO;EACF,CAAC,CACH,CAAC,CAACyB,KACA/C,QAAQ,GACRH,KAAKmD,eAA+B;GAClC,OAAOjC,kBAAkBiC,WAAWC,WAAW,IAC3C;IAAEtC;IAAQE,OAAO;KAAE4B,IAAI,GAAGD,eAAc;KAAsBJ,MAAM;IAA2B;GAAE,IACjG;IAAEzB;IAAQC,aAAaoC,WAAWnD,IAAI6C,qBAAqB;GAAE;EACnE,CAAC,GACDlD,YAAY2D,QAAQ;GAClB,IAAIC,yBAAgD;GACpD,IAAID,eAAeE,OAAO;IACxB,IAAIC,iBAAiBH,GAAG,GAAG;KACzB,KAAKpB,0BAA0B;MAAEE,UAAUtB,OAAO8B;MAAI9C,QAAQoB;MAAgBmB,OAAOiB,IAAIjB;KAAM,CAAC;KAChG,OAAOnC,GAAG;MACRY;MACAE,OAAO;OACL4B,IAAI,GAAGD,eAAc,GAAIW,IAAII;OAC7BnB,MAAM;OACNoB,oBAAoBL,IAAIjB;MAC1B;KACF,CAAC;IACH;IACA,IAAIuB,eAAeN,GAAG,GACpBC,yBAAyB;GAE7B;GAEA,KAAKjB,sBAAsB;IAAEF,UAAUtB,OAAO8B;IAAIL,MAAMgB;IAAwBvC,OAAOsC;GAAI,CAAC;GAC5F,OAAOpD,GAAG;IACRY;IACAE,OAAO;KACL4B,IAAI,GAAGD,eAAc;KACrBJ,MAAM;KACNmB,SAAS;IACX;GACF,CAAC;EACH,CAAC,CACH;CACF;CAEA,UAAiB,EAAEnC,oBAAoB,GAAGK,WAA6B;EACrE,OAAO,KAAKa,aAAab,OAAO,CAAC,CAACsB,KAChCrD,QAAQgE,eACN,iBAAiBA,aACb9D,KAAK8D,WAAW9C,WAAW,CAAC,CAACmC,KAC3BpD,QAAQwB,SAASC,mBAAmBD,IAAI,CAAC,GACzCrB,UAAUqB,SAAS,KAAKmB,aAAa;GAAE,GAAGb;GAASd,QAAQQ;EAAK,CAAC,CAAC,CACpE,IACA1B,KACN,CACF;CACF;AACF;AAEA,SAASkD,4BAA4B,EACnCtB,WACAgB,qBAIkD;CAClD,QAAQlB,SAAwB;EAC9B,MAAMwC,YAAoC;GACxClB,IAAIJ,kBAAkBlB,IAAI;GAC1ByC,UAAUzC,KAAKyC;GACfC,OAAO1C,KAAK0C;GACZf,UAAU3B;EACZ;EACA,OAAOE,YAAYA,UAAUsC,SAAS,IAAIA;CAC5C;AACF;AAEA,SAASL,iBAAiBzC,OAA+C;CACvE,OAAO,WAAWA,SAASA,MAAM0C,QAAQO,SAAS,qBAAqB;AACzE;AAEA,SAASL,eAAe5C,OAAc;CACpC,OAAOA,MAAM0C,QAAQO,SAAS,iDAAiD;AACjF"}

package/lib/presentation-hierarchies-react/internal/TreeModel.d.ts

@@ -1 +1,3 @@
+import "../TreeNode.js";
+import "../UseSelectionHandler.js";
 import { GenericInstanceFilter, HierarchyNode } from "@itwin/presentation-hierarchies";