@itwin/presentation-hierarchies 0.1.0

package/lib/esm/hierarchies/internal/operators/HideIfNoChildren.js

@@ -0,0 +1,48 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { defer, filter, map, merge, mergeMap } from "rxjs";
+import { HierarchyNode } from "../../HierarchyNode";
+import { createNodeIdentifierForLogging, createOperatorLoggingNamespace, hasChildren } from "../Common";
+import { doLog, log } from "../LoggingUtils";
+import { partition } from "./Partition";
+const OPERATOR_NAME = "HideIfNoChildren";
+/** @internal */
+export const LOGGING_NAMESPACE = createOperatorLoggingNamespace(OPERATOR_NAME);
+/**
+ * Creates an operator that hides nodes with no children if they have a `hideIfNoChildren` handling param.
+ *
+ * @internal
+ */
+export function createHideIfNoChildrenOperator(hasNodes) {
+    return function (nodes) {
+        const inputNodes = nodes.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `in: ${createNodeIdentifierForLogging(n)}` }));
+        // split input into 3 pieces:
+        // - `doesntNeedHide` - nodes without the flag (return no matter if they have children or not)
+        // - `determinedChildren` - nodes with the flag and known children
+        // - `undeterminedChildren` - nodes with the flag and unknown children
+        const [needsHide, doesntNeedHide] = partition(inputNodes, (n) => (HierarchyNode.isCustom(n) || HierarchyNode.isInstancesNode(n)) && !!n.processingParams?.hideIfNoChildren);
+        const [determinedChildren, undeterminedChildren] = partition(needsHide, (n) => n.children !== undefined);
+        return merge(doesntNeedHide.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: doesn't need hide` })), merge(determinedChildren.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: needs hide, has children` })), undeterminedChildren.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: needs hide, needs children` }), mergeMap((n) => defer(() => {
+            doLog({
+                category: LOGGING_NAMESPACE,
+                message: /* istanbul ignore next */ () => `${createNodeIdentifierForLogging(n)}: requesting children flag`,
+            });
+            return hasNodes(n).pipe(log({
+                category: LOGGING_NAMESPACE,
+                message: /* istanbul ignore next */ (childrenFlag) => `${createNodeIdentifierForLogging(n)}: determined children: ${childrenFlag}`,
+            }), map((children) => Object.assign(n, { children })));
+        }), 
+        // Sending child check requests for all nodes without any limit greatly slows down
+        // the following case:
+        // - NodeX (determining children) -> ... lots of children with "hide if no children" -> ...
+        // We check the nodes with "hide if no children" at most 2 at a time to prefer going deep into
+        // the hierarchy, where we're more likely to find an answer, rather than going wide.
+        2), log({
+            category: LOGGING_NAMESPACE,
+            message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: needs hide, determined children: ${hasChildren(n)}`,
+        }))).pipe(filter(hasChildren))).pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `out: ${createNodeIdentifierForLogging(n)}` }));
+    };
+}
+//# sourceMappingURL=HideIfNoChildren.js.map

package/lib/esm/hierarchies/internal/operators/HideIfNoChildren.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HideIfNoChildren.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/HideIfNoChildren.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAc,MAAM,MAAM,CAAC;AACvE,OAAO,EAAE,aAAa,EAAwF,MAAM,qBAAqB,CAAC;AAC1I,OAAO,EAAE,8BAA8B,EAAE,8BAA8B,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACxG,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,MAAM,aAAa,GAAG,kBAAkB,CAAC;AACzC,gBAAgB;AAChB,MAAM,CAAC,MAAM,iBAAiB,GAAG,8BAA8B,CAAC,aAAa,CAAC,CAAC;AAE/E;;;;GAIG;AACH,MAAM,UAAU,8BAA8B,CAAC,QAA+D;IAC5G,OAAO,UAAU,KAAyC;QACxD,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,8BAA8B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3J,6BAA6B;QAC7B,8FAA8F;QAC9F,kEAAkE;QAClE,sEAAsE;QACtE,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,GAAG,SAAS,CAC3C,UAAU,EACV,CAAC,CAAC,EAAsE,EAAE,CACxE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,gBAAgB,EAAE,gBAAgB,CAC5G,CAAC;QACF,MAAM,CAAC,kBAAkB,EAAE,oBAAoB,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;QACzG,OAAO,KAAK,CACV,cAAc,CAAC,IAAI,CACjB,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,qBAAqB,EAAE,CAAC,CAC3I,EACD,KAAK,CACH,kBAAkB,CAAC,IAAI,CACrB,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,4BAA4B,EAAE,CAAC,CAClJ,EACD,oBAAoB,CAAC,IAAI,CACvB,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,8BAA8B,EAAE,CAAC,EACnJ,QAAQ,CACN,CAAC,CAAC,EAAE,EAAE,CACJ,KAAK,CAAC,GAAG,EAAE;YACT,KAAK,CAAC;gBACJ,QAAQ,EAAE,iBAAiB;gBAC3B,OAAO,EAAE,0BAA0B,CAAC,GAAG,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,4BAA4B;aAC3G,CAAC,CAAC;YACH,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CACrB,GAAG,CAAC;gBACF,QAAQ,EAAE,iBAAiB;gBAC3B,OAAO,EAAE,0BAA0B,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,0BAA0B,YAAY,EAAE;aACnI,CAAC,EACF,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAClD,CAAC;QACJ,CAAC,CAAC;QACJ,kFAAkF;QAClF,sBAAsB;QACtB,2FAA2F;QAC3F,8FAA8F;QAC9F,oFAAoF;QACpF,CAAC,CACF,EACD,GAAG,CAAC;YACF,QAAQ,EAAE,iBAAiB;YAC3B,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,sCAAsC,WAAW,CAAC,CAAC,CAAC,EAAE;SACtI,CAAC,CACH,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAC5B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,8BAA8B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvI,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 { defer, filter, map, merge, mergeMap, Observable } from \"rxjs\";\nimport { HierarchyNode, ProcessedCustomHierarchyNode, ProcessedHierarchyNode, ProcessedInstanceHierarchyNode } from \"../../HierarchyNode\";\nimport { createNodeIdentifierForLogging, createOperatorLoggingNamespace, hasChildren } from \"../Common\";\nimport { doLog, log } from \"../LoggingUtils\";\nimport { partition } from \"./Partition\";\n\nconst OPERATOR_NAME = \"HideIfNoChildren\";\n/** @internal */\nexport const LOGGING_NAMESPACE = createOperatorLoggingNamespace(OPERATOR_NAME);\n\n/**\n * Creates an operator that hides nodes with no children if they have a `hideIfNoChildren` handling param.\n *\n * @internal\n */\nexport function createHideIfNoChildrenOperator(hasNodes: (node: ProcessedHierarchyNode) => Observable<boolean>) {\n  return function (nodes: Observable<ProcessedHierarchyNode>): Observable<ProcessedHierarchyNode> {\n    const inputNodes = nodes.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `in: ${createNodeIdentifierForLogging(n)}` }));\n    // split input into 3 pieces:\n    // - `doesntNeedHide` - nodes without the flag (return no matter if they have children or not)\n    // - `determinedChildren` - nodes with the flag and known children\n    // - `undeterminedChildren` - nodes with the flag and unknown children\n    const [needsHide, doesntNeedHide] = partition(\n      inputNodes,\n      (n): n is ProcessedCustomHierarchyNode | ProcessedInstanceHierarchyNode =>\n        (HierarchyNode.isCustom(n) || HierarchyNode.isInstancesNode(n)) && !!n.processingParams?.hideIfNoChildren,\n    );\n    const [determinedChildren, undeterminedChildren] = partition(needsHide, (n) => n.children !== undefined);\n    return merge(\n      doesntNeedHide.pipe(\n        log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: doesn't need hide` }),\n      ),\n      merge(\n        determinedChildren.pipe(\n          log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: needs hide, has children` }),\n        ),\n        undeterminedChildren.pipe(\n          log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: needs hide, needs children` }),\n          mergeMap(\n            (n) =>\n              defer(() => {\n                doLog({\n                  category: LOGGING_NAMESPACE,\n                  message: /* istanbul ignore next */ () => `${createNodeIdentifierForLogging(n)}: requesting children flag`,\n                });\n                return hasNodes(n).pipe(\n                  log({\n                    category: LOGGING_NAMESPACE,\n                    message: /* istanbul ignore next */ (childrenFlag) => `${createNodeIdentifierForLogging(n)}: determined children: ${childrenFlag}`,\n                  }),\n                  map((children) => Object.assign(n, { children })),\n                );\n              }),\n            // Sending child check requests for all nodes without any limit greatly slows down\n            // the following case:\n            // - NodeX (determining children) -> ... lots of children with \"hide if no children\" -> ...\n            // We check the nodes with \"hide if no children\" at most 2 at a time to prefer going deep into\n            // the hierarchy, where we're more likely to find an answer, rather than going wide.\n            2,\n          ),\n          log({\n            category: LOGGING_NAMESPACE,\n            message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)}: needs hide, determined children: ${hasChildren(n)}`,\n          }),\n        ),\n      ).pipe(filter(hasChildren)),\n    ).pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `out: ${createNodeIdentifierForLogging(n)}` }));\n  };\n}\n"]}

package/lib/esm/hierarchies/internal/operators/HideNodesInHierarchy.d.ts

@@ -0,0 +1,11 @@
+import { Observable } from "rxjs";
+import { ProcessedHierarchyNode } from "../../HierarchyNode";
+/** @internal */
+export declare const LOGGING_NAMESPACE: string;
+/**
+ * Creates an operator that hides nodes and instead returns their children if the nodes have a `hideInHierarchy` handling param.
+ *
+ * @internal
+ */
+export declare function createHideNodesInHierarchyOperator(getNodes: (parentNode: ProcessedHierarchyNode) => Observable<ProcessedHierarchyNode>, stopOnFirstChild: boolean): (nodes: Observable<ProcessedHierarchyNode>) => Observable<ProcessedHierarchyNode>;
+//# sourceMappingURL=HideNodesInHierarchy.d.ts.map

package/lib/esm/hierarchies/internal/operators/HideNodesInHierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HideNodesInHierarchy.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/HideNodesInHierarchy.ts"],"names":[],"mappings":"AAKA,OAAO,EAA0E,UAAU,EAAQ,MAAM,MAAM,CAAC;AAChH,OAAO,EAA+C,sBAAsB,EAAkC,MAAM,qBAAqB,CAAC;AAQ1I,gBAAgB;AAChB,eAAO,MAAM,iBAAiB,QAAgD,CAAC;AAE/E;;;;GAIG;AACH,wBAAgB,kCAAkC,CAChD,QAAQ,EAAE,CAAC,UAAU,EAAE,sBAAsB,KAAK,UAAU,CAAC,sBAAsB,CAAC,EACpF,gBAAgB,EAAE,OAAO,WAED,WAAW,sBAAsB,CAAC,KAAG,WAAW,sBAAsB,CAAC,CA2DhG"}

package/lib/esm/hierarchies/internal/operators/HideNodesInHierarchy.js

@@ -0,0 +1,51 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { concat, defer, EMPTY, filter, finalize, map, merge, mergeAll, mergeMap, take } from "rxjs";
+import { HierarchyNode } from "../../HierarchyNode";
+import { createNodeIdentifierForLogging, createOperatorLoggingNamespace, hasChildren, mergeNodes } from "../Common";
+import { doLog, log } from "../LoggingUtils";
+import { partition } from "./Partition";
+import { reduceToMergeMapItem } from "./ReduceToMergeMap";
+const OPERATOR_NAME = "HideNodesInHierarchy";
+/** @internal */
+export const LOGGING_NAMESPACE = createOperatorLoggingNamespace(OPERATOR_NAME);
+/**
+ * Creates an operator that hides nodes and instead returns their children if the nodes have a `hideInHierarchy` handling param.
+ *
+ * @internal
+ */
+export function createHideNodesInHierarchyOperator(getNodes, stopOnFirstChild) {
+    return function (nodes) {
+        const inputNodes = nodes.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `in: ${createNodeIdentifierForLogging(n)}` }));
+        const [withFlag, withoutFlag] = partition(inputNodes, (n) => (HierarchyNode.isCustom(n) || HierarchyNode.isInstancesNode(n)) && !!n.processingParams?.hideInHierarchy);
+        // Defer to create a new seed for reduce on every subscribe
+        const withLoadedChildren = defer(() => withFlag.pipe(log({
+            category: LOGGING_NAMESPACE,
+            message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)} needs hide and needs children to be loaded`,
+        }), filter((node) => node.children !== false), reduceToMergeMapItem((node) => createMergeMapKey(node), (node, mergedNode) => (mergedNode ? mergeNodes(mergedNode, node) : node)), log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (mm) => `created a merge map of size ${mm.size}` }), mergeMap((mm) => [...mm.values()].map((mergedNode) => defer(() => getNodes(mergedNode)))), mergeAll(), map((n) => n)));
+        return merge(withoutFlag.pipe(log({
+            category: LOGGING_NAMESPACE,
+            message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)} doesn't need hide, return the node`,
+        })), stopOnFirstChild
+            ? concat(
+            // a small hack to handle situation when we're here to only check if parent node has children and one of them has `hideIfNoChildren` flag
+            // with a `hasChildren = true` - we just return the hidden node itself in that case to avoid digging deeper into the hierarchy
+            inputNodes.pipe(filter(hasChildren), log({
+                category: LOGGING_NAMESPACE,
+                message: /* istanbul ignore next */ (n) => `\`stopOnFirstChild = true\` and node ${createNodeIdentifierForLogging(n)} is set to always have nodes - return the hidden node without loading children`,
+            })), EMPTY.pipe(finalize(() => doLog({
+                category: LOGGING_NAMESPACE,
+                message: /* istanbul ignore next */ () => `\`stopOnFirstChild = true\` but none of the nodes had children determined to \`true\` - do load children`,
+            }))), withLoadedChildren).pipe(take(1))
+            : withLoadedChildren).pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `out: ${createNodeIdentifierForLogging(n)}` }));
+    };
+}
+function createMergeMapKey(node) {
+    if (typeof node.key === "string") {
+        return node.key;
+    }
+    return node.key.instanceKeys[0].className;
+}
+//# sourceMappingURL=HideNodesInHierarchy.js.map

