@cloudcare/browser-core 3.2.0 → 3.2.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -6,9 +6,6 @@ Object.defineProperty(exports, "__esModule", {
6
6
  exports.ONE_MEBI_BYTE = exports.ONE_KIBI_BYTE = void 0;
7
7
  exports.computeBytesCount = computeBytesCount;
8
8
  exports.concatBuffers = concatBuffers;
9
- 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; } } }; }
10
- 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); }
11
- 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; }
12
9
  var ONE_KIBI_BYTE = 1024;
13
10
  exports.ONE_KIBI_BYTE = ONE_KIBI_BYTE;
14
11
  var ONE_MEBI_BYTE = 1024 * ONE_KIBI_BYTE;
@@ -31,18 +28,10 @@ function concatBuffers(buffers) {
31
28
  }, 0);
32
29
  var result = new Uint8Array(length);
33
30
  var offset = 0;
34
- var _iterator = _createForOfIteratorHelper(buffers),
35
- _step;
36
- try {
37
- for (_iterator.s(); !(_step = _iterator.n()).done;) {
38
- var buffer = _step.value;
39
- result.set(buffer, offset);
40
- offset += buffer.length;
41
- }
42
- } catch (err) {
43
- _iterator.e(err);
44
- } finally {
45
- _iterator.f();
31
+ for (var _i = 0, buffers_1 = buffers; _i < buffers_1.length; _i++) {
32
+ var buffer = buffers_1[_i];
33
+ result.set(buffer, offset);
34
+ offset += buffer.length;
46
35
  }
47
36
  return result;
48
37
  }
