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

package/lib/cjs/components-react/tree/controlled/TreeModel.js

@@ -1,8 +1,8 @@
 "use strict";
 /*---------------------------------------------------------------------------------------------
-* 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.
+ *--------------------------------------------------------------------------------------------*/
 /** @packageDocumentation
  * @module Tree
  */
@@ -19,7 +19,9 @@ const SparseTree_1 = require("./internal/SparseTree");
  * @public
  */
 function isTreeModelNode(obj) {
-    return obj !== undefined && !isTreeModelNodePlaceholder(obj) && !isTreeModelRootNode(obj);
+    return (obj !== undefined &&
+        !isTreeModelNodePlaceholder(obj) &&
+        !isTreeModelRootNode(obj));
 }
 exports.isTreeModelNode = isTreeModelNode;
 /**
@@ -35,7 +37,9 @@ exports.isTreeModelNodePlaceholder = isTreeModelNodePlaceholder;
  * @public
  */
 function isTreeModelRootNode(obj) {
-    return obj !== undefined && obj.id === undefined && !("childIndex" in obj);
+    return (obj !== undefined &&
+        obj.id === undefined &&
+        !("childIndex" in obj));
 }
 exports.isTreeModelRootNode = isTreeModelRootNode;
 /**
@@ -46,7 +50,11 @@ class MutableTreeModel {
     constructor(seed) {
         this[_a] = true;
         this._tree = new SparseTree_1.SparseTree();
-        this._rootNode = { depth: -1, id: undefined, numChildren: undefined };
+        this._rootNode = {
+            depth: -1,
+            id: undefined,
+            numChildren: undefined,
+        };
         if (!seed) {
             return;
         }
@@ -152,15 +160,20 @@ class MutableTreeModel {
         if (sourceNode === undefined) {
             return false;
         }
-        const targetParent = targetParentId === undefined ? this._rootNode : this.getNode(targetParentId);
+        const targetParent = targetParentId === undefined
+            ? this._rootNode
+            : this.getNode(targetParentId);
         if (targetParent === undefined || targetParent.numChildren === undefined) {
             return false;
         }
-        if (targetParentId !== undefined && this.areNodesRelated(sourceNodeId, targetParentId)) {
+        if (targetParentId !== undefined &&
+            this.areNodesRelated(sourceNodeId, targetParentId)) {
             return false;
         }
         this._tree.moveNode(sourceNode.parentId, sourceNodeId, targetParentId, targetIndex);
-        const sourceParent = sourceNode.parentId === undefined ? this._rootNode : this.getNode(sourceNode.parentId);
+        const sourceParent = sourceNode.parentId === undefined
+            ? this._rootNode
+            : this.getNode(sourceNode.parentId);
         (0, core_bentley_1.assert)(sourceParent !== undefined);
         MutableTreeModel.setNumChildrenForNode(sourceParent, this._tree.getChildren(sourceNode.parentId));
         MutableTreeModel.setNumChildrenForNode(targetParent, this._tree.getChildren(targetParentId));
@@ -184,7 +197,9 @@ class MutableTreeModel {
         if (node === undefined || node.parentId === undefined) {
             return false;
         }
-        return node.parentId === ancestorNodeId ? true : this.areNodesRelated(ancestorNodeId, node.parentId);
+        return node.parentId === ancestorNodeId
+            ? true
+            : this.areNodesRelated(ancestorNodeId, node.parentId);
     }
     /**
      * Sets the number of child nodes a parent is expected to contain. All child nodes of this parent will be subsequently
@@ -302,13 +317,21 @@ function getVisibleDescendants(model, parentNode, result = []) {
     let index = 0;
     for (const childId of children) {
         if (childId === undefined) {
-            result.push({ parentId: parentNode.id, depth: parentNode.depth + 1, childIndex: index });
+            result.push({
+                parentId: parentNode.id,
+                depth: parentNode.depth + 1,
+                childIndex: index,
+            });
         }
         else {
             const childNode = model.getNode(childId);
             if (childNode === undefined) {
                 // node was disposed
-                result.push({ parentId: parentNode.id, depth: parentNode.depth + 1, childIndex: index });
+                result.push({
+                    parentId: parentNode.id,
+                    depth: parentNode.depth + 1,
+                    childIndex: index,
+                });
             }
             else {
                 result.push(childNode);
@@ -324,8 +347,10 @@ function getVisibleDescendants(model, parentNode, result = []) {
 exports.getVisibleDescendants = getVisibleDescendants;
 function cloneSubree(source, target, parentId) {
     var _b, _c;
-    target.setNumChildren(parentId, (parentId === undefined ? source.getRootNode() : source.getNode(parentId)).numChildren);
-    for (const [childId, index] of (_c = (_b = source.getChildren(parentId)) === null || _b === void 0 ? void 0 : _b.iterateValues()) !== null && _c !== void 0 ? _c : []) {
+    target.setNumChildren(parentId, (parentId === undefined ? source.getRootNode() : source.getNode(parentId))
+        .numChildren);
+    for (const [childId, index] of (_c = (_b = source
+        .getChildren(parentId)) === null || _b === void 0 ? void 0 : _b.iterateValues()) !== null && _c !== void 0 ? _c : []) {
         const node = source.getNode(childId);
         target.setChildren(parentId, [{ ...node, isLoading: !!node.isLoading }], index);
         cloneSubree(source, target, childId);

package/lib/cjs/components-react/tree/controlled/TreeModel.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeModel.js","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModel.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;;AAEH,iCAAkC;AAClC,mCAAmC;AACnC,sDAA6C;AAE7C,kDAAkD;AAGlD,sDAAmD;AAyHnD;;;GAGG;AACH,SAAgB,eAAe,CAAC,GAAkC;IAChE,OAAO,GAAG,KAAK,SAAS,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;AAC5F,CAAC;AAFD,0CAEC;AAED;;;GAGG;AACH,SAAgB,0BAA0B,CAAC,GAAkC;IAC3E,OAAO,GAAG,KAAK,SAAS,IAAI,YAAY,IAAI,GAAG,CAAC;AAClD,CAAC;AAFD,gEAEC;AAED;;;GAGG;AACH,SAAgB,mBAAmB,CAAC,GAAkC;IACpE,OAAO,GAAG,KAAK,SAAS,IAAK,GAAyB,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,YAAY,IAAI,GAAG,CAAC,CAAC;AACpG,CAAC;AAFD,kDAEC;AAqCD;;;GAGG;AACH,MAAa,gBAAgB;IAM3B,YAAmB,IAAgB;QAL5B,QAAW,GAAG,IAAI,CAAC;QAElB,UAAK,GAAG,IAAI,uBAAU,EAAwB,CAAC;QAC/C,cAAS,GAAsB,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;QAG1F,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QAED,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,sHAAsH;IAC/G,WAAW;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAOM,OAAO,CAAC,MAA0B,EAAE,UAAmB;QAC5D,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAO,CAAC,CAAC;SACpC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC9E,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;SACpC;QAED,MAAM,UAAU,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACtF,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO;gBACL,UAAU;gBACV,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;gBAC3B,QAAQ,EAAE,MAAM;aACjB,CAAC;SACH;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,QAA4B;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,qEAAqE;IAC9D,cAAc,CAAC,QAA4B,EAAE,OAAe;QACjE,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,QAA4B,EAAE,UAAgC,EAAE,MAAc;QAC/F,MAAM,UAAU,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1F,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO;QAET,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE;YAC9B,MAAM,KAAK,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACtE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACtB;QAED,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxD,gBAAgB,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,QAA4B,EAAE,cAAkC,EAAE,MAAc;QACjG,MAAM,UAAU,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1F,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO;QAET,MAAM,KAAK,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QAE/E,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACrD,gBAAgB,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,SAAiB,EAAE,KAAa;;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE;YACtB,OAAO,KAAK,CAAC;SACd;QAED,IAAI,SAAS,KAAK,KAAK,EAAE;YACvB,OAAO,IAAI,CAAC;SACb;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC5D,IAAA,qBAAM,EAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QAE5B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE;YACtD,OAAO,KAAK,CAAC;SACd;QAEA,IAAI,CAAC,EAAa,GAAG,KAAK,CAAC,CAAC,uEAAuE;QACpG,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,MAAA,MAAA,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,0CAAE,aAAa,EAAE,mCAAI,EAAE,EAAE;YACtE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACpC,IAAA,qBAAM,EAAC,KAAK,KAAK,SAAS,CAAC,CAAC;YAC3B,KAAK,CAAC,QAAmB,GAAG,KAAK,CAAC;SACpC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,QAAQ,CAAC,YAAoB,EAAE,cAAkC,EAAE,WAAmB;QAC3F,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO,KAAK,CAAC;SACd;QAED,MAAM,YAAY,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAClG,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE;YACxE,OAAO,KAAK,CAAC;SACd;QAED,IAAI,cAAc,KAAK,SAAS,IAAI,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,cAAc,CAAC,EAAE;YACtF,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,YAAY,EAAE,cAAc,EAAE,WAAW,CAAC,CAAC;QAEpF,MAAM,YAAY,GAAG,UAAU,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC5G,IAAA,qBAAM,EAAC,YAAY,KAAK,SAAS,CAAC,CAAC;QACnC,gBAAgB,CAAC,qBAAqB,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClG,gBAAgB,CAAC,qBAAqB,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC;QAE7F,4EAA4E;QAC3E,UAAU,CAAC,QAA+B,GAAG,cAAc,CAAC;QAE7D,MAAM,YAAY,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE;;YACvD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAA,qBAAM,EAAC,IAAI,KAAK,SAAS,CAAC,CAAC;YAC3B,4EAA4E;YAC3E,IAAI,CAAC,KAAgB,GAAG,KAAK,CAAC;YAC/B,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,MAAA,MAAA,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,0CAAE,aAAa,EAAE,mCAAI,EAAE,EAAE;gBACxE,YAAY,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;aACjC;QACH,CAAC,CAAC;QAEF,YAAY,CAAC,YAAY,EAAE,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,eAAe,CAAC,cAAsB,EAAE,gBAAwB;QACtE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrD,OAAO,KAAK,CAAC;SACd;QAED,OAAO,IAAI,CAAC,QAAQ,KAAK,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvG,CAAC;IAED;;;OAGG;IACI,cAAc,CAAC,QAA4B,EAAE,WAA+B;QACjF,MAAM,UAAU,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1F,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO;SACR;QAED,4EAA4E;QAC3E,UAAU,CAAC,WAAkC,GAAG,WAAW,CAAC;QAC7D,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,EAAE,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,QAA4B,EAAE,KAAsB;QACrE,MAAM,UAAU,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1F,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAExC,uBAAuB;QACvB,IAAI,UAAU;YACZ,gBAAgB,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9F,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,QAA4B;QAC/C,MAAM,UAAU,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1F,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,4EAA4E;YAC3E,UAAU,CAAC,WAAkC,GAAG,SAAS,CAAC;SAC5D;QACD,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,yDAAyD;IAClD,CAAE,qBAAqB,CAAC,QAAiB;QAC9C,4DAA4D;QAC5D,MAAM,KAAK,GAAG,IAAI,CAAC;QACnB,QAAQ,CAAC,CAAC,kBAAkB,CAAC,WAA+B;YAC1D,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;YAChD,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,OAAO;aACR;YAED,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE;gBAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACnC,IAAI,IAAI,KAAK,SAAS,EAAE;oBACtB,MAAM,IAAI,CAAC;oBACX,KAAK,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;iBACnC;aACF;QACH,CAAC;QAED,KAAK,CAAC,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,MAAM,CAAC,qBAAqB,CAAC,IAA8C,EAAE,QAAyC;QAC5H,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAChE,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW;YAClC,OAAO;QAET,4EAA4E;QAC3E,IAAI,CAAC,WAAkC,GAAG,WAAW,CAAC;IACzD,CAAC;IAEO,MAAM,CAAC,mBAAmB,CAAC,UAA6C,EAAE,KAAyB;QACzG,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,QAAQ,EAAE,UAAU,CAAC,EAAE;YACvB,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;YAE3B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,WAAW,EAAE,KAAK,CAAC,WAAW;YAE9B,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE;YACpC,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,mBAAmB,EAAE,KAAK,CAAC,IAAI,CAAC,mBAAmB;YAEnD,QAAQ,EAAE;gBACR,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,IAAI,0BAAa,CAAC,GAAG;gBACpD,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB;gBAC3C,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,iBAAiB;aAC1C;YAED,IAAI,EAAE,IAAA,kBAAS,EAAC,KAAK,CAAC,IAAI,CAAC;SAC5B,CAAC;IACJ,CAAC;CACF;AAnRD,4CAmRC;KAlRS,iBAAS;AAoRnB;;;GAGG;AACH,SAAgB,mBAAmB,CAAC,KAAgB;IAClD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;IACjE,OAAO;QACL,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM;QAChC,UAAU,EAAE,CAAC,KAAa,EAAwD,EAAE;YAClF,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QACD,QAAQ,EAAE,GAAG,EAAE,CAAC,KAAK;QACrB,eAAe,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,WAAW;QACtD,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;QAClD,cAAc,EAAE,CAAC,MAAc,EAAU,EAAE;YACzC,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,EAAE,CAAE,WAA6B,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QACzF,CAAC;KACF,CAAC;AACJ,CAAC;AAdD,kDAcC;AAED;;;GAGG;AACH,SAAgB,qBAAqB,CACnC,KAAgB,EAChB,UAA6C,EAC7C,SAA0D,EAAE;IAE5D,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAClD,IAAI,CAAC,QAAQ,EAAE;QACb,OAAO,MAAM,CAAC;KACf;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;QAC9B,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;SAC1F;aAAM;YACL,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,oBAAoB;gBACpB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;aAC1F;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACvB,IAAI,SAAS,CAAC,UAAU,IAAI,SAAS,CAAC,WAAW,KAAK,SAAS,EAAE;oBAC/D,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;iBACjD;aACF;SACF;QACD,EAAE,KAAK,CAAC;KACT;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AA9BD,sDA8BC;AAED,SAAS,WAAW,CAAC,MAAiB,EAAE,MAAwB,EAAE,QAA4B;;IAC5F,MAAM,CAAC,cAAc,CACnB,QAAQ,EACR,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAE,CAAC,CAAC,WAAW,CACxF,CAAC;IACF,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAA,MAAA,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,0CAAE,aAAa,EAAE,mCAAI,EAAE,EAAE;QAClF,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAE,CAAC;QACtC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAChF,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC;AACH,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/** @packageDocumentation\n * @module Tree\n */\n\nimport { immerable } from \"immer\";\nimport { cloneDeep } from \"lodash\";\nimport { assert } from \"@itwin/core-bentley\";\nimport type { PropertyRecord } from \"@itwin/appui-abstract\";\nimport { CheckBoxState } from \"@itwin/core-react\";\nimport type { DelayLoadedTreeNodeItem, ImmediatelyLoadedTreeNodeItem, TreeNodeItem } from \"../TreeDataProvider\";\nimport type { SparseArray} from \"./internal/SparseTree\";\nimport { SparseTree } from \"./internal/SparseTree\";\n\n/**\n * Immutable data structure that describes tree node.\n * @public\n */\nexport interface TreeModelNode {\n  readonly id: string;\n  readonly parentId: string | undefined;\n  readonly depth: number;\n\n  readonly isLoading?: boolean;\n  readonly numChildren: number | undefined;\n\n  readonly description: string | undefined;\n  readonly isExpanded: boolean;\n  readonly label: PropertyRecord;\n  readonly isSelected: boolean;\n  readonly isSelectionDisabled?: boolean;\n\n  /** Specifies that node is in editing mode. It holds callbacks that are used by node editor. */\n  readonly editingInfo?: TreeModelNodeEditingInfo;\n\n  readonly checkbox: CheckBoxInfo;\n\n  readonly item: TreeNodeItem;\n}\n\n/**\n * Immutable data structure that describes checkbox info.\n * @public\n */\nexport interface CheckBoxInfo {\n  readonly state: CheckBoxState;\n  readonly tooltip?: string;\n  readonly isDisabled: boolean;\n  readonly isVisible: boolean;\n}\n\n/**\n * Mutable data structure that describes tree node.\n * @public\n */\nexport interface MutableTreeModelNode extends TreeModelNode {\n  isLoading: boolean;\n\n  description: string;\n  isExpanded: boolean;\n  label: PropertyRecord;\n  isSelected: boolean;\n  isSelectionDisabled?: boolean;\n\n  /** Specifies that node is in editing mode. It holds callbacks that are used by node editor. */\n  editingInfo?: TreeModelNodeEditingInfo;\n\n  checkbox: MutableCheckBoxInfo;\n\n  item: TreeNodeItem;\n}\n\n/**\n * Data structure that holds callbacks used for tree node editing.\n * @public\n */\nexport interface TreeModelNodeEditingInfo {\n  onCommit: (node: TreeModelNode, newValue: string) => void;\n  onCancel: () => void;\n}\n\n/**\n * Mutable data structure that describes checkbox info.\n * @public\n */\nexport interface MutableCheckBoxInfo extends CheckBoxInfo {\n  state: CheckBoxState;\n  tooltip?: string;\n  isDisabled: boolean;\n  isVisible: boolean;\n}\n\n/**\n * Data structure that describes tree node placeholder.\n * @public\n */\nexport interface TreeModelNodePlaceholder {\n  readonly childIndex: number;\n  readonly depth: number;\n  readonly parentId?: string;\n}\n\n/**\n * Data structure that describes tree root node.\n * @public\n */\nexport interface TreeModelRootNode {\n  readonly depth: -1;\n  readonly id: undefined;\n  readonly numChildren: number | undefined;\n}\n\n/**\n * Data structure that describes input used to create tree node.\n * @public\n */\nexport interface TreeModelNodeInput {\n  readonly description?: string;\n  readonly isExpanded: boolean;\n  readonly id: string;\n  readonly item: TreeNodeItem;\n  readonly label: PropertyRecord;\n  readonly isLoading: boolean;\n  readonly numChildren?: number;\n  readonly isSelected: boolean;\n}\n\n/**\n * Type definition of all tree model nodes.\n * @public\n */\nexport type TreeModelNodeType = TreeModelNode | TreeModelNodePlaceholder | TreeModelRootNode;\n\n/**\n * Checks if object is [[TreeModelNode]]\n * @public\n */\nexport function isTreeModelNode(obj: TreeModelNodeType | undefined): obj is TreeModelNode {\n  return obj !== undefined && !isTreeModelNodePlaceholder(obj) && !isTreeModelRootNode(obj);\n}\n\n/**\n * Checks if object is [[TreeModelNodePlaceholder]]\n * @public\n */\nexport function isTreeModelNodePlaceholder(obj: TreeModelNodeType | undefined): obj is TreeModelNodePlaceholder {\n  return obj !== undefined && \"childIndex\" in obj;\n}\n\n/**\n * Checks if object is [[TreeModelRootNode]]\n * @public\n */\nexport function isTreeModelRootNode(obj: TreeModelNodeType | undefined): obj is TreeModelRootNode {\n  return obj !== undefined && (obj as TreeModelRootNode).id === undefined && !(\"childIndex\" in obj);\n}\n\n/**\n * Type definition of tree node item data.\n * @public\n */\nexport type TreeNodeItemData = ImmediatelyLoadedTreeNodeItem & DelayLoadedTreeNodeItem;\n\n/**\n * Data structure that describes set of visible tree nodes as a flat list.\n * @public\n */\nexport interface VisibleTreeNodes extends Iterable<TreeModelNode | TreeModelNodePlaceholder> {\n  getNumNodes(): number;\n  getAtIndex(index: number): TreeModelNode | TreeModelNodePlaceholder | undefined;\n  getModel(): TreeModel;\n  getNumRootNodes(): number | undefined;\n  getIndexOfNode(nodeId: string): number;\n}\n\n/**\n * Data structure that describes tree model.\n * @public\n */\nexport interface TreeModel {\n  getRootNode(): TreeModelRootNode;\n\n  getNode(id: string): TreeModelNode | undefined;\n  getNode(parentId: string | undefined, childIndex: number): TreeModelNode | TreeModelNodePlaceholder | undefined;\n  getNode(nodeId: string | undefined, childIndex?: number): TreeModelNode | TreeModelNodePlaceholder | TreeModelRootNode | undefined;\n\n  getChildren(parentId: string | undefined): SparseArray<string> | undefined;\n  getChildOffset(parentId: string | undefined, childId: string): number | undefined;\n\n  iterateTreeModelNodes(parentId?: string): IterableIterator<TreeModelNode>;\n}\n\n/**\n * Mutable tree model which holds nodes and allows adding or removing them.\n * @public\n */\nexport class MutableTreeModel implements TreeModel {\n  public [immerable] = true;\n\n  private _tree = new SparseTree<MutableTreeModelNode>();\n  private _rootNode: TreeModelRootNode = { depth: -1, id: undefined, numChildren: undefined };\n\n  public constructor(seed?: TreeModel) {\n    if (!seed) {\n      return;\n    }\n\n    cloneSubree(seed, this, undefined);\n  }\n\n  /** Returns root node of a tree. This node is not visible and is there to allow having multiple visible root nodes. */\n  public getRootNode(): TreeModelRootNode {\n    return this._rootNode;\n  }\n\n  /** Returns tree node or placeholder for node that is not loaded yet.\n   * @returns node, node placeholder or undefined if node is not found in model.\n   */\n  public getNode(id: string): MutableTreeModelNode | undefined;\n  public getNode(parentId: string | undefined, childIndex: number): MutableTreeModelNode | TreeModelNodePlaceholder | undefined;\n  public getNode(nodeId: string | undefined, childIndex?: number): MutableTreeModelNode | TreeModelNodePlaceholder | undefined {\n    if (childIndex === undefined) {\n      return this._tree.getNode(nodeId!);\n    }\n\n    const children = this._tree.getChildren(nodeId);\n    const childId = children !== undefined ? children.get(childIndex) : undefined;\n    if (childId !== undefined) {\n      return this._tree.getNode(childId);\n    }\n\n    const parentNode = nodeId === undefined ? this._rootNode : this._tree.getNode(nodeId);\n    if (parentNode !== undefined) {\n      return {\n        childIndex,\n        depth: parentNode.depth + 1,\n        parentId: nodeId,\n      };\n    }\n\n    return undefined;\n  }\n\n  /** Returns children for specific parent.\n   * @param parentId id of parent node.\n   * @returns children of parent node or root nodes if undefined is passed as parent id.\n   */\n  public getChildren(parentId: string | undefined): SparseArray<string> | undefined {\n    return this._tree.getChildren(parentId);\n  }\n\n  /** Returns children offset in children array for specific parent. */\n  public getChildOffset(parentId: string | undefined, childId: string): number | undefined {\n    return this._tree.getChildOffset(parentId, childId);\n  }\n\n  /**\n   * Sets children for parent node starting from the specific offset.\n   * If offset overlaps with already added nodes, the overlapping nodes are overwritten.\n   */\n  public setChildren(parentId: string | undefined, nodeInputs: TreeModelNodeInput[], offset: number): void {\n    const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode === undefined)\n      return;\n\n    const children: MutableTreeModelNode[] = [];\n    for (const input of nodeInputs) {\n      const child = MutableTreeModel.createTreeModelNode(parentNode, input);\n      children.push(child);\n    }\n\n    this._tree.setChildren(parentNode.id, children, offset);\n    MutableTreeModel.setNumChildrenForNode(parentNode, this._tree.getChildren(parentNode.id));\n  }\n\n  /**\n   * Inserts child in the specified position.\n   * If offset is higher then current length of children array, the length is increased.\n   */\n  public insertChild(parentId: string | undefined, childNodeInput: TreeModelNodeInput, offset: number): void {\n    const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode === undefined)\n      return;\n\n    const child = MutableTreeModel.createTreeModelNode(parentNode, childNodeInput);\n\n    this._tree.insertChild(parentNode.id, child, offset);\n    MutableTreeModel.setNumChildrenForNode(parentNode, this._tree.getChildren(parentNode.id));\n  }\n\n  /**\n   * Changes the id of target node.\n   * @returns `true` on success, `false` otherwise.\n   */\n  public changeNodeId(currentId: string, newId: string): boolean {\n    const node = this.getNode(currentId);\n    if (node === undefined) {\n      return false;\n    }\n\n    if (currentId === newId) {\n      return true;\n    }\n\n    const index = this.getChildOffset(node.parentId, currentId);\n    assert(index !== undefined);\n\n    if (!this._tree.setNodeId(node.parentId, index, newId)) {\n      return false;\n    }\n\n    (node.id as string) = newId; // eslint-disable-line @typescript-eslint/no-unnecessary-type-assertion\n    for (const [childId] of this.getChildren(newId)?.iterateValues() ?? []) {\n      const child = this.getNode(childId);\n      assert(child !== undefined);\n      (child.parentId as string) = newId;\n    }\n\n    return true;\n  }\n\n  /**\n   * Transfers node along with its children to a new location. Fails if destination has undefined child count.\n   * @param sourceNodeId Node that is being moved.\n   * @param targetParentId Node that will receive a new child.\n   * @param targetIndex Insertion location among target's *current* children.\n   * @returns `true` on success, `false` otherwise.\n   */\n  public moveNode(sourceNodeId: string, targetParentId: string | undefined, targetIndex: number): boolean {\n    const sourceNode = this.getNode(sourceNodeId);\n    if (sourceNode === undefined) {\n      return false;\n    }\n\n    const targetParent = targetParentId === undefined ? this._rootNode : this.getNode(targetParentId);\n    if (targetParent === undefined || targetParent.numChildren === undefined) {\n      return false;\n    }\n\n    if (targetParentId !== undefined && this.areNodesRelated(sourceNodeId, targetParentId)) {\n      return false;\n    }\n\n    this._tree.moveNode(sourceNode.parentId, sourceNodeId, targetParentId, targetIndex);\n\n    const sourceParent = sourceNode.parentId === undefined ? this._rootNode : this.getNode(sourceNode.parentId);\n    assert(sourceParent !== undefined);\n    MutableTreeModel.setNumChildrenForNode(sourceParent, this._tree.getChildren(sourceNode.parentId));\n    MutableTreeModel.setNumChildrenForNode(targetParent, this._tree.getChildren(targetParentId));\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n    (sourceNode.parentId as string | undefined) = targetParentId;\n\n    const updateDepths = (parentId: string, depth: number) => {\n      const node = this.getNode(parentId);\n      assert(node !== undefined);\n      // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n      (node.depth as number) = depth;\n      for (const [nodeId] of this.getChildren(parentId)?.iterateValues() ?? []) {\n        updateDepths(nodeId, depth + 1);\n      }\n    };\n\n    updateDepths(sourceNodeId, targetParent.depth + 1);\n    return true;\n  }\n\n  private areNodesRelated(ancestorNodeId: string, descendantNodeId: string): boolean {\n    const node = this.getNode(descendantNodeId);\n    if (node === undefined || node.parentId === undefined) {\n      return false;\n    }\n\n    return node.parentId === ancestorNodeId ? true : this.areNodesRelated(ancestorNodeId, node.parentId);\n  }\n\n  /**\n   * Sets the number of child nodes a parent is expected to contain. All child nodes of this parent will be subsequently\n   * removed.\n   */\n  public setNumChildren(parentId: string | undefined, numChildren: number | undefined): void {\n    const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode === undefined) {\n      return;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n    (parentNode.numChildren as number | undefined) = numChildren;\n    this._tree.setNumChildren(parentId, numChildren ?? 0);\n  }\n\n  /** Removes children specified by id.\n   * @param parentId id of the parent node.\n   * @param child child node id or index that should be removed.\n   */\n  public removeChild(parentId: string | undefined, child: string | number): void {\n    const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    this._tree.removeChild(parentId, child);\n\n    // istanbul ignore else\n    if (parentNode)\n      MutableTreeModel.setNumChildrenForNode(parentNode, this._tree.getChildren(parentNode.id));\n  }\n\n  /** Removes all children for parent specified by id.\n   * @param parentId id of parent node or undefined to remove root nodes.\n   */\n  public clearChildren(parentId: string | undefined) {\n    const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode !== undefined) {\n      // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n      (parentNode.numChildren as number | undefined) = undefined;\n    }\n    this._tree.deleteSubtree(parentId, false);\n  }\n\n  /** Iterates over all nodes present in the tree model. */\n  public * iterateTreeModelNodes(parentId?: string): IterableIterator<MutableTreeModelNode> {\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    const _this = this;\n    function* iterateDescendants(subParentId: string | undefined): IterableIterator<MutableTreeModelNode> {\n      const children = _this.getChildren(subParentId);\n      if (children === undefined) {\n        return;\n      }\n\n      for (const [nodeId] of children.iterateValues()) {\n        const node = _this.getNode(nodeId);\n        if (node !== undefined) {\n          yield node;\n          yield* iterateDescendants(nodeId);\n        }\n      }\n    }\n\n    yield* iterateDescendants(parentId);\n  }\n\n  private static setNumChildrenForNode(node: TreeModelRootNode | MutableTreeModelNode, children: SparseArray<string> | undefined) {\n    const numChildren = children ? children.getLength() : undefined;\n    if (node.numChildren === numChildren)\n      return;\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n    (node.numChildren as number | undefined) = numChildren;\n  }\n\n  private static createTreeModelNode(parentNode: TreeModelNode | TreeModelRootNode, input: TreeModelNodeInput): MutableTreeModelNode {\n    return {\n      id: input.id,\n      parentId: parentNode.id,\n      depth: parentNode.depth + 1,\n\n      isLoading: input.isLoading,\n      numChildren: input.numChildren,\n\n      description: input.description || \"\",\n      isExpanded: input.isExpanded,\n      label: input.label,\n      isSelected: input.isSelected,\n      isSelectionDisabled: input.item.isSelectionDisabled,\n\n      checkbox: {\n        state: input.item.checkBoxState || CheckBoxState.Off,\n        isDisabled: !!input.item.isCheckboxDisabled,\n        isVisible: !!input.item.isCheckboxVisible,\n      },\n\n      item: cloneDeep(input.item),\n    };\n  }\n}\n\n/**\n * Generates flat list of visible nodes in the tree model.\n * @public\n */\nexport function computeVisibleNodes(model: TreeModel): VisibleTreeNodes {\n  const result = getVisibleDescendants(model, model.getRootNode());\n  return {\n    getNumNodes: () => result.length,\n    getAtIndex: (index: number): TreeModelNode | TreeModelNodePlaceholder | undefined => {\n      return result[index];\n    },\n    getModel: () => model,\n    getNumRootNodes: () => model.getRootNode().numChildren,\n    [Symbol.iterator]: () => result[Symbol.iterator](),\n    getIndexOfNode: (nodeId: string): number => {\n      return result.findIndex((visibleNode) => (visibleNode as TreeModelNode).id === nodeId);\n    },\n  };\n}\n\n/**\n * Traverses the tree and collects visible descendants.\n * @public\n */\nexport function getVisibleDescendants(\n  model: TreeModel,\n  parentNode: TreeModelNode | TreeModelRootNode,\n  result: Array<TreeModelNode | TreeModelNodePlaceholder> = [],\n): Array<TreeModelNode | TreeModelNodePlaceholder> {\n  const children = model.getChildren(parentNode.id);\n  if (!children) {\n    return result;\n  }\n\n  let index = 0;\n  for (const childId of children) {\n    if (childId === undefined) {\n      result.push({ parentId: parentNode.id, depth: parentNode.depth + 1, childIndex: index });\n    } else {\n      const childNode = model.getNode(childId);\n      if (childNode === undefined) {\n        // node was disposed\n        result.push({ parentId: parentNode.id, depth: parentNode.depth + 1, childIndex: index });\n      } else {\n        result.push(childNode);\n        if (childNode.isExpanded && childNode.numChildren !== undefined) {\n          getVisibleDescendants(model, childNode, result);\n        }\n      }\n    }\n    ++index;\n  }\n\n  return result;\n}\n\nfunction cloneSubree(source: TreeModel, target: MutableTreeModel, parentId: string | undefined): void {\n  target.setNumChildren(\n    parentId,\n    (parentId === undefined ? source.getRootNode() : source.getNode(parentId)!).numChildren,\n  );\n  for (const [childId, index] of source.getChildren(parentId)?.iterateValues() ?? []) {\n    const node = source.getNode(childId)!;\n    target.setChildren(parentId, [{ ...node, isLoading: !!node.isLoading }], index);\n    cloneSubree(source, target, childId);\n  }\n}\n"]}
+{"version":3,"file":"TreeModel.js","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModel.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG;;GAEG;;;;AAEH,iCAAkC;AAClC,mCAAmC;AACnC,sDAA6C;AAE7C,kDAAkD;AAOlD,sDAAmD;AA4HnD;;;GAGG;AACH,SAAgB,eAAe,CAC7B,GAAkC;IAElC,OAAO,CACL,GAAG,KAAK,SAAS;QACjB,CAAC,0BAA0B,CAAC,GAAG,CAAC;QAChC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAC1B,CAAC;AACJ,CAAC;AARD,0CAQC;AAED;;;GAGG;AACH,SAAgB,0BAA0B,CACxC,GAAkC;IAElC,OAAO,GAAG,KAAK,SAAS,IAAI,YAAY,IAAI,GAAG,CAAC;AAClD,CAAC;AAJD,gEAIC;AAED;;;GAGG;AACH,SAAgB,mBAAmB,CACjC,GAAkC;IAElC,OAAO,CACL,GAAG,KAAK,SAAS;QAChB,GAAyB,CAAC,EAAE,KAAK,SAAS;QAC3C,CAAC,CAAC,YAAY,IAAI,GAAG,CAAC,CACvB,CAAC;AACJ,CAAC;AARD,kDAQC;AAkDD;;;GAGG;AACH,MAAa,gBAAgB;IAU3B,YAAmB,IAAgB;QAT5B,QAAW,GAAG,IAAI,CAAC;QAElB,UAAK,GAAG,IAAI,uBAAU,EAAwB,CAAC;QAC/C,cAAS,GAAsB;YACrC,KAAK,EAAE,CAAC,CAAC;YACT,EAAE,EAAE,SAAS;YACb,WAAW,EAAE,SAAS;SACvB,CAAC;QAGA,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QAED,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,sHAAsH;IAC/G,WAAW;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAUM,OAAO,CACZ,MAA0B,EAC1B,UAAmB;QAEnB,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAO,CAAC,CAAC;SACpC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,OAAO,GACX,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChE,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;SACpC;QAED,MAAM,UAAU,GACd,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACrE,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO;gBACL,UAAU;gBACV,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;gBAC3B,QAAQ,EAAE,MAAM;aACjB,CAAC;SACH;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,WAAW,CAChB,QAA4B;QAE5B,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,qEAAqE;IAC9D,cAAc,CACnB,QAA4B,EAC5B,OAAe;QAEf,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACI,WAAW,CAChB,QAA4B,EAC5B,UAAgC,EAChC,MAAc;QAEd,MAAM,UAAU,GACd,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzE,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO;QAErC,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE;YAC9B,MAAM,KAAK,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACtE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACtB;QAED,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxD,gBAAgB,CAAC,qBAAqB,CACpC,UAAU,EACV,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CACtC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,WAAW,CAChB,QAA4B,EAC5B,cAAkC,EAClC,MAAc;QAEd,MAAM,UAAU,GACd,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzE,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO;QAErC,MAAM,KAAK,GAAG,gBAAgB,CAAC,mBAAmB,CAChD,UAAU,EACV,cAAc,CACf,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACrD,gBAAgB,CAAC,qBAAqB,CACpC,UAAU,EACV,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CACtC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,SAAiB,EAAE,KAAa;;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE;YACtB,OAAO,KAAK,CAAC;SACd;QAED,IAAI,SAAS,KAAK,KAAK,EAAE;YACvB,OAAO,IAAI,CAAC;SACb;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC5D,IAAA,qBAAM,EAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QAE5B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE;YACtD,OAAO,KAAK,CAAC;SACd;QAEA,IAAI,CAAC,EAAa,GAAG,KAAK,CAAC,CAAC,uEAAuE;QACpG,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,MAAA,MAAA,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,0CAAE,aAAa,EAAE,mCAAI,EAAE,EAAE;YACtE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACpC,IAAA,qBAAM,EAAC,KAAK,KAAK,SAAS,CAAC,CAAC;YAC3B,KAAK,CAAC,QAAmB,GAAG,KAAK,CAAC;SACpC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,QAAQ,CACb,YAAoB,EACpB,cAAkC,EAClC,WAAmB;QAEnB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO,KAAK,CAAC;SACd;QAED,MAAM,YAAY,GAChB,cAAc,KAAK,SAAS;YAC1B,CAAC,CAAC,IAAI,CAAC,SAAS;YAChB,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QACnC,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE;YACxE,OAAO,KAAK,CAAC;SACd;QAED,IACE,cAAc,KAAK,SAAS;YAC5B,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,cAAc,CAAC,EAClD;YACA,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,KAAK,CAAC,QAAQ,CACjB,UAAU,CAAC,QAAQ,EACnB,YAAY,EACZ,cAAc,EACd,WAAW,CACZ,CAAC;QAEF,MAAM,YAAY,GAChB,UAAU,CAAC,QAAQ,KAAK,SAAS;YAC/B,CAAC,CAAC,IAAI,CAAC,SAAS;YAChB,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAA,qBAAM,EAAC,YAAY,KAAK,SAAS,CAAC,CAAC;QACnC,gBAAgB,CAAC,qBAAqB,CACpC,YAAY,EACZ,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAC5C,CAAC;QACF,gBAAgB,CAAC,qBAAqB,CACpC,YAAY,EACZ,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CACvC,CAAC;QAEF,4EAA4E;QAC3E,UAAU,CAAC,QAA+B,GAAG,cAAc,CAAC;QAE7D,MAAM,YAAY,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE;;YACvD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAA,qBAAM,EAAC,IAAI,KAAK,SAAS,CAAC,CAAC;YAC3B,4EAA4E;YAC3E,IAAI,CAAC,KAAgB,GAAG,KAAK,CAAC;YAC/B,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,MAAA,MAAA,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,0CAAE,aAAa,EAAE,mCAChE,EAAE,EAAE;gBACJ,YAAY,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;aACjC;QACH,CAAC,CAAC;QAEF,YAAY,CAAC,YAAY,EAAE,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,eAAe,CACrB,cAAsB,EACtB,gBAAwB;QAExB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrD,OAAO,KAAK,CAAC;SACd;QAED,OAAO,IAAI,CAAC,QAAQ,KAAK,cAAc;YACrC,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED;;;OAGG;IACI,cAAc,CACnB,QAA4B,EAC5B,WAA+B;QAE/B,MAAM,UAAU,GACd,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzE,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,OAAO;SACR;QAED,4EAA4E;QAC3E,UAAU,CAAC,WAAkC,GAAG,WAAW,CAAC;QAC7D,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,EAAE,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACI,WAAW,CAChB,QAA4B,EAC5B,KAAsB;QAEtB,MAAM,UAAU,GACd,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAExC,uBAAuB;QACvB,IAAI,UAAU;YACZ,gBAAgB,CAAC,qBAAqB,CACpC,UAAU,EACV,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CACtC,CAAC;IACN,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,QAA4B;QAC/C,MAAM,UAAU,GACd,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzE,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,4EAA4E;YAC3E,UAAU,CAAC,WAAkC,GAAG,SAAS,CAAC;SAC5D;QACD,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,yDAAyD;IAClD,CAAC,qBAAqB,CAC3B,QAAiB;QAEjB,4DAA4D;QAC5D,MAAM,KAAK,GAAG,IAAI,CAAC;QACnB,QAAQ,CAAC,CAAC,kBAAkB,CAC1B,WAA+B;YAE/B,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;YAChD,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,OAAO;aACR;YAED,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE;gBAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACnC,IAAI,IAAI,KAAK,SAAS,EAAE;oBACtB,MAAM,IAAI,CAAC;oBACX,KAAK,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;iBACnC;aACF;QACH,CAAC;QAED,KAAK,CAAC,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,MAAM,CAAC,qBAAqB,CAClC,IAA8C,EAC9C,QAAyC;QAEzC,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAChE,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW;YAAE,OAAO;QAE7C,4EAA4E;QAC3E,IAAI,CAAC,WAAkC,GAAG,WAAW,CAAC;IACzD,CAAC;IAEO,MAAM,CAAC,mBAAmB,CAChC,UAA6C,EAC7C,KAAyB;QAEzB,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,QAAQ,EAAE,UAAU,CAAC,EAAE;YACvB,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;YAE3B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,WAAW,EAAE,KAAK,CAAC,WAAW;YAE9B,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE;YACpC,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,mBAAmB,EAAE,KAAK,CAAC,IAAI,CAAC,mBAAmB;YAEnD,QAAQ,EAAE;gBACR,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,IAAI,0BAAa,CAAC,GAAG;gBACpD,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB;gBAC3C,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,iBAAiB;aAC1C;YAED,IAAI,EAAE,IAAA,kBAAS,EAAC,KAAK,CAAC,IAAI,CAAC;SAC5B,CAAC;IACJ,CAAC;CACF;AAxWD,4CAwWC;KAvWS,iBAAS;AAyWnB;;;GAGG;AACH,SAAgB,mBAAmB,CAAC,KAAgB;IAClD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;IACjE,OAAO;QACL,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM;QAChC,UAAU,EAAE,CACV,KAAa,EACyC,EAAE;YACxD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QACD,QAAQ,EAAE,GAAG,EAAE,CAAC,KAAK;QACrB,eAAe,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,WAAW;QACtD,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;QAClD,cAAc,EAAE,CAAC,MAAc,EAAU,EAAE;YACzC,OAAO,MAAM,CAAC,SAAS,CACrB,CAAC,WAAW,EAAE,EAAE,CAAE,WAA6B,CAAC,EAAE,KAAK,MAAM,CAC9D,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAlBD,kDAkBC;AAED;;;GAGG;AACH,SAAgB,qBAAqB,CACnC,KAAgB,EAChB,UAA6C,EAC7C,SAA0D,EAAE;IAE5D,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAClD,IAAI,CAAC,QAAQ,EAAE;QACb,OAAO,MAAM,CAAC;KACf;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;QAC9B,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,UAAU,CAAC,EAAE;gBACvB,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;gBAC3B,UAAU,EAAE,KAAK;aAClB,CAAC,CAAC;SACJ;aAAM;YACL,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,oBAAoB;gBACpB,MAAM,CAAC,IAAI,CAAC;oBACV,QAAQ,EAAE,UAAU,CAAC,EAAE;oBACvB,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;oBAC3B,UAAU,EAAE,KAAK;iBAClB,CAAC,CAAC;aACJ;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACvB,IAAI,SAAS,CAAC,UAAU,IAAI,SAAS,CAAC,WAAW,KAAK,SAAS,EAAE;oBAC/D,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;iBACjD;aACF;SACF;QACD,EAAE,KAAK,CAAC;KACT;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAtCD,sDAsCC;AAED,SAAS,WAAW,CAClB,MAAiB,EACjB,MAAwB,EACxB,QAA4B;;IAE5B,MAAM,CAAC,cAAc,CACnB,QAAQ,EACR,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAE,CAAC;SACxE,WAAW,CACf,CAAC;IACF,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAA,MAAA,MAAM;SAClC,WAAW,CAAC,QAAQ,CAAC,0CACpB,aAAa,EAAE,mCAAI,EAAE,EAAE;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAE,CAAC;QACtC,MAAM,CAAC,WAAW,CAChB,QAAQ,EACR,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAC1C,KAAK,CACN,CAAC;QACF,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC;AACH,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/** @packageDocumentation\n * @module Tree\n */\n\nimport { immerable } from \"immer\";\nimport { cloneDeep } from \"lodash\";\nimport { assert } from \"@itwin/core-bentley\";\nimport type { PropertyRecord } from \"@itwin/appui-abstract\";\nimport { CheckBoxState } from \"@itwin/core-react\";\nimport type {\n  DelayLoadedTreeNodeItem,\n  ImmediatelyLoadedTreeNodeItem,\n  TreeNodeItem,\n} from \"../TreeDataProvider\";\nimport type { SparseArray } from \"./internal/SparseTree\";\nimport { SparseTree } from \"./internal/SparseTree\";\n\n/**\n * Immutable data structure that describes tree node.\n * @public\n */\nexport interface TreeModelNode {\n  readonly id: string;\n  readonly parentId: string | undefined;\n  readonly depth: number;\n\n  readonly isLoading?: boolean;\n  readonly numChildren: number | undefined;\n\n  readonly description: string | undefined;\n  readonly isExpanded: boolean;\n  readonly label: PropertyRecord;\n  readonly isSelected: boolean;\n  readonly isSelectionDisabled?: boolean;\n\n  /** Specifies that node is in editing mode. It holds callbacks that are used by node editor. */\n  readonly editingInfo?: TreeModelNodeEditingInfo;\n\n  readonly checkbox: CheckBoxInfo;\n\n  readonly item: TreeNodeItem;\n}\n\n/**\n * Immutable data structure that describes checkbox info.\n * @public\n */\nexport interface CheckBoxInfo {\n  readonly state: CheckBoxState;\n  readonly tooltip?: string;\n  readonly isDisabled: boolean;\n  readonly isVisible: boolean;\n}\n\n/**\n * Mutable data structure that describes tree node.\n * @public\n */\nexport interface MutableTreeModelNode extends TreeModelNode {\n  isLoading: boolean;\n\n  description: string;\n  isExpanded: boolean;\n  label: PropertyRecord;\n  isSelected: boolean;\n  isSelectionDisabled?: boolean;\n\n  /** Specifies that node is in editing mode. It holds callbacks that are used by node editor. */\n  editingInfo?: TreeModelNodeEditingInfo;\n\n  checkbox: MutableCheckBoxInfo;\n\n  item: TreeNodeItem;\n}\n\n/**\n * Data structure that holds callbacks used for tree node editing.\n * @public\n */\nexport interface TreeModelNodeEditingInfo {\n  onCommit: (node: TreeModelNode, newValue: string) => void;\n  onCancel: () => void;\n}\n\n/**\n * Mutable data structure that describes checkbox info.\n * @public\n */\nexport interface MutableCheckBoxInfo extends CheckBoxInfo {\n  state: CheckBoxState;\n  tooltip?: string;\n  isDisabled: boolean;\n  isVisible: boolean;\n}\n\n/**\n * Data structure that describes tree node placeholder.\n * @public\n */\nexport interface TreeModelNodePlaceholder {\n  readonly childIndex: number;\n  readonly depth: number;\n  readonly parentId?: string;\n}\n\n/**\n * Data structure that describes tree root node.\n * @public\n */\nexport interface TreeModelRootNode {\n  readonly depth: -1;\n  readonly id: undefined;\n  readonly numChildren: number | undefined;\n}\n\n/**\n * Data structure that describes input used to create tree node.\n * @public\n */\nexport interface TreeModelNodeInput {\n  readonly description?: string;\n  readonly isExpanded: boolean;\n  readonly id: string;\n  readonly item: TreeNodeItem;\n  readonly label: PropertyRecord;\n  readonly isLoading: boolean;\n  readonly numChildren?: number;\n  readonly isSelected: boolean;\n}\n\n/**\n * Type definition of all tree model nodes.\n * @public\n */\nexport type TreeModelNodeType =\n  | TreeModelNode\n  | TreeModelNodePlaceholder\n  | TreeModelRootNode;\n\n/**\n * Checks if object is [[TreeModelNode]]\n * @public\n */\nexport function isTreeModelNode(\n  obj: TreeModelNodeType | undefined\n): obj is TreeModelNode {\n  return (\n    obj !== undefined &&\n    !isTreeModelNodePlaceholder(obj) &&\n    !isTreeModelRootNode(obj)\n  );\n}\n\n/**\n * Checks if object is [[TreeModelNodePlaceholder]]\n * @public\n */\nexport function isTreeModelNodePlaceholder(\n  obj: TreeModelNodeType | undefined\n): obj is TreeModelNodePlaceholder {\n  return obj !== undefined && \"childIndex\" in obj;\n}\n\n/**\n * Checks if object is [[TreeModelRootNode]]\n * @public\n */\nexport function isTreeModelRootNode(\n  obj: TreeModelNodeType | undefined\n): obj is TreeModelRootNode {\n  return (\n    obj !== undefined &&\n    (obj as TreeModelRootNode).id === undefined &&\n    !(\"childIndex\" in obj)\n  );\n}\n\n/**\n * Type definition of tree node item data.\n * @public\n */\nexport type TreeNodeItemData = ImmediatelyLoadedTreeNodeItem &\n  DelayLoadedTreeNodeItem;\n\n/**\n * Data structure that describes set of visible tree nodes as a flat list.\n * @public\n */\nexport interface VisibleTreeNodes\n  extends Iterable<TreeModelNode | TreeModelNodePlaceholder> {\n  getNumNodes(): number;\n  getAtIndex(\n    index: number\n  ): TreeModelNode | TreeModelNodePlaceholder | undefined;\n  getModel(): TreeModel;\n  getNumRootNodes(): number | undefined;\n  getIndexOfNode(nodeId: string): number;\n}\n\n/**\n * Data structure that describes tree model.\n * @public\n */\nexport interface TreeModel {\n  getRootNode(): TreeModelRootNode;\n\n  getNode(id: string): TreeModelNode | undefined;\n  getNode(\n    parentId: string | undefined,\n    childIndex: number\n  ): TreeModelNode | TreeModelNodePlaceholder | undefined;\n  getNode(\n    nodeId: string | undefined,\n    childIndex?: number\n  ): TreeModelNode | TreeModelNodePlaceholder | TreeModelRootNode | undefined;\n\n  getChildren(parentId: string | undefined): SparseArray<string> | undefined;\n  getChildOffset(\n    parentId: string | undefined,\n    childId: string\n  ): number | undefined;\n\n  iterateTreeModelNodes(parentId?: string): IterableIterator<TreeModelNode>;\n}\n\n/**\n * Mutable tree model which holds nodes and allows adding or removing them.\n * @public\n */\nexport class MutableTreeModel implements TreeModel {\n  public [immerable] = true;\n\n  private _tree = new SparseTree<MutableTreeModelNode>();\n  private _rootNode: TreeModelRootNode = {\n    depth: -1,\n    id: undefined,\n    numChildren: undefined,\n  };\n\n  public constructor(seed?: TreeModel) {\n    if (!seed) {\n      return;\n    }\n\n    cloneSubree(seed, this, undefined);\n  }\n\n  /** Returns root node of a tree. This node is not visible and is there to allow having multiple visible root nodes. */\n  public getRootNode(): TreeModelRootNode {\n    return this._rootNode;\n  }\n\n  /** Returns tree node or placeholder for node that is not loaded yet.\n   * @returns node, node placeholder or undefined if node is not found in model.\n   */\n  public getNode(id: string): MutableTreeModelNode | undefined;\n  public getNode(\n    parentId: string | undefined,\n    childIndex: number\n  ): MutableTreeModelNode | TreeModelNodePlaceholder | undefined;\n  public getNode(\n    nodeId: string | undefined,\n    childIndex?: number\n  ): MutableTreeModelNode | TreeModelNodePlaceholder | undefined {\n    if (childIndex === undefined) {\n      return this._tree.getNode(nodeId!);\n    }\n\n    const children = this._tree.getChildren(nodeId);\n    const childId =\n      children !== undefined ? children.get(childIndex) : undefined;\n    if (childId !== undefined) {\n      return this._tree.getNode(childId);\n    }\n\n    const parentNode =\n      nodeId === undefined ? this._rootNode : this._tree.getNode(nodeId);\n    if (parentNode !== undefined) {\n      return {\n        childIndex,\n        depth: parentNode.depth + 1,\n        parentId: nodeId,\n      };\n    }\n\n    return undefined;\n  }\n\n  /** Returns children for specific parent.\n   * @param parentId id of parent node.\n   * @returns children of parent node or root nodes if undefined is passed as parent id.\n   */\n  public getChildren(\n    parentId: string | undefined\n  ): SparseArray<string> | undefined {\n    return this._tree.getChildren(parentId);\n  }\n\n  /** Returns children offset in children array for specific parent. */\n  public getChildOffset(\n    parentId: string | undefined,\n    childId: string\n  ): number | undefined {\n    return this._tree.getChildOffset(parentId, childId);\n  }\n\n  /**\n   * Sets children for parent node starting from the specific offset.\n   * If offset overlaps with already added nodes, the overlapping nodes are overwritten.\n   */\n  public setChildren(\n    parentId: string | undefined,\n    nodeInputs: TreeModelNodeInput[],\n    offset: number\n  ): void {\n    const parentNode =\n      parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode === undefined) return;\n\n    const children: MutableTreeModelNode[] = [];\n    for (const input of nodeInputs) {\n      const child = MutableTreeModel.createTreeModelNode(parentNode, input);\n      children.push(child);\n    }\n\n    this._tree.setChildren(parentNode.id, children, offset);\n    MutableTreeModel.setNumChildrenForNode(\n      parentNode,\n      this._tree.getChildren(parentNode.id)\n    );\n  }\n\n  /**\n   * Inserts child in the specified position.\n   * If offset is higher then current length of children array, the length is increased.\n   */\n  public insertChild(\n    parentId: string | undefined,\n    childNodeInput: TreeModelNodeInput,\n    offset: number\n  ): void {\n    const parentNode =\n      parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode === undefined) return;\n\n    const child = MutableTreeModel.createTreeModelNode(\n      parentNode,\n      childNodeInput\n    );\n\n    this._tree.insertChild(parentNode.id, child, offset);\n    MutableTreeModel.setNumChildrenForNode(\n      parentNode,\n      this._tree.getChildren(parentNode.id)\n    );\n  }\n\n  /**\n   * Changes the id of target node.\n   * @returns `true` on success, `false` otherwise.\n   */\n  public changeNodeId(currentId: string, newId: string): boolean {\n    const node = this.getNode(currentId);\n    if (node === undefined) {\n      return false;\n    }\n\n    if (currentId === newId) {\n      return true;\n    }\n\n    const index = this.getChildOffset(node.parentId, currentId);\n    assert(index !== undefined);\n\n    if (!this._tree.setNodeId(node.parentId, index, newId)) {\n      return false;\n    }\n\n    (node.id as string) = newId; // eslint-disable-line @typescript-eslint/no-unnecessary-type-assertion\n    for (const [childId] of this.getChildren(newId)?.iterateValues() ?? []) {\n      const child = this.getNode(childId);\n      assert(child !== undefined);\n      (child.parentId as string) = newId;\n    }\n\n    return true;\n  }\n\n  /**\n   * Transfers node along with its children to a new location. Fails if destination has undefined child count.\n   * @param sourceNodeId Node that is being moved.\n   * @param targetParentId Node that will receive a new child.\n   * @param targetIndex Insertion location among target's *current* children.\n   * @returns `true` on success, `false` otherwise.\n   */\n  public moveNode(\n    sourceNodeId: string,\n    targetParentId: string | undefined,\n    targetIndex: number\n  ): boolean {\n    const sourceNode = this.getNode(sourceNodeId);\n    if (sourceNode === undefined) {\n      return false;\n    }\n\n    const targetParent =\n      targetParentId === undefined\n        ? this._rootNode\n        : this.getNode(targetParentId);\n    if (targetParent === undefined || targetParent.numChildren === undefined) {\n      return false;\n    }\n\n    if (\n      targetParentId !== undefined &&\n      this.areNodesRelated(sourceNodeId, targetParentId)\n    ) {\n      return false;\n    }\n\n    this._tree.moveNode(\n      sourceNode.parentId,\n      sourceNodeId,\n      targetParentId,\n      targetIndex\n    );\n\n    const sourceParent =\n      sourceNode.parentId === undefined\n        ? this._rootNode\n        : this.getNode(sourceNode.parentId);\n    assert(sourceParent !== undefined);\n    MutableTreeModel.setNumChildrenForNode(\n      sourceParent,\n      this._tree.getChildren(sourceNode.parentId)\n    );\n    MutableTreeModel.setNumChildrenForNode(\n      targetParent,\n      this._tree.getChildren(targetParentId)\n    );\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n    (sourceNode.parentId as string | undefined) = targetParentId;\n\n    const updateDepths = (parentId: string, depth: number) => {\n      const node = this.getNode(parentId);\n      assert(node !== undefined);\n      // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n      (node.depth as number) = depth;\n      for (const [nodeId] of this.getChildren(parentId)?.iterateValues() ??\n        []) {\n        updateDepths(nodeId, depth + 1);\n      }\n    };\n\n    updateDepths(sourceNodeId, targetParent.depth + 1);\n    return true;\n  }\n\n  private areNodesRelated(\n    ancestorNodeId: string,\n    descendantNodeId: string\n  ): boolean {\n    const node = this.getNode(descendantNodeId);\n    if (node === undefined || node.parentId === undefined) {\n      return false;\n    }\n\n    return node.parentId === ancestorNodeId\n      ? true\n      : this.areNodesRelated(ancestorNodeId, node.parentId);\n  }\n\n  /**\n   * Sets the number of child nodes a parent is expected to contain. All child nodes of this parent will be subsequently\n   * removed.\n   */\n  public setNumChildren(\n    parentId: string | undefined,\n    numChildren: number | undefined\n  ): void {\n    const parentNode =\n      parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode === undefined) {\n      return;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n    (parentNode.numChildren as number | undefined) = numChildren;\n    this._tree.setNumChildren(parentId, numChildren ?? 0);\n  }\n\n  /** Removes children specified by id.\n   * @param parentId id of the parent node.\n   * @param child child node id or index that should be removed.\n   */\n  public removeChild(\n    parentId: string | undefined,\n    child: string | number\n  ): void {\n    const parentNode =\n      parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    this._tree.removeChild(parentId, child);\n\n    // istanbul ignore else\n    if (parentNode)\n      MutableTreeModel.setNumChildrenForNode(\n        parentNode,\n        this._tree.getChildren(parentNode.id)\n      );\n  }\n\n  /** Removes all children for parent specified by id.\n   * @param parentId id of parent node or undefined to remove root nodes.\n   */\n  public clearChildren(parentId: string | undefined) {\n    const parentNode =\n      parentId === undefined ? this._rootNode : this._tree.getNode(parentId);\n    if (parentNode !== undefined) {\n      // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n      (parentNode.numChildren as number | undefined) = undefined;\n    }\n    this._tree.deleteSubtree(parentId, false);\n  }\n\n  /** Iterates over all nodes present in the tree model. */\n  public *iterateTreeModelNodes(\n    parentId?: string\n  ): IterableIterator<MutableTreeModelNode> {\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    const _this = this;\n    function* iterateDescendants(\n      subParentId: string | undefined\n    ): IterableIterator<MutableTreeModelNode> {\n      const children = _this.getChildren(subParentId);\n      if (children === undefined) {\n        return;\n      }\n\n      for (const [nodeId] of children.iterateValues()) {\n        const node = _this.getNode(nodeId);\n        if (node !== undefined) {\n          yield node;\n          yield* iterateDescendants(nodeId);\n        }\n      }\n    }\n\n    yield* iterateDescendants(parentId);\n  }\n\n  private static setNumChildrenForNode(\n    node: TreeModelRootNode | MutableTreeModelNode,\n    children: SparseArray<string> | undefined\n  ) {\n    const numChildren = children ? children.getLength() : undefined;\n    if (node.numChildren === numChildren) return;\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n    (node.numChildren as number | undefined) = numChildren;\n  }\n\n  private static createTreeModelNode(\n    parentNode: TreeModelNode | TreeModelRootNode,\n    input: TreeModelNodeInput\n  ): MutableTreeModelNode {\n    return {\n      id: input.id,\n      parentId: parentNode.id,\n      depth: parentNode.depth + 1,\n\n      isLoading: input.isLoading,\n      numChildren: input.numChildren,\n\n      description: input.description || \"\",\n      isExpanded: input.isExpanded,\n      label: input.label,\n      isSelected: input.isSelected,\n      isSelectionDisabled: input.item.isSelectionDisabled,\n\n      checkbox: {\n        state: input.item.checkBoxState || CheckBoxState.Off,\n        isDisabled: !!input.item.isCheckboxDisabled,\n        isVisible: !!input.item.isCheckboxVisible,\n      },\n\n      item: cloneDeep(input.item),\n    };\n  }\n}\n\n/**\n * Generates flat list of visible nodes in the tree model.\n * @public\n */\nexport function computeVisibleNodes(model: TreeModel): VisibleTreeNodes {\n  const result = getVisibleDescendants(model, model.getRootNode());\n  return {\n    getNumNodes: () => result.length,\n    getAtIndex: (\n      index: number\n    ): TreeModelNode | TreeModelNodePlaceholder | undefined => {\n      return result[index];\n    },\n    getModel: () => model,\n    getNumRootNodes: () => model.getRootNode().numChildren,\n    [Symbol.iterator]: () => result[Symbol.iterator](),\n    getIndexOfNode: (nodeId: string): number => {\n      return result.findIndex(\n        (visibleNode) => (visibleNode as TreeModelNode).id === nodeId\n      );\n    },\n  };\n}\n\n/**\n * Traverses the tree and collects visible descendants.\n * @public\n */\nexport function getVisibleDescendants(\n  model: TreeModel,\n  parentNode: TreeModelNode | TreeModelRootNode,\n  result: Array<TreeModelNode | TreeModelNodePlaceholder> = []\n): Array<TreeModelNode | TreeModelNodePlaceholder> {\n  const children = model.getChildren(parentNode.id);\n  if (!children) {\n    return result;\n  }\n\n  let index = 0;\n  for (const childId of children) {\n    if (childId === undefined) {\n      result.push({\n        parentId: parentNode.id,\n        depth: parentNode.depth + 1,\n        childIndex: index,\n      });\n    } else {\n      const childNode = model.getNode(childId);\n      if (childNode === undefined) {\n        // node was disposed\n        result.push({\n          parentId: parentNode.id,\n          depth: parentNode.depth + 1,\n          childIndex: index,\n        });\n      } else {\n        result.push(childNode);\n        if (childNode.isExpanded && childNode.numChildren !== undefined) {\n          getVisibleDescendants(model, childNode, result);\n        }\n      }\n    }\n    ++index;\n  }\n\n  return result;\n}\n\nfunction cloneSubree(\n  source: TreeModel,\n  target: MutableTreeModel,\n  parentId: string | undefined\n): void {\n  target.setNumChildren(\n    parentId,\n    (parentId === undefined ? source.getRootNode() : source.getNode(parentId)!)\n      .numChildren\n  );\n  for (const [childId, index] of source\n    .getChildren(parentId)\n    ?.iterateValues() ?? []) {\n    const node = source.getNode(childId)!;\n    target.setChildren(\n      parentId,\n      [{ ...node, isLoading: !!node.isLoading }],\n      index\n    );\n    cloneSubree(source, target, childId);\n  }\n}\n"]}

