@itwin/presentation-hierarchies 2.0.0-alpha.16 → 2.0.0-alpha.18

package/lib/esm/hierarchies/HierarchyProvider.d.ts

@@ -1,134 +0,0 @@
-import type { GenericInstanceFilter } from "@itwin/core-common";
-import type { Event, EventListener, InstanceKey, IPrimitiveValueFormatter, Props, RaisableEvent } from "@itwin/presentation-shared";
-import type { HierarchyNode, ParentHierarchyNode } from "./HierarchyNode.js";
-import type { HierarchySearchTree } from "./HierarchySearch.js";
-/**
- * Props for the `HierarchyProvider.getNodes` call.
- * @public
- */
-export interface GetHierarchyNodesProps {
-    /** Parent node to get children for. Pass `undefined` to get root nodes. */
-    parentNode: ParentHierarchyNode | undefined;
-    /** Optional hierarchy level filter. Has no effect if `parentNode` is a `GroupingNode`. */
-    instanceFilter?: GenericInstanceFilter;
-    /**
-     * Optional hierarchy level size limit override. This value is passed to `LimitingECSqlQueryExecutor` used
-     * by this provider to override query rows limit per hierarchy level. If not provided, defaults to whatever
-     * is used by the limiting query executor.
-     *
-     * Has no effect if `parentNode` is a `GroupingNode`.
-     */
-    hierarchyLevelSizeLimit?: number | "unbounded";
-    /** When set to `true` ignores the cache and fetches the nodes again. */
-    ignoreCache?: boolean;
-}
-/**
- * Event arguments for `HierarchyProvider.hierarchyChanged` event.
- * @public
- */
-interface HierarchyChangedEventArgs {
-    /** Set when the hierarchy change was caused by a formatter change. */
-    formatterChange?: {
-        newFormatter: IPrimitiveValueFormatter | undefined;
-    };
-    /** Set when the hierarchy change was caused by a hierarchy search change. */
-    searchChange?: {
-        newSearch: Props<HierarchyProvider["setHierarchySearch"]>;
-    };
-}
-/**
- * An interface for a hierarchy provider that knows how to create child nodes for a given parent node.
- * @public
- */
-export interface HierarchyProvider {
-    /**
-     * An event that provider raises due to a hierarchy change that requires a reload.
-     *
-     * Consumers are expected to subscribe to this event and reload the hierarchy when it's raised.
-     * Implementations may provide additional details on what caused the change through the
-     * event arguments.
-     */
-    readonly hierarchyChanged: Event<(args: HierarchyChangedEventArgs) => void>;
-    /**
-     * Gets nodes for the specified parent node. This is **the method to implement**, otherwise
-     * the provider doesn't return any nodes.
-     */
-    getNodes(props: GetHierarchyNodesProps): AsyncIterableIterator<HierarchyNode>;
-    /**
-     * Gets instance keys for the specified parent node.
-     *
-     * The result of this method may be used to determine instances whose nodes would be displayed as children
-     * of the specified parent node. For such use cases calling this method should be more efficient compared
-     * to calling `getNodes`.
-     */
-    getNodeInstanceKeys(props: Omit<GetHierarchyNodesProps, "ignoreCache">): AsyncIterableIterator<InstanceKey>;
-    /**
-     * Overrides the property value formatter used by the hierarchy provider. Setting to `undefined`
-     * resets the formatter, but what that means depends on the provider implementation - it could just
-     * use unformatted values, or use some default formatter, e.g. the on created by `createDefaultValueFormatter`
-     * from `@itwin/presentation-shared` package.
-     *
-     * @note Changing formatter is expected to trigger the `hierarchyChanged` event with `formatterChange` arg.
-     */
-    setFormatter(formatter: IPrimitiveValueFormatter | undefined): void;
-    /**
-     * Sets the hierarchy search used by this hierarchy provider. Setting to `undefined`
-     * removes the search.
-     *
-     * @note There's a difference between `undefined` search and search with empty paths list. The
-     * former means no search is applied, while the latter means the search is applied and it filters-out
-     * all hierarchy.
-     *
-     * @note Changing search is expected to trigger the `hierarchyChanged` event with `searchChange` arg.
-     */
-    setHierarchySearch(props: {
-        /** A list of search trees that define paths from root to search target nodes. */
-        paths: HierarchySearchTree[];
-    } | undefined): void;
-}
-/**
- * An utility to create a `HierarchyProvider` from a partial implementation.
- *
- * Creating a `HierarchyProvider` directly requires implementing all its methods:
- * ```ts
- * {
- *   hierarchyChanged: new BeEvent(),
- *   async *getNodes({ parentNode }) {
- *     // yield nodes...
- *   },
- *   async *getNodeInstanceKeys() {},
- *   setFormatter() {},
- *   setHierarchySearch() {},
- * }
- * ```
- *
- * However, in many cases you may only need to implement the `getNodes` method and
- * can rely on default implementations for other methods.
- *
- * With this utility you can implement only part of it, e.g. just the `getNodes` method:
- * ```ts
- * // provide implementation as a javascript object
- * createHierarchyProvider(({ hierarchyChanged }) => ({
- *   async *getNodes({ parentNode }) {
- *     // yield nodes...
- *   },
- * }));
- *
- * // or, provide implementation as a class instance:
- * createHierarchyProvider(
- *   ({ hierarchyChanged }) =>
- *     new (class implements Pick<HierarchyProvider, "getNodes"> {
- *       public async *getNodes({ parentNode }): ReturnType<HierarchyProvider["getNodes"]> {
- *         // yield nodes...
- *       }
- *     })(),
- * );
- * ```
- *
- * @public
- */
-export declare function createHierarchyProvider<TPartialProvider extends Partial<Omit<HierarchyProvider, "hierarchyChanged">> & Pick<HierarchyProvider, "getNodes">>(partialFactory: (props: {
-    hierarchyChanged: RaisableEvent<EventListener<HierarchyProvider["hierarchyChanged"]>>;
-}) => TPartialProvider): TPartialProvider & HierarchyProvider;
-export {};
-//# sourceMappingURL=HierarchyProvider.d.ts.map

package/lib/esm/hierarchies/HierarchyProvider.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchyProvider.d.ts","sourceRoot":"","sources":["../../../src/hierarchies/HierarchyProvider.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,KAAK,EACV,KAAK,EACL,aAAa,EACb,WAAW,EACX,wBAAwB,EACxB,KAAK,EACL,aAAa,EACd,MAAM,4BAA4B,CAAC;AACpC,OAAO,KAAK,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC7E,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAEhE;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,2EAA2E;IAC3E,UAAU,EAAE,mBAAmB,GAAG,SAAS,CAAC;IAE5C,0FAA0F;IAC1F,cAAc,CAAC,EAAE,qBAAqB,CAAC;IAEvC;;;;;;OAMG;IACH,uBAAuB,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC;IAE/C,wEAAwE;IACxE,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;;GAGG;AACH,UAAU,yBAAyB;IACjC,sEAAsE;IACtE,eAAe,CAAC,EAAE;QAAE,YAAY,EAAE,wBAAwB,GAAG,SAAS,CAAA;KAAE,CAAC;IAEzE,6EAA6E;IAC7E,YAAY,CAAC,EAAE;QAAE,SAAS,EAAE,KAAK,CAAC,iBAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAA;KAAE,CAAC;CAC9E;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;;;;OAMG;IACH,QAAQ,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,yBAAyB,KAAK,IAAI,CAAC,CAAC;IAE5E;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,sBAAsB,GAAG,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAE9E;;;;;;OAMG;IACH,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,sBAAsB,EAAE,aAAa,CAAC,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAE5G;;;;;;;OAOG;IACH,YAAY,CAAC,SAAS,EAAE,wBAAwB,GAAG,SAAS,GAAG,IAAI,CAAC;IAEpE;;;;;;;;;OASG;IACH,kBAAkB,CAChB,KAAK,EACD;QACE,iFAAiF;QACjF,KAAK,EAAE,mBAAmB,EAAE,CAAC;KAC9B,GACD,SAAS,GACZ,IAAI,CAAC;CACT;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,wBAAgB,uBAAuB,CACrC,gBAAgB,SAAS,OAAO,CAAC,IAAI,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,EAAE,UAAU,CAAC,EAEnH,cAAc,EAAE,CAAC,KAAK,EAAE;IACtB,gBAAgB,EAAE,aAAa,CAAC,aAAa,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;CACvF,KAAK,gBAAgB,GACrB,gBAAgB,GAAG,iBAAiB,CAatC"}

