@theia/core 1.67.0-next.56 → 1.67.0-next.86

package/lib/browser/tree/tree-compression/compressed-tree-widget.js

@@ -0,0 +1,188 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2022 Ericsson and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CompressedTreeWidget = void 0;
+const tslib_1 = require("tslib");
+require("../../../../src/browser/tree/tree-compression/tree-compression.css");
+const inversify_1 = require("inversify");
+const React = require("react");
+const context_menu_renderer_1 = require("../../context-menu-renderer");
+const tree_compression_service_1 = require("./tree-compression-service");
+const tree_1 = require("../tree");
+const tree_widget_1 = require("../tree-widget");
+const tree_selection_1 = require("../tree-selection");
+const tree_expansion_1 = require("../tree-expansion");
+const tree_view_welcome_widget_1 = require("../tree-view-welcome-widget");
+const compressed_tree_model_1 = require("./compressed-tree-model");
+let CompressedTreeWidget = class CompressedTreeWidget extends tree_view_welcome_widget_1.TreeViewWelcomeWidget {
+    constructor(props, model, contextMenuRenderer) {
+        super(props, model, contextMenuRenderer);
+        this.model = model;
+        this.rows = new Map();
+    }
+    toggleCompression(newCompression = !this.compressionToggle.compress) {
+        if (newCompression !== this.compressionToggle.compress) {
+            this.compressionToggle.compress = newCompression;
+            this.updateRows();
+        }
+    }
+    shouldRenderIndent(node) {
+        return !this.compressionToggle.compress
+            || !this.compressionService.isCompressionParticipant(node)
+            || this.compressionService.getCompressionHead(node) === node;
+    }
+    shouldDisplayNode(node) {
+        if (this.compressionToggle.compress && this.compressionService.isCompressionParticipant(node) && !this.compressionService.isCompressionHead(node)) {
+            return false;
+        }
+        return super.shouldDisplayNode(node);
+    }
+    getDepthForNode(node, depths) {
+        var _a;
+        if (!this.compressionToggle.compress) {
+            return super.getDepthForNode(node, depths);
+        }
+        const parent = (_a = this.compressionService.getCompressionHead(node.parent)) !== null && _a !== void 0 ? _a : node.parent;
+        const parentDepth = depths.get(parent);
+        return parentDepth === undefined ? 0 : tree_1.TreeNode.isVisible(node.parent) ? parentDepth + 1 : parentDepth;
+    }
+    toNodeRow(node, index, depth) {
+        if (!this.compressionToggle.compress) {
+            return super.toNodeRow(node, index, depth);
+        }
+        const row = { node, index, depth };
+        if (this.compressionService.isCompressionHead(node)) {
+            row.compressionChain = this.compressionService.getCompressionChain(node);
+        }
+        return row;
+    }
+    doRenderNodeRow({ node, depth, compressionChain }) {
+        const nodeProps = { depth, compressionChain };
+        return React.createElement(React.Fragment, null,
+            this.renderIndent(node, nodeProps),
+            this.renderNode(node, nodeProps));
+    }
+    rowIsSelected(node, props) {
+        if (this.compressionToggle.compress && props.compressionChain) {
+            return props.compressionChain.some(participant => tree_selection_1.SelectableTreeNode.isSelected(participant));
+        }
+        return tree_selection_1.SelectableTreeNode.isSelected(node);
+    }
+    getCaptionAttributes(node, props) {
+        var _a, _b;
+        const operativeNode = (_b = (_a = props.compressionChain) === null || _a === void 0 ? void 0 : _a.tail()) !== null && _b !== void 0 ? _b : node;
+        return super.getCaptionAttributes(operativeNode, props);
+    }
+    getCaptionChildren(node, props) {
+        if (!this.compressionToggle.compress || !props.compressionChain) {
+            return super.getCaptionChildren(node, props);
+        }
+        return props.compressionChain.map((subNode, index, self) => {
+            const classes = ['theia-tree-compressed-label-part'];
+            if (tree_selection_1.SelectableTreeNode.isSelected(subNode)) {
+                classes.push('theia-tree-compressed-selected');
+            }
+            const handlers = this.getCaptionChildEventHandlers(subNode, props);
+            const caption = React.createElement("span", { className: classes.join(' '), key: subNode.id, ...handlers }, super.getCaptionChildren(subNode, props));
+            if (index === self.length - 1) {
+                return caption;
+            }
+            return [
+                caption,
+                React.createElement("span", { className: 'theia-tree-compressed-label-separator', key: subNode + '-separator' }, this.getSeparatorContent(node, props))
+            ];
+        });
+    }
+    getCaptionChildEventHandlers(node, props) {
+        return {
+            onClick: event => (event.stopPropagation(), this.handleClickEvent(node, event)),
+            onDoubleClick: event => (event.stopPropagation(), this.handleDblClickEvent(node, event)),
+            onContextMenu: event => (event.stopPropagation(), this.handleContextMenuEvent(node, event)),
+        };
+    }
+    handleUp(event) {
+        if (!this.compressionToggle.compress) {
+            return super.handleUp(event);
+        }
+        const type = this.props.multiSelect && this.hasShiftMask(event) ? tree_selection_1.TreeSelection.SelectionType.RANGE : undefined;
+        this.model.selectPrevRow(type);
+        this.node.focus();
+    }
+    handleDown(event) {
+        if (!this.compressionToggle.compress) {
+            return super.handleDown(event);
+        }
+        const type = this.props.multiSelect && this.hasShiftMask(event) ? tree_selection_1.TreeSelection.SelectionType.RANGE : undefined;
+        this.model.selectNextRow(type);
+        this.node.focus();
+    }
+    async handleLeft(event) {
+        if (!this.compressionToggle.compress) {
+            return super.handleLeft(event);
+        }
+        if (Boolean(this.props.multiSelect) && (this.hasCtrlCmdMask(event) || this.hasShiftMask(event))) {
+            return;
+        }
+        const active = this.focusService.focusedNode;
+        if (tree_expansion_1.ExpandableTreeNode.isExpanded(active)
+            && (this.compressionService.isCompressionHead(active)
+                || !this.compressionService.isCompressionParticipant(active))) {
+            await this.model.collapseNode(active);
+        }
+        else {
+            this.model.selectParent();
+        }
+    }
+    async handleRight(event) {
+        if (!this.compressionToggle.compress) {
+            return super.handleRight(event);
+        }
+        if (Boolean(this.props.multiSelect) && (this.hasCtrlCmdMask(event) || this.hasShiftMask(event))) {
+            return;
+        }
+        const active = this.focusService.focusedNode;
+        if (tree_expansion_1.ExpandableTreeNode.isCollapsed(active)
+            && (!this.compressionService.isCompressionParticipant(active)
+                || this.compressionService.isCompressionTail(active))) {
+            await this.model.expandNode(active);
+        }
+        else if (tree_expansion_1.ExpandableTreeNode.is(active)) {
+            this.model.selectNextNode();
+        }
+    }
+    getSeparatorContent(node, props) {
+        return '/';
+    }
+};
+exports.CompressedTreeWidget = CompressedTreeWidget;
+tslib_1.__decorate([
+    (0, inversify_1.inject)(tree_compression_service_1.CompressionToggle),
+    tslib_1.__metadata("design:type", Object)
+], CompressedTreeWidget.prototype, "compressionToggle", void 0);
+tslib_1.__decorate([
+    (0, inversify_1.inject)(tree_compression_service_1.TreeCompressionService),
+    tslib_1.__metadata("design:type", tree_compression_service_1.TreeCompressionService)
+], CompressedTreeWidget.prototype, "compressionService", void 0);
+exports.CompressedTreeWidget = CompressedTreeWidget = tslib_1.__decorate([
+    (0, inversify_1.injectable)(),
+    tslib_1.__param(0, (0, inversify_1.inject)(tree_widget_1.TreeProps)),
+    tslib_1.__param(1, (0, inversify_1.inject)(compressed_tree_model_1.CompressedTreeModel)),
+    tslib_1.__param(2, (0, inversify_1.inject)(context_menu_renderer_1.ContextMenuRenderer)),
+    tslib_1.__metadata("design:paramtypes", [Object, compressed_tree_model_1.CompressedTreeModel,
+        context_menu_renderer_1.ContextMenuRenderer])
+], CompressedTreeWidget);
+//# sourceMappingURL=compressed-tree-widget.js.map

