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

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

@@ -0,0 +1,224 @@
+"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.Iterators = exports.BottomUpTreeIterator = exports.TopDownTreeIterator = exports.BreadthFirstTreeIterator = exports.DepthFirstTreeIterator = exports.AbstractTreeIterator = exports.TreeIterator = void 0;
+const tree_1 = require("./tree");
+const tree_expansion_1 = require("./tree-expansion");
+var TreeIterator;
+(function (TreeIterator) {
+    TreeIterator.DEFAULT_OPTIONS = {
+        pruneCollapsed: false,
+        pruneSiblings: false
+    };
+})(TreeIterator || (exports.TreeIterator = TreeIterator = {}));
+class AbstractTreeIterator {
+    constructor(root, options) {
+        this.root = root;
+        this.options = {
+            ...TreeIterator.DEFAULT_OPTIONS,
+            ...options
+        };
+        this.delegate = this.iterator(this.root);
+    }
+    // tslint:disable-next-line:typedef
+    [Symbol.iterator]() {
+        return this.delegate;
+    }
+    next() {
+        return this.delegate.next();
+    }
+    children(node) {
+        if (!tree_1.CompositeTreeNode.is(node)) {
+            return undefined;
+        }
+        if (this.options.pruneCollapsed && this.isCollapsed(node)) {
+            return undefined;
+        }
+        return node.children.slice();
+    }
+    isCollapsed(node) {
+        return tree_expansion_1.ExpandableTreeNode.isCollapsed(node);
+    }
+    isEmpty(nodes) {
+        return nodes === undefined || nodes.length === 0;
+    }
+}
+exports.AbstractTreeIterator = AbstractTreeIterator;
+class DepthFirstTreeIterator extends AbstractTreeIterator {
+    iterator(root) {
+        return Iterators.depthFirst(root, this.children.bind(this));
+    }
+}
+exports.DepthFirstTreeIterator = DepthFirstTreeIterator;
+class BreadthFirstTreeIterator extends AbstractTreeIterator {
+    iterator(root) {
+        return Iterators.breadthFirst(root, this.children.bind(this));
+    }
+}
+exports.BreadthFirstTreeIterator = BreadthFirstTreeIterator;
+/**
+ * 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`.
+ */
+class TopDownTreeIterator extends AbstractTreeIterator {
+    iterator(root) {
+        const doNext = this.doNext.bind(this);
+        return (function* () {
+            let next = root;
+            while (next) {
+                yield next;
+                next = doNext(next);
+            }
+        }).bind(this)();
+    }
+    doNext(node) {
+        return this.findFirstChild(node) || this.findNextSibling(node);
+    }
+    findFirstChild(node) {
+        return (this.children(node) || [])[0];
+    }
+    findNextSibling(node) {
+        if (!node) {
+            return undefined;
+        }
+        if (this.options.pruneSiblings && node === this.root) {
+            return undefined;
+        }
+        if (node.nextSibling) {
+            return node.nextSibling;
+        }
+        return this.findNextSibling(node.parent);
+    }
+}
+exports.TopDownTreeIterator = TopDownTreeIterator;
+/**
+ * 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`.
+ */
+class BottomUpTreeIterator extends AbstractTreeIterator {
+    iterator(root) {
+        const doNext = this.doNext.bind(this);
+        return (function* () {
+            let next = root;
+            while (next) {
+                yield next;
+                next = doNext(next);
+            }
+        }).bind(this)();
+    }
+    doNext(node) {
+        const previousSibling = node.previousSibling;
+        const lastChild = this.lastChild(previousSibling);
+        return lastChild || node.parent;
+    }
+    lastChild(node) {
+        const children = node ? this.children(node) : [];
+        if (this.isEmpty(children)) {
+            return node;
+        }
+        if (tree_1.CompositeTreeNode.is(node)) {
+            const lastChild = tree_1.CompositeTreeNode.getLastChild(node);
+            return this.lastChild(lastChild);
+        }
+        return undefined;
+    }
+}
+exports.BottomUpTreeIterator = BottomUpTreeIterator;
+var Iterators;
+(function (Iterators) {
+    /**
+     * Generator for depth first, pre-order tree traversal iteration.
+     */
+    function* depthFirst(root, children, include = () => true) {
+        let stack = [];
+        stack.push(root);
+        while (stack.length > 0) {
+            const top = stack.pop();
+            yield top;
+            stack = stack.concat((children(top) || []).filter(include).reverse());
+        }
+    }
+    Iterators.depthFirst = depthFirst;
+    /**
+     * Generator for breadth first tree traversal iteration.
+     */
+    function* breadthFirst(root, children, include = () => true) {
+        let queue = [];
+        queue.push(root);
+        while (queue.length > 0) {
+            const head = queue.shift();
+            yield head;
+            queue = queue.concat((children(head) || []).filter(include));
+        }
+    }
+    Iterators.breadthFirst = breadthFirst;
+    /**
+     * Returns with the iterator of the argument.
+     */
+    function asIterator(elements) {
+        return elements.slice()[Symbol.iterator]();
+    }
+    Iterators.asIterator = asIterator;
+    /**
+     * 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(elements, start) {
+        const copy = elements.slice();
+        let index = !!start ? copy.indexOf(start) : 0;
+        if (index === -1) {
+            throw new Error(`${start} is not contained in ${copy}.`);
+        }
+        while (true) {
+            yield copy[index];
+            index++;
+            if (index === copy.length) {
+                index = 0;
+            }
+        }
+    }
+    Iterators.cycle = cycle;
+})(Iterators || (exports.Iterators = Iterators = {}));
+//# sourceMappingURL=tree-iterator.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tree-iterator.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-iterator.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,iCAAqD;AACrD,qDAAsD;AAKtD,IAAiB,YAAY,CAY5B;AAZD,WAAiB,YAAY;IAOZ,4BAAe,GAAY;QACpC,cAAc,EAAE,KAAK;QACrB,aAAa,EAAE,KAAK;KACvB,CAAC;AAEN,CAAC,EAZgB,YAAY,4BAAZ,YAAY,QAY5B;AAED,MAAsB,oBAAoB;IAKtC,YAA+B,IAAc,EAAE,OAAuC;QAAvD,SAAI,GAAJ,IAAI,CAAU;QACzC,IAAI,CAAC,OAAO,GAAG;YACX,GAAG,YAAY,CAAC,eAAe;YAC/B,GAAG,OAAO;SACb,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED,mCAAmC;IACnC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IAChC,CAAC;IAIS,QAAQ,CAAC,IAAc;QAC7B,IAAI,CAAC,wBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACxD,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAES,WAAW,CAAC,IAAc;QAChC,OAAO,mCAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IAES,OAAO,CAAC,KAA6B;QAC3C,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACrD,CAAC;CAEJ;AA1CD,oDA0CC;AAED,MAAa,sBAAuB,SAAQ,oBAAoB;IAElD,QAAQ,CAAC,IAAc;QAC7B,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAChE,CAAC;CAEJ;AAND,wDAMC;AAED,MAAa,wBAAyB,SAAQ,oBAAoB;IAEpD,QAAQ,CAAC,IAAc;QAC7B,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,CAAC;CAEJ;AAND,4DAMC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAa,mBAAoB,SAAQ,oBAAoB;IAE/C,QAAQ,CAAC,IAAc;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO,CAAC,QAAQ,CAAC;YACb,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,OAAO,IAAI,EAAE,CAAC;gBACV,MAAM,IAAI,CAAC;gBACX,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACL,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACpB,CAAC;IAES,MAAM,CAAC,IAAc;QAC3B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IAES,cAAc,CAAC,IAAc;QACnC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAES,eAAe,CAAC,IAA0B;QAChD,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACnD,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,WAAW,CAAC;QAC5B,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;CAEJ;AAlCD,kDAkCC;AAED;;;GAGG;AACH,MAAa,oBAAqB,SAAQ,oBAAoB;IAEhD,QAAQ,CAAC,IAAc;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO,CAAC,QAAQ,CAAC;YACb,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,OAAO,IAAI,EAAE,CAAC;gBACV,MAAM,IAAI,CAAC;gBACX,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACL,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACpB,CAAC;IAES,MAAM,CAAC,IAAc;QAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;QAClD,OAAO,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;IACpC,CAAC;IAES,SAAS,CAAC,IAA0B;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,wBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,wBAAiB,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;CAEJ;AA/BD,oDA+BC;AAED,IAAiB,SAAS,CAyDzB;AAzDD,WAAiB,SAAS;IAEtB;;OAEG;IACH,QAAe,CAAC,CAAC,UAAU,CAAI,IAAO,EAAE,QAAsC,EAAE,UAAgC,GAAG,EAAE,CAAC,IAAI;QACtH,IAAI,KAAK,GAAQ,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACzB,MAAM,GAAG,CAAC;YACV,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1E,CAAC;IACL,CAAC;IARgB,oBAAU,aAQ1B,CAAA;IAED;;OAEG;IACH,QAAe,CAAC,CAAC,YAAY,CAAI,IAAO,EAAE,QAAsC,EAAE,UAAgC,GAAG,EAAE,CAAC,IAAI;QACxH,IAAI,KAAK,GAAQ,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,MAAM,IAAI,CAAC;YACX,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QACjE,CAAC;IACL,CAAC;IARgB,sBAAY,eAQ5B,CAAA;IAED;;OAEG;IACH,SAAgB,UAAU,CAAI,QAA0B;QACpD,OAAO,QAAQ,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC/C,CAAC;IAFe,oBAAU,aAEzB,CAAA;IAED;;;;;;OAMG;IACH,QAAe,CAAC,CAAC,KAAK,CAAI,QAA0B,EAAE,KAAS;QAC3D,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,wBAAwB,IAAI,GAAG,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACxB,KAAK,GAAG,CAAC,CAAC;YACd,CAAC;QACL,CAAC;IACL,CAAC;IAbgB,eAAK,QAarB,CAAA;AAEL,CAAC,EAzDgB,SAAS,yBAAT,SAAS,QAyDzB"}

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

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

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

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

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

@@ -0,0 +1,151 @@
+"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 chai_1 = require("chai");
+const objects_1 = require("../../common/objects");
+const mock_tree_model_1 = require("./test/mock-tree-model");
+const tree_model_1 = require("./tree-model");
+const tree_iterator_1 = require("./tree-iterator");
+const tree_test_container_1 = require("./test/tree-test-container");
+const tree_expansion_1 = require("./tree-expansion");
+describe('tree-iterator', () => {
+    const model = createTreeModel();
+    const findNode = (id) => model.getNode(id);
+    beforeEach(() => {
+        model.root = mock_tree_model_1.MockTreeModel.HIERARCHICAL_MOCK_ROOT();
+    });
+    it('should include root', () => {
+        const expected = ['1'];
+        const actual = [...new tree_iterator_1.BottomUpTreeIterator(findNode('1'))].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('should return `undefined` after consuming the iterator', () => {
+        const itr = new tree_iterator_1.BottomUpTreeIterator(findNode('1'));
+        let next = itr.next();
+        while (!next.done) {
+            (0, chai_1.expect)(next.value).to.be.not.undefined;
+            next = itr.next();
+        }
+        (0, chai_1.expect)(next.done).to.be.true;
+        (0, chai_1.expect)(next.value).to.be.undefined;
+    });
+    it('depth-first (no collapsed nodes)', () => {
+        const expected = ['1', '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 actual = [...new tree_iterator_1.DepthFirstTreeIterator(model.root)].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('depth-first (with collapsed nodes)', () => {
+        collapseNode('1.1', '1.2.1');
+        const expected = ['1', '1.1', '1.2', '1.2.1', '1.2.2', '1.2.3', '1.3'];
+        const actual = [...new tree_iterator_1.DepthFirstTreeIterator(model.root, { pruneCollapsed: true })].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('breadth-first (no collapsed nodes)', () => {
+        const expected = ['1', '1.1', '1.2', '1.3', '1.1.1', '1.1.2', '1.2.1', '1.2.2', '1.2.3', '1.2.1.1', '1.2.1.2'];
+        const actual = [...new tree_iterator_1.BreadthFirstTreeIterator(model.root)].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('breadth-first (with collapsed nodes)', () => {
+        collapseNode('1.1', '1.2.1');
+        const expected = ['1', '1.1', '1.2', '1.3', '1.2.1', '1.2.2', '1.2.3'];
+        const actual = [...new tree_iterator_1.BreadthFirstTreeIterator(model.root, { pruneCollapsed: true })].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('bottom-up (no collapsed nodes)', () => {
+        const expected = ['1.2.2', '1.2.1.2', '1.2.1.1', '1.2.1', '1.2', '1.1.2', '1.1.1', '1.1', '1'];
+        const actual = [...new tree_iterator_1.BottomUpTreeIterator(findNode('1.2.2'))].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('bottom-up (with collapsed nodes)', () => {
+        collapseNode('1.1', '1.2.1');
+        const expected = ['1.2.2', '1.2.1', '1.2', '1.1', '1'];
+        const actual = [...new tree_iterator_1.BottomUpTreeIterator(findNode('1.2.2'), { pruneCollapsed: true })].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('top-down (no collapsed nodes)', () => {
+        const expected = ['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 actual = [...new tree_iterator_1.TopDownTreeIterator(findNode('1.1.2'))].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    it('top-down (with collapsed nodes)', () => {
+        collapseNode('1.2.1');
+        const expected = ['1.1.2', '1.2', '1.2.1', '1.2.2', '1.2.3', '1.3'];
+        const actual = [...new tree_iterator_1.TopDownTreeIterator(findNode('1.1.2'), { pruneCollapsed: true })].map(node => node.id);
+        (0, chai_1.expect)(expected).to.be.deep.equal(actual);
+    });
+    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);
+        });
+    }
+    function createTreeModel() {
+        return (0, tree_test_container_1.createTreeTestContainer)().get(tree_model_1.TreeModel);
+    }
+});
+describe('iterators', () => {
+    it('as-iterator', () => {
+        const array = [1, 2, 3, 4];
+        const itr = tree_iterator_1.Iterators.asIterator(array);
+        let next = itr.next();
+        while (!next.done) {
+            const { value } = next;
+            (0, chai_1.expect)(value).to.be.not.undefined;
+            const index = array.indexOf(value);
+            (0, chai_1.expect)(index).to.be.not.equal(-1);
+            array.splice(index, 1);
+            next = itr.next();
+        }
+        (0, chai_1.expect)(array).to.be.empty;
+    });
+    it('cycle - without start', function () {
+        this.timeout(1000);
+        const array = [1, 2, 3, 4];
+        const itr = tree_iterator_1.Iterators.cycle(array);
+        const visitedItems = new Set();
+        let next = itr.next();
+        while (!next.done) {
+            const { value } = next;
+            (0, chai_1.expect)(value).to.be.not.undefined;
+            if (visitedItems.has(value)) {
+                (0, chai_1.expect)(Array.from(visitedItems).sort()).to.be.deep.equal(array.sort());
+                break;
+            }
+            visitedItems.add(value);
+            next = itr.next();
+        }
+    });
+    it('cycle - with start', function () {
+        this.timeout(1000);
+        const array = [1, 2, 3, 4];
+        const itr = tree_iterator_1.Iterators.cycle(array, 2);
+        const visitedItems = new Set();
+        let next = itr.next();
+        (0, chai_1.expect)(next.value).to.be.equal(2);
+        while (!next.done) {
+            const { value } = next;
+            (0, chai_1.expect)(value).to.be.not.undefined;
+            if (visitedItems.has(value)) {
+                (0, chai_1.expect)(Array.from(visitedItems).sort()).to.be.deep.equal(array.sort());
+                break;
+            }
+            visitedItems.add(value);
+            next = itr.next();
+        }
+    });
+});
+//# sourceMappingURL=tree-iterator.spec.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tree-iterator.spec.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-iterator.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,+BAA8B;AAC9B,kDAAgD;AAChD,4DAAuD;AACvD,6CAAyC;AACzC,mDAAyI;AACzI,oEAAqE;AACrE,qDAAsD;AAEtD,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAE3B,MAAM,KAAK,GAAG,eAAe,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAEnD,UAAU,CAAC,GAAG,EAAE;QACZ,KAAK,CAAC,IAAI,GAAG,+BAAa,CAAC,sBAAsB,EAAE,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC3B,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,oCAAoB,CAAC,QAAQ,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClF,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAI,oCAAoB,CAAC,QAAQ,CAAC,GAAG,CAAE,CAAC,CAAC;QACrD,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAChB,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;YACvC,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,CAAC;QACD,IAAA,aAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAC7B,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC/G,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,sCAAsB,CAAC,KAAK,CAAC,IAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjF,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC1C,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,sCAAsB,CAAC,KAAK,CAAC,IAAK,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3G,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC1C,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAC/G,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,wCAAwB,CAAC,KAAK,CAAC,IAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnF,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC5C,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,wCAAwB,CAAC,KAAK,CAAC,IAAK,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7G,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACtC,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAC/F,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,oCAAoB,CAAC,QAAQ,CAAC,OAAO,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtF,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QACxC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,oCAAoB,CAAC,QAAQ,CAAC,OAAO,CAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChH,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACrC,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,mCAAmB,CAAC,QAAQ,CAAC,OAAO,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrF,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACvC,YAAY,CAAC,OAAO,CAAC,CAAC;QACtB,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,mCAAmB,CAAC,QAAQ,CAAC,OAAO,CAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/G,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,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;IAED,SAAS,eAAe;QACpB,OAAO,IAAA,6CAAuB,GAAE,CAAC,GAAG,CAAC,sBAAS,CAAC,CAAC;IACpD,CAAC;AAEL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IAEvB,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACnB,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,yBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAChB,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;YACvB,IAAA,aAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACnC,IAAA,aAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,CAAC;QACD,IAAA,aAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,yBAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAChB,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;YACvB,IAAA,aAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;YAClC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAA,aAAM,EAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;gBACvE,MAAM;YACV,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE;QACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,yBAAS,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAChB,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;YACvB,IAAA,aAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;YAClC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAA,aAAM,EAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;gBACvE,MAAM;YACV,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACtB,CAAC;IACL,CAAC,CAAC,CAAC;AAEP,CAAC,CAAC,CAAC"}

package/lib/browser/tree/tree-label-provider.d.ts

@@ -0,0 +1,9 @@
+import { LabelProviderContribution } from '../label-provider';
+import { TreeNode } from './tree';
+export declare class TreeLabelProvider implements LabelProviderContribution {
+    canHandle(element: object): number;
+    getIcon(node: TreeNode): string | undefined;
+    getName(node: TreeNode): string | undefined;
+    getLongName(node: TreeNode): string | undefined;
+}
+//# sourceMappingURL=tree-label-provider.d.ts.map

package/lib/browser/tree/tree-label-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-label-provider.d.ts","sourceRoot":"","sources":["../../../src/browser/tree/tree-label-provider.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAElC,qBACa,iBAAkB,YAAW,yBAAyB;IAE/D,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAIlC,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS;IAI3C,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS;IAI3C,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS;CAIlD"}

package/lib/browser/tree/tree-label-provider.js

@@ -0,0 +1,40 @@
+"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 });
+exports.TreeLabelProvider = void 0;
+const tslib_1 = require("tslib");
+const inversify_1 = require("inversify");
+const tree_1 = require("./tree");
+let TreeLabelProvider = class TreeLabelProvider {
+    canHandle(element) {
+        return tree_1.TreeNode.is(element) ? 50 : 0;
+    }
+    getIcon(node) {
+        return node.icon;
+    }
+    getName(node) {
+        return node.name;
+    }
+    getLongName(node) {
+        return node.description;
+    }
+};
+exports.TreeLabelProvider = TreeLabelProvider;
+exports.TreeLabelProvider = TreeLabelProvider = tslib_1.__decorate([
+    (0, inversify_1.injectable)()
+], TreeLabelProvider);
+//# sourceMappingURL=tree-label-provider.js.map

package/lib/browser/tree/tree-label-provider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-label-provider.js","sourceRoot":"","sources":["../../../src/browser/tree/tree-label-provider.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;AAEvC,iCAAkC;AAG3B,IAAM,iBAAiB,GAAvB,MAAM,iBAAiB;IAE1B,SAAS,CAAC,OAAe;QACrB,OAAO,eAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,CAAC,IAAc;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,CAAC,IAAc;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,WAAW,CAAC,IAAc;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC5B,CAAC;CAEJ,CAAA;AAlBY,8CAAiB;4BAAjB,iBAAiB;IAD7B,IAAA,sBAAU,GAAE;GACA,iBAAiB,CAkB7B"}