package/lib/cjs/components-react/tree/controlled/TreeModelSource.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeModelSource.d.ts","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModelSource.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED;;;;GAIG;AACH,qBAAa,eAAe;IAKd,OAAO,CAAC,MAAM;IAH1B,8DAA8D;IACvD,cAAc,2CAAkD;gBAEnD,MAAM,GAAE,gBAAyC;IAGrE;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,gBAAgB,KAAK,IAAI,GAAG,IAAI;IAUrE,0BAA0B;IACnB,QAAQ,IAAI,SAAS;IAE5B,OAAO,CAAC,mBAAmB;CAiC5B"}
+{"version":3,"file":"TreeModelSource.d.ts","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModelSource.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED;;;;GAIG;AACH,qBAAa,eAAe;IAId,OAAO,CAAC,MAAM;IAH1B,8DAA8D;IACvD,cAAc,2CAAkD;gBAEnD,MAAM,GAAE,gBAAyC;IAErE;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,gBAAgB,KAAK,IAAI,GAAG,IAAI;IAoBrE,0BAA0B;IACnB,QAAQ,IAAI,SAAS;IAI5B,OAAO,CAAC,mBAAmB;CAyC5B"}

package/lib/cjs/components-react/tree/controlled/TreeModelSource.js

@@ -1,8 +1,8 @@
 "use strict";
 /*---------------------------------------------------------------------------------------------
-* 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.
+ *--------------------------------------------------------------------------------------------*/
 /** @packageDocumentation
  * @module Tree
  */
