@itwin/presentation-hierarchies-react 1.6.0 → 2.0.0-alpha.0

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

@@ -1 +0,0 @@
-{"version":3,"file":"UseTree.js","sourceRoot":"","sources":["../../../src/presentation-hierarchies-react/UseTree.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAiDhG,0BAGC;AAiBD,0DAMC;AAzED,iCAAiE;AACjE,8EAAkI;AAElI,8DAAwD;AACxD,0DAA6J;AAC7J,8EAA0G;AAC1G,kDAAkD;AA6BlD;;;;;;;;;;;GAWG;AACH,SAAgB,OAAO,CAAC,KAAmB;IACzC,MAAM,EAAE,gBAAgB,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAChE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAgB,uBAAuB,CAAC,EAAE,UAAU,EAAE,gBAAgB,EAAE,GAAG,KAAK,EAA+C;IAC7H,MAAM,EAAE,gBAAgB,EAAE,GAAG,IAAI,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAC7D,OAAO;QACL,GAAG,IAAI;QACP,GAAG,IAAA,gDAAuB,EAAC,EAAE,UAAU,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,CAAC;KAC/E,CAAC;AACJ,CAAC;AA8ED,SAAS,eAAe,CAAC,EACvB,oBAAoB,EACpB,gBAAgB,EAChB,qBAAqB,EACrB,wBAAwB,EACxB,oBAAoB,GACP;IAGb,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAA,gBAAQ,EAAY;QAC5C,KAAK,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,cAAc,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE;QAC3G,SAAS,EAAE,SAAS;KACrB,CAAC,CAAC;IACH,MAAM,wBAAwB,GAAG,SAAS,CAAC,qBAAqB,CAAC,CAAC;IAClE,MAAM,2BAA2B,GAAG,SAAS,CAAC,wBAAwB,CAAC,CAAC;IACxE,MAAM,uBAAuB,GAAG,SAAS,CAAC,oBAAoB,CAAC,CAAC;IAEhE,MAAM,CAAC,OAAO,CAAC,GAAG,IAAA,gBAAQ,EACxB,GAAG,EAAE,CACH,IAAI,4BAAW,CACb,CAAC,KAAK,EAAE,EAAE;QACR,MAAM,SAAS,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1H,QAAQ,CAAC;YACP,KAAK;YACL,SAAS;SACV,CAAC,CAAC;IACL,CAAC,EACD,CAAC,UAAU,EAAE,QAAQ,EAAE,EAAE,CAAC,wBAAwB,CAAC,OAAO,EAAE,CAAC,UAAU,EAAE,QAAQ,CAAC,EAClF,CAAC,KAAK,EAAE,EAAE,CAAC,2BAA2B,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,EACvD,CAAC,KAAK,EAAE,EAAE,CAAC,uBAAuB,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CACpD,CACJ,CAAC;IACF,MAAM,gBAAgB,GAAG,IAAA,cAAM,GAA4B,CAAC;IAE5D,MAAM,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,GAAG,IAAA,gBAAQ,GAAiC,CAAC;IAC5F,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;QACxC,QAAQ,CAAC,YAAY,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,8BAA8B,GAAG,QAAQ,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC,mBAAmB,EAAE,EAAE;YACnG,MAAM,kBAAkB,GAAG,mBAAmB,EAAE,YAAY,EAAE,SAAS,KAAK,SAAS,CAAC;YACtF,OAAO,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QACvC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAC/B,OAAO,GAAG,EAAE;YACV,8BAA8B,EAAE,CAAC;YACjC,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,IAAA,sBAAW,EAAC,QAAQ,CAAC,CAAC;QACxB,CAAC,CAAC;IACJ,CAAC,EAAE,CAAC,OAAO,EAAE,oBAAoB,CAAC,CAAC,CAAC;IAEpC,MAAM,CAAC,WAAW,EAAE,cAAc,CAAC,GAAG,IAAA,gBAAQ,EAAC,KAAK,CAAC,CAAC;IACtD,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,CAAC,KAAK,IAAI,EAAE;YACf,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACvB,OAAO;YACT,CAAC;YAED,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACtB,iBAAiB,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;gBAChD,6FAA6F;gBAC7F,OAAO,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;gBACtC,cAAc,CAAC,KAAK,CAAC,CAAC;gBACtB,OAAO;YACT,CAAC;YAED,cAAc,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,KAA2C,CAAC;YAChD,IAAI,CAAC;gBACH,KAAK,GAAG,MAAM,gBAAgB,EAAE,CAAC;YACnC,CAAC;YAAC,MAAM,CAAC;YACT,CAAC;oBAAS,CAAC;gBACT,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,iBAAiB,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBACpE,cAAc,CAAC,KAAK,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC,CAAC,EAAE,CAAC;QACL,OAAO,GAAG,EAAE;YACV,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC,CAAC;IACJ,CAAC,EAAE,CAAC,iBAAiB,EAAE,gBAAgB,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,MAAM,gBAAgB,GAAG,IAAA,mBAAW,EAClC,CAAC,MAAc,EAAE,EAAE;QACjB,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC,EACD,CAAC,OAAO,CAAC,CACV,CAAC;IAEF,MAAM,OAAO,GAAG,IAAA,mBAAW,EACzB,CAAC,MAAc,EAAyC,EAAE;QACxD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAA,uCAAwB,EAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,+BAA+B,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC,EACD,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CACvB,CAAC;IAEF,MAAM,UAAU,GAAG,IAAA,mBAAW,EAC5B,CAAC,MAAc,EAAE,UAAmB,EAAE,EAAE;QACtC,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC,EACD,CAAC,OAAO,CAAC,CACV,CAAC;IAEF,MAAM,UAAU,GAAG,IAAA,mBAAW,EAC5B,CAAC,OAAO,EAAE,EAAE;QACV,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC,EACD,CAAC,OAAO,CAAC,CACV,CAAC;IAEF,MAAM,WAAW,GAAG,IAAA,mBAAW,EAC7B,CAAC,OAAsB,EAAE,UAA+B,EAAE,EAAE;QAC1D,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC3C,CAAC,EACD,CAAC,OAAO,CAAC,CACV,CAAC;IAEF,MAAM,cAAc,GAAG,IAAA,mBAAW,EAAkC,CAAC,MAAc,EAAE,EAAE,CAAC,wBAAS,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAEhJ,MAAM,YAAY,GAAG,IAAA,mBAAW,EAC9B,CAAC,SAA+C,EAAE,EAAE;QAClD,gBAAgB,CAAC,OAAO,GAAG,SAAS,CAAC;QACrC,sBAAsB;QACtB,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QAED,iBAAiB,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC,EACD,CAAC,iBAAiB,CAAC,CACpB,CAAC;IAEF,MAAM,wBAAwB,GAAG,IAAA,mBAAW,EAC1C,CAAC,MAAM,EAAE,EAAE;QACT,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,iBAAiB,IAAI,CAAC,IAAI,IAAI,IAAA,kCAAmB,EAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC;QACpC,IAAI,aAAa,IAAI,wCAAa,CAAC,cAAc,CAAC,aAAa,CAAC,EAAE,CAAC;YACjE,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO;YACL,aAAa;YACb,uBAAuB,EAAE,CAAC,KAAK,EAAE,EAAE,CACjC,iBAAiB,CAAC,mBAAmB,CAAC;gBACpC,UAAU,EAAE,aAAa;gBACzB,cAAc,EAAE,KAAK,EAAE,cAAc;gBACrC,uBAAuB,EAAE,KAAK,EAAE,uBAAuB;aACxD,CAAC;YACJ,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,iBAAiB,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAC;YACxE,SAAS,EAAE,IAAI,CAAC,cAAc;YAC9B,YAAY,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC;SAClE,CAAC;IACJ,CAAC,EACD,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAC7B,CAAC;IAEF,OAAO;QACL,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,IAAI,WAAW;QAC1D,UAAU;QACV,UAAU;QACV,WAAW;QACX,cAAc;QACd,gBAAgB;QAChB,OAAO;QACP,wBAAwB;QACxB,YAAY;KACb,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,YAAgC,EAAE,KAAgB;IAC/E,MAAM,eAAe,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC/D,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,eAAe;SACnB,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;SAC7C,MAAM,CAAC,CAAC,IAAI,EAAyB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAC/C,GAAG,CAAuB,CAAC,IAAI,EAAE,EAAE;QAClC,IAAI,IAAA,uCAAwB,EAAC,IAAI,CAAC,EAAE,CAAC;YACnC,OAAO,+BAA+B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;YACtC,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,YAAY;gBACZ,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;aAC5C,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;YACpC,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,YAAY;gBACZ,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,YAAY;YACZ,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;SACtB,CAAC;IACJ,CAAC,CAAC,CAAC;AACP,CAAC;AAED,SAAS,+BAA+B,CAAC,SAAiC,EAAE,KAAgB;IAC1F,IAAI,QAAiD,CAAC;IACtD,OAAO;QACL,GAAG,+BAA+B,CAAC,SAAS,CAAC;QAC7C,IAAI,QAAQ;YACV,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,QAAQ,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACxD,CAAC;YACD,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,+BAA+B,CAAC,IAA4B;IACnE,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS;QAC3B,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU;QAC7B,YAAY,EAAE,CAAC,wCAAa,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,IAAI,IAAI,CAAC,QAAQ;QAChH,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc;QACjC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY;KACzC,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAI,KAAQ;IAC5B,MAAM,GAAG,GAAG,IAAA,cAAM,EAAC,KAAK,CAAC,CAAC;IAC1B,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,GAAG,CAAC,OAAO,GAAG,KAAK,CAAC;IACtB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAEZ,OAAO,GAAG,CAAC;AACb,CAAC","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, useState } from \"react\";\nimport { GenericInstanceFilter, HierarchyFilteringPath, HierarchyNode, HierarchyProvider } from \"@itwin/presentation-hierarchies\";\nimport { InstanceKey, IPrimitiveValueFormatter } from \"@itwin/presentation-shared\";\nimport { TreeActions } from \"./internal/TreeActions.js\";\nimport { isTreeModelHierarchyNode, isTreeModelInfoNode, TreeModel, TreeModelHierarchyNode, TreeModelNode, TreeModelRootNode } from \"./internal/TreeModel.js\";\nimport { useUnifiedTreeSelection, UseUnifiedTreeSelectionProps } from \"./internal/UseUnifiedSelection.js\";\nimport { safeDispose } from \"./internal/Utils.js\";\nimport { PresentationHierarchyNode, PresentationTreeNode } from \"./TreeNode.js\";\nimport { SelectionChangeType } from \"./UseSelectionHandler.js\";\n\n/**\n * A data structure that contains information about a single hierarchy level.\n * @public\n */\nexport interface HierarchyLevelDetails {\n  /** The parent node whose hierarchy level's information is contained in this data structure */\n  hierarchyNode: HierarchyNode | undefined;\n\n  /** A function to get instance keys of the hierarchy level. */\n  getInstanceKeysIterator: (props?: {\n    instanceFilter?: GenericInstanceFilter;\n    hierarchyLevelSizeLimit?: number | \"unbounded\";\n  }) => AsyncIterableIterator<InstanceKey>;\n\n  /** Get the limit of how many nodes can be loaded in this hierarchy level. */\n  sizeLimit?: number | \"unbounded\";\n  /** Set the limit of how many nodes can be loaded in this hierarchy level. */\n  setSizeLimit: (value: undefined | number | \"unbounded\") => void;\n\n  /** Get the active instance filter applied to this hierarchy level. */\n  instanceFilter?: GenericInstanceFilter;\n  /** Set the instance filter to apply to this hierarchy level */\n  setInstanceFilter: (filter: GenericInstanceFilter | undefined) => void;\n}\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({ sourceName, selectionStorage, ...props }: UseTreeProps & UseUnifiedTreeSelectionProps): UseTreeResult {\n  const { getTreeModelNode, ...rest } = useTreeInternal(props);\n  return {\n    ...rest,\n    ...useUnifiedTreeSelection({ sourceName, selectionStorage, getTreeModelNode }),\n  };\n}\n\n/** @public */\nexport interface UseTreeProps {\n  /** Provides the hierarchy provider for the tree. */\n  getHierarchyProvider: () => HierarchyProvider;\n  /** Provides paths to filtered nodes. */\n  getFilteredPaths?: () => Promise<HierarchyFilteringPath[] | 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: { parentId?: string; filter?: GenericInstanceFilter; limit?: number | \"unbounded\" }) => 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\n/**\n * Options for doing either full or a sub tree reload.\n * @public\n */\ninterface ReloadTreeOptions {\n  /** Specifies parent node under which sub tree should be reloaded. */\n  parentNodeId: string | undefined;\n\n  /**\n   * Specifies how current tree state should be handled:\n   * - `keep` - try to keep current tree state (expanded/collapsed nodes, instance filters, etc.).\n   * - `discard` - do not try to keep current tree state. Tree model will be update after nodes are reloaded.\n   * - `reset` - remove subtree from the model before reloading and reload nodes ignoring cache.\n   *\n   * Defaults to `\"keep\"`.\n   */\n  state?: \"keep\" | \"discard\" | \"reset\";\n}\n\n/** @public */\nexport interface UseTreeResult {\n  /**\n   * Array containing root tree nodes. It is `undefined` on initial render until any nodes are loaded.\n   */\n  rootNodes: PresentationTreeNode[] | undefined;\n  /**\n   * Specifies whether tree is loading or not. It is set to `true` when initial tree load is in progress\n   * or tree is reloading.\n   */\n  isLoading: boolean;\n  /**\n   * A function that should be called to reload the tree.\n   */\n  reloadTree: (options?: ReloadTreeOptions) => void;\n  /**\n   * A function that should be called to either expand or collapse the given node.\n   */\n  expandNode: (nodeId: string, isExpanded: boolean) => void;\n  /**\n   * A function that should be called to select nodes in the tree.\n   * @param nodeIds Ids of the nodes that are selected.\n   * @param changeType Type of change that occurred for the selection.\n   */\n  selectNodes: (nodeIds: Array<string>, changeType: SelectionChangeType) => void;\n  /** Determines whether a given node is selected. */\n  isNodeSelected: (nodeId: string) => boolean;\n  /** Get a tree node by id */\n  getNode: (nodeId: string) => PresentationHierarchyNode | undefined;\n  /** Returns hierarchy level details for a given node ID. */\n  getHierarchyLevelDetails: (nodeId: string | undefined) => HierarchyLevelDetails | undefined;\n  /** Sets a formatter for the primitive values that are displayed in the hierarchy. */\n  setFormatter: (formatter: IPrimitiveValueFormatter | undefined) => void;\n}\n\ninterface TreeState {\n  model: TreeModel;\n  rootNodes: Array<PresentationTreeNode> | undefined;\n}\n\nfunction useTreeInternal({\n  getHierarchyProvider,\n  getFilteredPaths,\n  onPerformanceMeasured,\n  onHierarchyLimitExceeded,\n  onHierarchyLoadError,\n}: UseTreeProps): UseTreeResult & {\n  getTreeModelNode: (nodeId: string) => TreeModelRootNode | TreeModelNode | 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\n  const [actions] = useState<TreeActions>(\n    () =>\n      new TreeActions(\n        (model) => {\n          const rootNodes = model.parentChildMap.get(undefined) !== undefined ? generateTreeStructure(undefined, model) : undefined;\n          setState({\n            model,\n            rootNodes,\n          });\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?.filterChange?.newFilter !== 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 [isFiltering, setIsFiltering] = useState(false);\n  useEffect(() => {\n    let disposed = false;\n    void (async () => {\n      if (!hierarchyProvider) {\n        return;\n      }\n\n      if (!getFilteredPaths) {\n        hierarchyProvider.setHierarchyFilter(undefined);\n        // reload tree in case hierarchy provider does not use hierarchy filter to load initial nodes\n        actions.reloadTree({ state: \"keep\" });\n        setIsFiltering(false);\n        return;\n      }\n\n      setIsFiltering(true);\n      let paths: HierarchyFilteringPath[] | undefined;\n      try {\n        paths = await getFilteredPaths();\n      } catch {\n      } finally {\n        if (!disposed) {\n          hierarchyProvider.setHierarchyFilter(paths ? { paths } : undefined);\n          setIsFiltering(false);\n        }\n      }\n    })();\n    return () => {\n      disposed = true;\n    };\n  }, [hierarchyProvider, getFilteredPaths, actions]);\n\n  const getTreeModelNode = useCallback<(nodeId: string) => TreeModelRootNode | TreeModelNode | undefined>(\n    (nodeId: string) => {\n      return actions.getNode(nodeId);\n    },\n    [actions],\n  );\n\n  const getNode = useCallback(\n    (nodeId: string): PresentationHierarchyNode | undefined => {\n      const node = actions.getNode(nodeId);\n      if (!node || !isTreeModelHierarchyNode(node)) {\n        return undefined;\n      }\n      return createPresentationHierarchyNode(node, state.model);\n    },\n    [actions, state.model],\n  );\n\n  const expandNode = useCallback<UseTreeResult[\"expandNode\"]>(\n    (nodeId: string, isExpanded: boolean) => {\n      actions.expandNode(nodeId, isExpanded);\n    },\n    [actions],\n  );\n\n  const reloadTree = useCallback<UseTreeResult[\"reloadTree\"]>(\n    (options) => {\n      actions.reloadTree(options);\n    },\n    [actions],\n  );\n\n  const selectNodes = useCallback<UseTreeResult[\"selectNodes\"]>(\n    (nodeIds: Array<string>, changeType: SelectionChangeType) => {\n      actions.selectNodes(nodeIds, changeType);\n    },\n    [actions],\n  );\n\n  const isNodeSelected = useCallback<UseTreeResult[\"isNodeSelected\"]>((nodeId: string) => TreeModel.isNodeSelected(state.model, nodeId), [state]);\n\n  const setFormatter = useCallback<UseTreeResult[\"setFormatter\"]>(\n    (formatter: IPrimitiveValueFormatter | undefined) => {\n      currentFormatter.current = formatter;\n      /* c8 ignore next 3 */\n      if (!hierarchyProvider) {\n        return;\n      }\n\n      hierarchyProvider.setFormatter(formatter);\n    },\n    [hierarchyProvider],\n  );\n\n  const getHierarchyLevelDetails = useCallback<UseTreeResult[\"getHierarchyLevelDetails\"]>(\n    (nodeId) => {\n      const node = actions.getNode(nodeId);\n      if (!hierarchyProvider || !node || isTreeModelInfoNode(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  return {\n    rootNodes: state.rootNodes,\n    isLoading: !!state.model.rootNode.isLoading || isFiltering,\n    expandNode,\n    reloadTree,\n    selectNodes,\n    isNodeSelected,\n    getTreeModelNode,\n    getNode,\n    getHierarchyLevelDetails,\n    setFormatter,\n  };\n}\n\nfunction generateTreeStructure(parentNodeId: string | undefined, model: TreeModel): Array<PresentationTreeNode> | 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 TreeModelNode => !!node)\n    .map<PresentationTreeNode>((node) => {\n      if (isTreeModelHierarchyNode(node)) {\n        return createPresentationHierarchyNode(node, model);\n      }\n\n      if (node.type === \"ResultSetTooLarge\") {\n        return {\n          id: node.id,\n          parentNodeId,\n          type: node.type,\n          resultSetSizeLimit: node.resultSetSizeLimit,\n        };\n      }\n\n      if (node.type === \"NoFilterMatches\") {\n        return {\n          id: node.id,\n          parentNodeId,\n          type: node.type,\n        };\n      }\n\n      return {\n        id: node.id,\n        parentNodeId,\n        type: node.type,\n        message: node.message,\n      };\n    });\n}\n\nfunction createPresentationHierarchyNode(modelNode: TreeModelHierarchyNode, model: TreeModel): PresentationHierarchyNode {\n  let children: Array<PresentationTreeNode> | undefined;\n  return {\n    ...toPresentationHierarchyNodeBase(modelNode),\n    get children() {\n      if (!children) {\n        children = generateTreeStructure(modelNode.id, model);\n      }\n      return children ? children : modelNode.children === true ? true : [];\n    },\n  };\n}\n\nfunction toPresentationHierarchyNodeBase(node: TreeModelHierarchyNode): Omit<PresentationHierarchyNode, \"children\"> {\n  return {\n    id: node.id,\n    label: node.label,\n    nodeData: node.nodeData,\n    isLoading: !!node.isLoading,\n    isExpanded: !!node.isExpanded,\n    isFilterable: !HierarchyNode.isGroupingNode(node.nodeData) && !!node.nodeData.supportsFiltering && node.children,\n    isFiltered: !!node.instanceFilter,\n    extendedData: node.nodeData.extendedData,\n  };\n}\n\nfunction useLatest<T>(value: T) {\n  const ref = useRef(value);\n  useEffect(() => {\n    ref.current = value;\n  }, [value]);\n\n  return ref;\n}\n"]}

