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

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

@@ -1,66 +0,0 @@
-import { Emitter, Event, Disposable } from '../../common';
-import { CompositeTreeNode, TreeNode, Tree } from './tree';
-export declare const TreeExpansionService: unique symbol;
-/**
- * The tree expandable service.
- */
-export interface TreeExpansionService extends Disposable {
-    /**
-     * Emit when the node is expanded or collapsed.
-     */
-    readonly onExpansionChanged: Event<Readonly<ExpandableTreeNode>>;
-    /**
-     * Expand a node for the given node id if it is valid and collapsed.
-     * Expanding a node refreshes all its children.
-     *
-     * Return a valid expanded refreshed node or `undefined` if such does not exist.
-     */
-    expandNode(node: Readonly<ExpandableTreeNode>): Promise<Readonly<ExpandableTreeNode> | undefined>;
-    /**
-     * If the given node is valid and expanded then collapse it.
-     *
-     * Return true if a node has been collapsed; otherwise false.
-     */
-    collapseNode(node: Readonly<ExpandableTreeNode>): Promise<boolean>;
-    /**
-     * If the given node is valid then collapse it recursively.
-     *
-     * Return true if a node has been collapsed; otherwise false.
-     */
-    collapseAll(node: Readonly<CompositeTreeNode>): Promise<boolean>;
-    /**
-     * If the given node is invalid then does nothing.
-     * If the given node is collapsed then expand it; otherwise collapse it.
-     */
-    toggleNodeExpansion(node: Readonly<ExpandableTreeNode>): Promise<void>;
-}
-/**
- * The expandable tree node.
- */
-export interface ExpandableTreeNode extends CompositeTreeNode {
-    /**
-     * Test whether this tree node is expanded.
-     */
-    expanded: boolean;
-}
-export declare namespace ExpandableTreeNode {
-    function is(node: unknown): node is ExpandableTreeNode;
-    function isExpanded(node: unknown): node is ExpandableTreeNode;
-    function isCollapsed(node: unknown): node is ExpandableTreeNode;
-}
-export declare class TreeExpansionServiceImpl implements TreeExpansionService {
-    protected readonly tree: Tree;
-    protected readonly onExpansionChangedEmitter: Emitter<ExpandableTreeNode>;
-    protected init(): void;
-    dispose(): void;
-    get onExpansionChanged(): Event<ExpandableTreeNode>;
-    protected fireExpansionChanged(node: ExpandableTreeNode): void;
-    expandNode(raw: ExpandableTreeNode): Promise<ExpandableTreeNode | undefined>;
-    protected doExpandNode(node: ExpandableTreeNode): Promise<ExpandableTreeNode | undefined>;
-    collapseNode(raw: ExpandableTreeNode): Promise<boolean>;
-    collapseAll(raw: CompositeTreeNode): Promise<boolean>;
-    protected doCollapseAll(node: TreeNode | undefined): boolean;
-    protected doCollapseNode(node: TreeNode | undefined): boolean;
-    toggleNodeExpansion(node: ExpandableTreeNode): Promise<void>;
-}
-//# sourceMappingURL=tree-expansion.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-expansion.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-expansion.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE3D,eAAO,MAAM,oBAAoB,eAAiC,CAAC;AAEnE;;GAEG;AACH,MAAM,WAAW,oBAAqB,SAAQ,UAAU;IACpD;;OAEG;IACH,QAAQ,CAAC,kBAAkB,EAAE,KAAK,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACjE;;;;;OAKG;IACH,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC,CAAC;IAClG;;;;OAIG;IACH,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACnE;;;;OAIG;IACH,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACjE;;;OAGG;IACH,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1E;AAED;;GAEG;AACH,MAAM,WAAW,kBAAmB,SAAQ,iBAAiB;IACzD;;OAEG;IACH,QAAQ,EAAE,OAAO,CAAC;CACrB;AAED,yBAAiB,kBAAkB,CAAC;IAChC,SAAgB,EAAE,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,kBAAkB,CAE5D;IAED,SAAgB,UAAU,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,kBAAkB,CAEpE;IAED,SAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,kBAAkB,CAErE;CACJ;AAED,qBACa,wBAAyB,YAAW,oBAAoB;IAEnD,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAC5C,SAAS,CAAC,QAAQ,CAAC,yBAAyB,8BAAqC;IAGjF,SAAS,CAAC,IAAI,IAAI,IAAI;IAUtB,OAAO,IAAI,IAAI;IAIf,IAAI,kBAAkB,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAElD;IAED,SAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,kBAAkB,GAAG,IAAI;IAIxD,UAAU,CAAC,GAAG,EAAE,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,GAAG,SAAS,CAAC;cAQlE,YAAY,CAAC,IAAI,EAAE,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,GAAG,SAAS,CAAC;IAUzF,YAAY,CAAC,GAAG,EAAE,kBAAkB,GAAG,OAAO,CAAC,OAAO,CAAC;IAKvD,WAAW,CAAC,GAAG,EAAE,iBAAiB,GAAG,OAAO,CAAC,OAAO,CAAC;IAK3D,SAAS,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAU5D,SAAS,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IASvD,mBAAmB,CAAC,IAAI,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC;CAQrE"}

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