package/lib/browser/tree/tree-compression/compressed-tree-widget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compressed-tree-widget.js","sourceRoot":"","sources":["../../../../src/browser/tree/tree-compression/compressed-tree-widget.tsx"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,0CAA0C;AAC1C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;;AAEhF,8EAA4E;AAC5E,yCAA+C;AAC/C,+BAA+B;AAE/B,uEAAkE;AAClE,yEAAuF;AACvF,kCAAsD;AACtD,gDAAkE;AAClE,sDAAsE;AACtE,sDAAuD;AACvD,0EAAoE;AACpE,mEAA8D;AAWvD,IAAM,oBAAoB,GAA1B,MAAM,oBAAqB,SAAQ,gDAAqB;IAK3D,YACuB,KAAgB,EACN,KAA4C,EAC5C,mBAAwC;QAErE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAHM,UAAK,GAAL,KAAK,CAAqB;QAM1D,SAAI,GAAG,IAAI,GAAG,EAA6B,CAAC;IAF/D,CAAC;IAID,iBAAiB,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ;QAC/D,IAAI,cAAc,KAAK,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACrD,IAAI,CAAC,iBAAiB,CAAC,QAAQ,GAAG,cAAc,CAAC;YACjD,IAAI,CAAC,UAAU,EAAE,CAAC;QACtB,CAAC;IACL,CAAC;IAEkB,kBAAkB,CAAC,IAAc;QAChD,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ;eAChC,CAAC,IAAI,CAAC,kBAAkB,CAAC,wBAAwB,CAAC,IAAI,CAAC;eACvD,IAAI,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;IACrE,CAAC;IAEkB,iBAAiB,CAAC,IAAc;QAC/C,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,IAAI,IAAI,CAAC,kBAAkB,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAChJ,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAEkB,eAAe,CAAC,IAAc,EAAE,MAAkD;;QACjG,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,MAAM,GAAG,MAAA,IAAI,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,mCAAI,IAAI,CAAC,MAAM,CAAC;QACtF,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,OAAO,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IAC3G,CAAC;IAEkB,SAAS,CAAC,IAAc,EAAE,KAAa,EAAE,KAAa;QACrE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,GAAG,GAAsB,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACtD,IAAI,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,GAAG,CAAC,gBAAgB,GAAG,IAAI,CAAC,kBAAkB,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAEkB,eAAe,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,gBAAgB,EAAqB;QACnF,MAAM,SAAS,GAAwB,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC;QACnE,OAAO;YACF,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC,CAClC,CAAC;IACR,CAAC;IAEkB,aAAa,CAAC,IAAc,EAAE,KAA0B;QACvE,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;YAC5D,OAAO,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,mCAAkB,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;QAClG,CAAC;QACD,OAAO,mCAAkB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAEkB,oBAAoB,CAAC,IAAc,EAAE,KAA0B;;QAC9E,MAAM,aAAa,GAAG,MAAA,MAAA,KAAK,CAAC,gBAAgB,0CAAE,IAAI,EAAE,mCAAI,IAAI,CAAC;QAC7D,OAAO,KAAK,CAAC,oBAAoB,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IAC5D,CAAC;IAEkB,kBAAkB,CAAC,IAAc,EAAE,KAA0B;QAC5E,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,gBAAgB,EAAE,CAAC;YAC9D,OAAO,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;YACvD,MAAM,OAAO,GAAG,CAAC,kCAAkC,CAAC,CAAC;YACrD,IAAI,mCAAkB,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzC,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;YACnD,CAAC;YACD,MAAM,QAAQ,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,8BAAM,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,KAAM,QAAQ,IAAG,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAQ,CAAC;YACrI,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO,OAAO,CAAC;YACnB,CAAC;YACD,OAAO;gBACH,OAAO;gBACP,8BAAM,SAAS,EAAC,uCAAuC,EAAC,GAAG,EAAE,OAAO,GAAG,YAAY,IAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAQ;aACtI,CAAC;QACN,CAAC,CAAC,CAAC;IACP,CAAC;IAES,4BAA4B,CAAC,IAAc,EAAE,KAA0B;QAC7E,OAAO;YACH,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/E,aAAa,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACxF,aAAa,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;SAC9F,CAAC;IACN,CAAC;IAEkB,QAAQ,CAAC,KAAoB;QAC5C,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,8BAAa,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAChH,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAEkB,UAAU,CAAC,KAAoB;QAC9C,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,8BAAa,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAChH,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAEkB,KAAK,CAAC,UAAU,CAAC,KAAoB;QACpD,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC9F,OAAO;QACX,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC;QAC7C,IAAI,mCAAkB,CAAC,UAAU,CAAC,MAAM,CAAC;eAClC,CACC,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,MAAM,CAAC;mBAC9C,CAAC,IAAI,CAAC,kBAAkB,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAC/D,EAAE,CAAC;YACJ,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QAC9B,CAAC;IACL,CAAC;IAEkB,KAAK,CAAC,WAAW,CAAC,KAAoB;QACrD,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC9F,OAAO;QACX,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC;QAE7C,IAAI,mCAAkB,CAAC,WAAW,CAAC,MAAM,CAAC;eACnC,CACC,CAAC,IAAI,CAAC,kBAAkB,CAAC,wBAAwB,CAAC,MAAM,CAAC;mBACtD,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,MAAM,CAAC,CACvD,EAAE,CAAC;YACJ,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;aAAM,IAAI,mCAAkB,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;QAChC,CAAC;IACL,CAAC;IAES,mBAAmB,CAAC,IAAc,EAAE,KAA0B;QACpE,OAAO,GAAG,CAAC;IACf,CAAC;CACJ,CAAA;AApKY,oDAAoB;AAEiB;IAA7C,IAAA,kBAAM,EAAC,4CAAiB,CAAC;;+DAAyD;AAChC;IAAlD,IAAA,kBAAM,EAAC,iDAAsB,CAAC;sCAAwC,iDAAsB;gEAAC;+BAHrF,oBAAoB;IADhC,IAAA,sBAAU,GAAE;IAOJ,mBAAA,IAAA,kBAAM,EAAC,uBAAS,CAAC,CAAA;IACjB,mBAAA,IAAA,kBAAM,EAAC,2CAAmB,CAAC,CAAA;IAC3B,mBAAA,IAAA,kBAAM,EAAC,2CAAmB,CAAC,CAAA;qDAD0B,2CAAmB;QACvB,2CAAmB;GARhE,oBAAoB,CAoKhC"}