package/lib/esm/hierarchies/internal/operators/HideNodesInHierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HideNodesInHierarchy.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/HideNodesInHierarchy.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAc,IAAI,EAAE,MAAM,MAAM,CAAC;AAChH,OAAO,EAAE,aAAa,EAAwF,MAAM,qBAAqB,CAAC;AAE1I,OAAO,EAAE,8BAA8B,EAAE,8BAA8B,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpH,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAE1D,MAAM,aAAa,GAAG,sBAAsB,CAAC;AAC7C,gBAAgB;AAChB,MAAM,CAAC,MAAM,iBAAiB,GAAG,8BAA8B,CAAC,aAAa,CAAC,CAAC;AAE/E;;;;GAIG;AACH,MAAM,UAAU,kCAAkC,CAChD,QAAoF,EACpF,gBAAyB;IAEzB,OAAO,UAAU,KAAyC;QACxD,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,8BAA8B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3J,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,GAAG,SAAS,CACvC,UAAU,EACV,CAAC,CAAC,EAAsE,EAAE,CACxE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,gBAAgB,EAAE,eAAe,CAC3G,CAAC;QACF,2DAA2D;QAC3D,MAAM,kBAAkB,GAAG,KAAK,CAAC,GAAG,EAAE,CACpC,QAAQ,CAAC,IAAI,CACX,GAAG,CAAC;YACF,QAAQ,EAAE,iBAAiB;YAC3B,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,6CAA6C;SAC7H,CAAC,EACF,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,EACzC,oBAAoB,CAClB,CAAC,IAAI,EAAE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,EACjC,CAAC,IAAI,EAAE,UAAqF,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CACpJ,EACD,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,+BAA+B,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAC1H,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzF,QAAQ,EAAE,EACV,GAAG,CAAC,CAAC,CAAC,EAA0B,EAAE,CAAC,CAAC,CAAC,CACtC,CACF,CAAC;QAEF,OAAO,KAAK,CACV,WAAW,CAAC,IAAI,CACd,GAAG,CAAC;YACF,QAAQ,EAAE,iBAAiB;YAC3B,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,8BAA8B,CAAC,CAAC,CAAC,qCAAqC;SACrH,CAAC,CACH,EACD,gBAAgB;YACd,CAAC,CAAC,MAAM;YACJ,yIAAyI;YACzI,8HAA8H;YAC9H,UAAU,CAAC,IAAI,CACb,MAAM,CAAC,WAAW,CAAC,EACnB,GAAG,CAAC;gBACF,QAAQ,EAAE,iBAAiB;gBAC3B,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CACxC,wCAAwC,8BAA8B,CAAC,CAAC,CAAC,gFAAgF;aAC5J,CAAC,CACH,EACD,KAAK,CAAC,IAAI,CACR,QAAQ,CAAC,GAAG,EAAE,CACZ,KAAK,CAAC;gBACJ,QAAQ,EAAE,iBAAiB;gBAC3B,OAAO,EAAE,0BAA0B,CAAC,GAAG,EAAE,CACvC,0GAA0G;aAC7G,CAAC,CACH,CACF,EACD,kBAAkB,CACnB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC,CAAC,kBAAkB,CACvB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,8BAA8B,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvI,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CAAmD,IAAW;IACtF,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,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 { concat, defer, EMPTY, filter, finalize, map, merge, mergeAll, mergeMap, Observable, take } from \"rxjs\";\nimport { HierarchyNode, ProcessedCustomHierarchyNode, ProcessedHierarchyNode, ProcessedInstanceHierarchyNode } from \"../../HierarchyNode\";\nimport { InstancesNodeKey } from \"../../HierarchyNodeKey\";\nimport { createNodeIdentifierForLogging, createOperatorLoggingNamespace, hasChildren, mergeNodes } from \"../Common\";\nimport { doLog, log } from \"../LoggingUtils\";\nimport { partition } from \"./Partition\";\nimport { reduceToMergeMapItem } from \"./ReduceToMergeMap\";\n\nconst OPERATOR_NAME = \"HideNodesInHierarchy\";\n/** @internal */\nexport const LOGGING_NAMESPACE = createOperatorLoggingNamespace(OPERATOR_NAME);\n\n/**\n * Creates an operator that hides nodes and instead returns their children if the nodes have a `hideInHierarchy` handling param.\n *\n * @internal\n */\nexport function createHideNodesInHierarchyOperator(\n  getNodes: (parentNode: ProcessedHierarchyNode) => Observable<ProcessedHierarchyNode>,\n  stopOnFirstChild: boolean,\n) {\n  return function (nodes: Observable<ProcessedHierarchyNode>): Observable<ProcessedHierarchyNode> {\n    const inputNodes = nodes.pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `in: ${createNodeIdentifierForLogging(n)}` }));\n    const [withFlag, withoutFlag] = partition(\n      inputNodes,\n      (n): n is ProcessedCustomHierarchyNode | ProcessedInstanceHierarchyNode =>\n        (HierarchyNode.isCustom(n) || HierarchyNode.isInstancesNode(n)) && !!n.processingParams?.hideInHierarchy,\n    );\n    // Defer to create a new seed for reduce on every subscribe\n    const withLoadedChildren = defer(() =>\n      withFlag.pipe(\n        log({\n          category: LOGGING_NAMESPACE,\n          message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)} needs hide and needs children to be loaded`,\n        }),\n        filter((node) => node.children !== false),\n        reduceToMergeMapItem(\n          (node) => createMergeMapKey(node),\n          (node, mergedNode: ProcessedCustomHierarchyNode | ProcessedInstanceHierarchyNode | undefined) => (mergedNode ? mergeNodes(mergedNode, node) : node),\n        ),\n        log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (mm) => `created a merge map of size ${mm.size}` }),\n        mergeMap((mm) => [...mm.values()].map((mergedNode) => defer(() => getNodes(mergedNode)))),\n        mergeAll(),\n        map((n): ProcessedHierarchyNode => n),\n      ),\n    );\n\n    return merge(\n      withoutFlag.pipe(\n        log({\n          category: LOGGING_NAMESPACE,\n          message: /* istanbul ignore next */ (n) => `${createNodeIdentifierForLogging(n)} doesn't need hide, return the node`,\n        }),\n      ),\n      stopOnFirstChild\n        ? concat(\n            // a small hack to handle situation when we're here to only check if parent node has children and one of them has `hideIfNoChildren` flag\n            // with a `hasChildren = true` - we just return the hidden node itself in that case to avoid digging deeper into the hierarchy\n            inputNodes.pipe(\n              filter(hasChildren),\n              log({\n                category: LOGGING_NAMESPACE,\n                message: /* istanbul ignore next */ (n) =>\n                  `\\`stopOnFirstChild = true\\` and node ${createNodeIdentifierForLogging(n)} is set to always have nodes - return the hidden node without loading children`,\n              }),\n            ),\n            EMPTY.pipe(\n              finalize(() =>\n                doLog({\n                  category: LOGGING_NAMESPACE,\n                  message: /* istanbul ignore next */ () =>\n                    `\\`stopOnFirstChild = true\\` but none of the nodes had children determined to \\`true\\` - do load children`,\n                }),\n              ),\n            ),\n            withLoadedChildren,\n          ).pipe(take(1))\n        : withLoadedChildren,\n    ).pipe(log({ category: LOGGING_NAMESPACE, message: /* istanbul ignore next */ (n) => `out: ${createNodeIdentifierForLogging(n)}` }));\n  };\n}\n\nfunction createMergeMapKey<TNode extends { key: InstancesNodeKey | string }>(node: TNode): string {\n  if (typeof node.key === \"string\") {\n    return node.key;\n  }\n  return node.key.instanceKeys[0].className;\n}\n"]}

