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

package/lib/browser/tree/tree-navigation.js

@@ -0,0 +1,58 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2017 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 });
+exports.TreeNavigationService = void 0;
+const tslib_1 = require("tslib");
+const inversify_1 = require("inversify");
+let TreeNavigationService = class TreeNavigationService {
+    constructor() {
+        this.index = -1;
+        this.nodes = [];
+    }
+    get next() {
+        return this.nodes[this.index + 1];
+    }
+    get prev() {
+        return this.nodes[this.index - 1];
+    }
+    advance() {
+        const node = this.next;
+        if (node) {
+            this.index = this.index + 1;
+            return node;
+        }
+        return undefined;
+    }
+    retreat() {
+        const node = this.prev;
+        if (node) {
+            this.index = this.index - 1;
+            return node;
+        }
+        return undefined;
+    }
+    push(node) {
+        this.nodes = this.nodes.slice(0, this.index + 1);
+        this.nodes.push(node);
+        this.index = this.index + 1;
+    }
+};
+exports.TreeNavigationService = TreeNavigationService;
+exports.TreeNavigationService = TreeNavigationService = tslib_1.__decorate([
+    (0, inversify_1.injectable)()
+], TreeNavigationService);
+//# sourceMappingURL=tree-navigation.js.map

package/lib/browser/tree/tree-navigation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-navigation.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-navigation.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,yCAAuC;AAIhC,IAAM,qBAAqB,GAA3B,MAAM,qBAAqB;IAA3B;QAEO,UAAK,GAAW,CAAC,CAAC,CAAC;QACnB,UAAK,GAAe,EAAE,CAAC;IAkCrC,CAAC;IAhCG,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,OAAO;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,EAAE,CAAC;YACP,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,OAAO;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,EAAE,CAAC;YACP,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAI,CAAC,IAAc;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAChC,CAAC;CAEJ,CAAA;AArCY,sDAAqB;gCAArB,qBAAqB;IADjC,IAAA,sBAAU,GAAE;GACA,qBAAqB,CAqCjC"}

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

@@ -0,0 +1,37 @@
+import { Disposable, DisposableCollection } from '../../common/disposable';
+import { Event, Emitter } from '../../common/event';
+import { Tree, TreeNode } from './tree';
+import { TreeDecoration } from './tree-decorator';
+import { FuzzySearch } from './fuzzy-search';
+import { LabelProvider } from '../label-provider';
+export declare class TreeSearch implements Disposable {
+    protected readonly tree: Tree;
+    protected readonly fuzzySearch: FuzzySearch;
+    protected readonly labelProvider: LabelProvider;
+    protected readonly disposables: DisposableCollection;
+    protected readonly filteredNodesEmitter: Emitter<readonly Readonly<TreeNode>[]>;
+    protected _filterResult: FuzzySearch.Match<TreeNode>[];
+    protected _filteredNodes: ReadonlyArray<Readonly<TreeNode>>;
+    protected _filteredNodesAndParents: Set<string>;
+    protected init(): void;
+    getHighlights(): Map<string, TreeDecoration.CaptionHighlight>;
+    /**
+     * Resolves to all the visible tree nodes that match the search pattern.
+     */
+    filter(pattern: string | undefined): Promise<ReadonlyArray<Readonly<TreeNode>>>;
+    protected addAllParentsToFilteredSet(node: TreeNode): void;
+    /**
+     * Returns with the filtered nodes after invoking the `filter` method.
+     */
+    get filteredNodes(): ReadonlyArray<Readonly<TreeNode>>;
+    /**
+     * Event that is fired when the filtered nodes have been changed.
+     */
+    get onFilteredNodesChanged(): Event<ReadonlyArray<Readonly<TreeNode>>>;
+    passesFilters(node: TreeNode): boolean;
+    dispose(): void;
+    protected fireFilteredNodesChanged(nodes: ReadonlyArray<Readonly<TreeNode>>): void;
+    protected toCaptionHighlight(match: FuzzySearch.Match<TreeNode>): TreeDecoration.CaptionHighlight;
+    protected mapRange(range: FuzzySearch.Range): TreeDecoration.CaptionHighlight.Range;
+}
+//# sourceMappingURL=tree-search.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tree-search.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-search.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC3E,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACxC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAElD,qBACa,UAAW,YAAW,UAAU;IAGzC,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAG9B,SAAS,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;IAG5C,SAAS,CAAC,QAAQ,CAAC,aAAa,EAAE,aAAa,CAAC;IAEhD,SAAS,CAAC,QAAQ,CAAC,WAAW,uBAA8B;IAC5D,SAAS,CAAC,QAAQ,CAAC,oBAAoB,yCAAoD;IAE3F,SAAS,CAAC,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAM;IAC5D,SAAS,CAAC,cAAc,EAAE,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAM;IACjE,SAAS,CAAC,wBAAwB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAG5D,SAAS,CAAC,IAAI,IAAI,IAAI;IAItB,aAAa,IAAI,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,gBAAgB,CAAC;IAI7D;;OAEG;IACG,MAAM,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IAwBrF,SAAS,CAAC,0BAA0B,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAQ1D;;OAEG;IACH,IAAI,aAAa,IAAI,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAErD;IAED;;OAEG;IACH,IAAI,sBAAsB,IAAI,KAAK,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAErE;IAED,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAItC,OAAO,IAAI,IAAI;IAIf,SAAS,CAAC,wBAAwB,CAAC,KAAK,EAAE,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI;IAIlF,SAAS,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC,gBAAgB;IAMjG,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,GAAG,cAAc,CAAC,gBAAgB,CAAC,KAAK;CAOtF"}

