@itwin/tree-widget-react 3.0.0-dev.0 → 3.0.0-dev.2

package/lib/cjs/components/trees/{stateless/common → common}/UseHierarchyFiltering.js

@@ -8,25 +8,24 @@ const jsx_runtime_1 = require("react/jsx-runtime");
  *--------------------------------------------------------------------------------------------*/
 const react_1 = require("react");
 const components_react_1 = require("@itwin/components-react");
+const core_bentley_1 = require("@itwin/core-bentley");
+const itwinui_react_1 = require("@itwin/itwinui-react");
 const presentation_common_1 = require("@itwin/presentation-common");
 const presentation_components_1 = require("@itwin/presentation-components");
 const presentation_frontend_1 = require("@itwin/presentation-frontend");
 const presentation_hierarchies_1 = require("@itwin/presentation-hierarchies");
-const TreeWidget_1 = require("../../../../TreeWidget");
+const TreeWidget_1 = require("../../../TreeWidget");
+const Delayed_1 = require("./components/Delayed");
 /** @internal */
-function useHierarchyLevelFiltering({ imodel, defaultHierarchyLevelSizeLimit, getHierarchyLevelDetails }) {
+function useHierarchyLevelFiltering({ imodel, defaultHierarchyLevelSizeLimit, reportUsage }) {
     const [filteringOptions, setFilteringOptions] = (0, react_1.useState)();
-    const onFilterClick = (0, react_1.useCallback)((nodeId) => {
-        const hierarchyDetails = getHierarchyLevelDetails(nodeId);
-        setFilteringOptions(hierarchyDetails ? { nodeId, hierarchyDetails } : undefined);
-    }, [getHierarchyLevelDetails]);
     const propertiesSource = (0, react_1.useMemo)(() => {
         if (!filteringOptions) {
             return undefined;
         }
         return async () => {
-            const inputKeys = await collectInstanceKeys(filteringOptions.hierarchyDetails.getInstanceKeysIterator());
-            if (inputKeys.length === 0) {
+            const keySet = await collectInstanceKeys(filteringOptions.getInstanceKeysIterator());
+            if (keySet.isEmpty) {
                 throw new Error("Hierarchy level is empty - unable to create content descriptor.");
             }
             const descriptor = await presentation_frontend_1.Presentation.presentation.getContentDescriptor({
@@ -45,16 +44,16 @@ function useHierarchyLevelFiltering({ imodel, defaultHierarchyLevelSizeLimit, ge
                     ],
                 },
                 displayType: presentation_common_1.DefaultContentDisplayTypes.PropertyPane,
-                keys: new presentation_common_1.KeySet(inputKeys),
+                keys: keySet,
             });
             if (!descriptor) {
                 throw new Error("Failed to create content descriptor");
             }
-            return { descriptor, inputKeys };
+            return { descriptor, inputKeys: keySet };
         };
     }, [filteringOptions, imodel]);
     const getInitialFilter = (0, react_1.useMemo)(() => {
-        const currentFilter = filteringOptions?.hierarchyDetails.instanceFilter;
+        const currentFilter = filteringOptions?.instanceFilter;
         if (!currentFilter) {
             return undefined;
         }
@@ -64,7 +63,8 @@ function useHierarchyLevelFiltering({ imodel, defaultHierarchyLevelSizeLimit, ge
             if (!filteringOptions) {
                 return;
             }
-            filteringOptions.hierarchyDetails.setInstanceFilter(toGenericFilter(info));
+            reportUsage?.({ featureId: info ? "hierarchy-level-filtering" : undefined, reportInteraction: true });
+            filteringOptions.setInstanceFilter(toGenericFilter(info));
             setFilteringOptions(undefined);
         }, onClose: () => {
             setFilteringOptions(undefined);
@@ -72,42 +72,60 @@ function useHierarchyLevelFiltering({ imodel, defaultHierarchyLevelSizeLimit, ge
             if (!filteringOptions) {
                 return null;
             }
-            return ((0, jsx_runtime_1.jsx)(MatchingInstancesCount, { filter: filter, hierarchyLevelDetails: filteringOptions.hierarchyDetails, defaultHierarchyLevelSizeLimit: defaultHierarchyLevelSizeLimit }));
+            return ((0, jsx_runtime_1.jsx)(MatchingInstancesCount, { filter: filter, hierarchyLevelDetails: filteringOptions, defaultHierarchyLevelSizeLimit: defaultHierarchyLevelSizeLimit }));
         } }));
     return {
-        onFilterClick,
+        onFilterClick: setFilteringOptions,
         filteringDialog,
     };
 }
 exports.useHierarchyLevelFiltering = useHierarchyLevelFiltering;
 function MatchingInstancesCount({ filter, defaultHierarchyLevelSizeLimit, hierarchyLevelDetails }) {
-    const { value } = (0, components_react_1.useDebouncedAsyncValue)((0, react_1.useCallback)(async () => {
+    const { value, inProgress } = (0, components_react_1.useDebouncedAsyncValue)((0, react_1.useCallback)(async () => {
         const instanceFilter = toGenericFilter(filter);
         try {
-            const instanceKeys = await collectInstanceKeys(hierarchyLevelDetails.getInstanceKeysIterator({
+            const instanceCount = await countInstanceKeys(hierarchyLevelDetails.getInstanceKeysIterator({
                 instanceFilter,
                 hierarchyLevelSizeLimit: hierarchyLevelDetails.sizeLimit ?? defaultHierarchyLevelSizeLimit,
             }));
-            return TreeWidget_1.TreeWidget.translate("stateless.matchingInstancesCount", { count: instanceKeys.length });
+            return TreeWidget_1.TreeWidget.translate("filteringDialog.matchingInstancesCount", {
+                instanceCount: instanceCount.toLocaleString(undefined, { useGrouping: true }),
+            });
         }
         catch (e) {
             if (e instanceof presentation_hierarchies_1.RowsLimitExceededError) {
-                return TreeWidget_1.TreeWidget.translate("stateless.filterExceedsLimit", { limit: e.limit });
+                return TreeWidget_1.TreeWidget.translate("filteringDialog.filterExceedsLimit", { limit: e.limit.toLocaleString(undefined, { useGrouping: true }) });
             }
-            return TreeWidget_1.TreeWidget.translate("stateless.failedToCalculateMatchingInstances");
+            return TreeWidget_1.TreeWidget.translate("filteringDialog.failedToCalculateMatchingInstancesCount");
         }
     }, [filter, hierarchyLevelDetails, defaultHierarchyLevelSizeLimit]));
-    if (!value) {
-        return null;
+    if (inProgress) {
+        return ((0, jsx_runtime_1.jsxs)(Delayed_1.Delayed, { show: true, children: [TreeWidget_1.TreeWidget.translate("filteringDialog.matchingInstancesCount", { instanceCount: "" }), (0, jsx_runtime_1.jsx)(itwinui_react_1.ProgressRadial, { size: "x-small" })] }));
+    }
+    return value ? (0, jsx_runtime_1.jsx)(jsx_runtime_1.Fragment, { children: value }) : null;
+}
+async function countInstanceKeys(iterator) {
+    let result = 0;
+    for await (const _ of iterator) {
+        result++;
     }
-    return (0, jsx_runtime_1.jsx)(jsx_runtime_1.Fragment, { children: value });
+    return result;
 }
 async function collectInstanceKeys(iterator) {
-    const inputKeys = [];
-    for await (const inputKey of iterator) {
-        inputKeys.push(inputKey);
+    const idsByClassName = new Map();
+    for await (const { className, id } of iterator) {
+        let idSet = idsByClassName.get(className);
+        if (!idSet) {
+            idSet = [];
+            idsByClassName.set(className, idSet);
+        }
+        idSet.push(id);
+    }
+    const instanceKeys = new Array();
+    for (const [className, ids] of idsByClassName) {
+        instanceKeys.push([className.toLowerCase(), core_bentley_1.CompressedId64Set.sortAndCompress(ids)]);
     }
-    return inputKeys;
+    return presentation_common_1.KeySet.fromJSON({ instanceKeys, nodeKeys: [] });
 }
 function fromGenericFilter(descriptor, filter) {
     const presentationFilter = presentation_hierarchies_1.GenericInstanceFilter.isFilterRuleGroup(filter.rules) && filter.rules.rules.length === 0

package/lib/cjs/components/trees/common/UseHierarchyFiltering.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UseHierarchyFiltering.js","sourceRoot":"","sources":["../../../../../src/components/trees/common/UseHierarchyFiltering.tsx"],"names":[],"mappings":";;;;AAAA;;;gGAGgG;AAEhG,iCAAuD;AACvD,8DAAiE;AACjE,sDAAwD;AACxD,wDAAsD;AACtD,oEAAgF;AAChF,4EAA8G;AAC9G,wEAA4D;AAC5D,8EAAgG;AAChG,oDAAiD;AACjD,kDAA+C;AAgB/C,gBAAgB;AAChB,SAAgB,0BAA0B,CAAC,EAAE,MAAM,EAAE,8BAA8B,EAAE,WAAW,EAAmC;IACjI,MAAM,CAAC,gBAAgB,EAAE,mBAAmB,CAAC,GAAG,IAAA,gBAAQ,GAAyB,CAAC;IAElF,MAAM,gBAAgB,GAAG,IAAA,eAAO,EAA0E,GAAG,EAAE;QAC7G,IAAI,CAAC,gBAAgB,EAAE;YACrB,OAAO,SAAS,CAAC;SAClB;QAED,OAAO,KAAK,IAAI,EAAE;YAChB,MAAM,MAAM,GAAG,MAAM,mBAAmB,CAAC,gBAAgB,CAAC,uBAAuB,EAAE,CAAC,CAAC;YACrF,IAAI,MAAM,CAAC,OAAO,EAAE;gBAClB,MAAM,IAAI,KAAK,CAAC,iEAAiE,CAAC,CAAC;aACpF;YAED,MAAM,UAAU,GAAG,MAAM,oCAAY,CAAC,YAAY,CAAC,oBAAoB,CAAC;gBACtE,MAAM;gBACN,WAAW,EAAE;oBACX,EAAE,EAAE,oCAAoC;oBACxC,KAAK,EAAE;wBACL;4BACE,QAAQ,EAAE,SAAS;4BACnB,cAAc,EAAE;gCACd;oCACE,QAAQ,EAAE,uBAAuB;iCAClC;6BACF;yBACF;qBACF;iBACF;gBACD,WAAW,EAAE,gDAA0B,CAAC,YAAY;gBACpD,IAAI,EAAE,MAAM;aACb,CAAC,CAAC;YACH,IAAI,CAAC,UAAU,EAAE;gBACf,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;aACxD;YAED,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QAC3C,CAAC,CAAC;IACJ,CAAC,EAAE,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAC,CAAC;IAE/B,MAAM,gBAAgB,GAAG,IAAA,eAAO,EAAC,GAAG,EAAE;QACpC,MAAM,aAAa,GAAG,gBAAgB,EAAE,cAAc,CAAC;QACvD,IAAI,CAAC,aAAa,EAAE;YAClB,OAAO,SAAS,CAAC;SAClB;QAED,OAAO,CAAC,UAAsB,EAAE,EAAE,CAAC,iBAAiB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;IAClF,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEvB,MAAM,eAAe,GAAG,CACtB,uBAAC,0DAAgC,IAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,CAAC,CAAC,gBAAgB,EAC1B,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE;YAChB,IAAI,CAAC,gBAAgB,EAAE;gBACrB,OAAO;aACR;YACD,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAAC,SAAS,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC;YACtG,gBAAgB,CAAC,iBAAiB,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1D,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC,EACD,OAAO,EAAE,GAAG,EAAE;YACZ,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC,EACD,gBAAgB,EAAE,gBAAgB,EAClC,aAAa,EAAE,gBAAgB,EAC/B,0BAA0B,EAAE,CAAC,MAAM,EAAE,EAAE;YACrC,IAAI,CAAC,gBAAgB,EAAE;gBACrB,OAAO,IAAI,CAAC;aACb;YAED,OAAO,CACL,uBAAC,sBAAsB,IAAC,MAAM,EAAE,MAAM,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,8BAA8B,EAAE,8BAA8B,GAAI,CACpJ,CAAC;QACJ,CAAC,GACD,CACH,CAAC;IAEF,OAAO;QACL,aAAa,EAAE,mBAAmB;QAClC,eAAe;KAChB,CAAC;AACJ,CAAC;AAlFD,gEAkFC;AAQD,SAAS,sBAAsB,CAAC,EAAE,MAAM,EAAE,8BAA8B,EAAE,qBAAqB,EAA+B;IAC5H,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAA,yCAAsB,EAClD,IAAA,mBAAW,EAAC,KAAK,IAAI,EAAE;QACrB,MAAM,cAAc,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI;YACF,MAAM,aAAa,GAAG,MAAM,iBAAiB,CAC3C,qBAAqB,CAAC,uBAAuB,CAAC;gBAC5C,cAAc;gBACd,uBAAuB,EAAE,qBAAqB,CAAC,SAAS,IAAI,8BAA8B;aAC3F,CAAC,CACH,CAAC;YACF,OAAO,uBAAU,CAAC,SAAS,CAAC,wCAAwC,EAAE;gBACpE,aAAa,EAAE,aAAa,CAAC,cAAc,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;aAC9E,CAAC,CAAC;SACJ;QAAC,OAAO,CAAC,EAAE;YACV,IAAI,CAAC,YAAY,iDAAsB,EAAE;gBACvC,OAAO,uBAAU,CAAC,SAAS,CAAC,oCAAoC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;aACxI;YACD,OAAO,uBAAU,CAAC,SAAS,CAAC,yDAAyD,CAAC,CAAC;SACxF;IACH,CAAC,EAAE,CAAC,MAAM,EAAE,qBAAqB,EAAE,8BAA8B,CAAC,CAAC,CACpE,CAAC;IAEF,IAAI,UAAU,EAAE;QACd,OAAO,CACL,wBAAC,iBAAO,IAAC,IAAI,EAAE,IAAI,aAChB,uBAAU,CAAC,SAAS,CAAC,wCAAwC,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,EACtF,uBAAC,8BAAc,IAAC,IAAI,EAAC,SAAS,GAAG,IACzB,CACX,CAAC;KACH;IAED,OAAO,KAAK,CAAC,CAAC,CAAC,2DAAG,KAAK,GAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACrC,CAAC;AAED,KAAK,UAAU,iBAAiB,CAAC,QAA4C;IAC3E,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE;QAC9B,MAAM,EAAE,CAAC;KACV;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,KAAK,UAAU,mBAAmB,CAAC,QAA4C;IAC7E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAyB,CAAC;IACxD,IAAI,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,QAAQ,EAAE;QAC9C,IAAI,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,EAAE;YACV,KAAK,GAAG,EAAE,CAAC;YACX,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;SACtC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KAChB;IAED,MAAM,YAAY,GAAG,IAAI,KAAK,EAAyD,CAAC;IACxF,KAAK,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,cAAc,EAAE;QAC7C,YAAY,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,gCAAiB,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACtF;IACD,OAAO,4BAAM,CAAC,QAAQ,CAAC,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,iBAAiB,CAAC,UAAsB,EAAE,MAA6B;IAC9E,MAAM,kBAAkB,GACtB,gDAAqB,CAAC,iBAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QACtF,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,oDAA0B,CAAC,yBAAyB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAC/E,OAAO;QACL,MAAM,EAAE,kBAAkB;QAC1B,WAAW,EAAE,CAAC,MAAM,CAAC,kBAAkB,IAAI,EAAE,CAAC;aAC3C,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,eAAe,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,eAAe,CAAC;aACzH,MAAM,CAAC,CAAC,SAAS,EAA0B,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC;KAC1E,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,UAA2C;IAClE,IAAI,CAAC,UAAU,EAAE;QACf,OAAO,SAAS,CAAC;KAClB;IAED,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE;QACtB,OAAO,UAAU,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YACtC,CAAC,CAAC;gBACE,kBAAkB,EAAE,EAAE;gBACtB,gBAAgB,EAAE,EAAE;gBACpB,kBAAkB,EAAE,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;gBACnE,KAAK,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE;aACtC;YACH,CAAC,CAAC,SAAS,CAAC;KACf;IAED,OAAO,oDAA0B,CAAC,uBAAuB,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,WAAW,CAAC,CAAC;AACvG,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useMemo, useState } from \"react\";\nimport { useDebouncedAsyncValue } from \"@itwin/components-react\";\nimport { CompressedId64Set } from \"@itwin/core-bentley\";\nimport { ProgressRadial } from \"@itwin/itwinui-react\";\nimport { DefaultContentDisplayTypes, KeySet } from \"@itwin/presentation-common\";\nimport { PresentationInstanceFilter, PresentationInstanceFilterDialog } from \"@itwin/presentation-components\";\nimport { Presentation } from \"@itwin/presentation-frontend\";\nimport { GenericInstanceFilter, RowsLimitExceededError } from \"@itwin/presentation-hierarchies\";\nimport { TreeWidget } from \"../../../TreeWidget\";\nimport { Delayed } from \"./components/Delayed\";\n\nimport type { Id64Array, Id64String } from \"@itwin/core-bentley\";\nimport type { IModelConnection } from \"@itwin/core-frontend\";\nimport type { ClassInfo, Descriptor } from \"@itwin/presentation-common\";\nimport type { PresentationInstanceFilterInfo, PresentationInstanceFilterPropertiesSource } from \"@itwin/presentation-components\";\nimport type { HierarchyLevelDetails } from \"@itwin/presentation-hierarchies-react\";\nimport type { InstanceKey } from \"@itwin/presentation-shared\";\nimport type { UsageTrackedFeatures } from \"./UseFeatureReporting\";\n\ninterface UseHierarchyLevelFilteringProps {\n  imodel: IModelConnection;\n  defaultHierarchyLevelSizeLimit: number;\n  reportUsage?: (props: { featureId?: UsageTrackedFeatures; reportInteraction: true }) => void;\n}\n\n/** @internal */\nexport function useHierarchyLevelFiltering({ imodel, defaultHierarchyLevelSizeLimit, reportUsage }: UseHierarchyLevelFilteringProps) {\n  const [filteringOptions, setFilteringOptions] = useState<HierarchyLevelDetails>();\n\n  const propertiesSource = useMemo<(() => Promise<PresentationInstanceFilterPropertiesSource>) | undefined>(() => {\n    if (!filteringOptions) {\n      return undefined;\n    }\n\n    return async () => {\n      const keySet = await collectInstanceKeys(filteringOptions.getInstanceKeysIterator());\n      if (keySet.isEmpty) {\n        throw new Error(\"Hierarchy level is empty - unable to create content descriptor.\");\n      }\n\n      const descriptor = await Presentation.presentation.getContentDescriptor({\n        imodel,\n        rulesetOrId: {\n          id: `Hierarchy level descriptor ruleset`,\n          rules: [\n            {\n              ruleType: \"Content\",\n              specifications: [\n                {\n                  specType: \"SelectedNodeInstances\",\n                },\n              ],\n            },\n          ],\n        },\n        displayType: DefaultContentDisplayTypes.PropertyPane,\n        keys: keySet,\n      });\n      if (!descriptor) {\n        throw new Error(\"Failed to create content descriptor\");\n      }\n\n      return { descriptor, inputKeys: keySet };\n    };\n  }, [filteringOptions, imodel]);\n\n  const getInitialFilter = useMemo(() => {\n    const currentFilter = filteringOptions?.instanceFilter;\n    if (!currentFilter) {\n      return undefined;\n    }\n\n    return (descriptor: Descriptor) => fromGenericFilter(descriptor, currentFilter);\n  }, [filteringOptions]);\n\n  const filteringDialog = (\n    <PresentationInstanceFilterDialog\n      imodel={imodel}\n      isOpen={!!filteringOptions}\n      onApply={(info) => {\n        if (!filteringOptions) {\n          return;\n        }\n        reportUsage?.({ featureId: info ? \"hierarchy-level-filtering\" : undefined, reportInteraction: true });\n        filteringOptions.setInstanceFilter(toGenericFilter(info));\n        setFilteringOptions(undefined);\n      }}\n      onClose={() => {\n        setFilteringOptions(undefined);\n      }}\n      propertiesSource={propertiesSource}\n      initialFilter={getInitialFilter}\n      filterResultsCountRenderer={(filter) => {\n        if (!filteringOptions) {\n          return null;\n        }\n\n        return (\n          <MatchingInstancesCount filter={filter} hierarchyLevelDetails={filteringOptions} defaultHierarchyLevelSizeLimit={defaultHierarchyLevelSizeLimit} />\n        );\n      }}\n    />\n  );\n\n  return {\n    onFilterClick: setFilteringOptions,\n    filteringDialog,\n  };\n}\n\ninterface MatchingInstancesCountProps {\n  filter: PresentationInstanceFilterInfo;\n  hierarchyLevelDetails: HierarchyLevelDetails;\n  defaultHierarchyLevelSizeLimit: number;\n}\n\nfunction MatchingInstancesCount({ filter, defaultHierarchyLevelSizeLimit, hierarchyLevelDetails }: MatchingInstancesCountProps) {\n  const { value, inProgress } = useDebouncedAsyncValue(\n    useCallback(async () => {\n      const instanceFilter = toGenericFilter(filter);\n      try {\n        const instanceCount = await countInstanceKeys(\n          hierarchyLevelDetails.getInstanceKeysIterator({\n            instanceFilter,\n            hierarchyLevelSizeLimit: hierarchyLevelDetails.sizeLimit ?? defaultHierarchyLevelSizeLimit,\n          }),\n        );\n        return TreeWidget.translate(\"filteringDialog.matchingInstancesCount\", {\n          instanceCount: instanceCount.toLocaleString(undefined, { useGrouping: true }),\n        });\n      } catch (e) {\n        if (e instanceof RowsLimitExceededError) {\n          return TreeWidget.translate(\"filteringDialog.filterExceedsLimit\", { limit: e.limit.toLocaleString(undefined, { useGrouping: true }) });\n        }\n        return TreeWidget.translate(\"filteringDialog.failedToCalculateMatchingInstancesCount\");\n      }\n    }, [filter, hierarchyLevelDetails, defaultHierarchyLevelSizeLimit]),\n  );\n\n  if (inProgress) {\n    return (\n      <Delayed show={true}>\n        {TreeWidget.translate(\"filteringDialog.matchingInstancesCount\", { instanceCount: \"\" })}\n        <ProgressRadial size=\"x-small\" />\n      </Delayed>\n    );\n  }\n\n  return value ? <>{value}</> : null;\n}\n\nasync function countInstanceKeys(iterator: AsyncIterableIterator<InstanceKey>) {\n  let result = 0;\n  for await (const _ of iterator) {\n    result++;\n  }\n  return result;\n}\n\nasync function collectInstanceKeys(iterator: AsyncIterableIterator<InstanceKey>) {\n  const idsByClassName = new Map<Id64String, Id64Array>();\n  for await (const { className, id } of iterator) {\n    let idSet = idsByClassName.get(className);\n    if (!idSet) {\n      idSet = [];\n      idsByClassName.set(className, idSet);\n    }\n    idSet.push(id);\n  }\n\n  const instanceKeys = new Array<[className: string, compressedIds: CompressedId64Set]>();\n  for (const [className, ids] of idsByClassName) {\n    instanceKeys.push([className.toLowerCase(), CompressedId64Set.sortAndCompress(ids)]);\n  }\n  return KeySet.fromJSON({ instanceKeys, nodeKeys: [] });\n}\n\nfunction fromGenericFilter(descriptor: Descriptor, filter: GenericInstanceFilter): PresentationInstanceFilterInfo {\n  const presentationFilter =\n    GenericInstanceFilter.isFilterRuleGroup(filter.rules) && filter.rules.rules.length === 0\n      ? undefined\n      : PresentationInstanceFilter.fromGenericInstanceFilter(descriptor, filter);\n  return {\n    filter: presentationFilter,\n    usedClasses: (filter.filteredClassNames ?? [])\n      .map((name) => descriptor.selectClasses.find((selectClass) => selectClass.selectClassInfo.name === name)?.selectClassInfo)\n      .filter((classInfo): classInfo is ClassInfo => classInfo !== undefined),\n  };\n}\n\nfunction toGenericFilter(filterInfo?: PresentationInstanceFilterInfo): GenericInstanceFilter | undefined {\n  if (!filterInfo) {\n    return undefined;\n  }\n\n  if (!filterInfo.filter) {\n    return filterInfo.usedClasses.length > 0\n      ? {\n          propertyClassNames: [],\n          relatedInstances: [],\n          filteredClassNames: filterInfo.usedClasses.map((info) => info.name),\n          rules: { operator: \"and\", rules: [] },\n        }\n      : undefined;\n  }\n\n  return PresentationInstanceFilter.toGenericInstanceFilter(filterInfo.filter, filterInfo.usedClasses);\n}\n"]}

package/lib/cjs/components/trees/common/UseHierarchyVisibility.d.ts

@@ -0,0 +1,30 @@
+import type { HierarchyNode, PresentationHierarchyNode } from "@itwin/presentation-hierarchies-react";
+import type { TreeNodeCheckboxState } from "./components/TreeNodeCheckbox";
+import type { BeEvent, IDisposable } from "@itwin/core-bentley";
+/**
+ * Data structure that describes instance visibility status.
+ * @internal
+ */
+export interface VisibilityStatus {
+    state: "visible" | "partial" | "hidden";
+    isDisabled?: boolean;
+    tooltip?: string;
+}
+/** @internal */
+export interface HierarchyVisibilityHandler extends IDisposable {
+    readonly onVisibilityChange: BeEvent<() => void>;
+    getVisibilityStatus(node: HierarchyNode): Promise<VisibilityStatus> | VisibilityStatus;
+    changeVisibility(node: HierarchyNode, on: boolean): Promise<void>;
+}
+interface UseHierarchyVisibilityProps {
+    visibilityHandlerFactory: () => HierarchyVisibilityHandler;
+}
+interface UseHierarchyVisibilityResult {
+    onCheckboxClicked: (node: PresentationHierarchyNode, checked: boolean) => void;
+    getCheckboxState: (node: PresentationHierarchyNode) => TreeNodeCheckboxState;
+    triggerRefresh: () => void;
+}
+/** @internal */
+export declare function useHierarchyVisibility({ visibilityHandlerFactory }: UseHierarchyVisibilityProps): UseHierarchyVisibilityResult;
+export {};
+//# sourceMappingURL=UseHierarchyVisibility.d.ts.map

package/lib/cjs/components/trees/{stateless/common → common}/UseHierarchyVisibility.js

@@ -9,53 +9,69 @@ const react_1 = require("react");
 const rxjs_1 = require("rxjs");
 /** @internal */
 function useHierarchyVisibility({ visibilityHandlerFactory }) {
-    const statusMap = (0, react_1.useRef)(new Map());
+    const nodesStateMap = (0, react_1.useRef)(new Map());
     const [state, setState] = (0, react_1.useState)({
-        getCheckboxStatus: (_node) => ({ state: "hidden", isDisabled: true }),
-        onCheckboxClicked: (_node, _checked) => { },
+        getCheckboxState: () => ({ state: "off", isDisabled: true }),
+        onCheckboxClicked: () => { },
+        triggerRefresh: () => { },
     });
     (0, react_1.useEffect)(() => {
-        statusMap.current.clear();
+        nodesStateMap.current.clear();
         const handler = visibilityHandlerFactory();
         const visibilityChanged = new rxjs_1.Subject();
         const calculate = new rxjs_1.Subject();
         const calculateNodeStatus = (node) => {
             calculate.next(node);
         };
+        const resetCache = () => {
+            nodesStateMap.current.forEach((value) => {
+                value.needsRefresh = true;
+            });
+            visibilityChanged.next();
+        };
+        const triggerCheckboxUpdate = () => {
+            setState((prev) => ({
+                ...prev,
+                getCheckboxState: createStateGetter(nodesStateMap, calculateNodeStatus),
+            }));
+        };
         const subscription = calculate
             .pipe((0, rxjs_1.distinct)(undefined, visibilityChanged), (0, rxjs_1.mergeMap)((node) => (0, rxjs_1.defer)(async () => ({ node, status: await handler.getVisibilityStatus(node.nodeData) })).pipe((0, rxjs_1.takeUntil)(visibilityChanged))))
             .subscribe({
             next: ({ node, status }) => {
-                statusMap.current.set(node.id, { node, status, needsRefresh: false });
-                setState((prev) => ({
-                    ...prev,
-                    getCheckboxStatus: createStatusGetter(statusMap, calculateNodeStatus),
-                }));
+                nodesStateMap.current.set(node.id, {
+                    node,
+                    state: {
+                        state: status.state === "visible" ? "on" : status.state === "partial" ? "partial" : "off",
+                        tooltip: status.tooltip,
+                        isDisabled: status.isDisabled,
+                    },
+                    needsRefresh: false,
+                });
+                triggerCheckboxUpdate();
             },
         });
         const changeVisibility = (node, checked) => {
             void handler.changeVisibility(node.nodeData, checked);
-            const status = statusMap.current.get(node.id);
-            if (!status) {
+            const entry = nodesStateMap.current.get(node.id);
+            if (!entry) {
                 return;
             }
-            status.status.state = checked ? "visible" : "hidden";
-            status.status.tooltip = undefined;
-            setState((prev) => ({ ...prev, getCheckboxStatus: createStatusGetter(statusMap, calculateNodeStatus) }));
+            entry.state.state = checked ? "on" : "off";
+            entry.state.tooltip = undefined;
+            triggerCheckboxUpdate();
         };
         setState({
             onCheckboxClicked: changeVisibility,
-            getCheckboxStatus: createStatusGetter(statusMap, calculateNodeStatus),
+            getCheckboxState: createStateGetter(nodesStateMap, calculateNodeStatus),
+            triggerRefresh: () => {
+                resetCache();
+                triggerCheckboxUpdate();
+            },
         });
         const removeListener = handler.onVisibilityChange.addListener(() => {
-            statusMap.current.forEach((value) => {
-                value.needsRefresh = true;
-            });
-            visibilityChanged.next();
-            setState((prev) => ({
-                ...prev,
-                getCheckboxStatus: createStatusGetter(statusMap, calculateNodeStatus),
-            }));
+            resetCache();
+            triggerCheckboxUpdate();
         });
         return () => {
             subscription.unsubscribe();
@@ -66,17 +82,17 @@ function useHierarchyVisibility({ visibilityHandlerFactory }) {
     return state;
 }
 exports.useHierarchyVisibility = useHierarchyVisibility;
-function createStatusGetter(map, calculateVisibility) {
+function createStateGetter(map, calculateVisibility) {
     return (node) => {
-        const status = map.current.get(node.id);
-        if (status === undefined) {
+        const entry = map.current.get(node.id);
+        if (entry === undefined) {
             calculateVisibility(node);
-            return { state: "hidden", isDisabled: true };
+            return { state: "off", isDisabled: true };
         }
-        if (status.needsRefresh) {
+        if (entry.needsRefresh) {
             calculateVisibility(node);
         }
-        return status.status;
+        return entry.state;
     };
 }
 //# sourceMappingURL=UseHierarchyVisibility.js.map

package/lib/cjs/components/trees/common/UseHierarchyVisibility.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UseHierarchyVisibility.js","sourceRoot":"","sources":["../../../../../src/components/trees/common/UseHierarchyVisibility.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,iCAAoD;AACpD,+BAAqE;AAkCrE,gBAAgB;AAChB,SAAgB,sBAAsB,CAAC,EAAE,wBAAwB,EAA+B;IAC9F,MAAM,aAAa,GAAG,IAAA,cAAM,EAAC,IAAI,GAAG,EAAoG,CAAC,CAAC;IAC1I,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAA,gBAAQ,EAA+B;QAC/D,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC5D,iBAAiB,EAAE,GAAG,EAAE,GAAE,CAAC;QAC3B,cAAc,EAAE,GAAG,EAAE,GAAE,CAAC;KACzB,CAAC,CAAC;IAEH,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,wBAAwB,EAAE,CAAC;QAE3C,MAAM,iBAAiB,GAAG,IAAI,cAAO,EAAQ,CAAC;QAC9C,MAAM,SAAS,GAAG,IAAI,cAAO,EAA6B,CAAC;QAC3D,MAAM,mBAAmB,GAAG,CAAC,IAA+B,EAAE,EAAE;YAC9D,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC;QAEF,MAAM,UAAU,GAAG,GAAG,EAAE;YACtB,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBACtC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC;YAC5B,CAAC,CAAC,CAAC;YACH,iBAAiB,CAAC,IAAI,EAAE,CAAC;QAC3B,CAAC,CAAC;QAEF,MAAM,qBAAqB,GAAG,GAAG,EAAE;YACjC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAClB,GAAG,IAAI;gBACP,gBAAgB,EAAE,iBAAiB,CAAC,aAAa,EAAE,mBAAmB,CAAC;aACxE,CAAC,CAAC,CAAC;QACN,CAAC,CAAC;QAEF,MAAM,YAAY,GAAG,SAAS;aAC3B,IAAI,CACH,IAAA,eAAQ,EAAC,SAAS,EAAE,iBAAiB,CAAC,EACtC,IAAA,eAAQ,EAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,YAAK,EAAC,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,gBAAS,EAAC,iBAAiB,CAAC,CAAC,CAAC,CAC/I;aACA,SAAS,CAAC;YACT,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE;gBACzB,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;oBACjC,IAAI;oBACJ,KAAK,EAAE;wBACL,KAAK,EAAE,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK;wBACzF,OAAO,EAAE,MAAM,CAAC,OAAO;wBACvB,UAAU,EAAE,MAAM,CAAC,UAAU;qBAC9B;oBACD,YAAY,EAAE,KAAK;iBACpB,CAAC,CAAC;gBACH,qBAAqB,EAAE,CAAC;YAC1B,CAAC;SACF,CAAC,CAAC;QAEL,MAAM,gBAAgB,GAAG,CAAC,IAA+B,EAAE,OAAgB,EAAE,EAAE;YAC7E,KAAK,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,EAAE;gBACV,OAAO;aACR;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YAC3C,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,SAAS,CAAC;YAChC,qBAAqB,EAAE,CAAC;QAC1B,CAAC,CAAC;QAEF,QAAQ,CAAC;YACP,iBAAiB,EAAE,gBAAgB;YACnC,gBAAgB,EAAE,iBAAiB,CAAC,aAAa,EAAE,mBAAmB,CAAC;YACvE,cAAc,EAAE,GAAG,EAAE;gBACnB,UAAU,EAAE,CAAC;gBACb,qBAAqB,EAAE,CAAC;YAC1B,CAAC;SACF,CAAC,CAAC;QAEH,MAAM,cAAc,GAAG,OAAO,CAAC,kBAAkB,CAAC,WAAW,CAAC,GAAG,EAAE;YACjE,UAAU,EAAE,CAAC;YACb,qBAAqB,EAAE,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,EAAE;YACV,YAAY,CAAC,WAAW,EAAE,CAAC;YAC3B,cAAc,EAAE,CAAC;YACjB,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,CAAC,CAAC;IACJ,CAAC,EAAE,CAAC,wBAAwB,CAAC,CAAC,CAAC;IAE/B,OAAO,KAAK,CAAC;AACf,CAAC;AArFD,wDAqFC;AAED,SAAS,iBAAiB,CACxB,GAA4H,EAC5H,mBAA8D;IAE9D,OAAO,CAAC,IAA+B,EAAyB,EAAE;QAChE,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE;YACvB,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC1B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;SAC3C;QACD,IAAI,KAAK,CAAC,YAAY,EAAE;YACtB,mBAAmB,CAAC,IAAI,CAAC,CAAC;SAC3B;QAED,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,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 { useEffect, useRef, useState } from \"react\";\nimport { defer, distinct, mergeMap, Subject, takeUntil } from \"rxjs\";\n\nimport type { HierarchyNode, PresentationHierarchyNode } from \"@itwin/presentation-hierarchies-react\";\nimport type { MutableRefObject } from \"react\";\nimport type { TreeNodeCheckboxState } from \"./components/TreeNodeCheckbox\";\nimport type { BeEvent, IDisposable } from \"@itwin/core-bentley\";\n\n/**\n * Data structure that describes instance visibility status.\n * @internal\n */\nexport interface VisibilityStatus {\n  state: \"visible\" | \"partial\" | \"hidden\";\n  isDisabled?: boolean;\n  tooltip?: string;\n}\n\n/** @internal */\nexport interface HierarchyVisibilityHandler extends IDisposable {\n  readonly onVisibilityChange: BeEvent<() => void>;\n  getVisibilityStatus(node: HierarchyNode): Promise<VisibilityStatus> | VisibilityStatus;\n  changeVisibility(node: HierarchyNode, on: boolean): Promise<void>;\n}\n\ninterface UseHierarchyVisibilityProps {\n  visibilityHandlerFactory: () => HierarchyVisibilityHandler;\n}\n\ninterface UseHierarchyVisibilityResult {\n  onCheckboxClicked: (node: PresentationHierarchyNode, checked: boolean) => void;\n  getCheckboxState: (node: PresentationHierarchyNode) => TreeNodeCheckboxState;\n  triggerRefresh: () => void;\n}\n\n/** @internal */\nexport function useHierarchyVisibility({ visibilityHandlerFactory }: UseHierarchyVisibilityProps): UseHierarchyVisibilityResult {\n  const nodesStateMap = useRef(new Map<string, { node: PresentationHierarchyNode; state: TreeNodeCheckboxState; needsRefresh: boolean }>());\n  const [state, setState] = useState<UseHierarchyVisibilityResult>({\n    getCheckboxState: () => ({ state: \"off\", isDisabled: true }),\n    onCheckboxClicked: () => {},\n    triggerRefresh: () => {},\n  });\n\n  useEffect(() => {\n    nodesStateMap.current.clear();\n    const handler = visibilityHandlerFactory();\n\n    const visibilityChanged = new Subject<void>();\n    const calculate = new Subject<PresentationHierarchyNode>();\n    const calculateNodeStatus = (node: PresentationHierarchyNode) => {\n      calculate.next(node);\n    };\n\n    const resetCache = () => {\n      nodesStateMap.current.forEach((value) => {\n        value.needsRefresh = true;\n      });\n      visibilityChanged.next();\n    };\n\n    const triggerCheckboxUpdate = () => {\n      setState((prev) => ({\n        ...prev,\n        getCheckboxState: createStateGetter(nodesStateMap, calculateNodeStatus),\n      }));\n    };\n\n    const subscription = calculate\n      .pipe(\n        distinct(undefined, visibilityChanged),\n        mergeMap((node) => defer(async () => ({ node, status: await handler.getVisibilityStatus(node.nodeData) })).pipe(takeUntil(visibilityChanged))),\n      )\n      .subscribe({\n        next: ({ node, status }) => {\n          nodesStateMap.current.set(node.id, {\n            node,\n            state: {\n              state: status.state === \"visible\" ? \"on\" : status.state === \"partial\" ? \"partial\" : \"off\",\n              tooltip: status.tooltip,\n              isDisabled: status.isDisabled,\n            },\n            needsRefresh: false,\n          });\n          triggerCheckboxUpdate();\n        },\n      });\n\n    const changeVisibility = (node: PresentationHierarchyNode, checked: boolean) => {\n      void handler.changeVisibility(node.nodeData, checked);\n      const entry = nodesStateMap.current.get(node.id);\n      if (!entry) {\n        return;\n      }\n      entry.state.state = checked ? \"on\" : \"off\";\n      entry.state.tooltip = undefined;\n      triggerCheckboxUpdate();\n    };\n\n    setState({\n      onCheckboxClicked: changeVisibility,\n      getCheckboxState: createStateGetter(nodesStateMap, calculateNodeStatus),\n      triggerRefresh: () => {\n        resetCache();\n        triggerCheckboxUpdate();\n      },\n    });\n\n    const removeListener = handler.onVisibilityChange.addListener(() => {\n      resetCache();\n      triggerCheckboxUpdate();\n    });\n\n    return () => {\n      subscription.unsubscribe();\n      removeListener();\n      handler.dispose();\n    };\n  }, [visibilityHandlerFactory]);\n\n  return state;\n}\n\nfunction createStateGetter(\n  map: MutableRefObject<Map<string, { node: PresentationHierarchyNode; state: TreeNodeCheckboxState; needsRefresh: boolean }>>,\n  calculateVisibility: (node: PresentationHierarchyNode) => void,\n) {\n  return (node: PresentationHierarchyNode): TreeNodeCheckboxState => {\n    const entry = map.current.get(node.id);\n    if (entry === undefined) {\n      calculateVisibility(node);\n      return { state: \"off\", isDisabled: true };\n    }\n    if (entry.needsRefresh) {\n      calculateVisibility(node);\n    }\n\n    return entry.state;\n  };\n}\n"]}

package/lib/cjs/components/trees/common/UseIModelChangeListener.d.ts

@@ -0,0 +1,9 @@
+import type { IModelConnection } from "@itwin/core-frontend";
+interface UseIModelChangeListenerProps {
+    imodel: IModelConnection;
+    action: () => void;
+}
+/** @internal */
+export declare function useIModelChangeListener({ imodel, action }: UseIModelChangeListenerProps): void;
+export {};
+//# sourceMappingURL=UseIModelChangeListener.d.ts.map

package/lib/cjs/components/trees/common/UseIModelChangeListener.js

@@ -0,0 +1,20 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.useIModelChangeListener = void 0;
+const react_1 = require("react");
+const presentation_core_interop_1 = require("@itwin/presentation-core-interop");
+/** @internal */
+function useIModelChangeListener({ imodel, action }) {
+    (0, react_1.useEffect)(() => {
+        if (!imodel.isBriefcaseConnection()) {
+            return;
+        }
+        (0, presentation_core_interop_1.registerTxnListeners)(imodel.txns, action);
+    }, [imodel, action]);
+}
+exports.useIModelChangeListener = useIModelChangeListener;
+//# sourceMappingURL=UseIModelChangeListener.js.map

package/lib/cjs/components/trees/common/UseIModelChangeListener.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UseIModelChangeListener.js","sourceRoot":"","sources":["../../../../../src/components/trees/common/UseIModelChangeListener.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,iCAAkC;AAClC,gFAAwE;AASxE,gBAAgB;AAChB,SAAgB,uBAAuB,CAAC,EAAE,MAAM,EAAE,MAAM,EAAgC;IACtF,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,IAAI,CAAC,MAAM,CAAC,qBAAqB,EAAE,EAAE;YACnC,OAAO;SACR;QAED,IAAA,gDAAoB,EAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC5C,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACvB,CAAC;AARD,0DAQC","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 { useEffect } from \"react\";\nimport { registerTxnListeners } from \"@itwin/presentation-core-interop\";\n\nimport type { IModelConnection } from \"@itwin/core-frontend\";\n\ninterface UseIModelChangeListenerProps {\n  imodel: IModelConnection;\n  action: () => void;\n}\n\n/** @internal */\nexport function useIModelChangeListener({ imodel, action }: UseIModelChangeListenerProps) {\n  useEffect(() => {\n    if (!imodel.isBriefcaseConnection()) {\n      return;\n    }\n\n    registerTxnListeners(imodel.txns, action);\n  }, [imodel, action]);\n}\n"]}

package/lib/cjs/components/trees/common/UseMultiCheckboxHandler.js

@@ -0,0 +1,35 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.useMultiCheckboxHandler = void 0;
+const react_1 = require("react");
+const presentation_hierarchies_react_1 = require("@itwin/presentation-hierarchies-react");
+/** @internal */
+function useMultiCheckboxHandler({ rootNodes, isNodeSelected, onClick }) {
+    const onCheckboxClicked = (0, react_1.useCallback)((clickedNode, checked) => {
+        if (!isNodeSelected(clickedNode.id)) {
+            onClick(clickedNode, checked);
+            return;
+        }
+        rootNodes && forEachSelectedNode(rootNodes, isNodeSelected, (node) => onClick(node, checked));
+    }, [rootNodes, isNodeSelected, onClick]);
+    return { onCheckboxClicked };
+}
+exports.useMultiCheckboxHandler = useMultiCheckboxHandler;
+function forEachSelectedNode(nodes, isNodeSelected, callback) {
+    nodes.forEach((node) => {
+        if (!(0, presentation_hierarchies_react_1.isPresentationHierarchyNode)(node)) {
+            return;
+        }
+        if (isNodeSelected(node.id)) {
+            callback(node);
+        }
+        if (node.isExpanded && typeof node.children !== "boolean") {
+            forEachSelectedNode(node.children, isNodeSelected, callback);
+        }
+    });
+}
+//# sourceMappingURL=UseMultiCheckboxHandler.js.map

package/lib/cjs/components/trees/common/UseMultiCheckboxHandler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UseMultiCheckboxHandler.js","sourceRoot":"","sources":["../../../../../src/components/trees/common/UseMultiCheckboxHandler.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,iCAAoC;AACpC,0FAAoF;AAcpF,gBAAgB;AAChB,SAAgB,uBAAuB,CAAC,EAAE,SAAS,EAAE,cAAc,EAAE,OAAO,EAAgC;IAC1G,MAAM,iBAAiB,GAAG,IAAA,mBAAW,EACnC,CAAC,WAAsC,EAAE,OAAgB,EAAE,EAAE;QAC3D,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;YACnC,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAC9B,OAAO;SACR;QACD,SAAS,IAAI,mBAAmB,CAAC,SAAS,EAAE,cAAc,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IAChG,CAAC,EACD,CAAC,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,CACrC,CAAC;IAEF,OAAO,EAAE,iBAAiB,EAAE,CAAC;AAC/B,CAAC;AAbD,0DAaC;AAED,SAAS,mBAAmB,CAC1B,KAAkC,EAClC,cAA2C,EAC3C,QAAmD;IAEnD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACrB,IAAI,CAAC,IAAA,4DAA2B,EAAC,IAAI,CAAC,EAAE;YACtC,OAAO;SACR;QACD,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC3B,QAAQ,CAAC,IAAI,CAAC,CAAC;SAChB;QACD,IAAI,IAAI,CAAC,UAAU,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACzD,mBAAmB,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;SAC9D;IACH,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback } from \"react\";\nimport { isPresentationHierarchyNode } from \"@itwin/presentation-hierarchies-react\";\n\nimport type { PresentationHierarchyNode, PresentationTreeNode } from \"@itwin/presentation-hierarchies-react\";\n\ninterface UseMultiCheckboxHandlerProps {\n  rootNodes: PresentationTreeNode[] | undefined;\n  isNodeSelected: (nodeId: string) => boolean;\n  onClick: (node: PresentationHierarchyNode, checked: boolean) => void;\n}\n\ninterface UseMultiCheckboxHandlerResult {\n  onCheckboxClicked: (node: PresentationHierarchyNode, checked: boolean) => void;\n}\n\n/** @internal */\nexport function useMultiCheckboxHandler({ rootNodes, isNodeSelected, onClick }: UseMultiCheckboxHandlerProps): UseMultiCheckboxHandlerResult {\n  const onCheckboxClicked = useCallback(\n    (clickedNode: PresentationHierarchyNode, checked: boolean) => {\n      if (!isNodeSelected(clickedNode.id)) {\n        onClick(clickedNode, checked);\n        return;\n      }\n      rootNodes && forEachSelectedNode(rootNodes, isNodeSelected, (node) => onClick(node, checked));\n    },\n    [rootNodes, isNodeSelected, onClick],\n  );\n\n  return { onCheckboxClicked };\n}\n\nfunction forEachSelectedNode(\n  nodes: Array<PresentationTreeNode>,\n  isNodeSelected: (nodeId: string) => boolean,\n  callback: (node: PresentationHierarchyNode) => void,\n) {\n  nodes.forEach((node) => {\n    if (!isPresentationHierarchyNode(node)) {\n      return;\n    }\n    if (isNodeSelected(node.id)) {\n      callback(node);\n    }\n    if (node.isExpanded && typeof node.children !== \"boolean\") {\n      forEachSelectedNode(node.children, isNodeSelected, callback);\n    }\n  });\n}\n"]}

package/lib/cjs/components/trees/common/UseNodeHighlighting.d.ts

@@ -0,0 +1,16 @@
+/// <reference types="react" />
+import type { PresentationHierarchyNode, PresentationTreeNode } from "@itwin/presentation-hierarchies-react";
+interface UseNodeHighlightingProps {
+    rootNodes: PresentationTreeNode[] | undefined;
+    searchText?: string;
+    activeMatchIndex?: number;
+    onHighlightChanged?: (activeMatchIndex: number, matches: number) => void;
+}
+interface UseNodeHighlightingResult {
+    activeNodeId?: string;
+    getLabel: (node: PresentationHierarchyNode) => React.ReactElement;
+}
+/** @internal */
+export declare function useNodeHighlighting({ rootNodes, searchText, activeMatchIndex, onHighlightChanged }: UseNodeHighlightingProps): UseNodeHighlightingResult;
+export {};
+//# sourceMappingURL=UseNodeHighlighting.d.ts.map

package/lib/cjs/components/trees/common/UseNodeHighlighting.js

@@ -0,0 +1,140 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.useNodeHighlighting = void 0;
+const jsx_runtime_1 = require("react/jsx-runtime");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+const react_1 = require("react");
+const presentation_hierarchies_react_1 = require("@itwin/presentation-hierarchies-react");
+/** @internal */
+function useNodeHighlighting({ rootNodes, searchText, activeMatchIndex, onHighlightChanged }) {
+    const state = (0, react_1.useRef)({ nodeInfoMap: new Map(), totalMatches: 0 });
+    const [activeNodeId, setActiveNodeId] = (0, react_1.useState)();
+    const activeMatchIndexRef = useLatest(activeMatchIndex);
+    const activeNodeIdRef = useLatest(activeNodeId);
+    const updateHighlightInfo = (0, react_1.useCallback)((index, matches) => {
+        if (matches === 0) {
+            setActiveNodeId(undefined);
+            index = 0;
+        }
+        onHighlightChanged?.(index, matches);
+    }, [onHighlightChanged]);
+    (0, react_1.useEffect)(() => {
+        const { state: newState, activeIndex } = rootNodes && searchText
+            ? computeHighlightState(rootNodes, searchText, state.current, activeNodeIdRef.current, activeMatchIndexRef.current)
+            : { state: { nodeInfoMap: new Map(), totalMatches: 0 }, activeIndex: 0 };
+        state.current = newState;
+        updateHighlightInfo(activeIndex, newState.totalMatches);
+    }, [rootNodes, searchText, activeNodeIdRef, activeMatchIndexRef, updateHighlightInfo]);
+    (0, react_1.useEffect)(() => {
+        for (const nodeId of state.current.nodeInfoMap.keys()) {
+            if (getNodeChunkInfo(state.current, nodeId, activeMatchIndex)?.activeChunkIndex !== undefined) {
+                setActiveNodeId(nodeId);
+            }
+        }
+    }, [activeMatchIndex]);
+    const getLabel = (0, react_1.useCallback)((node) => {
+        const chunkInfo = getNodeChunkInfo(state.current, node.id, activeMatchIndex);
+        if (searchText && chunkInfo) {
+            return (0, jsx_runtime_1.jsx)(jsx_runtime_1.Fragment, { children: markChunks(node.label, chunkInfo.chunks, chunkInfo.activeChunkIndex) });
+        }
+        return (0, jsx_runtime_1.jsx)("span", { children: node.label });
+    }, [searchText, activeMatchIndex]);
+    return { activeNodeId, getLabel };
+}
+exports.useNodeHighlighting = useNodeHighlighting;
+function getNodeChunkInfo(state, nodeId, activeIndex) {
+    const info = state.nodeInfoMap.get(nodeId);
+    if (!info) {
+        return undefined;
+    }
+    if (activeIndex === undefined) {
+        return { chunks: info.matches };
+    }
+    const isActive = info && activeIndex >= info.startIndex && activeIndex < info.startIndex + info.matches.length;
+    return isActive ? { activeChunkIndex: activeIndex - info.startIndex, chunks: info.matches } : { chunks: info.matches };
+}
+function computeHighlightState(rootNodes, searchText, state, activeNodeId, activeMatchIndex) {
+    const newState = { nodeInfoMap: new Map(), totalMatches: 0 };
+    let newActiveIndex = activeMatchIndex ?? 0;
+    const computeHighlightStateRecursively = (nodes) => {
+        nodes.forEach((node) => {
+            if (!(0, presentation_hierarchies_react_1.isPresentationHierarchyNode)(node)) {
+                return;
+            }
+            const matches = findChunks(node.label, searchText);
+            newState.nodeInfoMap.set(node.id, { startIndex: newState.totalMatches, matches });
+            newState.totalMatches += matches.length;
+            if (typeof node.children !== "boolean") {
+                computeHighlightStateRecursively(node.children);
+            }
+        });
+    };
+    computeHighlightStateRecursively(rootNodes);
+    // update active index to not cause active chunk jumps when hierarchy changes
+    if (activeNodeId && newActiveIndex !== 0) {
+        const activeNodeInfo = getNodeChunkInfo(state, activeNodeId, activeMatchIndex);
+        const updatedInfo = newState.nodeInfoMap.get(activeNodeId);
+        if (updatedInfo && activeNodeInfo?.activeChunkIndex !== undefined) {
+            newActiveIndex = updatedInfo.startIndex + activeNodeInfo.activeChunkIndex;
+        }
+    }
+    return { state: newState, activeIndex: newActiveIndex };
+}
+function findChunks(text, searchText) {
+    const chunks = [];
+    const contentText = text.toLowerCase();
+    const inputText = searchText.toLowerCase();
+    let index = contentText.indexOf(inputText);
+    while (index !== -1) {
+        chunks.push({ start: index, end: index + inputText.length });
+        index = contentText.indexOf(inputText, index + 1);
+    }
+    return chunks;
+}
+function markChunks(text, chunks, activeChunk) {
+    const markedText = [];
+    let previousIndex = 0;
+    const { mergedChunks, newActiveIndex } = mergeChunks(chunks, activeChunk);
+    for (let i = 0; i < mergedChunks.length; i++) {
+        const { start, end } = mergedChunks[i];
+        // add unmarked text between previous chunk and current one
+        const nonMarkedText = text.substring(previousIndex, start);
+        nonMarkedText.length && markedText.push((0, jsx_runtime_1.jsx)("span", { children: nonMarkedText }, previousIndex));
+        // add marked chunk text
+        markedText.push((0, jsx_runtime_1.jsx)("mark", { className: i === newActiveIndex ? "tw-active-match-highlight" : undefined, children: text.substring(start, end) }, start));
+        previousIndex = end;
+    }
+    // add unmarked text after last chunk
+    const lastNonMarkedText = text.substring(previousIndex, text.length);
+    lastNonMarkedText.length && markedText.push((0, jsx_runtime_1.jsx)("span", { children: lastNonMarkedText }, previousIndex));
+    return markedText;
+}
+function mergeChunks(chunks, activeChunk) {
+    const mergedChunks = [];
+    let lastChunk;
+    let newActiveIndex;
+    for (let i = 0; i < chunks.length; i++) {
+        const chunk = chunks[i];
+        const isActive = i === activeChunk;
+        if (lastChunk && lastChunk.info.end === chunk.start && !isActive && !lastChunk.isActive) {
+            lastChunk.info.end = chunk.end;
+            continue;
+        }
+        isActive && (newActiveIndex = mergedChunks.length);
+        const newChunk = { start: chunk.start, end: chunk.end };
+        lastChunk = { isActive, info: newChunk };
+        mergedChunks.push(newChunk);
+    }
+    return { mergedChunks, newActiveIndex };
+}
+function useLatest(value) {
+    const ref = (0, react_1.useRef)(value);
+    (0, react_1.useEffect)(() => {
+        ref.current = value;
+    }, [value]);
+    return ref;
+}
+//# sourceMappingURL=UseNodeHighlighting.js.map

package/lib/cjs/components/trees/common/UseNodeHighlighting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UseNodeHighlighting.js","sourceRoot":"","sources":["../../../../../src/components/trees/common/UseNodeHighlighting.tsx"],"names":[],"mappings":";;;;AAAA;;;gGAGgG;AAEhG,iCAAiE;AACjE,0FAAoF;AAoCpF,gBAAgB;AAChB,SAAgB,mBAAmB,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,gBAAgB,EAAE,kBAAkB,EAA4B;IAC3H,MAAM,KAAK,GAAG,IAAA,cAAM,EAAiB,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;IAClF,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,IAAA,gBAAQ,GAAsB,CAAC;IACvE,MAAM,mBAAmB,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC;IACxD,MAAM,eAAe,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC;IAEhD,MAAM,mBAAmB,GAAG,IAAA,mBAAW,EACrC,CAAC,KAAa,EAAE,OAAe,EAAE,EAAE;QACjC,IAAI,OAAO,KAAK,CAAC,EAAE;YACjB,eAAe,CAAC,SAAS,CAAC,CAAC;YAC3B,KAAK,GAAG,CAAC,CAAC;SACX;QACD,kBAAkB,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACvC,CAAC,EACD,CAAC,kBAAkB,CAAC,CACrB,CAAC;IAEF,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,GACpC,SAAS,IAAI,UAAU;YACrB,CAAC,CAAC,qBAAqB,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,CAAC,OAAO,EAAE,eAAe,CAAC,OAAO,EAAE,mBAAmB,CAAC,OAAO,CAAC;YACnH,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QAE7E,KAAK,CAAC,OAAO,GAAG,QAAQ,CAAC;QACzB,mBAAmB,CAAC,WAAW,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IAC1D,CAAC,EAAE,CAAC,SAAS,EAAE,UAAU,EAAE,eAAe,EAAE,mBAAmB,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAEvF,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE;YACrD,IAAI,gBAAgB,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,EAAE,gBAAgB,KAAK,SAAS,EAAE;gBAC7F,eAAe,CAAC,MAAM,CAAC,CAAC;aACzB;SACF;IACH,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEvB,MAAM,QAAQ,GAAG,IAAA,mBAAW,EAC1B,CAAC,IAA+B,EAAE,EAAE;QAClC,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QAC7E,IAAI,UAAU,IAAI,SAAS,EAAE;YAC3B,OAAO,2DAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,gBAAgB,CAAC,GAAI,CAAC;SACpF;QACD,OAAO,2CAAO,IAAI,CAAC,KAAK,GAAQ,CAAC;IACnC,CAAC,EACD,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAC/B,CAAC;IAEF,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AA/CD,kDA+CC;AAED,SAAS,gBAAgB,CAAC,KAAqB,EAAE,MAAc,EAAE,WAAoB;IACnF,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,IAAI,EAAE;QACT,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,WAAW,KAAK,SAAS,EAAE;QAC7B,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;KACjC;IACD,MAAM,QAAQ,GAAG,IAAI,IAAI,WAAW,IAAI,IAAI,CAAC,UAAU,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/G,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,WAAW,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;AACzH,CAAC;AAED,SAAS,qBAAqB,CAAC,SAAiC,EAAE,UAAkB,EAAE,KAAqB,EAAE,YAAqB,EAAE,gBAAyB;IAC3J,MAAM,QAAQ,GAAmB,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAC7E,IAAI,cAAc,GAAG,gBAAgB,IAAI,CAAC,CAAC;IAE3C,MAAM,gCAAgC,GAAG,CAAC,KAAkC,EAAE,EAAE;QAC9E,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACrB,IAAI,CAAC,IAAA,4DAA2B,EAAC,IAAI,CAAC,EAAE;gBACtC,OAAO;aACR;YAED,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YACnD,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;YAClF,QAAQ,CAAC,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC;YAExC,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;gBACtC,gCAAgC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACjD;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,gCAAgC,CAAC,SAAS,CAAC,CAAC;IAE5C,6EAA6E;IAC7E,IAAI,YAAY,IAAI,cAAc,KAAK,CAAC,EAAE;QACxC,MAAM,cAAc,GAAG,gBAAgB,CAAC,KAAK,EAAE,YAAY,EAAE,gBAAgB,CAAC,CAAC;QAC/E,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAE3D,IAAI,WAAW,IAAI,cAAc,EAAE,gBAAgB,KAAK,SAAS,EAAE;YACjE,cAAc,GAAG,WAAW,CAAC,UAAU,GAAG,cAAc,CAAC,gBAAgB,CAAC;SAC3E;KACF;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,UAAU,CAAC,IAAY,EAAE,UAAkB;IAClD,MAAM,MAAM,GAAuB,EAAE,CAAC;IAEtC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;IAC3C,IAAI,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAE3C,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE;QACnB,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7D,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;KACnD;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,UAAU,CAAC,IAAY,EAAE,MAA0B,EAAE,WAAoB;IAChF,MAAM,UAAU,GAAyB,EAAE,CAAC;IAC5C,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAE1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAEvC,2DAA2D;QAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAC3D,aAAa,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,2CAA2B,aAAa,IAA7B,aAAa,CAAwB,CAAC,CAAC;QAE1F,wBAAwB;QACxB,UAAU,CAAC,IAAI,CACb,iCAAkB,SAAS,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAAC,SAAS,YACxF,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,IADlB,KAAK,CAET,CACR,CAAC;QACF,aAAa,GAAG,GAAG,CAAC;KACrB;IAED,qCAAqC;IACrC,MAAM,iBAAiB,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrE,iBAAiB,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,2CAA2B,iBAAiB,IAAjC,aAAa,CAA4B,CAAC,CAAC;IAElG,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,WAAW,CAAC,MAA0B,EAAE,WAAoB;IACnE,MAAM,YAAY,GAAuB,EAAE,CAAC;IAC5C,IAAI,SAAoE,CAAC;IACzE,IAAI,cAAkC,CAAC;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,QAAQ,GAAG,CAAC,KAAK,WAAW,CAAC;QACnC,IAAI,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE;YACvF,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC;YAC/B,SAAS;SACV;QACD,QAAQ,IAAI,CAAC,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC;QACxD,SAAS,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;QACzC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;KAC7B;IACD,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,SAAS,CAAI,KAAQ;IAC5B,MAAM,GAAG,GAAG,IAAA,cAAM,EAAC,KAAK,CAAC,CAAC;IAC1B,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,GAAG,CAAC,OAAO,GAAG,KAAK,CAAC;IACtB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAEZ,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useCallback, useEffect, useRef, useState } from \"react\";\nimport { isPresentationHierarchyNode } from \"@itwin/presentation-hierarchies-react\";\n\nimport type { PresentationHierarchyNode, PresentationTreeNode } from \"@itwin/presentation-hierarchies-react\";\n\ninterface UseNodeHighlightingProps {\n  rootNodes: PresentationTreeNode[] | undefined;\n  searchText?: string;\n  activeMatchIndex?: number;\n  onHighlightChanged?: (activeMatchIndex: number, matches: number) => void;\n}\n\ninterface HighlightedChunk {\n  start: number;\n  end: number;\n}\n\ninterface NodeChunkInfo {\n  chunks: HighlightedChunk[];\n  activeChunkIndex?: number;\n}\n\ninterface NodeHighlightInfo {\n  startIndex: number;\n  matches: HighlightedChunk[];\n}\n\ninterface HighlightState {\n  nodeInfoMap: Map<string, NodeHighlightInfo>;\n  totalMatches: number;\n}\n\ninterface UseNodeHighlightingResult {\n  activeNodeId?: string;\n  getLabel: (node: PresentationHierarchyNode) => React.ReactElement;\n}\n\n/** @internal */\nexport function useNodeHighlighting({ rootNodes, searchText, activeMatchIndex, onHighlightChanged }: UseNodeHighlightingProps): UseNodeHighlightingResult {\n  const state = useRef<HighlightState>({ nodeInfoMap: new Map(), totalMatches: 0 });\n  const [activeNodeId, setActiveNodeId] = useState<string | undefined>();\n  const activeMatchIndexRef = useLatest(activeMatchIndex);\n  const activeNodeIdRef = useLatest(activeNodeId);\n\n  const updateHighlightInfo = useCallback(\n    (index: number, matches: number) => {\n      if (matches === 0) {\n        setActiveNodeId(undefined);\n        index = 0;\n      }\n      onHighlightChanged?.(index, matches);\n    },\n    [onHighlightChanged],\n  );\n\n  useEffect(() => {\n    const { state: newState, activeIndex } =\n      rootNodes && searchText\n        ? computeHighlightState(rootNodes, searchText, state.current, activeNodeIdRef.current, activeMatchIndexRef.current)\n        : { state: { nodeInfoMap: new Map(), totalMatches: 0 }, activeIndex: 0 };\n\n    state.current = newState;\n    updateHighlightInfo(activeIndex, newState.totalMatches);\n  }, [rootNodes, searchText, activeNodeIdRef, activeMatchIndexRef, updateHighlightInfo]);\n\n  useEffect(() => {\n    for (const nodeId of state.current.nodeInfoMap.keys()) {\n      if (getNodeChunkInfo(state.current, nodeId, activeMatchIndex)?.activeChunkIndex !== undefined) {\n        setActiveNodeId(nodeId);\n      }\n    }\n  }, [activeMatchIndex]);\n\n  const getLabel = useCallback(\n    (node: PresentationHierarchyNode) => {\n      const chunkInfo = getNodeChunkInfo(state.current, node.id, activeMatchIndex);\n      if (searchText && chunkInfo) {\n        return <>{markChunks(node.label, chunkInfo.chunks, chunkInfo.activeChunkIndex)}</>;\n      }\n      return <span>{node.label}</span>;\n    },\n    [searchText, activeMatchIndex],\n  );\n\n  return { activeNodeId, getLabel };\n}\n\nfunction getNodeChunkInfo(state: HighlightState, nodeId: string, activeIndex?: number): NodeChunkInfo | undefined {\n  const info = state.nodeInfoMap.get(nodeId);\n  if (!info) {\n    return undefined;\n  }\n  if (activeIndex === undefined) {\n    return { chunks: info.matches };\n  }\n  const isActive = info && activeIndex >= info.startIndex && activeIndex < info.startIndex + info.matches.length;\n  return isActive ? { activeChunkIndex: activeIndex - info.startIndex, chunks: info.matches } : { chunks: info.matches };\n}\n\nfunction computeHighlightState(rootNodes: PresentationTreeNode[], searchText: string, state: HighlightState, activeNodeId?: string, activeMatchIndex?: number) {\n  const newState: HighlightState = { nodeInfoMap: new Map(), totalMatches: 0 };\n  let newActiveIndex = activeMatchIndex ?? 0;\n\n  const computeHighlightStateRecursively = (nodes: Array<PresentationTreeNode>) => {\n    nodes.forEach((node) => {\n      if (!isPresentationHierarchyNode(node)) {\n        return;\n      }\n\n      const matches = findChunks(node.label, searchText);\n      newState.nodeInfoMap.set(node.id, { startIndex: newState.totalMatches, matches });\n      newState.totalMatches += matches.length;\n\n      if (typeof node.children !== \"boolean\") {\n        computeHighlightStateRecursively(node.children);\n      }\n    });\n  };\n\n  computeHighlightStateRecursively(rootNodes);\n\n  // update active index to not cause active chunk jumps when hierarchy changes\n  if (activeNodeId && newActiveIndex !== 0) {\n    const activeNodeInfo = getNodeChunkInfo(state, activeNodeId, activeMatchIndex);\n    const updatedInfo = newState.nodeInfoMap.get(activeNodeId);\n\n    if (updatedInfo && activeNodeInfo?.activeChunkIndex !== undefined) {\n      newActiveIndex = updatedInfo.startIndex + activeNodeInfo.activeChunkIndex;\n    }\n  }\n\n  return { state: newState, activeIndex: newActiveIndex };\n}\n\nfunction findChunks(text: string, searchText: string): HighlightedChunk[] {\n  const chunks: HighlightedChunk[] = [];\n\n  const contentText = text.toLowerCase();\n  const inputText = searchText.toLowerCase();\n  let index = contentText.indexOf(inputText);\n\n  while (index !== -1) {\n    chunks.push({ start: index, end: index + inputText.length });\n    index = contentText.indexOf(inputText, index + 1);\n  }\n\n  return chunks;\n}\n\nfunction markChunks(text: string, chunks: HighlightedChunk[], activeChunk?: number) {\n  const markedText: React.ReactElement[] = [];\n  let previousIndex = 0;\n\n  const { mergedChunks, newActiveIndex } = mergeChunks(chunks, activeChunk);\n\n  for (let i = 0; i < mergedChunks.length; i++) {\n    const { start, end } = mergedChunks[i];\n\n    // add unmarked text between previous chunk and current one\n    const nonMarkedText = text.substring(previousIndex, start);\n    nonMarkedText.length && markedText.push(<span key={previousIndex}>{nonMarkedText}</span>);\n\n    // add marked chunk text\n    markedText.push(\n      <mark key={start} className={i === newActiveIndex ? \"tw-active-match-highlight\" : undefined}>\n        {text.substring(start, end)}\n      </mark>,\n    );\n    previousIndex = end;\n  }\n\n  // add unmarked text after last chunk\n  const lastNonMarkedText = text.substring(previousIndex, text.length);\n  lastNonMarkedText.length && markedText.push(<span key={previousIndex}>{lastNonMarkedText}</span>);\n\n  return markedText;\n}\n\nfunction mergeChunks(chunks: HighlightedChunk[], activeChunk?: number) {\n  const mergedChunks: HighlightedChunk[] = [];\n  let lastChunk: { isActive: boolean; info: HighlightedChunk } | undefined;\n  let newActiveIndex: number | undefined;\n\n  for (let i = 0; i < chunks.length; i++) {\n    const chunk = chunks[i];\n    const isActive = i === activeChunk;\n    if (lastChunk && lastChunk.info.end === chunk.start && !isActive && !lastChunk.isActive) {\n      lastChunk.info.end = chunk.end;\n      continue;\n    }\n    isActive && (newActiveIndex = mergedChunks.length);\n    const newChunk = { start: chunk.start, end: chunk.end };\n    lastChunk = { isActive, info: newChunk };\n    mergedChunks.push(newChunk);\n  }\n  return { mergedChunks, newActiveIndex };\n}\n\nfunction useLatest<T>(value: T) {\n  const ref = useRef(value);\n  useEffect(() => {\n    ref.current = value;\n  }, [value]);\n\n  return ref;\n}\n"]}