@itwin/components-react 4.17.1 → 5.0.0-dev.2

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

@@ -1,230 +0,0 @@
-/** @packageDocumentation
- * @module Tree
- */
-import { immerable } from "immer";
-import type { PropertyRecord } from "@itwin/appui-abstract";
-import type { DelayLoadedTreeNodeItem, ImmediatelyLoadedTreeNodeItem, TreeNodeItem } from "../TreeDataProvider";
-import type { SparseArray } from "./internal/SparseTree";
-import { CheckBoxState } from "../../common/CheckBoxState";
-/**
- * Immutable data structure that describes tree node.
- * @public
- */
-export interface TreeModelNode {
-    readonly id: string;
-    readonly parentId: string | undefined;
-    readonly depth: number;
-    readonly isLoading?: boolean;
-    readonly numChildren: number | undefined;
-    readonly description: string | undefined;
-    readonly isExpanded: boolean;
-    readonly label: PropertyRecord;
-    readonly isSelected: boolean;
-    readonly isSelectionDisabled?: boolean;
-    /** Specifies that node is in editing mode. It holds callbacks that are used by node editor. */
-    readonly editingInfo?: TreeModelNodeEditingInfo;
-    readonly checkbox: CheckBoxInfo;
-    readonly item: TreeNodeItem;
-}
-/**
- * Immutable data structure that describes checkbox info.
- * @public
- */
-export interface CheckBoxInfo {
-    readonly state: CheckBoxState;
-    readonly tooltip?: string;
-    readonly isDisabled: boolean;
-    readonly isVisible: boolean;
-}
-/**
- * Mutable data structure that describes tree node.
- * @public
- */
-export interface MutableTreeModelNode extends TreeModelNode {
-    isLoading: boolean;
-    description: string;
-    isExpanded: boolean;
-    label: PropertyRecord;
-    isSelected: boolean;
-    isSelectionDisabled?: boolean;
-    /** Specifies that node is in editing mode. It holds callbacks that are used by node editor. */
-    editingInfo?: TreeModelNodeEditingInfo;
-    checkbox: MutableCheckBoxInfo;
-    item: TreeNodeItem;
-}
-/**
- * Data structure that holds callbacks used for tree node editing.
- * @public
- */
-export interface TreeModelNodeEditingInfo {
-    onCommit: (node: TreeModelNode, newValue: string) => void;
-    onCancel: () => void;
-}
-/**
- * Mutable data structure that describes checkbox info.
- * @public
- */
-export interface MutableCheckBoxInfo extends CheckBoxInfo {
-    state: CheckBoxState;
-    tooltip?: string;
-    isDisabled: boolean;
-    isVisible: boolean;
-}
-/**
- * Data structure that describes tree node placeholder.
- * @public
- */
-export interface TreeModelNodePlaceholder {
-    readonly childIndex: number;
-    readonly depth: number;
-    readonly parentId?: string;
-}
-/**
- * Data structure that describes tree root node.
- * @public
- */
-export interface TreeModelRootNode {
-    readonly depth: -1;
-    readonly id: undefined;
-    readonly numChildren: number | undefined;
-}
-/**
- * Data structure that describes input used to create tree node.
- * @public
- */
-export interface TreeModelNodeInput {
-    readonly description?: string;
-    readonly isExpanded: boolean;
-    readonly id: string;
-    readonly item: TreeNodeItem;
-    readonly label: PropertyRecord;
-    readonly isLoading: boolean;
-    readonly numChildren?: number;
-    readonly isSelected: boolean;
-}
-/**
- * Type definition of all tree model nodes.
- * @public
- */
-export type TreeModelNodeType = TreeModelNode | TreeModelNodePlaceholder | TreeModelRootNode;
-/**
- * Checks if object is [[TreeModelNode]]
- * @public
- */
-export declare function isTreeModelNode(obj: TreeModelNodeType | undefined): obj is TreeModelNode;
-/**
- * Checks if object is [[TreeModelNodePlaceholder]]
- * @public
- */
-export declare function isTreeModelNodePlaceholder(obj: TreeModelNodeType | undefined): obj is TreeModelNodePlaceholder;
-/**
- * Checks if object is [[TreeModelRootNode]]
- * @public
- */
-export declare function isTreeModelRootNode(obj: TreeModelNodeType | undefined): obj is TreeModelRootNode;
-/**
- * Type definition of tree node item data.
- * @public
- */
-export type TreeNodeItemData = ImmediatelyLoadedTreeNodeItem & DelayLoadedTreeNodeItem;
-/**
- * Data structure that describes set of visible tree nodes as a flat list.
- * @public
- */
-export interface VisibleTreeNodes extends Iterable<TreeModelNode | TreeModelNodePlaceholder> {
-    getNumNodes(): number;
-    getAtIndex(index: number): TreeModelNode | TreeModelNodePlaceholder | undefined;
-    getModel(): TreeModel;
-    getNumRootNodes(): number | undefined;
-    getIndexOfNode(nodeId: string): number;
-}
-/**
- * Data structure that describes tree model.
- * @public
- */
-export interface TreeModel {
-    getRootNode(): TreeModelRootNode;
-    getNode(id: string): TreeModelNode | undefined;
-    getNode(parentId: string | undefined, childIndex: number): TreeModelNode | TreeModelNodePlaceholder | undefined;
-    getNode(nodeId: string | undefined, childIndex?: number): TreeModelNode | TreeModelNodePlaceholder | TreeModelRootNode | undefined;
-    getChildren(parentId: string | undefined): SparseArray<string> | undefined;
-    getChildOffset(parentId: string | undefined, childId: string): number | undefined;
-    iterateTreeModelNodes(parentId?: string): IterableIterator<TreeModelNode>;
-}
-/**
- * Mutable tree model which holds nodes and allows adding or removing them.
- * @public
- */
-export declare class MutableTreeModel implements TreeModel {
-    [immerable]: boolean;
-    private _tree;
-    private _rootNode;
-    constructor(seed?: TreeModel);
-    /** Returns root node of a tree. This node is not visible and is there to allow having multiple visible root nodes. */
-    getRootNode(): TreeModelRootNode;
-    /** Returns tree node or placeholder for node that is not loaded yet.
-     * @returns node, node placeholder or undefined if node is not found in model.
-     */
-    getNode(id: string): MutableTreeModelNode | undefined;
-    getNode(parentId: string | undefined, childIndex: number): MutableTreeModelNode | TreeModelNodePlaceholder | undefined;
-    /** Returns children for specific parent.
-     * @param parentId id of parent node.
-     * @returns children of parent node or root nodes if undefined is passed as parent id.
-     */
-    getChildren(parentId: string | undefined): SparseArray<string> | undefined;
-    /** Returns children offset in children array for specific parent. */
-    getChildOffset(parentId: string | undefined, childId: string): number | undefined;
-    /**
-     * Sets children for parent node starting from the specific offset.
-     * If offset overlaps with already added nodes, the overlapping nodes are overwritten.
-     */
-    setChildren(parentId: string | undefined, nodeInputs: TreeModelNodeInput[], offset: number): void;
-    /**
-     * Inserts child in the specified position.
-     * If offset is higher then current length of children array, the length is increased.
-     */
-    insertChild(parentId: string | undefined, childNodeInput: TreeModelNodeInput, offset: number): void;
-    /**
-     * Changes the id of target node.
-     * @returns `true` on success, `false` otherwise.
-     */
-    changeNodeId(currentId: string, newId: string): boolean;
-    /**
-     * Transfers node along with its children to a new location. Fails if destination has undefined child count.
-     * @param sourceNodeId Node that is being moved.
-     * @param targetParentId Node that will receive a new child.
-     * @param targetIndex Insertion location among target's *current* children.
-     * @returns `true` on success, `false` otherwise.
-     */
-    moveNode(sourceNodeId: string, targetParentId: string | undefined, targetIndex: number): boolean;
-    private areNodesRelated;
-    /**
-     * Sets the number of child nodes a parent is expected to contain. All child nodes of this parent will be subsequently
-     * removed.
-     */
-    setNumChildren(parentId: string | undefined, numChildren: number | undefined): void;
-    /** Removes children specified by id.
-     * @param parentId id of the parent node.
-     * @param child child node id or index that should be removed.
-     */
-    removeChild(parentId: string | undefined, child: string | number): void;
-    /** Removes all children for parent specified by id.
-     * @param parentId id of parent node or undefined to remove root nodes.
-     */
-    clearChildren(parentId: string | undefined): void;
-    /** Iterates over all nodes present in the tree model. */
-    iterateTreeModelNodes(parentId?: string): IterableIterator<MutableTreeModelNode>;
-    private static setNumChildrenForNode;
-    private static createTreeModelNode;
-}
-/**
- * Generates flat list of visible nodes in the tree model.
- * @public
- */
-export declare function computeVisibleNodes(model: TreeModel): VisibleTreeNodes;
-/**
- * Traverses the tree and collects visible descendants.
- * @public
- */
-export declare function getVisibleDescendants(model: TreeModel, parentNode: TreeModelNode | TreeModelRootNode, result?: Array<TreeModelNode | TreeModelNodePlaceholder>): Array<TreeModelNode | TreeModelNodePlaceholder>;
-//# sourceMappingURL=TreeModel.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TreeModel.d.ts","sourceRoot":"","sources":["../../../../../src/components-react/tree/controlled/TreeModel.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAGlC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EACV,uBAAuB,EACvB,6BAA6B,EAC7B,YAAY,EACb,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAE3D;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAEvB,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IAEzC,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;IAC/B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAEvC,+FAA+F;IAC/F,QAAQ,CAAC,WAAW,CAAC,EAAE,wBAAwB,CAAC;IAEhD,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAEhC,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;IAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAqB,SAAQ,aAAa;IACzD,SAAS,EAAE,OAAO,CAAC;IAEnB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,OAAO,CAAC;IACpB,KAAK,EAAE,cAAc,CAAC;IACtB,UAAU,EAAE,OAAO,CAAC;IACpB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAE9B,+FAA+F;IAC/F,WAAW,CAAC,EAAE,wBAAwB,CAAC;IAEvC,QAAQ,EAAE,mBAAmB,CAAC;IAE9B,IAAI,EAAE,YAAY,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,QAAQ,EAAE,CAAC,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;IAC1D,QAAQ,EAAE,MAAM,IAAI,CAAC;CACtB;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAoB,SAAQ,YAAY;IACvD,KAAK,EAAE,aAAa,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,OAAO,CAAC;IACpB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACnB,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;CAC1C;AAED;;;GAGG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;CAC9B;AAED;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GACzB,aAAa,GACb,wBAAwB,GACxB,iBAAiB,CAAC;AAEtB;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,iBAAiB,GAAG,SAAS,GACjC,GAAG,IAAI,aAAa,CAMtB;AAED;;;GAGG;AACH,wBAAgB,0BAA0B,CACxC,GAAG,EAAE,iBAAiB,GAAG,SAAS,GACjC,GAAG,IAAI,wBAAwB,CAEjC;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,iBAAiB,GAAG,SAAS,GACjC,GAAG,IAAI,iBAAiB,CAM1B;AAED;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG,6BAA6B,GAC1D,uBAAuB,CAAC;AAE1B;;;GAGG;AACH,MAAM,WAAW,gBACf,SAAQ,QAAQ,CAAC,aAAa,GAAG,wBAAwB,CAAC;IAC1D,WAAW,IAAI,MAAM,CAAC;IACtB,UAAU,CACR,KAAK,EAAE,MAAM,GACZ,aAAa,GAAG,wBAAwB,GAAG,SAAS,CAAC;IACxD,QAAQ,IAAI,SAAS,CAAC;IACtB,eAAe,IAAI,MAAM,GAAG,SAAS,CAAC;IACtC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;CACxC;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACxB,WAAW,IAAI,iBAAiB,CAAC;IAEjC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,CAAC;IAC/C,OAAO,CACL,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,UAAU,EAAE,MAAM,GACjB,aAAa,GAAG,wBAAwB,GAAG,SAAS,CAAC;IACxD,OAAO,CACL,MAAM,EAAE,MAAM,GAAG,SAAS,EAC1B,UAAU,CAAC,EAAE,MAAM,GAClB,aAAa,GAAG,wBAAwB,GAAG,iBAAiB,GAAG,SAAS,CAAC;IAE5E,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IAC3E,cAAc,CACZ,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,SAAS,CAAC;IAEtB,qBAAqB,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAC;CAC3E;AAED;;;GAGG;AACH,qBAAa,gBAAiB,YAAW,SAAS;IACzC,CAAC,SAAS,CAAC,UAAQ;IAE1B,OAAO,CAAC,KAAK,CAA0C;IACvD,OAAO,CAAC,SAAS,CAIf;gBAEiB,IAAI,CAAC,EAAE,SAAS;IAQnC,sHAAsH;IAC/G,WAAW,IAAI,iBAAiB;IAIvC;;OAEG;IACI,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS;IACrD,OAAO,CACZ,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,UAAU,EAAE,MAAM,GACjB,oBAAoB,GAAG,wBAAwB,GAAG,SAAS;IA6B9D;;;OAGG;IACI,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,GAC3B,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS;IAIlC,qEAAqE;IAC9D,cAAc,CACnB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,SAAS;IAIrB;;;OAGG;IACI,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,UAAU,EAAE,kBAAkB,EAAE,EAChC,MAAM,EAAE,MAAM,GACb,IAAI;IAkBP;;;OAGG;IACI,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,cAAc,EAAE,kBAAkB,EAClC,MAAM,EAAE,MAAM,GACb,IAAI;IAiBP;;;OAGG;IACI,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IA2B9D;;;;;;OAMG;IACI,QAAQ,CACb,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,WAAW,EAAE,MAAM,GAClB,OAAO;IA4DV,OAAO,CAAC,eAAe;IAcvB;;;OAGG;IACI,cAAc,CACnB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,WAAW,EAAE,MAAM,GAAG,SAAS,GAC9B,IAAI;IAYP;;;OAGG;IACI,WAAW,CAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,IAAI;IAYP;;OAEG;IACI,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS;IAUjD,yDAAyD;IACjD,qBAAqB,CAC3B,QAAQ,CAAC,EAAE,MAAM,GAChB,gBAAgB,CAAC,oBAAoB,CAAC;IAuBzC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAWpC,OAAO,CAAC,MAAM,CAAC,mBAAmB;CA2BnC;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,gBAAgB,CAkBtE;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,EAChB,UAAU,EAAE,aAAa,GAAG,iBAAiB,EAC7C,MAAM,GAAE,KAAK,CAAC,aAAa,GAAG,wBAAwB,CAAM,GAC3D,KAAK,CAAC,aAAa,GAAG,wBAAwB,CAAC,CAkCjD"}

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

