@difizen/libro-common 0.3.3 → 1.0.0

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

@@ -0,0 +1,368 @@
+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); }
+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 _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 _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, "prototype", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }
+function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }
+function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }
+function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
+function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
+function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
+function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+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 { equals } from "../../observable/index.js";
+import { CompositeTreeNode } from "./tree.js";
+import { ExpandableTreeNode } from "./tree-expansion.js";
+export var TreeIterator;
+(function (_TreeIterator) {
+  var DEFAULT_OPTIONS = _TreeIterator.DEFAULT_OPTIONS = {
+    pruneCollapsed: false,
+    pruneSiblings: false
+  };
+})(TreeIterator || (TreeIterator = {}));
+export var Iterators;
+(function (_Iterators) {
+  var _marked = /*#__PURE__*/_regeneratorRuntime().mark(cycle);
+  function depthFirst(root, children) {
+    var include = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : function () {
+      return true;
+    };
+    return /*#__PURE__*/_regeneratorRuntime().mark(function _callee3() {
+      var stack, top;
+      return _regeneratorRuntime().wrap(function _callee3$(_context3) {
+        while (1) switch (_context3.prev = _context3.next) {
+          case 0:
+            stack = [];
+            stack.push(root);
+          case 2:
+            if (!(stack.length > 0)) {
+              _context3.next = 9;
+              break;
+            }
+            top = stack.pop();
+            _context3.next = 6;
+            return top;
+          case 6:
+            stack.push.apply(stack, _toConsumableArray((children(top) || []).filter(include).reverse()));
+            _context3.next = 2;
+            break;
+          case 9:
+          case "end":
+            return _context3.stop();
+        }
+      }, _callee3);
+    })();
+  }
+  _Iterators.depthFirst = depthFirst;
+  function breadthFirst(root, children) {
+    var include = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : function () {
+      return true;
+    };
+    return /*#__PURE__*/_regeneratorRuntime().mark(function _callee4() {
+      var queue, head;
+      return _regeneratorRuntime().wrap(function _callee4$(_context4) {
+        while (1) switch (_context4.prev = _context4.next) {
+          case 0:
+            queue = [];
+            queue.push(root);
+          case 2:
+            if (!(queue.length > 0)) {
+              _context4.next = 9;
+              break;
+            }
+            head = queue.shift();
+            _context4.next = 6;
+            return head;
+          case 6:
+            queue.push.apply(queue, _toConsumableArray((children(head) || []).filter(include)));
+            _context4.next = 2;
+            break;
+          case 9:
+          case "end":
+            return _context4.stop();
+        }
+      }, _callee4);
+    })();
+  }
+  _Iterators.breadthFirst = breadthFirst;
+  function asIterator(elements) {
+    return elements.slice()[Symbol.iterator]();
+  }
+  _Iterators.asIterator = asIterator;
+  function cycle(elements, start) {
+    var copy, index;
+    return _regeneratorRuntime().wrap(function cycle$(_context5) {
+      while (1) switch (_context5.prev = _context5.next) {
+        case 0:
+          copy = elements.slice();
+          index = start ? copy.indexOf(start) : 0;
+          if (!(index === -1)) {
+            _context5.next = 4;
+            break;
+          }
+          throw new Error("".concat(start, " is not contained in ").concat(copy, "."));
+        case 4:
+          if (!true) {
+            _context5.next = 11;
+            break;
+          }
+          _context5.next = 7;
+          return copy[index];
+        case 7:
+          index++;
+          if (index === copy.length) {
+            index = 0;
+          }
+          _context5.next = 4;
+          break;
+        case 11:
+        case "end":
+          return _context5.stop();
+      }
+    }, _marked);
+  }
+  _Iterators.cycle = cycle;
+})(Iterators || (Iterators = {}));
+export var AbstractTreeIterator = /*#__PURE__*/function (_Symbol$iterator) {
+  function AbstractTreeIterator(root, options) {
+    _classCallCheck(this, AbstractTreeIterator);
+    this.root = root;
+    this.options = _objectSpread(_objectSpread({}, TreeIterator.DEFAULT_OPTIONS), options);
+    this.delegate = this.iterator(this.root);
+  }
+
+  // tslint:disable-next-line:typedef
+  _createClass(AbstractTreeIterator, [{
+    key: _Symbol$iterator,
+    value: function value() {
+      return this.delegate;
+    }
+  }, {
+    key: "next",
+    value: function next() {
+      return this.delegate.next();
+    }
+  }, {
+    key: "children",
+    value: function children(node) {
+      if (!CompositeTreeNode.is(node)) {
+        return undefined;
+      }
+      if (this.options.pruneCollapsed && this.isCollapsed(node)) {
+        return undefined;
+      }
+      return node.children.slice();
+    }
+  }, {
+    key: "isCollapsed",
+    value: function isCollapsed(node) {
+      return ExpandableTreeNode.isCollapsed(node);
+    }
+  }, {
+    key: "isEmpty",
+    value: function isEmpty(nodes) {
+      return nodes === undefined || nodes.length === 0;
+    }
+  }]);
+  return AbstractTreeIterator;
+}(Symbol.iterator);
+export var DepthFirstTreeIterator = /*#__PURE__*/function (_AbstractTreeIterator) {
+  _inherits(DepthFirstTreeIterator, _AbstractTreeIterator);
+  var _super = _createSuper(DepthFirstTreeIterator);
+  function DepthFirstTreeIterator() {
+    _classCallCheck(this, DepthFirstTreeIterator);
+    return _super.apply(this, arguments);
+  }
+  _createClass(DepthFirstTreeIterator, [{
+    key: "iterator",
+    value: function iterator(root) {
+      return Iterators.depthFirst(root, this.children.bind(this));
+    }
+  }]);
+  return DepthFirstTreeIterator;
+}(AbstractTreeIterator);
+export var BreadthFirstTreeIterator = /*#__PURE__*/function (_AbstractTreeIterator2) {
+  _inherits(BreadthFirstTreeIterator, _AbstractTreeIterator2);
+  var _super2 = _createSuper(BreadthFirstTreeIterator);
+  function BreadthFirstTreeIterator() {
+    _classCallCheck(this, BreadthFirstTreeIterator);
+    return _super2.apply(this, arguments);
+  }
+  _createClass(BreadthFirstTreeIterator, [{
+    key: "iterator",
+    value: function iterator(root) {
+      return Iterators.breadthFirst(root, this.children.bind(this));
+    }
+  }]);
+  return BreadthFirstTreeIterator;
+}(AbstractTreeIterator);
+
+/**
+ * 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 var TopDownTreeIterator = /*#__PURE__*/function (_AbstractTreeIterator3) {
+  _inherits(TopDownTreeIterator, _AbstractTreeIterator3);
+  var _super3 = _createSuper(TopDownTreeIterator);
+  function TopDownTreeIterator() {
+    _classCallCheck(this, TopDownTreeIterator);
+    return _super3.apply(this, arguments);
+  }
+  _createClass(TopDownTreeIterator, [{
+    key: "iterator",
+    value: function iterator(root) {
+      var doNext = this.doNext.bind(this);
+      return /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+        var maybeNext, next;
+        return _regeneratorRuntime().wrap(function _callee$(_context) {
+          while (1) switch (_context.prev = _context.next) {
+            case 0:
+              maybeNext = root;
+              next = maybeNext;
+            case 2:
+              if (!maybeNext) {
+                _context.next = 9;
+                break;
+              }
+              next = maybeNext;
+              _context.next = 6;
+              return next;
+            case 6:
+              maybeNext = doNext(next);
+              _context.next = 2;
+              break;
+            case 9:
+            case "end":
+              return _context.stop();
+          }
+        }, _callee);
+      })();
+    }
+  }, {
+    key: "doNext",
+    value: function doNext(node) {
+      return this.findFirstChild(node) || this.findNextSibling(node);
+    }
+  }, {
+    key: "findFirstChild",
+    value: function findFirstChild(node) {
+      return (this.children(node) || [])[0];
+    }
+  }, {
+    key: "findNextSibling",
+    value: function findNextSibling(node) {
+      if (!node) {
+        return undefined;
+      }
+      if (this.options.pruneSiblings && equals(node, this.root)) {
+        return undefined;
+      }
+      if (node.nextSibling) {
+        return node.nextSibling;
+      }
+      return this.findNextSibling(node.parent);
+    }
+  }]);
+  return TopDownTreeIterator;
+}(AbstractTreeIterator);
+
+/**
+ * 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 var BottomUpTreeIterator = /*#__PURE__*/function (_AbstractTreeIterator4) {
+  _inherits(BottomUpTreeIterator, _AbstractTreeIterator4);
+  var _super4 = _createSuper(BottomUpTreeIterator);
+  function BottomUpTreeIterator() {
+    _classCallCheck(this, BottomUpTreeIterator);
+    return _super4.apply(this, arguments);
+  }
+  _createClass(BottomUpTreeIterator, [{
+    key: "iterator",
+    value: function iterator(root) {
+      var doNext = this.doNext.bind(this);
+      return /*#__PURE__*/_regeneratorRuntime().mark(function _callee2() {
+        var maybeNext, next;
+        return _regeneratorRuntime().wrap(function _callee2$(_context2) {
+          while (1) switch (_context2.prev = _context2.next) {
+            case 0:
+              maybeNext = root;
+              next = maybeNext;
+            case 2:
+              if (!maybeNext) {
+                _context2.next = 9;
+                break;
+              }
+              next = maybeNext;
+              _context2.next = 6;
+              return next;
+            case 6:
+              maybeNext = doNext(next);
+              _context2.next = 2;
+              break;
+            case 9:
+            case "end":
+              return _context2.stop();
+          }
+        }, _callee2);
+      })();
+    }
+  }, {
+    key: "doNext",
+    value: function doNext(node) {
+      var previousSibling = node.previousSibling;
+      var lastChild = this.lastChild(previousSibling);
+      return lastChild || node.parent;
+    }
+  }, {
+    key: "lastChild",
+    value: function lastChild(node) {
+      var children = node ? this.children(node) : [];
+      if (this.isEmpty(children)) {
+        return node;
+      }
+      if (CompositeTreeNode.is(node)) {
+        var lastChild = CompositeTreeNode.getLastChild(node);
+        return this.lastChild(lastChild);
+      }
+      return undefined;
+    }
+  }]);
+  return BottomUpTreeIterator;
+}(AbstractTreeIterator);