@@ -27,21 +27,31 @@ class TreeModelSource {
      * If changes to tree model is detected then onModelChanged event is emitted.
      */
     modifyModel(callback) {
-        let changes = { addedNodeIds: [], modifiedNodeIds: [], removedNodeIds: [] };
-        const newModel = (0, immer_1.produce)(this._model, (draft) => callback(draft), (patches) => { changes = this.collectModelChanges(patches); });
+        let changes = {
+            addedNodeIds: [],
+            modifiedNodeIds: [],
+            removedNodeIds: [],
+        };
+        const newModel = (0, immer_1.produce)(this._model, (draft) => callback(draft), (patches) => {
+            changes = this.collectModelChanges(patches);
+        });
         if (newModel !== this._model) {
             this._model = newModel;
             this.onModelChanged.emit([this._model, changes]);
         }
     }
     /** Returns tree model. */
-    getModel() { return this._model; }
+    getModel() {
+        return this._model;
+    }
     collectModelChanges(modelPatches) {
         const addedNodeIds = [];
         const modifiedNodeIds = new Set();
         const removedNodeIds = [];
         for (const patch of modelPatches) {
-            if (patch.path.length >= 3 && patch.path[0] === "_tree" && patch.path[1] === "_idToNode") {
+            if (patch.path.length >= 3 &&
+                patch.path[0] === "_tree" &&
+                patch.path[1] === "_idToNode") {
                 const nodeId = patch.path[2];
                 if (patch.path.length > 3) {
                     // Modification occured somewhere inside a node
@@ -62,7 +72,11 @@ class TreeModelSource {
                 }
             }
         }
-        return { addedNodeIds, modifiedNodeIds: [...modifiedNodeIds], removedNodeIds };
+        return {
+            addedNodeIds,
+            modifiedNodeIds: [...modifiedNodeIds],
+            removedNodeIds,
+        };
     }
 }
 exports.TreeModelSource = TreeModelSource;

package/lib/cjs/components-react/tree/controlled/TreeModelSource.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeModelSource.js","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModelSource.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,iCAAgC;AAChC,sDAAgD;AAEhD,2CAA+C;AAY/C;;;;GAIG;AACH,MAAa,eAAe;IAK1B,YAAoB,SAA2B,IAAI,4BAAgB,EAAE;QAAjD,WAAM,GAAN,MAAM,CAA2C;QAHrE,8DAA8D;QACvD,mBAAc,GAAG,IAAI,wBAAS,EAAiC,CAAC;IAGvE,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,QAA2C;QAC5D,IAAI,OAAO,GAAqB,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;QAC9F,MAAM,QAAQ,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAuB,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,OAAgB,EAAE,EAAE,GAAG,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5J,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE;YAC5B,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;YACvB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;SAClD;IACH,CAAC;IAED,0BAA0B;IACnB,QAAQ,KAAgB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE5C,mBAAmB,CAAC,YAAqB;QAC/C,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE;YAChC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,WAAW,EAAE;gBACxF,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC;gBAEvC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;oBACzB,+CAA+C;oBAC/C,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC5B,SAAS;iBACV;gBAED,oDAAoD;gBACpD,QAAQ,KAAK,CAAC,EAAE,EAAE;oBAChB,KAAK,KAAK;wBACR,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC1B,MAAM;oBAER,KAAK,QAAQ;wBACX,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC5B,MAAM;oBAER,KAAK,SAAS;wBACZ,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;wBAC5B,MAAM;iBACT;aACF;SACF;QAED,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,CAAC,GAAG,eAAe,CAAC,EAAE,cAAc,EAAE,CAAC;IACjF,CAAC;CACF;AA1DD,0CA0DC","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 type { Patch} from \"immer\";\nimport { produce } from \"immer\";\nimport { BeUiEvent } from \"@itwin/core-bentley\";\nimport type { TreeModel } from \"./TreeModel\";\nimport { MutableTreeModel } from \"./TreeModel\";\n\n/**\n * Data structure that describes changes which happened to the tree model\n * @public\n */\nexport interface TreeModelChanges {\n  addedNodeIds: string[];\n  modifiedNodeIds: string[];\n  removedNodeIds: string[];\n}\n\n/**\n * Controls tree model.\n * It is used to modify model and inform when tree model changes.\n * @public\n */\nexport class TreeModelSource {\n\n  /** Event that is emitted every time tree model is changed. */\n  public onModelChanged = new BeUiEvent<[TreeModel, TreeModelChanges]>();\n\n  constructor(private _model: MutableTreeModel = new MutableTreeModel()) {\n  }\n\n  /**\n   * Modifies tree model using provided callback.\n   * If changes to tree model is detected then onModelChanged event is emitted.\n   */\n  public modifyModel(callback: (model: MutableTreeModel) => void): void {\n    let changes: TreeModelChanges = { addedNodeIds: [], modifiedNodeIds: [], removedNodeIds: [] };\n    const newModel = produce(this._model, (draft: MutableTreeModel) => callback(draft), (patches: Patch[]) => { changes = this.collectModelChanges(patches); });\n\n    if (newModel !== this._model) {\n      this._model = newModel;\n      this.onModelChanged.emit([this._model, changes]);\n    }\n  }\n\n  /** Returns tree model. */\n  public getModel(): TreeModel { return this._model; }\n\n  private collectModelChanges(modelPatches: Patch[]): TreeModelChanges {\n    const addedNodeIds: string[] = [];\n    const modifiedNodeIds = new Set<string>();\n    const removedNodeIds: string[] = [];\n    for (const patch of modelPatches) {\n      if (patch.path.length >= 3 && patch.path[0] === \"_tree\" && patch.path[1] === \"_idToNode\") {\n        const nodeId = patch.path[2] as string;\n\n        if (patch.path.length > 3) {\n          // Modification occured somewhere inside a node\n          modifiedNodeIds.add(nodeId);\n          continue;\n        }\n\n        // Modification occured directly on _idToNode object\n        switch (patch.op) {\n          case \"add\":\n            addedNodeIds.push(nodeId);\n            break;\n\n          case \"remove\":\n            removedNodeIds.push(nodeId);\n            break;\n\n          case \"replace\":\n            modifiedNodeIds.add(nodeId);\n            break;\n        }\n      }\n    }\n\n    return { addedNodeIds, modifiedNodeIds: [...modifiedNodeIds], removedNodeIds };\n  }\n}\n"]}
+{"version":3,"file":"TreeModelSource.js","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModelSource.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG;;GAEG;;;AAGH,iCAAgC;AAChC,sDAAgD;AAEhD,2CAA+C;AAY/C;;;;GAIG;AACH,MAAa,eAAe;IAI1B,YAAoB,SAA2B,IAAI,4BAAgB,EAAE;QAAjD,WAAM,GAAN,MAAM,CAA2C;QAHrE,8DAA8D;QACvD,mBAAc,GAAG,IAAI,wBAAS,EAAiC,CAAC;IAEC,CAAC;IAEzE;;;OAGG;IACI,WAAW,CAAC,QAA2C;QAC5D,IAAI,OAAO,GAAqB;YAC9B,YAAY,EAAE,EAAE;YAChB,eAAe,EAAE,EAAE;YACnB,cAAc,EAAE,EAAE;SACnB,CAAC;QACF,MAAM,QAAQ,GAAG,IAAA,eAAO,EACtB,IAAI,CAAC,MAAM,EACX,CAAC,KAAuB,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,EAC5C,CAAC,OAAgB,EAAE,EAAE;YACnB,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAC9C,CAAC,CACF,CAAC;QAEF,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE;YAC5B,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;YACvB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;SAClD;IACH,CAAC;IAED,0BAA0B;IACnB,QAAQ;QACb,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAEO,mBAAmB,CAAC,YAAqB;QAC/C,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE;YAChC,IACE,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO;gBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,WAAW,EAC7B;gBACA,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC;gBAEvC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;oBACzB,+CAA+C;oBAC/C,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC5B,SAAS;iBACV;gBAED,oDAAoD;gBACpD,QAAQ,KAAK,CAAC,EAAE,EAAE;oBAChB,KAAK,KAAK;wBACR,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC1B,MAAM;oBAER,KAAK,QAAQ;wBACX,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC5B,MAAM;oBAER,KAAK,SAAS;wBACZ,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;wBAC5B,MAAM;iBACT;aACF;SACF;QAED,OAAO;YACL,YAAY;YACZ,eAAe,EAAE,CAAC,GAAG,eAAe,CAAC;YACrC,cAAc;SACf,CAAC;IACJ,CAAC;CACF;AA5ED,0CA4EC","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 type { Patch } from \"immer\";\nimport { produce } from \"immer\";\nimport { BeUiEvent } from \"@itwin/core-bentley\";\nimport type { TreeModel } from \"./TreeModel\";\nimport { MutableTreeModel } from \"./TreeModel\";\n\n/**\n * Data structure that describes changes which happened to the tree model\n * @public\n */\nexport interface TreeModelChanges {\n  addedNodeIds: string[];\n  modifiedNodeIds: string[];\n  removedNodeIds: string[];\n}\n\n/**\n * Controls tree model.\n * It is used to modify model and inform when tree model changes.\n * @public\n */\nexport class TreeModelSource {\n  /** Event that is emitted every time tree model is changed. */\n  public onModelChanged = new BeUiEvent<[TreeModel, TreeModelChanges]>();\n\n  constructor(private _model: MutableTreeModel = new MutableTreeModel()) {}\n\n  /**\n   * Modifies tree model using provided callback.\n   * If changes to tree model is detected then onModelChanged event is emitted.\n   */\n  public modifyModel(callback: (model: MutableTreeModel) => void): void {\n    let changes: TreeModelChanges = {\n      addedNodeIds: [],\n      modifiedNodeIds: [],\n      removedNodeIds: [],\n    };\n    const newModel = produce(\n      this._model,\n      (draft: MutableTreeModel) => callback(draft),\n      (patches: Patch[]) => {\n        changes = this.collectModelChanges(patches);\n      }\n    );\n\n    if (newModel !== this._model) {\n      this._model = newModel;\n      this.onModelChanged.emit([this._model, changes]);\n    }\n  }\n\n  /** Returns tree model. */\n  public getModel(): TreeModel {\n    return this._model;\n  }\n\n  private collectModelChanges(modelPatches: Patch[]): TreeModelChanges {\n    const addedNodeIds: string[] = [];\n    const modifiedNodeIds = new Set<string>();\n    const removedNodeIds: string[] = [];\n    for (const patch of modelPatches) {\n      if (\n        patch.path.length >= 3 &&\n        patch.path[0] === \"_tree\" &&\n        patch.path[1] === \"_idToNode\"\n      ) {\n        const nodeId = patch.path[2] as string;\n\n        if (patch.path.length > 3) {\n          // Modification occured somewhere inside a node\n          modifiedNodeIds.add(nodeId);\n          continue;\n        }\n\n        // Modification occured directly on _idToNode object\n        switch (patch.op) {\n          case \"add\":\n            addedNodeIds.push(nodeId);\n            break;\n\n          case \"remove\":\n            removedNodeIds.push(nodeId);\n            break;\n\n          case \"replace\":\n            modifiedNodeIds.add(nodeId);\n            break;\n        }\n      }\n    }\n\n    return {\n      addedNodeIds,\n      modifiedNodeIds: [...modifiedNodeIds],\n      removedNodeIds,\n    };\n  }\n}\n"]}

