@itwin/components-react 4.0.0-dev.12 → 4.0.0-dev.14

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

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

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

@@ -1,31 +1,31 @@
-/** @packageDocumentation
- * @module Tree
- */
-import { TreeNodeItem } from "../../TreeDataProvider";
-import { Observable } from "../Observable";
-import { CheckboxStateChange } from "../TreeEvents";
-import { TreeModelNode } from "../TreeModel";
-import { TreeModelSource } from "../TreeModelSource";
-import { ITreeNodeLoader, TreeNodeLoadResult } from "../TreeNodeLoader";
-/**
- * Provides basic tree manipulation implementation for various cases like
- * expand/collapse node, modify/replace/clear selection. It is used by default
- * tree event handler to modify model when events occur.
- * @internal
- */
-export declare class TreeModelMutator {
-    private _modelSource;
-    private _nodeLoader;
-    private _collapsedChildrenDisposalEnabled;
-    constructor(modelSource: TreeModelSource, nodeLoader: ITreeNodeLoader, collapsedChildrenDisposalEnabled: boolean);
-    get modelSource(): TreeModelSource;
-    expandNode(nodeId: string): Observable<TreeNodeLoadResult>;
-    collapseNode(nodeId: string): void;
-    modifySelection(nodesToSelect: TreeNodeItem[], nodesToDeselect: TreeNodeItem[]): void;
-    replaceSelection(nodesToSelect: TreeNodeItem[]): void;
-    clearNodeSelection(): void;
-    setCheckboxStates(stateChanges: CheckboxStateChange[]): void;
-    activateEditing(nodeId: string, onCommit: (node: TreeModelNode, newValue: string) => void): void;
-    private createNodeEditingInfo;
-}
+/** @packageDocumentation
+ * @module Tree
+ */
+import { TreeNodeItem } from "../../TreeDataProvider";
+import { Observable } from "../Observable";
+import { CheckboxStateChange } from "../TreeEvents";
+import { TreeModelNode } from "../TreeModel";
+import { TreeModelSource } from "../TreeModelSource";
+import { ITreeNodeLoader, TreeNodeLoadResult } from "../TreeNodeLoader";
+/**
+ * Provides basic tree manipulation implementation for various cases like
+ * expand/collapse node, modify/replace/clear selection. It is used by default
+ * tree event handler to modify model when events occur.
+ * @internal
+ */
+export declare class TreeModelMutator {
+    private _modelSource;
+    private _nodeLoader;
+    private _collapsedChildrenDisposalEnabled;
+    constructor(modelSource: TreeModelSource, nodeLoader: ITreeNodeLoader, collapsedChildrenDisposalEnabled: boolean);
+    get modelSource(): TreeModelSource;
+    expandNode(nodeId: string): Observable<TreeNodeLoadResult>;
+    collapseNode(nodeId: string): void;
+    modifySelection(nodesToSelect: TreeNodeItem[], nodesToDeselect: TreeNodeItem[]): void;
+    replaceSelection(nodesToSelect: TreeNodeItem[]): void;
+    clearNodeSelection(): void;
+    setCheckboxStates(stateChanges: CheckboxStateChange[]): void;
+    activateEditing(nodeId: string, onCommit: (node: TreeModelNode, newValue: string) => void): void;
+    private createNodeEditingInfo;
+}
 //# sourceMappingURL=TreeModelMutator.d.ts.map

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