package/lib/browser/tree/tree-compression/index.d.ts

@@ -0,0 +1,5 @@
+export * from './compressed-tree-expansion-service';
+export * from './compressed-tree-model';
+export * from './compressed-tree-widget';
+export * from './tree-compression-service';
+//# sourceMappingURL=index.d.ts.map

package/lib/browser/tree/tree-compression/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/browser/tree/tree-compression/index.ts"],"names":[],"mappings":"AAgBA,cAAc,qCAAqC,CAAC;AACpD,cAAc,yBAAyB,CAAC;AACxC,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC"}

package/lib/browser/tree/tree-compression/index.js

@@ -0,0 +1,23 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2022 Ericsson and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./compressed-tree-expansion-service"), exports);
+tslib_1.__exportStar(require("./compressed-tree-model"), exports);
+tslib_1.__exportStar(require("./compressed-tree-widget"), exports);
+tslib_1.__exportStar(require("./tree-compression-service"), exports);
+//# sourceMappingURL=index.js.map

package/lib/browser/tree/tree-compression/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/browser/tree/tree-compression/index.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,0CAA0C;AAC1C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;AAEhF,8EAAoD;AACpD,kEAAwC;AACxC,mEAAyC;AACzC,qEAA2C"}

package/lib/browser/tree/tree-compression/tree-compression-service.d.ts