package/lib/cjs/components-react/tree/controlled/TreeNodeLoader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNodeLoader.d.ts","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeNodeLoader.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,KAAK,EAAE,UAAU,IAAI,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAc7E,OAAO,KAAK,EAEV,gBAAgB,EAAuB,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAGlF,OAAO,KAAK,EAAE,UAAU,EAAC,MAAM,cAAc,CAAC;AAE9C,OAAO,KAAK,EAAoB,aAAa,EAAsB,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE5H,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEzD;;;GAGG;AACH,MAAM,WAAW,kBAAkB;IACjC,WAAW,EAAE,YAAY,EAAE,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,aAAa,GAAG,iBAAiB,EAAE,UAAU,EAAE,MAAM,GAAG,UAAU,CAAC,kBAAkB,CAAC,CAAC;CAC3G;AAED;;;GAGG;AACH,MAAM,WAAW,2BAA2B,CAAC,aAAa,SAAS,gBAAgB,CAAE,SAAQ,eAAe;IAC1G,qDAAqD;IACrD,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC;CACtC;AAED;;;GAGG;AACH,8BAAsB,sBAAuB,YAAW,eAAe;IACrE,OAAO,CAAC,gBAAgB,CAAkB;IAC1C,OAAO,CAAC,cAAc,CAAmD;IAEzE,SAAS,aAAa,WAAW,EAAE,eAAe;IAIlD,IAAW,WAAW,oBAAoC;IAE1D,+CAA+C;IACxC,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,iBAAiB,EAAE,UAAU,EAAE,MAAM,GAAG,UAAU,CAAC,kBAAkB,CAAC;IAU9G;;;;;OAKG;IACH,SAAS,CAAC,WAAW,CAAC,eAAe,EAAE,mBAAmB,GAAG,IAAI;IAIjE,wFAAwF;IACxF,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,GAAG,iBAAiB,EAAE,UAAU,EAAE,MAAM,GAAG,UAAU,CAAC,mBAAmB,CAAC;CACxH;AAED;;;GAGG;AACH,8BAAsB,kCAAkC,CAAC,aAAa,SAAS,gBAAgB,CAAE,SAAQ,sBAAuB,YAAW,2BAA2B,CAAC,aAAa,CAAC;IACnL,OAAO,CAAC,aAAa,CAAgB;IAErC,SAAS,aAAa,WAAW,EAAE,eAAe,EAAE,YAAY,EAAE,aAAa;IAK/E,IAAW,YAAY,kBAAiC;CACzD;AAED;;;GAGG;AACH,qBAAa,cAAc,CAAC,aAAa,SAAS,gBAAgB,CAAE,SAAQ,kCAAkC,CAAC,aAAa,CAAC;IAC3H,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,eAAe,CAAqE;IAC5F,OAAO,CAAC,UAAU,CAAmD;gBAEzD,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,eAAe;IAKrE;;;OAGG;IACa,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,iBAAiB,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,UAAU,CAAC,kBAAkB,CAAC;IAwBzH,SAAS,CAAC,IAAI,IAAI,UAAU,CAAC,mBAAmB,CAAC;CAGlD;AAED;;;GAGG;AACH,qBAAa,mBAAmB,CAAC,aAAa,SAAS,gBAAgB,CAAE,SAAQ,kCAAkC,CAAC,aAAa,CAAC;IAChI,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,mBAAmB,CAAuE;IAClG,OAAO,CAAC,UAAU,CAA4C;gBAElD,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM;IAQvF,kDAAkD;IAClD,IAAW,QAAQ,IAAI,MAAM,CAA2B;IAExD;;;OAGG;IACa,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,iBAAiB,EAAE,UAAU,EAAE,MAAM,GAAG,UAAU,CAAC,kBAAkB,CAAC;IAwCvH,SAAS,CAAC,IAAI,IAAI,UAAU,CAAC,mBAAmB,CAAC;CAGlD;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,uDAAuD;IACvD,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,8BAA8B;IAC9B,cAAc,EAAE,uBAAuB,EAAE,CAAC;IAC1C,0CAA0C;IAC1C,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC,6BAA6B;IAC7B,IAAI,EAAE,gBAAgB,CAAC;IACvB,yCAAyC;IACzC,QAAQ,CAAC,EAAE,uBAAuB,EAAE,CAAC;IACrC,6CAA6C;IAC7C,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAgED,gBAAgB;AAChB,wBAAgB,yBAAyB,CAAC,WAAW,EAAE,eAAe,EAAE,eAAe,EAAE,mBAAmB,QAkB3G;AA4DD,UAAU,oBAAoB;IAC5B,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAChC,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;GAMG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,aAAa,CAAmB;gBAE5B,YAAY,EAAE,gBAAgB;IAInC,YAAY,CACjB,MAAM,EAAE,YAAY,GAAG,SAAS,EAChC,cAAc,EAAE,MAAM,EACtB,QAAQ,EAAE,MAAM,EAChB,kBAAkB,EAAE,OAAO,GAC1B,cAAc,CAAC,oBAAoB,CAAC;YAiCzB,QAAQ;IAiBtB,OAAO,CAAC,WAAW;CAMpB"}
+{"version":3,"file":"TreeNodeLoader.d.ts","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeNodeLoader.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,KAAK,EAAE,UAAU,IAAI,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAiB7E,OAAO,KAAK,EAEV,gBAAgB,EAEhB,YAAY,EACb,MAAM,qBAAqB,CAAC;AAO7B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE/C,OAAO,KAAK,EAEV,aAAa,EAEb,iBAAiB,EACjB,gBAAgB,EACjB,MAAM,aAAa,CAAC;AAErB,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEzD;;;GAGG;AACH,MAAM,WAAW,kBAAkB;IACjC,WAAW,EAAE,YAAY,EAAE,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B;;;;OAIG;IACH,QAAQ,CACN,QAAQ,EAAE,aAAa,GAAG,iBAAiB,EAC3C,UAAU,EAAE,MAAM,GACjB,UAAU,CAAC,kBAAkB,CAAC,CAAC;CACnC;AAED;;;GAGG;AACH,MAAM,WAAW,2BAA2B,CAC1C,aAAa,SAAS,gBAAgB,CACtC,SAAQ,eAAe;IACvB,qDAAqD;IACrD,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC;CACtC;AAED;;;GAGG;AACH,8BAAsB,sBAAuB,YAAW,eAAe;IACrE,OAAO,CAAC,gBAAgB,CAAkB;IAC1C,OAAO,CAAC,cAAc,CAAmD;IAEzE,SAAS,aAAa,WAAW,EAAE,eAAe;IAIlD,IAAW,WAAW,oBAErB;IAED,+CAA+C;IACxC,QAAQ,CACb,MAAM,EAAE,aAAa,GAAG,iBAAiB,EACzC,UAAU,EAAE,MAAM,GACjB,UAAU,CAAC,kBAAkB,CAAC;IAYjC;;;;;OAKG;IACH,SAAS,CAAC,WAAW,CAAC,eAAe,EAAE,mBAAmB,GAAG,IAAI;IAIjE,wFAAwF;IACxF,SAAS,CAAC,QAAQ,CAAC,IAAI,CACrB,MAAM,EAAE,aAAa,GAAG,iBAAiB,EACzC,UAAU,EAAE,MAAM,GACjB,UAAU,CAAC,mBAAmB,CAAC;CACnC;AAED;;;GAGG;AACH,8BAAsB,kCAAkC,CACpD,aAAa,SAAS,gBAAgB,CAExC,SAAQ,sBACR,YAAW,2BAA2B,CAAC,aAAa,CAAC;IAErD,OAAO,CAAC,aAAa,CAAgB;IAErC,SAAS,aACP,WAAW,EAAE,eAAe,EAC5B,YAAY,EAAE,aAAa;IAM7B,IAAW,YAAY,kBAEtB;CACF;AAED;;;GAGG;AACH,qBAAa,cAAc,CACzB,aAAa,SAAS,gBAAgB,CACtC,SAAQ,kCAAkC,CAAC,aAAa,CAAC;IACzD,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,eAAe,CAGnB;IACJ,OAAO,CAAC,UAAU,CAAmD;gBAEzD,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,eAAe;IAKrE;;;OAGG;IACa,QAAQ,CACtB,MAAM,EAAE,aAAa,GAAG,iBAAiB,EACzC,WAAW,CAAC,EAAE,MAAM,GACnB,UAAU,CAAC,kBAAkB,CAAC;IA+BjC,SAAS,CAAC,IAAI,IAAI,UAAU,CAAC,mBAAmB,CAAC;CAGlD;AAED;;;GAGG;AACH,qBAAa,mBAAmB,CAC9B,aAAa,SAAS,gBAAgB,CACtC,SAAQ,kCAAkC,CAAC,aAAa,CAAC;IACzD,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,mBAAmB,CAGzB;IACF,OAAO,CAAC,UAAU,CAA4C;gBAG5D,YAAY,EAAE,aAAa,EAC3B,WAAW,EAAE,eAAe,EAC5B,QAAQ,EAAE,MAAM;IASlB,kDAAkD;IAClD,IAAW,QAAQ,IAAI,MAAM,CAE5B;IAED;;;OAGG;IACa,QAAQ,CACtB,MAAM,EAAE,aAAa,GAAG,iBAAiB,EACzC,UAAU,EAAE,MAAM,GACjB,UAAU,CAAC,kBAAkB,CAAC;IA2CjC,SAAS,CAAC,IAAI,IAAI,UAAU,CAAC,mBAAmB,CAAC;CAGlD;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,uDAAuD;IACvD,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,8BAA8B;IAC9B,cAAc,EAAE,uBAAuB,EAAE,CAAC;IAC1C,0CAA0C;IAC1C,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC,6BAA6B;IAC7B,IAAI,EAAE,gBAAgB,CAAC;IACvB,yCAAyC;IACzC,QAAQ,CAAC,EAAE,uBAAuB,EAAE,CAAC;IACrC,6CAA6C;IAC7C,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AA4ED,gBAAgB;AAChB,wBAAgB,yBAAyB,CACvC,WAAW,EAAE,eAAe,EAC5B,eAAe,EAAE,mBAAmB,QA4BrC;AAyED,UAAU,oBAAoB;IAC5B,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAChC,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;GAMG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,aAAa,CAAmB;gBAE5B,YAAY,EAAE,gBAAgB;IAInC,YAAY,CACjB,MAAM,EAAE,YAAY,GAAG,SAAS,EAChC,cAAc,EAAE,MAAM,EACtB,QAAQ,EAAE,MAAM,EAChB,kBAAkB,EAAE,OAAO,GAC1B,cAAc,CAAC,oBAAoB,CAAC;YAkCzB,QAAQ;IAsBtB,OAAO,CAAC,WAAW;CAQpB"}