@@ -1,123 +1,123 @@
-/*---------------------------------------------------------------------------------------------
-* 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
- */
-import { EMPTY } from "rxjs/internal/observable/empty";
-/**
- * Provides basic tree manipulation implementation for various cases like
- * expand/collapse node, modify/replace/clear selection. It is used by default
- * tree event handler to modify model when events occur.
- * @internal
- */
-export class TreeModelMutator {
-    constructor(modelSource, nodeLoader, collapsedChildrenDisposalEnabled) {
-        this._modelSource = modelSource;
-        this._nodeLoader = nodeLoader;
-        this._collapsedChildrenDisposalEnabled = collapsedChildrenDisposalEnabled;
-    }
-    get modelSource() { return this._modelSource; }
-    expandNode(nodeId) {
-        let needToLoadChildren = false;
-        this._modelSource.modifyModel((model) => {
-            const node = model.getNode(nodeId);
-            if (node === undefined || node.isExpanded) {
-                return;
-            }
-            needToLoadChildren = node.numChildren === undefined;
-            node.isExpanded = true;
-            if (needToLoadChildren) {
-                node.isLoading = true;
-            }
-        });
-        const expandedNode = this._modelSource.getModel().getNode(nodeId);
-        return needToLoadChildren && expandedNode ? this._nodeLoader.loadNode(expandedNode, 0) : EMPTY;
-    }
-    collapseNode(nodeId) {
-        this._modelSource.modifyModel((model) => {
-            const node = model.getNode(nodeId);
-            if (node === undefined || !node.isExpanded) {
-                return;
-            }
-            node.isExpanded = false;
-            if (this._collapsedChildrenDisposalEnabled) {
-                model.clearChildren(node.id);
-            }
-        });
-    }
-    modifySelection(nodesToSelect, nodesToDeselect) {
-        this._modelSource.modifyModel((model) => {
-            for (const nodeItem of nodesToSelect) {
-                const node = model.getNode(nodeItem.id);
-                if (node !== undefined) {
-                    node.isSelected = true;
-                }
-            }
-            for (const nodeItem of nodesToDeselect) {
-                const node = model.getNode(nodeItem.id);
-                if (node !== undefined) {
-                    node.isSelected = false;
-                }
-            }
-        });
-    }
-    replaceSelection(nodesToSelect) {
-        this._modelSource.modifyModel((model) => {
-            for (const node of model.iterateTreeModelNodes()) {
-                node.isSelected = false;
-            }
-            for (const nodeItem of nodesToSelect) {
-                const node = model.getNode(nodeItem.id);
-                if (node !== undefined) {
-                    node.isSelected = true;
-                }
-            }
-        });
-    }
-    clearNodeSelection() {
-        this._modelSource.modifyModel((model) => {
-            for (const node of model.iterateTreeModelNodes()) {
-                node.isSelected = false;
-            }
-        });
-    }
-    setCheckboxStates(stateChanges) {
-        this._modelSource.modifyModel((model) => {
-            for (const { nodeItem, newState } of stateChanges) {
-                const node = model.getNode(nodeItem.id);
-                if (node !== undefined) {
-                    node.checkbox.state = newState;
-                }
-            }
-        });
-    }
-    activateEditing(nodeId, onCommit) {
-        this._modelSource.modifyModel((model) => {
-            const node = model.getNode(nodeId);
-            if (!node)
-                return;
-            if (node.item.isEditable) {
-                node.editingInfo = this.createNodeEditingInfo(nodeId, onCommit);
-            }
-        });
-    }
-    createNodeEditingInfo(nodeId, onCommit) {
-        const closeEditing = () => {
-            this._modelSource.modifyModel((model) => {
-                const node = model.getNode(nodeId);
-                // istanbul ignore if
-                if (!node)
-                    return;
-                node.editingInfo = undefined;
-            });
-        };
-        const onEditCommitted = (node, newValue) => {
-            onCommit(node, newValue);
-            closeEditing();
-        };
-        return { onCommit: onEditCommitted, onCancel: closeEditing };
-    }
-}
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+import { EMPTY } from "rxjs/internal/observable/empty";
+/**
+ * Provides basic tree manipulation implementation for various cases like
+ * expand/collapse node, modify/replace/clear selection. It is used by default
+ * tree event handler to modify model when events occur.
+ * @internal
+ */
+export class TreeModelMutator {
+    constructor(modelSource, nodeLoader, collapsedChildrenDisposalEnabled) {
+        this._modelSource = modelSource;
+        this._nodeLoader = nodeLoader;
+        this._collapsedChildrenDisposalEnabled = collapsedChildrenDisposalEnabled;
+    }
+    get modelSource() { return this._modelSource; }
+    expandNode(nodeId) {
+        let needToLoadChildren = false;
+        this._modelSource.modifyModel((model) => {
+            const node = model.getNode(nodeId);
+            if (node === undefined || node.isExpanded) {
+                return;
+            }
+            needToLoadChildren = node.numChildren === undefined;
+            node.isExpanded = true;
+            if (needToLoadChildren) {
+                node.isLoading = true;
+            }
+        });
+        const expandedNode = this._modelSource.getModel().getNode(nodeId);
+        return needToLoadChildren && expandedNode ? this._nodeLoader.loadNode(expandedNode, 0) : EMPTY;
+    }
+    collapseNode(nodeId) {
+        this._modelSource.modifyModel((model) => {
+            const node = model.getNode(nodeId);
+            if (node === undefined || !node.isExpanded) {
+                return;
+            }
+            node.isExpanded = false;
+            if (this._collapsedChildrenDisposalEnabled) {
+                model.clearChildren(node.id);
+            }
+        });
+    }
+    modifySelection(nodesToSelect, nodesToDeselect) {
+        this._modelSource.modifyModel((model) => {
+            for (const nodeItem of nodesToSelect) {
+                const node = model.getNode(nodeItem.id);
+                if (node !== undefined) {
+                    node.isSelected = true;
+                }
+            }
+            for (const nodeItem of nodesToDeselect) {
+                const node = model.getNode(nodeItem.id);
+                if (node !== undefined) {
+                    node.isSelected = false;
+                }
+            }
+        });
+    }
+    replaceSelection(nodesToSelect) {
+        this._modelSource.modifyModel((model) => {
+            for (const node of model.iterateTreeModelNodes()) {
+                node.isSelected = false;
+            }
+            for (const nodeItem of nodesToSelect) {
+                const node = model.getNode(nodeItem.id);
+                if (node !== undefined) {
+                    node.isSelected = true;
+                }
+            }
+        });
+    }
+    clearNodeSelection() {
+        this._modelSource.modifyModel((model) => {
+            for (const node of model.iterateTreeModelNodes()) {
+                node.isSelected = false;
+            }
+        });
+    }
+    setCheckboxStates(stateChanges) {
+        this._modelSource.modifyModel((model) => {
+            for (const { nodeItem, newState } of stateChanges) {
+                const node = model.getNode(nodeItem.id);
+                if (node !== undefined) {
+                    node.checkbox.state = newState;
+                }
+            }
+        });
+    }
+    activateEditing(nodeId, onCommit) {
+        this._modelSource.modifyModel((model) => {
+            const node = model.getNode(nodeId);
+            if (!node)
+                return;
+            if (node.item.isEditable) {
+                node.editingInfo = this.createNodeEditingInfo(nodeId, onCommit);
+            }
+        });
+    }
+    createNodeEditingInfo(nodeId, onCommit) {
+        const closeEditing = () => {
+            this._modelSource.modifyModel((model) => {
+                const node = model.getNode(nodeId);
+                // istanbul ignore if
+                if (!node)
+                    return;
+                node.editingInfo = undefined;
+            });
+        };
+        const onEditCommitted = (node, newValue) => {
+            onCommit(node, newValue);
+            closeEditing();
+        };
+        return { onCommit: onEditCommitted, onCancel: closeEditing };
+    }
+}
 //# sourceMappingURL=TreeModelMutator.js.map

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