@@ -1,125 +0,0 @@
-"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.TreeExpansionServiceImpl = exports.ExpandableTreeNode = exports.TreeExpansionService = void 0;
-const tslib_1 = require("tslib");
-const inversify_1 = require("inversify");
-const common_1 = require("../../common");
-const tree_1 = require("./tree");
-exports.TreeExpansionService = Symbol('TreeExpansionService');
-var ExpandableTreeNode;
-(function (ExpandableTreeNode) {
-    function is(node) {
-        return !!node && tree_1.CompositeTreeNode.is(node) && 'expanded' in node;
-    }
-    ExpandableTreeNode.is = is;
-    function isExpanded(node) {
-        return ExpandableTreeNode.is(node) && node.expanded;
-    }
-    ExpandableTreeNode.isExpanded = isExpanded;
-    function isCollapsed(node) {
-        return ExpandableTreeNode.is(node) && !node.expanded;
-    }
-    ExpandableTreeNode.isCollapsed = isCollapsed;
-})(ExpandableTreeNode || (exports.ExpandableTreeNode = ExpandableTreeNode = {}));
-let TreeExpansionServiceImpl = class TreeExpansionServiceImpl {
-    constructor() {
-        this.onExpansionChangedEmitter = new common_1.Emitter();
-    }
-    init() {
-        this.tree.onNodeRefreshed(node => {
-            for (const child of node.children) {
-                if (ExpandableTreeNode.isExpanded(child)) {
-                    node.waitUntil(this.tree.refresh(child));
-                }
-            }
-        });
-    }
-    dispose() {
-        this.onExpansionChangedEmitter.dispose();
-    }
-    get onExpansionChanged() {
-        return this.onExpansionChangedEmitter.event;
-    }
-    fireExpansionChanged(node) {
-        this.onExpansionChangedEmitter.fire(node);
-    }
-    async expandNode(raw) {
-        const node = this.tree.validateNode(raw);
-        if (ExpandableTreeNode.isCollapsed(node)) {
-            return this.doExpandNode(node);
-        }
-        return undefined;
-    }
-    async doExpandNode(node) {
-        const refreshed = await this.tree.refresh(node);
-        if (ExpandableTreeNode.is(refreshed)) {
-            refreshed.expanded = true;
-            this.fireExpansionChanged(refreshed);
-            return refreshed;
-        }
-        return undefined;
-    }
-    async collapseNode(raw) {
-        const node = this.tree.validateNode(raw);
-        return this.doCollapseNode(node);
-    }
-    async collapseAll(raw) {
-        const node = this.tree.validateNode(raw);
-        return this.doCollapseAll(node);
-    }
-    doCollapseAll(node) {
-        let result = false;
-        if (tree_1.CompositeTreeNode.is(node)) {
-            for (const child of node.children) {
-                result = this.doCollapseAll(child) || result;
-            }
-        }
-        return this.doCollapseNode(node) || result;
-    }
-    doCollapseNode(node) {
-        if (!ExpandableTreeNode.isExpanded(node)) {
-            return false;
-        }
-        node.expanded = false;
-        this.fireExpansionChanged(node);
-        return true;
-    }
-    async toggleNodeExpansion(node) {
-        if (node.expanded) {
-            await this.collapseNode(node);
-        }
-        else {
-            await this.expandNode(node);
-        }
-    }
-};
-exports.TreeExpansionServiceImpl = TreeExpansionServiceImpl;
-tslib_1.__decorate([
-    (0, inversify_1.inject)(tree_1.Tree),
-    tslib_1.__metadata("design:type", Object)
-], TreeExpansionServiceImpl.prototype, "tree", 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)
-], TreeExpansionServiceImpl.prototype, "init", null);
-exports.TreeExpansionServiceImpl = TreeExpansionServiceImpl = tslib_1.__decorate([
-    (0, inversify_1.injectable)()
-], TreeExpansionServiceImpl);
-//# sourceMappingURL=tree-expansion.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-expansion.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-expansion.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,yCAA0D;AAC1D,iCAA2D;AAE9C,QAAA,oBAAoB,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC;AA8CnE,IAAiB,kBAAkB,CAYlC;AAZD,WAAiB,kBAAkB;IAC/B,SAAgB,EAAE,CAAC,IAAa;QAC5B,OAAO,CAAC,CAAC,IAAI,IAAI,wBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,UAAU,IAAI,IAAI,CAAC;IACtE,CAAC;IAFe,qBAAE,KAEjB,CAAA;IAED,SAAgB,UAAU,CAAC,IAAa;QACpC,OAAO,kBAAkB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;IACxD,CAAC;IAFe,6BAAU,aAEzB,CAAA;IAED,SAAgB,WAAW,CAAC,IAAa;QACrC,OAAO,kBAAkB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IACzD,CAAC;IAFe,8BAAW,cAE1B,CAAA;AACL,CAAC,EAZgB,kBAAkB,kCAAlB,kBAAkB,QAYlC;AAGM,IAAM,wBAAwB,GAA9B,MAAM,wBAAwB;IAA9B;QAGgB,8BAAyB,GAAG,IAAI,gBAAO,EAAsB,CAAC;IAgFrF,CAAC;IA7Ea,IAAI;QACV,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE;YAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,IAAI,kBAAkB,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;oBACvC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7C,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,OAAO;QACH,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,CAAC;IAC7C,CAAC;IAED,IAAI,kBAAkB;QAClB,OAAO,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC;IAChD,CAAC;IAES,oBAAoB,CAAC,IAAwB;QACnD,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,GAAuB;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAES,KAAK,CAAC,YAAY,CAAC,IAAwB;QACjD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,kBAAkB,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC1B,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,GAAuB;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAsB;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAES,aAAa,CAAC,IAA0B;QAC9C,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,wBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC;YACjD,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC;IAC/C,CAAC;IAES,cAAc,CAAC,IAA0B;QAC/C,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,IAAwB;QAC9C,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,MAAM,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;IACL,CAAC;CAEJ,CAAA;AAnFY,4DAAwB;AAEA;IAAhC,IAAA,kBAAM,EAAC,WAAI,CAAC;;sDAA+B;AAIlC;IADT,IAAA,yBAAa,GAAE;;;;oDASf;mCAdQ,wBAAwB;IADpC,IAAA,sBAAU,GAAE;GACA,wBAAwB,CAmFpC"}

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

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

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

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

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