@@ -1,357 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Tree
- */
-var _a;
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getVisibleDescendants = exports.computeVisibleNodes = exports.MutableTreeModel = exports.isTreeModelRootNode = exports.isTreeModelNodePlaceholder = exports.isTreeModelNode = void 0;
-const immer_1 = require("immer");
-const lodash_1 = require("lodash");
-const core_bentley_1 = require("@itwin/core-bentley");
-const SparseTree_1 = require("./internal/SparseTree");
-const CheckBoxState_1 = require("../../common/CheckBoxState");
-/**
- * Checks if object is [[TreeModelNode]]
- * @public
- */
-function isTreeModelNode(obj) {
-    return (obj !== undefined &&
-        !isTreeModelNodePlaceholder(obj) &&
-        !isTreeModelRootNode(obj));
-}
-exports.isTreeModelNode = isTreeModelNode;
-/**
- * Checks if object is [[TreeModelNodePlaceholder]]
- * @public
- */
-function isTreeModelNodePlaceholder(obj) {
-    return obj !== undefined && "childIndex" in obj;
-}
-exports.isTreeModelNodePlaceholder = isTreeModelNodePlaceholder;
-/**
- * Checks if object is [[TreeModelRootNode]]
- * @public
- */
-function isTreeModelRootNode(obj) {
-    return (obj !== undefined &&
-        obj.id === undefined &&
-        !("childIndex" in obj));
-}
-exports.isTreeModelRootNode = isTreeModelRootNode;
-/**
- * Mutable tree model which holds nodes and allows adding or removing them.
- * @public
- */
-class MutableTreeModel {
-    constructor(seed) {
-        this[_a] = true;
-        this._tree = new SparseTree_1.SparseTree();
-        this._rootNode = {
-            depth: -1,
-            id: undefined,
-            numChildren: undefined,
-        };
-        if (!seed) {
-            return;
-        }
-        cloneSubree(seed, this, undefined);
-    }
-    /** Returns root node of a tree. This node is not visible and is there to allow having multiple visible root nodes. */
-    getRootNode() {
-        return this._rootNode;
-    }
-    getNode(nodeId, childIndex) {
-        if (childIndex === undefined) {
-            return this._tree.getNode(nodeId);
-        }
-        const children = this._tree.getChildren(nodeId);
-        const childId = children !== undefined ? children.get(childIndex) : undefined;
-        if (childId !== undefined) {
-            return this._tree.getNode(childId);
-        }
-        const parentNode = nodeId === undefined ? this._rootNode : this._tree.getNode(nodeId);
-        if (parentNode !== undefined) {
-            return {
-                childIndex,
-                depth: parentNode.depth + 1,
-                parentId: nodeId,
-            };
-        }
-        return undefined;
-    }
-    /** Returns children for specific parent.
-     * @param parentId id of parent node.
-     * @returns children of parent node or root nodes if undefined is passed as parent id.
-     */
-    getChildren(parentId) {
-        return this._tree.getChildren(parentId);
-    }
-    /** Returns children offset in children array for specific parent. */
-    getChildOffset(parentId, childId) {
-        return this._tree.getChildOffset(parentId, childId);
-    }
-    /**
-     * Sets children for parent node starting from the specific offset.
-     * If offset overlaps with already added nodes, the overlapping nodes are overwritten.
-     */
-    setChildren(parentId, nodeInputs, offset) {
-        const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);
-        if (parentNode === undefined)
-            return;
-        const children = [];
-        for (const input of nodeInputs) {
-            const child = MutableTreeModel.createTreeModelNode(parentNode, input);
-            children.push(child);
-        }
-        this._tree.setChildren(parentNode.id, children, offset);
-        MutableTreeModel.setNumChildrenForNode(parentNode, this._tree.getChildren(parentNode.id));
-    }
-    /**
-     * Inserts child in the specified position.
-     * If offset is higher then current length of children array, the length is increased.
-     */
-    insertChild(parentId, childNodeInput, offset) {
-        const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);
-        if (parentNode === undefined)
-            return;
-        const child = MutableTreeModel.createTreeModelNode(parentNode, childNodeInput);
-        this._tree.insertChild(parentNode.id, child, offset);
-        MutableTreeModel.setNumChildrenForNode(parentNode, this._tree.getChildren(parentNode.id));
-    }
-    /**
-     * Changes the id of target node.
-     * @returns `true` on success, `false` otherwise.
-     */
-    changeNodeId(currentId, newId) {
-        const node = this.getNode(currentId);
-        if (node === undefined) {
-            return false;
-        }
-        if (currentId === newId) {
-            return true;
-        }
-        const index = this.getChildOffset(node.parentId, currentId);
-        (0, core_bentley_1.assert)(index !== undefined);
-        if (!this._tree.setNodeId(node.parentId, index, newId)) {
-            return false;
-        }
-        node.id = newId; // eslint-disable-line @typescript-eslint/no-unnecessary-type-assertion
-        for (const [childId] of this.getChildren(newId)?.iterateValues() ?? []) {
-            const child = this.getNode(childId);
-            (0, core_bentley_1.assert)(child !== undefined);
-            child.parentId = newId;
-        }
-        return true;
-    }
-    /**
-     * Transfers node along with its children to a new location. Fails if destination has undefined child count.
-     * @param sourceNodeId Node that is being moved.
-     * @param targetParentId Node that will receive a new child.
-     * @param targetIndex Insertion location among target's *current* children.
-     * @returns `true` on success, `false` otherwise.
-     */
-    moveNode(sourceNodeId, targetParentId, targetIndex) {
-        const sourceNode = this.getNode(sourceNodeId);
-        if (sourceNode === undefined) {
-            return false;
-        }
-        const targetParent = targetParentId === undefined
-            ? this._rootNode
-            : this.getNode(targetParentId);
-        if (targetParent === undefined || targetParent.numChildren === undefined) {
-            return false;
-        }
-        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);
-        (0, core_bentley_1.assert)(sourceParent !== undefined);
-        MutableTreeModel.setNumChildrenForNode(sourceParent, this._tree.getChildren(sourceNode.parentId));
-        MutableTreeModel.setNumChildrenForNode(targetParent, this._tree.getChildren(targetParentId));
-        // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion
-        sourceNode.parentId = targetParentId;
-        const updateDepths = (parentId, depth) => {
-            const node = this.getNode(parentId);
-            (0, core_bentley_1.assert)(node !== undefined);
-            // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion
-            node.depth = depth;
-            for (const [nodeId] of this.getChildren(parentId)?.iterateValues() ??
-                []) {
-                updateDepths(nodeId, depth + 1);
-            }
-        };
-        updateDepths(sourceNodeId, targetParent.depth + 1);
-        return true;
-    }
-    areNodesRelated(ancestorNodeId, descendantNodeId) {
-        const node = this.getNode(descendantNodeId);
-        if (node === undefined || node.parentId === undefined) {
-            return false;
-        }
-        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
-     * removed.
-     */
-    setNumChildren(parentId, numChildren) {
-        const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);
-        if (parentNode === undefined) {
-            return;
-        }
-        // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion
-        parentNode.numChildren = numChildren;
-        this._tree.setNumChildren(parentId, numChildren ?? 0);
-    }
-    /** Removes children specified by id.
-     * @param parentId id of the parent node.
-     * @param child child node id or index that should be removed.
-     */
-    removeChild(parentId, child) {
-        const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);
-        this._tree.removeChild(parentId, child);
-        if (parentNode)
-            MutableTreeModel.setNumChildrenForNode(parentNode, this._tree.getChildren(parentNode.id));
-    }
-    /** Removes all children for parent specified by id.
-     * @param parentId id of parent node or undefined to remove root nodes.
-     */
-    clearChildren(parentId) {
-        const parentNode = parentId === undefined ? this._rootNode : this._tree.getNode(parentId);
-        if (parentNode !== undefined) {
-            // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion
-            parentNode.numChildren = undefined;
-        }
-        this._tree.deleteSubtree(parentId, false);
-    }
-    /** Iterates over all nodes present in the tree model. */
-    *iterateTreeModelNodes(parentId) {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias
-        const _this = this;
-        function* iterateDescendants(subParentId) {
-            const children = _this.getChildren(subParentId);
-            if (children === undefined) {
-                return;
-            }
-            for (const [nodeId] of children.iterateValues()) {
-                const node = _this.getNode(nodeId);
-                if (node !== undefined) {
-                    yield node;
-                    yield* iterateDescendants(nodeId);
-                }
-            }
-        }
-        yield* iterateDescendants(parentId);
-    }
-    static setNumChildrenForNode(node, children) {
-        const numChildren = children ? children.getLength() : undefined;
-        if (node.numChildren === numChildren)
-            return;
-        // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion
-        node.numChildren = numChildren;
-    }
-    static createTreeModelNode(parentNode, input) {
-        return {
-            id: input.id,
-            parentId: parentNode.id,
-            depth: parentNode.depth + 1,
-            isLoading: input.isLoading,
-            numChildren: input.numChildren,
-            description: input.description || "",
-            isExpanded: input.isExpanded,
-            label: input.label,
-            isSelected: input.isSelected,
-            isSelectionDisabled: input.item.isSelectionDisabled,
-            checkbox: {
-                state: input.item.checkBoxState || CheckBoxState_1.CheckBoxState.Off,
-                isDisabled: !!input.item.isCheckboxDisabled,
-                isVisible: !!input.item.isCheckboxVisible,
-            },
-            item: (0, lodash_1.cloneDeep)(input.item),
-        };
-    }
-}
-exports.MutableTreeModel = MutableTreeModel;
-_a = immer_1.immerable;
-/**
- * Generates flat list of visible nodes in the tree model.
- * @public
- */
-function computeVisibleNodes(model) {
-    const result = getVisibleDescendants(model, model.getRootNode());
-    return {
-        getNumNodes: () => result.length,
-        getAtIndex: (index) => {
-            return result[index];
-        },
-        getModel: () => model,
-        getNumRootNodes: () => model.getRootNode().numChildren,
-        [Symbol.iterator]: () => result[Symbol.iterator](),
-        getIndexOfNode: (nodeId) => {
-            return result.findIndex((visibleNode) => visibleNode.id === nodeId);
-        },
-    };
-}
-exports.computeVisibleNodes = computeVisibleNodes;
-/**
- * Traverses the tree and collects visible descendants.
- * @public
- */
-function getVisibleDescendants(model, parentNode, result = []) {
-    const children = model.getChildren(parentNode.id);
-    if (!children) {
-        return result;
-    }
-    let index = 0;
-    for (const childId of children) {
-        if (childId === undefined) {
-            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,
-                });
-            }
-            else {
-                result.push(childNode);
-                if (childNode.isExpanded && childNode.numChildren !== undefined) {
-                    getVisibleDescendants(model, childNode, result);
-                }
-            }
-        }
-        ++index;
-    }
-    return result;
-}
-exports.getVisibleDescendants = getVisibleDescendants;
-function cloneSubree(source, target, parentId) {
-    target.setNumChildren(parentId, (parentId === undefined ? source.getRootNode() : source.getNode(parentId))
-        .numChildren);
-    for (const [childId, index] of source
-        .getChildren(parentId)
-        ?.iterateValues() ?? []) {
-        const node = source.getNode(childId);
-        target.setChildren(parentId, [{ ...node, isLoading: !!node.isLoading }], index);
-        cloneSubree(source, target, childId);
-    }
-}
-//# sourceMappingURL=TreeModel.js.map

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