@@ -1,52 +1,52 @@
-/** @packageDocumentation
- * @module Tree
- */
-/// <reference types="react" />
-import { BeUiEvent } from "@itwin/core-bentley";
-import { SelectionMode } from "../../../common/selection/SelectionModes";
-import { Observable } from "../Observable";
-import { TreeActions } from "../TreeActions";
-import { VisibleTreeNodes } from "../TreeModel";
-/** @internal */
-export interface SelectionReplacementEvent {
-    selectedNodeIds: IndividualSelection | RangeSelection;
-}
-/** @internal */
-export interface SelectionModificationEvent {
-    selectedNodes: IndividualSelection | RangeSelection;
-    deselectedNodes: IndividualSelection;
-}
-/** @internal */
-export interface DragSelectionStartEvent {
-    selectionChanges: Observable<SelectionModificationEvent>;
-}
-/** @internal */
-export declare type IndividualSelection = string[];
-/** @internal */
-export interface RangeSelection {
-    from: string;
-    to: string;
-}
-/** @internal */
-export declare function isRangeSelection(selection: any): selection is RangeSelection;
-/** @internal */
-export declare class TreeSelectionManager implements Pick<TreeActions, "onNodeClicked" | "onNodeMouseDown" | "onNodeMouseMove"> {
-    private _selectionHandler;
-    private _dragSelectionOperation?;
-    private _itemHandlers;
-    private _getVisibleNodes;
-    onSelectionChanged: BeUiEvent<SelectionModificationEvent>;
-    onSelectionReplaced: BeUiEvent<SelectionReplacementEvent>;
-    onDragSelection: BeUiEvent<DragSelectionStartEvent>;
-    constructor(selectionMode: SelectionMode, getVisibleNodes?: () => VisibleTreeNodes);
-    private getVisibleNodeAtIndex;
-    setVisibleNodes(visibleNodes: (() => VisibleTreeNodes) | undefined): void;
-    onNodeClicked(nodeId: string, event: React.MouseEvent): void;
-    onNodeMouseDown(nodeId: string): void;
-    onNodeMouseMove(nodeId: string): void;
-    private createSelectionHandlers;
-    onTreeKeyDown(event: React.KeyboardEvent, actions: TreeActions): void;
-    onTreeKeyUp(event: React.KeyboardEvent, actions: TreeActions): void;
-    private _onKeyboardEvent;
-}
+/** @packageDocumentation
+ * @module Tree
+ */
+/// <reference types="react" />
+import { BeUiEvent } from "@itwin/core-bentley";
+import { SelectionMode } from "../../../common/selection/SelectionModes";
+import { Observable } from "../Observable";
+import { TreeActions } from "../TreeActions";
+import { VisibleTreeNodes } from "../TreeModel";
+/** @internal */
+export interface SelectionReplacementEvent {
+    selectedNodeIds: IndividualSelection | RangeSelection;
+}
+/** @internal */
+export interface SelectionModificationEvent {
+    selectedNodes: IndividualSelection | RangeSelection;
+    deselectedNodes: IndividualSelection;
+}
+/** @internal */
+export interface DragSelectionStartEvent {
+    selectionChanges: Observable<SelectionModificationEvent>;
+}
+/** @internal */
+export type IndividualSelection = string[];
+/** @internal */
+export interface RangeSelection {
+    from: string;
+    to: string;
+}
+/** @internal */
+export declare function isRangeSelection(selection: any): selection is RangeSelection;
+/** @internal */
+export declare class TreeSelectionManager implements Pick<TreeActions, "onNodeClicked" | "onNodeMouseDown" | "onNodeMouseMove"> {
+    private _selectionHandler;
+    private _dragSelectionOperation?;
+    private _itemHandlers;
+    private _getVisibleNodes;
+    onSelectionChanged: BeUiEvent<SelectionModificationEvent>;
+    onSelectionReplaced: BeUiEvent<SelectionReplacementEvent>;
+    onDragSelection: BeUiEvent<DragSelectionStartEvent>;
+    constructor(selectionMode: SelectionMode, getVisibleNodes?: () => VisibleTreeNodes);
+    private getVisibleNodeAtIndex;
+    setVisibleNodes(visibleNodes: (() => VisibleTreeNodes) | undefined): void;
+    onNodeClicked(nodeId: string, event: React.MouseEvent): void;
+    onNodeMouseDown(nodeId: string): void;
+    onNodeMouseMove(nodeId: string): void;
+    private createSelectionHandlers;
+    onTreeKeyDown(event: React.KeyboardEvent, actions: TreeActions): void;
+    onTreeKeyUp(event: React.KeyboardEvent, actions: TreeActions): void;
+    private _onKeyboardEvent;
+}
 //# sourceMappingURL=TreeSelectionManager.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"TreeSelectionManager.d.ts","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/TreeSelectionManager.ts"],"names":[],"mappings":"AAIA;;GAEG;;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,0CAA0C,CAAC;AACzE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAkC,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAGhF,gBAAgB;AAChB,MAAM,WAAW,yBAAyB;IACxC,eAAe,EAAE,mBAAmB,GAAG,cAAc,CAAC;CACvD;AAED,gBAAgB;AAChB,MAAM,WAAW,0BAA0B;IACzC,aAAa,EAAE,mBAAmB,GAAG,cAAc,CAAC;IACpD,eAAe,EAAE,mBAAmB,CAAC;CACtC;AAED,gBAAgB;AAChB,MAAM,WAAW,uBAAuB;IACtC,gBAAgB,EAAE,UAAU,CAAC,0BAA0B,CAAC,CAAC;CAC1D;AAED,gBAAgB;AAChB,oBAAY,mBAAmB,GAAG,MAAM,EAAE,CAAC;AAE3C,gBAAgB;AAChB,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,gBAAgB;AAChB,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,GAAG,GAAG,SAAS,IAAI,cAAc,CAE5E;AAED,gBAAgB;AAChB,qBAAa,oBAAqB,YAAW,IAAI,CAAC,WAAW,EAAE,eAAe,GAAG,iBAAiB,GAAG,iBAAiB,CAAC;IACrH,OAAO,CAAC,iBAAiB,CAA8B;IACvD,OAAO,CAAC,uBAAuB,CAAC,CAAsC;IACtE,OAAO,CAAC,aAAa,CAA+C;IAEpE,OAAO,CAAC,gBAAgB,CAAuC;IAExD,kBAAkB,wCAA+C;IACjE,mBAAmB,uCAA8C;IACjE,eAAe,qCAA4C;gBAGhE,aAAa,EAAE,aAAa,EAC5B,eAAe,CAAC,EAAE,MAAM,gBAAgB;IA8D1C,OAAO,CAAC,qBAAqB;IAKtB,eAAe,CAAC,YAAY,EAAE,CAAC,MAAM,gBAAgB,CAAC,GAAG,SAAS;IAIlE,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,UAAU;IAKrD,eAAe,CAAC,MAAM,EAAE,MAAM;IAuB9B,eAAe,CAAC,MAAM,EAAE,MAAM;IAIrC,OAAO,CAAC,uBAAuB;IAoCxB,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,aAAa,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI;IAIrE,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,aAAa,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI;IAI1E,OAAO,CAAC,gBAAgB,CAiFtB;CACH"}