package/lib/browser/tree/tree-search.js

@@ -0,0 +1,131 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 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 });
+exports.TreeSearch = void 0;
+const tslib_1 = require("tslib");
+const inversify_1 = require("inversify");
+const disposable_1 = require("../../common/disposable");
+const event_1 = require("../../common/event");
+const tree_1 = require("./tree");
+const fuzzy_search_1 = require("./fuzzy-search");
+const tree_iterator_1 = require("./tree-iterator");
+const label_provider_1 = require("../label-provider");
+let TreeSearch = class TreeSearch {
+    constructor() {
+        this.disposables = new disposable_1.DisposableCollection();
+        this.filteredNodesEmitter = new event_1.Emitter();
+        this._filterResult = [];
+        this._filteredNodes = [];
+        this._filteredNodesAndParents = new Set();
+    }
+    init() {
+        this.disposables.push(this.filteredNodesEmitter);
+    }
+    getHighlights() {
+        return new Map(this._filterResult.map(m => [m.item.id, this.toCaptionHighlight(m)]));
+    }
+    /**
+     * Resolves to all the visible tree nodes that match the search pattern.
+     */
+    async filter(pattern) {
+        const { root } = this.tree;
+        this._filteredNodesAndParents = new Set();
+        if (!pattern || !root) {
+            this._filterResult = [];
+            this._filteredNodes = [];
+            this.fireFilteredNodesChanged(this._filteredNodes);
+            return [];
+        }
+        const items = [...new tree_iterator_1.TopDownTreeIterator(root)];
+        const transform = (node) => this.labelProvider.getName(node);
+        this._filterResult = await this.fuzzySearch.filter({
+            items,
+            pattern,
+            transform
+        });
+        this._filteredNodes = this._filterResult.map(({ item }) => {
+            this.addAllParentsToFilteredSet(item);
+            return item;
+        });
+        this.fireFilteredNodesChanged(this._filteredNodes);
+        return this._filteredNodes.slice();
+    }
+    addAllParentsToFilteredSet(node) {
+        let toAdd = node;
+        while (toAdd && !this._filteredNodesAndParents.has(toAdd.id)) {
+            this._filteredNodesAndParents.add(toAdd.id);
+            toAdd = toAdd.parent;
+        }
+        ;
+    }
+    /**
+     * Returns with the filtered nodes after invoking the `filter` method.
+     */
+    get filteredNodes() {
+        return this._filteredNodes.slice();
+    }
+    /**
+     * Event that is fired when the filtered nodes have been changed.
+     */
+    get onFilteredNodesChanged() {
+        return this.filteredNodesEmitter.event;
+    }
+    passesFilters(node) {
+        return this._filteredNodesAndParents.has(node.id);
+    }
+    dispose() {
+        this.disposables.dispose();
+    }
+    fireFilteredNodesChanged(nodes) {
+        this.filteredNodesEmitter.fire(nodes);
+    }
+    toCaptionHighlight(match) {
+        return {
+            ranges: match.ranges.map(this.mapRange.bind(this))
+        };
+    }
+    mapRange(range) {
+        const { offset, length } = range;
+        return {
+            offset,
+            length
+        };
+    }
+};
+exports.TreeSearch = TreeSearch;
+tslib_1.__decorate([
+    (0, inversify_1.inject)(tree_1.Tree),
+    tslib_1.__metadata("design:type", Object)
+], TreeSearch.prototype, "tree", void 0);
+tslib_1.__decorate([
+    (0, inversify_1.inject)(fuzzy_search_1.FuzzySearch),
+    tslib_1.__metadata("design:type", fuzzy_search_1.FuzzySearch)
+], TreeSearch.prototype, "fuzzySearch", void 0);
+tslib_1.__decorate([
+    (0, inversify_1.inject)(label_provider_1.LabelProvider),
+    tslib_1.__metadata("design:type", label_provider_1.LabelProvider)
+], TreeSearch.prototype, "labelProvider", void 0);
+tslib_1.__decorate([
+    (0, inversify_1.postConstruct)(),
+    tslib_1.__metadata("design:type", Function),
+    tslib_1.__metadata("design:paramtypes", []),
+    tslib_1.__metadata("design:returntype", void 0)
+], TreeSearch.prototype, "init", null);
+exports.TreeSearch = TreeSearch = tslib_1.__decorate([
+    (0, inversify_1.injectable)()
+], TreeSearch);
+//# sourceMappingURL=tree-search.js.map