package/lib/esm/hierarchies/HierarchyProvider.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchyProvider.js","sourceRoot":"","sources":["../../../src/hierarchies/HierarchyProvider.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AA6G9C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,MAAM,UAAU,uBAAuB,CAGrC,cAEsB;IAEtB,MAAM,gBAAgB,GAAqD,IAAI,OAAO,EAAE,CAAC;IACzF,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,gBAAgB,EAAE,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE;QACzB,gBAAgB;QAChB,GAAG,CAAC,IAAI,CAAC,mBAAmB;YAC1B,CAAC,CAAC,EAAE,mBAAmB,EAAE,IAAI,CAAC,mBAAmB,EAAE;YACnD,CAAC,CAAC,oBAAoB,CAAC,EAAE,KAAK,CAAC,CAAC,mBAAmB,KAAI,CAAC,EAAE,CAAC;QAC7D,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,oBAAoB,CAAC,EAAE,YAAY,KAAI,CAAC,EAAE,CAAC;QACzG,GAAG,CAAC,IAAI,CAAC,kBAAkB;YACzB,CAAC,CAAC,EAAE,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,EAAE;YACjD,CAAC,CAAC,oBAAoB,CAAC,EAAE,kBAAkB,KAAI,CAAC,EAAE,CAAC;KACtD,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 { BeEvent } from \"@itwin/core-bentley\";\n\nimport type { GenericInstanceFilter } from \"@itwin/core-common\";\nimport type {\n  Event,\n  EventListener,\n  InstanceKey,\n  IPrimitiveValueFormatter,\n  Props,\n  RaisableEvent,\n} from \"@itwin/presentation-shared\";\nimport type { HierarchyNode, ParentHierarchyNode } from \"./HierarchyNode.js\";\nimport type { HierarchySearchTree } from \"./HierarchySearch.js\";\n\n/**\n * Props for the `HierarchyProvider.getNodes` call.\n * @public\n */\nexport interface GetHierarchyNodesProps {\n  /** Parent node to get children for. Pass `undefined` to get root nodes. */\n  parentNode: ParentHierarchyNode | undefined;\n\n  /** Optional hierarchy level filter. Has no effect if `parentNode` is a `GroupingNode`. */\n  instanceFilter?: GenericInstanceFilter;\n\n  /**\n   * Optional hierarchy level size limit override. This value is passed to `LimitingECSqlQueryExecutor` used\n   * by this provider to override query rows limit per hierarchy level. If not provided, defaults to whatever\n   * is used by the limiting query executor.\n   *\n   * Has no effect if `parentNode` is a `GroupingNode`.\n   */\n  hierarchyLevelSizeLimit?: number | \"unbounded\";\n\n  /** When set to `true` ignores the cache and fetches the nodes again. */\n  ignoreCache?: boolean;\n}\n\n/**\n * Event arguments for `HierarchyProvider.hierarchyChanged` event.\n * @public\n */\ninterface HierarchyChangedEventArgs {\n  /** Set when the hierarchy change was caused by a formatter change. */\n  formatterChange?: { newFormatter: IPrimitiveValueFormatter | undefined };\n\n  /** Set when the hierarchy change was caused by a hierarchy search change. */\n  searchChange?: { newSearch: Props<HierarchyProvider[\"setHierarchySearch\"]> };\n}\n\n/**\n * An interface for a hierarchy provider that knows how to create child nodes for a given parent node.\n * @public\n */\nexport interface HierarchyProvider {\n  /**\n   * An event that provider raises due to a hierarchy change that requires a reload.\n   *\n   * Consumers are expected to subscribe to this event and reload the hierarchy when it's raised.\n   * Implementations may provide additional details on what caused the change through the\n   * event arguments.\n   */\n  readonly hierarchyChanged: Event<(args: HierarchyChangedEventArgs) => void>;\n\n  /**\n   * Gets nodes for the specified parent node. This is **the method to implement**, otherwise\n   * the provider doesn't return any nodes.\n   */\n  getNodes(props: GetHierarchyNodesProps): AsyncIterableIterator<HierarchyNode>;\n\n  /**\n   * Gets instance keys for the specified parent node.\n   *\n   * The result of this method may be used to determine instances whose nodes would be displayed as children\n   * of the specified parent node. For such use cases calling this method should be more efficient compared\n   * to calling `getNodes`.\n   */\n  getNodeInstanceKeys(props: Omit<GetHierarchyNodesProps, \"ignoreCache\">): AsyncIterableIterator<InstanceKey>;\n\n  /**\n   * Overrides the property value formatter used by the hierarchy provider. Setting to `undefined`\n   * resets the formatter, but what that means depends on the provider implementation - it could just\n   * use unformatted values, or use some default formatter, e.g. the on created by `createDefaultValueFormatter`\n   * from `@itwin/presentation-shared` package.\n   *\n   * @note Changing formatter is expected to trigger the `hierarchyChanged` event with `formatterChange` arg.\n   */\n  setFormatter(formatter: IPrimitiveValueFormatter | undefined): void;\n\n  /**\n   * Sets the hierarchy search used by this hierarchy provider. Setting to `undefined`\n   * removes the search.\n   *\n   * @note There's a difference between `undefined` search and search with empty paths list. The\n   * former means no search is applied, while the latter means the search is applied and it filters-out\n   * all hierarchy.\n   *\n   * @note Changing search is expected to trigger the `hierarchyChanged` event with `searchChange` arg.\n   */\n  setHierarchySearch(\n    props:\n      | {\n          /** A list of search trees that define paths from root to search target nodes. */\n          paths: HierarchySearchTree[];\n        }\n      | undefined,\n  ): void;\n}\n\n/**\n * An utility to create a `HierarchyProvider` from a partial implementation.\n *\n * Creating a `HierarchyProvider` directly requires implementing all its methods:\n * ```ts\n * {\n *   hierarchyChanged: new BeEvent(),\n *   async *getNodes({ parentNode }) {\n *     // yield nodes...\n *   },\n *   async *getNodeInstanceKeys() {},\n *   setFormatter() {},\n *   setHierarchySearch() {},\n * }\n * ```\n *\n * However, in many cases you may only need to implement the `getNodes` method and\n * can rely on default implementations for other methods.\n *\n * With this utility you can implement only part of it, e.g. just the `getNodes` method:\n * ```ts\n * // provide implementation as a javascript object\n * createHierarchyProvider(({ hierarchyChanged }) => ({\n *   async *getNodes({ parentNode }) {\n *     // yield nodes...\n *   },\n * }));\n *\n * // or, provide implementation as a class instance:\n * createHierarchyProvider(\n *   ({ hierarchyChanged }) =>\n *     new (class implements Pick<HierarchyProvider, \"getNodes\"> {\n *       public async *getNodes({ parentNode }): ReturnType<HierarchyProvider[\"getNodes\"]> {\n *         // yield nodes...\n *       }\n *     })(),\n * );\n * ```\n *\n * @public\n */\nexport function createHierarchyProvider<\n  TPartialProvider extends Partial<Omit<HierarchyProvider, \"hierarchyChanged\">> & Pick<HierarchyProvider, \"getNodes\">,\n>(\n  partialFactory: (props: {\n    hierarchyChanged: RaisableEvent<EventListener<HierarchyProvider[\"hierarchyChanged\"]>>;\n  }) => TPartialProvider,\n): TPartialProvider & HierarchyProvider {\n  const hierarchyChanged: Props<typeof partialFactory>[\"hierarchyChanged\"] = new BeEvent();\n  const impl = partialFactory({ hierarchyChanged });\n  return Object.assign(impl, {\n    hierarchyChanged,\n    ...(impl.getNodeInstanceKeys\n      ? { getNodeInstanceKeys: impl.getNodeInstanceKeys }\n      : /* v8 ignore next */ { async *getNodeInstanceKeys() {} }),\n    ...(impl.setFormatter ? { setFormatter: impl.setFormatter } : /* v8 ignore next */ { setFormatter() {} }),\n    ...(impl.setHierarchySearch\n      ? { setHierarchySearch: impl.setHierarchySearch }\n      : /* v8 ignore next */ { setHierarchySearch() {} }),\n  });\n}\n"]}

package/lib/esm/hierarchies/HierarchySearch.d.ts