package/lib/cjs/components-react/tree/controlled/TreeNodeLoader.js

@@ -1,8 +1,8 @@
 "use strict";
 /*---------------------------------------------------------------------------------------------
-* 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.
+ *--------------------------------------------------------------------------------------------*/
 /** @packageDocumentation
  * @module Tree
  */
@@ -33,12 +33,16 @@ class AbstractTreeNodeLoader {
         this._loadScheduler = new SubscriptionScheduler_1.SubscriptionScheduler();
         this._treeModelSource = modelSource;
     }
-    get modelSource() { return this._treeModelSource; }
+    get modelSource() {
+        return this._treeModelSource;
+    }
     /** Do not override this method. @see `load` */
     loadNode(parent, childIndex) {
         return (0, Observable_1.toRxjsObservable)(this.load(parent, childIndex)).pipe((0, map_1.map)((loadedHierarchy) => {
             this.updateModel(loadedHierarchy);
-            return { loadedNodes: collectTreeNodeItems(loadedHierarchy.hierarchyItems) };
+            return {
+                loadedNodes: collectTreeNodeItems(loadedHierarchy.hierarchyItems),
+            };
         }), (0, SubscriptionScheduler_1.scheduleSubscription)(this._loadScheduler));
     }
     /**
@@ -61,7 +65,9 @@ class AbstractTreeNodeLoaderWithProvider extends AbstractTreeNodeLoader {
         super(modelSource);
         this._dataProvider = dataProvider;
     }
-    get dataProvider() { return this._dataProvider; }
+    get dataProvider() {
+        return this._dataProvider;
+    }
 }
 exports.AbstractTreeNodeLoaderWithProvider = AbstractTreeNodeLoaderWithProvider;
 /**
@@ -87,10 +93,11 @@ class TreeNodeLoader extends AbstractTreeNodeLoaderWithProvider {
             if (activeRequest) {
                 return activeRequest;
             }
-            const newRequest = requestLoadedHierarchy(parentItem, this._treeDataSource, 0, 0, parent.numChildren === undefined)
-                .pipe((0, map_1.map)((loadedHierarchy) => {
+            const newRequest = requestLoadedHierarchy(parentItem, this._treeDataSource, 0, 0, parent.numChildren === undefined).pipe((0, map_1.map)((loadedHierarchy) => {
                 this.updateModel(loadedHierarchy);
-                return { loadedNodes: collectTreeNodeItems(loadedHierarchy.hierarchyItems) };
+                return {
+                    loadedNodes: collectTreeNodeItems(loadedHierarchy.hierarchyItems),
+                };
             }), (0, SubscriptionScheduler_1.scheduleSubscription)(this._scheduler), (0, finalize_1.finalize)(() => this._activeRequests.delete(parentId)));
             this._activeRequests.set(parentId, newRequest);
             return newRequest;
@@ -115,7 +122,9 @@ class PagedTreeNodeLoader extends AbstractTreeNodeLoaderWithProvider {
         this._scheduler = new SubscriptionScheduler_1.SubscriptionScheduler();
     }
     /** Returns page size used by tree node loader. */