package/lib/esm/hierarchies/internal/operators/Partition.d.ts

@@ -0,0 +1,6 @@
+import { Observable, ObservableInput } from "rxjs";
+/** @internal */
+export declare function partition<T, U extends T>(source: ObservableInput<T>, predicate: (value: T) => value is U): [Observable<U>, Observable<Exclude<T, U>>];
+/** @internal */
+export declare function partition<T>(source: ObservableInput<T>, predicate: (value: T) => boolean): [Observable<T>, Observable<T>];
+//# sourceMappingURL=Partition.d.ts.map

package/lib/esm/hierarchies/internal/operators/Partition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Partition.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Partition.ts"],"names":[],"mappings":"AAKA,OAAO,EAAQ,UAAU,EAAE,eAAe,EAA+B,MAAM,MAAM,CAAC;AAGtF,gBAAgB;AAChB,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACvJ,gBAAgB;AAChB,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC"}

package/lib/esm/hierarchies/internal/operators/Partition.js

@@ -0,0 +1,57 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { from, Observable, ReplaySubject } from "rxjs";
+import { assert } from "@itwin/core-bentley";
+/**
+ * This is similar to `rxjs` `partition` operator, but it subscribes to source observable only once.
+ * @internal
+ */
+export function partition(source, predicate) {
+    const matches = new ReplaySubject();
+    const nonMatches = new ReplaySubject();
+    let sourceSubscription;
+    let sourceSubscriptionsCount = 0;
+    function subscribeToSource() {
+        if (sourceSubscriptionsCount++ > 0) {
+            return;
+        }
+        assert(!sourceSubscription);
+        sourceSubscription = from(source).subscribe({
+            next(value) {
+                if (predicate(value)) {
+                    matches.next(value);
+                }
+                else {
+                    nonMatches.next(value);
+                }
+            },
+            error(error) {
+                matches.error(error);
+                nonMatches.error(error);
+            },
+            complete() {
+                matches.complete();
+                nonMatches.complete();
+            },
+        });
+    }
+    function unsubscribeFromSource() {
+        assert(sourceSubscriptionsCount > 0);
+        if (--sourceSubscriptionsCount === 0) {
+            assert(!!sourceSubscription);
+            sourceSubscription.unsubscribe();
+            sourceSubscription = undefined;
+        }
+    }
+    return [matches, nonMatches].map((subject) => new Observable((subscriber) => {
+        const subjectSubscription = subject.subscribe(subscriber);
+        subscribeToSource();
+        return () => {
+            subjectSubscription.unsubscribe();
+            unsubscribeFromSource();
+        };
+    }));
+}
+//# sourceMappingURL=Partition.js.map