@@ -1,297 +0,0 @@
-import { HierarchyNodeIdentifier } from "./HierarchyNodeIdentifier.js";
-import type { NonGroupingHierarchyNode } from "./HierarchyNode.js";
-import type { HierarchyNodeIdentifiersPath } from "./HierarchyNodeIdentifier.js";
-import type { GenericNodeKey, InstancesNodeKey } from "./HierarchyNodeKey.js";
-/** @public */
-export interface HierarchySearchPathOptions {
-    /**
-     * This option specifies the way `autoExpand` flag should be assigned to nodes in the searched hierarchy.
-     * - If it's `false` or `undefined`, nodes have no 'autoExpand' flag.
-     * - If it's `true`, then all nodes up to the search target will have `autoExpand` flag.
-     * - If it's a object with `groupingLevel` then `groupingLevel` determines the number of grouping levels to expand for
-     * the search target.
-     */
-    reveal?: boolean | {
-        /**
-         * Index of the node in search path should be revealed in hierarchy by auto-expanding its ancestors.
-         *
-         * Use when you want to expand up to specific instance node and don't care about grouping nodes.
-         *
-         * **Use case example:**
-         *
-         * All nodes up to `Element1` should be expanded in the following hierarchy:
-         * - Node1
-         *   - GroupingNode1
-         *     - GroupingNode2
-         *       - Element1
-         *       - Element2
-         *
-         * Provide `{ path: [Node1, Element1], reveal: { depthInPath: 1 } }`
-         *
-         * **NOTE**: All nodes that are up to `depthInPath` will be expanded **except** search targets.
-         */
-        depthInPath: number;
-    } | {
-        /**
-         * The number of grouping levels to expand for the search target. For example, if `groupingLevel` is set to `2`, then all grouping nodes up to the second level
-         * will have the `autoExpand` flag.
-         *
-         * **Note:** if search target has less grouping levels than specified by this attribute, then all grouping nodes up to the search target will have
-         * the `autoExpand` flag, but the search target itself won't have the `autoExpand` flag.
-         */
-        groupingLevel: number;
-    };
-    /**
-     * This option specifies whether or not search target should be expanded.
-     * - If it's `false` or `undefined`, search target won't have 'autoExpand' flag.
-     * - If it's `true`, search target will have `autoExpand` flag.
-     *
-     * **Note:** this attribute does not set `autoExpand` flag on nodes up to the search target. For that use `reveal`.
-     */
-    autoExpand?: boolean;
-}
-/**
- * A path of hierarchy node identifiers for search the hierarchy with additional options.
- * @public
- */
-export type HierarchySearchPath = HierarchyNodeIdentifiersPath | {
-    path: HierarchyNodeIdentifiersPath;
-    options?: HierarchySearchPathOptions;
-};
-/** @public */
-export declare namespace HierarchySearchPath {
-    /**
-     * Normalizes the hierarchy search path to the object form.
-     * @public
-     */
-    function normalize(source: HierarchySearchPath): Exclude<HierarchySearchPath, HierarchyNodeIdentifiersPath>;
-    /**
-     * Merges two given `HierarchySearchPathOptions` objects.
-     *
-     * For the `reveal` attribute, the merge chooses to `reveal` as deep as the deepest input:
-     * - if any one of the inputs is `true`, return `true`,
-     * - else if only one of the inputs is an object, return it,
-     * - else if both inputs are falsy, return `false` or `undefined`,
-     * - else:
-     *    - if only one of the inputs has `groupingLevel` set, return that one,
-     *    - else compare by matching reveal type (`groupingLevel` or `depthInPath`) and return the deeper one.
-     *
-     * @public
-     */
-    function mergeOptions(lhs: HierarchySearchPathOptions | undefined, rhs: HierarchySearchPathOptions | undefined): HierarchySearchPathOptions | undefined;
-}
-/**
- * A tree structure representing hierarchy search paths. Each node in the tree corresponds
- * to a hierarchy node identifier and may have children that represent deeper levels in the
- * hierarchy.
- *
- * The `HierarchySearchTree.createBuilder` or `HierarchySearchTree.createFromPathsList` are
- * typically used create this tree from a flat list of search paths.
- *
- * @public
- */
-export interface HierarchySearchTree {
-    /** Identifier of the hierarchy node this tree entry represents. */
-    identifier: HierarchyNodeIdentifier;
-    /**
-     * When `true`, indicates that this node is a search target.
-     *
-     * Note: A `HierarchySearchTree` node is considered a search target if it has no children, even if `isTarget` is not explicitly set to `true`. This
-     * is because a node with no children represents the end of a search path.
-     */
-    isTarget?: boolean;
-    /** Provides options for handling this search tree entry, such as auto-expansion behavior. */
-    options?: {
-        /**
-         * - `true` to expand the node and its grouping nodes,
-         * - `{ groupingLevel: number }` to expand ancestor grouping nodes, e.g. for the following hierarchy:
-         *   ```
-         *   - Grouping node A
-         *     - Instance node A
-         *       - Grouping node B1
-         *         - Grouping node B2
-         *           - ...
-         *             - Grouping node Bn
-         *               - Instance node B
-         *   ```
-         *
-         *   For "Instance node B" search tree entry:
-         *   - `{ groupingLevel: 1 }` expands its first grouping node "Grouping node B1",
-         *   - `{ groupingLevel: 2 }` expands two levels to "Grouping node B2".
-         *   - `{ groupingLevel: Number.MAX_SAFE_INTEGER }` expands all grouping nodes of that instance node.
-         *
-         *   Note that there's a slight difference between `HierarchySearchTree.options.autoExpand` and
-         *   `HierarchySearchPath.options.reveal`. The latter option reveals the search target node by expanding its ancestors,
-         *   while the `HierarchySearchTree.options.autoExpand` also expands the target node itself.
-         */
-        autoExpand?: boolean | {
-            groupingLevel: number;
-        };
-    };
-    /** Child search tree entries representing the next level(s) in the hierarchy search paths. */
-    children?: HierarchySearchTree[];
-}
-/** @public */
-export declare namespace HierarchySearchTree {
-    /** @public */
-    type HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras extends Record<string, unknown>> = Readonly<Pick<HierarchySearchTree, "identifier" | "options"> & {
-        extras: TExtras;
-    }> & Pick<HierarchySearchTree, "isTarget">;
-    /** @public */
-    type HierarchySearchTreeBuilderAcceptHandlerTreeInput = Readonly<Pick<HierarchySearchTree, "identifier" | "isTarget" | "options"> & {
-        hasChildren: boolean;
-    }>;
-    /** @public */
-    interface HierarchySearchTreeBuilderAcceptHandler<TExtras extends Record<string, unknown>> {
-        /**
-         * Called when a new entry is added to the tree. Return `true` to accept the entry, `false` to reject it and all its children, if any.
-         */
-        onNewEntry?: (props: {
-            /** The parent entries of the new entry being added, from root to immediate parent. It's allowed to mutate these entries. */
-            parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras>>;
-            /** The new entry being added to the tree. */
-            inputEntry: HierarchySearchTreeBuilderAcceptHandlerTreeInput;
-        }) => boolean;
-        /**
-         * Called when a new entry is added to the tree and accepted (either it's a new entry or it merges with an existing entry). This can be used to perform
-         * side effects such as assigning extra information to the tree entry.
-         */
-        onEntryHandled?: (props: {
-            /** The parent entries of the new entry being added, from root to immediate parent. It's allowed to mutate these entries. */
-            parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras>>;
-            /** The tree entry that has been handled. It's allowed to mutate this entry. */
-            treeEntry: HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras>;
-            /** The input entry being added to the tree. */
-            inputEntry: HierarchySearchTreeBuilderAcceptHandlerTreeInput;
-        }) => void;
-    }
-    /**
-     * Props supplied to HierarchySearchTreeBuilder.accept() method for accepting a hierarchy search path or tree with an optional handler for customizing
-     * the behavior of the builder when accepting new entries.
-     * @public
-     */
-    type HierarchySearchTreeBuilderAcceptProps<TAcceptHandlerExtras extends Record<string, unknown>> = ({
-        path: HierarchySearchPath;
-    } | {
-        tree: HierarchySearchTree;
-    }) & {
-        /** An optional handler for customizing the behavior of the builder when accepting new entries. */
-        handler?: HierarchySearchTreeBuilderAcceptHandler<TAcceptHandlerExtras>;
-    };
-    /**
-     * Props supplied to HierarchySearchTreeBuilder.getTree() method for customizing the resulting tree entries, e.g. by omitting some of them or
-     * assigning extra information to them.
-     * @public
-     */
-    interface HierarchySearchTreeBuilderFinalizeTreeProps<TAcceptHandlerExtras extends Record<string, unknown>> {
-        /**
-         * A function that can be used to process each tree entry before it's added to the final tree.
-         *
-         * Return `undefined` to omit the entry and its entire branch from the resulting tree.
-         */
-        processEntry?: (props: {
-            treeEntry: HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TAcceptHandlerExtras>;
-            parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TAcceptHandlerExtras>>;
-        }) => (Omit<HierarchySearchTree, "children"> & {
-            extras: TAcceptHandlerExtras;
-        }) | undefined;
-    }
-    /**
-     * An utility that accepts hierarchy search paths or search trees one by one and builds a `HierarchySearchTree` structure based on them.
-     * @public
-     */
-    interface HierarchySearchTreeBuilder<TAcceptHandlerExtras extends Record<string, unknown>> {
-        /**
-         * Accepts a hierarchy search path or paths' tree and adds it to the builder's internal tree structure. Use `getTree()` to create
-         * a `HierarchySearchTree[]` from the added paths.
-         */
-        accept(props: HierarchySearchTreeBuilderAcceptProps<TAcceptHandlerExtras>): HierarchySearchTreeBuilder<TAcceptHandlerExtras>;
-        /**
-         * Create `HierarchySearchTree[]` from currently added search paths.
-         */
-        getTree(props?: HierarchySearchTreeBuilderFinalizeTreeProps<TAcceptHandlerExtras>): HierarchySearchTree[];
-    }
-    /**
-     * Create a `HierarchySearchTree` builder utility that accepts hierarchy search paths or search trees one by one and builds
-     * a `HierarchySearchTree` structure based on them.
-     *
-     * Usage example:
-     *
-     * ```ts
-     * const builder = HierarchySearchTree.createBuilder();
-     * for (const path of searchPaths) {
-     *   builder.accept({ path });
-     * }
-     * const searchTree = builder.getTree();
-     * ```
-     *
-     * @public
-     */
-    export function createBuilder<TAcceptHandlerExtras extends Record<string, unknown> = Record<string, unknown>>(): HierarchySearchTreeBuilder<TAcceptHandlerExtras>;
-    /**
-     * Builds a list of `HierarchySearchTree` nodes from an iterable of search paths. Shared
-     * path prefixes are merged so that each unique hierarchy node identifier appears only once
-     * per level. The resulting trees carry `isTarget`, `options`, and `children` attributes
-     * derived from the paths and their options (`autoExpand`, `reveal`).
-     *
-     * @public
-     */
-    export function createFromPathsList(paths: Iterable<HierarchySearchPath>): Promise<HierarchySearchTree[]>;
-    /**
-     * Merges two `HierarchySearchTree` option objects. For the `autoExpand` attribute,
-     * `true` takes precedence over `{ groupingLevel }`, and when both sides are
-     * `{ groupingLevel }` objects the larger value wins.
-     * @public
-     */
-    export function mergeOptions(lhs: HierarchySearchTree["options"] | undefined, rhs: HierarchySearchTree["options"] | undefined): HierarchySearchTree["options"] | undefined;
-    export {};
-}
-/**
- * Creates a set of utilities for making it easier to search the given hierarchy
- * level.
- *
- * @public
- */
-export declare function createHierarchySearchHelper(rootLevelSearchProps: HierarchySearchTree[] | undefined, parentNode: Pick<NonGroupingHierarchyNode, "search"> | undefined): {
-    /** Returns a flag indicating if the hierarchy level is filtered. */
-    hasSearch: boolean;
-    /**
-     * Returns a flag indicating whether this hierarchy level has an ancestor node
-     * that is a search target. That generally means that this and all downstream hierarchy
-     * levels should be displayed without search being applied to them, even if search paths
-     * say otherwise.
-     */
-    hasSearchTargetAncestor: boolean;
-    /**
-     * Returns a list of hierarchy node identifiers that apply specifically for this
-     * hierarchy level. Returns `undefined` if search is not applied to this level.
-     */
-    getChildNodeSearchIdentifiers: () => HierarchyNodeIdentifier[] | undefined;
-    /**
-     * When a hierarchy node is created for a filtered hierarchy level, it needs some attributes (e.g. `search`
-     * and `autoExpand`) to be set based on the search paths and search options. This function calculates
-     * these props for a child node based on its key or path matcher.
-     *
-     * When using `pathMatcher` or `asyncPathMatcher` prop, callers have more flexibility to decide whether the given `HierarchyNodeIdentifier` applies
-     * to their node. For example, only some parts of the identifier can be checked for improved performance. Otherwise, the
-     * `nodeKey` prop can be used to check the whole identifier.
-     *
-     * There are multiple overloads of `createChildNodeProps`: depending on props type it returns different values:
-     * - `asyncPathMatcher` is provided - returns either Promise or the regular return value based on whether or not `asyncPathMatcher` returns a `Promise`.
-     * - `pathMatcher` or only `nodeKey` is provided - returns undefined **or** `search` and `autoExpand` prop from `HierarchyNode`;
-     */
-    createChildNodeProps: {
-        (props: {
-            nodeKey: InstancesNodeKey | GenericNodeKey;
-        }): Pick<NonGroupingHierarchyNode, "search" | "autoExpand"> | undefined;
-        (props: {
-            nodeKey: InstancesNodeKey | GenericNodeKey;
-            pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean;
-        }): Pick<NonGroupingHierarchyNode, "search" | "autoExpand"> | undefined;
-        (props: {
-            nodeKey: InstancesNodeKey | GenericNodeKey;
-            asyncPathMatcher: (identifier: HierarchyNodeIdentifier) => boolean | Promise<boolean>;
-        }): Promise<Pick<NonGroupingHierarchyNode, "search" | "autoExpand"> | undefined> | Pick<NonGroupingHierarchyNode, "search" | "autoExpand"> | undefined;
-    };
-};
-//# sourceMappingURL=HierarchySearch.d.ts.map

package/lib/esm/hierarchies/HierarchySearch.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchySearch.d.ts","sourceRoot":"","sources":["../../../src/hierarchies/HierarchySearch.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAIvE,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,8BAA8B,CAAC;AACjF,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE9E,cAAc;AACd,MAAM,WAAW,0BAA0B;IACzC;;;;;;OAMG;IACH,MAAM,CAAC,EACH,OAAO,GACP;QACE;;;;;;;;;;;;;;;;;WAiBG;QACH,WAAW,EAAE,MAAM,CAAC;KACrB,GACD;QACE;;;;;;WAMG;QACH,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;IACN;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED;;;GAGG;AACH,MAAM,MAAM,mBAAmB,GAC3B,4BAA4B,GAC5B;IAAE,IAAI,EAAE,4BAA4B,CAAC;IAAC,OAAO,CAAC,EAAE,0BAA0B,CAAA;CAAE,CAAC;AACjF,cAAc;AAEd,yBAAiB,mBAAmB,CAAC;IACnC;;;OAGG;IACH,SAAgB,SAAS,CAAC,MAAM,EAAE,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,EAAE,4BAA4B,CAAC,CAKjH;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,YAAY,CAC1B,GAAG,EAAE,0BAA0B,GAAG,SAAS,EAC3C,GAAG,EAAE,0BAA0B,GAAG,SAAS,GAC1C,0BAA0B,GAAG,SAAS,CASxC;CA8BF;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,mBAAmB;IAClC,mEAAmE;IACnE,UAAU,EAAE,uBAAuB,CAAC;IAEpC;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IAEnB,6FAA6F;IAC7F,OAAO,CAAC,EAAE;QACR;;;;;;;;;;;;;;;;;;;;;WAqBG;QACH,UAAU,CAAC,EAAE,OAAO,GAAG;YAAE,aAAa,EAAE,MAAM,CAAA;SAAE,CAAC;KAClD,CAAC;IAEF,8FAA8F;IAC9F,QAAQ,CAAC,EAAE,mBAAmB,EAAE,CAAC;CAClC;AAED,cAAc;AACd,yBAAiB,mBAAmB,CAAC;IACnC,cAAc;IACd,KAAK,gDAAgD,CAAC,OAAO,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,QAAQ,CACvG,IAAI,CAAC,mBAAmB,EAAE,YAAY,GAAG,SAAS,CAAC,GAAG;QAAE,MAAM,EAAE,OAAO,CAAA;KAAE,CAC1E,GACC,IAAI,CAAC,mBAAmB,EAAE,UAAU,CAAC,CAAC;IACxC,cAAc;IACd,KAAK,gDAAgD,GAAG,QAAQ,CAC9D,IAAI,CAAC,mBAAmB,EAAE,YAAY,GAAG,UAAU,GAAG,SAAS,CAAC,GAAG;QAAE,WAAW,EAAE,OAAO,CAAA;KAAE,CAC5F,CAAC;IACF,cAAc;IACd,UAAU,uCAAuC,CAAC,OAAO,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;QACvF;;WAEG;QACH,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE;YACnB,4HAA4H;YAC5H,aAAa,EAAE,KAAK,CAAC,gDAAgD,CAAC,OAAO,CAAC,CAAC,CAAC;YAChF,6CAA6C;YAC7C,UAAU,EAAE,gDAAgD,CAAC;SAC9D,KAAK,OAAO,CAAC;QACd;;;WAGG;QACH,cAAc,CAAC,EAAE,CAAC,KAAK,EAAE;YACvB,4HAA4H;YAC5H,aAAa,EAAE,KAAK,CAAC,gDAAgD,CAAC,OAAO,CAAC,CAAC,CAAC;YAChF,+EAA+E;YAC/E,SAAS,EAAE,gDAAgD,CAAC,OAAO,CAAC,CAAC;YACrE,+CAA+C;YAC/C,UAAU,EAAE,gDAAgD,CAAC;SAC9D,KAAK,IAAI,CAAC;KACZ;IACD;;;;OAIG;IACH,KAAK,qCAAqC,CAAC,oBAAoB,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAC/F;QAAE,IAAI,EAAE,mBAAmB,CAAA;KAAE,GAC7B;QAAE,IAAI,EAAE,mBAAmB,CAAA;KAAE,CAChC,GAAG;QACF,kGAAkG;QAClG,OAAO,CAAC,EAAE,uCAAuC,CAAC,oBAAoB,CAAC,CAAC;KACzE,CAAC;IACF;;;;OAIG;IACH,UAAU,2CAA2C,CAAC,oBAAoB,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;QACxG;;;;WAIG;QACH,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE;YACrB,SAAS,EAAE,gDAAgD,CAAC,oBAAoB,CAAC,CAAC;YAClF,aAAa,EAAE,KAAK,CAAC,gDAAgD,CAAC,oBAAoB,CAAC,CAAC,CAAC;SAC9F,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,CAAC,GAAG;YAAE,MAAM,EAAE,oBAAoB,CAAA;SAAE,CAAC,GAAG,SAAS,CAAC;KAC9F;IACD;;;OAGG;IACH,UAAU,0BAA0B,CAAC,oBAAoB,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;QACvF;;;WAGG;QACH,MAAM,CACJ,KAAK,EAAE,qCAAqC,CAAC,oBAAoB,CAAC,GACjE,0BAA0B,CAAC,oBAAoB,CAAC,CAAC;QACpD;;WAEG;QACH,OAAO,CAAC,KAAK,CAAC,EAAE,2CAA2C,CAAC,oBAAoB,CAAC,GAAG,mBAAmB,EAAE,CAAC;KAC3G;IAED;;;;;;;;;;;;;;;OAeG;IACH,MAAM,UAAU,aAAa,CAC3B,oBAAoB,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAC3E,0BAA0B,CAAC,oBAAoB,CAAC,CA+NpD;IAED;;;;;;;OAOG;IACH,gBAAsB,mBAAmB,CAAC,KAAK,EAAE,QAAQ,CAAC,mBAAmB,CAAC,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAQ9G;IAED;;;;;OAKG;IACH,MAAM,UAAU,YAAY,CAC1B,GAAG,EAAE,mBAAmB,CAAC,SAAS,CAAC,GAAG,SAAS,EAC/C,GAAG,EAAE,mBAAmB,CAAC,SAAS,CAAC,GAAG,SAAS,GAC9C,mBAAmB,CAAC,SAAS,CAAC,GAAG,SAAS,CAU5C;;CAcF;AAoBD;;;;;GAKG;AACH,wBAAgB,2BAA2B,CACzC,oBAAoB,EAAE,mBAAmB,EAAE,GAAG,SAAS,EACvD,UAAU,EAAE,IAAI,CAAC,wBAAwB,EAAE,QAAQ,CAAC,GAAG,SAAS;IAwG9D,oEAAoE;;IAEpE;;;;;OAKG;;IAEH;;;OAGG;;IAOH;;;;;;;;;;;;OAYG;;gBA5EgC;YACnC,OAAO,EAAE,gBAAgB,GAAG,cAAc,CAAC;SAC5C,GAAG,IAAI,CAAC,wBAAwB,EAAE,QAAQ,GAAG,YAAY,CAAC,GAAG,SAAS;gBAClC;YACnC,OAAO,EAAE,gBAAgB,GAAG,cAAc,CAAC;YAC3C,WAAW,EAAE,CAAC,UAAU,EAAE,uBAAuB,KAAK,OAAO,CAAC;SAC/D,GAAG,IAAI,CAAC,wBAAwB,EAAE,QAAQ,GAAG,YAAY,CAAC,GAAG,SAAS;gBAClC;YACnC,OAAO,EAAE,gBAAgB,GAAG,cAAc,CAAC;YAC3C,gBAAgB,EAAE,CAAC,UAAU,EAAE,uBAAuB,KAAK,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;SACvF,GACG,OAAO,CAAC,IAAI,CAAC,wBAAwB,EAAE,QAAQ,GAAG,YAAY,CAAC,GAAG,SAAS,CAAC,GAC5E,IAAI,CAAC,wBAAwB,EAAE,QAAQ,GAAG,YAAY,CAAC,GACvD,SAAS;;EAkEd"}

