@difizen/libro-common 0.3.3 → 1.0.0

package/es/common/iterator.js

@@ -0,0 +1,389 @@
+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 _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 _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 _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 _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); }
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+export var Iterable;
+(function (_Iterable) {
+  var _marked = /*#__PURE__*/_regeneratorRuntime().mark(single),
+    _marked2 = /*#__PURE__*/_regeneratorRuntime().mark(filter),
+    _marked3 = /*#__PURE__*/_regeneratorRuntime().mark(map),
+    _marked4 = /*#__PURE__*/_regeneratorRuntime().mark(concat),
+    _marked5 = /*#__PURE__*/_regeneratorRuntime().mark(concatNested);
+  function is(thing) {
+    return thing && _typeof(thing) === 'object' && typeof thing[Symbol.iterator] === 'function';
+  }
+  _Iterable.is = is;
+  var _empty = Object.freeze([]);
+  function empty() {
+    return _empty;
+  }
+  _Iterable.empty = empty;
+  function single(element) {
+    return _regeneratorRuntime().wrap(function single$(_context) {
+      while (1) switch (_context.prev = _context.next) {
+        case 0:
+          _context.next = 2;
+          return element;
+        case 2:
+        case "end":
+          return _context.stop();
+      }
+    }, _marked);
+  }
+  _Iterable.single = single;
+  function from(iterable) {
+    return iterable || _empty;
+  }
+  _Iterable.from = from;
+  function isEmpty(iterable) {
+    return !iterable || iterable[Symbol.iterator]().next().done === true;
+  }
+  _Iterable.isEmpty = isEmpty;
+  function first(iterable) {
+    return iterable[Symbol.iterator]().next().value;
+  }
+  _Iterable.first = first;
+  function some(iterable, predicate) {
+    var _iterator = _createForOfIteratorHelper(iterable),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var element = _step.value;
+        if (predicate(element)) {
+          return true;
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+    return false;
+  }
+  _Iterable.some = some;
+  function find(iterable, predicate) {
+    var _iterator2 = _createForOfIteratorHelper(iterable),
+      _step2;
+    try {
+      for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+        var element = _step2.value;
+        if (predicate(element)) {
+          return element;
+        }
+      }
+    } catch (err) {
+      _iterator2.e(err);
+    } finally {
+      _iterator2.f();
+    }
+    return undefined;
+  }
+  _Iterable.find = find;
+  function filter(iterable, predicate) {
+    var _iterator3, _step3, element;
+    return _regeneratorRuntime().wrap(function filter$(_context2) {
+      while (1) switch (_context2.prev = _context2.next) {
+        case 0:
+          _iterator3 = _createForOfIteratorHelper(iterable);
+          _context2.prev = 1;
+          _iterator3.s();
+        case 3:
+          if ((_step3 = _iterator3.n()).done) {
+            _context2.next = 10;
+            break;
+          }
+          element = _step3.value;
+          if (!predicate(element)) {
+            _context2.next = 8;
+            break;
+          }
+          _context2.next = 8;
+          return element;
+        case 8:
+          _context2.next = 3;
+          break;
+        case 10:
+          _context2.next = 15;
+          break;
+        case 12:
+          _context2.prev = 12;
+          _context2.t0 = _context2["catch"](1);
+          _iterator3.e(_context2.t0);
+        case 15:
+          _context2.prev = 15;
+          _iterator3.f();
+          return _context2.finish(15);
+        case 18:
+        case "end":
+          return _context2.stop();
+      }
+    }, _marked2, null, [[1, 12, 15, 18]]);
+  }
+  _Iterable.filter = filter;
+  function map(iterable, fn) {
+    var _iterator4, _step4, element;
+    return _regeneratorRuntime().wrap(function map$(_context3) {
+      while (1) switch (_context3.prev = _context3.next) {
+        case 0:
+          _iterator4 = _createForOfIteratorHelper(iterable);
+          _context3.prev = 1;
+          _iterator4.s();
+        case 3:
+          if ((_step4 = _iterator4.n()).done) {
+            _context3.next = 9;
+            break;
+          }
+          element = _step4.value;
+          _context3.next = 7;
+          return fn(element);
+        case 7:
+          _context3.next = 3;
+          break;
+        case 9:
+          _context3.next = 14;
+          break;
+        case 11:
+          _context3.prev = 11;
+          _context3.t0 = _context3["catch"](1);
+          _iterator4.e(_context3.t0);
+        case 14:
+          _context3.prev = 14;
+          _iterator4.f();
+          return _context3.finish(14);
+        case 17:
+        case "end":
+          return _context3.stop();
+      }
+    }, _marked3, null, [[1, 11, 14, 17]]);
+  }
+  _Iterable.map = map;
+  function concat() {
+    var _len,
+      iterables,
+      _key,
+      _i,
+      _iterables,
+      _iterable,
+      _iterator5,
+      _step5,
+      element,
+      _args4 = arguments;
+    return _regeneratorRuntime().wrap(function concat$(_context4) {
+      while (1) switch (_context4.prev = _context4.next) {
+        case 0:
+          for (_len = _args4.length, iterables = new Array(_len), _key = 0; _key < _len; _key++) {
+            iterables[_key] = _args4[_key];
+          }
+          _i = 0, _iterables = iterables;
+        case 2:
+          if (!(_i < _iterables.length)) {
+            _context4.next = 24;
+            break;
+          }
+          _iterable = _iterables[_i];
+          _iterator5 = _createForOfIteratorHelper(_iterable);
+          _context4.prev = 5;
+          _iterator5.s();
+        case 7:
+          if ((_step5 = _iterator5.n()).done) {
+            _context4.next = 13;
+            break;
+          }
+          element = _step5.value;
+          _context4.next = 11;
+          return element;
+        case 11:
+          _context4.next = 7;
+          break;
+        case 13:
+          _context4.next = 18;
+          break;
+        case 15:
+          _context4.prev = 15;
+          _context4.t0 = _context4["catch"](5);
+          _iterator5.e(_context4.t0);
+        case 18:
+          _context4.prev = 18;
+          _iterator5.f();
+          return _context4.finish(18);
+        case 21:
+          _i++;
+          _context4.next = 2;
+          break;
+        case 24:
+        case "end":
+          return _context4.stop();
+      }
+    }, _marked4, null, [[5, 15, 18, 21]]);
+  }
+  _Iterable.concat = concat;
+  function concatNested(iterables) {
+    var _iterator6, _step6, _iterable2, _iterator7, _step7, element;
+    return _regeneratorRuntime().wrap(function concatNested$(_context5) {
+      while (1) switch (_context5.prev = _context5.next) {
+        case 0:
+          _iterator6 = _createForOfIteratorHelper(iterables);
+          _context5.prev = 1;
+          _iterator6.s();
+        case 3:
+          if ((_step6 = _iterator6.n()).done) {
+            _context5.next = 24;
+            break;
+          }
+          _iterable2 = _step6.value;
+          _iterator7 = _createForOfIteratorHelper(_iterable2);
+          _context5.prev = 6;
+          _iterator7.s();
+        case 8:
+          if ((_step7 = _iterator7.n()).done) {
+            _context5.next = 14;
+            break;
+          }
+          element = _step7.value;
+          _context5.next = 12;
+          return element;
+        case 12:
+          _context5.next = 8;
+          break;
+        case 14:
+          _context5.next = 19;
+          break;
+        case 16:
+          _context5.prev = 16;
+          _context5.t0 = _context5["catch"](6);
+          _iterator7.e(_context5.t0);
+        case 19:
+          _context5.prev = 19;
+          _iterator7.f();
+          return _context5.finish(19);
+        case 22:
+          _context5.next = 3;
+          break;
+        case 24:
+          _context5.next = 29;
+          break;
+        case 26:
+          _context5.prev = 26;
+          _context5.t1 = _context5["catch"](1);
+          _iterator6.e(_context5.t1);
+        case 29:
+          _context5.prev = 29;
+          _iterator6.f();
+          return _context5.finish(29);
+        case 32:
+        case "end":
+          return _context5.stop();
+      }
+    }, _marked5, null, [[1, 26, 29, 32], [6, 16, 19, 22]]);
+  }
+  _Iterable.concatNested = concatNested;
+  function reduce(iterable, reducer, initialValue) {
+    var value = initialValue;
+    var _iterator8 = _createForOfIteratorHelper(iterable),
+      _step8;
+    try {
+      for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
+        var element = _step8.value;
+        value = reducer(value, element);
+      }
+    } catch (err) {
+      _iterator8.e(err);
+    } finally {
+      _iterator8.f();
+    }
+    return value;
+  }
+  _Iterable.reduce = reduce;
+  function slice(arr, from) {
+    var to = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
+    return /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+      return _regeneratorRuntime().wrap(function _callee$(_context6) {
+        while (1) switch (_context6.prev = _context6.next) {
+          case 0:
+            if (from < 0) {
+              from += arr.length;
+            }
+            if (to < 0) {
+              to += arr.length;
+            } else if (to > arr.length) {
+              to = arr.length;
+            }
+          case 2:
+            if (!(from < to)) {
+              _context6.next = 8;
+              break;
+            }
+            _context6.next = 5;
+            return arr[from];
+          case 5:
+            from++;
+            _context6.next = 2;
+            break;
+          case 8:
+          case "end":
+            return _context6.stop();
+        }
+      }, _callee);
+    })();
+  }
+  _Iterable.slice = slice;
+  function consume(iterable) {
+    var atMost = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Number.POSITIVE_INFINITY;
+    var consumed = [];
+    if (atMost === 0) {
+      return [consumed, iterable];
+    }
+    var iterator = iterable[Symbol.iterator]();
+    for (var i = 0; i < atMost; i++) {
+      var next = iterator.next();
+      if (next.done) {
+        return [consumed, Iterable.empty()];
+      }
+      consumed.push(next.value);
+    }
+    return [consumed, _defineProperty({}, Symbol.iterator, function () {
+      return iterator;
+    })];
+  }
+  _Iterable.consume = consume;
+  function equals(a, b) {
+    var comparator = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : function (at, bt) {
+      return at === bt;
+    };
+    var ai = a[Symbol.iterator]();
+    var bi = b[Symbol.iterator]();
+    // eslint-disable-next-line no-constant-condition
+    while (true) {
+      var an = ai.next();
+      var bn = bi.next();
+      if (an.done !== bn.done) {
+        return false;
+      }
+      if (an.done) {
+        return true;
+      }
+      if (!comparator(an.value, bn.value)) {
+        return false;
+      }
+    }
+  }
+  _Iterable.equals = equals;
+  function max(iterable, comparator) {
+    var firstValue = first(iterable);
+    if (!firstValue) {
+      return undefined;
+    }
+    return reduce(iterable, function (prev, curr) {
+      return comparator(prev, curr) > 0 ? prev : curr;
+    }, firstValue);
+  }
+  _Iterable.max = max;
+})(Iterable || (Iterable = {}));

