@itwin/components-react 4.17.6 → 5.0.0-dev.3

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

@@ -1,242 +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
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SparseArray = exports.SparseTree = void 0;
-const immer_1 = require("immer");
-const core_bentley_1 = require("@itwin/core-bentley");
-/**
- * Structure for sparse tree storage.
- * It uses SparseArray to store children ids for parent. This allows
- * having tree structure with some nodes missing in the tree branch.
- * @internal
- */
-class SparseTree {
-    constructor() {
-        this._rootNodes = new SparseArray();
-        this._parentToChildren = {};
-        this._idToNode = {};
-        this[immer_1.immerable] = true;
-    }
-    getNode(nodeId) {
-        return this._idToNode[nodeId];
-    }
-    getChildOffset(parentId, childId) {
-        const children = this.getChildren(parentId);
-        if (!children)
-            return undefined;
-        return children.getIndex(childId);
-    }
-    getChildren(parentId, createIfNotExist = false) {
-        if (parentId === undefined) {
-            return this._rootNodes;
-        }
-        if (this._parentToChildren[parentId] === undefined && createIfNotExist) {
-            this._parentToChildren[parentId] = new SparseArray();
-        }
-        return this._parentToChildren[parentId];
-    }
-    setChildren(parentId, children, offset) {
-        const existingChildren = this.getChildren(parentId, true);
-        children.forEach((child, index) => {
-            const existingChildId = existingChildren.get(offset + index);
-            if (existingChildId !== undefined) {
-                this.deleteSubtree(existingChildId);
-            }
-            existingChildren.set(offset + index, child.id);
-            this._idToNode[child.id] = child;
-        });
-    }
-    insertChild(parentId, child, offset) {
-        const existingChildren = this.getChildren(parentId, true);
-        existingChildren.insert(offset, child.id);
-        this._idToNode[child.id] = child;
-    }
-    setNodeId(parentId, index, newId) {
-        const previousNodeId = this.getChildren(parentId)?.get(index);
-        if (previousNodeId === undefined) {
-            return false;
-        }
-        if (previousNodeId === newId) {
-            return true;
-        }
-        if (this.getNode(newId) !== undefined) {
-            return false;
-        }
-        this._idToNode[newId] = this._idToNode[previousNodeId];
-        delete this._idToNode[previousNodeId];
-        this._parentToChildren[newId] = this._parentToChildren[previousNodeId];
-        delete this._parentToChildren[previousNodeId];
-        if (parentId === undefined) {
-            this._rootNodes.set(index, newId);
-        }
-        else {
-            this._parentToChildren[parentId].set(index, newId);
-        }
-        return true;
-    }
-    moveNode(sourceParentId, sourceNodeId, targetParentId, targetIndex) {
-        const sourceNodeSiblings = this.getChildren(sourceParentId);
-        (0, core_bentley_1.assert)(sourceNodeSiblings !== undefined);
-        const sourceIndex = this.getChildOffset(sourceParentId, sourceNodeId);
-        (0, core_bentley_1.assert)(sourceIndex !== undefined);
-        sourceNodeSiblings.remove(sourceIndex);
-        if (targetParentId === sourceParentId && targetIndex > sourceIndex) {
-            targetIndex -= 1;
-        }
-        const targetNodeSiblings = this.getChildren(targetParentId, true);
-        (0, core_bentley_1.assert)(targetNodeSiblings !== undefined);
-        targetNodeSiblings.insert(targetIndex, sourceNodeId);
-    }
-    setNumChildren(parentId, numChildren) {
-        const children = this.getChildren(parentId, true);
-        for (const [childId] of children.iterateValues()) {
-            this.deleteSubtree(childId);
-        }
-        children.setLength(numChildren);
-    }
-    removeChild(parentId, child) {
-        const children = this.getChildren(parentId);
-        if (children === undefined)
-            return;
-        if (typeof child === "string") {
-            const childIndex = children.getIndex(child);
-            if (childIndex !== undefined) {
-                children.remove(childIndex);
-            }
-            this.deleteSubtree(child);
-        }
-        else {
-            const childId = children.get(child);
-            children.remove(child);
-            if (childId !== undefined) {
-                this.deleteSubtree(childId);
-            }
-        }
-    }
-    deleteSubtree(parentId, deleteParent = true) {
-        const children = this.getChildren(parentId);
-        if (children !== undefined) {
-            for (const [childId] of children.iterateValues()) {
-                this.deleteSubtree(childId);
-            }
-        }
-        if (parentId === undefined) {
-            this._rootNodes.setLength(0);
-            return;
-        }
-        if (deleteParent) {
-            delete this._idToNode[parentId];
-        }
-        delete this._parentToChildren[parentId];
-    }
-}
-exports.SparseTree = SparseTree;
-/**
- * Structure for sparse array value storage.
- * The main advantage of this class over the standard javascript array is that
- * this class does not need to check each index when iterating values that are
- * stored in the array.
- * @public
- */
-class SparseArray {
-    constructor() {
-        this._length = 0;
-        this._array = [];
-        this[immer_1.immerable] = true;
-    }
-    /** Returns length of array including intermediate 'undefined' values */
-    getLength() {
-        return this._length;
-    }
-    /** Sets length of array. */
-    setLength(length) {
-        const { index } = this.lowerBound(length);
-        this._array.length = index;
-        this._length = length;
-    }
-    /** Returns index of supplied value.
-     *
-     * @returns index of value or undefined if value is not found.
-     */
-    getIndex(lookupValue) {
-        for (const [value, index] of this._array) {
-            if (value === lookupValue)
-                return index;
-        }
-        return undefined;
-    }
-    /** Returns value at specific position.
-     *
-     * @returns stored value or undefined.
-     */
-    get(index) {
-        const { index: i, equal } = this.lowerBound(index);
-        return equal ? this._array[i][0] : undefined;
-    }
-    /** Sets value at specific position. Overrides any existing value. */
-    set(index, value) {
-        const { index: i, equal } = this.lowerBound(index);
-        this._array.splice(i, equal ? 1 : 0, [value, index]);
-        this._length = Math.max(this._length, index + 1);
-    }
-    /** Inserts value at specific position. Increases array length by one. */
-    insert(index, value) {
-        const { index: i } = this.lowerBound(index);
-        this._array.splice(i, 0, [value, index]);
-        for (let j = i + 1; j < this._array.length; j++) {
-            this._array[j][1]++;
-        }
-        this._length = Math.max(this._length + 1, index + 1);
-    }
-    /** Removes value at specified index and reduces array length by one. */
-    remove(index) {
-        if (index >= this._length) {
-            return;
-        }
-        const { index: i, equal } = this.lowerBound(index);
-        this._array.splice(i, equal ? 1 : 0);
-        for (let j = i; j < this._array.length; j++) {
-            this._array[j][1]--;
-        }
-        this._length = Math.max(0, this._length - 1);
-    }
-    /**
-     * Iterates values that are stored in the array
-     * @returns `[value, index]` tuples.
-     */
-    iterateValues() {
-        return this._array[Symbol.iterator]();
-    }
-    /** Iterates the array with all intermediate `undefined` values */
-    [Symbol.iterator]() {
-        const array = this._array;
-        const length = this._length;
-        return (function* () {
-            let currentIndex = 0;
-            for (const [value, index] of array) {
-                for (; currentIndex < index; ++currentIndex) {
-                    yield undefined;
-                }
-                yield value;
-                ++currentIndex;
-            }
-            for (; currentIndex < length; ++currentIndex) {
-                yield undefined;
-            }
-        })();
-    }
-    lowerBound(index) {
-        return (0, core_bentley_1.lowerBound)(index, this._array, SparseArray.compare);
-    }
-    static compare(index, value) {
-        return (0, core_bentley_1.compareNumbers)(index, value[1]);
-    }
-}
-exports.SparseArray = SparseArray;
-//# sourceMappingURL=SparseTree.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"SparseTree.js","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/SparseTree.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG;;GAEG;;;AAEH,iCAAkC;AAClC,sDAAyE;AAOzE;;;;;GAKG;AACH,MAAa,UAAU;IAOrB;QAJQ,eAAU,GAAG,IAAI,WAAW,EAAU,CAAC;QACvC,sBAAiB,GAAwC,EAAE,CAAC;QAC5D,cAAS,GAAsB,EAAE,CAAC;QAGxC,IAAI,CAAC,iBAAS,CAAC,GAAG,IAAI,CAAC;IACzB,CAAC;IAEM,OAAO,CAAC,MAAc;QAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAEM,cAAc,CACnB,QAA4B,EAC5B,OAAe;QAEf,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,OAAO,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,mBAA4B,KAAK;QAEjC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,UAAU,CAAC;QACzB,CAAC;QAED,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,SAAS,IAAI,gBAAgB,EAAE,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,IAAI,WAAW,EAAU,CAAC;QAC/D,CAAC;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,QAAa,EACb,MAAc;QAEd,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QAC3D,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAChC,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YAC7D,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;gBAClC,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;YACtC,CAAC;YAED,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,WAAW,CAAC,QAA4B,EAAE,KAAQ,EAAE,MAAc;QACvE,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAE,CAAC;QAC3D,gBAAgB,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IACnC,CAAC;IAEM,SAAS,CACd,QAA4B,EAC5B,KAAa,EACb,KAAa;QAEb,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,cAAc,KAAK,KAAK,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,SAAS,EAAE,CAAC;YACtC,OAAO,KAAK,CAAC;QACf,CAAC;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,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACrD,CAAC;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,IAAA,qBAAM,EAAC,kBAAkB,KAAK,SAAS,CAAC,CAAC;QAEzC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;QACtE,IAAA,qBAAM,EAAC,WAAW,KAAK,SAAS,CAAC,CAAC;QAElC,kBAAkB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,cAAc,KAAK,cAAc,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;YACnE,WAAW,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAClE,IAAA,qBAAM,EAAC,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,CAAC;YACjD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC9B,CAAC;QAED,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAClC,CAAC;IAEM,WAAW,CAChB,QAA4B,EAC5B,KAAsB;QAEtB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QAEnC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAEM,aAAa,CAClB,QAA4B,EAC5B,eAAwB,IAAI;QAE5B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO;QACT,CAAC;QACD,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;CACF;AA1KD,gCA0KC;AAED;;;;;;GAMG;AACH,MAAa,WAAW;IAMtB;QAHQ,YAAO,GAAG,CAAC,CAAC;QACZ,WAAM,GAAuB,EAAE,CAAC;QAGtC,IAAI,CAAC,iBAAS,CAAC,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,wEAAwE;IACjE,SAAS;QACd,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,4BAA4B;IACrB,SAAS,CAAC,MAAc;QAC7B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,WAAc;QAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACzC,IAAI,KAAK,KAAK,WAAW;gBAAE,OAAO,KAAK,CAAC;QAC1C,CAAC;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,CAAC;YAChD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtB,CAAC;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,CAAC;YAC1B,OAAO;QACT,CAAC;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,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtB,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACI,aAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,kEAAkE;IAC3D,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,OAAO,CAAC,QAAQ,CAAC;YACf,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;gBACnC,OAAO,YAAY,GAAG,KAAK,EAAE,EAAE,YAAY,EAAE,CAAC;oBAC5C,MAAM,SAAS,CAAC;gBAClB,CAAC;gBAED,MAAM,KAAK,CAAC;gBACZ,EAAE,YAAY,CAAC;YACjB,CAAC;YAED,OAAO,YAAY,GAAG,MAAM,EAAE,EAAE,YAAY,EAAE,CAAC;gBAC7C,MAAM,SAAS,CAAC;YAClB,CAAC;QACH,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;IAEO,UAAU,CAAC,KAAa;QAI9B,OAAO,IAAA,yBAAU,EAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC;IAEO,MAAM,CAAC,OAAO,CAAI,KAAa,EAAE,KAAkB;QACzD,OAAO,IAAA,6BAAc,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;CACF;AApHD,kCAoHC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Tree\n */\n\nimport { immerable } from \"immer\";\nimport { assert, compareNumbers, lowerBound } from \"@itwin/core-bentley\";\n\n/** @internal */\nexport interface Node {\n  readonly id: string;\n}\n\n/**\n * Structure for sparse tree storage.\n * It uses SparseArray to store children ids for parent. This allows\n * having tree structure with some nodes missing in the tree branch.\n * @internal\n */\nexport class SparseTree<T extends Node> {\n  public [immerable]: boolean;\n\n  private _rootNodes = new SparseArray<string>();\n  private _parentToChildren: Record<string, SparseArray<string>> = {};\n  private _idToNode: Record<string, T> = {};\n\n  constructor() {\n    this[immerable] = true;\n  }\n\n  public getNode(nodeId: string): T | undefined {\n    return this._idToNode[nodeId];\n  }\n\n  public getChildOffset(\n    parentId: string | undefined,\n    childId: string\n  ): number | undefined {\n    const children = this.getChildren(parentId);\n    if (!children) return undefined;\n\n    return children.getIndex(childId);\n  }\n\n  public getChildren(\n    parentId: string | undefined,\n    createIfNotExist: boolean = false\n  ): SparseArray<string> | undefined {\n    if (parentId === undefined) {\n      return this._rootNodes;\n    }\n\n    if (this._parentToChildren[parentId] === undefined && createIfNotExist) {\n      this._parentToChildren[parentId] = new SparseArray<string>();\n    }\n\n    return this._parentToChildren[parentId];\n  }\n\n  public setChildren(\n    parentId: string | undefined,\n    children: T[],\n    offset: number\n  ) {\n    const existingChildren = this.getChildren(parentId, true)!;\n    children.forEach((child, index) => {\n      const existingChildId = existingChildren.get(offset + index);\n      if (existingChildId !== undefined) {\n        this.deleteSubtree(existingChildId);\n      }\n\n      existingChildren.set(offset + index, child.id);\n      this._idToNode[child.id] = child;\n    });\n  }\n\n  public insertChild(parentId: string | undefined, child: T, offset: number) {\n    const existingChildren = this.getChildren(parentId, true)!;\n    existingChildren.insert(offset, child.id);\n    this._idToNode[child.id] = child;\n  }\n\n  public setNodeId(\n    parentId: string | undefined,\n    index: number,\n    newId: string\n  ): boolean {\n    const previousNodeId = this.getChildren(parentId)?.get(index);\n    if (previousNodeId === undefined) {\n      return false;\n    }\n\n    if (previousNodeId === newId) {\n      return true;\n    }\n\n    if (this.getNode(newId) !== undefined) {\n      return false;\n    }\n\n    this._idToNode[newId] = this._idToNode[previousNodeId];\n    delete this._idToNode[previousNodeId];\n\n    this._parentToChildren[newId] = this._parentToChildren[previousNodeId];\n    delete this._parentToChildren[previousNodeId];\n\n    if (parentId === undefined) {\n      this._rootNodes.set(index, newId);\n    } else {\n      this._parentToChildren[parentId].set(index, newId);\n    }\n\n    return true;\n  }\n\n  public moveNode(\n    sourceParentId: string | undefined,\n    sourceNodeId: string,\n    targetParentId: string | undefined,\n    targetIndex: number\n  ): void {\n    const sourceNodeSiblings = this.getChildren(sourceParentId);\n    assert(sourceNodeSiblings !== undefined);\n\n    const sourceIndex = this.getChildOffset(sourceParentId, sourceNodeId);\n    assert(sourceIndex !== undefined);\n\n    sourceNodeSiblings.remove(sourceIndex);\n    if (targetParentId === sourceParentId && targetIndex > sourceIndex) {\n      targetIndex -= 1;\n    }\n\n    const targetNodeSiblings = this.getChildren(targetParentId, true);\n    assert(targetNodeSiblings !== undefined);\n    targetNodeSiblings.insert(targetIndex, sourceNodeId);\n  }\n\n  public setNumChildren(parentId: string | undefined, numChildren: number) {\n    const children = this.getChildren(parentId, true)!;\n    for (const [childId] of children.iterateValues()) {\n      this.deleteSubtree(childId);\n    }\n\n    children.setLength(numChildren);\n  }\n\n  public removeChild(\n    parentId: string | undefined,\n    child: string | number\n  ): void {\n    const children = this.getChildren(parentId);\n    if (children === undefined) return;\n\n    if (typeof child === \"string\") {\n      const childIndex = children.getIndex(child);\n      if (childIndex !== undefined) {\n        children.remove(childIndex);\n      }\n\n      this.deleteSubtree(child);\n    } else {\n      const childId = children.get(child);\n      children.remove(child);\n      if (childId !== undefined) {\n        this.deleteSubtree(childId);\n      }\n    }\n  }\n\n  public deleteSubtree(\n    parentId: string | undefined,\n    deleteParent: boolean = true\n  ) {\n    const children = this.getChildren(parentId);\n    if (children !== undefined) {\n      for (const [childId] of children.iterateValues()) {\n        this.deleteSubtree(childId);\n      }\n    }\n\n    if (parentId === undefined) {\n      this._rootNodes.setLength(0);\n      return;\n    }\n    if (deleteParent) {\n      delete this._idToNode[parentId];\n    }\n    delete this._parentToChildren[parentId];\n  }\n}\n\n/**\n * Structure for sparse array value storage.\n * The main advantage of this class over the standard javascript array is that\n * this class does not need to check each index when iterating values that are\n * stored in the array.\n * @public\n */\nexport class SparseArray<T> implements Iterable<T | undefined> {\n  public [immerable]: boolean;\n\n  private _length = 0;\n  private _array: Array<[T, number]> = [];\n\n  constructor() {\n    this[immerable] = true;\n  }\n\n  /** Returns length of array including intermediate 'undefined' values */\n  public getLength(): number {\n    return this._length;\n  }\n\n  /** Sets length of array. */\n  public setLength(length: number) {\n    const { index } = this.lowerBound(length);\n    this._array.length = index;\n    this._length = length;\n  }\n\n  /** Returns index of supplied value.\n   *\n   * @returns index of value or undefined if value is not found.\n   */\n  public getIndex(lookupValue: T): number | undefined {\n    for (const [value, index] of this._array) {\n      if (value === lookupValue) return index;\n    }\n    return undefined;\n  }\n\n  /** Returns value at specific position.\n   *\n   * @returns stored value or undefined.\n   */\n  public get(index: number): T | undefined {\n    const { index: i, equal } = this.lowerBound(index);\n    return equal ? this._array[i][0] : undefined;\n  }\n\n  /** Sets value at specific position. Overrides any existing value. */\n  public set(index: number, value: T) {\n    const { index: i, equal } = this.lowerBound(index);\n    this._array.splice(i, equal ? 1 : 0, [value, index]);\n    this._length = Math.max(this._length, index + 1);\n  }\n\n  /** Inserts value at specific position. Increases array length by one. */\n  public insert(index: number, value: T) {\n    const { index: i } = this.lowerBound(index);\n    this._array.splice(i, 0, [value, index]);\n\n    for (let j = i + 1; j < this._array.length; j++) {\n      this._array[j][1]++;\n    }\n\n    this._length = Math.max(this._length + 1, index + 1);\n  }\n\n  /** Removes value at specified index and reduces array length by one. */\n  public remove(index: number): void {\n    if (index >= this._length) {\n      return;\n    }\n\n    const { index: i, equal } = this.lowerBound(index);\n    this._array.splice(i, equal ? 1 : 0);\n\n    for (let j = i; j < this._array.length; j++) {\n      this._array[j][1]--;\n    }\n\n    this._length = Math.max(0, this._length - 1);\n  }\n\n  /**\n   * Iterates values that are stored in the array\n   * @returns `[value, index]` tuples.\n   */\n  public iterateValues(): IterableIterator<[T, number]> {\n    return this._array[Symbol.iterator]();\n  }\n\n  /** Iterates the array with all intermediate `undefined` values */\n  public [Symbol.iterator](): IterableIterator<T | undefined> {\n    const array = this._array;\n    const length = this._length;\n    return (function* () {\n      let currentIndex = 0;\n      for (const [value, index] of array) {\n        for (; currentIndex < index; ++currentIndex) {\n          yield undefined;\n        }\n\n        yield value;\n        ++currentIndex;\n      }\n\n      for (; currentIndex < length; ++currentIndex) {\n        yield undefined;\n      }\n    })();\n  }\n\n  private lowerBound(index: number): {\n    index: number;\n    equal: boolean;\n  } {\n    return lowerBound(index, this._array, SparseArray.compare);\n  }\n\n  private static compare<T>(index: number, value: [T, number]): number {\n    return compareNumbers(index, value[1]);\n  }\n}\n"]}

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