@@ -0,0 +1,59 @@
+import { ArrayUtils } from '../../../common/types';
+import { TreeNode } from '../tree';
+import { ExpandableTreeNode } from '../tree-expansion';
+export interface CompressionParent extends ExpandableTreeNode {
+    children: [CompressionChild];
+}
+export interface CompressionChild extends ExpandableTreeNode {
+    parent: CompressionParent;
+}
+export type CompressionParticipant = CompressionChild | CompressionParent;
+export interface CompressionHead extends CompressionParent {
+    parent: ExpandableTreeNode;
+}
+export interface CompressionTail extends CompressionChild {
+}
+export declare const CompressionToggle: unique symbol;
+export interface CompressionToggle {
+    compress: boolean;
+}
+export declare class TreeCompressionService {
+    /**
+     * @returns `true` if the node has a single child that is a CompositeTreeNode
+     * In that case, the child can be shown in the same row as the parent.
+     */
+    isCompressionParent(node?: unknown): node is CompressionParent;
+    protected isVisibleExpandableNode(node?: unknown): node is ExpandableTreeNode;
+    /**
+     * @returns `true` if the node is a CompositeTreeNode and is its parent's sole child
+     * In that case, the node can be shown in the same row as its parent.
+     */
+    isCompressionChild(node?: TreeNode): node is CompressionChild;
+    /**
+     * @returns `true` if the node is a CompositeTreeNode with a sole child, and the same is not true of its parent.
+     * In that case, the node will appear as the first member of a compressed row.
+     */
+    isCompressionHead(node?: unknown): node is CompressionHead;
+    /**
+     * @returns `true` if the node's parent is a CompositeTreeNode with a sole child, and the same is not true of the node.
+     * In that case, the node will appear as the last member of a compressed row.
+     */
+    isCompressionTail(node?: TreeNode): node is CompressionTail;
+    /**
+     * @returns `true` if the node is part of a compression row, either a {@link CompressionChild} or {@link CompressionParent}
+     */
+    isCompressionParticipant(node?: TreeNode): node is CompressionParticipant;
+    /**
+     * @returns a sequence of compressed items for the node if it is a {@link CompressionHead}.
+     */
+    getCompressedChildren(node?: CompressionHead): ArrayUtils.Tail<CompressionChild>;
+    /**
+     * @returns The {@link CompressionHead} of the node's compression chain, or undefined if the node is not a {@link CompressionParticipant}.
+     */
+    getCompressionHead(node?: TreeNode): CompressionHead | undefined;
+    /**
+     * @returns The compression chain of which the `node` is a part, or `undefined` if the `node` is not a {@link CompressionParticipant}
+     */
+    getCompressionChain(node?: TreeNode): ArrayUtils.HeadAndTail<CompressionParticipant> | undefined;
+}
+//# sourceMappingURL=tree-compression-service.d.ts.map

