@difizen/libro-common 0.3.3 → 1.0.0

package/es/app/tree/tree-decorator.js

@@ -0,0 +1,248 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+var _dec, _class, _dec2, _class2;
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
+function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+import { Emitter, DisposableCollection } from "../../common/index.js";
+import { singleton } from "../../ioc/index.js";
+
+/**
+ * The {@link TreeDecorator} allows adapting the look and the style of the tree items within a widget. Changes are reflected in
+ * the form of `decoration data`. This `decoration data` is a map storing {@link TreeDecoration.Data} for affected tree nodes (using the unique node id as key).
+ * It is important to notice that there is no common contribution point for `TreeDecorators`. Instead, each {@link TreeDecoratorService} is
+ * supposed to declare its own contribution provider for `TreeDecorators`.
+ *
+ * ### Example usage
+ * A simple tree decorator that changes the background color of each tree node to `red`.
+ *
+ * ```typescript
+ * @singleton()
+ * export class MyTreeDecorator implements TreeDecorator {
+ *     id = 'myTreeDecorator';
+ *
+ *     protected readonly emitter = new Emitter<(tree: Tree) => Map<string, TreeDecoration.Data>>();
+ *
+ *     get onDidChangeDecorations(): Event<(tree: Tree) => Map<string, TreeDecoration.Data>> {
+ *         return this.emitter.event;
+ *     }
+ *
+ *     decorations(tree: Tree): MaybePromise<Map<string, TreeDecoration.Data>> {
+ *         const result = new Map();
+ *
+ *         if (tree.root === undefined) {
+ *             return result;
+ *         }
+ *         for (const treeNode of new DepthFirstTreeIterator(tree.root)) {
+ *             result.set(treeNode.id,<TreeDecoration.Data>{backgroundColor:'red'})
+ *         }
+ *         return result;
+ *     }
+ * }
+ * ```
+ */
+
+export var TreeDecoratorService = Symbol('TreeDecoratorService');
+
+/**
+ * The {@link TreeDecoratorService} manages a set of known {link TreeDecorator}s and emits events when
+ * any of the known decorators has changes. Typically, a `TreeDecoratorService` provides a contribution point that can be used to
+ * register {@link TreeDecorator}s exclusively for this service.
+ *
+ * ### Example usage
+ * ```typescript
+ * export const MyTreeDecorator = Symbol('MyTreeDecorator');
+ *
+ * @singleton()
+ * export class MyDecorationService extends AbstractTreeDecoratorService {
+ *     constructor(@contrib(MyTreeDecorator) protected readonly contributions: ContributionProvider<TreeDecorator>) {
+ *         super(contributions.getContributions());
+ *     }
+ * }
+ * ```
+ */
+
+/**
+ * The default tree decorator service. Does nothing at all. One has to rebind to a concrete implementation
+ * if decorators have to be supported in the tree widget.
+ */
+export var NoopTreeDecoratorService = (_dec = singleton({
+  contrib: TreeDecoratorService
+}), _dec(_class = /*#__PURE__*/function () {
+  function NoopTreeDecoratorService() {
+    _classCallCheck(this, NoopTreeDecoratorService);
+    this.emitter = new Emitter();
+    this.onDidChangeDecorations = this.emitter.event;
+  }
+  _createClass(NoopTreeDecoratorService, [{
+    key: "dispose",
+    value: function dispose() {
+      this.emitter.dispose();
+    }
+
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  }, {
+    key: "getDecorations",
+    value: function getDecorations() {
+      return new Map();
+    }
+  }, {
+    key: "deflateDecorators",
+    value: function deflateDecorators() {
+      return {};
+    }
+  }, {
+    key: "inflateDecorators",
+    value: function inflateDecorators() {
+      return new Map();
+    }
+  }]);
+  return NoopTreeDecoratorService;
+}()) || _class);
+
+/**
+ * Abstract decorator service implementation which emits events from all known tree decorators and caches the current state.
+ */
+export var AbstractTreeDecoratorService = (_dec2 = singleton(), _dec2(_class2 = /*#__PURE__*/function () {
+  function AbstractTreeDecoratorService(decorators) {
+    var _this$toDispose,
+      _this = this;
+    _classCallCheck(this, AbstractTreeDecoratorService);
+    this.onDidChangeDecorationsEmitter = new Emitter();
+    this.onDidChangeDecorations = this.onDidChangeDecorationsEmitter.event;
+    this.toDispose = new DisposableCollection();
+    this.decorators = decorators;
+    this.toDispose.push(this.onDidChangeDecorationsEmitter);
+    (_this$toDispose = this.toDispose).push.apply(_this$toDispose, _toConsumableArray(this.decorators.map(function (decorator) {
+      return decorator.onDidChangeDecorations(function () {
+        return _this.onDidChangeDecorationsEmitter.fire(undefined);
+      });
+    })));
+  }
+  _createClass(AbstractTreeDecoratorService, [{
+    key: "dispose",
+    value: function dispose() {
+      this.toDispose.dispose();
+    }
+  }, {
+    key: "getDecorations",
+    value: function () {
+      var _getDecorations = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(tree) {
+        var changes, _iterator, _step, decorator, _iterator2, _step2, _step2$value, id, data;
+        return _regeneratorRuntime().wrap(function _callee$(_context) {
+          while (1) switch (_context.prev = _context.next) {
+            case 0:
+              changes = new Map();
+              _iterator = _createForOfIteratorHelper(this.decorators);
+              _context.prev = 2;
+              _iterator.s();
+            case 4:
+              if ((_step = _iterator.n()).done) {
+                _context.next = 14;
+                break;
+              }
+              decorator = _step.value;
+              _context.t0 = _createForOfIteratorHelper;
+              _context.next = 9;
+              return decorator.decorations(tree);
+            case 9:
+              _context.t1 = _context.sent.entries();
+              _iterator2 = (0, _context.t0)(_context.t1);
+              try {
+                for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+                  _step2$value = _slicedToArray(_step2.value, 2), id = _step2$value[0], data = _step2$value[1];
+                  if (changes.has(id)) {
+                    changes.get(id).push(data);
+                  } else {
+                    changes.set(id, [data]);
+                  }
+                }
+              } catch (err) {
+                _iterator2.e(err);
+              } finally {
+                _iterator2.f();
+              }
+            case 12:
+              _context.next = 4;
+              break;
+            case 14:
+              _context.next = 19;
+              break;
+            case 16:
+              _context.prev = 16;
+              _context.t2 = _context["catch"](2);
+              _iterator.e(_context.t2);
+            case 19:
+              _context.prev = 19;
+              _iterator.f();
+              return _context.finish(19);
+            case 22:
+              return _context.abrupt("return", changes);
+            case 23:
+            case "end":
+              return _context.stop();
+          }
+        }, _callee, this, [[2, 16, 19, 22]]);
+      }));
+      function getDecorations(_x) {
+        return _getDecorations.apply(this, arguments);
+      }
+      return getDecorations;
+    }()
+  }, {
+    key: "deflateDecorators",
+    value: function deflateDecorators(decorations) {
+      var state = Object.create(null);
+      var _iterator3 = _createForOfIteratorHelper(decorations),
+        _step3;
+      try {
+        for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+          var _step3$value = _slicedToArray(_step3.value, 2),
+            id = _step3$value[0],
+            data = _step3$value[1];
+          state[id] = data;
+        }
+      } catch (err) {
+        _iterator3.e(err);
+      } finally {
+        _iterator3.f();
+      }
+      return state;
+    }
+
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  }, {
+    key: "inflateDecorators",
+    value: function inflateDecorators(state) {
+      var decorators = new Map();
+      for (var _i = 0, _Object$keys = Object.keys(state); _i < _Object$keys.length; _i++) {
+        var id = _Object$keys[_i];
+        decorators.set(id, state[id]);
+      }
+      return decorators;
+    }
+  }]);
+  return AbstractTreeDecoratorService;
+}()) || _class2);
+export var DecoratedTreeNode;
+(function (_DecoratedTreeNode) {
+  function is(node) {
+    return !!node && 'decorationData' in node;
+  }
+  _DecoratedTreeNode.is = is;
+})(DecoratedTreeNode || (DecoratedTreeNode = {}));