package/es/common/linkedList.d.ts

@@ -0,0 +1,16 @@
+export declare class LinkedList<E> {
+    private _first;
+    private _last;
+    private _size;
+    get size(): number;
+    isEmpty(): boolean;
+    clear(): void;
+    unshift(element: E): () => void;
+    push(element: E): () => void;
+    private _insert;
+    shift(): E | undefined;
+    pop(): E | undefined;
+    private _remove;
+    [Symbol.iterator](): Iterator<E>;
+}
+//# sourceMappingURL=linkedList.d.ts.map

package/es/common/linkedList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linkedList.d.ts","sourceRoot":"","sources":["../../src/common/linkedList.ts"],"names":[],"mappings":"AAmBA,qBAAa,UAAU,CAAC,CAAC;IACvB,OAAO,CAAC,MAAM,CAA2B;IACzC,OAAO,CAAC,KAAK,CAA2B;IACxC,OAAO,CAAC,KAAK,CAAK;IAElB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,OAAO,IAAI,OAAO;IAIlB,KAAK,IAAI,IAAI;IAMb,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM,IAAI;IAI/B,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM,IAAI;IAI5B,OAAO,CAAC,OAAO;IA6Bf,KAAK,IAAI,CAAC,GAAG,SAAS;IAStB,GAAG,IAAI,CAAC,GAAG,SAAS;IASpB,OAAO,CAAC,OAAO;IAwBd,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;CAOlC"}