package/lib/browser/tree/tree-compression/tree-compression-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-compression-service.d.ts","sourceRoot":"","sources":["../../../../src/browser/tree/tree-compression/tree-compression-service.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACnC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAEvD,MAAM,WAAW,iBAAkB,SAAQ,kBAAkB;IACzD,QAAQ,EAAE,CAAC,gBAAgB,CAAC,CAAC;CAChC;AAED,MAAM,WAAW,gBAAiB,SAAQ,kBAAkB;IACxD,MAAM,EAAE,iBAAiB,CAAC;CAC7B;AAED,MAAM,MAAM,sBAAsB,GAAG,gBAAgB,GAAG,iBAAiB,CAAC;AAE1E,MAAM,WAAW,eAAgB,SAAQ,iBAAiB;IACtD,MAAM,EAAE,kBAAkB,CAAC;CAC9B;AAED,MAAM,WAAW,eAAgB,SAAQ,gBAAgB;CAAI;AAE7D,eAAO,MAAM,iBAAiB,eAA8B,CAAC;AAC7D,MAAM,WAAW,iBAAiB;IAC9B,QAAQ,EAAE,OAAO,CAAC;CACrB;AAED,qBACa,sBAAsB;IAC/B;;;OAGG;IACH,mBAAmB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,IAAI,IAAI,iBAAiB;IAI9D,SAAS,CAAC,uBAAuB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,IAAI,IAAI,kBAAkB;IAI7E;;;OAGG;IACH,kBAAkB,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,IAAI,IAAI,gBAAgB;IAI7D;;;OAGG;IACH,iBAAiB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,IAAI,IAAI,eAAe;IAI1D;;;OAGG;IACH,iBAAiB,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,IAAI,IAAI,eAAe;IAI3D;;OAEG;IACH,wBAAwB,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,IAAI,IAAI,sBAAsB;IAIzE;;OAEG;IACH,qBAAqB,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,UAAU,CAAC,IAAI,CAAC,gBAAgB,CAAC;IAahF;;OAEG;IACH,kBAAkB,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,eAAe,GAAG,SAAS;IAShE;;OAEG;IACH,mBAAmB,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC,WAAW,CAAC,sBAAsB,CAAC,GAAG,SAAS;CAMnG"}

package/lib/browser/tree/tree-compression/tree-compression-service.js

@@ -0,0 +1,99 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2021 SAP SE or an SAP affiliate company and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeCompressionService = exports.CompressionToggle = void 0;
+const tslib_1 = require("tslib");
+const inversify_1 = require("inversify");
+const types_1 = require("../../../common/types");
+const tree_1 = require("../tree");
+const tree_expansion_1 = require("../tree-expansion");
+exports.CompressionToggle = Symbol('CompressionToggle');
+let TreeCompressionService = class TreeCompressionService {
+    /**
+     * @returns `true` if the node has a single child that is a CompositeTreeNode
+     * In that case, the child can be shown in the same row as the parent.
+     */
+    isCompressionParent(node) {
+        return this.isVisibleExpandableNode(node) && node.children.length === 1 && this.isVisibleExpandableNode(node.children[0]);
+    }
+    isVisibleExpandableNode(node) {
+        return tree_expansion_1.ExpandableTreeNode.is(node) && tree_1.TreeNode.isVisible(node);
+    }
+    /**
+     * @returns `true` if the node is a CompositeTreeNode and is its parent's sole child
+     * In that case, the node can be shown in the same row as its parent.
+     */
+    isCompressionChild(node) {
+        return this.isCompressionParent(node === null || node === void 0 ? void 0 : node.parent);
+    }
+    /**
+     * @returns `true` if the node is a CompositeTreeNode with a sole child, and the same is not true of its parent.
+     * In that case, the node will appear as the first member of a compressed row.
+     */
+    isCompressionHead(node) {
+        return this.isCompressionParent(node) && !this.isCompressionParent(node.parent);
+    }
+    /**
+     * @returns `true` if the node's parent is a CompositeTreeNode with a sole child, and the same is not true of the node.
+     * In that case, the node will appear as the last member of a compressed row.
+     */
+    isCompressionTail(node) {
+        return this.isCompressionChild(node) && !this.isCompressionParent(node);
+    }
+    /**
+     * @returns `true` if the node is part of a compression row, either a {@link CompressionChild} or {@link CompressionParent}
+     */
+    isCompressionParticipant(node) {
+        return this.isCompressionParent(node) || this.isCompressionChild(node);
+    }
+    getCompressedChildren(node) {
+        if (this.isCompressionHead(node)) {
+            const items = [];
+            let next = node.children[0];
+            while (this.isCompressionChild(next)) {
+                items.push(next);
+                next = next.children[0];
+            }
+            return types_1.ArrayUtils.asTail(items);
+        }
+    }
+    /**
+     * @returns The {@link CompressionHead} of the node's compression chain, or undefined if the node is not a {@link CompressionParticipant}.
+     */
+    getCompressionHead(node) {
+        while (this.isCompressionParticipant(node)) {
+            if (this.isCompressionHead(node)) {
+                return node;
+            }
+            node = node.parent;
+        }
+    }
+    /**
+     * @returns The compression chain of which the `node` is a part, or `undefined` if the `node` is not a {@link CompressionParticipant}
+     */
+    getCompressionChain(node) {
+        const head = this.getCompressionHead(node);
+        if (head) {
+            return types_1.ArrayUtils.asHeadAndTail([head].concat(this.getCompressedChildren(head)));
+        }
+    }
+};
+exports.TreeCompressionService = TreeCompressionService;
+exports.TreeCompressionService = TreeCompressionService = tslib_1.__decorate([
+    (0, inversify_1.injectable)()
+], TreeCompressionService);
+//# sourceMappingURL=tree-compression-service.js.map