package/es/app/tree/tree-expansion.d.ts

@@ -0,0 +1,69 @@
+import type { Event, Disposable } from '../../common/index.js';
+import { Emitter } from '../../common/index.js';
+import type { TreeNode } from './tree.js';
+import { CompositeTreeNode, Tree } from './tree.js';
+export declare const TreeExpansionService: unique symbol;
+/**
+ * The tree expandable service.
+ */
+export type TreeExpansionService = {
+    /**
+     * 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>;
+} & Disposable;
+/**
+ * The expandable tree node.
+ */
+export type ExpandableTreeNode = {
+    /**
+     * Test whether this tree node is expanded.
+     */
+    expanded: boolean;
+} & CompositeTreeNode;
+export declare namespace ExpandableTreeNode {
+    function is(node: Record<any, any> | undefined): node is ExpandableTreeNode;
+    function isExpanded(node: Record<any, any> | undefined): node is ExpandableTreeNode;
+    function isCollapsed(node: Record<any, any> | undefined): node is ExpandableTreeNode;
+}
+export declare class TreeExpansionServiceImpl implements TreeExpansionService {
+    protected readonly onExpansionChangedEmitter: Emitter<ExpandableTreeNode>;
+    protected readonly tree: Tree;
+    constructor(tree: Tree);
+    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/es/app/tree/tree-expansion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-expansion.d.ts","sourceRoot":"","sources":["../../../src/app/tree/tree-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAGhD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEpD,eAAO,MAAM,oBAAoB,eAAiC,CAAC;AAEnE;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG;IACjC;;OAEG;IACH,QAAQ,CAAC,kBAAkB,EAAE,KAAK,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACjE;;;;;OAKG;IACH,UAAU,EAAE,CACV,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAC/B,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC,CAAC;IACvD;;;;OAIG;IACH,YAAY,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IACvE;;;;OAIG;IACH,WAAW,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,iBAAiB,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IACrE;;;OAGG;IACH,mBAAmB,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;CAC5E,GAAG,UAAU,CAAC;AAEf;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAAG;IAC/B;;OAEG;IACH,QAAQ,EAAE,OAAO,CAAC;CACnB,GAAG,iBAAiB,CAAC;AAEtB,yBAAiB,kBAAkB,CAAC;IAClC,SAAgB,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS,GAAG,IAAI,IAAI,kBAAkB,CAEjF;IAED,SAAgB,UAAU,CACxB,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS,GACjC,IAAI,IAAI,kBAAkB,CAE5B;IAED,SAAgB,WAAW,CACzB,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS,GACjC,IAAI,IAAI,kBAAkB,CAE5B;CACF;AAED,qBACa,wBAAyB,YAAW,oBAAoB;IACnE,SAAS,CAAC,QAAQ,CAAC,yBAAyB,8BAAqC;IACjF,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;gBAEJ,IAAI,EAAE,IAAI;IAKpC,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,CAC1B,IAAI,EAAE,kBAAkB,GACvB,OAAO,CAAC,kBAAkB,GAAG,SAAS,CAAC;IAUpC,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;CAOnE"}

package/es/app/tree/tree-expansion.js

@@ -0,0 +1,250 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+var _dec, _dec2, _class, _class2;
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+function _applyDecoratedDescriptor(target, property, decorators, descriptor, context) { var desc = {}; Object.keys(descriptor).forEach(function (key) { desc[key] = descriptor[key]; }); desc.enumerable = !!desc.enumerable; desc.configurable = !!desc.configurable; if ('value' in desc || desc.initializer) { desc.writable = true; } desc = decorators.slice().reverse().reduce(function (desc, decorator) { return decorator(target, property, desc) || desc; }, desc); if (context && desc.initializer !== void 0) { desc.value = desc.initializer ? desc.initializer.call(context) : void 0; desc.initializer = undefined; } if (desc.initializer === void 0) { Object.defineProperty(target, property, desc); desc = null; } return desc; }
+import { Emitter } from "../../common/index.js";
+import { singleton, inject, postConstruct } from "../../ioc/index.js";
+import { CompositeTreeNode, Tree } from "./tree.js";
+export var TreeExpansionService = Symbol('TreeExpansionService');
+
+/**
+ * The tree expandable service.
+ */
+
+/**
+ * The expandable tree node.
+ */
+export var ExpandableTreeNode;
+(function (_ExpandableTreeNode) {
+  function is(node) {
+    return !!node && 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 || (ExpandableTreeNode = {}));
+export var TreeExpansionServiceImpl = (_dec = singleton({
+  contrib: TreeExpansionService
+}), _dec2 = postConstruct(), _dec(_class = (_class2 = /*#__PURE__*/function () {
+  function TreeExpansionServiceImpl(tree) {
+    _classCallCheck(this, TreeExpansionServiceImpl);
+    this.onExpansionChangedEmitter = new Emitter();
+    this.tree = tree;
+  }
+  TreeExpansionServiceImpl = inject(Tree)(TreeExpansionServiceImpl, undefined, 0) || TreeExpansionServiceImpl;
+  _createClass(TreeExpansionServiceImpl, [{
+    key: "init",
+    value: function init() {
+      var _this = this;
+      this.tree.onNodeRefreshed(function (node) {
+        var _iterator = _createForOfIteratorHelper(node.children),
+          _step;
+        try {
+          for (_iterator.s(); !(_step = _iterator.n()).done;) {
+            var child = _step.value;
+            if (ExpandableTreeNode.isExpanded(child) && node.waitUntil) {
+              node.waitUntil(_this.tree.refresh(child));
+            }
+          }
+        } catch (err) {
+          _iterator.e(err);
+        } finally {
+          _iterator.f();
+        }
+      });
+    }
+  }, {
+    key: "dispose",
+    value: function dispose() {
+      this.onExpansionChangedEmitter.dispose();
+    }
+  }, {
+    key: "onExpansionChanged",
+    get: function get() {
+      return this.onExpansionChangedEmitter.event;
+    }
+  }, {
+    key: "fireExpansionChanged",
+    value: function fireExpansionChanged(node) {
+      this.onExpansionChangedEmitter.fire(node);
+    }
+  }, {
+    key: "expandNode",
+    value: function () {
+      var _expandNode = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(raw) {
+        var node;
+        return _regeneratorRuntime().wrap(function _callee$(_context) {
+          while (1) switch (_context.prev = _context.next) {
+            case 0:
+              node = this.tree.validateNode(raw);
+              if (!ExpandableTreeNode.isCollapsed(node)) {
+                _context.next = 3;
+                break;
+              }
+              return _context.abrupt("return", this.doExpandNode(node));
+            case 3:
+              return _context.abrupt("return", undefined);
+            case 4:
+            case "end":
+              return _context.stop();
+          }
+        }, _callee, this);
+      }));
+      function expandNode(_x) {
+        return _expandNode.apply(this, arguments);
+      }
+      return expandNode;
+    }()
+  }, {
+    key: "doExpandNode",
+    value: function () {
+      var _doExpandNode = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee2(node) {
+        var refreshed;
+        return _regeneratorRuntime().wrap(function _callee2$(_context2) {
+          while (1) switch (_context2.prev = _context2.next) {
+            case 0:
+              _context2.next = 2;
+              return this.tree.refresh(node);
+            case 2:
+              refreshed = _context2.sent;
+              if (!ExpandableTreeNode.is(refreshed)) {
+                _context2.next = 7;
+                break;
+              }
+              refreshed.expanded = true;
+              this.fireExpansionChanged(refreshed);
+              return _context2.abrupt("return", refreshed);
+            case 7:
+              return _context2.abrupt("return", undefined);
+            case 8:
+            case "end":
+              return _context2.stop();
+          }
+        }, _callee2, this);
+      }));
+      function doExpandNode(_x2) {
+        return _doExpandNode.apply(this, arguments);
+      }
+      return doExpandNode;
+    }()
+  }, {
+    key: "collapseNode",
+    value: function () {
+      var _collapseNode = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee3(raw) {
+        var node;
+        return _regeneratorRuntime().wrap(function _callee3$(_context3) {
+          while (1) switch (_context3.prev = _context3.next) {
+            case 0:
+              node = this.tree.validateNode(raw);
+              return _context3.abrupt("return", this.doCollapseNode(node));
+            case 2:
+            case "end":
+              return _context3.stop();
+          }
+        }, _callee3, this);
+      }));
+      function collapseNode(_x3) {
+        return _collapseNode.apply(this, arguments);
+      }
+      return collapseNode;
+    }()
+  }, {
+    key: "collapseAll",
+    value: function () {
+      var _collapseAll = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee4(raw) {
+        var node;
+        return _regeneratorRuntime().wrap(function _callee4$(_context4) {
+          while (1) switch (_context4.prev = _context4.next) {
+            case 0:
+              node = this.tree.validateNode(raw);
+              return _context4.abrupt("return", this.doCollapseAll(node));
+            case 2:
+            case "end":
+              return _context4.stop();
+          }
+        }, _callee4, this);
+      }));
+      function collapseAll(_x4) {
+        return _collapseAll.apply(this, arguments);
+      }
+      return collapseAll;
+    }()
+  }, {
+    key: "doCollapseAll",
+    value: function doCollapseAll(node) {
+      var result = false;
+      if (CompositeTreeNode.is(node)) {
+        var _iterator2 = _createForOfIteratorHelper(node.children),
+          _step2;
+        try {
+          for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+            var child = _step2.value;
+            result = this.doCollapseAll(child) || result;
+          }
+        } catch (err) {
+          _iterator2.e(err);
+        } finally {
+          _iterator2.f();
+        }
+      }
+      return this.doCollapseNode(node) || result;
+    }
+  }, {
+    key: "doCollapseNode",
+    value: function doCollapseNode(node) {
+      if (!ExpandableTreeNode.isExpanded(node)) {
+        return false;
+      }
+      node.expanded = false;
+      this.fireExpansionChanged(node);
+      return true;
+    }
+  }, {
+    key: "toggleNodeExpansion",
+    value: function () {
+      var _toggleNodeExpansion = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee5(node) {
+        return _regeneratorRuntime().wrap(function _callee5$(_context5) {
+          while (1) switch (_context5.prev = _context5.next) {
+            case 0:
+              if (!node.expanded) {
+                _context5.next = 5;
+                break;
+              }
+              _context5.next = 3;
+              return this.collapseNode(node);
+            case 3:
+              _context5.next = 7;
+              break;
+            case 5:
+              _context5.next = 7;
+              return this.expandNode(node);
+            case 7:
+            case "end":
+              return _context5.stop();
+          }
+        }, _callee5, this);
+      }));
+      function toggleNodeExpansion(_x5) {
+        return _toggleNodeExpansion.apply(this, arguments);
+      }
+      return toggleNodeExpansion;
+    }()
+  }]);
+  return TreeExpansionServiceImpl;
+}(), (_applyDecoratedDescriptor(_class2.prototype, "init", [_dec2], Object.getOwnPropertyDescriptor(_class2.prototype, "init"), _class2.prototype)), _class2)) || _class);