package/lib/esm/hierarchies/internal/operators/Partition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Partition.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Partition.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,IAAI,EAAE,UAAU,EAAmB,aAAa,EAAgB,MAAM,MAAM,CAAC;AACtF,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAO7C;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAI,MAA0B,EAAE,SAAgC;IACvF,MAAM,OAAO,GAAG,IAAI,aAAa,EAAK,CAAC;IACvC,MAAM,UAAU,GAAG,IAAI,aAAa,EAAK,CAAC;IAC1C,IAAI,kBAA4C,CAAC;IACjD,IAAI,wBAAwB,GAAG,CAAC,CAAC;IACjC,SAAS,iBAAiB;QACxB,IAAI,wBAAwB,EAAE,GAAG,CAAC,EAAE,CAAC;YACnC,OAAO;QACT,CAAC;QACD,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAC5B,kBAAkB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC;YAC1C,IAAI,CAAC,KAAK;gBACR,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,KAAK;gBACT,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACrB,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;YACD,QAAQ;gBACN,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,UAAU,CAAC,QAAQ,EAAE,CAAC;YACxB,CAAC;SACF,CAAC,CAAC;IACL,CAAC;IACD,SAAS,qBAAqB;QAC5B,MAAM,CAAC,wBAAwB,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,EAAE,wBAAwB,KAAK,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;YAC7B,kBAAkB,CAAC,WAAW,EAAE,CAAC;YACjC,kBAAkB,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,GAAG,CAC9B,CAAC,OAAO,EAAE,EAAE,CACV,IAAI,UAAU,CAAC,CAAC,UAAU,EAAE,EAAE;QAC5B,MAAM,mBAAmB,GAAG,OAAO,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC1D,iBAAiB,EAAE,CAAC;QACpB,OAAO,GAAG,EAAE;YACV,mBAAmB,CAAC,WAAW,EAAE,CAAC;YAClC,qBAAqB,EAAE,CAAC;QAC1B,CAAC,CAAC;IACJ,CAAC,CAAC,CAC6B,CAAC;AACtC,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 { from, Observable, ObservableInput, ReplaySubject, Subscription } from \"rxjs\";\nimport { assert } from \"@itwin/core-bentley\";\n\n/** @internal */\nexport function partition<T, U extends T>(source: ObservableInput<T>, predicate: (value: T) => value is U): [Observable<U>, Observable<Exclude<T, U>>];\n/** @internal */\nexport function partition<T>(source: ObservableInput<T>, predicate: (value: T) => boolean): [Observable<T>, Observable<T>];\n\n/**\n * This is similar to `rxjs` `partition` operator, but it subscribes to source observable only once.\n * @internal\n */\nexport function partition<T>(source: ObservableInput<T>, predicate: (value: T) => boolean): [Observable<T>, Observable<T>] {\n  const matches = new ReplaySubject<T>();\n  const nonMatches = new ReplaySubject<T>();\n  let sourceSubscription: Subscription | undefined;\n  let sourceSubscriptionsCount = 0;\n  function subscribeToSource() {\n    if (sourceSubscriptionsCount++ > 0) {\n      return;\n    }\n    assert(!sourceSubscription);\n    sourceSubscription = from(source).subscribe({\n      next(value) {\n        if (predicate(value)) {\n          matches.next(value);\n        } else {\n          nonMatches.next(value);\n        }\n      },\n      error(error) {\n        matches.error(error);\n        nonMatches.error(error);\n      },\n      complete() {\n        matches.complete();\n        nonMatches.complete();\n      },\n    });\n  }\n  function unsubscribeFromSource() {\n    assert(sourceSubscriptionsCount > 0);\n    if (--sourceSubscriptionsCount === 0) {\n      assert(!!sourceSubscription);\n      sourceSubscription.unsubscribe();\n      sourceSubscription = undefined;\n    }\n  }\n  return [matches, nonMatches].map(\n    (subject) =>\n      new Observable((subscriber) => {\n        const subjectSubscription = subject.subscribe(subscriber);\n        subscribeToSource();\n        return () => {\n          subjectSubscription.unsubscribe();\n          unsubscribeFromSource();\n        };\n      }),\n  ) as [Observable<T>, Observable<T>];\n}\n"]}