package/lib/browser/tree/tree-compression/tree-compression-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-compression-service.js","sourceRoot":"","sources":["../../../../src/browser/tree/tree-compression/tree-compression-service.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,oEAAoE;AACpE,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;;AAEhF,yCAAuC;AACvC,iDAAmD;AACnD,kCAAmC;AACnC,sDAAuD;AAkB1C,QAAA,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;AAMtD,IAAM,sBAAsB,GAA5B,MAAM,sBAAsB;IAC/B;;;OAGG;IACH,mBAAmB,CAAC,IAAc;QAC9B,OAAO,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9H,CAAC;IAES,uBAAuB,CAAC,IAAc;QAC5C,OAAO,mCAAkB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,eAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,IAAe;QAC9B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpF,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,IAAe;QAC7B,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC;IAED;;OAEG;IACH,wBAAwB,CAAC,IAAe;QACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC3E,CAAC;IAMD,qBAAqB,CAAC,IAAa;QAC/B,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,IAAI,IAAI,GAAa,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,kBAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,IAAe;QAC9B,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,CAAC;IACL,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,IAAe;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,IAAI,EAAE,CAAC;YACP,OAAO,kBAAU,CAAC,aAAa,CAAC,CAAC,IAA8B,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/G,CAAC;IACL,CAAC;CACJ,CAAA;AAjFY,wDAAsB;iCAAtB,sBAAsB;IADlC,IAAA,sBAAU,GAAE;GACA,sBAAsB,CAiFlC"}

package/lib/browser/tree/tree-consistency.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=tree-consistency.spec.d.ts.map

package/lib/browser/tree/tree-consistency.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-consistency.spec.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-consistency.spec.ts"],"names":[],"mappings":""}

package/lib/browser/tree/tree-consistency.spec.js

@@ -0,0 +1,100 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2019 TypeFox and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+const assert = require("assert");
+const inversify_1 = require("inversify");
+const tree_test_container_1 = require("./test/tree-test-container");
+const tree_1 = require("./tree");
+const tree_model_1 = require("./tree-model");
+const tree_label_provider_1 = require("./tree-label-provider");
+let ConsistencyTestTree = class ConsistencyTestTree extends tree_1.TreeImpl {
+    constructor() {
+        super(...arguments);
+        this.resolveCounter = 0;
+    }
+    async resolveChildren(parent) {
+        if (parent.id === 'expandable') {
+            const step = async () => {
+                // a predicate to emulate bad timing, i.e.
+                // children of a node gets resolved when a root is changed
+                if (this.root && this.root !== parent.parent) {
+                    this.resolveCounter++;
+                    return [];
+                }
+                else {
+                    await new Promise(resolve => setTimeout(resolve, 10));
+                    return step();
+                }
+            };
+            return step();
+        }
+        return super.resolveChildren(parent);
+    }
+};
+ConsistencyTestTree = tslib_1.__decorate([
+    (0, inversify_1.injectable)()
+], ConsistencyTestTree);
+/**
+ * Return roots having the same id, but not object identity.
+ */
+function createConsistencyTestRoot(rootName) {
+    const children = [];
+    const root = {
+        id: 'root',
+        name: rootName,
+        parent: undefined,
+        children
+    };
+    const parent = {
+        id: 'expandable',
+        name: 'expandable',
+        parent: root,
+        expanded: true,
+        children: []
+    };
+    children.push(parent);
+    return root;
+}
+describe('Tree Consistency', () => {
+    it('setting different tree roots should finish', async () => {
+        const container = (0, tree_test_container_1.createTreeTestContainer)();
+        container.bind(tree_label_provider_1.TreeLabelProvider).toSelf().inSingletonScope();
+        const labelProvider = container.get(tree_label_provider_1.TreeLabelProvider);
+        container.bind(ConsistencyTestTree).toSelf();
+        container.rebind(tree_1.TreeImpl).toService(ConsistencyTestTree);
+        const tree = container.get(ConsistencyTestTree);
+        const model = container.get(tree_model_1.TreeModel);
+        model.root = createConsistencyTestRoot('Foo');
+        await new Promise(resolve => setTimeout(resolve, 50));
+        model.root = createConsistencyTestRoot('Bar');
+        await new Promise(resolve => setTimeout(resolve, 50));
+        let resolveCounter = tree.resolveCounter;
+        assert.deepStrictEqual(tree.resolveCounter, 1);
+        for (let i = 0; i < 10; i++) {
+            await new Promise(resolve => setTimeout(resolve, 50));
+            if (resolveCounter === tree.resolveCounter) {
+                assert.deepStrictEqual(tree.resolveCounter, 1);
+                assert.deepStrictEqual(labelProvider.getName(model.root), 'Bar');
+                return;
+            }
+            resolveCounter = tree.resolveCounter;
+        }
+        assert.ok(false, 'Resolving does not stop, attempts: ' + tree.resolveCounter);
+    });
+});
+//# sourceMappingURL=tree-consistency.spec.js.map

