@itwin/tree-widget-react 3.15.1 → 3.16.0

package/lib/cjs/tree-widget-react/components/trees/models-tree/Utils.d.ts

@@ -1,7 +1,31 @@
 import type { Observable } from "rxjs";
+import type { Id64Array, Id64String } from "@itwin/core-bentley";
 /**
  * Checks if all given models are displayed in given viewport.
  * @internal
  */
 export declare function releaseMainThreadOnItemsCount<T>(elementCount: number): (obs: Observable<T>) => Observable<T>;
+/** @internal */
+export type ChildrenTree<T extends object = {}> = Map<string, T & {
+    children?: ChildrenTree<T>;
+}>;
+/** @internal */
+export declare function getIdsFromChildrenTree<T extends object = {}>({ tree, predicate, }: {
+    tree: ChildrenTree<T>;
+    predicate?: (props: {
+        depth: number;
+        treeEntry: T;
+    }) => boolean;
+}): Set<string>;
+/**
+ * Updates children tree with provided `idsToAdd`:
+ * - All Ids are added (if they are not yet added) to children tree in the same order they appear in `idsToAdd` array.
+ * - `T` is assigned to each entry using the `additionalPropsGetter` function.
+ * @internal
+ */
+export declare function updateChildrenTree<T extends object = {}>({ tree, additionalPropsGetter, idsToAdd, }: {
+    tree: ChildrenTree<T>;
+    idsToAdd: Id64Array;
+    additionalPropsGetter: (id: Id64String, additionalProps?: T) => T;
+}): void;
 //# sourceMappingURL=Utils.d.ts.map

package/lib/cjs/tree-widget-react/components/trees/models-tree/Utils.js

@@ -5,6 +5,8 @@
  *--------------------------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.releaseMainThreadOnItemsCount = releaseMainThreadOnItemsCount;
+exports.getIdsFromChildrenTree = getIdsFromChildrenTree;
+exports.updateChildrenTree = updateChildrenTree;
 const rxjs_1 = require("rxjs");
 /**
  * Checks if all given models are displayed in given viewport.
@@ -21,4 +23,48 @@ function releaseMainThreadOnItemsCount(elementCount) {
         }), (0, rxjs_1.concatAll)());
     };
 }
+/** @internal */
+function getIdsFromChildrenTree({ tree, predicate, }) {
+    function getIdsInternal({ childrenTree, depth }) {
+        const result = new Set();
+        childrenTree.forEach((entry, id) => {
+            if (!predicate || predicate({ depth, treeEntry: entry })) {
+                result.add(id);
+            }
+            if (entry.children) {
+                const childrenIds = getIdsInternal({ childrenTree: entry.children, depth: depth + 1 });
+                childrenIds.forEach((childId) => result.add(childId));
+            }
+        });
+        return result;
+    }
+    return getIdsInternal({ childrenTree: tree, depth: 0 });
+}
+/**
+ * Updates children tree with provided `idsToAdd`:
+ * - All Ids are added (if they are not yet added) to children tree in the same order they appear in `idsToAdd` array.
+ * - `T` is assigned to each entry using the `additionalPropsGetter` function.
+ * @internal
+ */
+function updateChildrenTree({ tree, additionalPropsGetter, idsToAdd, }) {
+    let currentTree = tree;
+    for (let i = 0; i < idsToAdd.length; ++i) {
+        const id = idsToAdd[i];
+        let entry = currentTree.get(id);
+        entry = {
+            // Whoever calls this function knows how to assign the `T` to entry.
+            ...additionalPropsGetter(id, entry),
+            // If children already exists, we reuse it.
+            // If children do not exist and there are still ids left in the `idsToAdd` array, create a new Map, it will have the next id.
+            ...(entry?.children || i + 1 < idsToAdd.length ? { children: entry?.children ?? new Map() } : {}),
+        };
+        // Always update the set with updated entry.
+        currentTree.set(id, entry);
+        // This will only happen if it's the last id in `idsToAdd` array. In such case loop can be exited.
+        if (!entry.children) {
+            break;
+        }
+        currentTree = entry.children;
+    }
+}
 //# sourceMappingURL=Utils.js.map

package/lib/cjs/tree-widget-react/components/trees/models-tree/Utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"Utils.js","sourceRoot":"","sources":["../../../../../../src/tree-widget-react/components/trees/models-tree/Utils.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAUhG,sEAcC;AAtBD,+BAAoE;AAIpE;;;GAGG;AACH,SAAgB,6BAA6B,CAAI,YAAoB;IACnE,OAAO,CAAC,GAAkB,EAAiB,EAAE;QAC3C,OAAO,GAAG,CAAC,IAAI,CACb,IAAA,kBAAW,EAAC,YAAY,CAAC,EACzB,IAAA,gBAAS,EAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,GAAG,GAAG,IAAA,SAAE,EAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;gBAC1C,OAAO,GAAG,CAAC;YACb,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,EACF,IAAA,gBAAS,GAAE,CACZ,CAAC;IACJ,CAAC,CAAC;AACJ,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 { bufferCount, concatAll, concatMap, delay, of } from \"rxjs\";\n\nimport type { Observable } from \"rxjs\";\n\n/**\n * Checks if all given models are displayed in given viewport.\n * @internal\n */\nexport function releaseMainThreadOnItemsCount<T>(elementCount: number) {\n  return (obs: Observable<T>): Observable<T> => {\n    return obs.pipe(\n      bufferCount(elementCount),\n      concatMap((buff, i) => {\n        const out = of(buff);\n        if (i === 0 && buff.length < elementCount) {\n          return out;\n        }\n        return out.pipe(delay(0));\n      }),\n      concatAll(),\n    );\n  };\n}\n"]}
+{"version":3,"file":"Utils.js","sourceRoot":"","sources":["../../../../../../src/tree-widget-react/components/trees/models-tree/Utils.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAWhG,sEAcC;AAMD,wDAqBC;AAQD,gDA4BC;AAtFD,+BAAoE;AAKpE;;;GAGG;AACH,SAAgB,6BAA6B,CAAI,YAAoB;IACnE,OAAO,CAAC,GAAkB,EAAiB,EAAE;QAC3C,OAAO,GAAG,CAAC,IAAI,CACb,IAAA,kBAAW,EAAC,YAAY,CAAC,EACzB,IAAA,gBAAS,EAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,GAAG,GAAG,IAAA,SAAE,EAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;gBAC1C,OAAO,GAAG,CAAC;YACb,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,EACF,IAAA,gBAAS,GAAE,CACZ,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AAKD,gBAAgB;AAChB,SAAgB,sBAAsB,CAAwB,EAC5D,IAAI,EACJ,SAAS,GAIV;IACC,SAAS,cAAc,CAAC,EAAE,YAAY,EAAE,KAAK,EAAoD;QAC/F,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,YAAY,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;YACjC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBACzD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;YACD,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,WAAW,GAAG,cAAc,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACvF,WAAW,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,cAAc,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;GAKG;AACH,SAAgB,kBAAkB,CAAwB,EACxD,IAAI,EACJ,qBAAqB,EACrB,QAAQ,GAKT;IACC,IAAI,WAAW,GAAoB,IAAI,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,KAAK,GAAG;YACN,oEAAoE;YACpE,GAAG,qBAAqB,CAAC,EAAE,EAAE,KAAK,CAAC;YACnC,2CAA2C;YAC3C,6HAA6H;YAC7H,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAClG,CAAC;QACF,4CAA4C;QAC5C,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC3B,kGAAkG;QAClG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpB,MAAM;QACR,CAAC;QACD,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC/B,CAAC;AACH,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 { bufferCount, concatAll, concatMap, delay, of } from \"rxjs\";\n\nimport type { Observable } from \"rxjs\";\nimport type { Id64Array, Id64String } from \"@itwin/core-bentley\";\n\n/**\n * Checks if all given models are displayed in given viewport.\n * @internal\n */\nexport function releaseMainThreadOnItemsCount<T>(elementCount: number) {\n  return (obs: Observable<T>): Observable<T> => {\n    return obs.pipe(\n      bufferCount(elementCount),\n      concatMap((buff, i) => {\n        const out = of(buff);\n        if (i === 0 && buff.length < elementCount) {\n          return out;\n        }\n        return out.pipe(delay(0));\n      }),\n      concatAll(),\n    );\n  };\n}\n\n/** @internal */\nexport type ChildrenTree<T extends object = {}> = Map<string, T & { children?: ChildrenTree<T> }>;\n\n/** @internal */\nexport function getIdsFromChildrenTree<T extends object = {}>({\n  tree,\n  predicate,\n}: {\n  tree: ChildrenTree<T>;\n  predicate?: (props: { depth: number; treeEntry: T }) => boolean;\n}): Set<string> {\n  function getIdsInternal({ childrenTree, depth }: { childrenTree: ChildrenTree<T>; depth: number }): Set<string> {\n    const result = new Set<string>();\n    childrenTree.forEach((entry, id) => {\n      if (!predicate || predicate({ depth, treeEntry: entry })) {\n        result.add(id);\n      }\n      if (entry.children) {\n        const childrenIds = getIdsInternal({ childrenTree: entry.children, depth: depth + 1 });\n        childrenIds.forEach((childId) => result.add(childId));\n      }\n    });\n    return result;\n  }\n  return getIdsInternal({ childrenTree: tree, depth: 0 });\n}\n\n/**\n * Updates children tree with provided `idsToAdd`:\n * - All Ids are added (if they are not yet added) to children tree in the same order they appear in `idsToAdd` array.\n * - `T` is assigned to each entry using the `additionalPropsGetter` function.\n * @internal\n */\nexport function updateChildrenTree<T extends object = {}>({\n  tree,\n  additionalPropsGetter,\n  idsToAdd,\n}: {\n  tree: ChildrenTree<T>;\n  idsToAdd: Id64Array;\n  additionalPropsGetter: (id: Id64String, additionalProps?: T) => T;\n}) {\n  let currentTree: ChildrenTree<T> = tree;\n  for (let i = 0; i < idsToAdd.length; ++i) {\n    const id = idsToAdd[i];\n    let entry = currentTree.get(id);\n    entry = {\n      // Whoever calls this function knows how to assign the `T` to entry.\n      ...additionalPropsGetter(id, entry),\n      // If children already exists, we reuse it.\n      // If children do not exist and there are still ids left in the `idsToAdd` array, create a new Map, it will have the next id.\n      ...(entry?.children || i + 1 < idsToAdd.length ? { children: entry?.children ?? new Map() } : {}),\n    };\n    // Always update the set with updated entry.\n    currentTree.set(id, entry);\n    // This will only happen if it's the last id in `idsToAdd` array. In such case loop can be exited.\n    if (!entry.children) {\n      break;\n    }\n    currentTree = entry.children;\n  }\n}\n"]}

package/lib/cjs/tree-widget-react/components/trees/models-tree/internal/AlwaysAndNeverDrawnElementInfo.d.ts

@@ -1,22 +1,53 @@
-import type { Id64Arg, Id64Set, Id64String } from "@itwin/core-bentley";
 import type { Observable } from "rxjs";
+import type { GuidString, Id64Arg, Id64String } from "@itwin/core-bentley";
 import type { Viewport } from "@itwin/core-frontend";
+import type { ChildrenTree } from "../Utils.js";
 /** @internal */
 export declare const SET_CHANGE_DEBOUNCE_TIME = 20;
 type SetType = "always" | "never";