package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.d.ts

@@ -0,0 +1,22 @@
+import { ObservableInput } from "rxjs";
+/**
+ * Reduces the source observable into a `Map<string, TMapItem[]>`, where all input items are grouped based on their key
+ * and placed into arrays.
+ *
+ * @param key A function to calculate map key for the item.
+ * @param value A function to calculate entry value for the item.
+ *
+ * @internal
+ */
+export declare function reduceToMergeMapList<TSourceItem, TMapItem>(key: (item: TSourceItem) => string, value: (item: TSourceItem) => TMapItem): (source: ObservableInput<TSourceItem>) => import("rxjs").Observable<Map<string, TMapItem[]>>;
+/**
+ * Reduces the source observable into a `Map<string, TMapItem>`, where all input items are grouped based on their key
+ * and merged into a single value using provided merge function.
+ *
+ * @param key A function to calculate map key for the item.
+ * @param value A function to create map value using the _current_ item and an item already _existing_ in the map with the same key.
+ *
+ * @internal
+ */
+export declare function reduceToMergeMapItem<TSourceItem, TMapItem>(key: (item: TSourceItem) => string, mergeFunc: (sourceItem: TSourceItem, mapItem: TMapItem | undefined) => TMapItem): (source: ObservableInput<TSourceItem>) => import("rxjs").Observable<Map<string, TMapItem>>;
+//# sourceMappingURL=ReduceToMergeMap.d.ts.map

package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReduceToMergeMap.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReduceToMergeMap.ts"],"names":[],"mappings":"AAKA,OAAO,EAAQ,eAAe,EAAU,MAAM,MAAM,CAAC;AAErD;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,WAAW,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,MAAM,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,QAAQ,gGAQrI;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,WAAW,EAAE,QAAQ,EACxD,GAAG,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,MAAM,EAClC,SAAS,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,GAAG,SAAS,KAAK,QAAQ,YAE/D,gBAAgB,WAAW,CAAC,sDAa7C"}

package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.js

@@ -0,0 +1,46 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { from, reduce } from "rxjs";
+/**
+ * Reduces the source observable into a `Map<string, TMapItem[]>`, where all input items are grouped based on their key
+ * and placed into arrays.
+ *
+ * @param key A function to calculate map key for the item.
+ * @param value A function to calculate entry value for the item.
+ *
+ * @internal
+ */
+export function reduceToMergeMapList(key, value) {
+    return reduceToMergeMapItem(key, (item, list) => {
+        if (!list) {
+            list = [];
+        }
+        list.push(value(item));
+        return list;
+    });
+}
+/**
+ * Reduces the source observable into a `Map<string, TMapItem>`, where all input items are grouped based on their key
+ * and merged into a single value using provided merge function.
+ *
+ * @param key A function to calculate map key for the item.
+ * @param value A function to create map value using the _current_ item and an item already _existing_ in the map with the same key.
+ *
+ * @internal
+ */
+export function reduceToMergeMapItem(key, mergeFunc) {
+    return (source) => from(source).pipe(reduce((mergedMap, item) => {
+        if (mergedMap === EMPTY_MAP) {
+            // this helps us avoid creating an empty map for cases when source observable
+            // doesn't emit any values
+            mergedMap = new Map();
+        }
+        const mergeKey = key(item);
+        mergedMap.set(mergeKey, mergeFunc(item, mergedMap.get(mergeKey)));
+        return mergedMap;
+    }, EMPTY_MAP));
+}
+const EMPTY_MAP = new Map();
+//# sourceMappingURL=ReduceToMergeMap.js.map