package/lib/browser/tree/tree-consistency.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-consistency.spec.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-consistency.spec.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,yCAAyC;AACzC,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;AAEhF,iCAAiC;AACjC,yCAAuC;AACvC,oEAAqE;AACrE,iCAA+D;AAC/D,6CAAyC;AAEzC,+DAA0D;AAG1D,IAAM,mBAAmB,GAAzB,MAAM,mBAAoB,SAAQ,eAAQ;IAA1C;;QAEW,mBAAc,GAAG,CAAC,CAAC;IAoB9B,CAAC;IAlBsB,KAAK,CAAC,eAAe,CAAC,MAAyB;QAC9D,IAAI,MAAM,CAAC,EAAE,KAAK,YAAY,EAAE,CAAC;YAC7B,MAAM,IAAI,GAA8B,KAAK,IAAI,EAAE;gBAC/C,0CAA0C;gBAC1C,0DAA0D;gBAC1D,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;oBAC3C,IAAI,CAAC,cAAc,EAAE,CAAC;oBACtB,OAAO,EAAE,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACJ,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;oBACtD,OAAO,IAAI,EAAE,CAAC;gBAClB,CAAC;YACL,CAAC,CAAC;YACF,OAAO,IAAI,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;CAEJ,CAAA;AAtBK,mBAAmB;IADxB,IAAA,sBAAU,GAAE;GACP,mBAAmB,CAsBxB;AAED;;GAEG;AACH,SAAS,yBAAyB,CAAC,QAAgB;IAC/C,MAAM,QAAQ,GAAe,EAAE,CAAC;IAChC,MAAM,IAAI,GAAsB;QAC5B,EAAE,EAAE,MAAM;QACV,IAAI,EAAE,QAAQ;QACd,MAAM,EAAE,SAAS;QACjB,QAAQ;KACX,CAAC;IACF,MAAM,MAAM,GAAuB;QAC/B,EAAE,EAAE,YAAY;QAChB,IAAI,EAAE,YAAY;QAClB,MAAM,EAAE,IAAI;QACZ,QAAQ,EAAE,IAAI;QACd,QAAQ,EAAE,EAAE;KACf,CAAC;IACF,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAE9B,EAAE,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;QACxD,MAAM,SAAS,GAAG,IAAA,6CAAuB,GAAE,CAAC;QAC5C,SAAS,CAAC,IAAI,CAAC,uCAAiB,CAAC,CAAC,MAAM,EAAE,CAAC,gBAAgB,EAAE,CAAC;QAC9D,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,uCAAiB,CAAC,CAAC;QAEvD,SAAS,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,CAAC;QAC7C,SAAS,CAAC,MAAM,CAAC,eAAQ,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAEhD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAY,sBAAS,CAAC,CAAC;QAElD,KAAK,CAAC,IAAI,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAEtD,KAAK,CAAC,IAAI,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAEtD,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QACzC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;YACtD,IAAI,cAAc,KAAK,IAAI,CAAC,cAAc,EAAE,CAAC;gBACzC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,CAAC,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAE,EAAE,KAAK,CAAC,CAAC;gBAClE,OAAO;YACX,CAAC;YACD,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,qCAAqC,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;AAEP,CAAC,CAAC,CAAC"}

package/lib/browser/tree/tree-container.d.ts