@@ -1 +0,0 @@
-{"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;AAQ7C,sDAAmD;AACnD,8DAA2D;AA4H3D;;;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,CAAC;YACV,OAAO;QACT,CAAC;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,CAAC;YAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAO,CAAC,CAAC;QACrC,CAAC;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,CAAC;YAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrC,CAAC;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,CAAC;YAC7B,OAAO;gBACL,UAAU;gBACV,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;gBAC3B,QAAQ,EAAE,MAAM;aACjB,CAAC;QACJ,CAAC;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,CAAC;YAC/B,MAAM,KAAK,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACtE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;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,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;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,CAAC;YACvD,OAAO,KAAK,CAAC;QACf,CAAC;QAEA,IAAI,CAAC,EAAa,GAAG,KAAK,CAAC,CAAC,uEAAuE;QACpG,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YACvE,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;QACrC,CAAC;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,CAAC;YAC7B,OAAO,KAAK,CAAC;QACf,CAAC;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,CAAC;YACzE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IACE,cAAc,KAAK,SAAS;YAC5B,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,cAAc,CAAC,EAClD,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;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,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,aAAa,EAAE;gBAChE,EAAE,EAAE,CAAC;gBACL,YAAY,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAClC,CAAC;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,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,CAAC;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,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,4EAA4E;QAC3E,UAAU,CAAC,WAAkC,GAAG,WAAW,CAAC;QAC7D,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,EAAE,WAAW,IAAI,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,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,CAAC;YAC7B,4EAA4E;YAC3E,UAAU,CAAC,WAAkC,GAAG,SAAS,CAAC;QAC7D,CAAC;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,CAAC;gBAC3B,OAAO;YACT,CAAC;YAED,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC;gBAChD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,MAAM,IAAI,CAAC;oBACX,KAAK,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;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,6BAAa,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;AAvWD,4CAuWC;KAtWS,iBAAS;AAwWnB;;;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,CAAC;QACd,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,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;QACL,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,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;YACL,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACvB,IAAI,SAAS,CAAC,UAAU,IAAI,SAAS,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;oBAChE,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QACD,EAAE,KAAK,CAAC;IACV,CAAC;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,MAAM;SAClC,WAAW,CAAC,QAAQ,CAAC;QACtB,EAAE,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QAC1B,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;IACvC,CAAC;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 type {\n  DelayLoadedTreeNodeItem,\n  ImmediatelyLoadedTreeNodeItem,\n  TreeNodeItem,\n} from \"../TreeDataProvider\";\nimport type { SparseArray } from \"./internal/SparseTree\";\nimport { SparseTree } from \"./internal/SparseTree\";\nimport { CheckBoxState } from \"../../common/CheckBoxState\";\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    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"]}