package/es/common/linkedList.js

@@ -0,0 +1,159 @@
+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 _Symbol$iterator;
+var _Node;
+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 _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 _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+var Node = /*#__PURE__*/_createClass(function Node(element) {
+  _classCallCheck(this, Node);
+  this.element = element;
+  this.next = Node.Undefined;
+  this.prev = Node.Undefined;
+});
+_Node = Node;
+Node.Undefined = new _Node(undefined);
+_Symbol$iterator = Symbol.iterator;
+export var LinkedList = /*#__PURE__*/function () {
+  function LinkedList() {
+    _classCallCheck(this, LinkedList);
+    this._first = Node.Undefined;
+    this._last = Node.Undefined;
+    this._size = 0;
+  }
+  _createClass(LinkedList, [{
+    key: "size",
+    get: function get() {
+      return this._size;
+    }
+  }, {
+    key: "isEmpty",
+    value: function isEmpty() {
+      return this._first === Node.Undefined;
+    }
+  }, {
+    key: "clear",
+    value: function clear() {
+      this._first = Node.Undefined;
+      this._last = Node.Undefined;
+      this._size = 0;
+    }
+  }, {
+    key: "unshift",
+    value: function unshift(element) {
+      return this._insert(element, false);
+    }
+  }, {
+    key: "push",
+    value: function push(element) {
+      return this._insert(element, true);
+    }
+  }, {
+    key: "_insert",
+    value: function _insert(element, atTheEnd) {
+      var _this = this;
+      var newNode = new Node(element);
+      if (this._first === Node.Undefined) {
+        this._first = newNode;
+        this._last = newNode;
+      } else if (atTheEnd) {
+        // push
+        var oldLast = this._last;
+        this._last = newNode;
+        newNode.prev = oldLast;
+        oldLast.next = newNode;
+      } else {
+        // unshift
+        var oldFirst = this._first;
+        this._first = newNode;
+        newNode.next = oldFirst;
+        oldFirst.prev = newNode;
+      }
+      this._size += 1;
+      var didRemove = false;
+      return function () {
+        if (!didRemove) {
+          didRemove = true;
+          _this._remove(newNode);
+        }
+      };
+    }
+  }, {
+    key: "shift",
+    value: function shift() {
+      if (this._first === Node.Undefined) {
+        return undefined;
+      }
+      var res = this._first.element;
+      this._remove(this._first);
+      return res;
+    }
+  }, {
+    key: "pop",
+    value: function pop() {
+      if (this._last === Node.Undefined) {
+        return undefined;
+      }
+      var res = this._last.element;
+      this._remove(this._last);
+      return res;
+    }
+  }, {
+    key: "_remove",
+    value: function _remove(node) {
+      if (node.prev !== Node.Undefined && node.next !== Node.Undefined) {
+        // middle
+        var anchor = node.prev;
+        anchor.next = node.next;
+        node.next.prev = anchor;
+      } else if (node.prev === Node.Undefined && node.next === Node.Undefined) {
+        // only node
+        this._first = Node.Undefined;
+        this._last = Node.Undefined;
+      } else if (node.next === Node.Undefined) {
+        // last
+        this._last = this._last.prev;
+        this._last.next = Node.Undefined;
+      } else if (node.prev === Node.Undefined) {
+        // first
+        this._first = this._first.next;
+        this._first.prev = Node.Undefined;
+      }
+
+      // done
+      this._size -= 1;
+    }
+  }, {
+    key: _Symbol$iterator,
+    value: /*#__PURE__*/_regeneratorRuntime().mark(function value() {
+      var node;
+      return _regeneratorRuntime().wrap(function value$(_context) {
+        while (1) switch (_context.prev = _context.next) {
+          case 0:
+            node = this._first;
+          case 1:
+            if (!(node !== Node.Undefined)) {
+              _context.next = 7;
+              break;
+            }
+            _context.next = 4;
+            return node.element;
+          case 4:
+            node = node.next;
+            _context.next = 1;
+            break;
+          case 7:
+          case "end":
+            return _context.stop();
+        }
+      }, value, this);
+    })
+  }]);
+  return LinkedList;
+}();

