@itwin/components-react 4.2.0 → 4.3.0-dev.1

package/lib/esm/components-react/tree/controlled/component/NodeContent.scss

@@ -1,7 +1,7 @@
 /*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
 
 .components-controlledTree-node-description {
   color: var(--iui-color-text-muted);

package/lib/esm/components-react/tree/controlled/internal/SparseTree.d.ts

@@ -17,6 +17,7 @@ export declare class SparseTree<T extends Node> {
     private _rootNodes;
     private _parentToChildren;
     private _idToNode;
+    constructor();
     getNode(nodeId: string): T | undefined;
     getChildOffset(parentId: string | undefined, childId: string): number | undefined;
     getChildren(parentId: string | undefined, createIfNotExist?: boolean): SparseArray<string> | undefined;
@@ -39,6 +40,7 @@ export declare class SparseArray<T> implements Iterable<T | undefined> {
     [immerable]: boolean;
     private _length;
     private _array;
+    constructor();
     /** Returns length of array including intermediate 'undefined' values */
     getLength(): number;
     /** Sets length of array. */

package/lib/esm/components-react/tree/controlled/internal/SparseTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SparseTree.d.ts","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/SparseTree.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAGlC,gBAAgB;AAChB,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED;;;;;GAKG;AACH,qBAAa,UAAU,CAAC,CAAC,SAAS,IAAI;IAC7B,CAAC,SAAS,CAAC,UAAQ;IAE1B,OAAO,CAAC,UAAU,CAA6B;IAC/C,OAAO,CAAC,iBAAiB,CAA2C;IACpE,OAAO,CAAC,SAAS,CAAyB;IAEnC,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAItC,cAAc,CACnB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,SAAS;IAOd,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,gBAAgB,GAAE,OAAe,GAChC,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS;IAY3B,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,QAAQ,EAAE,CAAC,EAAE,EACb,MAAM,EAAE,MAAM;IAcT,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM;IAMlE,SAAS,CACd,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,OAAO;IA6BH,QAAQ,CACb,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,WAAW,EAAE,MAAM,GAClB,IAAI;IAiBA,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE,WAAW,EAAE,MAAM;IAShE,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,IAAI;IAoBA,aAAa,CAClB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,YAAY,GAAE,OAAc;CAkB/B;AAED;;;;;;GAMG;AACH,qBAAa,WAAW,CAAC,CAAC,CAAE,YAAW,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC;IACrD,CAAC,SAAS,CAAC,UAAQ;IAE1B,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,MAAM,CAA0B;IAExC,wEAAwE;IACjE,SAAS,IAAI,MAAM;IAI1B,4BAA4B;IACrB,SAAS,CAAC,MAAM,EAAE,MAAM;IAM/B;;;OAGG;IACI,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS;IAOnD;;;OAGG;IACI,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAKxC,qEAAqE;IAC9D,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAMlC,yEAAyE;IAClE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAWrC,wEAAwE;IACjE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAelC;;;OAGG;IACI,aAAa,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAIrD,kEAAkE;IAC3D,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,GAAG,SAAS,CAAC;IAoB3D,OAAO,CAAC,UAAU;IAOlB,OAAO,CAAC,MAAM,CAAC,OAAO;CAGvB"}
+{"version":3,"file":"SparseTree.d.ts","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/SparseTree.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAGlC,gBAAgB;AAChB,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED;;;;;GAKG;AACH,qBAAa,UAAU,CAAC,CAAC,SAAS,IAAI;IAC7B,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAE5B,OAAO,CAAC,UAAU,CAA6B;IAC/C,OAAO,CAAC,iBAAiB,CAA2C;IACpE,OAAO,CAAC,SAAS,CAAyB;;IAMnC,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAItC,cAAc,CACnB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,SAAS;IAOd,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,gBAAgB,GAAE,OAAe,GAChC,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS;IAY3B,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,QAAQ,EAAE,CAAC,EAAE,EACb,MAAM,EAAE,MAAM;IAcT,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM;IAMlE,SAAS,CACd,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,OAAO;IA6BH,QAAQ,CACb,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,WAAW,EAAE,MAAM,GAClB,IAAI;IAiBA,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE,WAAW,EAAE,MAAM;IAShE,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,IAAI;IAoBA,aAAa,CAClB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,YAAY,GAAE,OAAc;CAkB/B;AAED;;;;;;GAMG;AACH,qBAAa,WAAW,CAAC,CAAC,CAAE,YAAW,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC;IACrD,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAE5B,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,MAAM,CAA0B;;IAMxC,wEAAwE;IACjE,SAAS,IAAI,MAAM;IAI1B,4BAA4B;IACrB,SAAS,CAAC,MAAM,EAAE,MAAM;IAM/B;;;OAGG;IACI,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS;IAOnD;;;OAGG;IACI,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAKxC,qEAAqE;IAC9D,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAMlC,yEAAyE;IAClE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAWrC,wEAAwE;IACjE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAelC;;;OAGG;IACI,aAAa,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAIrD,kEAAkE;IAC3D,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,GAAG,SAAS,CAAC;IAoB3D,OAAO,CAAC,UAAU;IAOlB,OAAO,CAAC,MAAM,CAAC,OAAO;CAGvB"}