package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReduceToMergeMap.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReduceToMergeMap.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,IAAI,EAAmB,MAAM,EAAE,MAAM,MAAM,CAAC;AAErD;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAwB,GAAkC,EAAE,KAAsC;IACpI,OAAO,oBAAoB,CAA0B,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;QACvE,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,GAAkC,EAClC,SAA+E;IAE/E,OAAO,CAAC,MAAoC,EAAE,EAAE,CAC9C,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CACf,MAAM,CAAqC,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE;QAC7D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,6EAA6E;YAC7E,0BAA0B;YAC1B,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClE,OAAO,SAAS,CAAC;IACnB,CAAC,EAAE,SAAS,CAAC,CACd,CAAC;AACN,CAAC;AACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,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 { from, ObservableInput, reduce } from \"rxjs\";\n\n/**\n * Reduces the source observable into a `Map<string, TMapItem[]>`, where all input items are grouped based on their key\n * and placed into arrays.\n *\n * @param key A function to calculate map key for the item.\n * @param value A function to calculate entry value for the item.\n *\n * @internal\n */\nexport function reduceToMergeMapList<TSourceItem, TMapItem>(key: (item: TSourceItem) => string, value: (item: TSourceItem) => TMapItem) {\n  return reduceToMergeMapItem<TSourceItem, TMapItem[]>(key, (item, list) => {\n    if (!list) {\n      list = [];\n    }\n    list.push(value(item));\n    return list;\n  });\n}\n\n/**\n * Reduces the source observable into a `Map<string, TMapItem>`, where all input items are grouped based on their key\n * and merged into a single value using provided merge function.\n *\n * @param key A function to calculate map key for the item.\n * @param value A function to create map value using the _current_ item and an item already _existing_ in the map with the same key.\n *\n * @internal\n */\nexport function reduceToMergeMapItem<TSourceItem, TMapItem>(\n  key: (item: TSourceItem) => string,\n  mergeFunc: (sourceItem: TSourceItem, mapItem: TMapItem | undefined) => TMapItem,\n) {\n  return (source: ObservableInput<TSourceItem>) =>\n    from(source).pipe(\n      reduce<TSourceItem, Map<string, TMapItem>>((mergedMap, item) => {\n        if (mergedMap === EMPTY_MAP) {\n          // this helps us avoid creating an empty map for cases when source observable\n          // doesn't emit any values\n          mergedMap = new Map();\n        }\n        const mergeKey = key(item);\n        mergedMap.set(mergeKey, mergeFunc(item, mergedMap.get(mergeKey)));\n        return mergedMap;\n      }, EMPTY_MAP),\n    );\n}\nconst EMPTY_MAP = new Map();\n"]}

package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.d.ts

@@ -0,0 +1,7 @@
+import { Observable } from "rxjs";
+/**
+ * Emits a certain amount of values, then releases the main thread for other timers to use.
+ * @internal
+ */
+export declare function releaseMainThreadOnItemsCount<T>(elementCount: number): (obs: Observable<T>) => Observable<T>;
+//# sourceMappingURL=ReleaseMainThread.d.ts.map

package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReleaseMainThread.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReleaseMainThread.ts"],"names":[],"mappings":"AAKA,OAAO,EAA4C,UAAU,EAAM,MAAM,MAAM,CAAC;AAEhF;;;GAGG;AACH,wBAAgB,6BAA6B,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,SACtD,WAAW,CAAC,CAAC,KAAG,WAAW,CAAC,CAAC,CAa3C"}

package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.js

@@ -0,0 +1,21 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { bufferCount, concatAll, concatMap, delay, of } from "rxjs";
+/**
+ * Emits a certain amount of values, then releases the main thread for other timers to use.
+ * @internal
+ */
+export function releaseMainThreadOnItemsCount(elementCount) {
+    return (obs) => {
+        return obs.pipe(bufferCount(elementCount), concatMap((buff, i) => {
+            const out = of(buff);
+            if (i === 0 && buff.length < elementCount) {
+                return out;
+            }
+            return out.pipe(delay(0));
+        }), concatAll());
+    };
+}
+//# sourceMappingURL=ReleaseMainThread.js.map

package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReleaseMainThread.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReleaseMainThread.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAc,EAAE,EAAE,MAAM,MAAM,CAAC;AAEhF;;;GAGG;AACH,MAAM,UAAU,6BAA6B,CAAI,YAAoB;IACnE,OAAO,CAAC,GAAkB,EAAiB,EAAE;QAC3C,OAAO,GAAG,CAAC,IAAI,CACb,WAAW,CAAC,YAAY,CAAC,EACzB,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,GAAG,GAAG,EAAE,CAAC,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,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,EACF,SAAS,EAAE,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, Observable, of } from \"rxjs\";\n\n/**\n * Emits a certain amount of values, then releases the main thread for other timers to use.\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"]}

package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.d.ts

@@ -0,0 +1,9 @@
+import { MonoTypeOperatorFunction } from "rxjs";
+/**
+ * This is doing exactly the same as the standard `shareReplay` from `rxjs`, except that
+ * source is not retried on error.
+ *
+ * @internal
+ */
+export declare function shareReplayWithErrors<T>(): MonoTypeOperatorFunction<T>;
+//# sourceMappingURL=ShareReplayWithErrors.d.ts.map

package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShareReplayWithErrors.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ShareReplayWithErrors.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,wBAAwB,EAAwB,MAAM,MAAM,CAAC;AAEtE;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,KAAK,wBAAwB,CAAC,CAAC,CAAC,CAOtE"}

package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.js

@@ -0,0 +1,20 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { ReplaySubject, share } from "rxjs";
+/**
+ * This is doing exactly the same as the standard `shareReplay` from `rxjs`, except that
+ * source is not retried on error.
+ *
+ * @internal
+ */
+export function shareReplayWithErrors() {
+    return share({
+        connector: () => new ReplaySubject(),
+        resetOnError: false,
+        resetOnComplete: false,
+        resetOnRefCountZero: false,
+    });
+}
+//# sourceMappingURL=ShareReplayWithErrors.js.map