-    get pageSize() { return this._pageSize; }
+    get pageSize() {
+        return this._pageSize;
+    }
     /**
      * Schedules to load one page of node children and returns an Observable.
      * @note It does not start loading node page until '.subscribe()' is called on returned Observable.
@@ -134,7 +143,9 @@ class PagedTreeNodeLoader extends AbstractTreeNodeLoaderWithProvider {
             const startIndex = page * this._pageSize;
             const newRequest = requestLoadedHierarchy(parentItem, this._treeDataSource, startIndex, this._pageSize, parent.numChildren === undefined).pipe((0, map_1.map)((loadedHierarchy) => {
                 this.updateModel(loadedHierarchy);
-                return { loadedNodes: collectTreeNodeItems(loadedHierarchy.hierarchyItems) };
+                return {
+                    loadedNodes: collectTreeNodeItems(loadedHierarchy.hierarchyItems),
+                };
             }), (0, SubscriptionScheduler_1.scheduleSubscription)(this._scheduler), (0, finalize_1.finalize)(() => {
                 parentPageRequests.delete(page);
                 if (parentPageRequests.size === 0) {
@@ -154,9 +165,9 @@ class PagedTreeNodeLoader extends AbstractTreeNodeLoaderWithProvider {
 exports.PagedTreeNodeLoader = PagedTreeNodeLoader;
 function requestLoadedHierarchy(parentItem, dataSource, start, take, requestNumChildren) {
     const parentId = parentItem && parentItem.id;
-    return dataSource.requestItems(parentItem, start, take, requestNumChildren)
-        .pipe((0, concatMap_1.concatMap)(({ numChildren, loadedItems }) => loadHierarchy(loadedItems, dataSource, take)
-        .pipe((0, map_1.map)((hierarchyItems) => ({
+    return dataSource
+        .requestItems(parentItem, start, take, requestNumChildren)
+        .pipe((0, concatMap_1.concatMap)(({ numChildren, loadedItems }) => loadHierarchy(loadedItems, dataSource, take).pipe((0, map_1.map)((hierarchyItems) => ({
         parentId,
         offset: start,
         hierarchyItems,
@@ -164,20 +175,21 @@ function requestLoadedHierarchy(parentItem, dataSource, start, take, requestNumC
     })))));
 }
 function loadHierarchy(rootItems, dataSource, take) {
-    return (0, from_1.from)(rootItems)
-        .pipe((0, concatMap_1.concatMap)((item) => {
+    return (0, from_1.from)(rootItems).pipe((0, concatMap_1.concatMap)((item) => {
         if (!item.autoExpand || item.children) {
             return (0, of_1.of)(convertToLoadedNodeHierarchyItem(item));
         }
-        return dataSource.requestItems(item, 0, take, true)
-            .pipe((0, concatMap_1.concatMap)(({ numChildren, loadedItems }) => loadHierarchy(loadedItems, dataSource, take)
-            .pipe((0, map_1.map)((children) => ({ item, children, numChildren })))));
+        return dataSource
+            .requestItems(item, 0, take, true)
+            .pipe((0, concatMap_1.concatMap)(({ numChildren, loadedItems }) => loadHierarchy(loadedItems, dataSource, take).pipe((0, map_1.map)((children) => ({ item, children, numChildren })))));
     }), (0, toArray_1.toArray)());
 }
 function convertToLoadedNodeHierarchyItem(item) {
     return {
         item,
-        children: item.children ? item.children.map((child) => convertToLoadedNodeHierarchyItem(child)) : undefined,
+        children: item.children
+            ? item.children.map((child) => convertToLoadedNodeHierarchyItem(child))
+            : undefined,
         numChildren: item.children ? item.children.length : undefined,
     };
 }
@@ -202,7 +214,9 @@ function handleLoadedNodeHierarchy(modelSource, loadedHierarchy) {
         if (loadedHierarchy.parentId !== undefined) {
             const parentNode = model.getNode(loadedHierarchy.parentId);
             /* istanbul ignore else */
