@difizen/mana-app
Version:
294 lines (293 loc) • 20.4 kB
JavaScript
"use strict";
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); }
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.TreeImpl = void 0;
var _manaCommon = require("@difizen/mana-common");
var _manaObservable = require("@difizen/mana-observable");
var _manaSyringe = require("@difizen/mana-syringe");
var _tree = require("./tree");
var _dec, _class;
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 _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); }
/**
* A default implementation of the tree.
*/
var TreeImpl = exports.TreeImpl = (_dec = (0, _manaSyringe.singleton)({
token: _tree.Tree
}), _dec(_class = /*#__PURE__*/function () {
function TreeImpl() {
var _this = this;
_classCallCheck(this, TreeImpl);
this.onChangedEmitter = new _manaCommon.Emitter();
this.onNodeRefreshedEmitter = new _manaCommon.Emitter();
this.toDispose = new _manaCommon.DisposableCollection();
this.onDidChangeBusyEmitter = new _manaCommon.Emitter();
this.onDidChangeBusy = this.onDidChangeBusyEmitter.event;
this.nodes = {};
this.getNode = function (id) {
return id !== undefined ? _this.nodes[id] : undefined;
};
this.validateNode = function (node) {
var id = node ? node.id : undefined;
return _this.getNode(id);
};
this.setChildren = /*#__PURE__*/function () {
var _ref = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(parent, children) {
var root;
return _regeneratorRuntime().wrap(function _callee$(_context) {
while (1) switch (_context.prev = _context.next) {
case 0:
root = _this.getRootNode(parent);
if (!(_this.nodes[root.id] && !(0, _manaObservable.equals)(_this.nodes[root.id], root))) {
_context.next = 4;
break;
}
console.error("Child node '".concat(parent.id, "' does not belong to this '").concat(root.id, "' tree."));
return _context.abrupt("return", undefined);
case 4:
_this.removeNode(parent);
parent.children = children;
_this.addNode(parent);
_context.next = 9;
return _this.fireNodeRefreshed(parent);
case 9:
return _context.abrupt("return", parent);
case 10:
case "end":
return _context.stop();
}
}, _callee);
}));
return function (_x, _x2) {
return _ref.apply(this, arguments);
};
}();
this.removeNode = function (node) {
if (_tree.CompositeTreeNode.is(node)) {
node.children.forEach(function (child) {
return _this.removeNode(child);
});
}
if (node) {
delete _this.nodes[node.id];
}
};
this.toDispose.push(this.onChangedEmitter);
this.toDispose.push(this.onNodeRefreshedEmitter);
this.toDispose.push(this.onDidChangeBusyEmitter);
}
_createClass(TreeImpl, [{
key: "dispose",
value: function dispose() {
this.nodes = {};
this.toDispose.dispose();
}
}, {
key: "root",
get: function get() {
return this._root;
},
set: function set(root) {
this.nodes = {};
this._root = root;
this.addNode(root);
this.refresh();
}
}, {
key: "onChanged",
get: function get() {
return this.onChangedEmitter.event;
}
}, {
key: "fireChanged",
value: function fireChanged() {
this.onChangedEmitter.fire(undefined);
}
}, {
key: "onNodeRefreshed",
get: function get() {
return this.onNodeRefreshedEmitter.event;
}
}, {
key: "fireNodeRefreshed",
value: function () {
var _fireNodeRefreshed = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee2(parent) {
return _regeneratorRuntime().wrap(function _callee2$(_context2) {
while (1) switch (_context2.prev = _context2.next) {
case 0:
_context2.next = 2;
return _manaCommon.WaitUntilEvent.fire(this.onNodeRefreshedEmitter, parent);
case 2:
this.fireChanged();
case 3:
case "end":
return _context2.stop();
}
}, _callee2, this);
}));
function fireNodeRefreshed(_x3) {
return _fireNodeRefreshed.apply(this, arguments);
}
return fireNodeRefreshed;
}()
}, {
key: "refresh",
value: function () {
var _refresh = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee3(raw) {
var parent, result, busySource, children;
return _regeneratorRuntime().wrap(function _callee3$(_context3) {
while (1) switch (_context3.prev = _context3.next) {
case 0:
parent = !raw ? this._root : this.validateNode(raw);
if (!_tree.CompositeTreeNode.is(parent)) {
_context3.next = 15;
break;
}
busySource = new _manaCommon.CancellationTokenSource();
this.doMarkAsBusy(parent, 800, busySource.token);
_context3.prev = 4;
result = parent;
_context3.next = 8;
return this.resolveChildren(parent);
case 8:
children = _context3.sent;
_context3.next = 11;
return this.setChildren(parent, children);
case 11:
result = _context3.sent;
case 12:
_context3.prev = 12;
busySource.cancel();
return _context3.finish(12);
case 15:
this.fireChanged();
return _context3.abrupt("return", result);
case 17:
case "end":
return _context3.stop();
}
}, _callee3, this, [[4,, 12, 15]]);
}));
function refresh(_x4) {
return _refresh.apply(this, arguments);
}
return refresh;
}()
}, {
key: "resolveChildren",
value: function resolveChildren(parent) {
return Promise.resolve(Array.from(parent.children));
}
}, {
key: "getRootNode",
value: function getRootNode(node) {
if (node.parent === undefined) {
return node;
}
return this.getRootNode(node.parent);
}
}, {
key: "addNode",
value: function addNode(node) {
var _this2 = this;
if (node) {
this.nodes[node.id] = node;
}
if (_tree.CompositeTreeNode.is(node)) {
var _getOrigin = (0, _manaObservable.getOrigin)(node),
children = _getOrigin.children;
children.forEach(function (child, index) {
_tree.CompositeTreeNode.setParent(child, index, node);
_this2.addNode(child);
});
}
}
}, {
key: "markAsBusy",
value: function () {
var _markAsBusy = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee4(raw, ms, token) {
var node;
return _regeneratorRuntime().wrap(function _callee4$(_context4) {
while (1) switch (_context4.prev = _context4.next) {
case 0:
node = this.validateNode(raw);
if (!node) {
_context4.next = 4;
break;
}
_context4.next = 4;
return this.doMarkAsBusy(node, ms, token);
case 4:
case "end":
return _context4.stop();
}
}, _callee4, this);
}));
function markAsBusy(_x5, _x6, _x7) {
return _markAsBusy.apply(this, arguments);
}
return markAsBusy;
}()
}, {
key: "doMarkAsBusy",
value: function () {
var _doMarkAsBusy = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee5(node, ms, token) {
var _this3 = this;
return _regeneratorRuntime().wrap(function _callee5$(_context5) {
while (1) switch (_context5.prev = _context5.next) {
case 0:
_context5.prev = 0;
_context5.next = 3;
return (0, _manaCommon.timeout)(ms, token);
case 3:
this.doSetBusy(node);
token.onCancellationRequested(function () {
return _this3.doResetBusy(node);
});
_context5.next = 9;
break;
case 7:
_context5.prev = 7;
_context5.t0 = _context5["catch"](0);
case 9:
case "end":
return _context5.stop();
}
}, _callee5, this, [[0, 7]]);
}));
function doMarkAsBusy(_x8, _x9, _x10) {
return _doMarkAsBusy.apply(this, arguments);
}
return doMarkAsBusy;
}()
}, {
key: "doSetBusy",
value: function doSetBusy(node) {
var oldBusy = node.busy || 0;
node.busy = oldBusy + 1;
if (oldBusy === 0) {
this.onDidChangeBusyEmitter.fire(node);
}
}
}, {
key: "doResetBusy",
value: function doResetBusy(node) {
var oldBusy = node.busy || 0;
if (oldBusy > 0) {
node.busy = oldBusy - 1;
if (node.busy === 0) {
this.onDidChangeBusyEmitter.fire(node);
}
}
}
}]);
return TreeImpl;
}()) || _class);