package/lib/cjs/presentation-hierarchies-react/internal/DisposePolyfill.d.ts

@@ -1 +0,0 @@
-//# sourceMappingURL=DisposePolyfill.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"DisposePolyfill.d.ts","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/DisposePolyfill.ts"],"names":[],"mappings":""}

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

@@ -1,11 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-/**
- * Polyfill for upcoming resource management feature: https://github.com/tc39/proposal-explicit-resource-management
- */
-Symbol.dispose ??= Symbol("Symbol.dispose");
-Symbol.asyncDispose ??= Symbol("Symbol.asyncDispose");
-//# sourceMappingURL=DisposePolyfill.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"DisposePolyfill.js","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/DisposePolyfill.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAEhG;;GAEG;AACF,MAAc,CAAC,OAAO,KAAK,MAAM,CAAC,gBAAgB,CAAC,CAAC;AACpD,MAAc,CAAC,YAAY,KAAK,MAAM,CAAC,qBAAqB,CAAC,CAAC","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"]}

package/lib/cjs/presentation-hierarchies-react/internal/TreeActions.d.ts

@@ -1,53 +0,0 @@
-import "./DisposePolyfill.js";
-import { GenericInstanceFilter, HierarchyNode, HierarchyProvider } from "@itwin/presentation-hierarchies";
-import { SelectionChangeType } from "../UseSelectionHandler.js";
-import { TreeModel, TreeModelNode, TreeModelRootNode } from "./TreeModel.js";
-/** @internal */
-export declare class TreeActions {
-    private _onModelChanged;
-    private _onLoad;
-    private _onHierarchyLimitExceeded;
-    private _onHierarchyLoadError;
-    private _loader;
-    private _nodeIdFactory;
-    private _currentModel;
-    private _reset;
-    private _nodeLoader;
-    constructor(_onModelChanged: (model: TreeModel) => void, _onLoad: (actionType: "initial-load" | "hierarchy-level-load" | "reload", duration: number) => void, _onHierarchyLimitExceeded: (props: {
-        parentId?: string;
-        filter?: GenericInstanceFilter;
-        limit?: number | "unbounded";
-    }) => void, _onHierarchyLoadError: (props: {
-        parentId?: string;
-        type: "timeout" | "unknown";
-        error: unknown;
-    }) => void, nodeIdFactory?: (node: Pick<HierarchyNode, "key" | "parentKeys">) => string, seed?: TreeModel);
-    private createNodeLoader;
-    private updateTreeModel;
-    private handleLoadedHierarchy;
-    private onLoadingComplete;
-    private getLoadAction;
-    private loadSubTree;
-    private loadNodes;
-    private reloadSubTree;
-    reset(): void;
-    setHierarchyProvider(provider?: HierarchyProvider): void;
-    getNode(nodeId: string | undefined): TreeModelNode | TreeModelRootNode | undefined;
-    selectNodes(nodeIds: Array<string>, changeType: SelectionChangeType): void;
-    expandNode(nodeId: string, isExpanded: boolean): {
-        complete: Promise<void>;
-    };
-    setHierarchyLimit(nodeId: string | undefined, limit?: number | "unbounded"): {
-        complete: Promise<void>;
-    };
-    setInstanceFilter(nodeId: string | undefined, filter?: GenericInstanceFilter): {
-        complete: Promise<void>;
-    };
-    reloadTree(options?: {
-        parentNodeId?: string;
-        state?: "keep" | "discard" | "reset";
-    }): {
-        complete: Promise<void>;
-    };
-}
-//# sourceMappingURL=TreeActions.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TreeActions.d.ts","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeActions.ts"],"names":[],"mappings":"AAKA,OAAO,sBAAsB,CAAC;AAG9B,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAC1G,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAEhE,OAAO,EAAiD,SAAS,EAA0B,aAAa,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAcpJ,gBAAgB;AAChB,qBAAa,WAAW;IAQpB,OAAO,CAAC,eAAe;IACvB,OAAO,CAAC,OAAO;IACf,OAAO,CAAC,yBAAyB;IACjC,OAAO,CAAC,qBAAqB;IAV/B,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,cAAc,CAA8D;IACpF,OAAO,CAAC,aAAa,CAAY;IACjC,OAAO,CAAC,MAAM,CAAuB;IACrC,OAAO,CAAC,WAAW,CAAqC;gBAG9C,eAAe,EAAE,CAAC,KAAK,EAAE,SAAS,KAAK,IAAI,EAC3C,OAAO,EAAE,CAAC,UAAU,EAAE,cAAc,GAAG,sBAAsB,GAAG,QAAQ,EAAE,QAAQ,EAAE,MAAM,KAAK,IAAI,EACnG,yBAAyB,EAAE,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,qBAAqB,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,GAAG,WAAW,CAAA;KAAE,KAAK,IAAI,EAC/H,qBAAqB,EAAE,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE,KAAK,IAAI,EAClH,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,KAAK,GAAG,YAAY,CAAC,KAAK,MAAM,EAC3E,IAAI,CAAC,EAAE,SAAS;IAalB,OAAO,CAAC,gBAAgB;IAuDxB,OAAO,CAAC,eAAe;IAUvB,OAAO,CAAC,qBAAqB;IAM7B,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,aAAa;IAIrB,OAAO,CAAC,WAAW;IAWnB,OAAO,CAAC,SAAS;IAejB,OAAO,CAAC,aAAa;IAwCd,KAAK;IAIL,oBAAoB,CAAC,QAAQ,CAAC,EAAE,iBAAiB;IAiBjD,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa,GAAG,iBAAiB,GAAG,SAAS;IAIlF,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,mBAAmB;IAMnE,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO;;;IAa9C,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,WAAW;;;IAc1E,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,qBAAqB;;;IAc5E,UAAU,CAAC,OAAO,CAAC,EAAE;QAAE,YAAY,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAA;KAAE;;;CAa5F"}

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