package/es/app/tree/tree-label-provider.d.ts

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

package/es/app/tree/tree-label-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-label-provider.d.ts","sourceRoot":"","sources":["../../../src/app/tree/tree-label-provider.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC;AAEvE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,qBACa,iBAAkB,YAAW,yBAAyB;IACjE,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM;IAI5C,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAI/B,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAG/B,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;CAGpC"}

package/es/app/tree/tree-label-provider.js

@@ -0,0 +1,39 @@
+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;
+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 { singleton } from "../../ioc/index.js";
+import { LabelProviderContribution } from "../label/label-provider.js";
+import { TreeNode } from "./tree.js";
+export var TreeLabelProvider = (_dec = singleton({
+  contrib: LabelProviderContribution
+}), _dec(_class = /*#__PURE__*/function () {
+  function TreeLabelProvider() {
+    _classCallCheck(this, TreeLabelProvider);
+  }
+  _createClass(TreeLabelProvider, [{
+    key: "canHandle",
+    value: function canHandle(element) {
+      return TreeNode.is(element) ? 50 : 0;
+    }
+  }, {
+    key: "getIcon",
+    value: function getIcon(node) {
+      return node.icon || '';
+    }
+  }, {
+    key: "getName",
+    value: function getName(node) {
+      return node.name || '';
+    }
+  }, {
+    key: "getLongName",
+    value: function getLongName(node) {
+      return node.description || '';
+    }
+  }]);
+  return TreeLabelProvider;
+}()) || _class);

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