package/lib/esm/hierarchies/HierarchySearch.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchySearch.js","sourceRoot":"","sources":["../../../src/hierarchies/HierarchySearch.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,6BAA6B,EAAE,MAAM,2CAA2C,CAAC;AAiE1F,cAAc;AACd,2DAA2D;AAC3D,MAAM,KAAW,mBAAmB,CAmEnC;AAnED,WAAiB,mBAAmB;IAClC;;;OAGG;IACH,SAAgB,SAAS,CAAC,MAA2B;QACnD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAC1B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IALe,6BAAS,YAKxB,CAAA;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,YAAY,CAC1B,GAA2C,EAC3C,GAA2C;QAE3C,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5D,MAAM,UAAU,GAAG,qBAAqB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QAC3E,OAAO,MAAM,IAAI,UAAU;YACzB,CAAC,CAAC;gBACE,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAClD,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;aAC3D;YACH,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;IAZe,gCAAY,eAY3B,CAAA;IACD,SAAS,kBAAkB,CACzB,GAAyC,EACzC,GAAyC;QAEzC,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACjB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QAC3B,CAAC;QAED,IAAI,eAAe,IAAI,GAAG,EAAE,CAAC;YAC3B,IAAI,eAAe,IAAI,GAAG,EAAE,CAAC;gBAC3B,OAAO,GAAG,CAAC,aAAa,GAAG,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAC3D,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;aAAM,IAAI,eAAe,IAAI,GAAG,EAAE,CAAC;YAClC,OAAO,GAAG,CAAC;QACb,CAAC;QAED,OAAO,GAAG,CAAC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACvD,CAAC;IAED,SAAS,qBAAqB,CAC5B,GAA6C,EAC7C,GAA6C;QAE7C,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACvC,CAAC;AACH,CAAC,EAnEgB,mBAAmB,KAAnB,mBAAmB,QAmEnC;AAuDD,cAAc;AACd,MAAM,KAAW,mBAAmB,CAsXnC;AAtXD,WAAiB,mBAAmB;IAgFlC;;;;;;;;;;;;;;;OAeG;IACH,SAAgB,aAAa;;QAS3B,OAAO,IAAI,CAAC,MAAM,IAAI;YACpB,gBAAgB,GAAkC,IAAI,UAAU,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;YAElG,MAAM,CAAC,oBAAoB,CACzB,UAAyC,EACzC,aAA4F,EAC5F,KAAyE;gBAEzE,MAAM,IAAI,GAA0B,EAAE,CAAC;gBACvC,KAAK,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;oBACzD,IAAI,cAAc,GAChB,KAAK,CAAC;oBACR,IAAI,KAAK,EAAE,YAAY,EAAE,CAAC;wBACxB,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;oBAC3E,CAAC;oBACD,IAAI,CAAC,cAAc,EAAE,CAAC;wBACpB,SAAS;oBACX,CAAC;oBACD,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,kBAAkB,EAAE,GAAG,cAAc,CAAC;oBAC5D,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;oBACnC,IAAI,CAAC,IAAI,CAAC;wBACR,GAAG,kBAAkB;wBACrB,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,aAAa,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;qBACpG,CAAC,CAAC;oBACH,aAAa,CAAC,GAAG,EAAE,CAAC;gBACtB,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;YAED,MAAM,CAAC,qCAAqC,CAC1C,QAAgD,EAChD,YAA8D;gBAE9D,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBAC1B,IAAI,CAAC,wBAAwB,CAAC;wBAC5B,QAAQ;wBACR,gBAAgB,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC;wBACrC,eAAe,EAAE,CAAC,KAAK,EAAE,gBAAgB,EAAE,EAAE;4BAC3C,IAAI,KAAK,KAAK,gBAAgB,EAAE,CAAC;gCAC/B,sDAAsD;gCACtD,OAAO,EAAE,UAAU,EAAE,EAAE,aAAa,EAAE,MAAM,CAAC,gBAAgB,EAAE,EAAE,CAAC;4BACpE,CAAC;4BACD,+BAA+B;4BAC/B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;wBAC9B,CAAC;qBACF,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,YAAY,IAAI,eAAe,IAAI,YAAY,EAAE,CAAC;oBAC3D,IAAI,CAAC,wBAAwB,CAAC;wBAC5B,QAAQ;wBACR,gBAAgB,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC;wBACrC,eAAe,EAAE,CAAC,KAAK,EAAE,gBAAgB,EAAE,EAAE;4BAC3C,IAAI,KAAK,KAAK,gBAAgB,EAAE,CAAC;gCAC/B,gHAAgH;gCAChH,OAAO,EAAE,UAAU,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;4BACxF,CAAC;4BACD,+BAA+B;4BAC/B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;wBAC9B,CAAC;qBACF,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,YAAY,IAAI,aAAa,IAAI,YAAY,EAAE,CAAC;oBACzD,IAAI,CAAC,wBAAwB,CAAC;wBAC5B,QAAQ;wBACR,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;wBACzE,eAAe,EAAE,CAAC,KAAK,EAAE,gBAAgB,EAAE,EAAE;4BAC3C,IAAI,KAAK,KAAK,gBAAgB,EAAE,CAAC;gCAC/B,sDAAsD;gCACtD,OAAO,EAAE,UAAU,EAAE,EAAE,aAAa,EAAE,MAAM,CAAC,gBAAgB,EAAE,EAAE,CAAC;4BACpE,CAAC;4BACD,+BAA+B;4BAC/B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;wBAC9B,CAAC;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,MAAM,CAAC,wBAAwB,CAAC,EAC9B,QAAQ,EACR,gBAAgB,EAChB,eAAe,GAKhB;gBACC,wCAAwC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC;oBACxF,IAAI,OAAO,EAAE,CAAC;wBACZ,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC;oBAChC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,WAAW,CAAC,EACV,aAAa,EACb,KAAK,EACL,IAAI,EACJ,OAAO,GAMR;gBACC,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,IAAI,OAAO,EAAE,UAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,aAAa,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;wBACpF,OAAO,SAAS,CAAC;oBACnB,CAAC;oBACD,KAAK,GAAG;wBACN,UAAU,EAAE,IAAI,CAAC,UAAU;wBAC3B,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;wBACxF,MAAM,EAAE,EAA0B;qBACnC,CAAC;oBACF,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBACpC,CAAC;gBAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;gBAC9D,IAAI,kBAAkB,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;oBACzC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACxB,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;oBACxC,sFAAsF;oBACtF,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;oBACtB,KAAK,CAAC,QAAQ,GAAG,IAAI,UAAU,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;gBACnE,CAAC;gBACD,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,aAAa,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACjF,OAAO,KAAK,CAAC;YACf,CAAC;YAED,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAA0D;gBACnF,MAAM,UAAU,GAAG,mBAAmB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACvD,MAAM,QAAQ,GAA8C,EAAE,CAAC;gBAC/D,IAAI,YAAY,GAAkC,IAAI,CAAC,gBAAgB,CAAC;gBACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChD,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACtC,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC;wBACpC,aAAa,EAAE,QAAQ;wBACvB,IAAI,EAAE,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;wBACjE,KAAK,EAAE,YAAY;wBACnB,OAAO;qBACR,CAAC,CAAC;oBACH,IAAI,CAAC,YAAY,EAAE,CAAC;wBAClB,MAAM;oBACR,CAAC;oBACD,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC5B,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;wBAC3B,MAAM;oBACR,CAAC;oBACD,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;gBACvC,CAAC;gBAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,OAAO;gBACT,CAAC;gBAED,qBAAqB;gBACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC/C,IAAI,UAAU,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC;oBACnC,CAAC,QAAQ,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC;gBAC9C,CAAC;gBAED,qBAAqB;gBACrB,IAAI,CAAC,qCAAqC,CAAC,QAAQ,EAAE,UAAU,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACnF,CAAC;YAED,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAA0D;gBACnF,MAAM,cAAc,GAAG,CACrB,aAAmD,EACnD,YAAmC,EACnC,KAAoC,EACpC,IAAyB,EACzB,EAAE;oBACF,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC;wBACpC,aAAa;wBACb,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;wBAC3D,KAAK;wBACL,OAAO;qBACR,CAAC,CAAC;oBACH,IAAI,CAAC,YAAY,EAAE,CAAC;wBAClB,8DAA8D;wBAC9D,OAAO;oBACT,CAAC;oBACD,MAAM,QAAQ,GAAG,CAAC,GAAG,aAAa,EAAE,YAAY,CAAC,CAAC;oBAClD,MAAM,UAAU,GAAG,CAAC,GAAG,YAAY,EAAE,IAAI,CAAC,CAAC;oBAC3C,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBACpC,iEAAiE;wBACjE,IAAI,CAAC,wBAAwB,CAAC;4BAC5B,QAAQ;4BACR,gBAAgB,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC;4BACrC,eAAe,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,OAAO;yBACtD,CAAC,CAAC;oBACL,CAAC;oBACD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;oBAC3C,IAAI,YAAY,EAAE,CAAC;wBACjB,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,QAAQ,EAAE,UAAU,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;oBAC/F,CAAC;gBACH,CAAC,CAAC;gBACF,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;YACtD,CAAC;YAEM,MAAM,CACX,KAAoG;gBAEpG,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC;oBACpB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;YAEM,OAAO,CAAC,KAAyE;gBACtF,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACrE,CAAC;SACF,CAAC,EAAE,CAAC;IACP,CAAC;IAjOe,iCAAa,gBAiO5B,CAAA;IAED;;;;;;;OAOG;IACI,KAAK,UAAU,mBAAmB,CAAC,KAAoC;QAC5E,OAAO,cAAc,CACnB,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CACd,6BAA6B,CAAC,IAAI,CAAC,EACnC,MAAM,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EACpE,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CACpC,CACF,CAAC;IACJ,CAAC;IARqB,uCAAmB,sBAQxC,CAAA;IAED;;;;;OAKG;IACH,SAAgB,YAAY,CAC1B,GAA+C,EAC/C,GAA+C;QAE/C,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,GAAG,CAAC;QACb,CAAC;QACD,MAAM,UAAU,GAAG,+BAA+B,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;QACnF,MAAM,OAAO,GAAgD,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9G,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IAbe,gCAAY,eAa3B,CAAA;IAED,SAAS,+BAA+B,CACtC,GAA0E,EAC1E,GAA0E;QAE1E,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,GAAG,CAAC;QACb,CAAC;QACD,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;IACjH,CAAC;AACH,CAAC,EAtXgB,mBAAmB,KAAnB,mBAAmB,QAsXnC;AAED,SAAS,0BAA0B,CACjC,oBAAuD,EACvD,UAAgE;IAEhE,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,OAAO,oBAAoB;YACzB,CAAC,CAAC,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,uBAAuB,EAAE,KAAK,EAAE;YAC/E,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;IACD,MAAM,WAAW,GAAsF;QACrG,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,mBAAmB;YACxC,CAAC,CAAC,EAAE,mBAAmB,EAAE,UAAU,CAAC,MAAM,CAAC,mBAAmB,EAAE;YAChE,CAAC,CAAC,SAAS,CAAC;QACd,uBAAuB,EAAE,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,uBAAuB,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,cAAc;KAC7G,CAAC;IACF,OAAO,WAAW,CAAC,mBAAmB,IAAI,WAAW,CAAC,uBAAuB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1G,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,2BAA2B,CACzC,oBAAuD,EACvD,UAAgE;IAEhE,MAAM,WAAW,GAAG,0BAA0B,CAAC,oBAAoB,EAAE,UAAU,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,CAAC,CAAC,WAAW,CAAC;IAahC,SAAS,mCAAmC,CAC1C,eAIC;QAED,8DAA8D;QAC9D,qJAAqJ;QACrJ,0DAA0D;QAC1D,gFAAgF;QAChF,IAAI,CAAC,WAAW,EAAE,mBAAmB,EAAE,CAAC;YACtC,OAAO;QACT,CAAC;QACD,MAAM,mBAAmB,GAAG,IAAI,KAAK,EAA4C,CAAC;QAClF,KAAK,MAAM,kBAAkB,IAAI,WAAW,CAAC,mBAAmB,EAAE,CAAC;YACjE,IAAI,kBAAkB,IAAI,eAAe,EAAE,CAAC;gBAC1C,MAAM,sBAAsB,GAAG,eAAe,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBAC/F,IAAI,sBAAsB,YAAY,OAAO,EAAE,CAAC;oBAC9C,mBAAmB,CAAC,IAAI,CACtB,sBAAsB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CACrF,CAAC;gBACJ,CAAC;qBAAM,IAAI,sBAAsB,EAAE,CAAC;oBAClC,eAAe,CAAC,YAAY,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GACX,aAAa,IAAI,eAAe;oBAC9B,CAAC,CAAC,eAAe,CAAC,WAAW,CAAC,kBAAkB,CAAC,UAAU,CAAC;oBAC5D,CAAC,CAAC,wBAAwB,CAAC,eAAe,CAAC,OAAO,EAAE,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBACvF,IAAI,OAAO,EAAE,CAAC;oBACZ,eAAe,CAAC,YAAY,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,OAAO;QACT,CAAC;QACD,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,EAAE,CAC5D,YAAY,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,IAAI,eAAe,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CACvG,CAAC;IACJ,CAAC;IAgBD,SAAS,oBAAoB,CAC3B,KAIC;QAKD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,0BAA0B,CAAC,WAAW,CAAC,uBAAuB,CAAC,CAAC;QACpF,IAAI,kBAAkB,IAAI,KAAK,EAAE,CAAC;YAChC,MAAM,aAAa,GAAG,mCAAmC,CAAC;gBACxD,YAAY,EAAE,OAAO;gBACrB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;aACzC,CAAC,CAAC;YACH,IAAI,aAAa,YAAY,OAAO,EAAE,CAAC;gBACrC,OAAO,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,mCAAmC,CAAC,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,OAAO,OAAO,CAAC,iBAAiB,CAAC;IACnC,CAAC;IAED,OAAO;QACL,oEAAoE;QACpE,SAAS;QACT;;;;;WAKG;QACH,uBAAuB,EAAE,WAAW,EAAE,uBAAuB,IAAI,KAAK;QACtE;;;WAGG;QACH,6BAA6B,EAAE,GAAG,EAAE;YAClC,IAAI,CAAC,WAAW,EAAE,mBAAmB,EAAE,CAAC;gBACtC,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,OAAO,WAAW,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC;QAC7E,CAAC;QACD;;;;;;;;;;;;WAYG;QACH,oBAAoB;KACrB,CAAC;AACJ,CAAC;AAED,SAAS,wBAAwB,CAC/B,OAA0C,EAC1C,UAAmC;IAEnC,OAAO,CACL,CAAC,gBAAgB,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,uBAAuB,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QAC3F,CAAC,gBAAgB,CAAC,WAAW,CAAC,OAAO,CAAC;YACpC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,uBAAuB,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC,CACpF,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,0BAA0B;IAKH;IAJnB,oBAAoB,GAAG,IAAI,KAAK,EAAuB,CAAC;IACxD,eAAe,GAAG,KAAK,CAAC;IACxB,QAAQ,GAA+C,SAAS,CAAC;IAEzE,YAA2B,wBAAiC;QAAjC,6BAAwB,GAAxB,wBAAwB,CAAS;IAAG,CAAC;IAEzD,MAAM,CAAC,IAAyB;QACrC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC9B,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,mBAAmB,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAChF,CAAC;IAED,IAAW,iBAAiB;QAC1B,MAAM,MAAM,GACV,IAAI,CAAC,wBAAwB,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ;YAC5G,CAAC,CAAC;gBACE,GAAG,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAClF,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAChE,GAAG,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC1G,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;aAC5D;YACH,CAAC,CAAC,SAAS,CAAC;QAChB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,UAAU,KAAK,IAAI,CAAC;QACtD,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;IAChG,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { firstValueFrom, from, map, reduce } from \"rxjs\";\nimport { Dictionary } from \"@itwin/core-bentley\";\nimport { HierarchyNodeIdentifier } from \"./HierarchyNodeIdentifier.js\";\nimport { HierarchyNodeKey } from \"./HierarchyNodeKey.js\";\nimport { releaseMainThreadOnItemsCount } from \"./internal/operators/ReleaseMainThread.js\";\n\nimport type { NonGroupingHierarchyNode } from \"./HierarchyNode.js\";\nimport type { HierarchyNodeIdentifiersPath } from \"./HierarchyNodeIdentifier.js\";\nimport type { GenericNodeKey, InstancesNodeKey } from \"./HierarchyNodeKey.js\";\n\n/** @public */\nexport interface HierarchySearchPathOptions {\n  /**\n   * This option specifies the way `autoExpand` flag should be assigned to nodes in the searched hierarchy.\n   * - If it's `false` or `undefined`, nodes have no 'autoExpand' flag.\n   * - If it's `true`, then all nodes up to the search target will have `autoExpand` flag.\n   * - If it's a object with `groupingLevel` then `groupingLevel` determines the number of grouping levels to expand for\n   * the search target.\n   */\n  reveal?:\n    | boolean\n    | {\n        /**\n         * Index of the node in search path should be revealed in hierarchy by auto-expanding its ancestors.\n         *\n         * Use when you want to expand up to specific instance node and don't care about grouping nodes.\n         *\n         * **Use case example:**\n         *\n         * All nodes up to `Element1` should be expanded in the following hierarchy:\n         * - Node1\n         *   - GroupingNode1\n         *     - GroupingNode2\n         *       - Element1\n         *       - Element2\n         *\n         * Provide `{ path: [Node1, Element1], reveal: { depthInPath: 1 } }`\n         *\n         * **NOTE**: All nodes that are up to `depthInPath` will be expanded **except** search targets.\n         */\n        depthInPath: number;\n      }\n    | {\n        /**\n         * The number of grouping levels to expand for the search target. For example, if `groupingLevel` is set to `2`, then all grouping nodes up to the second level\n         * will have the `autoExpand` flag.\n         *\n         * **Note:** if search target has less grouping levels than specified by this attribute, then all grouping nodes up to the search target will have\n         * the `autoExpand` flag, but the search target itself won't have the `autoExpand` flag.\n         */\n        groupingLevel: number;\n      };\n  /**\n   * This option specifies whether or not search target should be expanded.\n   * - If it's `false` or `undefined`, search target won't have 'autoExpand' flag.\n   * - If it's `true`, search target will have `autoExpand` flag.\n   *\n   * **Note:** this attribute does not set `autoExpand` flag on nodes up to the search target. For that use `reveal`.\n   */\n  autoExpand?: boolean;\n}\n\n/**\n * A path of hierarchy node identifiers for search the hierarchy with additional options.\n * @public\n */\nexport type HierarchySearchPath =\n  | HierarchyNodeIdentifiersPath\n  | { path: HierarchyNodeIdentifiersPath; options?: HierarchySearchPathOptions };\n/** @public */\n// eslint-disable-next-line @typescript-eslint/no-redeclare\nexport namespace HierarchySearchPath {\n  /**\n   * Normalizes the hierarchy search path to the object form.\n   * @public\n   */\n  export function normalize(source: HierarchySearchPath): Exclude<HierarchySearchPath, HierarchyNodeIdentifiersPath> {\n    if (Array.isArray(source)) {\n      return { path: source };\n    }\n    return source;\n  }\n\n  /**\n   * Merges two given `HierarchySearchPathOptions` objects.\n   *\n   * For the `reveal` attribute, the merge chooses to `reveal` as deep as the deepest input:\n   * - if any one of the inputs is `true`, return `true`,\n   * - else if only one of the inputs is an object, return it,\n   * - else if both inputs are falsy, return `false` or `undefined`,\n   * - else:\n   *    - if only one of the inputs has `groupingLevel` set, return that one,\n   *    - else compare by matching reveal type (`groupingLevel` or `depthInPath`) and return the deeper one.\n   *\n   * @public\n   */\n  export function mergeOptions(\n    lhs: HierarchySearchPathOptions | undefined,\n    rhs: HierarchySearchPathOptions | undefined,\n  ): HierarchySearchPathOptions | undefined {\n    const reveal = mergeRevealOptions(lhs?.reveal, rhs?.reveal);\n    const autoExpand = mergeAutoExpandOption(lhs?.autoExpand, rhs?.autoExpand);\n    return reveal || autoExpand\n      ? {\n          ...(reveal !== undefined ? { reveal } : undefined),\n          ...(autoExpand !== undefined ? { autoExpand } : undefined),\n        }\n      : undefined;\n  }\n  function mergeRevealOptions(\n    lhs: HierarchySearchPathOptions[\"reveal\"],\n    rhs: HierarchySearchPathOptions[\"reveal\"],\n  ): HierarchySearchPathOptions[\"reveal\"] {\n    if (rhs === true || lhs === true) {\n      return true;\n    }\n    if (!rhs || !lhs) {\n      return !!rhs ? rhs : lhs;\n    }\n\n    if (\"groupingLevel\" in lhs) {\n      if (\"groupingLevel\" in rhs) {\n        return lhs.groupingLevel > rhs.groupingLevel ? lhs : rhs;\n      }\n      return lhs;\n    } else if (\"groupingLevel\" in rhs) {\n      return rhs;\n    }\n\n    return lhs.depthInPath > rhs.depthInPath ? lhs : rhs;\n  }\n\n  function mergeAutoExpandOption(\n    lhs: HierarchySearchPathOptions[\"autoExpand\"],\n    rhs: HierarchySearchPathOptions[\"autoExpand\"],\n  ): HierarchySearchPathOptions[\"autoExpand\"] {\n    return lhs || rhs ? true : undefined;\n  }\n}\n\n/**\n * A tree structure representing hierarchy search paths. Each node in the tree corresponds\n * to a hierarchy node identifier and may have children that represent deeper levels in the\n * hierarchy.\n *\n * The `HierarchySearchTree.createBuilder` or `HierarchySearchTree.createFromPathsList` are\n * typically used create this tree from a flat list of search paths.\n *\n * @public\n */\nexport interface HierarchySearchTree {\n  /** Identifier of the hierarchy node this tree entry represents. */\n  identifier: HierarchyNodeIdentifier;\n\n  /**\n   * When `true`, indicates that this node is a search target.\n   *\n   * Note: A `HierarchySearchTree` node is considered a search target if it has no children, even if `isTarget` is not explicitly set to `true`. This\n   * is because a node with no children represents the end of a search path.\n   */\n  isTarget?: boolean;\n\n  /** Provides options for handling this search tree entry, such as auto-expansion behavior. */\n  options?: {\n    /**\n     * - `true` to expand the node and its grouping nodes,\n     * - `{ groupingLevel: number }` to expand ancestor grouping nodes, e.g. for the following hierarchy:\n     *   ```\n     *   - Grouping node A\n     *     - Instance node A\n     *       - Grouping node B1\n     *         - Grouping node B2\n     *           - ...\n     *             - Grouping node Bn\n     *               - Instance node B\n     *   ```\n     *\n     *   For \"Instance node B\" search tree entry:\n     *   - `{ groupingLevel: 1 }` expands its first grouping node \"Grouping node B1\",\n     *   - `{ groupingLevel: 2 }` expands two levels to \"Grouping node B2\".\n     *   - `{ groupingLevel: Number.MAX_SAFE_INTEGER }` expands all grouping nodes of that instance node.\n     *\n     *   Note that there's a slight difference between `HierarchySearchTree.options.autoExpand` and\n     *   `HierarchySearchPath.options.reveal`. The latter option reveals the search target node by expanding its ancestors,\n     *   while the `HierarchySearchTree.options.autoExpand` also expands the target node itself.\n     */\n    autoExpand?: boolean | { groupingLevel: number };\n  };\n\n  /** Child search tree entries representing the next level(s) in the hierarchy search paths. */\n  children?: HierarchySearchTree[];\n}\n\n/** @public */\nexport namespace HierarchySearchTree {\n  /** @public */\n  type HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras extends Record<string, unknown>> = Readonly<\n    Pick<HierarchySearchTree, \"identifier\" | \"options\"> & { extras: TExtras }\n  > &\n    Pick<HierarchySearchTree, \"isTarget\">;\n  /** @public */\n  type HierarchySearchTreeBuilderAcceptHandlerTreeInput = Readonly<\n    Pick<HierarchySearchTree, \"identifier\" | \"isTarget\" | \"options\"> & { hasChildren: boolean }\n  >;\n  /** @public */\n  interface HierarchySearchTreeBuilderAcceptHandler<TExtras extends Record<string, unknown>> {\n    /**\n     * Called when a new entry is added to the tree. Return `true` to accept the entry, `false` to reject it and all its children, if any.\n     */\n    onNewEntry?: (props: {\n      /** The parent entries of the new entry being added, from root to immediate parent. It's allowed to mutate these entries. */\n      parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras>>;\n      /** The new entry being added to the tree. */\n      inputEntry: HierarchySearchTreeBuilderAcceptHandlerTreeInput;\n    }) => boolean;\n    /**\n     * Called when a new entry is added to the tree and accepted (either it's a new entry or it merges with an existing entry). This can be used to perform\n     * side effects such as assigning extra information to the tree entry.\n     */\n    onEntryHandled?: (props: {\n      /** The parent entries of the new entry being added, from root to immediate parent. It's allowed to mutate these entries. */\n      parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras>>;\n      /** The tree entry that has been handled. It's allowed to mutate this entry. */\n      treeEntry: HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TExtras>;\n      /** The input entry being added to the tree. */\n      inputEntry: HierarchySearchTreeBuilderAcceptHandlerTreeInput;\n    }) => void;\n  }\n  /**\n   * Props supplied to HierarchySearchTreeBuilder.accept() method for accepting a hierarchy search path or tree with an optional handler for customizing\n   * the behavior of the builder when accepting new entries.\n   * @public\n   */\n  type HierarchySearchTreeBuilderAcceptProps<TAcceptHandlerExtras extends Record<string, unknown>> = (\n    | { path: HierarchySearchPath }\n    | { tree: HierarchySearchTree }\n  ) & {\n    /** An optional handler for customizing the behavior of the builder when accepting new entries. */\n    handler?: HierarchySearchTreeBuilderAcceptHandler<TAcceptHandlerExtras>;\n  };\n  /**\n   * Props supplied to HierarchySearchTreeBuilder.getTree() method for customizing the resulting tree entries, e.g. by omitting some of them or\n   * assigning extra information to them.\n   * @public\n   */\n  interface HierarchySearchTreeBuilderFinalizeTreeProps<TAcceptHandlerExtras extends Record<string, unknown>> {\n    /**\n     * A function that can be used to process each tree entry before it's added to the final tree.\n     *\n     * Return `undefined` to omit the entry and its entire branch from the resulting tree.\n     */\n    processEntry?: (props: {\n      treeEntry: HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TAcceptHandlerExtras>;\n      parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TAcceptHandlerExtras>>;\n    }) => (Omit<HierarchySearchTree, \"children\"> & { extras: TAcceptHandlerExtras }) | undefined;\n  }\n  /**\n   * An utility that accepts hierarchy search paths or search trees one by one and builds a `HierarchySearchTree` structure based on them.\n   * @public\n   */\n  interface HierarchySearchTreeBuilder<TAcceptHandlerExtras extends Record<string, unknown>> {\n    /**\n     * Accepts a hierarchy search path or paths' tree and adds it to the builder's internal tree structure. Use `getTree()` to create\n     * a `HierarchySearchTree[]` from the added paths.\n     */\n    accept(\n      props: HierarchySearchTreeBuilderAcceptProps<TAcceptHandlerExtras>,\n    ): HierarchySearchTreeBuilder<TAcceptHandlerExtras>;\n    /**\n     * Create `HierarchySearchTree[]` from currently added search paths.\n     */\n    getTree(props?: HierarchySearchTreeBuilderFinalizeTreeProps<TAcceptHandlerExtras>): HierarchySearchTree[];\n  }\n\n  /**\n   * Create a `HierarchySearchTree` builder utility that accepts hierarchy search paths or search trees one by one and builds\n   * a `HierarchySearchTree` structure based on them.\n   *\n   * Usage example:\n   *\n   * ```ts\n   * const builder = HierarchySearchTree.createBuilder();\n   * for (const path of searchPaths) {\n   *   builder.accept({ path });\n   * }\n   * const searchTree = builder.getTree();\n   * ```\n   *\n   * @public\n   */\n  export function createBuilder<\n    TAcceptHandlerExtras extends Record<string, unknown> = Record<string, unknown>,\n  >(): HierarchySearchTreeBuilder<TAcceptHandlerExtras> {\n    type HierarchySearchTreeDictionaryEntry = Omit<HierarchySearchTree, \"children\"> & {\n      children?: HierarchySearchTreeDictionary;\n      extras: TAcceptHandlerExtras;\n    };\n    type HierarchySearchTreeDictionary = Dictionary<HierarchyNodeIdentifier, HierarchySearchTreeDictionaryEntry>;\n    type AcceptHandler = HierarchySearchTreeBuilderAcceptHandler<TAcceptHandlerExtras>;\n    return new (class Impl implements HierarchySearchTreeBuilder<TAcceptHandlerExtras> {\n      #rootsDictionary: HierarchySearchTreeDictionary = new Dictionary(HierarchyNodeIdentifier.compare);\n\n      static #mapDictionaryToTree(\n        dictionary: HierarchySearchTreeDictionary,\n        parentEntries: Array<HierarchySearchTreeBuilderAcceptHandlerTreeEntry<TAcceptHandlerExtras>>,\n        props?: HierarchySearchTreeBuilderFinalizeTreeProps<TAcceptHandlerExtras>,\n      ): HierarchySearchTree[] {\n        const list: HierarchySearchTree[] = [];\n        for (const { children, ...entry } of dictionary.values()) {\n          let processedEntry: (Omit<HierarchySearchTree, \"children\"> & { extras: TAcceptHandlerExtras }) | undefined =\n            entry;\n          if (props?.processEntry) {\n            processedEntry = props.processEntry({ treeEntry: entry, parentEntries });\n          }\n          if (!processedEntry) {\n            continue;\n          }\n          const { extras: _, ...entryWithoutExtras } = processedEntry;\n          parentEntries.push(processedEntry);\n          list.push({\n            ...entryWithoutExtras,\n            ...(children ? { children: Impl.#mapDictionaryToTree(children, parentEntries, props) } : undefined),\n          });\n          parentEntries.pop();\n        }\n        return list;\n      }\n\n      static #assignAutoExpandOptionsBasedOnReveal(\n        treePath: Pick<HierarchySearchTree, \"options\">[],\n        revealOption: HierarchySearchPathOptions[\"reveal\"] | undefined,\n      ) {\n        if (revealOption === true) {\n          Impl.#assignOptionsOnTreePath({\n            treePath,\n            targetEntryIndex: treePath.length - 1,\n            getEntryOptions: (index, targetEntryIndex) => {\n              if (index === targetEntryIndex) {\n                // auto-expand all grouping nodes of the revealed node\n                return { autoExpand: { groupingLevel: Number.MAX_SAFE_INTEGER } };\n              }\n              // auto-expand all parent nodes\n              return { autoExpand: true };\n            },\n          });\n        } else if (revealOption && \"groupingLevel\" in revealOption) {\n          Impl.#assignOptionsOnTreePath({\n            treePath,\n            targetEntryIndex: treePath.length - 1,\n            getEntryOptions: (index, targetEntryIndex) => {\n              if (index === targetEntryIndex) {\n                // the last entry should have `autoExpand` with `groupingLevel` set to the value based on `reveal.groupingLevel`\n                return { autoExpand: { groupingLevel: Math.max(revealOption.groupingLevel - 1, 0) } };\n              }\n              // auto-expand all parent nodes\n              return { autoExpand: true };\n            },\n          });\n        } else if (revealOption && \"depthInPath\" in revealOption) {\n          Impl.#assignOptionsOnTreePath({\n            treePath,\n            targetEntryIndex: Math.min(revealOption.depthInPath, treePath.length - 1),\n            getEntryOptions: (index, targetEntryIndex) => {\n              if (index === targetEntryIndex) {\n                // auto-expand all grouping nodes of the revealed node\n                return { autoExpand: { groupingLevel: Number.MAX_SAFE_INTEGER } };\n              }\n              // auto-expand all parent nodes\n              return { autoExpand: true };\n            },\n          });\n        }\n      }\n\n      static #assignOptionsOnTreePath({\n        treePath,\n        targetEntryIndex,\n        getEntryOptions,\n      }: {\n        treePath: Array<Pick<HierarchySearchTree, \"options\">>;\n        targetEntryIndex: number;\n        getEntryOptions: (index: number, targetEntryIndex: number) => HierarchySearchTree[\"options\"] | undefined;\n      }) {\n        // set all parent entries to auto-expand\n        for (let i = 0; i <= targetEntryIndex; i++) {\n          const options = mergeOptions(treePath[i].options, getEntryOptions(i, targetEntryIndex));\n          if (options) {\n            treePath[i].options = options;\n          }\n        }\n      }\n\n      #acceptNode({\n        parentEntries,\n        level,\n        node,\n        handler,\n      }: {\n        parentEntries: HierarchySearchTreeDictionaryEntry[];\n        level: HierarchySearchTreeDictionary;\n        node: Pick<HierarchySearchTree, \"identifier\" | \"isTarget\"> & { hasChildren: boolean };\n        handler?: AcceptHandler;\n      }): HierarchySearchTreeDictionaryEntry | undefined {\n        let entry = level.get(node.identifier);\n        if (!entry) {\n          if (handler?.onNewEntry && !handler.onNewEntry({ parentEntries, inputEntry: node })) {\n            return undefined;\n          }\n          entry = {\n            identifier: node.identifier,\n            children: node.hasChildren ? new Dictionary(HierarchyNodeIdentifier.compare) : undefined,\n            extras: {} as TAcceptHandlerExtras,\n          };\n          level.set(node.identifier, entry);\n        }\n\n        const isNodeSearchTarget = node.isTarget || !node.hasChildren;\n        if (isNodeSearchTarget && entry.children) {\n          entry.isTarget = true;\n        }\n        if (!entry.children && node.hasChildren) {\n          // Existing leaf nodes are implied targets. Preserve that status when adding children.\n          entry.isTarget = true;\n          entry.children = new Dictionary(HierarchyNodeIdentifier.compare);\n        }\n        handler?.onEntryHandled?.({ parentEntries, treeEntry: entry, inputEntry: node });\n        return entry;\n      }\n\n      #acceptPath({ path, handler }: { path: HierarchySearchPath; handler?: AcceptHandler }) {\n        const normalized = HierarchySearchPath.normalize(path);\n        const treePath: Array<HierarchySearchTreeDictionaryEntry> = [];\n        let currentLevel: HierarchySearchTreeDictionary = this.#rootsDictionary;\n        for (let i = 0; i < normalized.path.length; i++) {\n          const identifier = normalized.path[i];\n          const acceptedNode = this.#acceptNode({\n            parentEntries: treePath,\n            node: { identifier, hasChildren: i < normalized.path.length - 1 },\n            level: currentLevel,\n            handler,\n          });\n          if (!acceptedNode) {\n            break;\n          }\n          treePath.push(acceptedNode);\n          if (!acceptedNode.children) {\n            break;\n          }\n          currentLevel = acceptedNode.children;\n        }\n\n        if (treePath.length === 0) {\n          return;\n        }\n\n        // handle auto-expand\n        const lastNode = treePath[treePath.length - 1];\n        if (normalized.options?.autoExpand) {\n          (lastNode.options ??= {}).autoExpand = true;\n        }\n\n        // handle auto-reveal\n        Impl.#assignAutoExpandOptionsBasedOnReveal(treePath, normalized.options?.reveal);\n      }\n\n      #acceptTree({ tree, handler }: { tree: HierarchySearchTree; handler?: AcceptHandler }) {\n        const acceptTreeNode = (\n          parentEntries: HierarchySearchTreeDictionaryEntry[],\n          parentInputs: HierarchySearchTree[],\n          level: HierarchySearchTreeDictionary,\n          node: HierarchySearchTree,\n        ) => {\n          const acceptedNode = this.#acceptNode({\n            parentEntries,\n            node: { ...node, hasChildren: node.children !== undefined },\n            level,\n            handler,\n          });\n          if (!acceptedNode) {\n            // It was decided to reject this node and its children, if any\n            return;\n          }\n          const treePath = [...parentEntries, acceptedNode];\n          const inputsPath = [...parentInputs, node];\n          if (!node.children || node.isTarget) {\n            // Found an effective search target - merge options from its path\n            Impl.#assignOptionsOnTreePath({\n              treePath,\n              targetEntryIndex: treePath.length - 1,\n              getEntryOptions: (index) => inputsPath[index].options,\n            });\n          }\n          const currentLevel = acceptedNode.children;\n          if (currentLevel) {\n            node.children?.forEach((child) => acceptTreeNode(treePath, inputsPath, currentLevel, child));\n          }\n        };\n        acceptTreeNode([], [], this.#rootsDictionary, tree);\n      }\n\n      public accept(\n        props: ({ path: HierarchySearchPath } | { tree: HierarchySearchTree }) & { handler?: AcceptHandler },\n      ): HierarchySearchTreeBuilder<TAcceptHandlerExtras> {\n        if (\"path\" in props) {\n          this.#acceptPath(props);\n        } else {\n          this.#acceptTree(props);\n        }\n        return this;\n      }\n\n      public getTree(props?: HierarchySearchTreeBuilderFinalizeTreeProps<TAcceptHandlerExtras>) {\n        return Impl.#mapDictionaryToTree(this.#rootsDictionary, [], props);\n      }\n    })();\n  }\n\n  /**\n   * Builds a list of `HierarchySearchTree` nodes from an iterable of search paths. Shared\n   * path prefixes are merged so that each unique hierarchy node identifier appears only once\n   * per level. The resulting trees carry `isTarget`, `options`, and `children` attributes\n   * derived from the paths and their options (`autoExpand`, `reveal`).\n   *\n   * @public\n   */\n  export async function createFromPathsList(paths: Iterable<HierarchySearchPath>): Promise<HierarchySearchTree[]> {\n    return firstValueFrom(\n      from(paths).pipe(\n        releaseMainThreadOnItemsCount(1000),\n        reduce((builder, path) => builder.accept({ path }), createBuilder()),\n        map((builder) => builder.getTree()),\n      ),\n    );\n  }\n\n  /**\n   * Merges two `HierarchySearchTree` option objects. For the `autoExpand` attribute,\n   * `true` takes precedence over `{ groupingLevel }`, and when both sides are\n   * `{ groupingLevel }` objects the larger value wins.\n   * @public\n   */\n  export function mergeOptions(\n    lhs: HierarchySearchTree[\"options\"] | undefined,\n    rhs: HierarchySearchTree[\"options\"] | undefined,\n  ): HierarchySearchTree[\"options\"] | undefined {\n    if (!lhs) {\n      return rhs;\n    }\n    if (!rhs) {\n      return lhs;\n    }\n    const autoExpand = mergeSearchTreeAutoExpandOption(lhs.autoExpand, rhs.autoExpand);\n    const options: NonNullable<HierarchySearchTree[\"options\"]> = { ...(autoExpand ? { autoExpand } : undefined) };\n    return Object.keys(options).length > 0 ? options : undefined;\n  }\n\n  function mergeSearchTreeAutoExpandOption(\n    lhs: NonNullable<HierarchySearchTree[\"options\"]>[\"autoExpand\"] | undefined,\n    rhs: NonNullable<HierarchySearchTree[\"options\"]>[\"autoExpand\"] | undefined,\n  ): NonNullable<HierarchySearchTree[\"options\"]>[\"autoExpand\"] | undefined {\n    if (!lhs) {\n      return rhs;\n    }\n    if (!rhs) {\n      return lhs;\n    }\n    return lhs === true || rhs === true ? true : { groupingLevel: Math.max(lhs.groupingLevel, rhs.groupingLevel) };\n  }\n}\n\nfunction extractSearchPropsInternal(\n  rootLevelSearchProps: HierarchySearchTree[] | undefined,\n  parentNode: Pick<NonGroupingHierarchyNode, \"search\"> | undefined,\n): { childrenTargetPaths?: HierarchySearchTree[]; hasSearchTargetAncestor: boolean } | undefined {\n  if (!parentNode) {\n    return rootLevelSearchProps\n      ? { childrenTargetPaths: rootLevelSearchProps, hasSearchTargetAncestor: false }\n      : undefined;\n  }\n  const searchProps: { childrenTargetPaths?: HierarchySearchTree[]; hasSearchTargetAncestor: boolean } = {\n    ...(parentNode.search?.childrenTargetPaths\n      ? { childrenTargetPaths: parentNode.search.childrenTargetPaths }\n      : undefined),\n    hasSearchTargetAncestor: !!parentNode.search?.hasSearchTargetAncestor || !!parentNode.search?.isSearchTarget,\n  };\n  return searchProps.childrenTargetPaths || searchProps.hasSearchTargetAncestor ? searchProps : undefined;\n}\n\n/**\n * Creates a set of utilities for making it easier to search the given hierarchy\n * level.\n *\n * @public\n */\nexport function createHierarchySearchHelper(\n  rootLevelSearchProps: HierarchySearchTree[] | undefined,\n  parentNode: Pick<NonGroupingHierarchyNode, \"search\"> | undefined,\n) {\n  const searchProps = extractSearchPropsInternal(rootLevelSearchProps, parentNode);\n  const hasSearch = !!searchProps;\n\n  function saveSearchPropsFromPathsIntoReducer(\n    extractionProps: { pathsReducer: MatchingSearchPathsReducer; nodeKey: InstancesNodeKey | GenericNodeKey } & (\n      | { pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean }\n      | {}\n    ),\n  ): void;\n  function saveSearchPropsFromPathsIntoReducer(extractionProps: {\n    pathsReducer: MatchingSearchPathsReducer;\n    nodeKey: InstancesNodeKey | GenericNodeKey;\n    asyncPathMatcher: (identifier: HierarchyNodeIdentifier) => boolean | Promise<boolean>;\n  }): void | Promise<void>;\n  function saveSearchPropsFromPathsIntoReducer(\n    extractionProps: { pathsReducer: MatchingSearchPathsReducer; nodeKey: InstancesNodeKey | GenericNodeKey } & (\n      | { pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean }\n      | { asyncPathMatcher: (identifier: HierarchyNodeIdentifier) => boolean | Promise<boolean> }\n      | {}\n    ),\n  ): void | Promise<void> {\n    // Passes down matching hierarchy search trees to the reducer.\n    // It uses `nodeKey`, `pathMatcher` or `asyncPathMatcher` to check if `HierarchyNodeIdentifier` in the search tree item's identifier matches the node\n    // and if it does, the path is passed down to the reducer.\n    // This function returns a promise only if `asyncPathMatcher` returns a promise.\n    if (!searchProps?.childrenTargetPaths) {\n      return;\n    }\n    const matchedTreePromises = new Array<Promise<HierarchySearchTree | undefined>>();\n    for (const childrenSearchTree of searchProps.childrenTargetPaths) {\n      if (\"asyncPathMatcher\" in extractionProps) {\n        const matchesPossiblyPromise = extractionProps.asyncPathMatcher(childrenSearchTree.identifier);\n        if (matchesPossiblyPromise instanceof Promise) {\n          matchedTreePromises.push(\n            matchesPossiblyPromise.then((matches) => (matches ? childrenSearchTree : undefined)),\n          );\n        } else if (matchesPossiblyPromise) {\n          extractionProps.pathsReducer.accept(childrenSearchTree);\n        }\n      } else {\n        const matches =\n          \"pathMatcher\" in extractionProps\n            ? extractionProps.pathMatcher(childrenSearchTree.identifier)\n            : nodeKeyMatchesIdentifier(extractionProps.nodeKey, childrenSearchTree.identifier);\n        if (matches) {\n          extractionProps.pathsReducer.accept(childrenSearchTree);\n        }\n      }\n    }\n    if (matchedTreePromises.length === 0) {\n      return;\n    }\n    return Promise.all(matchedTreePromises).then((matchedTrees) =>\n      matchedTrees.forEach((matchedTree) => matchedTree && extractionProps.pathsReducer.accept(matchedTree)),\n    );\n  }\n\n  function createChildNodeProps(props: {\n    nodeKey: InstancesNodeKey | GenericNodeKey;\n  }): Pick<NonGroupingHierarchyNode, \"search\" | \"autoExpand\"> | undefined;\n  function createChildNodeProps(props: {\n    nodeKey: InstancesNodeKey | GenericNodeKey;\n    pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean;\n  }): Pick<NonGroupingHierarchyNode, \"search\" | \"autoExpand\"> | undefined;\n  function createChildNodeProps(props: {\n    nodeKey: InstancesNodeKey | GenericNodeKey;\n    asyncPathMatcher: (identifier: HierarchyNodeIdentifier) => boolean | Promise<boolean>;\n  }):\n    | Promise<Pick<NonGroupingHierarchyNode, \"search\" | \"autoExpand\"> | undefined>\n    | Pick<NonGroupingHierarchyNode, \"search\" | \"autoExpand\">\n    | undefined;\n  function createChildNodeProps(\n    props: { nodeKey: InstancesNodeKey | GenericNodeKey } & (\n      | { asyncPathMatcher: (identifier: HierarchyNodeIdentifier) => boolean | Promise<boolean> }\n      | { pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean }\n      | {}\n    ),\n  ):\n    | Promise<Pick<NonGroupingHierarchyNode, \"search\" | \"autoExpand\"> | undefined>\n    | Pick<NonGroupingHierarchyNode, \"search\" | \"autoExpand\">\n    | undefined {\n    if (!hasSearch) {\n      return undefined;\n    }\n\n    const reducer = new MatchingSearchPathsReducer(searchProps.hasSearchTargetAncestor);\n    if (\"asyncPathMatcher\" in props) {\n      const extractResult = saveSearchPropsFromPathsIntoReducer({\n        pathsReducer: reducer,\n        nodeKey: props.nodeKey,\n        asyncPathMatcher: props.asyncPathMatcher,\n      });\n      if (extractResult instanceof Promise) {\n        return extractResult.then(() => reducer.aggregatedOptions);\n      }\n    } else {\n      saveSearchPropsFromPathsIntoReducer({ pathsReducer: reducer, ...props });\n    }\n    return reducer.aggregatedOptions;\n  }\n\n  return {\n    /** Returns a flag indicating if the hierarchy level is filtered. */\n    hasSearch,\n    /**\n     * Returns a flag indicating whether this hierarchy level has an ancestor node\n     * that is a search target. That generally means that this and all downstream hierarchy\n     * levels should be displayed without search being applied to them, even if search paths\n     * say otherwise.\n     */\n    hasSearchTargetAncestor: searchProps?.hasSearchTargetAncestor ?? false,\n    /**\n     * Returns a list of hierarchy node identifiers that apply specifically for this\n     * hierarchy level. Returns `undefined` if search is not applied to this level.\n     */\n    getChildNodeSearchIdentifiers: () => {\n      if (!searchProps?.childrenTargetPaths) {\n        return undefined;\n      }\n      return searchProps.childrenTargetPaths.map(({ identifier }) => identifier);\n    },\n    /**\n     * When a hierarchy node is created for a filtered hierarchy level, it needs some attributes (e.g. `search`\n     * and `autoExpand`) to be set based on the search paths and search options. This function calculates\n     * these props for a child node based on its key or path matcher.\n     *\n     * When using `pathMatcher` or `asyncPathMatcher` prop, callers have more flexibility to decide whether the given `HierarchyNodeIdentifier` applies\n     * to their node. For example, only some parts of the identifier can be checked for improved performance. Otherwise, the\n     * `nodeKey` prop can be used to check the whole identifier.\n     *\n     * There are multiple overloads of `createChildNodeProps`: depending on props type it returns different values:\n     * - `asyncPathMatcher` is provided - returns either Promise or the regular return value based on whether or not `asyncPathMatcher` returns a `Promise`.\n     * - `pathMatcher` or only `nodeKey` is provided - returns undefined **or** `search` and `autoExpand` prop from `HierarchyNode`;\n     */\n    createChildNodeProps,\n  };\n}\n\nfunction nodeKeyMatchesIdentifier(\n  nodeKey: InstancesNodeKey | GenericNodeKey,\n  identifier: HierarchyNodeIdentifier,\n): boolean {\n  return (\n    (HierarchyNodeKey.isGeneric(nodeKey) && HierarchyNodeIdentifier.equal(identifier, nodeKey)) ||\n    (HierarchyNodeKey.isInstances(nodeKey) &&\n      nodeKey.instanceKeys.some((ik) => HierarchyNodeIdentifier.equal(identifier, ik)))\n  );\n}\n\n/**\n * Extracts information from search paths and later returns `search` and `autoExpand` values from `HierarchyNode`.\n *\n * Saved values can be applied to a single `HierarchyNode` - this means that a new reducer should be created every time these props are requested for a `HierarchyNode`.\n *\n * Extracts information using `accept` function:\n * - Determines if node is search target, and if it is saves the options as `searchTargetOptions`\n * - Saves `HierarchySearchPathOptions` and `childrenTargetPaths`\n */\nclass MatchingSearchPathsReducer {\n  private _childrenTargetPaths = new Array<HierarchySearchTree>();\n  private _isSearchTarget = false;\n  private _options: HierarchySearchTree[\"options\"] | undefined = undefined;\n\n  public constructor(private _hasSearchTargetAncestor: boolean) {}\n\n  public accept(tree: HierarchySearchTree): void {\n    if (tree.isTarget || tree.children === undefined) {\n      this._isSearchTarget = true;\n    }\n    if (tree.children && tree.children.length > 0) {\n      this._childrenTargetPaths.push(...tree.children);\n    }\n    this._options = HierarchySearchTree.mergeOptions(this._options, tree.options);\n  }\n\n  public get aggregatedOptions() {\n    const search =\n      this._hasSearchTargetAncestor || this._isSearchTarget || this._childrenTargetPaths.length > 0 || this._options\n        ? {\n            ...(this._hasSearchTargetAncestor ? { hasSearchTargetAncestor: true } : undefined),\n            ...(this._isSearchTarget ? { isSearchTarget: true } : undefined),\n            ...(this._childrenTargetPaths.length > 0 ? { childrenTargetPaths: this._childrenTargetPaths } : undefined),\n            ...(this._options ? { options: this._options } : undefined),\n          }\n        : undefined;\n    const autoExpand = this._options?.autoExpand === true;\n    return { ...(search ? { search } : undefined), ...(autoExpand ? { autoExpand } : undefined) };\n  }\n}\n"]}

