@itwin/presentation-hierarchies-react 0.1.0

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

@@ -0,0 +1,232 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { enableMapSet, produce } from "immer";
+import { EMPTY, reduce, Subject, takeUntil } from "rxjs";
+import { HierarchyNode } from "@itwin/presentation-hierarchies";
+import { TreeLoader } from "./TreeLoader";
+import { isTreeModelHierarchyNode, isTreeModelInfoNode, TreeModel } from "./TreeModel";
+import { createNodeId, sameNodes } from "./Utils";
+enableMapSet();
+/** @internal */
+export class TreeActions {
+    _onModelChanged;
+    _loader;
+    _currentModel;
+    _disposed = new Subject();
+    constructor(_onModelChanged, seed) {
+        this._onModelChanged = _onModelChanged;
+        this._loader = new NoopTreeLoader();
+        this._currentModel = seed ?? /* istanbul ignore next */ {
+            idToNode: new Map(),
+            parentChildMap: new Map(),
+            rootNode: { id: undefined, nodeData: undefined },
+        };
+    }
+    updateTreeModel(updater) {
+        const newModel = produce(this._currentModel, updater);
+        if (this._currentModel === newModel) {
+            return;
+        }
+        this._currentModel = newModel;
+        this._onModelChanged(this._currentModel);
+    }
+    handleLoadedHierarchy(parentId, loadedHierarchy) {
+        this.updateTreeModel((model) => {
+            TreeModel.addHierarchyPart(model, parentId, loadedHierarchy);
+        });
+    }
+    onLoadingComplete(parentId) {
+        this.updateTreeModel((model) => {
+            TreeModel.setIsLoading(model, parentId, false);
+        });
+    }
+    loadNodes(parentId, ignoreCache) {
+        const parentNode = this._currentModel.idToNode.get(parentId);
+        // istanbul ignore if
+        if (!parentNode || !isTreeModelHierarchyNode(parentNode)) {
+            return;
+        }
+        this._loader
+            .loadNodes({
+            parent: parentNode,
+            getHierarchyLevelOptions: (node) => createHierarchyLevelOptions(this._currentModel, getNonGroupedParentId(node)),
+            shouldLoadChildren: (node) => !!node.nodeData.autoExpand,
+            ignoreCache,
+        })
+            .pipe(collectTreePartsUntil(this._disposed))
+            .subscribe({
+            next: (loadedHierarchy) => {
+                this.handleLoadedHierarchy(parentId, loadedHierarchy);
+            },
+            complete: () => {
+                this.onLoadingComplete(parentId);
+            },
+        });
+    }
+    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);
+            return createHierarchyLevelOptions(filteredNodeId === parentId ? currModel : oldModel, filteredNodeId);
+        };
+        const shouldLoadChildren = (node) => {
+            if (expandedNodes.findIndex((expandedNode) => sameNodes(expandedNode.nodeData, node.nodeData)) !== -1) {
+                return true;
+            }
+            if (collapsedNodes.findIndex((collapsedNode) => 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;
+        // istanbul ignore if
+        if (!rootNode || isTreeModelInfoNode(rootNode)) {
+            return;
+        }
+        if (parentId === undefined) {
+            // cancel all ongoing requests
+            this._disposed.next();
+        }
+        this._loader
+            .loadNodes({ parent: rootNode, getHierarchyLevelOptions, shouldLoadChildren, buildNode })
+            .pipe(collectTreePartsUntil(this._disposed, !!options?.discardState ? undefined : { ...currModel.rootNode }))
+            .subscribe({
+            next: (newModel) => {
+                this.handleLoadedHierarchy(parentId, newModel);
+            },
+            complete: () => {
+                this.onLoadingComplete(parentId);
+            },
+        });
+    }
+    dispose() {
+        this._disposed.next();
+    }
+    setHierarchyProvider(provider) {
+        this._loader = provider ? new TreeLoader(provider) : /* istanbul ignore next */ new NoopTreeLoader();
+    }
+    getNode(nodeId) {
+        return TreeModel.getNode(this._currentModel, nodeId);
+    }
+    selectNodes(nodeIds, changeType) {
+        this.updateTreeModel((model) => {
+            TreeModel.selectNodes(model, nodeIds, changeType);
+        });
+    }
+    expandNode(nodeId, isExpanded) {
+        let childrenAction = "none";
+        this.updateTreeModel((model) => {
+            childrenAction = TreeModel.expandNode(model, nodeId, isExpanded);
+        });
+        if (childrenAction === "none") {
+            return;
+        }
+        this.loadNodes(nodeId, childrenAction === "reloadChildren");
+    }
+    setHierarchyLimit(nodeId, limit) {
+        const oldModel = this._currentModel;
+        let loadChildren = false;
+        this.updateTreeModel((model) => {
+            loadChildren = TreeModel.setHierarchyLimit(model, nodeId, limit);
+        });
+        if (!loadChildren) {
+            return;
+        }
+        this.reloadSubTree(nodeId, oldModel);
+    }
+    setInstanceFilter(nodeId, filter) {
+        const oldModel = this._currentModel;
+        let loadChildren = false;
+        this.updateTreeModel((model) => {
+            loadChildren = TreeModel.setInstanceFilter(model, nodeId, filter);
+        });
+        if (!loadChildren) {
+            return;
+        }
+        this.reloadSubTree(nodeId, oldModel);
+    }
+    reloadTree(options) {
+        const oldModel = this._currentModel;
+        this.updateTreeModel((model) => {
+            model.rootNode.isLoading = true;
+        });
+        this.reloadSubTree(undefined, oldModel, { ...options });
+    }
+}
+function collectTreePartsUntil(untilNotifier, rootNode) {
+    return (source) => source.pipe(reduce((treeModel, loadedPart) => {
+        addNodesToModel(treeModel, loadedPart);
+        return treeModel;
+    }, {
+        idToNode: new Map(),
+        parentChildMap: new Map(),
+        rootNode: rootNode ?? { id: undefined, nodeData: undefined },
+    }), 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 && isTreeModelHierarchyNode(parentNode)) {
+        parentNode.isExpanded = true;
+    }
+}
+function addAttributes(node, oldModel) {
+    const oldNode = oldModel.idToNode.get(node.id);
+    if (oldNode && 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 || !isTreeModelHierarchyNode(currNode) || !pred(currNode)) {
+        return [];
+    }
+    return [currNode, ...currentChildren.flatMap((child) => collectNodes(child, model, pred))];
+}
+function getNonGroupedParentId(node) {
+    if (!node.nodeData || !HierarchyNode.isGroupingNode(node.nodeData)) {
+        return node.id;
+    }
+    if (!node.nodeData.nonGroupingAncestor) {
+        return undefined;
+    }
+    return createNodeId(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 || isTreeModelInfoNode(modelNode)) {
+        return { instanceFilter: undefined, hierarchyLevelSizeLimit: undefined };
+    }
+    return { instanceFilter: modelNode.instanceFilter, hierarchyLevelSizeLimit: modelNode.hierarchyLimit };
+}
+// istanbul ignore next
+class NoopTreeLoader {
+    loadNodes() {
+        return EMPTY;
+    }
+}
+//# sourceMappingURL=TreeActions.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"TreeActions.js","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeActions.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAS,YAAY,EAAE,OAAO,EAAE,MAAM,OAAO,CAAC;AACrD,OAAO,EAAE,KAAK,EAAc,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,MAAM,CAAC;AACrE,OAAO,EAAyB,aAAa,EAAqB,MAAM,iCAAiC,CAAC;AAE1G,OAAO,EAAsD,UAAU,EAAE,MAAM,cAAc,CAAC;AAC9F,OAAO,EAAE,wBAAwB,EAAE,mBAAmB,EAAE,SAAS,EAA4D,MAAM,aAAa,CAAC;AACjJ,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAElD,YAAY,EAAE,CAAC;AAEf,gBAAgB;AAChB,MAAM,OAAO,WAAW;IAMZ;IALF,OAAO,CAAc;IACrB,aAAa,CAAY;IACzB,SAAS,GAAG,IAAI,OAAO,EAAQ,CAAC;IAExC,YACU,eAA2C,EACnD,IAAgB;QADR,oBAAe,GAAf,eAAe,CAA4B;QAGnD,IAAI,CAAC,OAAO,GAAG,IAAI,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,IAAI,0BAA0B,CAAC;YACtD,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;IACJ,CAAC;IAEO,eAAe,CAAC,OAA0C;QAChE,MAAM,QAAQ,GAAG,OAAO,CAAC,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,SAAS,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,SAAS,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,SAAS,CAAC,QAAgB,EAAE,WAAqB;QACvD,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7D,qBAAqB;QACrB,IAAI,CAAC,UAAU,IAAI,CAAC,wBAAwB,CAAC,UAAU,CAAC,EAAE,CAAC;YACzD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,OAAO;aACT,SAAS,CAAC;YACT,MAAM,EAAE,UAAU;YAClB,wBAAwB,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,2BAA2B,CAAC,IAAI,CAAC,aAAa,EAAE,qBAAqB,CAAC,IAAI,CAAC,CAAC;YAChH,kBAAkB,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU;YACxD,WAAW;SACZ,CAAC;aACD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aAC3C,SAAS,CAAC;YACT,IAAI,EAAE,CAAC,eAAe,EAAE,EAAE;gBACxB,IAAI,CAAC,qBAAqB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;YACxD,CAAC;YACD,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YACnC,CAAC;SACF,CAAC,CAAC;IACP,CAAC;IAEO,aAAa,CAAC,QAA4B,EAAE,QAAmB,EAAE,OAAoC;QAC3G,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,CAAC,CAAC;YACnD,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,SAAS,CAAC,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,SAAS,CAAC,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,qBAAqB;QACrB,IAAI,CAAC,QAAQ,IAAI,mBAAmB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/C,OAAO;QACT,CAAC;QAED,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,8BAA8B;YAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACxB,CAAC;QAED,IAAI,CAAC,OAAO;aACT,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,SAAS,EAAE,CAAC;aACxF,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;aAC5G,SAAS,CAAC;YACT,IAAI,EAAE,CAAC,QAAQ,EAAE,EAAE;gBACjB,IAAI,CAAC,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACjD,CAAC;YACD,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YACnC,CAAC;SACF,CAAC,CAAC;IACP,CAAC;IAEM,OAAO;QACZ,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAEM,oBAAoB,CAAC,QAA4B;QACtD,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,0BAA0B,CAAC,IAAI,cAAc,EAAE,CAAC;IACvG,CAAC;IAEM,OAAO,CAAC,MAA0B;QACvC,OAAO,SAAS,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,SAAS,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,SAAS,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,IAAI,cAAc,KAAK,MAAM,EAAE,CAAC;YAC9B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,cAAc,KAAK,gBAAgB,CAAC,CAAC;IAC9D,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,SAAS,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACvC,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,SAAS,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACvC,CAAC;IAEM,UAAU,CAAC,OAAoC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,KAAK,CAAC,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;IAC1D,CAAC;CACF;AAED,SAAS,qBAAqB,CAAC,aAA+B,EAAE,QAA4B;IAC1F,OAAO,CAAC,MAAkC,EAAE,EAAE,CAC5C,MAAM,CAAC,IAAI,CACT,MAAM,CACJ,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,SAAS,CAAC,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,wBAAwB,CAAC,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,wBAAwB,CAAC,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,wBAAwB,CAAC,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;IAC7E,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,aAAa,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,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;AACzD,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,mBAAmB,CAAC,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,uBAAuB;AACvB,MAAM,cAAc;IACX,SAAS;QACd,OAAO,KAAK,CAAC;IACf,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 { Draft, enableMapSet, produce } from \"immer\";\nimport { EMPTY, Observable, reduce, Subject, takeUntil } from \"rxjs\";\nimport { GenericInstanceFilter, HierarchyNode, HierarchyProvider } from \"@itwin/presentation-hierarchies\";\nimport { SelectionChangeType } from \"../UseSelectionHandler\";\nimport { HierarchyLevelOptions, ITreeLoader, LoadedTreePart, TreeLoader } from \"./TreeLoader\";\nimport { isTreeModelHierarchyNode, isTreeModelInfoNode, TreeModel, TreeModelHierarchyNode, TreeModelNode, TreeModelRootNode } from \"./TreeModel\";\nimport { createNodeId, sameNodes } from \"./Utils\";\n\nenableMapSet();\n\n/** @internal */\nexport class TreeActions {\n  private _loader: ITreeLoader;\n  private _currentModel: TreeModel;\n  private _disposed = new Subject<void>();\n\n  constructor(\n    private _onModelChanged: (model: TreeModel) => void,\n    seed?: TreeModel,\n  ) {\n    this._loader = new NoopTreeLoader();\n    this._currentModel = seed ?? /* istanbul ignore next */ {\n      idToNode: new Map(),\n      parentChildMap: new Map(),\n      rootNode: { id: undefined, nodeData: undefined },\n    };\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 loadNodes(parentId: string, ignoreCache?: boolean) {\n    const parentNode = this._currentModel.idToNode.get(parentId);\n    // istanbul ignore if\n    if (!parentNode || !isTreeModelHierarchyNode(parentNode)) {\n      return;\n    }\n\n    this._loader\n      .loadNodes({\n        parent: parentNode,\n        getHierarchyLevelOptions: (node) => createHierarchyLevelOptions(this._currentModel, getNonGroupedParentId(node)),\n        shouldLoadChildren: (node) => !!node.nodeData.autoExpand,\n        ignoreCache,\n      })\n      .pipe(collectTreePartsUntil(this._disposed))\n      .subscribe({\n        next: (loadedHierarchy) => {\n          this.handleLoadedHierarchy(parentId, loadedHierarchy);\n        },\n        complete: () => {\n          this.onLoadingComplete(parentId);\n        },\n      });\n  }\n\n  private reloadSubTree(parentId: string | undefined, oldModel: TreeModel, options?: { discardState?: 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);\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    // istanbul ignore if\n    if (!rootNode || isTreeModelInfoNode(rootNode)) {\n      return;\n    }\n\n    if (parentId === undefined) {\n      // cancel all ongoing requests\n      this._disposed.next();\n    }\n\n    this._loader\n      .loadNodes({ parent: rootNode, getHierarchyLevelOptions, shouldLoadChildren, buildNode })\n      .pipe(collectTreePartsUntil(this._disposed, !!options?.discardState ? undefined : { ...currModel.rootNode }))\n      .subscribe({\n        next: (newModel) => {\n          this.handleLoadedHierarchy(parentId, newModel);\n        },\n        complete: () => {\n          this.onLoadingComplete(parentId);\n        },\n      });\n  }\n\n  public dispose() {\n    this._disposed.next();\n  }\n\n  public setHierarchyProvider(provider?: HierarchyProvider) {\n    this._loader = provider ? new TreeLoader(provider) : /* istanbul 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;\n    }\n\n    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;\n    }\n\n    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;\n    }\n\n    this.reloadSubTree(nodeId, oldModel);\n  }\n\n  public reloadTree(options?: { discardState?: boolean }) {\n    const oldModel = this._currentModel;\n    this.updateTreeModel((model) => {\n      model.rootNode.isLoading = true;\n    });\n\n    this.reloadSubTree(undefined, oldModel, { ...options });\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) {\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 createNodeId(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// istanbul ignore next\nclass NoopTreeLoader implements ITreeLoader {\n  public loadNodes(): Observable<LoadedTreePart> {\n    return EMPTY;\n  }\n}\n"]}

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

@@ -0,0 +1,33 @@
+import { Observable } from "rxjs";
+import { GenericInstanceFilter, HierarchyProvider } from "@itwin/presentation-hierarchies";
+import { TreeModelHierarchyNode, TreeModelNode, TreeModelRootNode } from "./TreeModel";
+/** @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;
+    constructor(_hierarchyProvider: HierarchyProvider);
+    private loadChildren;
+    loadNodes({ shouldLoadChildren, ...options }: LoadNodesOptions): Observable<LoadedTreePart>;
+}
+//# sourceMappingURL=TreeLoader.d.ts.map

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

@@ -0,0 +1 @@
+{"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,EAAiB,iBAAiB,EAA0B,MAAM,iCAAiC,CAAC;AAClI,OAAO,EAA4B,sBAAsB,EAAqB,aAAa,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAGpI,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;IAChC,OAAO,CAAC,kBAAkB;gBAAlB,kBAAkB,EAAE,iBAAiB;IAEzD,OAAO,CAAC,YAAY;IAyCb,SAAS,CAAC,EAAE,kBAAkB,EAAE,GAAG,OAAO,EAAE,EAAE,gBAAgB;CAStE"}

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

@@ -0,0 +1,67 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { catchError, expand, from, map, mergeMap, of, toArray } from "rxjs";
+import { RowsLimitExceededError } from "@itwin/presentation-hierarchies";
+import { isTreeModelHierarchyNode } from "./TreeModel";
+import { createNodeId } from "./Utils";
+/** @internal */
+export class TreeLoader {
+    _hierarchyProvider;
+    constructor(_hierarchyProvider) {
+        this._hierarchyProvider = _hierarchyProvider;
+    }
+    loadChildren({ parent, getHierarchyLevelOptions, buildNode, ignoreCache }) {
+        const { instanceFilter, hierarchyLevelSizeLimit } = getHierarchyLevelOptions(parent);
+        const infoNodeIdBase = `${parent.id ?? "<root>"}`;
+        const treeModelNodesFactory = createTreeModelNodesFactory(buildNode);
+        return from(this._hierarchyProvider.getNodes({
+            parentNode: parent.nodeData,
+            hierarchyLevelSizeLimit,
+            instanceFilter,
+            ignoreCache,
+        })).pipe(toArray(), catchError((err) => {
+            const nodeProps = {
+                id: `${infoNodeIdBase}-${err.message}`,
+                parentId: parent.id,
+            };
+            if (err instanceof RowsLimitExceededError) {
+                return of([{ ...nodeProps, type: "ResultSetTooLarge", resultSetSizeLimit: err.limit }]);
+            }
+            return of([{ ...nodeProps, type: "Unknown", message: "Failed to create hierarchy level" }]);
+        }), map((childNodes) => ({
+            parentId: parent.id,
+            loadedNodes: instanceFilter && childNodes.length === 0
+                ? [
+                    {
+                        id: `${infoNodeIdBase}-no-filter-matches`,
+                        parentId: parent.id,
+                        type: "NoFilterMatches",
+                    },
+                ]
+                : childNodes.map(treeModelNodesFactory),
+        })));
+    }
+    loadNodes({ shouldLoadChildren, ...options }) {
+        return this.loadChildren(options).pipe(expand((loadedPart) => from(loadedPart.loadedNodes.filter((node) => isTreeModelHierarchyNode(node) && shouldLoadChildren(node))).pipe(mergeMap((node) => this.loadChildren({ ...options, parent: node })))));
+    }
+}
+function createTreeModelNodesFactory(buildNode) {
+    return (node) => {
+        if (!isHierarchyNode(node)) {
+            return node;
+        }
+        const modelNode = {
+            id: createNodeId(node),
+            children: node.children,
+            label: node.label,
+            nodeData: node,
+        };
+        return buildNode ? buildNode(modelNode) : modelNode;
+    };
+}
+function isHierarchyNode(node) {
+    return "key" in node && node.key !== undefined;
+}
+//# sourceMappingURL=TreeLoader.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"TreeLoader.js","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeLoader.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAc,EAAE,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACxF,OAAO,EAA2D,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAClI,OAAO,EAAE,wBAAwB,EAA+E,MAAM,aAAa,CAAC;AACpI,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AA4BvC,gBAAgB;AAChB,MAAM,OAAO,UAAU;IACD;IAApB,YAAoB,kBAAqC;QAArC,uBAAkB,GAAlB,kBAAkB,CAAmB;IAAG,CAAC;IAErD,YAAY,CAAC,EAAE,MAAM,EAAE,wBAAwB,EAAE,SAAS,EAAE,WAAW,EAAgD;QAC7H,MAAM,EAAE,cAAc,EAAE,uBAAuB,EAAE,GAAG,wBAAwB,CAAC,MAAM,CAAC,CAAC;QACrF,MAAM,cAAc,GAAG,GAAG,MAAM,CAAC,EAAE,IAAI,QAAQ,EAAE,CAAC;QAClD,MAAM,qBAAqB,GAAG,2BAA2B,CAAC,SAAS,CAAC,CAAC;QACrE,OAAO,IAAI,CACT,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YAC/B,UAAU,EAAE,MAAM,CAAC,QAAQ;YAC3B,uBAAuB;YACvB,cAAc;YACd,WAAW;SACZ,CAAC,CACH,CAAC,IAAI,CACJ,OAAO,EAAE,EACT,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE;YACjB,MAAM,SAAS,GAAG;gBAChB,EAAE,EAAE,GAAG,cAAc,IAAI,GAAG,CAAC,OAAO,EAAE;gBACtC,QAAQ,EAAE,MAAM,CAAC,EAAE;aACpB,CAAC;YACF,IAAI,GAAG,YAAY,sBAAsB,EAAE,CAAC;gBAC1C,OAAO,EAAE,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,IAAI,EAAE,mBAA4B,EAAE,kBAAkB,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnG,CAAC;YACD,OAAO,EAAE,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,IAAI,EAAE,SAAkB,EAAE,OAAO,EAAE,kCAAkC,EAAE,CAAC,CAAC,CAAC;QACvG,CAAC,CAAC,EACF,GAAG,CACD,CAAC,UAAU,EAAkB,EAAE,CAAC,CAAC;YAC/B,QAAQ,EAAE,MAAM,CAAC,EAAE;YACnB,WAAW,EACT,cAAc,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBACvC,CAAC,CAAC;oBACE;wBACE,EAAE,EAAE,GAAG,cAAc,oBAAoB;wBACzC,QAAQ,EAAE,MAAM,CAAC,EAAE;wBACnB,IAAI,EAAE,iBAA0B;qBACjC;iBACF;gBACH,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,qBAAqB,CAAC;SAC5C,CAAC,CACH,CACF,CAAC;IACJ,CAAC;IAEM,SAAS,CAAC,EAAE,kBAAkB,EAAE,GAAG,OAAO,EAAoB;QACnE,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CACpC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CACpB,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,EAAkC,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAC5I,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CACpE,CACF,CACF,CAAC;IACJ,CAAC;CACF;AAED,SAAS,2BAA2B,CAClC,SAAoE;IAEpE,OAAO,CAAC,IAAuC,EAAE,EAAE;QACjD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,SAAS,GAA2B;YACxC,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC;YACtB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI;SACf,CAAC;QACF,OAAO,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACtD,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,IAAuC;IAC9D,OAAO,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC;AACjD,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 { catchError, expand, from, map, mergeMap, Observable, of, toArray } from \"rxjs\";\nimport { GenericInstanceFilter, HierarchyNode, HierarchyProvider, RowsLimitExceededError } from \"@itwin/presentation-hierarchies\";\nimport { isTreeModelHierarchyNode, TreeModelHierarchyNode, TreeModelInfoNode, TreeModelNode, TreeModelRootNode } from \"./TreeModel\";\nimport { createNodeId } from \"./Utils\";\n\n/** @internal */\nexport interface LoadedTreePart {\n  parentId: string | undefined;\n  loadedNodes: TreeModelNode[];\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  constructor(private _hierarchyProvider: HierarchyProvider) {}\n\n  private loadChildren({ parent, getHierarchyLevelOptions, buildNode, ignoreCache }: Omit<LoadNodesOptions, \"shouldLoadChildren\">) {\n    const { instanceFilter, hierarchyLevelSizeLimit } = getHierarchyLevelOptions(parent);\n    const infoNodeIdBase = `${parent.id ?? \"<root>\"}`;\n    const treeModelNodesFactory = createTreeModelNodesFactory(buildNode);\n    return from(\n      this._hierarchyProvider.getNodes({\n        parentNode: parent.nodeData,\n        hierarchyLevelSizeLimit,\n        instanceFilter,\n        ignoreCache,\n      }),\n    ).pipe(\n      toArray(),\n      catchError((err) => {\n        const nodeProps = {\n          id: `${infoNodeIdBase}-${err.message}`,\n          parentId: parent.id,\n        };\n        if (err instanceof RowsLimitExceededError) {\n          return of([{ ...nodeProps, type: \"ResultSetTooLarge\" as const, resultSetSizeLimit: err.limit }]);\n        }\n        return of([{ ...nodeProps, type: \"Unknown\" as const, message: \"Failed to create hierarchy level\" }]);\n      }),\n      map(\n        (childNodes): LoadedTreePart => ({\n          parentId: parent.id,\n          loadedNodes:\n            instanceFilter && childNodes.length === 0\n              ? [\n                  {\n                    id: `${infoNodeIdBase}-no-filter-matches`,\n                    parentId: parent.id,\n                    type: \"NoFilterMatches\" as const,\n                  },\n                ]\n              : childNodes.map(treeModelNodesFactory),\n        }),\n      ),\n    );\n  }\n\n  public loadNodes({ shouldLoadChildren, ...options }: LoadNodesOptions) {\n    return this.loadChildren(options).pipe(\n      expand((loadedPart) =>\n        from(loadedPart.loadedNodes.filter((node): node is TreeModelHierarchyNode => isTreeModelHierarchyNode(node) && shouldLoadChildren(node))).pipe(\n          mergeMap((node) => this.loadChildren({ ...options, parent: node })),\n        ),\n      ),\n    );\n  }\n}\n\nfunction createTreeModelNodesFactory(\n  buildNode?: (node: TreeModelHierarchyNode) => TreeModelHierarchyNode,\n): (node: TreeModelInfoNode | HierarchyNode) => TreeModelNode {\n  return (node: TreeModelInfoNode | HierarchyNode) => {\n    if (!isHierarchyNode(node)) {\n      return node;\n    }\n\n    const modelNode: TreeModelHierarchyNode = {\n      id: createNodeId(node),\n      children: node.children,\n      label: node.label,\n      nodeData: node,\n    };\n    return buildNode ? buildNode(modelNode) : modelNode;\n  };\n}\n\nfunction isHierarchyNode(node: TreeModelInfoNode | HierarchyNode): node is HierarchyNode {\n  return \"key\" in node && node.key !== undefined;\n}\n"]}

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

@@ -0,0 +1,70 @@
+import { GenericInstanceFilter, HierarchyNode } from "@itwin/presentation-hierarchies";
+import { SelectionChangeType } from "../UseSelectionHandler";
+/** @internal */
+export interface TreeModelRootNode {
+    id: undefined;
+    nodeData: undefined;
+    hierarchyLimit?: number | "unbounded";
+    instanceFilter?: GenericInstanceFilter;
+    isLoading?: boolean;
+}
+/** @internal */
+export interface TreeModelHierarchyNode {
+    id: string;
+    nodeData: HierarchyNode;
+    label: string;
+    children: boolean;
+    isLoading?: boolean;
+    isExpanded?: boolean;
+    isSelected?: boolean;
+    hierarchyLimit?: number | "unbounded";
+    instanceFilter?: GenericInstanceFilter;
+}
+/** @internal */
+export interface TreeModelGenericInfoNode {
+    id: string;
+    parentId: string | undefined;
+    type: "Unknown";
+    message: string;
+}
+/** @internal */
+export interface TreeModelNoFilterMatchesInfoNode {
+    id: string;
+    parentId: string | undefined;
+    type: "NoFilterMatches";
+}
+/** @internal */
+export interface TreeModelResultSetTooLargeInfoNode {
+    id: string;
+    parentId: string | undefined;
+    type: "ResultSetTooLarge";
+    resultSetSizeLimit: number;
+}
+/** @internal */
+export type TreeModelInfoNode = TreeModelGenericInfoNode | TreeModelResultSetTooLargeInfoNode | TreeModelNoFilterMatchesInfoNode;
+/** @internal */
+export type TreeModelNode = TreeModelHierarchyNode | TreeModelInfoNode;
+/** @internal */
+export declare function isTreeModelHierarchyNode(node: TreeModelHierarchyNode | TreeModelInfoNode | TreeModelRootNode): node is TreeModelHierarchyNode;
+/** @internal */
+export declare function isTreeModelInfoNode(node: TreeModelHierarchyNode | TreeModelInfoNode | TreeModelRootNode): node is TreeModelInfoNode;
+/** @internal */
+export interface TreeModel {
+    parentChildMap: Map<string | undefined, string[]>;
+    idToNode: Map<string, TreeModelNode>;
+    rootNode: TreeModelRootNode;
+}
+/** @internal */
+export declare namespace TreeModel {
+    function expandNode(model: TreeModel, nodeId: string, isExpanded: boolean): "none" | "loadChildren" | "reloadChildren";
+    /** @internal */
+    function addHierarchyPart(model: TreeModel, rootId: string | undefined, hierarchyPart: TreeModel): void;
+    function removeSubTree(model: TreeModel, parentId: string | undefined): void;
+    function setHierarchyLimit(model: TreeModel, nodeId: string | undefined, limit?: number | "unbounded"): boolean;
+    function setInstanceFilter(model: TreeModel, nodeId: string | undefined, filter?: GenericInstanceFilter): boolean;
+    function selectNodes(model: TreeModel, nodeIds: Array<string>, changeType: SelectionChangeType): void;
+    function isNodeSelected(model: TreeModel, nodeId: string): boolean;
+    function getNode(model: TreeModel, nodeId: string | undefined): TreeModelNode | TreeModelRootNode | undefined;
+    function setIsLoading(model: TreeModel, nodeId: string | undefined, isLoading: boolean): void;
+}
+//# sourceMappingURL=TreeModel.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"TreeModel.d.ts","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeModel.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AACvF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAE7D,gBAAgB;AAChB,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,SAAS,CAAC;IACd,QAAQ,EAAE,SAAS,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC;IACtC,cAAc,CAAC,EAAE,qBAAqB,CAAC;IACvC,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED,gBAAgB;AAChB,MAAM,WAAW,sBAAsB;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,aAAa,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,cAAc,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC;IACtC,cAAc,CAAC,EAAE,qBAAqB,CAAC;CACxC;AAED,gBAAgB;AAChB,MAAM,WAAW,wBAAwB;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,IAAI,EAAE,SAAS,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,gBAAgB;AAChB,MAAM,WAAW,gCAAgC;IAC/C,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,IAAI,EAAE,iBAAiB,CAAC;CACzB;AAED,gBAAgB;AAChB,MAAM,WAAW,kCAAkC;IACjD,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,IAAI,EAAE,mBAAmB,CAAC;IAC1B,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED,gBAAgB;AAChB,MAAM,MAAM,iBAAiB,GAAG,wBAAwB,GAAG,kCAAkC,GAAG,gCAAgC,CAAC;AAEjI,gBAAgB;AAChB,MAAM,MAAM,aAAa,GAAG,sBAAsB,GAAG,iBAAiB,CAAC;AAEvE,gBAAgB;AAChB,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,sBAAsB,GAAG,iBAAiB,GAAG,iBAAiB,GAAG,IAAI,IAAI,sBAAsB,CAE7I;AAED,gBAAgB;AAChB,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,sBAAsB,GAAG,iBAAiB,GAAG,iBAAiB,GAAG,IAAI,IAAI,iBAAiB,CAEnI;AAED,gBAAgB;AAChB,MAAM,WAAW,SAAS;IACxB,cAAc,EAAE,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;IAClD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACrC,QAAQ,EAAE,iBAAiB,CAAC;CAC7B;AAED,gBAAgB;AAChB,yBAAiB,SAAS,CAAC;IACzB,SAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,cAAc,GAAG,gBAAgB,CA8B5H;IAED,gBAAgB;IAChB,SAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,aAAa,EAAE,SAAS,GAAG,IAAI,CAgB7G;IAED,SAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAclF;IAED,SAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,WAAW,GAAG,OAAO,CAIrH;IAED,SAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAIvH;IAED,SAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,mBAAmB,QAiBpG;IAED,SAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAGxE;IAED,SAAgB,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa,GAAG,iBAAiB,GAAG,SAAS,CAKnH;IAED,SAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,SAAS,EAAE,OAAO,QAW5F;CACF"}

package/lib/esm/presentation-hierarchies-react/internal/TreeModel.js

@@ -0,0 +1,149 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+/** @internal */
+export function isTreeModelHierarchyNode(node) {
+    return "nodeData" in node && node.nodeData !== undefined;
+}
+/** @internal */
+export function isTreeModelInfoNode(node) {
+    return "type" in node && node.type !== undefined;
+}
+/** @internal */
+export var TreeModel;
+(function (TreeModel) {
+    function expandNode(model, nodeId, isExpanded) {
+        const node = model.idToNode.get(nodeId);
+        if (!node || !isTreeModelHierarchyNode(node)) {
+            return "none";
+        }
+        node.isExpanded = isExpanded;
+        if (!isExpanded || !node.children) {
+            return "none";
+        }
+        const children = model.parentChildMap.get(node.id);
+        if (!children) {
+            node.isLoading = true;
+            return "loadChildren";
+        }
+        if (children.length !== 1) {
+            return "none";
+        }
+        const firstChild = TreeModel.getNode(model, children[0]);
+        if (!firstChild || !isTreeModelInfoNode(firstChild) || firstChild.type !== "Unknown") {
+            return "none";
+        }
+        // remove subtree if there is only one `Unknown` info node in order to attempt reloading children
+        TreeModel.removeSubTree(model, nodeId);
+        node.isLoading = true;
+        return "reloadChildren";
+    }
+    TreeModel.expandNode = expandNode;
+    /** @internal */
+    function addHierarchyPart(model, rootId, hierarchyPart) {
+        removeSubTree(model, rootId);
+        for (const [parentId, children] of hierarchyPart.parentChildMap) {
+            model.parentChildMap.set(parentId, children);
+        }
+        for (const [nodeId, node] of hierarchyPart.idToNode) {
+            model.idToNode.set(nodeId, node);
+        }
+        const parentNode = rootId !== undefined ? model.idToNode.get(rootId) : model.rootNode;
+        // istanbul ignore else
+        if (parentNode && !isTreeModelInfoNode(parentNode)) {
+            parentNode.isLoading = false;
+        }
+    }
+    TreeModel.addHierarchyPart = addHierarchyPart;
+    function removeSubTree(model, parentId) {
+        const currentChildren = model.parentChildMap.get(parentId);
+        if (!currentChildren) {
+            return;
+        }
+        model.parentChildMap.delete(parentId);
+        for (const childId of currentChildren) {
+            const childNode = model.idToNode.get(childId);
+            if (childNode && isTreeModelHierarchyNode(childNode)) {
+                removeSubTree(model, childNode.id);
+            }
+            model.idToNode.delete(childId);
+        }
+    }
+    TreeModel.removeSubTree = removeSubTree;
+    function setHierarchyLimit(model, nodeId, limit) {
+        return updateForReload(model, nodeId, (node) => {
+            node.hierarchyLimit = limit;
+        });
+    }
+    TreeModel.setHierarchyLimit = setHierarchyLimit;
+    function setInstanceFilter(model, nodeId, filter) {
+        return updateForReload(model, nodeId, (node) => {
+            node.instanceFilter = filter;
+        });
+    }
+    TreeModel.setInstanceFilter = setInstanceFilter;
+    function selectNodes(model, nodeIds, changeType) {
+        if (changeType === "replace") {
+            for (const [nodeId, node] of model.idToNode) {
+                if (!isTreeModelHierarchyNode(node)) {
+                    continue;
+                }
+                node.isSelected = !!nodeIds.find((id) => id === nodeId);
+            }
+            return;
+        }
+        for (const nodeId of nodeIds) {
+            const modelNode = model.idToNode.get(nodeId);
+            if (!modelNode || !isTreeModelHierarchyNode(modelNode)) {
+                return;
+            }
+            modelNode.isSelected = changeType === "add";
+        }
+    }
+    TreeModel.selectNodes = selectNodes;
+    function isNodeSelected(model, nodeId) {
+        const currentNode = model.idToNode.get(nodeId);
+        return !!currentNode && isTreeModelHierarchyNode(currentNode) && !!currentNode.isSelected;
+    }
+    TreeModel.isNodeSelected = isNodeSelected;
+    function getNode(model, nodeId) {
+        if (!nodeId) {
+            return model.rootNode;
+        }
+        return model.idToNode.get(nodeId);
+    }
+    TreeModel.getNode = getNode;
+    function setIsLoading(model, nodeId, isLoading) {
+        if (nodeId === undefined) {
+            model.rootNode.isLoading = isLoading;
+            return;
+        }
+        const modelNode = model.idToNode.get(nodeId);
+        // istanbul ignore if
+        if (!modelNode || !isTreeModelHierarchyNode(modelNode)) {
+            return;
+        }
+        modelNode.isLoading = isLoading;
+    }
+    TreeModel.setIsLoading = setIsLoading;
+})(TreeModel || (TreeModel = {}));
+function updateForReload(model, nodeId, update) {
+    TreeModel.removeSubTree(model, nodeId);
+    if (nodeId === undefined) {
+        update(model.rootNode);
+        model.rootNode.isLoading = true;
+        return true;
+    }
+    const modelNode = model.idToNode.get(nodeId);
+    if (!modelNode || !isTreeModelHierarchyNode(modelNode)) {
+        return false;
+    }
+    update(modelNode);
+    if (modelNode.isExpanded) {
+        modelNode.isLoading = true;
+        return true;
+    }
+    return false;
+}
+//# sourceMappingURL=TreeModel.js.map

package/lib/esm/presentation-hierarchies-react/internal/TreeModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeModel.js","sourceRoot":"","sources":["../../../../src/presentation-hierarchies-react/internal/TreeModel.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAwDhG,gBAAgB;AAChB,MAAM,UAAU,wBAAwB,CAAC,IAAoE;IAC3G,OAAO,UAAU,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC;AAC3D,CAAC;AAED,gBAAgB;AAChB,MAAM,UAAU,mBAAmB,CAAC,IAAoE;IACtG,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC;AACnD,CAAC;AASD,gBAAgB;AAChB,MAAM,KAAW,SAAS,CA2HzB;AA3HD,WAAiB,SAAS;IACxB,SAAgB,UAAU,CAAC,KAAgB,EAAE,MAAc,EAAE,UAAmB;QAC9E,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,OAAO,cAAc,CAAC;QACxB,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,CAAC,UAAU,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACrF,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,iGAAiG;QACjG,SAAS,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IA9Be,oBAAU,aA8BzB,CAAA;IAED,gBAAgB;IAChB,SAAgB,gBAAgB,CAAC,KAAgB,EAAE,MAA0B,EAAE,aAAwB;QACrG,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAE7B,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,aAAa,CAAC,cAAc,EAAE,CAAC;YAChE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;QAED,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,QAAQ,EAAE,CAAC;YACpD,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;QACtF,uBAAuB;QACvB,IAAI,UAAU,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,SAAS,GAAG,KAAK,CAAC;QAC/B,CAAC;IACH,CAAC;IAhBe,0BAAgB,mBAgB/B,CAAA;IAED,SAAgB,aAAa,CAAC,KAAgB,EAAE,QAA4B;QAC1E,MAAM,eAAe,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QACD,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAEtC,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,SAAS,IAAI,wBAAwB,CAAC,SAAS,CAAC,EAAE,CAAC;gBACrD,aAAa,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAde,uBAAa,gBAc5B,CAAA;IAED,SAAgB,iBAAiB,CAAC,KAAgB,EAAE,MAA0B,EAAE,KAA4B;QAC1G,OAAO,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;YAC7C,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC;IAJe,2BAAiB,oBAIhC,CAAA;IAED,SAAgB,iBAAiB,CAAC,KAAgB,EAAE,MAA0B,EAAE,MAA8B;QAC5G,OAAO,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;YAC7C,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC;QAC/B,CAAC,CAAC,CAAC;IACL,CAAC;IAJe,2BAAiB,oBAIhC,CAAA;IAED,SAAgB,WAAW,CAAC,KAAgB,EAAE,OAAsB,EAAE,UAA+B;QACnG,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC5C,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpC,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YAC1D,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,SAAS,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,EAAE,CAAC;gBACvD,OAAO;YACT,CAAC;YACD,SAAS,CAAC,UAAU,GAAG,UAAU,KAAK,KAAK,CAAC;QAC9C,CAAC;IACH,CAAC;IAjBe,qBAAW,cAiB1B,CAAA;IAED,SAAgB,cAAc,CAAC,KAAgB,EAAE,MAAc;QAC7D,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,WAAW,IAAI,wBAAwB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC;IAC5F,CAAC;IAHe,wBAAc,iBAG7B,CAAA;IAED,SAAgB,OAAO,CAAC,KAAgB,EAAE,MAA0B;QAClE,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,KAAK,CAAC,QAAQ,CAAC;QACxB,CAAC;QACD,OAAO,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IALe,iBAAO,UAKtB,CAAA;IAED,SAAgB,YAAY,CAAC,KAAgB,EAAE,MAA0B,EAAE,SAAkB;QAC3F,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC;YACrC,OAAO;QACT,CAAC;QACD,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7C,qBAAqB;QACrB,IAAI,CAAC,SAAS,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,EAAE,CAAC;YACvD,OAAO;QACT,CAAC;QACD,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC;IAClC,CAAC;IAXe,sBAAY,eAW3B,CAAA;AACH,CAAC,EA3HgB,SAAS,KAAT,SAAS,QA2HzB;AAED,SAAS,eAAe,CAAC,KAAgB,EAAE,MAA0B,EAAE,MAAkE;IACvI,SAAS,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACvC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvB,KAAK,CAAC,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,CAAC,SAAS,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,EAAE,CAAC;QACvD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,CAAC;IAClB,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;QACzB,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,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 { GenericInstanceFilter, HierarchyNode } from \"@itwin/presentation-hierarchies\";\nimport { SelectionChangeType } from \"../UseSelectionHandler\";\n\n/** @internal */\nexport interface TreeModelRootNode {\n  id: undefined;\n  nodeData: undefined;\n  hierarchyLimit?: number | \"unbounded\";\n  instanceFilter?: GenericInstanceFilter;\n  isLoading?: boolean;\n}\n\n/** @internal */\nexport interface TreeModelHierarchyNode {\n  id: string;\n  nodeData: HierarchyNode;\n  label: string;\n  children: boolean;\n  isLoading?: boolean;\n  isExpanded?: boolean;\n  isSelected?: boolean;\n  hierarchyLimit?: number | \"unbounded\";\n  instanceFilter?: GenericInstanceFilter;\n}\n\n/** @internal */\nexport interface TreeModelGenericInfoNode {\n  id: string;\n  parentId: string | undefined;\n  type: \"Unknown\";\n  message: string;\n}\n\n/** @internal */\nexport interface TreeModelNoFilterMatchesInfoNode {\n  id: string;\n  parentId: string | undefined;\n  type: \"NoFilterMatches\";\n}\n\n/** @internal */\nexport interface TreeModelResultSetTooLargeInfoNode {\n  id: string;\n  parentId: string | undefined;\n  type: \"ResultSetTooLarge\";\n  resultSetSizeLimit: number;\n}\n\n/** @internal */\nexport type TreeModelInfoNode = TreeModelGenericInfoNode | TreeModelResultSetTooLargeInfoNode | TreeModelNoFilterMatchesInfoNode;\n\n/** @internal */\nexport type TreeModelNode = TreeModelHierarchyNode | TreeModelInfoNode;\n\n/** @internal */\nexport function isTreeModelHierarchyNode(node: TreeModelHierarchyNode | TreeModelInfoNode | TreeModelRootNode): node is TreeModelHierarchyNode {\n  return \"nodeData\" in node && node.nodeData !== undefined;\n}\n\n/** @internal */\nexport function isTreeModelInfoNode(node: TreeModelHierarchyNode | TreeModelInfoNode | TreeModelRootNode): node is TreeModelInfoNode {\n  return \"type\" in node && node.type !== undefined;\n}\n\n/** @internal */\nexport interface TreeModel {\n  parentChildMap: Map<string | undefined, string[]>;\n  idToNode: Map<string, TreeModelNode>;\n  rootNode: TreeModelRootNode;\n}\n\n/** @internal */\nexport namespace TreeModel {\n  export function expandNode(model: TreeModel, nodeId: string, isExpanded: boolean): \"none\" | \"loadChildren\" | \"reloadChildren\" {\n    const node = model.idToNode.get(nodeId);\n    if (!node || !isTreeModelHierarchyNode(node)) {\n      return \"none\";\n    }\n\n    node.isExpanded = isExpanded;\n    if (!isExpanded || !node.children) {\n      return \"none\";\n    }\n\n    const children = model.parentChildMap.get(node.id);\n    if (!children) {\n      node.isLoading = true;\n      return \"loadChildren\";\n    }\n\n    if (children.length !== 1) {\n      return \"none\";\n    }\n\n    const firstChild = TreeModel.getNode(model, children[0]);\n    if (!firstChild || !isTreeModelInfoNode(firstChild) || firstChild.type !== \"Unknown\") {\n      return \"none\";\n    }\n\n    // remove subtree if there is only one `Unknown` info node in order to attempt reloading children\n    TreeModel.removeSubTree(model, nodeId);\n    node.isLoading = true;\n    return \"reloadChildren\";\n  }\n\n  /** @internal */\n  export function addHierarchyPart(model: TreeModel, rootId: string | undefined, hierarchyPart: TreeModel): void {\n    removeSubTree(model, rootId);\n\n    for (const [parentId, children] of hierarchyPart.parentChildMap) {\n      model.parentChildMap.set(parentId, children);\n    }\n\n    for (const [nodeId, node] of hierarchyPart.idToNode) {\n      model.idToNode.set(nodeId, node);\n    }\n\n    const parentNode = rootId !== undefined ? model.idToNode.get(rootId) : model.rootNode;\n    // istanbul ignore else\n    if (parentNode && !isTreeModelInfoNode(parentNode)) {\n      parentNode.isLoading = false;\n    }\n  }\n\n  export function removeSubTree(model: TreeModel, parentId: string | undefined): void {\n    const currentChildren = model.parentChildMap.get(parentId);\n    if (!currentChildren) {\n      return;\n    }\n    model.parentChildMap.delete(parentId);\n\n    for (const childId of currentChildren) {\n      const childNode = model.idToNode.get(childId);\n      if (childNode && isTreeModelHierarchyNode(childNode)) {\n        removeSubTree(model, childNode.id);\n      }\n      model.idToNode.delete(childId);\n    }\n  }\n\n  export function setHierarchyLimit(model: TreeModel, nodeId: string | undefined, limit?: number | \"unbounded\"): boolean {\n    return updateForReload(model, nodeId, (node) => {\n      node.hierarchyLimit = limit;\n    });\n  }\n\n  export function setInstanceFilter(model: TreeModel, nodeId: string | undefined, filter?: GenericInstanceFilter): boolean {\n    return updateForReload(model, nodeId, (node) => {\n      node.instanceFilter = filter;\n    });\n  }\n\n  export function selectNodes(model: TreeModel, nodeIds: Array<string>, changeType: SelectionChangeType) {\n    if (changeType === \"replace\") {\n      for (const [nodeId, node] of model.idToNode) {\n        if (!isTreeModelHierarchyNode(node)) {\n          continue;\n        }\n        node.isSelected = !!nodeIds.find((id) => id === nodeId);\n      }\n      return;\n    }\n    for (const nodeId of nodeIds) {\n      const modelNode = model.idToNode.get(nodeId);\n      if (!modelNode || !isTreeModelHierarchyNode(modelNode)) {\n        return;\n      }\n      modelNode.isSelected = changeType === \"add\";\n    }\n  }\n\n  export function isNodeSelected(model: TreeModel, nodeId: string): boolean {\n    const currentNode = model.idToNode.get(nodeId);\n    return !!currentNode && isTreeModelHierarchyNode(currentNode) && !!currentNode.isSelected;\n  }\n\n  export function getNode(model: TreeModel, nodeId: string | undefined): TreeModelNode | TreeModelRootNode | undefined {\n    if (!nodeId) {\n      return model.rootNode;\n    }\n    return model.idToNode.get(nodeId);\n  }\n\n  export function setIsLoading(model: TreeModel, nodeId: string | undefined, isLoading: boolean) {\n    if (nodeId === undefined) {\n      model.rootNode.isLoading = isLoading;\n      return;\n    }\n    const modelNode = model.idToNode.get(nodeId);\n    // istanbul ignore if\n    if (!modelNode || !isTreeModelHierarchyNode(modelNode)) {\n      return;\n    }\n    modelNode.isLoading = isLoading;\n  }\n}\n\nfunction updateForReload(model: TreeModel, nodeId: string | undefined, update: (node: TreeModelHierarchyNode | TreeModelRootNode) => void) {\n  TreeModel.removeSubTree(model, nodeId);\n  if (nodeId === undefined) {\n    update(model.rootNode);\n    model.rootNode.isLoading = true;\n    return true;\n  }\n\n  const modelNode = model.idToNode.get(nodeId);\n  if (!modelNode || !isTreeModelHierarchyNode(modelNode)) {\n    return false;\n  }\n\n  update(modelNode);\n  if (modelNode.isExpanded) {\n    modelNode.isLoading = true;\n    return true;\n  }\n  return false;\n}\n"]}