-            if (parentNode && parentNode.isLoading && parentNode.numChildren !== undefined) {
+            if (parentNode &&
+                parentNode.isLoading &&
+                parentNode.numChildren !== undefined) {
                 parentNode.isLoading = false;
             }
         }
@@ -224,7 +238,10 @@ function updateChildren(model, parentId, hierarchyItems, startIndex, numChildren
         const nodeInput = convertToTreeModelNodeInput(hierarchyItem.item);
         const existingNode = model.getNode(hierarchyItem.item.id);
         // if same item exists in the same position and is expanded update it without removing it's subtree
-        if (!existingNode || !existingNode.isExpanded || model.getChildOffset(parentId, existingNode.id) !== offset || nodeInput.numChildren === 0) {
+        if (!existingNode ||
+            !existingNode.isExpanded ||
+            model.getChildOffset(parentId, existingNode.id) !== offset ||
+            nodeInput.numChildren === 0) {
             model.setChildren(parentId, [nodeInput], offset);
         }
         else {
@@ -274,22 +291,23 @@ class TreeDataSource {
         return (0, defer_1.defer)(async () => {
             if ((0, TreeDataProvider_1.isTreeDataProviderInterface)(this._dataProvider)) {
                 const dataProvider = this._dataProvider;
-                return (0, from_1.from)(requestNumChildren ? dataProvider.getNodesCount(parent) : [undefined])
-                    .pipe((0, concatMap_1.concatMap)(async (numChildren) => {
-                    const pageOptions = numItems !== 0 ? { size: numItems, start: firstItemIndex } : undefined;
+                return (0, from_1.from)(requestNumChildren ? dataProvider.getNodesCount(parent) : [undefined]).pipe((0, concatMap_1.concatMap)(async (numChildren) => {
+                    const pageOptions = numItems !== 0
+                        ? { size: numItems, start: firstItemIndex }
+                        : undefined;
                     return {
                         loadedItems: await dataProvider.getNodes(parent, pageOptions),
                         numChildren,
                     };
                 }));
             }
-            return (0, from_1.from)(this.getItems(parent))
-                .pipe((0, map_1.map)((loadedItems) => ({
-                loadedItems: numItems !== 0 ? loadedItems.slice(firstItemIndex, firstItemIndex + numItems) : loadedItems,
+            return (0, from_1.from)(this.getItems(parent)).pipe((0, map_1.map)((loadedItems) => ({
+                loadedItems: numItems !== 0
+                    ? loadedItems.slice(firstItemIndex, firstItemIndex + numItems)
+                    : loadedItems,
                 numChildren: loadedItems.length,
             })));
-        })
-            .pipe((0, concatAll_1.concatAll)(), (0, publish_1.publish)(), (0, refCount_1.refCount)());
+        }).pipe((0, concatAll_1.concatAll)(), (0, publish_1.publish)(), (0, refCount_1.refCount)());
     }
     async getItems(parent) {
         if ((0, TreeDataProvider_1.isTreeDataProviderRaw)(this._dataProvider)) {