@itwin/presentation-hierarchies 2.0.0-alpha.2 → 2.0.0-alpha.20

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

@@ -1,60 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.partition = partition;
-const rxjs_1 = require("rxjs");
-const core_bentley_1 = require("@itwin/core-bentley");
-/**
- * This is similar to `rxjs` `partition` operator, but it subscribes to source observable only once.
- * @internal
- */
-function partition(source, predicate) {
-    const matches = new rxjs_1.ReplaySubject();
-    const nonMatches = new rxjs_1.ReplaySubject();
-    let sourceSubscription;
-    let sourceSubscriptionsCount = 0;
-    function subscribeToSource() {
-        if (sourceSubscriptionsCount++ > 0) {
-            return;
-        }
-        (0, core_bentley_1.assert)(!sourceSubscription);
-        sourceSubscription = (0, rxjs_1.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() {
-        (0, core_bentley_1.assert)(sourceSubscriptionsCount > 0);
-        if (--sourceSubscriptionsCount === 0) {
-            (0, core_bentley_1.assert)(!!sourceSubscription);
-            sourceSubscription.unsubscribe();
-            sourceSubscription = undefined;
-        }
-    }
-    return [matches, nonMatches].map((subject) => new rxjs_1.Observable((subscriber) => {
-        const subjectSubscription = subject.subscribe(subscriber);
-        subscribeToSource();
-        return () => {
-            subjectSubscription.unsubscribe();
-            unsubscribeFromSource();
-        };
-    }));
-}
-//# sourceMappingURL=Partition.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Partition.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Partition.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAchG,8BA+CC;AA3DD,+BAAsF;AACtF,sDAA6C;AAO7C;;;GAGG;AACH,SAAgB,SAAS,CAAI,MAA0B,EAAE,SAAgC;IACvF,MAAM,OAAO,GAAG,IAAI,oBAAa,EAAK,CAAC;IACvC,MAAM,UAAU,GAAG,IAAI,oBAAa,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,IAAA,qBAAM,EAAC,CAAC,kBAAkB,CAAC,CAAC;QAC5B,kBAAkB,GAAG,IAAA,WAAI,EAAC,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,IAAA,qBAAM,EAAC,wBAAwB,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,EAAE,wBAAwB,KAAK,CAAC,EAAE,CAAC;YACrC,IAAA,qBAAM,EAAC,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,iBAAU,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/cjs/hierarchies/internal/operators/ReduceToMergeMap.d.ts

@@ -1,22 +0,0 @@
-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/cjs/hierarchies/internal/operators/ReduceToMergeMap.d.ts.map

@@ -1 +0,0 @@
-{"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,eAAe,CAAC,WAAW,CAAC,sDAa7C"}

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

@@ -1,50 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.reduceToMergeMapList = reduceToMergeMapList;
-exports.reduceToMergeMapItem = reduceToMergeMapItem;
-const rxjs_1 = require("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
- */
-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
- */
-function reduceToMergeMapItem(key, mergeFunc) {
-    return (source) => (0, rxjs_1.from)(source).pipe((0, rxjs_1.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/cjs/hierarchies/internal/operators/ReduceToMergeMap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ReduceToMergeMap.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReduceToMergeMap.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAahG,oDAQC;AAWD,oDAiBC;AA/CD,+BAAqD;AAErD;;;;;;;;GAQG;AACH,SAAgB,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,SAAgB,oBAAoB,CAClC,GAAkC,EAClC,SAA+E;IAE/E,OAAO,CAAC,MAAoC,EAAE,EAAE,CAC9C,IAAA,WAAI,EAAC,MAAM,CAAC,CAAC,IAAI,CACf,IAAA,aAAM,EAAqC,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/cjs/hierarchies/internal/operators/ReleaseMainThread.d.ts.map

@@ -1 +0,0 @@
-{"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,UAAU,CAAC,CAAC,CAAC,KAAG,UAAU,CAAC,CAAC,CAAC,CAa3C"}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"ReleaseMainThread.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReleaseMainThread.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAQhG,sEAcC;AApBD,+BAAgF;AAEhF;;;GAGG;AACH,SAAgB,6BAA6B,CAAI,YAAoB;IACnE,OAAO,CAAC,GAAkB,EAAiB,EAAE;QAC3C,OAAO,GAAG,CAAC,IAAI,CACb,IAAA,kBAAW,EAAC,YAAY,CAAC,EACzB,IAAA,gBAAS,EAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,GAAG,GAAG,IAAA,SAAE,EAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;gBAC1C,OAAO,GAAG,CAAC;YACb,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,EACF,IAAA,gBAAS,GAAE,CACZ,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { bufferCount, concatAll, concatMap, delay, 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/cjs/hierarchies/internal/operators/ShareReplayWithErrors.d.ts.map

@@ -1 +0,0 @@
-{"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/cjs/hierarchies/internal/operators/ShareReplayWithErrors.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"ShareReplayWithErrors.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ShareReplayWithErrors.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAUhG,sDAOC;AAfD,+BAAsE;AAEtE;;;;;GAKG;AACH,SAAgB,qBAAqB;IACnC,OAAO,IAAA,YAAK,EAAI;QACd,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI,oBAAa,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/cjs/hierarchies/internal/operators/Sorting.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Sorting.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Sorting.ts"],"names":[],"mappings":"AAKA,OAAO,EAAkB,UAAU,EAAU,MAAM,MAAM,CAAC;AAI1D;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,SAAS;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAYrH"}

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

@@ -1,25 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sortNodesByLabelOperator = sortNodesByLabelOperator;
-const rxjs_1 = require("rxjs");
-const core_bentley_1 = require("@itwin/core-bentley");
-const Common_js_1 = require("../Common.js");
-/**
- * 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
- */
-function sortNodesByLabelOperator(nodes) {
-    return nodes.pipe((0, rxjs_1.reduce)((sorted, node) => {
-        sorted.insert(node);
-        return sorted;
-    }, new core_bentley_1.SortedArray(Common_js_1.compareNodesByLabel, core_bentley_1.DuplicatePolicy.Allow)), (0, rxjs_1.map)((sortedArray) => sortedArray.extractArray()), (0, rxjs_1.concatAll)());
-}
-//# sourceMappingURL=Sorting.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Sorting.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Sorting.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAchG,4DAYC;AAxBD,+BAA0D;AAC1D,sDAAmE;AACnE,4CAAmD;AAEnD;;;;;;;GAOG;AACH,SAAgB,wBAAwB,CAAkC,KAAwB;IAChG,OAAO,KAAK,CAAC,IAAI,CACf,IAAA,aAAM,EACJ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;QACf,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC,EACD,IAAI,0BAAW,CAAQ,+BAAmB,EAAE,8BAAe,CAAC,KAAK,CAAC,CACnE,EACD,IAAA,UAAG,EAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC,EAChD,IAAA,gBAAS,GAAE,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 { compareNodesByLabel } from \"../Common.js\";\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<TNode extends { label: string }>(nodes: Observable<TNode>): Observable<TNode> {\n  return nodes.pipe(\n    reduce(\n      (sorted, node) => {\n        sorted.insert(node);\n        return sorted;\n      },\n      new SortedArray<TNode>(compareNodesByLabel, DuplicatePolicy.Allow),\n    ),\n    map((sortedArray) => sortedArray.extractArray()),\n    concatAll(),\n  );\n}\n"]}

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

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

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

@@ -1 +0,0 @@
-{"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/cjs/hierarchies/internal/operators/TapOnce.js

@@ -1,19 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.tapOnce = tapOnce;
-const rxjs_1 = require("rxjs");
-/** @internal */
-function tapOnce(observer) {
-    let first = true;
-    return (source) => source.pipe((0, rxjs_1.tap)(() => {
-        if (first) {
-            first = false;
-            observer();
-        }
-    }));
-}
-//# sourceMappingURL=TapOnce.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TapOnce.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/TapOnce.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAKhG,0BAWC;AAdD,+BAAqD;AAErD,gBAAgB;AAChB,SAAgB,OAAO,CAAI,QAAoB;IAC7C,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,OAAO,CAAC,MAAM,EAAE,EAAE,CAChB,MAAM,CAAC,IAAI,CACT,IAAA,UAAG,EAAC,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/cjs/package.json

@@ -1 +0,0 @@
-{ "type": "commonjs" }

package/lib/cjs/presentation-hierarchies.d.ts

@@ -1,15 +0,0 @@
-export { GenericInstanceFilter } from "@itwin/core-common";
-export { DefineHierarchyLevelProps, HierarchyLevelDefinition, HierarchyDefinition, HierarchyNodesDefinition, NodeParser, NodePostProcessor, NodePreProcessor, } from "./hierarchies/imodel/IModelHierarchyDefinition.js";
-export { DefineGenericNodeChildHierarchyLevelProps, DefineInstanceNodeChildHierarchyLevelProps, DefineRootHierarchyLevelProps, createPredicateBasedHierarchyDefinition, } from "./hierarchies/imodel/PredicateBasedHierarchyDefinition.js";
-export { LimitingECSqlQueryExecutor, createLimitingECSqlQueryExecutor } from "./hierarchies/imodel/LimitingECSqlQueryExecutor.js";
-export { NodeSelectClauseColumnNames, NodesQueryClauseFactory, createNodesQueryClauseFactory } from "./hierarchies/imodel/NodeSelectQueryFactory.js";
-export { createIModelHierarchyProvider } from "./hierarchies/imodel/IModelHierarchyProvider.js";
-export { SourceHierarchyNode, ProcessedHierarchyNode } from "./hierarchies/imodel/IModelHierarchyNode.js";
-export { RowsLimitExceededError } from "./hierarchies/HierarchyErrors.js";
-export { GroupingHierarchyNode, HierarchyNode, NonGroupingHierarchyNode } from "./hierarchies/HierarchyNode.js";
-export { HierarchyNodeIdentifier, HierarchyNodeIdentifiersPath } from "./hierarchies/HierarchyNodeIdentifier.js";
-export { GenericNodeKey, GroupingNodeKey, HierarchyNodeKey, InstancesNodeKey, ClassGroupingNodeKey, LabelGroupingNodeKey, PropertyGroupingNodeKey, PropertyOtherValuesGroupingNodeKey, PropertyValueGroupingNodeKey, PropertyValueRangeGroupingNodeKey, IModelHierarchyNodeKey, } from "./hierarchies/HierarchyNodeKey.js";
-export { GetHierarchyNodesProps, HierarchyProvider, mergeProviders } from "./hierarchies/HierarchyProvider.js";
-export { createHierarchyFilteringHelper, extractFilteringProps, HierarchyFilteringPath, HierarchyFilteringPathOptions, } from "./hierarchies/HierarchyFiltering.js";
-export { getLogger, setLogger } from "./hierarchies/Logging.js";
-//# sourceMappingURL=presentation-hierarchies.d.ts.map

package/lib/cjs/presentation-hierarchies.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"presentation-hierarchies.d.ts","sourceRoot":"","sources":["../../src/presentation-hierarchies.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,OAAO,EACL,yBAAyB,EACzB,wBAAwB,EACxB,mBAAmB,EACnB,wBAAwB,EACxB,UAAU,EACV,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,mDAAmD,CAAC;AAC3D,OAAO,EACL,yCAAyC,EACzC,0CAA0C,EAC1C,6BAA6B,EAC7B,uCAAuC,GACxC,MAAM,2DAA2D,CAAC;AACnE,OAAO,EAAE,0BAA0B,EAAE,gCAAgC,EAAE,MAAM,oDAAoD,CAAC;AAClI,OAAO,EAAE,2BAA2B,EAAE,uBAAuB,EAAE,6BAA6B,EAAE,MAAM,gDAAgD,CAAC;AACrJ,OAAO,EAAE,6BAA6B,EAAE,MAAM,iDAAiD,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAE1G,OAAO,EAAE,sBAAsB,EAAE,MAAM,kCAAkC,CAAC;AAC1E,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAC;AAChH,OAAO,EAAE,uBAAuB,EAAE,4BAA4B,EAAE,MAAM,0CAA0C,CAAC;AACjH,OAAO,EACL,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,EACpB,oBAAoB,EACpB,uBAAuB,EACvB,kCAAkC,EAClC,4BAA4B,EAC5B,iCAAiC,EACjC,sBAAsB,GACvB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AAC/G,OAAO,EACL,8BAA8B,EAC9B,qBAAqB,EACrB,sBAAsB,EACtB,6BAA6B,GAC9B,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC"}

package/lib/cjs/presentation-hierarchies.js

@@ -1,40 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.setLogger = exports.getLogger = exports.HierarchyFilteringPath = exports.extractFilteringProps = exports.createHierarchyFilteringHelper = exports.mergeProviders = exports.HierarchyNodeKey = exports.HierarchyNodeIdentifier = exports.HierarchyNode = exports.RowsLimitExceededError = exports.ProcessedHierarchyNode = exports.createIModelHierarchyProvider = exports.createNodesQueryClauseFactory = exports.NodeSelectClauseColumnNames = exports.createLimitingECSqlQueryExecutor = exports.createPredicateBasedHierarchyDefinition = exports.HierarchyNodesDefinition = exports.GenericInstanceFilter = void 0;
-var core_common_1 = require("@itwin/core-common");
-Object.defineProperty(exports, "GenericInstanceFilter", { enumerable: true, get: function () { return core_common_1.GenericInstanceFilter; } });
-var IModelHierarchyDefinition_js_1 = require("./hierarchies/imodel/IModelHierarchyDefinition.js");
-Object.defineProperty(exports, "HierarchyNodesDefinition", { enumerable: true, get: function () { return IModelHierarchyDefinition_js_1.HierarchyNodesDefinition; } });
-var PredicateBasedHierarchyDefinition_js_1 = require("./hierarchies/imodel/PredicateBasedHierarchyDefinition.js");
-Object.defineProperty(exports, "createPredicateBasedHierarchyDefinition", { enumerable: true, get: function () { return PredicateBasedHierarchyDefinition_js_1.createPredicateBasedHierarchyDefinition; } });
-var LimitingECSqlQueryExecutor_js_1 = require("./hierarchies/imodel/LimitingECSqlQueryExecutor.js");
-Object.defineProperty(exports, "createLimitingECSqlQueryExecutor", { enumerable: true, get: function () { return LimitingECSqlQueryExecutor_js_1.createLimitingECSqlQueryExecutor; } });
-var NodeSelectQueryFactory_js_1 = require("./hierarchies/imodel/NodeSelectQueryFactory.js");
-Object.defineProperty(exports, "NodeSelectClauseColumnNames", { enumerable: true, get: function () { return NodeSelectQueryFactory_js_1.NodeSelectClauseColumnNames; } });
-Object.defineProperty(exports, "createNodesQueryClauseFactory", { enumerable: true, get: function () { return NodeSelectQueryFactory_js_1.createNodesQueryClauseFactory; } });
-var IModelHierarchyProvider_js_1 = require("./hierarchies/imodel/IModelHierarchyProvider.js");
-Object.defineProperty(exports, "createIModelHierarchyProvider", { enumerable: true, get: function () { return IModelHierarchyProvider_js_1.createIModelHierarchyProvider; } });
-var IModelHierarchyNode_js_1 = require("./hierarchies/imodel/IModelHierarchyNode.js");
-Object.defineProperty(exports, "ProcessedHierarchyNode", { enumerable: true, get: function () { return IModelHierarchyNode_js_1.ProcessedHierarchyNode; } });
-var HierarchyErrors_js_1 = require("./hierarchies/HierarchyErrors.js");
-Object.defineProperty(exports, "RowsLimitExceededError", { enumerable: true, get: function () { return HierarchyErrors_js_1.RowsLimitExceededError; } });
-var HierarchyNode_js_1 = require("./hierarchies/HierarchyNode.js");
-Object.defineProperty(exports, "HierarchyNode", { enumerable: true, get: function () { return HierarchyNode_js_1.HierarchyNode; } });
-var HierarchyNodeIdentifier_js_1 = require("./hierarchies/HierarchyNodeIdentifier.js");
-Object.defineProperty(exports, "HierarchyNodeIdentifier", { enumerable: true, get: function () { return HierarchyNodeIdentifier_js_1.HierarchyNodeIdentifier; } });
-var HierarchyNodeKey_js_1 = require("./hierarchies/HierarchyNodeKey.js");
-Object.defineProperty(exports, "HierarchyNodeKey", { enumerable: true, get: function () { return HierarchyNodeKey_js_1.HierarchyNodeKey; } });
-var HierarchyProvider_js_1 = require("./hierarchies/HierarchyProvider.js");
-Object.defineProperty(exports, "mergeProviders", { enumerable: true, get: function () { return HierarchyProvider_js_1.mergeProviders; } });
-var HierarchyFiltering_js_1 = require("./hierarchies/HierarchyFiltering.js");
-Object.defineProperty(exports, "createHierarchyFilteringHelper", { enumerable: true, get: function () { return HierarchyFiltering_js_1.createHierarchyFilteringHelper; } });
-Object.defineProperty(exports, "extractFilteringProps", { enumerable: true, get: function () { return HierarchyFiltering_js_1.extractFilteringProps; } });
-Object.defineProperty(exports, "HierarchyFilteringPath", { enumerable: true, get: function () { return HierarchyFiltering_js_1.HierarchyFilteringPath; } });
-var Logging_js_1 = require("./hierarchies/Logging.js");
-Object.defineProperty(exports, "getLogger", { enumerable: true, get: function () { return Logging_js_1.getLogger; } });
-Object.defineProperty(exports, "setLogger", { enumerable: true, get: function () { return Logging_js_1.setLogger; } });
-//# sourceMappingURL=presentation-hierarchies.js.map

package/lib/cjs/presentation-hierarchies.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"presentation-hierarchies.js","sourceRoot":"","sources":["../../src/presentation-hierarchies.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,kDAA2D;AAAlD,oHAAA,qBAAqB,OAAA;AAE9B,kGAQ2D;AAJzD,wIAAA,wBAAwB,OAAA;AAK1B,kHAKmE;AADjE,+JAAA,uCAAuC,OAAA;AAEzC,oGAAkI;AAA7F,iJAAA,gCAAgC,OAAA;AACrE,4FAAqJ;AAA5I,wIAAA,2BAA2B,OAAA;AAA2B,0IAAA,6BAA6B,OAAA;AAC5F,8FAAgG;AAAvF,2IAAA,6BAA6B,OAAA;AACtC,sFAA0G;AAA5E,gIAAA,sBAAsB,OAAA;AAEpD,uEAA0E;AAAjE,4HAAA,sBAAsB,OAAA;AAC/B,mEAAgH;AAAhF,iHAAA,aAAa,OAAA;AAC7C,uFAAiH;AAAxG,qIAAA,uBAAuB,OAAA;AAChC,yEAY2C;AATzC,uHAAA,gBAAgB,OAAA;AAUlB,2EAA+G;AAA3D,sHAAA,cAAc,OAAA;AAClE,6EAK6C;AAJ3C,uIAAA,8BAA8B,OAAA;AAC9B,8HAAA,qBAAqB,OAAA;AACrB,+HAAA,sBAAsB,OAAA;AAGxB,uDAAgE;AAAvD,uGAAA,SAAS,OAAA;AAAE,uGAAA,SAAS,OAAA","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\nexport { GenericInstanceFilter } from \"@itwin/core-common\";\n\nexport {\n  DefineHierarchyLevelProps,\n  HierarchyLevelDefinition,\n  HierarchyDefinition,\n  HierarchyNodesDefinition,\n  NodeParser,\n  NodePostProcessor,\n  NodePreProcessor,\n} from \"./hierarchies/imodel/IModelHierarchyDefinition.js\";\nexport {\n  DefineGenericNodeChildHierarchyLevelProps,\n  DefineInstanceNodeChildHierarchyLevelProps,\n  DefineRootHierarchyLevelProps,\n  createPredicateBasedHierarchyDefinition,\n} from \"./hierarchies/imodel/PredicateBasedHierarchyDefinition.js\";\nexport { LimitingECSqlQueryExecutor, createLimitingECSqlQueryExecutor } from \"./hierarchies/imodel/LimitingECSqlQueryExecutor.js\";\nexport { NodeSelectClauseColumnNames, NodesQueryClauseFactory, createNodesQueryClauseFactory } from \"./hierarchies/imodel/NodeSelectQueryFactory.js\";\nexport { createIModelHierarchyProvider } from \"./hierarchies/imodel/IModelHierarchyProvider.js\";\nexport { SourceHierarchyNode, ProcessedHierarchyNode } from \"./hierarchies/imodel/IModelHierarchyNode.js\";\n\nexport { RowsLimitExceededError } from \"./hierarchies/HierarchyErrors.js\";\nexport { GroupingHierarchyNode, HierarchyNode, NonGroupingHierarchyNode } from \"./hierarchies/HierarchyNode.js\";\nexport { HierarchyNodeIdentifier, HierarchyNodeIdentifiersPath } from \"./hierarchies/HierarchyNodeIdentifier.js\";\nexport {\n  GenericNodeKey,\n  GroupingNodeKey,\n  HierarchyNodeKey,\n  InstancesNodeKey,\n  ClassGroupingNodeKey,\n  LabelGroupingNodeKey,\n  PropertyGroupingNodeKey,\n  PropertyOtherValuesGroupingNodeKey,\n  PropertyValueGroupingNodeKey,\n  PropertyValueRangeGroupingNodeKey,\n  IModelHierarchyNodeKey,\n} from \"./hierarchies/HierarchyNodeKey.js\";\nexport { GetHierarchyNodesProps, HierarchyProvider, mergeProviders } from \"./hierarchies/HierarchyProvider.js\";\nexport {\n  createHierarchyFilteringHelper,\n  extractFilteringProps,\n  HierarchyFilteringPath,\n  HierarchyFilteringPathOptions,\n} from \"./hierarchies/HierarchyFiltering.js\";\nexport { getLogger, setLogger } from \"./hierarchies/Logging.js\";\n"]}

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

@@ -1,9 +0,0 @@
-/**
- * Error that is thrown when rows amount exceed hierarchy level limit.
- * @public
- */
-export declare class RowsLimitExceededError extends Error {
-    readonly limit: number;
-    constructor(limit: number);
-}
-//# sourceMappingURL=HierarchyErrors.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchyErrors.d.ts","sourceRoot":"","sources":["../../../src/hierarchies/HierarchyErrors.ts"],"names":[],"mappings":"AAKA;;;GAGG;AACH,qBAAa,sBAAuB,SAAQ,KAAK;aACZ,KAAK,EAAE,MAAM;gBAAb,KAAK,EAAE,MAAM;CAGjD"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchyErrors.js","sourceRoot":"","sources":["../../../src/hierarchies/HierarchyErrors.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG;;;GAGG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IACZ;IAAnC,YAAmC,KAAa;QAC9C,KAAK,CAAC,uBAAuB,KAAK,WAAW,CAAC,CAAC;QADd,UAAK,GAAL,KAAK,CAAQ;IAEhD,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\n/**\n * Error that is thrown when rows amount exceed hierarchy level limit.\n * @public\n */\nexport class RowsLimitExceededError extends Error {\n  public constructor(public readonly limit: number) {\n    super(`Query rows limit of ${limit} exceeded`);\n  }\n}\n"]}

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

@@ -1,133 +0,0 @@
-import { HierarchyNode, NonGroupingHierarchyNode } from "./HierarchyNode.js";
-import { HierarchyNodeIdentifier, HierarchyNodeIdentifiersPath } from "./HierarchyNodeIdentifier.js";
-import { GenericNodeKey, InstancesNodeKey } from "./HierarchyNodeKey.js";
-/** @public */
-export interface FilteringPathAutoExpandOption {
-    /**
-     * Depth up to which nodes in the hierarchy should be expanded.
-     *
-     * If `includeGroupingNodes` is set to true, then depth should take into account the number of grouping nodes in hierarchy.
-     */
-    depth: number;
-    /**
-     * Whether or not `depth` includes grouping nodes.
-     *
-     * Use when you want to autoExpand only some of the grouping nodes.
-     *
-     * **Use case example:**
-     *
-     * You want to `autoExpand` only `Node1` and `GroupingNode1` in the following hierarchy:
-     * - Node1
-     *   - GroupingNode1
-     *     - GroupingNode2
-     *       - Element1
-     *       - Element2
-     * Then you provide `autoExpand: { depth: 2, includeGroupingNodes: true }`
-     */
-    includeGroupingNodes?: boolean;
-}
-/** @public */
-export interface HierarchyFilteringPathOptions {
-    /**
-     * This option specifies the way `autoExpand` flag should be assigned to nodes in the filtered hierarchy.
-     * - If it's `false` or `undefined`, nodes have no 'autoExpand' flag.
-     * - If it's `true`, then all nodes up to the filter target will have `autoExpand` flag.
-     * - If it's an instance of `FilteringPathAutoExpandOption`, then all nodes up to and including `depth` will have `autoExpand` flag.
-     */
-    autoExpand?: boolean | FilteringPathAutoExpandOption;
-}
-/**
- * A path of hierarchy node identifiers for filtering the hierarchy with additional options.
- * @public
- */
-export type HierarchyFilteringPath = HierarchyNodeIdentifiersPath | {
-    path: HierarchyNodeIdentifiersPath;
-    options?: HierarchyFilteringPathOptions;
-};
-/** @public */
-export declare namespace HierarchyFilteringPath {
-    /**
-     * Normalizes the hierarchy filtering path to the object form.
-     * @public
-     */
-    function normalize(source: HierarchyFilteringPath): Exclude<HierarchyFilteringPath, HierarchyNodeIdentifiersPath>;
-    /**
-     * Merges two given `HierarchyFilteringPathOptions` objects.
-     * - if both inputs are `undefined`, `undefined` is returned,
-     * - else if one of the inputs is `undefined`, the other one is returned.
-     * - else, merge each option individually.
-     *
-     * For the `autoExpand` attribute, the merge chooses to auto-expand 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 `includeGroupingNodes` set to `true` or `key` defined, return the one that has only `depth` set,
-     *    - else return the one with greater `depth`.
-     *
-     * @public
-     */
-    function mergeOptions(lhs: HierarchyFilteringPathOptions | undefined, rhs: HierarchyFilteringPathOptions | undefined): HierarchyFilteringPathOptions | undefined;
-}
-/**
- * An utility that extracts filtering properties from given root level filtering props or
- * the parent node. Returns `undefined` if filtering props are not present.
- * @public
- * @deprecated in 1.3. Use `createHierarchyFilteringHelper` instead.
- */
-export declare function extractFilteringProps(rootLevelFilteringProps: HierarchyFilteringPath[], parentNode: Pick<NonGroupingHierarchyNode, "filtering"> | undefined): {
-    filteredNodePaths: HierarchyFilteringPath[];
-    hasFilterTargetAncestor: boolean;
-} | undefined;
-/**
- * Creates a set of utilities for making it easier to filter the given hierarchy
- * level.
- *
- * @public
- */
-export declare function createHierarchyFilteringHelper(rootLevelFilteringProps: HierarchyFilteringPath[] | undefined, parentNode: Pick<NonGroupingHierarchyNode, "filtering"> | undefined): {
-    /**
-     * Returns a flag indicating if the hierarchy level is filtered.
-     */
-    hasFilter: boolean;
-    /**
-     * Returns a flag indicating whether this hierarchy level has an ancestor node
-     * that is a filter target. That generally means that this and all downstream hierarchy
-     * levels should be displayed without filter being applied to them, even if filter paths
-     * say otherwise.
-     */
-    hasFilterTargetAncestor: boolean;
-    /**
-     * Returns a list of hierarchy node identifiers that apply specifically for this
-     * hierarchy level. Returns `undefined` if filtering is not applied to this level.
-     */
-    getChildNodeFilteringIdentifiers: () => HierarchyNodeIdentifier[] | undefined;
-    /**
-     * When a hierarchy node is created for a filtered hierarchy level, it needs some attributes (e.g. `filtering`
-     * and `autoExpand`) to be set based on the filter paths and filtering options. This function calculates
-     * these props for a child node based on its key or path matcher.
-     *
-     * When using `pathMatcher` 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.
-     */
-    createChildNodeProps: (props: {
-        nodeKey: InstancesNodeKey | GenericNodeKey;
-    } | {
-        pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean;
-    }) => NodeProps | undefined;
-    /**
-     * Similar to `createChildNodeProps`, but takes an async `pathMatcher` prop.
-     */
-    createChildNodePropsAsync: (props: {
-        pathMatcher: (identifier: HierarchyNodeIdentifier) => boolean | Promise<boolean>;
-    }) => Promise<NodeProps | undefined> | NodeProps | undefined;
-};
-/** @public */
-export type NodeProps = Pick<HierarchyNode, "autoExpand" | "filtering"> & {
-    filtering?: {
-        autoExpandDepth?: number;
-        includeGroupingNodes?: boolean;
-    };
-};
-//# sourceMappingURL=HierarchyFiltering.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchyFiltering.d.ts","sourceRoot":"","sources":["../../../src/hierarchies/HierarchyFiltering.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC;AAC7E,OAAO,EAAE,uBAAuB,EAAE,4BAA4B,EAAE,MAAM,8BAA8B,CAAC;AACrG,OAAO,EAAE,cAAc,EAAoB,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE3F,cAAc;AACd,MAAM,WAAW,6BAA6B;IAC5C;;;;OAIG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;;;;;;;;;;;;;OAcG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAC;CAChC;AAED,cAAc;AACd,MAAM,WAAW,6BAA6B;IAC5C;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,GAAG,6BAA6B,CAAC;CACtD;AA2BD;;;GAGG;AACH,MAAM,MAAM,sBAAsB,GAAG,4BAA4B,GAAG;IAAE,IAAI,EAAE,4BAA4B,CAAC;IAAC,OAAO,CAAC,EAAE,6BAA6B,CAAA;CAAE,CAAC;AACpJ,cAAc;AAEd,yBAAiB,sBAAsB,CAAC;IACtC;;;OAGG;IACH,SAAgB,SAAS,CAAC,MAAM,EAAE,sBAAsB,GAAG,OAAO,CAAC,sBAAsB,EAAE,4BAA4B,CAAC,CAKvH;IAED;;;;;;;;;;;;;;;OAeG;IACH,SAAgB,YAAY,CAC1B,GAAG,EAAE,6BAA6B,GAAG,SAAS,EAC9C,GAAG,EAAE,6BAA6B,GAAG,SAAS,GAC7C,6BAA6B,GAAG,SAAS,CAQ3C;CACF;AAED;;;;;GAKG;AAEH,wBAAgB,qBAAqB,CACnC,uBAAuB,EAAE,sBAAsB,EAAE,EACjD,UAAU,EAAE,IAAI,CAAC,wBAAwB,EAAE,WAAW,CAAC,GAAG,SAAS,GAEjE;IACE,iBAAiB,EAAE,sBAAsB,EAAE,CAAC;IAC5C,uBAAuB,EAAE,OAAO,CAAC;CAClC,GACD,SAAS,CAEZ;AAuBD;;;;;GAKG;AACH,wBAAgB,8BAA8B,CAC5C,uBAAuB,EAAE,sBAAsB,EAAE,GAAG,SAAS,EAC7D,UAAU,EAAE,IAAI,CAAC,wBAAwB,EAAE,WAAW,CAAC,GAAG,SAAS;IAKjE;;OAEG;;IAGH;;;;;OAKG;;IAGH;;;OAGG;;IAWH;;;;;;;;OAQG;kCAGG;QACE,OAAO,EAAE,gBAAgB,GAAG,cAAc,CAAC;KAC5C,GACD;QACE,WAAW,EAAE,CAAC,UAAU,EAAE,uBAAuB,KAAK,OAAO,CAAC;KAC/D,KACJ,SAAS,GAAG,SAAS;IAoBxB;;OAEG;uCACgC;QACjC,WAAW,EAAE,CAAC,UAAU,EAAE,uBAAuB,KAAK,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;KAClF,KAAG,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,SAAS,GAAG,SAAS;EAgC7D;AAED,cAAc;AACd,MAAM,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,EAAE,YAAY,GAAG,WAAW,CAAC,GAAG;IAAE,SAAS,CAAC,EAAE;QAAE,eAAe,CAAC,EAAE,MAAM,CAAC;QAAC,oBAAoB,CAAC,EAAE,OAAO,CAAA;KAAE,CAAA;CAAE,CAAC"}