-/** @internal */
-export interface AlwaysOrNeverDrawnElementsQueryProps {
-    modelId: Id64String;
-    categoryIds?: Id64Arg;
+interface GetElementsTreeByModelProps {
+    /** Only always/never drawn elements that have the specified models will be returned. */
+    modelIds: Id64Arg;
+    /**
+     * The type of set from which tree should be retrieved.
+     * `always` - ChildrenTree will be created from `alwaysDrawn` set.
+     * `never` - ChildrenTree will be created from `neverDrawn` set.
+     */
+    setType: SetType;
+}
+interface GetElementsTreeByCategoryProps extends GetElementsTreeByModelProps {
+    /**
+     * Categories of root elements.
+     *
+     * Elements are filtered by given categories. Children of those elements are also included, no matter their category.
+     */
+    categoryIds: Id64Arg;
 }
+interface GetElementsTreeByElementProps extends GetElementsTreeByCategoryProps {
+    /** Path to element for which to get its' child always/never drawn elements. When undefined, models and categories will be used to get the always/never drawn elements. */
+    parentElementIdsPath: Array<Id64Arg>;
+}
+/** @internal */
+export type GetElementsTreeProps = GetElementsTreeByModelProps | GetElementsTreeByCategoryProps | GetElementsTreeByElementProps;
+/**
+ * - `categoryId` is assigned only to the elements in always/never drawn set.
+ * - `isInAlwaysOrNeverDrawnSet` flag determines if key (ECInstanceId) is in always/never set.
+ * @internal
+ */
+export type MapEntry = {
+    isInAlwaysOrNeverDrawnSet: true;
+    categoryId: Id64String;
+} | {
+    isInAlwaysOrNeverDrawnSet: false;
+};
+type CachedNodesMap = ChildrenTree<MapEntry>;
 export declare class AlwaysAndNeverDrawnElementInfo implements Disposable {
     #private;
-    constructor(viewport: Viewport);
+    constructor(viewport: Viewport, componentId?: GuidString);
     suppressChangeEvents(): void;
     resumeChangeEvents(): void;
-    getElements({ setType, modelId, categoryIds }: {
-        setType: SetType;
-    } & AlwaysOrNeverDrawnElementsQueryProps): Observable<Id64Set>;
+    getElementsTree({ setType, modelIds, ...props }: GetElementsTreeProps): Observable<CachedNodesMap>;
+    private getChildrenTree;
     private createCacheEntryObservable;
     [Symbol.dispose](): void;
     private queryAlwaysOrNeverDrawnElementInfo;

package/lib/cjs/tree-widget-react/components/trees/models-tree/internal/AlwaysAndNeverDrawnElementInfo.js

@@ -8,7 +8,7 @@ exports.AlwaysAndNeverDrawnElementInfo = exports.SET_CHANGE_DEBOUNCE_TIME = void
 const rxjs_1 = require("rxjs");
 const core_bentley_1 = require("@itwin/core-bentley");
 const presentation_core_interop_1 = require("@itwin/presentation-core-interop");
-const Utils_js_1 = require("../../common/Utils.js");
+const Utils_js_1 = require("../Utils.js");
 /** @internal */
 exports.SET_CHANGE_DEBOUNCE_TIME = 20;
 class AlwaysAndNeverDrawnElementInfo {
@@ -17,14 +17,18 @@ class AlwaysAndNeverDrawnElementInfo {
     #neverDrawn;
     #disposeSubject = new rxjs_1.Subject();
     #viewport;
+    #componentId;
+    #componentName;
     #suppressors;
     #suppress = new rxjs_1.Subject();
-    constructor(viewport) {
+    constructor(viewport, componentId) {
         this.#viewport = viewport;
         this.#alwaysDrawn = { cacheEntryObs: this.createCacheEntryObservable("always") };
         this.#neverDrawn = { cacheEntryObs: this.createCacheEntryObservable("never") };
         this.#suppressors = this.#suppress.pipe((0, rxjs_1.scan)((acc, suppress) => acc + (suppress ? 1 : -1), 0), (0, rxjs_1.startWith)(0), (0, rxjs_1.shareReplay)(1));
         this.#subscriptions = [this.#alwaysDrawn.cacheEntryObs.subscribe(), this.#neverDrawn.cacheEntryObs.subscribe()];
+        this.#componentId = componentId ?? core_bentley_1.Guid.createValue();
+        this.#componentName = "AlwaysAndNeverDrawnElementInfo";
     }
     suppressChangeEvents() {
         this.#suppress.next(true);
@@ -32,29 +36,43 @@ class AlwaysAndNeverDrawnElementInfo {
     resumeChangeEvents() {
         this.#suppress.next(false);
     }
-    getElements({ setType, modelId, categoryIds }) {
+    getElementsTree({ setType, modelIds, ...props }) {
         const cache = setType === "always" ? this.#alwaysDrawn : this.#neverDrawn;
-        const getElements = categoryIds
-            ? (entry) => {
-                const result = new Set();
-                for (const categoryId of core_bentley_1.Id64.iterable(categoryIds)) {
-                    const elements = entry?.get(modelId)?.get(categoryId);
-                    elements?.forEach((elementId) => result.add(elementId));
-                }
-                return result;
+        const getElements = (rootTreeNodes) => {
+            if (!rootTreeNodes) {
+                return new Map();
             }
-            : (entry) => {
-                const modelEntry = entry?.get(modelId);
-                const elements = new Set();
-                for (const set of modelEntry?.values() ?? []) {
-                    set.forEach((id) => elements.add(id));
+            const pathToElements = [modelIds];
+            if ("categoryIds" in props && props.categoryIds) {
+                pathToElements.push(props.categoryIds);
+                if ("parentElementIdsPath" in props && props.parentElementIdsPath) {
+                    props.parentElementIdsPath.forEach((parentElementIds) => pathToElements.push(parentElementIds));
                 }
-                return elements;
-            };
+            }
+            return this.getChildrenTree({ currentChildrenTree: rootTreeNodes, pathToElements, currentIdsIndex: 0 });
+        };
         return !cache.latestCacheEntryValue
             ? cache.cacheEntryObs.pipe((0, rxjs_1.map)(getElements))
             : this.#suppressors.pipe((0, rxjs_1.take)(1), (0, rxjs_1.mergeMap)((suppressionCount) => suppressionCount > 0 ? (0, rxjs_1.of)(cache.latestCacheEntryValue).pipe((0, rxjs_1.map)(getElements)) : cache.cacheEntryObs.pipe((0, rxjs_1.map)(getElements))));
     }
+    getChildrenTree({ currentChildrenTree, pathToElements, currentIdsIndex, }) {
+        if (currentIdsIndex >= pathToElements.length) {
+            return currentChildrenTree;
+        }
+        const result = new Map();
+        for (const parentId of core_bentley_1.Id64.iterable(pathToElements[currentIdsIndex])) {
+            const entry = currentChildrenTree.get(parentId);
+            if (entry?.children) {
+                const childrenTreeOfChildren = this.getChildrenTree({
+                    currentChildrenTree: entry.children,
+                    pathToElements,
+                    currentIdsIndex: currentIdsIndex + 1,
+                });
+                childrenTreeOfChildren.forEach((val, childId) => result.set(childId, val));
+            }
+        }
+        return result;
+    }
     createCacheEntryObservable(setType) {
         const event = setType === "always" ? this.#viewport.onAlwaysDrawnChanged : this.#viewport.onNeverDrawnChanged;
         const getIds = setType === "always" ? () => this.#viewport.alwaysDrawn : () => this.#viewport.neverDrawn;
@@ -81,7 +99,7 @@ class AlwaysAndNeverDrawnElementInfo {
             resetOnRefCountZero: false,
         }), 
         // Wait until the result is available.
-        (0, rxjs_1.first)((x) => !!x));
+        (0, rxjs_1.first)((x) => !!x, new Map()));
         return obs;
     }
     [Symbol.dispose]() {
@@ -90,16 +108,22 @@ class AlwaysAndNeverDrawnElementInfo {
         this.#disposeSubject.next();
     }
     queryAlwaysOrNeverDrawnElementInfo(set, requestId) {
-        const elementInfo = set?.size ? this.queryElementInfo([...set], requestId) : rxjs_1.EMPTY;
-        return elementInfo.pipe((0, rxjs_1.reduce)((state, val) => {
-            let entry = state.get(val.modelId);
-            if (!entry) {
-                entry = new Map();
-                state.set(val.modelId, entry);
-            }
-            (0, Utils_js_1.pushToMap)(entry, val.categoryId, val.elementId);
-            return state;
-        }, new Map()));
+        const elementInfo = set?.size
+            ? (0, rxjs_1.from)(set).pipe((0, rxjs_1.bufferCount)(Math.ceil(set.size / Math.ceil(set.size / 5000))), (0, rxjs_1.mergeMap)((block, index) => this.queryElementInfo(block, `${requestId}-${index}`), 10))
+            : rxjs_1.EMPTY;
+        return elementInfo.pipe((0, Utils_js_1.releaseMainThreadOnItemsCount)(1000), (0, rxjs_1.reduce)((acc, { categoryId, rootCategoryId, modelId, elementsPath }) => {
+            const elementIdInList = elementsPath[elementsPath.length - 1];
+            const additionalPropsGetter = (id, additionalProps) => {
+                if (id === elementIdInList) {
+                    // Last element in elementsPath is in always/never drawn set. We want to mark, that it is in the set, and save it's categoryId.
+                    return { isInAlwaysOrNeverDrawnSet: true, categoryId };
+                }
+                // Existing entries can keep their value, if it's a new entry it's not in the list.
+                return additionalProps ?? { isInAlwaysOrNeverDrawnSet: false };
+            };
+            (0, Utils_js_1.updateChildrenTree)({ tree: acc, idsToAdd: [modelId, rootCategoryId, ...elementsPath], additionalPropsGetter });
+            return acc;
+        }, (() => new Map())()));
     }
     queryElementInfo(elementIds, requestId) {
         return (0, rxjs_1.defer)(() => {
@@ -107,37 +131,42 @@ class AlwaysAndNeverDrawnElementInfo {
             return executor.createQueryReader({
                 ctes: [
                     `
-            ElementInfo(elementId, modelId, categoryId, parentId) AS (
+            ElementInfo(modelId, rootCategoryId, categoryId, parentId, elementsPath) AS (
               SELECT
-                ECInstanceId elementId,
                 Model.Id modelId,
+                Category.Id rootCategoryId,
                 Category.Id categoryId,
-                Parent.Id parentId
+                Parent.Id parentId,
+                CAST(IdToHex(ECInstanceId) AS TEXT) elementsPath
               FROM bis.GeometricElement3d
               WHERE InVirtualSet(?, ECInstanceId)
 
               UNION ALL
 
               SELECT
-                e.elementId,
-                e.modelId,
-                p.Category.Id categoryId,
-                p.Parent.Id parentId
+                e.modelId modelId,
+                p.Category.Id rootCategoryId,
+                e.categoryId categoryId,
+                p.Parent.Id parentId,
+                CAST(IdToHex(p.ECInstanceId) AS TEXT) || ';' || e.elementsPath
               FROM bis.GeometricElement3d p
               JOIN ElementInfo e ON p.ECInstanceId = e.parentId
             )
             `,
                 ],
                 ecsql: `
-            SELECT elementId, modelId, categoryId
+            SELECT elementsPath elementsPath, modelId modelId, categoryId categoryId, rootCategoryId rootCategoryId
             FROM ElementInfo
             WHERE parentId IS NULL
           `,
                 bindings: [{ type: "idset", value: elementIds }],
             }, {
-                restartToken: `ModelsTreeVisibilityHandler/${requestId}`,
+                rowFormat: "ECSqlPropertyNames",
+                restartToken: `${this.#componentName}/${this.#componentId}/${requestId}`,
             });
-        }).pipe((0, rxjs_1.map)((row) => ({ elementId: row.elementId, modelId: row.modelId, categoryId: row.categoryId })));
+        }).pipe((0, rxjs_1.map)((row) => {
+            return { elementsPath: row.elementsPath.split(";"), modelId: row.modelId, categoryId: row.categoryId, rootCategoryId: row.rootCategoryId };
+        }));
     }
 }
 exports.AlwaysAndNeverDrawnElementInfo = AlwaysAndNeverDrawnElementInfo;

package/lib/cjs/tree-widget-react/components/trees/models-tree/internal/AlwaysAndNeverDrawnElementInfo.js.map

@@ -1 +1 @@
-{"version":3,"file":"AlwaysAndNeverDrawnElementInfo.js","sourceRoot":"","sources":["../../../../../../../src/tree-widget-react/components/trees/models-tree/internal/AlwaysAndNeverDrawnElementInfo.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,+BAqBc;AACd,sDAA2C;AAC3C,gFAA4E;AAC5E,oDAAkD;AAMlD,gBAAgB;AACH,QAAA,wBAAwB,GAAG,EAAE,CAAC;AAY3C,MAAa,8BAA8B;IACzC,cAAc,CAAiB;IAC/B,YAAY,CAAgF;IAC5F,WAAW,CAAgF;IAC3F,eAAe,GAAG,IAAI,cAAO,EAAQ,CAAC;IAC7B,SAAS,CAAW;IAE7B,YAAY,CAAqB;IACjC,SAAS,GAAG,IAAI,cAAO,EAAW,CAAC;IAEnC,YAAY,QAAkB;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,YAAY,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,0BAA0B,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjF,IAAI,CAAC,WAAW,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,0BAA0B,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/E,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CACrC,IAAA,WAAI,EAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EACrD,IAAA,gBAAS,EAAC,CAAC,CAAC,EACZ,IAAA,kBAAW,EAAC,CAAC,CAAC,CACf,CAAC;QACF,IAAI,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,CAAC;IAClH,CAAC;IAEM,oBAAoB;QACzB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAEM,kBAAkB;QACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAEM,WAAW,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAA+D;QAC/G,MAAM,KAAK,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QAC1E,MAAM,WAAW,GAAG,WAAW;YAC7B,CAAC,CAAC,CAAC,KAA6B,EAAE,EAAE;gBAChC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;gBACrC,KAAK,MAAM,UAAU,IAAI,mBAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;oBACpD,MAAM,QAAQ,GAAG,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;oBACtD,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC1D,CAAC;gBACD,OAAO,MAAM,CAAC;YAChB,CAAC;YACH,CAAC,CAAC,CAAC,KAA6B,EAAE,EAAE;gBAChC,MAAM,UAAU,GAAG,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;gBACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAc,CAAC;gBACvC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;oBAC7C,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxC,CAAC;gBACD,OAAO,QAAQ,CAAC;YAClB,CAAC,CAAC;QAEN,OAAO,CAAC,KAAK,CAAC,qBAAqB;YACjC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,WAAW,CAAC,CAAC;YAC5C,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CACpB,IAAA,WAAI,EAAC,CAAC,CAAC,EACP,IAAA,eAAQ,EAAC,CAAC,gBAAgB,EAAE,EAAE,CAC5B,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAA,SAAE,EAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,WAAW,CAAC,CAAC,CAC3H,CACF,CAAC;IACR,CAAC;IAEO,0BAA0B,CAAC,OAAgB;QACjD,MAAM,KAAK,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC;QAC9G,MAAM,MAAM,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;QAEzG,MAAM,aAAa,GAAG,IAAI,sBAAe,CAAyB,SAAS,CAAC,CAAC;QAE7E,MAAM,GAAG,GAAG,IAAA,uBAAgB,EAC1B,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,EACvC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAC3C,CAAC,IAAI;QACJ,4CAA4C;QAC5C,IAAA,gBAAS,EAAC,SAAS,CAAC;QACpB,0DAA0D;QAC1D,iFAAiF;QACjF,6EAA6E;QAC7E,IAAA,UAAG,EAAC,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxC,6CAA6C;QAC7C,IAAA,gBAAS,EAAC,GAAG,EAAE,CACb,IAAI,CAAC,YAAY,CAAC,IAAI,CACpB,IAAA,aAAM,EAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,KAAK,CAAC,CAAC,EAC1C,IAAA,WAAI,EAAC,CAAC,CAAC,CACR,CACF,EACD,IAAA,mBAAY,EAAC,gCAAwB,CAAC;QACtC,iDAAiD;QACjD,IAAA,gBAAS,EAAC,IAAI,CAAC,eAAe,CAAC;QAC/B,iFAAiF;QACjF,IAAA,gBAAS,EAAC,GAAG,EAAE,CAAC,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,EAAE,GAAG,OAAO,OAAO,CAAC,CAAC,EACrF,IAAA,UAAG,EAAC,CAAC,UAAU,EAAE,EAAE;YACjB,MAAM,KAAK,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YAC1E,KAAK,CAAC,qBAAqB,GAAG,UAAU,CAAC;QAC3C,CAAC,CAAC;QACF,2EAA2E;QAC3E,IAAA,YAAK,EAAC;YACJ,SAAS,EAAE,GAAG,EAAE,CAAC,aAAa;YAC9B,mBAAmB,EAAE,KAAK;SAC3B,CAAC;QACF,sCAAsC;QACtC,IAAA,YAAK,EAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;QACF,OAAO,GAAG,CAAC;IACb,CAAC;IAEM,CAAC,MAAM,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACpD,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;IAEO,kCAAkC,CAAC,GAAwB,EAAE,SAAiB;QACpF,MAAM,WAAW,GAAG,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,YAAK,CAAC;QACnF,OAAO,WAAW,CAAC,IAAI,CACrB,IAAA,aAAM,EAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YACpB,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;gBAClB,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAChC,CAAC;YACD,IAAA,oBAAS,EAAC,KAAK,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YAChD,OAAO,KAAK,CAAC;QACf,CAAC,EAAE,IAAI,GAAG,EAAwC,CAAC,CACpD,CAAC;IACJ,CAAC;IAEO,gBAAgB,CACtB,UAAqB,EACrB,SAAiB;QAMjB,OAAO,IAAA,YAAK,EAAC,GAAG,EAAE;YAChB,MAAM,QAAQ,GAAG,IAAA,oDAAwB,EAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACjE,OAAO,QAAQ,CAAC,iBAAiB,CAC/B;gBACE,IAAI,EAAE;oBACJ;;;;;;;;;;;;;;;;;;;;aAoBC;iBACF;gBACD,KAAK,EAAE;;;;WAIN;gBACD,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;aACjD,EACD;gBACE,YAAY,EAAE,+BAA+B,SAAS,EAAE;aACzD,CACF,CAAC;QACJ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1G,CAAC;CACF;AA5KD,wEA4KC","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 {\n  BehaviorSubject,\n  debounceTime,\n  defer,\n  EMPTY,\n  filter,\n  first,\n  fromEventPattern,\n  map,\n  mergeMap,\n  of,\n  reduce,\n  scan,\n  share,\n  shareReplay,\n  startWith,\n  Subject,\n  switchMap,\n  take,\n  takeUntil,\n  tap,\n} from \"rxjs\";\nimport { Id64 } from \"@itwin/core-bentley\";\nimport { createECSqlQueryExecutor } from \"@itwin/presentation-core-interop\";\nimport { pushToMap } from \"../../common/Utils.js\";\n\nimport type { Id64Arg, Id64Array, Id64Set, Id64String } from \"@itwin/core-bentley\";\nimport type { Observable, Subscription } from \"rxjs\";\nimport type { Viewport } from \"@itwin/core-frontend\";\n\n/** @internal */\nexport const SET_CHANGE_DEBOUNCE_TIME = 20;\n\ntype SetType = \"always\" | \"never\";\n\n/** @internal */\nexport interface AlwaysOrNeverDrawnElementsQueryProps {\n  modelId: Id64String;\n  categoryIds?: Id64Arg;\n}\n\ntype CacheEntry = Map<Id64String, Map<Id64String, Id64Set>>;\n\nexport class AlwaysAndNeverDrawnElementInfo implements Disposable {\n  #subscriptions: Subscription[];\n  #alwaysDrawn: { cacheEntryObs: Observable<CacheEntry>; latestCacheEntryValue?: CacheEntry };\n  #neverDrawn: { cacheEntryObs: Observable<CacheEntry>; latestCacheEntryValue?: CacheEntry };\n  #disposeSubject = new Subject<void>();\n  readonly #viewport: Viewport;\n\n  #suppressors: Observable<number>;\n  #suppress = new Subject<boolean>();\n\n  constructor(viewport: Viewport) {\n    this.#viewport = viewport;\n    this.#alwaysDrawn = { cacheEntryObs: this.createCacheEntryObservable(\"always\") };\n    this.#neverDrawn = { cacheEntryObs: this.createCacheEntryObservable(\"never\") };\n    this.#suppressors = this.#suppress.pipe(\n      scan((acc, suppress) => acc + (suppress ? 1 : -1), 0),\n      startWith(0),\n      shareReplay(1),\n    );\n    this.#subscriptions = [this.#alwaysDrawn.cacheEntryObs.subscribe(), this.#neverDrawn.cacheEntryObs.subscribe()];\n  }\n\n  public suppressChangeEvents() {\n    this.#suppress.next(true);\n  }\n\n  public resumeChangeEvents() {\n    this.#suppress.next(false);\n  }\n\n  public getElements({ setType, modelId, categoryIds }: { setType: SetType } & AlwaysOrNeverDrawnElementsQueryProps): Observable<Id64Set> {\n    const cache = setType === \"always\" ? this.#alwaysDrawn : this.#neverDrawn;\n    const getElements = categoryIds\n      ? (entry: CacheEntry | undefined) => {\n          const result = new Set<Id64String>();\n          for (const categoryId of Id64.iterable(categoryIds)) {\n            const elements = entry?.get(modelId)?.get(categoryId);\n            elements?.forEach((elementId) => result.add(elementId));\n          }\n          return result;\n        }\n      : (entry: CacheEntry | undefined) => {\n          const modelEntry = entry?.get(modelId);\n          const elements = new Set<Id64String>();\n          for (const set of modelEntry?.values() ?? []) {\n            set.forEach((id) => elements.add(id));\n          }\n          return elements;\n        };\n\n    return !cache.latestCacheEntryValue\n      ? cache.cacheEntryObs.pipe(map(getElements))\n      : this.#suppressors.pipe(\n          take(1),\n          mergeMap((suppressionCount) =>\n            suppressionCount > 0 ? of(cache.latestCacheEntryValue).pipe(map(getElements)) : cache.cacheEntryObs.pipe(map(getElements)),\n          ),\n        );\n  }\n\n  private createCacheEntryObservable(setType: SetType): Observable<CacheEntry> {\n    const event = setType === \"always\" ? this.#viewport.onAlwaysDrawnChanged : this.#viewport.onNeverDrawnChanged;\n    const getIds = setType === \"always\" ? () => this.#viewport.alwaysDrawn : () => this.#viewport.neverDrawn;\n\n    const resultSubject = new BehaviorSubject<CacheEntry | undefined>(undefined);\n\n    const obs = fromEventPattern(\n      (handler) => event.addListener(handler),\n      (handler) => event.removeListener(handler),\n    ).pipe(\n      // Fire the observable once at the beginning\n      startWith(undefined),\n      // Reset result subject as soon as a new event is emitted.\n      // This will make newly subscribed observers wait for the debounce period to pass\n      // instead of consuming the cached value which at this point becomes invalid.\n      tap(() => resultSubject.next(undefined)),\n      // Check if cache updates are not suppressed.\n      switchMap(() =>\n        this.#suppressors.pipe(\n          filter((suppressors) => suppressors === 0),\n          take(1),\n        ),\n      ),\n      debounceTime(SET_CHANGE_DEBOUNCE_TIME),\n      // Cancel pending request if dispose() is called.\n      takeUntil(this.#disposeSubject),\n      // If multiple requests are sent at once, preserve only the result of the newest.\n      switchMap(() => this.queryAlwaysOrNeverDrawnElementInfo(getIds(), `${setType}Drawn`)),\n      tap((cacheEntry) => {\n        const value = setType === \"always\" ? this.#alwaysDrawn : this.#neverDrawn;\n        value.latestCacheEntryValue = cacheEntry;\n      }),\n      // Share the result by using a subject which always emits the saved result.\n      share({\n        connector: () => resultSubject,\n        resetOnRefCountZero: false,\n      }),\n      // Wait until the result is available.\n      first((x): x is CacheEntry => !!x),\n    );\n    return obs;\n  }\n\n  public [Symbol.dispose]() {\n    this.#subscriptions.forEach((x) => x.unsubscribe());\n    this.#subscriptions = [];\n    this.#disposeSubject.next();\n  }\n\n  private queryAlwaysOrNeverDrawnElementInfo(set: Id64Set | undefined, requestId: string): Observable<CacheEntry> {\n    const elementInfo = set?.size ? this.queryElementInfo([...set], requestId) : EMPTY;\n    return elementInfo.pipe(\n      reduce((state, val) => {\n        let entry = state.get(val.modelId);\n        if (!entry) {\n          entry = new Map();\n          state.set(val.modelId, entry);\n        }\n        pushToMap(entry, val.categoryId, val.elementId);\n        return state;\n      }, new Map<Id64String, Map<Id64String, Id64Set>>()),\n    );\n  }\n\n  private queryElementInfo(\n    elementIds: Id64Array,\n    requestId: string,\n  ): Observable<{\n    elementId: Id64String;\n    modelId: Id64String;\n    categoryId: Id64String;\n  }> {\n    return defer(() => {\n      const executor = createECSqlQueryExecutor(this.#viewport.iModel);\n      return executor.createQueryReader(\n        {\n          ctes: [\n            `\n            ElementInfo(elementId, modelId, categoryId, parentId) AS (\n              SELECT\n                ECInstanceId elementId,\n                Model.Id modelId,\n                Category.Id categoryId,\n                Parent.Id parentId\n              FROM bis.GeometricElement3d\n              WHERE InVirtualSet(?, ECInstanceId)\n\n              UNION ALL\n\n              SELECT\n                e.elementId,\n                e.modelId,\n                p.Category.Id categoryId,\n                p.Parent.Id parentId\n              FROM bis.GeometricElement3d p\n              JOIN ElementInfo e ON p.ECInstanceId = e.parentId\n            )\n            `,\n          ],\n          ecsql: `\n            SELECT elementId, modelId, categoryId\n            FROM ElementInfo\n            WHERE parentId IS NULL\n          `,\n          bindings: [{ type: \"idset\", value: elementIds }],\n        },\n        {\n          restartToken: `ModelsTreeVisibilityHandler/${requestId}`,\n        },\n      );\n    }).pipe(map((row) => ({ elementId: row.elementId, modelId: row.modelId, categoryId: row.categoryId })));\n  }\n}\n"]}
+{"version":3,"file":"AlwaysAndNeverDrawnElementInfo.js","sourceRoot":"","sources":["../../../../../../../src/tree-widget-react/components/trees/models-tree/internal/AlwaysAndNeverDrawnElementInfo.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,+BAuBc;AACd,sDAAiD;AACjD,gFAA4E;AAC5E,0CAAgF;AAOhF,gBAAgB;AACH,QAAA,wBAAwB,GAAG,EAAE,CAAC;AAuC3C,MAAa,8BAA8B;IACzC,cAAc,CAAiB;IAC/B,YAAY,CAAwF;IACpG,WAAW,CAAwF;IACnG,eAAe,GAAG,IAAI,cAAO,EAAQ,CAAC;IAC7B,SAAS,CAAW;IAC7B,YAAY,CAAa;IACzB,cAAc,CAAS;IAEvB,YAAY,CAAqB;IACjC,SAAS,GAAG,IAAI,cAAO,EAAW,CAAC;IAEnC,YAAY,QAAkB,EAAE,WAAwB;QACtD,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,YAAY,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,0BAA0B,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjF,IAAI,CAAC,WAAW,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,0BAA0B,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/E,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CACrC,IAAA,WAAI,EAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EACrD,IAAA,gBAAS,EAAC,CAAC,CAAC,EACZ,IAAA,kBAAW,EAAC,CAAC,CAAC,CACf,CAAC;QACF,IAAI,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,CAAC;QAChH,IAAI,CAAC,YAAY,GAAG,WAAW,IAAI,mBAAI,CAAC,WAAW,EAAE,CAAC;QACtD,IAAI,CAAC,cAAc,GAAG,gCAAgC,CAAC;IACzD,CAAC;IAEM,oBAAoB;QACzB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAEM,kBAAkB;QACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAEM,eAAe,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,KAAK,EAAwB;QAC1E,MAAM,KAAK,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QAC1E,MAAM,WAAW,GAAG,CAAC,aAAyC,EAAkB,EAAE;YAChF,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnB,OAAO,IAAI,GAAG,EAAE,CAAC;YACnB,CAAC;YACD,MAAM,cAAc,GAAG,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,aAAa,IAAI,KAAK,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBAChD,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBACvC,IAAI,sBAAsB,IAAI,KAAK,IAAI,KAAK,CAAC,oBAAoB,EAAE,CAAC;oBAClE,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,gBAAgB,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBAClG,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,mBAAmB,EAAE,aAAa,EAAE,cAAc,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1G,CAAC,CAAC;QAEF,OAAO,CAAC,KAAK,CAAC,qBAAqB;YACjC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,WAAW,CAAC,CAAC;YAC5C,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CACpB,IAAA,WAAI,EAAC,CAAC,CAAC,EACP,IAAA,eAAQ,EAAC,CAAC,gBAAgB,EAAE,EAAE,CAC5B,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAA,SAAE,EAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,IAAA,UAAG,EAAC,WAAW,CAAC,CAAC,CAC3H,CACF,CAAC;IACR,CAAC;IAEO,eAAe,CAAmB,EACxC,mBAAmB,EACnB,cAAc,EACd,eAAe,GAKhB;QACC,IAAI,eAAe,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;YAC7C,OAAO,mBAAmB,CAAC;QAC7B,CAAC;QACD,MAAM,MAAM,GAAoB,IAAI,GAAG,EAAE,CAAC;QAC1C,KAAK,MAAM,QAAQ,IAAI,mBAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC;YACtE,MAAM,KAAK,GAAG,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChD,IAAI,KAAK,EAAE,QAAQ,EAAE,CAAC;gBACpB,MAAM,sBAAsB,GAAG,IAAI,CAAC,eAAe,CAAC;oBAClD,mBAAmB,EAAE,KAAK,CAAC,QAAQ;oBACnC,cAAc;oBACd,eAAe,EAAE,eAAe,GAAG,CAAC;iBACrC,CAAC,CAAC;gBACH,sBAAsB,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,0BAA0B,CAAC,OAAgB;QACjD,MAAM,KAAK,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC;QAC9G,MAAM,MAAM,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;QAEzG,MAAM,aAAa,GAAG,IAAI,sBAAe,CAA6B,SAAS,CAAC,CAAC;QAEjF,MAAM,GAAG,GAA+B,IAAA,uBAAgB,EACtD,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,EACvC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAC3C,CAAC,IAAI;QACJ,4CAA4C;QAC5C,IAAA,gBAAS,EAAC,SAAS,CAAC;QACpB,0DAA0D;QAC1D,iFAAiF;QACjF,6EAA6E;QAC7E,IAAA,UAAG,EAAC,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxC,6CAA6C;QAC7C,IAAA,gBAAS,EAAC,GAAG,EAAE,CACb,IAAI,CAAC,YAAY,CAAC,IAAI,CACpB,IAAA,aAAM,EAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,KAAK,CAAC,CAAC,EAC1C,IAAA,WAAI,EAAC,CAAC,CAAC,CACR,CACF,EACD,IAAA,mBAAY,EAAC,gCAAwB,CAAC;QACtC,iDAAiD;QACjD,IAAA,gBAAS,EAAC,IAAI,CAAC,eAAe,CAAC;QAC/B,iFAAiF;QACjF,IAAA,gBAAS,EAAC,GAAG,EAAE,CAAC,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,EAAE,GAAG,OAAO,OAAO,CAAC,CAAC,EACrF,IAAA,UAAG,EAAC,CAAC,UAAU,EAAE,EAAE;YACjB,MAAM,KAAK,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YAC1E,KAAK,CAAC,qBAAqB,GAAG,UAAU,CAAC;QAC3C,CAAC,CAAC;QACF,2EAA2E;QAC3E,IAAA,YAAK,EAAC;YACJ,SAAS,EAAE,GAAG,EAAE,CAAC,aAAa;YAC9B,mBAAmB,EAAE,KAAK;SAC3B,CAAC;QACF,sCAAsC;QACtC,IAAA,YAAK,EAAC,CAAC,CAAC,EAAuB,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAClD,CAAC;QACF,OAAO,GAAG,CAAC;IACb,CAAC;IAEM,CAAC,MAAM,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACpD,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;IAEO,kCAAkC,CAAC,GAAwB,EAAE,SAAiB;QACpF,MAAM,WAAW,GAAG,GAAG,EAAE,IAAI;YAC3B,CAAC,CAAC,IAAA,WAAI,EAAC,GAAG,CAAC,CAAC,IAAI,CACZ,IAAA,kBAAW,EAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAC7D,IAAA,eAAQ,EAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,SAAS,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CACtF;YACH,CAAC,CAAC,YAAK,CAAC;QACV,OAAO,WAAW,CAAC,IAAI,CACrB,IAAA,wCAA6B,EAAC,IAAI,CAAC,EACnC,IAAA,aAAM,EACJ,CAAC,GAAG,EAAE,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,EAAE;YAC7D,MAAM,eAAe,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,MAAM,qBAAqB,GAAG,CAAC,EAAc,EAAE,eAA0B,EAAY,EAAE;gBACrF,IAAI,EAAE,KAAK,eAAe,EAAE,CAAC;oBAC3B,+HAA+H;oBAC/H,OAAO,EAAE,yBAAyB,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;gBACzD,CAAC;gBACD,mFAAmF;gBACnF,OAAO,eAAe,IAAI,EAAE,yBAAyB,EAAE,KAAK,EAAE,CAAC;YACjE,CAAC,CAAC;YACF,IAAA,6BAAkB,EAAC,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,cAAc,EAAE,GAAG,YAAY,CAAC,EAAE,qBAAqB,EAAE,CAAC,CAAC;YAC/G,OAAO,GAAG,CAAC;QACb,CAAC,EACD,CAAC,GAAmB,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,CACpC,CACF,CAAC;IACJ,CAAC;IAEO,gBAAgB,CACtB,UAAqB,EACrB,SAAiB;QAOjB,OAAO,IAAA,YAAK,EAAC,GAAG,EAAE;YAChB,MAAM,QAAQ,GAAG,IAAA,oDAAwB,EAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACjE,OAAO,QAAQ,CAAC,iBAAiB,CAC/B;gBACE,IAAI,EAAE;oBACJ;;;;;;;;;;;;;;;;;;;;;;aAsBC;iBACF;gBACD,KAAK,EAAE;;;;WAIN;gBACD,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;aACjD,EACD;gBACE,SAAS,EAAE,oBAAoB;gBAC/B,YAAY,EAAE,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,YAAY,IAAI,SAAS,EAAE;aACzE,CACF,CAAC;QACJ,CAAC,CAAC,CAAC,IAAI,CACL,IAAA,UAAG,EAAC,CAAC,GAAG,EAAE,EAAE;YACV,OAAO,EAAE,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,CAAC,cAAc,EAAE,CAAC;QAC7I,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;CACF;AA5ND,wEA4NC","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 {\n  BehaviorSubject,\n  bufferCount,\n  debounceTime,\n  defer,\n  EMPTY,\n  filter,\n  first,\n  from,\n  fromEventPattern,\n  map,\n  mergeMap,\n  of,\n  reduce,\n  scan,\n  share,\n  shareReplay,\n  startWith,\n  Subject,\n  switchMap,\n  take,\n  takeUntil,\n  tap,\n} from \"rxjs\";\nimport { Guid, Id64 } from \"@itwin/core-bentley\";\nimport { createECSqlQueryExecutor } from \"@itwin/presentation-core-interop\";\nimport { releaseMainThreadOnItemsCount, updateChildrenTree } from \"../Utils.js\";\n\nimport type { Observable, Subscription } from \"rxjs\";\nimport type { GuidString, Id64Arg, Id64Array, Id64Set, Id64String } from \"@itwin/core-bentley\";\nimport type { Viewport } from \"@itwin/core-frontend\";\nimport type { ChildrenTree } from \"../Utils.js\";\n\n/** @internal */\nexport const SET_CHANGE_DEBOUNCE_TIME = 20;\n\ntype SetType = \"always\" | \"never\";\n\ninterface GetElementsTreeByModelProps {\n  /** Only always/never drawn elements that have the specified models will be returned. */\n  modelIds: Id64Arg;\n  /**\n   * The type of set from which tree should be retrieved.\n   * `always` - ChildrenTree will be created from `alwaysDrawn` set.\n   * `never` - ChildrenTree will be created from `neverDrawn` set.\n   */\n  setType: SetType;\n}\ninterface GetElementsTreeByCategoryProps extends GetElementsTreeByModelProps {\n  /**\n   * Categories of root elements.\n   *\n   * Elements are filtered by given categories. Children of those elements are also included, no matter their category.\n   */\n  categoryIds: Id64Arg;\n}\ninterface GetElementsTreeByElementProps extends GetElementsTreeByCategoryProps {\n  /** Path to element for which to get its' child always/never drawn elements. When undefined, models and categories will be used to get the always/never drawn elements. */\n  parentElementIdsPath: Array<Id64Arg>;\n}\n\n/** @internal */\nexport type GetElementsTreeProps = GetElementsTreeByModelProps | GetElementsTreeByCategoryProps | GetElementsTreeByElementProps;\n\n/**\n * - `categoryId` is assigned only to the elements in always/never drawn set.\n * - `isInAlwaysOrNeverDrawnSet` flag determines if key (ECInstanceId) is in always/never set.\n * @internal\n */\nexport type MapEntry = { isInAlwaysOrNeverDrawnSet: true; categoryId: Id64String } | { isInAlwaysOrNeverDrawnSet: false };\n\ntype CachedNodesMap = ChildrenTree<MapEntry>;\n\nexport class AlwaysAndNeverDrawnElementInfo implements Disposable {\n  #subscriptions: Subscription[];\n  #alwaysDrawn: { cacheEntryObs: Observable<CachedNodesMap>; latestCacheEntryValue?: CachedNodesMap };\n  #neverDrawn: { cacheEntryObs: Observable<CachedNodesMap>; latestCacheEntryValue?: CachedNodesMap };\n  #disposeSubject = new Subject<void>();\n  readonly #viewport: Viewport;\n  #componentId: GuidString;\n  #componentName: string;\n\n  #suppressors: Observable<number>;\n  #suppress = new Subject<boolean>();\n\n  constructor(viewport: Viewport, componentId?: GuidString) {\n    this.#viewport = viewport;\n    this.#alwaysDrawn = { cacheEntryObs: this.createCacheEntryObservable(\"always\") };\n    this.#neverDrawn = { cacheEntryObs: this.createCacheEntryObservable(\"never\") };\n    this.#suppressors = this.#suppress.pipe(\n      scan((acc, suppress) => acc + (suppress ? 1 : -1), 0),\n      startWith(0),\n      shareReplay(1),\n    );\n    this.#subscriptions = [this.#alwaysDrawn.cacheEntryObs.subscribe(), this.#neverDrawn.cacheEntryObs.subscribe()];\n    this.#componentId = componentId ?? Guid.createValue();\n    this.#componentName = \"AlwaysAndNeverDrawnElementInfo\";\n  }\n\n  public suppressChangeEvents() {\n    this.#suppress.next(true);\n  }\n\n  public resumeChangeEvents() {\n    this.#suppress.next(false);\n  }\n\n  public getElementsTree({ setType, modelIds, ...props }: GetElementsTreeProps): Observable<CachedNodesMap> {\n    const cache = setType === \"always\" ? this.#alwaysDrawn : this.#neverDrawn;\n    const getElements = (rootTreeNodes: CachedNodesMap | undefined): CachedNodesMap => {\n      if (!rootTreeNodes) {\n        return new Map();\n      }\n      const pathToElements = [modelIds];\n      if (\"categoryIds\" in props && props.categoryIds) {\n        pathToElements.push(props.categoryIds);\n        if (\"parentElementIdsPath\" in props && props.parentElementIdsPath) {\n          props.parentElementIdsPath.forEach((parentElementIds) => pathToElements.push(parentElementIds));\n        }\n      }\n      return this.getChildrenTree({ currentChildrenTree: rootTreeNodes, pathToElements, currentIdsIndex: 0 });\n    };\n\n    return !cache.latestCacheEntryValue\n      ? cache.cacheEntryObs.pipe(map(getElements))\n      : this.#suppressors.pipe(\n          take(1),\n          mergeMap((suppressionCount) =>\n            suppressionCount > 0 ? of(cache.latestCacheEntryValue).pipe(map(getElements)) : cache.cacheEntryObs.pipe(map(getElements)),\n          ),\n        );\n  }\n\n  private getChildrenTree<T extends object>({\n    currentChildrenTree,\n    pathToElements,\n    currentIdsIndex,\n  }: {\n    currentChildrenTree: ChildrenTree<T>;\n    pathToElements: Array<Id64Arg>;\n    currentIdsIndex: number;\n  }): ChildrenTree<T> {\n    if (currentIdsIndex >= pathToElements.length) {\n      return currentChildrenTree;\n    }\n    const result: ChildrenTree<T> = new Map();\n    for (const parentId of Id64.iterable(pathToElements[currentIdsIndex])) {\n      const entry = currentChildrenTree.get(parentId);\n      if (entry?.children) {\n        const childrenTreeOfChildren = this.getChildrenTree({\n          currentChildrenTree: entry.children,\n          pathToElements,\n          currentIdsIndex: currentIdsIndex + 1,\n        });\n        childrenTreeOfChildren.forEach((val, childId) => result.set(childId, val));\n      }\n    }\n    return result;\n  }\n\n  private createCacheEntryObservable(setType: SetType): Observable<CachedNodesMap> {\n    const event = setType === \"always\" ? this.#viewport.onAlwaysDrawnChanged : this.#viewport.onNeverDrawnChanged;\n    const getIds = setType === \"always\" ? () => this.#viewport.alwaysDrawn : () => this.#viewport.neverDrawn;\n\n    const resultSubject = new BehaviorSubject<CachedNodesMap | undefined>(undefined);\n\n    const obs: Observable<CachedNodesMap> = fromEventPattern(\n      (handler) => event.addListener(handler),\n      (handler) => event.removeListener(handler),\n    ).pipe(\n      // Fire the observable once at the beginning\n      startWith(undefined),\n      // Reset result subject as soon as a new event is emitted.\n      // This will make newly subscribed observers wait for the debounce period to pass\n      // instead of consuming the cached value which at this point becomes invalid.\n      tap(() => resultSubject.next(undefined)),\n      // Check if cache updates are not suppressed.\n      switchMap(() =>\n        this.#suppressors.pipe(\n          filter((suppressors) => suppressors === 0),\n          take(1),\n        ),\n      ),\n      debounceTime(SET_CHANGE_DEBOUNCE_TIME),\n      // Cancel pending request if dispose() is called.\n      takeUntil(this.#disposeSubject),\n      // If multiple requests are sent at once, preserve only the result of the newest.\n      switchMap(() => this.queryAlwaysOrNeverDrawnElementInfo(getIds(), `${setType}Drawn`)),\n      tap((cacheEntry) => {\n        const value = setType === \"always\" ? this.#alwaysDrawn : this.#neverDrawn;\n        value.latestCacheEntryValue = cacheEntry;\n      }),\n      // Share the result by using a subject which always emits the saved result.\n      share({\n        connector: () => resultSubject,\n        resetOnRefCountZero: false,\n      }),\n      // Wait until the result is available.\n      first((x): x is CachedNodesMap => !!x, new Map()),\n    );\n    return obs;\n  }\n\n  public [Symbol.dispose]() {\n    this.#subscriptions.forEach((x) => x.unsubscribe());\n    this.#subscriptions = [];\n    this.#disposeSubject.next();\n  }\n\n  private queryAlwaysOrNeverDrawnElementInfo(set: Id64Set | undefined, requestId: string): Observable<CachedNodesMap> {\n    const elementInfo = set?.size\n      ? from(set).pipe(\n          bufferCount(Math.ceil(set.size / Math.ceil(set.size / 5000))),\n          mergeMap((block, index) => this.queryElementInfo(block, `${requestId}-${index}`), 10),\n        )\n      : EMPTY;\n    return elementInfo.pipe(\n      releaseMainThreadOnItemsCount(1000),\n      reduce(\n        (acc, { categoryId, rootCategoryId, modelId, elementsPath }) => {\n          const elementIdInList = elementsPath[elementsPath.length - 1];\n          const additionalPropsGetter = (id: Id64String, additionalProps?: MapEntry): MapEntry => {\n            if (id === elementIdInList) {\n              // Last element in elementsPath is in always/never drawn set. We want to mark, that it is in the set, and save it's categoryId.\n              return { isInAlwaysOrNeverDrawnSet: true, categoryId };\n            }\n            // Existing entries can keep their value, if it's a new entry it's not in the list.\n            return additionalProps ?? { isInAlwaysOrNeverDrawnSet: false };\n          };\n          updateChildrenTree({ tree: acc, idsToAdd: [modelId, rootCategoryId, ...elementsPath], additionalPropsGetter });\n          return acc;\n        },\n        ((): CachedNodesMap => new Map())(),\n      ),\n    );\n  }\n\n  private queryElementInfo(\n    elementIds: Id64Array,\n    requestId: string,\n  ): Observable<{\n    rootCategoryId: Id64String;\n    modelId: Id64String;\n    categoryId: Id64String;\n    elementsPath: Id64Array;\n  }> {\n    return defer(() => {\n      const executor = createECSqlQueryExecutor(this.#viewport.iModel);\n      return executor.createQueryReader(\n        {\n          ctes: [\n            `\n            ElementInfo(modelId, rootCategoryId, categoryId, parentId, elementsPath) AS (\n              SELECT\n                Model.Id modelId,\n                Category.Id rootCategoryId,\n                Category.Id categoryId,\n                Parent.Id parentId,\n                CAST(IdToHex(ECInstanceId) AS TEXT) elementsPath\n              FROM bis.GeometricElement3d\n              WHERE InVirtualSet(?, ECInstanceId)\n\n              UNION ALL\n\n              SELECT\n                e.modelId modelId,\n                p.Category.Id rootCategoryId,\n                e.categoryId categoryId,\n                p.Parent.Id parentId,\n                CAST(IdToHex(p.ECInstanceId) AS TEXT) || ';' || e.elementsPath\n              FROM bis.GeometricElement3d p\n              JOIN ElementInfo e ON p.ECInstanceId = e.parentId\n            )\n            `,\n          ],\n          ecsql: `\n            SELECT elementsPath elementsPath, modelId modelId, categoryId categoryId, rootCategoryId rootCategoryId\n            FROM ElementInfo\n            WHERE parentId IS NULL\n          `,\n          bindings: [{ type: \"idset\", value: elementIds }],\n        },\n        {\n          rowFormat: \"ECSqlPropertyNames\",\n          restartToken: `${this.#componentName}/${this.#componentId}/${requestId}`,\n        },\n      );\n    }).pipe(\n      map((row) => {\n        return { elementsPath: row.elementsPath.split(\";\"), modelId: row.modelId, categoryId: row.categoryId, rootCategoryId: row.rootCategoryId };\n      }),\n    );\n  }\n}\n"]}

package/lib/cjs/tree-widget-react/components/trees/models-tree/internal/FilteredTree.d.ts

@@ -1,25 +1,33 @@
-import { HierarchyFilteringPath } from "@itwin/presentation-hierarchies";
+import { HierarchyFilteringPath, HierarchyNode } from "@itwin/presentation-hierarchies";
 import type { Id64String } from "@itwin/core-bentley";
-import type { HierarchyNode } from "@itwin/presentation-hierarchies";
+import type { ClassGroupingNodeKey, InstancesNodeKey } from "@itwin/presentation-hierarchies";
 import type { ECClassHierarchyInspector } from "@itwin/presentation-shared";
+/** @internal */
 export interface FilteredTree {
-    getVisibilityChangeTargets(node: HierarchyNode): VisibilityChangeTargets;
+    getVisibilityChangeTargets(node: HierarchyNode & {
+        key: ClassGroupingNodeKey | InstancesNodeKey;
+    }): VisibilityChangeTargets;
 }
 export declare const SUBJECT_CLASS_NAME: "BisCore.Subject";
 export declare const MODEL_CLASS_NAME: "BisCore.GeometricModel3d";
 export declare const CATEGORY_CLASS_NAME: "BisCore.SpatialCategory";
 export declare const ELEMENT_CLASS_NAME: "BisCore.GeometricElement3d";
 type CategoryKey = `${Id64String}-${Id64String}`;
+/** @internal */
 export declare function parseCategoryKey(key: CategoryKey): {
     modelId: string;
     categoryId: string;
 };
-interface VisibilityChangeTargets {
+/** @internal */
+export interface VisibilityChangeTargets {
     subjects?: Set<Id64String>;
     models?: Set<Id64String>;
     categories?: Set<CategoryKey>;
-    elements?: Map<CategoryKey, Set<Id64String>>;
+    elements?: Map<CategoryKey, Map<Id64String, {
+        isFilterTarget: boolean;
+    }>>;
 }
+/** @internal */
 export declare function createFilteredTree(imodelAccess: ECClassHierarchyInspector, filteringPaths: HierarchyFilteringPath[]): Promise<FilteredTree>;
 export {};
 //# sourceMappingURL=FilteredTree.d.ts.map

package/lib/cjs/tree-widget-react/components/trees/models-tree/internal/FilteredTree.js

@@ -16,10 +16,12 @@ exports.ELEMENT_CLASS_NAME = "BisCore.GeometricElement3d";
 function createCategoryKey(modelId, categoryId) {
     return `${modelId}-${categoryId}`;
 }
+/** @internal */
 function parseCategoryKey(key) {
     const [modelId, categoryId] = key.split("-");
     return { modelId, categoryId };
 }
+/** @internal */
 async function createFilteredTree(imodelAccess, filteringPaths) {
     const root = {
         children: new Map(),
@@ -58,10 +60,6 @@ async function createFilteredTree(imodelAccess, filteringPaths) {
 function getVisibilityChangeTargets(root, node) {
     let lookupParents = [root];
     const changeTargets = {};
-    const nodeKey = node.key;
-    if (!presentation_hierarchies_1.HierarchyNodeKey.isInstances(nodeKey)) {
-        return changeTargets;
-    }
     // find the filtered parent nodes of the `node`
     for (const parentKey of node.parentKeys) {
         if (!presentation_hierarchies_1.HierarchyNodeKey.isInstances(parentKey)) {
@@ -69,24 +67,32 @@ function getVisibilityChangeTargets(root, node) {
         }
         // tree node might be merged from multiple instances. As filtered tree stores only one instance per node, we need to find all matching nodes
         // and use them when checking for matching node in one level deeper.
-        const parentNodes = findMatchingFilteredNodes(lookupParents, parentKey.instanceKeys);
+        const parentNodes = findMatchingFilteredNodes(lookupParents, parentKey.instanceKeys.map((key) => key.id));
         if (parentNodes.length === 0) {
             return changeTargets;
         }
         lookupParents = parentNodes;
     }
+    const ids = presentation_hierarchies_1.HierarchyNode.isInstancesNode(node) ? node.key.instanceKeys.map(({ id }) => id) : node.groupedInstanceKeys.map(({ id }) => id);
     // find filtered nodes that match the `node`
-    const filteredNodes = findMatchingFilteredNodes(lookupParents, nodeKey.instanceKeys);
+    const filteredNodes = findMatchingFilteredNodes(lookupParents, ids);
     if (filteredNodes.length === 0) {
         return changeTargets;
     }
     filteredNodes.forEach((filteredNode) => collectVisibilityChangeTargets(changeTargets, filteredNode));
     return changeTargets;
 }
-function findMatchingFilteredNodes(lookupParents, keys) {
-    return lookupParents
-        .flatMap((lookup) => keys.map((key) => lookup.children?.get(key.id)))
-        .filter((lookupNode) => lookupNode !== undefined);
+function findMatchingFilteredNodes(lookupParents, ids) {
+    return lookupParents.flatMap((lookup) => {
+        const childrenArray = Array();
+        for (const id of core_bentley_1.Id64.iterable(ids)) {
+            const node = lookup.children?.get(id);
+            if (node) {
+                childrenArray.push(node);
+            }
+        }
+        return childrenArray;
+    });
 }
 function collectVisibilityChangeTargets(changeTargets, node) {
     if (node.isFilterTarget) {
@@ -119,11 +125,11 @@ function addTarget(filterTargets, node) {
             const categoryKey = createCategoryKey(node.modelId, node.categoryId);
             const elements = (filterTargets.elements ??= new Map()).get(categoryKey);
             if (elements) {
-                elements.add(node.id);
-                return;
+                elements.set(node.id, { isFilterTarget: node.isFilterTarget });
+            }
+            else {
+                filterTargets.elements.set(categoryKey, new Map([[node.id, { isFilterTarget: node.isFilterTarget }]]));
             }
-            filterTargets.elements.set(categoryKey, new Set([node.id]));
-            return;
     }
 }
 function createFilteredTreeNode({ type, id, isFilterTarget, parent, }) {

package/lib/cjs/tree-widget-react/components/trees/models-tree/internal/FilteredTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"FilteredTree.js","sourceRoot":"","sources":["../../../../../../../src/tree-widget-react/components/trees/models-tree/internal/FilteredTree.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAmDhG,4CAGC;AASD,gDAwCC;AArGD,sDAA6C;AAC7C,8EAAoH;AAqCvG,QAAA,kBAAkB,GAAG,iBAA0B,CAAC;AAChD,QAAA,gBAAgB,GAAG,0BAAmC,CAAC;AACvD,QAAA,mBAAmB,GAAG,yBAAkC,CAAC;AACzD,QAAA,kBAAkB,GAAG,4BAAqC,CAAC;AAIxE,SAAS,iBAAiB,CAAC,OAAe,EAAE,UAAkB;IAC5D,OAAO,GAAG,OAAO,IAAI,UAAU,EAAE,CAAC;AACpC,CAAC;AAED,SAAgB,gBAAgB,CAAC,GAAgB;IAC/C,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AACjC,CAAC;AASM,KAAK,UAAU,kBAAkB,CAAC,YAAuC,EAAE,cAAwC;IACxH,MAAM,IAAI,GAAyB;QACjC,QAAQ,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC;IAEF,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;QAC3C,MAAM,cAAc,GAAG,iDAAsB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC;QAE5E,IAAI,UAAU,GAA4C,IAAI,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,MAAM,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;gBACtD,MAAM;YACR,CAAC;YAED,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,kDAAuB,CAAC,wBAAwB,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClE,MAAM;YACR,CAAC;YAED,MAAM,WAAW,GAAiC,UAAU,CAAC,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC1F,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,UAAU,GAAG,WAAW,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,YAAY,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAqB,sBAAsB,CAAC;gBACvD,IAAI;gBACJ,EAAE,EAAE,UAAU,CAAC,EAAE;gBACjB,cAAc,EAAE,CAAC,KAAK,cAAc,CAAC,MAAM,GAAG,CAAC;gBAC/C,MAAM,EAAE,UAA8B;aACvC,CAAC,CAAC;YACH,CAAC,UAAU,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YAChE,UAAU,GAAG,OAAO,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO;QACL,0BAA0B,EAAE,CAAC,IAAmB,EAAE,EAAE,CAAC,0BAA0B,CAAC,IAAI,EAAE,IAAI,CAAC;KAC5F,CAAC;AACJ,CAAC;AAED,SAAS,0BAA0B,CAAC,IAA0B,EAAE,IAAmB;IACjF,IAAI,aAAa,GAA4D,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,aAAa,GAA4B,EAAE,CAAC;IAElD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC;IACzB,IAAI,CAAC,2CAAgB,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3C,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,+CAA+C;IAC/C,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACxC,IAAI,CAAC,2CAAgB,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7C,SAAS;QACX,CAAC;QAED,4IAA4I;QAC5I,oEAAoE;QACpE,MAAM,WAAW,GAAG,yBAAyB,CAAC,aAAa,EAAE,SAAS,CAAC,YAAY,CAAC,CAAC;QACrF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,aAAa,CAAC;QACvB,CAAC;QACD,aAAa,GAAG,WAAW,CAAC;IAC9B,CAAC;IAED,4CAA4C;IAC5C,MAAM,aAAa,GAAG,yBAAyB,CAAC,aAAa,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;IACrF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,aAAa,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,8BAA8B,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;IACrG,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,SAAS,yBAAyB,CAAC,aAAsE,EAAE,IAAmB;IAC5H,OAAO,aAAa;SACjB,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;SACpE,MAAM,CAAC,CAAC,UAAU,EAAkC,EAAE,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC;AACtF,CAAC;AAED,SAAS,8BAA8B,CAAC,aAAsC,EAAE,IAAsB;IACpG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAC/B,OAAO;IACT,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5B,6DAA6D;QAC7D,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO;IACT,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,8BAA8B,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,aAAsC,EAAE,IAAsB;IAC/E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,SAAS;YACZ,CAAC,aAAa,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpD,OAAO;QACT,KAAK,OAAO;YACV,CAAC,aAAa,CAAC,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClD,OAAO;QACT,KAAK,UAAU;YACb,CAAC,aAAa,CAAC,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACvF,OAAO;QACT,KAAK,SAAS;YACZ,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACrE,MAAM,QAAQ,GAAG,CAAC,aAAa,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACzE,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtB,OAAO;YACT,CAAC;YACD,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5D,OAAO;IACX,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,EAC9B,IAAI,EACJ,EAAE,EACF,cAAc,EACd,MAAM,GAMP;IACC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QAC3C,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;SACL,CAAC;IACJ,CAAC;IAED,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACxB,IAAA,qBAAM,EAAC,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QACpD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,EAAE;SACnB,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACnD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,EAAE;SACtB,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAClD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,UAAU;SAC9B,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;AAC9C,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,gBAA2C,EAAE,SAAiB;IACnF,IAAI,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,SAAS,EAAE,0BAAkB,CAAC,EAAE,CAAC;QAC3E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,SAAS,EAAE,wBAAgB,CAAC,EAAE,CAAC;QACzE,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,SAAS,EAAE,2BAAmB,CAAC,EAAE,CAAC;QAC5E,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,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 { assert } from \"@itwin/core-bentley\";\nimport { HierarchyFilteringPath, HierarchyNodeIdentifier, HierarchyNodeKey } from \"@itwin/presentation-hierarchies\";\n\nimport type { Id64String } from \"@itwin/core-bentley\";\nimport type { HierarchyNode } from \"@itwin/presentation-hierarchies\";\nimport type { ECClassHierarchyInspector, InstanceKey } from \"@itwin/presentation-shared\";\n\ninterface FilteredTreeRootNode {\n  children: Map<Id64String, FilteredTreeNode>;\n}\n\ninterface BaseFilteredTreeNode {\n  id: string;\n  children?: Map<Id64String, FilteredTreeNode>;\n  isFilterTarget: boolean;\n}\n\ninterface GenericFilteredTreeNode extends BaseFilteredTreeNode {\n  type: \"subject\" | \"model\";\n}\n\ninterface CategoryFilteredTreeNode extends BaseFilteredTreeNode {\n  type: \"category\";\n  modelId: Id64String;\n}\n\ninterface ElementFilteredTreeNode extends BaseFilteredTreeNode {\n  type: \"element\";\n  modelId: Id64String;\n  categoryId: Id64String;\n}\n\ntype FilteredTreeNode = GenericFilteredTreeNode | CategoryFilteredTreeNode | ElementFilteredTreeNode;\n\nexport interface FilteredTree {\n  getVisibilityChangeTargets(node: HierarchyNode): VisibilityChangeTargets;\n}\n\nexport const SUBJECT_CLASS_NAME = \"BisCore.Subject\" as const;\nexport const MODEL_CLASS_NAME = \"BisCore.GeometricModel3d\" as const;\nexport const CATEGORY_CLASS_NAME = \"BisCore.SpatialCategory\" as const;\nexport const ELEMENT_CLASS_NAME = \"BisCore.GeometricElement3d\" as const;\n\ntype CategoryKey = `${Id64String}-${Id64String}`;\n\nfunction createCategoryKey(modelId: string, categoryId: string): CategoryKey {\n  return `${modelId}-${categoryId}`;\n}\n\nexport function parseCategoryKey(key: CategoryKey) {\n  const [modelId, categoryId] = key.split(\"-\");\n  return { modelId, categoryId };\n}\n\ninterface VisibilityChangeTargets {\n  subjects?: Set<Id64String>;\n  models?: Set<Id64String>;\n  categories?: Set<CategoryKey>;\n  elements?: Map<CategoryKey, Set<Id64String>>;\n}\n\nexport async function createFilteredTree(imodelAccess: ECClassHierarchyInspector, filteringPaths: HierarchyFilteringPath[]): Promise<FilteredTree> {\n  const root: FilteredTreeRootNode = {\n    children: new Map(),\n  };\n\n  for (const filteringPath of filteringPaths) {\n    const normalizedPath = HierarchyFilteringPath.normalize(filteringPath).path;\n\n    let parentNode: FilteredTreeRootNode | FilteredTreeNode = root;\n    for (let i = 0; i < normalizedPath.length; i++) {\n      if (\"type\" in parentNode && parentNode.isFilterTarget) {\n        break;\n      }\n\n      const identifier = normalizedPath[i];\n      if (!HierarchyNodeIdentifier.isInstanceNodeIdentifier(identifier)) {\n        break;\n      }\n\n      const currentNode: FilteredTreeNode | undefined = parentNode.children?.get(identifier.id);\n      if (currentNode !== undefined) {\n        parentNode = currentNode;\n        continue;\n      }\n\n      const type = await getType(imodelAccess, identifier.className);\n      const newNode: FilteredTreeNode = createFilteredTreeNode({\n        type,\n        id: identifier.id,\n        isFilterTarget: i === normalizedPath.length - 1,\n        parent: parentNode as FilteredTreeNode,\n      });\n      (parentNode.children ??= new Map()).set(identifier.id, newNode);\n      parentNode = newNode;\n    }\n  }\n\n  return {\n    getVisibilityChangeTargets: (node: HierarchyNode) => getVisibilityChangeTargets(root, node),\n  };\n}\n\nfunction getVisibilityChangeTargets(root: FilteredTreeRootNode, node: HierarchyNode) {\n  let lookupParents: Array<{ children?: Map<Id64String, FilteredTreeNode> }> = [root];\n  const changeTargets: VisibilityChangeTargets = {};\n\n  const nodeKey = node.key;\n  if (!HierarchyNodeKey.isInstances(nodeKey)) {\n    return changeTargets;\n  }\n\n  // find the filtered parent nodes of the `node`\n  for (const parentKey of node.parentKeys) {\n    if (!HierarchyNodeKey.isInstances(parentKey)) {\n      continue;\n    }\n\n    // tree node might be merged from multiple instances. As filtered tree stores only one instance per node, we need to find all matching nodes\n    // and use them when checking for matching node in one level deeper.\n    const parentNodes = findMatchingFilteredNodes(lookupParents, parentKey.instanceKeys);\n    if (parentNodes.length === 0) {\n      return changeTargets;\n    }\n    lookupParents = parentNodes;\n  }\n\n  // find filtered nodes that match the `node`\n  const filteredNodes = findMatchingFilteredNodes(lookupParents, nodeKey.instanceKeys);\n  if (filteredNodes.length === 0) {\n    return changeTargets;\n  }\n\n  filteredNodes.forEach((filteredNode) => collectVisibilityChangeTargets(changeTargets, filteredNode));\n  return changeTargets;\n}\n\nfunction findMatchingFilteredNodes(lookupParents: Array<{ children?: Map<Id64String, FilteredTreeNode> }>, keys: InstanceKey[]) {\n  return lookupParents\n    .flatMap((lookup) => keys.map((key) => lookup.children?.get(key.id)))\n    .filter((lookupNode): lookupNode is FilteredTreeNode => lookupNode !== undefined);\n}\n\nfunction collectVisibilityChangeTargets(changeTargets: VisibilityChangeTargets, node: FilteredTreeNode) {\n  if (node.isFilterTarget) {\n    addTarget(changeTargets, node);\n    return;\n  }\n\n  if (node.type === \"element\") {\n    // need to add parent ids as filter target will be an element\n    addTarget(changeTargets, node);\n  }\n\n  if (!node.children) {\n    return;\n  }\n\n  for (const child of node.children.values()) {\n    collectVisibilityChangeTargets(changeTargets, child);\n  }\n}\n\nfunction addTarget(filterTargets: VisibilityChangeTargets, node: FilteredTreeNode) {\n  switch (node.type) {\n    case \"subject\":\n      (filterTargets.subjects ??= new Set()).add(node.id);\n      return;\n    case \"model\":\n      (filterTargets.models ??= new Set()).add(node.id);\n      return;\n    case \"category\":\n      (filterTargets.categories ??= new Set()).add(createCategoryKey(node.modelId, node.id));\n      return;\n    case \"element\":\n      const categoryKey = createCategoryKey(node.modelId, node.categoryId);\n      const elements = (filterTargets.elements ??= new Map()).get(categoryKey);\n      if (elements) {\n        elements.add(node.id);\n        return;\n      }\n      filterTargets.elements.set(categoryKey, new Set([node.id]));\n      return;\n  }\n}\n\nfunction createFilteredTreeNode({\n  type,\n  id,\n  isFilterTarget,\n  parent,\n}: {\n  type: FilteredTreeNode[\"type\"];\n  id: string;\n  isFilterTarget: boolean;\n  parent: FilteredTreeNode | FilteredTreeRootNode;\n}): FilteredTreeNode {\n  if (type === \"subject\" || type === \"model\") {\n    return {\n      id,\n      isFilterTarget,\n      type,\n    };\n  }\n\n  if (type === \"category\") {\n    assert(\"type\" in parent && parent.type === \"model\");\n    return {\n      id,\n      isFilterTarget,\n      type,\n      modelId: parent.id,\n    };\n  }\n\n  if (\"type\" in parent && parent.type === \"category\") {\n    return {\n      id,\n      isFilterTarget,\n      type,\n      modelId: parent.modelId,\n      categoryId: parent.id,\n    };\n  }\n\n  if (\"type\" in parent && parent.type === \"element\") {\n    return {\n      id,\n      isFilterTarget,\n      type,\n      modelId: parent.modelId,\n      categoryId: parent.categoryId,\n    };\n  }\n\n  throw new Error(\"Invalid parent node type\");\n}\n\nasync function getType(hierarchyChecker: ECClassHierarchyInspector, className: string) {\n  if (await hierarchyChecker.classDerivesFrom(className, SUBJECT_CLASS_NAME)) {\n    return \"subject\";\n  }\n  if (await hierarchyChecker.classDerivesFrom(className, MODEL_CLASS_NAME)) {\n    return \"model\";\n  }\n  if (await hierarchyChecker.classDerivesFrom(className, CATEGORY_CLASS_NAME)) {\n    return \"category\";\n  }\n  return \"element\";\n}\n"]}
+{"version":3,"file":"FilteredTree.js","sourceRoot":"","sources":["../../../../../../../src/tree-widget-react/components/trees/models-tree/internal/FilteredTree.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAqDhG,4CAGC;AAWD,gDAwCC;AAzGD,sDAAmD;AACnD,8EAAmI;AAsCtH,QAAA,kBAAkB,GAAG,iBAA0B,CAAC;AAChD,QAAA,gBAAgB,GAAG,0BAAmC,CAAC;AACvD,QAAA,mBAAmB,GAAG,yBAAkC,CAAC;AACzD,QAAA,kBAAkB,GAAG,4BAAqC,CAAC;AAIxE,SAAS,iBAAiB,CAAC,OAAe,EAAE,UAAkB;IAC5D,OAAO,GAAG,OAAO,IAAI,UAAU,EAAE,CAAC;AACpC,CAAC;AAED,gBAAgB;AAChB,SAAgB,gBAAgB,CAAC,GAAgB;IAC/C,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AACjC,CAAC;AAUD,gBAAgB;AACT,KAAK,UAAU,kBAAkB,CAAC,YAAuC,EAAE,cAAwC;IACxH,MAAM,IAAI,GAAyB;QACjC,QAAQ,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC;IAEF,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;QAC3C,MAAM,cAAc,GAAG,iDAAsB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC;QAE5E,IAAI,UAAU,GAA4C,IAAI,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,MAAM,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;gBACtD,MAAM;YACR,CAAC;YAED,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,kDAAuB,CAAC,wBAAwB,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClE,MAAM;YACR,CAAC;YAED,MAAM,WAAW,GAAiC,UAAU,CAAC,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC1F,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,UAAU,GAAG,WAAW,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,YAAY,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAqB,sBAAsB,CAAC;gBACvD,IAAI;gBACJ,EAAE,EAAE,UAAU,CAAC,EAAE;gBACjB,cAAc,EAAE,CAAC,KAAK,cAAc,CAAC,MAAM,GAAG,CAAC;gBAC/C,MAAM,EAAE,UAA8B;aACvC,CAAC,CAAC;YACH,CAAC,UAAU,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YAChE,UAAU,GAAG,OAAO,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO;QACL,0BAA0B,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC,IAAI,EAAE,IAAI,CAAC;KAC7E,CAAC;AACJ,CAAC;AAED,SAAS,0BAA0B,CAAC,IAA0B,EAAE,IAAsE;IACpI,IAAI,aAAa,GAAmD,CAAC,IAAI,CAAC,CAAC;IAC3E,MAAM,aAAa,GAA4B,EAAE,CAAC;IAElD,+CAA+C;IAC/C,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACxC,IAAI,CAAC,2CAAgB,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7C,SAAS;QACX,CAAC;QAED,4IAA4I;QAC5I,oEAAoE;QACpE,MAAM,WAAW,GAAG,yBAAyB,CAC3C,aAAa,EACb,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAC5C,CAAC;QACF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,aAAa,CAAC;QACvB,CAAC;QACD,aAAa,GAAG,WAAW,CAAC;IAC9B,CAAC;IACD,MAAM,GAAG,GAAG,wCAAa,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC3I,4CAA4C;IAC5C,MAAM,aAAa,GAAG,yBAAyB,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;IACpE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,aAAa,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,8BAA8B,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;IACrG,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,SAAS,yBAAyB,CAAC,aAA6D,EAAE,GAAY;IAC5G,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QACtC,MAAM,aAAa,GAAG,KAAK,EAAoB,CAAC;QAChD,KAAK,MAAM,EAAE,IAAI,mBAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,IAAI,EAAE,CAAC;gBACT,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,8BAA8B,CAAC,aAAsC,EAAE,IAAsB;IACpG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAC/B,OAAO;IACT,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5B,6DAA6D;QAC7D,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO;IACT,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,8BAA8B,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,aAAsC,EAAE,IAAsB;IAC/E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,SAAS;YACZ,CAAC,aAAa,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpD,OAAO;QACT,KAAK,OAAO;YACV,CAAC,aAAa,CAAC,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClD,OAAO;QACT,KAAK,UAAU;YACb,CAAC,aAAa,CAAC,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACvF,OAAO;QACT,KAAK,SAAS;YACZ,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACrE,MAAM,QAAQ,GAAG,CAAC,aAAa,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACzE,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;YACjE,CAAC;iBAAM,CAAC;gBACN,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACzG,CAAC;IACL,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,EAC9B,IAAI,EACJ,EAAE,EACF,cAAc,EACd,MAAM,GAMP;IACC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QAC3C,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;SACL,CAAC;IACJ,CAAC;IAED,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACxB,IAAA,qBAAM,EAAC,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QACpD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,EAAE;SACnB,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACnD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,EAAE;SACtB,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAClD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,UAAU;SAC9B,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;AAC9C,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,gBAA2C,EAAE,SAAiB;IACnF,IAAI,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,SAAS,EAAE,0BAAkB,CAAC,EAAE,CAAC;QAC3E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,SAAS,EAAE,wBAAgB,CAAC,EAAE,CAAC;QACzE,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,SAAS,EAAE,2BAAmB,CAAC,EAAE,CAAC;QAC5E,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,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 { assert, Id64 } from \"@itwin/core-bentley\";\nimport { HierarchyFilteringPath, HierarchyNode, HierarchyNodeIdentifier, HierarchyNodeKey } from \"@itwin/presentation-hierarchies\";\n\nimport type { Id64Arg, Id64String } from \"@itwin/core-bentley\";\nimport type { ClassGroupingNodeKey, InstancesNodeKey } from \"@itwin/presentation-hierarchies\";\nimport type { ECClassHierarchyInspector } from \"@itwin/presentation-shared\";\n\ninterface FilteredTreeRootNode {\n  children: Map<Id64String, FilteredTreeNode>;\n}\n\ninterface BaseFilteredTreeNode {\n  id: string;\n  children?: Map<Id64String, FilteredTreeNode>;\n  isFilterTarget: boolean;\n}\n\ninterface GenericFilteredTreeNode extends BaseFilteredTreeNode {\n  type: \"subject\" | \"model\";\n}\n\ninterface CategoryFilteredTreeNode extends BaseFilteredTreeNode {\n  type: \"category\";\n  modelId: Id64String;\n}\n\ninterface ElementFilteredTreeNode extends BaseFilteredTreeNode {\n  type: \"element\";\n  modelId: Id64String;\n  categoryId: Id64String;\n}\n\ntype FilteredTreeNode = GenericFilteredTreeNode | CategoryFilteredTreeNode | ElementFilteredTreeNode;\n\n/** @internal */\nexport interface FilteredTree {\n  getVisibilityChangeTargets(node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey }): VisibilityChangeTargets;\n}\n\nexport const SUBJECT_CLASS_NAME = \"BisCore.Subject\" as const;\nexport const MODEL_CLASS_NAME = \"BisCore.GeometricModel3d\" as const;\nexport const CATEGORY_CLASS_NAME = \"BisCore.SpatialCategory\" as const;\nexport const ELEMENT_CLASS_NAME = \"BisCore.GeometricElement3d\" as const;\n\ntype CategoryKey = `${Id64String}-${Id64String}`;\n\nfunction createCategoryKey(modelId: string, categoryId: string): CategoryKey {\n  return `${modelId}-${categoryId}`;\n}\n\n/** @internal */\nexport function parseCategoryKey(key: CategoryKey) {\n  const [modelId, categoryId] = key.split(\"-\");\n  return { modelId, categoryId };\n}\n\n/** @internal */\nexport interface VisibilityChangeTargets {\n  subjects?: Set<Id64String>;\n  models?: Set<Id64String>;\n  categories?: Set<CategoryKey>;\n  elements?: Map<CategoryKey, Map<Id64String, { isFilterTarget: boolean }>>;\n}\n\n/** @internal */\nexport async function createFilteredTree(imodelAccess: ECClassHierarchyInspector, filteringPaths: HierarchyFilteringPath[]): Promise<FilteredTree> {\n  const root: FilteredTreeRootNode = {\n    children: new Map(),\n  };\n\n  for (const filteringPath of filteringPaths) {\n    const normalizedPath = HierarchyFilteringPath.normalize(filteringPath).path;\n\n    let parentNode: FilteredTreeRootNode | FilteredTreeNode = root;\n    for (let i = 0; i < normalizedPath.length; i++) {\n      if (\"type\" in parentNode && parentNode.isFilterTarget) {\n        break;\n      }\n\n      const identifier = normalizedPath[i];\n      if (!HierarchyNodeIdentifier.isInstanceNodeIdentifier(identifier)) {\n        break;\n      }\n\n      const currentNode: FilteredTreeNode | undefined = parentNode.children?.get(identifier.id);\n      if (currentNode !== undefined) {\n        parentNode = currentNode;\n        continue;\n      }\n\n      const type = await getType(imodelAccess, identifier.className);\n      const newNode: FilteredTreeNode = createFilteredTreeNode({\n        type,\n        id: identifier.id,\n        isFilterTarget: i === normalizedPath.length - 1,\n        parent: parentNode as FilteredTreeNode,\n      });\n      (parentNode.children ??= new Map()).set(identifier.id, newNode);\n      parentNode = newNode;\n    }\n  }\n\n  return {\n    getVisibilityChangeTargets: (node) => getVisibilityChangeTargets(root, node),\n  };\n}\n\nfunction getVisibilityChangeTargets(root: FilteredTreeRootNode, node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey }) {\n  let lookupParents: Array<FilteredTreeRootNode | FilteredTreeNode> = [root];\n  const changeTargets: VisibilityChangeTargets = {};\n\n  // find the filtered parent nodes of the `node`\n  for (const parentKey of node.parentKeys) {\n    if (!HierarchyNodeKey.isInstances(parentKey)) {\n      continue;\n    }\n\n    // tree node might be merged from multiple instances. As filtered tree stores only one instance per node, we need to find all matching nodes\n    // and use them when checking for matching node in one level deeper.\n    const parentNodes = findMatchingFilteredNodes(\n      lookupParents,\n      parentKey.instanceKeys.map((key) => key.id),\n    );\n    if (parentNodes.length === 0) {\n      return changeTargets;\n    }\n    lookupParents = parentNodes;\n  }\n  const ids = HierarchyNode.isInstancesNode(node) ? node.key.instanceKeys.map(({ id }) => id) : node.groupedInstanceKeys.map(({ id }) => id);\n  // find filtered nodes that match the `node`\n  const filteredNodes = findMatchingFilteredNodes(lookupParents, ids);\n  if (filteredNodes.length === 0) {\n    return changeTargets;\n  }\n\n  filteredNodes.forEach((filteredNode) => collectVisibilityChangeTargets(changeTargets, filteredNode));\n  return changeTargets;\n}\n\nfunction findMatchingFilteredNodes(lookupParents: Array<FilteredTreeRootNode | FilteredTreeNode>, ids: Id64Arg): Array<FilteredTreeNode> {\n  return lookupParents.flatMap((lookup) => {\n    const childrenArray = Array<FilteredTreeNode>();\n    for (const id of Id64.iterable(ids)) {\n      const node = lookup.children?.get(id);\n      if (node) {\n        childrenArray.push(node);\n      }\n    }\n    return childrenArray;\n  });\n}\n\nfunction collectVisibilityChangeTargets(changeTargets: VisibilityChangeTargets, node: FilteredTreeNode) {\n  if (node.isFilterTarget) {\n    addTarget(changeTargets, node);\n    return;\n  }\n\n  if (node.type === \"element\") {\n    // need to add parent ids as filter target will be an element\n    addTarget(changeTargets, node);\n  }\n\n  if (!node.children) {\n    return;\n  }\n\n  for (const child of node.children.values()) {\n    collectVisibilityChangeTargets(changeTargets, child);\n  }\n}\n\nfunction addTarget(filterTargets: VisibilityChangeTargets, node: FilteredTreeNode) {\n  switch (node.type) {\n    case \"subject\":\n      (filterTargets.subjects ??= new Set()).add(node.id);\n      return;\n    case \"model\":\n      (filterTargets.models ??= new Set()).add(node.id);\n      return;\n    case \"category\":\n      (filterTargets.categories ??= new Set()).add(createCategoryKey(node.modelId, node.id));\n      return;\n    case \"element\":\n      const categoryKey = createCategoryKey(node.modelId, node.categoryId);\n      const elements = (filterTargets.elements ??= new Map()).get(categoryKey);\n      if (elements) {\n        elements.set(node.id, { isFilterTarget: node.isFilterTarget });\n      } else {\n        filterTargets.elements.set(categoryKey, new Map([[node.id, { isFilterTarget: node.isFilterTarget }]]));\n      }\n  }\n}\n\nfunction createFilteredTreeNode({\n  type,\n  id,\n  isFilterTarget,\n  parent,\n}: {\n  type: FilteredTreeNode[\"type\"];\n  id: string;\n  isFilterTarget: boolean;\n  parent: FilteredTreeNode | FilteredTreeRootNode;\n}): FilteredTreeNode {\n  if (type === \"subject\" || type === \"model\") {\n    return {\n      id,\n      isFilterTarget,\n      type,\n    };\n  }\n\n  if (type === \"category\") {\n    assert(\"type\" in parent && parent.type === \"model\");\n    return {\n      id,\n      isFilterTarget,\n      type,\n      modelId: parent.id,\n    };\n  }\n\n  if (\"type\" in parent && parent.type === \"category\") {\n    return {\n      id,\n      isFilterTarget,\n      type,\n      modelId: parent.modelId,\n      categoryId: parent.id,\n    };\n  }\n\n  if (\"type\" in parent && parent.type === \"element\") {\n    return {\n      id,\n      isFilterTarget,\n      type,\n      modelId: parent.modelId,\n      categoryId: parent.categoryId,\n    };\n  }\n\n  throw new Error(\"Invalid parent node type\");\n}\n\nasync function getType(hierarchyChecker: ECClassHierarchyInspector, className: string) {\n  if (await hierarchyChecker.classDerivesFrom(className, SUBJECT_CLASS_NAME)) {\n    return \"subject\";\n  }\n  if (await hierarchyChecker.classDerivesFrom(className, MODEL_CLASS_NAME)) {\n    return \"model\";\n  }\n  if (await hierarchyChecker.classDerivesFrom(className, CATEGORY_CLASS_NAME)) {\n    return \"category\";\n  }\n  return \"element\";\n}\n"]}