@@ -0,0 +1,163 @@
+import type { Event, WaitUntilEvent, CancellationToken } from '../../common/index.js';
+import { Emitter, DisposableCollection } from '../../common/index.js';
+import type { SelectionProvider } from '../../core/index.js';
+import type { TreeNode } from './tree.js';
+import { Tree, CompositeTreeNode } from './tree.js';
+import { TreeExpansionService, ExpandableTreeNode } from './tree-expansion.js';
+import type { TreeIterator } from './tree-iterator.js';
+import { TreeNavigationService } from './tree-navigation.js';
+import { TreeSelectionService, SelectableTreeNode, TreeSelection } from './tree-selection.js';
+/**
+ * The tree model.
+ */
+export declare const TreeModel: unique symbol;
+export type TreeModel = {
+    /**
+     * Expands the given node. If the `node` argument is `undefined`, then expands the currently selected tree node.
+     * If multiple tree nodes are selected, expands the most recently selected tree node.
+     */
+    expandNode: (node?: Readonly<ExpandableTreeNode>) => Promise<Readonly<ExpandableTreeNode> | undefined>;
+    /**
+     * Collapses the given node. If the `node` argument is `undefined`, then collapses the currently selected tree node.
+     * If multiple tree nodes are selected, collapses the most recently selected tree node.
+     */
+    collapseNode: (node?: Readonly<ExpandableTreeNode>) => Promise<boolean>;
+    /**
+     * Collapses recursively. If the `node` argument is `undefined`, then collapses the currently selected tree node.
+     * If multiple tree nodes are selected, collapses the most recently selected tree node.
+     */
+    collapseAll: (node?: Readonly<CompositeTreeNode>) => Promise<boolean>;
+    /**
+     * Toggles the expansion state of the given node. If not give, then it toggles the expansion state of the currently selected node.
+     * If multiple nodes are selected, then the most recently selected tree node's expansion state will be toggled.
+     */
+    toggleNodeExpansion: (node?: Readonly<ExpandableTreeNode>) => Promise<void>;
+    /**
+     * Opens the given node or the currently selected on if the argument is `undefined`.
+     * If multiple nodes are selected, open the most recently selected node.
+     */
+    openNode: (node?: Readonly<TreeNode> | undefined) => void;
+    /**
+     * Event when a node should be opened.
+     */
+    readonly onOpenNode: Event<Readonly<TreeNode>>;
+    /**
+     * Selects the parent node relatively to the selected taking into account node expansion.
+     */
+    selectParent: () => void;
+    /**
+     * Navigates to the given node if it is defined. This method accepts both the tree node and its ID as an argument.
+     * Navigation sets a node as a root node and expand it. Resolves to the node if the navigation was successful. Otherwise,
+     * resolves to `undefined`.
+     */
+    navigateTo: (nodeOrId: Readonly<TreeNode> | string | undefined) => Promise<TreeNode | undefined>;
+    /**
+     * Tests whether it is possible to navigate forward.
+     */
+    canNavigateForward: () => boolean;
+    /**
+     * Tests whether it is possible to navigate backward.
+     */
+    canNavigateBackward: () => boolean;
+    /**
+     * Navigates forward.
+     */
+    navigateForward: () => Promise<void>;
+    /**
+     * Navigates backward.
+     */
+    navigateBackward: () => Promise<void>;
+    /**
+     * Selects the previous node relatively to the currently selected one. This method takes the expansion state of the tree into consideration.
+     */
+    selectPrevNode: (type?: TreeSelection.SelectionType) => void;
+    /**
+     * Returns the previous selectable tree node.
+     */
+    getPrevSelectableNode: (node?: TreeNode) => SelectableTreeNode | undefined;
+    /**
+     * Selects the next node relatively to the currently selected one. This method takes the expansion state of the tree into consideration.
+     */
+    selectNextNode: (type?: TreeSelection.SelectionType) => void;
+    /**
+     * Returns the next selectable tree node.
+     */
+    getNextSelectableNode: (node?: TreeNode) => SelectableTreeNode | undefined;
+    /**
+     * Selects the given tree node. Has no effect when the node does not exist in the tree. Discards any previous selection state.
+     */
+    selectNode: (node: Readonly<SelectableTreeNode>) => void;
+    /**
+     * Selects the given node if it was not yet selected, or unselects it if it was. Keeps the previous selection state and updates it
+     * with the current toggle selection.
+     */
+    toggleNode: (node: Readonly<SelectableTreeNode>) => void;
+    /**
+     * Selects a range of tree nodes. The target of the selection range is the argument, the from tree node is the previous selected node.
+     * If no node was selected previously, invoking this method does nothing.
+     */
+    selectRange: (node: Readonly<SelectableTreeNode>) => void;
+} & Tree & TreeSelectionService & TreeExpansionService;
+export declare class TreeModelImpl implements TreeModel, SelectionProvider<readonly Readonly<SelectableTreeNode>[]> {
+    protected readonly tree: Tree;
+    protected readonly selectionService: TreeSelectionService;
+    protected readonly expansionService: TreeExpansionService;
+    protected readonly navigationService: TreeNavigationService;
+    constructor(tree: Tree, selectionService: TreeSelectionService, expansionService: TreeExpansionService, navigationService: TreeNavigationService);
+    protected readonly onChangedEmitter: Emitter<void>;
+    protected readonly onOpenNodeEmitter: Emitter<TreeNode>;
+    protected readonly toDispose: DisposableCollection;
+    protected init(): void;
+    dispose(): void;
+    protected handleExpansion(node: Readonly<ExpandableTreeNode>): void;
+    /**
+     * Select the given node if it is the ancestor of a selected node.
+     */
+    protected selectIfAncestorOfSelected(node: Readonly<ExpandableTreeNode>): void;
+    get root(): TreeNode | undefined;
+    set root(root: TreeNode | undefined);
+    get onChanged(): Event<void>;
+    get onOpenNode(): Event<TreeNode>;
+    protected fireChanged(): void;
+    get onNodeRefreshed(): Event<Readonly<CompositeTreeNode> & WaitUntilEvent>;
+    getNode(id: string | undefined): TreeNode | undefined;
+    validateNode(node: TreeNode | undefined): TreeNode | undefined;
+    refresh(parent?: Readonly<CompositeTreeNode>): Promise<CompositeTreeNode | undefined>;
+    get selectedNodes(): readonly Readonly<SelectableTreeNode>[];
+    get onSelectionChanged(): Event<readonly Readonly<SelectableTreeNode>[]> & Event<readonly Readonly<SelectableTreeNode>[] | undefined>;
+    get onExpansionChanged(): Event<Readonly<ExpandableTreeNode>>;
+    expandNode(raw?: Readonly<ExpandableTreeNode>): Promise<ExpandableTreeNode | undefined>;
+    collapseNode(raw?: Readonly<ExpandableTreeNode>): Promise<boolean>;
+    collapseAll(raw?: Readonly<CompositeTreeNode>): Promise<boolean>;
+    toggleNodeExpansion: (raw?: Readonly<ExpandableTreeNode>) => Promise<void>;
+    selectPrevNode(type?: TreeSelection.SelectionType): void;
+    getPrevSelectableNode(node?: TreeNode): SelectableTreeNode | undefined;
+    selectNextNode(type?: TreeSelection.SelectionType): void;
+    getNextSelectableNode(node?: TreeNode): SelectableTreeNode | undefined;
+    protected doGetNextNode(iterator: TreeIterator): SelectableTreeNode | undefined;
+    protected createBackwardIterator(_node: TreeNode | undefined): TreeIterator | undefined;
+    protected createIterator(_node: TreeNode | undefined): TreeIterator | undefined;
+    openNode(raw?: TreeNode | undefined): void;
+    protected doOpenNode(node: TreeNode): void;
+    selectParent(): void;
+    navigateTo(nodeOrId: TreeNode | string | undefined): Promise<TreeNode | undefined>;
+    canNavigateForward(): boolean;
+    canNavigateBackward(): boolean;
+    navigateForward(): Promise<void>;
+    navigateBackward(): Promise<void>;
+    protected doNavigate(node: TreeNode): Promise<void>;
+    addSelection(selectionOrTreeNode: TreeSelection | Readonly<SelectableTreeNode>): void;
+    selectNode(node: Readonly<SelectableTreeNode>): void;
+    toggleNode(node: Readonly<SelectableTreeNode>): void;
+    selectRange(node: Readonly<SelectableTreeNode>): void;
+    storeState(): TreeModelImpl.State;
+    restoreState(state: Record<string, any>): void;
+    get onDidChangeBusy(): Event<TreeNode>;
+    markAsBusy(node: Readonly<TreeNode>, ms: number, token: CancellationToken): Promise<void>;
+}
+export declare namespace TreeModelImpl {
+    type State = {
+        selection: object;
+    };
+}
+//# sourceMappingURL=tree-model.d.ts.map