+{"version":3,"file":"TreeSelectionManager.d.ts","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/TreeSelectionManager.ts"],"names":[],"mappings":"AAIA;;GAEG;;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,0CAA0C,CAAC;AACzE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAkC,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAGhF,gBAAgB;AAChB,MAAM,WAAW,yBAAyB;IACxC,eAAe,EAAE,mBAAmB,GAAG,cAAc,CAAC;CACvD;AAED,gBAAgB;AAChB,MAAM,WAAW,0BAA0B;IACzC,aAAa,EAAE,mBAAmB,GAAG,cAAc,CAAC;IACpD,eAAe,EAAE,mBAAmB,CAAC;CACtC;AAED,gBAAgB;AAChB,MAAM,WAAW,uBAAuB;IACtC,gBAAgB,EAAE,UAAU,CAAC,0BAA0B,CAAC,CAAC;CAC1D;AAED,gBAAgB;AAChB,MAAM,MAAM,mBAAmB,GAAG,MAAM,EAAE,CAAC;AAE3C,gBAAgB;AAChB,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,gBAAgB;AAChB,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,GAAG,GAAG,SAAS,IAAI,cAAc,CAE5E;AAED,gBAAgB;AAChB,qBAAa,oBAAqB,YAAW,IAAI,CAAC,WAAW,EAAE,eAAe,GAAG,iBAAiB,GAAG,iBAAiB,CAAC;IACrH,OAAO,CAAC,iBAAiB,CAA8B;IACvD,OAAO,CAAC,uBAAuB,CAAC,CAAsC;IACtE,OAAO,CAAC,aAAa,CAA+C;IAEpE,OAAO,CAAC,gBAAgB,CAAuC;IAExD,kBAAkB,wCAA+C;IACjE,mBAAmB,uCAA8C;IACjE,eAAe,qCAA4C;gBAGhE,aAAa,EAAE,aAAa,EAC5B,eAAe,CAAC,EAAE,MAAM,gBAAgB;IA8D1C,OAAO,CAAC,qBAAqB;IAKtB,eAAe,CAAC,YAAY,EAAE,CAAC,MAAM,gBAAgB,CAAC,GAAG,SAAS;IAIlE,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,UAAU;IAKrD,eAAe,CAAC,MAAM,EAAE,MAAM;IAuB9B,eAAe,CAAC,MAAM,EAAE,MAAM;IAIrC,OAAO,CAAC,uBAAuB;IAoCxB,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,aAAa,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI;IAIrE,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,aAAa,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI;IAI1E,OAAO,CAAC,gBAAgB,CAiFtB;CACH"}