package/es/common/objects.d.ts

@@ -0,0 +1,36 @@
+export declare function deepClone<T>(obj: T): T;
+export declare function deepFreeze<T>(obj: T): T;
+export declare function cloneAndChange(obj: any, changer: (orig: any) => any): any;
+/**
+ * Copies all properties of source into destination. The optional parameter "overwrite" allows to control
+ * if existing properties on the destination should be overwritten or not. Defaults to true (overwrite).
+ */
+export declare function mixin(destination: any, source: any, overwrite?: boolean): any;
+export declare function objectEquals(one: any, other: any): boolean;
+/**
+ * Calls `JSON.Stringify` with a replacer to break apart any circular references.
+ * This prevents `JSON`.stringify` from throwing the exception
+ *  "Uncaught TypeError: Converting circular structure to JSON"
+ */
+export declare function safeStringify(obj: any): string;
+export declare function getOrDefault<T, R>(obj: T, fn: (obj: T) => R | undefined, defaultValue: R): R;
+type obj = Record<string, any>;
+/**
+ * Returns an object that has keys for each value that is different in the base object. Keys
+ * that do not exist in the target but in the base object are not considered.
+ *
+ * Note: This is not a deep-diffing method, so the values are strictly taken into the resulting
+ * object if they differ.
+ *
+ * @param base the object to diff against
+ * @param obj the object to use for diffing
+ */
+export declare function distinct(base: obj, target: obj): obj;
+export declare function getCaseInsensitive(target: obj, key: string): any;
+export declare function notEmpty<T>(arg: T | undefined | null): arg is T;
+/**
+ * `true` if the argument is an empty object. Otherwise, `false`.
+ */
+export declare function isEmpty(arg: Record<any, any>): boolean;
+export {};
+//# sourceMappingURL=objects.d.ts.map

package/es/common/objects.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"objects.d.ts","sourceRoot":"","sources":["../../src/common/objects.ts"],"names":[],"mappings":"AAOA,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAiBtC;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAmBvC;AAID,wBAAgB,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,GAAG,GAAG,CAEzE;AA0CD;;;GAGG;AACH,wBAAgB,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,UAAO,GAAG,GAAG,CAqB1E;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,OAAO,CAmD1D;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,GAAG,GAAG,MAAM,CAW9C;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAC/B,GAAG,EAAE,CAAC,EACN,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,EAC7B,YAAY,EAAE,CAAC,GACd,CAAC,CAGH;AAED,KAAK,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC/B;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,GAAG,GAAG,CAkBpD;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,GAAG,GAAG,CAMhE;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,SAAS,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,CAE/D;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,OAAO,CAEtD"}