@@ -1,156 +0,0 @@
-"use strict";
-// *****************************************************************************
-// Copyright (C) 2019 Thomas Drosdzoll.
-//
-// 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 chai_1 = require("chai");
-const mock_tree_model_1 = require("./test/mock-tree-model");
-const tree_model_1 = require("./tree-model");
-const tree_1 = require("./tree");
-const tree_test_container_1 = require("./test/tree-test-container");
-const promise_util_1 = require("../../common/promise-util");
-describe('TreeExpansionService', () => {
-    let model;
-    beforeEach(() => {
-        model = createTreeModel();
-        model.root = mock_tree_model_1.MockTreeModel.HIERARCHICAL_MOCK_ROOT();
-    });
-    describe('expandNode', () => {
-        it("won't expand an already expanded node", done => {
-            const node = retrieveNode('1');
-            model.expandNode(node).then(result => {
-                (0, chai_1.expect)(result).to.be.undefined;
-                done();
-            });
-        });
-        it('will expand a collapsed node', done => {
-            const node = retrieveNode('1');
-            model.collapseNode(node).then(() => {
-                model.expandNode(node).then(result => {
-                    (0, chai_1.expect)(result).to.be.eq(result);
-                    done();
-                });
-            });
-        });
-        it("won't expand an undefined node", done => {
-            model.expandNode(undefined).then(result => {
-                (0, chai_1.expect)(result).to.be.undefined;
-                done();
-            });
-        });
-    });
-    describe('collapseNode', () => {
-        it('will collapse an expanded node', done => {
-            const node = retrieveNode('1');
-            model.collapseNode(node).then(result => {
-                (0, chai_1.expect)(result).to.be.eq(result);
-                done();
-            });
-        });
-        it("won't collapse an already collapsed node", done => {
-            const node = retrieveNode('1');
-            model.collapseNode(node).then(() => {
-                model.collapseNode(node).then(result => {
-                    (0, chai_1.expect)(result).to.be.false;
-                    done();
-                });
-            });
-        });
-        it('cannot collapse a leaf node', done => {
-            const node = retrieveNode('1.1.2');
-            model.collapseNode(node).then(result => {
-                (0, chai_1.expect)(result).to.be.false;
-                done();
-            });
-        });
-    });
-    describe('collapseAll', () => {
-        it('will collapse all nodes recursively', done => {
-            model.collapseAll(retrieveNode('1')).then(result => {
-                (0, chai_1.expect)(result).to.be.eq(result);
-                done();
-            });
-        });
-        it("won't collapse nodes recursively if the root node is collapsed already", done => {
-            model.collapseNode(retrieveNode('1')).then(() => {
-                model.collapseAll(retrieveNode('1')).then(result => {
-                    (0, chai_1.expect)(result).to.be.eq(result);
-                    done();
-                });
-            });
-        });
-    });
-    describe('toggleNodeExpansion', () => {
-        it('changes the expansion state from expanded to collapsed', done => {
-            const node = retrieveNode('1');
-            model.onExpansionChanged((e) => {
-                (0, chai_1.expect)(e).to.be.equal(node);
-                (0, chai_1.expect)(e.expanded).to.be.false;
-            });
-            model.toggleNodeExpansion(node).then(() => {
-                done();
-            });
-        });
-        it('changes the expansion state from collapsed to expanded', done => {
-            const node = retrieveNode('1');
-            model.collapseNode(node).then(() => {
-            });
-            model.onExpansionChanged((e) => {
-                (0, chai_1.expect)(e).to.be.equal(node);
-                (0, chai_1.expect)(e.expanded).to.be.true;
-            });
-            model.toggleNodeExpansion(node).then(() => {
-                done();
-            });
-        });
-    });
-    it('node should be refreshed on expansion', async () => {
-        const container = (0, tree_test_container_1.createTreeTestContainer)();
-        container.rebind(tree_1.Tree).to(class extends tree_1.TreeImpl {
-            async resolveChildren(parent) {
-                await (0, promise_util_1.timeout)(200);
-                return [{
-                        id: 'child',
-                        parent
-                    }];
-            }
-        });
-        const root = {
-            id: 'parent',
-            parent: undefined,
-            children: [],
-            expanded: false
-        };
-        const treeModel = container.get(tree_model_1.TreeModel);
-        treeModel.root = root;
-        chai_1.assert.isFalse(root.expanded, 'before');
-        chai_1.assert.equal(root.children.length, 0, 'before');
-        const expanding = treeModel.expandNode(root);
-        chai_1.assert.isFalse(root.expanded, 'between');
-        chai_1.assert.equal(root.children.length, 0, 'between');
-        await expanding;
-        chai_1.assert.isTrue(root.expanded, 'after');
-        chai_1.assert.equal(root.children.length, 1, 'after');
-    });
-    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;
-    }
-});
-//# sourceMappingURL=tree-expansion.spec.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-expansion.spec.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-expansion.spec.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,uCAAuC;AACvC,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,+BAAsC;AACtC,4DAAuD;AACvD,6CAAyC;AACzC,iCAAqE;AAErE,oEAAqE;AACrE,4DAAoD;AAEpD,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IAClC,IAAI,KAAgB,CAAC;IACrB,UAAU,CAAC,GAAG,EAAE;QACZ,KAAK,GAAG,eAAe,EAAE,CAAC;QAC1B,KAAK,CAAC,IAAI,GAAG,+BAAa,CAAC,sBAAsB,EAAE,CAAC;IACxD,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,uCAAuC,EAAE,IAAI,CAAC,EAAE;YAC/C,MAAM,IAAI,GAAuB,YAAY,CAAqB,GAAG,CAAC,CAAC;YACvE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBACjC,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC/B,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,IAAI,CAAC,EAAE;YACtC,MAAM,IAAI,GAAuB,YAAY,CAAqB,GAAG,CAAC,CAAC;YACvE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;gBAC/B,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;oBACjC,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;oBAChC,IAAI,EAAE,CAAC;gBACX,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,IAAI,CAAC,EAAE;YACxC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBACtC,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC/B,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,gCAAgC,EAAE,IAAI,CAAC,EAAE;YACxC,MAAM,IAAI,GAAuB,YAAY,CAAqB,GAAG,CAAC,CAAC;YACvE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBACnC,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBAChC,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,IAAI,CAAC,EAAE;YAClD,MAAM,IAAI,GAAuB,YAAY,CAAqB,GAAG,CAAC,CAAC;YACvE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;gBAC/B,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;oBACnC,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;oBAC3B,IAAI,EAAE,CAAC;gBACX,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,IAAI,CAAC,EAAE;YACrC,MAAM,IAAI,GAAuB,YAAY,CAAqB,OAAO,CAAC,CAAC;YAC3E,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBACnC,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;gBAC3B,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,qCAAqC,EAAE,IAAI,CAAC,EAAE;YAC7C,KAAK,CAAC,WAAW,CAAC,YAAY,CAAoB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBAClE,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBAChC,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wEAAwE,EAAE,IAAI,CAAC,EAAE;YAChF,KAAK,CAAC,YAAY,CAAC,YAAY,CAAqB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;gBAChE,KAAK,CAAC,WAAW,CAAC,YAAY,CAAoB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;oBAClE,IAAA,aAAM,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;oBAChC,IAAI,EAAE,CAAC;gBACX,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,wDAAwD,EAAE,IAAI,CAAC,EAAE;YAChE,MAAM,IAAI,GAAG,YAAY,CAAqB,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,kBAAkB,CAAC,CAAC,CAA+B,EAAE,EAAE;gBACzD,IAAA,aAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAA,aAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACnC,CAAC,CAAC,CAAC;YACH,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;gBACtC,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,IAAI,CAAC,EAAE;YAChE,MAAM,IAAI,GAAG,YAAY,CAAqB,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;YACnC,CAAC,CAAC,CAAC;YACH,KAAK,CAAC,kBAAkB,CAAC,CAAC,CAA+B,EAAE,EAAE;gBACzD,IAAA,aAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAA,aAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAClC,CAAC,CAAC,CAAC;YACH,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;gBACtC,IAAI,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;QACnD,MAAM,SAAS,GAAG,IAAA,6CAAuB,GAAE,CAAC;QAC5C,SAAS,CAAC,MAAM,CAAC,WAAI,CAAC,CAAC,EAAE,CAAC,KAAM,SAAQ,eAAQ;YAEzB,KAAK,CAAC,eAAe,CAAC,MAAyB;gBAC9D,MAAM,IAAA,sBAAO,EAAC,GAAG,CAAC,CAAC;gBACnB,OAAO,CAAC;wBACJ,EAAE,EAAE,OAAO;wBACX,MAAM;qBACT,CAAC,CAAC;YACP,CAAC;SAEJ,CAAC,CAAC;QACH,MAAM,IAAI,GAAuB;YAC7B,EAAE,EAAE,QAAQ;YACZ,MAAM,EAAE,SAAS;YACjB,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,KAAK;SAClB,CAAC;QAEF,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAY,sBAAS,CAAC,CAAC;QACtD,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC;QAEtB,aAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACxC,aAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAEhD,MAAM,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC7C,aAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACzC,aAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAEjD,MAAM,SAAS,CAAC;QAChB,aAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACtC,aAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,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;AACL,CAAC,CAAC,CAAC"}

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