package/es/app/tree/tree-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-model.d.ts","sourceRoot":"","sources":["../../../src/app/tree/tree-model.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AACtF,OAAO,EAAE,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAG7D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,IAAI,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAC/E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,aAAa,EACd,MAAM,qBAAqB,CAAC;AAG7B;;GAEG;AACH,eAAO,MAAM,SAAS,eAAsB,CAAC;AAC7C,MAAM,MAAM,SAAS,GAAG;IACtB;;;OAGG;IACH,UAAU,EAAE,CACV,IAAI,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAChC,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC,CAAC;IAEvD;;;OAGG;IACH,YAAY,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IAExE;;;OAGG;IACH,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,iBAAiB,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IAEtE;;;OAGG;IACH,mBAAmB,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5E;;;OAGG;IACH,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,SAAS,KAAK,IAAI,CAAC;IAE1D;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE/C;;OAEG;IACH,YAAY,EAAE,MAAM,IAAI,CAAC;IAEzB;;;;OAIG;IACH,UAAU,EAAE,CACV,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,SAAS,KAC9C,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;IACnC;;OAEG;IACH,kBAAkB,EAAE,MAAM,OAAO,CAAC;IAElC;;OAEG;IACH,mBAAmB,EAAE,MAAM,OAAO,CAAC;IAEnC;;OAEG;IACH,eAAe,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IACrC;;OAEG;IACH,gBAAgB,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IAEtC;;OAEG;IACH,cAAc,EAAE,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC,aAAa,KAAK,IAAI,CAAC;IAE7D;;OAEG;IACH,qBAAqB,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,KAAK,kBAAkB,GAAG,SAAS,CAAC;IAE3E;;OAEG;IACH,cAAc,EAAE,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC,aAAa,KAAK,IAAI,CAAC;IAE7D;;OAEG;IACH,qBAAqB,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,KAAK,kBAAkB,GAAG,SAAS,CAAC;IAE3E;;OAEG;IACH,UAAU,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,IAAI,CAAC;IAEzD;;;OAGG;IACH,UAAU,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,IAAI,CAAC;IAEzD;;;OAGG;IACH,WAAW,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,KAAK,IAAI,CAAC;CAC3D,GAAG,IAAI,GACN,oBAAoB,GACpB,oBAAoB,CAAC;AAEvB,qBACa,aACX,YAAW,SAAS,EAAE,iBAAiB,CAAC,SAAS,QAAQ,CAAC,kBAAkB,CAAC,EAAE,CAAC;IAEhF,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAC9B,SAAS,CAAC,QAAQ,CAAC,gBAAgB,EAAE,oBAAoB,CAAC;IAC1D,SAAS,CAAC,QAAQ,CAAC,gBAAgB,EAAE,oBAAoB,CAAC;IAC1D,SAAS,CAAC,QAAQ,CAAC,iBAAiB,EAAE,qBAAqB,CAAC;gBAG5C,IAAI,EAAE,IAAI,EACM,gBAAgB,EAAE,oBAAoB,EACtC,gBAAgB,EAAE,oBAAoB,EACrC,iBAAiB,EAAE,qBAAqB;IAQzE,SAAS,CAAC,QAAQ,CAAC,gBAAgB,gBAAuB;IAC1D,SAAS,CAAC,QAAQ,CAAC,iBAAiB,oBAA2B;IAC/D,SAAS,CAAC,QAAQ,CAAC,SAAS,uBAA8B;IAG1D,SAAS,CAAC,IAAI,IAAI,IAAI;IAkBtB,OAAO,IAAI,IAAI;IAIf,SAAS,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAInE;;OAEG;IACH,SAAS,CAAC,0BAA0B,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAa9E,IAAI,IAAI,IAAI,QAAQ,GAAG,SAAS,CAE/B;IAED,IAAI,IAAI,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,EAElC;IAED,IAAI,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,CAE3B;IAED,IAAI,UAAU,IAAI,KAAK,CAAC,QAAQ,CAAC,CAEhC;IAED,SAAS,CAAC,WAAW,IAAI,IAAI;IAI7B,IAAI,eAAe,IAAI,KAAK,CAAC,QAAQ,CAAC,iBAAiB,CAAC,GAAG,cAAc,CAAC,CAEzE;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS;IAIrD,YAAY,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS;IAIxD,OAAO,CACX,MAAM,CAAC,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GACnC,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAQzC,IAAI,aAAa,4CAEhB;IAGD,IAAI,kBAAkB,gHAErB;IAED,IAAI,kBAAkB,IAAI,KAAK,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAE5D;IAEK,UAAU,CACd,GAAG,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GACjC,OAAO,CAAC,kBAAkB,GAAG,SAAS,CAAC;IASpC,YAAY,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;IASlE,WAAW,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;IAWtE,mBAAmB,SAAgB,SAAS,kBAAkB,CAAC,KAAG,QAAQ,IAAI,CAAC,CAO7E;IAEF,cAAc,CACZ,IAAI,GAAE,aAAa,CAAC,aAAmD,GACtE,IAAI;IAOP,qBAAqB,CACnB,IAAI,GAAE,QAAgC,GACrC,kBAAkB,GAAG,SAAS;IAKjC,cAAc,CACZ,IAAI,GAAE,aAAa,CAAC,aAAmD,GACtE,IAAI;IAOP,qBAAqB,CACnB,IAAI,GAAE,QAAgC,GACrC,kBAAkB,GAAG,SAAS;IAKjC,SAAS,CAAC,aAAa,CAAC,QAAQ,EAAE,YAAY,GAAG,kBAAkB,GAAG,SAAS;IAc/E,SAAS,CAAC,sBAAsB,CAC9B,KAAK,EAAE,QAAQ,GAAG,SAAS,GAC1B,YAAY,GAAG,SAAS;IAI3B,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,YAAY,GAAG,SAAS;IAI/E,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI;IAQ1C,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAM1C,YAAY,IAAI,IAAI;IAUd,UAAU,CACd,QAAQ,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS,GACtC,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAYhC,kBAAkB,IAAI,OAAO;IAI7B,mBAAmB,IAAI,OAAO;IAIxB,eAAe,IAAI,OAAO,CAAC,IAAI,CAAC;IAOhC,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC;cAOvB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;IAUzD,YAAY,CACV,mBAAmB,EAAE,aAAa,GAAG,QAAQ,CAAC,kBAAkB,CAAC,GAChE,IAAI;IAIP,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAIpD,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAIpD,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI;IAIrD,UAAU,IAAI,aAAa,CAAC,KAAK;IAMjC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI;IAM9C,IAAI,eAAe,IAAI,KAAK,CAAC,QAAQ,CAAC,CAErC;IAED,UAAU,CACR,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,EACxB,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,iBAAiB,GACvB,OAAO,CAAC,IAAI,CAAC;CAGjB;AACD,yBAAiB,aAAa,CAAC;IAC7B,KAAY,KAAK,GAAG;QAClB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;CACH"}