package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShareReplayWithErrors.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ShareReplayWithErrors.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAA4B,aAAa,EAAE,KAAK,EAAE,MAAM,MAAM,CAAC;AAEtE;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB;IACnC,OAAO,KAAK,CAAI;QACd,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI,aAAa,EAAE;QACpC,YAAY,EAAE,KAAK;QACnB,eAAe,EAAE,KAAK;QACtB,mBAAmB,EAAE,KAAK;KAC3B,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 { MonoTypeOperatorFunction, ReplaySubject, share } from \"rxjs\";\n\n/**\n * This is doing exactly the same as the standard `shareReplay` from `rxjs`, except that\n * source is not retried on error.\n *\n * @internal\n */\nexport function shareReplayWithErrors<T>(): MonoTypeOperatorFunction<T> {\n  return share<T>({\n    connector: () => new ReplaySubject(),\n    resetOnError: false,\n    resetOnComplete: false,\n    resetOnRefCountZero: false,\n  });\n}\n"]}

package/lib/esm/hierarchies/internal/operators/Sorting.d.ts

@@ -0,0 +1,12 @@
+import { Observable } from "rxjs";
+import { ProcessedHierarchyNode } from "../../HierarchyNode";
+/**
+ * This should accept sorting params in some form:
+ * - is sorting disabled?
+ * - are we sorting by label or some property value, in case of the latter - how do we get the value?
+ *
+ * @note Nodes with same labels are returned in undefined order.
+ * @internal
+ */
+export declare function sortNodesByLabelOperator(nodes: Observable<ProcessedHierarchyNode>): Observable<ProcessedHierarchyNode>;
+//# sourceMappingURL=Sorting.d.ts.map

package/lib/esm/hierarchies/internal/operators/Sorting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Sorting.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Sorting.ts"],"names":[],"mappings":"AAKA,OAAO,EAAkB,UAAU,EAAU,MAAM,MAAM,CAAC;AAE1D,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAG7D;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,UAAU,CAAC,sBAAsB,CAAC,GAAG,UAAU,CAAC,sBAAsB,CAAC,CAYtH"}

package/lib/esm/hierarchies/internal/operators/Sorting.js

@@ -0,0 +1,22 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { concatAll, map, reduce } from "rxjs";
+import { DuplicatePolicy, SortedArray } from "@itwin/core-bentley";
+import { compareNodesByLabel } from "../Common";
+/**
+ * This should accept sorting params in some form:
+ * - is sorting disabled?
+ * - are we sorting by label or some property value, in case of the latter - how do we get the value?
+ *
+ * @note Nodes with same labels are returned in undefined order.
+ * @internal
+ */
+export function sortNodesByLabelOperator(nodes) {
+    return nodes.pipe(reduce((sorted, node) => {
+        sorted.insert(node);
+        return sorted;
+    }, new SortedArray(compareNodesByLabel, DuplicatePolicy.Allow)), map((sortedArray) => sortedArray.extractArray()), concatAll());
+}
+//# sourceMappingURL=Sorting.js.map

package/lib/esm/hierarchies/internal/operators/Sorting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Sorting.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Sorting.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,SAAS,EAAE,GAAG,EAAc,MAAM,EAAE,MAAM,MAAM,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEnE,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAEhD;;;;;;;GAOG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAyC;IAChF,OAAO,KAAK,CAAC,IAAI,CACf,MAAM,CACJ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;QACf,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC,EACD,IAAI,WAAW,CAAyB,mBAAmB,EAAE,eAAe,CAAC,KAAK,CAAC,CACpF,EACD,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC,EAChD,SAAS,EAAE,CACZ,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 { concatAll, map, Observable, reduce } from \"rxjs\";\nimport { DuplicatePolicy, SortedArray } from \"@itwin/core-bentley\";\nimport { ProcessedHierarchyNode } from \"../../HierarchyNode\";\nimport { compareNodesByLabel } from \"../Common\";\n\n/**\n * This should accept sorting params in some form:\n * - is sorting disabled?\n * - are we sorting by label or some property value, in case of the latter - how do we get the value?\n *\n * @note Nodes with same labels are returned in undefined order.\n * @internal\n */\nexport function sortNodesByLabelOperator(nodes: Observable<ProcessedHierarchyNode>): Observable<ProcessedHierarchyNode> {\n  return nodes.pipe(\n    reduce(\n      (sorted, node) => {\n        sorted.insert(node);\n        return sorted;\n      },\n      new SortedArray<ProcessedHierarchyNode>(compareNodesByLabel, DuplicatePolicy.Allow),\n    ),\n    map((sortedArray) => sortedArray.extractArray()),\n    concatAll(),\n  );\n}\n"]}

package/lib/esm/hierarchies/internal/operators/TapOnce.d.ts

@@ -0,0 +1,4 @@
+import { MonoTypeOperatorFunction } from "rxjs";
+/** @internal */
+export declare function tapOnce<T>(observer: () => void): MonoTypeOperatorFunction<T>;
+//# sourceMappingURL=TapOnce.d.ts.map

package/lib/esm/hierarchies/internal/operators/TapOnce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TapOnce.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/TapOnce.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,wBAAwB,EAAO,MAAM,MAAM,CAAC;AAErD,gBAAgB;AAChB,wBAAgB,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,IAAI,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAW5E"}

package/lib/esm/hierarchies/internal/operators/TapOnce.js

@@ -0,0 +1,16 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { tap } from "rxjs";
+/** @internal */
+export function tapOnce(observer) {
+    let first = true;
+    return (source) => source.pipe(tap(() => {
+        if (first) {
+            first = false;
+            observer();
+        }
+    }));
+}
+//# sourceMappingURL=TapOnce.js.map

package/lib/esm/hierarchies/internal/operators/TapOnce.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TapOnce.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/TapOnce.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAA4B,GAAG,EAAE,MAAM,MAAM,CAAC;AAErD,gBAAgB;AAChB,MAAM,UAAU,OAAO,CAAI,QAAoB;IAC7C,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,OAAO,CAAC,MAAM,EAAE,EAAE,CAChB,MAAM,CAAC,IAAI,CACT,GAAG,CAAC,GAAG,EAAE;QACP,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,GAAG,KAAK,CAAC;YACd,QAAQ,EAAE,CAAC;QACb,CAAC;IACH,CAAC,CAAC,CACH,CAAC;AACN,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 { MonoTypeOperatorFunction, tap } from \"rxjs\";\n\n/** @internal */\nexport function tapOnce<T>(observer: () => void): MonoTypeOperatorFunction<T> {\n  let first = true;\n  return (source) =>\n    source.pipe(\n      tap(() => {\n        if (first) {\n          first = false;\n          observer();\n        }\n      }),\n    );\n}\n"]}