package/lib/esm/components-react/tree/controlled/internal/SparseTree.js

@@ -5,7 +5,6 @@
 /** @packageDocumentation
  * @module Tree
  */
-var _a, _b;
 import { immerable } from "immer";
 import { assert, compareNumbers, lowerBound } from "@itwin/core-bentley";
 /**
@@ -16,10 +15,10 @@ import { assert, compareNumbers, lowerBound } from "@itwin/core-bentley";
  */
 export class SparseTree {
     constructor() {
-        this[_a] = true;
         this._rootNodes = new SparseArray();
         this._parentToChildren = {};
         this._idToNode = {};
+        this[immerable] = true;
     }
     getNode(nodeId) {
         return this._idToNode[nodeId];
@@ -134,7 +133,6 @@ export class SparseTree {
         delete this._parentToChildren[parentId];
     }
 }
-_a = immerable;
 /**
  * Structure for sparse array value storage.
  * The main advantage of this class over the standard javascript array is that
@@ -144,9 +142,9 @@ _a = immerable;
  */
 export class SparseArray {
     constructor() {
-        this[_b] = true;
         this._length = 0;
         this._array = [];
+        this[immerable] = true;
     }
     /** Returns length of array including intermediate 'undefined' values */
     getLength() {
@@ -212,7 +210,7 @@ export class SparseArray {
         return this._array[Symbol.iterator]();
     }
     /** Iterates the array with all intermediate `undefined` values */
-    [(_b = immerable, Symbol.iterator)]() {
+    [Symbol.iterator]() {
         const array = this._array;
         const length = this._length;
         return (function* () {

package/lib/esm/components-react/tree/controlled/internal/SparseTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"SparseTree.js","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/SparseTree.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAChG;;GAEG;;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAOzE;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IAAvB;QACS,QAAW,GAAG,IAAI,CAAC;QAElB,eAAU,GAAG,IAAI,WAAW,EAAU,CAAC;QACvC,sBAAiB,GAAwC,EAAE,CAAC;QAC5D,cAAS,GAAsB,EAAE,CAAC;IAiK5C,CAAC;IA/JQ,OAAO,CAAC,MAAc;QAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAEM,cAAc,CACnB,QAA4B,EAC5B,OAAe;QAEf,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,OAAO,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,mBAA4B,KAAK;QAEjC,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,OAAO,IAAI,CAAC,UAAU,CAAC;SACxB;QAED,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,SAAS,IAAI,gBAAgB,EAAE;YACtE,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,IAAI,WAAW,EAAU,CAAC;SAC9D;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,QAAa,EACb,MAAc;QAEd,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QAC3D,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAChC,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YAC7D,IAAI,eAAe,KAAK,SAAS,EAAE;gBACjC,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;aACrC;YAED,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,WAAW,CAAC,QAA4B,EAAE,KAAQ,EAAE,MAAc;QACvE,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QAC3D,gBAAgB,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IACnC,CAAC;IAEM,SAAS,CACd,QAA4B,EAC5B,KAAa,EACb,KAAa;QAEb,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,cAAc,KAAK,SAAS,EAAE;YAChC,OAAO,KAAK,CAAC;SACd;QAED,IAAI,cAAc,KAAK,KAAK,EAAE;YAC5B,OAAO,IAAI,CAAC;SACb;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,SAAS,EAAE;YACrC,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAEtC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;QAE9C,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACnC;aAAM;YACL,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACpD;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,QAAQ,CACb,cAAkC,EAClC,YAAoB,EACpB,cAAkC,EAClC,WAAmB;QAEnB,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QAC5D,MAAM,CAAC,kBAAkB,KAAK,SAAS,CAAC,CAAC;QAEzC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;QACtE,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;QAElC,kBAAkB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,cAAc,KAAK,cAAc,IAAI,WAAW,GAAG,WAAW,EAAE;YAClE,WAAW,IAAI,CAAC,CAAC;SAClB;QAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAClE,MAAM,CAAC,kBAAkB,KAAK,SAAS,CAAC,CAAC;QACzC,kBAAkB,CAAC,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACvD,CAAC;IAEM,cAAc,CAAC,QAA4B,EAAE,WAAmB;QACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QACnD,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE;YAChD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;SAC7B;QAED,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAClC,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,KAAsB;QAEtB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QAEnC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YAC7B,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;aAC7B;YAED,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC3B;aAAM;YACL,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,OAAO,KAAK,SAAS,EAAE;gBACzB,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;aAC7B;SACF;IACH,CAAC;IAEM,aAAa,CAClB,QAA4B,EAC5B,eAAwB,IAAI;QAE5B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE;gBAChD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;aAC7B;SACF;QAED,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO;SACR;QACD,IAAI,YAAY,EAAE;YAChB,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;SACjC;QACD,OAAO,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;CACF;KArKS,SAAS;AAuKnB;;;;;;GAMG;AACH,MAAM,OAAO,WAAW;IAAxB;QACS,QAAW,GAAG,IAAI,CAAC;QAElB,YAAO,GAAG,CAAC,CAAC;QACZ,WAAM,GAAuB,EAAE,CAAC;IA4G1C,CAAC;IA1GC,wEAAwE;IACjE,SAAS;QACd,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,4BAA4B;IACrB,SAAS,CAAC,MAAc;QAC7B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,WAAc;QAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;YACxC,IAAI,KAAK,KAAK,WAAW;gBAAE,OAAO,KAAK,CAAC;SACzC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,GAAG,CAAC,KAAa;QACtB,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnD,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IAED,qEAAqE;IAC9D,GAAG,CAAC,KAAa,EAAE,KAAQ;QAChC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,KAAa,EAAE,KAAQ;QACnC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SACrB;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,KAAa;QACzB,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE;YACzB,OAAO;SACR;QAED,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAErC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SACrB;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACI,aAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,kEAAkE;IAC3D,OAjFC,SAAS,EAiFT,MAAM,CAAC,QAAQ,EAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,OAAO,CAAC,QAAQ,CAAC;YACf,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE;gBAClC,OAAO,YAAY,GAAG,KAAK,EAAE,EAAE,YAAY,EAAE;oBAC3C,MAAM,SAAS,CAAC;iBACjB;gBAED,MAAM,KAAK,CAAC;gBACZ,EAAE,YAAY,CAAC;aAChB;YAED,OAAO,YAAY,GAAG,MAAM,EAAE,EAAE,YAAY,EAAE;gBAC5C,MAAM,SAAS,CAAC;aACjB;QACH,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;IAEO,UAAU,CAAC,KAAa;QAI9B,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC;IAEO,MAAM,CAAC,OAAO,CAAI,KAAa,EAAE,KAAkB;QACzD,OAAO,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,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/** @packageDocumentation\n * @module Tree\n */\n\nimport { immerable } from \"immer\";\nimport { assert, compareNumbers, lowerBound } from \"@itwin/core-bentley\";\n\n/** @internal */\nexport interface Node {\n  readonly id: string;\n}\n\n/**\n * Structure for sparse tree storage.\n * It uses SparseArray to store children ids for parent. This allows\n * having tree structure with some nodes missing in the tree branch.\n * @internal\n */\nexport class SparseTree<T extends Node> {\n  public [immerable] = true;\n\n  private _rootNodes = new SparseArray<string>();\n  private _parentToChildren: Record<string, SparseArray<string>> = {};\n  private _idToNode: Record<string, T> = {};\n\n  public getNode(nodeId: string): T | undefined {\n    return this._idToNode[nodeId];\n  }\n\n  public getChildOffset(\n    parentId: string | undefined,\n    childId: string\n  ): number | undefined {\n    const children = this.getChildren(parentId);\n    if (!children) return undefined;\n\n    return children.getIndex(childId);\n  }\n\n  public getChildren(\n    parentId: string | undefined,\n    createIfNotExist: boolean = false\n  ): SparseArray<string> | undefined {\n    if (parentId === undefined) {\n      return this._rootNodes;\n    }\n\n    if (this._parentToChildren[parentId] === undefined && createIfNotExist) {\n      this._parentToChildren[parentId] = new SparseArray<string>();\n    }\n\n    return this._parentToChildren[parentId];\n  }\n\n  public setChildren(\n    parentId: string | undefined,\n    children: T[],\n    offset: number\n  ) {\n    const existingChildren = this.getChildren(parentId, true)!;\n    children.forEach((child, index) => {\n      const existingChildId = existingChildren.get(offset + index);\n      if (existingChildId !== undefined) {\n        this.deleteSubtree(existingChildId);\n      }\n\n      existingChildren.set(offset + index, child.id);\n      this._idToNode[child.id] = child;\n    });\n  }\n\n  public insertChild(parentId: string | undefined, child: T, offset: number) {\n    const existingChildren = this.getChildren(parentId, true)!;\n    existingChildren.insert(offset, child.id);\n    this._idToNode[child.id] = child;\n  }\n\n  public setNodeId(\n    parentId: string | undefined,\n    index: number,\n    newId: string\n  ): boolean {\n    const previousNodeId = this.getChildren(parentId)?.get(index);\n    if (previousNodeId === undefined) {\n      return false;\n    }\n\n    if (previousNodeId === newId) {\n      return true;\n    }\n\n    if (this.getNode(newId) !== undefined) {\n      return false;\n    }\n\n    this._idToNode[newId] = this._idToNode[previousNodeId];\n    delete this._idToNode[previousNodeId];\n\n    this._parentToChildren[newId] = this._parentToChildren[previousNodeId];\n    delete this._parentToChildren[previousNodeId];\n\n    if (parentId === undefined) {\n      this._rootNodes.set(index, newId);\n    } else {\n      this._parentToChildren[parentId].set(index, newId);\n    }\n\n    return true;\n  }\n\n  public moveNode(\n    sourceParentId: string | undefined,\n    sourceNodeId: string,\n    targetParentId: string | undefined,\n    targetIndex: number\n  ): void {\n    const sourceNodeSiblings = this.getChildren(sourceParentId);\n    assert(sourceNodeSiblings !== undefined);\n\n    const sourceIndex = this.getChildOffset(sourceParentId, sourceNodeId);\n    assert(sourceIndex !== undefined);\n\n    sourceNodeSiblings.remove(sourceIndex);\n    if (targetParentId === sourceParentId && targetIndex > sourceIndex) {\n      targetIndex -= 1;\n    }\n\n    const targetNodeSiblings = this.getChildren(targetParentId, true);\n    assert(targetNodeSiblings !== undefined);\n    targetNodeSiblings.insert(targetIndex, sourceNodeId);\n  }\n\n  public setNumChildren(parentId: string | undefined, numChildren: number) {\n    const children = this.getChildren(parentId, true)!;\n    for (const [childId] of children.iterateValues()) {\n      this.deleteSubtree(childId);\n    }\n\n    children.setLength(numChildren);\n  }\n\n  public removeChild(\n    parentId: string | undefined,\n    child: string | number\n  ): void {\n    const children = this.getChildren(parentId);\n    if (children === undefined) return;\n\n    if (typeof child === \"string\") {\n      const childIndex = children.getIndex(child);\n      if (childIndex !== undefined) {\n        children.remove(childIndex);\n      }\n\n      this.deleteSubtree(child);\n    } else {\n      const childId = children.get(child);\n      children.remove(child);\n      if (childId !== undefined) {\n        this.deleteSubtree(childId);\n      }\n    }\n  }\n\n  public deleteSubtree(\n    parentId: string | undefined,\n    deleteParent: boolean = true\n  ) {\n    const children = this.getChildren(parentId);\n    if (children !== undefined) {\n      for (const [childId] of children.iterateValues()) {\n        this.deleteSubtree(childId);\n      }\n    }\n\n    if (parentId === undefined) {\n      this._rootNodes.setLength(0);\n      return;\n    }\n    if (deleteParent) {\n      delete this._idToNode[parentId];\n    }\n    delete this._parentToChildren[parentId];\n  }\n}\n\n/**\n * Structure for sparse array value storage.\n * The main advantage of this class over the standard javascript array is that\n * this class does not need to check each index when iterating values that are\n * stored in the array.\n * @public\n */\nexport class SparseArray<T> implements Iterable<T | undefined> {\n  public [immerable] = true;\n\n  private _length = 0;\n  private _array: Array<[T, number]> = [];\n\n  /** Returns length of array including intermediate 'undefined' values */\n  public getLength(): number {\n    return this._length;\n  }\n\n  /** Sets length of array. */\n  public setLength(length: number) {\n    const { index } = this.lowerBound(length);\n    this._array.length = index;\n    this._length = length;\n  }\n\n  /** Returns index of supplied value.\n   *\n   * @returns index of value or undefined if value is not found.\n   */\n  public getIndex(lookupValue: T): number | undefined {\n    for (const [value, index] of this._array) {\n      if (value === lookupValue) return index;\n    }\n    return undefined;\n  }\n\n  /** Returns value at specific position.\n   *\n   * @returns stored value or undefined.\n   */\n  public get(index: number): T | undefined {\n    const { index: i, equal } = this.lowerBound(index);\n    return equal ? this._array[i][0] : undefined;\n  }\n\n  /** Sets value at specific position. Overrides any existing value. */\n  public set(index: number, value: T) {\n    const { index: i, equal } = this.lowerBound(index);\n    this._array.splice(i, equal ? 1 : 0, [value, index]);\n    this._length = Math.max(this._length, index + 1);\n  }\n\n  /** Inserts value at specific position. Increases array length by one. */\n  public insert(index: number, value: T) {\n    const { index: i } = this.lowerBound(index);\n    this._array.splice(i, 0, [value, index]);\n\n    for (let j = i + 1; j < this._array.length; j++) {\n      this._array[j][1]++;\n    }\n\n    this._length = Math.max(this._length + 1, index + 1);\n  }\n\n  /** Removes value at specified index and reduces array length by one. */\n  public remove(index: number): void {\n    if (index >= this._length) {\n      return;\n    }\n\n    const { index: i, equal } = this.lowerBound(index);\n    this._array.splice(i, equal ? 1 : 0);\n\n    for (let j = i; j < this._array.length; j++) {\n      this._array[j][1]--;\n    }\n\n    this._length = Math.max(0, this._length - 1);\n  }\n\n  /**\n   * Iterates values that are stored in the array\n   * @returns `[value, index]` tuples.\n   */\n  public iterateValues(): IterableIterator<[T, number]> {\n    return this._array[Symbol.iterator]();\n  }\n\n  /** Iterates the array with all intermediate `undefined` values */\n  public [Symbol.iterator](): IterableIterator<T | undefined> {\n    const array = this._array;\n    const length = this._length;\n    return (function* () {\n      let currentIndex = 0;\n      for (const [value, index] of array) {\n        for (; currentIndex < index; ++currentIndex) {\n          yield undefined;\n        }\n\n        yield value;\n        ++currentIndex;\n      }\n\n      for (; currentIndex < length; ++currentIndex) {\n        yield undefined;\n      }\n    })();\n  }\n\n  private lowerBound(index: number): {\n    index: number;\n    equal: boolean;\n  } {\n    return lowerBound(index, this._array, SparseArray.compare);\n  }\n\n  private static compare<T>(index: number, value: [T, number]): number {\n    return compareNumbers(index, value[1]);\n  }\n}\n"]}
+{"version":3,"file":"SparseTree.js","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/SparseTree.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAChG;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAOzE;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IAOrB;QAJQ,eAAU,GAAG,IAAI,WAAW,EAAU,CAAC;QACvC,sBAAiB,GAAwC,EAAE,CAAC;QAC5D,cAAS,GAAsB,EAAE,CAAC;QAGxC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;IACzB,CAAC;IAEM,OAAO,CAAC,MAAc;QAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAEM,cAAc,CACnB,QAA4B,EAC5B,OAAe;QAEf,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,OAAO,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,mBAA4B,KAAK;QAEjC,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,OAAO,IAAI,CAAC,UAAU,CAAC;SACxB;QAED,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,SAAS,IAAI,gBAAgB,EAAE;YACtE,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,IAAI,WAAW,EAAU,CAAC;SAC9D;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,QAAa,EACb,MAAc;QAEd,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QAC3D,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAChC,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YAC7D,IAAI,eAAe,KAAK,SAAS,EAAE;gBACjC,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;aACrC;YAED,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,WAAW,CAAC,QAA4B,EAAE,KAAQ,EAAE,MAAc;QACvE,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QAC3D,gBAAgB,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IACnC,CAAC;IAEM,SAAS,CACd,QAA4B,EAC5B,KAAa,EACb,KAAa;QAEb,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,cAAc,KAAK,SAAS,EAAE;YAChC,OAAO,KAAK,CAAC;SACd;QAED,IAAI,cAAc,KAAK,KAAK,EAAE;YAC5B,OAAO,IAAI,CAAC;SACb;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,SAAS,EAAE;YACrC,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAEtC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;QAE9C,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACnC;aAAM;YACL,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACpD;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,QAAQ,CACb,cAAkC,EAClC,YAAoB,EACpB,cAAkC,EAClC,WAAmB;QAEnB,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QAC5D,MAAM,CAAC,kBAAkB,KAAK,SAAS,CAAC,CAAC;QAEzC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;QACtE,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;QAElC,kBAAkB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,cAAc,KAAK,cAAc,IAAI,WAAW,GAAG,WAAW,EAAE;YAClE,WAAW,IAAI,CAAC,CAAC;SAClB;QAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAClE,MAAM,CAAC,kBAAkB,KAAK,SAAS,CAAC,CAAC;QACzC,kBAAkB,CAAC,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACvD,CAAC;IAEM,cAAc,CAAC,QAA4B,EAAE,WAAmB;QACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QACnD,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE;YAChD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;SAC7B;QAED,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAClC,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,KAAsB;QAEtB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QAEnC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YAC7B,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;aAC7B;YAED,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC3B;aAAM;YACL,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,OAAO,KAAK,SAAS,EAAE;gBACzB,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;aAC7B;SACF;IACH,CAAC;IAEM,aAAa,CAClB,QAA4B,EAC5B,eAAwB,IAAI;QAE5B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE;gBAChD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;aAC7B;SACF;QAED,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO;SACR;QACD,IAAI,YAAY,EAAE;YAChB,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;SACjC;QACD,OAAO,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,OAAO,WAAW;IAMtB;QAHQ,YAAO,GAAG,CAAC,CAAC;QACZ,WAAM,GAAuB,EAAE,CAAC;QAGtC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,wEAAwE;IACjE,SAAS;QACd,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,4BAA4B;IACrB,SAAS,CAAC,MAAc;QAC7B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,WAAc;QAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;YACxC,IAAI,KAAK,KAAK,WAAW;gBAAE,OAAO,KAAK,CAAC;SACzC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,GAAG,CAAC,KAAa;QACtB,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnD,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IAED,qEAAqE;IAC9D,GAAG,CAAC,KAAa,EAAE,KAAQ;QAChC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,KAAa,EAAE,KAAQ;QACnC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SACrB;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,KAAa;QACzB,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE;YACzB,OAAO;SACR;QAED,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAErC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SACrB;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACI,aAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,kEAAkE;IAC3D,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,OAAO,CAAC,QAAQ,CAAC;YACf,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE;gBAClC,OAAO,YAAY,GAAG,KAAK,EAAE,EAAE,YAAY,EAAE;oBAC3C,MAAM,SAAS,CAAC;iBACjB;gBAED,MAAM,KAAK,CAAC;gBACZ,EAAE,YAAY,CAAC;aAChB;YAED,OAAO,YAAY,GAAG,MAAM,EAAE,EAAE,YAAY,EAAE;gBAC5C,MAAM,SAAS,CAAC;aACjB;QACH,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;IAEO,UAAU,CAAC,KAAa;QAI9B,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC;IAEO,MAAM,CAAC,OAAO,CAAI,KAAa,EAAE,KAAkB;QACzD,OAAO,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,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/** @packageDocumentation\n * @module Tree\n */\n\nimport { immerable } from \"immer\";\nimport { assert, compareNumbers, lowerBound } from \"@itwin/core-bentley\";\n\n/** @internal */\nexport interface Node {\n  readonly id: string;\n}\n\n/**\n * Structure for sparse tree storage.\n * It uses SparseArray to store children ids for parent. This allows\n * having tree structure with some nodes missing in the tree branch.\n * @internal\n */\nexport class SparseTree<T extends Node> {\n  public [immerable]: boolean;\n\n  private _rootNodes = new SparseArray<string>();\n  private _parentToChildren: Record<string, SparseArray<string>> = {};\n  private _idToNode: Record<string, T> = {};\n\n  constructor() {\n    this[immerable] = true;\n  }\n\n  public getNode(nodeId: string): T | undefined {\n    return this._idToNode[nodeId];\n  }\n\n  public getChildOffset(\n    parentId: string | undefined,\n    childId: string\n  ): number | undefined {\n    const children = this.getChildren(parentId);\n    if (!children) return undefined;\n\n    return children.getIndex(childId);\n  }\n\n  public getChildren(\n    parentId: string | undefined,\n    createIfNotExist: boolean = false\n  ): SparseArray<string> | undefined {\n    if (parentId === undefined) {\n      return this._rootNodes;\n    }\n\n    if (this._parentToChildren[parentId] === undefined && createIfNotExist) {\n      this._parentToChildren[parentId] = new SparseArray<string>();\n    }\n\n    return this._parentToChildren[parentId];\n  }\n\n  public setChildren(\n    parentId: string | undefined,\n    children: T[],\n    offset: number\n  ) {\n    const existingChildren = this.getChildren(parentId, true)!;\n    children.forEach((child, index) => {\n      const existingChildId = existingChildren.get(offset + index);\n      if (existingChildId !== undefined) {\n        this.deleteSubtree(existingChildId);\n      }\n\n      existingChildren.set(offset + index, child.id);\n      this._idToNode[child.id] = child;\n    });\n  }\n\n  public insertChild(parentId: string | undefined, child: T, offset: number) {\n    const existingChildren = this.getChildren(parentId, true)!;\n    existingChildren.insert(offset, child.id);\n    this._idToNode[child.id] = child;\n  }\n\n  public setNodeId(\n    parentId: string | undefined,\n    index: number,\n    newId: string\n  ): boolean {\n    const previousNodeId = this.getChildren(parentId)?.get(index);\n    if (previousNodeId === undefined) {\n      return false;\n    }\n\n    if (previousNodeId === newId) {\n      return true;\n    }\n\n    if (this.getNode(newId) !== undefined) {\n      return false;\n    }\n\n    this._idToNode[newId] = this._idToNode[previousNodeId];\n    delete this._idToNode[previousNodeId];\n\n    this._parentToChildren[newId] = this._parentToChildren[previousNodeId];\n    delete this._parentToChildren[previousNodeId];\n\n    if (parentId === undefined) {\n      this._rootNodes.set(index, newId);\n    } else {\n      this._parentToChildren[parentId].set(index, newId);\n    }\n\n    return true;\n  }\n\n  public moveNode(\n    sourceParentId: string | undefined,\n    sourceNodeId: string,\n    targetParentId: string | undefined,\n    targetIndex: number\n  ): void {\n    const sourceNodeSiblings = this.getChildren(sourceParentId);\n    assert(sourceNodeSiblings !== undefined);\n\n    const sourceIndex = this.getChildOffset(sourceParentId, sourceNodeId);\n    assert(sourceIndex !== undefined);\n\n    sourceNodeSiblings.remove(sourceIndex);\n    if (targetParentId === sourceParentId && targetIndex > sourceIndex) {\n      targetIndex -= 1;\n    }\n\n    const targetNodeSiblings = this.getChildren(targetParentId, true);\n    assert(targetNodeSiblings !== undefined);\n    targetNodeSiblings.insert(targetIndex, sourceNodeId);\n  }\n\n  public setNumChildren(parentId: string | undefined, numChildren: number) {\n    const children = this.getChildren(parentId, true)!;\n    for (const [childId] of children.iterateValues()) {\n      this.deleteSubtree(childId);\n    }\n\n    children.setLength(numChildren);\n  }\n\n  public removeChild(\n    parentId: string | undefined,\n    child: string | number\n  ): void {\n    const children = this.getChildren(parentId);\n    if (children === undefined) return;\n\n    if (typeof child === \"string\") {\n      const childIndex = children.getIndex(child);\n      if (childIndex !== undefined) {\n        children.remove(childIndex);\n      }\n\n      this.deleteSubtree(child);\n    } else {\n      const childId = children.get(child);\n      children.remove(child);\n      if (childId !== undefined) {\n        this.deleteSubtree(childId);\n      }\n    }\n  }\n\n  public deleteSubtree(\n    parentId: string | undefined,\n    deleteParent: boolean = true\n  ) {\n    const children = this.getChildren(parentId);\n    if (children !== undefined) {\n      for (const [childId] of children.iterateValues()) {\n        this.deleteSubtree(childId);\n      }\n    }\n\n    if (parentId === undefined) {\n      this._rootNodes.setLength(0);\n      return;\n    }\n    if (deleteParent) {\n      delete this._idToNode[parentId];\n    }\n    delete this._parentToChildren[parentId];\n  }\n}\n\n/**\n * Structure for sparse array value storage.\n * The main advantage of this class over the standard javascript array is that\n * this class does not need to check each index when iterating values that are\n * stored in the array.\n * @public\n */\nexport class SparseArray<T> implements Iterable<T | undefined> {\n  public [immerable]: boolean;\n\n  private _length = 0;\n  private _array: Array<[T, number]> = [];\n\n  constructor() {\n    this[immerable] = true;\n  }\n\n  /** Returns length of array including intermediate 'undefined' values */\n  public getLength(): number {\n    return this._length;\n  }\n\n  /** Sets length of array. */\n  public setLength(length: number) {\n    const { index } = this.lowerBound(length);\n    this._array.length = index;\n    this._length = length;\n  }\n\n  /** Returns index of supplied value.\n   *\n   * @returns index of value or undefined if value is not found.\n   */\n  public getIndex(lookupValue: T): number | undefined {\n    for (const [value, index] of this._array) {\n      if (value === lookupValue) return index;\n    }\n    return undefined;\n  }\n\n  /** Returns value at specific position.\n   *\n   * @returns stored value or undefined.\n   */\n  public get(index: number): T | undefined {\n    const { index: i, equal } = this.lowerBound(index);\n    return equal ? this._array[i][0] : undefined;\n  }\n\n  /** Sets value at specific position. Overrides any existing value. */\n  public set(index: number, value: T) {\n    const { index: i, equal } = this.lowerBound(index);\n    this._array.splice(i, equal ? 1 : 0, [value, index]);\n    this._length = Math.max(this._length, index + 1);\n  }\n\n  /** Inserts value at specific position. Increases array length by one. */\n  public insert(index: number, value: T) {\n    const { index: i } = this.lowerBound(index);\n    this._array.splice(i, 0, [value, index]);\n\n    for (let j = i + 1; j < this._array.length; j++) {\n      this._array[j][1]++;\n    }\n\n    this._length = Math.max(this._length + 1, index + 1);\n  }\n\n  /** Removes value at specified index and reduces array length by one. */\n  public remove(index: number): void {\n    if (index >= this._length) {\n      return;\n    }\n\n    const { index: i, equal } = this.lowerBound(index);\n    this._array.splice(i, equal ? 1 : 0);\n\n    for (let j = i; j < this._array.length; j++) {\n      this._array[j][1]--;\n    }\n\n    this._length = Math.max(0, this._length - 1);\n  }\n\n  /**\n   * Iterates values that are stored in the array\n   * @returns `[value, index]` tuples.\n   */\n  public iterateValues(): IterableIterator<[T, number]> {\n    return this._array[Symbol.iterator]();\n  }\n\n  /** Iterates the array with all intermediate `undefined` values */\n  public [Symbol.iterator](): IterableIterator<T | undefined> {\n    const array = this._array;\n    const length = this._length;\n    return (function* () {\n      let currentIndex = 0;\n      for (const [value, index] of array) {\n        for (; currentIndex < index; ++currentIndex) {\n          yield undefined;\n        }\n\n        yield value;\n        ++currentIndex;\n      }\n\n      for (; currentIndex < length; ++currentIndex) {\n        yield undefined;\n      }\n    })();\n  }\n\n  private lowerBound(index: number): {\n    index: number;\n    equal: boolean;\n  } {\n    return lowerBound(index, this._array, SparseArray.compare);\n  }\n\n  private static compare<T>(index: number, value: [T, number]): number {\n    return compareNumbers(index, value[1]);\n  }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/components-react",
-  "version": "4.2.0",
+  "version": "4.3.0-dev.1",
   "description": "iTwin.js UI complex components",
   "main": "lib/cjs/components-react.js",
   "module": "lib/esm/components-react.js",
@@ -24,7 +24,7 @@
   "peerDependencies": {
     "@itwin/appui-abstract": "^3.7.0 || ^4.0.0",
     "@itwin/core-bentley": "^3.7.0 || ^4.0.0",
-    "@itwin/core-react": "^4.2.0",
+    "@itwin/core-react": "^4.3.0-dev.1",
     "react": "^17.0.0 || ^18.0.0",
     "react-dom": "^17.0.0 || ^18.0.0"
   },
@@ -39,7 +39,7 @@
     "@itwin/core-common": "^3.7.0",
     "@itwin/core-geometry": "^3.7.0",
     "@itwin/core-i18n": "^3.7.0",
-    "@itwin/core-react": "4.2.0",
+    "@itwin/core-react": "4.3.0-dev.1",
     "@itwin/eslint-plugin": "^3.7.0",
     "@testing-library/dom": "^8.11.2",
     "@testing-library/react": "^12.0.0",
@@ -58,7 +58,7 @@
     "@types/react-dom": "^17.0.0",
     "@types/react-highlight-words": "^0.16.1",
     "@types/react-window": "^1.8.2",
-    "@types/sinon": "^9.0.0",
+    "@types/sinon": "^10.0.15",
     "@types/sinon-chai": "^3.2.0",
     "chai": "^4.1.2",
     "chai-as-promised": "^7",
@@ -77,7 +77,7 @@
     "react": "^17.0.0",
     "react-dom": "^17.0.0",
     "rimraf": "^3.0.2",
-    "sinon": "^9.0.2",
+    "sinon": "^15.2.0",
     "sinon-chai": "^3.2.0",
     "ts-node": "^10.8.2",
     "typemoq": "^2.1.0",