@@ -1,311 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TreeActions = void 0;
-require("./DisposePolyfill.js");
-const immer_1 = require("immer");
-const rxjs_1 = require("rxjs");
-const presentation_hierarchies_1 = require("@itwin/presentation-hierarchies");
-const TreeLoader_js_1 = require("./TreeLoader.js");
-const TreeModel_js_1 = require("./TreeModel.js");
-const Utils_js_1 = require("./Utils.js");
-(0, immer_1.enableMapSet)();
-/** @internal */
-class TreeActions {
-    _onModelChanged;
-    _onLoad;
-    _onHierarchyLimitExceeded;
-    _onHierarchyLoadError;
-    _loader;
-    _nodeIdFactory;
-    _currentModel;
-    _reset = new rxjs_1.Subject();
-    _nodeLoader;
-    constructor(_onModelChanged, _onLoad, _onHierarchyLimitExceeded, _onHierarchyLoadError, nodeIdFactory, seed) {
-        this._onModelChanged = _onModelChanged;
-        this._onLoad = _onLoad;
-        this._onHierarchyLimitExceeded = _onHierarchyLimitExceeded;
-        this._onHierarchyLoadError = _onHierarchyLoadError;
-        this._loader = new NoopTreeLoader();
-        this._nodeIdFactory = nodeIdFactory ?? Utils_js_1.createNodeId;
-        this._currentModel = seed ?? /* c8 ignore next */ {
-            idToNode: new Map(),
-            parentChildMap: new Map(),
-            rootNode: { id: undefined, nodeData: undefined },
-        };
-        this._nodeLoader = this.createNodeLoader();
-    }
-    createNodeLoader() {
-        const subject = new rxjs_1.Subject();
-        subject
-            .pipe((0, rxjs_1.groupBy)((item) => item.parentId), (0, rxjs_1.mergeMap)((group) => group.pipe((0, rxjs_1.buffer)(group.pipe((0, rxjs_1.debounceTime)(0))), (0, rxjs_1.map)((groupArr) => {
-            let returnIndex = groupArr.length - 1;
-            groupArr.forEach((member, index) => {
-                if (member.discardState) {
-                    returnIndex = index;
-                }
-            });
-            groupArr.forEach((member, index) => {
-                if (index === returnIndex) {
-                    return;
-                }
-                member.timeTracker?.[Symbol.dispose];
-                member.onComplete();
-            });
-            return groupArr[returnIndex];
-        }), (0, rxjs_1.switchMap)((props) => this._loader.loadNodes(props.loadOptions).pipe(collectTreePartsUntil(this._reset, props.initialRootNode), (0, rxjs_1.tap)({
-            next: (newModel) => {
-                const childNodes = newModel.parentChildMap.get(props.parentId);
-                const firstChildNode = childNodes?.length ? newModel.idToNode.get(childNodes[0]) : undefined;
-                this.handleLoadedHierarchy(props.parentId, newModel);
-                // only report load duration if no error occurs
-                if (!(firstChildNode && (0, TreeModel_js_1.isTreeModelInfoNode)(firstChildNode))) {
-                    props.timeTracker?.finish();
-                }
-            },
-            complete: () => {
-                this.onLoadingComplete(props.parentId);
-                props.timeTracker?.[Symbol.dispose]();
-                props.onComplete();
-            },
-        }))))))
-            .subscribe();
-        return subject;
-    }
-    updateTreeModel(updater) {
-        const newModel = (0, immer_1.produce)(this._currentModel, updater);
-        if (this._currentModel === newModel) {
-            return;
-        }
-        this._currentModel = newModel;
-        this._onModelChanged(this._currentModel);
-    }
-    handleLoadedHierarchy(parentId, loadedHierarchy) {
-        this.updateTreeModel((model) => {
-            TreeModel_js_1.TreeModel.addHierarchyPart(model, parentId, loadedHierarchy);
-        });
-    }
-    onLoadingComplete(parentId) {
-        this.updateTreeModel((model) => {
-            TreeModel_js_1.TreeModel.setIsLoading(model, parentId, false);
-        });
-    }
-    getLoadAction(parentId) {
-        return this._currentModel.idToNode.size === 0 ? "initial-load" : parentId === undefined ? "reload" : "hierarchy-level-load";
-    }
-    loadSubTree(options, initialRootNode, discardState) {
-        const loadAction = this.getLoadAction(options.parent.id);
-        const timeTracker = new TimeTracker((time) => this._onLoad(loadAction, time));
-        return {
-            complete: new Promise((resolve) => {
-                this._nodeLoader.next({ loadOptions: options, onComplete: resolve, timeTracker, parentId: options.parent.id, initialRootNode, discardState });
-            }),
-        };
-    }
-    loadNodes(parentId, ignoreCache) {
-        const parentNode = this._currentModel.idToNode.get(parentId);
-        /* c8 ignore next 3 */
-        if (!parentNode || !(0, TreeModel_js_1.isTreeModelHierarchyNode)(parentNode)) {
-            return { complete: Promise.resolve() };
-        }
-        return this.loadSubTree({
-            parent: parentNode,
-            getHierarchyLevelOptions: (node) => createHierarchyLevelOptions(this._currentModel, getNonGroupedParentId(node, this._nodeIdFactory)),
-            shouldLoadChildren: (node) => !!node.nodeData.autoExpand,
-            ignoreCache,
-        });
-    }
-    reloadSubTree(parentId, oldModel, options) {
-        const currModel = this._currentModel;
-        const expandedNodes = !!options?.discardState ? [] : collectNodes(parentId, oldModel, (node) => node.isExpanded === true);
-        const collapsedNodes = !!options?.discardState ? [] : collectNodes(parentId, oldModel, (node) => node.isExpanded === false);
-        const getHierarchyLevelOptions = (node) => {
-            if (!!options?.discardState) {
-                return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };
-            }
-            const filteredNodeId = getNonGroupedParentId(node, this._nodeIdFactory);
-            return createHierarchyLevelOptions(filteredNodeId === parentId ? currModel : oldModel, filteredNodeId);
-        };
-        const shouldLoadChildren = (node) => {
-            if (expandedNodes.findIndex((expandedNode) => (0, Utils_js_1.sameNodes)(expandedNode.nodeData, node.nodeData)) !== -1) {
-                return true;
-            }
-            if (collapsedNodes.findIndex((collapsedNode) => (0, Utils_js_1.sameNodes)(collapsedNode.nodeData, node.nodeData)) !== -1) {
-                return false;
-            }
-            return !!node.nodeData.autoExpand;
-        };
-        const buildNode = (node) => (!!options?.discardState || node.id === parentId ? node : addAttributes(node, oldModel));
-        const rootNode = parentId !== undefined ? this.getNode(parentId) : currModel.rootNode;
-        /* c8 ignore next 3 */
-        if (!rootNode || (0, TreeModel_js_1.isTreeModelInfoNode)(rootNode)) {
-            return { complete: Promise.resolve() };
-        }
-        if (parentId === undefined) {
-            // cancel all ongoing requests
-            this._reset.next();
-        }
-        return this.loadSubTree({ parent: rootNode, getHierarchyLevelOptions, shouldLoadChildren, buildNode, ignoreCache: options?.ignoreCache }, !!options?.discardState ? undefined : { ...currModel.rootNode }, options?.discardState);
-    }
-    reset() {
-        this._reset.next();
-    }
-    setHierarchyProvider(provider) {
-        this._loader = provider
-            ? new TreeLoader_js_1.TreeLoader(provider, this._onHierarchyLimitExceeded, ({ parentId, type, error }) => {
-                if (type === "timeout") {
-                    const loadAction = this.getLoadAction(parentId);
-                    this._onLoad(loadAction, Number.MAX_SAFE_INTEGER);
-                }
-                this._onHierarchyLoadError({ parentId, type, error });
-            }, this._nodeIdFactory)
-            : /* c8 ignore next */ new NoopTreeLoader();
-    }
-    getNode(nodeId) {
-        return TreeModel_js_1.TreeModel.getNode(this._currentModel, nodeId);
-    }
-    selectNodes(nodeIds, changeType) {
-        this.updateTreeModel((model) => {
-            TreeModel_js_1.TreeModel.selectNodes(model, nodeIds, changeType);
-        });
-    }
-    expandNode(nodeId, isExpanded) {
-        let childrenAction = "none";
-        this.updateTreeModel((model) => {
-            childrenAction = TreeModel_js_1.TreeModel.expandNode(model, nodeId, isExpanded);
-        });
-        if (childrenAction === "none") {
-            return { complete: Promise.resolve() };
-        }
-        return this.loadNodes(nodeId, childrenAction === "reloadChildren");
-    }
-    setHierarchyLimit(nodeId, limit) {
-        const oldModel = this._currentModel;
-        let loadChildren = false;
-        this.updateTreeModel((model) => {
-            loadChildren = TreeModel_js_1.TreeModel.setHierarchyLimit(model, nodeId, limit);
-        });
-        if (!loadChildren) {
-            return { complete: Promise.resolve() };
-        }
-        return this.reloadSubTree(nodeId, oldModel);
-    }
-    setInstanceFilter(nodeId, filter) {
-        const oldModel = this._currentModel;
-        let loadChildren = false;
-        this.updateTreeModel((model) => {
-            loadChildren = TreeModel_js_1.TreeModel.setInstanceFilter(model, nodeId, filter);
-        });
-        if (!loadChildren) {
-            return { complete: Promise.resolve() };
-        }
-        return this.reloadSubTree(nodeId, oldModel);
-    }
-    reloadTree(options) {
-        const oldModel = this._currentModel;
-        this.updateTreeModel((model) => {
-            TreeModel_js_1.TreeModel.setIsLoading(model, options?.parentNodeId, true);
-            if (options?.state === "reset") {
-                TreeModel_js_1.TreeModel.removeSubTree(model, options?.parentNodeId);
-            }
-        });
-        const discardState = options?.state === "discard" || options?.state === "reset";
-        const ignoreCache = options?.state === "reset";
-        return this.reloadSubTree(options?.parentNodeId, oldModel, { discardState, ignoreCache });
-    }
-}
-exports.TreeActions = TreeActions;
-function collectTreePartsUntil(untilNotifier, rootNode) {
-    return (source) => source.pipe((0, rxjs_1.reduce)((treeModel, loadedPart) => {
-        addNodesToModel(treeModel, loadedPart);
-        return treeModel;
-    }, {
-        idToNode: new Map(),
-        parentChildMap: new Map(),
-        rootNode: rootNode ?? { id: undefined, nodeData: undefined },
-    }), (0, rxjs_1.takeUntil)(untilNotifier));
-}
-function addNodesToModel(model, hierarchyPart) {
-    model.parentChildMap.set(hierarchyPart.parentId, hierarchyPart.loadedNodes.map((node) => node.id));
-    for (const node of hierarchyPart.loadedNodes) {
-        model.idToNode.set(node.id, node);
-    }
-    const parentNode = hierarchyPart.parentId ? model.idToNode.get(hierarchyPart.parentId) : undefined;
-    if (parentNode && (0, TreeModel_js_1.isTreeModelHierarchyNode)(parentNode)) {
-        parentNode.isExpanded = true;
-    }
-}
-function addAttributes(node, oldModel) {
-    const oldNode = oldModel.idToNode.get(node.id);
-    if (oldNode && (0, TreeModel_js_1.isTreeModelHierarchyNode)(oldNode)) {
-        node.hierarchyLimit = oldNode.hierarchyLimit;
-        node.instanceFilter = oldNode.instanceFilter;
-        node.isSelected = oldNode.isSelected;
-    }
-    return node;
-}
-function collectNodes(parentId, model, pred) {
-    const currentChildren = model.parentChildMap.get(parentId);
-    if (!currentChildren) {
-        return [];
-    }
-    if (parentId === undefined) {
-        return currentChildren.flatMap((child) => collectNodes(child, model, pred));
-    }
-    const currNode = model.idToNode.get(parentId);
-    if (!currNode || !(0, TreeModel_js_1.isTreeModelHierarchyNode)(currNode) || !pred(currNode)) {
-        return [];
-    }
-    return [currNode, ...currentChildren.flatMap((child) => collectNodes(child, model, pred))];
-}
-function getNonGroupedParentId(node, nodeIdFactory) {
-    if (!node.nodeData || !presentation_hierarchies_1.HierarchyNode.isGroupingNode(node.nodeData)) {
-        return node.id;
-    }
-    if (!node.nodeData.nonGroupingAncestor) {
-        return undefined;
-    }
-    return nodeIdFactory(node.nodeData.nonGroupingAncestor);
-}
-function createHierarchyLevelOptions(model, nodeId) {
-    if (nodeId === undefined) {
-        return { instanceFilter: model.rootNode.instanceFilter, hierarchyLevelSizeLimit: model.rootNode.hierarchyLimit };
-    }
-    const modelNode = model.idToNode.get(nodeId);
-    if (!modelNode || (0, TreeModel_js_1.isTreeModelInfoNode)(modelNode)) {
-        return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };
-    }
-    return { instanceFilter: modelNode.instanceFilter, hierarchyLevelSizeLimit: modelNode.hierarchyLimit };
-}
-/* c8 ignore start */
-class NoopTreeLoader {
-    loadNodes() {
-        return rxjs_1.EMPTY;
-    }
-}
-/* c8 ignore end */
-class TimeTracker {
-    _onFinish;
-    _start;
-    _stopped = false;
-    constructor(_onFinish) {
-        this._onFinish = _onFinish;
-        this._start = Date.now();
-    }
-    [Symbol.dispose]() {
-        this._stopped = true;
-    }
-    finish() {
-        /* c8 ignore next 3 */
-        if (this._stopped) {
-            return;
-        }
-        this._stopped = true;
-        const elapsedTime = Date.now() - this._start;
-        this._onFinish(elapsedTime);
-    }
-}
-//# sourceMappingURL=TreeActions.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TreeActions.js","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeActions.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,gCAA8B;AAC9B,iCAAqD;AACrD,+BAAmI;AACnI,8EAA0G;AAE1G,mDAAmH;AACnH,iDAAoJ;AACpJ,yCAAqD;AAErD,IAAA,oBAAY,GAAE,CAAC;AAWf,gBAAgB;AAChB,MAAa,WAAW;IAQZ;IACA;IACA;IACA;IAVF,OAAO,CAAc;IACrB,cAAc,CAA8D;IAC5E,aAAa,CAAY;IACzB,MAAM,GAAG,IAAI,cAAO,EAAQ,CAAC;IAC7B,WAAW,CAAqC;IAExD,YACU,eAA2C,EAC3C,OAAmG,EACnG,yBAA+H,EAC/H,qBAA0G,EAClH,aAA2E,EAC3E,IAAgB;QALR,oBAAe,GAAf,eAAe,CAA4B;QAC3C,YAAO,GAAP,OAAO,CAA4F;QACnG,8BAAyB,GAAzB,yBAAyB,CAAsG;QAC/H,0BAAqB,GAArB,qBAAqB,CAAqF;QAIlH,IAAI,CAAC,OAAO,GAAG,IAAI,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,cAAc,GAAG,aAAa,IAAI,uBAAY,CAAC;QACpD,IAAI,CAAC,aAAa,GAAG,IAAI,IAAI,oBAAoB,CAAC;YAChD,QAAQ,EAAE,IAAI,GAAG,EAAE;YACnB,cAAc,EAAE,IAAI,GAAG,EAAE;YACzB,QAAQ,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE;SACjD,CAAC;QAEF,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC7C,CAAC;IAEO,gBAAgB;QACtB,MAAM,OAAO,GAAG,IAAI,cAAO,EAA6B,CAAC;QACzD,OAAO;aACJ,IAAI,CACH,IAAA,cAAO,EAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAChC,IAAA,eAAQ,EAAC,CAAC,KAAK,EAAE,EAAE,CACjB,KAAK,CAAC,IAAI,CACR,IAAA,aAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAA,mBAAY,EAAC,CAAC,CAAC,CAAC,CAAC,EACnC,IAAA,UAAG,EAAC,CAAC,QAAQ,EAAE,EAAE;YACf,IAAI,WAAW,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAEtC,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;gBACjC,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;oBACxB,WAAW,GAAG,KAAK,CAAC;gBACtB,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;gBACjC,IAAI,KAAK,KAAK,WAAW,EAAE,CAAC;oBAC1B,OAAO;gBACT,CAAC;gBACD,MAAM,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACrC,MAAM,CAAC,UAAU,EAAE,CAAC;YACtB,CAAC,CAAC,CAAC;YACH,OAAO,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC/B,CAAC,CAAC,EACF,IAAA,gBAAS,EAAC,CAAC,KAAK,EAAE,EAAE,CAClB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAC5C,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,eAAe,CAAC,EACzD,IAAA,UAAG,EAAC;YACF,IAAI,EAAE,CAAC,QAAmB,EAAE,EAAE;gBAC5B,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAC/D,MAAM,cAAc,GAAG,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC7F,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACrD,+CAA+C;gBAC/C,IAAI,CAAC,CAAC,cAAc,IAAI,IAAA,kCAAmB,EAAC,cAAc,CAAC,CAAC,EAAE,CAAC;oBAC7D,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACvC,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,KAAK,CAAC,UAAU,EAAE,CAAC;YACrB,CAAC;SACF,CAAC,CACH,CACF,CACF,CACF,CACF;aACA,SAAS,EAAE,CAAC;QAEf,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,eAAe,CAAC,OAA0C;QAChE,MAAM,QAAQ,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC;QAC9B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC3C,CAAC;IAEO,qBAAqB,CAAC,QAA4B,EAAE,eAA0B;QACpF,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,wBAAS,CAAC,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,iBAAiB,CAAC,QAA4B;QACpD,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,wBAAS,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,aAAa,CAAC,QAA4B;QAChD,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,sBAAsB,CAAC;IAC9H,CAAC;IAEO,WAAW,CAAC,OAAyB,EAAE,eAAmC,EAAE,YAAsB;QACxG,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzD,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;QAE9E,OAAO;YACL,QAAQ,EAAE,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;gBACtC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,eAAe,EAAE,YAAY,EAAE,CAAC,CAAC;YAChJ,CAAC,CAAC;SACH,CAAC;IACJ,CAAC;IAEO,SAAS,CAAC,QAAgB,EAAE,WAAqB;QACvD,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7D,sBAAsB;QACtB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAA,uCAAwB,EAAC,UAAU,CAAC,EAAE,CAAC;YACzD,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,WAAW,CAAC;YACtB,MAAM,EAAE,UAAU;YAClB,wBAAwB,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,2BAA2B,CAAC,IAAI,CAAC,aAAa,EAAE,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YACrI,kBAAkB,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU;YACxD,WAAW;SACZ,CAAC,CAAC;IACL,CAAC;IAEO,aAAa,CAAC,QAA4B,EAAE,QAAmB,EAAE,OAA2D;QAClI,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,aAAa,GAAG,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,CAAC;QAC1H,MAAM,cAAc,GAAG,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC;QAC5H,MAAM,wBAAwB,GAAG,CAAC,IAAgD,EAAE,EAAE;YACpF,IAAI,CAAC,CAAC,OAAO,EAAE,YAAY,EAAE,CAAC;gBAC5B,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,EAAE,CAAC;YAC3E,CAAC;YACD,MAAM,cAAc,GAAG,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YACxE,OAAO,2BAA2B,CAAC,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QACzG,CAAC,CAAC;QACF,MAAM,kBAAkB,GAAG,CAAC,IAA4B,EAAE,EAAE;YAC1D,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,IAAA,oBAAS,EAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACtG,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,cAAc,CAAC,SAAS,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,IAAA,oBAAS,EAAC,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACzG,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;QACpC,CAAC,CAAC;QACF,MAAM,SAAS,GAAG,CAAC,IAA4B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,YAAY,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;QAE7I,MAAM,QAAQ,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;QACtF,sBAAsB;QACtB,IAAI,CAAC,QAAQ,IAAI,IAAA,kCAAmB,EAAC,QAAQ,CAAC,EAAE,CAAC;YAC/C,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,CAAC;QAED,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,8BAA8B;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC,WAAW,CACrB,EAAE,MAAM,EAAE,QAAQ,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,EAChH,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,QAAQ,EAAE,EAC/D,OAAO,EAAE,YAAY,CACtB,CAAC;IACJ,CAAC;IAEM,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IAEM,oBAAoB,CAAC,QAA4B;QACtD,IAAI,CAAC,OAAO,GAAG,QAAQ;YACrB,CAAC,CAAC,IAAI,0BAAU,CACZ,QAAQ,EACR,IAAI,CAAC,yBAAyB,EAC9B,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;gBAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;oBAChD,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;gBACpD,CAAC;gBACD,IAAI,CAAC,qBAAqB,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YACxD,CAAC,EACD,IAAI,CAAC,cAAc,CACpB;YACH,CAAC,CAAC,oBAAoB,CAAC,IAAI,cAAc,EAAE,CAAC;IAChD,CAAC;IAEM,OAAO,CAAC,MAA0B;QACvC,OAAO,wBAAS,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IAEM,WAAW,CAAC,OAAsB,EAAE,UAA+B;QACxE,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,wBAAS,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,UAAU,CAAC,MAAc,EAAE,UAAmB;QACnD,IAAI,cAAc,GAA4C,MAAM,CAAC;QACrE,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,cAAc,GAAG,wBAAS,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,IAAI,cAAc,KAAK,MAAM,EAAE,CAAC;YAC9B,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,cAAc,KAAK,gBAAgB,CAAC,CAAC;IACrE,CAAC;IAEM,iBAAiB,CAAC,MAA0B,EAAE,KAA4B;QAC/E,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,YAAY,GAAG,wBAAS,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAEM,iBAAiB,CAAC,MAA0B,EAAE,MAA8B;QACjF,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,YAAY,GAAG,wBAAS,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAEM,UAAU,CAAC,OAAyE;QACzF,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,wBAAS,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;YAC3D,IAAI,OAAO,EAAE,KAAK,KAAK,OAAO,EAAE,CAAC;gBAC/B,wBAAS,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;YACxD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,OAAO,EAAE,KAAK,KAAK,SAAS,IAAI,OAAO,EAAE,KAAK,KAAK,OAAO,CAAC;QAChF,MAAM,WAAW,GAAG,OAAO,EAAE,KAAK,KAAK,OAAO,CAAC;QAC/C,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC,CAAC;IAC5F,CAAC;CACF;AAlQD,kCAkQC;AAED,SAAS,qBAAqB,CAAC,aAA+B,EAAE,QAA4B;IAC1F,OAAO,CAAC,MAAkC,EAAE,EAAE,CAC5C,MAAM,CAAC,IAAI,CACT,IAAA,aAAM,EACJ,CAAC,SAAS,EAAE,UAAU,EAAE,EAAE;QACxB,eAAe,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QACvC,OAAO,SAAS,CAAC;IACnB,CAAC,EACD;QACE,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,QAAQ,EAAE,QAAQ,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE;KAC7D,CACF,EACD,IAAA,gBAAS,EAAC,aAAa,CAAC,CACzB,CAAC;AACN,CAAC;AAED,SAAS,eAAe,CAAC,KAAgB,EAAE,aAA6B;IACtE,KAAK,CAAC,cAAc,CAAC,GAAG,CACtB,aAAa,CAAC,QAAQ,EACtB,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CACjD,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,WAAW,EAAE,CAAC;QAC7C,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,UAAU,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnG,IAAI,UAAU,IAAI,IAAA,uCAAwB,EAAC,UAAU,CAAC,EAAE,CAAC;QACvD,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAA4B,EAAE,QAAmB;IACtE,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/C,IAAI,OAAO,IAAI,IAAA,uCAAwB,EAAC,OAAO,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC;QAC7C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC;QAC7C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;IACvC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,QAA4B,EAAE,KAAgB,EAAE,IAA+C;IACnH,MAAM,eAAe,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3D,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,eAAe,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC9C,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAA,uCAAwB,EAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxE,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,CAAC,QAAQ,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAgD,EAAE,aAA0E;IACzJ,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,wCAAa,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnE,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,mBAAmB,EAAE,CAAC;QACvC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,2BAA2B,CAAC,KAAgB,EAAE,MAA0B;IAC/E,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,EAAE,cAAc,EAAE,KAAK,CAAC,QAAQ,CAAC,cAAc,EAAE,uBAAuB,EAAE,KAAK,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;IACnH,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,CAAC,SAAS,IAAI,IAAA,kCAAmB,EAAC,SAAS,CAAC,EAAE,CAAC;QACjD,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,EAAE,CAAC;IAC3E,CAAC;IACD,OAAO,EAAE,cAAc,EAAE,SAAS,CAAC,cAAc,EAAE,uBAAuB,EAAE,SAAS,CAAC,cAAc,EAAE,CAAC;AACzG,CAAC;AAED,qBAAqB;AACrB,MAAM,cAAc;IACX,SAAS;QACd,OAAO,YAAK,CAAC;IACf,CAAC;CACF;AACD,mBAAmB;AAEnB,MAAM,WAAW;IAIK;IAHZ,MAAM,CAAS;IACf,QAAQ,GAAY,KAAK,CAAC;IAElC,YAAoB,SAAiC;QAAjC,cAAS,GAAT,SAAS,CAAwB;QACnD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,CAAC;IAEM,CAAC,MAAM,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACvB,CAAC;IAEM,MAAM;QACX,sBAAsB;QACtB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAC9B,CAAC;CACF","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\";\nimport { Draft, enableMapSet, produce } from \"immer\";\nimport { buffer, debounceTime, EMPTY, groupBy, map, mergeMap, Observable, reduce, Subject, switchMap, takeUntil, tap } from \"rxjs\";\nimport { GenericInstanceFilter, HierarchyNode, HierarchyProvider } from \"@itwin/presentation-hierarchies\";\nimport { SelectionChangeType } from \"../UseSelectionHandler.js\";\nimport { HierarchyLevelOptions, ITreeLoader, LoadedTreePart, LoadNodesOptions, TreeLoader } from \"./TreeLoader.js\";\nimport { isTreeModelHierarchyNode, isTreeModelInfoNode, TreeModel, TreeModelHierarchyNode, TreeModelNode, TreeModelRootNode } from \"./TreeModel.js\";\nimport { createNodeId, sameNodes } from \"./Utils.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: { parentId?: string; filter?: GenericInstanceFilter; limit?: number | \"unbounded\" }) => 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 ?? /* c8 ignore next */ {\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 childNodes = newModel.parentChildMap.get(props.parentId);\n                    const firstChildNode = childNodes?.length ? newModel.idToNode.get(childNodes[0]) : undefined;\n                    this.handleLoadedHierarchy(props.parentId, newModel);\n                    // only report load duration if no error occurs\n                    if (!(firstChildNode && isTreeModelInfoNode(firstChildNode))) {\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 ? \"initial-load\" : parentId === undefined ? \"reload\" : \"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({ loadOptions: options, onComplete: resolve, timeTracker, parentId: options.parent.id, initialRootNode, discardState });\n      }),\n    };\n  }\n\n  private loadNodes(parentId: string, ignoreCache?: boolean) {\n    const parentNode = this._currentModel.idToNode.get(parentId);\n    /* c8 ignore next 3 */\n    if (!parentNode || !isTreeModelHierarchyNode(parentNode)) {\n      return { complete: Promise.resolve() };\n    }\n\n    return this.loadSubTree({\n      parent: parentNode,\n      getHierarchyLevelOptions: (node) => createHierarchyLevelOptions(this._currentModel, getNonGroupedParentId(node, this._nodeIdFactory)),\n      shouldLoadChildren: (node) => !!node.nodeData.autoExpand,\n      ignoreCache,\n    });\n  }\n\n  private reloadSubTree(parentId: string | undefined, oldModel: TreeModel, options?: { discardState?: boolean; ignoreCache?: boolean }) {\n    const currModel = this._currentModel;\n    const expandedNodes = !!options?.discardState ? [] : collectNodes(parentId, oldModel, (node) => node.isExpanded === true);\n    const collapsedNodes = !!options?.discardState ? [] : 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) => (!!options?.discardState || node.id === parentId ? node : addAttributes(node, oldModel));\n\n    const rootNode = parentId !== undefined ? this.getNode(parentId) : currModel.rootNode;\n    /* c8 ignore next 3 */\n    if (!rootNode || isTreeModelInfoNode(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      : /* c8 ignore next */ new NoopTreeLoader();\n  }\n\n  public getNode(nodeId: string | undefined): TreeModelNode | 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: ReturnType<typeof TreeModel.expandNode> = \"none\";\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;\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;\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          addNodesToModel(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 addNodesToModel(model: TreeModel, hierarchyPart: LoadedTreePart) {\n  model.parentChildMap.set(\n    hierarchyPart.parentId,\n    hierarchyPart.loadedNodes.map((node) => node.id),\n  );\n  for (const node of hierarchyPart.loadedNodes) {\n    model.idToNode.set(node.id, node);\n  }\n  const parentNode = hierarchyPart.parentId ? model.idToNode.get(hierarchyPart.parentId) : undefined;\n  if (parentNode && isTreeModelHierarchyNode(parentNode)) {\n    parentNode.isExpanded = true;\n  }\n}\n\nfunction addAttributes(node: TreeModelHierarchyNode, oldModel: TreeModel) {\n  const oldNode = oldModel.idToNode.get(node.id);\n  if (oldNode && isTreeModelHierarchyNode(oldNode)) {\n    node.hierarchyLimit = oldNode.hierarchyLimit;\n    node.instanceFilter = oldNode.instanceFilter;\n    node.isSelected = oldNode.isSelected;\n  }\n  return node;\n}\n\nfunction collectNodes(parentId: string | undefined, model: TreeModel, pred: (node: TreeModelHierarchyNode) => boolean): 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 || !isTreeModelHierarchyNode(currNode) || !pred(currNode)) {\n    return [];\n  }\n\n  return [currNode, ...currentChildren.flatMap((child) => collectNodes(child, model, pred))];\n}\n\nfunction getNonGroupedParentId(node: TreeModelHierarchyNode | TreeModelRootNode, nodeIdFactory: (node: Pick<HierarchyNode, \"key\" | \"parentKeys\">) => string) {\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 || isTreeModelInfoNode(modelNode)) {\n    return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };\n  }\n  return { instanceFilter: modelNode.instanceFilter, hierarchyLevelSizeLimit: modelNode.hierarchyLimit };\n}\n\n/* c8 ignore start */\nclass NoopTreeLoader implements ITreeLoader {\n  public loadNodes(): Observable<LoadedTreePart> {\n    return EMPTY;\n  }\n}\n/* c8 ignore end */\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    /* c8 ignore next 3 */\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"]}