@@ -1,20 +0,0 @@
-import { Emitter, Event } from '../../common';
-import { Tree, TreeNode } from './tree';
-import { SelectableTreeNode } from './tree-selection';
-export interface TreeFocusService {
-    readonly focusedNode: SelectableTreeNode | undefined;
-    readonly onDidChangeFocus: Event<SelectableTreeNode | undefined>;
-    setFocus(node?: SelectableTreeNode): void;
-    hasFocus(node?: TreeNode): boolean;
-}
-export declare const TreeFocusService: unique symbol;
-export declare class TreeFocusServiceImpl implements TreeFocusService {
-    protected focusedId: string | undefined;
-    protected onDidChangeFocusEmitter: Emitter<SelectableTreeNode | undefined>;
-    get onDidChangeFocus(): Event<SelectableTreeNode | undefined>;
-    protected readonly tree: Tree;
-    get focusedNode(): SelectableTreeNode | undefined;
-    setFocus(node?: SelectableTreeNode): void;
-    hasFocus(node?: TreeNode): boolean;
-}
-//# sourceMappingURL=tree-focus-service.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-focus-service.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-focus-service.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAEtD,MAAM,WAAW,gBAAgB;IAC7B,QAAQ,CAAC,WAAW,EAAE,kBAAkB,GAAG,SAAS,CAAC;IACrD,QAAQ,CAAC,gBAAgB,EAAE,KAAK,CAAC,kBAAkB,GAAG,SAAS,CAAC,CAAC;IACjE,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,GAAG,IAAI,CAAC;IAC1C,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC;CACtC;AACD,eAAO,MAAM,gBAAgB,eAA6B,CAAC;AAE3D,qBACa,oBAAqB,YAAW,gBAAgB;IACzD,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IACxC,SAAS,CAAC,uBAAuB,0CAAiD;IAClF,IAAI,gBAAgB,IAAI,KAAK,CAAC,kBAAkB,GAAG,SAAS,CAAC,CAA+C;IAE9F,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAE5C,IAAI,WAAW,IAAI,kBAAkB,GAAG,SAAS,CAKhD;IAED,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,GAAG,IAAI;IAOzC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,OAAO;CAGrC"}

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