package/es/app/tree/tree-impl.d.ts

@@ -0,0 +1,40 @@
+import type { Mutable, Event, CancellationToken } from '../../common/index.js';
+import { DisposableCollection } from '../../common/index.js';
+import { Emitter, WaitUntilEvent } from '../../common/index.js';
+import type { TreeNode } from './tree.js';
+import { Tree, CompositeTreeNode } from './tree.js';
+/**
+ * A default implementation of the tree.
+ */
+export declare class TreeImpl implements Tree {
+    protected _root: TreeNode | undefined;
+    protected readonly onChangedEmitter: Emitter<void>;
+    protected readonly onNodeRefreshedEmitter: Emitter<{
+        children: readonly TreeNode[];
+    } & TreeNode & WaitUntilEvent>;
+    protected readonly toDispose: DisposableCollection;
+    protected readonly onDidChangeBusyEmitter: Emitter<TreeNode>;
+    readonly onDidChangeBusy: Event<TreeNode>;
+    protected nodes: Record<string, Mutable<TreeNode> | undefined>;
+    constructor();
+    dispose(): void;
+    get root(): TreeNode | undefined;
+    set root(root: TreeNode | undefined);
+    get onChanged(): Event<void>;
+    protected fireChanged(): void;
+    get onNodeRefreshed(): Event<CompositeTreeNode & WaitUntilEvent>;
+    protected fireNodeRefreshed(parent: CompositeTreeNode): Promise<void>;
+    getNode: (id: string | undefined) => TreeNode | undefined;
+    validateNode: (node: TreeNode | undefined) => TreeNode | undefined;
+    refresh(raw?: CompositeTreeNode): Promise<CompositeTreeNode | undefined>;
+    protected resolveChildren(parent: CompositeTreeNode): Promise<TreeNode[]>;
+    protected setChildren: (parent: CompositeTreeNode, children: TreeNode[]) => Promise<CompositeTreeNode | undefined>;
+    protected removeNode: (node: TreeNode | undefined) => void;
+    protected getRootNode(node: TreeNode): TreeNode;
+    protected addNode(node: TreeNode | undefined): void;
+    markAsBusy(raw: TreeNode, ms: number, token: CancellationToken): Promise<void>;
+    protected doMarkAsBusy(node: Mutable<TreeNode>, ms: number, token: CancellationToken): Promise<void>;
+    protected doSetBusy(node: Mutable<TreeNode>): void;
+    protected doResetBusy(node: Mutable<TreeNode>): void;
+}
+//# sourceMappingURL=tree-impl.d.ts.map