@@ -1,31 +0,0 @@
-/** @packageDocumentation
- * @module Tree
- */
-import type { TreeNodeItem } from "../../TreeDataProvider";
-import type { Observable } from "../Observable";
-import type { CheckboxStateChange } from "../TreeEvents";
-import type { TreeModelNode } from "../TreeModel";
-import type { TreeModelSource } from "../TreeModelSource";
-import type { 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/cjs/components-react/tree/controlled/internal/TreeModelMutator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeModelMutator.d.ts","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/TreeModelMutator.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,KAAK,EAAE,aAAa,EAA4B,MAAM,cAAc,CAAC;AAC5E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAC1D,OAAO,KAAK,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAE7E;;;;;GAKG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,YAAY,CAAkB;IACtC,OAAO,CAAC,WAAW,CAAkB;IACrC,OAAO,CAAC,iCAAiC,CAAU;gBAGjD,WAAW,EAAE,eAAe,EAC5B,UAAU,EAAE,eAAe,EAC3B,gCAAgC,EAAE,OAAO;IAO3C,IAAW,WAAW,oBAErB;IAEM,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,CAAC,kBAAkB,CAAC;IAsB1D,YAAY,CAAC,MAAM,EAAE,MAAM;IAc3B,eAAe,CACpB,aAAa,EAAE,YAAY,EAAE,EAC7B,eAAe,EAAE,YAAY,EAAE;IAmB1B,gBAAgB,CAAC,aAAa,EAAE,YAAY,EAAE;IAe9C,kBAAkB;IAQlB,iBAAiB,CAAC,YAAY,EAAE,mBAAmB,EAAE;IAWrD,eAAe,CACpB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,KAAK,IAAI;IAY3D,OAAO,CAAC,qBAAqB;CAmB9B"}

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

@@ -1,130 +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
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TreeModelMutator = void 0;
-const rxjs_1 = require("rxjs");
-/**
- * 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
- */
-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)
-            : rxjs_1.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);
-                if (!node)
-                    return;
-                node.editingInfo = undefined;
-            });
-        };
-        const onEditCommitted = (node, newValue) => {
-            onCommit(node, newValue);
-            closeEditing();
-        };
-        return { onCommit: onEditCommitted, onCancel: closeEditing };
-    }
-}
-exports.TreeModelMutator = TreeModelMutator;
-//# sourceMappingURL=TreeModelMutator.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TreeModelMutator.js","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/TreeModelMutator.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG;;GAEG;;;AAEH,+BAA6B;AAQ7B;;;;;GAKG;AACH,MAAa,gBAAgB;IAK3B,YACE,WAA4B,EAC5B,UAA2B,EAC3B,gCAAyC;QAEzC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,iCAAiC,GAAG,gCAAgC,CAAC;IAC5E,CAAC;IAED,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAEM,UAAU,CAAC,MAAc;QAC9B,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAC/B,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC1C,OAAO;YACT,CAAC;YAED,kBAAkB,GAAG,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC;YAEpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,kBAAkB,EAAE,CAAC;gBACvB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACxB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClE,OAAO,kBAAkB,IAAI,YAAY;YACvC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC;YAC5C,CAAC,CAAC,YAAK,CAAC;IACZ,CAAC;IAEM,YAAY,CAAC,MAAc;QAChC,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC3C,OAAO;YACT,CAAC;YAED,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YACxB,IAAI,IAAI,CAAC,iCAAiC,EAAE,CAAC;gBAC3C,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,eAAe,CACpB,aAA6B,EAC7B,eAA+B;QAE/B,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACzB,CAAC;YACH,CAAC;YAED,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,gBAAgB,CAAC,aAA6B;QACnD,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,qBAAqB,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YAC1B,CAAC;YAED,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,kBAAkB;QACvB,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,qBAAqB,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,iBAAiB,CAAC,YAAmC;QAC1D,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,KAAK,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,YAAY,EAAE,CAAC;gBAClD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,eAAe,CACpB,MAAc,EACd,QAAyD;QAEzD,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;gBACzB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,qBAAqB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAClE,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,qBAAqB,CAC3B,MAAc,EACd,QAAyD;QAEzD,MAAM,YAAY,GAAG,GAAG,EAAE;YACxB,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE;gBACtC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI;oBAAE,OAAO;gBAClB,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,eAAe,GAAG,CAAC,IAAmB,EAAE,QAAgB,EAAE,EAAE;YAChE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACzB,YAAY,EAAE,CAAC;QACjB,CAAC,CAAC;QAEF,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;IAC/D,CAAC;CACF;AA/ID,4CA+IC","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 { EMPTY } from \"rxjs\";\nimport type { TreeNodeItem } from \"../../TreeDataProvider\";\nimport type { Observable } from \"../Observable\";\nimport type { CheckboxStateChange } from \"../TreeEvents\";\nimport type { TreeModelNode, TreeModelNodeEditingInfo } from \"../TreeModel\";\nimport type { TreeModelSource } from \"../TreeModelSource\";\nimport type { ITreeNodeLoader, TreeNodeLoadResult } from \"../TreeNodeLoader\";\n\n/**\n * Provides basic tree manipulation implementation for various cases like\n * expand/collapse node, modify/replace/clear selection. It is used by default\n * tree event handler to modify model when events occur.\n * @internal\n */\nexport class TreeModelMutator {\n  private _modelSource: TreeModelSource;\n  private _nodeLoader: ITreeNodeLoader;\n  private _collapsedChildrenDisposalEnabled: boolean;\n\n  constructor(\n    modelSource: TreeModelSource,\n    nodeLoader: ITreeNodeLoader,\n    collapsedChildrenDisposalEnabled: boolean\n  ) {\n    this._modelSource = modelSource;\n    this._nodeLoader = nodeLoader;\n    this._collapsedChildrenDisposalEnabled = collapsedChildrenDisposalEnabled;\n  }\n\n  public get modelSource() {\n    return this._modelSource;\n  }\n\n  public expandNode(nodeId: string): Observable<TreeNodeLoadResult> {\n    let needToLoadChildren = false;\n    this._modelSource.modifyModel((model) => {\n      const node = model.getNode(nodeId);\n      if (node === undefined || node.isExpanded) {\n        return;\n      }\n\n      needToLoadChildren = node.numChildren === undefined;\n\n      node.isExpanded = true;\n      if (needToLoadChildren) {\n        node.isLoading = true;\n      }\n    });\n\n    const expandedNode = this._modelSource.getModel().getNode(nodeId);\n    return needToLoadChildren && expandedNode\n      ? this._nodeLoader.loadNode(expandedNode, 0)\n      : EMPTY;\n  }\n\n  public collapseNode(nodeId: string) {\n    this._modelSource.modifyModel((model) => {\n      const node = model.getNode(nodeId);\n      if (node === undefined || !node.isExpanded) {\n        return;\n      }\n\n      node.isExpanded = false;\n      if (this._collapsedChildrenDisposalEnabled) {\n        model.clearChildren(node.id);\n      }\n    });\n  }\n\n  public modifySelection(\n    nodesToSelect: TreeNodeItem[],\n    nodesToDeselect: TreeNodeItem[]\n  ) {\n    this._modelSource.modifyModel((model) => {\n      for (const nodeItem of nodesToSelect) {\n        const node = model.getNode(nodeItem.id);\n        if (node !== undefined) {\n          node.isSelected = true;\n        }\n      }\n\n      for (const nodeItem of nodesToDeselect) {\n        const node = model.getNode(nodeItem.id);\n        if (node !== undefined) {\n          node.isSelected = false;\n        }\n      }\n    });\n  }\n\n  public replaceSelection(nodesToSelect: TreeNodeItem[]) {\n    this._modelSource.modifyModel((model) => {\n      for (const node of model.iterateTreeModelNodes()) {\n        node.isSelected = false;\n      }\n\n      for (const nodeItem of nodesToSelect) {\n        const node = model.getNode(nodeItem.id);\n        if (node !== undefined) {\n          node.isSelected = true;\n        }\n      }\n    });\n  }\n\n  public clearNodeSelection() {\n    this._modelSource.modifyModel((model) => {\n      for (const node of model.iterateTreeModelNodes()) {\n        node.isSelected = false;\n      }\n    });\n  }\n\n  public setCheckboxStates(stateChanges: CheckboxStateChange[]) {\n    this._modelSource.modifyModel((model) => {\n      for (const { nodeItem, newState } of stateChanges) {\n        const node = model.getNode(nodeItem.id);\n        if (node !== undefined) {\n          node.checkbox.state = newState;\n        }\n      }\n    });\n  }\n\n  public activateEditing(\n    nodeId: string,\n    onCommit: (node: TreeModelNode, newValue: string) => void\n  ) {\n    this._modelSource.modifyModel((model) => {\n      const node = model.getNode(nodeId);\n      if (!node) return;\n\n      if (node.item.isEditable) {\n        node.editingInfo = this.createNodeEditingInfo(nodeId, onCommit);\n      }\n    });\n  }\n\n  private createNodeEditingInfo(\n    nodeId: string,\n    onCommit: (node: TreeModelNode, newValue: string) => void\n  ): TreeModelNodeEditingInfo {\n    const closeEditing = () => {\n      this._modelSource.modifyModel((model) => {\n        const node = model.getNode(nodeId);\n        if (!node) return;\n        node.editingInfo = undefined;\n      });\n    };\n\n    const onEditCommitted = (node: TreeModelNode, newValue: string) => {\n      onCommit(node, newValue);\n      closeEditing();\n    };\n\n    return { onCommit: onEditCommitted, onCancel: closeEditing };\n  }\n}\n"]}

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