package/lib/cjs/presentation-hierarchies-react/internal/TreeLoader.d.ts

@@ -1,44 +0,0 @@
-import { Observable } from "rxjs";
-import { GenericInstanceFilter, HierarchyNode, HierarchyProvider } from "@itwin/presentation-hierarchies";
-import { TreeModelHierarchyNode, TreeModelNode, TreeModelRootNode } from "./TreeModel.js";
-/** @internal */
-export interface LoadedTreePart {
-    parentId: string | undefined;
-    loadedNodes: TreeModelNode[];
-}
-/** @internal */
-export interface HierarchyLevelOptions {
-    instanceFilter?: GenericInstanceFilter;
-    hierarchyLevelSizeLimit?: number | "unbounded";
-}
-/** @internal */
-export interface LoadNodesOptions {
-    parent: TreeModelHierarchyNode | TreeModelRootNode;
-    getHierarchyLevelOptions: (node: TreeModelRootNode | TreeModelHierarchyNode) => HierarchyLevelOptions;
-    shouldLoadChildren: (node: TreeModelHierarchyNode) => boolean;
-    buildNode?: (node: TreeModelHierarchyNode) => TreeModelHierarchyNode;
-    ignoreCache?: boolean;
-}
-/** @internal */
-export interface ITreeLoader {
-    loadNodes(options: LoadNodesOptions): Observable<LoadedTreePart>;
-}
-/** @internal */
-export declare class TreeLoader implements ITreeLoader {
-    private _hierarchyProvider;
-    private _onHierarchyLimitExceeded;
-    private _onHierarchyLoadError;
-    private _treeNodeIdFactory;
-    constructor(_hierarchyProvider: HierarchyProvider, _onHierarchyLimitExceeded: (props: {
-        parentId?: string;
-        filter?: GenericInstanceFilter;
-        limit?: number | "unbounded";
-    }) => void, _onHierarchyLoadError: (props: {
-        parentId?: string;
-        type: "timeout" | "unknown";
-        error: unknown;
-    }) => void, treeNodeIdFactory?: (node: Pick<HierarchyNode, "key" | "parentKeys">) => string);
-    private loadChildren;
-    loadNodes({ shouldLoadChildren, ...options }: LoadNodesOptions): Observable<LoadedTreePart>;
-}
-//# sourceMappingURL=TreeLoader.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TreeLoader.d.ts","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeLoader.ts"],"names":[],"mappings":"AAKA,OAAO,EAA2C,UAAU,EAAe,MAAM,MAAM,CAAC;AACxF,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,iBAAiB,EAA0B,MAAM,iCAAiC,CAAC;AAClI,OAAO,EAA4B,sBAAsB,EAAqB,aAAa,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAGvI,gBAAgB;AAChB,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,WAAW,EAAE,aAAa,EAAE,CAAC;CAC9B;AAED,gBAAgB;AAChB,MAAM,WAAW,qBAAqB;IACpC,cAAc,CAAC,EAAE,qBAAqB,CAAC;IACvC,uBAAuB,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC;CAChD;AAED,gBAAgB;AAChB,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,sBAAsB,GAAG,iBAAiB,CAAC;IACnD,wBAAwB,EAAE,CAAC,IAAI,EAAE,iBAAiB,GAAG,sBAAsB,KAAK,qBAAqB,CAAC;IACtG,kBAAkB,EAAE,CAAC,IAAI,EAAE,sBAAsB,KAAK,OAAO,CAAC;IAC9D,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,sBAAsB,KAAK,sBAAsB,CAAC;IACrE,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED,gBAAgB;AAChB,MAAM,WAAW,WAAW;IAC1B,SAAS,CAAC,OAAO,EAAE,gBAAgB,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC;CAClE;AAED,gBAAgB;AAChB,qBAAa,UAAW,YAAW,WAAW;IAI1C,OAAO,CAAC,kBAAkB;IAC1B,OAAO,CAAC,yBAAyB;IACjC,OAAO,CAAC,qBAAqB;IAL/B,OAAO,CAAC,kBAAkB,CAA8D;gBAG9E,kBAAkB,EAAE,iBAAiB,EACrC,yBAAyB,EAAE,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,qBAAqB,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,GAAG,WAAW,CAAA;KAAE,KAAK,IAAI,EAC/H,qBAAqB,EAAE,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE,KAAK,IAAI,EAClH,iBAAiB,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,KAAK,GAAG,YAAY,CAAC,KAAK,MAAM;IAKjF,OAAO,CAAC,YAAY;IAyDb,SAAS,CAAC,EAAE,kBAAkB,EAAE,GAAG,OAAO,EAAE,EAAE,gBAAgB;CAStE"}