package/lib/esm/hierarchies/Logging.d.ts

@@ -1,13 +0,0 @@
-import type { ILogger } from "@itwin/presentation-shared";
-/**
- * Set logger to use by this package. By default the package uses a no-op logger.
- * @public
- */
-export declare function setLogger(logger: ILogger | undefined): void;
-/**
- * Get logger used by this package.
- * @see `setLogger`
- * @public
- */
-export declare function getLogger(): ILogger;
-//# sourceMappingURL=Logging.d.ts.map

package/lib/esm/hierarchies/Logging.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Logging.d.ts","sourceRoot":"","sources":["../../../src/hierarchies/Logging.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAK1D;;;GAGG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,QAEpD;AAED;;;;GAIG;AACH,wBAAgB,SAAS,IAAI,OAAO,CAEnC"}

package/lib/esm/hierarchies/Logging.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Logging.js","sourceRoot":"","sources":["../../../src/hierarchies/Logging.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAIzD,gEAAgE;AAChE,IAAI,QAAQ,GAAY,WAAW,CAAC;AAEpC;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAA2B;IACnD,QAAQ,GAAG,MAAM,IAAI,iCAAiC,CAAC,WAAW,CAAC;AACrE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS;IACvB,OAAO,QAAQ,CAAC;AAClB,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 { NOOP_LOGGER } from \"@itwin/presentation-shared\";\n\nimport type { ILogger } from \"@itwin/presentation-shared\";\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nlet g_logger: ILogger = NOOP_LOGGER;\n\n/**\n * Set logger to use by this package. By default the package uses a no-op logger.\n * @public\n */\nexport function setLogger(logger: ILogger | undefined) {\n  g_logger = logger ?? /* v8 ignore next -- @preserve */ NOOP_LOGGER;\n}\n\n/**\n * Get logger used by this package.\n * @see `setLogger`\n * @public\n */\nexport function getLogger(): ILogger {\n  return g_logger;\n}\n"]}