@@ -1,54 +0,0 @@
-"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.TreeFocusServiceImpl = exports.TreeFocusService = void 0;
-const tslib_1 = require("tslib");
-const inversify_1 = require("inversify");
-const common_1 = require("../../common");
-const tree_1 = require("./tree");
-const tree_selection_1 = require("./tree-selection");
-exports.TreeFocusService = Symbol('TreeFocusService');
-let TreeFocusServiceImpl = class TreeFocusServiceImpl {
-    constructor() {
-        this.onDidChangeFocusEmitter = new common_1.Emitter();
-    }
-    get onDidChangeFocus() { return this.onDidChangeFocusEmitter.event; }
-    get focusedNode() {
-        const candidate = this.tree.getNode(this.focusedId);
-        if (tree_selection_1.SelectableTreeNode.is(candidate)) {
-            return candidate;
-        }
-    }
-    setFocus(node) {
-        if ((node === null || node === void 0 ? void 0 : node.id) !== this.focusedId) {
-            this.focusedId = node === null || node === void 0 ? void 0 : node.id;
-            this.onDidChangeFocusEmitter.fire(node);
-        }
-    }
-    hasFocus(node) {
-        return !!node && (node === null || node === void 0 ? void 0 : node.id) === this.focusedId;
-    }
-};
-exports.TreeFocusServiceImpl = TreeFocusServiceImpl;
-tslib_1.__decorate([
-    (0, inversify_1.inject)(tree_1.Tree),
-    tslib_1.__metadata("design:type", Object)
-], TreeFocusServiceImpl.prototype, "tree", void 0);
-exports.TreeFocusServiceImpl = TreeFocusServiceImpl = tslib_1.__decorate([
-    (0, inversify_1.injectable)()
-], TreeFocusServiceImpl);
-//# sourceMappingURL=tree-focus-service.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-focus-service.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-focus-service.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,yCAA+C;AAC/C,yCAA8C;AAC9C,iCAAwC;AACxC,qDAAsD;AAQzC,QAAA,gBAAgB,GAAG,MAAM,CAAC,kBAAkB,CAAC,CAAC;AAGpD,IAAM,oBAAoB,GAA1B,MAAM,oBAAoB;IAA1B;QAEO,4BAAuB,GAAG,IAAI,gBAAO,EAAkC,CAAC;IAsBtF,CAAC;IArBG,IAAI,gBAAgB,KAA4C,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC;IAI5G,IAAI,WAAW;QACX,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,mCAAkB,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,OAAO,SAAS,CAAC;QACrB,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAyB;QAC9B,IAAI,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,MAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAe;QACpB,OAAO,CAAC,CAAC,IAAI,IAAI,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,MAAK,IAAI,CAAC,SAAS,CAAC;IACjD,CAAC;CACJ,CAAA;AAxBY,oDAAoB;AAKI;IAAhC,IAAA,kBAAM,EAAC,WAAI,CAAC;;kDAA+B;+BALnC,oBAAoB;IADhC,IAAA,sBAAU,GAAE;GACA,oBAAoB,CAwBhC"}

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