@@ -0,0 +1,52 @@
+import { interfaces, Container } from 'inversify';
+import { TreeWidget, TreeProps } from './tree-widget';
+import { TreeModel } from './tree-model';
+import { Tree } from './tree';
+import { TreeSelectionService } from './tree-selection';
+import { TreeExpansionService } from './tree-expansion';
+import { TreeNavigationService } from './tree-navigation';
+import { TreeDecoratorService } from './tree-decorator';
+import { TreeSearch } from './tree-search';
+import { FuzzySearch } from './fuzzy-search';
+import { SearchBoxFactory } from './search-box';
+import { TreeFocusService } from './tree-focus-service';
+export declare function isTreeServices(candidate?: Partial<TreeProps> | Partial<TreeContainerProps>): candidate is TreeContainerProps;
+export declare function createTreeContainer(parent: interfaces.Container, props?: Partial<TreeContainerProps>): Container;
+/**
+ * @deprecated Please use TreeContainerProps instead of TreeProps
+ * @since 1.23.0
+ */
+export declare function createTreeContainer(parent: interfaces.Container, props?: Partial<TreeProps>): Container;
+export interface SearchBoxFactoryFactory {
+    (context: interfaces.Context): SearchBoxFactory;
+}
+interface TreeConstants {
+    searchBoxFactory: SearchBoxFactory;
+    props: TreeProps;
+}
+interface TreeServices {
+    tree: Tree;
+    selectionService: TreeSelectionService;
+    expansionService: TreeExpansionService;
+    navigationService: TreeNavigationService;
+    model: TreeModel;
+    widget: TreeWidget;
+    search: TreeSearch;
+    fuzzy: FuzzySearch;
+    decoratorService: TreeDecoratorService;
+    focusService: TreeFocusService;
+}
+interface TreeTypes extends TreeServices, TreeConstants {
+}
+export type TreeIdentifiers = {
+    [K in keyof TreeTypes]: interfaces.ServiceIdentifier<TreeTypes[K]>;
+};
+type TreeServiceProviders = {
+    [K in keyof TreeServices]: interfaces.Newable<TreeServices[K]>;
+};
+export interface TreeContainerProps extends TreeServiceProviders {
+    props: Partial<TreeProps>;
+    searchBoxFactory: SearchBoxFactoryFactory;
+}
+export {};
+//# sourceMappingURL=tree-container.d.ts.map

package/lib/browser/tree/tree-container.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-container.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-container.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,SAAS,EAAoB,MAAM,eAAe,CAAC;AACxE,OAAO,EAAiB,SAAS,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAY,IAAI,EAAE,MAAM,QAAQ,CAAC;AACxC,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAExD,OAAO,EAAE,oBAAoB,EAA4B,MAAM,kBAAkB,CAAC;AAClF,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAE,oBAAoB,EAA4B,MAAM,kBAAkB,CAAC;AAClF,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAa,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAE3D,OAAO,EAAE,gBAAgB,EAAwB,MAAM,sBAAsB,CAAC;AAE9E,wBAAgB,cAAc,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,kBAAkB,CAAC,GAAG,SAAS,IAAI,kBAAkB,CAc5H;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC;AAClH;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,SAAS,CAAC;AAqCzG,MAAM,WAAW,uBAAuB;IACpC,CAAC,OAAO,EAAE,UAAU,CAAC,OAAO,GAAG,gBAAgB,CAAC;CACnD;AAOD,UAAU,aAAa;IACnB,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,KAAK,EAAE,SAAS,CAAC;CACpB;AAED,UAAU,YAAY;IAClB,IAAI,EAAE,IAAI,CAAC;IACX,gBAAgB,EAAE,oBAAoB,CAAC;IACvC,gBAAgB,EAAE,oBAAoB,CAAC;IACvC,iBAAiB,EAAE,qBAAqB,CAAC;IACzC,KAAK,EAAE,SAAS,CAAC;IACjB,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,EAAE,UAAU,CAAC;IACnB,KAAK,EAAE,WAAW,CAAC;IACnB,gBAAgB,EAAE,oBAAoB,CAAC;IACvC,YAAY,EAAE,gBAAgB,CAAC;CAClC;AAED,UAAU,SAAU,SAAQ,YAAY,EAAE,aAAa;CAAI;AAE3D,MAAM,MAAM,eAAe,GAAG;KAAG,CAAC,IAAI,MAAM,SAAS,GAAG,UAAU,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;CAAG,CAAC;AACtG,KAAK,oBAAoB,GAAG;KAAG,CAAC,IAAI,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CAAE,CAAC;AAE/F,MAAM,WAAW,kBAAmB,SAAQ,oBAAoB;IAC5D,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IAC1B,gBAAgB,EAAE,uBAAuB,CAAC;CAC7C"}