package/lib/esm/hierarchies/imodel/HierarchyCache.d.ts

@@ -1,18 +0,0 @@
-import type { GetHierarchyNodesProps } from "../HierarchyProvider.js";
-interface ChildNodeObservablesCacheProps {
-    size: number;
-    variationsCount?: number;
-}
-/** @internal */
-export declare class HierarchyCache<T> {
-    private _map;
-    private _props;
-    constructor(props: ChildNodeObservablesCacheProps);
-    private createCacheKeys;
-    private getCacheAccessors;
-    set(requestProps: GetHierarchyNodesProps, value: T): void;
-    get(requestProps: GetHierarchyNodesProps): T | undefined;
-    clear(): void;
-}
-export {};
-//# sourceMappingURL=HierarchyCache.d.ts.map

package/lib/esm/hierarchies/imodel/HierarchyCache.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchyCache.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/imodel/HierarchyCache.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAStE,UAAU,8BAA8B;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,gBAAgB;AAChB,qBAAa,cAAc,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAA4D;IACxE,OAAO,CAAC,MAAM,CAAiC;gBAE5B,KAAK,EAAE,8BAA8B;IAKxD,OAAO,CAAC,eAAe;IAuBvB,OAAO,CAAC,iBAAiB;IAyBlB,GAAG,CAAC,YAAY,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;IAKlD,GAAG,CAAC,YAAY,EAAE,sBAAsB,GAAG,CAAC,GAAG,SAAS;IAKxD,KAAK;CAGb"}