package/lib/browser/tree/tree-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-search.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-search.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,yCAA8D;AAC9D,wDAA2E;AAC3E,8CAAoD;AACpD,iCAAwC;AAExC,iDAA6C;AAC7C,mDAAsD;AACtD,sDAAkD;AAG3C,IAAM,UAAU,GAAhB,MAAM,UAAU;IAAhB;QAWgB,gBAAW,GAAG,IAAI,iCAAoB,EAAE,CAAC;QACzC,yBAAoB,GAAG,IAAI,eAAO,EAAqC,CAAC;QAEjF,kBAAa,GAAkC,EAAE,CAAC;QAClD,mBAAc,GAAsC,EAAE,CAAC;QACvD,6BAAwB,GAAgB,IAAI,GAAG,EAAE,CAAC;IAqFhE,CAAC;IAlFa,IAAI;QACV,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACrD,CAAC;IAED,aAAa;QACT,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAA8C,CAAC,CAAC,CAAC;IACtI,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,OAA2B;QACpC,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,wBAAwB,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1C,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;YACxB,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;YACzB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACnD,OAAO,EAAE,CAAC;QACd,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,mCAAmB,CAAC,IAAI,CAAC,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,aAAa,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;YAC/C,KAAK;YACL,OAAO;YACP,SAAS;SACZ,CAAC,CAAC;QACH,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE;YACtD,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC;YACtC,OAAO,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;IAES,0BAA0B,CAAC,IAAc;QAC/C,IAAI,KAAK,GAAyB,IAAI,CAAC;QACvC,OAAO,KAAK,IAAI,CAAC,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3D,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC5C,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QACzB,CAAC;QAAA,CAAC;IACN,CAAC;IAED;;OAEG;IACH,IAAI,aAAa;QACb,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,IAAI,sBAAsB;QACtB,OAAO,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC;IAC3C,CAAC;IAED,aAAa,CAAC,IAAc;QACxB,OAAO,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtD,CAAC;IAED,OAAO;QACH,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAES,wBAAwB,CAAC,KAAwC;QACvE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAES,kBAAkB,CAAC,KAAkC;QAC3D,OAAO;YACH,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrD,CAAC;IACN,CAAC;IAES,QAAQ,CAAC,KAAwB;QACvC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;QACjC,OAAO;YACH,MAAM;YACN,MAAM;SACT,CAAC;IACN,CAAC;CACJ,CAAA;AArGY,gCAAU;AAGA;IADlB,IAAA,kBAAM,EAAC,WAAI,CAAC;;wCACiB;AAGX;IADlB,IAAA,kBAAM,EAAC,0BAAW,CAAC;sCACY,0BAAW;+CAAC;AAGzB;IADlB,IAAA,kBAAM,EAAC,8BAAa,CAAC;sCACY,8BAAa;iDAAC;AAUtC;IADT,IAAA,yBAAa,GAAE;;;;sCAGf;qBArBQ,UAAU;IADtB,IAAA,sBAAU,GAAE;GACA,UAAU,CAqGtB"}

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

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

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

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

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