@@ -1 +1 @@
1
- {"version":3,"file":"byteUtils.js","names":["ONE_KIBI_BYTE","exports","ONE_MEBI_BYTE","HAS_MULTI_BYTES_CHARACTERS","computeBytesCount","candidate","test","length","window","TextEncoder","undefined","encode","Blob","size","concatBuffers","buffers","reduce","total","buffer","result","Uint8Array","offset","_iterator","_createForOfIteratorHelper","_step","s","n","done","value","set","err","e","f"],"sources":["../../src/helper/byteUtils.js"],"sourcesContent":["export var ONE_KIBI_BYTE = 1024\nexport var ONE_MEBI_BYTE = 1024 * ONE_KIBI_BYTE\n// eslint-disable-next-line no-control-regex\nvar HAS_MULTI_BYTES_CHARACTERS = /[^\\u0000-\\u007F]/\n\nexport function computeBytesCount(candidate) {\n // Accurate bytes count computations can degrade performances when there is a lot of events to process\n if (!HAS_MULTI_BYTES_CHARACTERS.test(candidate)) {\n return candidate.length\n }\n\n if (window.TextEncoder !== undefined) {\n return new TextEncoder().encode(candidate).length\n }\n\n return new Blob([candidate]).size\n}\nexport function concatBuffers(buffers) {\n var length = buffers.reduce(function (total, buffer) {\n return total + buffer.length\n }, 0)\n var result = new Uint8Array(length)\n var offset = 0\n for (var buffer of buffers) {\n result.set(buffer, offset)\n offset += buffer.length\n }\n return result\n}\n"],"mappings":";;;;;;;;;;;AAAO,IAAIA,aAAa,GAAG,IAAI;AAAAC,OAAA,CAAAD,aAAA,GAAAA,aAAA;AACxB,IAAIE,aAAa,GAAG,IAAI,GAAGF,aAAa;AAC/C;AAAAC,OAAA,CAAAC,aAAA,GAAAA,aAAA;AACA,IAAIC,0BAA0B,GAAG,kBAAkB;AAE5C,SAASC,iBAAiBA,CAACC,SAAS,EAAE;EAC3C;EACA,IAAI,CAACF,0BAA0B,CAACG,IAAI,CAACD,SAAS,CAAC,EAAE;IAC/C,OAAOA,SAAS,CAACE,MAAM;EACzB;EAEA,IAAIC,MAAM,CAACC,WAAW,KAAKC,SAAS,EAAE;IACpC,OAAO,IAAID,WAAW,CAAC,CAAC,CAACE,MAAM,CAACN,SAAS,CAAC,CAACE,MAAM;EACnD;EAEA,OAAO,IAAIK,IAAI,CAAC,CAACP,SAAS,CAAC,CAAC,CAACQ,IAAI;AACnC;AACO,SAASC,aAAaA,CAACC,OAAO,EAAE;EACrC,IAAIR,MAAM,GAAGQ,OAAO,CAACC,MAAM,CAAC,UAAUC,KAAK,EAAEC,MAAM,EAAE;IACnD,OAAOD,KAAK,GAAGC,MAAM,CAACX,MAAM;EAC9B,CAAC,EAAE,CAAC,CAAC;EACL,IAAIY,MAAM,GAAG,IAAIC,UAAU,CAACb,MAAM,CAAC;EACnC,IAAIc,MAAM,GAAG,CAAC;EAAA,IAAAC,SAAA,GAAAC,0BAAA,CACKR,OAAO;IAAAS,KAAA;EAAA;IAA1B,KAAAF,SAAA,CAAAG,CAAA,MAAAD,KAAA,GAAAF,SAAA,CAAAI,CAAA,IAAAC,IAAA,GAA4B;MAAA,IAAnBT,MAAM,GAAAM,KAAA,CAAAI,KAAA;MACbT,MAAM,CAACU,GAAG,CAACX,MAAM,EAAEG,MAAM,CAAC;MAC1BA,MAAM,IAAIH,MAAM,CAACX,MAAM;IACzB;EAAC,SAAAuB,GAAA;IAAAR,SAAA,CAAAS,CAAA,CAAAD,GAAA;EAAA;IAAAR,SAAA,CAAAU,CAAA;EAAA;EACD,OAAOb,MAAM;AACf","ignoreList":[]}
1
+ {"version":3,"file":"byteUtils.js","names":["ONE_KIBI_BYTE","exports","ONE_MEBI_BYTE","HAS_MULTI_BYTES_CHARACTERS","computeBytesCount","candidate","test","length","window","TextEncoder","undefined","encode","Blob","size","concatBuffers","buffers","reduce","total","buffer","result","Uint8Array","offset","_i","buffers_1","set"],"sources":["../../src/helper/byteUtils.js"],"sourcesContent":["export var ONE_KIBI_BYTE = 1024\nexport var ONE_MEBI_BYTE = 1024 * ONE_KIBI_BYTE\n// eslint-disable-next-line no-control-regex\nvar HAS_MULTI_BYTES_CHARACTERS = /[^\\u0000-\\u007F]/\n\nexport function computeBytesCount(candidate) {\n // Accurate bytes count computations can degrade performances when there is a lot of events to process\n if (!HAS_MULTI_BYTES_CHARACTERS.test(candidate)) {\n return candidate.length\n }\n\n if (window.TextEncoder !== undefined) {\n return new TextEncoder().encode(candidate).length\n }\n\n return new Blob([candidate]).size\n}\nexport function concatBuffers(buffers) {\n var length = buffers.reduce(function (total, buffer) {\n return total + buffer.length\n }, 0)\n var result = new Uint8Array(length)\n var offset = 0\n for (var _i = 0, buffers_1 = buffers; _i < buffers_1.length; _i++) {\n var buffer = buffers_1[_i]\n result.set(buffer, offset)\n offset += buffer.length\n }\n return result\n}\n"],"mappings":";;;;;;;;AAAO,IAAIA,aAAa,GAAG,IAAI;AAAAC,OAAA,CAAAD,aAAA,GAAAA,aAAA;AACxB,IAAIE,aAAa,GAAG,IAAI,GAAGF,aAAa;AAC/C;AAAAC,OAAA,CAAAC,aAAA,GAAAA,aAAA;AACA,IAAIC,0BAA0B,GAAG,kBAAkB;AAE5C,SAASC,iBAAiBA,CAACC,SAAS,EAAE;EAC3C;EACA,IAAI,CAACF,0BAA0B,CAACG,IAAI,CAACD,SAAS,CAAC,EAAE;IAC/C,OAAOA,SAAS,CAACE,MAAM;EACzB;EAEA,IAAIC,MAAM,CAACC,WAAW,KAAKC,SAAS,EAAE;IACpC,OAAO,IAAID,WAAW,CAAC,CAAC,CAACE,MAAM,CAACN,SAAS,CAAC,CAACE,MAAM;EACnD;EAEA,OAAO,IAAIK,IAAI,CAAC,CAACP,SAAS,CAAC,CAAC,CAACQ,IAAI;AACnC;AACO,SAASC,aAAaA,CAACC,OAAO,EAAE;EACrC,IAAIR,MAAM,GAAGQ,OAAO,CAACC,MAAM,CAAC,UAAUC,KAAK,EAAEC,MAAM,EAAE;IACnD,OAAOD,KAAK,GAAGC,MAAM,CAACX,MAAM;EAC9B,CAAC,EAAE,CAAC,CAAC;EACL,IAAIY,MAAM,GAAG,IAAIC,UAAU,CAACb,MAAM,CAAC;EACnC,IAAIc,MAAM,GAAG,CAAC;EACd,KAAK,IAAIC,EAAE,GAAG,CAAC,EAAEC,SAAS,GAAGR,OAAO,EAAEO,EAAE,GAAGC,SAAS,CAAChB,MAAM,EAAEe,EAAE,EAAE,EAAE;IACjE,IAAIJ,MAAM,GAAGK,SAAS,CAACD,EAAE,CAAC;IAC1BH,MAAM,CAACK,GAAG,CAACN,MAAM,EAAEG,MAAM,CAAC;IAC1BA,MAAM,IAAIH,MAAM,CAACX,MAAM;EACzB;EACA,OAAOY,MAAM;AACf","ignoreList":[]}
@@ -6,9 +6,6 @@ Object.defineProperty(exports, "__esModule", {
6
6
  exports.limitModification = limitModification;
7
7
  var _tools = require("./tools");
8
8
  var _sanitize = require("./sanitize");
9
- 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; } } }; }
10
- 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); }
11
- 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; }
12
9
  /**
13
10
  * Current limitation:
14
11
  * - field path do not support array, 'a.b.c' only
@@ -31,20 +28,12 @@ function limitModification(object, modifiableFieldPaths, modifier) {
31
28
  }
32
29
  function get(object, path) {
33
30
  var current = object;
34
- var _iterator = _createForOfIteratorHelper(path.split('.')),
35
- _step;
36
- try {
37
- for (_iterator.s(); !(_step = _iterator.n()).done;) {
38
- var field = _step.value;
39
- if (!isValidObjectContaining(current, field)) {
40
- return;
41
- }
42
- current = current[field];
31
+ for (var _i = 0, _a = path.split('.'); _i < _a.length; _i++) {
32
+ var field = _a[_i];
33
+ if (!isValidObjectContaining(current, field)) {
34
+ return;
43
35
  }
44
- } catch (err) {
45
- _iterator.e(err);
46
- } finally {
47
- _iterator.f();
36
+ current = current[field];
48
37
  }
49
38
  return current;
50
39
  }
@@ -1 +1 @@
1
- {"version":3,"file":"limitModification.js","names":["_tools","require","_sanitize","_createForOfIteratorHelper","o","allowArrayLike","it","Symbol","iterator","Array","isArray","_unsupportedIterableToArray","length","i","F","s","n","done","value","e","_e","f","TypeError","normalCompletion","didErr","err","call","step","next","_e2","minLen","_arrayLikeToArray","Object","prototype","toString","slice","constructor","name","from","test","arr","len","arr2","limitModification","object","modifiableFieldPaths","modifier","clone","deepClone","result","each","objectEntries","filedPaths","fieldPath","fieldType","newValue","get","newType","getType","set","sanitize","path","current","_iterator","split","_step","field","isValidObjectContaining","fields","isValidObject","hasOwnProperty"],"sources":["../../src/helper/limitModification.js"],"sourcesContent":["import { extend2Lev, each, objectEntries, getType, deepClone } from './tools'\nimport { sanitize } from './sanitize'\n\n/**\n * Current limitation:\n * - field path do not support array, 'a.b.c' only\n */\nexport function limitModification(object, modifiableFieldPaths, modifier) {\n var clone = deepClone(object)\n var result = modifier(clone)\n each(objectEntries(modifiableFieldPaths), function (filedPaths) {\n var fieldPath = filedPaths[0]\n var fieldType = filedPaths[1]\n var newValue = get(clone, fieldPath)\n var newType = getType(newValue)\n if (newType === fieldType) {\n set(object, fieldPath, sanitize(newValue))\n } else if (\n fieldType === 'object' &&\n (newType === 'undefined' || newType === 'null')\n ) {\n set(object, fieldPath, {})\n }\n })\n\n return result\n}\n\nfunction get(object, path) {\n var current = object\n for (var field of path.split('.')) {\n if (!isValidObjectContaining(current, field)) {\n return\n }\n current = current[field]\n }\n return current\n}\n\nfunction set(object, path, value) {\n var current = object\n var fields = path.split('.')\n for (var i = 0; i < fields.length; i += 1) {\n var field = fields[i]\n if (!isValidObject(current)) {\n return\n }\n if (i !== fields.length - 1) {\n current = current[field]\n } else {\n current[field] = value\n }\n }\n}\n\nfunction isValidObject(object) {\n return getType(object) === 'object'\n}\n\nfunction isValidObjectContaining(object, field) {\n return (\n isValidObject(object) && Object.prototype.hasOwnProperty.call(object, field)\n )\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAD,OAAA;AAAqC,SAAAE,2BAAAC,CAAA,EAAAC,cAAA,QAAAC,EAAA,UAAAC,MAAA,oBAAAH,CAAA,CAAAG,MAAA,CAAAC,QAAA,KAAAJ,CAAA,qBAAAE,EAAA,QAAAG,KAAA,CAAAC,OAAA,CAAAN,CAAA,MAAAE,EAAA,GAAAK,2BAAA,CAAAP,CAAA,MAAAC,cAAA,IAAAD,CAAA,WAAAA,CAAA,CAAAQ,MAAA,qBAAAN,EAAA,EAAAF,CAAA,GAAAE,EAAA,MAAAO,CAAA,UAAAC,CAAA,YAAAA,EAAA,eAAAC,CAAA,EAAAD,CAAA,EAAAE,CAAA,WAAAA,EAAA,QAAAH,CAAA,IAAAT,CAAA,CAAAQ,MAAA,WAAAK,IAAA,mBAAAA,IAAA,SAAAC,KAAA,EAAAd,CAAA,CAAAS,CAAA,UAAAM,CAAA,WAAAA,EAAAC,EAAA,UAAAA,EAAA,KAAAC,CAAA,EAAAP,CAAA,gBAAAQ,SAAA,iJAAAC,gBAAA,SAAAC,MAAA,UAAAC,GAAA,WAAAV,CAAA,WAAAA,EAAA,IAAAT,EAAA,GAAAA,EAAA,CAAAoB,IAAA,CAAAtB,CAAA,MAAAY,CAAA,WAAAA,EAAA,QAAAW,IAAA,GAAArB,EAAA,CAAAsB,IAAA,IAAAL,gBAAA,GAAAI,IAAA,CAAAV,IAAA,SAAAU,IAAA,KAAAR,CAAA,WAAAA,EAAAU,GAAA,IAAAL,MAAA,SAAAC,GAAA,GAAAI,GAAA,KAAAR,CAAA,WAAAA,EAAA,eAAAE,gBAAA,IAAAjB,EAAA,oBAAAA,EAAA,8BAAAkB,MAAA,QAAAC,GAAA;AAAA,SAAAd,4BAAAP,CAAA,EAAA0B,MAAA,SAAA1B,CAAA,qBAAAA,CAAA,sBAAA2B,iBAAA,CAAA3B,CAAA,EAAA0B,MAAA,OAAAd,CAAA,GAAAgB,MAAA,CAAAC,SAAA,CAAAC,QAAA,CAAAR,IAAA,CAAAtB,CAAA,EAAA+B,KAAA,aAAAnB,CAAA,iBAAAZ,CAAA,CAAAgC,WAAA,EAAApB,CAAA,GAAAZ,CAAA,CAAAgC,WAAA,CAAAC,IAAA,MAAArB,CAAA,cAAAA,CAAA,mBAAAP,KAAA,CAAA6B,IAAA,CAAAlC,CAAA,OAAAY,CAAA,+DAAAuB,IAAA,CAAAvB,CAAA,UAAAe,iBAAA,CAAA3B,CAAA,EAAA0B,MAAA;AAAA,SAAAC,kBAAAS,GAAA,EAAAC,GAAA,QAAAA,GAAA,YAAAA,GAAA,GAAAD,GAAA,CAAA5B,MAAA,EAAA6B,GAAA,GAAAD,GAAA,CAAA5B,MAAA,WAAAC,CAAA,MAAA6B,IAAA,OAAAjC,KAAA,CAAAgC,GAAA,GAAA5B,CAAA,GAAA4B,GAAA,EAAA5B,CAAA,IAAA6B,IAAA,CAAA7B,CAAA,IAAA2B,GAAA,CAAA3B,CAAA,UAAA6B,IAAA;AAErC;AACA;AACA;AACA;AACO,SAASC,iBAAiBA,CAACC,MAAM,EAAEC,oBAAoB,EAAEC,QAAQ,EAAE;EACxE,IAAIC,KAAK,GAAG,IAAAC,gBAAS,EAACJ,MAAM,CAAC;EAC7B,IAAIK,MAAM,GAAGH,QAAQ,CAACC,KAAK,CAAC;EAC5B,IAAAG,WAAI,EAAC,IAAAC,oBAAa,EAACN,oBAAoB,CAAC,EAAE,UAAUO,UAAU,EAAE;IAC9D,IAAIC,SAAS,GAAGD,UAAU,CAAC,CAAC,CAAC;IAC7B,IAAIE,SAAS,GAAGF,UAAU,CAAC,CAAC,CAAC;IAC7B,IAAIG,QAAQ,GAAGC,GAAG,CAACT,KAAK,EAAEM,SAAS,CAAC;IACpC,IAAII,OAAO,GAAG,IAAAC,cAAO,EAACH,QAAQ,CAAC;IAC/B,IAAIE,OAAO,KAAKH,SAAS,EAAE;MACzBK,GAAG,CAACf,MAAM,EAAES,SAAS,EAAE,IAAAO,kBAAQ,EAACL,QAAQ,CAAC,CAAC;IAC5C,CAAC,MAAM,IACLD,SAAS,KAAK,QAAQ,KACrBG,OAAO,KAAK,WAAW,IAAIA,OAAO,KAAK,MAAM,CAAC,EAC/C;MACAE,GAAG,CAACf,MAAM,EAAES,SAAS,EAAE,CAAC,CAAC,CAAC;IAC5B;EACF,CAAC,CAAC;EAEF,OAAOJ,MAAM;AACf;AAEA,SAASO,GAAGA,CAACZ,MAAM,EAAEiB,IAAI,EAAE;EACzB,IAAIC,OAAO,GAAGlB,MAAM;EAAA,IAAAmB,SAAA,GAAA5D,0BAAA,CACF0D,IAAI,CAACG,KAAK,CAAC,GAAG,CAAC;IAAAC,KAAA;EAAA;IAAjC,KAAAF,SAAA,CAAAhD,CAAA,MAAAkD,KAAA,GAAAF,SAAA,CAAA/C,CAAA,IAAAC,IAAA,GAAmC;MAAA,IAA1BiD,KAAK,GAAAD,KAAA,CAAA/C,KAAA;MACZ,IAAI,CAACiD,uBAAuB,CAACL,OAAO,EAAEI,KAAK,CAAC,EAAE;QAC5C;MACF;MACAJ,OAAO,GAAGA,OAAO,CAACI,KAAK,CAAC;IAC1B;EAAC,SAAAzC,GAAA;IAAAsC,SAAA,CAAA5C,CAAA,CAAAM,GAAA;EAAA;IAAAsC,SAAA,CAAA1C,CAAA;EAAA;EACD,OAAOyC,OAAO;AAChB;AAEA,SAASH,GAAGA,CAACf,MAAM,EAAEiB,IAAI,EAAE3C,KAAK,EAAE;EAChC,IAAI4C,OAAO,GAAGlB,MAAM;EACpB,IAAIwB,MAAM,GAAGP,IAAI,CAACG,KAAK,CAAC,GAAG,CAAC;EAC5B,KAAK,IAAInD,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuD,MAAM,CAACxD,MAAM,EAAEC,CAAC,IAAI,CAAC,EAAE;IACzC,IAAIqD,KAAK,GAAGE,MAAM,CAACvD,CAAC,CAAC;IACrB,IAAI,CAACwD,aAAa,CAACP,OAAO,CAAC,EAAE;MAC3B;IACF;IACA,IAAIjD,CAAC,KAAKuD,MAAM,CAACxD,MAAM,GAAG,CAAC,EAAE;MAC3BkD,OAAO,GAAGA,OAAO,CAACI,KAAK,CAAC;IAC1B,CAAC,MAAM;MACLJ,OAAO,CAACI,KAAK,CAAC,GAAGhD,KAAK;IACxB;EACF;AACF;AAEA,SAASmD,aAAaA,CAACzB,MAAM,EAAE;EAC7B,OAAO,IAAAc,cAAO,EAACd,MAAM,CAAC,KAAK,QAAQ;AACrC;AAEA,SAASuB,uBAAuBA,CAACvB,MAAM,EAAEsB,KAAK,EAAE;EAC9C,OACEG,aAAa,CAACzB,MAAM,CAAC,IAAIZ,MAAM,CAACC,SAAS,CAACqC,cAAc,CAAC5C,IAAI,CAACkB,MAAM,EAAEsB,KAAK,CAAC;AAEhF","ignoreList":[]}
1
+ {"version":3,"file":"limitModification.js","names":["_tools","require","_sanitize","limitModification","object","modifiableFieldPaths","modifier","clone","deepClone","result","each","objectEntries","filedPaths","fieldPath","fieldType","newValue","get","newType","getType","set","sanitize","path","current","_i","_a","split","length","field","isValidObjectContaining","value","fields","i","isValidObject","Object","prototype","hasOwnProperty","call"],"sources":["../../src/helper/limitModification.js"],"sourcesContent":["import { extend2Lev, each, objectEntries, getType, deepClone } from './tools'\nimport { sanitize } from './sanitize'\n\n/**\n * Current limitation:\n * - field path do not support array, 'a.b.c' only\n */\nexport function limitModification(object, modifiableFieldPaths, modifier) {\n var clone = deepClone(object)\n var result = modifier(clone)\n each(objectEntries(modifiableFieldPaths), function (filedPaths) {\n var fieldPath = filedPaths[0]\n var fieldType = filedPaths[1]\n var newValue = get(clone, fieldPath)\n var newType = getType(newValue)\n if (newType === fieldType) {\n set(object, fieldPath, sanitize(newValue))\n } else if (\n fieldType === 'object' &&\n (newType === 'undefined' || newType === 'null')\n ) {\n set(object, fieldPath, {})\n }\n })\n\n return result\n}\n\nfunction get(object, path) {\n var current = object\n for (var _i = 0, _a = path.split('.'); _i < _a.length; _i++) {\n var field = _a[_i]\n if (!isValidObjectContaining(current, field)) {\n return\n }\n current = current[field]\n }\n return current\n}\n\nfunction set(object, path, value) {\n var current = object\n var fields = path.split('.')\n for (var i = 0; i < fields.length; i += 1) {\n var field = fields[i]\n if (!isValidObject(current)) {\n return\n }\n if (i !== fields.length - 1) {\n current = current[field]\n } else {\n current[field] = value\n }\n }\n}\n\nfunction isValidObject(object) {\n return getType(object) === 'object'\n}\n\nfunction isValidObjectContaining(object, field) {\n return (\n isValidObject(object) && Object.prototype.hasOwnProperty.call(object, field)\n )\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAD,OAAA;AAEA;AACA;AACA;AACA;AACO,SAASE,iBAAiBA,CAACC,MAAM,EAAEC,oBAAoB,EAAEC,QAAQ,EAAE;EACxE,IAAIC,KAAK,GAAG,IAAAC,gBAAS,EAACJ,MAAM,CAAC;EAC7B,IAAIK,MAAM,GAAGH,QAAQ,CAACC,KAAK,CAAC;EAC5B,IAAAG,WAAI,EAAC,IAAAC,oBAAa,EAACN,oBAAoB,CAAC,EAAE,UAAUO,UAAU,EAAE;IAC9D,IAAIC,SAAS,GAAGD,UAAU,CAAC,CAAC,CAAC;IAC7B,IAAIE,SAAS,GAAGF,UAAU,CAAC,CAAC,CAAC;IAC7B,IAAIG,QAAQ,GAAGC,GAAG,CAACT,KAAK,EAAEM,SAAS,CAAC;IACpC,IAAII,OAAO,GAAG,IAAAC,cAAO,EAACH,QAAQ,CAAC;IAC/B,IAAIE,OAAO,KAAKH,SAAS,EAAE;MACzBK,GAAG,CAACf,MAAM,EAAES,SAAS,EAAE,IAAAO,kBAAQ,EAACL,QAAQ,CAAC,CAAC;IAC5C,CAAC,MAAM,IACLD,SAAS,KAAK,QAAQ,KACrBG,OAAO,KAAK,WAAW,IAAIA,OAAO,KAAK,MAAM,CAAC,EAC/C;MACAE,GAAG,CAACf,MAAM,EAAES,SAAS,EAAE,CAAC,CAAC,CAAC;IAC5B;EACF,CAAC,CAAC;EAEF,OAAOJ,MAAM;AACf;AAEA,SAASO,GAAGA,CAACZ,MAAM,EAAEiB,IAAI,EAAE;EACzB,IAAIC,OAAO,GAAGlB,MAAM;EACpB,KAAK,IAAImB,EAAE,GAAG,CAAC,EAAEC,EAAE,GAAGH,IAAI,CAACI,KAAK,CAAC,GAAG,CAAC,EAAEF,EAAE,GAAGC,EAAE,CAACE,MAAM,EAAEH,EAAE,EAAE,EAAE;IAC3D,IAAII,KAAK,GAAGH,EAAE,CAACD,EAAE,CAAC;IAClB,IAAI,CAACK,uBAAuB,CAACN,OAAO,EAAEK,KAAK,CAAC,EAAE;MAC5C;IACF;IACAL,OAAO,GAAGA,OAAO,CAACK,KAAK,CAAC;EAC1B;EACA,OAAOL,OAAO;AAChB;AAEA,SAASH,GAAGA,CAACf,MAAM,EAAEiB,IAAI,EAAEQ,KAAK,EAAE;EAChC,IAAIP,OAAO,GAAGlB,MAAM;EACpB,IAAI0B,MAAM,GAAGT,IAAI,CAACI,KAAK,CAAC,GAAG,CAAC;EAC5B,KAAK,IAAIM,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,MAAM,CAACJ,MAAM,EAAEK,CAAC,IAAI,CAAC,EAAE;IACzC,IAAIJ,KAAK,GAAGG,MAAM,CAACC,CAAC,CAAC;IACrB,IAAI,CAACC,aAAa,CAACV,OAAO,CAAC,EAAE;MAC3B;IACF;IACA,IAAIS,CAAC,KAAKD,MAAM,CAACJ,MAAM,GAAG,CAAC,EAAE;MAC3BJ,OAAO,GAAGA,OAAO,CAACK,KAAK,CAAC;IAC1B,CAAC,MAAM;MACLL,OAAO,CAACK,KAAK,CAAC,GAAGE,KAAK;IACxB;EACF;AACF;AAEA,SAASG,aAAaA,CAAC5B,MAAM,EAAE;EAC7B,OAAO,IAAAc,cAAO,EAACd,MAAM,CAAC,KAAK,QAAQ;AACrC;AAEA,SAASwB,uBAAuBA,CAACxB,MAAM,EAAEuB,KAAK,EAAE;EAC9C,OACEK,aAAa,CAAC5B,MAAM,CAAC,IAAI6B,MAAM,CAACC,SAAS,CAACC,cAAc,CAACC,IAAI,CAAChC,MAAM,EAAEuB,KAAK,CAAC;AAEhF","ignoreList":[]}
@@ -0,0 +1,46 @@
1
+ "use strict";
2
+
3
+ Object.defineProperty(exports, "__esModule", {
4
+ value: true
5
+ });
6
+ exports.MAX_TASK_TIME = void 0;
7
+ exports.requestIdleCallback = requestIdleCallback;
8
+ exports.requestIdleCallbackShim = requestIdleCallbackShim;
9
+ var _timer = require("./timer");
10
+ var _monitor = require("./monitor");
11
+ var _tools = require("./tools");
12
+ /**
13
+ * 'requestIdleCallback' with a shim.
14
+ */
15
+ function requestIdleCallback(callback, opts) {
16
+ // Note: check both 'requestIdleCallback' and 'cancelIdleCallback' existence because some polyfills only implement 'requestIdleCallback'.
17
+ if (window.requestIdleCallback && window.cancelIdleCallback) {
18
+ var id = window.requestIdleCallback((0, _monitor.monitor)(callback), opts);
19
+ return function () {
20
+ return window.cancelIdleCallback(id);
21
+ };
22
+ }
23
+ return requestIdleCallbackShim(callback);
24
+ }
25
+ var MAX_TASK_TIME = 50;
26
+
27
+ /*
28
+ * Shim from https://developer.chrome.com/blog/using-requestidlecallback#checking_for_requestidlecallback
29
+ * Note: there is no simple way to support the "timeout" option, so we ignore it.
30
+ */
31
+ exports.MAX_TASK_TIME = MAX_TASK_TIME;
32
+ function requestIdleCallbackShim(callback) {
33
+ var start = (0, _tools.dateNow)();
34
+ var timeoutId = (0, _timer.setTimeout)(function () {
35
+ callback({
36
+ didTimeout: false,
37
+ timeRemaining: function timeRemaining() {
38
+ return Math.max(0, MAX_TASK_TIME - ((0, _tools.dateNow)() - start));
39
+ }
40
+ });
41
+ }, 0);
42
+ return function () {
43
+ return (0, _timer.clearTimeout)(timeoutId);
44
+ };
45
+ }
46
+ //# sourceMappingURL=requestIdleCallback.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"requestIdleCallback.js","names":["_timer","require","_monitor","_tools","requestIdleCallback","callback","opts","window","cancelIdleCallback","id","monitor","requestIdleCallbackShim","MAX_TASK_TIME","exports","start","dateNow","timeoutId","setTimeout","didTimeout","timeRemaining","Math","max","clearTimeout"],"sources":["../../src/helper/requestIdleCallback.js"],"sourcesContent":["import { setTimeout, clearTimeout } from './timer'\nimport { monitor } from './monitor'\nimport { dateNow } from './tools'\n\n/**\n * 'requestIdleCallback' with a shim.\n */\nexport function requestIdleCallback(callback, opts) {\n // Note: check both 'requestIdleCallback' and 'cancelIdleCallback' existence because some polyfills only implement 'requestIdleCallback'.\n if (window.requestIdleCallback && window.cancelIdleCallback) {\n const id = window.requestIdleCallback(monitor(callback), opts)\n return function () {\n return window.cancelIdleCallback(id)\n }\n }\n return requestIdleCallbackShim(callback)\n}\n\nexport const MAX_TASK_TIME = 50\n\n/*\n * Shim from https://developer.chrome.com/blog/using-requestidlecallback#checking_for_requestidlecallback\n * Note: there is no simple way to support the \"timeout\" option, so we ignore it.\n */\nexport function requestIdleCallbackShim(callback) {\n const start = dateNow()\n const timeoutId = setTimeout(function () {\n callback({\n didTimeout: false,\n timeRemaining: function () {\n return Math.max(0, MAX_TASK_TIME - (dateNow() - start))\n }\n })\n }, 0)\n return function () {\n return clearTimeout(timeoutId)\n }\n}\n"],"mappings":";;;;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,QAAA,GAAAD,OAAA;AACA,IAAAE,MAAA,GAAAF,OAAA;AAEA;AACA;AACA;AACO,SAASG,mBAAmBA,CAACC,QAAQ,EAAEC,IAAI,EAAE;EAClD;EACA,IAAIC,MAAM,CAACH,mBAAmB,IAAIG,MAAM,CAACC,kBAAkB,EAAE;IAC3D,IAAMC,EAAE,GAAGF,MAAM,CAACH,mBAAmB,CAAC,IAAAM,gBAAO,EAACL,QAAQ,CAAC,EAAEC,IAAI,CAAC;IAC9D,OAAO,YAAY;MACjB,OAAOC,MAAM,CAACC,kBAAkB,CAACC,EAAE,CAAC;IACtC,CAAC;EACH;EACA,OAAOE,uBAAuB,CAACN,QAAQ,CAAC;AAC1C;AAEO,IAAMO,aAAa,GAAG,EAAE;;AAE/B;AACA;AACA;AACA;AAHAC,OAAA,CAAAD,aAAA,GAAAA,aAAA;AAIO,SAASD,uBAAuBA,CAACN,QAAQ,EAAE;EAChD,IAAMS,KAAK,GAAG,IAAAC,cAAO,EAAC,CAAC;EACvB,IAAMC,SAAS,GAAG,IAAAC,iBAAU,EAAC,YAAY;IACvCZ,QAAQ,CAAC;MACPa,UAAU,EAAE,KAAK;MACjBC,aAAa,EAAE,SAAAA,cAAA,EAAY;QACzB,OAAOC,IAAI,CAACC,GAAG,CAAC,CAAC,EAAET,aAAa,IAAI,IAAAG,cAAO,EAAC,CAAC,GAAGD,KAAK,CAAC,CAAC;MACzD;IACF,CAAC,CAAC;EACJ,CAAC,EAAE,CAAC,CAAC;EACL,OAAO,YAAY;IACjB,OAAO,IAAAQ,mBAAY,EAACN,SAAS,CAAC;EAChC,CAAC;AACH","ignoreList":[]}
@@ -0,0 +1,59 @@
1
+ "use strict";
2
+
3
+ Object.defineProperty(exports, "__esModule", {
4
+ value: true
5
+ });
6
+ exports.MAX_EXECUTION_TIME_ON_TIMEOUT = void 0;
7
+ exports.createTaskQueue = createTaskQueue;
8
+ var _tools = require("./tools");
9
+ var _requestIdleCallback = require("./requestIdleCallback");
10
+ /**
11
+ * Maximum delay before starting to execute tasks in the queue. We don't want to wait too long
12
+ * before running tasks, as it might hurt reliability (ex: if the user navigates away, we might lose
13
+ * the opportunity to send some data). We also don't want to run tasks too often, as it might hurt
14
+ * performance.
15
+ */
16
+ var IDLE_CALLBACK_TIMEOUT = _tools.ONE_SECOND;
17
+
18
+ /**
19
+ * Maximum amount of time allocated to running tasks when a timeout (`IDLE_CALLBACK_TIMEOUT`) is
20
+ * reached. We should not run tasks for too long as it will hurt performance, but we should still
21
+ * run some tasks to avoid postponing them forever.
22
+ *
23
+ * Rational: Running tasks for 30ms every second (IDLE_CALLBACK_TIMEOUT) should be acceptable.
24
+ */
25
+ var MAX_EXECUTION_TIME_ON_TIMEOUT = 30;
26
+ exports.MAX_EXECUTION_TIME_ON_TIMEOUT = MAX_EXECUTION_TIME_ON_TIMEOUT;
27
+ function createTaskQueue() {
28
+ var pendingTasks = [];
29
+ function run(deadline) {
30
+ var executionTimeRemaining;
31
+ if (deadline.didTimeout) {
32
+ var start = performance.now();
33
+ executionTimeRemaining = function executionTimeRemaining() {
34
+ return MAX_EXECUTION_TIME_ON_TIMEOUT - (performance.now() - start);
35
+ };
36
+ } else {
37
+ executionTimeRemaining = deadline.timeRemaining.bind(deadline);
38
+ }
39
+ while (executionTimeRemaining() > 0 && pendingTasks.length) {
40
+ pendingTasks.shift()();
41
+ }
42
+ if (pendingTasks.length) {
43
+ scheduleNextRun();
44
+ }
45
+ }
46
+ function scheduleNextRun() {
47
+ (0, _requestIdleCallback.requestIdleCallback)(run, {
48
+ timeout: IDLE_CALLBACK_TIMEOUT
49
+ });
50
+ }
51
+ return {
52
+ push: function push(task) {
53
+ if (pendingTasks.push(task) === 1) {
54
+ scheduleNextRun();
55
+ }
56
+ }
57
+ };
58
+ }
59
+ //# sourceMappingURL=taskQueue.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"taskQueue.js","names":["_tools","require","_requestIdleCallback","IDLE_CALLBACK_TIMEOUT","ONE_SECOND","MAX_EXECUTION_TIME_ON_TIMEOUT","exports","createTaskQueue","pendingTasks","run","deadline","executionTimeRemaining","didTimeout","start","performance","now","timeRemaining","bind","length","shift","scheduleNextRun","requestIdleCallback","timeout","push","task"],"sources":["../../src/helper/taskQueue.js"],"sourcesContent":["import { ONE_SECOND } from './tools'\nimport { requestIdleCallback } from './requestIdleCallback'\n\n/**\n * Maximum delay before starting to execute tasks in the queue. We don't want to wait too long\n * before running tasks, as it might hurt reliability (ex: if the user navigates away, we might lose\n * the opportunity to send some data). We also don't want to run tasks too often, as it might hurt\n * performance.\n */\nconst IDLE_CALLBACK_TIMEOUT = ONE_SECOND\n\n/**\n * Maximum amount of time allocated to running tasks when a timeout (`IDLE_CALLBACK_TIMEOUT`) is\n * reached. We should not run tasks for too long as it will hurt performance, but we should still\n * run some tasks to avoid postponing them forever.\n *\n * Rational: Running tasks for 30ms every second (IDLE_CALLBACK_TIMEOUT) should be acceptable.\n */\nexport const MAX_EXECUTION_TIME_ON_TIMEOUT = 30\n\nexport function createTaskQueue() {\n const pendingTasks = []\n\n function run(deadline) {\n let executionTimeRemaining\n if (deadline.didTimeout) {\n const start = performance.now()\n executionTimeRemaining = function () {\n return MAX_EXECUTION_TIME_ON_TIMEOUT - (performance.now() - start)\n }\n } else {\n executionTimeRemaining = deadline.timeRemaining.bind(deadline)\n }\n\n while (executionTimeRemaining() > 0 && pendingTasks.length) {\n pendingTasks.shift()()\n }\n\n if (pendingTasks.length) {\n scheduleNextRun()\n }\n }\n\n function scheduleNextRun() {\n requestIdleCallback(run, { timeout: IDLE_CALLBACK_TIMEOUT })\n }\n\n return {\n push(task) {\n if (pendingTasks.push(task) === 1) {\n scheduleNextRun()\n }\n }\n }\n}\n"],"mappings":";;;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,oBAAA,GAAAD,OAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAME,qBAAqB,GAAGC,iBAAU;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMC,6BAA6B,GAAG,EAAE;AAAAC,OAAA,CAAAD,6BAAA,GAAAA,6BAAA;AAExC,SAASE,eAAeA,CAAA,EAAG;EAChC,IAAMC,YAAY,GAAG,EAAE;EAEvB,SAASC,GAAGA,CAACC,QAAQ,EAAE;IACrB,IAAIC,sBAAsB;IAC1B,IAAID,QAAQ,CAACE,UAAU,EAAE;MACvB,IAAMC,KAAK,GAAGC,WAAW,CAACC,GAAG,CAAC,CAAC;MAC/BJ,sBAAsB,GAAG,SAAAA,uBAAA,EAAY;QACnC,OAAON,6BAA6B,IAAIS,WAAW,CAACC,GAAG,CAAC,CAAC,GAAGF,KAAK,CAAC;MACpE,CAAC;IACH,CAAC,MAAM;MACLF,sBAAsB,GAAGD,QAAQ,CAACM,aAAa,CAACC,IAAI,CAACP,QAAQ,CAAC;IAChE;IAEA,OAAOC,sBAAsB,CAAC,CAAC,GAAG,CAAC,IAAIH,YAAY,CAACU,MAAM,EAAE;MAC1DV,YAAY,CAACW,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB;IAEA,IAAIX,YAAY,CAACU,MAAM,EAAE;MACvBE,eAAe,CAAC,CAAC;IACnB;EACF;EAEA,SAASA,eAAeA,CAAA,EAAG;IACzB,IAAAC,wCAAmB,EAACZ,GAAG,EAAE;MAAEa,OAAO,EAAEnB;IAAsB,CAAC,CAAC;EAC9D;EAEA,OAAO;IACLoB,IAAI,WAAAA,KAACC,IAAI,EAAE;MACT,IAAIhB,YAAY,CAACe,IAAI,CAACC,IAAI,CAAC,KAAK,CAAC,EAAE;QACjCJ,eAAe,CAAC,CAAC;MACnB;IACF;EACF,CAAC;AACH","ignoreList":[]}
@@ -1545,7 +1545,7 @@ function findByPath(source, path) {
1545
1545
  var pathArr = path.split('.');
1546
1546
  while (pathArr.length) {
1547
1547
  var key = pathArr.shift();
1548
- if (source && key in source && hasOwnProperty.call(source, key)) {
1548
+ if (source && isObject(source) && key in source && hasOwnProperty.call(source, key)) {
1549
1549
  source = source[key];
1550
1550
  } else {
1551
1551
  return undefined;