@@ -1,50 +0,0 @@
-/** @packageDocumentation
- * @module Tree
- */
-import type { Observable } from "rxjs";
-import { BeUiEvent } from "@itwin/core-bentley";
-import type { SelectionMode } from "../../../common/selection/SelectionModes";
-import type { TreeActions } from "../TreeActions";
-import type { 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;
-    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/cjs/components-react/tree/controlled/internal/TreeSelectionManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeSelectionManager.d.ts","sourceRoot":"","sources":["../../../../../../src/components-react/tree/controlled/internal/TreeSelectionManager.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AAEvC,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAMhD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0CAA0C,CAAC;AAC9E,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,KAAK,EAAiB,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAKpE,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,CAM5E;AAED,gBAAgB;AAChB,qBAAa,oBACX,YACE,IAAI,CAAC,WAAW,EAAE,eAAe,GAAG,iBAAiB,GAAG,iBAAiB,CAAC;IAE5E,OAAO,CAAC,iBAAiB,CAA8B;IACvD,OAAO,CAAC,uBAAuB,CAAC,CAAsC;IACtE,OAAO,CAAC,aAAa,CAA+C;IAEpE,OAAO,CAAC,gBAAgB,CAAyB;IAE1C,kBAAkB,wCAA+C;IACjE,mBAAmB,uCAA8C;IACjE,eAAe,qCAA4C;gBAGhE,aAAa,EAAE,aAAa,EAC5B,eAAe,EAAE,MAAM,gBAAgB;IAoEzC,OAAO,CAAC,qBAAqB;IAQtB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,UAAU;IAOrD,eAAe,CAAC,MAAM,EAAE,MAAM;IAoB9B,eAAe,CAAC,MAAM,EAAE,MAAM;IAIrC,OAAO,CAAC,uBAAuB;IAgDxB,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,CA6DtB;CACH"}