@@ -0,0 +1,147 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 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 tree_model_1 = require("./tree-model");
+const objects_1 = require("../../common/objects");
+const chai_1 = require("chai");
+const tree_test_container_1 = require("./test/tree-test-container");
+const mock_selectable_tree_model_1 = require("./test/mock-selectable-tree-model");
+const tree_expansion_1 = require("./tree-expansion");
+describe('Selectable Tree', () => {
+    let model;
+    function assertNodeRetrieval(method, sequence) {
+        for (const expectedNodeId of sequence) {
+            const actualNode = method();
+            const expectedNode = retrieveNode(expectedNodeId);
+            (0, chai_1.expect)(actualNode === null || actualNode === void 0 ? void 0 : actualNode.id).to.be.equal(expectedNode.id);
+            model.addSelection(expectedNode);
+        }
+    }
+    function assertNodeSelection(method, sequence) {
+        for (const expectedNodeId of sequence) {
+            method();
+            const node = retrieveNode(expectedNodeId);
+            (0, chai_1.expect)(node.selected).to.be.true;
+        }
+    }
+    describe('Get and Set Next Nodes Methods', () => {
+        const uncollapsedSelectionOrder = ['1.1', '1.1.1', '1.1.2', '1.2', '1.2.1', '1.2.1.1', '1.2.1.2', '1.2.2', '1.2.3', '1.3'];
+        const collapsedSelectionOrder = ['1.1', '1.2', '1.2.1', '1.2.2', '1.2.3', '1.3'];
+        beforeEach(() => {
+            model = createTreeModel();
+            model.root = mock_selectable_tree_model_1.MockSelectableTreeModel.HIERARCHICAL_MOCK_ROOT();
+            model.addSelection(retrieveNode('1'));
+        });
+        it('`getNextNode()` should select each node in sequence (uncollapsed)', done => {
+            assertNodeRetrieval(model.getNextNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`getNextNode()` should select each node in sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeRetrieval(model.getNextNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`getNextSelectableNode()` should select each node in sequence (uncollapsed)', done => {
+            assertNodeRetrieval(model.getNextSelectableNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`getNextSelectableNode()` should select each node in sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeRetrieval(model.getNextSelectableNode.bind(model), collapsedSelectionOrder);
+            done();
+        });
+        it('`selectNext()` should select each node in sequence (uncollapsed)', done => {
+            assertNodeSelection(model.selectNext.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`selectNext()` should select each node in sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeSelection(model.selectNext.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`selectNextNode()` should select each node in sequence (uncollapsed)', done => {
+            assertNodeSelection(model.selectNextNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`selectNextNode()` should select each node in sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeSelection(model.selectNextNode.bind(model), collapsedSelectionOrder);
+            done();
+        });
+    });
+    describe('Get and Set Previous Nodes Methods', () => {
+        const uncollapsedSelectionOrder = ['1.2.3', '1.2.2', '1.2.1.2', '1.2.1.1', '1.2.1', '1.2', '1.1.2', '1.1.1', '1.1'];
+        const collapsedSelectionOrder = ['1.2.3', '1.2.2', '1.2.1', '1.2', '1.1'];
+        beforeEach(() => {
+            model = createTreeModel();
+            model.root = mock_selectable_tree_model_1.MockSelectableTreeModel.HIERARCHICAL_MOCK_ROOT();
+            model.addSelection(retrieveNode('1.3'));
+        });
+        it('`getPrevNode()` should select each node in reverse sequence (uncollapsed)', done => {
+            assertNodeRetrieval(model.getPrevNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`getPrevNode()` should select each node in reverse sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeRetrieval(model.getPrevNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`getPrevSelectableNode()` should select each node in reverse sequence (uncollapsed)', done => {
+            assertNodeRetrieval(model.getPrevSelectableNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`getPrevSelectableNode()` should select each node in reverse sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeRetrieval(model.getPrevSelectableNode.bind(model), collapsedSelectionOrder);
+            done();
+        });
+        it('`selectPrev()` should select each node in reverse sequence (uncollapsed)', done => {
+            assertNodeSelection(model.selectPrev.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`selectPrev()` should select each node in reverse sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeSelection(model.selectPrev.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`selectPrevNode()` should select each node in reverse sequence (uncollapsed)', done => {
+            assertNodeSelection(model.selectPrevNode.bind(model), uncollapsedSelectionOrder);
+            done();
+        });
+        it('`selectPrevNode()` should select each node in reverse sequence (collapsed)', done => {
+            collapseNode('1.1', '1.2.1');
+            assertNodeSelection(model.selectPrevNode.bind(model), collapsedSelectionOrder);
+            done();
+        });
+    });
+    const findNode = (id) => model.getNode(id);
+    function createTreeModel() {
+        const container = (0, tree_test_container_1.createTreeTestContainer)();
+        return container.get(tree_model_1.TreeModel);
+    }
+    function retrieveNode(id) {
+        const readonlyNode = model.getNode(id);
+        return readonlyNode;
+    }
+    function collapseNode(...ids) {
+        ids.map(findNode).filter(objects_1.notEmpty).filter(tree_expansion_1.ExpandableTreeNode.is).forEach(node => {
+            model.collapseNode(node);
+            (0, chai_1.expect)(node).to.have.property('expanded', false);
+        });
+    }
+});
+//# sourceMappingURL=tree-selectable.spec.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selectable.spec.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-selectable.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;;AAGhF,6CAAyC;AACzC,kDAAgD;AAChD,+BAA8B;AAC9B,oEAAqE;AAErE,kFAA4E;AAC5E,qDAAsD;AAEtD,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC7B,IAAI,KAAgB,CAAC;IACrB,SAAS,mBAAmB,CAAC,MAAkC,EAAE,QAAkB;QAC/E,KAAK,MAAM,cAAc,IAAI,QAAQ,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC;YAC5B,MAAM,YAAY,GAAG,YAAY,CAAqB,cAAc,CAAC,CAAC;YACtE,IAAA,aAAM,EAAC,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;YACpD,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IACD,SAAS,mBAAmB,CAAC,MAAkB,EAAE,QAAkB;QAC/D,KAAK,MAAM,cAAc,IAAI,QAAQ,EAAE,CAAC;YACpC,MAAM,EAAE,CAAC;YACT,MAAM,IAAI,GAAG,YAAY,CAAqB,cAAc,CAAC,CAAC;YAC9D,IAAA,aAAM,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACrC,CAAC;IACL,CAAC;IACD,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC5C,MAAM,yBAAyB,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC3H,MAAM,uBAAuB,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACjF,UAAU,CAAC,GAAG,EAAE;YACZ,KAAK,GAAG,eAAe,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,GAAG,oDAAuB,CAAC,sBAAsB,EAAE,CAAC;YAC9D,KAAK,CAAC,YAAY,CAAC,YAAY,CAAqB,GAAG,CAAC,CAAC,CAAC;QAE9D,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mEAAmE,EAAE,IAAI,CAAC,EAAE;YAC3E,mBAAmB,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC9E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iEAAiE,EAAE,IAAI,CAAC,EAAE;YACzE,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC9E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,6EAA6E,EAAE,IAAI,CAAC,EAAE;YACrF,mBAAmB,CAAC,KAAK,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACxF,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,2EAA2E,EAAE,IAAI,CAAC,EAAE;YACnF,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,uBAAuB,CAAC,CAAC;YACtF,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,kEAAkE,EAAE,IAAI,CAAC,EAAE;YAC1E,mBAAmB,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC7E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gEAAgE,EAAE,IAAI,CAAC,EAAE;YACxE,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC7E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,sEAAsE,EAAE,IAAI,CAAC,EAAE;YAC9E,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACjF,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oEAAoE,EAAE,IAAI,CAAC,EAAE;YAC5E,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,uBAAuB,CAAC,CAAC;YAC/E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAChD,MAAM,yBAAyB,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACpH,MAAM,uBAAuB,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1E,UAAU,CAAC,GAAG,EAAE;YACZ,KAAK,GAAG,eAAe,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,GAAG,oDAAuB,CAAC,sBAAsB,EAAE,CAAC;YAC9D,KAAK,CAAC,YAAY,CAAC,YAAY,CAAqB,KAAK,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,2EAA2E,EAAE,IAAI,CAAC,EAAE;YACnF,mBAAmB,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC9E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,yEAAyE,EAAE,IAAI,CAAC,EAAE;YACjF,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC9E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qFAAqF,EAAE,IAAI,CAAC,EAAE;YAC7F,mBAAmB,CAAC,KAAK,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACxF,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mFAAmF,EAAE,IAAI,CAAC,EAAE;YAC3F,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,uBAAuB,CAAC,CAAC;YACtF,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,0EAA0E,EAAE,IAAI,CAAC,EAAE;YAClF,mBAAmB,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC7E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,wEAAwE,EAAE,IAAI,CAAC,EAAE;YAChF,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC7E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,8EAA8E,EAAE,IAAI,CAAC,EAAE;YACtF,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACjF,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,4EAA4E,EAAE,IAAI,CAAC,EAAE;YACpF,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,uBAAuB,CAAC,CAAC;YAC/E,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACnD,SAAS,eAAe;QACpB,MAAM,SAAS,GAAG,IAAA,6CAAuB,GAAE,CAAC;QAC5C,OAAO,SAAS,CAAC,GAAG,CAAC,sBAAS,CAAC,CAAC;IACpC,CAAC;IACD,SAAS,YAAY,CAAqB,EAAU;QAChD,MAAM,YAAY,GAAgB,KAAK,CAAC,OAAO,CAAC,EAAE,CAAM,CAAC;QACzD,OAAO,YAAY,CAAC;IACxB,CAAC;IACD,SAAS,YAAY,CAAC,GAAG,GAAa;QAClC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,kBAAQ,CAAC,CAAC,MAAM,CAAC,mCAAkB,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5E,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACzB,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACP,CAAC;AAEL,CAAC,CAAC,CAAC"}

package/lib/browser/tree/tree-selection-impl.d.ts

@@ -0,0 +1,45 @@
+import { Tree, TreeNode } from './tree';
+import { Event, Emitter } from '../../common';
+import { TreeSelectionState } from './tree-selection-state';
+import { TreeSelectionService, SelectableTreeNode, TreeSelection } from './tree-selection';
+import { TreeFocusService } from './tree-focus-service';
+export declare class TreeSelectionServiceImpl implements TreeSelectionService {
+    protected readonly tree: Tree;
+    protected readonly focusService: TreeFocusService;
+    protected readonly onSelectionChangedEmitter: Emitter<readonly Readonly<SelectableTreeNode>[]>;
+    protected state: TreeSelectionState;
+    protected init(): void;
+    dispose(): void;
+    get selectedNodes(): ReadonlyArray<Readonly<SelectableTreeNode>>;
+    get onSelectionChanged(): Event<ReadonlyArray<Readonly<SelectableTreeNode>>>;
+    protected fireSelectionChanged(): void;
+    addSelection(selectionOrTreeNode: TreeSelection | Readonly<SelectableTreeNode>): void;
+    clearSelection(): void;
+    protected transiteTo(newState: TreeSelectionState, setFocus?: boolean): void;
+    protected unselect(nodes: ReadonlyArray<SelectableTreeNode>): void;
+    protected select(nodes: ReadonlyArray<SelectableTreeNode>): void;
+    protected removeFocus(...nodes: ReadonlyArray<SelectableTreeNode>[]): void;
+    protected addFocus(node: SelectableTreeNode | undefined): void;
+    /**
+     * Returns an array of the difference of two arrays. The returned array contains all elements that are contained by
+     * `left` and not contained by `right`. `right` may also contain elements not present in `left`: these are simply ignored.
+     */
+    protected difference<T>(left: ReadonlyArray<T>, right: ReadonlyArray<T>): ReadonlyArray<T>;
+    /**
+     * Returns a reference to the argument if the node exists in the tree. Otherwise, `undefined`.
+     */
+    protected validateNode(node: Readonly<TreeNode>): Readonly<TreeNode> | undefined;
+    storeState(): TreeSelectionServiceImpl.State;
+    restoreState(state: TreeSelectionServiceImpl.State): void;
+}
+export declare namespace TreeSelectionServiceImpl {
+    interface State {
+        selectionStack: ReadonlyArray<FocusableTreeSelectionState>;
+    }
+    interface FocusableTreeSelectionState {
+        focus?: string;
+        node?: string;
+        type?: TreeSelection.SelectionType;
+    }
+}
+//# sourceMappingURL=tree-selection-impl.d.ts.map

package/lib/browser/tree/tree-selection-impl.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selection-impl.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-selection-impl.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACxC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAA0B,MAAM,wBAAwB,CAAC;AACpF,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAExD,qBACa,wBAAyB,YAAW,oBAAoB;IAEnD,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAClB,SAAS,CAAC,QAAQ,CAAC,YAAY,EAAE,gBAAgB,CAAC;IAE5E,SAAS,CAAC,QAAQ,CAAC,yBAAyB,mDAA8D;IAE1G,SAAS,CAAC,KAAK,EAAE,kBAAkB,CAAC;IAGpC,SAAS,CAAC,IAAI,IAAI,IAAI;IAItB,OAAO,IAAI,IAAI;IAIf,IAAI,aAAa,IAAI,aAAa,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAE/D;IAED,IAAI,kBAAkB,IAAI,KAAK,CAAC,aAAa,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAE3E;IAED,SAAS,CAAC,oBAAoB,IAAI,IAAI;IAItC,YAAY,CAAC,mBAAmB,EAAE,aAAa,GAAG,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAyBrF,cAAc,IAAI,IAAI;IAItB,SAAS,CAAC,UAAU,CAAC,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,UAAO,GAAG,IAAI;IAkBzE,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAIlE,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAIhE,SAAS,CAAC,WAAW,CAAC,GAAG,KAAK,EAAE,aAAa,CAAC,kBAAkB,CAAC,EAAE,GAAG,IAAI;IAI1E,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,kBAAkB,GAAG,SAAS,GAAG,IAAI;IAO9D;;;OAGG;IACH,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;IAI1F;;OAEG;IACH,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,SAAS;IAKhF,UAAU,IAAI,wBAAwB,CAAC,KAAK;IAU5C,YAAY,CAAC,KAAK,EAAE,wBAAwB,CAAC,KAAK,GAAG,IAAI;CAmB5D;AACD,yBAAiB,wBAAwB,CAAC;IACtC,UAAiB,KAAK;QAClB,cAAc,EAAE,aAAa,CAAC,2BAA2B,CAAC,CAAA;KAC7D;IACD,UAAiB,2BAA2B;QACxC,KAAK,CAAC,EAAE,MAAM,CAAA;QACd,IAAI,CAAC,EAAE,MAAM,CAAA;QACb,IAAI,CAAC,EAAE,aAAa,CAAC,aAAa,CAAA;KACrC;CACJ"}

package/lib/browser/tree/tree-selection-impl.js

@@ -0,0 +1,159 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 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 });
+exports.TreeSelectionServiceImpl = void 0;
+const tslib_1 = require("tslib");
+const inversify_1 = require("inversify");
+const tree_1 = require("./tree");
+const common_1 = require("../../common");
+const tree_selection_state_1 = require("./tree-selection-state");
+const tree_selection_1 = require("./tree-selection");
+const tree_focus_service_1 = require("./tree-focus-service");
+let TreeSelectionServiceImpl = class TreeSelectionServiceImpl {
+    constructor() {
+        this.onSelectionChangedEmitter = new common_1.Emitter();
+    }
+    init() {
+        this.state = new tree_selection_state_1.TreeSelectionState(this.tree);
+    }
+    dispose() {
+        this.onSelectionChangedEmitter.dispose();
+    }
+    get selectedNodes() {
+        return this.state.selection();
+    }
+    get onSelectionChanged() {
+        return this.onSelectionChangedEmitter.event;
+    }
+    fireSelectionChanged() {
+        this.onSelectionChangedEmitter.fire(this.state.selection());
+    }
+    addSelection(selectionOrTreeNode) {
+        const selection = ((arg) => {
+            const type = tree_selection_1.TreeSelection.SelectionType.DEFAULT;
+            if (tree_selection_1.TreeSelection.is(arg)) {
+                return {
+                    type,
+                    ...arg
+                };
+            }
+            return {
+                type,
+                node: arg
+            };
+        })(selectionOrTreeNode);
+        const node = this.validateNode(selection.node);
+        if (node === undefined) {
+            return;
+        }
+        Object.assign(selection, { node });
+        const newState = this.state.nextState(selection);
+        this.transiteTo(newState);
+    }
+    clearSelection() {
+        this.transiteTo(new tree_selection_state_1.TreeSelectionState(this.tree), false);
+    }
+    transiteTo(newState, setFocus = true) {
+        const oldNodes = this.state.selection();
+        const newNodes = newState.selection();
+        const toUnselect = this.difference(oldNodes, newNodes);
+        const toSelect = this.difference(newNodes, oldNodes);
+        this.unselect(toUnselect);
+        this.select(toSelect);
+        this.removeFocus(oldNodes, newNodes);
+        if (setFocus) {
+            this.addFocus(newState.node);
+        }
+        this.state = newState;
+        this.fireSelectionChanged();
+    }
+    unselect(nodes) {
+        nodes.forEach(node => node.selected = false);
+    }
+    select(nodes) {
+        nodes.forEach(node => node.selected = true);
+    }
+    removeFocus(...nodes) {
+        nodes.forEach(node => node.forEach(n => n.focus = false));
+    }
+    addFocus(node) {
+        if (node) {
+            node.focus = true;
+        }
+        this.focusService.setFocus(node);
+    }
+    /**
+     * Returns an array of the difference of two arrays. The returned array contains all elements that are contained by
+     * `left` and not contained by `right`. `right` may also contain elements not present in `left`: these are simply ignored.
+     */
+    difference(left, right) {
+        return left.filter(item => right.indexOf(item) === -1);
+    }
+    /**
+     * Returns a reference to the argument if the node exists in the tree. Otherwise, `undefined`.
+     */
+    validateNode(node) {
+        const result = this.tree.validateNode(node);
+        return tree_selection_1.SelectableTreeNode.is(result) ? result : undefined;
+    }
+    storeState() {
+        return {
+            selectionStack: this.state.selectionStack.map(s => ({
+                focus: s.focus && s.focus.id || undefined,
+                node: s.node && s.node.id || undefined,
+                type: s.type
+            }))
+        };
+    }
+    restoreState(state) {
+        const selectionStack = [];
+        for (const selection of state.selectionStack) {
+            const node = selection.node && this.tree.getNode(selection.node) || undefined;
+            if (!tree_selection_1.SelectableTreeNode.is(node)) {
+                break;
+            }
+            const focus = selection.focus && this.tree.getNode(selection.focus) || undefined;
+            selectionStack.push({
+                node,
+                focus: tree_selection_1.SelectableTreeNode.is(focus) && focus || undefined,
+                type: selection.type
+            });
+        }
+        if (selectionStack.length) {
+            this.transiteTo(new tree_selection_state_1.TreeSelectionState(this.tree, selectionStack));
+        }
+    }
+};
+exports.TreeSelectionServiceImpl = TreeSelectionServiceImpl;
+tslib_1.__decorate([
+    (0, inversify_1.inject)(tree_1.Tree),
+    tslib_1.__metadata("design:type", Object)
+], TreeSelectionServiceImpl.prototype, "tree", void 0);
+tslib_1.__decorate([
+    (0, inversify_1.inject)(tree_focus_service_1.TreeFocusService),
+    tslib_1.__metadata("design:type", Object)
+], TreeSelectionServiceImpl.prototype, "focusService", void 0);
+tslib_1.__decorate([
+    (0, inversify_1.postConstruct)(),
+    tslib_1.__metadata("design:type", Function),
+    tslib_1.__metadata("design:paramtypes", []),
+    tslib_1.__metadata("design:returntype", void 0)
+], TreeSelectionServiceImpl.prototype, "init", null);
+exports.TreeSelectionServiceImpl = TreeSelectionServiceImpl = tslib_1.__decorate([
+    (0, inversify_1.injectable)()
+], TreeSelectionServiceImpl);
+//# sourceMappingURL=tree-selection-impl.js.map

package/lib/browser/tree/tree-selection-impl.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selection-impl.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-selection-impl.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,yCAA8D;AAC9D,iCAAwC;AACxC,yCAA8C;AAC9C,iEAAoF;AACpF,qDAA2F;AAC3F,6DAAwD;AAGjD,IAAM,wBAAwB,GAA9B,MAAM,wBAAwB;IAA9B;QAKgB,8BAAyB,GAAG,IAAI,gBAAO,EAA+C,CAAC;IAwI9G,CAAC;IAnIa,IAAI;QACV,IAAI,CAAC,KAAK,GAAG,IAAI,yCAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACH,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,CAAC;IAC7C,CAAC;IAED,IAAI,aAAa;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,kBAAkB;QAClB,OAAO,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC;IAChD,CAAC;IAES,oBAAoB;QAC1B,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,YAAY,CAAC,mBAAiE;QAC1E,MAAM,SAAS,GAAG,CAAC,CAAC,GAAiD,EAAiB,EAAE;YACpF,MAAM,IAAI,GAAG,8BAAa,CAAC,aAAa,CAAC,OAAO,CAAC;YACjD,IAAI,8BAAa,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,OAAO;oBACH,IAAI;oBACJ,GAAG,GAAG;iBACT,CAAC;YACN,CAAC;YACD,OAAO;gBACH,IAAI;gBACJ,IAAI,EAAE,GAAG;aACZ,CAAC;QACN,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC;QAExB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,OAAO;QACX,CAAC;QACD,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QAEnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED,cAAc;QACV,IAAI,CAAC,UAAU,CAAC,IAAI,yCAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;IAES,UAAU,CAAC,QAA4B,EAAE,QAAQ,GAAG,IAAI;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QAEtC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAErD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,IAAI,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QACtB,IAAI,CAAC,oBAAoB,EAAE,CAAC;IAChC,CAAC;IAES,QAAQ,CAAC,KAAwC;QACvD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;IACjD,CAAC;IAES,MAAM,CAAC,KAAwC;QACrD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC;IAChD,CAAC;IAES,WAAW,CAAC,GAAG,KAA0C;QAC/D,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IAC9D,CAAC;IAES,QAAQ,CAAC,IAAoC;QACnD,IAAI,IAAI,EAAE,CAAC;YACP,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACO,UAAU,CAAI,IAAsB,EAAE,KAAuB;QACnE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACO,YAAY,CAAC,IAAwB;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC5C,OAAO,mCAAkB,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9D,CAAC;IAED,UAAU;QACN,OAAO;YACH,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAChD,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,SAAS;gBACzC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,SAAS;gBACtC,IAAI,EAAE,CAAC,CAAC,IAAI;aACf,CAAC,CAAC;SACN,CAAC;IACN,CAAC;IAED,YAAY,CAAC,KAAqC;QAC9C,MAAM,cAAc,GAA6B,EAAE,CAAC;QACpD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;YAC9E,IAAI,CAAC,mCAAkB,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,MAAM;YACV,CAAC;YACD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC;YACjF,cAAc,CAAC,IAAI,CAAC;gBAChB,IAAI;gBACJ,KAAK,EAAE,mCAAkB,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,SAAS;gBACzD,IAAI,EAAE,SAAS,CAAC,IAAI;aACvB,CAAC,CAAC;QACP,CAAC;QACD,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;YACxB,IAAI,CAAC,UAAU,CAAC,IAAI,yCAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC;QACvE,CAAC;IACL,CAAC;CAEJ,CAAA;AA7IY,4DAAwB;AAEA;IAAhC,IAAA,kBAAM,EAAC,WAAI,CAAC;;sDAA+B;AACC;IAA5C,IAAA,kBAAM,EAAC,qCAAgB,CAAC;;8DAAmD;AAOlE;IADT,IAAA,yBAAa,GAAE;;;;oDAGf;mCAZQ,wBAAwB;IADpC,IAAA,sBAAU,GAAE;GACA,wBAAwB,CA6IpC"}