@@ -1,95 +0,0 @@
-import { TreeNode } from './tree';
-export interface TreeIterator extends Iterator<TreeNode> {
-}
-export declare namespace TreeIterator {
-    interface Options {
-        readonly pruneCollapsed: boolean;
-        readonly pruneSiblings: boolean;
-    }
-    const DEFAULT_OPTIONS: Options;
-}
-export declare abstract class AbstractTreeIterator implements TreeIterator, Iterable<TreeNode> {
-    protected readonly root: TreeNode;
-    protected readonly delegate: IterableIterator<TreeNode>;
-    protected readonly options: TreeIterator.Options;
-    constructor(root: TreeNode, options?: Partial<TreeIterator.Options>);
-    [Symbol.iterator](): IterableIterator<TreeNode>;
-    next(): IteratorResult<TreeNode>;
-    protected abstract iterator(node: TreeNode): IterableIterator<TreeNode>;
-    protected children(node: TreeNode): TreeNode[] | undefined;
-    protected isCollapsed(node: TreeNode): boolean;
-    protected isEmpty(nodes: TreeNode[] | undefined): boolean;
-}
-export declare class DepthFirstTreeIterator extends AbstractTreeIterator {
-    protected iterator(root: TreeNode): IterableIterator<TreeNode>;
-}
-export declare class BreadthFirstTreeIterator extends AbstractTreeIterator {
-    protected iterator(root: TreeNode): IterableIterator<TreeNode>;
-}
-/**
- * This tree iterator visits all nodes from top to bottom considering the following rules.
- *
- * Let assume the following tree:
- * ```
- *   R
- *   |
- *   +---1
- *   |   |
- *   |   +---1.1
- *   |   |
- *   |   +---1.2
- *   |   |
- *   |   +---1.3
- *   |   |    |
- *   |   |    +---1.3.1
- *   |   |    |
- *   |   |    +---1.3.2
- *   |   |
- *   |   +---1.4
- *   |
- *   +---2
- *       |
- *       +---2.1
- * ```
- * When selecting `1.2` as the root, the normal `DepthFirstTreeIterator` would stop on `1.2` as it does not have children,
- * but this iterator will visit the next sibling (`1.3` and `1.4` but **not** `1.1`) nodes. So the expected traversal order will be
- * `1.2`, `1.3`, `1.3.1`, `1.3.2`,  and `1.4` then jumps to `2` and continues with `2.1`.
- */
-export declare class TopDownTreeIterator extends AbstractTreeIterator {
-    protected iterator(root: TreeNode): IterableIterator<TreeNode>;
-    protected doNext(node: TreeNode): TreeNode | undefined;
-    protected findFirstChild(node: TreeNode): TreeNode | undefined;
-    protected findNextSibling(node: TreeNode | undefined): TreeNode | undefined;
-}
-/**
- * Unlike other tree iterators, this does not visit all the nodes, it stops once it reaches the root node
- * while traversing up the tree hierarchy in an inverse pre-order fashion. This is the counterpart of the `TopDownTreeIterator`.
- */
-export declare class BottomUpTreeIterator extends AbstractTreeIterator {
-    protected iterator(root: TreeNode): IterableIterator<TreeNode>;
-    protected doNext(node: TreeNode): TreeNode | undefined;
-    protected lastChild(node: TreeNode | undefined): TreeNode | undefined;
-}
-export declare namespace Iterators {
-    /**
-     * Generator for depth first, pre-order tree traversal iteration.
-     */
-    function depthFirst<T>(root: T, children: (node: T) => T[] | undefined, include?: (node: T) => boolean): IterableIterator<T>;
-    /**
-     * Generator for breadth first tree traversal iteration.
-     */
-    function breadthFirst<T>(root: T, children: (node: T) => T[] | undefined, include?: (node: T) => boolean): IterableIterator<T>;
-    /**
-     * Returns with the iterator of the argument.
-     */
-    function asIterator<T>(elements: ReadonlyArray<T>): IterableIterator<T>;
-    /**
-     * Returns an iterator that cycles indefinitely over the elements of iterable.
-     *  - If `start` is given it starts the iteration from that element. Otherwise, it starts with the first element of the array.
-     *  - If `start` is given, it must contain by the `elements` array. Otherwise, an error will be thrown.
-     *
-     * **Warning**: Typical uses of the resulting iterator may produce an infinite loop. You should use an explicit break.
-     */
-    function cycle<T>(elements: ReadonlyArray<T>, start?: T): IterableIterator<T>;
-}
-//# sourceMappingURL=tree-iterator.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-iterator.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-iterator.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,QAAQ,EAAqB,MAAM,QAAQ,CAAC;AAGrD,MAAM,WAAW,YAAa,SAAQ,QAAQ,CAAC,QAAQ,CAAC;CACvD;AAED,yBAAiB,YAAY,CAAC;IAE1B,UAAiB,OAAO;QACpB,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAA;QAChC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAA;KAClC;IAEM,MAAM,eAAe,EAAE,OAG7B,CAAC;CAEL;AAED,8BAAsB,oBAAqB,YAAW,YAAY,EAAE,QAAQ,CAAC,QAAQ,CAAC;IAKtE,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ;IAH7C,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACxD,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC;gBAElB,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC;IAStF,CAAC,MAAM,CAAC,QAAQ,CAAC;IAIjB,IAAI,IAAI,cAAc,CAAC,QAAQ,CAAC;IAIhC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC;IAEvE,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS;IAU1D,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAI9C,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,SAAS,GAAG,OAAO;CAI5D;AAED,qBAAa,sBAAuB,SAAQ,oBAAoB;IAE5D,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC;CAIjE;AAED,qBAAa,wBAAyB,SAAQ,oBAAoB;IAE9D,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC;CAIjE;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,qBAAa,mBAAoB,SAAQ,oBAAoB;IAEzD,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC;IAW9D,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAItD,SAAS,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAI9D,SAAS,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS;CAa9E;AAED;;;GAGG;AACH,qBAAa,oBAAqB,SAAQ,oBAAoB;IAE1D,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC;IAW9D,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAMtD,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS;CAYxE;AAED,yBAAiB,SAAS,CAAC;IAEvB;;OAEG;IACH,SAAiB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,EAAE,OAAO,GAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAoB,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAQ/I;IAED;;OAEG;IACH,SAAiB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,EAAE,OAAO,GAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAoB,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAQjJ;IAED;;OAEG;IACH,SAAgB,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAE7E;IAED;;;;;;OAMG;IACH,SAAiB,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAapF;CAEJ"}