package/lib/esm/hierarchies/internal/operators/grouping/AutoExpand.d.ts

@@ -0,0 +1,4 @@
+import { GroupingHandlerResult } from "../Grouping";
+/** @internal */
+export declare function assignAutoExpand(props: GroupingHandlerResult): GroupingHandlerResult;
+//# sourceMappingURL=AutoExpand.d.ts.map

package/lib/esm/hierarchies/internal/operators/grouping/AutoExpand.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AutoExpand.d.ts","sourceRoot":"","sources":["../../../../../../src/hierarchies/internal/operators/grouping/AutoExpand.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAGpD,gBAAgB;AAChB,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,qBAAqB,GAAG,qBAAqB,CAepF"}

package/lib/esm/hierarchies/internal/operators/grouping/AutoExpand.js

@@ -0,0 +1,23 @@
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+import { iterateChildNodeGroupingParams } from "./Shared";
+/** @internal */
+export function assignAutoExpand(props) {
+    for (const node of props.grouped) {
+        let autoExpandProp;
+        iterateChildNodeGroupingParams(node, props.groupingType, (groupingProps) => {
+            if (autoExpandProp === "always") {
+                return true;
+            }
+            autoExpandProp = groupingProps?.autoExpand ? groupingProps.autoExpand : autoExpandProp;
+            return;
+        });
+        if (autoExpandProp === "always" || (autoExpandProp === "single-child" && node.children.length === 1)) {
+            node.autoExpand = true;
+        }
+    }
+    return props;
+}
+//# sourceMappingURL=AutoExpand.js.map

package/lib/esm/hierarchies/internal/operators/grouping/AutoExpand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AutoExpand.js","sourceRoot":"","sources":["../../../../../../src/hierarchies/internal/operators/grouping/AutoExpand.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAIhG,OAAO,EAAE,8BAA8B,EAAE,MAAM,UAAU,CAAC;AAE1D,gBAAgB;AAChB,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QACjC,IAAI,cAAuD,CAAC;QAC5D,8BAA8B,CAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,CAAC,aAAa,EAAE,EAAE;YACzE,IAAI,cAAc,KAAK,QAAQ,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,cAAc,GAAG,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC;YACvF,OAAO;QACT,CAAC,CAAC,CAAC;QACH,IAAI,cAAc,KAAK,QAAQ,IAAI,CAAC,cAAc,KAAK,cAAc,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;YACrG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { HierarchyNodeAutoExpandProp } from \"../../../HierarchyNode\";\nimport { GroupingHandlerResult } from \"../Grouping\";\nimport { iterateChildNodeGroupingParams } from \"./Shared\";\n\n/** @internal */\nexport function assignAutoExpand(props: GroupingHandlerResult): GroupingHandlerResult {\n  for (const node of props.grouped) {\n    let autoExpandProp: HierarchyNodeAutoExpandProp | undefined;\n    iterateChildNodeGroupingParams(node, props.groupingType, (groupingProps) => {\n      if (autoExpandProp === \"always\") {\n        return true;\n      }\n      autoExpandProp = groupingProps?.autoExpand ? groupingProps.autoExpand : autoExpandProp;\n      return;\n    });\n    if (autoExpandProp === \"always\" || (autoExpandProp === \"single-child\" && node.children.length === 1)) {\n      node.autoExpand = true;\n    }\n  }\n  return props;\n}\n"]}

package/lib/esm/hierarchies/internal/operators/grouping/BaseClassGrouping.d.ts

@@ -0,0 +1,10 @@
+import { EC, ECClassHierarchyInspector, ECSchemaProvider } from "@itwin/presentation-shared";
+import { ParentHierarchyNode, ProcessedInstanceHierarchyNode } from "../../../HierarchyNode";
+import { GroupingHandler, GroupingHandlerResult } from "../Grouping";
+/** @internal */
+export declare function getBaseClassGroupingECClasses(schemaProvider: ECSchemaProvider, parentNode: ParentHierarchyNode | undefined, nodes: ProcessedInstanceHierarchyNode[]): Promise<EC.Class[]>;
+/** @internal */
+export declare function createBaseClassGroupsForSingleBaseClass(nodes: ProcessedInstanceHierarchyNode[], baseECClass: EC.Class, classHierarchyInspector: ECClassHierarchyInspector): Promise<GroupingHandlerResult>;
+/** @internal */
+export declare function createBaseClassGroupingHandlers(imodelAccess: ECSchemaProvider & ECClassHierarchyInspector, parentNode: ParentHierarchyNode | undefined, nodes: ProcessedInstanceHierarchyNode[]): Promise<GroupingHandler[]>;
+//# sourceMappingURL=BaseClassGrouping.d.ts.map

package/lib/esm/hierarchies/internal/operators/grouping/BaseClassGrouping.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BaseClassGrouping.d.ts","sourceRoot":"","sources":["../../../../../../src/hierarchies/internal/operators/grouping/BaseClassGrouping.ts"],"names":[],"mappings":"AAKA,OAAO,EAA8C,EAAE,EAAE,yBAAyB,EAAE,gBAAgB,EAAY,MAAM,4BAA4B,CAAC;AACnJ,OAAO,EAAiB,mBAAmB,EAAE,8BAA8B,EAAE,MAAM,wBAAwB,CAAC;AAE5G,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAErE,gBAAgB;AAChB,wBAAsB,6BAA6B,CACjD,cAAc,EAAE,gBAAgB,EAChC,UAAU,EAAE,mBAAmB,GAAG,SAAS,EAC3C,KAAK,EAAE,8BAA8B,EAAE,GACtC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAyBrB;AAED,gBAAgB;AAChB,wBAAsB,uCAAuC,CAC3D,KAAK,EAAE,8BAA8B,EAAE,EACvC,WAAW,EAAE,EAAE,CAAC,KAAK,EACrB,uBAAuB,EAAE,yBAAyB,GACjD,OAAO,CAAC,qBAAqB,CAAC,CA0ChC;AAsCD,gBAAgB;AAChB,wBAAsB,+BAA+B,CACnD,YAAY,EAAE,gBAAgB,GAAG,yBAAyB,EAC1D,UAAU,EAAE,mBAAmB,GAAG,SAAS,EAC3C,KAAK,EAAE,8BAA8B,EAAE,GACtC,OAAO,CAAC,eAAe,EAAE,CAAC,CAG5B"}